oj.uz

Submission #704221

# Submission time Handle Problem Language Result Execution time Memory
704221 2023-03-02T00:58:31 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
 166 ms 584 KB 
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;

const int maxn = 5e3+5;

int n;

int A[maxn];
int d[2][maxn];

int gt(int l, int r){
    int mn = n, mx = 1;
    for(int i = l; i <= r; i++){
        mn = min(mn, A[i]);
        mx = max(mx, A[i]);
    }
    return mx - mn;
}

void solve(int N){
    n = N;
    for(int i = 2; i <= n; i++){
        d[0][i] = query(i-1, i);
    }
    for(int i = 3; i <= n; i++){
        d[1][i] = query(i-2, i);
    }
    for(A[1] = 1; A[1] <= n; A[1]++){
        if(A[1] + d[0][2] > n)continue;
        A[2] = A[1] + d[0][2];
        bool chk = 0;
        for(int i = 3; i <= n; i++){
            if(A[i-1]+d[0][i] <= n){
                A[i] = A[i-1]+d[0][i];
                if(gt(i-2, i) == d[1][i])continue;
            }
            if(A[i-1]-d[0][i] >= 1){
                A[i] = A[i-1]-d[0][i];
                if(gt(i-2, i) == d[1][i])continue;
            }
            chk = 1;
            break;
        }
        if(!chk)break;
        if(A[1] - d[0][2] < 1)continue;
        A[2] = A[1] - d[0][2];
        chk = 0;
        for(int i = 3; i <= n; i++){
            if(A[i-1]+d[0][i] <= n){
                A[i] = A[i-1]+d[0][i];
                if(gt(i-2, i) == d[1][i])continue;
            }
            if(A[i-1]-d[0][i] >= 1){
                A[i] = A[i-1]-d[0][i];
                if(gt(i-2, i) == d[1][i])continue;
            }
            chk = 1;
            break;
        }
        if(!chk)break;
    }
    int p1, p2;
    for(int i = 1; i <= n; i++){
        if(A[i] == 1)p1 = i;
        if(A[i] == n)p2 = i;
    }
    if(p1 > p2)for(int i = 1; i <= n; i++)A[i] = n+1-A[i];
	/*for(int i = 1; i <= n; i++){
		//cout << A[i] << " ";
		cout << endl;
	}*/
    for(int i = 1; i <= n; i++){
		answer(i, A[i]);
	}
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:68:5: warning: 'p2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |     if(p1 > p2)for(int i = 1; i <= n; i++)A[i] = n+1-A[i];
      |     ^~
xylophone.cpp:68:5: warning: 'p1' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 308 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 5 ms 300 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 13 ms 208 KB Output is correct
19 Correct 25 ms 292 KB Output is correct
20 Correct 21 ms 308 KB Output is correct
21 Correct 12 ms 308 KB Output is correct
22 Correct 20 ms 300 KB Output is correct
23 Correct 18 ms 300 KB Output is correct
24 Correct 19 ms 208 KB Output is correct
25 Correct 16 ms 308 KB Output is correct
26 Correct 21 ms 308 KB Output is correct
27 Correct 19 ms 308 KB Output is correct
28 Correct 19 ms 308 KB Output is correct
29 Correct 15 ms 304 KB Output is correct
30 Correct 15 ms 304 KB Output is correct
31 Correct 41 ms 296 KB Output is correct
32 Correct 52 ms 288 KB Output is correct
33 Correct 32 ms 304 KB Output is correct
34 Correct 85 ms 308 KB Output is correct
35 Correct 79 ms 304 KB Output is correct
36 Correct 82 ms 312 KB Output is correct
37 Correct 149 ms 336 KB Output is correct
38 Correct 89 ms 312 KB Output is correct
39 Correct 82 ms 304 KB Output is correct
40 Correct 41 ms 420 KB Output is correct
41 Correct 94 ms 304 KB Output is correct
42 Correct 74 ms 300 KB Output is correct
43 Correct 166 ms 584 KB Output is correct
44 Correct 64 ms 292 KB Output is correct
45 Correct 109 ms 292 KB Output is correct
46 Correct 101 ms 320 KB Output is correct
47 Correct 38 ms 308 KB Output is correct
48 Correct 39 ms 308 KB Output is correct
49 Correct 87 ms 428 KB Output is correct
50 Correct 95 ms 436 KB Output is correct
51 Correct 91 ms 316 KB Output is correct
52 Correct 85 ms 416 KB Output is correct
53 Correct 91 ms 328 KB Output is correct
54 Correct 84 ms 320 KB Output is correct
55 Correct 83 ms 300 KB Output is correct
56 Correct 107 ms 452 KB Output is correct
57 Correct 83 ms 304 KB Output is correct
58 Correct 73 ms 308 KB Output is correct
59 Correct 82 ms 432 KB Output is correct
60 Correct 94 ms 424 KB Output is correct