oj.uz

답안 #212483

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212483 2020-03-23T07:10:24 Z AlexLuchianov 건물 4 (JOI20_building4) C++14
100 / 100
 1314 ms 75528 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>

using namespace std;

#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
using ll = long long;

int const nmax = 1000000;

struct Info{
  int x;
  int y;
  Info operator + (Info const &a) const {
    if(x == -nmax)
      return a;
    else if(a.x == -nmax)
      return {x, y};
    assert(!(min(a.y, y) + 1 < max(x, a.x)));
    return {min(a.x, x), max(y, a.y)};
  }
  Info operator + (int const &a) const {
    return {x + a, y + a};
  }
  bool inside(int val){
    return x <= val && val <= y;
  }
};
Info dp[1 + nmax][2];
int a[1 + nmax], b[1 + nmax];

Info extract(int pos, int val){
  if(a[pos] <= val && b[pos] <= val)
    return dp[pos][0] + dp[pos][1];
  else if(a[pos] <= val) {
    return dp[pos][0];
  } else if(b[pos] <= val) {
    return dp[pos][1];
  } else
    return {-nmax, -nmax};
}
void solve(int pos, int k, int val, char ch){
  if(0 == pos)
    return ;

  if(dp[pos - 1][0].inside(k) && a[pos - 1] <= val)
    solve(pos - 1, k - 1, a[pos - 1], 'A');
  else if(dp[pos - 1][1].inside(k) && b[pos - 1] <= val)
    solve(pos - 1, k, b[pos - 1], 'B');
  else{
    cout << "Wrong";
    assert(1 < 0);
  }

  cout << ch;
}
int main()
{
  int n;
  cin >> n;
  for(int i = 1;i <= 2 * n; i++)
    cin >> a[i];
  for(int i = 1;i <= 2 * n; i++)
    cin >> b[i];
  Info sum = ((Info){0, 0}) + ((Info){1, 1});

  //*
  for(int i = 1;i <= 2 * n; i++){
    dp[i][0] = extract(i - 1, a[i]);
    if(dp[i][0].x != -nmax)
      dp[i][0] = dp[i][0] + 1;
    dp[i][1] = extract(i - 1, b[i]);
  }

  if(dp[2 * n][0].inside(n))
    solve(2 * n, n - 1, a[2 * n], 'A');
  else if(dp[2 * n][1].inside(n))
    solve(2 * n, n, b[2 * n], 'B');
  else
    cout << -1;
  //*/
  return 0;
}
/*
BABBABAABABA

*/

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:68:8: warning: variable 'sum' set but not used [-Wunused-but-set-variable]
   Info sum = ((Info){0, 0}) + ((Info){1, 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 256 KB Output is correct
5 Correct 10 ms 512 KB Output is correct
6 Correct 9 ms 640 KB Output is correct
7 Correct 10 ms 512 KB Output is correct
8 Correct 9 ms 640 KB Output is correct
9 Correct 9 ms 640 KB Output is correct
10 Correct 9 ms 640 KB Output is correct
11 Correct 10 ms 640 KB Output is correct
12 Correct 10 ms 640 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 10 ms 640 KB Output is correct
15 Correct 9 ms 640 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 10 ms 640 KB Output is correct
18 Correct 10 ms 640 KB Output is correct
19 Correct 10 ms 640 KB Output is correct
20 Correct 8 ms 640 KB Output is correct
21 Correct 8 ms 640 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 10 ms 640 KB Output is correct
25 Correct 9 ms 640 KB Output is correct
26 Correct 8 ms 640 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 8 ms 640 KB Output is correct
29 Correct 8 ms 640 KB Output is correct
30 Correct 8 ms 640 KB Output is correct
31 Correct 8 ms 640 KB Output is correct
32 Correct 7 ms 512 KB Output is correct
33 Correct 8 ms 640 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 256 KB Output is correct
5 Correct 10 ms 512 KB Output is correct
6 Correct 9 ms 640 KB Output is correct
7 Correct 10 ms 512 KB Output is correct
8 Correct 9 ms 640 KB Output is correct
9 Correct 9 ms 640 KB Output is correct
10 Correct 9 ms 640 KB Output is correct
11 Correct 10 ms 640 KB Output is correct
12 Correct 10 ms 640 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 10 ms 640 KB Output is correct
15 Correct 9 ms 640 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 10 ms 640 KB Output is correct
18 Correct 10 ms 640 KB Output is correct
19 Correct 10 ms 640 KB Output is correct
20 Correct 8 ms 640 KB Output is correct
21 Correct 8 ms 640 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 10 ms 640 KB Output is correct
25 Correct 9 ms 640 KB Output is correct
26 Correct 8 ms 640 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 8 ms 640 KB Output is correct
29 Correct 8 ms 640 KB Output is correct
30 Correct 8 ms 640 KB Output is correct
31 Correct 8 ms 640 KB Output is correct
32 Correct 7 ms 512 KB Output is correct
33 Correct 8 ms 640 KB Output is correct
34 Correct 1189 ms 26092 KB Output is correct
35 Correct 1190 ms 70148 KB Output is correct
36 Correct 1170 ms 68856 KB Output is correct
37 Correct 1202 ms 70392 KB Output is correct
38 Correct 1209 ms 70128 KB Output is correct
39 Correct 1149 ms 59872 KB Output is correct
40 Correct 1278 ms 58744 KB Output is correct
41 Correct 1179 ms 71032 KB Output is correct
42 Correct 1230 ms 57848 KB Output is correct
43 Correct 1314 ms 74988 KB Output is correct
44 Correct 1299 ms 75528 KB Output is correct
45 Correct 1302 ms 75384 KB Output is correct
46 Correct 1290 ms 75456 KB Output is correct
47 Correct 1249 ms 74564 KB Output is correct
48 Correct 1234 ms 74232 KB Output is correct
49 Correct 1290 ms 75128 KB Output is correct
50 Correct 1308 ms 59896 KB Output is correct
51 Correct 1291 ms 59728 KB Output is correct
52 Correct 723 ms 63896 KB Output is correct
53 Correct 724 ms 63736 KB Output is correct
54 Correct 707 ms 63352 KB Output is correct
55 Correct 700 ms 63492 KB Output is correct
56 Correct 1313 ms 59000 KB Output is correct
57 Correct 1065 ms 70420 KB Output is correct
58 Correct 1049 ms 70848 KB Output is correct
59 Correct 1043 ms 70800 KB Output is correct
60 Correct 998 ms 66680 KB Output is correct
61 Correct 1079 ms 71088 KB Output is correct
62 Correct 1054 ms 70136 KB Output is correct
63 Correct 1071 ms 70904 KB Output is correct
64 Correct 1037 ms 68352 KB Output is correct
65 Correct 1070 ms 70904 KB Output is correct