oj.uz

답안 #704280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
704280 2023-03-02T02:41:56 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
 61 ms 424 KB 
#include<bits/stdc++.h>
#include "xylophone.h"
int a[5005];
bool ok[5005];
void solve(int n) {
    int p=n,l=1,r=n;
    while(r>=l){
        int mid=(r+l)>>1;
        if(query(1,mid)==n-1){p=mid;r=mid-1;}
        else l=mid+1;
    }
    a[p]=n;ok[n]=true;
    if(p>=2){
        a[p-1]=n-query(p-1,p);ok[a[p-1]]=true;
        for(int i=p-2;i>=1;i--){
            int d=query(i,i+1);
            if(a[i+1]-d<=0) a[i]=a[i+1]+d;
            else if(a[i+1]+d>n) a[i]=a[i+1]-d;
            else if(ok[a[i+1]-d]) a[i]=a[i+1]+d;
            else if(ok[a[i+1]+d]) a[i]=a[i+1]-d;
            else{
                int k=query(i,i+2),x=abs(a[i+1]-a[i+2]);
                if(a[i+1]>a[i+2]){
                    if(k==x+d) a[i]=a[i+1]+d;
                    else a[i]=a[i+1]-d;
                }
                else{
                    if(k==x+d) a[i]=a[i+1]-d;
                    else a[i]=a[i+1]+d;
                }
            }
            ok[a[i]]=true;
        }
    }
    if(p<n){
        a[p+1]=n-query(p,p+1);ok[a[p+1]]=true;
        for(int i=p+2;i<=n;i++){
            int d=query(i-1,i);
            if(a[i-1]-d<=0) a[i]=a[i-1]+d;
            else if(a[i-1]+d>n) a[i]=a[i-1]-d;
            else if(ok[a[i-1]-d]) a[i]=a[i-1]+d;
            else if(ok[a[i-1]+d]) a[i]=a[i-1]-d;
            else{
                int k=query(i-2,i),x=abs(a[i-1]-a[i-2]);
                if(a[i-1]>a[i-2]){
                    if(k==x+d) a[i]=a[i-1]+d;
                    else a[i]=a[i-1]-d;
                }
                else{
                    if(k==x+d) a[i]=a[i-1]-d;
                    else a[i]=a[i-1]+d;
                }
            }
            ok[a[i]]=true;
        }
    }
    for(int i=1;i<=n;i++) answer(i,a[i]);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 304 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 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 1 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 1 ms 208 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 304 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 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 1 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 2 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 6 ms 208 KB Output is correct
18 Correct 9 ms 304 KB Output is correct
19 Correct 13 ms 312 KB Output is correct
20 Correct 10 ms 208 KB Output is correct
21 Correct 12 ms 208 KB Output is correct
22 Correct 12 ms 312 KB Output is correct
23 Correct 10 ms 208 KB Output is correct
24 Correct 11 ms 300 KB Output is correct
25 Correct 11 ms 312 KB Output is correct
26 Correct 8 ms 208 KB Output is correct
27 Correct 13 ms 292 KB Output is correct
28 Correct 8 ms 304 KB Output is correct
29 Correct 13 ms 208 KB Output is correct
30 Correct 10 ms 308 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 304 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 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 1 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 2 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 6 ms 208 KB Output is correct
18 Correct 9 ms 304 KB Output is correct
19 Correct 13 ms 312 KB Output is correct
20 Correct 10 ms 208 KB Output is correct
21 Correct 12 ms 208 KB Output is correct
22 Correct 12 ms 312 KB Output is correct
23 Correct 10 ms 208 KB Output is correct
24 Correct 11 ms 300 KB Output is correct
25 Correct 11 ms 312 KB Output is correct
26 Correct 8 ms 208 KB Output is correct
27 Correct 13 ms 292 KB Output is correct
28 Correct 8 ms 304 KB Output is correct
29 Correct 13 ms 208 KB Output is correct
30 Correct 10 ms 308 KB Output is correct
31 Correct 28 ms 308 KB Output is correct
32 Correct 31 ms 296 KB Output is correct
33 Correct 47 ms 308 KB Output is correct
34 Correct 48 ms 308 KB Output is correct
35 Correct 56 ms 308 KB Output is correct
36 Correct 39 ms 304 KB Output is correct
37 Correct 49 ms 296 KB Output is correct
38 Correct 48 ms 300 KB Output is correct
39 Correct 53 ms 312 KB Output is correct
40 Correct 49 ms 296 KB Output is correct
41 Correct 52 ms 316 KB Output is correct
42 Correct 51 ms 296 KB Output is correct
43 Correct 42 ms 304 KB Output is correct
44 Correct 39 ms 300 KB Output is correct
45 Correct 57 ms 308 KB Output is correct
46 Correct 61 ms 304 KB Output is correct
47 Correct 26 ms 316 KB Output is correct
48 Correct 44 ms 296 KB Output is correct
49 Correct 53 ms 304 KB Output is correct
50 Correct 60 ms 304 KB Output is correct
51 Correct 49 ms 312 KB Output is correct
52 Correct 48 ms 304 KB Output is correct
53 Correct 48 ms 328 KB Output is correct
54 Correct 53 ms 300 KB Output is correct
55 Correct 56 ms 304 KB Output is correct
56 Correct 53 ms 424 KB Output is correct
57 Correct 26 ms 304 KB Output is correct
58 Correct 55 ms 304 KB Output is correct
59 Correct 53 ms 292 KB Output is correct
60 Correct 49 ms 308 KB Output is correct