Submission #650487

#	Time	Username	Problem	Language	Result	Execution time	Memory
650487		Koful123	Xylophone (JOI18_xylophone)	C++17	0 / 100	0 ms	208 KiB

xylophone

#include <bits/stdc++.h>
#include <xylophone.h>
using namespace std;

void solve(int n){
	vector<int> v(n+1),th(n+1),se(n+1);
	for(int i=1;i<=n;i++){
		se[i] = query(i-1,i);
		if(i != 1) th[i] = query(i-2,i);
	}
	for(int i=1;i<=n;i++){
		int ok = 1; v[1] = i;
		vector<int> vis(n+1,0); vis[i] = 1;
		for(int j=2;j<=n;j++){
			if(th[i] == se[i-1]){
				v[i] = v[i-1] + (v[i-2] > v[i-1] ? se[i] : -se[i]);
			}
			else{
				if(v[i-2] > v[i-1]){
					if(se[i] == th[i]) v[i] = v[i-1] + se[i];
					else v[i] = v[i-1] - se[i];
				}
				else{
					if(th[i] == se[i]) v[i] = v[i-1] - se[i];
					else v[i] = v[i-1] + se[i];;
				}
			}
			if(vis[v[i]]){
				ok = 0;
				break;
			}
			vis[v[i]] = 1;
		}
		if(!ok) continue;
		for(int i=1;i<=n;i++){
			answer(i,v[i]);
		}
	}
}

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