Submission #768833

#TimeUsernameProblemLanguageResultExecution timeMemory
768833jmyszka2007Xylophone (JOI18_xylophone)C++17
0 / 100
0 ms292 KiB
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n) {
	int l = 1;
	while(query(l, n) == n - 1) {
		l++;
	}
	l--;
	for(int i = 1; i <= n; i++) {
		if(i <= l) {
			answer(i, query(i, l) + 1);
		}
		else {
			answer(i, query(l, i) + 1);
		}
	}
}
	
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...