oj.uz

Submission #763038

# Submission time Handle Problem Language Result Execution time Memory
763038 2023-06-22T02:38:48 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
 87 ms 552 KB 
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;
int a[5001], ans[5001];
bool dif[5001];
void solve(int n)
{
    if(n == 2){
        answer(1, 1);
        answer(2, 2);
        return;
    }
    for(int i = 1; i < n; i++) a[i] = query(i, i+1);
    for(int i = 1; i < n-1; i++){
        int x = query(i, i+2);
        if(x == a[i] + a[i+1]) dif[i] = 0;
        else dif[i] = 1;
    }
    bool anssign = 0, sign = 0;
    int maximum = 0, maxplace = 0, minimum = 0, minplace = 0, cur = 0;
    for(int i = 1; i < n; i++){
        if(sign == 0) cur -= a[i];
        else cur += a[i];
        if(maximum < cur){
            maximum = cur;
            maxplace = i+1;
        }
        if(minimum > cur){
            minimum = cur;
            minplace = i+1;
        }
        sign ^= dif[i];
    }
    if(maxplace > minplace) anssign = 0;
    else anssign = 1;
    minimum = 0; cur = 0;
    for(int i = 1; i < n; i++){
        if(anssign == 0) cur -= a[i];
        else cur += a[i];
        minimum = min(minimum, cur);
        anssign ^= dif[i];
        ans[i+1] = cur;
    }
    for(int i = 1; i <= n; i++){
        ans[i] += -minimum+1;
        answer(i, ans[i]);
    }
    return;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 2 ms 308 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 304 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 5 ms 308 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 17 ms 208 KB Output is correct
20 Correct 17 ms 308 KB Output is correct
21 Correct 12 ms 208 KB Output is correct
22 Correct 17 ms 308 KB Output is correct
23 Correct 17 ms 208 KB Output is correct
24 Correct 13 ms 208 KB Output is correct
25 Correct 10 ms 300 KB Output is correct
26 Correct 17 ms 308 KB Output is correct
27 Correct 10 ms 336 KB Output is correct
28 Correct 17 ms 208 KB Output is correct
29 Correct 11 ms 312 KB Output is correct
30 Correct 17 ms 292 KB Output is correct
31 Correct 29 ms 296 KB Output is correct
32 Correct 49 ms 296 KB Output is correct
33 Correct 51 ms 304 KB Output is correct
34 Correct 46 ms 312 KB Output is correct
35 Correct 56 ms 308 KB Output is correct
36 Correct 71 ms 308 KB Output is correct
37 Correct 63 ms 304 KB Output is correct
38 Correct 36 ms 420 KB Output is correct
39 Correct 82 ms 304 KB Output is correct
40 Correct 67 ms 308 KB Output is correct
41 Correct 61 ms 304 KB Output is correct
42 Correct 60 ms 308 KB Output is correct
43 Correct 72 ms 312 KB Output is correct
44 Correct 78 ms 312 KB Output is correct
45 Correct 60 ms 312 KB Output is correct
46 Correct 66 ms 432 KB Output is correct
47 Correct 87 ms 312 KB Output is correct
48 Correct 83 ms 304 KB Output is correct
49 Correct 79 ms 308 KB Output is correct
50 Correct 74 ms 308 KB Output is correct
51 Correct 80 ms 308 KB Output is correct
52 Correct 84 ms 304 KB Output is correct
53 Correct 76 ms 424 KB Output is correct
54 Correct 61 ms 308 KB Output is correct
55 Correct 75 ms 304 KB Output is correct
56 Correct 65 ms 328 KB Output is correct
57 Correct 54 ms 552 KB Output is correct
58 Correct 71 ms 304 KB Output is correct
59 Correct 86 ms 304 KB Output is correct
60 Correct 85 ms 304 KB Output is correct