oj.uz

Submission #710744

# Submission time Handle Problem Language Result Execution time Memory
710744 2023-03-15T17:38:27 Z lukameladze Building 4 (JOI20_building4) C++14
100 / 100
 377 ms 48168 KB 
# include <bits/stdc++.h>
#define f first
#define s second
//#define int long long
#define pii pair <int, int>
#define pb push_back
using namespace std;
const int N = 1e6 + 5,inf = 1e9;
int le[2][N],ri[2][N], a[2][N],n,id,lst,cnt,ans[N];
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n;
    for (int i = 1; i <= 2*n; i++) {
        cin>>a[0][i];
        le[0][i] = inf; le[1][i] = inf;
        ri[0][i] = 0; ri[1][i] = 0;
    }
    for (int i = 1; i <= 2*n; i++) {
        cin>>a[1][i];
    }
    for (int i = 1; i <= 2*n; i++) {
        for (int j = 0; j <= 1; j++) {
            if (j == 0) {
               if (a[0][i - 1] <= a[0][i]) {
                   le[0][i] = min(le[0][i - 1] + 1, le[0][i]);
                   ri[0][i] = max(ri[0][i - 1] + 1, ri[0][i]);
               }
               if (a[1][i - 1] <= a[0][i]) {
                   le[0][i] = min(le[1][i - 1] + 1, le[0][i]);
                   ri[0][i] = max(ri[1][i - 1] + 1, ri[0][i]);
               }
                continue;
            }
            if (a[0][i - 1] <= a[1][i]) {
                le[1][i] = min(le[0][i - 1], le[1][i]);
                ri[1][i] = max(ri[0][i - 1], ri[1][i]);
            }
            if (a[1][i - 1] <= a[1][i]) {
                le[1][i] = min(le[1][i - 1], le[1][i]);
                ri[1][i] = max(ri[1][i - 1], ri[1][i]);
            }
        }
    }
    id = -1;
    if (n >= le[0][2 * n] && n <= ri[0][2 * n])  id = 0;
    else  {
        if (n >= le[1][2 * n] && n <= ri[1][2 * n])  id = 1;
    }
    if (id == -1)  {
        cout<<-1<<"\n";
        exit(0);
    }
    cnt = 0;
    lst = 2 * n;
    while (lst >= 1) {
        if (id == 0) cnt++,ans[lst] = 1;
        else ans[lst] = 2;
        if (lst == 1) break;
        if (le[0][lst - 1] + cnt <= n && ri[0][lst - 1] + cnt >= n && a[0][lst - 1] <= a[id][lst]) {
            id = 0;
            lst--;
            continue;
        }
        id = 1;
        lst--;
    }
    for (int i = 1; i <= 2 * n; i++) {
        cout<<(ans[i] == 1 ? "A" : "B");
    }
}

Compilation message

building4.cpp:10:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   10 | main() {
      | ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 211 ms 42344 KB Output is correct
35 Correct 224 ms 44476 KB Output is correct
36 Correct 236 ms 43812 KB Output is correct
37 Correct 236 ms 44712 KB Output is correct
38 Correct 280 ms 44652 KB Output is correct
39 Correct 260 ms 43820 KB Output is correct
40 Correct 266 ms 47516 KB Output is correct
41 Correct 239 ms 44896 KB Output is correct
42 Correct 295 ms 46368 KB Output is correct
43 Correct 283 ms 48004 KB Output is correct
44 Correct 300 ms 47940 KB Output is correct
45 Correct 267 ms 47896 KB Output is correct
46 Correct 268 ms 47948 KB Output is correct
47 Correct 241 ms 47048 KB Output is correct
48 Correct 266 ms 46908 KB Output is correct
49 Correct 311 ms 47644 KB Output is correct
50 Correct 287 ms 47172 KB Output is correct
51 Correct 268 ms 47280 KB Output is correct
52 Correct 293 ms 36296 KB Output is correct
53 Correct 179 ms 36300 KB Output is correct
54 Correct 169 ms 36224 KB Output is correct
55 Correct 159 ms 35908 KB Output is correct
56 Correct 377 ms 48168 KB Output is correct
57 Correct 340 ms 43040 KB Output is correct
58 Correct 222 ms 43288 KB Output is correct
59 Correct 331 ms 43188 KB Output is correct
60 Correct 205 ms 41040 KB Output is correct
61 Correct 287 ms 43640 KB Output is correct
62 Correct 227 ms 43040 KB Output is correct
63 Correct 227 ms 43612 KB Output is correct
64 Correct 196 ms 42092 KB Output is correct
65 Correct 196 ms 43672 KB Output is correct