oj.uz

답안 #1063265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063265 2024-08-17T15:59:33 Z jamjanek 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 209 ms 22356 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int father1[1010], father[1010], father3[1010];
int find1(int x){
	if(father1[x]==x)return x;
	return father1[x] = find1(father1[x]);
}
int find2(int x){
	if(father[x]==x)return x;
	return father[x] = find2(father[x]);
}
int find3(int x){
	if(father3[x]==x)return x;
	return father3[x] = find1(father3[x]);
}
vector<int>cykle[1010];

int construct(std::vector<std::vector<int>> p) {
	int n = p.size(), i, j;
	for(i=0;i<n;i++)father[i] = father1[i] = i;
	std::vector<std::vector<int>> answer = p;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			answer[i][j] = 0;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++){
			if(p[i][j]==3 || (i==j && p[i][j]!=1) || (p[i][j]!=p[j][i]))
				return 0;
			if(p[i][j]>0)
				father1[find1(i)] = find1(j);
			else
				if(find1(i)==find2(j))return 0;
			if(p[i][j]==1 && find2(i)!=find2(j)){
				father[find2(i)] = find2(j);
				answer[i][j] = answer[j][i] = 1;
			}
		}
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			if(p[i][j]==2 && find2(i)==find2(j))
				return 0;
	for(i=0;i<n;i++)
		father3[i] = find2(i);
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			if(p[i][j]==2 && find3(find2(i))!=find3(find2(j))){
				cykle[min(find2(i), find2(j))].push_back(max(find2(i), find2(j)));
				father3[max(find2(i), find2(j))] = min(find2(i), find2(j));
			}
	for(int j=0;j<n;j++){
		if(cykle[j].size()==2)return 0;
		for(i=0;i<(int)cykle[j].size();i++){
			p[cykle[j][i]][cykle[j][(i+1)%(int)cykle[j].size()]] = 1; 
			p[cykle[j][(i+1)%(int)cykle[j].size()]][cykle[j][i]] = 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 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 119 ms 22096 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 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 119 ms 22096 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 161 ms 22100 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 58 ms 12084 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 48 ms 5736 KB Output is correct
21 Correct 126 ms 22056 KB Output is correct
22 Correct 156 ms 22100 KB Output is correct
23 Correct 132 ms 22096 KB Output is correct
24 Correct 163 ms 22356 KB Output is correct
25 Correct 59 ms 12064 KB Output is correct
26 Correct 48 ms 12112 KB Output is correct
27 Correct 209 ms 22100 KB Output is correct
28 Correct 125 ms 22100 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 0
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 0
3 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 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 119 ms 22096 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 161 ms 22100 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 58 ms 12084 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 48 ms 5736 KB Output is correct
21 Correct 126 ms 22056 KB Output is correct
22 Correct 156 ms 22100 KB Output is correct
23 Correct 132 ms 22096 KB Output is correct
24 Correct 163 ms 22356 KB Output is correct
25 Correct 59 ms 12064 KB Output is correct
26 Correct 48 ms 12112 KB Output is correct
27 Correct 209 ms 22100 KB Output is correct
28 Correct 125 ms 22100 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 0
34 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 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 119 ms 22096 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 161 ms 22100 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 58 ms 12084 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 48 ms 5736 KB Output is correct
21 Correct 126 ms 22056 KB Output is correct
22 Correct 156 ms 22100 KB Output is correct
23 Correct 132 ms 22096 KB Output is correct
24 Correct 163 ms 22356 KB Output is correct
25 Correct 59 ms 12064 KB Output is correct
26 Correct 48 ms 12112 KB Output is correct
27 Correct 209 ms 22100 KB Output is correct
28 Correct 125 ms 22100 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 0
34 Halted 0 ms 0 KB -