oj.uz

Submission #83004

# Submission time Handle Problem Language Result Execution time Memory
83004 2018-11-03T15:10:27 Z Vasiljko Xylophone (JOI18_xylophone) C++14
47 / 100
 82 ms 716 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 lo=2;
    int hi=n-1;

    while(lo<=hi){
        int mid=(lo+hi)>>1;
        if(query(mid,n)==diff){
            lo=mid+1;
        }else{
            ind=mid-1;
            hi=mid-1;
        }
    }*/

    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: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 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 404 KB Output is correct
4 Correct 3 ms 456 KB Output is correct
5 Correct 4 ms 476 KB Output is correct
6 Correct 3 ms 476 KB Output is correct
7 Correct 3 ms 476 KB Output is correct
8 Correct 4 ms 484 KB Output is correct
9 Correct 3 ms 568 KB Output is correct
10 Correct 3 ms 568 KB Output is correct
11 Correct 3 ms 568 KB Output is correct
12 Correct 3 ms 572 KB Output is correct
13 Correct 3 ms 572 KB Output is correct
14 Correct 3 ms 572 KB Output is correct
15 Correct 3 ms 572 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 404 KB Output is correct
4 Correct 3 ms 456 KB Output is correct
5 Correct 4 ms 476 KB Output is correct
6 Correct 3 ms 476 KB Output is correct
7 Correct 3 ms 476 KB Output is correct
8 Correct 4 ms 484 KB Output is correct
9 Correct 3 ms 568 KB Output is correct
10 Correct 3 ms 568 KB Output is correct
11 Correct 3 ms 568 KB Output is correct
12 Correct 3 ms 572 KB Output is correct
13 Correct 3 ms 572 KB Output is correct
14 Correct 3 ms 572 KB Output is correct
15 Correct 3 ms 572 KB Output is correct
16 Correct 4 ms 572 KB Output is correct
17 Correct 7 ms 572 KB Output is correct
18 Correct 8 ms 572 KB Output is correct
19 Correct 10 ms 584 KB Output is correct
20 Correct 15 ms 596 KB Output is correct
21 Correct 18 ms 596 KB Output is correct
22 Correct 16 ms 596 KB Output is correct
23 Correct 8 ms 596 KB Output is correct
24 Correct 12 ms 596 KB Output is correct
25 Correct 15 ms 596 KB Output is correct
26 Correct 10 ms 596 KB Output is correct
27 Correct 20 ms 596 KB Output is correct
28 Correct 16 ms 596 KB Output is correct
29 Correct 10 ms 596 KB Output is correct
30 Correct 17 ms 596 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 404 KB Output is correct
4 Correct 3 ms 456 KB Output is correct
5 Correct 4 ms 476 KB Output is correct
6 Correct 3 ms 476 KB Output is correct
7 Correct 3 ms 476 KB Output is correct
8 Correct 4 ms 484 KB Output is correct
9 Correct 3 ms 568 KB Output is correct
10 Correct 3 ms 568 KB Output is correct
11 Correct 3 ms 568 KB Output is correct
12 Correct 3 ms 572 KB Output is correct
13 Correct 3 ms 572 KB Output is correct
14 Correct 3 ms 572 KB Output is correct
15 Correct 3 ms 572 KB Output is correct
16 Correct 4 ms 572 KB Output is correct
17 Correct 7 ms 572 KB Output is correct
18 Correct 8 ms 572 KB Output is correct
19 Correct 10 ms 584 KB Output is correct
20 Correct 15 ms 596 KB Output is correct
21 Correct 18 ms 596 KB Output is correct
22 Correct 16 ms 596 KB Output is correct
23 Correct 8 ms 596 KB Output is correct
24 Correct 12 ms 596 KB Output is correct
25 Correct 15 ms 596 KB Output is correct
26 Correct 10 ms 596 KB Output is correct
27 Correct 20 ms 596 KB Output is correct
28 Correct 16 ms 596 KB Output is correct
29 Correct 10 ms 596 KB Output is correct
30 Correct 17 ms 596 KB Output is correct
31 Correct 32 ms 596 KB Output is correct
32 Correct 48 ms 604 KB Output is correct
33 Correct 67 ms 716 KB Output is correct
34 Incorrect 82 ms 716 KB Wrong Answer [2]
35 Halted 0 ms 0 KB -