oj.uz

Submission #491364

# Submission time Handle Problem Language Result Execution time Memory
491364 2021-12-01T17:35:00 Z qwerasdfzxcl Simurgh (IOI17_simurgh) C++14
100 / 100
 483 ms 6248 KB 
#include "simurgh.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int INF = 1e9;
struct DSU{
    int path[505];
    void init(int n){for (int i=0;i<=n;i++) path[i] = i;}
    int find(int s){
        if (path[s]==s) return s;
        return path[s] = find(path[s]);
    }
    bool merge(int s, int v){
        int x = find(s), y = find(v);
        if (x==y) return 0;
        path[x] = y;
        return 1;
    }
}dsu;
int adj[505][505], n, val[250250], dfs_chk[250250];
bool visited[505];
vector<int> U, V, DV, E, F, adj2[505];

void dfs(int s){
    visited[s] = 1;
    for (int i=0;i<n;i++) if (!visited[i] && adj[s][i]!=-1){
        DV.push_back(adj[s][i]);
        dfs_chk[adj[s][i]] = 1;
        adj2[s].push_back(i);
        adj2[i].push_back(s);
        dfs(i);
    }
}

bool find_path(int s, int e){
    if (s==e) return 1;
    visited[s] = 1;
    for (auto &v:adj2[s]) if (!visited[v]){
        E.push_back(adj[s][v]);
        if (find_path(v, e)) return 1;
        E.pop_back();
    }
    return 0;
}

int calc(int p, int l, int r){
    if (l>r) return 0;
    dsu.init(n);
    vector<int> Q;
    for (int i=l;i<=r;i++) if (adj[p][i]!=-1){
        Q.push_back(adj[p][i]);
        dsu.merge(p, i);
    }

    int cnt = 0;
    for (auto &t:DV) if (dsu.merge(U[t], V[t])){
        Q.push_back(t);
        if (val[t]==1) cnt++;
    }

    return count_common_roads(Q) - cnt;
}

std::vector<int> find_roads(int N, std::vector<int> u, std::vector<int> v) {
    if (N==2) return {0};
    n = N;
    U = u, V = v;
    fill(adj[0], adj[504]+505, -1);
    for (int i=0;i<(int)u.size();i++){
        adj[u[i]][v[i]] = i;
        adj[v[i]][u[i]] = i;
    }

    fill(val, val+250250, -1);
    dfs(0);
    int cnt0 = count_common_roads(DV);

    for (int i=0;i<(int)u.size();i++) if (!dfs_chk[i]){
        E.clear();
        F.clear();
        fill(visited, visited+n, 0);
        assert(find_path(u[i], v[i]));

        bool flag = 0, flag2 = 0;;
        for (auto &t:E) if (val[t]!=-1) flag = 1;
        for (auto &t:E) if (val[t]==-1) flag2 = 1;
        if (!flag2) continue;

        vector<int> Q = DV;
        int flag3 = -1, val2 = -1;
        int prvE = i;
        for (auto &t:E){
            if (flag3!=-1 && val[t]!=-1) {F.push_back(INF); continue;}
            for (auto iter = Q.begin();iter!=Q.end();iter++) if (*iter==t) {Q.erase(iter); break;}
            Q.push_back(prvE);
            F.push_back(count_common_roads(Q));
            prvE = t;

            if (val[t]!=-1) flag3 = t, val2 = F.back();
        }

        if (!flag){
            int mn = min(*min_element(F.begin(), F.end()), cnt0);
            int mx = max(*max_element(F.begin(), F.end()), cnt0);
            for (int i=0;i<(int)F.size();i++){
                if (mn==mx) val[E[i]] = 0;
                else if (F[i]==mn) val[E[i]] = 1;
                else val[E[i]] = 0;
            }
        }
        else{
            if (val[flag3]==0) val2--;

            for (int i=0;i<(int)F.size();i++){
                if (F[i]==val2) val[E[i]] = 1;
                else if (F[i]!=INF) val[E[i]] = 0;
            }
        }
    }

    for (int i=0;i<(int)DV.size();i++) if (val[DV[i]]==-1) val[DV[i]] = 1;

    vector<int> ans;

    for (int i=0;i<n;i++){
        int prv = i;
        while(calc(i, prv+1, n-1) > 0){
            int l = prv+1, r = n-1;
            while(r-l > 0){
                int m = (l+r)>>1;
                if (calc(i, l, m) > 0) r = m;
                else l = m+1;
            }
            ans.push_back(adj[i][l]);
            prv = l;
        }
    }

    return ans;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2252 KB correct
2 Correct 1 ms 2252 KB correct
3 Correct 1 ms 2252 KB correct
4 Correct 1 ms 2252 KB correct
5 Correct 1 ms 2252 KB correct
6 Correct 1 ms 2252 KB correct
7 Correct 0 ms 204 KB correct
8 Correct 1 ms 2252 KB correct
9 Correct 1 ms 2252 KB correct
10 Correct 1 ms 2252 KB correct
11 Correct 1 ms 2252 KB correct
12 Correct 1 ms 2252 KB correct
13 Correct 1 ms 2252 KB correct
14 Correct 3 ms 2324 KB correct
15 Correct 3 ms 2252 KB correct
16 Correct 2 ms 2252 KB correct
17 Correct 3 ms 2324 KB correct
18 Correct 2 ms 2252 KB correct
19 Correct 2 ms 2252 KB correct
20 Correct 2 ms 2252 KB correct
21 Correct 2 ms 2252 KB correct
22 Correct 2 ms 2252 KB correct
23 Correct 2 ms 2252 KB correct
24 Correct 2 ms 2252 KB correct
25 Correct 2 ms 2252 KB correct
26 Correct 4 ms 2252 KB correct
27 Correct 4 ms 2252 KB correct
28 Correct 2 ms 2252 KB correct
29 Correct 2 ms 2252 KB correct
30 Correct 2 ms 2252 KB correct
31 Correct 2 ms 2252 KB correct
32 Correct 3 ms 2316 KB correct
33 Correct 2 ms 2252 KB correct
34 Correct 60 ms 3020 KB correct
35 Correct 68 ms 3020 KB correct
36 Correct 61 ms 3012 KB correct
37 Correct 23 ms 2252 KB correct
38 Correct 75 ms 3088 KB correct
39 Correct 53 ms 2972 KB correct
40 Correct 46 ms 2764 KB correct
41 Correct 59 ms 3088 KB correct
42 Correct 63 ms 3020 KB correct
43 Correct 44 ms 2728 KB correct
44 Correct 38 ms 2588 KB correct
45 Correct 41 ms 2636 KB correct
46 Correct 41 ms 2604 KB correct
47 Correct 28 ms 2436 KB correct
48 Correct 20 ms 2316 KB correct
49 Correct 23 ms 2252 KB correct
50 Correct 38 ms 2380 KB correct
51 Correct 40 ms 2640 KB correct
52 Correct 37 ms 2648 KB correct
53 Correct 38 ms 2508 KB correct
54 Correct 42 ms 2636 KB correct
55 Correct 42 ms 2636 KB correct
56 Correct 44 ms 2636 KB correct
57 Correct 46 ms 2636 KB correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB correct
2 Correct 2 ms 2296 KB correct
3 Correct 242 ms 4748 KB correct
4 Correct 452 ms 5984 KB correct
5 Correct 434 ms 6000 KB correct
6 Correct 415 ms 6248 KB correct
7 Correct 450 ms 5988 KB correct
8 Correct 413 ms 6120 KB correct
9 Correct 483 ms 6000 KB correct
10 Correct 450 ms 6000 KB correct
11 Correct 445 ms 6004 KB correct
12 Correct 416 ms 5976 KB correct
13 Correct 1 ms 2252 KB correct
14 Correct 440 ms 5988 KB correct
15 Correct 418 ms 6084 KB correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2252 KB correct
2 Correct 1 ms 2252 KB correct
3 Correct 1 ms 2252 KB correct
4 Correct 1 ms 2252 KB correct
5 Correct 1 ms 2252 KB correct
6 Correct 1 ms 2252 KB correct
7 Correct 0 ms 204 KB correct
8 Correct 1 ms 2252 KB correct
9 Correct 1 ms 2252 KB correct
10 Correct 1 ms 2252 KB correct
11 Correct 1 ms 2252 KB correct
12 Correct 1 ms 2252 KB correct
13 Correct 1 ms 2252 KB correct
14 Correct 3 ms 2324 KB correct
15 Correct 3 ms 2252 KB correct
16 Correct 2 ms 2252 KB correct
17 Correct 3 ms 2324 KB correct
18 Correct 2 ms 2252 KB correct
19 Correct 2 ms 2252 KB correct
20 Correct 2 ms 2252 KB correct
21 Correct 2 ms 2252 KB correct
22 Correct 2 ms 2252 KB correct
23 Correct 2 ms 2252 KB correct
24 Correct 2 ms 2252 KB correct
25 Correct 2 ms 2252 KB correct
26 Correct 4 ms 2252 KB correct
27 Correct 4 ms 2252 KB correct
28 Correct 2 ms 2252 KB correct
29 Correct 2 ms 2252 KB correct
30 Correct 2 ms 2252 KB correct
31 Correct 2 ms 2252 KB correct
32 Correct 3 ms 2316 KB correct
33 Correct 2 ms 2252 KB correct
34 Correct 60 ms 3020 KB correct
35 Correct 68 ms 3020 KB correct
36 Correct 61 ms 3012 KB correct
37 Correct 23 ms 2252 KB correct
38 Correct 75 ms 3088 KB correct
39 Correct 53 ms 2972 KB correct
40 Correct 46 ms 2764 KB correct
41 Correct 59 ms 3088 KB correct
42 Correct 63 ms 3020 KB correct
43 Correct 44 ms 2728 KB correct
44 Correct 38 ms 2588 KB correct
45 Correct 41 ms 2636 KB correct
46 Correct 41 ms 2604 KB correct
47 Correct 28 ms 2436 KB correct
48 Correct 20 ms 2316 KB correct
49 Correct 23 ms 2252 KB correct
50 Correct 38 ms 2380 KB correct
51 Correct 40 ms 2640 KB correct
52 Correct 37 ms 2648 KB correct
53 Correct 38 ms 2508 KB correct
54 Correct 42 ms 2636 KB correct
55 Correct 42 ms 2636 KB correct
56 Correct 44 ms 2636 KB correct
57 Correct 46 ms 2636 KB correct
58 Correct 1 ms 204 KB correct
59 Correct 2 ms 2296 KB correct
60 Correct 242 ms 4748 KB correct
61 Correct 452 ms 5984 KB correct
62 Correct 434 ms 6000 KB correct
63 Correct 415 ms 6248 KB correct
64 Correct 450 ms 5988 KB correct
65 Correct 413 ms 6120 KB correct
66 Correct 483 ms 6000 KB correct
67 Correct 450 ms 6000 KB correct
68 Correct 445 ms 6004 KB correct
69 Correct 416 ms 5976 KB correct
70 Correct 1 ms 2252 KB correct
71 Correct 440 ms 5988 KB correct
72 Correct 418 ms 6084 KB correct
73 Correct 0 ms 204 KB correct
74 Correct 438 ms 5904 KB correct
75 Correct 425 ms 5672 KB correct
76 Correct 172 ms 3560 KB correct
77 Correct 407 ms 5772 KB correct
78 Correct 413 ms 5784 KB correct
79 Correct 431 ms 5776 KB correct
80 Correct 417 ms 5668 KB correct
81 Correct 370 ms 5168 KB correct
82 Correct 401 ms 5676 KB correct
83 Correct 273 ms 4068 KB correct
84 Correct 262 ms 4436 KB correct
85 Correct 254 ms 4044 KB correct
86 Correct 205 ms 3588 KB correct
87 Correct 177 ms 3268 KB correct
88 Correct 158 ms 2892 KB correct
89 Correct 171 ms 2948 KB correct
90 Correct 160 ms 2832 KB correct
91 Correct 103 ms 2380 KB correct
92 Correct 85 ms 2324 KB correct
93 Correct 266 ms 4132 KB correct
94 Correct 193 ms 3600 KB correct
95 Correct 202 ms 3492 KB correct
96 Correct 155 ms 2892 KB correct
97 Correct 162 ms 2996 KB correct
98 Correct 176 ms 3200 KB correct
99 Correct 168 ms 3048 KB correct
100 Correct 113 ms 2380 KB correct
101 Correct 86 ms 2252 KB correct
102 Correct 267 ms 4100 KB correct
103 Correct 286 ms 4088 KB correct
104 Correct 259 ms 4060 KB correct
105 Correct 260 ms 4056 KB correct