oj.uz

답안 #414163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
414163 2021-05-30T07:24:01 Z usachevd0 건물 4 (JOI20_building4) C++14
100 / 100
 288 ms 45332 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define Time (clock() * 1.0 / CLOCKS_PER_SEC)
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using ld = long double;
template<typename T1, typename T2> bool chkmin(T1& x, T2 y) {
    return y < x ? (x = y, true) : false;
}
template<typename T1, typename T2> bool chkmax(T1& x, T2 y) {
    return y > x ? (x = y, true) : false;
}
void debug_out() {
    cerr << endl;
}
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) {
    cerr << ' ' << A;
    debug_out(B...);
}
template<typename T> void mdebug_out(T* a, int n) {
    for (int i = 0; i < n; ++i)
        cerr << a[i] << ' ';
    cerr << endl;
}
#ifdef LOCAL
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
    #define mdebug(a, n) cerr << #a << ": ", mdebug_out(a, n)
#else
    #define debug(...) 1337
    #define mdebug(a, n) 1337
#endif
template<typename T> ostream& operator << (ostream& stream, const vector<T>& v) {
    for (auto& x : v)
        stream << x << ' ';
    return stream;
}
template<typename T1, typename T2> ostream& operator << (ostream& stream, const pair<T1, T2>& p) {
    return stream << p.first << ' ' << p.second;
}


const int INF32 = 1e9;
const int maxN = 1e6 + 6;
int n;
int A[maxN][2];
int mn[maxN][2], mx[maxN][2];

const char ch[] = "AB";

int32_t main() {
#ifdef LOCAL
    freopen("in", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n;
    n *= 2;
    for (int t = 0; t < 2; ++t)
        for (int i = 0; i < n; ++i)
            cin >> A[i][t];
    mn[0][0] = mx[0][0] = 0;
    mn[0][1] = mx[0][1] = 1;
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j < 2; ++j) {
            mn[i][j] = +INF32;
            mx[i][j] = -INF32;
            for (int t = 0; t < 2; ++t) {
                if (A[i - 1][t] <= A[i][j]) {
                    chkmin(mn[i][j], mn[i - 1][t] + j);
                    chkmax(mx[i][j], mx[i - 1][t] + j);
                }
            }
        }
    }
    for (int t = 0; t < 2; ++t) {
        if (mn[n - 1][t] <= n / 2 && n / 2 <= mx[n - 1][t]) {
            int need = n / 2;
            string res(n, '?');
            res[n - 1] = ch[t];
            for (int i = n - 1; i > 0; --i) {
                for (int j = 0; j < 2; ++j) {
                    if (A[i - 1][j] <= A[i][t] && mn[i - 1][j] + t <= need && need <= mx[i - 1][j] + t) {
                        need -= t;
                        t = j;
                        break;
                    }
                }
                res[i - 1] = ch[t];
            }
            cout << res << '\n';
            exit(0);
        }
    }
    cout << "-1\n";

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 3 ms 460 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 416 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 270 ms 42520 KB Output is correct
35 Correct 264 ms 41872 KB Output is correct
36 Correct 264 ms 41180 KB Output is correct
37 Correct 265 ms 42052 KB Output is correct
38 Correct 248 ms 41968 KB Output is correct
39 Correct 249 ms 41156 KB Output is correct
40 Correct 260 ms 44612 KB Output is correct
41 Correct 244 ms 42184 KB Output is correct
42 Correct 269 ms 43612 KB Output is correct
43 Correct 288 ms 45128 KB Output is correct
44 Correct 283 ms 45132 KB Output is correct
45 Correct 283 ms 45064 KB Output is correct
46 Correct 272 ms 45108 KB Output is correct
47 Correct 277 ms 44192 KB Output is correct
48 Correct 266 ms 43976 KB Output is correct
49 Correct 270 ms 44808 KB Output is correct
50 Correct 283 ms 44324 KB Output is correct
51 Correct 284 ms 44244 KB Output is correct
52 Correct 209 ms 33500 KB Output is correct
53 Correct 204 ms 33336 KB Output is correct
54 Correct 190 ms 33348 KB Output is correct
55 Correct 193 ms 33092 KB Output is correct
56 Correct 266 ms 45332 KB Output is correct
57 Correct 229 ms 40108 KB Output is correct
58 Correct 229 ms 40256 KB Output is correct
59 Correct 229 ms 40292 KB Output is correct
60 Correct 220 ms 38316 KB Output is correct
61 Correct 235 ms 40860 KB Output is correct
62 Correct 236 ms 40260 KB Output is correct
63 Correct 242 ms 40796 KB Output is correct
64 Correct 231 ms 39336 KB Output is correct
65 Correct 244 ms 40772 KB Output is correct