oj.uz

답안 #491374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
491374 2021-12-01T17:58:20 Z qwerasdfzxcl Simurgh (IOI17_simurgh) C++14
100 / 100
 503 ms 6332 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], cntq;
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;
    //printf("calc: %d %d %d\n", p, l, r);
    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++;
    }
    cntq++;
    assert(cntq<=n*12);
 
    return count_common_roads(Q) - cnt;
}
 
std::vector<int> find_roads(int N, std::vector<int> u, std::vector<int> v) {
    cntq = 0;
    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);
    fill(dfs_chk, dfs_chk+250250, 0);
    fill(visited, visited+505, 0);
    DV.clear();
    for (int i=0;i<505;i++) adj2[i].clear();
    dfs(0);
    int cnt0 = count_common_roads(DV);
    //for (auto &x:DV) printf("%d ", x);
    //printf("\n");
    cntq++;
 
    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]));
        //printf("%d: ", i);
        //for (auto &x:E) printf("%d ", x);
        //printf("\n");
 
        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));
            cntq++;
            assert(cntq<=n*12);
            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{
            assert(flag3!=-1);
            if (val[flag3]==0) val2--;
            //printf(" %d %d\n", flag3, val2);
 
            for (int i=0;i<(int)F.size();i++){
                //printf(" %d", F[i]);
                if (F[i]==val2) val[E[i]] = 1;
                else if (F[i]!=INF) val[E[i]] = 0;
            }
        }
        //for (int i=0;i<(int)u.size();i++) printf("%d ", val[i]);
        //printf("\n");
    }
    //printf("YES\n");
 
    for (int i=0;i<(int)DV.size();i++) if (val[DV[i]]==-1) val[DV[i]] = 1;
    //for (int i=0;i<(int)u.size();i++) printf("%d ", val[i]);
    //printf("\n");
 
    vector<int> ans;
 
    for (int i=0;i<n;i++){
        int prv = i;
        while(calc(i, prv+1, n-1) > 0){
            //printf(" %d %d\n", i, prv);
            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;
        }
    }
    //printf("ans: ");
    //for (auto &x:ans) printf("%d ", x);
    //printf("\n");
 
    //printf("YES:simurgh\n");
 
    if ((int)ans.size()!=n-1) exit(1);
    assert(count_common_roads(ans)==n-1);
    //printf("%d\n", cntq);
    assert(cntq<=6000);
 
    return ans;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3148 KB correct
2 Correct 2 ms 3148 KB correct
3 Correct 2 ms 3148 KB correct
4 Correct 3 ms 3148 KB correct
5 Correct 2 ms 3148 KB correct
6 Correct 2 ms 3148 KB correct
7 Correct 1 ms 204 KB correct
8 Correct 2 ms 3148 KB correct
9 Correct 2 ms 3148 KB correct
10 Correct 2 ms 3148 KB correct
11 Correct 2 ms 3152 KB correct
12 Correct 3 ms 3148 KB correct
13 Correct 2 ms 3148 KB correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3148 KB correct
2 Correct 2 ms 3148 KB correct
3 Correct 2 ms 3148 KB correct
4 Correct 3 ms 3148 KB correct
5 Correct 2 ms 3148 KB correct
6 Correct 2 ms 3148 KB correct
7 Correct 1 ms 204 KB correct
8 Correct 2 ms 3148 KB correct
9 Correct 2 ms 3148 KB correct
10 Correct 2 ms 3148 KB correct
11 Correct 2 ms 3152 KB correct
12 Correct 3 ms 3148 KB correct
13 Correct 2 ms 3148 KB correct
14 Correct 4 ms 3276 KB correct
15 Correct 3 ms 3276 KB correct
16 Correct 4 ms 3276 KB correct
17 Correct 3 ms 3276 KB correct
18 Correct 3 ms 3276 KB correct
19 Correct 4 ms 3276 KB correct
20 Correct 4 ms 3276 KB correct
21 Correct 3 ms 3276 KB correct
22 Correct 3 ms 3276 KB correct
23 Correct 3 ms 3276 KB correct
24 Correct 3 ms 3276 KB correct
25 Correct 2 ms 3148 KB correct
26 Correct 3 ms 3276 KB correct
27 Correct 3 ms 3276 KB correct
28 Correct 2 ms 3276 KB correct
29 Correct 3 ms 3148 KB correct
30 Correct 2 ms 3276 KB correct
31 Correct 3 ms 3276 KB correct
32 Correct 3 ms 3276 KB correct
33 Correct 3 ms 3276 KB correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3148 KB correct
2 Correct 2 ms 3148 KB correct
3 Correct 2 ms 3148 KB correct
4 Correct 3 ms 3148 KB correct
5 Correct 2 ms 3148 KB correct
6 Correct 2 ms 3148 KB correct
7 Correct 1 ms 204 KB correct
8 Correct 2 ms 3148 KB correct
9 Correct 2 ms 3148 KB correct
10 Correct 2 ms 3148 KB correct
11 Correct 2 ms 3152 KB correct
12 Correct 3 ms 3148 KB correct
13 Correct 2 ms 3148 KB correct
14 Correct 4 ms 3276 KB correct
15 Correct 3 ms 3276 KB correct
16 Correct 4 ms 3276 KB correct
17 Correct 3 ms 3276 KB correct
18 Correct 3 ms 3276 KB correct
19 Correct 4 ms 3276 KB correct
20 Correct 4 ms 3276 KB correct
21 Correct 3 ms 3276 KB correct
22 Correct 3 ms 3276 KB correct
23 Correct 3 ms 3276 KB correct
24 Correct 3 ms 3276 KB correct
25 Correct 2 ms 3148 KB correct
26 Correct 3 ms 3276 KB correct
27 Correct 3 ms 3276 KB correct
28 Correct 2 ms 3276 KB correct
29 Correct 3 ms 3148 KB correct
30 Correct 2 ms 3276 KB correct
31 Correct 3 ms 3276 KB correct
32 Correct 3 ms 3276 KB correct
33 Correct 3 ms 3276 KB correct
34 Correct 65 ms 3912 KB correct
35 Correct 68 ms 3928 KB correct
36 Correct 63 ms 3728 KB correct
37 Correct 23 ms 3316 KB correct
38 Correct 62 ms 3864 KB correct
39 Correct 54 ms 3852 KB correct
40 Correct 50 ms 3660 KB correct
41 Correct 61 ms 3916 KB correct
42 Correct 66 ms 3916 KB correct
43 Correct 45 ms 3632 KB correct
44 Correct 41 ms 3532 KB correct
45 Correct 46 ms 3532 KB correct
46 Correct 42 ms 3528 KB correct
47 Correct 33 ms 3392 KB correct
48 Correct 21 ms 3292 KB correct
49 Correct 23 ms 3312 KB correct
50 Correct 28 ms 3396 KB correct
51 Correct 43 ms 3624 KB correct
52 Correct 41 ms 3532 KB correct
53 Correct 51 ms 3532 KB correct
54 Correct 46 ms 3640 KB correct
55 Correct 53 ms 3636 KB correct
56 Correct 45 ms 3636 KB correct
57 Correct 48 ms 3660 KB correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB correct
2 Correct 3 ms 3192 KB correct
3 Correct 313 ms 5212 KB correct
4 Correct 465 ms 6272 KB correct
5 Correct 462 ms 6276 KB correct
6 Correct 465 ms 6272 KB correct
7 Correct 470 ms 6276 KB correct
8 Correct 447 ms 6280 KB correct
9 Correct 454 ms 6276 KB correct
10 Correct 496 ms 6272 KB correct
11 Correct 452 ms 6268 KB correct
12 Correct 503 ms 6160 KB correct
13 Correct 2 ms 3148 KB correct
14 Correct 490 ms 6332 KB correct
15 Correct 437 ms 6264 KB correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3148 KB correct
2 Correct 2 ms 3148 KB correct
3 Correct 2 ms 3148 KB correct
4 Correct 3 ms 3148 KB correct
5 Correct 2 ms 3148 KB correct
6 Correct 2 ms 3148 KB correct
7 Correct 1 ms 204 KB correct
8 Correct 2 ms 3148 KB correct
9 Correct 2 ms 3148 KB correct
10 Correct 2 ms 3148 KB correct
11 Correct 2 ms 3152 KB correct
12 Correct 3 ms 3148 KB correct
13 Correct 2 ms 3148 KB correct
14 Correct 4 ms 3276 KB correct
15 Correct 3 ms 3276 KB correct
16 Correct 4 ms 3276 KB correct
17 Correct 3 ms 3276 KB correct
18 Correct 3 ms 3276 KB correct
19 Correct 4 ms 3276 KB correct
20 Correct 4 ms 3276 KB correct
21 Correct 3 ms 3276 KB correct
22 Correct 3 ms 3276 KB correct
23 Correct 3 ms 3276 KB correct
24 Correct 3 ms 3276 KB correct
25 Correct 2 ms 3148 KB correct
26 Correct 3 ms 3276 KB correct
27 Correct 3 ms 3276 KB correct
28 Correct 2 ms 3276 KB correct
29 Correct 3 ms 3148 KB correct
30 Correct 2 ms 3276 KB correct
31 Correct 3 ms 3276 KB correct
32 Correct 3 ms 3276 KB correct
33 Correct 3 ms 3276 KB correct
34 Correct 65 ms 3912 KB correct
35 Correct 68 ms 3928 KB correct
36 Correct 63 ms 3728 KB correct
37 Correct 23 ms 3316 KB correct
38 Correct 62 ms 3864 KB correct
39 Correct 54 ms 3852 KB correct
40 Correct 50 ms 3660 KB correct
41 Correct 61 ms 3916 KB correct
42 Correct 66 ms 3916 KB correct
43 Correct 45 ms 3632 KB correct
44 Correct 41 ms 3532 KB correct
45 Correct 46 ms 3532 KB correct
46 Correct 42 ms 3528 KB correct
47 Correct 33 ms 3392 KB correct
48 Correct 21 ms 3292 KB correct
49 Correct 23 ms 3312 KB correct
50 Correct 28 ms 3396 KB correct
51 Correct 43 ms 3624 KB correct
52 Correct 41 ms 3532 KB correct
53 Correct 51 ms 3532 KB correct
54 Correct 46 ms 3640 KB correct
55 Correct 53 ms 3636 KB correct
56 Correct 45 ms 3636 KB correct
57 Correct 48 ms 3660 KB correct
58 Correct 1 ms 204 KB correct
59 Correct 3 ms 3192 KB correct
60 Correct 313 ms 5212 KB correct
61 Correct 465 ms 6272 KB correct
62 Correct 462 ms 6276 KB correct
63 Correct 465 ms 6272 KB correct
64 Correct 470 ms 6276 KB correct
65 Correct 447 ms 6280 KB correct
66 Correct 454 ms 6276 KB correct
67 Correct 496 ms 6272 KB correct
68 Correct 452 ms 6268 KB correct
69 Correct 503 ms 6160 KB correct
70 Correct 2 ms 3148 KB correct
71 Correct 490 ms 6332 KB correct
72 Correct 437 ms 6264 KB correct
73 Correct 1 ms 204 KB correct
74 Correct 421 ms 6276 KB correct
75 Correct 438 ms 6180 KB correct
76 Correct 167 ms 4352 KB correct
77 Correct 447 ms 6312 KB correct
78 Correct 473 ms 6276 KB correct
79 Correct 422 ms 6212 KB correct
80 Correct 426 ms 6172 KB correct
81 Correct 373 ms 5732 KB correct
82 Correct 418 ms 6172 KB correct
83 Correct 261 ms 4812 KB correct
84 Correct 284 ms 5032 KB correct
85 Correct 252 ms 4860 KB correct
86 Correct 213 ms 4368 KB correct
87 Correct 192 ms 4036 KB correct
88 Correct 157 ms 3868 KB correct
89 Correct 178 ms 3912 KB correct
90 Correct 170 ms 3736 KB correct
91 Correct 97 ms 3328 KB correct
92 Correct 92 ms 3276 KB correct
93 Correct 305 ms 4924 KB correct
94 Correct 196 ms 4376 KB correct
95 Correct 214 ms 4300 KB correct
96 Correct 152 ms 3772 KB correct
97 Correct 169 ms 3896 KB correct
98 Correct 210 ms 4016 KB correct
99 Correct 157 ms 3916 KB correct
100 Correct 116 ms 3568 KB correct
101 Correct 100 ms 3340 KB correct
102 Correct 264 ms 4836 KB correct
103 Correct 289 ms 4812 KB correct
104 Correct 275 ms 4808 KB correct
105 Correct 280 ms 4792 KB correct