oj.uz

Submission #768969

# Submission time Handle Problem Language Result Execution time Memory
768969 2023-06-29T03:26:54 Z marvinthang Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 180 ms 24020 KB 
/*************************************
*    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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 157 ms 23924 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 157 ms 23924 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 152 ms 23936 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 68 ms 14192 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 38 ms 6140 KB Output is correct
21 Correct 151 ms 23936 KB Output is correct
22 Correct 157 ms 23920 KB Output is correct
23 Correct 180 ms 23880 KB Output is correct
24 Correct 152 ms 23940 KB Output is correct
25 Correct 63 ms 13988 KB Output is correct
26 Correct 59 ms 14068 KB Output is correct
27 Correct 154 ms 24004 KB Output is correct
28 Correct 157 ms 23940 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 7 ms 1236 KB Output is correct
9 Correct 172 ms 23936 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1212 KB Output is correct
13 Correct 151 ms 23976 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 72 ms 14072 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 38 ms 6144 KB Output is correct
22 Correct 153 ms 23896 KB Output is correct
23 Correct 154 ms 23980 KB Output is correct
24 Correct 160 ms 23912 KB Output is correct
25 Correct 62 ms 14068 KB Output is correct
26 Correct 62 ms 14068 KB Output is correct
27 Correct 150 ms 23928 KB Output is correct
28 Correct 158 ms 24000 KB Output is correct
29 Correct 60 ms 14028 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 38 ms 6256 KB Output is correct
5 Correct 151 ms 23928 KB Output is correct
6 Correct 156 ms 23912 KB Output is correct
7 Correct 153 ms 23976 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 39 ms 6252 KB Output is correct
10 Correct 163 ms 24020 KB Output is correct
11 Correct 155 ms 23920 KB Output is correct
12 Correct 154 ms 23988 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 39 ms 6240 KB Output is correct
17 Correct 151 ms 23936 KB Output is correct
18 Correct 160 ms 23924 KB Output is correct
19 Correct 152 ms 23924 KB Output is correct
20 Correct 153 ms 23960 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 157 ms 23924 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 152 ms 23936 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 68 ms 14192 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 38 ms 6140 KB Output is correct
21 Correct 151 ms 23936 KB Output is correct
22 Correct 157 ms 23920 KB Output is correct
23 Correct 180 ms 23880 KB Output is correct
24 Correct 152 ms 23940 KB Output is correct
25 Correct 63 ms 13988 KB Output is correct
26 Correct 59 ms 14068 KB Output is correct
27 Correct 154 ms 24004 KB Output is correct
28 Correct 157 ms 23940 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1236 KB Output is correct
37 Correct 172 ms 23936 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1212 KB Output is correct
41 Correct 151 ms 23976 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 72 ms 14072 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 38 ms 6144 KB Output is correct
50 Correct 153 ms 23896 KB Output is correct
51 Correct 154 ms 23980 KB Output is correct
52 Correct 160 ms 23912 KB Output is correct
53 Correct 62 ms 14068 KB Output is correct
54 Correct 62 ms 14068 KB Output is correct
55 Correct 150 ms 23928 KB Output is correct
56 Correct 158 ms 24000 KB Output is correct
57 Correct 60 ms 14028 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 3 ms 852 KB Output is correct
61 Correct 62 ms 14032 KB Output is correct
62 Correct 1 ms 300 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 41 ms 6220 KB Output is correct
66 Correct 62 ms 13976 KB Output is correct
67 Correct 68 ms 14064 KB Output is correct
68 Correct 63 ms 14076 KB Output is correct
69 Correct 75 ms 14064 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 157 ms 23924 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 152 ms 23936 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 68 ms 14192 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 38 ms 6140 KB Output is correct
21 Correct 151 ms 23936 KB Output is correct
22 Correct 157 ms 23920 KB Output is correct
23 Correct 180 ms 23880 KB Output is correct
24 Correct 152 ms 23940 KB Output is correct
25 Correct 63 ms 13988 KB Output is correct
26 Correct 59 ms 14068 KB Output is correct
27 Correct 154 ms 24004 KB Output is correct
28 Correct 157 ms 23940 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1236 KB Output is correct
37 Correct 172 ms 23936 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1212 KB Output is correct
41 Correct 151 ms 23976 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 72 ms 14072 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 38 ms 6144 KB Output is correct
50 Correct 153 ms 23896 KB Output is correct
51 Correct 154 ms 23980 KB Output is correct
52 Correct 160 ms 23912 KB Output is correct
53 Correct 62 ms 14068 KB Output is correct
54 Correct 62 ms 14068 KB Output is correct
55 Correct 150 ms 23928 KB Output is correct
56 Correct 158 ms 24000 KB Output is correct
57 Correct 60 ms 14028 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 38 ms 6256 KB Output is correct
62 Correct 151 ms 23928 KB Output is correct
63 Correct 156 ms 23912 KB Output is correct
64 Correct 153 ms 23976 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 39 ms 6252 KB Output is correct
67 Correct 163 ms 24020 KB Output is correct
68 Correct 155 ms 23920 KB Output is correct
69 Correct 154 ms 23988 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 304 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 39 ms 6240 KB Output is correct
74 Correct 151 ms 23936 KB Output is correct
75 Correct 160 ms 23924 KB Output is correct
76 Correct 152 ms 23924 KB Output is correct
77 Correct 153 ms 23960 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 3 ms 852 KB Output is correct
81 Correct 62 ms 14032 KB Output is correct
82 Correct 1 ms 300 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 41 ms 6220 KB Output is correct
86 Correct 62 ms 13976 KB Output is correct
87 Correct 68 ms 14064 KB Output is correct
88 Correct 63 ms 14076 KB Output is correct
89 Correct 75 ms 14064 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 3 ms 596 KB Output is correct
93 Correct 61 ms 10060 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 16 ms 2676 KB Output is correct
98 Correct 60 ms 10100 KB Output is correct
99 Correct 59 ms 10060 KB Output is correct
100 Correct 60 ms 10108 KB Output is correct
101 Correct 58 ms 10096 KB Output is correct
102 Correct 71 ms 10116 KB Output is correct
103 Correct 57 ms 10100 KB Output is correct
104 Correct 57 ms 10104 KB Output is correct
105 Correct 62 ms 10112 KB Output is correct