제출 #303211

#제출 시각아이디문제언어결과실행 시간메모리
303211limabeansConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
250 ms22136 KiB
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;

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