oj.uz

답안 #442493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442493 2021-07-08T03:08:42 Z kig9981 건물 4 (JOI20_building4) C++17
100 / 100
 321 ms 45396 KB 
#include <bits/stdc++.h>

#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif

using namespace std;

int A[1000001][2], L[1000001][2], R[1000001][2];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	TEST(freopen("input.txt","r",stdin));
	TEST(freopen("output.txt","w",stdout));
	TEST(freopen("debug.txt","w",stderr));
	int N, v, b=0;
	string ans;
	cin>>N; memset(L,0x7f,sizeof(L)); memset(R,0x80,sizeof(R));
	L[0][0]=L[0][1]=R[0][0]=R[0][1]=0;
	for(int i=1;i<=2*N;i++) cin>>A[i][0];
	for(int i=1;i<=2*N;i++) {
		cin>>A[i][1];
		for(int j=0;j<2;j++) if(L[i-1][j]<=R[i-1][j]) for(int k=0;k<2;k++) if(A[i-1][j]<=A[i][k]) {
			L[i][k]=min(L[i][k],L[i-1][j]+(k ? 1:-1));
			R[i][k]=max(R[i][k],R[i-1][j]+(k ? 1:-1));
		}
	}
	if(L[2*N][0]<=0 && 0<=R[2*N][0]) v=0;
	else if(L[2*N][1]<=0 && 0<=R[2*N][1]) v=1;
	else {
		cout<<"-1\n";
		return 0;
	}
	for(int i=2*N;--i;) {
		ans.push_back('A'+v);
		b-=v ? 1:-1;
		for(int j=0;j<2;j++) if(A[i][j]<=A[i+1][v] && L[i][j]<=b && b<=R[i][j]) {
			v=j;
			break;
		}
	}
	ans.push_back('A'+v);
	reverse(ans.begin(),ans.end());
	cout<<ans<<'\n';
	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 15948 KB Output is correct
2 Correct 7 ms 15948 KB Output is correct
3 Correct 7 ms 15948 KB Output is correct
4 Correct 7 ms 15948 KB Output is correct
5 Correct 8 ms 16060 KB Output is correct
6 Correct 9 ms 16076 KB Output is correct
7 Correct 8 ms 16076 KB Output is correct
8 Correct 9 ms 16076 KB Output is correct
9 Correct 11 ms 16076 KB Output is correct
10 Correct 9 ms 16048 KB Output is correct
11 Correct 8 ms 16076 KB Output is correct
12 Correct 9 ms 16076 KB Output is correct
13 Correct 8 ms 15988 KB Output is correct
14 Correct 9 ms 16020 KB Output is correct
15 Correct 9 ms 16088 KB Output is correct
16 Correct 9 ms 16076 KB Output is correct
17 Correct 10 ms 16096 KB Output is correct
18 Correct 8 ms 16088 KB Output is correct
19 Correct 8 ms 16080 KB Output is correct
20 Correct 8 ms 15948 KB Output is correct
21 Correct 8 ms 15948 KB Output is correct
22 Correct 9 ms 16056 KB Output is correct
23 Correct 10 ms 15948 KB Output is correct
24 Correct 9 ms 16096 KB Output is correct
25 Correct 9 ms 16084 KB Output is correct
26 Correct 8 ms 16032 KB Output is correct
27 Correct 8 ms 16076 KB Output is correct
28 Correct 8 ms 15948 KB Output is correct
29 Correct 8 ms 15948 KB Output is correct
30 Correct 8 ms 15948 KB Output is correct
31 Correct 8 ms 16016 KB Output is correct
32 Correct 8 ms 15948 KB Output is correct
33 Correct 8 ms 16032 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 15948 KB Output is correct
2 Correct 7 ms 15948 KB Output is correct
3 Correct 7 ms 15948 KB Output is correct
4 Correct 7 ms 15948 KB Output is correct
5 Correct 8 ms 16060 KB Output is correct
6 Correct 9 ms 16076 KB Output is correct
7 Correct 8 ms 16076 KB Output is correct
8 Correct 9 ms 16076 KB Output is correct
9 Correct 11 ms 16076 KB Output is correct
10 Correct 9 ms 16048 KB Output is correct
11 Correct 8 ms 16076 KB Output is correct
12 Correct 9 ms 16076 KB Output is correct
13 Correct 8 ms 15988 KB Output is correct
14 Correct 9 ms 16020 KB Output is correct
15 Correct 9 ms 16088 KB Output is correct
16 Correct 9 ms 16076 KB Output is correct
17 Correct 10 ms 16096 KB Output is correct
18 Correct 8 ms 16088 KB Output is correct
19 Correct 8 ms 16080 KB Output is correct
20 Correct 8 ms 15948 KB Output is correct
21 Correct 8 ms 15948 KB Output is correct
22 Correct 9 ms 16056 KB Output is correct
23 Correct 10 ms 15948 KB Output is correct
24 Correct 9 ms 16096 KB Output is correct
25 Correct 9 ms 16084 KB Output is correct
26 Correct 8 ms 16032 KB Output is correct
27 Correct 8 ms 16076 KB Output is correct
28 Correct 8 ms 15948 KB Output is correct
29 Correct 8 ms 15948 KB Output is correct
30 Correct 8 ms 15948 KB Output is correct
31 Correct 8 ms 16016 KB Output is correct
32 Correct 8 ms 15948 KB Output is correct
33 Correct 8 ms 16032 KB Output is correct
34 Correct 313 ms 42620 KB Output is correct
35 Correct 277 ms 43080 KB Output is correct
36 Correct 275 ms 42616 KB Output is correct
37 Correct 273 ms 43268 KB Output is correct
38 Correct 260 ms 43136 KB Output is correct
39 Correct 261 ms 42284 KB Output is correct
40 Correct 286 ms 44840 KB Output is correct
41 Correct 268 ms 43084 KB Output is correct
42 Correct 283 ms 44180 KB Output is correct
43 Correct 301 ms 45200 KB Output is correct
44 Correct 305 ms 45392 KB Output is correct
45 Correct 321 ms 45244 KB Output is correct
46 Correct 283 ms 45244 KB Output is correct
47 Correct 309 ms 44348 KB Output is correct
48 Correct 291 ms 44324 KB Output is correct
49 Correct 313 ms 44976 KB Output is correct
50 Correct 300 ms 44404 KB Output is correct
51 Correct 284 ms 44384 KB Output is correct
52 Correct 208 ms 33468 KB Output is correct
53 Correct 211 ms 33500 KB Output is correct
54 Correct 197 ms 33596 KB Output is correct
55 Correct 199 ms 33212 KB Output is correct
56 Correct 272 ms 45396 KB Output is correct
57 Correct 237 ms 40432 KB Output is correct
58 Correct 237 ms 40536 KB Output is correct
59 Correct 242 ms 40384 KB Output is correct
60 Correct 240 ms 39400 KB Output is correct
61 Correct 240 ms 40944 KB Output is correct
62 Correct 252 ms 40548 KB Output is correct
63 Correct 253 ms 40932 KB Output is correct
64 Correct 279 ms 39992 KB Output is correct
65 Correct 243 ms 40912 KB Output is correct