oj.uz

답안 #551757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551757 2022-04-21T12:47:09 Z QwertyPi Cats or Dogs (JOI18_catdog) C++14
100 / 100
 531 ms 31520 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], dp2[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, tp = inf, bp = inf;
	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;
		tp = s.empty() ? inf : (s.begin())->fi;
		bot = s.empty() ? 0 : (--s.end())->se;
		bp = s.empty() ? inf : (--s.end())->fi;
	}
	
	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;
		tp = s.empty() ? inf : (s.begin())->fi;
		bot = s.empty() ? 0 : (--s.end())->se;
		bp = s.empty() ? inf : (--s.end())->fi;
	}
} 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);
	map<int, vector<int>> PC;
	for(int i = 1; i <= n; i++){
		PC[des[i]].push_back(i);
	}
	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){
	int tv = v;
	while(tv != 0){
		dp2[psg[tv]][0] -= min(dp[tv][0], dp[tv][1] + 1);
		dp2[psg[tv]][1] -= min(dp[tv][1], dp[tv][0] + 1);
		tv = psg[tv];
	}
	while(true){
		dp[v][0] = dp2[v][0] + V[v].ans, dp[v][1] = dp2[v][1] + V[v].ans;
		if(!V[v].s.empty()){
			int res = inf;
			if(V[v].bp == d[v]){
				if(V[v].bot == 1) res = dp[v][0];
				else if(V[v].bot == 2) res = dp[v][1];
			}else{
				if(V[v].bot == 1) res = min(dp[v][0], dp[v][1] + 1);
				else if(V[v].bot == 2) res = min(dp[v][0] + 1, dp[v][1]);
			}
			dp[v][0] = dp[v][1] = res;
			if(V[v].top == 1) dp[v][1]++;
			else if(V[v].top == 2) dp[v][0]++;
		}
		if(v != 0){
			dp2[psg[v]][0] += min(dp[v][0], dp[v][1] + 1);
			dp2[psg[v]][1] += min(dp[v][1], dp[v][0] + 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 11988 KB Output is correct
2 Correct 6 ms 12060 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 6 ms 12000 KB Output is correct
7 Correct 8 ms 11988 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 11980 KB Output is correct
16 Correct 6 ms 11988 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12060 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 6 ms 12000 KB Output is correct
7 Correct 8 ms 11988 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 11980 KB Output is correct
16 Correct 6 ms 11988 KB Output is correct
17 Correct 7 ms 12116 KB Output is correct
18 Correct 6 ms 12244 KB Output is correct
19 Correct 7 ms 12116 KB Output is correct
20 Correct 6 ms 12116 KB Output is correct
21 Correct 8 ms 12116 KB Output is correct
22 Correct 7 ms 12116 KB Output is correct
23 Correct 7 ms 12116 KB Output is correct
24 Correct 7 ms 12116 KB Output is correct
25 Correct 8 ms 12128 KB Output is correct
26 Correct 7 ms 12128 KB Output is correct
27 Correct 7 ms 12116 KB Output is correct
28 Correct 7 ms 12116 KB Output is correct
29 Correct 8 ms 12136 KB Output is correct
30 Correct 6 ms 12116 KB Output is correct
31 Correct 6 ms 12116 KB Output is correct
32 Correct 6 ms 12116 KB Output is correct

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12060 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 6 ms 12000 KB Output is correct
7 Correct 8 ms 11988 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 11980 KB Output is correct
16 Correct 6 ms 11988 KB Output is correct
17 Correct 7 ms 12116 KB Output is correct
18 Correct 6 ms 12244 KB Output is correct
19 Correct 7 ms 12116 KB Output is correct
20 Correct 6 ms 12116 KB Output is correct
21 Correct 8 ms 12116 KB Output is correct
22 Correct 7 ms 12116 KB Output is correct
23 Correct 7 ms 12116 KB Output is correct
24 Correct 7 ms 12116 KB Output is correct
25 Correct 8 ms 12128 KB Output is correct
26 Correct 7 ms 12128 KB Output is correct
27 Correct 7 ms 12116 KB Output is correct
28 Correct 7 ms 12116 KB Output is correct
29 Correct 8 ms 12136 KB Output is correct
30 Correct 6 ms 12116 KB Output is correct
31 Correct 6 ms 12116 KB Output is correct
32 Correct 6 ms 12116 KB Output is correct
33 Correct 163 ms 20916 KB Output is correct
34 Correct 100 ms 22500 KB Output is correct
35 Correct 210 ms 18220 KB Output is correct
36 Correct 288 ms 27380 KB Output is correct
37 Correct 28 ms 17104 KB Output is correct
38 Correct 323 ms 29100 KB Output is correct
39 Correct 308 ms 29168 KB Output is correct
40 Correct 364 ms 29092 KB Output is correct
41 Correct 328 ms 29056 KB Output is correct
42 Correct 425 ms 29088 KB Output is correct
43 Correct 343 ms 29060 KB Output is correct
44 Correct 416 ms 29124 KB Output is correct
45 Correct 531 ms 29184 KB Output is correct
46 Correct 362 ms 29104 KB Output is correct
47 Correct 303 ms 29124 KB Output is correct
48 Correct 78 ms 26132 KB Output is correct
49 Correct 100 ms 31520 KB Output is correct
50 Correct 28 ms 16344 KB Output is correct
51 Correct 39 ms 19660 KB Output is correct
52 Correct 21 ms 16140 KB Output is correct
53 Correct 164 ms 29496 KB Output is correct
54 Correct 100 ms 19764 KB Output is correct
55 Correct 251 ms 25268 KB Output is correct
56 Correct 142 ms 20732 KB Output is correct
57 Correct 229 ms 28480 KB Output is correct
58 Correct 35 ms 20464 KB Output is correct
59 Correct 37 ms 19140 KB Output is correct
60 Correct 86 ms 29276 KB Output is correct
61 Correct 90 ms 30044 KB Output is correct
62 Correct 67 ms 26696 KB Output is correct
63 Correct 37 ms 19020 KB Output is correct
64 Correct 48 ms 20788 KB Output is correct
65 Correct 60 ms 25420 KB Output is correct
66 Correct 33 ms 15728 KB Output is correct
67 Correct 46 ms 21696 KB Output is correct
68 Correct 75 ms 25644 KB Output is correct
69 Correct 21 ms 13584 KB Output is correct
70 Correct 9 ms 12244 KB Output is correct
71 Correct 40 ms 18760 KB Output is correct
72 Correct 57 ms 24084 KB Output is correct
73 Correct 89 ms 29076 KB Output is correct
74 Correct 88 ms 25492 KB Output is correct
75 Correct 96 ms 28956 KB Output is correct
76 Correct 96 ms 27704 KB Output is correct
77 Correct 89 ms 25748 KB Output is correct