Submission #603431

#	Time	Username	Problem	Language	Result	Execution time	Memory
603431		Sam_a17	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	190 ms	21960 KiB

supertrees

// #include "A.cpp"
#include <bits/stdc++.h>
// #include <vector>
using namespace std;

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(x) cout << #x << " " << x << endl;

#define pb push_back
#define ld long double
#define ll long long

void build(std::vector<std::vector<int>> p);

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	bool allOne = true;
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) {
      if(p[i][j] != allOne) {
        allOne = false;
      }
    }
  }

  if(allOne) {
    vector<vector<int>> answ(n, vector<int> (n, 0));
    for(int i = 0; i < n - 1; i++){
      answ[i][i + 1] = 1;
      answ[i + 1][i] = 1;
    }
	  build(answ);
    return 1;
  }


	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