# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210463 | 2020-03-17T12:21:00 Z | mhy908 | Meetings (JOI19_meetings) | C++14 | 77 ms | 1016 KB |
#include "meetings.h" #include <bits/stdc++.h> #define pb push_back #define all(x) x.begin(), x.end() using namespace std; int base; bool comp(int a, int b){return Query(base, a, b)==a;} unordered_map<int, vector<int> > ump; void solve(vector<int> vc){ if(vc.size()<=1)return; ump[vc[0]].pb(vc[0]); ump[vc[1]].pb(vc[1]); vector<int> path; for(int i=2; i<vc.size(); i++){ int x=Query(vc[0], vc[1], vc[i]); if(ump[x].empty())path.pb(x); ump[x].pb(vc[i]); } base=vc[0]; sort(all(path), comp); for(int i=0; i<path.size()-1; i++)Bridge(min(path[i], path[i+1]), max(path[i], path[i+1])); for(int i=0; i<path.size(); i++){ vector<int> temp=ump[path[i]]; ump[path[i]].clear(); solve(temp); } } void Solve(int n){ vector<int> temp; for(int i=0; i<n; i++)temp.pb(i); solve(temp); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 632 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 632 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 632 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 77 ms | 1016 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |