oj.uz

답안 #219037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219037 2020-04-03T12:52:01 Z Nightlight 건물 4 (JOI20_building4) C++14
100 / 100
 518 ms 125672 KB 
#include <bits/stdc++.h>
#define mn first
#define mx second
using namespace std;

int N;
int fix[1000005][2];
//apakah fixed
int to[1000005][2];
//menyimpan lokasi bridge terdekat (A ke B) dan (B ke A)
int A[1000005][2];
//tinggi building
int b[2];
//banyak yang diperlukan untuk setiap A B
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);
}

string ans;

void backtrack() {
  if(dp[0][0] == make_pair(2000000000, -2000000000) || dp[0][0].mn > N/2 || dp[0][0].mx < N/2) {
    puts("-1");
    exit(0);
  }
  int last = 0, cur = N / 2;
  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--;
      ans += 'A';
      continue;
    }
    if(A[i][last] <= A[i + 1][1] && dp[i + 1][1].mn <= cur && cur <= dp[i + 1][1].mx) {
      last = 1;
      ans += 'B';
    }
  }
  cout << ans << "\n";
}

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:58:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
   ~~~~~^~~~~~~~~~
building4.cpp:61: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:64: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 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 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 6 ms 768 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 768 KB Output is correct
11 Correct 8 ms 768 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 7 ms 896 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 6 ms 896 KB Output is correct
18 Correct 7 ms 896 KB Output is correct
19 Correct 6 ms 896 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 7 ms 896 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 6 ms 896 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 7 ms 768 KB Output is correct
33 Correct 6 ms 768 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 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 6 ms 768 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 768 KB Output is correct
11 Correct 8 ms 768 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 7 ms 896 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 6 ms 896 KB Output is correct
18 Correct 7 ms 896 KB Output is correct
19 Correct 6 ms 896 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 7 ms 896 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 6 ms 896 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 7 ms 768 KB Output is correct
33 Correct 6 ms 768 KB Output is correct
34 Correct 395 ms 27000 KB Output is correct
35 Correct 456 ms 116400 KB Output is correct
36 Correct 426 ms 114480 KB Output is correct
37 Correct 429 ms 116912 KB Output is correct
38 Correct 419 ms 116780 KB Output is correct
39 Correct 408 ms 116400 KB Output is correct
40 Correct 449 ms 124584 KB Output is correct
41 Correct 417 ms 118828 KB Output is correct
42 Correct 446 ms 121448 KB Output is correct
43 Correct 489 ms 125548 KB Output is correct
44 Correct 518 ms 125544 KB Output is correct
45 Correct 491 ms 125452 KB Output is correct
46 Correct 441 ms 125416 KB Output is correct
47 Correct 429 ms 124652 KB Output is correct
48 Correct 438 ms 124392 KB Output is correct
49 Correct 437 ms 125160 KB Output is correct
50 Correct 502 ms 124652 KB Output is correct
51 Correct 461 ms 124624 KB Output is correct
52 Correct 350 ms 113772 KB Output is correct
53 Correct 344 ms 113900 KB Output is correct
54 Correct 346 ms 113900 KB Output is correct
55 Correct 316 ms 113516 KB Output is correct
56 Correct 473 ms 125672 KB Output is correct
57 Correct 407 ms 120116 KB Output is correct
58 Correct 394 ms 120684 KB Output is correct
59 Correct 409 ms 120684 KB Output is correct
60 Correct 398 ms 113840 KB Output is correct
61 Correct 401 ms 121196 KB Output is correct
62 Correct 427 ms 119532 KB Output is correct
63 Correct 408 ms 121288 KB Output is correct
64 Correct 381 ms 117168 KB Output is correct
65 Correct 381 ms 121324 KB Output is correct