oj.uz

Submission #373464

# Submission time Handle Problem Language Result Execution time Memory
373464 2021-03-04T17:55:59 Z arwaeystoamneg Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 316 ms 26348 KB 
#include "supertrees.h"

/*
ID: awesome35
LANG: C++14
TASK: vans
*/
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
//const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353
const ld pi = 3.1415926535;

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "ioi")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
int n;
vector<vi>a, ans;
int val = 0;
bool sub1()
{
	F0R(i, n)F0R(j, n)if (a[i][j] != 1)return 0;
	val = 1;
	F0R(i, n - 1)ans[i][i + 1] = 1, ans[i + 1][i] = 1;
	build(ans);
	return 1;
}
vi link, sizes;
int find(int i)
{
	return link[i] == i ? i : link[i] = find(link[i]);
}
void unite(int i, int j)
{
	i = find(i), j = find(j);
	if (i != j)
	{
		if (sizes[i] > sizes[j])swap(i, j);
		link[i] = j;
		sizes[j] += sizes[i];
	}
}
bool sub2()
{
	F0R(i, n)F0R(j, n)if (a[i][j] > 1)return 0;
	link.rsz(n);
	iota(all(link), 0);
	sizes.rsz(n, 1);
	F0R(i, n)F0R(j, n)if (a[i][j])unite(i, j);
	vector<vi>t(n);
	F0R(i, n)t[find(i)].pb(i);
	val = 1;
	F0R(i, n)
	{
		F0R(j, sz(t[i]))FOR(k, j + 1, sz(t[i]))
		{
			if (!a[t[i][j]][t[i][k]])
			{
				val = 0;
				return 1;
			}
		}
	}
	F0R(i, n)
	{
		F0R(j, sz(t[i]) - 1)
		{
			ans[t[i][j]][t[i][j + 1]] = 1;
			ans[t[i][j + 1]][t[i][j]] = 1;
		}
	}
	build(ans);
	return 1;
}
bool sub3()
{
	F0R(i, n)FOR(j, i + 1, n)if (a[i][j] == 1 || a[i][j] == 3)return 0;
	link.rsz(n);
	iota(all(link), 0);
	sizes.rsz(n, 1);
	F0R(i, n)F0R(j, n)if (a[i][j])unite(i, j);
	vector<vi>t(n);
	F0R(i, n)t[find(i)].pb(i);
	val = 1;
	F0R(i, n)
	{
		if (sz(t[i]) == 2)
		{
			val = 0;
			return 1;
		}
		F0R(j, sz(t[i]))FOR(k, j + 1, sz(t[i]))
		{
			if (!a[t[i][j]][t[i][k]])
			{
				val = 0;
				return 1;
			}
		}
	}
	F0R(i, n)
	{
		if (sz(t[i]) == 1)continue;
		F0R(j, sz(t[i]))
		{
			ans[t[i][j]][t[i][(j + 1) % sz(t[i])]] = 1;
			ans[t[i][(j + 1) % sz(t[i])]][t[i][j]] = 1;
		}
	}
	build(ans);
	return 1;
}
struct uf
{
	vi link, sizes;
	void init(int n)
	{
		link.rsz(n);
		iota(all(link), 0);
		sizes.rsz(n, 1);
	}
int find(int i)
{
	return link[i] == i ? i : link[i] = find(link[i]);
}
void unite(int i, int j)
{
	i = find(i), j = find(j);
	if (i != j)
	{
		if (sizes[i] > sizes[j])swap(i, j);
		link[i] = j;
		sizes[j] += sizes[i];
	}
}
};
bool sub45()
{
	F0R(i, n)FOR(j, i + 1, n)if (a[i][j] == 3)return 0;
	uf bridge;// the arms of the graph.
	bridge.init(n);
	F0R(i, n)FOR(j, i + 1, n)if (a[i][j] == 1)bridge.unite(i, j);
	uf comp;// components of the graph.
	comp.init(n);
	F0R(i, n)FOR(j, i + 1, n)if (a[i][j])comp.unite(bridge.find(i), bridge.find(j));
	vector<vi>t(n), t1(n);
	vi index1(n), index(n, -1);
	F0R(i, n)
	{
		t1[bridge.find(i)].pb(i);
		index1[i] = bridge.find(i);
		if (bridge.find(i) == i)
			t[comp.find(bridge.find(i))].pb(i);
		index[i] = comp.find(bridge.find(i));
	}
	// check if possible
	F0R(i, n)
	{
		assert(index[i] != -1);
		FOR(j, i + 1, n)
		{
			assert(index[j] != -1);
			if (a[i][j] == 0)
			{
				if (index[i] == index[j])
				{
					val = 0;
					return 1;
				}
			}
			else if (a[i][j] == 1)
			{
				assert(index[i] == index[j]);
				if (index1[i] != index1[j])
				{
					val = 0;
					return 1;
				}
			}
			else
			{
				assert(index[i] == index[j]);
				if (index1[i] == index1[j])
				{
					// bug
					val = 0;
					return 1;
				}
			}
		}
	}
	F0R(i, n)
	{
		if (sz(t[i]) == 2)
		{
			val = 0;
			return 1;
		}
	}
	// else
	val = 1;
	F0R(i, n)
	{
		F0R(j, sz(t1[i]) - 1)
		{
			ans[t1[i][j]][t1[i][j + 1]] = 1;
			ans[t1[i][j + 1]][t1[i][j]] = 1;
		}
	}
	F0R(i, n)
	{
		if (sz(t[i]) == 1)continue;
		F0R(j, sz(t[i]))
		{
			ans[t[i][j]][t[i][(j + 1) % sz(t[i])]] = 1;
			ans[t[i][(j + 1) % sz(t[i])]][t[i][j]] = 1;
		}
	}
	build(ans);
	return 1;
}
int construct(vector<vi>t)
{
	n = sz(t);
	a = t;
	ans.rsz(n, vi(n));
	if (sub1())return val;
	if (sub2())return val;
	if (sub3())return val;
	if (sub45())return val;
	else return 0;
	return 0;
}

Compilation message

supertrees.cpp: In function 'void setIO(std::string)':
supertrees.cpp:55:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   55 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
supertrees.cpp:57:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   57 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 251 ms 26012 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 251 ms 26012 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 254 ms 26092 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 122 ms 16108 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 6892 KB Output is correct
21 Correct 257 ms 26212 KB Output is correct
22 Correct 255 ms 26092 KB Output is correct
23 Correct 272 ms 26092 KB Output is correct
24 Correct 263 ms 26220 KB Output is correct
25 Correct 109 ms 16108 KB Output is correct
26 Correct 124 ms 16108 KB Output is correct
27 Correct 271 ms 26220 KB Output is correct
28 Correct 255 ms 26092 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 11 ms 1388 KB Output is correct
9 Correct 253 ms 26220 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 262 ms 26220 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 121 ms 16108 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 64 ms 6892 KB Output is correct
22 Correct 258 ms 26092 KB Output is correct
23 Correct 250 ms 26092 KB Output is correct
24 Correct 270 ms 26092 KB Output is correct
25 Correct 113 ms 16236 KB Output is correct
26 Correct 110 ms 16108 KB Output is correct
27 Correct 279 ms 26092 KB Output is correct
28 Correct 270 ms 26092 KB Output is correct
29 Correct 105 ms 16236 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 64 ms 6892 KB Output is correct
5 Correct 256 ms 26092 KB Output is correct
6 Correct 255 ms 26092 KB Output is correct
7 Correct 274 ms 26092 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 65 ms 6892 KB Output is correct
10 Correct 257 ms 26160 KB Output is correct
11 Correct 252 ms 26092 KB Output is correct
12 Correct 304 ms 26220 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 66 ms 6924 KB Output is correct
17 Correct 266 ms 26080 KB Output is correct
18 Correct 275 ms 26080 KB Output is correct
19 Correct 273 ms 26080 KB Output is correct
20 Correct 265 ms 26348 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 251 ms 26012 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 254 ms 26092 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 122 ms 16108 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 6892 KB Output is correct
21 Correct 257 ms 26212 KB Output is correct
22 Correct 255 ms 26092 KB Output is correct
23 Correct 272 ms 26092 KB Output is correct
24 Correct 263 ms 26220 KB Output is correct
25 Correct 109 ms 16108 KB Output is correct
26 Correct 124 ms 16108 KB Output is correct
27 Correct 271 ms 26220 KB Output is correct
28 Correct 255 ms 26092 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 11 ms 1388 KB Output is correct
37 Correct 253 ms 26220 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1388 KB Output is correct
41 Correct 262 ms 26220 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 1004 KB Output is correct
45 Correct 121 ms 16108 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 64 ms 6892 KB Output is correct
50 Correct 258 ms 26092 KB Output is correct
51 Correct 250 ms 26092 KB Output is correct
52 Correct 270 ms 26092 KB Output is correct
53 Correct 113 ms 16236 KB Output is correct
54 Correct 110 ms 16108 KB Output is correct
55 Correct 279 ms 26092 KB Output is correct
56 Correct 270 ms 26092 KB Output is correct
57 Correct 105 ms 16236 KB Output is correct
58 Correct 34 ms 364 KB Output is correct
59 Correct 1 ms 268 KB Output is correct
60 Correct 5 ms 1004 KB Output is correct
61 Correct 126 ms 16236 KB Output is correct
62 Correct 41 ms 264 KB Output is correct
63 Correct 40 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 113 ms 7020 KB Output is correct
66 Correct 116 ms 16752 KB Output is correct
67 Correct 192 ms 16876 KB Output is correct
68 Correct 107 ms 16720 KB Output is correct
69 Correct 107 ms 16976 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 251 ms 26012 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 254 ms 26092 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 122 ms 16108 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 6892 KB Output is correct
21 Correct 257 ms 26212 KB Output is correct
22 Correct 255 ms 26092 KB Output is correct
23 Correct 272 ms 26092 KB Output is correct
24 Correct 263 ms 26220 KB Output is correct
25 Correct 109 ms 16108 KB Output is correct
26 Correct 124 ms 16108 KB Output is correct
27 Correct 271 ms 26220 KB Output is correct
28 Correct 255 ms 26092 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 11 ms 1388 KB Output is correct
37 Correct 253 ms 26220 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1388 KB Output is correct
41 Correct 262 ms 26220 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 1004 KB Output is correct
45 Correct 121 ms 16108 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 64 ms 6892 KB Output is correct
50 Correct 258 ms 26092 KB Output is correct
51 Correct 250 ms 26092 KB Output is correct
52 Correct 270 ms 26092 KB Output is correct
53 Correct 113 ms 16236 KB Output is correct
54 Correct 110 ms 16108 KB Output is correct
55 Correct 279 ms 26092 KB Output is correct
56 Correct 270 ms 26092 KB Output is correct
57 Correct 105 ms 16236 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 64 ms 6892 KB Output is correct
62 Correct 256 ms 26092 KB Output is correct
63 Correct 255 ms 26092 KB Output is correct
64 Correct 274 ms 26092 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 65 ms 6892 KB Output is correct
67 Correct 257 ms 26160 KB Output is correct
68 Correct 252 ms 26092 KB Output is correct
69 Correct 304 ms 26220 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 66 ms 6924 KB Output is correct
74 Correct 266 ms 26080 KB Output is correct
75 Correct 275 ms 26080 KB Output is correct
76 Correct 273 ms 26080 KB Output is correct
77 Correct 265 ms 26348 KB Output is correct
78 Correct 34 ms 364 KB Output is correct
79 Correct 1 ms 268 KB Output is correct
80 Correct 5 ms 1004 KB Output is correct
81 Correct 126 ms 16236 KB Output is correct
82 Correct 41 ms 264 KB Output is correct
83 Correct 40 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 113 ms 7020 KB Output is correct
86 Correct 116 ms 16752 KB Output is correct
87 Correct 192 ms 16876 KB Output is correct
88 Correct 107 ms 16720 KB Output is correct
89 Correct 107 ms 16976 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 46 ms 1004 KB Output is correct
93 Correct 316 ms 16224 KB Output is correct
94 Correct 44 ms 364 KB Output is correct
95 Correct 1 ms 364 KB Output is correct
96 Correct 1 ms 364 KB Output is correct
97 Correct 27 ms 4808 KB Output is correct
98 Correct 160 ms 18156 KB Output is correct
99 Correct 110 ms 18028 KB Output is correct
100 Correct 110 ms 18128 KB Output is correct
101 Correct 108 ms 18156 KB Output is correct
102 Correct 107 ms 18176 KB Output is correct
103 Correct 112 ms 18028 KB Output is correct
104 Correct 107 ms 18156 KB Output is correct
105 Correct 109 ms 18028 KB Output is correct