# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
868854 |
2023-11-02T08:29:54 Z |
8e7 |
Meetings (JOI19_meetings) |
C++17 |
|
767 ms |
1356 KB |
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <random>
#include "meetings.h"
#define ll long long
#define maxn 3005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
int tot;
vector<pii> ans;
vector<int> adj[maxn], sub[maxn];
bool found[maxn];
void dfs(int n, vector<int> &add) {
found[n] = 1;
add.push_back(n);
for (int v:adj[n]) {
if (!found[v]) {
dfs(v, add);
}
}
}
int getcon(int root, vector<int> v) {
if (v.size() == 1) return v[0];
int ret = Query(root, v[0], v[1]);
for (int i = 2;i < v.size();i++) {
if (ret != v[i]) ret = Query(root, ret, v[i]);
}
return ret;
}
int curroot;
inline bool cmp(int x, int y) {
return Query(curroot, x, y) == x;
}
void solve(int root, vector<int> v) {
if (v.size() == 0) return;
if (v.size() == 1) {
ans.push_back(make_pair(root, v[0]));
return;
}
v.push_back(root);
random_shuffle(v.begin(), v.end());
for (int i = 0;i < v.size();i++) found[v[i]] = 0;
sub[root].clear();
vector<int> path;
root = v[0];
path.push_back(v[1]);
found[root] = found[v[1]] = 1;
int x = v[1];
sub[x].clear();
for (int i = 2;i < v.size();i++) {
int val = Query(root, x, v[i]);
if (val == x) {
if (!found[v[i]]) {
path.push_back(v[i]);
found[v[i]] = 1;
sub[v[i]].clear();
}
x = v[i];
} else {
if (!found[val]) {
path.push_back(val);
found[val] = 1;
sub[val].clear();
}
if (val != v[i]) {
sub[val].push_back(v[i]);
}
}
}
//finds a path from root to leaf and splits other nodes (vs - 1 queries)
curroot = root;
sort(path.begin(), path.end(), cmp);
for (int i = 0;i < path.size();i++) {
ans.push_back(i ? make_pair(path[i], path[i - 1]) : make_pair(path[i], root));
}
//cout << endl;
path.push_back(root);
for (int i = 0;i < path.size();i++) {
solve(path[i], sub[path[i]]);
}
}
void Solve(int N) {
srand(time(NULL));
ans.clear();
tot = N;
vector<int> v;
for (int i = 1;i < tot;i++) v.push_back(i);
solve(0, v);
for (auto i:ans) {
if (i.ff > i.ss) swap(i.ff, i.ss);
//cout << i.ff << " " << i.ss << endl;
Bridge(i.ff, i.ss);
}
}
Compilation message
meetings.cpp: In function 'int getcon(int, std::vector<int>)':
meetings.cpp:34:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
34 | for (int i = 2;i < v.size();i++) {
| ~~^~~~~~~~~~
meetings.cpp: In function 'void solve(int, std::vector<int>)':
meetings.cpp:53:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | for (int i = 0;i < v.size();i++) found[v[i]] = 0;
| ~~^~~~~~~~~~
meetings.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
62 | for (int i = 2;i < v.size();i++) {
| ~~^~~~~~~~~~
meetings.cpp:85:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
85 | for (int i = 0;i < path.size();i++) {
| ~~^~~~~~~~~~~~~
meetings.cpp:90:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
90 | for (int i = 0;i < path.size();i++) {
| ~~^~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
600 KB |
Output is correct |
2 |
Correct |
0 ms |
600 KB |
Output is correct |
3 |
Correct |
0 ms |
600 KB |
Output is correct |
4 |
Correct |
0 ms |
600 KB |
Output is correct |
5 |
Correct |
0 ms |
600 KB |
Output is correct |
6 |
Correct |
0 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
600 KB |
Output is correct |
8 |
Correct |
0 ms |
600 KB |
Output is correct |
9 |
Correct |
1 ms |
600 KB |
Output is correct |
10 |
Correct |
0 ms |
600 KB |
Output is correct |
11 |
Correct |
0 ms |
600 KB |
Output is correct |
12 |
Correct |
0 ms |
600 KB |
Output is correct |
13 |
Correct |
0 ms |
600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
600 KB |
Output is correct |
2 |
Correct |
0 ms |
600 KB |
Output is correct |
3 |
Correct |
0 ms |
600 KB |
Output is correct |
4 |
Correct |
0 ms |
600 KB |
Output is correct |
5 |
Correct |
0 ms |
600 KB |
Output is correct |
6 |
Correct |
0 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
600 KB |
Output is correct |
8 |
Correct |
0 ms |
600 KB |
Output is correct |
9 |
Correct |
1 ms |
600 KB |
Output is correct |
10 |
Correct |
0 ms |
600 KB |
Output is correct |
11 |
Correct |
0 ms |
600 KB |
Output is correct |
12 |
Correct |
0 ms |
600 KB |
Output is correct |
13 |
Correct |
0 ms |
600 KB |
Output is correct |
14 |
Correct |
1 ms |
600 KB |
Output is correct |
15 |
Correct |
0 ms |
600 KB |
Output is correct |
16 |
Correct |
1 ms |
600 KB |
Output is correct |
17 |
Correct |
0 ms |
600 KB |
Output is correct |
18 |
Correct |
0 ms |
600 KB |
Output is correct |
19 |
Correct |
1 ms |
600 KB |
Output is correct |
20 |
Correct |
1 ms |
600 KB |
Output is correct |
21 |
Correct |
1 ms |
600 KB |
Output is correct |
22 |
Correct |
0 ms |
600 KB |
Output is correct |
23 |
Correct |
0 ms |
600 KB |
Output is correct |
24 |
Correct |
1 ms |
600 KB |
Output is correct |
25 |
Correct |
1 ms |
600 KB |
Output is correct |
26 |
Correct |
1 ms |
852 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
600 KB |
Output is correct |
2 |
Correct |
0 ms |
600 KB |
Output is correct |
3 |
Correct |
0 ms |
600 KB |
Output is correct |
4 |
Correct |
0 ms |
600 KB |
Output is correct |
5 |
Correct |
0 ms |
600 KB |
Output is correct |
6 |
Correct |
0 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
600 KB |
Output is correct |
8 |
Correct |
0 ms |
600 KB |
Output is correct |
9 |
Correct |
1 ms |
600 KB |
Output is correct |
10 |
Correct |
0 ms |
600 KB |
Output is correct |
11 |
Correct |
0 ms |
600 KB |
Output is correct |
12 |
Correct |
0 ms |
600 KB |
Output is correct |
13 |
Correct |
0 ms |
600 KB |
Output is correct |
14 |
Correct |
1 ms |
600 KB |
Output is correct |
15 |
Correct |
0 ms |
600 KB |
Output is correct |
16 |
Correct |
1 ms |
600 KB |
Output is correct |
17 |
Correct |
0 ms |
600 KB |
Output is correct |
18 |
Correct |
0 ms |
600 KB |
Output is correct |
19 |
Correct |
1 ms |
600 KB |
Output is correct |
20 |
Correct |
1 ms |
600 KB |
Output is correct |
21 |
Correct |
1 ms |
600 KB |
Output is correct |
22 |
Correct |
0 ms |
600 KB |
Output is correct |
23 |
Correct |
0 ms |
600 KB |
Output is correct |
24 |
Correct |
1 ms |
600 KB |
Output is correct |
25 |
Correct |
1 ms |
600 KB |
Output is correct |
26 |
Correct |
1 ms |
852 KB |
Output is correct |
27 |
Correct |
4 ms |
600 KB |
Output is correct |
28 |
Correct |
3 ms |
668 KB |
Output is correct |
29 |
Correct |
4 ms |
600 KB |
Output is correct |
30 |
Correct |
3 ms |
668 KB |
Output is correct |
31 |
Correct |
3 ms |
600 KB |
Output is correct |
32 |
Correct |
4 ms |
672 KB |
Output is correct |
33 |
Correct |
5 ms |
600 KB |
Output is correct |
34 |
Correct |
6 ms |
600 KB |
Output is correct |
35 |
Correct |
6 ms |
668 KB |
Output is correct |
36 |
Correct |
3 ms |
600 KB |
Output is correct |
37 |
Correct |
9 ms |
600 KB |
Output is correct |
38 |
Correct |
10 ms |
676 KB |
Output is correct |
39 |
Correct |
11 ms |
600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
194 ms |
1060 KB |
Output is correct |
2 |
Correct |
195 ms |
1112 KB |
Output is correct |
3 |
Correct |
227 ms |
880 KB |
Output is correct |
4 |
Correct |
222 ms |
888 KB |
Output is correct |
5 |
Correct |
192 ms |
816 KB |
Output is correct |
6 |
Correct |
186 ms |
820 KB |
Output is correct |
7 |
Correct |
267 ms |
860 KB |
Output is correct |
8 |
Correct |
259 ms |
848 KB |
Output is correct |
9 |
Correct |
272 ms |
844 KB |
Output is correct |
10 |
Correct |
312 ms |
828 KB |
Output is correct |
11 |
Correct |
306 ms |
852 KB |
Output is correct |
12 |
Correct |
270 ms |
868 KB |
Output is correct |
13 |
Correct |
123 ms |
852 KB |
Output is correct |
14 |
Correct |
256 ms |
892 KB |
Output is correct |
15 |
Correct |
187 ms |
848 KB |
Output is correct |
16 |
Correct |
185 ms |
844 KB |
Output is correct |
17 |
Correct |
308 ms |
1356 KB |
Output is correct |
18 |
Correct |
191 ms |
852 KB |
Output is correct |
19 |
Correct |
198 ms |
848 KB |
Output is correct |
20 |
Correct |
261 ms |
1136 KB |
Output is correct |
21 |
Correct |
221 ms |
864 KB |
Output is correct |
22 |
Correct |
190 ms |
864 KB |
Output is correct |
23 |
Correct |
194 ms |
856 KB |
Output is correct |
24 |
Correct |
229 ms |
840 KB |
Output is correct |
25 |
Correct |
209 ms |
856 KB |
Output is correct |
26 |
Correct |
195 ms |
848 KB |
Output is correct |
27 |
Correct |
237 ms |
848 KB |
Output is correct |
28 |
Correct |
339 ms |
848 KB |
Output is correct |
29 |
Correct |
269 ms |
856 KB |
Output is correct |
30 |
Correct |
281 ms |
900 KB |
Output is correct |
31 |
Correct |
317 ms |
1120 KB |
Output is correct |
32 |
Correct |
767 ms |
1096 KB |
Output is correct |
33 |
Correct |
411 ms |
856 KB |
Output is correct |
34 |
Correct |
3 ms |
600 KB |
Output is correct |
35 |
Correct |
4 ms |
756 KB |
Output is correct |
36 |
Correct |
3 ms |
600 KB |
Output is correct |
37 |
Correct |
5 ms |
600 KB |
Output is correct |
38 |
Correct |
4 ms |
664 KB |
Output is correct |
39 |
Correct |
4 ms |
600 KB |
Output is correct |
40 |
Correct |
5 ms |
676 KB |
Output is correct |
41 |
Correct |
6 ms |
600 KB |
Output is correct |
42 |
Correct |
6 ms |
600 KB |
Output is correct |
43 |
Correct |
3 ms |
600 KB |
Output is correct |
44 |
Correct |
13 ms |
676 KB |
Output is correct |
45 |
Correct |
7 ms |
600 KB |
Output is correct |
46 |
Correct |
11 ms |
600 KB |
Output is correct |
47 |
Correct |
0 ms |
600 KB |
Output is correct |
48 |
Correct |
0 ms |
600 KB |
Output is correct |
49 |
Correct |
0 ms |
600 KB |
Output is correct |
50 |
Correct |
1 ms |
616 KB |
Output is correct |
51 |
Correct |
0 ms |
600 KB |
Output is correct |
52 |
Correct |
0 ms |
600 KB |
Output is correct |
53 |
Correct |
0 ms |
600 KB |
Output is correct |
54 |
Correct |
1 ms |
600 KB |
Output is correct |
55 |
Correct |
1 ms |
600 KB |
Output is correct |
56 |
Correct |
0 ms |
600 KB |
Output is correct |
57 |
Correct |
1 ms |
600 KB |
Output is correct |
58 |
Correct |
0 ms |
600 KB |
Output is correct |
59 |
Correct |
1 ms |
600 KB |
Output is correct |
60 |
Correct |
1 ms |
508 KB |
Output is correct |
61 |
Correct |
1 ms |
600 KB |
Output is correct |
62 |
Correct |
0 ms |
600 KB |
Output is correct |
63 |
Correct |
0 ms |
600 KB |
Output is correct |
64 |
Correct |
0 ms |
600 KB |
Output is correct |
65 |
Correct |
0 ms |
600 KB |
Output is correct |
66 |
Correct |
0 ms |
600 KB |
Output is correct |
67 |
Correct |
1 ms |
848 KB |
Output is correct |
68 |
Correct |
0 ms |
600 KB |
Output is correct |
69 |
Correct |
0 ms |
600 KB |
Output is correct |
70 |
Correct |
0 ms |
600 KB |
Output is correct |
71 |
Correct |
0 ms |
600 KB |
Output is correct |
72 |
Correct |
1 ms |
600 KB |
Output is correct |