oj.uz

Submission #249756

# Submission time Handle Problem Language Result Execution time Memory
249756 2020-07-15T16:58:47 Z etienne Building 4 (JOI20_building4) C++14
100 / 100
 409 ms 45536 KB 
#include<cstdio>
#include <algorithm>
using namespace std;

const int oo=1e9;
int N;
int A[2*1000*1000][2];
int mini[2*1000*1000][2],maxi[2*1000*1000][2];
char res[2*1000*1000];

int main(){
	scanf("%d",&N);
	N*=2;
	for(int i=0;i<N;i++)scanf("%d", &A[i][0]);
	for(int i=0;i<N;i++)scanf("%d", &A[i][1]);
	for(int i=1;i<N;i++)mini[i][0]=mini[i][1]=+oo;
	for(int i=1;i<N;i++)maxi[i][0]=maxi[i][1]=-oo;
	mini[0][0]=maxi[0][0]=1;
	mini[0][1]=maxi[0][1]=-1;
	
	for(int i=1;i<N;i++){
		if(A[i][0]>=A[i-1][0]){
			mini[i][0]=min(mini[i][0], mini[i-1][0]+1);
			maxi[i][0]=max(maxi[i][0], maxi[i-1][0]+1);
		}
		if(A[i][0]>=A[i-1][1]){
			mini[i][0]=min(mini[i][0], mini[i-1][1]+1);
			maxi[i][0]=max(maxi[i][0], maxi[i-1][1]+1);
		}
		if(A[i][1]>=A[i-1][0]){
			mini[i][1]=min(mini[i][1], mini[i-1][0]-1);
			maxi[i][1]=max(maxi[i][1], maxi[i-1][0]-1);
		}
		if(A[i][1]>=A[i-1][1]){
			mini[i][1]=min(mini[i][1], mini[i-1][1]-1);
			maxi[i][1]=max(maxi[i][1], maxi[i-1][1]-1);
		}
	}
	int pos, nb;
	if(mini[N-1][0]<=0 && 0<=maxi[N-1][0]){
		pos=0;
		nb=-1;
		res[N-1]='A';
	}
	else if(mini[N-1][1]<=0 && 0<=maxi[N-1][1]){
		pos=1;
		nb=+1;
		res[N-1]='B';
	}
	else{
		printf("-1\n");
		return 0;
	}
	for(int i=N-2;i>=0;i--){
		if(A[i][0]<=A[i+1][pos]&&mini[i][0]<=nb&&nb<=maxi[i][0]){
			res[i]='A';
			pos=0;
			nb--;
		}
		else{
			res[i]='B';
			pos=1;
			nb++;
		}
	}
	printf("%s\n",res );
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
  ~~~~~^~~~~~~~~
building4.cpp:14:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<N;i++)scanf("%d", &A[i][0]);
                      ~~~~~^~~~~~~~~~~~~~~~
building4.cpp:15:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<N;i++)scanf("%d", &A[i][1]);
                      ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 508 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 508 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 386 ms 23480 KB Output is correct
35 Correct 354 ms 23928 KB Output is correct
36 Correct 350 ms 23548 KB Output is correct
37 Correct 349 ms 24124 KB Output is correct
38 Correct 325 ms 24212 KB Output is correct
39 Correct 316 ms 24312 KB Output is correct
40 Correct 330 ms 25720 KB Output is correct
41 Correct 269 ms 24568 KB Output is correct
42 Correct 356 ms 25080 KB Output is correct
43 Correct 379 ms 25848 KB Output is correct
44 Correct 384 ms 45100 KB Output is correct
45 Correct 393 ms 45176 KB Output is correct
46 Correct 349 ms 45208 KB Output is correct
47 Correct 349 ms 44312 KB Output is correct
48 Correct 332 ms 44044 KB Output is correct
49 Correct 338 ms 44920 KB Output is correct
50 Correct 409 ms 44348 KB Output is correct
51 Correct 379 ms 44280 KB Output is correct
52 Correct 259 ms 33404 KB Output is correct
53 Correct 254 ms 33528 KB Output is correct
54 Correct 239 ms 33384 KB Output is correct
55 Correct 245 ms 33148 KB Output is correct
56 Correct 341 ms 45536 KB Output is correct
57 Correct 285 ms 40232 KB Output is correct
58 Correct 305 ms 40328 KB Output is correct
59 Correct 297 ms 40552 KB Output is correct
60 Correct 268 ms 38388 KB Output is correct
61 Correct 283 ms 40784 KB Output is correct
62 Correct 289 ms 40276 KB Output is correct
63 Correct 292 ms 40820 KB Output is correct
64 Correct 272 ms 39380 KB Output is correct
65 Correct 291 ms 40924 KB Output is correct