oj.uz

Submission #709630

# Submission time Handle Problem Language Result Execution time Memory
709630 2023-03-14T03:50:06 Z Spade1 Xylophone (JOI18_xylophone) C++14
100 / 100
 74 ms 436 KB 
#include <bits/stdc++.h>
//#include "grader.cpp"
#include "xylophone.h"
using namespace std;

int Ar[5050];
bool mark[5050];

void solve(int N) {
    int idx;
    int l = 1, r = N;
    while (l < r) {
        int mid = (l+r)/2;
        if (query(mid+1, N) == N-1) l = mid+1;
        else r = mid;
    }
    idx = l;
    Ar[idx] = 1;
    mark[1] = 1;

    for (int i = idx+1; i <= N; ++i) {
        int dif = query(i-1, i), cur;
        if (Ar[i-1]+dif>N || mark[Ar[i-1]+dif]) {
            cur = Ar[i-1]-dif;
        }
        else if (Ar[i-1]-dif<1 || mark[Ar[i-1]-dif]) {
            cur = Ar[i-1]+dif;
        }
        else {
            int dif2 = query(i-2, i);
            if (Ar[i-2] > Ar[i-1]+dif){
                if (Ar[i-2] - Ar[i-1] == dif2) cur = Ar[i-1]+dif;
            }
            if (Ar[i-2] < Ar[i-1]+dif) {
                if (Ar[i-1]+dif - min(Ar[i-2], Ar[i-1]) == dif2) cur = Ar[i-1]+dif;
            }
            if (Ar[i-2] > Ar[i-1]-dif){
                if (max(Ar[i-2], Ar[i-1]) - Ar[i-1]+dif == dif2) cur = Ar[i-1]-dif;
            }
            if (Ar[i-2] < Ar[i-1]-dif) {
                if (Ar[i-1] - Ar[i-2] == dif2) cur = Ar[i-1]-dif;
            }
        }
        Ar[i] = cur;
        mark[cur] = 1;
    }

    for (int i = idx-1; i >= 1; --i) {
        int dif = query(i, i+1), cur;
        if (Ar[i+1]+dif>N || mark[Ar[i+1]+dif]) {
            cur = Ar[i+1]-dif;
        }
        else if (Ar[i+1]-dif<1 || mark[Ar[i+1]-dif]) {
            cur = Ar[i+1]+dif;
        }
        else {
            int dif2 = query(i, i+2);
            if (Ar[i+2] > Ar[i+1]+dif){
                if (Ar[i+2] - Ar[i+1] == dif2) cur = Ar[i+1]+dif;
            }
            if (Ar[i+2] < Ar[i+1]+dif) {
                if (Ar[i+1]+dif - min(Ar[i+2], Ar[i+1]) == dif2) cur = Ar[i+1]+dif;
            }
            if (Ar[i+2] > Ar[i+1]-dif){
                if (max(Ar[i+2], Ar[i+1]) - Ar[i+1]+dif == dif2) cur = Ar[i+1]-dif;
            }
            if (Ar[i+2] < Ar[i+1]-dif) {
                if (Ar[i+1] - Ar[i+2] == dif2) cur = Ar[i+1]-dif;
            }
        }
        Ar[i] = cur;
        mark[cur] = 1;
    }

    for (int i = 1; i <= N; ++i) {
        answer(i, Ar[i]);
    }
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:71:15: warning: 'cur' may be used uninitialized in this function [-Wmaybe-uninitialized]
   71 |         Ar[i] = cur;
      |         ~~~~~~^~~~~
xylophone.cpp:44:15: warning: 'cur' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |         Ar[i] = cur;
      |         ~~~~~~^~~~~

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 304 KB Output is correct
4 Correct 2 ms 300 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 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 256 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 304 KB Output is correct
4 Correct 2 ms 300 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 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 6 ms 312 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 9 ms 208 KB Output is correct
21 Correct 12 ms 208 KB Output is correct
22 Correct 11 ms 292 KB Output is correct
23 Correct 8 ms 312 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 9 ms 208 KB Output is correct
26 Correct 11 ms 208 KB Output is correct
27 Correct 10 ms 308 KB Output is correct
28 Correct 13 ms 304 KB Output is correct
29 Correct 14 ms 336 KB Output is correct
30 Correct 11 ms 308 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 304 KB Output is correct
4 Correct 2 ms 300 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 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 6 ms 312 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 9 ms 208 KB Output is correct
21 Correct 12 ms 208 KB Output is correct
22 Correct 11 ms 292 KB Output is correct
23 Correct 8 ms 312 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 9 ms 208 KB Output is correct
26 Correct 11 ms 208 KB Output is correct
27 Correct 10 ms 308 KB Output is correct
28 Correct 13 ms 304 KB Output is correct
29 Correct 14 ms 336 KB Output is correct
30 Correct 11 ms 308 KB Output is correct
31 Correct 19 ms 308 KB Output is correct
32 Correct 21 ms 308 KB Output is correct
33 Correct 61 ms 292 KB Output is correct
34 Correct 60 ms 288 KB Output is correct
35 Correct 53 ms 300 KB Output is correct
36 Correct 34 ms 308 KB Output is correct
37 Correct 42 ms 420 KB Output is correct
38 Correct 47 ms 296 KB Output is correct
39 Correct 52 ms 308 KB Output is correct
40 Correct 62 ms 424 KB Output is correct
41 Correct 56 ms 436 KB Output is correct
42 Correct 47 ms 296 KB Output is correct
43 Correct 26 ms 304 KB Output is correct
44 Correct 29 ms 304 KB Output is correct
45 Correct 65 ms 304 KB Output is correct
46 Correct 72 ms 296 KB Output is correct
47 Correct 72 ms 300 KB Output is correct
48 Correct 59 ms 292 KB Output is correct
49 Correct 65 ms 328 KB Output is correct
50 Correct 40 ms 304 KB Output is correct
51 Correct 68 ms 304 KB Output is correct
52 Correct 58 ms 308 KB Output is correct
53 Correct 49 ms 300 KB Output is correct
54 Correct 51 ms 328 KB Output is correct
55 Correct 71 ms 304 KB Output is correct
56 Correct 28 ms 320 KB Output is correct
57 Correct 53 ms 328 KB Output is correct
58 Correct 54 ms 308 KB Output is correct
59 Correct 68 ms 328 KB Output is correct
60 Correct 74 ms 292 KB Output is correct