oj.uz

Submission #896579

# Submission time Handle Problem Language Result Execution time Memory
896579 2024-01-01T17:12:17 Z LCJLY Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 180 ms 22856 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl; 
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;

struct DSU{
	vector<int>e;
	vector<int>storage[1005];
	void init(int n){
		e=vector<int>(n,-1);
		for(int x=0;x<n;x++){
			storage[x].push_back(x);
		}
	}
	
	int get(int x){return e[x]<0?x:e[x]=get(e[x]);}\
	
	bool sameSet(int x, int y){return get(x)==get(y);}
	
	int size(int x){return -e[get(x)];}
	
	bool unite(int x, int y){
		x=get(x);
		y=get(y);
		if(x==y) return 0;
		if(e[x]>e[y]) swap(x,y);
		e[x]+=e[y];
		for(auto it:storage[y]) storage[x].push_back(it);
		e[y]=x;
		return 1;
	}
};

int construct(vector<vector<int>> p) {
	//int n = p.size();
	//std::vector<std::vector<int>> answer;
	//for (int i = 0; i < n; i++) {
		//std::vector<int> row;
		//row.resize(n);
		//answer.push_back(row);
	//}
	//build(answer);
	//return 1;

	int n=p.size();
	DSU one;
	one.init(n+5);
	DSU two;
	two.init(n+5);
	
	for(int x=0;x<n;x++){
		for(int y=0;y<n;y++){
			if(p[x][y]==1){
				one.unite(x,y);
			}
			else if(p[x][y]==2){
				two.unite(x,y);
			}
		}
	}
	
	vector<vector<int>>ans;
	ans.resize(n);
	for(int x=0;x<n;x++){
		for(int y=0;y<n;y++){
			ans[x].push_back(0);
		}
	}
	
	bool done[n+5];
	memset(done,0,sizeof(done));
	for(int x=0;x<n;x++){
		if(one.get(x)==x){
			int last=-1;
			for(auto it:one.storage[x]){
				if(last!=-1){
					ans[last][it]=1;
					ans[it][last]=1;
					done[it]=true;
				}
				last=it;
			}
			
			for(auto it:one.storage[x]){
				for(auto it2:one.storage[x]){
					if(p[it][it2]!=1) return 0;
				}
			}
		}
	}
	
	for(int x=0;x<n;x++){
		if(two.get(x)==x&&two.size(x)>1){
			if(two.size(x)==2) return 0;
			int last=-1;
			for(auto it:two.storage[x]){
				if(done[it]) continue; 
				if(last!=-1){
					ans[last][it]=1;
					ans[it][last]=1;
				}
				last=it;
			}
			if(last!=-1){
				ans[last][two.storage[x][0]]=1;
				ans[two.storage[x][0]][last]=1;
			}
		}
	}
	
	for(int x=0;x<n;x++){
		for(int y=0;y<n;y++){
			if(x==y&&p[x][y]!=1) return 0;
			if(x==y) continue;
			if(p[x][y]==0){
				//if(one.sameSet(x,y)||two.sameSet(x,y)) return 0;
			}
			else if(p[x][y]==1){
				//if(two.sameSet(x,y)) return 0;
			}
			else if(p[x][y]==2){
				//if(one.sameSet(x,y)) return 0;
			}
		}	
	}
	
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 165 ms 22264 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 165 ms 22264 KB Output is correct
8 Correct 0 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 344 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 160 ms 22372 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 76 ms 12316 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 48 ms 5968 KB Output is correct
21 Correct 160 ms 22300 KB Output is correct
22 Correct 160 ms 22296 KB Output is correct
23 Correct 163 ms 22352 KB Output is correct
24 Correct 180 ms 22296 KB Output is correct
25 Correct 69 ms 12292 KB Output is correct
26 Correct 66 ms 12312 KB Output is correct
27 Correct 162 ms 22856 KB Output is correct
28 Correct 160 ms 22172 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1372 KB Output is correct
9 Correct 160 ms 22280 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 161 ms 22284 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 39 ms 5840 KB Output is correct
5 Correct 163 ms 22352 KB Output is correct
6 Correct 159 ms 22356 KB Output is correct
7 Correct 162 ms 22352 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 40 ms 5956 KB Output is correct
10 Correct 161 ms 22300 KB Output is correct
11 Correct 156 ms 22276 KB Output is correct
12 Correct 163 ms 22356 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 40 ms 5960 KB Output is correct
17 Correct 158 ms 22280 KB Output is correct
18 Correct 160 ms 22296 KB Output is correct
19 Correct 158 ms 22300 KB Output is correct
20 Correct 163 ms 22276 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 165 ms 22264 KB Output is correct
8 Correct 0 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 344 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 160 ms 22372 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 76 ms 12316 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 48 ms 5968 KB Output is correct
21 Correct 160 ms 22300 KB Output is correct
22 Correct 160 ms 22296 KB Output is correct
23 Correct 163 ms 22352 KB Output is correct
24 Correct 180 ms 22296 KB Output is correct
25 Correct 69 ms 12292 KB Output is correct
26 Correct 66 ms 12312 KB Output is correct
27 Correct 162 ms 22856 KB Output is correct
28 Correct 160 ms 22172 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 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 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 160 ms 22280 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 600 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 161 ms 22284 KB Output is correct
42 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 165 ms 22264 KB Output is correct
8 Correct 0 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 344 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 160 ms 22372 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 76 ms 12316 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 48 ms 5968 KB Output is correct
21 Correct 160 ms 22300 KB Output is correct
22 Correct 160 ms 22296 KB Output is correct
23 Correct 163 ms 22352 KB Output is correct
24 Correct 180 ms 22296 KB Output is correct
25 Correct 69 ms 12292 KB Output is correct
26 Correct 66 ms 12312 KB Output is correct
27 Correct 162 ms 22856 KB Output is correct
28 Correct 160 ms 22172 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 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 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 160 ms 22280 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 600 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 161 ms 22284 KB Output is correct
42 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -