oj.uz

답안 #300766

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300766 2020-09-17T13:16:34 Z Kerim 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 264 ms 22392 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
#define MAXN 1009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int vis[MAXN];
vector<int>adj[MAXN];
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}int mx=0;
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(i!=j)
				umax(mx,p[i][j]);
	if(mx==3)
		return 0;
	if(mx==0){
		build(answer);
		return 1;
	}
	vector<int>a; int cnt=0;
	for(int i=0;i<n;i++)
		if(!vis[i]){
			a.clear();
			vis[i]=++cnt;a.pb(i);	
			for(int j=i+1;j<n;j++)
				if(p[i][j]){
					if(vis[j])
						return 0;
					if(p[i][j]==2){
						int who=-1;
						tr(it,a)
							if(p[*it][j]==1){
								who=j;
								break;	
							}
						if(who==-1)
							a.pb(j);
						else
							answer[who][j]=answer[j][who]=1,adj[who].pb(j);
					}
					else
						answer[i][j]=answer[j][i]=1,adj[i].pb(j);
					vis[j]=cnt;
				}
			tr(it,a){
				for(int j=0;j<int(adj[*it].size());j++)
					for(int k=j+1;k<int(adj[*it].size());k++)
						if(p[adj[*it][j]][adj[*it][k]]!=1)
							return 0;	
			}
			for(int j=0;j<int(a.size());j++)
				for(int k=j+1;k<int(a.size());k++)
					for(int jj=0;jj<int(adj[a[j]].size());jj++)
						for(int kk=0;kk<int(adj[a[k]].size());kk++)
							if(p[adj[a[j]][jj]][adj[a[k]][kk]]!=2)
								return 0;
			if(int(a.size())==1)
				continue;
			if(int(a.size())==2)
				return 0;
			for(int j=0;j<int(a.size());j++)
				answer[a[j]][a[(j+1)%int(a.size())]]=answer[a[(j+1)%int(a.size())]][a[j]]=1;
		}
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if((vis[i]==vis[j] and !p[i][j]) or (p[i][j] and vis[i]!=vis[j]))
				return 0;
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 264 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 264 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 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 249 ms 22140 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 7 ms 768 KB Output is correct
17 Correct 117 ms 12148 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 67 ms 5880 KB Output is correct
21 Correct 243 ms 22132 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 256 ms 22136 KB Output is correct
24 Correct 256 ms 22136 KB Output is correct
25 Correct 127 ms 12152 KB Output is correct
26 Correct 104 ms 12152 KB Output is correct
27 Correct 252 ms 22132 KB Output is correct
28 Correct 243 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 230 ms 22136 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 247 ms 22264 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 112 ms 12156 KB Output is correct
18 Correct 0 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 60 ms 5880 KB Output is correct
22 Correct 241 ms 22136 KB Output is correct
23 Correct 236 ms 22108 KB Output is correct
24 Correct 248 ms 22136 KB Output is correct
25 Correct 105 ms 12132 KB Output is correct
26 Correct 104 ms 12152 KB Output is correct
27 Correct 240 ms 22264 KB Output is correct
28 Correct 247 ms 22128 KB Output is correct
29 Correct 109 ms 12152 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 62 ms 5864 KB Output is correct
5 Correct 250 ms 22392 KB Output is correct
6 Correct 240 ms 22264 KB Output is correct
7 Correct 253 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 62 ms 5880 KB Output is correct
10 Correct 242 ms 22136 KB Output is correct
11 Correct 241 ms 22140 KB Output is correct
12 Correct 251 ms 22136 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Incorrect 65 ms 5880 KB b[39][39] is not 0
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 264 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 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 249 ms 22140 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 7 ms 768 KB Output is correct
17 Correct 117 ms 12148 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 67 ms 5880 KB Output is correct
21 Correct 243 ms 22132 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 256 ms 22136 KB Output is correct
24 Correct 256 ms 22136 KB Output is correct
25 Correct 127 ms 12152 KB Output is correct
26 Correct 104 ms 12152 KB Output is correct
27 Correct 252 ms 22132 KB Output is correct
28 Correct 243 ms 22136 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 230 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 247 ms 22264 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 112 ms 12156 KB Output is correct
46 Correct 0 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 60 ms 5880 KB Output is correct
50 Correct 241 ms 22136 KB Output is correct
51 Correct 236 ms 22108 KB Output is correct
52 Correct 248 ms 22136 KB Output is correct
53 Correct 105 ms 12132 KB Output is correct
54 Correct 104 ms 12152 KB Output is correct
55 Correct 240 ms 22264 KB Output is correct
56 Correct 247 ms 22128 KB Output is correct
57 Correct 109 ms 12152 KB Output is correct
58 Correct 1 ms 288 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 111 ms 12152 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Incorrect 60 ms 5880 KB b[98][98] is not 0
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 264 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 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 249 ms 22140 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 7 ms 768 KB Output is correct
17 Correct 117 ms 12148 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 67 ms 5880 KB Output is correct
21 Correct 243 ms 22132 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 256 ms 22136 KB Output is correct
24 Correct 256 ms 22136 KB Output is correct
25 Correct 127 ms 12152 KB Output is correct
26 Correct 104 ms 12152 KB Output is correct
27 Correct 252 ms 22132 KB Output is correct
28 Correct 243 ms 22136 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 230 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 247 ms 22264 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 112 ms 12156 KB Output is correct
46 Correct 0 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 60 ms 5880 KB Output is correct
50 Correct 241 ms 22136 KB Output is correct
51 Correct 236 ms 22108 KB Output is correct
52 Correct 248 ms 22136 KB Output is correct
53 Correct 105 ms 12132 KB Output is correct
54 Correct 104 ms 12152 KB Output is correct
55 Correct 240 ms 22264 KB Output is correct
56 Correct 247 ms 22128 KB Output is correct
57 Correct 109 ms 12152 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 62 ms 5864 KB Output is correct
62 Correct 250 ms 22392 KB Output is correct
63 Correct 240 ms 22264 KB Output is correct
64 Correct 253 ms 22136 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 62 ms 5880 KB Output is correct
67 Correct 242 ms 22136 KB Output is correct
68 Correct 241 ms 22140 KB Output is correct
69 Correct 251 ms 22136 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Incorrect 65 ms 5880 KB b[39][39] is not 0
74 Halted 0 ms 0 KB -