oj.uz

Submission #416401

# Submission time Handle Problem Language Result Execution time Memory
416401 2021-06-02T11:05:20 Z NintsiChkhaidze Xylophone (JOI18_xylophone) C++14
100 / 100
 101 ms 448 KB 
#include <iostream>
#include "xylophone.h"
using namespace std;
 
int a[5005];
void solve(int n) {
    a[1] = 0,a[2] = query(1,2);
    int x = a[2];
    for (int i=2;i<n;i++){
        int y = query(i,i+1),z = query(i-1,i+1);
        if (x + y == z){
            if (a[i] > a[i - 1]) a[i + 1] = a[i] + y;
            else a[i + 1] = a[i] - y;
        }
        else{
            if (a[i] > a[i - 1]) a[i + 1] = a[i] - y;
            else a[i + 1] = a[i] + y;
        }
        x = y;
    }
    int ind1=0,ind2=0,maxx = -1e9,minn = 1e9;
    for (int i=1;i<=n;i++){
        if (a[i] < minn) ind1 = i,minn = a[i];
        if (a[i] > maxx) ind2 = i,maxx = a[i];
    }
    if (ind2 < ind1){
        for (int i=1;i<=n;i++)
            a[i] = -a[i];
        minn = -maxx;
    }
    for (int i=1;i<=n;i++)
        answer(i,a[i] + 1 - minn);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 2 ms 200 KB Output is correct
4 Correct 3 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 4 ms 292 KB Output is correct
7 Correct 5 ms 200 KB Output is correct
8 Correct 4 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 3 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 3 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 1 ms 200 KB Output is correct
3 Correct 2 ms 200 KB Output is correct
4 Correct 3 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 4 ms 292 KB Output is correct
7 Correct 5 ms 200 KB Output is correct
8 Correct 4 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 3 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 3 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 5 ms 200 KB Output is correct
17 Correct 10 ms 200 KB Output is correct
18 Correct 14 ms 200 KB Output is correct
19 Correct 16 ms 276 KB Output is correct
20 Correct 19 ms 200 KB Output is correct
21 Correct 18 ms 296 KB Output is correct
22 Correct 21 ms 284 KB Output is correct
23 Correct 18 ms 200 KB Output is correct
24 Correct 18 ms 200 KB Output is correct
25 Correct 16 ms 200 KB Output is correct
26 Correct 17 ms 272 KB Output is correct
27 Correct 19 ms 296 KB Output is correct
28 Correct 22 ms 200 KB Output is correct
29 Correct 25 ms 272 KB Output is correct
30 Correct 27 ms 252 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 1 ms 200 KB Output is correct
3 Correct 2 ms 200 KB Output is correct
4 Correct 3 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 4 ms 292 KB Output is correct
7 Correct 5 ms 200 KB Output is correct
8 Correct 4 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 3 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 3 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 5 ms 200 KB Output is correct
17 Correct 10 ms 200 KB Output is correct
18 Correct 14 ms 200 KB Output is correct
19 Correct 16 ms 276 KB Output is correct
20 Correct 19 ms 200 KB Output is correct
21 Correct 18 ms 296 KB Output is correct
22 Correct 21 ms 284 KB Output is correct
23 Correct 18 ms 200 KB Output is correct
24 Correct 18 ms 200 KB Output is correct
25 Correct 16 ms 200 KB Output is correct
26 Correct 17 ms 272 KB Output is correct
27 Correct 19 ms 296 KB Output is correct
28 Correct 22 ms 200 KB Output is correct
29 Correct 25 ms 272 KB Output is correct
30 Correct 27 ms 252 KB Output is correct
31 Correct 36 ms 272 KB Output is correct
32 Correct 56 ms 288 KB Output is correct
33 Correct 69 ms 276 KB Output is correct
34 Correct 95 ms 296 KB Output is correct
35 Correct 62 ms 404 KB Output is correct
36 Correct 83 ms 288 KB Output is correct
37 Correct 79 ms 284 KB Output is correct
38 Correct 101 ms 284 KB Output is correct
39 Correct 83 ms 280 KB Output is correct
40 Correct 77 ms 288 KB Output is correct
41 Correct 66 ms 448 KB Output is correct
42 Correct 79 ms 200 KB Output is correct
43 Correct 96 ms 200 KB Output is correct
44 Correct 95 ms 416 KB Output is correct
45 Correct 88 ms 320 KB Output is correct
46 Correct 93 ms 288 KB Output is correct
47 Correct 91 ms 404 KB Output is correct
48 Correct 94 ms 280 KB Output is correct
49 Correct 97 ms 296 KB Output is correct
50 Correct 79 ms 416 KB Output is correct
51 Correct 83 ms 284 KB Output is correct
52 Correct 81 ms 276 KB Output is correct
53 Correct 89 ms 284 KB Output is correct
54 Correct 99 ms 320 KB Output is correct
55 Correct 91 ms 292 KB Output is correct
56 Correct 88 ms 320 KB Output is correct
57 Correct 99 ms 292 KB Output is correct
58 Correct 99 ms 320 KB Output is correct
59 Correct 69 ms 280 KB Output is correct
60 Correct 95 ms 296 KB Output is correct