oj.uz

Submission #456186

# Submission time Handle Problem Language Result Execution time Memory
456186 2021-08-06T08:28:01 Z Khizri Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 277 ms 26128 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
vector<std::vector<int>> ans;
vector<std::vector<int>>arr;
int color[1005],n,k,say,t;
bool qq=false;
void dfs(int u){
	t=u;
	color[u]=k;
	say++;
	for(int i=0;i<n;i++){
		if(u!=i&&arr[u][i]>0&&!color[i]){
			ans[u][i]=1;
			ans[i][u]=1;
			dfs(i);
		}
	}
}
int construct(std::vector<std::vector<int>> p) {
	arr=p;
	n = arr.size();
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		ans.push_back(row);
	}
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			if(arr[i][j]==2){
				goto loop;
			}
		}
	}
	for(int i=0;i<n;i++){
		if(!color[i]){
			++k;
			dfs(i);
		}
	}
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			if(arr[i][j]==1&&color[i]!=color[j]){
				return 0;
			}
			if(arr[i][j]==0&&color[i]==color[j]){
				return 0;
			}
		}
	}
	build(ans);
	return 1;
	loop:;
	for(int i=0;i<n;i++){
		if(!color[i]){
			say=0;
			++k;
			dfs(i);
			if(say==2){
				return 0;
			}
			else if(say>2){
				ans[i][t]=1;
				ans[t][i]=1;
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			if(arr[i][j]>0&&color[i]!=color[j]){
				return 0;
			}
			if(arr[i][j]==0&&color[i]==color[j]){
				return 0;
			}
		}
	}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1292 KB Output is correct
7 Correct 230 ms 25988 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1292 KB Output is correct
7 Correct 230 ms 25988 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 231 ms 25884 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 113 ms 16124 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 58 ms 6660 KB Output is correct
21 Correct 234 ms 25992 KB Output is correct
22 Correct 232 ms 26000 KB Output is correct
23 Correct 243 ms 26000 KB Output is correct
24 Correct 228 ms 26052 KB Output is correct
25 Correct 103 ms 16012 KB Output is correct
26 Correct 99 ms 16012 KB Output is correct
27 Correct 242 ms 25996 KB Output is correct
28 Correct 254 ms 25920 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 9 ms 1356 KB Output is correct
9 Correct 277 ms 25924 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1336 KB Output is correct
13 Correct 231 ms 26128 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 848 KB Output is correct
17 Correct 114 ms 16128 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 58 ms 6724 KB Output is correct
22 Correct 250 ms 25948 KB Output is correct
23 Correct 234 ms 25900 KB Output is correct
24 Correct 244 ms 25984 KB Output is correct
25 Correct 101 ms 16040 KB Output is correct
26 Correct 114 ms 16000 KB Output is correct
27 Correct 226 ms 25984 KB Output is correct
28 Correct 245 ms 25924 KB Output is correct
29 Correct 97 ms 16068 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 59 ms 6656 KB Output is correct
5 Correct 234 ms 25996 KB Output is correct
6 Correct 232 ms 25980 KB Output is correct
7 Correct 250 ms 25924 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 59 ms 6660 KB Output is correct
10 Correct 235 ms 25996 KB Output is correct
11 Correct 242 ms 26052 KB Output is correct
12 Correct 250 ms 25980 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Incorrect 1 ms 204 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1292 KB Output is correct
7 Correct 230 ms 25988 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 231 ms 25884 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 113 ms 16124 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 58 ms 6660 KB Output is correct
21 Correct 234 ms 25992 KB Output is correct
22 Correct 232 ms 26000 KB Output is correct
23 Correct 243 ms 26000 KB Output is correct
24 Correct 228 ms 26052 KB Output is correct
25 Correct 103 ms 16012 KB Output is correct
26 Correct 99 ms 16012 KB Output is correct
27 Correct 242 ms 25996 KB Output is correct
28 Correct 254 ms 25920 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 9 ms 1356 KB Output is correct
37 Correct 277 ms 25924 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1336 KB Output is correct
41 Correct 231 ms 26128 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 848 KB Output is correct
45 Correct 114 ms 16128 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 58 ms 6724 KB Output is correct
50 Correct 250 ms 25948 KB Output is correct
51 Correct 234 ms 25900 KB Output is correct
52 Correct 244 ms 25984 KB Output is correct
53 Correct 101 ms 16040 KB Output is correct
54 Correct 114 ms 16000 KB Output is correct
55 Correct 226 ms 25984 KB Output is correct
56 Correct 245 ms 25924 KB Output is correct
57 Correct 97 ms 16068 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 113 ms 16140 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Incorrect 0 ms 204 KB Too many ways to get from 0 to 9, should be 1 found no less than 2
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1292 KB Output is correct
7 Correct 230 ms 25988 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 231 ms 25884 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 113 ms 16124 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 58 ms 6660 KB Output is correct
21 Correct 234 ms 25992 KB Output is correct
22 Correct 232 ms 26000 KB Output is correct
23 Correct 243 ms 26000 KB Output is correct
24 Correct 228 ms 26052 KB Output is correct
25 Correct 103 ms 16012 KB Output is correct
26 Correct 99 ms 16012 KB Output is correct
27 Correct 242 ms 25996 KB Output is correct
28 Correct 254 ms 25920 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 9 ms 1356 KB Output is correct
37 Correct 277 ms 25924 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1336 KB Output is correct
41 Correct 231 ms 26128 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 848 KB Output is correct
45 Correct 114 ms 16128 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 58 ms 6724 KB Output is correct
50 Correct 250 ms 25948 KB Output is correct
51 Correct 234 ms 25900 KB Output is correct
52 Correct 244 ms 25984 KB Output is correct
53 Correct 101 ms 16040 KB Output is correct
54 Correct 114 ms 16000 KB Output is correct
55 Correct 226 ms 25984 KB Output is correct
56 Correct 245 ms 25924 KB Output is correct
57 Correct 97 ms 16068 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 59 ms 6656 KB Output is correct
62 Correct 234 ms 25996 KB Output is correct
63 Correct 232 ms 25980 KB Output is correct
64 Correct 250 ms 25924 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 59 ms 6660 KB Output is correct
67 Correct 235 ms 25996 KB Output is correct
68 Correct 242 ms 26052 KB Output is correct
69 Correct 250 ms 25980 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Incorrect 1 ms 204 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -