Submission #301614

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
301614	2020-09-18T05:21:04 Z	Bill_00	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1 ms	512 KB

supertrees

#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int u[10001];
vector<int>v[10001];
int construct(vector<vector<int> > p) {
	int n = p.size();
	vector<vector<int> > answer;
	answer.resize(n);
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		for(int j=0;j<n;j++){
			row[j]=0;
		}
		answer[i]=row;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(p[i][j]==3){
				return 0;
			}
		}
	}
	int o=0;
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			if(u[i]!=u[j] && p[i][j]!=0){
				return 0;
			}
		}
		if(u[i]==0){
			o++;
			u[i]=o;
		} 
		for(int j=i;j<n;j++){
			if(p[i][j]!=0){
				u[j]=u[i];
			}
		}
	}
	for(int i=0;i<n;i++){
		v[u[i]].push_back(i);
	}
	/*for(int i=1;i<=o;i++){
		vector<int>group;
		vector<int>core;
		for(int j=0;j<v[i].size();j++){
			int flag=0;
			for(int k=0;k<v[i].size();k++){
				if(j==k) continue;
				if(p[v[i][j]][v[i][k]]==1){
					flag++;
				}
			}
			if(flag){
				group.push_back(v[i][j]);
			}
			else core.push_back(v[i][j]);
		}
		for(int j=0;j<group.size();j++){
			for(int k=0;k<group.size();k++){
				if(p[group[j]][group[k]]==2) return 0;
			}
		}
		core.push_back(group[0]);
		for(int j=0;j<group.size()-1;j++){
			answer[group[j]][group[j+1]]=1;
			answer[group[j+1]][group[j]]=1;
		}
		for(int j=0;j<core.size();j++){
			answer[core[j]][core[(j+1)%(core.size())]]=1;
			answer[core[(j+1)%(core.size())]][core[j]]=1;		
		}
	}*/
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Incorrect	1 ms	512 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	1 ms	512 KB	Output is correct
2	Incorrect	1 ms	512 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	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Incorrect	1 ms	512 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-