제출 #301252

#제출 시각아이디문제언어결과실행 시간메모리
301252qiangbao슈퍼트리 잇기 (IOI20_supertrees)C++14
11 / 100
243 ms22136 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 1;
}

//int main()
//{
//    construct({{1, 1, 1}, {1, 1, 1}, {1, 1, 1}});
//
//    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...