oj.uz

답안 #301063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
301063 2020-09-17T16:08:36 Z rocks03 슈퍼트리 잇기 (IOI20_supertrees) C++14
40 / 100
 264 ms 22264 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int) (x).size())
using namespace std;

void build(vector<vector<int>> _b);

const int MAXN = 1e3+100;
int p[MAXN], sz[MAXN];
void init(int n){
    iota(p, p+n, 0);
    fill(sz, sz+n, 1);
}

int find_parent(int x){
    if(x == p[x])
        return x;
    return p[x] = find_parent(p[x]);
}

bool same_set(int a, int b){
    return (find_parent(a) == find_parent(b));
}

void union_set(int a, int b){
    a = find_parent(a);
    b = find_parent(b);
    if(a == b)
        return;
    if(sz[a] < sz[b])
        swap(a, b);
    p[b] = a;
    sz[a] += sz[b];
}

int p2[MAXN], sz2[MAXN];
void init2(int n){
    iota(p2, p2+n, 0);
    fill(sz2, sz2+n, 1);
}

int find2(int x){
    if(x == p2[x])
        return x;
    return p2[x] = find2(p2[x]);
}

bool same2(int a, int b){
    return (find2(a) == find2(b));
}

void union2(int a, int b){
    a = find2(a);
    b = find2(b);
    if(a == b)
        return;
    if(sz2[a] < sz2[b])
        swap(a, b);
    p2[b] = a;
    sz2[a] += sz2[b];
}

int construct(vector<vector<int>> p){
    int N = SZ(p);
    init(N);
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            if(p[i][j] > 0){
                union_set(i, j);
            }
        }
    }
    vector<vector<int>> ans(N, vector<int>(N, 0));
    vector<bool> vis(N, false), vis2(N, false), touse(N, false);
    init2(N);
    for(int i = 0; i < N; i++){
        int v = find_parent(i);
        if(!vis[v]){
            vis[v] = true;
            vector<int> vertici;
            vertici.pb(i);
            for(int j = i+1; j < N; j++){
                if(same_set(i, j)){
                    vertici.pb(j);
                }
            }
            for(int j = 0; j < SZ(vertici); j++){
                for(int k = 0; k < SZ(vertici); k++){
                    if(p[vertici[j]][vertici[k]] == 0){
                        return 0;
                    }
                }
            }
            if(SZ(vertici) == 2 && p[vertici[0]][vertici[1]] >= 2){
                return 0;
            }
            bool onlyone = true;
            for(int j = 0; j < SZ(vertici); j++){
                for(int k = 0; k < SZ(vertici); k++){
                    if(p[vertici[j]][vertici[k]] != 1){
                        onlyone = false;
                    }
                }
            }
            if(onlyone){
                for(int j = 1; j < SZ(vertici); j++){
                    ans[vertici[j-1]][vertici[j]] = 1;
                    ans[vertici[j]][vertici[j-1]] = 1;
                }
                continue;
            }
            for(int j = 0; j < SZ(vertici); j++){
                for(int k = j + 1; k < SZ(vertici); k++){
                    int v1 = vertici[j], v2 = vertici[k];
                    if(p[v1][v2] == 1){
                        union2(v1, v2);
                        touse[find2(v1)] = true;
                    }
                }
            }

            vector<set<int>> vs;
            for(int j = 0; j < SZ(vertici); j++){
                int root = find2(vertici[j]);
                if(!touse[root] || vis2[root]) continue;
                vis2[root] = true;
                set<int> nuovo;
                nuovo.insert(vertici[j]);
                for(int k = j+1; k < SZ(vertici); k++){
                    if(same2(vertici[j], vertici[k])){
                        nuovo.insert(vertici[k]);
                    }
                }
                vs.pb(nuovo);
            }
            set<int> c;
            for(auto x : vertici){
                int root = find2(x);
                if(!vis2[root]){
                    c.insert(x);
                }
            }
            vector<int> centre;
            int last = -1;
            for(auto x : c){
                if(last != -1){
                    ans[last][x] = ans[x][last] = 1;
                }
                last = x;
                centre.pb(x);
            }
            if(SZ(c)){
                for(int index = 0, j = 0; index < SZ(vs); index++){
                    last = -1;
                    for(auto x : vs[index]){
                        if(last != -1){
                            ans[last][x] = ans[x][last] = 1;
                        }
                        last = x;
                    }
                    ans[last][centre[0]] = ans[centre[0]][last] = 1;
                }
                int da, a;
                if(!SZ(vs)){
                    da = *c.begin(), a = *c.rbegin();
                } else{
                    da = *vs[0].rbegin(), a = *c.rbegin();
                }
                ans[da][a] = ans[a][da] = 1;
            } else if(!SZ(c) && SZ(vs) > 2){
                int da = *vs[0].rbegin(), a = *vs[1].begin();
                ans[da][a] = ans[a][da] = 1;
                a = *vs[2].begin();
                ans[da][a] = ans[a][da] = 1;
                for(int j = 3; j < SZ(vs); j++){
                    int capo = *vs[j].rbegin();
                    ans[capo][a] = ans[a][capo] = 1;
                }
                for(int j = 0; j < SZ(vs); j++){
                    int last = -1;
                    for(auto x : vs[j]){
                        if(last != -1){
                            ans[last][x] = ans[x][last] = 1;
                        }
                        last = x;
                    }
                }
            } else{
                return 0;
            }
        }
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:158:36: warning: unused variable 'j' [-Wunused-variable]
  158 |                 for(int index = 0, j = 0; index < SZ(vs); index++){
      |                                    ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 260 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 260 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 253 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 113 ms 12156 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 60 ms 5884 KB Output is correct
21 Correct 257 ms 22136 KB Output is correct
22 Correct 249 ms 22264 KB Output is correct
23 Correct 262 ms 22264 KB Output is correct
24 Correct 237 ms 22136 KB Output is correct
25 Correct 105 ms 12152 KB Output is correct
26 Correct 98 ms 12152 KB Output is correct
27 Correct 257 ms 22136 KB Output is correct
28 Correct 240 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 10 ms 1220 KB Output is correct
9 Correct 240 ms 22104 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 247 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 116 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 61 ms 5880 KB Output is correct
22 Correct 246 ms 22188 KB Output is correct
23 Correct 245 ms 22136 KB Output is correct
24 Correct 258 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 100 ms 12152 KB Output is correct
27 Correct 253 ms 22136 KB Output is correct
28 Correct 257 ms 22140 KB Output is correct
29 Correct 104 ms 12120 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 64 ms 5880 KB Output is correct
5 Correct 260 ms 22136 KB Output is correct
6 Correct 260 ms 22136 KB Output is correct
7 Correct 264 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 82 ms 5880 KB Output is correct
10 Correct 243 ms 22136 KB Output is correct
11 Correct 239 ms 22136 KB Output is correct
12 Correct 253 ms 22104 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Incorrect 62 ms 5880 KB Too few ways to get from 0 to 24, should be 2 found 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 260 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 253 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 113 ms 12156 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 60 ms 5884 KB Output is correct
21 Correct 257 ms 22136 KB Output is correct
22 Correct 249 ms 22264 KB Output is correct
23 Correct 262 ms 22264 KB Output is correct
24 Correct 237 ms 22136 KB Output is correct
25 Correct 105 ms 12152 KB Output is correct
26 Correct 98 ms 12152 KB Output is correct
27 Correct 257 ms 22136 KB Output is correct
28 Correct 240 ms 22136 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1220 KB Output is correct
37 Correct 240 ms 22104 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 247 ms 22136 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 768 KB Output is correct
45 Correct 116 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 246 ms 22188 KB Output is correct
51 Correct 245 ms 22136 KB Output is correct
52 Correct 258 ms 22136 KB Output is correct
53 Correct 100 ms 12152 KB Output is correct
54 Correct 100 ms 12152 KB Output is correct
55 Correct 253 ms 22136 KB Output is correct
56 Correct 257 ms 22140 KB Output is correct
57 Correct 104 ms 12120 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 113 ms 12120 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Incorrect 61 ms 5884 KB Too few ways to get from 1 to 11, should be 2 found 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 260 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 253 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 113 ms 12156 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 60 ms 5884 KB Output is correct
21 Correct 257 ms 22136 KB Output is correct
22 Correct 249 ms 22264 KB Output is correct
23 Correct 262 ms 22264 KB Output is correct
24 Correct 237 ms 22136 KB Output is correct
25 Correct 105 ms 12152 KB Output is correct
26 Correct 98 ms 12152 KB Output is correct
27 Correct 257 ms 22136 KB Output is correct
28 Correct 240 ms 22136 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1220 KB Output is correct
37 Correct 240 ms 22104 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 247 ms 22136 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 768 KB Output is correct
45 Correct 116 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 246 ms 22188 KB Output is correct
51 Correct 245 ms 22136 KB Output is correct
52 Correct 258 ms 22136 KB Output is correct
53 Correct 100 ms 12152 KB Output is correct
54 Correct 100 ms 12152 KB Output is correct
55 Correct 253 ms 22136 KB Output is correct
56 Correct 257 ms 22140 KB Output is correct
57 Correct 104 ms 12120 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 64 ms 5880 KB Output is correct
62 Correct 260 ms 22136 KB Output is correct
63 Correct 260 ms 22136 KB Output is correct
64 Correct 264 ms 22136 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 82 ms 5880 KB Output is correct
67 Correct 243 ms 22136 KB Output is correct
68 Correct 239 ms 22136 KB Output is correct
69 Correct 253 ms 22104 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Incorrect 62 ms 5880 KB Too few ways to get from 0 to 24, should be 2 found 1
74 Halted 0 ms 0 KB -