oj.uz

Submission #342213

# Submission time Handle Problem Language Result Execution time Memory
342213 2021-01-01T15:42:55 Z bigDuck Xylophone (JOI18_xylophone) C++14
100 / 100
 129 ms 1288 KB 
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount


#include "xylophone.h"

/*
    query(s, t);
    answer(i, a);
*/

int d[5010][2];

map<int, int> h;

int a[5010];

int sgn[5010];

void solve(int N) {
    int n=N;

    for(int i=2; i<=n; i++){
        d[i][0]=query(i-1, i);
        if(i>2){
            d[i][1]=query(i-2, i);
        }
    }
    d[2][1]=d[2][0];
    //d[2][0]=|a2-a1|

    //pozitiv
    int f=0, l=0;
    bool ok=true;
    sgn[1]=+1;
    int sum=0;
    h[0]=1;
    for(int i=2; i<=n; i++){
        int d1=d[i-1][0], d2=d[i][0], d3=d[i][1];
        if(d3==(d1+d2)){
            sgn[i]=sgn[i-1];
        }
        else{
            sgn[i]=-sgn[i-1];
        }
        sum+=sgn[i]*d[i][0];
        h[sum]=i;
        if(h[sum+(n-1)]!=0 ){
            ok=false; break;
        }
        if(h[sum-(n-1) ]!=0){
            f=h[sum-(n-1)]; l=i;
        }
    }

    if(ok){


        a[f]=1; a[l]=N;

            a[f]=1; a[l]=N;

    for(int i=f-1; i>=1; i--){
        a[i]=a[i+1]-sgn[i+1]*d[i+1][0];
    }
    for(int i=f+1; i<=N; i++){
        a[i]=a[i-1]+sgn[i]*d[i][0];
    }

    for(int i=1; i<=n; i++){
            //cout<<a[i]<<endl;
        answer(i, a[i]);
    }

    return;
    }


    h.clear();
    sgn[1]=-1;
    sum=0;
    h[0]=1;
    for(int i=2; i<=n; i++){
        int d1=d[i-1][0], d2=d[i][0], d3=d[i][1];
        if(d3==(d1+d2)){
            sgn[i]=sgn[i-1];
        }
        else{
            if( (d3==(d1)) || (d3==(d2)) ){
                sgn[i]=-sgn[i-1];
            }
        }
        sum+=sgn[i]*d[i][0];
        h[sum]=i;
        if(h[sum-(n-1)]!=0 ){
            f=h[sum-(n-1)], l=i;
        }
    }
    a[f]=1; a[l]=N;

    for(int i=f-1; i>=1; i--){
        a[i]=a[i+1]-sgn[i+1]*d[i+1][0];
    }
    for(int i=f+1; i<=N; i++){
        a[i]=a[i-1]+sgn[i]*d[i][0];
    }
    for(int i=1; i<=n; i++){
        answer(i, a[i]);
    }

}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 8 ms 364 KB Output is correct
18 Correct 16 ms 492 KB Output is correct
19 Correct 23 ms 492 KB Output is correct
20 Correct 18 ms 492 KB Output is correct
21 Correct 21 ms 492 KB Output is correct
22 Correct 22 ms 492 KB Output is correct
23 Correct 18 ms 492 KB Output is correct
24 Correct 21 ms 492 KB Output is correct
25 Correct 17 ms 492 KB Output is correct
26 Correct 18 ms 492 KB Output is correct
27 Correct 19 ms 492 KB Output is correct
28 Correct 19 ms 492 KB Output is correct
29 Correct 12 ms 512 KB Output is correct
30 Correct 19 ms 620 KB Output is correct
31 Correct 25 ms 748 KB Output is correct
32 Correct 56 ms 768 KB Output is correct
33 Correct 82 ms 1132 KB Output is correct
34 Correct 92 ms 1004 KB Output is correct
35 Correct 98 ms 1132 KB Output is correct
36 Correct 92 ms 1260 KB Output is correct
37 Correct 112 ms 1132 KB Output is correct
38 Correct 119 ms 1132 KB Output is correct
39 Correct 96 ms 1260 KB Output is correct
40 Correct 78 ms 876 KB Output is correct
41 Correct 104 ms 1004 KB Output is correct
42 Correct 113 ms 1132 KB Output is correct
43 Correct 111 ms 1132 KB Output is correct
44 Correct 78 ms 1260 KB Output is correct
45 Correct 84 ms 1196 KB Output is correct
46 Correct 126 ms 1132 KB Output is correct
47 Correct 98 ms 1132 KB Output is correct
48 Correct 126 ms 876 KB Output is correct
49 Correct 88 ms 1132 KB Output is correct
50 Correct 112 ms 1032 KB Output is correct
51 Correct 100 ms 1288 KB Output is correct
52 Correct 101 ms 1132 KB Output is correct
53 Correct 84 ms 1004 KB Output is correct
54 Correct 118 ms 1132 KB Output is correct
55 Correct 93 ms 876 KB Output is correct
56 Correct 117 ms 876 KB Output is correct
57 Correct 122 ms 1132 KB Output is correct
58 Correct 92 ms 1004 KB Output is correct
59 Correct 82 ms 876 KB Output is correct
60 Correct 129 ms 1132 KB Output is correct