Submission #302966

#TimeUsernameProblemLanguageResultExecution timeMemory
302966dolijanConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
257 ms22224 KiB
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

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