Submission #302883

#TimeUsernameProblemLanguageResultExecution timeMemory
302883ivan24Connecting Supertrees (IOI20_supertrees)C++14
11 / 100
250 ms22136 KiB
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define F first
#define S second

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