oj.uz

답안 #219039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219039 2020-04-03T12:56:31 Z Nightlight 건물 4 (JOI20_building4) C++14
100 / 100
 454 ms 105928 KB 
#include <cstdio>
#include <stdlib.h>
#include <utility>
#include <algorithm>
#define mn first
#define mx second
using namespace std;

int N;
int A[1000005][2];
bool vis[1000005][2];
pair<int, int> dp[1000005][2];

void DFS(int u, int i) {
  if(vis[u][i]) return;
  vis[u][i] = 1;
  int mn = 2000000000, mx = -2000000000;
  if(A[u][i] <= A[u + 1][0]) {
    DFS(u + 1, 0);
    mn = min(dp[u + 1][0].mn + 1, mn);
    mx = max(dp[u + 1][0].mx + 1, mx);
  }
  if(A[u][i] <= A[u + 1][1]) {
    DFS(u + 1, 1);
    mn = min(dp[u + 1][1].mn, mn);
    mx = max(dp[u + 1][1].mx, mx);
  } 
  dp[u][i] = make_pair(mn, mx);
}

void backtrack() {
  if(dp[0][0] == make_pair(2000000000, -2000000000) || dp[0][0].mn > N >> 1 || dp[0][0].mx < N >> 1) {
    puts("-1");
    exit(0);
  }
  int last = 0, cur = N >> 1;
  for(int i = 0; i < N; i++) {
    if(A[i][last] <= A[i + 1][0] && dp[i + 1][0].mn <= cur - 1 && cur - 1 <= dp[i + 1][0].mx) {
      last = 0; cur--;
      putchar('A');
      continue;
    }
    last = 1;
    putchar('B');
  }
}

int main() {
  scanf("%d", &N);
  N <<= 1;
  for(int i = 1; i <= N; i++) {
    scanf("%d", &A[i][0]);
  }
  for(int i = 1; i <= N; i++) {
    scanf("%d", &A[i][1]);
  }
  vis[N][0] = 1, vis[N][1] = 1;
  dp[N][0] = make_pair(0, 0), dp[N][1] = make_pair(0, 0);
  DFS(0, 0);
  backtrack();
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
   ~~~~~^~~~~~~~~~
building4.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &A[i][0]);
     ~~~~~^~~~~~~~~~~~~~~~
building4.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &A[i][1]);
     ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 6 ms 768 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 6 ms 768 KB Output is correct
14 Correct 6 ms 768 KB Output is correct
15 Correct 7 ms 768 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 6 ms 768 KB Output is correct
18 Correct 6 ms 768 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 6 ms 760 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 6 ms 768 KB Output is correct
27 Correct 6 ms 768 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 6 ms 768 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 5 ms 640 KB Output is correct
33 Correct 6 ms 768 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 6 ms 768 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 6 ms 768 KB Output is correct
14 Correct 6 ms 768 KB Output is correct
15 Correct 7 ms 768 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 6 ms 768 KB Output is correct
18 Correct 6 ms 768 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 6 ms 760 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 6 ms 768 KB Output is correct
27 Correct 6 ms 768 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 6 ms 768 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 5 ms 640 KB Output is correct
33 Correct 6 ms 768 KB Output is correct
34 Correct 357 ms 8392 KB Output is correct
35 Correct 421 ms 97528 KB Output is correct
36 Correct 412 ms 96124 KB Output is correct
37 Correct 411 ms 98040 KB Output is correct
38 Correct 395 ms 97912 KB Output is correct
39 Correct 377 ms 98424 KB Output is correct
40 Correct 408 ms 104724 KB Output is correct
41 Correct 403 ms 99960 KB Output is correct
42 Correct 408 ms 101752 KB Output is correct
43 Correct 441 ms 105080 KB Output is correct
44 Correct 453 ms 105336 KB Output is correct
45 Correct 443 ms 105208 KB Output is correct
46 Correct 418 ms 105208 KB Output is correct
47 Correct 405 ms 105208 KB Output is correct
48 Correct 404 ms 105212 KB Output is correct
49 Correct 418 ms 105208 KB Output is correct
50 Correct 439 ms 105208 KB Output is correct
51 Correct 454 ms 105208 KB Output is correct
52 Correct 326 ms 105928 KB Output is correct
53 Correct 325 ms 105848 KB Output is correct
54 Correct 321 ms 105720 KB Output is correct
55 Correct 317 ms 105872 KB Output is correct
56 Correct 438 ms 105080 KB Output is correct
57 Correct 377 ms 104952 KB Output is correct
58 Correct 381 ms 105464 KB Output is correct
59 Correct 359 ms 105336 KB Output is correct
60 Correct 340 ms 99012 KB Output is correct
61 Correct 356 ms 105336 KB Output is correct
62 Correct 363 ms 103636 KB Output is correct
63 Correct 361 ms 105208 KB Output is correct
64 Correct 358 ms 101624 KB Output is correct
65 Correct 352 ms 105080 KB Output is correct