oj.uz

Submission #373018

# Submission time Handle Problem Language Result Execution time Memory
373018 2021-03-03T03:14:37 Z arwaeystoamneg Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 278 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;
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)
		link[i] = j;
}
bool sub2()
{
	F0R(i, n)F0R(j, n)if (a[i][j] > 1)return 0;
	link.rsz(n);
	iota(all(link), 0);
	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);
	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)
	{
		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;
	assert(0);
	return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.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 10 ms 1388 KB Output is correct
7 Correct 238 ms 26080 KB Output is correct

Subtask #2
10.0 / 10.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 10 ms 1388 KB Output is correct
7 Correct 238 ms 26080 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1388 KB Output is correct
13 Correct 246 ms 26080 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 120 ms 16108 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 63 ms 6872 KB Output is correct
21 Correct 278 ms 26348 KB Output is correct
22 Correct 251 ms 26112 KB Output is correct
23 Correct 261 ms 26092 KB Output is correct
24 Correct 250 ms 26220 KB Output is correct
25 Correct 108 ms 16108 KB Output is correct
26 Correct 104 ms 16108 KB Output is correct
27 Correct 262 ms 26220 KB Output is correct
28 Correct 249 ms 26092 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 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 364 KB Output is correct
8 Correct 13 ms 1388 KB Output is correct
9 Correct 249 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 265 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 148 ms 16236 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Incorrect 0 ms 364 KB b[4][4] is not 0
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 65 ms 6892 KB Output is correct
5 Correct 247 ms 26220 KB Output is correct
6 Correct 253 ms 26240 KB Output is correct
7 Correct 258 ms 26092 KB Output is correct
8 Incorrect 1 ms 364 KB b[4][4] is not 0
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 10 ms 1388 KB Output is correct
7 Correct 238 ms 26080 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1388 KB Output is correct
13 Correct 246 ms 26080 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 120 ms 16108 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 63 ms 6872 KB Output is correct
21 Correct 278 ms 26348 KB Output is correct
22 Correct 251 ms 26112 KB Output is correct
23 Correct 261 ms 26092 KB Output is correct
24 Correct 250 ms 26220 KB Output is correct
25 Correct 108 ms 16108 KB Output is correct
26 Correct 104 ms 16108 KB Output is correct
27 Correct 262 ms 26220 KB Output is correct
28 Correct 249 ms 26092 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 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 364 KB Output is correct
36 Correct 13 ms 1388 KB Output is correct
37 Correct 249 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 265 ms 26092 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 148 ms 16236 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Incorrect 0 ms 364 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 10 ms 1388 KB Output is correct
7 Correct 238 ms 26080 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1388 KB Output is correct
13 Correct 246 ms 26080 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 120 ms 16108 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 63 ms 6872 KB Output is correct
21 Correct 278 ms 26348 KB Output is correct
22 Correct 251 ms 26112 KB Output is correct
23 Correct 261 ms 26092 KB Output is correct
24 Correct 250 ms 26220 KB Output is correct
25 Correct 108 ms 16108 KB Output is correct
26 Correct 104 ms 16108 KB Output is correct
27 Correct 262 ms 26220 KB Output is correct
28 Correct 249 ms 26092 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 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 364 KB Output is correct
36 Correct 13 ms 1388 KB Output is correct
37 Correct 249 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 265 ms 26092 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 148 ms 16236 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Incorrect 0 ms 364 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -