oj.uz

Submission #210282

# Submission time Handle Problem Language Result Execution time Memory
210282 2020-03-17T01:45:36 Z eric_xiao Xylophone (JOI18_xylophone) C++14
100 / 100
 99 ms 504 KB 
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;
int A[100009],lf[100009],lf2[100009];
void solve(int N)
{
    int i,j,k,mn;
    A[1] = 0;
    A[2] = A[1]+query(1,2);
    mn = min(A[1],A[2]);
    for(i = 3;i <= N;i++)
    {
        lf[i] = query(i-1,i);
        lf2[i] = query(i-2,i);
        A[i] = A[i-1]+lf[i];
        if(max({A[i],A[i-1],A[i-2]}) - min({A[i],A[i-1],A[i-2]}) != lf2[i])
        {
            A[i] = A[i-1] - lf[i];
        }
        mn = min(mn,A[i]);
    }
    int cg = 0,sm = 0;
    for(i = 1;i <= N;i++)
    {
        A[i] = A[i] - mn + 1;
        if(A[i] == 1) sm = 1;
        if(A[i] == N)
        {
            if(sm == 1) cg = 1;
        }
    }
    if(cg == 0)
    {
        for(i = 1;i <= N;i++)
        {
            A[i] = N + 1 - A[i];
        }
    }
    for(i = 1;i <= N;i++)
    {
        answer(i,A[i]);
    }
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:7:11: warning: unused variable 'j' [-Wunused-variable]
     int i,j,k,mn;
           ^
xylophone.cpp:7:13: warning: unused variable 'k' [-Wunused-variable]
     int i,j,k,mn;
             ^

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 336 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 7 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 248 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 6 ms 248 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 6 ms 248 KB Output is correct
15 Correct 7 ms 248 KB Output is correct
16 Correct 9 ms 248 KB Output is correct
17 Correct 15 ms 248 KB Output is correct
18 Correct 21 ms 340 KB Output is correct
19 Correct 20 ms 248 KB Output is correct
20 Correct 25 ms 252 KB Output is correct
21 Correct 22 ms 248 KB Output is correct
22 Correct 22 ms 376 KB Output is correct
23 Correct 27 ms 248 KB Output is correct
24 Correct 23 ms 336 KB Output is correct
25 Correct 21 ms 248 KB Output is correct
26 Correct 21 ms 376 KB Output is correct
27 Correct 25 ms 252 KB Output is correct
28 Correct 20 ms 248 KB Output is correct
29 Correct 22 ms 248 KB Output is correct
30 Correct 24 ms 376 KB Output is correct
31 Correct 42 ms 248 KB Output is correct
32 Correct 56 ms 300 KB Output is correct
33 Correct 70 ms 380 KB Output is correct
34 Correct 93 ms 376 KB Output is correct
35 Correct 86 ms 376 KB Output is correct
36 Correct 85 ms 376 KB Output is correct
37 Correct 79 ms 380 KB Output is correct
38 Correct 87 ms 376 KB Output is correct
39 Correct 91 ms 376 KB Output is correct
40 Correct 85 ms 376 KB Output is correct
41 Correct 66 ms 332 KB Output is correct
42 Correct 88 ms 376 KB Output is correct
43 Correct 68 ms 380 KB Output is correct
44 Correct 52 ms 328 KB Output is correct
45 Correct 88 ms 352 KB Output is correct
46 Correct 95 ms 376 KB Output is correct
47 Correct 93 ms 376 KB Output is correct
48 Correct 91 ms 380 KB Output is correct
49 Correct 93 ms 376 KB Output is correct
50 Correct 98 ms 376 KB Output is correct
51 Correct 99 ms 376 KB Output is correct
52 Correct 88 ms 376 KB Output is correct
53 Correct 92 ms 376 KB Output is correct
54 Correct 88 ms 504 KB Output is correct
55 Correct 65 ms 408 KB Output is correct
56 Correct 90 ms 376 KB Output is correct
57 Correct 89 ms 504 KB Output is correct
58 Correct 94 ms 376 KB Output is correct
59 Correct 90 ms 376 KB Output is correct
60 Correct 91 ms 456 KB Output is correct