oj.uz

Submission #260175

# Submission time Handle Problem Language Result Execution time Memory
260175 2020-08-09T13:52:29 Z doowey Building 4 (JOI20_building4) C++14
100 / 100
 413 ms 48436 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = (int)1e6 + 100;
int A[2][N];

int low[N][2];
int high[N][2];

int main(){
    fastIO;
    int n;
    cin >> n;
    int m = 2 * n;
    for(int j = 1; j <= m ; j ++ ){
        for(int k = 0 ; k < 2; k ++ ){
            low[j][k]=(int)1e9;
            high[j][k]=0;
        }
    }
    low[1][0] = 1;
    high[1][0] = 1;

    low[1][1] = 0;
    high[1][1] = 0;
    for(int i = 0 ; i < 2; i ++ ){
        for(int j = 1; j <= m ; j ++ )
            cin >> A[i][j];
    }
    int ni;
    for(int j = 2; j <= m ; j ++ ){
        for(int c = 0; c < 2; c ++ ){
            for(int p = 0 ; p < 2; p ++ ){
                if(A[p][j - 1] <= A[c][j]){
                    ni = low[j - 1][p] + (!c);
                    low[j][c] = min(low[j][c], ni);
                    ni = high[j - 1][p] + (!c);
                    high[j][c] = max(high[j][c], ni);
                }
            }
        }
    }
    int cc = -1;
    if(low[m][0] <= n && n <= high[m][0]){
        cc = 0;
    }
    else if(low[m][1] <= n && n <= high[m][1]){
        cc = 1;
    }
    else{
        cout << "-1\n";
        return 0;
    }
    int cval = n;
    int nval;
    vector<int> sol;

    sol.push_back(cc);
    bool broke;
    for(int j = m ; j > 1; j -- ){
        cval -= !cc;
        broke = false;
        for(int pv = 0 ; pv < 2; pv ++ ){
            if(low[j - 1][pv] <= cval && cval <= high[j - 1][pv] && A[pv][j-1] <= A[cc][j]){
                cc = pv;
                sol.push_back(cc);
                broke = true;
                break;
            }
        }
    }
    reverse(sol.begin(), sol.end());
    for(auto x : sol){
        cout << char('A' + x);
    }
    return 0;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:64:9: warning: unused variable 'nval' [-Wunused-variable]
     int nval;
         ^~~~
building4.cpp:68:10: warning: variable 'broke' set but not used [-Wunused-but-set-variable]
     bool broke;
          ^~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 334 ms 27896 KB Output is correct
35 Correct 353 ms 44744 KB Output is correct
36 Correct 348 ms 44004 KB Output is correct
37 Correct 360 ms 45012 KB Output is correct
38 Correct 350 ms 44984 KB Output is correct
39 Correct 341 ms 44132 KB Output is correct
40 Correct 368 ms 47840 KB Output is correct
41 Correct 348 ms 45408 KB Output is correct
42 Correct 371 ms 46808 KB Output is correct
43 Correct 392 ms 48420 KB Output is correct
44 Correct 397 ms 48396 KB Output is correct
45 Correct 405 ms 48228 KB Output is correct
46 Correct 379 ms 48348 KB Output is correct
47 Correct 384 ms 47576 KB Output is correct
48 Correct 394 ms 47192 KB Output is correct
49 Correct 413 ms 47968 KB Output is correct
50 Correct 377 ms 47440 KB Output is correct
51 Correct 383 ms 47584 KB Output is correct
52 Correct 254 ms 36576 KB Output is correct
53 Correct 249 ms 36516 KB Output is correct
54 Correct 237 ms 36444 KB Output is correct
55 Correct 235 ms 36260 KB Output is correct
56 Correct 372 ms 48436 KB Output is correct
57 Correct 322 ms 43340 KB Output is correct
58 Correct 334 ms 43484 KB Output is correct
59 Correct 332 ms 43492 KB Output is correct
60 Correct 308 ms 41304 KB Output is correct
61 Correct 331 ms 43844 KB Output is correct
62 Correct 331 ms 43484 KB Output is correct
63 Correct 331 ms 44000 KB Output is correct
64 Correct 324 ms 42444 KB Output is correct
65 Correct 330 ms 43968 KB Output is correct