oj.uz

Submission #366634

# Submission time Handle Problem Language Result Execution time Memory
366634 2021-02-14T19:59:23 Z SlavicG Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 280 ms 26348 KB 
#include "supertrees.h"
#include "bits/stdc++.h"

using namespace std;
 
#define              ll              long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
#define         fastio               ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = 1001;
vector<int> adj[N];
bool vis[N];
vector<int> component;

int par[N];
int get(int a){
	while(par[a]!=a)a=par[a];
	return a;
}
void uni(int a,int b){
	a = get(a);
	b = get(b);
	if(a==b)return;
	par[b] = a;
}
void dfs(int u)
{
	vis[u] = true;
	component.pb(u);
	for(auto x : adj[u]){
		if(!vis[x])dfs(x);
	}
}
int construct(vector<vector<int>> p)
{
	int n = sz(p);
	vector<vector<int>> ans;
	ans.resize(n);
	for(int i=0;i < n;i++)
		par[i]=i;
	for(int i =0;i < n;i++)ans[i].resize(n);
	forn(i,n)forn(j,n)ans[i][j]=0;
	bool two = false;
	for(int i = 0;i < n;i++)
	{
		for(int j = 0;j < n;j++)
		{
			if(p[i][j]==2)two=true;
			if(p[i][j]){
				uni(i,j);
				adj[i].pb(j);
			}
		}
	}
	for(int i = 0;i < n;i++)
	{
		for(int j =0;j < n;j++)
		{
			if(get(i)==get(j) && !p[i][j])return 0;
		}
	}
	for(int i = 0;i < n;i++)
	{
		if(!vis[i]){
			component.clear();
			dfs(i);
			if(sz(component) == 2 && two)return 0;
			for(int j = 1;j < sz(component);j++)
			{
				ans[component[j]][component[j-1]] = ans[component[j-1]][component[j]] = 1; 
			}
			if(two)ans[component.back()][component[0]] = ans[component[0]][component.back()] = 1;
		}
	}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 267 ms 26348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 267 ms 26348 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 254 ms 22380 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 130 ms 14700 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 5868 KB Output is correct
21 Correct 261 ms 22764 KB Output is correct
22 Correct 257 ms 22124 KB Output is correct
23 Correct 278 ms 24300 KB Output is correct
24 Correct 259 ms 22252 KB Output is correct
25 Correct 108 ms 12780 KB Output is correct
26 Correct 105 ms 12268 KB Output is correct
27 Correct 274 ms 25196 KB Output is correct
28 Correct 261 ms 22124 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 255 ms 22124 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 264 ms 26220 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 128 ms 14588 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Incorrect 0 ms 364 KB b[4][4] is not 0
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 64 ms 5996 KB Output is correct
5 Correct 268 ms 22784 KB Output is correct
6 Correct 262 ms 22124 KB Output is correct
7 Correct 280 ms 24300 KB Output is correct
8 Incorrect 0 ms 364 KB b[4][4] is not 0
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 267 ms 26348 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 254 ms 22380 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 130 ms 14700 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 5868 KB Output is correct
21 Correct 261 ms 22764 KB Output is correct
22 Correct 257 ms 22124 KB Output is correct
23 Correct 278 ms 24300 KB Output is correct
24 Correct 259 ms 22252 KB Output is correct
25 Correct 108 ms 12780 KB Output is correct
26 Correct 105 ms 12268 KB Output is correct
27 Correct 274 ms 25196 KB Output is correct
28 Correct 261 ms 22124 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 0 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 255 ms 22124 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1388 KB Output is correct
41 Correct 264 ms 26220 KB Output is correct
42 Correct 0 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 876 KB Output is correct
45 Correct 128 ms 14588 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 0 ms 364 KB Output is correct
48 Incorrect 0 ms 364 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 267 ms 26348 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 254 ms 22380 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 130 ms 14700 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 5868 KB Output is correct
21 Correct 261 ms 22764 KB Output is correct
22 Correct 257 ms 22124 KB Output is correct
23 Correct 278 ms 24300 KB Output is correct
24 Correct 259 ms 22252 KB Output is correct
25 Correct 108 ms 12780 KB Output is correct
26 Correct 105 ms 12268 KB Output is correct
27 Correct 274 ms 25196 KB Output is correct
28 Correct 261 ms 22124 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 0 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 255 ms 22124 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1388 KB Output is correct
41 Correct 264 ms 26220 KB Output is correct
42 Correct 0 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 876 KB Output is correct
45 Correct 128 ms 14588 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 0 ms 364 KB Output is correct
48 Incorrect 0 ms 364 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -