oj.uz

답안 #212297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212297 2020-03-22T16:43:14 Z arnold518 건물 4 (JOI20_building4) C++14
100 / 100
 453 ms 29048 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e6;

int N, A[MAXN+10], B[MAXN+10];
int dpl[MAXN+10][2], dpr[MAXN+10][2];

int main()
{
	int i, j, k;

	scanf("%d", &N);
	for(i=1; i<=N*2; i++) scanf("%d", &A[i]);
	for(i=1; i<=N*2; i++) scanf("%d", &B[i]);

	dpl[1][0]=dpr[1][0]=1;
	dpl[1][1]=dpr[1][1]=0;
	for(i=2; i<=N*2; i++)
	{
		dpl[i][0]=dpl[i][1]=987654321;
		dpr[i][0]=dpr[i][1]=-1;
		if(A[i-1]<=A[i])
		{
			dpl[i][0]=min(dpl[i][0], dpl[i-1][0]+1);
			dpr[i][0]=max(dpr[i][0], dpr[i-1][0]+1);
		}
		if(B[i-1]<=A[i])
		{
			dpl[i][0]=min(dpl[i][0], dpl[i-1][1]+1);
			dpr[i][0]=max(dpr[i][0], dpr[i-1][1]+1);	
		}
		if(A[i-1]<=B[i])
		{
			dpl[i][1]=min(dpl[i][1], dpl[i-1][0]);
			dpr[i][1]=max(dpr[i][1], dpr[i-1][0]);
		}
		if(B[i-1]<=B[i])
		{
			dpl[i][1]=min(dpl[i][1], dpl[i-1][1]);
			dpr[i][1]=max(dpr[i][1], dpr[i-1][1]);	
		}
	}

	int p, q=N;

	if(dpl[2*N][0]<=N && N<=dpr[2*N][0]) p=0;
	else if(dpl[2*N][1]<=N && N<=dpr[2*N][1]) p=1;
	else return !printf("-1\n");

	vector<int> ans;
	for(i=2*N; i>=1; i--)
	{
		ans.push_back(p);
		if(p==0)
		{
			q--;
			if(A[i-1]<=A[i] && dpl[i-1][0]<=q && q<=dpr[i-1][0]) p=0;
			if(B[i-1]<=A[i] && dpl[i-1][1]<=q && q<=dpr[i-1][1]) p=1;
		}
		else
		{
			if(A[i-1]<=B[i] && dpl[i-1][0]<=q && q<=dpr[i-1][0]) p=0;
			if(B[i-1]<=B[i] && dpl[i-1][1]<=q && q<=dpr[i-1][1]) p=1;
		}
	}
	reverse(ans.begin(), ans.end());
	for(auto it : ans) printf("%c", it ? 'B' : 'A');
	printf("\n");
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:15:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j, k;
         ^
building4.cpp:15:12: warning: unused variable 'k' [-Wunused-variable]
  int i, j, k;
            ^
building4.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
building4.cpp:18:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N*2; i++) scanf("%d", &A[i]);
                        ~~~~~^~~~~~~~~~~~~
building4.cpp:19:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N*2; i++) scanf("%d", &B[i]);
                        ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 384 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 5 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 6 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 6 ms 384 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 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 5 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 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 7 ms 512 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 6 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 384 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 5 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 6 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 6 ms 384 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 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 5 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 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 7 ms 512 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 394 ms 23396 KB Output is correct
35 Correct 392 ms 26844 KB Output is correct
36 Correct 390 ms 26336 KB Output is correct
37 Correct 400 ms 26972 KB Output is correct
38 Correct 365 ms 26980 KB Output is correct
39 Correct 356 ms 27084 KB Output is correct
40 Correct 388 ms 28808 KB Output is correct
41 Correct 328 ms 27484 KB Output is correct
42 Correct 384 ms 27996 KB Output is correct
43 Correct 421 ms 28892 KB Output is correct
44 Correct 429 ms 28892 KB Output is correct
45 Correct 453 ms 28892 KB Output is correct
46 Correct 411 ms 29028 KB Output is correct
47 Correct 408 ms 29020 KB Output is correct
48 Correct 380 ms 29020 KB Output is correct
49 Correct 378 ms 28892 KB Output is correct
50 Correct 422 ms 29024 KB Output is correct
51 Correct 427 ms 28924 KB Output is correct
52 Correct 312 ms 29024 KB Output is correct
53 Correct 322 ms 28896 KB Output is correct
54 Correct 284 ms 28892 KB Output is correct
55 Correct 307 ms 29048 KB Output is correct
56 Correct 400 ms 28896 KB Output is correct
57 Correct 327 ms 28768 KB Output is correct
58 Correct 318 ms 28892 KB Output is correct
59 Correct 370 ms 28940 KB Output is correct
60 Correct 336 ms 27232 KB Output is correct
61 Correct 366 ms 28892 KB Output is correct
62 Correct 368 ms 28512 KB Output is correct
63 Correct 338 ms 29020 KB Output is correct
64 Correct 323 ms 27868 KB Output is correct
65 Correct 337 ms 28892 KB Output is correct