Submission #520713

#TimeUsernameProblemLanguageResultExecution timeMemory
520713peti1234Connecting Supertrees (IOI20_supertrees)C++17
11 / 100
162 ms23920 KiB
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	
	vector<vector<int>> valasz;
	valasz.resize(n);
	for (int i=0; i<n; i++) valasz[i].resize(n);
	
	for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            valasz[i][j]=(abs(i-j)==1 ? 1 : 0);
        }
	}

	build(valasz);
	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...