oj.uz

답안 #982937

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982937 2024-05-15T04:41:26 Z tamir1 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 190 ms 24148 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int sz[1001],par[1001],vis[1001];
int find(int a){
	if(a==par[a]) return a;
	int x=find(par[a]);
	par[a]=x;
	return x;
}
vector<int> v[1001],x,y;
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	for(int i=0;i<n;i++){
		sz[i]=1;
		par[i]=i;
		for(int j=0;j<n;j++){
			if(p[i][j]==3) return 0;
		}
	}
	if(n==1){
		build({{0}});
		return 1;
	}
	std::vector<std::vector<int>> answer(n,vector<int> (n,0));
	for (int i = 0; i < n; i++) {
		for(int j=0;j<n;j++){
			int x=find(i);
			int y=find(j);
			if(p[i][j]==0 && x==y) return 0;
			if(p[i][j]!=0){
				if(x==y) continue;
				if(sz[x]<sz[y]) swap(x,y);
				else if(sz[x]==sz[y] && x>y) swap(x,y);
				sz[x]+=sz[y];
				par[y]=x;
			}
		}
	}
	for(int i=0;i<n;i++){
		par[i]=find(i);
		v[par[i]].push_back(i);
	}
	
	for(int i=0;i<n;i++){
		int k=v[i].size();
		if(k==0 || k==1) continue;
		x.clear();
		y.clear();
		memset(vis,0,sizeof vis);
		for(int j=0;j<k;j++){
			bool a=0;
			for(int l=0;l<k;l++){
				if(l==j) continue;
				int e=p[v[i][j]][v[i][l]];
				if(e==1){
					a=1;
					break;
				}
			}
			if(!a){
				if(vis[v[i][j]]==1) return 0;
				vis[v[i][j]]=2;
				continue;
			}
			if(vis[v[i][j]]==2) return 0;
			vis[v[i][j]]=1;
			for(int l=0;l<k;l++){
				if(l==j) continue;
				int e=p[v[i][j]][v[i][l]];
				if(e==1){
					if(vis[v[i][l]]==2) return 0;
					vis[v[i][j]]=1;
				}
				else{
					if(vis[v[i][l]]==1) return 0;
					vis[v[i][j]]=2;
				}
			}
		}
		for(int j=0;j<k;j++){
			if(vis[v[i][j]]==1) x.push_back(v[i][j]);
			else y.push_back(v[i][j]);
		}
		int p=x.size();
		int q=y.size();
		if(q==1 || (q==2 && p<1)) return 0;
		for(int j=0;j<p-1;j++){
			answer[x[j]][x[j+1]]=1;
			answer[x[j+1]][x[j]]=1;
		}
		for(int j=0;j<q-1;j++){
			answer[y[j]][y[j+1]]=1;
			answer[y[j+1]][y[j]]=1;
		}
		if(q!=0){
		if(p==0){
			answer[y[0]][y[q-1]]=1;
			answer[y[q-1]][y[0]]=1;
		}
		else{
			answer[y[0]][x[0]]=1;
			answer[x[0]][y[0]]=1;
			answer[y[q-1]][x[0]]=1;
			answer[x[0]][y[q-1]]=1;
		}}
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 159 ms 24096 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 159 ms 24096 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 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 7 ms 1216 KB Output is correct
13 Correct 176 ms 23996 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 964 KB Output is correct
17 Correct 69 ms 14240 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 6236 KB Output is correct
21 Correct 190 ms 24080 KB Output is correct
22 Correct 155 ms 23968 KB Output is correct
23 Correct 158 ms 24080 KB Output is correct
24 Correct 155 ms 23968 KB Output is correct
25 Correct 65 ms 14100 KB Output is correct
26 Correct 63 ms 14164 KB Output is correct
27 Correct 157 ms 24144 KB Output is correct
28 Correct 156 ms 23956 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1116 KB Output is correct
9 Correct 188 ms 22352 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 1116 KB Output is correct
13 Correct 153 ms 22044 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 68 ms 12084 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 39 ms 5840 KB Output is correct
22 Correct 166 ms 22356 KB Output is correct
23 Correct 157 ms 22052 KB Output is correct
24 Correct 187 ms 22096 KB Output is correct
25 Correct 64 ms 12112 KB Output is correct
26 Correct 64 ms 12124 KB Output is correct
27 Correct 154 ms 22068 KB Output is correct
28 Correct 160 ms 22188 KB Output is correct
29 Correct 63 ms 12116 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 43 ms 6428 KB Output is correct
5 Correct 155 ms 24096 KB Output is correct
6 Correct 154 ms 24148 KB Output is correct
7 Correct 158 ms 24148 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 39 ms 6292 KB Output is correct
10 Correct 155 ms 23952 KB Output is correct
11 Correct 149 ms 24144 KB Output is correct
12 Correct 158 ms 24144 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 159 ms 24096 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 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 7 ms 1216 KB Output is correct
13 Correct 176 ms 23996 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 964 KB Output is correct
17 Correct 69 ms 14240 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 6236 KB Output is correct
21 Correct 190 ms 24080 KB Output is correct
22 Correct 155 ms 23968 KB Output is correct
23 Correct 158 ms 24080 KB Output is correct
24 Correct 155 ms 23968 KB Output is correct
25 Correct 65 ms 14100 KB Output is correct
26 Correct 63 ms 14164 KB Output is correct
27 Correct 157 ms 24144 KB Output is correct
28 Correct 156 ms 23956 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 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 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1116 KB Output is correct
37 Correct 188 ms 22352 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 1116 KB Output is correct
41 Correct 153 ms 22044 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 876 KB Output is correct
45 Correct 68 ms 12084 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 39 ms 5840 KB Output is correct
50 Correct 166 ms 22356 KB Output is correct
51 Correct 157 ms 22052 KB Output is correct
52 Correct 187 ms 22096 KB Output is correct
53 Correct 64 ms 12112 KB Output is correct
54 Correct 64 ms 12124 KB Output is correct
55 Correct 154 ms 22068 KB Output is correct
56 Correct 160 ms 22188 KB Output is correct
57 Correct 63 ms 12116 KB Output is correct
58 Correct 0 ms 600 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 67 ms 14236 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Incorrect 17 ms 3932 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 159 ms 24096 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 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 7 ms 1216 KB Output is correct
13 Correct 176 ms 23996 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 964 KB Output is correct
17 Correct 69 ms 14240 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 6236 KB Output is correct
21 Correct 190 ms 24080 KB Output is correct
22 Correct 155 ms 23968 KB Output is correct
23 Correct 158 ms 24080 KB Output is correct
24 Correct 155 ms 23968 KB Output is correct
25 Correct 65 ms 14100 KB Output is correct
26 Correct 63 ms 14164 KB Output is correct
27 Correct 157 ms 24144 KB Output is correct
28 Correct 156 ms 23956 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 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 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1116 KB Output is correct
37 Correct 188 ms 22352 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 1116 KB Output is correct
41 Correct 153 ms 22044 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 876 KB Output is correct
45 Correct 68 ms 12084 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 39 ms 5840 KB Output is correct
50 Correct 166 ms 22356 KB Output is correct
51 Correct 157 ms 22052 KB Output is correct
52 Correct 187 ms 22096 KB Output is correct
53 Correct 64 ms 12112 KB Output is correct
54 Correct 64 ms 12124 KB Output is correct
55 Correct 154 ms 22068 KB Output is correct
56 Correct 160 ms 22188 KB Output is correct
57 Correct 63 ms 12116 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 43 ms 6428 KB Output is correct
62 Correct 155 ms 24096 KB Output is correct
63 Correct 154 ms 24148 KB Output is correct
64 Correct 158 ms 24148 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 39 ms 6292 KB Output is correct
67 Correct 155 ms 23952 KB Output is correct
68 Correct 149 ms 24144 KB Output is correct
69 Correct 158 ms 24144 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
73 Halted 0 ms 0 KB -