oj.uz

답안 #307878

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
307878 2020-09-29T13:08:46 Z AKaan37 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 270 ms 26232 KB 
#include "supertrees.h"
//Bismillahirrahmanirrahim

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=0;i<n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 1005;
const lo mod = 1000000007;

int m,k,flag,t,vis[li],no[li],fa[li],ofof[li];
int cev,ok[li];
string s;
vector<int> v[li],vec[li];

inline int dsu(int x){
	if(x==fa[x])return x;
	return fa[x]=dsu(fa[x]);
}

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	FOR fa[i]=i;
	std::vector<std::vector<int>> a;
	for (int i = 0; i < n; i++) {
		for(int j=0;j<n;j++){
			//~ if(i==j)continue;
			if(p[i][j]==3)return 0;
			if(p[i][j]!=0){v[i].pb(j);}
			if(i!=j && p[i][j]==1)flag=1;
		}
	}
	FOR sort(v[i].begin(),v[i].end());
	int say=0;
	FOR{
		if(ofof[i])continue;
		ofof[i]=1;
		for(int jj=0;jj<(int)v[i].size();jj++){
			ofof[v[i][jj]]=1;
			for(int j=0;j<jj;j++){
				if(p[v[i][jj]][v[i][j]]==1)no[v[i][jj]]=1;
			}
		}
	}
	FOR{
		if(vis[i])continue;
		vis[i]=++say;
		for(int jj=0;jj<(int)v[i].size();jj++){
			int go=v[i][jj];
			vis[go]=say;
			if(no[go]==0)vec[say].pb(go);
			
			if(v[go].size()!=v[i].size())return 0;
			//~ cout<<i<<": : "<<go<<endl;
			for(int ii=0;ii<(int)v[i].size();ii++){
				//~ cout<<go<<" "<<i<<" ** "<<v[go][ii]<<" : : "<<v[i][ii]<<endl;
				if(v[go][ii]!=v[i][ii])return 0;
			}
		}
	}
	for(int i=1;i<=say;i++)sort(vec[i].begin(),vec[i].end());
	
	for(int i=1;i<=say;i++){
		flag=0;
		for(int j=(int)vec[i].size()-1;j>=0;j--){
			for(int jj=0;jj<j;jj++){
				if(p[vec[i][j]][vec[i][jj]]==2 && no[jj]==0 && no[j]==0){ok[vec[i][j]]=1;ok[vec[i][jj]]=1;flag=1;break;}
			}
			if(flag)break;
		}
	}
	//~ if(flag==0){
		FOR{
			//~ cout<<i<<" ()() "<<ok[i]<<endl;
			vector<int> vv;
			int ind=0;
			while(ind<(int)vec[vis[i]].size() && vec[vis[i]][ind]!=i)ind++;
			//~ cout<<i<<" ** "<<vec[vis[i]][ind-1]<<"**"<<endl;
			if(vec[vis[i]].size()==2){return 0;}
			if(vec[vis[i]].size()==1){
				for(int j=0;j<n;j++){
					if(i==j){vv.pb(0);}
					else if(j<i)vv.pb(a[j][i]);
					else if(p[j][i]==1 && no[i]==0){vv.pb(1);fa[j]=i;}
					else if(j==fa[i]){vv.pb(1);}
					else if(no[i]){vv.pb(0);}
					else vv.pb(0);
				}
				a.pb(vv);
				continue;
			}
			for(int j=0;j<n;j++){
				if(i==j){vv.pb(0);}
				//~ else if(j<i)vv.pb(a[j][i]);
				//~ else if(p[j][i]==0){vv.pb(0);}
				else if(p[j][i]==1 && no[i]==0){vv.pb(1);fa[j]=i;}
				else if(j==fa[i]){vv.pb(1);}
				else if(no[i]){vv.pb(0);}
				else if(((ind>0 && j==vec[vis[i]][ind-1]) || (ind+1<(int)vec[vis[i]].size() && j==vec[vis[i]][ind+1])))vv.pb(1);
				else if((ind==0 && j==vec[vis[i]][(int)vec[vis[i]].size()-1]) || (ind==(int)vec[vis[i]].size()-1 && j==vec[vis[i]][0]))vv.pb(1);
				else vv.pb(0);
			}
			a.pb(vv);
		}
	//~ }
	
	build(a);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 13 ms 1536 KB Output is correct
7 Correct 267 ms 26232 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 13 ms 1536 KB Output is correct
7 Correct 267 ms 26232 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 243 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 131 ms 10744 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 244 ms 22776 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 262 ms 24312 KB Output is correct
24 Correct 244 ms 22392 KB Output is correct
25 Correct 107 ms 8824 KB Output is correct
26 Correct 99 ms 8312 KB Output is correct
27 Correct 267 ms 25336 KB Output is correct
28 Correct 238 ms 22264 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 248 ms 22264 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1536 KB Output is correct
13 Correct 270 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 126 ms 10744 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 61 ms 5880 KB Output is correct
22 Correct 244 ms 22648 KB Output is correct
23 Correct 246 ms 22264 KB Output is correct
24 Correct 267 ms 25228 KB Output is correct
25 Correct 107 ms 10616 KB Output is correct
26 Correct 109 ms 8824 KB Output is correct
27 Correct 245 ms 22396 KB Output is correct
28 Correct 264 ms 24312 KB Output is correct
29 Correct 100 ms 10488 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 61 ms 5880 KB Output is correct
5 Correct 247 ms 22784 KB Output is correct
6 Correct 242 ms 22264 KB Output is correct
7 Correct 260 ms 24184 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 60 ms 5880 KB Output is correct
10 Correct 248 ms 22776 KB Output is correct
11 Correct 250 ms 22264 KB Output is correct
12 Correct 270 ms 25336 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 62 ms 5888 KB Output is correct
17 Correct 250 ms 22648 KB Output is correct
18 Correct 249 ms 22648 KB Output is correct
19 Correct 254 ms 22392 KB Output is correct
20 Correct 240 ms 22264 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 13 ms 1536 KB Output is correct
7 Correct 267 ms 26232 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 243 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 131 ms 10744 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 244 ms 22776 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 262 ms 24312 KB Output is correct
24 Correct 244 ms 22392 KB Output is correct
25 Correct 107 ms 8824 KB Output is correct
26 Correct 99 ms 8312 KB Output is correct
27 Correct 267 ms 25336 KB Output is correct
28 Correct 238 ms 22264 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 248 ms 22264 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 12 ms 1536 KB Output is correct
41 Correct 270 ms 26232 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 126 ms 10744 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 244 ms 22648 KB Output is correct
51 Correct 246 ms 22264 KB Output is correct
52 Correct 267 ms 25228 KB Output is correct
53 Correct 107 ms 10616 KB Output is correct
54 Correct 109 ms 8824 KB Output is correct
55 Correct 245 ms 22396 KB Output is correct
56 Correct 264 ms 24312 KB Output is correct
57 Correct 100 ms 10488 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 6 ms 896 KB Output is correct
61 Correct 142 ms 12280 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 60 ms 5880 KB Output is correct
66 Correct 101 ms 8836 KB Output is correct
67 Correct 102 ms 8824 KB Output is correct
68 Correct 97 ms 8440 KB Output is correct
69 Correct 96 ms 8312 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 13 ms 1536 KB Output is correct
7 Correct 267 ms 26232 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 243 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 131 ms 10744 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 244 ms 22776 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 262 ms 24312 KB Output is correct
24 Correct 244 ms 22392 KB Output is correct
25 Correct 107 ms 8824 KB Output is correct
26 Correct 99 ms 8312 KB Output is correct
27 Correct 267 ms 25336 KB Output is correct
28 Correct 238 ms 22264 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 248 ms 22264 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 12 ms 1536 KB Output is correct
41 Correct 270 ms 26232 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 126 ms 10744 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 244 ms 22648 KB Output is correct
51 Correct 246 ms 22264 KB Output is correct
52 Correct 267 ms 25228 KB Output is correct
53 Correct 107 ms 10616 KB Output is correct
54 Correct 109 ms 8824 KB Output is correct
55 Correct 245 ms 22396 KB Output is correct
56 Correct 264 ms 24312 KB Output is correct
57 Correct 100 ms 10488 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 61 ms 5880 KB Output is correct
62 Correct 247 ms 22784 KB Output is correct
63 Correct 242 ms 22264 KB Output is correct
64 Correct 260 ms 24184 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 60 ms 5880 KB Output is correct
67 Correct 248 ms 22776 KB Output is correct
68 Correct 250 ms 22264 KB Output is correct
69 Correct 270 ms 25336 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 62 ms 5888 KB Output is correct
74 Correct 250 ms 22648 KB Output is correct
75 Correct 249 ms 22648 KB Output is correct
76 Correct 254 ms 22392 KB Output is correct
77 Correct 240 ms 22264 KB Output is correct
78 Correct 1 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 6 ms 896 KB Output is correct
81 Correct 142 ms 12280 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 60 ms 5880 KB Output is correct
86 Correct 101 ms 8836 KB Output is correct
87 Correct 102 ms 8824 KB Output is correct
88 Correct 97 ms 8440 KB Output is correct
89 Correct 96 ms 8312 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 5 ms 640 KB Output is correct
93 Correct 104 ms 8200 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 1 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 24 ms 2304 KB Output is correct
98 Correct 96 ms 8312 KB Output is correct
99 Correct 96 ms 8316 KB Output is correct
100 Correct 101 ms 8312 KB Output is correct
101 Correct 95 ms 8312 KB Output is correct
102 Correct 107 ms 8200 KB Output is correct
103 Correct 104 ms 8312 KB Output is correct
104 Correct 103 ms 8200 KB Output is correct
105 Correct 108 ms 8312 KB Output is correct