Submission #456160

#TimeUsernameProblemLanguageResultExecution timeMemory
456160KhizriConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
1 ms204 KiB
#include "supertrees.h"
#include <vector>

int construct(std::vector<std::vector<int>> arr) {
	int n = arr.size();
	std::vector<std::vector<int>> ans;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		ans.push_back(row);
	}
	for(int i=0;i<n-1;i++){
		ans[i][i+1]=1;
		ans[i+1][i]=1;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			ans[i][j]=arr[i][j];
		}
	}
	for(int i=0;i<n;i++){
		ans[i][i]=0;
	}
	build(ans);
	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...