oj.uz

Submission #301907

# Submission time Handle Problem Language Result Execution time Memory
301907 2020-09-18T09:32:51 Z Trickster Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 303 ms 30328 KB 
#include "supertrees.h"
#include <algorithm>
#include <string.h>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
#include <map>

using namespace std;

#define N 1010
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mod 1000000007
#define pii pair <int, int>
#define sz(a) int(a.size())
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
ll bigmod(ll a,ll e) {if(e==0)return 1;ll x=bigmod(a*a%mod,e>>1);return e&1?x*a%mod:x;}

int n, ans;
int vis[N];
int vis2[N];
int vis3[N];
int arr[N][N];
int pat[N][N];
vector <int> E;
int P[N], sz[N];

int ata(int x)
{
	if(x == P[x]) return x;

	return P[x] = ata(P[x]);
}

void uni(int a, int b)
{
	a = ata(a);
	b = ata(b);

	if(a == b) return;

	if(sz[a] < sz[b]) swap(a, b);

	P[b] = a, sz[a] += sz[b], sz[b] = 0;
	
	arr[a][b] = arr[b][a] = 1;
}

void dfs(int nd)
{
	E.pb(nd);
	vis[nd] = 1;

	for(int i = 0; i < n; i++) if(i != nd) {
		if(pat[nd][i] == 1) vis2[i] = 2;
		else if(pat[nd][i] != 2) vis2[i] = 0;
	}

	for(int i = 0; i < n; i++)
		if(pat[nd][i] == 2 && !vis[i]) {
			if(vis2[i] != 1) {
				if(vis2[i] == 2) continue;
				
				ans = 1;
				return;
			}
			dfs(i);
			return;
		}
}

int construct(vector<vector<int>> p) {
	n = p.size();

	for(int i = 0; i < n; i++) P[i] = i, sz[i] = 1;

	for(int i = 0; i < n; i++)
		for(int h = 0; h < n; h++) {
			pat[i][h] = p[i][h];
			
			if(p[i][h] == 3) return 0;
		}
	
	for(int i = 0; i < n; i++) {
		if(vis[i]) continue;

		E.clear();
		memset(vis2, 0, sizeof(vis2));
		for(int h = 0; h < n; h++) {
			if(p[i][h] == 1) vis2[h] = 2;
			else if(p[i][h] != 2) vis2[h] = 0;
			else vis2[h] = 1; 
		}

		dfs(i);

		if(ans == 1 || E.size() == 2) return 0;

		int last = -1;
		for(auto h: E) {
			if(last != -1) arr[last][h] = arr[h][last] = 1;

			last = h;
			vis3[h] = 1;
			for(int j = 0; j < n; j++)
				if(p[h][j] == 1 && h != j) {
					if(ata(j) == ata(h)) continue;

					if(vis3[j]) return 0;
					vis3[j] = 1;
					uni(h, j);
				}
		}

		if(E.size() == 1) continue;

		arr[E[0]][last] = arr[last][E[0]] = 1;
	}

	for(int i = 0; i < n; i++)
		for(int h = 0; h < n; h++)
			if(!p[i][h] && ata(i) == ata(h)) return 0;

	vector <vector <int>> ret;
	ret.resize(n);
	for(int i = 0; i < n; i++)
		for(int h = 0; h < n; h++)
			ret[i].pb(arr[i][h]);
	
	build(ret);
	return 1;
}

Compilation message

supertrees.cpp:23: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
   23 | #pragma GCC optimization ("O3")
      | 
supertrees.cpp:24: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
   24 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 2816 KB Output is correct
7 Correct 266 ms 30200 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 2816 KB Output is correct
7 Correct 266 ms 30200 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 2048 KB Output is correct
13 Correct 245 ms 26232 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 2272 KB Output is correct
17 Correct 113 ms 14204 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 66 ms 9620 KB Output is correct
21 Correct 269 ms 30200 KB Output is correct
22 Correct 266 ms 29660 KB Output is correct
23 Correct 283 ms 30076 KB Output is correct
24 Correct 255 ms 26464 KB Output is correct
25 Correct 116 ms 16120 KB Output is correct
26 Correct 108 ms 14328 KB Output is correct
27 Correct 280 ms 30200 KB Output is correct
28 Correct 249 ms 26488 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory 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 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 11 ms 2048 KB Output is correct
9 Correct 248 ms 26232 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 2816 KB Output is correct
13 Correct 261 ms 30328 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 1408 KB Output is correct
17 Correct 113 ms 12152 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 64 ms 9688 KB Output is correct
22 Correct 261 ms 30200 KB Output is correct
23 Correct 255 ms 30200 KB Output is correct
24 Correct 275 ms 30088 KB Output is correct
25 Correct 103 ms 12408 KB Output is correct
26 Correct 108 ms 12920 KB Output is correct
27 Correct 248 ms 30044 KB Output is correct
28 Correct 265 ms 30200 KB Output is correct
29 Correct 107 ms 12408 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory 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 71 ms 9592 KB Output is correct
5 Correct 262 ms 30200 KB Output is correct
6 Correct 252 ms 29560 KB Output is correct
7 Correct 303 ms 30072 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 64 ms 9720 KB Output is correct
10 Correct 250 ms 30072 KB Output is correct
11 Correct 250 ms 30016 KB Output is correct
12 Correct 266 ms 30072 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 27 ms 6008 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory 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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 2816 KB Output is correct
7 Correct 266 ms 30200 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 2048 KB Output is correct
13 Correct 245 ms 26232 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 2272 KB Output is correct
17 Correct 113 ms 14204 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 66 ms 9620 KB Output is correct
21 Correct 269 ms 30200 KB Output is correct
22 Correct 266 ms 29660 KB Output is correct
23 Correct 283 ms 30076 KB Output is correct
24 Correct 255 ms 26464 KB Output is correct
25 Correct 116 ms 16120 KB Output is correct
26 Correct 108 ms 14328 KB Output is correct
27 Correct 280 ms 30200 KB Output is correct
28 Correct 249 ms 26488 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 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 512 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 2048 KB Output is correct
37 Correct 248 ms 26232 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 2816 KB Output is correct
41 Correct 261 ms 30328 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 1408 KB Output is correct
45 Correct 113 ms 12152 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 64 ms 9688 KB Output is correct
50 Correct 261 ms 30200 KB Output is correct
51 Correct 255 ms 30200 KB Output is correct
52 Correct 275 ms 30088 KB Output is correct
53 Correct 103 ms 12408 KB Output is correct
54 Correct 108 ms 12920 KB Output is correct
55 Correct 248 ms 30044 KB Output is correct
56 Correct 265 ms 30200 KB Output is correct
57 Correct 107 ms 12408 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 1408 KB Output is correct
61 Correct 110 ms 12124 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Incorrect 27 ms 6016 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory 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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 2816 KB Output is correct
7 Correct 266 ms 30200 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 2048 KB Output is correct
13 Correct 245 ms 26232 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 2272 KB Output is correct
17 Correct 113 ms 14204 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 66 ms 9620 KB Output is correct
21 Correct 269 ms 30200 KB Output is correct
22 Correct 266 ms 29660 KB Output is correct
23 Correct 283 ms 30076 KB Output is correct
24 Correct 255 ms 26464 KB Output is correct
25 Correct 116 ms 16120 KB Output is correct
26 Correct 108 ms 14328 KB Output is correct
27 Correct 280 ms 30200 KB Output is correct
28 Correct 249 ms 26488 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 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 512 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 2048 KB Output is correct
37 Correct 248 ms 26232 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 2816 KB Output is correct
41 Correct 261 ms 30328 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 1408 KB Output is correct
45 Correct 113 ms 12152 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 64 ms 9688 KB Output is correct
50 Correct 261 ms 30200 KB Output is correct
51 Correct 255 ms 30200 KB Output is correct
52 Correct 275 ms 30088 KB Output is correct
53 Correct 103 ms 12408 KB Output is correct
54 Correct 108 ms 12920 KB Output is correct
55 Correct 248 ms 30044 KB Output is correct
56 Correct 265 ms 30200 KB Output is correct
57 Correct 107 ms 12408 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 71 ms 9592 KB Output is correct
62 Correct 262 ms 30200 KB Output is correct
63 Correct 252 ms 29560 KB Output is correct
64 Correct 303 ms 30072 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 64 ms 9720 KB Output is correct
67 Correct 250 ms 30072 KB Output is correct
68 Correct 250 ms 30016 KB Output is correct
69 Correct 266 ms 30072 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 27 ms 6008 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -