oj.uz

Submission #772511

# Submission time Handle Problem Language Result Execution time Memory
772511 2023-07-04T07:41:09 Z bachhoangxuan Meetings (JOI19_meetings) C++17
100 / 100
 477 ms 860 KB 
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e3+5;
#define pii pair<int,int>
#define fi first
#define se second
vector<int> edge[maxn];
bool check[maxn];
int child[maxn],sz;
bool used[maxn];

void add(int u,int v){
    edge[u].push_back(v);
    edge[v].push_back(u);
}
void del(int u,int v){
    for(int t=0;t<2;t++){
        for(int i=0;i<(int)edge[u].size();i++){
            if(edge[u][i]==v){edge[u].erase(edge[u].begin()+i);break;}
        }
        swap(u,v);
    }
}
void dfs_sz(int u,int p){
    child[u]=1;
    for(int v:edge[u]){
        if(v==p || used[v]) continue;
        dfs_sz(v,u);child[u]+=child[v];
    }
}
int findcen(int u,int p){
    for(int v:edge[u]){
        if(v==p || used[v]) continue;
        if(child[v]>sz/2) return findcen(v,u);
    }
    return u;
}
void decompose(int u,int a){
    dfs_sz(u,0);sz=child[u];
    int x=findcen(u,0);used[x]=true;
    dfs_sz(x,0);
    vector<pii> p;
    for(int v:edge[x]){
        if(used[v]) continue;
        p.push_back({child[v],v});
    }
    sort(p.begin(),p.end(),greater<pii>());
    for(int i=0;i<(int)p.size();i+=2){
        if(i+1<(int)p.size()){
            int v1=p[i].se,v2=p[i+1].se;
            int cc=Query(v1,v2,a);
            if(cc==x) continue;
            if(!check[cc] || cc==a){
                int c2=Query(x,v1,cc);
                if(c2==cc){del(x,v1);add(x,cc);add(cc,v1);}
                else{del(x,v2);add(x,cc);add(cc,v2);}
                if(a!=cc) add(a,cc);
                check[a]=check[cc]=1;
            }
            else if(cc==v1) decompose(v1,a);
            else if(cc==v2) decompose(v2,a);
            return;
        }
        else{
            int v=p[i].se;
            int cc=Query(x,v,a);
            if(cc==x) continue;
            if(!check[cc] || cc==a){
                del(x,v);add(x,cc);add(cc,v);
                if(a!=cc) add(a,cc);
                check[a]=check[cc]=1;
            }
            else decompose(v,a);
            return;
        }
    }
    add(x,a);check[a]=true;
}
void Solve(int N) {
    check[0]=check[1]=1;add(0,1);
    while(true){
        int a=0;
        while(a<N && check[a]) a++;
        if(a==N) break;
        for(int i=0;i<N;i++) used[i]=false;
        decompose(0,a);
    }
    for(int i=0;i<N;i++){
        for(int v:edge[i]){
            if(i<v) Bridge(i,v);
        }
    }
}

Subtask #1
7.0 / 7.0

# 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 1 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 1 ms 336 KB Output is correct
8 Correct 1 ms 396 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# 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 1 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 1 ms 336 KB Output is correct
8 Correct 1 ms 396 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 408 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 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 0 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

Subtask #3
12.0 / 12.0

# 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 1 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 1 ms 336 KB Output is correct
8 Correct 1 ms 396 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 408 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 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 0 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 4 ms 336 KB Output is correct
28 Correct 5 ms 432 KB Output is correct
29 Correct 4 ms 336 KB Output is correct
30 Correct 4 ms 336 KB Output is correct
31 Correct 4 ms 336 KB Output is correct
32 Correct 4 ms 336 KB Output is correct
33 Correct 7 ms 440 KB Output is correct
34 Correct 9 ms 444 KB Output is correct
35 Correct 6 ms 444 KB Output is correct
36 Correct 4 ms 436 KB Output is correct
37 Correct 7 ms 464 KB Output is correct
38 Correct 7 ms 464 KB Output is correct
39 Correct 7 ms 464 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 692 KB Output is correct
2 Correct 269 ms 612 KB Output is correct
3 Correct 237 ms 712 KB Output is correct
4 Correct 239 ms 700 KB Output is correct
5 Correct 289 ms 584 KB Output is correct
6 Correct 203 ms 588 KB Output is correct
7 Correct 344 ms 688 KB Output is correct
8 Correct 325 ms 708 KB Output is correct
9 Correct 298 ms 708 KB Output is correct
10 Correct 320 ms 640 KB Output is correct
11 Correct 374 ms 860 KB Output is correct
12 Correct 337 ms 712 KB Output is correct
13 Correct 289 ms 636 KB Output is correct
14 Correct 311 ms 728 KB Output is correct
15 Correct 307 ms 716 KB Output is correct
16 Correct 328 ms 724 KB Output is correct
17 Correct 327 ms 704 KB Output is correct
18 Correct 270 ms 732 KB Output is correct
19 Correct 298 ms 728 KB Output is correct
20 Correct 322 ms 732 KB Output is correct
21 Correct 341 ms 648 KB Output is correct
22 Correct 302 ms 736 KB Output is correct
23 Correct 308 ms 836 KB Output is correct
24 Correct 285 ms 648 KB Output is correct
25 Correct 284 ms 768 KB Output is correct
26 Correct 298 ms 636 KB Output is correct
27 Correct 281 ms 720 KB Output is correct
28 Correct 359 ms 720 KB Output is correct
29 Correct 283 ms 724 KB Output is correct
30 Correct 279 ms 636 KB Output is correct
31 Correct 305 ms 624 KB Output is correct
32 Correct 477 ms 840 KB Output is correct
33 Correct 399 ms 744 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 4 ms 336 KB Output is correct
36 Correct 5 ms 464 KB Output is correct
37 Correct 4 ms 336 KB Output is correct
38 Correct 4 ms 336 KB Output is correct
39 Correct 4 ms 336 KB Output is correct
40 Correct 5 ms 436 KB Output is correct
41 Correct 7 ms 432 KB Output is correct
42 Correct 7 ms 336 KB Output is correct
43 Correct 6 ms 336 KB Output is correct
44 Correct 6 ms 464 KB Output is correct
45 Correct 7 ms 464 KB Output is correct
46 Correct 6 ms 464 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 0 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 0 ms 336 KB Output is correct
52 Correct 0 ms 336 KB Output is correct
53 Correct 0 ms 396 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 0 ms 336 KB Output is correct
62 Correct 0 ms 336 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 0 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 0 ms 336 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct