oj.uz

Submission #896569

# Submission time Handle Problem Language Result Execution time Memory
896569 2024-01-01T17:02:46 Z LCJLY Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 198 ms 22404 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];
	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;
				}
				else done[it]=true;
				last=it;
			}
		}
	}
	
	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;
			}
			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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 360 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 1368 KB Output is correct
7 Correct 166 ms 22316 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 360 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 1368 KB Output is correct
7 Correct 166 ms 22316 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 1368 KB Output is correct
13 Correct 161 ms 22280 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 79 ms 12272 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 5932 KB Output is correct
21 Correct 163 ms 22352 KB Output is correct
22 Correct 157 ms 22236 KB Output is correct
23 Correct 167 ms 22352 KB Output is correct
24 Correct 157 ms 22356 KB Output is correct
25 Correct 72 ms 12296 KB Output is correct
26 Correct 66 ms 12404 KB Output is correct
27 Correct 168 ms 22352 KB Output is correct
28 Correct 161 ms 22240 KB Output is correct

Subtask #3
19.0 / 19.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 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1632 KB Output is correct
9 Correct 161 ms 22168 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 163 ms 22372 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 78 ms 12312 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 41 ms 5980 KB Output is correct
22 Correct 161 ms 22284 KB Output is correct
23 Correct 162 ms 22404 KB Output is correct
24 Correct 165 ms 22356 KB Output is correct
25 Correct 67 ms 12296 KB Output is correct
26 Correct 68 ms 12372 KB Output is correct
27 Correct 198 ms 22276 KB Output is correct
28 Correct 167 ms 22292 KB Output is correct
29 Correct 67 ms 12368 KB Output is correct

Subtask #4
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 344 KB Output is correct
4 Correct 41 ms 5780 KB Output is correct
5 Correct 159 ms 22276 KB Output is correct
6 Correct 162 ms 22192 KB Output is correct
7 Correct 163 ms 22352 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 40 ms 5824 KB Output is correct
10 Correct 160 ms 22356 KB Output is correct
11 Correct 162 ms 22240 KB Output is correct
12 Correct 165 ms 22296 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 360 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 1368 KB Output is correct
7 Correct 166 ms 22316 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 1368 KB Output is correct
13 Correct 161 ms 22280 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 79 ms 12272 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 5932 KB Output is correct
21 Correct 163 ms 22352 KB Output is correct
22 Correct 157 ms 22236 KB Output is correct
23 Correct 167 ms 22352 KB Output is correct
24 Correct 157 ms 22356 KB Output is correct
25 Correct 72 ms 12296 KB Output is correct
26 Correct 66 ms 12404 KB Output is correct
27 Correct 168 ms 22352 KB Output is correct
28 Correct 161 ms 22240 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 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 1632 KB Output is correct
37 Correct 161 ms 22168 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 163 ms 22372 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 78 ms 12312 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 41 ms 5980 KB Output is correct
50 Correct 161 ms 22284 KB Output is correct
51 Correct 162 ms 22404 KB Output is correct
52 Correct 165 ms 22356 KB Output is correct
53 Correct 67 ms 12296 KB Output is correct
54 Correct 68 ms 12372 KB Output is correct
55 Correct 198 ms 22276 KB Output is correct
56 Correct 167 ms 22292 KB Output is correct
57 Correct 67 ms 12368 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 4 ms 860 KB Output is correct
61 Correct 79 ms 12292 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Incorrect 18 ms 3420 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 360 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 1368 KB Output is correct
7 Correct 166 ms 22316 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 1368 KB Output is correct
13 Correct 161 ms 22280 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 79 ms 12272 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 5932 KB Output is correct
21 Correct 163 ms 22352 KB Output is correct
22 Correct 157 ms 22236 KB Output is correct
23 Correct 167 ms 22352 KB Output is correct
24 Correct 157 ms 22356 KB Output is correct
25 Correct 72 ms 12296 KB Output is correct
26 Correct 66 ms 12404 KB Output is correct
27 Correct 168 ms 22352 KB Output is correct
28 Correct 161 ms 22240 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 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 1632 KB Output is correct
37 Correct 161 ms 22168 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 163 ms 22372 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 78 ms 12312 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 41 ms 5980 KB Output is correct
50 Correct 161 ms 22284 KB Output is correct
51 Correct 162 ms 22404 KB Output is correct
52 Correct 165 ms 22356 KB Output is correct
53 Correct 67 ms 12296 KB Output is correct
54 Correct 68 ms 12372 KB Output is correct
55 Correct 198 ms 22276 KB Output is correct
56 Correct 167 ms 22292 KB Output is correct
57 Correct 67 ms 12368 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 41 ms 5780 KB Output is correct
62 Correct 159 ms 22276 KB Output is correct
63 Correct 162 ms 22192 KB Output is correct
64 Correct 163 ms 22352 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 40 ms 5824 KB Output is correct
67 Correct 160 ms 22356 KB Output is correct
68 Correct 162 ms 22240 KB Output is correct
69 Correct 165 ms 22296 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 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 -