oj.uz

Submission #301802

# Submission time Handle Problem Language Result Execution time Memory
301802 2020-09-18T08:21:32 Z Trickster Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 275 ms 30304 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;
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++) vis2[i] = max((pat[nd][i] == 1 ? 1 : 0), vis2[i]);

	for(int i = 0; i < n; i++)
		if(pat[nd][i] == 2 && !vis[i] && !vis2[i]) {
			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;

		memset(vis2, 0, sizeof(vis2));
		E.clear();
		dfs(i);

		if(E.size() == 2) return 0;

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

			last = h;
			for(int j = 0; j < n; j++)
				if(p[h][j] == 1 && h != j) {
					if(vis3[j]) return 0;
					uni(h, j);
				}
		}

		if(E.size() == 1) {
			for(int h = 0; h < n; h++) if(p[i][h] == 2) return 0;
			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 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 2816 KB Output is correct
7 Correct 261 ms 30072 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 2816 KB Output is correct
7 Correct 261 ms 30072 KB Output is correct
8 Correct 1 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 512 KB Output is correct
12 Correct 11 ms 2048 KB Output is correct
13 Correct 255 ms 26104 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 2176 KB Output is correct
17 Correct 120 ms 16120 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 65 ms 9696 KB Output is correct
21 Correct 255 ms 30072 KB Output is correct
22 Correct 254 ms 29540 KB Output is correct
23 Correct 275 ms 30200 KB Output is correct
24 Correct 250 ms 26576 KB Output is correct
25 Correct 102 ms 16120 KB Output is correct
26 Correct 109 ms 15608 KB Output is correct
27 Correct 275 ms 30204 KB Output is correct
28 Correct 245 ms 26360 KB Output is correct

Subtask #3
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 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 1 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 11 ms 2048 KB Output is correct
9 Correct 246 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 11 ms 2816 KB Output is correct
13 Correct 247 ms 30252 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Incorrect 1 ms 384 KB Answer gives possible 1 while actual possible 0
16 Halted 0 ms 0 KB -

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 1 ms 384 KB Output is correct
4 Correct 64 ms 9592 KB Output is correct
5 Correct 255 ms 30072 KB Output is correct
6 Correct 254 ms 29560 KB Output is correct
7 Correct 274 ms 30072 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 63 ms 9720 KB Output is correct
10 Correct 250 ms 30200 KB Output is correct
11 Correct 263 ms 30200 KB Output is correct
12 Correct 272 ms 30304 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Incorrect 1 ms 384 KB Answer gives possible 0 while actual possible 1
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 2816 KB Output is correct
7 Correct 261 ms 30072 KB Output is correct
8 Correct 1 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 512 KB Output is correct
12 Correct 11 ms 2048 KB Output is correct
13 Correct 255 ms 26104 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 2176 KB Output is correct
17 Correct 120 ms 16120 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 65 ms 9696 KB Output is correct
21 Correct 255 ms 30072 KB Output is correct
22 Correct 254 ms 29540 KB Output is correct
23 Correct 275 ms 30200 KB Output is correct
24 Correct 250 ms 26576 KB Output is correct
25 Correct 102 ms 16120 KB Output is correct
26 Correct 109 ms 15608 KB Output is correct
27 Correct 275 ms 30204 KB Output is correct
28 Correct 245 ms 26360 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 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 11 ms 2048 KB Output is correct
37 Correct 246 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 11 ms 2816 KB Output is correct
41 Correct 247 ms 30252 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Incorrect 1 ms 384 KB Answer gives possible 1 while actual possible 0
44 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 2816 KB Output is correct
7 Correct 261 ms 30072 KB Output is correct
8 Correct 1 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 512 KB Output is correct
12 Correct 11 ms 2048 KB Output is correct
13 Correct 255 ms 26104 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 2176 KB Output is correct
17 Correct 120 ms 16120 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 65 ms 9696 KB Output is correct
21 Correct 255 ms 30072 KB Output is correct
22 Correct 254 ms 29540 KB Output is correct
23 Correct 275 ms 30200 KB Output is correct
24 Correct 250 ms 26576 KB Output is correct
25 Correct 102 ms 16120 KB Output is correct
26 Correct 109 ms 15608 KB Output is correct
27 Correct 275 ms 30204 KB Output is correct
28 Correct 245 ms 26360 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 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 11 ms 2048 KB Output is correct
37 Correct 246 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 11 ms 2816 KB Output is correct
41 Correct 247 ms 30252 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Incorrect 1 ms 384 KB Answer gives possible 1 while actual possible 0
44 Halted 0 ms 0 KB -