oj.uz

Submission #366758

# Submission time Handle Problem Language Result Execution time Memory
366758 2021-02-15T09:23:48 Z SlavicG Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 270 ms 26380 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;
	bool one = 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] == 1)one = true;
			if(p[i][j] == 3)return 0;
			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);
			bool two_cur = false;
			vector<pair<int,int>> c;
			for(int j = 0;j < sz(component);j++)
			{
				for(int k = j + 1;k < sz(component);k++)
				{
					if(p[component[j]][component[k]] == 2){
						two_cur = true;
						c.pb({component[j],component[k]});
					}
				}
			}
			if(sz(component) == 2 && two_cur)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_cur && sz(component) > 1){
				ans[c[0].first][c[0].second] = ans[c[0].second][c[0].first] = 1;
			}
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:49:7: warning: variable 'two' set but not used [-Wunused-but-set-variable]
   49 |  bool two = false;
      |       ^~~
supertrees.cpp:50:7: warning: variable 'one' set but not used [-Wunused-but-set-variable]
   50 |  bool one = false;
      |       ^~~

Subtask #1
11.0 / 11.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 1 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 15 ms 1388 KB Output is correct
7 Correct 256 ms 26380 KB Output is correct

Subtask #2
10.0 / 10.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 1 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 15 ms 1388 KB Output is correct
7 Correct 256 ms 26380 KB Output is correct
8 Correct 0 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 10 ms 1260 KB Output is correct
13 Correct 256 ms 22124 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 876 KB Output is correct
17 Correct 126 ms 14700 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 63 ms 5888 KB Output is correct
21 Correct 248 ms 22636 KB Output is correct
22 Correct 245 ms 22380 KB Output is correct
23 Correct 270 ms 24172 KB Output is correct
24 Correct 242 ms 22124 KB Output is correct
25 Correct 110 ms 12652 KB Output is correct
26 Correct 106 ms 12268 KB Output is correct
27 Correct 263 ms 25196 KB Output is correct
28 Correct 244 ms 22252 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 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 0 ms 364 KB Too few ways to get from 0 to 1, should be 2 found 1
6 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 Incorrect 0 ms 364 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 1 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 15 ms 1388 KB Output is correct
7 Correct 256 ms 26380 KB Output is correct
8 Correct 0 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 10 ms 1260 KB Output is correct
13 Correct 256 ms 22124 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 876 KB Output is correct
17 Correct 126 ms 14700 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 63 ms 5888 KB Output is correct
21 Correct 248 ms 22636 KB Output is correct
22 Correct 245 ms 22380 KB Output is correct
23 Correct 270 ms 24172 KB Output is correct
24 Correct 242 ms 22124 KB Output is correct
25 Correct 110 ms 12652 KB Output is correct
26 Correct 106 ms 12268 KB Output is correct
27 Correct 263 ms 25196 KB Output is correct
28 Correct 244 ms 22252 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Incorrect 0 ms 364 KB Too few ways to get from 0 to 1, should be 2 found 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 1 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 15 ms 1388 KB Output is correct
7 Correct 256 ms 26380 KB Output is correct
8 Correct 0 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 10 ms 1260 KB Output is correct
13 Correct 256 ms 22124 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 876 KB Output is correct
17 Correct 126 ms 14700 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 63 ms 5888 KB Output is correct
21 Correct 248 ms 22636 KB Output is correct
22 Correct 245 ms 22380 KB Output is correct
23 Correct 270 ms 24172 KB Output is correct
24 Correct 242 ms 22124 KB Output is correct
25 Correct 110 ms 12652 KB Output is correct
26 Correct 106 ms 12268 KB Output is correct
27 Correct 263 ms 25196 KB Output is correct
28 Correct 244 ms 22252 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Incorrect 0 ms 364 KB Too few ways to get from 0 to 1, should be 2 found 1
34 Halted 0 ms 0 KB -