oj.uz

Submission #995970

# Submission time Handle Problem Language Result Execution time Memory
995970 2024-06-10T06:25:13 Z cowwycow Xylophone (JOI18_xylophone) C++14
100 / 100
 67 ms 996 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
#define name "aaaaaa"
using ll = long long;
using pii = pair<ll, ll>;
 
void file(){
}
 
const int maxn = 1e4 + 5;
ll a[maxn], type[maxn], out[maxn];
 
void solve (int n){
	a[2] = query(1, 2);
	type[2] = 0;
	ll last = a[2];
	for(int i = 3; i <= n; i++){
		ll q = query(i - 1, i), sus = query(i - 2, i);
		a[i] = q;
		if(last + q == sus){
			type[i] = type[i - 1];
		}else{
			type[i] = !type[i - 1];
		}
		last = q;
	}
	for(int i = 1; i <= n; i++){
		out[i] = out[i - 1] + a[i] * (-type[i] * 2 + 1);
	}
	int maxpos = 1, minpos = 1;
	for(int i = 2; i <= n; i++){
		if(out[maxpos] < out[i]){
			maxpos = i;
		}
		if(out[minpos] > out[i]){
			minpos = i;
		}
	}
	if(maxpos < minpos){
		for(int i = 1; i <= n; i++){
			type[i] = !type[i];
			out[i] = out[i - 1] + a[i] * (-type[i] * 2 + 1);
		}
	}
	ll in = 1e18;
	for(int i = 1; i <= n; i++){
		in = min(in, out[i]);
	}
	for(int i = 1; i <= n; i++){
		out[i] = out[i] - in + 1;
	}
	for(int i = 1; i <= n; i++){
		answer(i, out[i]);
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 8 ms 460 KB Output is correct
19 Correct 12 ms 604 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 11 ms 468 KB Output is correct
24 Correct 13 ms 600 KB Output is correct
25 Correct 6 ms 464 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 8 ms 600 KB Output is correct
28 Correct 9 ms 608 KB Output is correct
29 Correct 9 ms 600 KB Output is correct
30 Correct 9 ms 600 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 8 ms 460 KB Output is correct
19 Correct 12 ms 604 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 11 ms 468 KB Output is correct
24 Correct 13 ms 600 KB Output is correct
25 Correct 6 ms 464 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 8 ms 600 KB Output is correct
28 Correct 9 ms 608 KB Output is correct
29 Correct 9 ms 600 KB Output is correct
30 Correct 9 ms 600 KB Output is correct
31 Correct 25 ms 460 KB Output is correct
32 Correct 29 ms 856 KB Output is correct
33 Correct 38 ms 868 KB Output is correct
34 Correct 60 ms 724 KB Output is correct
35 Correct 60 ms 508 KB Output is correct
36 Correct 50 ms 596 KB Output is correct
37 Correct 65 ms 504 KB Output is correct
38 Correct 67 ms 976 KB Output is correct
39 Correct 55 ms 600 KB Output is correct
40 Correct 47 ms 468 KB Output is correct
41 Correct 63 ms 688 KB Output is correct
42 Correct 65 ms 716 KB Output is correct
43 Correct 62 ms 984 KB Output is correct
44 Correct 55 ms 712 KB Output is correct
45 Correct 64 ms 456 KB Output is correct
46 Correct 50 ms 856 KB Output is correct
47 Correct 57 ms 996 KB Output is correct
48 Correct 47 ms 468 KB Output is correct
49 Correct 60 ms 744 KB Output is correct
50 Correct 51 ms 592 KB Output is correct
51 Correct 46 ms 496 KB Output is correct
52 Correct 43 ms 732 KB Output is correct
53 Correct 50 ms 988 KB Output is correct
54 Correct 37 ms 608 KB Output is correct
55 Correct 48 ms 740 KB Output is correct
56 Correct 56 ms 592 KB Output is correct
57 Correct 58 ms 728 KB Output is correct
58 Correct 56 ms 736 KB Output is correct
59 Correct 59 ms 708 KB Output is correct
60 Correct 59 ms 720 KB Output is correct