oj.uz

Submission #774063

# Submission time Handle Problem Language Result Execution time Memory
774063 2023-07-05T11:40:45 Z Dan4Life Xylophone (JOI18_xylophone) C++17
100 / 100
 58 ms 392 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
 
int a[5010], _ok[20000];
int *ok = _ok+10000;
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 mid = (l+r+1)/2;
        if(query(mid,n)==n-1) l=mid;
        else r=mid-1;
    }
    for(int i = -2*n; i <= 2*n; i++) ok[i]=(i<1 or i>n);
    Answer(l,1);
    if(l!=1) Answer(l-1,query(l-1,l)+1);
    Answer(l+1,query(l,l+1)+1);
    for(int i = l-2; i>=1; i--){
        int dif = query(i,i+1);
        int x1 = a[i+1]-dif, x2 = a[i+1]+dif;
        if(ok[x1]) swap(x1,x2);
        if(ok[x2]) Answer(i,x1);
        else{
            int dif2 = query(i,i+2);
			if(max({x1,a[i+1],a[i+2]})-min({x1,a[i+1],a[i+2]})==dif2) Answer(i,x1);
            else Answer(i,x2);
        }
    }
	for(int i = l+2; i<=n; i++){
        int dif = query(i-1,i);
        int x1 = a[i-1]-dif, x2 = a[i-1]+dif;
        if(ok[x1]) swap(x1,x2);
        if(ok[x2]) Answer(i,x1);
        else{
            int dif2 = query(i-2,i);
            if(max({x1,a[i-1],a[i-2]})-min({x1,a[i-1],a[i-2]})==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 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 308 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 1 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 1 ms 308 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 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 308 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 1 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 1 ms 308 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 11 ms 208 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 7 ms 208 KB Output is correct
23 Correct 6 ms 328 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 10 ms 208 KB Output is correct
26 Correct 12 ms 208 KB Output is correct
27 Correct 12 ms 208 KB Output is correct
28 Correct 9 ms 208 KB Output is correct
29 Correct 10 ms 208 KB Output is correct
30 Correct 11 ms 332 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 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 308 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 1 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 1 ms 308 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 11 ms 208 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 7 ms 208 KB Output is correct
23 Correct 6 ms 328 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 10 ms 208 KB Output is correct
26 Correct 12 ms 208 KB Output is correct
27 Correct 12 ms 208 KB Output is correct
28 Correct 9 ms 208 KB Output is correct
29 Correct 10 ms 208 KB Output is correct
30 Correct 11 ms 332 KB Output is correct
31 Correct 23 ms 352 KB Output is correct
32 Correct 26 ms 364 KB Output is correct
33 Correct 45 ms 384 KB Output is correct
34 Correct 54 ms 336 KB Output is correct
35 Correct 53 ms 372 KB Output is correct
36 Correct 42 ms 376 KB Output is correct
37 Correct 40 ms 376 KB Output is correct
38 Correct 37 ms 376 KB Output is correct
39 Correct 51 ms 376 KB Output is correct
40 Correct 41 ms 336 KB Output is correct
41 Correct 44 ms 376 KB Output is correct
42 Correct 44 ms 364 KB Output is correct
43 Correct 42 ms 372 KB Output is correct
44 Correct 34 ms 336 KB Output is correct
45 Correct 33 ms 336 KB Output is correct
46 Correct 58 ms 336 KB Output is correct
47 Correct 45 ms 336 KB Output is correct
48 Correct 54 ms 372 KB Output is correct
49 Correct 53 ms 372 KB Output is correct
50 Correct 50 ms 372 KB Output is correct
51 Correct 53 ms 384 KB Output is correct
52 Correct 54 ms 392 KB Output is correct
53 Correct 52 ms 388 KB Output is correct
54 Correct 51 ms 376 KB Output is correct
55 Correct 52 ms 376 KB Output is correct
56 Correct 41 ms 372 KB Output is correct
57 Correct 51 ms 368 KB Output is correct
58 Correct 36 ms 384 KB Output is correct
59 Correct 52 ms 372 KB Output is correct
60 Correct 53 ms 384 KB Output is correct