oj.uz

답안 #303348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303348 2020-09-20T08:44:54 Z baluteshih 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 278 ms 22396 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(),v.end()
#define SZ(a) ((int)a.size())
#define pb push_back

int boss[1005];
vector<int> cpn[1005],tree[1005];
vector<vector<int>> answer;

int finds(int x)
{
    if(x==boss[x]) return boss[x];
    return boss[x]=finds(boss[x]);
}

void Union(int x,int y)
{
    x=finds(x),y=finds(y);
    boss[y]=x;
}

void add_edge(int a,int b)
{
    answer[a][b]=answer[b][a]=1;
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	answer=vector<vector<int>>(n,vector<int>(n,0));
    vector<int> head;
    for(int i=0;i<n;++i)
        boss[i]=i;
    for(int i=0;i<n;++i)    
        for(int j=i+1;j<n;++j)
            if(p[i][j]>0)
                Union(i,j);
    for(int i=0;i<n;++i)
        for(int j=i+1;j<n;++j)
            if(finds(i)==finds(j)&&p[i][j]==0)
                return 0;
            else if(finds(i)!=finds(j)&&p[i][j]>0)
                return 0;
    for(int i=0;i<n;++i)
        cpn[finds(i)].pb(i);
    for(int i=0;i<n;++i)
        if(!cpn[i].empty())
        {
            vector<int> head;
            for(int j:cpn[i])
                boss[j]=j;
            for(int j=0;j<SZ(cpn[i]);++j)
                for(int k=j+1;k<SZ(cpn[i]);++k)
                    if(p[cpn[i][j]][cpn[i][k]]==1)
                        Union(cpn[i][j],cpn[i][k]);
            for(int j=0;j<SZ(cpn[i]);++j)
                for(int k=j+1;k<SZ(cpn[i]);++k)
                    if(finds(cpn[i][j])==finds(cpn[i][k])&&p[cpn[i][j]][cpn[i][k]]!=1)
                        return 0;
                    else if(finds(cpn[i][j])!=finds(cpn[i][k])&&p[cpn[i][j]][cpn[i][k]]!=2)
                        return 0;
            for(int j:cpn[i])
                tree[finds(j)].pb(j);
            for(int j:cpn[i])
                if(!tree[j].empty())
                {
                    head.pb(tree[j][0]);
                    for(int k=1;k<SZ(tree[j]);++k)
                        add_edge(tree[j][k-1],tree[j][k]);
                }
            if(SZ(head)==2)
                return 0;
            for(int i=1;i<SZ(head);++i)
                add_edge(head[i-1],head[i]);
            if(SZ(head)>1)
                add_edge(head[0],head.back());
        }
    build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 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 258 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 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 258 ms 22136 KB Output is correct
8 Correct 1 ms 416 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 14 ms 1280 KB Output is correct
13 Correct 238 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 114 ms 12164 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 64 ms 5876 KB Output is correct
21 Correct 278 ms 22156 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 261 ms 22136 KB Output is correct
24 Correct 244 ms 22396 KB Output is correct
25 Correct 102 ms 12268 KB Output is correct
26 Correct 100 ms 12152 KB Output is correct
27 Correct 258 ms 22136 KB Output is correct
28 Correct 239 ms 22252 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 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 234 ms 22392 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 13 ms 1220 KB Output is correct
13 Correct 248 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 113 ms 12152 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 60 ms 5880 KB Output is correct
22 Correct 268 ms 22136 KB Output is correct
23 Correct 243 ms 22136 KB Output is correct
24 Correct 262 ms 22264 KB Output is correct
25 Correct 104 ms 12280 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 242 ms 22392 KB Output is correct
28 Correct 258 ms 22136 KB Output is correct
29 Correct 108 ms 12300 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 67 ms 6008 KB Output is correct
5 Correct 244 ms 22136 KB Output is correct
6 Correct 258 ms 22152 KB Output is correct
7 Correct 259 ms 22148 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 61 ms 5884 KB Output is correct
10 Correct 257 ms 22136 KB Output is correct
11 Correct 238 ms 22136 KB Output is correct
12 Correct 259 ms 22300 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 60 ms 5880 KB Output is correct
17 Correct 249 ms 22148 KB Output is correct
18 Correct 240 ms 22136 KB Output is correct
19 Correct 251 ms 22264 KB Output is correct
20 Correct 253 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 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 258 ms 22136 KB Output is correct
8 Correct 1 ms 416 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 14 ms 1280 KB Output is correct
13 Correct 238 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 114 ms 12164 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 64 ms 5876 KB Output is correct
21 Correct 278 ms 22156 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 261 ms 22136 KB Output is correct
24 Correct 244 ms 22396 KB Output is correct
25 Correct 102 ms 12268 KB Output is correct
26 Correct 100 ms 12152 KB Output is correct
27 Correct 258 ms 22136 KB Output is correct
28 Correct 239 ms 22252 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 234 ms 22392 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 13 ms 1220 KB Output is correct
41 Correct 248 ms 22136 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 113 ms 12152 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 60 ms 5880 KB Output is correct
50 Correct 268 ms 22136 KB Output is correct
51 Correct 243 ms 22136 KB Output is correct
52 Correct 262 ms 22264 KB Output is correct
53 Correct 104 ms 12280 KB Output is correct
54 Correct 99 ms 12152 KB Output is correct
55 Correct 242 ms 22392 KB Output is correct
56 Correct 258 ms 22136 KB Output is correct
57 Correct 108 ms 12300 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 896 KB Output is correct
61 Correct 114 ms 12152 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 Correct 63 ms 5904 KB Output is correct
66 Correct 105 ms 12152 KB Output is correct
67 Correct 104 ms 12164 KB Output is correct
68 Correct 102 ms 12152 KB Output is correct
69 Correct 101 ms 12408 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 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 258 ms 22136 KB Output is correct
8 Correct 1 ms 416 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 14 ms 1280 KB Output is correct
13 Correct 238 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 114 ms 12164 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 64 ms 5876 KB Output is correct
21 Correct 278 ms 22156 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 261 ms 22136 KB Output is correct
24 Correct 244 ms 22396 KB Output is correct
25 Correct 102 ms 12268 KB Output is correct
26 Correct 100 ms 12152 KB Output is correct
27 Correct 258 ms 22136 KB Output is correct
28 Correct 239 ms 22252 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 234 ms 22392 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 13 ms 1220 KB Output is correct
41 Correct 248 ms 22136 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 113 ms 12152 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 60 ms 5880 KB Output is correct
50 Correct 268 ms 22136 KB Output is correct
51 Correct 243 ms 22136 KB Output is correct
52 Correct 262 ms 22264 KB Output is correct
53 Correct 104 ms 12280 KB Output is correct
54 Correct 99 ms 12152 KB Output is correct
55 Correct 242 ms 22392 KB Output is correct
56 Correct 258 ms 22136 KB Output is correct
57 Correct 108 ms 12300 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 67 ms 6008 KB Output is correct
62 Correct 244 ms 22136 KB Output is correct
63 Correct 258 ms 22152 KB Output is correct
64 Correct 259 ms 22148 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 61 ms 5884 KB Output is correct
67 Correct 257 ms 22136 KB Output is correct
68 Correct 238 ms 22136 KB Output is correct
69 Correct 259 ms 22300 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 0 ms 384 KB Output is correct
73 Correct 60 ms 5880 KB Output is correct
74 Correct 249 ms 22148 KB Output is correct
75 Correct 240 ms 22136 KB Output is correct
76 Correct 251 ms 22264 KB Output is correct
77 Correct 253 ms 22136 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 5 ms 896 KB Output is correct
81 Correct 114 ms 12152 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 63 ms 5904 KB Output is correct
86 Correct 105 ms 12152 KB Output is correct
87 Correct 104 ms 12164 KB Output is correct
88 Correct 102 ms 12152 KB Output is correct
89 Correct 101 ms 12408 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 7 ms 896 KB Output is correct
93 Correct 108 ms 12152 KB Output is correct
94 Correct 0 ms 384 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 25 ms 3328 KB Output is correct
98 Correct 105 ms 12164 KB Output is correct
99 Correct 103 ms 12280 KB Output is correct
100 Correct 98 ms 12152 KB Output is correct
101 Correct 100 ms 12280 KB Output is correct
102 Correct 116 ms 12280 KB Output is correct
103 Correct 111 ms 12168 KB Output is correct
104 Correct 119 ms 12152 KB Output is correct
105 Correct 113 ms 12152 KB Output is correct