Submission #211501

# Submission time Handle Problem Language Result Execution time Memory
211501 2020-03-20T15:50:22 Z Pajaraja Building 4 (JOI20_building4) C++17
100 / 100
425 ms 27780 KB
#include <bits/stdc++.h>
#define MAXN 500007
using namespace std;
int mn[2][2*MAXN],mx[2][2*MAXN],a[2][2*MAXN];
bool mz[2][2*MAXN];
char rc[2*MAXN];
void reconstruct(int k,int ind,int val)
{
	rc[ind]='A'+k;
	if(!ind) return;
	for(int t=0;t<2;t++) if(a[t][ind-1]<=a[k][ind] && mn[t][ind-1]<=val-k && mx[t][ind-1]>=val-k) {reconstruct(t,ind-1,val-k); return;}
}
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<2*n;i++) scanf("%d",&a[0][i]);
	for(int i=0;i<2*n;i++) scanf("%d",&a[1][i]);
	mz[0][0]=mz[1][0]=true;
	mn[0][0]=mx[0][0]=0;
	mn[1][0]=mx[1][0]=1;
	for(int i=1;i<2*n;i++) mn[0][i]=mn[1][i]=2*n+12;
	for(int i=1;i<2*n;i++) for(int j=0;j<2;j++) for(int k=0;k<2;k++) if(a[k][i-1]<=a[j][i] && mz[k][i-1]) 
	{
		mz[j][i]=true; 
		mn[j][i]=min(mn[j][i],mn[k][i-1]+j);
		mx[j][i]=max(mx[j][i],mx[k][i-1]+j);
	}
	for(int t=0;t<2;t++) if(mn[t][2*n-1]<=n && mx[t][2*n-1]>=n && mz[t][2*n-1])
	{
		reconstruct(t,2*n-1,n);
		for(int i=0;i<2*n;i++) printf("%c",rc[i]);
		return 0;
	}
	printf("-1");
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
building4.cpp:17:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<2*n;i++) scanf("%d",&a[0][i]);
                         ~~~~~^~~~~~~~~~~~~~~
building4.cpp:18:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<2*n;i++) scanf("%d",&a[1][i]);
                         ~~~~~^~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 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 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 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 7 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 7 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 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 5 ms 512 KB Output is correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 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 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 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 7 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 7 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 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 5 ms 512 KB Output is correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 385 ms 15792 KB Output is correct
35 Correct 394 ms 25804 KB Output is correct
36 Correct 386 ms 25368 KB Output is correct
37 Correct 397 ms 25960 KB Output is correct
38 Correct 366 ms 26104 KB Output is correct
39 Correct 348 ms 26104 KB Output is correct
40 Correct 367 ms 27640 KB Output is correct
41 Correct 319 ms 26488 KB Output is correct
42 Correct 383 ms 26976 KB Output is correct
43 Correct 425 ms 27768 KB Output is correct
44 Correct 424 ms 27732 KB Output is correct
45 Correct 420 ms 27768 KB Output is correct
46 Correct 364 ms 27768 KB Output is correct
47 Correct 371 ms 27768 KB Output is correct
48 Correct 356 ms 27744 KB Output is correct
49 Correct 362 ms 27780 KB Output is correct
50 Correct 410 ms 27768 KB Output is correct
51 Correct 410 ms 27768 KB Output is correct
52 Correct 316 ms 27768 KB Output is correct
53 Correct 311 ms 27768 KB Output is correct
54 Correct 282 ms 27768 KB Output is correct
55 Correct 310 ms 27768 KB Output is correct
56 Correct 370 ms 27744 KB Output is correct
57 Correct 325 ms 27616 KB Output is correct
58 Correct 325 ms 27744 KB Output is correct
59 Correct 323 ms 27768 KB Output is correct
60 Correct 298 ms 26104 KB Output is correct
61 Correct 317 ms 27768 KB Output is correct
62 Correct 322 ms 27384 KB Output is correct
63 Correct 329 ms 27744 KB Output is correct
64 Correct 321 ms 26848 KB Output is correct
65 Correct 334 ms 27768 KB Output is correct