oj.uz

Submission #954108

# Submission time Handle Problem Language Result Execution time Memory
954108 2024-03-27T09:45:14 Z irmuun Xylophone (JOI18_xylophone) C++17
100 / 100
 57 ms 700 KB 
#include<bits/stdc++.h>
#include "xylophone.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

void solve(int n){
    int a[n+5];
    a[1]=0;
    int d[n+5];
    for(int i=1;i<n;i++){
        d[i]=query(i,i+1);
    }
    a[2]=d[1];
    bool add=true;
    for(int i=3;i<=n;i++){
        int D=query(i-2,i);
        if(d[i-2]+d[i-1]==D){
            if(add){
                a[i]=a[i-1]+d[i-1];
            }
            else{
                a[i]=a[i-1]-d[i-1];
            }
        }
        else{
            if(add) add=false;
            else add=true;
            if(add){
                a[i]=a[i-1]+d[i-1];
            }
            else{
                a[i]=a[i-1]-d[i-1];
            }
        }
    }
    int mn=1e9;
    for(int i=1;i<=n;i++){
        mn=min(mn,a[i]);
    }
    mn=-mn+1;
    bool flag=false,ok=true;
    for(int i=1;i<=n;i++){
        a[i]+=mn;
        if(a[i]==1){
            flag=true;
        }
        if(a[i]==n){
            if(!flag){
                ok=false;
            }
        }
    }
    if(!ok){
        for(int i=1;i<=n;i++){
            a[i]=n+1-a[i];
        }
    }
    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 0 ms 344 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 4 ms 440 KB Output is correct
18 Correct 7 ms 436 KB Output is correct
19 Correct 10 ms 444 KB Output is correct
20 Correct 9 ms 444 KB Output is correct
21 Correct 10 ms 596 KB Output is correct
22 Correct 7 ms 440 KB Output is correct
23 Correct 7 ms 440 KB Output is correct
24 Correct 9 ms 436 KB Output is correct
25 Correct 8 ms 436 KB Output is correct
26 Correct 9 ms 440 KB Output is correct
27 Correct 10 ms 440 KB Output is correct
28 Correct 10 ms 444 KB Output is correct
29 Correct 8 ms 440 KB Output is correct
30 Correct 7 ms 444 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 4 ms 440 KB Output is correct
18 Correct 7 ms 436 KB Output is correct
19 Correct 10 ms 444 KB Output is correct
20 Correct 9 ms 444 KB Output is correct
21 Correct 10 ms 596 KB Output is correct
22 Correct 7 ms 440 KB Output is correct
23 Correct 7 ms 440 KB Output is correct
24 Correct 9 ms 436 KB Output is correct
25 Correct 8 ms 436 KB Output is correct
26 Correct 9 ms 440 KB Output is correct
27 Correct 10 ms 440 KB Output is correct
28 Correct 10 ms 444 KB Output is correct
29 Correct 8 ms 440 KB Output is correct
30 Correct 7 ms 444 KB Output is correct
31 Correct 17 ms 448 KB Output is correct
32 Correct 28 ms 432 KB Output is correct
33 Correct 37 ms 700 KB Output is correct
34 Correct 39 ms 460 KB Output is correct
35 Correct 47 ms 452 KB Output is correct
36 Correct 46 ms 464 KB Output is correct
37 Correct 53 ms 444 KB Output is correct
38 Correct 54 ms 464 KB Output is correct
39 Correct 54 ms 452 KB Output is correct
40 Correct 42 ms 468 KB Output is correct
41 Correct 47 ms 448 KB Output is correct
42 Correct 43 ms 444 KB Output is correct
43 Correct 49 ms 448 KB Output is correct
44 Correct 39 ms 464 KB Output is correct
45 Correct 41 ms 444 KB Output is correct
46 Correct 48 ms 448 KB Output is correct
47 Correct 48 ms 448 KB Output is correct
48 Correct 42 ms 448 KB Output is correct
49 Correct 50 ms 452 KB Output is correct
50 Correct 45 ms 448 KB Output is correct
51 Correct 55 ms 468 KB Output is correct
52 Correct 42 ms 444 KB Output is correct
53 Correct 48 ms 452 KB Output is correct
54 Correct 52 ms 452 KB Output is correct
55 Correct 57 ms 448 KB Output is correct
56 Correct 38 ms 464 KB Output is correct
57 Correct 40 ms 448 KB Output is correct
58 Correct 45 ms 444 KB Output is correct
59 Correct 57 ms 444 KB Output is correct
60 Correct 46 ms 444 KB Output is correct