oj.uz

답안 #697848

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
697848 2023-02-11T08:15:58 Z boris_mihov 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 211 ms 23008 KB 
#include "supertrees.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 1000 + 10;
const int INF  = 1e9;

bool used[MAXN];
int inComp[MAXN];
std::vector <std::vector <int>> b;

inline void addEdge(int x, int y)
{
    b[x][y] = 1;
    b[y][x] = 1;
}

int construct(std::vector <std::vector <int>> p) 
{
	int n = p.size();
    b.resize(n);

	for (int i = 0 ; i < n ; ++i)
    {
        b[i].resize(n, 0);
        for (int j = 0 ; j < n ; ++j)
        {
            if (p[i][j] == 3)
            {
                return 0;
            }
        }
    }

    std::fill(inComp, inComp + n, -1);
    for (int i = 0 ; i < n ; ++i)
    {
        if (inComp[i] != -1) continue;
        std::vector <int> stick;
        stick.push_back(i);
        inComp[i] = i;

        for (int j = 0 ; j < n ; ++j)
        {
            if (i == j || p[i][j] != 1) continue;
            stick.push_back(j);
            inComp[j] = i;

            for (int k = 0 ; k < n ; ++k)
            {
                if (i == k || j == k) continue;
                if (p[i][k] != p[j][k]) return 0;
            }
        }

        for (int j = 1 ; j < stick.size() ; ++j)
        {
            addEdge(stick[j - 1], stick[j]);
        }
    }

    for (int i = 0 ; i < n ; ++i)
    {
        if (used[inComp[i]]) 
        {
            continue;
        }

        std::vector <int> cycle;
        used[inComp[i]] = true;
        cycle.push_back(i);

        for (int j = 0 ; j < n ; ++j)
        {
            if (used[inComp[j]] || p[i][j] != 2) continue;
            cycle.push_back(inComp[j]);
            used[inComp[j]] = true;
        
            for (int k = 0 ; k < n ; ++k)
            {
                if (k == inComp[i] || k == inComp[j]) continue;
                if (inComp[k] == inComp[i])
                {
                    if (p[k][inComp[j]] != 2) return 0;
                    continue;
                }            

                if (inComp[k] == inComp[j])
                {
                    if (p[k][inComp[i]] != 2) return 0;
                    continue;
                } 

                if (p[inComp[i]][k] != p[inComp[j]][k]) return 0;      
            }
        }

        if (cycle.size() == 2) return 0;
        if (cycle.size() == 1) continue;
        for (int j = 1 ; j < (int)cycle.size() ; ++j)
        {
            addEdge(cycle[j - 1], cycle[j]);
        }

        addEdge(i, cycle.back());
    }

    build(b);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 1132 KB Output is correct
7 Correct 187 ms 22028 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 1132 KB Output is correct
7 Correct 187 ms 22028 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 169 ms 22048 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 800 KB Output is correct
17 Correct 74 ms 13004 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 43 ms 6264 KB Output is correct
21 Correct 189 ms 22984 KB Output is correct
22 Correct 166 ms 22856 KB Output is correct
23 Correct 178 ms 22940 KB Output is correct
24 Correct 165 ms 22904 KB Output is correct
25 Correct 70 ms 13008 KB Output is correct
26 Correct 69 ms 12956 KB Output is correct
27 Correct 173 ms 22904 KB Output is correct
28 Correct 167 ms 22900 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 168 ms 22136 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 193 ms 22020 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 828 KB Output is correct
17 Correct 84 ms 12924 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 56 ms 6140 KB Output is correct
22 Correct 173 ms 22828 KB Output is correct
23 Correct 173 ms 22960 KB Output is correct
24 Correct 193 ms 23008 KB Output is correct
25 Correct 71 ms 13004 KB Output is correct
26 Correct 80 ms 12948 KB Output is correct
27 Correct 203 ms 22880 KB Output is correct
28 Correct 174 ms 22936 KB Output is correct
29 Correct 78 ms 13144 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 42 ms 5652 KB Output is correct
5 Correct 168 ms 21956 KB Output is correct
6 Correct 162 ms 22020 KB Output is correct
7 Correct 171 ms 22048 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 47 ms 5668 KB Output is correct
10 Correct 211 ms 22028 KB Output is correct
11 Correct 169 ms 22036 KB Output is correct
12 Correct 179 ms 22024 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 41 ms 5704 KB Output is correct
17 Correct 176 ms 21964 KB Output is correct
18 Correct 165 ms 22000 KB Output is correct
19 Correct 166 ms 22024 KB Output is correct
20 Correct 169 ms 22048 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 1132 KB Output is correct
7 Correct 187 ms 22028 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 169 ms 22048 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 800 KB Output is correct
17 Correct 74 ms 13004 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 43 ms 6264 KB Output is correct
21 Correct 189 ms 22984 KB Output is correct
22 Correct 166 ms 22856 KB Output is correct
23 Correct 178 ms 22940 KB Output is correct
24 Correct 165 ms 22904 KB Output is correct
25 Correct 70 ms 13008 KB Output is correct
26 Correct 69 ms 12956 KB Output is correct
27 Correct 173 ms 22904 KB Output is correct
28 Correct 167 ms 22900 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 168 ms 22136 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1108 KB Output is correct
41 Correct 193 ms 22020 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 828 KB Output is correct
45 Correct 84 ms 12924 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 56 ms 6140 KB Output is correct
50 Correct 173 ms 22828 KB Output is correct
51 Correct 173 ms 22960 KB Output is correct
52 Correct 193 ms 23008 KB Output is correct
53 Correct 71 ms 13004 KB Output is correct
54 Correct 80 ms 12948 KB Output is correct
55 Correct 203 ms 22880 KB Output is correct
56 Correct 174 ms 22936 KB Output is correct
57 Correct 78 ms 13144 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 72 ms 12924 KB Output is correct
62 Correct 1 ms 300 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 46 ms 6220 KB Output is correct
66 Correct 74 ms 14072 KB Output is correct
67 Correct 68 ms 14072 KB Output is correct
68 Correct 68 ms 14028 KB Output is correct
69 Correct 76 ms 14068 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 1132 KB Output is correct
7 Correct 187 ms 22028 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 169 ms 22048 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 800 KB Output is correct
17 Correct 74 ms 13004 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 43 ms 6264 KB Output is correct
21 Correct 189 ms 22984 KB Output is correct
22 Correct 166 ms 22856 KB Output is correct
23 Correct 178 ms 22940 KB Output is correct
24 Correct 165 ms 22904 KB Output is correct
25 Correct 70 ms 13008 KB Output is correct
26 Correct 69 ms 12956 KB Output is correct
27 Correct 173 ms 22904 KB Output is correct
28 Correct 167 ms 22900 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 168 ms 22136 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1108 KB Output is correct
41 Correct 193 ms 22020 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 828 KB Output is correct
45 Correct 84 ms 12924 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 56 ms 6140 KB Output is correct
50 Correct 173 ms 22828 KB Output is correct
51 Correct 173 ms 22960 KB Output is correct
52 Correct 193 ms 23008 KB Output is correct
53 Correct 71 ms 13004 KB Output is correct
54 Correct 80 ms 12948 KB Output is correct
55 Correct 203 ms 22880 KB Output is correct
56 Correct 174 ms 22936 KB Output is correct
57 Correct 78 ms 13144 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 42 ms 5652 KB Output is correct
62 Correct 168 ms 21956 KB Output is correct
63 Correct 162 ms 22020 KB Output is correct
64 Correct 171 ms 22048 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 47 ms 5668 KB Output is correct
67 Correct 211 ms 22028 KB Output is correct
68 Correct 169 ms 22036 KB Output is correct
69 Correct 179 ms 22024 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 41 ms 5704 KB Output is correct
74 Correct 176 ms 21964 KB Output is correct
75 Correct 165 ms 22000 KB Output is correct
76 Correct 166 ms 22024 KB Output is correct
77 Correct 169 ms 22048 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 4 ms 852 KB Output is correct
81 Correct 72 ms 12924 KB Output is correct
82 Correct 1 ms 300 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 46 ms 6220 KB Output is correct
86 Correct 74 ms 14072 KB Output is correct
87 Correct 68 ms 14072 KB Output is correct
88 Correct 68 ms 14028 KB Output is correct
89 Correct 76 ms 14068 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 3 ms 596 KB Output is correct
93 Correct 91 ms 10104 KB Output is correct
94 Correct 0 ms 300 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 16 ms 2816 KB Output is correct
98 Correct 65 ms 10372 KB Output is correct
99 Correct 64 ms 10624 KB Output is correct
100 Correct 65 ms 10360 KB Output is correct
101 Correct 72 ms 11432 KB Output is correct
102 Correct 64 ms 10100 KB Output is correct
103 Correct 69 ms 10060 KB Output is correct
104 Correct 65 ms 10100 KB Output is correct
105 Correct 68 ms 10116 KB Output is correct