oj.uz

답안 #551623

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551623 2022-04-21T08:07:24 Z QwertyPi Cats or Dogs (JOI18_catdog) C++14
38 / 100
 3000 ms 33128 KB 
#include "catdog.h"
#include <bits/stdc++.h>
#define se second
#define fi first
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
const int N = 1e5 + 3;
const int inf = 1 << 30;
int n, A[N], p[N], des[N], d[N], psg[N];
int v[N][2], dp[N][2];
vector<int> G[N], H[N];

int dif(pii a, pii b){
	if(a.se == 0 || b.se == 0) return 0;
	return a.se != b.se;
}

struct CD{
	set<pair<int, int>> s; int ans = 0, top = 0, bot = 0;
	void insert(int v, int cd){
		auto ptr = s.lower_bound({v, cd});
		pii m1 = ptr != s.begin() ? *prev(ptr) : mp(0, 0);
		pii p1 = ptr != s.end() ? *ptr : mp(0, 0);
		ans += dif({v, cd}, m1) + dif({v, cd}, p1) - dif(m1, p1);
		s.insert({v, cd});
		top = s.empty() ? 0 : (s.begin())->se;
		bot = s.empty() ? 0 : (--s.end())->se;
	}
	
	void erase(int v){
		auto ptr = s.lower_bound({v, -1});
		pii m1 = ptr != s.begin() ? *prev(ptr) : mp(0, 0);
		pii p1 = ptr != s.end() && next(ptr) != s.end() ? *next(ptr) : mp(0, 0);
		ans += dif(m1, p1) - dif(*ptr, m1) - dif(*ptr, p1);
		s.erase(ptr);
		top = s.empty() ? 0 : (s.begin())->se;
		bot = s.empty() ? 0 : (--s.end())->se;
	}
} V[N];

void dfs(int v, int par){
	des[v] = v;
	for(auto i : G[v]){
		if(i != par){
			p[i] = v;
			d[i] = d[v] + 1;
			dfs(i, v);
			des[v] = (G[v].size() - (v != 1) == 1) ? des[i] : v;
		}
	}
}

void initialize(int n, vector<int> A, vector<int> B) {
	::n = n;
	for(int i = 0; i < n - 1; i++){
		G[A[i]].pb(B[i]);
		G[B[i]].pb(A[i]);
	}
	dfs(1, -1);
	for(int i = 1; i <= n; i++) des[i] = i;
	map<int, vector<int>> PC;
	for(int i = 1; i <= n; i++){
		PC[des[i]].push_back(i);
	}
//	for(int i = 1; i <= n; i++){
//		cout << des[i] << ' ';
//	}
//	cout << endl;
	for(auto& i : PC){
		sort(i.se.begin(), i.se.end(), [](int a, int b){
			return d[a] < d[b];
		});
	}
	
	vector<int> sg;
	for(auto i : PC){
		sg.pb(i.se[0]);
	}
	for(auto i : sg){
		H[p[i]].pb(des[i]);
		psg[des[i]] = p[i];
	}
}

void lift(int v){
	while(true){
		dp[v][0] = dp[v][1] = V[v].ans;
		for(auto i : H[v]){
			dp[v][0] += min(dp[i][0], dp[i][1] + 1);
			dp[v][1] += min(dp[i][1], dp[i][0] + 1);
		}
		
		if(V[v].bot == 1) dp[v][1] = inf;
		else if(V[v].bot == 2) dp[v][0] = inf;
		if(V[v].top + V[v].bot == 3) swap(dp[v][0], dp[v][1]);
		if(v == 0) return;
		v = psg[v];
	}
}

int sol(){
	return min(dp[0][0], dp[0][1]);
}

void out(char c){
//	cout << c << "<<<" << endl;
//	for(int i = 0; i <= n; i++){
//		cout << dp[i][0] << ' ' << dp[i][1] << endl;
//	}
}

int cat(int v) {
	A[v] = 1;
	V[des[v]].insert(d[v], 1);
	lift(des[v]);
	out('c');
	return sol();
}

int dog(int v) {
	A[v] = 2;
	V[des[v]].insert(d[v], 2);
	lift(des[v]);
	out('d');
	return sol();
}

int neighbor(int v) {
	A[v] = 0;
	V[des[v]].erase(d[v]);
	lift(des[v]);
	out('n');
	return sol();
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11220 KB Output is correct
2 Correct 7 ms 11220 KB Output is correct
3 Correct 7 ms 11220 KB Output is correct
4 Correct 6 ms 11268 KB Output is correct
5 Correct 7 ms 11220 KB Output is correct
6 Correct 7 ms 11220 KB Output is correct
7 Correct 6 ms 11272 KB Output is correct
8 Correct 8 ms 11192 KB Output is correct
9 Correct 8 ms 11272 KB Output is correct
10 Correct 6 ms 11220 KB Output is correct
11 Correct 6 ms 11220 KB Output is correct
12 Correct 6 ms 11196 KB Output is correct
13 Correct 7 ms 11220 KB Output is correct
14 Correct 7 ms 11268 KB Output is correct
15 Correct 8 ms 11236 KB Output is correct
16 Correct 8 ms 11220 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11220 KB Output is correct
2 Correct 7 ms 11220 KB Output is correct
3 Correct 7 ms 11220 KB Output is correct
4 Correct 6 ms 11268 KB Output is correct
5 Correct 7 ms 11220 KB Output is correct
6 Correct 7 ms 11220 KB Output is correct
7 Correct 6 ms 11272 KB Output is correct
8 Correct 8 ms 11192 KB Output is correct
9 Correct 8 ms 11272 KB Output is correct
10 Correct 6 ms 11220 KB Output is correct
11 Correct 6 ms 11220 KB Output is correct
12 Correct 6 ms 11196 KB Output is correct
13 Correct 7 ms 11220 KB Output is correct
14 Correct 7 ms 11268 KB Output is correct
15 Correct 8 ms 11236 KB Output is correct
16 Correct 8 ms 11220 KB Output is correct
17 Correct 8 ms 11348 KB Output is correct
18 Correct 8 ms 11424 KB Output is correct
19 Correct 9 ms 11348 KB Output is correct
20 Correct 8 ms 11348 KB Output is correct
21 Correct 8 ms 11272 KB Output is correct
22 Correct 7 ms 11348 KB Output is correct
23 Correct 8 ms 11476 KB Output is correct
24 Correct 9 ms 11496 KB Output is correct
25 Correct 7 ms 11348 KB Output is correct
26 Correct 6 ms 11348 KB Output is correct
27 Correct 7 ms 11300 KB Output is correct
28 Correct 7 ms 11476 KB Output is correct
29 Correct 10 ms 11532 KB Output is correct
30 Correct 8 ms 11348 KB Output is correct
31 Correct 7 ms 11408 KB Output is correct
32 Correct 7 ms 11348 KB Output is correct

Subtask #3
0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11220 KB Output is correct
2 Correct 7 ms 11220 KB Output is correct
3 Correct 7 ms 11220 KB Output is correct
4 Correct 6 ms 11268 KB Output is correct
5 Correct 7 ms 11220 KB Output is correct
6 Correct 7 ms 11220 KB Output is correct
7 Correct 6 ms 11272 KB Output is correct
8 Correct 8 ms 11192 KB Output is correct
9 Correct 8 ms 11272 KB Output is correct
10 Correct 6 ms 11220 KB Output is correct
11 Correct 6 ms 11220 KB Output is correct
12 Correct 6 ms 11196 KB Output is correct
13 Correct 7 ms 11220 KB Output is correct
14 Correct 7 ms 11268 KB Output is correct
15 Correct 8 ms 11236 KB Output is correct
16 Correct 8 ms 11220 KB Output is correct
17 Correct 8 ms 11348 KB Output is correct
18 Correct 8 ms 11424 KB Output is correct
19 Correct 9 ms 11348 KB Output is correct
20 Correct 8 ms 11348 KB Output is correct
21 Correct 8 ms 11272 KB Output is correct
22 Correct 7 ms 11348 KB Output is correct
23 Correct 8 ms 11476 KB Output is correct
24 Correct 9 ms 11496 KB Output is correct
25 Correct 7 ms 11348 KB Output is correct
26 Correct 6 ms 11348 KB Output is correct
27 Correct 7 ms 11300 KB Output is correct
28 Correct 7 ms 11476 KB Output is correct
29 Correct 10 ms 11532 KB Output is correct
30 Correct 8 ms 11348 KB Output is correct
31 Correct 7 ms 11408 KB Output is correct
32 Correct 7 ms 11348 KB Output is correct
33 Correct 275 ms 22868 KB Output is correct
34 Correct 125 ms 24928 KB Output is correct
35 Correct 290 ms 19660 KB Output is correct
36 Correct 490 ms 30796 KB Output is correct
37 Correct 27 ms 17760 KB Output is correct
38 Correct 493 ms 33128 KB Output is correct
39 Correct 488 ms 32992 KB Output is correct
40 Correct 611 ms 32944 KB Output is correct
41 Correct 525 ms 33016 KB Output is correct
42 Correct 707 ms 33008 KB Output is correct
43 Correct 600 ms 32996 KB Output is correct
44 Correct 675 ms 33012 KB Output is correct
45 Correct 944 ms 33000 KB Output is correct
46 Correct 605 ms 33004 KB Output is correct
47 Correct 527 ms 32996 KB Output is correct
48 Execution timed out 3038 ms 26180 KB Time limit exceeded
49 Halted 0 ms 0 KB -