oj.uz

답안 #981529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
981529 2024-05-13T09:55:58 Z tamir1 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 165 ms 24152 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int sz[1001],par[1001];
int find(int a){
	if(a==par[a]) return a;
	int x=find(par[a]);
	par[a]=x;
	return x;
}
vector<int> v[1005];
bitset<1001> vis;
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(p[i][j]==2){
				v[i].push_back(j);
				v[j].push_back(i);
				vis[i]=1;
				vis[j]=1;
			}
		}
	}
	std::vector<std::vector<int>> answer(n,vector<int> (n,0));
	if(n==1){
		build({{0}});
		return 1;
	}
	for(int i=0;i<n;i++){
		if(vis[i]){
			if(v[i].size()!=4){
				cout << v[i].size() << "NO";
				return 0;
			}
		}
	}
	for(int i=0;i<n;i++){
		if(vis[i]){
			int x=find(i);
			int y=find(v[i][0]);
			if(x!=y){
				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;
			}
			answer[i][v[i][0]]=1;
			answer[v[i][0]][i]=1;
			x=find(i);
			y=find(v[i][1]);
			if(x!=y){
				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;
			}
			answer[i][v[i][1]]=1;
			answer[v[i][1]][i]=1;
		}
	}
	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]==1){
				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;
				answer[x][y]=1;
				answer[y][x]=1;
			}
		}
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 500 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 600 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 154 ms 22052 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 500 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 600 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 154 ms 22052 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1312 KB Output is correct
13 Correct 148 ms 22116 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 65 ms 12064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 5724 KB Output is correct
21 Correct 156 ms 22064 KB Output is correct
22 Correct 153 ms 22100 KB Output is correct
23 Correct 158 ms 22096 KB Output is correct
24 Correct 159 ms 22236 KB Output is correct
25 Correct 64 ms 12112 KB Output is correct
26 Correct 66 ms 12320 KB Output is correct
27 Correct 160 ms 22096 KB Output is correct
28 Correct 152 ms 22096 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 1 ms 348 KB secret mismatch
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.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 39 ms 6288 KB Output is correct
5 Correct 156 ms 24008 KB Output is correct
6 Correct 154 ms 24152 KB Output is correct
7 Correct 165 ms 24096 KB Output is correct
8 Incorrect 0 ms 348 KB secret mismatch
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 500 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 600 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 154 ms 22052 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1312 KB Output is correct
13 Correct 148 ms 22116 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 65 ms 12064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 5724 KB Output is correct
21 Correct 156 ms 22064 KB Output is correct
22 Correct 153 ms 22100 KB Output is correct
23 Correct 158 ms 22096 KB Output is correct
24 Correct 159 ms 22236 KB Output is correct
25 Correct 64 ms 12112 KB Output is correct
26 Correct 66 ms 12320 KB Output is correct
27 Correct 160 ms 22096 KB Output is correct
28 Correct 152 ms 22096 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 1 ms 348 KB secret mismatch
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 500 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 600 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 154 ms 22052 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1312 KB Output is correct
13 Correct 148 ms 22116 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 65 ms 12064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 5724 KB Output is correct
21 Correct 156 ms 22064 KB Output is correct
22 Correct 153 ms 22100 KB Output is correct
23 Correct 158 ms 22096 KB Output is correct
24 Correct 159 ms 22236 KB Output is correct
25 Correct 64 ms 12112 KB Output is correct
26 Correct 66 ms 12320 KB Output is correct
27 Correct 160 ms 22096 KB Output is correct
28 Correct 152 ms 22096 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 1 ms 348 KB secret mismatch
33 Halted 0 ms 0 KB -