oj.uz

답안 #308544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308544 2020-10-01T14:26:29 Z Peti 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 284 ms 22268 KB 
#include "supertrees.h"
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>

using namespace std;

struct union_find{
    vector<int> csop, mely;

    void Init(int n){
        csop.resize(n, -1);
        mely.resize(n, 0);
        return;
    }

    int Os(int a){
        if(csop[a] == -1)
            return a;
        csop[a] = Os(csop[a]);
        return csop[a];
    }

    bool Union(int a, int b)
    {
        a = Os(a);
        b = Os(b);

        if(a == b)
            return false;

        if(mely[a] < mely[b])
            swap(a, b);
        csop[b] = a;
        mely[a] = max(mely[a], mely[b]+1);
        return true;
    }
};

vector<int> Halmaz(vector<int> &inds, union_find &csop, int c)
{
    vector<int> ret;

    for(int x : inds)
        if(csop.Os(x) == c)
            ret.push_back(x);

    return ret;
}

int construct(vector<vector<int>> p) {
	int n = p.size();
    vector<vector<int>> answer(n, vector<int>(n, 0));

    union_find csop;
    csop.Init(n);

    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            if(p[i][j] == 3 || (i == j && p[i][j] != 1))
                return 0;

    for(int i = 0; i < n; i++)
    {
        for(int j = i+1; j < n; j++)
        {
            if(p[i][j] == 1)
            {
                int x = csop.Os(i), y = csop.Os(j);
                if(csop.Union(x, y))
                {
                    answer[x][y] = 1;
                    answer[y][x] = 1;
                }
            }
        }
    }

    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(i == j)
                continue;

            if(csop.Os(i) == csop.Os(j) && p[i][j] != 1)
                return 0;
        }
    }

    vector<int> inds;
    for(int i = 0; i < n; i++)
        if(csop.Os(i) == i)
            inds.push_back(i);

    union_find csop2;
    csop2.Init(n);

    for(int i = 0; i < n; i++)
        for(int j = i+1; j < n; j++)
            if(p[i][j] == 2)
                csop2.Union(csop.Os(i), csop.Os(j));

    /*for(int i = 0; i < n; i++)
        cout<<csop.Os(i)<<" ";
    cout<<"\n";*/

    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(i == j)
                continue;

            if(csop.Os(i) != csop.Os(j) && csop2.Os(csop.Os(i)) == csop2.Os(csop.Os(j)) && p[i][j] != 2)
                return 0;
        }
    }

    for(int i : inds)
    {
        if(csop2.Os(i) == i)
        {
            vector<int> v = Halmaz(inds, csop2, i);

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

            for(int j = 0; j < (int)v.size()-1; j++)
            {
                answer[v[j]][v[j+1]] = 1;
                answer[v[j+1]][v[j]] = 1;
            }
            answer[v[0]][(*v.rbegin())] = 1;
            answer[(*v.rbegin())][v[0]] = 1;
        }
    }

	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 14 ms 1152 KB Output is correct
7 Correct 247 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 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 14 ms 1152 KB Output is correct
7 Correct 247 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 240 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 111 ms 12220 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 66 ms 5752 KB Output is correct
21 Correct 250 ms 22136 KB Output is correct
22 Correct 252 ms 22136 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 239 ms 22136 KB Output is correct
25 Correct 104 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 265 ms 22136 KB Output is correct
28 Correct 248 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1240 KB Output is correct
9 Correct 245 ms 22136 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 242 ms 22064 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 112 ms 12284 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 65 ms 5880 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 251 ms 22264 KB Output is correct
24 Correct 263 ms 22264 KB Output is correct
25 Correct 107 ms 12152 KB Output is correct
26 Correct 104 ms 12152 KB Output is correct
27 Correct 248 ms 22128 KB Output is correct
28 Correct 265 ms 22264 KB Output is correct
29 Correct 112 ms 12156 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 70 ms 5752 KB Output is correct
5 Correct 252 ms 22136 KB Output is correct
6 Correct 250 ms 22140 KB Output is correct
7 Correct 284 ms 22268 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 61 ms 5880 KB Output is correct
10 Correct 243 ms 22136 KB Output is correct
11 Correct 242 ms 22136 KB Output is correct
12 Correct 254 ms 22136 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 66 ms 5752 KB Output is correct
17 Correct 245 ms 22136 KB Output is correct
18 Correct 261 ms 22136 KB Output is correct
19 Correct 250 ms 22136 KB Output is correct
20 Correct 253 ms 22140 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 14 ms 1152 KB Output is correct
7 Correct 247 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 240 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 111 ms 12220 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 66 ms 5752 KB Output is correct
21 Correct 250 ms 22136 KB Output is correct
22 Correct 252 ms 22136 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 239 ms 22136 KB Output is correct
25 Correct 104 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 265 ms 22136 KB Output is correct
28 Correct 248 ms 22136 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 288 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1240 KB Output is correct
37 Correct 245 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 242 ms 22064 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 112 ms 12284 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 65 ms 5880 KB Output is correct
50 Correct 247 ms 22136 KB Output is correct
51 Correct 251 ms 22264 KB Output is correct
52 Correct 263 ms 22264 KB Output is correct
53 Correct 107 ms 12152 KB Output is correct
54 Correct 104 ms 12152 KB Output is correct
55 Correct 248 ms 22128 KB Output is correct
56 Correct 265 ms 22264 KB Output is correct
57 Correct 112 ms 12156 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 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 62 ms 5880 KB Output is correct
66 Correct 102 ms 12152 KB Output is correct
67 Correct 98 ms 12152 KB Output is correct
68 Correct 111 ms 12168 KB Output is correct
69 Correct 106 ms 12152 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 14 ms 1152 KB Output is correct
7 Correct 247 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 240 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 111 ms 12220 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 66 ms 5752 KB Output is correct
21 Correct 250 ms 22136 KB Output is correct
22 Correct 252 ms 22136 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 239 ms 22136 KB Output is correct
25 Correct 104 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 265 ms 22136 KB Output is correct
28 Correct 248 ms 22136 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 288 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1240 KB Output is correct
37 Correct 245 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 242 ms 22064 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 112 ms 12284 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 65 ms 5880 KB Output is correct
50 Correct 247 ms 22136 KB Output is correct
51 Correct 251 ms 22264 KB Output is correct
52 Correct 263 ms 22264 KB Output is correct
53 Correct 107 ms 12152 KB Output is correct
54 Correct 104 ms 12152 KB Output is correct
55 Correct 248 ms 22128 KB Output is correct
56 Correct 265 ms 22264 KB Output is correct
57 Correct 112 ms 12156 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 70 ms 5752 KB Output is correct
62 Correct 252 ms 22136 KB Output is correct
63 Correct 250 ms 22140 KB Output is correct
64 Correct 284 ms 22268 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 61 ms 5880 KB Output is correct
67 Correct 243 ms 22136 KB Output is correct
68 Correct 242 ms 22136 KB Output is correct
69 Correct 254 ms 22136 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 66 ms 5752 KB Output is correct
74 Correct 245 ms 22136 KB Output is correct
75 Correct 261 ms 22136 KB Output is correct
76 Correct 250 ms 22136 KB Output is correct
77 Correct 253 ms 22140 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 5 ms 768 KB Output is correct
81 Correct 113 ms 12120 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 62 ms 5880 KB Output is correct
86 Correct 102 ms 12152 KB Output is correct
87 Correct 98 ms 12152 KB Output is correct
88 Correct 111 ms 12168 KB Output is correct
89 Correct 106 ms 12152 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 5 ms 768 KB Output is correct
93 Correct 97 ms 12152 KB Output is correct
94 Correct 0 ms 256 KB Output is correct
95 Correct 1 ms 256 KB Output is correct
96 Correct 0 ms 256 KB Output is correct
97 Correct 28 ms 3324 KB Output is correct
98 Correct 96 ms 12152 KB Output is correct
99 Correct 97 ms 12152 KB Output is correct
100 Correct 95 ms 12152 KB Output is correct
101 Correct 97 ms 12152 KB Output is correct
102 Correct 98 ms 12156 KB Output is correct
103 Correct 96 ms 12152 KB Output is correct
104 Correct 93 ms 12152 KB Output is correct
105 Correct 102 ms 12156 KB Output is correct