# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
375217 |
2021-03-09T04:39:19 Z |
8e7 |
Meetings (JOI19_meetings) |
C++14 |
|
2000 ms |
1428 KB |
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#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;
}
for (int i = 0;i < v.size();i++) found[v[i]] = 0;
sub[root].clear();
vector<int> path;
path.push_back(v[0]);
found[root] = found[v[0]] = 1;
int x = v[0];
sub[x].clear();
for (int i = 1;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) {
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);
}
}
/*
5
0 1
0 2
1 3
1 4
*/
Compilation message
meetings.cpp: In function 'int getcon(int, std::vector<int>)':
meetings.cpp:33:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
33 | for (int i = 2;i < v.size();i++) {
| ~~^~~~~~~~~~
meetings.cpp: In function 'void solve(int, std::vector<int>)':
meetings.cpp:50:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
50 | for (int i = 0;i < v.size();i++) found[v[i]] = 0;
| ~~^~~~~~~~~~
meetings.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
57 | for (int i = 1;i < v.size();i++) {
| ~~^~~~~~~~~~
meetings.cpp:80:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
80 | for (int i = 0;i < path.size();i++) {
| ~~^~~~~~~~~~~~~
meetings.cpp:86:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
86 | for (int i = 0;i < path.size();i++) {
| ~~^~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
1 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
1 ms |
492 KB |
Output is correct |
5 |
Correct |
1 ms |
492 KB |
Output is correct |
6 |
Correct |
1 ms |
492 KB |
Output is correct |
7 |
Correct |
1 ms |
492 KB |
Output is correct |
8 |
Correct |
1 ms |
492 KB |
Output is correct |
9 |
Correct |
1 ms |
492 KB |
Output is correct |
10 |
Correct |
1 ms |
492 KB |
Output is correct |
11 |
Correct |
1 ms |
492 KB |
Output is correct |
12 |
Correct |
1 ms |
492 KB |
Output is correct |
13 |
Correct |
1 ms |
492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
1 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
1 ms |
492 KB |
Output is correct |
5 |
Correct |
1 ms |
492 KB |
Output is correct |
6 |
Correct |
1 ms |
492 KB |
Output is correct |
7 |
Correct |
1 ms |
492 KB |
Output is correct |
8 |
Correct |
1 ms |
492 KB |
Output is correct |
9 |
Correct |
1 ms |
492 KB |
Output is correct |
10 |
Correct |
1 ms |
492 KB |
Output is correct |
11 |
Correct |
1 ms |
492 KB |
Output is correct |
12 |
Correct |
1 ms |
492 KB |
Output is correct |
13 |
Correct |
1 ms |
492 KB |
Output is correct |
14 |
Correct |
1 ms |
492 KB |
Output is correct |
15 |
Correct |
1 ms |
492 KB |
Output is correct |
16 |
Correct |
1 ms |
492 KB |
Output is correct |
17 |
Correct |
1 ms |
492 KB |
Output is correct |
18 |
Correct |
1 ms |
492 KB |
Output is correct |
19 |
Correct |
1 ms |
492 KB |
Output is correct |
20 |
Correct |
1 ms |
492 KB |
Output is correct |
21 |
Correct |
1 ms |
492 KB |
Output is correct |
22 |
Correct |
1 ms |
492 KB |
Output is correct |
23 |
Correct |
1 ms |
492 KB |
Output is correct |
24 |
Correct |
1 ms |
492 KB |
Output is correct |
25 |
Correct |
1 ms |
492 KB |
Output is correct |
26 |
Correct |
1 ms |
492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
1 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
1 ms |
492 KB |
Output is correct |
5 |
Correct |
1 ms |
492 KB |
Output is correct |
6 |
Correct |
1 ms |
492 KB |
Output is correct |
7 |
Correct |
1 ms |
492 KB |
Output is correct |
8 |
Correct |
1 ms |
492 KB |
Output is correct |
9 |
Correct |
1 ms |
492 KB |
Output is correct |
10 |
Correct |
1 ms |
492 KB |
Output is correct |
11 |
Correct |
1 ms |
492 KB |
Output is correct |
12 |
Correct |
1 ms |
492 KB |
Output is correct |
13 |
Correct |
1 ms |
492 KB |
Output is correct |
14 |
Correct |
1 ms |
492 KB |
Output is correct |
15 |
Correct |
1 ms |
492 KB |
Output is correct |
16 |
Correct |
1 ms |
492 KB |
Output is correct |
17 |
Correct |
1 ms |
492 KB |
Output is correct |
18 |
Correct |
1 ms |
492 KB |
Output is correct |
19 |
Correct |
1 ms |
492 KB |
Output is correct |
20 |
Correct |
1 ms |
492 KB |
Output is correct |
21 |
Correct |
1 ms |
492 KB |
Output is correct |
22 |
Correct |
1 ms |
492 KB |
Output is correct |
23 |
Correct |
1 ms |
492 KB |
Output is correct |
24 |
Correct |
1 ms |
492 KB |
Output is correct |
25 |
Correct |
1 ms |
492 KB |
Output is correct |
26 |
Correct |
1 ms |
492 KB |
Output is correct |
27 |
Correct |
7 ms |
620 KB |
Output is correct |
28 |
Correct |
7 ms |
620 KB |
Output is correct |
29 |
Correct |
8 ms |
620 KB |
Output is correct |
30 |
Correct |
7 ms |
620 KB |
Output is correct |
31 |
Correct |
6 ms |
620 KB |
Output is correct |
32 |
Correct |
8 ms |
620 KB |
Output is correct |
33 |
Correct |
14 ms |
620 KB |
Output is correct |
34 |
Correct |
18 ms |
620 KB |
Output is correct |
35 |
Correct |
16 ms |
620 KB |
Output is correct |
36 |
Correct |
7 ms |
620 KB |
Output is correct |
37 |
Correct |
17 ms |
620 KB |
Output is correct |
38 |
Correct |
17 ms |
620 KB |
Output is correct |
39 |
Correct |
14 ms |
620 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
504 ms |
876 KB |
Output is correct |
2 |
Correct |
574 ms |
876 KB |
Output is correct |
3 |
Correct |
659 ms |
1004 KB |
Output is correct |
4 |
Correct |
620 ms |
1004 KB |
Output is correct |
5 |
Correct |
437 ms |
876 KB |
Output is correct |
6 |
Correct |
424 ms |
904 KB |
Output is correct |
7 |
Correct |
772 ms |
876 KB |
Output is correct |
8 |
Correct |
874 ms |
876 KB |
Output is correct |
9 |
Correct |
891 ms |
1040 KB |
Output is correct |
10 |
Correct |
810 ms |
876 KB |
Output is correct |
11 |
Correct |
942 ms |
876 KB |
Output is correct |
12 |
Correct |
532 ms |
876 KB |
Output is correct |
13 |
Correct |
282 ms |
876 KB |
Output is correct |
14 |
Correct |
593 ms |
876 KB |
Output is correct |
15 |
Correct |
491 ms |
876 KB |
Output is correct |
16 |
Correct |
637 ms |
876 KB |
Output is correct |
17 |
Correct |
830 ms |
1004 KB |
Output is correct |
18 |
Execution timed out |
2545 ms |
1428 KB |
Time limit exceeded |
19 |
Halted |
0 ms |
0 KB |
- |