# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978474 | happy_node | Meetings (JOI19_meetings) | C++17 | 457 ms | 912 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
const int MX=2005;
vector<pair<int,int>> edges;
bool vis[MX];
void dfs(int root, vector<int> v) {
if(v.size()==1) {
return;
}
vector<int> curRoot;
vector<vector<int>> items;
for(auto u:v) {
if(u==root) continue;
if(vis[u]) continue;
int pt=0;
for(auto r:curRoot) {
// at this subtree
int q=Query(root,r,u);
if(q==root) {
// not at this subtree
pt++;
continue;
}
// at this subtree
curRoot[pt]=q;
if(!vis[q]) items[pt].push_back(q);
vis[q]=true;
if(!vis[u]) items[pt].push_back(u);
vis[u]=true;
break;
}
if(!vis[u]) {
vis[u]=true;
curRoot.push_back(u);
items.push_back({u});
}
}
for(auto u:v) {
vis[u]=false;
}
int pt=0, sum=1;
for(auto r:curRoot) {
edges.push_back({root,r});
sum+=items[pt].size();
dfs(r,items[pt]);
pt++;
}
assert(sum==v.size());
}
void Solve(int N) {
vector<int> v;
for(int i=0;i<N;i++) v.push_back(i);
dfs(0,v);
for(auto [u,v]:edges) {
Bridge(u,v);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |