oj.uz

답안 #300667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300667 2020-09-17T11:26:28 Z Kerim 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 258 ms 22392 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
#define MAXN 100009
#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];
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++)
			umax(mx,p[i][j]);
	if(mx==0){
		build(answer);
		return 1;	
	}
	if(mx==1){
		int cnt=0;
		for(int i=0;i<n;i++)
			if(!vis[i]){vis[i]=++cnt;
				for(int j=i+1;j<n;j++)
					if(!vis[j] and p[i][j])
						answer[i][j]=answer[j][i]=1,vis[j]=cnt;
			}
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				if(p[i][j] and vis[i]!=vis[j])
					return 0;
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				if(vis[i]==vis[j] and !p[i][j])
					return 0;
		build(answer);
		return 1;
	}
	if(mx==2){
		vector<int>cur;int cnt=0;
		for(int i=0;i<n;i++)
			if(!vis[i]){
				cur.clear();
				vis[i]=++cnt;cur.pb(i);
				for(int j=i+1;j<n;j++)
					if(!vis[j] and p[i][j])
						vis[j]=cnt,cur.pb(j);
				if(int(cur.size())==1)
					continue;
				if(int(cur.size())==2)
					return 0;
				for(int j=0;j<int(cur.size());j++)
					answer[cur[j]][cur[(j+1)%int(cur.size())]]=answer[cur[(j+1)%int(cur.size())]][cur[j]]=1;
			}
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				if(p[i][j] and vis[i]!=vis[j])
					return 0;
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				if(vis[i]==vis[j] and !p[i][j])
					return 0;
		build(answer);
		return 1;
	}
	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 246 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 246 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 248 ms 22392 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 107 ms 12156 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 241 ms 22264 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 255 ms 22136 KB Output is correct
24 Correct 237 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 103 ms 12152 KB Output is correct
27 Correct 254 ms 22264 KB Output is correct
28 Correct 241 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 244 ms 22136 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 245 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 107 ms 12252 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 61 ms 5880 KB Output is correct
22 Correct 239 ms 22136 KB Output is correct
23 Correct 238 ms 22236 KB Output is correct
24 Correct 251 ms 22104 KB Output is correct
25 Correct 103 ms 12152 KB Output is correct
26 Correct 98 ms 12156 KB Output is correct
27 Correct 237 ms 22136 KB Output is correct
28 Correct 258 ms 22136 KB Output is correct
29 Correct 97 ms 12152 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 61 ms 5880 KB Output is correct
5 Correct 239 ms 22136 KB Output is correct
6 Correct 243 ms 22136 KB Output is correct
7 Correct 255 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 63 ms 5880 KB Output is correct
10 Correct 240 ms 22136 KB Output is correct
11 Correct 235 ms 22136 KB Output is correct
12 Correct 253 ms 22136 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Incorrect 1 ms 256 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 246 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 248 ms 22392 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 107 ms 12156 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 241 ms 22264 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 255 ms 22136 KB Output is correct
24 Correct 237 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 103 ms 12152 KB Output is correct
27 Correct 254 ms 22264 KB Output is correct
28 Correct 241 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 288 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 244 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 245 ms 22136 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 107 ms 12252 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 239 ms 22136 KB Output is correct
51 Correct 238 ms 22236 KB Output is correct
52 Correct 251 ms 22104 KB Output is correct
53 Correct 103 ms 12152 KB Output is correct
54 Correct 98 ms 12156 KB Output is correct
55 Correct 237 ms 22136 KB Output is correct
56 Correct 258 ms 22136 KB Output is correct
57 Correct 97 ms 12152 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 115 ms 12152 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Incorrect 1 ms 256 KB Too many ways to get from 0 to 9, should be 1 found no less than 2
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 246 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 248 ms 22392 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 107 ms 12156 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 241 ms 22264 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 255 ms 22136 KB Output is correct
24 Correct 237 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 103 ms 12152 KB Output is correct
27 Correct 254 ms 22264 KB Output is correct
28 Correct 241 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 288 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 244 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 245 ms 22136 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 107 ms 12252 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 239 ms 22136 KB Output is correct
51 Correct 238 ms 22236 KB Output is correct
52 Correct 251 ms 22104 KB Output is correct
53 Correct 103 ms 12152 KB Output is correct
54 Correct 98 ms 12156 KB Output is correct
55 Correct 237 ms 22136 KB Output is correct
56 Correct 258 ms 22136 KB Output is correct
57 Correct 97 ms 12152 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 61 ms 5880 KB Output is correct
62 Correct 239 ms 22136 KB Output is correct
63 Correct 243 ms 22136 KB Output is correct
64 Correct 255 ms 22136 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 63 ms 5880 KB Output is correct
67 Correct 240 ms 22136 KB Output is correct
68 Correct 235 ms 22136 KB Output is correct
69 Correct 253 ms 22136 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Incorrect 1 ms 256 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -