Submission #421181

#TimeUsernameProblemLanguageResultExecution timeMemory
421181ApiramConnecting Supertrees (IOI20_supertrees)C++14
0 / 100
1 ms216 KiB
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<std::vector<int>> p) {
	int n = p.size();
	for (int i =0;i<n;++i){
	p[i][i]=0;
	}
	vector<vector<int>>answer(n,vector<int>(n,0));
	for (int i =0;i<n;++i){
		for (int j =0;j<n;++j){
		if (p[i][j]>0){
		answer[i][j]=1;
		answer[j][i]=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...