Submission #393127

#TimeUsernameProblemLanguageResultExecution timeMemory
393127Carmel_Ab1Connecting Supertrees (IOI20_supertrees)C++17
11 / 100
243 ms22024 KiB
#include <bits/stdc++.h>
#include "supertrees.h"
//#include "grader.cpp"
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
int construct(vvi p) {
    int n = p.size();
    vvi ans(n,vi(n));

    for(int i=0; i<n-1; i++)
        ans[i][i+1]=ans[i+1][i]=1;
    build(ans);
    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...