Submission #301248

#TimeUsernameProblemLanguageResultExecution timeMemory
301248qiangbaoConnecting Supertrees (IOI20_supertrees)C++14
0 / 100
1 ms256 KiB
#include <iostream>
#include <vector>
#include "supertrees.h"

#define pb push_back

using namespace std;

int n;

vector<int> plamt;
vector<vector<int> > ans;

int construct(vector<vector<int> > p)
{
    int i;
    
    n=p.size();
    for(i=0;i<n;i++)
        plamt.pb(0);
    for(i=0;i<n;i++)
        ans.pb(plamt);
    
    for(i=2;i<=n;i++)
        ans[0][i-1]=ans[i-1][0]=1;
    
    build(ans);
    
    return 0;
}
#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...