oj.uz

답안 #927416

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927416 2024-02-14T20:21:44 Z VMaksimoski008 슈퍼트리 잇기 (IOI20_supertrees) C++14
96 / 100
 180 ms 26196 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
 
struct DSU {
    int n, comp;
    vector<int> par, size;
 
    void config(int _n) {
        n = _n + 1;
        comp = _n;
        par.resize(n+1);
        size.resize(n+1, 1);
        for(int i=1; i<=n; i++) par[i] = i;
    }
 
    int get(int u) {
        if(u == par[u]) return u;
        return par[u] = get(par[u]);
    }
 
    bool uni(int u, int v) {
        u = get(u), v = get(v);
 
        if(u == v) return false;
        if(size[u] < size[v]) swap(u, v);
 
        size[u] += size[v];
        par[v] = u;
        comp--;
 
        return true;
    }
 
    int getComp() { return comp; }
    int getSize(int u) { return size[get(u)]; }
    bool sameSet(int u, int v) { return get(u) == get(v); }
    bool isLeader(int u) { return get(u) == u; }
};

vector<vector<int> > graph;
vector<bool> vis;
vector<int> G;

void dfs(int u) {
    vis[u] = 1;
    G.push_back(u);

    for(int &v : graph[u]) {
        if(vis[v]) continue;
        dfs(v);
    }
}
 
int construct(vector<vector<int> > p) {
    int n = p.size();
    vector<vector<int> > B(n, vector<int>(n, 0));
    graph.resize(n);
    vis.resize(n);

    DSU dsu; dsu.config(n);

    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(p[i][j] == 1 && i != j) {
                if(!dsu.sameSet(i, j)) {
                    dsu.uni(i, j);
                    B[i][j] = B[j][i] = 1;
                }
            }
        }
    }
 
    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(p[i][j] == 1 && !dsu.sameSet(i, j)) return 0;
            if(p[i][j] == 0 && dsu.sameSet(i, j)) return 0;
        }
    }

    bool ok = 0;

    for(int i=0; i<n; i++) {
        for(int j=i+1; j<n; j++) {
            if(p[i][j] == 2 && dsu.isLeader(i) && dsu.isLeader(j)) {
                ok = 1;
                graph[i].push_back(j);
                graph[j].push_back(i);
            }
        }
    }

    for(int i=0; i<n && ok; i++) {
        if(vis[i]) continue;

        G.clear();
        dfs(i);

        if(G.size() == 2) return 0;
        if(G.size() == 1) continue;

        for(int i=0; i<G.size()-1; i++)
            for(int j=i+1; j<G.size(); j++)
                if(p[G[i]][G[j]] != 2) return 0;

        G.push_back(G[0]);
        for(int i=0; i<G.size()-1; i++)
            B[G[i]][G[i+1]] = B[G[i+1]][G[i]] = 1;
    }

    build(B);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:102:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |         for(int i=0; i<G.size()-1; i++)
      |                      ~^~~~~~~~~~~
supertrees.cpp:103:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |             for(int j=i+1; j<G.size(); j++)
      |                            ~^~~~~~~~~
supertrees.cpp:107:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |         for(int i=0; i<G.size()-1; i++)
      |                      ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 1116 KB Output is correct
7 Correct 157 ms 22096 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 1116 KB Output is correct
7 Correct 157 ms 22096 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 356 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 150 ms 22036 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 75 ms 12112 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 5812 KB Output is correct
21 Correct 154 ms 22100 KB Output is correct
22 Correct 153 ms 22040 KB Output is correct
23 Correct 170 ms 22036 KB Output is correct
24 Correct 175 ms 22036 KB Output is correct
25 Correct 64 ms 12368 KB Output is correct
26 Correct 59 ms 12116 KB Output is correct
27 Correct 159 ms 22096 KB Output is correct
28 Correct 150 ms 22020 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 7 ms 1116 KB Output is correct
9 Correct 153 ms 22016 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 156 ms 26196 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 83 ms 15108 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 39 ms 5768 KB Output is correct
22 Correct 159 ms 22632 KB Output is correct
23 Correct 180 ms 22024 KB Output is correct
24 Correct 161 ms 25212 KB Output is correct
25 Correct 67 ms 12116 KB Output is correct
26 Correct 78 ms 12844 KB Output is correct
27 Correct 153 ms 22036 KB Output is correct
28 Correct 163 ms 24400 KB Output is correct
29 Correct 62 ms 12296 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 39 ms 5864 KB Output is correct
5 Correct 163 ms 22028 KB Output is correct
6 Correct 153 ms 22096 KB Output is correct
7 Correct 160 ms 22096 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 38 ms 5844 KB Output is correct
10 Correct 155 ms 22648 KB Output is correct
11 Correct 151 ms 22096 KB Output is correct
12 Correct 159 ms 25176 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 39 ms 6256 KB Output is correct
17 Correct 157 ms 24572 KB Output is correct
18 Correct 156 ms 24332 KB Output is correct
19 Correct 155 ms 24176 KB Output is correct
20 Correct 151 ms 24144 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 1116 KB Output is correct
7 Correct 157 ms 22096 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 356 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 150 ms 22036 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 75 ms 12112 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 5812 KB Output is correct
21 Correct 154 ms 22100 KB Output is correct
22 Correct 153 ms 22040 KB Output is correct
23 Correct 170 ms 22036 KB Output is correct
24 Correct 175 ms 22036 KB Output is correct
25 Correct 64 ms 12368 KB Output is correct
26 Correct 59 ms 12116 KB Output is correct
27 Correct 159 ms 22096 KB Output is correct
28 Correct 150 ms 22020 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 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 7 ms 1116 KB Output is correct
37 Correct 153 ms 22016 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 156 ms 26196 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 83 ms 15108 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 39 ms 5768 KB Output is correct
50 Correct 159 ms 22632 KB Output is correct
51 Correct 180 ms 22024 KB Output is correct
52 Correct 161 ms 25212 KB Output is correct
53 Correct 67 ms 12116 KB Output is correct
54 Correct 78 ms 12844 KB Output is correct
55 Correct 153 ms 22036 KB Output is correct
56 Correct 163 ms 24400 KB Output is correct
57 Correct 62 ms 12296 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 68 ms 12060 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 436 KB Output is correct
65 Correct 39 ms 6236 KB Output is correct
66 Correct 66 ms 14856 KB Output is correct
67 Correct 69 ms 14076 KB Output is correct
68 Correct 66 ms 14216 KB Output is correct
69 Correct 64 ms 14204 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 1116 KB Output is correct
7 Correct 157 ms 22096 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 356 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 150 ms 22036 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 75 ms 12112 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 5812 KB Output is correct
21 Correct 154 ms 22100 KB Output is correct
22 Correct 153 ms 22040 KB Output is correct
23 Correct 170 ms 22036 KB Output is correct
24 Correct 175 ms 22036 KB Output is correct
25 Correct 64 ms 12368 KB Output is correct
26 Correct 59 ms 12116 KB Output is correct
27 Correct 159 ms 22096 KB Output is correct
28 Correct 150 ms 22020 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 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 7 ms 1116 KB Output is correct
37 Correct 153 ms 22016 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 156 ms 26196 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 83 ms 15108 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 39 ms 5768 KB Output is correct
50 Correct 159 ms 22632 KB Output is correct
51 Correct 180 ms 22024 KB Output is correct
52 Correct 161 ms 25212 KB Output is correct
53 Correct 67 ms 12116 KB Output is correct
54 Correct 78 ms 12844 KB Output is correct
55 Correct 153 ms 22036 KB Output is correct
56 Correct 163 ms 24400 KB Output is correct
57 Correct 62 ms 12296 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 39 ms 5864 KB Output is correct
62 Correct 163 ms 22028 KB Output is correct
63 Correct 153 ms 22096 KB Output is correct
64 Correct 160 ms 22096 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 38 ms 5844 KB Output is correct
67 Correct 155 ms 22648 KB Output is correct
68 Correct 151 ms 22096 KB Output is correct
69 Correct 159 ms 25176 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 39 ms 6256 KB Output is correct
74 Correct 157 ms 24572 KB Output is correct
75 Correct 156 ms 24332 KB Output is correct
76 Correct 155 ms 24176 KB Output is correct
77 Correct 151 ms 24144 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 68 ms 12060 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 436 KB Output is correct
85 Correct 39 ms 6236 KB Output is correct
86 Correct 66 ms 14856 KB Output is correct
87 Correct 69 ms 14076 KB Output is correct
88 Correct 66 ms 14216 KB Output is correct
89 Correct 64 ms 14204 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 71 ms 14332 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
96 Halted 0 ms 0 KB -