oj.uz

Submission #366771

# Submission time Handle Problem Language Result Execution time Memory
366771 2021-02-15T09:31:15 Z SlavicG Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 305 ms 26220 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];
set<int> n2;
bool two_cur;
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;
	if(n2.count(u))two_cur = true;
	component.pb(u);
	for(auto x : adj[u]){
		if(!vis[x])dfs(x);
	}
}
int construct(vector<vector<int>> p)
{
	int n = sz(p);
	for(int i = 0;i < n;i++)adj[i].clear();
	n2.clear();
	for(int i =0;i < n;i++)vis[i] = false;
	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]){
				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++)
	{
		for(int j = 0;j < n;j++)
		{
			if(p[i][j] == 2)n2.insert(i);
		}
	}
	for(int i = 0;i < n;i++)
	{
		if(!vis[i]){
			component.clear();
			two_cur = false;
			dfs(i);
			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[component.back()][component[0]] = ans[component[0]][component.back()] = 1;
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:55:7: warning: variable 'two' set but not used [-Wunused-but-set-variable]
   55 |  bool two = false;
      |       ^~~
supertrees.cpp:56:7: warning: variable 'one' set but not used [-Wunused-but-set-variable]
   56 |  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 512 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 269 ms 26196 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 512 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 269 ms 26196 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 264 ms 22252 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 136 ms 14828 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 67 ms 5868 KB Output is correct
21 Correct 268 ms 22764 KB Output is correct
22 Correct 275 ms 22124 KB Output is correct
23 Correct 278 ms 24300 KB Output is correct
24 Correct 265 ms 22252 KB Output is correct
25 Correct 127 ms 12652 KB Output is correct
26 Correct 118 ms 12268 KB Output is correct
27 Correct 284 ms 25196 KB Output is correct
28 Correct 266 ms 22268 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 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 1 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 264 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 1516 KB Output is correct
13 Correct 286 ms 26220 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 132 ms 14700 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 65 ms 5868 KB Output is correct
22 Correct 296 ms 22636 KB Output is correct
23 Correct 271 ms 22252 KB Output is correct
24 Correct 305 ms 25196 KB Output is correct
25 Correct 117 ms 12396 KB Output is correct
26 Correct 119 ms 12652 KB Output is correct
27 Correct 272 ms 22196 KB Output is correct
28 Correct 294 ms 24300 KB Output is correct
29 Correct 133 ms 12268 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 65 ms 5996 KB Output is correct
5 Correct 278 ms 22652 KB Output is correct
6 Correct 266 ms 22280 KB Output is correct
7 Correct 280 ms 24428 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 65 ms 5996 KB Output is correct
10 Correct 273 ms 22636 KB Output is correct
11 Correct 266 ms 22252 KB Output is correct
12 Correct 298 ms 25196 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Incorrect 1 ms 364 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 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 512 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 269 ms 26196 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 264 ms 22252 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 136 ms 14828 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 67 ms 5868 KB Output is correct
21 Correct 268 ms 22764 KB Output is correct
22 Correct 275 ms 22124 KB Output is correct
23 Correct 278 ms 24300 KB Output is correct
24 Correct 265 ms 22252 KB Output is correct
25 Correct 127 ms 12652 KB Output is correct
26 Correct 118 ms 12268 KB Output is correct
27 Correct 284 ms 25196 KB Output is correct
28 Correct 266 ms 22268 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 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 264 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 1516 KB Output is correct
41 Correct 286 ms 26220 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 6 ms 876 KB Output is correct
45 Correct 132 ms 14700 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 65 ms 5868 KB Output is correct
50 Correct 296 ms 22636 KB Output is correct
51 Correct 271 ms 22252 KB Output is correct
52 Correct 305 ms 25196 KB Output is correct
53 Correct 117 ms 12396 KB Output is correct
54 Correct 119 ms 12652 KB Output is correct
55 Correct 272 ms 22196 KB Output is correct
56 Correct 294 ms 24300 KB Output is correct
57 Correct 133 ms 12268 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 5 ms 1004 KB Output is correct
61 Correct 131 ms 16236 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Incorrect 65 ms 5868 KB Too many ways to get from 1 to 269, should be 1 found no less than 2
66 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 512 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 269 ms 26196 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 264 ms 22252 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 136 ms 14828 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 67 ms 5868 KB Output is correct
21 Correct 268 ms 22764 KB Output is correct
22 Correct 275 ms 22124 KB Output is correct
23 Correct 278 ms 24300 KB Output is correct
24 Correct 265 ms 22252 KB Output is correct
25 Correct 127 ms 12652 KB Output is correct
26 Correct 118 ms 12268 KB Output is correct
27 Correct 284 ms 25196 KB Output is correct
28 Correct 266 ms 22268 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 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 264 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 1516 KB Output is correct
41 Correct 286 ms 26220 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 6 ms 876 KB Output is correct
45 Correct 132 ms 14700 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 65 ms 5868 KB Output is correct
50 Correct 296 ms 22636 KB Output is correct
51 Correct 271 ms 22252 KB Output is correct
52 Correct 305 ms 25196 KB Output is correct
53 Correct 117 ms 12396 KB Output is correct
54 Correct 119 ms 12652 KB Output is correct
55 Correct 272 ms 22196 KB Output is correct
56 Correct 294 ms 24300 KB Output is correct
57 Correct 133 ms 12268 KB Output is correct
58 Correct 0 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 65 ms 5996 KB Output is correct
62 Correct 278 ms 22652 KB Output is correct
63 Correct 266 ms 22280 KB Output is correct
64 Correct 280 ms 24428 KB Output is correct
65 Correct 1 ms 492 KB Output is correct
66 Correct 65 ms 5996 KB Output is correct
67 Correct 273 ms 22636 KB Output is correct
68 Correct 266 ms 22252 KB Output is correct
69 Correct 298 ms 25196 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Incorrect 1 ms 364 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -