oj.uz

Submission #82998

# Submission time Handle Problem Language Result Execution time Memory
82998 2018-11-03T14:58:26 Z Vasiljko Xylophone (JOI18_xylophone) C++14
47 / 100
 68 ms 700 KB 
#include <bits/stdc++.h>
using namespace std;

void solve(int N);
int query(int s, int t);
void answer(int i, int a);


int a[5000];
bool vis[5000];

void solve(int n) {
    int diff=n-1;
    int ind;
    int val=query(2,n);
    for(int i=1;i<n;i++){
        int val=query(i+1,n);
        if(val!=diff){
            ind=i;
            break;
        }
    }

    a[ind]=1;
    a[ind+1]=1+query(ind,ind+1);
    if(ind>1){
        a[ind-1]=1+query(ind-1,ind);
        vis[a[ind-1]]=true;
    }
    vis[a[ind]]=true;
    vis[a[ind+1]]=true;

    for(int i=ind+2;i<=n;i++){
        int q=query(i-1,i);

        if(vis[a[i-1]+q]){
            a[i]=a[i-1]-q;
            continue;
        }
        if(vis[a[i-1]-q]){
            a[i]=a[i-1]+q;
            continue;
        }

        int p=query(i-2,i);

        int val=a[i-1]+q;
        if(max(val,max(a[i-1],a[i-2]))-min(val,min(a[i-1],a[i-2]))==p){
            a[i]=val;
        }else{
            a[i]=a[i-1]-q;
        }
        vis[a[i]]=true;
    }

    if(ind>1){
        for(int i=ind-2;i>=1;i--){
            int q=query(i,i+1);

            if(vis[a[i+1]+q]){
                a[i]=a[i+1]-q;
                continue;
            }
            if(vis[a[i+1]-q]){
                a[i]=a[i+1]+q;
                continue;
            }

            int p=query(i,i+2);

            int val=a[i+1]+q;
            if(max(val,max(a[i+1],a[i+2]))-min(val,min(a[i+1],a[i+2]))==p){
                a[i]=val;
            }else{
                a[i]=a[i+1]-q;
            }
            vis[a[i]]=true;
        }
    }
    for(int i=1;i<=n;i++)answer(i,a[i]);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:15:9: warning: unused variable 'val' [-Wunused-variable]
     int val=query(2,n);
         ^~~
xylophone.cpp:14:9: warning: 'ind' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int ind;
         ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 4 ms 452 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 3 ms 472 KB Output is correct
7 Correct 3 ms 484 KB Output is correct
8 Correct 4 ms 488 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 4 ms 620 KB Output is correct
13 Correct 3 ms 688 KB Output is correct
14 Correct 4 ms 688 KB Output is correct
15 Correct 3 ms 688 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 4 ms 452 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 3 ms 472 KB Output is correct
7 Correct 3 ms 484 KB Output is correct
8 Correct 4 ms 488 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 4 ms 620 KB Output is correct
13 Correct 3 ms 688 KB Output is correct
14 Correct 4 ms 688 KB Output is correct
15 Correct 3 ms 688 KB Output is correct
16 Correct 4 ms 688 KB Output is correct
17 Correct 12 ms 688 KB Output is correct
18 Correct 8 ms 688 KB Output is correct
19 Correct 18 ms 688 KB Output is correct
20 Correct 15 ms 700 KB Output is correct
21 Correct 18 ms 700 KB Output is correct
22 Correct 10 ms 700 KB Output is correct
23 Correct 8 ms 700 KB Output is correct
24 Correct 12 ms 700 KB Output is correct
25 Correct 14 ms 700 KB Output is correct
26 Correct 18 ms 700 KB Output is correct
27 Correct 11 ms 700 KB Output is correct
28 Correct 10 ms 700 KB Output is correct
29 Correct 10 ms 700 KB Output is correct
30 Correct 16 ms 700 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 4 ms 452 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 3 ms 472 KB Output is correct
7 Correct 3 ms 484 KB Output is correct
8 Correct 4 ms 488 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 4 ms 620 KB Output is correct
13 Correct 3 ms 688 KB Output is correct
14 Correct 4 ms 688 KB Output is correct
15 Correct 3 ms 688 KB Output is correct
16 Correct 4 ms 688 KB Output is correct
17 Correct 12 ms 688 KB Output is correct
18 Correct 8 ms 688 KB Output is correct
19 Correct 18 ms 688 KB Output is correct
20 Correct 15 ms 700 KB Output is correct
21 Correct 18 ms 700 KB Output is correct
22 Correct 10 ms 700 KB Output is correct
23 Correct 8 ms 700 KB Output is correct
24 Correct 12 ms 700 KB Output is correct
25 Correct 14 ms 700 KB Output is correct
26 Correct 18 ms 700 KB Output is correct
27 Correct 11 ms 700 KB Output is correct
28 Correct 10 ms 700 KB Output is correct
29 Correct 10 ms 700 KB Output is correct
30 Correct 16 ms 700 KB Output is correct
31 Correct 35 ms 700 KB Output is correct
32 Correct 48 ms 700 KB Output is correct
33 Correct 68 ms 700 KB Output is correct
34 Incorrect 68 ms 700 KB Wrong Answer [2]
35 Halted 0 ms 0 KB -