oj.uz

Submission #763032

# Submission time Handle Problem Language Result Execution time Memory
763032 2023-06-22T02:32:42 Z huutuan Xylophone (JOI18_xylophone) C++14
47 / 100
 64 ms 312 KB 
#include<bits/stdc++.h>
#include "xylophone.h"

using namespace std;

int a[5001];

void ask(int x, int y, int z){
    int v1=abs(a[x]-a[y]), v2=query(min(y, z), max(y, z)), v3=query(min(x, z), max(x, z));
    if (v1!=v3){
        if (a[x]<a[y]){
            if (v2==v3) a[z]=a[y]-v2;
            else a[z]=a[y]+v2;
        }else{
            if (v2==v3) a[z]=a[y]+v2;
            else a[z]=a[y]-v2;
        }
    }else{
        if (a[x]<a[y]) a[z]=a[y]-v2;
        else a[z]=a[y]+v2;
    }
}

void solve(int N){
    int l=2, r=N;
    while (l<=r){
        int mid=(l+r)>>1ll;
        if (query(1, mid)==N-1) r=mid-1;
        else l=mid+1;
    }
    a[l]=N;
    for (int i=l+1; i<=N; ++i){
        if (i==l+1) a[i]=N-query(l, l+1);
        else ask(i-2, i-1, i);
    }
    for (int i=l-1; i>=1; --i){
        if (i==l-1) a[i]=N-query(l-1, l);
        else ask(i+2, i+1, i);
    }
    for (int i=1; i<=N; ++i) answer(i, a[i]);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 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 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 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 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 6 ms 296 KB Output is correct
19 Correct 17 ms 288 KB Output is correct
20 Correct 8 ms 312 KB Output is correct
21 Correct 10 ms 208 KB Output is correct
22 Correct 15 ms 208 KB Output is correct
23 Correct 17 ms 208 KB Output is correct
24 Correct 17 ms 208 KB Output is correct
25 Correct 15 ms 300 KB Output is correct
26 Correct 12 ms 208 KB Output is correct
27 Correct 11 ms 308 KB Output is correct
28 Correct 11 ms 308 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 13 ms 312 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 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 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 6 ms 296 KB Output is correct
19 Correct 17 ms 288 KB Output is correct
20 Correct 8 ms 312 KB Output is correct
21 Correct 10 ms 208 KB Output is correct
22 Correct 15 ms 208 KB Output is correct
23 Correct 17 ms 208 KB Output is correct
24 Correct 17 ms 208 KB Output is correct
25 Correct 15 ms 300 KB Output is correct
26 Correct 12 ms 208 KB Output is correct
27 Correct 11 ms 308 KB Output is correct
28 Correct 11 ms 308 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 13 ms 312 KB Output is correct
31 Correct 36 ms 296 KB Output is correct
32 Correct 39 ms 308 KB Output is correct
33 Correct 62 ms 308 KB Output is correct
34 Incorrect 64 ms 208 KB Wrong Answer [2]
35 Halted 0 ms 0 KB -