#include "meetings.h"
#include <cstring>
#include <vector>
#include <algorithm>
#define N 20005
using namespace std;
bool v1[N], v2[N];
vector<int> gr[N];
void f(int p) {
int i;
if (v1[p]) return;
v1[p] = 1;
for (i = 0; i < gr[p].size(); i++) {
f(gr[p][i]);
}
for (i = 0; i < gr[p].size(); i++) {
int ne = gr[p][i];
if (!v2[ne]) {
v2[ne] = 1;
Bridge(min(p, ne), max(p, ne));
}
}
}
void Solve(int n) {
int i, j, t;
for (i = 1; i < n; i++) gr[0].push_back(i);
for (i = 1; i < n; i++) {
for (j = i + 1; j < n; j++) {
t = Query(0, i, j);
if (t != i) gr[t].push_back(i);
if (t != j) gr[t].push_back(j);
}
}
for (i = 0; i < n; i++) {
sort(gr[i].begin(), gr[i].end());
gr[i].erase(unique(gr[i].begin(), gr[i].end()), gr[i].end());
}
f(0);
}
Compilation message
meetings.cpp: In function 'void f(int)':
meetings.cpp:15:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < gr[p].size(); i++) {
~~^~~~~~~~~~~~~~
meetings.cpp:18:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < gr[p].size(); i++) {
~~^~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
760 KB |
Output is correct |
2 |
Correct |
5 ms |
760 KB |
Output is correct |
3 |
Correct |
5 ms |
760 KB |
Output is correct |
4 |
Correct |
5 ms |
888 KB |
Output is correct |
5 |
Correct |
5 ms |
888 KB |
Output is correct |
6 |
Correct |
5 ms |
888 KB |
Output is correct |
7 |
Correct |
5 ms |
888 KB |
Output is correct |
8 |
Correct |
5 ms |
760 KB |
Output is correct |
9 |
Correct |
5 ms |
888 KB |
Output is correct |
10 |
Correct |
5 ms |
760 KB |
Output is correct |
11 |
Correct |
5 ms |
760 KB |
Output is correct |
12 |
Correct |
5 ms |
760 KB |
Output is correct |
13 |
Correct |
5 ms |
760 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
760 KB |
Output is correct |
2 |
Correct |
5 ms |
760 KB |
Output is correct |
3 |
Correct |
5 ms |
760 KB |
Output is correct |
4 |
Correct |
5 ms |
888 KB |
Output is correct |
5 |
Correct |
5 ms |
888 KB |
Output is correct |
6 |
Correct |
5 ms |
888 KB |
Output is correct |
7 |
Correct |
5 ms |
888 KB |
Output is correct |
8 |
Correct |
5 ms |
760 KB |
Output is correct |
9 |
Correct |
5 ms |
888 KB |
Output is correct |
10 |
Correct |
5 ms |
760 KB |
Output is correct |
11 |
Correct |
5 ms |
760 KB |
Output is correct |
12 |
Correct |
5 ms |
760 KB |
Output is correct |
13 |
Correct |
5 ms |
760 KB |
Output is correct |
14 |
Correct |
6 ms |
760 KB |
Output is correct |
15 |
Correct |
6 ms |
764 KB |
Output is correct |
16 |
Correct |
6 ms |
1016 KB |
Output is correct |
17 |
Correct |
6 ms |
760 KB |
Output is correct |
18 |
Correct |
6 ms |
760 KB |
Output is correct |
19 |
Correct |
6 ms |
888 KB |
Output is correct |
20 |
Correct |
5 ms |
760 KB |
Output is correct |
21 |
Correct |
5 ms |
760 KB |
Output is correct |
22 |
Correct |
6 ms |
760 KB |
Output is correct |
23 |
Correct |
6 ms |
888 KB |
Output is correct |
24 |
Correct |
6 ms |
760 KB |
Output is correct |
25 |
Correct |
6 ms |
760 KB |
Output is correct |
26 |
Correct |
6 ms |
760 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
760 KB |
Output is correct |
2 |
Correct |
5 ms |
760 KB |
Output is correct |
3 |
Correct |
5 ms |
760 KB |
Output is correct |
4 |
Correct |
5 ms |
888 KB |
Output is correct |
5 |
Correct |
5 ms |
888 KB |
Output is correct |
6 |
Correct |
5 ms |
888 KB |
Output is correct |
7 |
Correct |
5 ms |
888 KB |
Output is correct |
8 |
Correct |
5 ms |
760 KB |
Output is correct |
9 |
Correct |
5 ms |
888 KB |
Output is correct |
10 |
Correct |
5 ms |
760 KB |
Output is correct |
11 |
Correct |
5 ms |
760 KB |
Output is correct |
12 |
Correct |
5 ms |
760 KB |
Output is correct |
13 |
Correct |
5 ms |
760 KB |
Output is correct |
14 |
Correct |
6 ms |
760 KB |
Output is correct |
15 |
Correct |
6 ms |
764 KB |
Output is correct |
16 |
Correct |
6 ms |
1016 KB |
Output is correct |
17 |
Correct |
6 ms |
760 KB |
Output is correct |
18 |
Correct |
6 ms |
760 KB |
Output is correct |
19 |
Correct |
6 ms |
888 KB |
Output is correct |
20 |
Correct |
5 ms |
760 KB |
Output is correct |
21 |
Correct |
5 ms |
760 KB |
Output is correct |
22 |
Correct |
6 ms |
760 KB |
Output is correct |
23 |
Correct |
6 ms |
888 KB |
Output is correct |
24 |
Correct |
6 ms |
760 KB |
Output is correct |
25 |
Correct |
6 ms |
760 KB |
Output is correct |
26 |
Correct |
6 ms |
760 KB |
Output is correct |
27 |
Correct |
169 ms |
1280 KB |
Output is correct |
28 |
Correct |
158 ms |
1400 KB |
Output is correct |
29 |
Correct |
155 ms |
1400 KB |
Output is correct |
30 |
Correct |
162 ms |
1400 KB |
Output is correct |
31 |
Correct |
163 ms |
1400 KB |
Output is correct |
32 |
Correct |
171 ms |
1312 KB |
Output is correct |
33 |
Correct |
158 ms |
1396 KB |
Output is correct |
34 |
Correct |
159 ms |
1524 KB |
Output is correct |
35 |
Correct |
159 ms |
1580 KB |
Output is correct |
36 |
Correct |
163 ms |
1400 KB |
Output is correct |
37 |
Correct |
235 ms |
1272 KB |
Output is correct |
38 |
Correct |
243 ms |
1272 KB |
Output is correct |
39 |
Correct |
214 ms |
1144 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3080 ms |
2300 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |