# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164419 | 2019-11-20T13:54:46 Z | tneluccus | Meetings (JOI19_meetings) | C++14 | 105 ms | 504 KB |
#include<bits/stdc++.h> #include "meetings.h" using namespace std; const int num=2e3+2; vector<int> lis[num]; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void solve1(int root){ int n=lis[root].size(),i,j,k,l,ran,ver; if(!n){ return; } vector<int> idx; ran=rng()%n; ver=lis[root][ran]; for(i=0;i<lis[root].size();i++){ j=Query(root,ver,lis[root][i]); idx.push_back(j); if(j!=lis[root][j]){ lis[j].push_back(lis[root][i]); } } sort(idx.begin(),idx.end(),[&](int x,int y){ return Query(root,x,y)==x; }); j=root; for(i=0;i<idx.size();i++){ Bridge(j,idx[i]); j=idx[i]; } for(i=0;i<idx.size();i++){ solve1(idx[i]); } } void Solve(int N){ int n=N,i,root=rng()%N+1; for(i=1;i<=n;i++){ if(i==root){ continue; } lis[root].push_back(i); } solve1(root); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 105 ms | 504 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |