oj.uz

Submission #503227

# Submission time Handle Problem Language Result Execution time Memory
503227 2022-01-07T14:38:09 Z MasterTaster Xylophone (JOI18_xylophone) C++14
100 / 100
 97 ms 544 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define MAXN 5010

using namespace std;

static int A[5000];

bool bio[MAXN];
int ress[MAXN], diff[MAXN];

void solve(int n) {

    for (int i=2; i<=n; i++)
        diff[i]=query(i-1, i);

    int l=1, r=n;
    int kec=-1;
    while (l<=r)
    {
        int mid=l+(r-l)/2;
        if (query(mid, n)==n-1)
        {
            kec=mid;
            l=mid+1;
        }
        else
            r=mid-1;
    }
    ress[kec]=1; bio[1]=true;

    if (kec!=1) ress[kec-1]=1+diff[kec];
    ress[kec+1]=1+diff[kec+1];

    bio[ress[kec-1]]=true; bio[ress[kec+1]]=true;

    for (int i=kec-1; i>1; i--)
    {
        if (bio[ress[i]+diff[i]]) ress[i-1]=ress[i]-diff[i];
        else if (bio[ress[i]-diff[i]]) ress[i-1]=ress[i]+diff[i];

        else if (ress[i]>ress[i+1])
        {
            int sta=query(i-1, i+1);
            if (sta==(ress[i]-ress[i+1])) { ress[i-1]=ress[i]-diff[i]; }
            else if (sta==(diff[i]+ress[i]-ress[i+1])) { ress[i-1]=ress[i]+diff[i]; }
            else { ress[i-1]=ress[i]-diff[i]; }
        }
        else
        {
            int sta=query(i-1, i+1);
            if (sta==(ress[i+1]-ress[i])) { ress[i-1]=ress[i]+diff[i]; }
            else if (sta==(diff[i]+ress[i+1]-ress[i])) { ress[i-1]=ress[i]-diff[i]; }
            else { ress[i-1]=ress[i]+diff[i]; }
        }
        bio[ress[i-1]]=true;
    }

    for (int i=kec+1; i<n; i++)
    {
        if (bio[ress[i]+diff[i+1]]) ress[i+1]=ress[i]-diff[i+1];
        else if (bio[ress[i]-diff[i+1]]) ress[i+1]=ress[i]+diff[i+1];

        else if (ress[i]>ress[i-1])
        {
            int sta=query(i-1, i+1);
            if (sta==(ress[i]-ress[i-1])) { ress[i+1]=ress[i]-diff[i+1]; }
            else if (sta==(diff[i+1]+ress[i]-ress[i-1])) { ress[i+1]=ress[i]+diff[i+1]; }
            else { ress[i+1]=ress[i]-diff[i+1]; }
        }
        else
        {
            int sta=query(i-1, i+1);
            if (sta==(ress[i-1]-ress[i])) { ress[i+1]=ress[i]+diff[i+1]; }
            else if (sta==(diff[i+1]+ress[i-1]-ress[i])) { ress[i+1]=ress[i]-diff[i+1]; }
            else { ress[i+1]=ress[i]+diff[i+1]; }
        }

        bio[ress[i+1]]=true;
    }

    for (int i=1; i<=n; i++) answer(i, ress[i]);
}

Compilation message

xylophone.cpp:13:12: warning: 'A' defined but not used [-Wunused-variable]
   13 | static int A[5000];
      |            ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 2 ms 296 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 296 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 2 ms 296 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 296 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 4 ms 200 KB Output is correct
17 Correct 8 ms 200 KB Output is correct
18 Correct 7 ms 308 KB Output is correct
19 Correct 19 ms 300 KB Output is correct
20 Correct 15 ms 296 KB Output is correct
21 Correct 13 ms 300 KB Output is correct
22 Correct 19 ms 208 KB Output is correct
23 Correct 10 ms 296 KB Output is correct
24 Correct 12 ms 300 KB Output is correct
25 Correct 17 ms 288 KB Output is correct
26 Correct 20 ms 300 KB Output is correct
27 Correct 15 ms 200 KB Output is correct
28 Correct 15 ms 292 KB Output is correct
29 Correct 13 ms 200 KB Output is correct
30 Correct 17 ms 292 KB Output is correct
31 Correct 29 ms 296 KB Output is correct
32 Correct 36 ms 288 KB Output is correct
33 Correct 63 ms 288 KB Output is correct
34 Correct 84 ms 280 KB Output is correct
35 Correct 81 ms 292 KB Output is correct
36 Correct 50 ms 292 KB Output is correct
37 Correct 46 ms 316 KB Output is correct
38 Correct 64 ms 304 KB Output is correct
39 Correct 71 ms 304 KB Output is correct
40 Correct 69 ms 320 KB Output is correct
41 Correct 57 ms 420 KB Output is correct
42 Correct 49 ms 292 KB Output is correct
43 Correct 58 ms 296 KB Output is correct
44 Correct 65 ms 320 KB Output is correct
45 Correct 68 ms 420 KB Output is correct
46 Correct 70 ms 280 KB Output is correct
47 Correct 60 ms 296 KB Output is correct
48 Correct 97 ms 312 KB Output is correct
49 Correct 64 ms 320 KB Output is correct
50 Correct 64 ms 292 KB Output is correct
51 Correct 86 ms 296 KB Output is correct
52 Correct 85 ms 300 KB Output is correct
53 Correct 60 ms 412 KB Output is correct
54 Correct 89 ms 300 KB Output is correct
55 Correct 63 ms 280 KB Output is correct
56 Correct 77 ms 304 KB Output is correct
57 Correct 83 ms 544 KB Output is correct
58 Correct 62 ms 296 KB Output is correct
59 Correct 76 ms 284 KB Output is correct
60 Correct 85 ms 296 KB Output is correct