oj.uz

Submission #800726

# Submission time Handle Problem Language Result Execution time Memory
800726 2023-08-01T19:14:19 Z MODDI Connecting Supertrees (IOI20_supertrees) C++14
0 / 100
 153 ms 22032 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;
	void init(int n){
		for(int i = 0; i < n; i++){
			parent.pb(i);
			size.pb(1);
		}
	}
	int find_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){
		a = find_parent(a);
		b = find_parent(b);
		if(a != b){
			if(size[b] > size[a])
				swap(a, b);
			
			parent[b] = a;
			size[a] += size[b];
		}
	}
};
int construct(vector<vi> p) {
	int n = p.size();
	vector<vi> answer(n, vi(n, 0));
	DSU dsu;
	dsu.init(n);
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			if(p[i][j] == 2)	dsu.merge(i, j);
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			if(dsu.find_parent(i) == dsu.find_parent(j) && p[i][j] == 0)	return 0;
		}
	}
	bool done[n];
	memset(done, false, sizeof done);
	for(int i = 0; i < n; i++){
		if(done[dsu.find_parent(i)])	continue;
		if(dsu.find_size(dsu.find_parent(i)) == 1)	continue;
		if(dsu.find_size(dsu.find_parent(i)) == 2)	return 0;
		done[dsu.find_parent(i)] = true;
		int first = -1, last = -1;
		for(int j = 0; j < n; j++){
			if(last == -1){
				last = j;
				first = j;
				continue;
			}
			if(dsu.find_parent(j) == dsu.find_parent(i)){
				answer[j][last] = 1;
				answer[last][j] = 1;
				last = j;
			}
		}
		answer[first][last] = 1;
		answer[last][first] = 1;
	}
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 153 ms 22024 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 1108 KB Output is correct
13 Correct 151 ms 22032 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 67 ms 14068 KB Output is correct
18 Correct 0 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 Incorrect 38 ms 6176 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
22 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Too few ways to get from 1 to 2, should be 1 found 0
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -