Submission #1148570

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148570		zhasyn	슈퍼트리 잇기 (IOI20_supertrees)	C++20	0 / 100	0 ms	324 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 1e6 + 100, M = 4096 + 10, len = 21, inf = 1e18;
const ll mod = 1e9 + 7;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		if(i == 1){
			for(int j = 1; j < n; j++){
				row[j] = 1;
			}
		} else row[0] = 1;
		answer.push_back(row);
	}
	build(answer);
	return 1;
}

// int main() {
  // ios::sync_with_stdio(false);
  // cin.tie(NULL);
//   
//   
  // return 0;
// }

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