oj.uz

Submission #742106

# Submission time Handle Problem Language Result Execution time Memory
742106 2023-05-15T15:30:43 Z onebit1024 Xylophone (JOI18_xylophone) C++17
100 / 100
 79 ms 336 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

// static int A[5000];
int pos = 1;
void get(int l, int r, int n){
	if(l > r)return;
	
	int m = (l+r)/2;
	if(query(m,n)==(n-1)) pos = m,get(m+1,r,n);
	else  get(l,m-1,n);
}

void solve(int n) {

	vector<int>a(n+1);
	get(1,n,n);

	a[pos] = 1;
	if(pos > 1)a[pos-1] = 1+query(pos-1,pos);
	if(pos < n)a[pos+1] = 1+query(pos,pos+1);
	vector<int>taken(n+1);
	for(int i = pos-1;i<=pos+1;++i)taken[a[i]] = 1;
	for(int i = pos-2;i>=1;--i){
		set<int>opt;
		int c = query(i,i+1);
		if(a[i+1]-c >= 1 && !taken[a[i+1]-c])opt.insert(a[i+1]-c);
		if(a[i+1]+c <= n && !taken[a[i+1]+c])opt.insert(a[i+1]+c);
		if(opt.size()==1){
			a[i] = *opt.begin();
			taken[a[i]] = 1;
			continue;
		}
		int v = abs(a[i+1]-a[i+2]);
		int w = query(i,i+2);
		if(w==v){
			// a[i] lies between a[i+1] and a[i-1]
			for(auto x : opt){
				if(x >= min(a[i+1],a[i+2]) && x<= max(a[i+1],a[i+2])){
					a[i] = x;
					taken[x] = 1;
					continue;
				}
			}
		}else{
			for(auto x : opt){
				set<int>kk = {a[i+1],a[i+2],x};
				if((*--kk.end())-*kk.begin() == w){
					a[i] = x;
					taken[x] = 1;
					continue;
				}
			}
		}
	}
	for(int i = pos+2;i<=n;++i){
		set<int>opt;
		int c = query(i-1,i);
		if(a[i-1]-c >= 1 && !taken[a[i-1]-c])opt.insert(a[i-1]-c);
		if(a[i-1]+c <= n && !taken[a[i-1]+c])opt.insert(a[i-1]+c);
		if(opt.size()==1){
			a[i] = *opt.begin();
			taken[a[i]] = 1;
			continue;
		}
		int v = abs(a[i-1]-a[i-2]);
		int w = query(i-2,i);
		if(w==v){
			// a[i] lies between a[i-1] and a[i-2]
			for(auto x : opt){
				if(x >= min(a[i-1],a[i-2]) && x<= max(a[i-1],a[i-2])){
					a[i] = x;
					taken[x] = 1;
					continue;
				}
			}
		}else{
			for(auto x : opt){
				set<int>kk = {a[i-1],a[i-2],x};
				if((*--kk.end())-*kk.begin() == w){
					a[i] = x;
					taken[x] = 1;
					continue;
				}
			}
		}
	}	
	for(int i = 1;i<=n;++i){
		answer(i,a[i]);
	}
}

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 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 1 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 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 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 1 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 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 10 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 11 ms 288 KB Output is correct
20 Correct 16 ms 284 KB Output is correct
21 Correct 14 ms 256 KB Output is correct
22 Correct 14 ms 208 KB Output is correct
23 Correct 11 ms 312 KB Output is correct
24 Correct 10 ms 304 KB Output is correct
25 Correct 12 ms 208 KB Output is correct
26 Correct 15 ms 284 KB Output is correct
27 Correct 13 ms 308 KB Output is correct
28 Correct 12 ms 288 KB Output is correct
29 Correct 17 ms 208 KB Output is correct
30 Correct 11 ms 296 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 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 1 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 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 10 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 11 ms 288 KB Output is correct
20 Correct 16 ms 284 KB Output is correct
21 Correct 14 ms 256 KB Output is correct
22 Correct 14 ms 208 KB Output is correct
23 Correct 11 ms 312 KB Output is correct
24 Correct 10 ms 304 KB Output is correct
25 Correct 12 ms 208 KB Output is correct
26 Correct 15 ms 284 KB Output is correct
27 Correct 13 ms 308 KB Output is correct
28 Correct 12 ms 288 KB Output is correct
29 Correct 17 ms 208 KB Output is correct
30 Correct 11 ms 296 KB Output is correct
31 Correct 27 ms 296 KB Output is correct
32 Correct 50 ms 320 KB Output is correct
33 Correct 44 ms 312 KB Output is correct
34 Correct 79 ms 328 KB Output is correct
35 Correct 58 ms 316 KB Output is correct
36 Correct 33 ms 336 KB Output is correct
37 Correct 52 ms 336 KB Output is correct
38 Correct 51 ms 336 KB Output is correct
39 Correct 68 ms 336 KB Output is correct
40 Correct 59 ms 328 KB Output is correct
41 Correct 55 ms 336 KB Output is correct
42 Correct 45 ms 336 KB Output is correct
43 Correct 45 ms 336 KB Output is correct
44 Correct 55 ms 336 KB Output is correct
45 Correct 77 ms 336 KB Output is correct
46 Correct 54 ms 320 KB Output is correct
47 Correct 73 ms 336 KB Output is correct
48 Correct 63 ms 328 KB Output is correct
49 Correct 63 ms 316 KB Output is correct
50 Correct 59 ms 316 KB Output is correct
51 Correct 55 ms 336 KB Output is correct
52 Correct 55 ms 336 KB Output is correct
53 Correct 52 ms 316 KB Output is correct
54 Correct 70 ms 336 KB Output is correct
55 Correct 63 ms 316 KB Output is correct
56 Correct 51 ms 336 KB Output is correct
57 Correct 47 ms 336 KB Output is correct
58 Correct 63 ms 336 KB Output is correct
59 Correct 75 ms 316 KB Output is correct
60 Correct 63 ms 336 KB Output is correct