Submission #805524

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
805524	2023-08-03T17:30:36 Z	Hydrolyzed	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	0 ms	288 KB

supertrees

#include "supertrees.h"
#include <vector>
#include <bitset>

using namespace std;

const int MxN = 1010;

bitset<MxN> done, in_tree;
vector<int> adj;

int construct(std::vector<std::vector<int>> p) {
	int n = (int) p.size();
	vector<vector<int>> building(n, vector<int> (n, 0));
	for(int i=0; i<=n-1; ++i) {
		if(done[i]) {
			continue;
		}
		adj.clear();
		for(int j=0; j<=n-1; ++j) {
			if(p[i][j] == 0) {
				continue;
			}
			adj.emplace_back(j);
			in_tree[j] = true;
		}
		for(auto from: adj) {
			for(int to=0; to<=n-1; ++to) {
				if((p[from][to] == 1 && !in_tree[to]) 
				|| (p[from][to] == 0 && in_tree[to])) {
					return 0;
				}
			}
		}
		for(auto x: adj) {
			in_tree[x] = false;
			done[x] = true;
		}
		for(int j=1; j<=(int)adj.size()-2; ++j) {
			building[adj[j-1]][adj[j]] = building[adj[j]][adj[j-1]] = 1;
		}
	}
	build(building);
	return 1;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 19.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Incorrect	212 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 KB	-