Submission #431164

#	Time	Username	Problem	Language	Result	Execution time	Memory
431164		MOUF_MAHMALAT	슈퍼트리 잇기 (IOI20_supertrees)	C++14	0 / 100	2 ms	332 KiB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
vector<vector<ll> >v;
ll n;
int construct(vector<vector<int> > p)
{
    n=p.size();
    v.resize(n);
    for(ll i=0; i<n; i++)
    {
        v[i].resize(n);
        if(i<n-1)
            v[i][i+1]=v[i+1][i]=1;
    }
    build(v);
    return 1;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4