Submission #622305

#	Time	Username	Problem	Language	Result	Execution time	Memory
622305		happypotato	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	212 ms	23924 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back
//
int n;
bool st1() {
    vector<vector<int>> ans;
    ans.resize(n);
    for (int i = 0; i < n; i++) ans[i].resize(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            ans[i][j] = (abs(i - j) == 1);
        }
    }
    build(ans);
    return true;
}
int construct(vector<vector<int>> p) {
    n = p.size();
    int st = 0;
    for (vector<int> &curv : p) {
        for (int &cur : curv) {
            st |= (1 << cur);
        }
    }
    if (st == 2) return st1();
    return 0;
}

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