oj.uz

답안 #301967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
301967 2020-09-18T10:41:14 Z Trickster 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 295 ms 30200 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 P[N];
int n, ans;
int arr[N][N];
int pat[N][N];
vector <int> E;
int vis[N], vis2[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;

	P[b] = a;
	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] = (vis2[i] == 1 ? 2 : vis2[i]);
		if(pat[nd][i] == 0) 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;
		}
}
void upd(int nd)
{
	vis[nd] = 1;

	for(int i = 0; i < n; i++) {
		if(ata(i) == ata(nd)) continue;

		if(pat[nd][i] == 1) {
			if(vis[i] == 1) {
				ans = 1;
				return;
			}
			uni(nd, i);
		}
	}
}

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

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

	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(i == h) continue;
			if(p[i][h] == 1) vis2[h] = 2;
			if(p[i][h] == 2) vis2[h] = 1;
		}

		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;

			upd(h);
			last = h;
		}
		if(E.size() == 1) continue;

		arr[E[0]][last] = arr[last][E[0]] = 1;
	}
	if(ans == 1) return 0;

	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

# 결과 실행 시간 메모리 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 13 ms 2816 KB Output is correct
7 Correct 271 ms 30200 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 13 ms 2816 KB Output is correct
7 Correct 271 ms 30200 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 416 KB Output is correct
12 Correct 13 ms 2048 KB Output is correct
13 Correct 254 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 7 ms 2176 KB Output is correct
17 Correct 149 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 67 ms 9592 KB Output is correct
21 Correct 264 ms 30072 KB Output is correct
22 Correct 258 ms 29688 KB Output is correct
23 Correct 289 ms 30200 KB Output is correct
24 Correct 248 ms 26488 KB Output is correct
25 Correct 113 ms 16120 KB Output is correct
26 Correct 108 ms 15864 KB Output is correct
27 Correct 295 ms 30076 KB Output is correct
28 Correct 253 ms 26488 KB Output is correct

Subtask #3
0 / 19.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 1 ms 512 KB Output is correct
5 Correct 1 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 12 ms 2048 KB Output is correct
9 Correct 253 ms 26108 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 285 ms 30200 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1408 KB Output is correct
17 Correct 106 ms 12152 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Incorrect 1 ms 384 KB Answer gives possible 1 while actual possible 0
20 Halted 0 ms 0 KB -

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 1 ms 384 KB Output is correct
4 Correct 72 ms 9592 KB Output is correct
5 Correct 263 ms 30200 KB Output is correct
6 Correct 258 ms 29632 KB Output is correct
7 Correct 287 ms 30200 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 65 ms 9720 KB Output is correct
10 Correct 265 ms 30072 KB Output is correct
11 Correct 249 ms 30200 KB Output is correct
12 Correct 275 ms 30072 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Incorrect 43 ms 6008 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 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 13 ms 2816 KB Output is correct
7 Correct 271 ms 30200 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 416 KB Output is correct
12 Correct 13 ms 2048 KB Output is correct
13 Correct 254 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 7 ms 2176 KB Output is correct
17 Correct 149 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 67 ms 9592 KB Output is correct
21 Correct 264 ms 30072 KB Output is correct
22 Correct 258 ms 29688 KB Output is correct
23 Correct 289 ms 30200 KB Output is correct
24 Correct 248 ms 26488 KB Output is correct
25 Correct 113 ms 16120 KB Output is correct
26 Correct 108 ms 15864 KB Output is correct
27 Correct 295 ms 30076 KB Output is correct
28 Correct 253 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 1 ms 512 KB Output is correct
33 Correct 1 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 12 ms 2048 KB Output is correct
37 Correct 253 ms 26108 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 285 ms 30200 KB Output is correct
42 Correct 1 ms 512 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 1408 KB Output is correct
45 Correct 106 ms 12152 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Incorrect 1 ms 384 KB Answer gives possible 1 while actual possible 0
48 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 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 13 ms 2816 KB Output is correct
7 Correct 271 ms 30200 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 416 KB Output is correct
12 Correct 13 ms 2048 KB Output is correct
13 Correct 254 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 7 ms 2176 KB Output is correct
17 Correct 149 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 67 ms 9592 KB Output is correct
21 Correct 264 ms 30072 KB Output is correct
22 Correct 258 ms 29688 KB Output is correct
23 Correct 289 ms 30200 KB Output is correct
24 Correct 248 ms 26488 KB Output is correct
25 Correct 113 ms 16120 KB Output is correct
26 Correct 108 ms 15864 KB Output is correct
27 Correct 295 ms 30076 KB Output is correct
28 Correct 253 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 1 ms 512 KB Output is correct
33 Correct 1 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 12 ms 2048 KB Output is correct
37 Correct 253 ms 26108 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 285 ms 30200 KB Output is correct
42 Correct 1 ms 512 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 1408 KB Output is correct
45 Correct 106 ms 12152 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Incorrect 1 ms 384 KB Answer gives possible 1 while actual possible 0
48 Halted 0 ms 0 KB -