oj.uz

Submission #291258

# Submission time Handle Problem Language Result Execution time Memory
291258 2020-09-05T01:26:27 Z eggag32 Xylophone (JOI18_xylophone) C++17
47 / 100
 47 ms 504 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

void solve(int n){
	int l = 0, r = n - 2;
	while(l < r){
		int mid = (l + r + 1) / 2;
		int q = query(mid + 1, n);
		if(q == (n - 1)) l = mid;
		else r = mid - 1;
	}
	vi ans(n, 0), vis(n + 1, 0);
	ans[l] = 1;
	vis[1] = 1;
	if(l > 0){
		int qu2 = query(l, l + 1);
		ans[l - 1] = qu2 + 1;
		vis[ans[l - 1]] = 1;
		for(int i = l - 2; i >= 0; i--){
			int qu1 = query(i + 1, i + 2);
			if(vis[ans[i + 1] + qu1]){
				ans[i] = ans[i + 1] - qu1;
				vis[ans[i]] = 1;
				continue;
			}
			if(vis[ans[i + 1] - qu1]){
				ans[i] = ans[i + 1] + qu1;
				vis[ans[i]] = 1;
				continue;
			}
			vi cur = {ans[i + 1], ans[i + 2], ans[i + 1] + qu1};
			sort(all(cur));
			int qu = query(i + 1, i + 3);
			if(cur[2] - cur[0] == qu) ans[i] = ans[i + 1] + qu1;
			else ans[i] = ans[i + 1] - qu1;
			vis[ans[i]] = 1;
		}
	}
	if(l < (n - 1)){
		int qu2 = query(l + 1, l + 2);
		ans[l + 1] = qu2 + 1;
		vis[ans[l + 1]] = 1;
		for(int i = l + 2; i < n; i++){
			int qu1 = query(i, i + 1);
			if(vis[ans[i - 1] + qu1]){
				ans[i] = ans[i - 1] - qu1;
				vis[ans[i]] = 1;
				continue;
			}
			if(vis[ans[i - 1] - qu1]){
				ans[i] = ans[i - 1] + qu1;
				vis[ans[i]] = 1;
				continue;
			}
			vi cur = {ans[i - 2], ans[i - 1], ans[i - 1] + qu1};
			sort(all(cur));
			int qu = query(i - 1, i + 1);
			if(cur[2] - cur[0] == qu) ans[i] = ans[i - 1] + qu1;
			else ans[i] = ans[i - 1] - qu1;
			vis[ans[i]] = 1;
		}
	}
	rep(i, n) answer(i + 1, ans[i]);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 7 ms 256 KB Output is correct
18 Correct 14 ms 372 KB Output is correct
19 Correct 15 ms 376 KB Output is correct
20 Correct 16 ms 384 KB Output is correct
21 Correct 15 ms 384 KB Output is correct
22 Correct 17 ms 504 KB Output is correct
23 Correct 9 ms 384 KB Output is correct
24 Correct 13 ms 256 KB Output is correct
25 Correct 14 ms 376 KB Output is correct
26 Correct 13 ms 384 KB Output is correct
27 Correct 18 ms 384 KB Output is correct
28 Correct 16 ms 376 KB Output is correct
29 Correct 14 ms 376 KB Output is correct
30 Correct 9 ms 380 KB Output is correct
31 Correct 41 ms 384 KB Output is correct
32 Correct 47 ms 384 KB Output is correct
33 Runtime error 21 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -