| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 630843 |
2022-08-17T08:12:54 Z |
codr0 |
Meetings (JOI19_meetings) |
C++14 |
|
2000 ms |
676 KB |
#include <bits/stdc++.h>
#include "meetings.h"
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORR(i,a,b) for(int i=a;i>=b;i--)
#define F first
#define S second
#define err(x) cerr<<#x<<" : "<<x<<'\n';
#define dmid int mid=(r+l)/2
#define lc 2*id
#define rc 2*id+1
#define pb push_back
#define all(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
using namespace std;
void Solve(int n){
int h[n]={};
int par[n]={};
vector<int> vc[n];
FOR(i,1,n-2) FOR(j,i+1,n-1){
int x=Query(0,i,j);
if(x==i) vc[j].pb(i);
else if(x==j) vc[i].pb(j);
}
vector<pii> v0;
FOR(i,1,n-1) v0.pb({SZ(vc[i]),i});
sort(all(v0));
for(pii vv:v0){
int v=vv.S;
if(vv.F==0){
par[v]=0;
h[v]=1;
}else{
int H=-1;
int pr=-1;
for(int u:vc[v]) if(h[u]>H) H=h[u],pr=u;
par[v]=pr;
h[v]=h[pr]+1;
}
}
FOR(i,1,n-1){
int a=par[i];
int b=i;
if(a>b) swap(a,b);
Bridge(a,b);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
336 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
0 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
0 ms |
336 KB |
Output is correct |
| 13 |
Correct |
0 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
336 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
0 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
0 ms |
336 KB |
Output is correct |
| 13 |
Correct |
0 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
1 ms |
336 KB |
Output is correct |
| 17 |
Correct |
1 ms |
336 KB |
Output is correct |
| 18 |
Correct |
1 ms |
336 KB |
Output is correct |
| 19 |
Correct |
1 ms |
336 KB |
Output is correct |
| 20 |
Correct |
1 ms |
336 KB |
Output is correct |
| 21 |
Correct |
1 ms |
336 KB |
Output is correct |
| 22 |
Correct |
1 ms |
336 KB |
Output is correct |
| 23 |
Correct |
1 ms |
336 KB |
Output is correct |
| 24 |
Correct |
1 ms |
336 KB |
Output is correct |
| 25 |
Correct |
1 ms |
336 KB |
Output is correct |
| 26 |
Correct |
1 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
336 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
0 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
0 ms |
336 KB |
Output is correct |
| 13 |
Correct |
0 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
1 ms |
336 KB |
Output is correct |
| 17 |
Correct |
1 ms |
336 KB |
Output is correct |
| 18 |
Correct |
1 ms |
336 KB |
Output is correct |
| 19 |
Correct |
1 ms |
336 KB |
Output is correct |
| 20 |
Correct |
1 ms |
336 KB |
Output is correct |
| 21 |
Correct |
1 ms |
336 KB |
Output is correct |
| 22 |
Correct |
1 ms |
336 KB |
Output is correct |
| 23 |
Correct |
1 ms |
336 KB |
Output is correct |
| 24 |
Correct |
1 ms |
336 KB |
Output is correct |
| 25 |
Correct |
1 ms |
336 KB |
Output is correct |
| 26 |
Correct |
1 ms |
336 KB |
Output is correct |
| 27 |
Correct |
100 ms |
376 KB |
Output is correct |
| 28 |
Correct |
102 ms |
376 KB |
Output is correct |
| 29 |
Correct |
100 ms |
376 KB |
Output is correct |
| 30 |
Correct |
100 ms |
368 KB |
Output is correct |
| 31 |
Correct |
100 ms |
376 KB |
Output is correct |
| 32 |
Correct |
108 ms |
360 KB |
Output is correct |
| 33 |
Correct |
109 ms |
364 KB |
Output is correct |
| 34 |
Correct |
101 ms |
492 KB |
Output is correct |
| 35 |
Correct |
103 ms |
380 KB |
Output is correct |
| 36 |
Correct |
108 ms |
496 KB |
Output is correct |
| 37 |
Correct |
178 ms |
540 KB |
Output is correct |
| 38 |
Correct |
195 ms |
536 KB |
Output is correct |
| 39 |
Correct |
176 ms |
676 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2633 ms |
612 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
