제출 #304457

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
304457		SorahISA	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	240 ms	22136 KiB

supertrees

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

using pii = pair<int, int>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> ans(n, vector<int>(n, 0));
    for (auto vec : p) {
        for (auto x : vec) {
            if (x == 3) return 0;
        }
    }
    
    for (int i = 0; i < n-1; ++i) {
        ans[i][i+1] = ans[i+1][i] = 1;
    }
    
    build(ans);
    return 1;
}

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