Submission #1064889

#TimeUsernameProblemLanguageResultExecution timeMemory
1064889kkkkkkkkConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
109 ms23888 KiB
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

int construct(vector<vector<int> > paths) {
    int n=paths.size();
    vector<vector<int> > a=paths;
    for (int i=0;i<n;i++) {
        for (int j=0;j<n;j++) {
            if (j==i+1||i==j+1)
                a[i][j]=1;
            else a[i][j]=0;
        }
    }
    build(a);
    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...