oj.uz

Submission #768833

# Submission time Handle Problem Language Result Execution time Memory
768833 2023-06-28T17:47:27 Z jmyszka2007 Xylophone (JOI18_xylophone) C++17
0 / 100
 0 ms 292 KB 
#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);
		}
	}
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Incorrect 0 ms 208 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Incorrect 0 ms 208 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Incorrect 0 ms 208 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -