oj.uz

답안 #253273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
253273 2020-07-27T15:05:24 Z Lawliet 건물 4 (JOI20_building4) C++17
100 / 100
 487 ms 36728 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1000010;
const int INF = 1000000010;

int n;

int v[MAXN][2];
int dp[MAXN][2];

void solveDP(int p)
{
	for(int i = 2*n ; i > 0 ; i--)
	{
		for(int j = 0 ; j < 2 ; j++)
		{
			dp[i][j] = -INF;

			for(int nxt = 0 ; nxt < 2 ; nxt++)
			{
				int curValue = dp[i + 1][nxt];
				if( nxt == p ) curValue++;

				if( v[i - 1][j] <= v[i][nxt] )
					dp[i][j] = max( dp[i][j] , curValue );
			}
		}
	}
}

int main()
{
	scanf("%d",&n);

	for(int k = 0 ; k < 2 ; k++)
		for(int i = 1 ; i <= 2*n ; i++)
			scanf("%d",&v[i][k]);

	for(int k = 1 ; k >= 0 ; k--)
	{
		solveDP( k );

		if( dp[1][0] < n )
		{
			printf("-1\n");
			return 0;
		}
	}

	int last = 0;
	int remainA = n;

	for(int i = 1 ; i <= 2*n ; i++)
	{
		if( dp[i + 1][1] >= remainA && v[i][1] >= last )
		{
			printf("B");
			last = v[i][1];
		}
		else
		{
			printf("A");

			remainA--;
			last = v[i][0];
		}
	}
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
building4.cpp:39:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&v[i][k]);
    ~~~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 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 512 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 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 512 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 382 ms 34720 KB Output is correct
35 Correct 402 ms 33896 KB Output is correct
36 Correct 392 ms 33144 KB Output is correct
37 Correct 487 ms 33912 KB Output is correct
38 Correct 348 ms 33912 KB Output is correct
39 Correct 344 ms 33016 KB Output is correct
40 Correct 361 ms 35884 KB Output is correct
41 Correct 316 ms 33912 KB Output is correct
42 Correct 402 ms 35040 KB Output is correct
43 Correct 415 ms 36348 KB Output is correct
44 Correct 416 ms 36300 KB Output is correct
45 Correct 419 ms 36344 KB Output is correct
46 Correct 362 ms 36344 KB Output is correct
47 Correct 366 ms 35448 KB Output is correct
48 Correct 356 ms 35212 KB Output is correct
49 Correct 369 ms 36088 KB Output is correct
50 Correct 412 ms 35448 KB Output is correct
51 Correct 428 ms 35488 KB Output is correct
52 Correct 307 ms 24612 KB Output is correct
53 Correct 316 ms 24568 KB Output is correct
54 Correct 277 ms 24644 KB Output is correct
55 Correct 261 ms 24312 KB Output is correct
56 Correct 373 ms 36728 KB Output is correct
57 Correct 316 ms 31352 KB Output is correct
58 Correct 309 ms 31612 KB Output is correct
59 Correct 307 ms 31608 KB Output is correct
60 Correct 294 ms 30072 KB Output is correct
61 Correct 317 ms 31992 KB Output is correct
62 Correct 307 ms 31608 KB Output is correct
63 Correct 325 ms 31992 KB Output is correct
64 Correct 313 ms 30968 KB Output is correct
65 Correct 320 ms 32032 KB Output is correct