oj.uz

Submission #981342

# Submission time Handle Problem Language Result Execution time Memory
981342 2024-05-13T05:12:27 Z Amaarsaa Xylophone (JOI18_xylophone) C++14
0 / 100
 1 ms 344 KB 
#include<bits/stdc++.h>
#include "xylophone.h"

using namespace std;

int a[5002], ans[5002];
void solve(int N) {
	int ind, mid,i, s,x1, x2, p, n = N, lo, hi;
	
	lo = 1;
	hi = n;
	int b[5005], c[5005], ens[5005];
	while (lo < hi) {
		mid = (lo + hi)/2;
		if ( query(1, mid) == n - 1) hi = mid;
		else lo = mid + 1;
	}
	ind = lo;
	ans[1] = 0;
	ans[2] = 0 + query(1, 2);
	int mx = ans[2];
	for ( i = 3; i <= n; i ++) {
		s = query(i - 1, i);
		p = query(i - 2, i);
		b[i]= s;
		c[i] = p;
		x1 = ans[i - 1] - s;
		x2 = ans[i - 1] + s;
		if ( max(x1, max(ans[i - 1], ans[i - 2])) - min(x1, min(ans[i - 1], ans[i - 2])) == p) {
			ans[i] = x1;
		} 
		if ( max(x2, max(ans[i - 1], ans[i - 2])) - min(x2, min(ans[i - 1], ans[i - 2])) == p) {
			ans[i] = x2;
		} 
		mx = max(mx,ans[i]);
	}
	int j = 1;
	for (i = 1; i <= n; i ++) {
		ens[i] = ans[i]= ans[i] + (n - mx);
		if ( ans[i] == n) j = i;
	}
	sort ( ens + 1, ens + n + 1);
	int can = 1;
	for (i =1; i <= n; i ++) if ( ens[i] != i) can = 0;
	if (  can && j == ind) {
	//	for (i = 1; i <= n; i ++) cout << ans[i] << " ";
		for (i = 1; i <= n; i ++) answer(i, ans[i]);
		return ;
	}
	ans[1] = 0;
	ans[2] = -ans[2];
	mx = 0;
	for ( i = 3; i <= n; i ++) {
		s = b[i];
		p = c[i];
		x1 = ans[i - 1] - s;
		x2 = ans[i - 1] + s;
		if ( max(x1, max(ans[i - 1], ans[i - 2])) - min(x1, min(ans[i - 1], ans[i - 2])) == p) {
			ans[i] = x1;
		} 
		if ( max(x2, max(ans[i - 1], ans[i - 2])) - min(x2, min(ans[i - 1], ans[i - 2])) == p) {
			ans[i] = x2;
		} 
		mx = max(mx,ans[i]);
	}
	for (i = 1; i <= n; i ++) ans[i] = ans[i] + (n - mx);
//	for (i = 1; i <= n; i ++) cout << ans[i] << " ";
	for (i =1 ; i<= n; i++) answer(i, ans[i]);
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 36.0

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

Subtask #3
0 / 53.0

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