oj.uz

답안 #794221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
794221 2023-07-26T11:02:11 Z MODDI 슈퍼트리 잇기 (IOI20_supertrees) C++14
40 / 100
 180 ms 24020 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
struct DSU{
	vi parent, size;
	vector<bool> kec, dvojka;
	void init(int n){
		kec.resize(n, false);
		dvojka.resize(n, false);
		for(int i = 0; i < n; i++){
			parent.pb(i);
			size.pb(1);
		}
	}
	bool ok(int v){
		if(dvojka[v] && kec[v])	return false;
		return true;
	}
	bool is_dva(int v){
		return dvojka[v];
	}
	int get_size(int v){
		return size[v];
	}
	int find_parent(int v){
		if(parent[v] == v)	return v;
		return parent[v] = find_parent(parent[v]);
	}
	void merge(int a, int b, int tip){
		a = find_parent(a);
		b = find_parent(b);
		bool done = false;
		if(a != b){
			if(size[b] > size[a])
				swap(a, b);
			
			done = true;
			if(tip == 1)	kec[a] = true;
			if(tip == 2)	dvojka[a] = true;	
			parent[b] = a;
			size[a] += size[b];
		}
		if(!done){
			if(tip == 1)	kec[a] = true;
			if(tip == 2) 	dvojka[a] = true;
		}
	}
};
int construct(vector<vi> p) {
	int n = p.size();
	vector<vi> answer;
	bool possible = true;
	for(int i = 0; i < n; i++){
		for(auto t : p[i]){
			if(t == 3)	possible = false;
		}
	}
	for(int i = 0; i < n; i++){
		vi pom(n,0);
		answer.pb(pom);
	}
	DSU dsu;
	dsu.init(n);
	for(int i = 0; i < n; i++){
		for(int j = i+1; j < n; j++){
			if(p[i][j]>=1 && p[i][j]<=2){
				dsu.merge(i, j, p[i][j]);
				dsu.merge(j, i, p[i][j]);
			}
			else
				continue;
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			if(p[i][j] == 0 && dsu.find_parent(i) == dsu.find_parent(j)){
				possible = false;
			}
		}
	}
	for(int i = 0; i < n; i++){
		int a = dsu.find_parent(i);
		if(!dsu.ok(a))
			possible = false;
	}
	int last[n], first[n];
	memset(first, -1, sizeof first);
	memset(last, -1, sizeof last);
	for(int i = 0; i < n; i++){
		int a = dsu.find_parent(i);
		if(last[a] == -1){	
			last[a] = i;
			first[a] = i;
		}
		else{
			answer[i][last[a]] = 1;
			answer[last[a]][i] = 1;
			last[a] = i;
		}
	}
	for(int i = 0; i < n; i++){
		int a = dsu.find_parent(i);
		if(dsu.is_dva(a) && first[a] != last[a] && dsu.get_size(a) > 2){
			answer[first[a]][last[a]] = 1;
			answer[last[a]][first[a]] = 1;
 		}
 		else if(dsu.is_dva(a) && dsu.get_size(a) <=2)possible=false;
	}
	if(!possible)	return 0;
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1152 KB Output is correct
7 Correct 171 ms 22028 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1152 KB Output is correct
7 Correct 171 ms 22028 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1096 KB Output is correct
13 Correct 172 ms 22012 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 107 ms 12040 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 42 ms 5684 KB Output is correct
21 Correct 168 ms 21964 KB Output is correct
22 Correct 169 ms 22036 KB Output is correct
23 Correct 174 ms 22028 KB Output is correct
24 Correct 170 ms 22080 KB Output is correct
25 Correct 78 ms 12044 KB Output is correct
26 Correct 76 ms 12040 KB Output is correct
27 Correct 174 ms 22012 KB Output is correct
28 Correct 164 ms 22028 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 7 ms 1208 KB Output is correct
9 Correct 166 ms 24020 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1176 KB Output is correct
13 Correct 171 ms 24008 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 89 ms 14080 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 42 ms 6256 KB Output is correct
22 Correct 172 ms 23960 KB Output is correct
23 Correct 168 ms 23924 KB Output is correct
24 Correct 178 ms 23924 KB Output is correct
25 Correct 77 ms 14080 KB Output is correct
26 Correct 79 ms 14032 KB Output is correct
27 Correct 166 ms 23992 KB Output is correct
28 Correct 180 ms 24012 KB Output is correct
29 Correct 76 ms 14112 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 47 ms 5696 KB Output is correct
5 Correct 166 ms 22048 KB Output is correct
6 Correct 164 ms 22028 KB Output is correct
7 Correct 175 ms 22028 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 42 ms 5688 KB Output is correct
10 Correct 168 ms 22028 KB Output is correct
11 Correct 175 ms 22056 KB Output is correct
12 Correct 174 ms 22032 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1152 KB Output is correct
7 Correct 171 ms 22028 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1096 KB Output is correct
13 Correct 172 ms 22012 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 107 ms 12040 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 42 ms 5684 KB Output is correct
21 Correct 168 ms 21964 KB Output is correct
22 Correct 169 ms 22036 KB Output is correct
23 Correct 174 ms 22028 KB Output is correct
24 Correct 170 ms 22080 KB Output is correct
25 Correct 78 ms 12044 KB Output is correct
26 Correct 76 ms 12040 KB Output is correct
27 Correct 174 ms 22012 KB Output is correct
28 Correct 164 ms 22028 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 7 ms 1208 KB Output is correct
37 Correct 166 ms 24020 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 8 ms 1176 KB Output is correct
41 Correct 171 ms 24008 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 300 KB Output is correct
44 Correct 5 ms 852 KB Output is correct
45 Correct 89 ms 14080 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 42 ms 6256 KB Output is correct
50 Correct 172 ms 23960 KB Output is correct
51 Correct 168 ms 23924 KB Output is correct
52 Correct 178 ms 23924 KB Output is correct
53 Correct 77 ms 14080 KB Output is correct
54 Correct 79 ms 14032 KB Output is correct
55 Correct 166 ms 23992 KB Output is correct
56 Correct 180 ms 24012 KB Output is correct
57 Correct 76 ms 14112 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 296 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 95 ms 14064 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Incorrect 20 ms 3668 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1152 KB Output is correct
7 Correct 171 ms 22028 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1096 KB Output is correct
13 Correct 172 ms 22012 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 107 ms 12040 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 42 ms 5684 KB Output is correct
21 Correct 168 ms 21964 KB Output is correct
22 Correct 169 ms 22036 KB Output is correct
23 Correct 174 ms 22028 KB Output is correct
24 Correct 170 ms 22080 KB Output is correct
25 Correct 78 ms 12044 KB Output is correct
26 Correct 76 ms 12040 KB Output is correct
27 Correct 174 ms 22012 KB Output is correct
28 Correct 164 ms 22028 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 7 ms 1208 KB Output is correct
37 Correct 166 ms 24020 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 8 ms 1176 KB Output is correct
41 Correct 171 ms 24008 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 300 KB Output is correct
44 Correct 5 ms 852 KB Output is correct
45 Correct 89 ms 14080 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 42 ms 6256 KB Output is correct
50 Correct 172 ms 23960 KB Output is correct
51 Correct 168 ms 23924 KB Output is correct
52 Correct 178 ms 23924 KB Output is correct
53 Correct 77 ms 14080 KB Output is correct
54 Correct 79 ms 14032 KB Output is correct
55 Correct 166 ms 23992 KB Output is correct
56 Correct 180 ms 24012 KB Output is correct
57 Correct 76 ms 14112 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 47 ms 5696 KB Output is correct
62 Correct 166 ms 22048 KB Output is correct
63 Correct 164 ms 22028 KB Output is correct
64 Correct 175 ms 22028 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 42 ms 5688 KB Output is correct
67 Correct 168 ms 22028 KB Output is correct
68 Correct 175 ms 22056 KB Output is correct
69 Correct 174 ms 22032 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
73 Halted 0 ms 0 KB -