oj.uz

Submission #160626

# Submission time Handle Problem Language Result Execution time Memory
160626 2019-10-29T01:21:29 Z dantoh000 Xylophone (JOI18_xylophone) C++14
100 / 100
 130 ms 564 KB 
#include "xylophone.h"

static int A[5000];

void solve(int N) {
    int dir[N+1]; dir[1] = 1;
    int diff[N+1];
    int trip[N+1];
	for (int i = 1; i < N; i++){
        diff[i] = query(i,i+1);
	}
	for (int i = 1; i < N-1; i++){
        trip[i] = query(i,i+2);
        if (trip[i] == diff[i]+diff[i+1]){
            dir[i+1] = dir[i];
        }
        else{
            dir[i+1] = -1*dir[i];
        }
    }
    int ans[N]; ans[1] = 1;
    int ma = 1, mi = 1;
    int maid, miid;
    for (int i = 2; i <= N; i++){
        ans[i] = ans[i-1] + dir[i-1]*diff[i-1];
        if (ans[i] > ma){
            ma = ans[i];
            maid = i;
        }
        if (ans[i] < mi){
            mi = ans[i];
            miid = i;
        }
    }
    int offset = N-ma;
	for(int i = 1; i <= N; i++) {
        ans[i] += offset;
        if (maid < miid){
            ans[i] = N+1-ans[i];
        }
		answer(i, ans[i]);
	}

}

Compilation message

xylophone.cpp:3:12: warning: 'A' defined but not used [-Wunused-variable]
 static int A[5000];
            ^
xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:38:9: warning: 'maid' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (maid < miid){
         ^~
xylophone.cpp:38:9: warning: 'miid' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 3 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 4 ms 296 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 7 ms 248 KB Output is correct
17 Correct 11 ms 376 KB Output is correct
18 Correct 10 ms 308 KB Output is correct
19 Correct 23 ms 376 KB Output is correct
20 Correct 19 ms 376 KB Output is correct
21 Correct 24 ms 376 KB Output is correct
22 Correct 19 ms 248 KB Output is correct
23 Correct 23 ms 380 KB Output is correct
24 Correct 20 ms 248 KB Output is correct
25 Correct 23 ms 376 KB Output is correct
26 Correct 23 ms 304 KB Output is correct
27 Correct 24 ms 248 KB Output is correct
28 Correct 26 ms 248 KB Output is correct
29 Correct 23 ms 376 KB Output is correct
30 Correct 27 ms 248 KB Output is correct
31 Correct 47 ms 376 KB Output is correct
32 Correct 63 ms 376 KB Output is correct
33 Correct 101 ms 564 KB Output is correct
34 Correct 105 ms 332 KB Output is correct
35 Correct 114 ms 376 KB Output is correct
36 Correct 130 ms 424 KB Output is correct
37 Correct 114 ms 376 KB Output is correct
38 Correct 99 ms 376 KB Output is correct
39 Correct 99 ms 376 KB Output is correct
40 Correct 104 ms 352 KB Output is correct
41 Correct 94 ms 388 KB Output is correct
42 Correct 64 ms 404 KB Output is correct
43 Correct 110 ms 336 KB Output is correct
44 Correct 108 ms 460 KB Output is correct
45 Correct 105 ms 376 KB Output is correct
46 Correct 61 ms 392 KB Output is correct
47 Correct 104 ms 376 KB Output is correct
48 Correct 99 ms 376 KB Output is correct
49 Correct 71 ms 392 KB Output is correct
50 Correct 108 ms 376 KB Output is correct
51 Correct 67 ms 432 KB Output is correct
52 Correct 105 ms 464 KB Output is correct
53 Correct 93 ms 324 KB Output is correct
54 Correct 100 ms 452 KB Output is correct
55 Correct 100 ms 376 KB Output is correct
56 Correct 102 ms 376 KB Output is correct
57 Correct 100 ms 376 KB Output is correct
58 Correct 93 ms 376 KB Output is correct
59 Correct 104 ms 376 KB Output is correct
60 Correct 110 ms 376 KB Output is correct