oj.uz

Submission #591773

# Submission time Handle Problem Language Result Execution time Memory
591773 2022-07-07T21:11:48 Z alirezasamimi100 Simurgh (IOI17_simurgh) C++17
100 / 100
 132 ms 7812 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using namespace std;
const int N = 5e2 + 10, M = N * N / 2;

int d[M],p[N],f[N],h[N],pe[N],mt,P[N];
vector<pair<int,int>> adj[N];
vector<int> rt,V,U,ed[N];

int gp(int x){
    return P[x]==-1?x:P[x]=gp(P[x]);
}

bool uni(int v, int u){
    v=gp(v);
    u=gp(u);
    if(v==u) return 0;
    P[u]=v;
    return 1;
}

void dfs(int v){
    f[v]=1;
    for(auto [u,i] : adj[v]){
        if(f[u]) continue;
        h[u]=h[v]+1;
        p[u]=v;
        pe[u]=i;
        rt.pb(i);
        dfs(u);
    }
    if(!v) return;
}
pair<int,int> sfd(int v){
    int bk=-1,bu=-1;
    for(auto [u,i] : adj[v]){
        if(h[u]<h[v]-1 && (bu==-1 || h[u]<h[bu])){
            bk=i;
            bu=u;
        }else if(p[u]==v){
            pair<int,int> pi=sfd(u);
            if(pi.F!=-1 && h[pi.S]<h[v] && (bu==-1 || h[pi.S]<h[bu])){
                bu=pi.S;
                bk=pi.F;
            }
        }
    }
    pair<int,int> pi={bk,bu};
    if(v==0) return pi;
    if(bk==-1){
        d[pe[v]]=1;
        return pi;
    }
    int bv=V[bk]^U[bk]^bu;
    if(d[pe[v]]!=-1) return pi;
    vector<int> v1,v2,t;
    while(bv!=bu){
        v1.pb(pe[bv]);
        bv=p[bv];
    }
    for(int i : v1){
        if(d[i]!=-1){
            if(d[bk]==-1){
                t={bk};
                for(int j : rt) if(j!=i) t.pb(j);
                int k=count_common_roads(t);
                if(k==mt) d[bk]=d[i];
                else d[bk]=1-d[i];
            }
            v2.pb(0);
        }else{
            t={bk};
            for(int j : rt) if(j!=i) t.pb(j);
            int k=count_common_roads(t);
            if(k==mt){
                v2.pb(0);
            }else{
                v2.pb(1);
                if(k>mt) d[bk]=1;
                else d[bk]=0;
            }
        }
    }
    if(d[bk]==-1) d[bk]=0;
    for(int i=0; i<(int)v2.size(); i++){
        if(d[v1[i]]!=-1) continue;
        if(v2[i]) d[v1[i]]=1-d[bk];
        else d[v1[i]]=d[bk];
    }
    return pi;
}

int jask(vector<int> vec){
    memset(P,-1,sizeof P);
    vector<int> t;
    int ans=0;
    for(int i : vec){
        uni(V[i],U[i]);
        t.pb(i);
    }
    for(int i : rt){
        if(uni(V[i],U[i])){
            t.pb(i);
            ans-=d[i];
        }
    }
    return ans+count_common_roads(t);
}
void solve(vector<int> vec, int x){
    int k=vec.size();
    if(k==1){
        d[vec[0]]=x;
        return;
    }
    if(x==0){
        for(int i : vec) d[i]=0;
        return;
    }
    vector<int> ls,rs;
    for(int i=0; i<k; i++){
        if(i<k/2) ls.pb(vec[i]);
        else rs.pb(vec[i]);
    }
    int y=jask(ls);
    solve(ls,y);
    solve(rs,x-y);
}

vector<int> find_roads(int n, vector<int> u, vector<int> v) {
    int m=v.size();
    V=v;
    U=u;
    memset(d,-1,sizeof d);
    for(int i=0; i<m; i++){
        adj[u[i]].pb({v[i],i});
        adj[v[i]].pb({u[i],i});
        ed[abs(V[i]-U[i])].pb(i);
    }
    p[0]=-1;
    dfs(0);
    mt=count_common_roads(rt);
    sfd(0);
    for(int i=1; i<n; i++){
        if(ed[i].empty()) continue;
        solve(ed[i],jask(ed[i]));
    }
    vector<int> ans;
    for(int i=0; i<m; i++) if(d[i]==1) ans.pb(i);
    return ans;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 724 KB correct
2 Correct 1 ms 724 KB correct
3 Correct 1 ms 852 KB correct
4 Correct 0 ms 724 KB correct
5 Correct 1 ms 724 KB correct
6 Correct 1 ms 724 KB correct
7 Correct 1 ms 852 KB correct
8 Correct 1 ms 724 KB correct
9 Correct 1 ms 804 KB correct
10 Correct 1 ms 724 KB correct
11 Correct 1 ms 852 KB correct
12 Correct 1 ms 852 KB correct
13 Correct 1 ms 724 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 724 KB correct
2 Correct 1 ms 724 KB correct
3 Correct 1 ms 852 KB correct
4 Correct 0 ms 724 KB correct
5 Correct 1 ms 724 KB correct
6 Correct 1 ms 724 KB correct
7 Correct 1 ms 852 KB correct
8 Correct 1 ms 724 KB correct
9 Correct 1 ms 804 KB correct
10 Correct 1 ms 724 KB correct
11 Correct 1 ms 852 KB correct
12 Correct 1 ms 852 KB correct
13 Correct 1 ms 724 KB correct
14 Correct 2 ms 852 KB correct
15 Correct 2 ms 852 KB correct
16 Correct 2 ms 924 KB correct
17 Correct 2 ms 852 KB correct
18 Correct 1 ms 852 KB correct
19 Correct 2 ms 852 KB correct
20 Correct 1 ms 852 KB correct
21 Correct 1 ms 852 KB correct
22 Correct 1 ms 852 KB correct
23 Correct 1 ms 852 KB correct
24 Correct 1 ms 852 KB correct
25 Correct 1 ms 852 KB correct
26 Correct 1 ms 852 KB correct
27 Correct 1 ms 852 KB correct
28 Correct 1 ms 852 KB correct
29 Correct 1 ms 852 KB correct
30 Correct 1 ms 852 KB correct
31 Correct 1 ms 852 KB correct
32 Correct 1 ms 852 KB correct
33 Correct 1 ms 852 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 724 KB correct
2 Correct 1 ms 724 KB correct
3 Correct 1 ms 852 KB correct
4 Correct 0 ms 724 KB correct
5 Correct 1 ms 724 KB correct
6 Correct 1 ms 724 KB correct
7 Correct 1 ms 852 KB correct
8 Correct 1 ms 724 KB correct
9 Correct 1 ms 804 KB correct
10 Correct 1 ms 724 KB correct
11 Correct 1 ms 852 KB correct
12 Correct 1 ms 852 KB correct
13 Correct 1 ms 724 KB correct
14 Correct 2 ms 852 KB correct
15 Correct 2 ms 852 KB correct
16 Correct 2 ms 924 KB correct
17 Correct 2 ms 852 KB correct
18 Correct 1 ms 852 KB correct
19 Correct 2 ms 852 KB correct
20 Correct 1 ms 852 KB correct
21 Correct 1 ms 852 KB correct
22 Correct 1 ms 852 KB correct
23 Correct 1 ms 852 KB correct
24 Correct 1 ms 852 KB correct
25 Correct 1 ms 852 KB correct
26 Correct 1 ms 852 KB correct
27 Correct 1 ms 852 KB correct
28 Correct 1 ms 852 KB correct
29 Correct 1 ms 852 KB correct
30 Correct 1 ms 852 KB correct
31 Correct 1 ms 852 KB correct
32 Correct 1 ms 852 KB correct
33 Correct 1 ms 852 KB correct
34 Correct 26 ms 2384 KB correct
35 Correct 25 ms 2412 KB correct
36 Correct 22 ms 2148 KB correct
37 Correct 7 ms 980 KB correct
38 Correct 27 ms 2388 KB correct
39 Correct 26 ms 2388 KB correct
40 Correct 22 ms 2132 KB correct
41 Correct 30 ms 2560 KB correct
42 Correct 27 ms 2412 KB correct
43 Correct 16 ms 1876 KB correct
44 Correct 15 ms 1604 KB correct
45 Correct 15 ms 1700 KB correct
46 Correct 15 ms 1552 KB correct
47 Correct 11 ms 1216 KB correct
48 Correct 5 ms 852 KB correct
49 Correct 7 ms 908 KB correct
50 Correct 10 ms 1108 KB correct
51 Correct 18 ms 1628 KB correct
52 Correct 16 ms 1612 KB correct
53 Correct 15 ms 1612 KB correct
54 Correct 16 ms 1876 KB correct
55 Correct 16 ms 1620 KB correct
56 Correct 15 ms 1620 KB correct
57 Correct 16 ms 1620 KB correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB correct
2 Correct 1 ms 724 KB correct
3 Correct 76 ms 5076 KB correct
4 Correct 125 ms 6780 KB correct
5 Correct 121 ms 6936 KB correct
6 Correct 128 ms 6732 KB correct
7 Correct 132 ms 6744 KB correct
8 Correct 126 ms 6928 KB correct
9 Correct 125 ms 6808 KB correct
10 Correct 117 ms 6756 KB correct
11 Correct 118 ms 6680 KB correct
12 Correct 123 ms 6948 KB correct
13 Correct 0 ms 724 KB correct
14 Correct 121 ms 6820 KB correct
15 Correct 118 ms 6784 KB correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 724 KB correct
2 Correct 1 ms 724 KB correct
3 Correct 1 ms 852 KB correct
4 Correct 0 ms 724 KB correct
5 Correct 1 ms 724 KB correct
6 Correct 1 ms 724 KB correct
7 Correct 1 ms 852 KB correct
8 Correct 1 ms 724 KB correct
9 Correct 1 ms 804 KB correct
10 Correct 1 ms 724 KB correct
11 Correct 1 ms 852 KB correct
12 Correct 1 ms 852 KB correct
13 Correct 1 ms 724 KB correct
14 Correct 2 ms 852 KB correct
15 Correct 2 ms 852 KB correct
16 Correct 2 ms 924 KB correct
17 Correct 2 ms 852 KB correct
18 Correct 1 ms 852 KB correct
19 Correct 2 ms 852 KB correct
20 Correct 1 ms 852 KB correct
21 Correct 1 ms 852 KB correct
22 Correct 1 ms 852 KB correct
23 Correct 1 ms 852 KB correct
24 Correct 1 ms 852 KB correct
25 Correct 1 ms 852 KB correct
26 Correct 1 ms 852 KB correct
27 Correct 1 ms 852 KB correct
28 Correct 1 ms 852 KB correct
29 Correct 1 ms 852 KB correct
30 Correct 1 ms 852 KB correct
31 Correct 1 ms 852 KB correct
32 Correct 1 ms 852 KB correct
33 Correct 1 ms 852 KB correct
34 Correct 26 ms 2384 KB correct
35 Correct 25 ms 2412 KB correct
36 Correct 22 ms 2148 KB correct
37 Correct 7 ms 980 KB correct
38 Correct 27 ms 2388 KB correct
39 Correct 26 ms 2388 KB correct
40 Correct 22 ms 2132 KB correct
41 Correct 30 ms 2560 KB correct
42 Correct 27 ms 2412 KB correct
43 Correct 16 ms 1876 KB correct
44 Correct 15 ms 1604 KB correct
45 Correct 15 ms 1700 KB correct
46 Correct 15 ms 1552 KB correct
47 Correct 11 ms 1216 KB correct
48 Correct 5 ms 852 KB correct
49 Correct 7 ms 908 KB correct
50 Correct 10 ms 1108 KB correct
51 Correct 18 ms 1628 KB correct
52 Correct 16 ms 1612 KB correct
53 Correct 15 ms 1612 KB correct
54 Correct 16 ms 1876 KB correct
55 Correct 16 ms 1620 KB correct
56 Correct 15 ms 1620 KB correct
57 Correct 16 ms 1620 KB correct
58 Correct 1 ms 724 KB correct
59 Correct 1 ms 724 KB correct
60 Correct 76 ms 5076 KB correct
61 Correct 125 ms 6780 KB correct
62 Correct 121 ms 6936 KB correct
63 Correct 128 ms 6732 KB correct
64 Correct 132 ms 6744 KB correct
65 Correct 126 ms 6928 KB correct
66 Correct 125 ms 6808 KB correct
67 Correct 117 ms 6756 KB correct
68 Correct 118 ms 6680 KB correct
69 Correct 123 ms 6948 KB correct
70 Correct 0 ms 724 KB correct
71 Correct 121 ms 6820 KB correct
72 Correct 118 ms 6784 KB correct
73 Correct 1 ms 724 KB correct
74 Correct 128 ms 7752 KB correct
75 Correct 118 ms 7536 KB correct
76 Correct 60 ms 3504 KB correct
77 Correct 123 ms 7712 KB correct
78 Correct 127 ms 7748 KB correct
79 Correct 123 ms 7812 KB correct
80 Correct 118 ms 7596 KB correct
81 Correct 114 ms 6860 KB correct
82 Correct 120 ms 7628 KB correct
83 Correct 91 ms 4656 KB correct
84 Correct 79 ms 5568 KB correct
85 Correct 73 ms 5204 KB correct
86 Correct 62 ms 3612 KB correct
87 Correct 53 ms 3172 KB correct
88 Correct 49 ms 2424 KB correct
89 Correct 48 ms 2360 KB correct
90 Correct 46 ms 2200 KB correct
91 Correct 24 ms 980 KB correct
92 Correct 16 ms 852 KB correct
93 Correct 76 ms 5208 KB correct
94 Correct 61 ms 3596 KB correct
95 Correct 62 ms 3812 KB correct
96 Correct 48 ms 2260 KB correct
97 Correct 49 ms 2428 KB correct
98 Correct 54 ms 3168 KB correct
99 Correct 55 ms 2400 KB correct
100 Correct 32 ms 1236 KB correct
101 Correct 17 ms 1036 KB correct
102 Correct 71 ms 4444 KB correct
103 Correct 69 ms 4404 KB correct
104 Correct 68 ms 4428 KB correct
105 Correct 70 ms 4268 KB correct