oj.uz

Submission #439856

# Submission time Handle Problem Language Result Execution time Memory
439856 2021-07-01T03:14:20 Z adamjinwei Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 455 ms 33804 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
#define inf 1000000007
#define mod 1000000007
#define rnd() rand_num()
#define bigrnd() dis(rand_num)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
//#define int long long
using namespace std;
unsigned sed=std::chrono::system_clock::now().time_since_epoch().count();
mt19937 rand_num(sed);
uniform_int_distribution<long long> dis(0,inf);
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n;
int fa[1005];
int g[1005][1005];
int fa1[1005];
vector<int> vec[1005];
int fnd(int x)
{
	if(fa[x]!=x) fa[x]=fnd(fa[x]);
	return fa[x];
}
int fnd1(int x)
{
	if(fa1[x]!=x) fa1[x]=fnd1(fa1[x]);
	return fa1[x];
}
int construct(vector<vector<int>> p)
{
	n=p.size();
	for(int i=0;i<n;++i)
		fa[i]=i;
	for(int i=0;i<n;++i)
		for(int j=0;j<n;++j)
			if(p[i][j]==3)
				return 0;
			else if(p[i][j]!=0)
				fa[fnd(i)]=fnd(j);
	for(int i=0;i<n;++i)
		for(int j=0;j<n;++j)
			if(p[i][j]==0&&fnd(i)==fnd(j))
				return 0;
	for(int i=0;i<n;++i)
		fa[i]=i;
	for(int i=0;i<n;++i)
		for(int j=0;j<n;++j)
			if(p[i][j]==1)
				fa[fnd(i)]=fnd(j);
	for(int i=0;i<n;++i)
		for(int j=0;j<n;++j)
			if(p[i][j]==2&&fnd(i)==fnd(j))
				return 0;
	for(int i=0;i<n;++i)
		fa1[i]=i;
	bool flag=false;
	for(int i=0;i<n;++i)
		for(int j=0;j<n;++j)
			if(p[i][j]==2)
			{
				flag=true;
				fa1[fnd1(fnd(i))]=fnd1(fnd(j));
			}
	for(int i=0;i<n;++i)
		for(int j=0;j<n;++j)
			if(p[i][j]==2)
			{
				vec[fnd1(fnd(i))].push_back(fnd(i));
				vec[fnd1(fnd(j))].push_back(fnd(j));
			}
	for(int i=0;i<n;++i)
		if(fnd(i)==i)
		{
			sort(vec[fnd1(i)].begin(),vec[fnd1(i)].end());
			vec[fnd1(i)].erase(unique(vec[fnd1(i)].begin(),vec[fnd1(i)].end()),vec[fnd1(i)].end());
			if(flag&&vec[fnd1(i)].size()<3) return 0;
			if(flag)
			{
				for(int j=0;j+1<vec[fnd1(i)].size();++j)
					g[vec[fnd1(i)][j]][vec[fnd1(i)][j+1]]=g[vec[fnd1(i)][j+1]][vec[fnd1(i)][j]]=1;
				if(vec[fnd1(i)].size()>1) g[vec[fnd1(i)][0]][vec[fnd1(i)][vec[fnd1(i)].size()-1]]=g[vec[fnd1(i)][vec[fnd1(i)].size()-1]][vec[fnd1(i)][0]]=1;
			}
		}
	for(int i=0;i<n;++i)
		if(fnd(i)!=i)
			g[fnd(i)][i]=g[i][fnd(i)]=1;
	vector<vector<int>> ans;
	for(int i=0;i<n;++i)
	{
		vector<int> tmp;
		for(int j=0;j<n;++j)
			tmp.push_back(g[i][j]);
		ans.push_back(tmp);
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:94:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     for(int j=0;j+1<vec[fnd1(i)].size();++j)
      |                 ~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 15 ms 1996 KB Output is correct
7 Correct 243 ms 26016 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 15 ms 1996 KB Output is correct
7 Correct 243 ms 26016 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 11 ms 1228 KB Output is correct
13 Correct 230 ms 22060 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 104 ms 8216 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 59 ms 7620 KB Output is correct
21 Correct 240 ms 26012 KB Output is correct
22 Correct 231 ms 25540 KB Output is correct
23 Correct 280 ms 26036 KB Output is correct
24 Correct 224 ms 22304 KB Output is correct
25 Correct 94 ms 8096 KB Output is correct
26 Correct 90 ms 8136 KB Output is correct
27 Correct 253 ms 25904 KB Output is correct
28 Correct 228 ms 22260 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 26 ms 1132 KB Output is correct
9 Correct 226 ms 21996 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 18 ms 2284 KB Output is correct
13 Correct 455 ms 33804 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 111 ms 8108 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Incorrect 1 ms 332 KB Answer gives possible 0 while actual possible 1
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 59 ms 7516 KB Output is correct
5 Correct 258 ms 25932 KB Output is correct
6 Correct 230 ms 25392 KB Output is correct
7 Correct 268 ms 25960 KB Output is correct
8 Incorrect 1 ms 332 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 15 ms 1996 KB Output is correct
7 Correct 243 ms 26016 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 11 ms 1228 KB Output is correct
13 Correct 230 ms 22060 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 104 ms 8216 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 59 ms 7620 KB Output is correct
21 Correct 240 ms 26012 KB Output is correct
22 Correct 231 ms 25540 KB Output is correct
23 Correct 280 ms 26036 KB Output is correct
24 Correct 224 ms 22304 KB Output is correct
25 Correct 94 ms 8096 KB Output is correct
26 Correct 90 ms 8136 KB Output is correct
27 Correct 253 ms 25904 KB Output is correct
28 Correct 228 ms 22260 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 26 ms 1132 KB Output is correct
37 Correct 226 ms 21996 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 18 ms 2284 KB Output is correct
41 Correct 455 ms 33804 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 111 ms 8108 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Incorrect 1 ms 332 KB Answer gives possible 0 while actual possible 1
49 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 15 ms 1996 KB Output is correct
7 Correct 243 ms 26016 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 11 ms 1228 KB Output is correct
13 Correct 230 ms 22060 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 104 ms 8216 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 59 ms 7620 KB Output is correct
21 Correct 240 ms 26012 KB Output is correct
22 Correct 231 ms 25540 KB Output is correct
23 Correct 280 ms 26036 KB Output is correct
24 Correct 224 ms 22304 KB Output is correct
25 Correct 94 ms 8096 KB Output is correct
26 Correct 90 ms 8136 KB Output is correct
27 Correct 253 ms 25904 KB Output is correct
28 Correct 228 ms 22260 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 26 ms 1132 KB Output is correct
37 Correct 226 ms 21996 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 18 ms 2284 KB Output is correct
41 Correct 455 ms 33804 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 111 ms 8108 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Incorrect 1 ms 332 KB Answer gives possible 0 while actual possible 1
49 Halted 0 ms 0 KB -