oj.uz

Submission #82996

# Submission time Handle Problem Language Result Execution time Memory
82996 2018-11-03T14:37:16 Z Vasiljko Xylophone (JOI18_xylophone) C++14
47 / 100
 76 ms 716 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;

int a[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);

    for(int i=ind+2;i<=n;i++){
        int p=query(i-2,i);
        int q=query(i-1,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;
        }
    }

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

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

            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;
            }
        }
    }
    for(int i=1;i<=n;i++)answer(i,a[i]);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:10:9: warning: unused variable 'val' [-Wunused-variable]
     int val=query(2,n);
         ^~~
xylophone.cpp:9: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 348 KB Output is correct
3 Correct 2 ms 420 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 4 ms 572 KB Output is correct
6 Correct 3 ms 572 KB Output is correct
7 Correct 4 ms 572 KB Output is correct
8 Correct 3 ms 572 KB Output is correct
9 Correct 3 ms 572 KB Output is correct
10 Correct 3 ms 572 KB Output is correct
11 Correct 4 ms 572 KB Output is correct
12 Correct 4 ms 572 KB Output is correct
13 Correct 4 ms 572 KB Output is correct
14 Correct 3 ms 572 KB Output is correct
15 Correct 4 ms 572 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 348 KB Output is correct
3 Correct 2 ms 420 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 4 ms 572 KB Output is correct
6 Correct 3 ms 572 KB Output is correct
7 Correct 4 ms 572 KB Output is correct
8 Correct 3 ms 572 KB Output is correct
9 Correct 3 ms 572 KB Output is correct
10 Correct 3 ms 572 KB Output is correct
11 Correct 4 ms 572 KB Output is correct
12 Correct 4 ms 572 KB Output is correct
13 Correct 4 ms 572 KB Output is correct
14 Correct 3 ms 572 KB Output is correct
15 Correct 4 ms 572 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 13 ms 588 KB Output is correct
18 Correct 17 ms 588 KB Output is correct
19 Correct 14 ms 588 KB Output is correct
20 Correct 14 ms 588 KB Output is correct
21 Correct 21 ms 588 KB Output is correct
22 Correct 20 ms 588 KB Output is correct
23 Correct 12 ms 716 KB Output is correct
24 Correct 24 ms 716 KB Output is correct
25 Correct 21 ms 716 KB Output is correct
26 Correct 12 ms 716 KB Output is correct
27 Correct 25 ms 716 KB Output is correct
28 Correct 19 ms 716 KB Output is correct
29 Correct 14 ms 716 KB Output is correct
30 Correct 21 ms 716 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 348 KB Output is correct
3 Correct 2 ms 420 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 4 ms 572 KB Output is correct
6 Correct 3 ms 572 KB Output is correct
7 Correct 4 ms 572 KB Output is correct
8 Correct 3 ms 572 KB Output is correct
9 Correct 3 ms 572 KB Output is correct
10 Correct 3 ms 572 KB Output is correct
11 Correct 4 ms 572 KB Output is correct
12 Correct 4 ms 572 KB Output is correct
13 Correct 4 ms 572 KB Output is correct
14 Correct 3 ms 572 KB Output is correct
15 Correct 4 ms 572 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 13 ms 588 KB Output is correct
18 Correct 17 ms 588 KB Output is correct
19 Correct 14 ms 588 KB Output is correct
20 Correct 14 ms 588 KB Output is correct
21 Correct 21 ms 588 KB Output is correct
22 Correct 20 ms 588 KB Output is correct
23 Correct 12 ms 716 KB Output is correct
24 Correct 24 ms 716 KB Output is correct
25 Correct 21 ms 716 KB Output is correct
26 Correct 12 ms 716 KB Output is correct
27 Correct 25 ms 716 KB Output is correct
28 Correct 19 ms 716 KB Output is correct
29 Correct 14 ms 716 KB Output is correct
30 Correct 21 ms 716 KB Output is correct
31 Correct 40 ms 716 KB Output is correct
32 Correct 76 ms 716 KB Output is correct
33 Incorrect 76 ms 716 KB Wrong Answer [2]
34 Halted 0 ms 0 KB -