Submission #221465

# Submission time Handle Problem Language Result Execution time Memory
221465 2020-04-10T08:07:57 Z patrikpavic2 Building 4 (JOI20_building4) C++17
100 / 100
483 ms 48376 KB
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1e6 + 500;

int L[N][2], R[N][2];
int A[N][2], ans[N], n;

void rekonstrukcija(int j){
	int cur = n;
	for(int i = 2 * n - 1;i >= 0;i--){
		ans[i] = j;
		cur -= j;
		//printf("cur = %d, i = %d\n", cur, i);
		if(A[i][j] >= A[i - 1][0] && L[i - 1][0] != -1 && L[i - 1][0] <= cur && R[i - 1][0] >= cur)
			j = 0;
		else
			j = 1;
	}
	for(int i = 0;i < 2 * n;i++)
		printf("%c", 'A' + ans[i]);
	printf("\n");
}

int main(){
	scanf("%d", &n);
	for(int j = 0;j < 2;j++)
		for(int i = 0;i < 2 * n;i++)
			scanf("%d", &A[i][j]);
	L[0][0] = 0, R[0][0] = 0;
	L[0][1] = 1, R[0][1] = 1;
	for(int i = 1;i < 2 * n;i++){
		for(int j = 0;j < 2;j++){
			L[i][j] = -1;
			if(A[i][j] >= A[i - 1][0] && L[i - 1][0] != -1){
				L[i][j] = L[i - 1][0];
				R[i][j] = R[i - 1][0];
			}
			if(A[i][j] >= A[i - 1][1] && L[i - 1][1] != -1){
				if(L[i][j] == -1){
					L[i][j] = L[i - 1][1];
					R[i][j] = R[i - 1][1];
				}
				else{
					L[i][j] = min(L[i - 1][1], L[i][j]);
					R[i][j] = max(R[i - 1][1], R[i][j]);
				}
			}
			if(L[i][j] != -1)
				L[i][j] += j, R[i][j] += j;
				//printf("%d, %d => [%d %d]\n", i, j, L[i][j], R[i][j]);
		}
	}
	if(L[2 * n - 1][0] != -1 && L[2 * n - 1][0] <= n && R[2 * n - 1][0] >= n)
		rekonstrukcija(0);
	else if(L[2 * n - 1][1] != -1 && L[2 * n - 1][1] <= n && R[2 * n - 1][1] >= n)
		rekonstrukcija(1);
	else
		printf("-1\n");
	return 0;
}


















Compilation message

building4.cpp: In function 'int main()':
building4.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
building4.cpp:32:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &A[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 8 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 8 ms 512 KB Output is correct
27 Correct 7 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 11 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 8 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 8 ms 512 KB Output is correct
27 Correct 7 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 11 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 428 ms 34680 KB Output is correct
35 Correct 444 ms 44584 KB Output is correct
36 Correct 443 ms 43872 KB Output is correct
37 Correct 440 ms 44792 KB Output is correct
38 Correct 404 ms 44664 KB Output is correct
39 Correct 401 ms 43896 KB Output is correct
40 Correct 432 ms 47352 KB Output is correct
41 Correct 364 ms 45048 KB Output is correct
42 Correct 438 ms 46452 KB Output is correct
43 Correct 469 ms 47988 KB Output is correct
44 Correct 451 ms 47992 KB Output is correct
45 Correct 483 ms 47988 KB Output is correct
46 Correct 439 ms 47960 KB Output is correct
47 Correct 427 ms 47196 KB Output is correct
48 Correct 412 ms 47108 KB Output is correct
49 Correct 421 ms 47708 KB Output is correct
50 Correct 456 ms 47196 KB Output is correct
51 Correct 460 ms 47260 KB Output is correct
52 Correct 336 ms 36476 KB Output is correct
53 Correct 324 ms 36340 KB Output is correct
54 Correct 293 ms 36344 KB Output is correct
55 Correct 315 ms 36076 KB Output is correct
56 Correct 417 ms 48376 KB Output is correct
57 Correct 365 ms 43148 KB Output is correct
58 Correct 370 ms 43208 KB Output is correct
59 Correct 367 ms 43208 KB Output is correct
60 Correct 346 ms 41088 KB Output is correct
61 Correct 380 ms 43740 KB Output is correct
62 Correct 365 ms 43108 KB Output is correct
63 Correct 389 ms 43844 KB Output is correct
64 Correct 368 ms 42264 KB Output is correct
65 Correct 370 ms 43692 KB Output is correct