Submission #300250

#TimeUsernameProblemLanguageResultExecution timeMemory
300250easruiConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
252 ms22136 KiB
#include "supertrees.h"

#include <bits/stdc++.h>
#define va first
#define vb second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;
typedef pair<int,pii> pip;

const int MN = 2e5+5;
const int MOD = 1e9+7;
const int INF = 1e9;

int construct(std::vector<std::vector<int>> p) {
    int n = p.size();
	vector<vector<int>> ans(n);
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			ans[i].push_back(i==j+1||i==j-1);
		}
	}
	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...