Submission #621142

#TimeUsernameProblemLanguageResultExecution timeMemory
621142Mr_HusanboyConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
193 ms23932 KiB
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int construct(vector<vector<int>> p) {
    //return 1;
	int n = p.size();
	vector<vector<int>> b(n,vector<int> (n));
    for(int i = 0; i < n; i ++){
        for(int j = 0; j < n; j ++){
            if(abs(i-j) == 1) b[i][j] = 1;
        }
    }
    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...