oj.uz

Submission #211820

# Submission time Handle Problem Language Result Execution time Memory
211820 2020-03-21T12:59:44 Z mjguru Building 4 (JOI20_building4) C++17
100 / 100
 479 ms 42360 KB 
#include <iostream>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstdio>


using namespace std;


typedef long long int lli;


const int MAXN = 2*500001;
const int INF = MAXN+MAXN;


lli val[MAXN][2];
int starting[MAXN][2], ending[MAXN][2];
int ans[MAXN];


int main() {

  int N;
  scanf("%d", &N);
  N += N;

  for (int i = 1 ; i <= N ; i++) {
    scanf("%lld", &val[i][0]);
  }
  for (int i = 1 ; i <= N ; i++) {
    scanf("%lld", &val[i][1]);
  }

  for (int i = 1 ; i <= N ; i++) {
    for (int j = 0 ; j < 2 ; j++) {
      starting[i][j] = ending[i][j] = INF;
      int add;
      if (j == 0) add = 1;
      else add = -1;
      for (int k = 0 ; k < 2 ; k++) {
        if (val[i-1][k] > val[i][j]) continue;
        if (starting[i-1][k] != INF) {
          if (starting[i][j] == INF) {
            starting[i][j] = starting[i-1][k]+add;
            ending[i][j] = ending[i-1][k]+add;
          } else {
            starting[i][j] = min(starting[i][j], starting[i-1][k]+add);
            ending[i][j] = max(ending[i][j], ending[i-1][k]+add);
          }
        }
      }
      //cerr << "starting[" << i << "][" << j << "] = " << starting[i][j] << "\n";
      //cerr << "ending[" << i << "][" << j << "] = " << ending[i][j] << "\n\n";
    }
  }

  int at = N, level = -1, score = 0;
  if (starting[N][0] != INF && starting[N][0] <= 0 && ending[N][0] >= 0) {
     level = 0; 
  }
  if (starting[N][1] != INF && starting[N][1] <= 0 && ending[N][1] >= 0) {
     level = 1; 
  }
  if (level == -1) {
    printf("-1\n");
    return 0;
  }
  ans[at] = level;
  while (at != 1) {
    int add;
    if (level == 0) {
      add = 1;
    } else {
      add = -1;
    }
    for (int k = 0 ; k < 2 ; k++) {
      if (val[at-1][k] > val[at][level]) continue;
      if (starting[at-1][k] <= score-add && ending[at-1][k] >= score-add) {
        score -= add;
        level = k;
        break;
      }
    }
    at--;
    ans[at] = level;
  }

  for (int i = 1 ; i <= N ; i++) {
    if (ans[i] == 0) {
      printf("A");
    } else {
      printf("B");
    }
  }
  printf("\n");
  

  

  return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 7 ms 640 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 7 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 640 KB Output is correct
16 Correct 6 ms 512 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 6 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 6 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 7 ms 640 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 7 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 640 KB Output is correct
16 Correct 6 ms 512 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 6 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 6 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 410 ms 31352 KB Output is correct
35 Correct 414 ms 36984 KB Output is correct
36 Correct 411 ms 34544 KB Output is correct
37 Correct 419 ms 37880 KB Output is correct
38 Correct 379 ms 38520 KB Output is correct
39 Correct 373 ms 37496 KB Output is correct
40 Correct 412 ms 36728 KB Output is correct
41 Correct 352 ms 35960 KB Output is correct
42 Correct 428 ms 35704 KB Output is correct
43 Correct 479 ms 41316 KB Output is correct
44 Correct 462 ms 42360 KB Output is correct
45 Correct 465 ms 40544 KB Output is correct
46 Correct 419 ms 42340 KB Output is correct
47 Correct 409 ms 37768 KB Output is correct
48 Correct 400 ms 37256 KB Output is correct
49 Correct 416 ms 40996 KB Output is correct
50 Correct 451 ms 37048 KB Output is correct
51 Correct 446 ms 36816 KB Output is correct
52 Correct 331 ms 40832 KB Output is correct
53 Correct 355 ms 40952 KB Output is correct
54 Correct 290 ms 40824 KB Output is correct
55 Correct 294 ms 41588 KB Output is correct
56 Correct 390 ms 41720 KB Output is correct
57 Correct 345 ms 39672 KB Output is correct
58 Correct 348 ms 40056 KB Output is correct
59 Correct 348 ms 39928 KB Output is correct
60 Correct 337 ms 37756 KB Output is correct
61 Correct 342 ms 39928 KB Output is correct
62 Correct 349 ms 39288 KB Output is correct
63 Correct 353 ms 39932 KB Output is correct
64 Correct 311 ms 38608 KB Output is correct
65 Correct 360 ms 40184 KB Output is correct