oj.uz

Submission #170688

# Submission time Handle Problem Language Result Execution time Memory
170688 2019-12-26T05:10:09 Z youngyojun Split the Attractions (IOI19_split) C++17
40 / 100
 176 ms 15736 KB 
#include "split.h"
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
using namespace std;
inline void fg(vector<int> G[], int a, int b) { G[a].eb(b); G[b].eb(a); }

const int MAXN = 100055;
const int MAXM = 200055;

vector<int> G[MAXN];
int cnt[MAXN];

int A[MAXM], B[MAXM];
bitset<MAXN> chk;

int ud[MAXN];
int Ans[MAXN];
int N, M, CA, CB, CC, CO[4], Rt;

int uf(int i) { return i == ud[i] ? i : (ud[i] = uf(ud[i])); }
void uf(int a, int b) { ud[uf(b)] = uf(a); }

void normdfs(int i, int &c, int key) {
	if(!c) return;
	chk[i] = false; c--; Ans[i] = key;
	for(int v : G[i]) if(chk[v]) normdfs(v, c, key);
}
bool normAns() {
	for(int i = 0; i < N; i++) G[i].clear();
	for(int i = 0; i < M; i++) fg(G, A[i], B[i]);
	chk.reset();

	for(int i = 0; i < N; i++)
		if(Ans[i] < 1 || 2 < Ans[i]) Ans[i] = 3;

	int x = -1;
	for(int i = 0; i < N; i++) if(1 == Ans[i]) { x = i; chk[i] = true; }
	if(chk.count() < CA) return false;
	{ int c = CA; normdfs(x, c, -1); }
	for(int i = 0; i < N; i++) {
		if(1 == Ans[i]) Ans[i] = 3;
		else if(-1 == Ans[i]) Ans[i] = 1;
	}

	chk.reset();
	for(int i = 0; i < N; i++) if(2 == Ans[i]) { x = i; chk[i] = true; }
	if(chk.count() < CB) return false;
	{ int c = CB; normdfs(x, c, -2); }
	for(int i = 0; i < N; i++) {
		if(2 == Ans[i]) Ans[i] = 3;
		else if(-2 == Ans[i]) Ans[i] = 2;
	}

	return true;
}

void predfs(int i) {
	cnt[i] = 1;
	for(int v : G[i]) if(!cnt[v]) {
		predfs(v);
		cnt[i] += cnt[v];
	}
}
void cent(int &rt) {
	const int N = cnt[rt];
	for(int hi, hc;;) {
		hi = hc = -1;
		for(int v : G[rt]) if(cnt[v] < cnt[rt] && hc < cnt[v]) {
			hi = v; hc = cnt[v];
		}
		if(hc*2 <= N) break;
		cnt[rt] = N - hc;
		cnt[hi] = N;
		rt = hi;
	}
}

void treedfs(int i) {
	Ans[i] = 1;
	for(int v : G[i]) if(cnt[v] < cnt[i])
		treedfs(v);
}
bool solveTree() {
	for(int v : G[Rt]) if(CA <= cnt[v]) {
		fill(Ans, Ans+N, 2);
		treedfs(v);
		return true;
	}
	return false;
}

void solve() {
	iota(CO, CO+4, 0);
	if(CA > CB) { swap(CA, CB); swap(CO[1], CO[2]); }
	if(CA > CC) { swap(CA, CC); swap(CO[1], CO[3]); }
	if(CB > CC) { swap(CB, CC); swap(CO[2], CO[3]); }

	iota(ud, ud+MAXN, 0);
	for(int i = 0, a, b; i < M; i++) {
		a = A[i]; b = B[i];
		if(uf(a) == uf(b)) continue;
		uf(a, b);
		fg(G, a, b);
	}
	predfs(0); cent(Rt);

	if(solveTree()) return;




	
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	::N = n; ::M = sz(p);
	::CA = a; ::CB = b; ::CC = c;
	for(int i = 0; i < ::M; i++) {
		::A[i] = p[i];
		::B[i] = q[i];
	}
	solve();
	if(!normAns()) return vector<int>(::N, 0);
	vector<int> res;
	for(int i = 0; i < ::N; i++) {
		if(1 == ::Ans[i]) res.eb(::CO[1]);
		else if(2 == ::Ans[i]) res.eb(::CO[2]);
		else res.eb(::CO[3]);
	}
	return res;
}

Compilation message

split.cpp: In function 'bool normAns()':
split.cpp:40:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(chk.count() < CA) return false;
     ~~~~~~~~~~~~^~~~
split.cpp:49:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(chk.count() < CB) return false;
     ~~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3064 KB ok, correct split
2 Correct 4 ms 3064 KB ok, correct split
3 Correct 4 ms 3064 KB ok, correct split
4 Correct 4 ms 3064 KB ok, correct split
5 Correct 4 ms 2936 KB ok, correct split
6 Correct 4 ms 3064 KB ok, correct split
7 Correct 111 ms 15592 KB ok, correct split
8 Correct 110 ms 14268 KB ok, correct split
9 Correct 107 ms 13816 KB ok, correct split
10 Correct 102 ms 15660 KB ok, correct split
11 Correct 115 ms 14976 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3092 KB ok, correct split
2 Correct 4 ms 3064 KB ok, correct split
3 Correct 4 ms 3064 KB ok, correct split
4 Correct 127 ms 13512 KB ok, correct split
5 Correct 93 ms 11256 KB ok, correct split
6 Correct 118 ms 15736 KB ok, correct split
7 Correct 101 ms 14072 KB ok, correct split
8 Correct 148 ms 15500 KB ok, correct split
9 Correct 97 ms 11256 KB ok, correct split
10 Correct 71 ms 11220 KB ok, correct split
11 Correct 71 ms 11248 KB ok, correct split
12 Correct 72 ms 11632 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3064 KB ok, correct split
2 Correct 98 ms 11260 KB ok, correct split
3 Correct 36 ms 6648 KB ok, correct split
4 Correct 4 ms 3064 KB ok, correct split
5 Correct 98 ms 12748 KB ok, correct split
6 Correct 103 ms 12664 KB ok, correct split
7 Correct 137 ms 12432 KB ok, correct split
8 Correct 176 ms 13176 KB ok, correct split
9 Correct 105 ms 12532 KB ok, correct split
10 Correct 30 ms 5724 KB ok, no valid answer
11 Correct 44 ms 7032 KB ok, no valid answer
12 Correct 75 ms 11296 KB ok, no valid answer
13 Correct 88 ms 11000 KB ok, no valid answer
14 Correct 69 ms 11376 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3064 KB ok, correct split
2 Correct 4 ms 3064 KB ok, no valid answer
3 Correct 5 ms 3064 KB ok, correct split
4 Correct 5 ms 3036 KB ok, correct split
5 Correct 5 ms 3064 KB ok, correct split
6 Correct 5 ms 3064 KB ok, correct split
7 Correct 5 ms 3064 KB ok, correct split
8 Correct 4 ms 3064 KB ok, correct split
9 Correct 8 ms 3448 KB ok, correct split
10 Correct 8 ms 3448 KB ok, correct split
11 Correct 5 ms 3192 KB ok, correct split
12 Incorrect 8 ms 3448 KB jury found a solution, contestant did not
13 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3064 KB ok, correct split
2 Correct 4 ms 3064 KB ok, correct split
3 Correct 4 ms 3064 KB ok, correct split
4 Correct 4 ms 3064 KB ok, correct split
5 Correct 4 ms 2936 KB ok, correct split
6 Correct 4 ms 3064 KB ok, correct split
7 Correct 111 ms 15592 KB ok, correct split
8 Correct 110 ms 14268 KB ok, correct split
9 Correct 107 ms 13816 KB ok, correct split
10 Correct 102 ms 15660 KB ok, correct split
11 Correct 115 ms 14976 KB ok, correct split
12 Correct 4 ms 3092 KB ok, correct split
13 Correct 4 ms 3064 KB ok, correct split
14 Correct 4 ms 3064 KB ok, correct split
15 Correct 127 ms 13512 KB ok, correct split
16 Correct 93 ms 11256 KB ok, correct split
17 Correct 118 ms 15736 KB ok, correct split
18 Correct 101 ms 14072 KB ok, correct split
19 Correct 148 ms 15500 KB ok, correct split
20 Correct 97 ms 11256 KB ok, correct split
21 Correct 71 ms 11220 KB ok, correct split
22 Correct 71 ms 11248 KB ok, correct split
23 Correct 72 ms 11632 KB ok, correct split
24 Correct 4 ms 3064 KB ok, correct split
25 Correct 98 ms 11260 KB ok, correct split
26 Correct 36 ms 6648 KB ok, correct split
27 Correct 4 ms 3064 KB ok, correct split
28 Correct 98 ms 12748 KB ok, correct split
29 Correct 103 ms 12664 KB ok, correct split
30 Correct 137 ms 12432 KB ok, correct split
31 Correct 176 ms 13176 KB ok, correct split
32 Correct 105 ms 12532 KB ok, correct split
33 Correct 30 ms 5724 KB ok, no valid answer
34 Correct 44 ms 7032 KB ok, no valid answer
35 Correct 75 ms 11296 KB ok, no valid answer
36 Correct 88 ms 11000 KB ok, no valid answer
37 Correct 69 ms 11376 KB ok, no valid answer
38 Correct 4 ms 3064 KB ok, correct split
39 Correct 4 ms 3064 KB ok, no valid answer
40 Correct 5 ms 3064 KB ok, correct split
41 Correct 5 ms 3036 KB ok, correct split
42 Correct 5 ms 3064 KB ok, correct split
43 Correct 5 ms 3064 KB ok, correct split
44 Correct 5 ms 3064 KB ok, correct split
45 Correct 4 ms 3064 KB ok, correct split
46 Correct 8 ms 3448 KB ok, correct split
47 Correct 8 ms 3448 KB ok, correct split
48 Correct 5 ms 3192 KB ok, correct split
49 Incorrect 8 ms 3448 KB jury found a solution, contestant did not
50 Halted 0 ms 0 KB -