oj.uz

Submission #558102

# Submission time Handle Problem Language Result Execution time Memory
558102 2022-05-06T20:54:32 Z groshi Xylophone (JOI18_xylophone) C++17
100 / 100
 70 ms 428 KB 
#include<iostream>
#include "xylophone.h"
using namespace std;
bool bylo[100000];
int jaki[100000];
/*int query(int x,int y)
{
    cout<<x<<" "<<y<<"\n";
    int co;
    cin>>co;
    return co;
}
int answer(int x,int y)
{
    cout<<y<<" ";
}*/
void solve(int n)
{
    int pocz=1,kon=n+1,sre,ostd=n-1;
    while(pocz<kon)
    {
        sre=(pocz+kon)/2;
        int k=query(sre,n);
        if(k==n-1)
        {
            ostd=sre;
            pocz=sre+1;
        }
        else{
            kon=sre;
        }
    }
    jaki[ostd]=1;
    bylo[1]=1;
    for(int i=ostd+1;i<=n;i++)
    {
        int k=query(i-1,i);
        if(jaki[i-1]-k<=0 || bylo[jaki[i-1]-k]==1)
            jaki[i]=jaki[i-1]+k;
        else if(jaki[i-1]+k>n || bylo[jaki[i-1]+k]==1)
            jaki[i]=jaki[i-1]-k;
        else{
            int k1=query(i-2,i);
            if(jaki[i-2]<jaki[i-1])
            {
                int odl=jaki[i-1]-jaki[i-2];
                if(k1==odl+k)
                    jaki[i]=jaki[i-1]+k;
                else jaki[i]=jaki[i-1]-k;
            }
            else{
                int odl=jaki[i-2]-jaki[i-1];
                if(k1==k+odl)
                    jaki[i]=jaki[i-1]-k;
                else jaki[i]=jaki[i-1]+k;
            }
        }
        bylo[jaki[i]]=1;
    }
    for(int i=ostd-1;i>=1;i--)
    {
        int k=query(i,i+1);
        if(jaki[i+1]-k<=0 || bylo[jaki[i+1]-k]==1)
            jaki[i]=jaki[i+1]+k;
        else if(jaki[i+1]+k>n || bylo[jaki[i+1]+k]==1)
            jaki[i]=jaki[i+1]-k;
        else{
            int k1=query(i,i+2);
            if(jaki[i+2]<jaki[i+1])
            {
                int odl=jaki[i+1]-jaki[i+2];
                if(k1==odl+k)
                    jaki[i]=jaki[i+1]+k;
                else jaki[i]=jaki[i+1]-k;
            }
            else{
                int odl=jaki[i+2]-jaki[i+1];
                if(k1==k+odl)
                    jaki[i]=jaki[i+1]-k;
                else jaki[i]=jaki[i+1]+k;
            }
        }
        bylo[jaki[i]]=1;
    }
    for(int i=1;i<=n;i++)
        answer(i,jaki[i]);
}

Subtask #1
11.0 / 11.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 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 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 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 2 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 12 ms 316 KB Output is correct
21 Correct 13 ms 208 KB Output is correct
22 Correct 11 ms 316 KB Output is correct
23 Correct 8 ms 308 KB Output is correct
24 Correct 9 ms 308 KB Output is correct
25 Correct 9 ms 308 KB Output is correct
26 Correct 11 ms 208 KB Output is correct
27 Correct 11 ms 208 KB Output is correct
28 Correct 12 ms 308 KB Output is correct
29 Correct 15 ms 308 KB Output is correct
30 Correct 11 ms 312 KB Output is correct
31 Correct 23 ms 316 KB Output is correct
32 Correct 32 ms 304 KB Output is correct
33 Correct 44 ms 312 KB Output is correct
34 Correct 55 ms 320 KB Output is correct
35 Correct 47 ms 316 KB Output is correct
36 Correct 40 ms 304 KB Output is correct
37 Correct 45 ms 312 KB Output is correct
38 Correct 46 ms 428 KB Output is correct
39 Correct 27 ms 320 KB Output is correct
40 Correct 54 ms 316 KB Output is correct
41 Correct 55 ms 336 KB Output is correct
42 Correct 47 ms 316 KB Output is correct
43 Correct 30 ms 320 KB Output is correct
44 Correct 42 ms 308 KB Output is correct
45 Correct 45 ms 312 KB Output is correct
46 Correct 46 ms 328 KB Output is correct
47 Correct 58 ms 308 KB Output is correct
48 Correct 60 ms 304 KB Output is correct
49 Correct 43 ms 308 KB Output is correct
50 Correct 44 ms 332 KB Output is correct
51 Correct 24 ms 308 KB Output is correct
52 Correct 52 ms 312 KB Output is correct
53 Correct 49 ms 312 KB Output is correct
54 Correct 47 ms 332 KB Output is correct
55 Correct 49 ms 328 KB Output is correct
56 Correct 44 ms 312 KB Output is correct
57 Correct 49 ms 320 KB Output is correct
58 Correct 55 ms 320 KB Output is correct
59 Correct 70 ms 328 KB Output is correct
60 Correct 44 ms 300 KB Output is correct