oj.uz

답안 #1073580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073580 2024-08-24T16:19:04 Z blushingecchigirl 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 141 ms 24148 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back

struct dsu {
    vector<int> parent, rank;
    int size;

    dsu(int sz) {
        size = sz;
        rank.assign(size, 1);
        parent.resize(size);
        for(int i = 0; i<size; i++) parent[i] = i;
    }
    int search(int v) {
        if(v == parent[v]) return v;
        return parent[v] = search(parent[v]);
    }
    void connect(int v, int u) {
        v = search(v);
        u = search(u);
        if(v == u) return;
        if(rank[v]>=rank[u]) parent[u] = v;
        else parent[v] = u;
        if(rank[v] == rank[u]) rank[v]++;
        return;
    }
};

void build(std::vector<std::vector<int>> b);
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	bool ctr = 1;
    vector<vector<int>> b(n);
    for(int i = 0; i<n; i++) b[i].resize(n, 0);
    
    vector<int> a[n];
    dsu d = dsu(n);
    for(int i = 0; i<n; i++) {
        for(int j = 0; j<n; j++) {
            if(p[i][j]) d.connect(i, j);
        }
    }
    for(int i = 0; i<n; i++) {
        a[d.search(i)].pb(i);
    }
    for(int i = 0; i<n; i++) {
        int sz = a[i].size();
        if(sz<=1) continue;
        vector<int> tree[sz], circle;
        dsu dd = dsu(sz);
        for(int ii = 0; ii<sz; ii++) {
            for(int j = 0; j<sz; j++) {
                if(p[a[i][ii]][a[i][j]] == 1) dd.connect(ii, j);
            }
        }
        for(int ii = 0; ii<sz; ii++) {
            tree[dd.search(ii)].pb(a[i][ii]);
        }
        for(int ii = 0; ii<sz; ii++) {
            if(tree[ii].size() == 0) continue;
            if(tree[ii].size()>1) {
                for(size_t j = 1; j<tree[ii].size(); j++) b[tree[ii][j]][tree[ii][j-1]] = b[tree[ii][j-1]][tree[ii][j]] = 1;
            }
            for(size_t iii = 0; iii < tree[ii].size(); iii++) {
                for(size_t j = 0; j < tree[ii].size(); j++) {
                    if(p[tree[ii][iii]][tree[ii][j]] != 1) ctr = 0;
                }
            }
            circle.pb(tree[ii][0]);
        }
        for(size_t ii = 1; ii<circle.size(); ii++) {
            b[circle[ii]][circle[ii-1]] = b[circle[ii-1]][circle[ii]] = 1;
        }
        if(circle.size()>1) b[circle[0]][circle.back()] = b[circle.back()][circle[0]] = 1;
        if(circle.size() == 2) ctr = 0;
    }
	if(ctr) build(b);
	return ctr;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 141 ms 22096 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 141 ms 22096 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 119 ms 22100 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 79 ms 14168 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 380 KB Output is correct
20 Correct 29 ms 6228 KB Output is correct
21 Correct 115 ms 24144 KB Output is correct
22 Correct 125 ms 24144 KB Output is correct
23 Correct 124 ms 24144 KB Output is correct
24 Correct 124 ms 24144 KB Output is correct
25 Correct 57 ms 14160 KB Output is correct
26 Correct 58 ms 14200 KB Output is correct
27 Correct 122 ms 24148 KB Output is correct
28 Correct 125 ms 24148 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 1388 KB Output is correct
9 Correct 121 ms 24100 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 127 ms 24008 KB Output is correct
14 Incorrect 0 ms 344 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 31 ms 5836 KB Output is correct
5 Correct 122 ms 22096 KB Output is correct
6 Correct 120 ms 22100 KB Output is correct
7 Correct 134 ms 22100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 30 ms 5856 KB Output is correct
10 Correct 116 ms 22100 KB Output is correct
11 Correct 118 ms 22100 KB Output is correct
12 Correct 121 ms 22036 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 30 ms 5716 KB Output is correct
17 Correct 118 ms 22224 KB Output is correct
18 Correct 112 ms 22100 KB Output is correct
19 Correct 121 ms 22036 KB Output is correct
20 Correct 115 ms 22096 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 141 ms 22096 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 119 ms 22100 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 79 ms 14168 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 380 KB Output is correct
20 Correct 29 ms 6228 KB Output is correct
21 Correct 115 ms 24144 KB Output is correct
22 Correct 125 ms 24144 KB Output is correct
23 Correct 124 ms 24144 KB Output is correct
24 Correct 124 ms 24144 KB Output is correct
25 Correct 57 ms 14160 KB Output is correct
26 Correct 58 ms 14200 KB Output is correct
27 Correct 122 ms 24148 KB Output is correct
28 Correct 125 ms 24148 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1388 KB Output is correct
37 Correct 121 ms 24100 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 6 ms 1372 KB Output is correct
41 Correct 127 ms 24008 KB Output is correct
42 Incorrect 0 ms 344 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 141 ms 22096 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 119 ms 22100 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 79 ms 14168 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 380 KB Output is correct
20 Correct 29 ms 6228 KB Output is correct
21 Correct 115 ms 24144 KB Output is correct
22 Correct 125 ms 24144 KB Output is correct
23 Correct 124 ms 24144 KB Output is correct
24 Correct 124 ms 24144 KB Output is correct
25 Correct 57 ms 14160 KB Output is correct
26 Correct 58 ms 14200 KB Output is correct
27 Correct 122 ms 24148 KB Output is correct
28 Correct 125 ms 24148 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1388 KB Output is correct
37 Correct 121 ms 24100 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 6 ms 1372 KB Output is correct
41 Correct 127 ms 24008 KB Output is correct
42 Incorrect 0 ms 344 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -