oj.uz

답안 #376816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376816 2021-03-12T04:59:07 Z VROOM_VARUN 건물 4 (JOI20_building4) C++14
100 / 100
 456 ms 142324 KB 
/*
ID: varunra2
LANG: C++
TASK: building4
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int n;
void solve(VVI& dpl, VVI& dpr, int i, int j, VI& ret, int cnt, VVI& vals) {
  ret[i] = j;
  if (j == 0) cnt++;
  if (i == 0) return;
  if (dpl[i - 1][0] <= (n - cnt) and dpr[i - 1][0] >= (n - cnt) and
      vals[0][i - 1] <= vals[j][i]) {
    solve(dpl, dpr, i - 1, 0, ret, cnt, vals);
  } else {
    solve(dpl, dpr, i - 1, 1, ret, cnt, vals);
  }
}

int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n;

  VVI vals(2, VI(2 * n));

  trav(x, vals[0]) cin >> x;
  trav(x, vals[1]) cin >> x;

  VVI dpl(2 * n, VI(2, INF));
  VVI dpr(2 * n, VI(2, -1));

  dpl[0][0] = dpr[0][0] = 1;
  dpl[0][1] = dpr[0][1] = 0;

  for (int i = 1; i < 2 * n; i++) {
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < 2; k++) {
        if (dpl[i - 1][k] == INF) continue;
        if (vals[j][i] < vals[k][i - 1]) continue;
        // you can go from (i - 1, k) -> (i, j)
        dpl[i][j] = min(dpl[i][j], dpl[i - 1][k] + (j == 0 ? 1 : 0));
        dpr[i][j] = max(dpr[i][j], dpr[i - 1][k] + (j == 0 ? 1 : 0));
      }
    }
  }

  VI ret(2 * n, 0);

  if (dpl.back()[0] > n or dpr.back()[0] < n) {
    if (dpl.back()[1] > n or dpr.back()[1] < n) {
      cout << "-1\n";
      return 0;
    } else {
      solve(dpl, dpr, 2 * n - 1, 1, ret, 0, vals);
    }
  } else {
    solve(dpl, dpr, 2 * n - 1, 0, ret, 0, vals);
  }

  for (int i = 0; i < 2 * n; i++) {
    if (ret[i] == 0)
      cout << 'A';
    else
      cout << 'B';
  }
  cout << '\n';

  return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 2 ms 748 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 2 ms 752 KB Output is correct
11 Correct 2 ms 876 KB Output is correct
12 Correct 3 ms 876 KB Output is correct
13 Correct 3 ms 876 KB Output is correct
14 Correct 2 ms 876 KB Output is correct
15 Correct 2 ms 876 KB Output is correct
16 Correct 2 ms 876 KB Output is correct
17 Correct 3 ms 876 KB Output is correct
18 Correct 3 ms 876 KB Output is correct
19 Correct 3 ms 876 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 876 KB Output is correct
23 Correct 2 ms 876 KB Output is correct
24 Correct 2 ms 876 KB Output is correct
25 Correct 2 ms 876 KB Output is correct
26 Correct 2 ms 876 KB Output is correct
27 Correct 2 ms 876 KB Output is correct
28 Correct 2 ms 748 KB Output is correct
29 Correct 2 ms 876 KB Output is correct
30 Correct 2 ms 748 KB Output is correct
31 Correct 3 ms 876 KB Output is correct
32 Correct 2 ms 748 KB Output is correct
33 Correct 2 ms 876 KB Output is correct
34 Correct 393 ms 138688 KB Output is correct
35 Correct 414 ms 131824 KB Output is correct
36 Correct 416 ms 129728 KB Output is correct
37 Correct 456 ms 132320 KB Output is correct
38 Correct 421 ms 132240 KB Output is correct
39 Correct 410 ms 132000 KB Output is correct
40 Correct 433 ms 141112 KB Output is correct
41 Correct 415 ms 134372 KB Output is correct
42 Correct 441 ms 137504 KB Output is correct
43 Correct 450 ms 141988 KB Output is correct
44 Correct 453 ms 142148 KB Output is correct
45 Correct 448 ms 142244 KB Output is correct
46 Correct 444 ms 142280 KB Output is correct
47 Correct 436 ms 141348 KB Output is correct
48 Correct 436 ms 141092 KB Output is correct
49 Correct 442 ms 141860 KB Output is correct
50 Correct 442 ms 141220 KB Output is correct
51 Correct 448 ms 141216 KB Output is correct
52 Correct 377 ms 130340 KB Output is correct
53 Correct 368 ms 130336 KB Output is correct
54 Correct 361 ms 130596 KB Output is correct
55 Correct 367 ms 130212 KB Output is correct
56 Correct 436 ms 142324 KB Output is correct
57 Correct 395 ms 136632 KB Output is correct
58 Correct 399 ms 137364 KB Output is correct
59 Correct 396 ms 137252 KB Output is correct
60 Correct 374 ms 129316 KB Output is correct
61 Correct 412 ms 137748 KB Output is correct
62 Correct 392 ms 135772 KB Output is correct
63 Correct 405 ms 137748 KB Output is correct
64 Correct 395 ms 132992 KB Output is correct
65 Correct 398 ms 137764 KB Output is correct