Submission #647271

#	Time	Username	Problem	Language	Result	Execution time	Memory
647271		PoPularPlusPlus	Xylophone (JOI18_xylophone)	C++17	47 / 100	73 ms	328 KiB

xylophone

#include "xylophone.h"
#include <bits/stdc++.h>

using namespace std;

static int A[5000];

int cal(int a , int b , int c){
	return max({a,b,c}) - min({a,b,c});
}

void solve(int N){
	int l = 2 , r = N;
	int ans[N+1];
	int cur = 0;
	while(l <= r){
		int mid = (l + r)/2;
		int val = query(1 , mid);
		if(val == N-1){
			cur = mid;
			r = mid - 1;
		}
		else l = mid + 1;
	}
	ans[cur] = N;
	if(cur + 1 <= N){
		ans[cur+1] = N - query(cur , cur + 1);
	}
	ans[cur-1] = N - query(cur - 1 , cur);
	for(int i = cur - 2; i >= 1; i--){
		int val = query(i , i+1);
		int case1 = ans[i+1]-val;
		int case2 = ans[i+1]+val;
		if(case2 > N)ans[i] = case1;
		else if(case1 < 1)ans[i] = case2;
		else {
			int val1 = query(i , i + 2);
			if(case1 >= 1 && cal(case1 , ans[i+1], ans[i+2]) == val1){
				ans[i] = case1;
			}
			else ans[i] = val + ans[i+1];
		}
	}
	for(int i = cur + 2; i <= N; i++){
		int val = query(i - 1 , i);
		int case1 = ans[i-1] - val;
		int case2 = ans[i-1] + val;
		if(case2 > N)ans[i] = case1;
		else if(case1 < 1)ans[i] = case2;
		else {
			int val1 = query(i - 2 , i);
			if(case1 >= 1 && cal(ans[i-2] , ans[i-1] , case1) == val1){
				ans[i] = case1;
			}
			else ans[i] = ans[i-1] + val;
		}
	}
	for(int i = 1; i <= N; i++){
		answer(i , ans[i]);
	}
}

Compilation message (stderr)

xylophone.cpp:6:12: warning: 'A' defined but not used [-Wunused-variable]
    6 | static int A[5000];
      |            ^

• Subtask 1: 11 / 11
• Subtask 2: 36 / 36
• Subtask 3: 0 / 53