Submission #362785

#TimeUsernameProblemLanguageResultExecution timeMemory
362785mathking1021Connecting Supertrees (IOI20_supertrees)C++17
11 / 100
247 ms24096 KiB
#include "supertrees.h"
#include <vector>

using namespace std;

int construct(vector<vector<int> > p) {
	int n = p.size();
	vector<vector<int> > answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		for(int j = 0; j < n; j++)
        {
            if(i == j - 1 || i == j + 1) row.push_back(1);
            else row.push_back(0);
        }
		answer.push_back(row);
	}
	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...