Submission #768969

#	Time	Username	Problem	Language	Result	Execution time	Memory
768969		marvinthang	Connecting Supertrees (IOI20_supertrees)	C++17	100 / 100	180 ms	24020 KiB

supertrees

/*************************************
*    author: marvinthang             *
*    created: 29.06.2023 10:13:34    *
*************************************/

#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

int construct(vector <vector <int>> p) {
	int n = p.size();
	REP(i, n) REP(j, n) if (p[i][j] == 3) return 0;
	vector <bool> isRoot(n, true);
	vector <vector <int>> e(n, vector<int>(n));
	REP(i, n) {
		REP(j, i) if (p[i][j] == 1) {
			if (p[i] != p[j]) return 0;
			e[i][j] = e[j][i] = 1;
			isRoot[i] = false;
			break;
		}
	}
	REP(i, n) if (isRoot[i]) {
		int last = i;
		FOR(j, i + 1, n) if (isRoot[j] && p[i][j] == 2) {
			isRoot[j] = false;
			REP(k, n) if ((p[i][k] == 2 && p[j][k] == 0) || (p[i][k] == 0 && p[j][k] == 2)) return 0;
			e[last][j] = e[j][last] = 1;
			last = j;
		}
		if (last != i) {
			if (e[i][last]) return 0;
			e[i][last] = e[last][i] = 1;
		}
	}
	build(e);
	return 1;
}

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