oj.uz

Submission #319104

# Submission time Handle Problem Language Result Execution time Memory
319104 2020-11-04T00:45:39 Z aZvezda Xylophone (JOI18_xylophone) C++14
100 / 100
 124 ms 612 KB 
#include "xylophone.h"

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const int MAX_N = 5e3 + 10;
int two[MAX_N], three[MAX_N];

void solve(int n) {
	for(int i = 1; i <= n - 1; i ++) {
		two[i] = query(i, i + 1);
	}
	for(int i = 1; i <= n - 2; i ++) {
		three[i] = query(i, i + 2);
	}
	int curr = 0;
	pair<int, int> mn = {0, 1}, mx = {0, 1};
	int last = 1;
	for(int i = 1; i < n; i ++) {
		if(i == 1 || two[i - 1] + two[i] == three[i - 1]) {
			curr += two[i] * last;
		} else {
			last *= -1;
			curr += two[i] * last;
		}
		chkmin(mn, make_pair(curr, i));
		chkmax(mx, make_pair(curr, i));
	}
	if(mn.second > mx.second) {
		last = -1;
		mx.first *= -1;
		mn = mx;
	} else {
		last = 1;
	}
	curr = -mn.first + 1;
	answer(1, curr);
	for(int i = 1; i <= n - 1; i ++) {
		if(i == 1 || two[i - 1] + two[i] == three[i - 1]) {
			curr += two[i] * last;
		} else {
			last *= -1;
			curr += two[i] * last;
		}
		answer(i + 1, curr);
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 15 ms 364 KB Output is correct
19 Correct 22 ms 364 KB Output is correct
20 Correct 18 ms 364 KB Output is correct
21 Correct 22 ms 364 KB Output is correct
22 Correct 17 ms 384 KB Output is correct
23 Correct 18 ms 488 KB Output is correct
24 Correct 19 ms 364 KB Output is correct
25 Correct 11 ms 384 KB Output is correct
26 Correct 18 ms 364 KB Output is correct
27 Correct 12 ms 364 KB Output is correct
28 Correct 18 ms 364 KB Output is correct
29 Correct 20 ms 364 KB Output is correct
30 Correct 17 ms 492 KB Output is correct
31 Correct 38 ms 392 KB Output is correct
32 Correct 45 ms 484 KB Output is correct
33 Correct 79 ms 364 KB Output is correct
34 Correct 89 ms 364 KB Output is correct
35 Correct 87 ms 364 KB Output is correct
36 Correct 90 ms 484 KB Output is correct
37 Correct 116 ms 492 KB Output is correct
38 Correct 115 ms 612 KB Output is correct
39 Correct 89 ms 568 KB Output is correct
40 Correct 100 ms 484 KB Output is correct
41 Correct 93 ms 364 KB Output is correct
42 Correct 91 ms 364 KB Output is correct
43 Correct 67 ms 484 KB Output is correct
44 Correct 90 ms 364 KB Output is correct
45 Correct 92 ms 364 KB Output is correct
46 Correct 113 ms 484 KB Output is correct
47 Correct 92 ms 500 KB Output is correct
48 Correct 99 ms 492 KB Output is correct
49 Correct 118 ms 364 KB Output is correct
50 Correct 95 ms 364 KB Output is correct
51 Correct 100 ms 404 KB Output is correct
52 Correct 86 ms 484 KB Output is correct
53 Correct 92 ms 612 KB Output is correct
54 Correct 106 ms 364 KB Output is correct
55 Correct 110 ms 484 KB Output is correct
56 Correct 77 ms 504 KB Output is correct
57 Correct 95 ms 380 KB Output is correct
58 Correct 124 ms 364 KB Output is correct
59 Correct 67 ms 364 KB Output is correct
60 Correct 88 ms 396 KB Output is correct