Submission #763086

# Submission time Handle Problem Language Result Execution time Memory
763086 2023-06-22T03:12:04 Z NhanBeoo Xylophone (JOI18_xylophone) C++17
100 / 100
104 ms 448 KB
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair< int, int > ii;
typedef pair< int, ii > iii;
typedef vector< int > vi;
typedef vector< ii > vii;
typedef vector< iii > viii;
typedef vector< vi > vvi;
typedef vector< vii > vvii;
typedef vector< viii > vviii;
#define hdp 1e9+7
#define MAX LLONG_MAX
#define st first
#define nd second

const int N = 5005;
int a[N];

void solve(int n){
	a[2] = query(1, 2);
	for(int i=3; i<=n; i++){
		int x = query(i-1, i);
		int y = query(i-2, i);
		if((y != x + abs(a[i-1] - a[i-2]) and a[i-2] > a[i-1]) or (y == x + abs(a[i-1] - a[i-2]) and a[i-1] > a[i-2]))
			a[i] = a[i-1] + x;
		else 
			a[i] = a[i-1] - x;
	}
	if(min_element(a+1, a+n+1) > max_element(a+1, a+n+1))
		for(int i=1; i<=n; i++) a[i] *= -1;
	int m = *min_element(a+1, a+n+1);
	for(int i=1; i<=n; i++) answer(i, a[i]-m+1);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 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 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 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 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 14 ms 292 KB Output is correct
19 Correct 20 ms 208 KB Output is correct
20 Correct 12 ms 208 KB Output is correct
21 Correct 18 ms 304 KB Output is correct
22 Correct 17 ms 300 KB Output is correct
23 Correct 10 ms 208 KB Output is correct
24 Correct 12 ms 308 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 8 ms 308 KB Output is correct
27 Correct 16 ms 208 KB Output is correct
28 Correct 15 ms 208 KB Output is correct
29 Correct 13 ms 304 KB Output is correct
30 Correct 18 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 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 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 14 ms 292 KB Output is correct
19 Correct 20 ms 208 KB Output is correct
20 Correct 12 ms 208 KB Output is correct
21 Correct 18 ms 304 KB Output is correct
22 Correct 17 ms 300 KB Output is correct
23 Correct 10 ms 208 KB Output is correct
24 Correct 12 ms 308 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 8 ms 308 KB Output is correct
27 Correct 16 ms 208 KB Output is correct
28 Correct 15 ms 208 KB Output is correct
29 Correct 13 ms 304 KB Output is correct
30 Correct 18 ms 208 KB Output is correct
31 Correct 36 ms 304 KB Output is correct
32 Correct 28 ms 292 KB Output is correct
33 Correct 64 ms 292 KB Output is correct
34 Correct 93 ms 288 KB Output is correct
35 Correct 87 ms 288 KB Output is correct
36 Correct 68 ms 300 KB Output is correct
37 Correct 84 ms 300 KB Output is correct
38 Correct 74 ms 304 KB Output is correct
39 Correct 70 ms 292 KB Output is correct
40 Correct 67 ms 304 KB Output is correct
41 Correct 56 ms 304 KB Output is correct
42 Correct 93 ms 292 KB Output is correct
43 Correct 51 ms 308 KB Output is correct
44 Correct 65 ms 300 KB Output is correct
45 Correct 61 ms 288 KB Output is correct
46 Correct 64 ms 296 KB Output is correct
47 Correct 60 ms 308 KB Output is correct
48 Correct 100 ms 296 KB Output is correct
49 Correct 65 ms 304 KB Output is correct
50 Correct 61 ms 292 KB Output is correct
51 Correct 79 ms 336 KB Output is correct
52 Correct 104 ms 284 KB Output is correct
53 Correct 86 ms 332 KB Output is correct
54 Correct 57 ms 300 KB Output is correct
55 Correct 50 ms 304 KB Output is correct
56 Correct 82 ms 300 KB Output is correct
57 Correct 66 ms 300 KB Output is correct
58 Correct 83 ms 448 KB Output is correct
59 Correct 77 ms 328 KB Output is correct
60 Correct 71 ms 304 KB Output is correct