oj.uz

Submission #70778

# Submission time Handle Problem Language Result Execution time Memory
70778 2018-08-23T10:51:37 Z dnass Xylophone (JOI18_xylophone) C++14
0 / 100
 4 ms 516 KB 
#include "xylophone.h"
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int n;
int a[5010];
bool found[5010];
int place_1, place_n;

int bin_search_n(int l, int r){
	if(l==r) return l;
	if(l+1==r){
		int x = query(1, r);
		if(x==n-1) return r;
		else return l;
	}
	int mid = (l+r)/2;
	int x = query(1, mid);
	if(x<n-1) return bin_search_n(mid+1, r);
	else return bin_search_n(l, mid);
}

int bin_search_1(int l, int r){
	if(l==r) return l;
	if(l+1==r){
		int x = query(r, n);
		if(x==n-1) return r;
		else return l;
	}
	int mid = (l+r)/2;
	int x = query(mid, n);
	if(x<n-1) return bin_search_1(l, mid-1);
	else return bin_search_1(mid, r);
}

void solve(int N) {
	n = N;
	memset(found, false, sizeof found);
	place_n = bin_search_n(1, n); a[place_n] = n; found[n] = true;
	place_1 = bin_search_1(1, n); a[place_1] = 1; found[1] = true;
	for(int i=place_1-1;i>0;i--){
		int x = query(i, i+1);
		int mx = a[i+1]+x, mn = a[i+1]-x;
		if(mx>n||found[mx]){
			a[i] = mn;
			found[mn] = true;
		}else if(mn<1||found[mn]){
			a[i] = mx;
			found[mx] = true;
		}else{
			int y = query(i, i+2);
			if(a[i+2]>a[i+1]){
				if(y==a[i+2]-mn){
					a[i] = mn;
					found[mn] = true;
				}else{
					a[i] = mx;
					found[mx] = true;
				}
			}else{
				if(y==mx-a[i+2]){
					a[i] = mx;
					found[mx] = true;
				}else{
					a[i] = mn;
					found[mn] = true;
				}
			}
		}
	}
	for(int i=place_1+1;i<=n;i++){
		if(i==place_n) continue;
		int x = query(i-1, i);
		int mx = a[i-1]+x, mn = a[i-1]-x;
		if(mx>n||found[mx]){
			a[i] = mn;
			found[mn] = true;
		}else if(mn<1||found[mn]){
			a[i] = mx;
			found[mx] = true;
		}else{
			int y = query(i-2, i);
			if(a[i-2]>a[i-1]){
				if(y==a[i-2]-mn){
					a[i] = mn;
					found[mn] = true;
				}else{
					a[i] = mx;
					found[mx] = true;
				}
			}else{
				if(y==mx-a[i-2]){
					a[i] = mx;
					found[mx] = true;
				}else{
					a[i] = mn;
					found[mn] = true;
				}
			}
		}
	}
	for(int i=1;i<=n;i++){
		//printf("%d ", a[i]);
		answer(i, a[i]);
	}
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 4 ms 436 KB Output is correct
5 Correct 4 ms 484 KB Output is correct
6 Incorrect 3 ms 516 KB Wrong Answer [7]
7 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 4 ms 436 KB Output is correct
5 Correct 4 ms 484 KB Output is correct
6 Incorrect 3 ms 516 KB Wrong Answer [7]
7 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 4 ms 436 KB Output is correct
5 Correct 4 ms 484 KB Output is correct
6 Incorrect 3 ms 516 KB Wrong Answer [7]
7 Halted 0 ms 0 KB -