QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #448745 | #8806. Summer Driving | Qwerty1232 | 1 | 118ms | 20116kb | C++23 | 5.7kb | 2024-06-20 02:25:07 | 2024-06-20 02:25:08 |
Judging History
answer
#include <bits/stdc++.h>
#define check_tl \
if (clock() * 1.0 / CLOCKS_PER_SEC > 1.0) { \
std::cout << __LINE__ << std::endl; \
exit(1); \
}
int32_t main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, start, a, b;
std::cin >> n >> start >> a >> b;
start--;
std::vector<std::vector<int>> gr(n);
for (int i = 0; i < n - 1; i++) {
int u, v;
std::cin >> u >> v;
u--;
v--;
gr[u].push_back(v);
gr[v].push_back(u);
}
if (a <= b) {
std::cout << 1 << "\n";
return 0;
}
std::vector<int> depth(n), height(n), prv(n); //, max_sb(n);
{
auto dfs = [&](auto dfs, int v, int f) -> void {
prv[v] = f;
depth[v] = f == -1 ? 0 : depth[f] + 1;
height[v] = 0;
for (int& t : gr[v]) {
if (t != f) {
dfs(dfs, t, v);
height[v] = std::max(height[v], height[t] + 1);
} else {
t = -1;
}
}
std::erase(gr[v], -1);
};
dfs(dfs, start, -1);
}
std::vector<int> ord(n);
std::iota(ord.begin(), ord.end(), 0);
std::sort(ord.begin(), ord.end(), [&](int a, int b) { return height[a] < height[b]; });
check_tl
check_tl
// // dp1 - Alice, dp2 - Bob, dp3 - Alice restrictedcheck_tl
std::vector<int>
dp1(n, -1), dp2(n, n);
check_tl
std::vector<std::vector<int>>
dp3(n);
check_tl
check_tl for (int i = 0; i < n; i++) {
check_tl
dp3[i]
.assign(gr[i].size(), -1);
check_tl
}
check_tl
check_tl for (int i : ord) {
check_tl int g = gr[i].size();
check_tl {
check_tl auto dfs0 = [&](auto dfs0, int v, int f, int d) -> int {
check_tl if (d < 0) {
check_tl return n;
check_tl
}
check_tl int val = v;
check_tl for (int t : gr[v]) {
check_tl if (t != f) {
check_tl
val = std::min(val, dfs0(dfs0, t, v, d - 1));
check_tl
}
check_tl
}
check_tl return val;
check_tl
};
check_tl auto dfs1 = [&](auto dfs1, int v, int f, int d) -> int {
check_tl if (d == 0) {
check_tl
// return v;check_tl
return dp2[v];
check_tl
}
check_tl int val = -1;
check_tl for (int t : gr[v]) {
check_tl if (t != f) {
check_tl
val = std::max(val, dfs1(dfs1, t, v, d - 1));
check_tl
}
check_tl
}
check_tl return val;
check_tl
};
check_tl
check_tl if (height[i] < a) {
check_tl
dp1[i] = dfs0(dfs0, i, prv[i], b);
check_tl
}
else {
check_tl
dp1[i] = dfs1(dfs1, i, prv[i], a);
check_tl
assert(dp1[i] != -1);
check_tl
}
check_tl for (int j = 0; j < g; j++) {
check_tl int t = gr[i][j];
check_tl
dp3[i][j] = dfs1(dfs1, i, t, a);
check_tl if (dp3[i][j] == -1) {
check_tl
dp3[i][j] = dfs0(dfs0, i, t, b);
check_tl
}
check_tl
}
check_tl
}
check_tl {
check_tl auto dfs = [&](auto dfs, int v, int f, int d, int val) {
check_tl if (d < 0) {
check_tl return;
check_tl
}
check_tl
dp2[v] = std::min(dp2[v], val);
check_tl for (int t : gr[v]) {
check_tl if (t != f) {
check_tl
dfs(dfs, t, v, d - 1, val);
check_tl
}
check_tl
}
check_tl if (prv[i] != -1 && prv[i] != f) {
check_tl
dfs(dfs, prv[i], v, d - 1, val);
check_tl
}
check_tl
};
check_tl
dp2[i] = std::min(dp2[i], dp1[i]);
check_tl if (prv[i] != -1) check_tl
dfs(dfs, prv[i], i, b - 1, dp1[i]);
check_tl for (int j = 0; j < g; j++) {
check_tl int t = gr[i][j];
check_tl
dfs(dfs, t, i, b - 1, dp3[i][j]);
check_tl
}
check_tl
}
check_tl
// if (clock() * 1.0 / CLOCKS_PER_SEC > 1.0) {check_tl
// std::cout << i << " " << g << "\n";check_tl
// exit(1);check_tl
// }check_tl
}
check_tl
check_tl
std::cout
<< dp1[start] + 1 << "\n";
check_tl
check_tl return 0;
check_tl
}
详细
Subtask #1:
score: 1
Accepted
Test #1:
score: 1
Accepted
time: 105ms
memory: 20116kb
input:
300000 110732 1 1 54285 169439 18968 45543 130988 134682 162292 70081 212010 121474 128140 292466 209394 38279 91706 225569 67647 188578 265505 84279 161782 137098 27472 221980 284973 79104 230628 268631 69945 205947 153720 168119 230161 32244 138981 44376 165008 136947 125742 123375 209131 122038 8...
output:
1
result:
ok single line: '1'
Test #2:
score: 1
Accepted
time: 102ms
memory: 19964kb
input:
300000 123141 300000 300000 35459 173656 6934 241069 183095 87288 269195 16957 19492 242321 24470 81747 25697 172188 171424 220229 160473 69937 172168 99268 220664 39397 8212 2407 46718 94855 279515 295195 205222 167038 185958 111515 172553 45818 141322 214355 61335 64490 183502 105408 234540 245525...
output:
1
result:
ok single line: '1'
Test #3:
score: 1
Accepted
time: 118ms
memory: 19908kb
input:
298765 30225 2 3 265195 252069 113697 255482 227617 218688 279488 136408 179394 139291 86777 211320 255097 13136 68860 173342 178971 175020 278041 278319 285893 289677 194438 44163 56223 283058 110392 123602 20729 89517 152134 176747 121481 243463 297305 139297 244189 117068 181785 39468 154302 1860...
output:
1
result:
ok single line: '1'
Test #4:
score: 1
Accepted
time: 100ms
memory: 19684kb
input:
299987 224030 2 2 177674 20066 211112 287348 150440 136779 131528 209570 208840 36580 3395 152219 89118 44403 120439 274280 267578 80200 17796 257578 229408 211795 122773 147368 139779 842 94469 299092 211457 29057 9040 117449 216268 88141 40844 98163 183412 221031 230933 237086 147633 135982 282224...
output:
1
result:
ok single line: '1'
Test #5:
score: 1
Accepted
time: 0ms
memory: 3796kb
input:
2 1 1 2 2 1
output:
1
result:
ok single line: '1'
Subtask #2:
score: 0
Runtime Error
Test #6:
score: 0
Runtime Error
input:
300000 226344 300 9 32176 183340 249597 14851 145160 92372 30564 242505 1140 169463 279867 14442 266653 32911 168819 26009 138049 133460 5327 103921 262703 112512 204338 84304 98144 9089 98632 238236 79093 101104 50327 237759 61236 275195 241153 116369 86842 272794 25675 121176 110170 225753 199931 ...
output:
146
result:
Subtask #3:
score: 0
Runtime Error
Test #18:
score: 5
Accepted
time: 4ms
memory: 3700kb
input:
300 42 3 2 114 268 132 105 187 17 191 127 14 62 162 126 39 143 72 159 199 184 295 138 71 277 293 103 288 54 231 196 57 220 110 117 38 136 295 258 41 76 291 8 59 131 161 278 244 233 81 76 12 236 21 240 228 262 255 159 236 60 277 33 29 123 170 290 89 154 220 139 193 81 31 53 163 77 148 274 181 76 15 2...
output:
83
result:
ok single line: '83'
Test #19:
score: 5
Accepted
time: 4ms
memory: 3700kb
input:
300 178 3 2 277 106 123 105 235 290 273 34 300 180 43 55 239 74 19 138 110 201 295 18 207 97 238 177 114 24 195 219 154 186 151 294 143 291 47 293 33 99 2 46 101 39 109 240 15 256 43 121 205 261 267 257 81 167 82 23 300 182 13 46 195 221 163 17 109 93 144 23 110 17 153 129 91 243 281 74 135 72 145 1...
output:
4
result:
ok single line: '4'
Test #20:
score: 5
Accepted
time: 3ms
memory: 3660kb
input:
300 130 4 2 74 70 137 178 142 56 106 137 154 190 162 96 218 173 261 37 206 72 136 93 293 159 145 94 221 97 76 189 149 282 79 62 258 37 35 20 215 8 143 207 216 38 262 241 37 68 221 258 156 8 213 50 180 238 132 300 256 136 79 281 179 128 177 202 20 229 43 12 290 230 26 105 135 20 146 84 10 184 254 27 ...
output:
126
result:
ok single line: '126'
Test #21:
score: 5
Accepted
time: 0ms
memory: 3680kb
input:
300 49 4 2 199 123 264 232 60 265 215 2 226 189 160 11 200 217 194 175 295 203 20 165 203 63 132 127 42 259 170 293 230 269 20 166 141 96 149 210 246 122 5 185 90 156 297 21 300 78 24 94 139 154 268 258 53 15 267 67 221 248 298 154 136 254 192 234 142 170 56 217 90 25 228 216 216 186 61 90 14 221 27...
output:
26
result:
ok single line: '26'
Test #22:
score: 5
Accepted
time: 0ms
memory: 3648kb
input:
300 250 3 1 91 120 269 191 244 235 202 92 3 146 190 210 175 190 243 20 280 75 81 296 179 85 278 283 123 134 98 35 29 65 219 268 242 135 143 238 274 127 99 243 141 231 285 68 269 76 15 61 179 157 165 139 52 49 247 50 151 50 262 161 132 270 224 15 228 144 56 100 293 35 80 98 188 65 263 43 267 234 243 ...
output:
149
result:
ok single line: '149'
Test #23:
score: 5
Accepted
time: 0ms
memory: 3724kb
input:
300 205 3 1 43 211 182 106 31 159 33 141 50 122 33 108 65 275 218 285 263 71 39 211 41 91 264 151 211 286 298 228 84 96 292 176 78 239 107 28 247 265 132 182 225 257 70 58 165 61 162 35 221 23 168 234 279 130 111 261 157 34 61 47 299 97 129 233 247 245 280 60 137 252 241 248 275 91 251 178 288 181 2...
output:
45
result:
ok single line: '45'
Test #24:
score: 5
Accepted
time: 3ms
memory: 3924kb
input:
300 151 10 4 106 66 88 78 279 12 92 142 298 168 98 117 8 108 104 192 50 216 227 176 77 297 149 195 94 11 72 69 235 267 261 11 131 35 115 146 140 73 132 251 185 145 29 193 52 90 287 39 261 300 24 206 223 59 270 35 225 35 32 95 184 244 52 164 276 118 220 268 249 251 187 217 288 71 297 34 171 198 178 2...
output:
2
result:
ok single line: '2'
Test #25:
score: 0
Runtime Error
input:
300 203 300 10 2 182 179 26 120 101 281 271 236 75 260 242 121 271 32 66 277 14 98 47 152 83 231 39 145 93 23 127 203 76 76 252 65 31 33 62 60 201 154 147 42 83 13 203 203 2 265 292 96 30 23 85 23 64 220 30 189 277 296 44 63 110 107 202 61 93 134 286 65 122 133 241 152 142 97 84 209 202 267 47 255 8...
output:
136
result:
Subtask #4:
score: 0
Skipped
Dependency #3:
0%
Subtask #5:
score: 0
Runtime Error
Test #49:
score: 0
Runtime Error
input:
100000 20749 3 2 89778 51257 2293 75317 20142 42260 55350 69024 2419 90402 2248 71914 60607 94307 33933 57799 79884 93934 9788 53542 18109 28742 7700 93763 12102 78825 34580 61577 84344 12887 63610 12371 30988 75638 47533 66209 95296 22495 12638 545 36347 57495 41813 49592 60342 1881 38899 62345 524...
output:
146
result:
Subtask #6:
score: 0
Skipped
Dependency #4:
0%
Subtask #7:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%