50203. Tetris
難度：3/51
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
static inline int max(int a, int b){
return ((a)>(b)?(a):(b));
}
int n;
int arr[100005] = {0};
int main(){
scanf("%d", &n);
int a, b;
while(scanf("%d %d", &a, &b) != EOF){
if(b == 0){
if(arr[a] - 1 > arr[a + 1] && arr[a] - 1 > arr[a + 2]){
int s = arr[a];
arr[a] = s + 1, arr[a + 1] = s + 1, arr[a + 2] = s;
}
else{
int s = max(arr[a + 1], arr[a + 2]);
arr[a] = s + 2, arr[a + 1] = s + 2, arr[a + 2] = s + 1;
}
}
else if(b == 1){
if(arr[a + 2] - 1 > arr[a] && arr[a + 2] - 1 > arr[a + 1]){
int s = arr[a + 2];
arr[a] = s, arr[a + 1] = s + 1, arr[a + 2] = s + 1;
}
else{
int s = max(arr[a], arr[a + 1]);
arr[a] = s + 1, arr[a + 1] = s + 2, arr[a + 2] = s + 2;
}
}
else if(b == 2){
int s = max(max(arr[a], arr[a + 1]), arr[a + 2]);
arr[a] = s + 1, arr[a + 1] = s + 2, arr[a + 2] = s + 1;
}
else if(b == 3){
if(arr[a] - arr[a + 1] < 1 && arr[a + 2] - arr[a + 1] < 1){
int s = arr[a + 1];
arr[a] = s + 2, arr[a + 1] = s + 2, arr[a + 2] = s + 2;
}
else{
int s = max(arr[a], arr[a + 2]);
arr[a] = s + 1, arr[a + 1] = s + 1, arr[a + 2] = s + 1;
}
}
}
for(int i = 0; i < n; i++){
printf("%d%c", arr[i], (i == n - 1) ? '\n' : ' ');
}
}