oj.uz

답안 #439854

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
439854 2021-07-01T03:02:46 Z adamjinwei 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 253 ms 27972 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 fnd(int x)
{
	if(fa[x]!=x) fa[x]=fnd(fa[x]);
	return fa[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;
	vector<int> vec;
	bool flag=false;
	for(int i=0;i<n;++i)
		if(fnd(i)==i)
			vec.push_back(i);
	for(int i=0;i<n;++i)
		for(int j=0;j<n;++j)
			if(p[i][j]==2)
				flag=true;
	if(flag&&vec.size()<3) return 0;
	if(flag)
	{
		for(int i=0;i+1<vec.size();++i)
			g[vec[i]][vec[i+1]]=g[vec[i+1]][vec[i]]=1;
		if(vec.size()>1) g[vec[0]][vec[vec.size()-1]]=g[vec[vec.size()-1]][vec[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:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   for(int i=0;i+1<vec.size();++i)
      |               ~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 11 ms 1964 KB Output is correct
7 Correct 243 ms 27912 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 11 ms 1964 KB Output is correct
7 Correct 243 ms 27912 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1228 KB Output is correct
13 Correct 227 ms 24060 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 704 KB Output is correct
17 Correct 107 ms 10108 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 59 ms 8012 KB Output is correct
21 Correct 238 ms 27912 KB Output is correct
22 Correct 230 ms 27404 KB Output is correct
23 Correct 250 ms 27844 KB Output is correct
24 Correct 242 ms 24248 KB Output is correct
25 Correct 93 ms 10052 KB Output is correct
26 Correct 91 ms 10244 KB Output is correct
27 Correct 251 ms 27904 KB Output is correct
28 Correct 224 ms 24132 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 10 ms 1272 KB Output is correct
9 Correct 230 ms 23940 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 1996 KB Output is correct
13 Correct 235 ms 27912 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 104 ms 10052 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Incorrect 1 ms 332 KB Too many ways to get from 0 to 4, should be 0 found no less than 1
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 61 ms 7980 KB Output is correct
5 Correct 242 ms 27932 KB Output is correct
6 Correct 233 ms 27460 KB Output is correct
7 Correct 253 ms 27972 KB Output is correct
8 Incorrect 1 ms 204 KB Too many ways to get from 0 to 4, should be 0 found no less than 1
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 11 ms 1964 KB Output is correct
7 Correct 243 ms 27912 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1228 KB Output is correct
13 Correct 227 ms 24060 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 704 KB Output is correct
17 Correct 107 ms 10108 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 59 ms 8012 KB Output is correct
21 Correct 238 ms 27912 KB Output is correct
22 Correct 230 ms 27404 KB Output is correct
23 Correct 250 ms 27844 KB Output is correct
24 Correct 242 ms 24248 KB Output is correct
25 Correct 93 ms 10052 KB Output is correct
26 Correct 91 ms 10244 KB Output is correct
27 Correct 251 ms 27904 KB Output is correct
28 Correct 224 ms 24132 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1272 KB Output is correct
37 Correct 230 ms 23940 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 11 ms 1996 KB Output is correct
41 Correct 235 ms 27912 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 104 ms 10052 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Incorrect 1 ms 332 KB Too many ways to get from 0 to 4, should be 0 found no less than 1
49 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 11 ms 1964 KB Output is correct
7 Correct 243 ms 27912 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1228 KB Output is correct
13 Correct 227 ms 24060 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 704 KB Output is correct
17 Correct 107 ms 10108 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 59 ms 8012 KB Output is correct
21 Correct 238 ms 27912 KB Output is correct
22 Correct 230 ms 27404 KB Output is correct
23 Correct 250 ms 27844 KB Output is correct
24 Correct 242 ms 24248 KB Output is correct
25 Correct 93 ms 10052 KB Output is correct
26 Correct 91 ms 10244 KB Output is correct
27 Correct 251 ms 27904 KB Output is correct
28 Correct 224 ms 24132 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1272 KB Output is correct
37 Correct 230 ms 23940 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 11 ms 1996 KB Output is correct
41 Correct 235 ms 27912 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 104 ms 10052 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Incorrect 1 ms 332 KB Too many ways to get from 0 to 4, should be 0 found no less than 1
49 Halted 0 ms 0 KB -