oj.uz

Submission #329377

# Submission time Handle Problem Language Result Execution time Memory
329377 2020-11-20T22:37:50 Z limabeans Building 4 (JOI20_building4) C++17
100 / 100
 319 ms 60140 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 500001*2;
const int inf = 2e9;

int n;
int a[maxn][2];
int dpLow[maxn][2], dpHigh[maxn][2]; //range of # of B's


void setMin(int &x, int y) {
    x = min(x, y);
}

void setMax(int &x, int y) {
    x = max(x, y);
}


bool solve(int i, int b, int hi) {
    if (i==-1) {
	return true;
    }
    if (a[i][0]<=hi && dpLow[i][0]<=b && b<=dpHigh[i][0]) {
	solve(i-1,b,a[i][0]);
	cout<<"A";
	return true;
    }

    if (a[i][1]<=hi && b>0 && dpLow[i][1]<=b && b<=dpHigh[i][1]) {
	solve(i-1,b-1,a[i][1]);
	cout<<"B";
	return true;
    }

    return false;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n;
    n *= 2;
    for (int j=0; j<2; j++) {
	for (int i=0; i<n; i++) {
	    cin>>a[i][j];
	}
    }


    for (int i=0; i<n; i++) {
	for (int j=0; j<2; j++) {
	    dpLow[i][j] = inf;
	    dpHigh[i][j] = -inf;
	}
    }


    dpLow[0][0] = dpHigh[0][0] = 0;
    dpLow[0][1] = dpHigh[0][1] = 1;

    for (int i=0; i<n-1; i++) {
	for (int j=0; j<2; j++) {
	    
	    if (a[i][j] <= a[i+1][0]) {
		setMin(dpLow[i+1][0], dpLow[i][j]);
		setMax(dpHigh[i+1][0], dpHigh[i][j]);
	    }
	    
	    if (a[i][j] <= a[i+1][1]) {
		setMin(dpLow[i+1][1], dpLow[i][j]+1);
		setMax(dpHigh[i+1][1], dpHigh[i][j]+1);
	    }
	}
    }


    if (!solve(n-1,n/2,inf)) {
	out(-1);
    }
    
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 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 1 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 1 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 512 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 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 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 1 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 1 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 512 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 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 248 ms 37484 KB Output is correct
35 Correct 294 ms 55532 KB Output is correct
36 Correct 285 ms 54764 KB Output is correct
37 Correct 295 ms 55788 KB Output is correct
38 Correct 281 ms 55740 KB Output is correct
39 Correct 280 ms 55020 KB Output is correct
40 Correct 312 ms 59300 KB Output is correct
41 Correct 291 ms 56428 KB Output is correct
42 Correct 297 ms 57928 KB Output is correct
43 Correct 310 ms 59884 KB Output is correct
44 Correct 312 ms 59884 KB Output is correct
45 Correct 309 ms 60012 KB Output is correct
46 Correct 310 ms 59884 KB Output is correct
47 Correct 292 ms 58988 KB Output is correct
48 Correct 292 ms 58732 KB Output is correct
49 Correct 294 ms 59628 KB Output is correct
50 Correct 310 ms 59028 KB Output is correct
51 Correct 319 ms 59244 KB Output is correct
52 Correct 229 ms 48108 KB Output is correct
53 Correct 231 ms 48108 KB Output is correct
54 Correct 220 ms 48236 KB Output is correct
55 Correct 218 ms 47852 KB Output is correct
56 Correct 295 ms 60140 KB Output is correct
57 Correct 258 ms 54764 KB Output is correct
58 Correct 258 ms 55020 KB Output is correct
59 Correct 262 ms 55276 KB Output is correct
60 Correct 247 ms 52204 KB Output is correct
61 Correct 272 ms 55532 KB Output is correct
62 Correct 261 ms 54764 KB Output is correct
63 Correct 265 ms 55532 KB Output is correct
64 Correct 258 ms 53612 KB Output is correct
65 Correct 261 ms 55788 KB Output is correct