oj.uz

Submission #300696

# Submission time Handle Problem Language Result Execution time Memory
300696 2020-09-17T12:09:14 Z Kerim Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 264 ms 22264 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++)
			if(i!=j)
				umax(mx,p[i][j]);
	if(mx==3)
		return 0;
	if(mx==0){
		build(answer);
		return 1;
	}
	vector<int>cur; int cnt=0;
	for(int i=0;i<n;i++)
		if(!vis[i]){
			debug(i);
			cur.clear();
			vis[i]=++cnt;cur.pb(i);
			for(int j=i+1;j<n;j++)
				if(!vis[j] and p[i][j]){
					if(p[i][j]==2)
						cur.pb(j);
					else
						answer[i][j]=answer[j][i]=1;
					vis[j]=cnt;
				}
			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;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 288 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 14 ms 1280 KB Output is correct
7 Correct 236 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 288 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 14 ms 1280 KB Output is correct
7 Correct 236 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 16 ms 1152 KB Output is correct
13 Correct 233 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 116 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 251 ms 22136 KB Output is correct
22 Correct 246 ms 22168 KB Output is correct
23 Correct 251 ms 22232 KB Output is correct
24 Correct 264 ms 22120 KB Output is correct
25 Correct 98 ms 12152 KB Output is correct
26 Correct 103 ms 12124 KB Output is correct
27 Correct 247 ms 22136 KB Output is correct
28 Correct 255 ms 22264 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 16 ms 1152 KB Output is correct
9 Correct 236 ms 22112 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 247 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 12156 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 62 ms 5880 KB Output is correct
22 Correct 244 ms 22108 KB Output is correct
23 Correct 241 ms 22108 KB Output is correct
24 Correct 247 ms 22136 KB Output is correct
25 Correct 105 ms 12280 KB Output is correct
26 Correct 98 ms 12152 KB Output is correct
27 Correct 253 ms 22088 KB Output is correct
28 Correct 255 ms 22136 KB Output is correct
29 Correct 105 ms 12248 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 64 ms 5880 KB Output is correct
5 Correct 251 ms 22092 KB Output is correct
6 Correct 242 ms 22136 KB Output is correct
7 Correct 254 ms 22044 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 61 ms 5752 KB Output is correct
10 Correct 241 ms 22136 KB Output is correct
11 Correct 238 ms 22136 KB Output is correct
12 Correct 251 ms 22232 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Incorrect 61 ms 5880 KB Too many ways to get from 23 to 253, should be 1 found no less than 2
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 288 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 14 ms 1280 KB Output is correct
7 Correct 236 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 16 ms 1152 KB Output is correct
13 Correct 233 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 116 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 251 ms 22136 KB Output is correct
22 Correct 246 ms 22168 KB Output is correct
23 Correct 251 ms 22232 KB Output is correct
24 Correct 264 ms 22120 KB Output is correct
25 Correct 98 ms 12152 KB Output is correct
26 Correct 103 ms 12124 KB Output is correct
27 Correct 247 ms 22136 KB Output is correct
28 Correct 255 ms 22264 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 16 ms 1152 KB Output is correct
37 Correct 236 ms 22112 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 247 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 12156 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 512 KB Output is correct
49 Correct 62 ms 5880 KB Output is correct
50 Correct 244 ms 22108 KB Output is correct
51 Correct 241 ms 22108 KB Output is correct
52 Correct 247 ms 22136 KB Output is correct
53 Correct 105 ms 12280 KB Output is correct
54 Correct 98 ms 12152 KB Output is correct
55 Correct 253 ms 22088 KB Output is correct
56 Correct 255 ms 22136 KB Output is correct
57 Correct 105 ms 12248 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 5 ms 896 KB Output is correct
61 Correct 111 ms 12152 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 Incorrect 66 ms 5880 KB Too many ways to get from 11 to 175, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 288 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 14 ms 1280 KB Output is correct
7 Correct 236 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 16 ms 1152 KB Output is correct
13 Correct 233 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 116 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 251 ms 22136 KB Output is correct
22 Correct 246 ms 22168 KB Output is correct
23 Correct 251 ms 22232 KB Output is correct
24 Correct 264 ms 22120 KB Output is correct
25 Correct 98 ms 12152 KB Output is correct
26 Correct 103 ms 12124 KB Output is correct
27 Correct 247 ms 22136 KB Output is correct
28 Correct 255 ms 22264 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 16 ms 1152 KB Output is correct
37 Correct 236 ms 22112 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 247 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 12156 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 512 KB Output is correct
49 Correct 62 ms 5880 KB Output is correct
50 Correct 244 ms 22108 KB Output is correct
51 Correct 241 ms 22108 KB Output is correct
52 Correct 247 ms 22136 KB Output is correct
53 Correct 105 ms 12280 KB Output is correct
54 Correct 98 ms 12152 KB Output is correct
55 Correct 253 ms 22088 KB Output is correct
56 Correct 255 ms 22136 KB Output is correct
57 Correct 105 ms 12248 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 64 ms 5880 KB Output is correct
62 Correct 251 ms 22092 KB Output is correct
63 Correct 242 ms 22136 KB Output is correct
64 Correct 254 ms 22044 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 61 ms 5752 KB Output is correct
67 Correct 241 ms 22136 KB Output is correct
68 Correct 238 ms 22136 KB Output is correct
69 Correct 251 ms 22232 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Incorrect 61 ms 5880 KB Too many ways to get from 23 to 253, should be 1 found no less than 2
74 Halted 0 ms 0 KB -