oj.uz

Submission #742091

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

// static int A[5000];

void solve(int n) {

	vector<int>a(n+1);
	int pos = 1;
	for(int i = n-1;i>=1;--i){
		if(query(i,n)==(n-1)){
			pos = i;
			break;
		}
	}
	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 1 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 3 ms 208 KB Output is correct
5 Correct 1 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 1 ms 208 KB Output is correct
9 Correct 3 ms 256 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 2 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 1 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 3 ms 208 KB Output is correct
5 Correct 1 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 1 ms 208 KB Output is correct
9 Correct 3 ms 256 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 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 13 ms 304 KB Output is correct
19 Correct 19 ms 300 KB Output is correct
20 Correct 15 ms 288 KB Output is correct
21 Correct 12 ms 300 KB Output is correct
22 Correct 18 ms 208 KB Output is correct
23 Correct 19 ms 304 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 13 ms 304 KB Output is correct
26 Correct 19 ms 208 KB Output is correct
27 Correct 8 ms 304 KB Output is correct
28 Correct 23 ms 280 KB Output is correct
29 Correct 22 ms 300 KB Output is correct
30 Correct 16 ms 308 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 208 KB Output is correct
5 Correct 1 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 1 ms 208 KB Output is correct
9 Correct 3 ms 256 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 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 13 ms 304 KB Output is correct
19 Correct 19 ms 300 KB Output is correct
20 Correct 15 ms 288 KB Output is correct
21 Correct 12 ms 300 KB Output is correct
22 Correct 18 ms 208 KB Output is correct
23 Correct 19 ms 304 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 13 ms 304 KB Output is correct
26 Correct 19 ms 208 KB Output is correct
27 Correct 8 ms 304 KB Output is correct
28 Correct 23 ms 280 KB Output is correct
29 Correct 22 ms 300 KB Output is correct
30 Correct 16 ms 308 KB Output is correct
31 Correct 35 ms 300 KB Output is correct
32 Correct 61 ms 308 KB Output is correct
33 Correct 93 ms 328 KB Output is correct
34 Correct 98 ms 444 KB Output is correct
35 Correct 82 ms 320 KB Output is correct
36 Correct 117 ms 304 KB Output is correct
37 Correct 46 ms 336 KB Output is correct
38 Correct 93 ms 316 KB Output is correct
39 Correct 143 ms 312 KB Output is correct
40 Incorrect 77 ms 312 KB Wrong Answer [2]
41 Halted 0 ms 0 KB -