Submission #683924

# Submission time Handle Problem Language Result Execution time Memory
683924 2023-01-19T16:41:40 Z rainboy Park (JOI17_park) C
10 / 100
108 ms 372 KB
#include "park.h"

const int N = 1400;

void Detect(int t, int n) {
	int used[N];
	for (int i = 0; i < n; i++)
		for (int j = i + 1; j < n; j++) {
			for (int k = 0; k < n; k++)
				used[k] = k == i || k == j ? 1 : 0;
			if (Ask(i, j, used))
				Answer(i, j);
		}
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 18 ms 324 KB Output is correct
3 Correct 14 ms 212 KB Output is correct
4 Correct 15 ms 320 KB Output is correct
5 Correct 15 ms 300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 107 ms 372 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 105 ms 364 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 340 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 108 ms 372 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -