oj.uz

답안 #229289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229289 2020-05-04T06:15:36 Z xiaowuc1 건물 4 (JOI20_building4) C++14
100 / 100
 350 ms 44272 KB 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define derr if(1) cerr
typedef vector<int> vi;
// END NO SAD

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<ll>> matrix;
typedef pair<int, pii> state;

void die() {
  cout << "-1\n";
  exit(0);
}

int a[1000000];
int b[1000000];
pii dp[1000001][2]; // [i][0] gives range of min, max of A's, selecting A last
const pii BAD = {1e9, -1e9};
void solve() {
  int n;
  cin >> n;
  n *= 2;
  int want = n/2;
  for(int i = 0; i < n; i++) cin >> a[i];
  for(int i = 0; i < n; i++) cin >> b[i];
  dp[1][0] = {1, 1};
  dp[1][1] = {0, 0};
  for(int i = 1; i < n; i++) {
    int clhs = 1e9;
    int crhs = -1e9;
    if(a[i] >= a[i-1]) {
      clhs = min(clhs, dp[i][0].first + 1);
      crhs = max(crhs, dp[i][0].second + 1);
    }
    if(a[i] >= b[i-1]) {
      clhs = min(clhs, dp[i][1].first + 1);
      crhs = max(crhs, dp[i][1].second + 1);
    }
    dp[i+1][0] = {clhs, crhs};
    clhs = 1e9;
    crhs = -1e9;
    if(b[i] >= a[i-1]) {
      clhs = min(clhs, dp[i][0].first);
      crhs = max(crhs, dp[i][0].second);
    }
    if(b[i] >= b[i-1]) {
      clhs = min(clhs, dp[i][1].first);
      crhs = max(crhs, dp[i][1].second);
    }
    dp[i+1][1] = {clhs, crhs};
  }
  pii src = {-1, -1};
  if(dp[n][0].first <= want && want <= dp[n][0].second) src = {n, 0};
  if(dp[n][1].first <= want && want <= dp[n][1].second) src = {n, 1};
  if(src.first == -1) die();
  vector<char> ret;
  int numa = want;
  while(src.first) {
    if(src.second) ret.push_back('B');
    else {
      ret.push_back('A');
      numa--;
    }
    if(--src.first == 0) break;
    int now = src.second ? b[src.first] : a[src.first];
    if(now >= a[src.first-1] && dp[src.first][0].first <= numa && numa <= dp[src.first][0].second) {
      src.second = 0;
    }
    else {
      src.second = 1;
    }
    assert(dp[src.first][src.second].first <= numa && numa <= dp[src.first][src.second].second);
  }
  reverse(all(ret));
  for(char out: ret) cout << out; cout << "\n";
}
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  solve();
}

Compilation message

building4.cpp: In function 'void solve()':
building4.cpp:97:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   for(char out: ret) cout << out; cout << "\n";
   ^~~
building4.cpp:97:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   for(char out: ret) cout << out; cout << "\n";
                                   ^~~~

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 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 6 ms 512 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 5 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 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 540 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 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 5 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 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 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 6 ms 512 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 5 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 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 540 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 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 5 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 289 ms 24372 KB Output is correct
35 Correct 324 ms 42092 KB Output is correct
36 Correct 330 ms 41328 KB Output is correct
37 Correct 304 ms 42224 KB Output is correct
38 Correct 319 ms 41840 KB Output is correct
39 Correct 313 ms 30188 KB Output is correct
40 Correct 306 ms 29680 KB Output is correct
41 Correct 291 ms 42424 KB Output is correct
42 Correct 318 ms 39152 KB Output is correct
43 Correct 333 ms 28652 KB Output is correct
44 Correct 350 ms 28652 KB Output is correct
45 Correct 331 ms 28528 KB Output is correct
46 Correct 309 ms 28528 KB Output is correct
47 Correct 328 ms 43116 KB Output is correct
48 Correct 310 ms 44272 KB Output is correct
49 Correct 326 ms 28524 KB Output is correct
50 Correct 338 ms 40944 KB Output is correct
51 Correct 335 ms 41324 KB Output is correct
52 Correct 192 ms 33520 KB Output is correct
53 Correct 195 ms 33672 KB Output is correct
54 Correct 189 ms 33644 KB Output is correct
55 Correct 197 ms 33264 KB Output is correct
56 Correct 316 ms 28524 KB Output is correct
57 Correct 278 ms 40304 KB Output is correct
58 Correct 284 ms 40508 KB Output is correct
59 Correct 283 ms 40432 KB Output is correct
60 Correct 256 ms 38508 KB Output is correct
61 Correct 295 ms 40944 KB Output is correct
62 Correct 268 ms 40432 KB Output is correct
63 Correct 296 ms 40944 KB Output is correct
64 Correct 285 ms 39532 KB Output is correct
65 Correct 292 ms 40940 KB Output is correct