Submission #366624

# Submission time Handle Problem Language Result Execution time Memory
366624 2021-02-14T19:49:17 Z SlavicG Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
278 ms 27628 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;
	for(int i = 0;i < n;i++)
	{
		for(int j = 0;j < n;j++)
		{
			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);
			for(int j = 1;j < sz(component);j++)
			{
				ans[component[j]][component[j-1]] = ans[component[j-1]][component[j]] = 1; 
			}
		}
	}
	build(ans);
	return 1;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 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 1516 KB Output is correct
7 Correct 274 ms 27628 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 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 1516 KB Output is correct
7 Correct 274 ms 27628 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 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 1260 KB Output is correct
13 Correct 256 ms 23584 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 1004 KB Output is correct
17 Correct 130 ms 16620 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 68 ms 6636 KB Output is correct
21 Correct 260 ms 24556 KB Output is correct
22 Correct 278 ms 24172 KB Output is correct
23 Correct 276 ms 26092 KB Output is correct
24 Correct 262 ms 24096 KB Output is correct
25 Correct 118 ms 14700 KB Output is correct
26 Correct 108 ms 14188 KB Output is correct
27 Correct 278 ms 27372 KB Output is correct
28 Correct 261 ms 24096 KB Output is correct
# 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 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 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 1516 KB Output is correct
7 Correct 274 ms 27628 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 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 1260 KB Output is correct
13 Correct 256 ms 23584 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 1004 KB Output is correct
17 Correct 130 ms 16620 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 68 ms 6636 KB Output is correct
21 Correct 260 ms 24556 KB Output is correct
22 Correct 278 ms 24172 KB Output is correct
23 Correct 276 ms 26092 KB Output is correct
24 Correct 262 ms 24096 KB Output is correct
25 Correct 118 ms 14700 KB Output is correct
26 Correct 108 ms 14188 KB Output is correct
27 Correct 278 ms 27372 KB Output is correct
28 Correct 261 ms 24096 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 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 1516 KB Output is correct
7 Correct 274 ms 27628 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 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 1260 KB Output is correct
13 Correct 256 ms 23584 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 1004 KB Output is correct
17 Correct 130 ms 16620 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 68 ms 6636 KB Output is correct
21 Correct 260 ms 24556 KB Output is correct
22 Correct 278 ms 24172 KB Output is correct
23 Correct 276 ms 26092 KB Output is correct
24 Correct 262 ms 24096 KB Output is correct
25 Correct 118 ms 14700 KB Output is correct
26 Correct 108 ms 14188 KB Output is correct
27 Correct 278 ms 27372 KB Output is correct
28 Correct 261 ms 24096 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -