oj.uz

Submission #374929

# Submission time Handle Problem Language Result Execution time Memory
374929 2021-03-08T14:51:10 Z BartolM Building 4 (JOI20_building4) C++17
100 / 100
 333 ms 45536 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <vector>
#include <cstring>
#include <cstdlib>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;

const int INF=0x3f3f3f3f;
const int N=1e6+5;

int n;
int A[N], B[N];
pii a[N], b[N];
string sol="";

pii mrg(pii a, pii b) {
    if (a.X<0) return b;
    if (b.X<0) return a;
    if (b.X-1 > a.Y || b.Y+1 < a.X) {
        assert(0);
    }
    pii res=a;
    if (b.X<res.X) res.X=b.X;
    if (b.Y>res.Y) res.Y=b.Y;
    return res;
}

void load() {
    scanf("%d", &n);
    for (int i=0; i<2*n; ++i) scanf("%d", A+i);
    for (int i=0; i<2*n; ++i) scanf("%d", B+i);
}

void solve() {
    a[0]=mp(1, 1); b[0]=mp(0, 0);
//    printf("i==%d: [%d, %d], [%d, %d]\n", 0, 1, 1, 0, 0);
    for (int i=1; i<2*n; ++i) {

        a[i]=mp(-INF, -INF);
        b[i]=mp(-INF, -INF);

        if (B[i]>=B[i-1]) b[i]=mrg(b[i], b[i-1]);
        if (B[i]>=A[i-1]) b[i]=mrg(b[i], a[i-1]);

        if (A[i]>=A[i-1]) a[i]=mrg(a[i], mp(a[i-1].X+1, a[i-1].Y+1));
        if (A[i]>=B[i-1]) a[i]=mrg(a[i], mp(b[i-1].X+1, b[i-1].Y+1));
//        printf("i==%d: [%d, %d], [%d, %d]\n", i, a[i].X, a[i].Y, b[i].X, b[i].Y);
    }
    int mogua=0, mogub=0, cnt=n;
    if (a[2*n-1].X<=n && a[2*n-1].Y>=n) mogua=1;
    else if (b[2*n-1].X<=n && b[2*n-1].Y>=n) mogub=1;
    else {
        printf("-1\n");
        return;
    }
    for (int i=2*n-1; i>=0; --i) {
        if (mogua) {
            sol+='A';
            cnt--;
            mogua=0;
            mogub=0;
            if (!i) break;

            if (a[i-1].X<=cnt && a[i-1].Y>=cnt && A[i-1]<=A[i]) mogua=1;
            else mogub=1;
        }
        else {
            sol+='B';
            mogua=0;
            mogub=0;
            if (!i) break;

            if (a[i-1].X<=cnt && a[i-1].Y>=cnt && A[i-1]<=B[i]) mogua=1;
            else mogub=1;
        }

    }
    reverse(sol.begin(), sol.end());
    printf("%s\n", sol.c_str());
}

int main() {
    load();
    solve();
return 0;
}

Compilation message

building4.cpp: In function 'void solve()':
building4.cpp:63:18: warning: variable 'mogub' set but not used [-Wunused-but-set-variable]
   63 |     int mogua=0, mogub=0, cnt=n;
      |                  ^~~~~
building4.cpp: In function 'void load()':
building4.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   43 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
building4.cpp:44:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   44 |     for (int i=0; i<2*n; ++i) scanf("%d", A+i);
      |                               ~~~~~^~~~~~~~~~~
building4.cpp:45:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   45 |     for (int i=0; i<2*n; ++i) scanf("%d", B+i);
      |                               ~~~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 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 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 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 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 305 ms 42604 KB Output is correct
35 Correct 299 ms 42148 KB Output is correct
36 Correct 296 ms 41380 KB Output is correct
37 Correct 304 ms 42168 KB Output is correct
38 Correct 305 ms 42148 KB Output is correct
39 Correct 316 ms 41484 KB Output is correct
40 Correct 320 ms 45044 KB Output is correct
41 Correct 287 ms 42404 KB Output is correct
42 Correct 322 ms 44068 KB Output is correct
43 Correct 320 ms 45408 KB Output is correct
44 Correct 325 ms 45408 KB Output is correct
45 Correct 324 ms 45536 KB Output is correct
46 Correct 325 ms 45424 KB Output is correct
47 Correct 315 ms 44512 KB Output is correct
48 Correct 316 ms 44440 KB Output is correct
49 Correct 333 ms 45136 KB Output is correct
50 Correct 322 ms 44512 KB Output is correct
51 Correct 330 ms 44512 KB Output is correct
52 Correct 244 ms 33504 KB Output is correct
53 Correct 265 ms 33504 KB Output is correct
54 Correct 249 ms 33504 KB Output is correct
55 Correct 241 ms 33248 KB Output is correct
56 Correct 324 ms 45536 KB Output is correct
57 Correct 276 ms 40288 KB Output is correct
58 Correct 284 ms 40564 KB Output is correct
59 Correct 303 ms 40660 KB Output is correct
60 Correct 267 ms 38436 KB Output is correct
61 Correct 285 ms 41060 KB Output is correct
62 Correct 275 ms 40416 KB Output is correct
63 Correct 286 ms 41032 KB Output is correct
64 Correct 270 ms 39588 KB Output is correct
65 Correct 298 ms 41104 KB Output is correct