oj.uz

Submission #774078

# Submission time Handle Problem Language Result Execution time Memory
774078 2023-07-05T11:48:38 Z Dan4Life Xylophone (JOI18_xylophone) C++17
100 / 100
 60 ms 396 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int a[5010], _ok[20000];int *ok = _ok+10000;
int Query(int i, int j){return query(min(i,j),max(i,j));}
void Answer(int x, int v){answer(x,v); a[x]=v; ok[v]=1; }
 
void solve(int n) {
    int l = 1, r = n-1;
    while(l<r){
        int m = (l+r+1)/2;
        if(Query(m,n)==n-1) l=m;
        else r=m-1;
    }
    for(int i = -2*n; i <= 2*n; i++) ok[i]=(i<1 or i>n);
    Answer(l,1);
    for(int x : {1,-1}){
        for(int i = l-x; x==1?i>=1:i<=n; i-=x){
            int dif = Query(i,i+x);
            int x1 = a[i+x]-dif, x2 = a[i+x]+dif;
            if(ok[x1]) swap(x1,x2);
            if(ok[x2]) Answer(i,x1);
            else{
                int dif2 = Query(i,i+2*x);
                if(max({x1,a[i+x],a[i+2*x]})-min({x1,a[i+x],a[i+2*x]})==dif2) Answer(i,x1);
                else Answer(i,x2);
            }
        }
    }
}

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 1 ms 304 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 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 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 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 1 ms 304 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 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 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 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 9 ms 308 KB Output is correct
19 Correct 7 ms 208 KB Output is correct
20 Correct 9 ms 208 KB Output is correct
21 Correct 11 ms 328 KB Output is correct
22 Correct 11 ms 208 KB Output is correct
23 Correct 8 ms 208 KB Output is correct
24 Correct 9 ms 328 KB Output is correct
25 Correct 9 ms 336 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 12 ms 332 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 6 ms 324 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 1 ms 304 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 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 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 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 9 ms 308 KB Output is correct
19 Correct 7 ms 208 KB Output is correct
20 Correct 9 ms 208 KB Output is correct
21 Correct 11 ms 328 KB Output is correct
22 Correct 11 ms 208 KB Output is correct
23 Correct 8 ms 208 KB Output is correct
24 Correct 9 ms 328 KB Output is correct
25 Correct 9 ms 336 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 12 ms 332 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 6 ms 324 KB Output is correct
31 Correct 24 ms 364 KB Output is correct
32 Correct 40 ms 336 KB Output is correct
33 Correct 21 ms 336 KB Output is correct
34 Correct 53 ms 372 KB Output is correct
35 Correct 54 ms 336 KB Output is correct
36 Correct 32 ms 392 KB Output is correct
37 Correct 17 ms 388 KB Output is correct
38 Correct 38 ms 380 KB Output is correct
39 Correct 57 ms 336 KB Output is correct
40 Correct 42 ms 376 KB Output is correct
41 Correct 48 ms 372 KB Output is correct
42 Correct 44 ms 372 KB Output is correct
43 Correct 45 ms 336 KB Output is correct
44 Correct 21 ms 396 KB Output is correct
45 Correct 41 ms 392 KB Output is correct
46 Correct 60 ms 372 KB Output is correct
47 Correct 59 ms 336 KB Output is correct
48 Correct 60 ms 368 KB Output is correct
49 Correct 47 ms 384 KB Output is correct
50 Correct 31 ms 372 KB Output is correct
51 Correct 29 ms 336 KB Output is correct
52 Correct 54 ms 336 KB Output is correct
53 Correct 53 ms 336 KB Output is correct
54 Correct 46 ms 336 KB Output is correct
55 Correct 41 ms 384 KB Output is correct
56 Correct 47 ms 368 KB Output is correct
57 Correct 38 ms 336 KB Output is correct
58 Correct 50 ms 388 KB Output is correct
59 Correct 30 ms 336 KB Output is correct
60 Correct 38 ms 372 KB Output is correct