Submission #119817

# Submission time Handle Problem Language Result Execution time Memory
119817 2019-06-22T12:49:30 Z keko37 Meetings (JOI19_meetings) C++14
17 / 100
2000 ms 512 KB
#include <bits/stdc++.h>
#include "meetings.h"


using namespace std;

int n;

void Solve (int N) {
	n = N;
	for (int a = 0; a < n; a++) {
		for (int b = a + 1; b < n; b++) {
			int cnt = 0;
			for (int c = 0; c < n; c++) {
				if (c == a || c == b) continue;
				int res = Query(a, b, c);
				if (res == a || res == b) cnt++;
			}
			if (cnt == n-2) Bridge(a, b);
		}
	}
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 27 ms 384 KB Output is correct
15 Correct 28 ms 256 KB Output is correct
16 Correct 26 ms 384 KB Output is correct
17 Correct 29 ms 256 KB Output is correct
18 Correct 29 ms 256 KB Output is correct
19 Correct 28 ms 512 KB Output is correct
20 Correct 29 ms 376 KB Output is correct
21 Correct 26 ms 256 KB Output is correct
22 Correct 27 ms 384 KB Output is correct
23 Correct 30 ms 384 KB Output is correct
24 Correct 37 ms 384 KB Output is correct
25 Correct 36 ms 384 KB Output is correct
26 Correct 37 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 27 ms 384 KB Output is correct
15 Correct 28 ms 256 KB Output is correct
16 Correct 26 ms 384 KB Output is correct
17 Correct 29 ms 256 KB Output is correct
18 Correct 29 ms 256 KB Output is correct
19 Correct 28 ms 512 KB Output is correct
20 Correct 29 ms 376 KB Output is correct
21 Correct 26 ms 256 KB Output is correct
22 Correct 27 ms 384 KB Output is correct
23 Correct 30 ms 384 KB Output is correct
24 Correct 37 ms 384 KB Output is correct
25 Correct 36 ms 384 KB Output is correct
26 Correct 37 ms 384 KB Output is correct
27 Incorrect 230 ms 424 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3029 ms 512 KB Time limit exceeded
2 Halted 0 ms 0 KB -