Submission #421185

#TimeUsernameProblemLanguageResultExecution timeMemory
421185ApiramConnecting Supertrees (IOI20_supertrees)C++14
0 / 100
1 ms204 KiB
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>>answer(n,vector<int>(n,0));
	for (int i =0;i<n;++i){
		for (int j =0;j<n;++j){
		if (i!=j){
			if (p[i][j]>0){
			answer[i][j]=1;
			p[i][j]--;
			p[j][i]--;
			}
		}
		}
	}
	
	build(answer);
	return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...