oj.uz

답안 #488088

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488088 2021-11-17T16:11:24 Z SlavicG 슈퍼트리 잇기 (IOI20_supertrees) C++17
96 / 100
 219 ms 26168 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
 
struct DSU{
    int n;
    vector<int> par, s;
 
    DSU(int N){
        n = N;
        s.assign(n, 1), par.resize(n);
        iota(all(par), 0);
    }
 
    int get(int a){
        return par[a] = (a == par[a] ? a : get(par[a]));
    }
 
    void uni(int a, int b){
        a = get(a), b = get(b);
        if(s[a] > s[b])swap(a, b);
        par[a] = b, s[b] += s[a];
    }
 
    int get_size(int a){
        return s[get(a)];
    }
    bool same_set(int a, int b){
        return get(a) == get(b);
    }
};
 
const int N = 1005;
vector<int> adj[N], adj2[N];
vector<int> component;
bool vis[N];

void dfs(int u){
    component.pb(u);
    vis[u] = true;
    for(int v: adj[u])if(!vis[v])dfs(v);
}
 
int construct(vector<vector<int>> p){
    int n = sz(p);
    vector<vector<int>> ans(n, vector<int>(n, 0));
    
    forn(i,n)adj[i].clear(), adj2[i].clear();
    DSU d(n);
    DSU fuck(n);    
    for(int i = 0;i < n; ++i){
        for(int j = 0;j < n; ++j){
            if(i == j)continue;
            if(p[i][j] != p[j][i])return 0;
        }
    }
    for(int i = 0;i < n; ++i){
        vis[i] = false;
        for(int j = 0;j < n; ++j){
            if(p[i][j] == 2 && i != j){
                adj[i].pb(j);
            }
            if(p[i][j] == 1 && i != j){
                if(!d.same_set(i, j)){
                    d.uni(i, j);
                    ans[i][j] = ans[j][i] = 1;
                }
            }
        }
    }
    for(int i = 0;i < n; ++i){
        if(!vis[d.get(i)]){
            component.clear();
            dfs(i);
            vector<int> temp;
            for(auto x: component)vis[d.get(x)] = true;
            for(int i = 0;i < sz(component);++i){
                component[i] = d.get(component[i]);
            }
            sort(all(component));
            component.erase(unique(all(component)), component.end());
            if(sz(component) == 2)return 0;
            for(int i = 0;i < sz(component); ++i){
                if(sz(component) > 1)ans[component[i]][component[(i + 1) % sz(component)]] = ans[component[(i + 1) % sz(component)]][component[i]] = 1;
                fuck.uni(component[i], component[(i + 1) % sz(component)]);
            }
        }
    }

    for(int i = 0;i < n; ++i){
        for(int j = 0;j < n; ++j){
            if(i == j)continue;
            if(ans[i][j] && !p[i][j])return 0;
            if(fuck.same_set(i, j) && !p[i][j])return 0;
            if(d.same_set(i, j) && !p[i][j])return 0;
        }
    }
    for(int i = 0;i < n; ++i){
        adj[i].clear();
        adj2[i].clear();
        vis[i] = false;
    }
    build(ans);
    return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 8 ms 1136 KB Output is correct
7 Correct 193 ms 22064 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 8 ms 1136 KB Output is correct
7 Correct 193 ms 22064 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 182 ms 22076 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 91 ms 12088 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 53 ms 5760 KB Output is correct
21 Correct 187 ms 22056 KB Output is correct
22 Correct 193 ms 22056 KB Output is correct
23 Correct 203 ms 22004 KB Output is correct
24 Correct 180 ms 22084 KB Output is correct
25 Correct 81 ms 12088 KB Output is correct
26 Correct 74 ms 12076 KB Output is correct
27 Correct 200 ms 22056 KB Output is correct
28 Correct 181 ms 22056 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 8 ms 1228 KB Output is correct
9 Correct 187 ms 22060 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 8 ms 1396 KB Output is correct
13 Correct 189 ms 26168 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 87 ms 14636 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 47 ms 5804 KB Output is correct
22 Correct 189 ms 22572 KB Output is correct
23 Correct 207 ms 22056 KB Output is correct
24 Correct 205 ms 25124 KB Output is correct
25 Correct 73 ms 12092 KB Output is correct
26 Correct 75 ms 12588 KB Output is correct
27 Correct 194 ms 22072 KB Output is correct
28 Correct 212 ms 24104 KB Output is correct
29 Correct 78 ms 12100 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 47 ms 5720 KB Output is correct
5 Correct 190 ms 22020 KB Output is correct
6 Correct 186 ms 22072 KB Output is correct
7 Correct 206 ms 22068 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 48 ms 5796 KB Output is correct
10 Correct 189 ms 22584 KB Output is correct
11 Correct 195 ms 22124 KB Output is correct
12 Correct 200 ms 25164 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 47 ms 5808 KB Output is correct
17 Correct 194 ms 22588 KB Output is correct
18 Correct 197 ms 22572 KB Output is correct
19 Correct 219 ms 22188 KB Output is correct
20 Correct 179 ms 22084 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 8 ms 1136 KB Output is correct
7 Correct 193 ms 22064 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 182 ms 22076 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 91 ms 12088 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 53 ms 5760 KB Output is correct
21 Correct 187 ms 22056 KB Output is correct
22 Correct 193 ms 22056 KB Output is correct
23 Correct 203 ms 22004 KB Output is correct
24 Correct 180 ms 22084 KB Output is correct
25 Correct 81 ms 12088 KB Output is correct
26 Correct 74 ms 12076 KB Output is correct
27 Correct 200 ms 22056 KB Output is correct
28 Correct 181 ms 22056 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 187 ms 22060 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 8 ms 1396 KB Output is correct
41 Correct 189 ms 26168 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 87 ms 14636 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 47 ms 5804 KB Output is correct
50 Correct 189 ms 22572 KB Output is correct
51 Correct 207 ms 22056 KB Output is correct
52 Correct 205 ms 25124 KB Output is correct
53 Correct 73 ms 12092 KB Output is correct
54 Correct 75 ms 12588 KB Output is correct
55 Correct 194 ms 22072 KB Output is correct
56 Correct 212 ms 24104 KB Output is correct
57 Correct 78 ms 12100 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 6 ms 844 KB Output is correct
61 Correct 93 ms 14260 KB Output is correct
62 Correct 0 ms 332 KB Output is correct
63 Correct 0 ms 332 KB Output is correct
64 Correct 0 ms 332 KB Output is correct
65 Correct 49 ms 5764 KB Output is correct
66 Correct 77 ms 14620 KB Output is correct
67 Correct 76 ms 14660 KB Output is correct
68 Correct 99 ms 14244 KB Output is correct
69 Correct 73 ms 14104 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 8 ms 1136 KB Output is correct
7 Correct 193 ms 22064 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 182 ms 22076 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 91 ms 12088 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 53 ms 5760 KB Output is correct
21 Correct 187 ms 22056 KB Output is correct
22 Correct 193 ms 22056 KB Output is correct
23 Correct 203 ms 22004 KB Output is correct
24 Correct 180 ms 22084 KB Output is correct
25 Correct 81 ms 12088 KB Output is correct
26 Correct 74 ms 12076 KB Output is correct
27 Correct 200 ms 22056 KB Output is correct
28 Correct 181 ms 22056 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 187 ms 22060 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 8 ms 1396 KB Output is correct
41 Correct 189 ms 26168 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 87 ms 14636 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 47 ms 5804 KB Output is correct
50 Correct 189 ms 22572 KB Output is correct
51 Correct 207 ms 22056 KB Output is correct
52 Correct 205 ms 25124 KB Output is correct
53 Correct 73 ms 12092 KB Output is correct
54 Correct 75 ms 12588 KB Output is correct
55 Correct 194 ms 22072 KB Output is correct
56 Correct 212 ms 24104 KB Output is correct
57 Correct 78 ms 12100 KB Output is correct
58 Correct 0 ms 328 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 0 ms 332 KB Output is correct
61 Correct 47 ms 5720 KB Output is correct
62 Correct 190 ms 22020 KB Output is correct
63 Correct 186 ms 22072 KB Output is correct
64 Correct 206 ms 22068 KB Output is correct
65 Correct 0 ms 332 KB Output is correct
66 Correct 48 ms 5796 KB Output is correct
67 Correct 189 ms 22584 KB Output is correct
68 Correct 195 ms 22124 KB Output is correct
69 Correct 200 ms 25164 KB Output is correct
70 Correct 0 ms 332 KB Output is correct
71 Correct 0 ms 332 KB Output is correct
72 Correct 0 ms 332 KB Output is correct
73 Correct 47 ms 5808 KB Output is correct
74 Correct 194 ms 22588 KB Output is correct
75 Correct 197 ms 22572 KB Output is correct
76 Correct 219 ms 22188 KB Output is correct
77 Correct 179 ms 22084 KB Output is correct
78 Correct 0 ms 332 KB Output is correct
79 Correct 1 ms 332 KB Output is correct
80 Correct 6 ms 844 KB Output is correct
81 Correct 93 ms 14260 KB Output is correct
82 Correct 0 ms 332 KB Output is correct
83 Correct 0 ms 332 KB Output is correct
84 Correct 0 ms 332 KB Output is correct
85 Correct 49 ms 5764 KB Output is correct
86 Correct 77 ms 14620 KB Output is correct
87 Correct 76 ms 14660 KB Output is correct
88 Correct 99 ms 14244 KB Output is correct
89 Correct 73 ms 14104 KB Output is correct
90 Correct 0 ms 332 KB Output is correct
91 Correct 0 ms 332 KB Output is correct
92 Correct 4 ms 972 KB Output is correct
93 Correct 93 ms 15476 KB Output is correct
94 Incorrect 1 ms 332 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -