oj.uz

Submission #67553

# Submission time Handle Problem Language Result Execution time Memory
67553 2018-08-14T21:34:20 Z JustasZ Xylophone (JOI18_xylophone) C++14
100 / 100
 146 ms 748 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+100;
void solve(int n)
{
    int arr[maxn];
    int two[maxn], three[maxn], sgn[maxn];
    for(int i=1; i<=n-1; i++)
        two[i]=query(i, i+1);
    for(int i=1; i<=n-2; i++)
        three[i]=query(i, i+2);
    if(three[1]==two[1]+two[2])
        sgn[1]=sgn[2]=1;
    else sgn[1]=1, sgn[2]=-1;
    for(int i=3; i<=n-1; i++)
    {
        if(two[i-1]+two[i]!=three[i-1])
            sgn[i]=-sgn[i-1];
        else sgn[i]=sgn[i-1];
    }
    arr[1]=1;
    int mn=INT_MAX;
    for(int i=2; i<=n; i++)
    {
        arr[i]=arr[i-1]+sgn[i-1]*two[i-1];
        mn=min(mn, arr[i]);
    }
    int add=1-mn;
    if(mn<=0)
    for(int i=1; i<=n; i++)
        arr[i]+=add;
    for(int i=1; i<=n; i++)
    {
        if(arr[i]==1)break;
        if(arr[i]==n)
        {
            for(int j=1; j<=n; j++)
                arr[j]=n-arr[j]+1;
            break;
        }
    }
    for(int i=1; i<=n; i++)
        answer(i, arr[i]);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 4 ms 496 KB Output is correct
5 Correct 5 ms 528 KB Output is correct
6 Correct 4 ms 528 KB Output is correct
7 Correct 5 ms 528 KB Output is correct
8 Correct 3 ms 568 KB Output is correct
9 Correct 4 ms 568 KB Output is correct
10 Correct 5 ms 568 KB Output is correct
11 Correct 4 ms 580 KB Output is correct
12 Correct 4 ms 580 KB Output is correct
13 Correct 4 ms 580 KB Output is correct
14 Correct 4 ms 708 KB Output is correct
15 Correct 3 ms 708 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 4 ms 336 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 4 ms 496 KB Output is correct
5 Correct 5 ms 528 KB Output is correct
6 Correct 4 ms 528 KB Output is correct
7 Correct 5 ms 528 KB Output is correct
8 Correct 3 ms 568 KB Output is correct
9 Correct 4 ms 568 KB Output is correct
10 Correct 5 ms 568 KB Output is correct
11 Correct 4 ms 580 KB Output is correct
12 Correct 4 ms 580 KB Output is correct
13 Correct 4 ms 580 KB Output is correct
14 Correct 4 ms 708 KB Output is correct
15 Correct 3 ms 708 KB Output is correct
16 Correct 7 ms 708 KB Output is correct
17 Correct 10 ms 708 KB Output is correct
18 Correct 11 ms 716 KB Output is correct
19 Correct 25 ms 716 KB Output is correct
20 Correct 21 ms 716 KB Output is correct
21 Correct 10 ms 716 KB Output is correct
22 Correct 18 ms 716 KB Output is correct
23 Correct 15 ms 716 KB Output is correct
24 Correct 17 ms 716 KB Output is correct
25 Correct 24 ms 716 KB Output is correct
26 Correct 28 ms 716 KB Output is correct
27 Correct 20 ms 716 KB Output is correct
28 Correct 20 ms 716 KB Output is correct
29 Correct 18 ms 716 KB Output is correct
30 Correct 20 ms 716 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 4 ms 496 KB Output is correct
5 Correct 5 ms 528 KB Output is correct
6 Correct 4 ms 528 KB Output is correct
7 Correct 5 ms 528 KB Output is correct
8 Correct 3 ms 568 KB Output is correct
9 Correct 4 ms 568 KB Output is correct
10 Correct 5 ms 568 KB Output is correct
11 Correct 4 ms 580 KB Output is correct
12 Correct 4 ms 580 KB Output is correct
13 Correct 4 ms 580 KB Output is correct
14 Correct 4 ms 708 KB Output is correct
15 Correct 3 ms 708 KB Output is correct
16 Correct 7 ms 708 KB Output is correct
17 Correct 10 ms 708 KB Output is correct
18 Correct 11 ms 716 KB Output is correct
19 Correct 25 ms 716 KB Output is correct
20 Correct 21 ms 716 KB Output is correct
21 Correct 10 ms 716 KB Output is correct
22 Correct 18 ms 716 KB Output is correct
23 Correct 15 ms 716 KB Output is correct
24 Correct 17 ms 716 KB Output is correct
25 Correct 24 ms 716 KB Output is correct
26 Correct 28 ms 716 KB Output is correct
27 Correct 20 ms 716 KB Output is correct
28 Correct 20 ms 716 KB Output is correct
29 Correct 18 ms 716 KB Output is correct
30 Correct 20 ms 716 KB Output is correct
31 Correct 52 ms 716 KB Output is correct
32 Correct 58 ms 716 KB Output is correct
33 Correct 101 ms 716 KB Output is correct
34 Correct 103 ms 732 KB Output is correct
35 Correct 92 ms 732 KB Output is correct
36 Correct 132 ms 732 KB Output is correct
37 Correct 80 ms 732 KB Output is correct
38 Correct 99 ms 748 KB Output is correct
39 Correct 106 ms 748 KB Output is correct
40 Correct 51 ms 748 KB Output is correct
41 Correct 96 ms 748 KB Output is correct
42 Correct 82 ms 748 KB Output is correct
43 Correct 88 ms 748 KB Output is correct
44 Correct 93 ms 748 KB Output is correct
45 Correct 87 ms 748 KB Output is correct
46 Correct 94 ms 748 KB Output is correct
47 Correct 85 ms 748 KB Output is correct
48 Correct 88 ms 748 KB Output is correct
49 Correct 74 ms 748 KB Output is correct
50 Correct 79 ms 748 KB Output is correct
51 Correct 105 ms 748 KB Output is correct
52 Correct 110 ms 748 KB Output is correct
53 Correct 86 ms 748 KB Output is correct
54 Correct 87 ms 748 KB Output is correct
55 Correct 113 ms 748 KB Output is correct
56 Correct 146 ms 748 KB Output is correct
57 Correct 118 ms 748 KB Output is correct
58 Correct 106 ms 748 KB Output is correct
59 Correct 118 ms 748 KB Output is correct
60 Correct 111 ms 748 KB Output is correct