oj.uz

Submission #122026

# Submission time Handle Problem Language Result Execution time Memory
122026 2019-06-27T11:41:46 Z eriksuenderhauf Xylophone (JOI18_xylophone) C++11
100 / 100
 105 ms 476 KB 
    #include "xylophone.h"
     
    void solve(int N) {
    	int A[N];
    	A[0] = 0;
    	int D[N - 1];
    	int T[N - 2];
    	for(int i = 1; i < N; i++) {
    		D[i - 1] = query(i, i + 1);
    	}
    	for(int i = 2; i < N; i++) {
    		T[i - 2] = query(i - 1, i + 1);
    	}
    	A[1] = D[0];
    	bool up = true;
    	for(int i = 2; i < N; i++) {
    		if(D[i - 2] + D[i - 1] != T[i - 2]) {
    			up = !up;
    		}
    		A[i] = A[i - 1] + D[i - 1] * ((int)up * 2 - 1);
    	}
    	int mx = 0, mn = 0;
    	int mxp = 0, mnp = 0;
    	for(int i = 1; i < N; i++) {
    		if(A[i] > mx) {
    			mx = A[i];
    			mxp = i;
    		}
    		if(A[i] < mn) {
    			mn = A[i];
    			mnp = i;
    		}
    	}
    	if(mnp < mxp) {
    		for(int i = 0; i < N; i++) {
    			answer(i + 1, A[i] - mn + 1);
    		}
    	} else {
    		for(int i = 0; i < N; i++) {
    			answer(i + 1, mx - A[i] + 1);
    		}
    	}
    	
    	return;
    }

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 6 ms 256 KB Output is correct
16 Correct 7 ms 284 KB Output is correct
17 Correct 8 ms 384 KB Output is correct
18 Correct 15 ms 256 KB Output is correct
19 Correct 26 ms 376 KB Output is correct
20 Correct 24 ms 256 KB Output is correct
21 Correct 9 ms 320 KB Output is correct
22 Correct 16 ms 256 KB Output is correct
23 Correct 17 ms 256 KB Output is correct
24 Correct 10 ms 312 KB Output is correct
25 Correct 16 ms 384 KB Output is correct
26 Correct 24 ms 256 KB Output is correct
27 Correct 20 ms 256 KB Output is correct
28 Correct 15 ms 256 KB Output is correct
29 Correct 16 ms 256 KB Output is correct
30 Correct 14 ms 256 KB Output is correct
31 Correct 29 ms 404 KB Output is correct
32 Correct 68 ms 384 KB Output is correct
33 Correct 50 ms 312 KB Output is correct
34 Correct 63 ms 328 KB Output is correct
35 Correct 49 ms 448 KB Output is correct
36 Correct 61 ms 332 KB Output is correct
37 Correct 41 ms 320 KB Output is correct
38 Correct 62 ms 476 KB Output is correct
39 Correct 61 ms 384 KB Output is correct
40 Correct 105 ms 256 KB Output is correct
41 Correct 33 ms 400 KB Output is correct
42 Correct 94 ms 456 KB Output is correct
43 Correct 77 ms 380 KB Output is correct
44 Correct 34 ms 316 KB Output is correct
45 Correct 34 ms 320 KB Output is correct
46 Correct 95 ms 376 KB Output is correct
47 Correct 48 ms 328 KB Output is correct
48 Correct 57 ms 376 KB Output is correct
49 Correct 93 ms 336 KB Output is correct
50 Correct 61 ms 376 KB Output is correct
51 Correct 51 ms 384 KB Output is correct
52 Correct 34 ms 336 KB Output is correct
53 Correct 64 ms 384 KB Output is correct
54 Correct 74 ms 448 KB Output is correct
55 Correct 98 ms 256 KB Output is correct
56 Correct 69 ms 328 KB Output is correct
57 Correct 93 ms 404 KB Output is correct
58 Correct 69 ms 256 KB Output is correct
59 Correct 36 ms 400 KB Output is correct
60 Correct 99 ms 256 KB Output is correct