oj.uz

Submission #369739

# Submission time Handle Problem Language Result Execution time Memory
369739 2021-02-22T10:37:19 Z MilosMilutinovic Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 281 ms 24300 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int mxN=1e3;

int r[mxN], sz[mxN];
vector<int> g[mxN];

int find(int x) {
	return x^r[x]?r[x]=find(r[x]):x;
}

void join(int x, int y) {
	x=find(x),y=find(y);
	if(x==y)
		return;
	if(sz[x]>sz[y])
		swap(x,y);
	r[x]=y;
	sz[y]+=sz[x];
}

int construct(vector<vector<int>> p) {
	int n=(int)p.size();
	for(int i=0; i<n; ++i)
		for(int j=0; j<n; ++j)
			if(p[i][j]==3)
				return 0;
	iota(r, r+n, 0);
	memset(sz, 1, sizeof(sz));
	for(int i=0; i<n; ++i)
		for(int j=i+1; j<n; ++j)
			if(p[i][j]==1)
				join(i,j);
	vector<vector<int>> ans(n, vector<int>(n));
	vector<int> roots;
	for(int i=0; i<n; ++i) {
		int j=find(i);
		if(j==i)
			roots.pb(i);
		else
			ans[i][j]=ans[j][i]=1;
	}
	for(int i=0; i<n; ++i)
		for(int j=0; j<n; ++j)
			if(p[i][j]!=p[find(i)][find(j)])
				return 0;
	for(int i=0; i<n; ++i)
		sz[i]=1,r[i]=i;
	for(int i:roots)
		for(int j:roots)
			if(p[i][j]==2)
				join(i,j);
	for(int i=0; i<n; ++i)
		g[i].clear();
	for(int i:roots)
		if(sz[find(i)]>=2)
			g[find(i)].pb(i);
	for(int i=0; i<n; ++i) {
		//if(!g[i].empty()&&(int)g[i].size()<=2)
		//	return 0;
		assert(g[i].empty());
		if(g[i].empty())
			continue;
		for(int x:g[i]) {
			for(int y:g[i]) {
				if(x!=y&&p[x][y]!=2)
					return 0;
			}
		}
		for(int j=1;j<(int)g[i].size();j++) {
			int x=g[i][j],y=g[i][j-1];
			ans[x][y]=ans[y][x]=1;
		}
		int x=g[i][0],y=g[i].back();
		ans[x][y]=ans[y][x]=1;
	}
	build(ans);
	return 1;
}

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 492 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 254 ms 24172 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 492 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 254 ms 24172 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 1388 KB Output is correct
13 Correct 255 ms 24044 KB Output is correct
14 Correct 1 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 114 ms 14188 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 70 ms 6380 KB Output is correct
21 Correct 272 ms 24044 KB Output is correct
22 Correct 281 ms 24300 KB Output is correct
23 Correct 263 ms 24300 KB Output is correct
24 Correct 251 ms 24300 KB Output is correct
25 Correct 116 ms 14188 KB Output is correct
26 Correct 113 ms 14188 KB Output is correct
27 Correct 261 ms 24300 KB Output is correct
28 Correct 250 ms 24044 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 1 ms 364 KB Output is correct
4 Runtime error 1 ms 492 KB Execution killed with signal 6
5 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 Runtime error 1 ms 492 KB Execution killed with signal 6
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 492 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 254 ms 24172 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 1388 KB Output is correct
13 Correct 255 ms 24044 KB Output is correct
14 Correct 1 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 114 ms 14188 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 70 ms 6380 KB Output is correct
21 Correct 272 ms 24044 KB Output is correct
22 Correct 281 ms 24300 KB Output is correct
23 Correct 263 ms 24300 KB Output is correct
24 Correct 251 ms 24300 KB Output is correct
25 Correct 116 ms 14188 KB Output is correct
26 Correct 113 ms 14188 KB Output is correct
27 Correct 261 ms 24300 KB Output is correct
28 Correct 250 ms 24044 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 Runtime error 1 ms 492 KB Execution killed with signal 6
33 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 492 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 254 ms 24172 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 1388 KB Output is correct
13 Correct 255 ms 24044 KB Output is correct
14 Correct 1 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 114 ms 14188 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 70 ms 6380 KB Output is correct
21 Correct 272 ms 24044 KB Output is correct
22 Correct 281 ms 24300 KB Output is correct
23 Correct 263 ms 24300 KB Output is correct
24 Correct 251 ms 24300 KB Output is correct
25 Correct 116 ms 14188 KB Output is correct
26 Correct 113 ms 14188 KB Output is correct
27 Correct 261 ms 24300 KB Output is correct
28 Correct 250 ms 24044 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 Runtime error 1 ms 492 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -