oj.uz

Submission #482779

# Submission time Handle Problem Language Result Execution time Memory
482779 2021-10-26T10:21:07 Z PoPularPlusPlus Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 247 ms 28068 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}
 
/*void build(vector<vector<int>>& ans){
	for(int i = 0; i < (int)ans.size(); i++){
		for(int j = 0; j < (int)ans.size(); j++)cout << ans[i][j] << ' ';
		cout << '\n';
	}
}*/
 
struct UFDS {
 
vector<int> p,siz;
 
void init(int n){
	p.resize(n + 3);
	siz.resize(n + 3);
	for(int i = 0; i <= n; i++){
		p[i] = i;
		siz[i] = 1;
	}
}
 
int get(int x){
	return p[x]=(x==p[x] ? x : get(p[x]));
}
 
void unio(int u , int v){
	int a = get(u);
	int b=get(v);
	if(a==b)return;
	if(siz[a]>siz[b])swap(a,b);
	p[b]=a;
	siz[a]+=siz[b];
}
};
 
vector<vector<int>> b;
 
vector<int> adj[2003];
 
int help(vector<int>& v){
	UFDS uf;
	int n = v.size();
	uf.init(n + 2);
	for(int i = 0; i < n; i++){
		for(int j = i+1; j < n;j++){
			if(b[v[i]][v[j]] == 1){
				uf.unio(i,j);
			}
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = i+1; j < n; j++){
			if(uf.get(i) == uf.get(j) && b[v[i]][v[j]] == 2)return -1;
		}
	}
	vector<vector<int>> v1;
	bool vis1[n + 1];
	memset(vis1,0,sizeof vis1);
	for(int i = 0; i < n; i++){
		if(!vis1[i]){
			vector<int> x;
			x.pb(v[i]);
			vis1[i] = 1;
			for(int j = i+1; j < n; j++){
				if(uf.get(i) == uf.get(j)){
					x.pb(v[j]);
					vis1[j] = 1;
				}
			}
			v1.pb(x);
		}
	}
	if(v1.size() == 2)return -1;
	for(int i = 0; i < (int)v1.size() && v1.size() > 2; i++){
		if(i == (int)v1.size()-1){
				adj[v1[i][0]].pb(v1[0][0]);
				adj[v1[0][0]].pb(v1[i][0]);
		}
		else {
			adj[v1[i][0]].pb(v1[i + 1][0]);
			adj[v1[i+1][0]].pb(v1[i][0]);
		}
	}
	for(int i = 0; i < (int)v1.size(); i++){
		for(int j = 1; j < (int)v1[i].size(); j++){
			adj[v1[i][j]].pb(v1[i][j-1]);
			adj[v1[i][j-1]].pb(v1[i][j]);
		}
	}
	return 1;
}
 
int construct(std::vector<std::vector<int>> v){
	int n = v.size();
	UFDS d;
	b = v;
	d.init(n + 2);
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			if(v[i][j]!=0)d.unio(i,j);
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = i + 1 ;j < n; j++){
			if(v[i][j] == 0 && d.get(i) == d.get(j))return 0;
		}
	}
 
	vector<vector<int>> com;
	bool vis[n + 1];
	memset(vis,0,sizeof vis);
	for(int i = 0; i < n; i++){
		if(!vis[i]){
			vector<int> x;
			x.pb(i);
			vis[i] = 1;
			for(int j = i+1; j < n; j++){
				if(d.get(i) == d.get(j)){
					x.pb(j);
					vis[j] = 1;
				}
			}
			com.pb(x);
		}
	}
	vector<vector<int>> ans(n,vector<int> (n,0));
	for(int i = 0; i < (int)com.size(); i++){
		int x = help(com[i]);
		if(x == -1)return 0;
	}
	for(int i = 0; i < n; i++){
		for(int j : adj[i]){
			ans[i][j] = 1;
		}
	}
	build(ans);
	return 1;
}
/*
void solve(){
	int n;
	cin >> n;
	vector<vector<int>> t(n,vector<int>(n));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++)cin >> t[i][j];
	}
	construct(t);
}
 
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 9 ms 1400 KB Output is correct
7 Correct 241 ms 26028 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 9 ms 1400 KB Output is correct
7 Correct 241 ms 26028 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 9 ms 1396 KB Output is correct
13 Correct 182 ms 26024 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 98 ms 14108 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 46 ms 7236 KB Output is correct
21 Correct 178 ms 27984 KB Output is correct
22 Correct 217 ms 28020 KB Output is correct
23 Correct 204 ms 27972 KB Output is correct
24 Correct 204 ms 28044 KB Output is correct
25 Correct 71 ms 14116 KB Output is correct
26 Correct 76 ms 14112 KB Output is correct
27 Correct 201 ms 27992 KB Output is correct
28 Correct 197 ms 27992 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 13 ms 1340 KB Output is correct
9 Correct 181 ms 26016 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 13 ms 1364 KB Output is correct
13 Correct 204 ms 26092 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 78 ms 14112 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 61 ms 7288 KB Output is correct
22 Correct 187 ms 27948 KB Output is correct
23 Correct 202 ms 28060 KB Output is correct
24 Correct 214 ms 28048 KB Output is correct
25 Correct 86 ms 18080 KB Output is correct
26 Correct 84 ms 14112 KB Output is correct
27 Correct 184 ms 28040 KB Output is correct
28 Correct 210 ms 28068 KB Output is correct
29 Correct 76 ms 18064 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 65 ms 6768 KB Output is correct
5 Correct 234 ms 26028 KB Output is correct
6 Correct 177 ms 26000 KB Output is correct
7 Correct 192 ms 26028 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 47 ms 6724 KB Output is correct
10 Correct 181 ms 26032 KB Output is correct
11 Correct 195 ms 26104 KB Output is correct
12 Correct 247 ms 26128 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 47 ms 6732 KB Output is correct
17 Correct 198 ms 26084 KB Output is correct
18 Correct 204 ms 25972 KB Output is correct
19 Correct 191 ms 26088 KB Output is correct
20 Correct 208 ms 26016 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 9 ms 1400 KB Output is correct
7 Correct 241 ms 26028 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 9 ms 1396 KB Output is correct
13 Correct 182 ms 26024 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 98 ms 14108 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 46 ms 7236 KB Output is correct
21 Correct 178 ms 27984 KB Output is correct
22 Correct 217 ms 28020 KB Output is correct
23 Correct 204 ms 27972 KB Output is correct
24 Correct 204 ms 28044 KB Output is correct
25 Correct 71 ms 14116 KB Output is correct
26 Correct 76 ms 14112 KB Output is correct
27 Correct 201 ms 27992 KB Output is correct
28 Correct 197 ms 27992 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 13 ms 1340 KB Output is correct
37 Correct 181 ms 26016 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 13 ms 1364 KB Output is correct
41 Correct 204 ms 26092 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 78 ms 14112 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 0 ms 336 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 61 ms 7288 KB Output is correct
50 Correct 187 ms 27948 KB Output is correct
51 Correct 202 ms 28060 KB Output is correct
52 Correct 214 ms 28048 KB Output is correct
53 Correct 86 ms 18080 KB Output is correct
54 Correct 84 ms 14112 KB Output is correct
55 Correct 184 ms 28040 KB Output is correct
56 Correct 210 ms 28068 KB Output is correct
57 Correct 76 ms 18064 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 6 ms 844 KB Output is correct
61 Correct 117 ms 14116 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 48 ms 7476 KB Output is correct
66 Correct 76 ms 14112 KB Output is correct
67 Correct 70 ms 14108 KB Output is correct
68 Correct 72 ms 14020 KB Output is correct
69 Correct 83 ms 18116 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 9 ms 1400 KB Output is correct
7 Correct 241 ms 26028 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 9 ms 1396 KB Output is correct
13 Correct 182 ms 26024 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 98 ms 14108 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 46 ms 7236 KB Output is correct
21 Correct 178 ms 27984 KB Output is correct
22 Correct 217 ms 28020 KB Output is correct
23 Correct 204 ms 27972 KB Output is correct
24 Correct 204 ms 28044 KB Output is correct
25 Correct 71 ms 14116 KB Output is correct
26 Correct 76 ms 14112 KB Output is correct
27 Correct 201 ms 27992 KB Output is correct
28 Correct 197 ms 27992 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 13 ms 1340 KB Output is correct
37 Correct 181 ms 26016 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 13 ms 1364 KB Output is correct
41 Correct 204 ms 26092 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 78 ms 14112 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 0 ms 336 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 61 ms 7288 KB Output is correct
50 Correct 187 ms 27948 KB Output is correct
51 Correct 202 ms 28060 KB Output is correct
52 Correct 214 ms 28048 KB Output is correct
53 Correct 86 ms 18080 KB Output is correct
54 Correct 84 ms 14112 KB Output is correct
55 Correct 184 ms 28040 KB Output is correct
56 Correct 210 ms 28068 KB Output is correct
57 Correct 76 ms 18064 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 65 ms 6768 KB Output is correct
62 Correct 234 ms 26028 KB Output is correct
63 Correct 177 ms 26000 KB Output is correct
64 Correct 192 ms 26028 KB Output is correct
65 Correct 0 ms 332 KB Output is correct
66 Correct 47 ms 6724 KB Output is correct
67 Correct 181 ms 26032 KB Output is correct
68 Correct 195 ms 26104 KB Output is correct
69 Correct 247 ms 26128 KB Output is correct
70 Correct 0 ms 332 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 47 ms 6732 KB Output is correct
74 Correct 198 ms 26084 KB Output is correct
75 Correct 204 ms 25972 KB Output is correct
76 Correct 191 ms 26088 KB Output is correct
77 Correct 208 ms 26016 KB Output is correct
78 Correct 1 ms 332 KB Output is correct
79 Correct 0 ms 332 KB Output is correct
80 Correct 6 ms 844 KB Output is correct
81 Correct 117 ms 14116 KB Output is correct
82 Correct 1 ms 332 KB Output is correct
83 Correct 1 ms 332 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 48 ms 7476 KB Output is correct
86 Correct 76 ms 14112 KB Output is correct
87 Correct 70 ms 14108 KB Output is correct
88 Correct 72 ms 14020 KB Output is correct
89 Correct 83 ms 18116 KB Output is correct
90 Correct 1 ms 332 KB Output is correct
91 Correct 1 ms 332 KB Output is correct
92 Correct 4 ms 904 KB Output is correct
93 Correct 76 ms 14124 KB Output is correct
94 Incorrect 0 ms 332 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -