oj.uz

Submission #502960

# Submission time Handle Problem Language Result Execution time Memory
502960 2022-01-06T20:19:15 Z Marduk Xylophone (JOI18_xylophone) C++14
100 / 100
 97 ms 576 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;

const int MAXN = (1e4+7);

bool arr[MAXN];
int memo_d[MAXN], memo_t[MAXN];
int sol[MAXN];

int D(int x){
    if(memo_d[x]) return memo_d[x];
    return memo_d[x] = query(x, x+1);
}

int T(int x){
    if(memo_t[x]) return memo_t[x];
    return memo_t[x] = query(x, x+2);
}

void solve(int N){
    arr[2] = true;
    for(int i = 1;i<=N-2;i++){
        if(D(i)+D(i+1) == T(i)) arr[i+2] = arr[i+1];
        else arr[i+2] = !arr[i+1];
    }

    for(int i = 0;i<2;i++){
        int MIN = sol[1];
        for(int i = 2;i<=N;i++){
            sol[i] = sol[i-1] + (arr[i]%2-(arr[i]+1)%2)*D(i-1);
            MIN = min(MIN,sol[i]);
            arr[i] = !arr[i];
        }

        bool found = 0;
        for(int i = 1;i<=N;i++){
            if(sol[i]+(1-MIN) == 1) break;
            if(sol[i]+(1-MIN) == N) {found = 1; break;}
        }

        if(!found){
            for(int i = 1;i<=N;i++) answer(i,sol[i]+(1-MIN));
            return;
        }
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 2 ms 312 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 2 ms 312 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 2 ms 300 KB Output is correct
17 Correct 8 ms 200 KB Output is correct
18 Correct 7 ms 308 KB Output is correct
19 Correct 18 ms 304 KB Output is correct
20 Correct 15 ms 200 KB Output is correct
21 Correct 21 ms 292 KB Output is correct
22 Correct 19 ms 308 KB Output is correct
23 Correct 8 ms 300 KB Output is correct
24 Correct 15 ms 200 KB Output is correct
25 Correct 16 ms 288 KB Output is correct
26 Correct 19 ms 308 KB Output is correct
27 Correct 18 ms 200 KB Output is correct
28 Correct 15 ms 312 KB Output is correct
29 Correct 19 ms 200 KB Output is correct
30 Correct 15 ms 200 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 2 ms 312 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 2 ms 300 KB Output is correct
17 Correct 8 ms 200 KB Output is correct
18 Correct 7 ms 308 KB Output is correct
19 Correct 18 ms 304 KB Output is correct
20 Correct 15 ms 200 KB Output is correct
21 Correct 21 ms 292 KB Output is correct
22 Correct 19 ms 308 KB Output is correct
23 Correct 8 ms 300 KB Output is correct
24 Correct 15 ms 200 KB Output is correct
25 Correct 16 ms 288 KB Output is correct
26 Correct 19 ms 308 KB Output is correct
27 Correct 18 ms 200 KB Output is correct
28 Correct 15 ms 312 KB Output is correct
29 Correct 19 ms 200 KB Output is correct
30 Correct 15 ms 200 KB Output is correct
31 Correct 43 ms 300 KB Output is correct
32 Correct 51 ms 292 KB Output is correct
33 Correct 83 ms 300 KB Output is correct
34 Correct 93 ms 292 KB Output is correct
35 Correct 88 ms 320 KB Output is correct
36 Correct 81 ms 304 KB Output is correct
37 Correct 85 ms 308 KB Output is correct
38 Correct 81 ms 428 KB Output is correct
39 Correct 78 ms 292 KB Output is correct
40 Correct 63 ms 308 KB Output is correct
41 Correct 93 ms 320 KB Output is correct
42 Correct 94 ms 304 KB Output is correct
43 Correct 89 ms 304 KB Output is correct
44 Correct 97 ms 436 KB Output is correct
45 Correct 85 ms 576 KB Output is correct
46 Correct 57 ms 316 KB Output is correct
47 Correct 92 ms 324 KB Output is correct
48 Correct 81 ms 564 KB Output is correct
49 Correct 71 ms 312 KB Output is correct
50 Correct 86 ms 304 KB Output is correct
51 Correct 86 ms 432 KB Output is correct
52 Correct 89 ms 348 KB Output is correct
53 Correct 74 ms 308 KB Output is correct
54 Correct 54 ms 304 KB Output is correct
55 Correct 87 ms 448 KB Output is correct
56 Correct 89 ms 308 KB Output is correct
57 Correct 73 ms 308 KB Output is correct
58 Correct 91 ms 384 KB Output is correct
59 Correct 53 ms 448 KB Output is correct
60 Correct 91 ms 296 KB Output is correct