Submission #440270

#	Time	Username	Problem	Language	Result	Execution time	Memory
440270		MohamedAliSaidane	슈퍼트리 잇기 (IOI20_supertrees)	C++14	0 / 100	1 ms	372 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define popb pop_back
#define ff first
#define ss second

int construct(vector<vi> p) {
	int n = p.size();
	vector<vi> b;
	for (int i = 0; i < n; i++) {
		vi row;
		for(int j = 0; j <n; j ++)
            row.pb(0);
		b.pb(row);
	}
	for(int i = 0; i < n; i ++)
    {
        b[i][i+1] = 1;
        b[i+1][i] = 1;
    }
	build(b);
	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