oj.uz

Submission #1063343

# Submission time Handle Problem Language Result Execution time Memory
1063343 2024-08-17T17:03:27 Z jamjanek Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 130 ms 23956 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]);
}
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);
			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]==0 && find1(i)==find1(j))return 0;
			if(p[i][j]>0 && find1(i)!=find1(j))return 0;
		}
	}
	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++)
		if(find2(i)==i){
			int mini = i;
			bool czy = 0;
			for(j=0;j<i;j++)
				if(p[i][j]==2)
					czy = 1;
			assert(!czy);
			for(j=0;j<mini;j++)
				if(p[i][j]==2 && find2(j)==j && j<mini){
					j = mini;
				}
			assert(mini==i);
			if(mini!=i)
				cykle[mini].push_back(i);
		}
	bool gowno = 1;
	for(i=0;i<n;i++)
		if(cykle[i].size()!=0)
			gowno = 0;
	assert(gowno);
	for(int j=0;j<n;j++){
		if(cykle[j].size()==1)return 0;
		if(cykle[j].size())cykle[j].push_back(j);
		assert(cykle[j].size()>2 || cykle[j].size()==0);
		for(i=0;i<(int)cykle[j].size();i++){
			int mod = cykle[j].size();
			answer[cykle[j][i]][cykle[j][(i+1)%mod]] = 1;
			answer[cykle[j][(i+1)%mod]][cykle[j][i]] = 1;
		}
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 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 6 ms 1372 KB Output is correct
7 Correct 127 ms 23956 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 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 6 ms 1372 KB Output is correct
7 Correct 127 ms 23956 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 1440 KB Output is correct
13 Correct 124 ms 23892 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 62 ms 13872 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 34 ms 6204 KB Output is correct
21 Correct 125 ms 23892 KB Output is correct
22 Correct 121 ms 23888 KB Output is correct
23 Correct 130 ms 23888 KB Output is correct
24 Correct 130 ms 23888 KB Output is correct
25 Correct 68 ms 13896 KB Output is correct
26 Correct 50 ms 13904 KB Output is correct
27 Correct 125 ms 23924 KB Output is correct
28 Correct 120 ms 23892 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Runtime error 1 ms 604 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 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 6 ms 1372 KB Output is correct
7 Correct 127 ms 23956 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 1440 KB Output is correct
13 Correct 124 ms 23892 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 62 ms 13872 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 34 ms 6204 KB Output is correct
21 Correct 125 ms 23892 KB Output is correct
22 Correct 121 ms 23888 KB Output is correct
23 Correct 130 ms 23888 KB Output is correct
24 Correct 130 ms 23888 KB Output is correct
25 Correct 68 ms 13896 KB Output is correct
26 Correct 50 ms 13904 KB Output is correct
27 Correct 125 ms 23924 KB Output is correct
28 Correct 120 ms 23892 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 460 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Runtime error 1 ms 604 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 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 6 ms 1372 KB Output is correct
7 Correct 127 ms 23956 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 1440 KB Output is correct
13 Correct 124 ms 23892 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 62 ms 13872 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 34 ms 6204 KB Output is correct
21 Correct 125 ms 23892 KB Output is correct
22 Correct 121 ms 23888 KB Output is correct
23 Correct 130 ms 23888 KB Output is correct
24 Correct 130 ms 23888 KB Output is correct
25 Correct 68 ms 13896 KB Output is correct
26 Correct 50 ms 13904 KB Output is correct
27 Correct 125 ms 23924 KB Output is correct
28 Correct 120 ms 23892 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 460 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Runtime error 1 ms 604 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -