QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#267174 | #7736. Red Black Tree | ucup-team228 | AC ✓ | 258ms | 31252kb | C++20 | 4.8kb | 2023-11-27 00:40:37 | 2024-02-19 10:15:10 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 10;
struct MinDeque {
deque<pair<int, int>> data;
deque<pair<int, int>> suf_min;
void push_back(int val, int pos) {
auto cur = make_pair(val, -pos);
while (!suf_min.empty() && suf_min.back() > cur) {
suf_min.pop_back();
}
data.push_back(cur);
suf_min.push_back(cur);
}
void pop_front() {
if (!data.empty()) {
if (suf_min.front() == data.front()) {
suf_min.pop_front();
}
data.pop_front();
}
}
int get_min() const {
if (data.empty()) {
return inf;
} else {
return suf_min.front().first;
}
}
size_t size() const {
return data.size();
}
void clear() {
data.clear();
suf_min.clear();
}
};
void add(int& x, int y) {
x = min(inf, x + y);
}
MinDeque mdeq;
const int N = 1e5 + 10;
vector<int> g[N];
bool is_black[N];
int ans[N];
vector<int> dp[N];
int reds[N], blacks[N];
int dist_leaf[N];
void init(int n) {
for (int i = 1; i <= n; i++) {
g[i].clear();
dp[i].clear();
reds[i] = 0;
blacks[i] = 0;
dist_leaf[i] = 0;
}
}
void recalc(vector<int>& cur, int red_cnt, int black_cnt, int max_len) {
cur.resize(max_len + red_cnt + black_cnt, inf);
// cur.resize(cur.size() + red_cnt, inf);
mdeq.clear();
for (int i = 0; i < cur.size(); i++) {
mdeq.push_back(cur[i] - i, i);
while (mdeq.size() > red_cnt + 1) {
mdeq.pop_front();
}
cur[i] = mdeq.get_min() + i;
}
// cur.resize(cur.size() + black_cnt, inf);
for (int i = int(cur.size()) - 1; i >= 0; i--) {
if (i >= black_cnt) {
cur[i] = cur[i - black_cnt];
} else {
cur[i] = inf;
}
}
mdeq.clear();
for (int i = int(cur.size()) - 1; i >= 0; i--) {
mdeq.push_back(cur[i] + i, -i);
while (mdeq.size() > black_cnt + 1) {
mdeq.pop_front();
}
cur[i] = mdeq.get_min() - i;
}
cur.resize(max_len);
}
void dfs(int v, int p) {
if (g[v].empty()) {
ans[v] = 0;
reds[v] = 0;
blacks[v] = 0;
dp[v] = {is_black[v], !is_black[v]};
dist_leaf[v] = 0;
} else if (g[v].size() == 1) {
int to = g[v].front();
dfs(to, v);
dist_leaf[v] = dist_leaf[to] + 1;
ans[v] = ans[to];
reds[v] = reds[to] + !is_black[v];
blacks[v] = blacks[to] + is_black[v];
swap(dp[v], dp[to]);
dp[to].clear();
} else {
dist_leaf[v] = inf;
for (int to : g[v]) {
dfs(to, v);
dist_leaf[v] = min(dist_leaf[v], dist_leaf[to] + 1);
}
dp[v].assign(dist_leaf[v] + 2, 0);
for (int to : g[v]) {
assert(dp[to].size() + reds[to] + blacks[to] == dist_leaf[to] + 2);
recalc(dp[to], reds[to], blacks[to], dp[v].size());
for (int i = 0; i < dp[v].size(); i++) {
add(dp[v][i], dp[to][i]);
}
dp[to].clear();
}
if (is_black[v]) {
for (int i = int(dp[v].size()) - 1; i >= 1; i--) {
dp[v][i] = dp[v][i - 1];
}
dp[v][0] = inf;
for (int i = 0; i + 1 < dp[v].size(); i++) {
dp[v][i] = min(dp[v][i], dp[v][i + 1] + 1);
}
} else {
dp[v].back() = inf;
for (int i = int(dp[v].size()) - 1; i >= 1; i--) {
dp[v][i] = min(dp[v][i], dp[v][i - 1] + 1);
}
}
reds[v] = 0;
blacks[v] = 0;
ans[v] = inf;
for (int i = 0; i < dp[v].size(); i++) {
ans[v] = ans[v] = min(ans[v], dp[v][i]);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
init(n);
string cols;
cin >> cols;
for (int i = 1; i <= n; i++) {
is_black[i] = cols[i - 1] == '1';
}
for (int i = 2; i <= n; i++) {
int par;
cin >> par;
g[par].push_back(i);
}
dfs(1, 1);
for (int i = 1; i <= n; i++) {
cout << ans[i];
if (i != n) {
cout << " ";
}
}
if (t >= 1) {
cout << "\n";
}
}
#ifdef LOCAL
cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3664kb
input:
2 9 101011110 1 1 3 3 3 6 2 2 4 1011 1 1 3
output:
4 1 2 0 0 0 0 0 0 2 0 0 0
result:
ok 2 lines
Test #2:
score: 0
Accepted
time: 184ms
memory: 31252kb
input:
6107 12 000000001000 1 2 3 2 5 4 4 7 3 8 11 19 1100111101111011110 1 2 1 1 4 5 2 4 3 2 2 7 10 2 11 3 15 5 7 0111110 1 1 2 2 1 5 3 000 1 1 7 1000011 1 2 3 3 5 4 7 0001001 1 1 1 3 5 3 8 00111000 1 1 3 2 5 2 7 11 11111110111 1 1 1 4 5 4 5 2 5 1 15 110101101000010 1 2 3 2 1 5 2 5 6 5 8 7 9 14 10 0101000...
output:
1 1 1 1 0 0 0 0 0 0 0 0 6 2 0 1 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 1 0 0 0 0 2 1 0 0 0 0 0 0 4 0 0 2 1 0 0 0 0 0 0 4 3 0 0 2 0 0 0 0 0 0 0 0 0 0 2 0 1 0 0 0 0 0 0 0 6 5 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 5 1 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 5 3 ...
result:
ok 6107 lines
Test #3:
score: 0
Accepted
time: 258ms
memory: 16372kb
input:
10 100000 10001010000001100001000100001000010100010101100001001110110001000010000110001000000010000011000001000001010001110100000000000000000010011011100000000000001000000000100100100110000000100001010011000000110000000111010100100001100000100100101001000000010000000011100000000000000010001100011100...
output:
22440 21414 19422 13454 5328 2719 1421 1168 1478 661 4662 5037 418 183 2304 501 2008 1643 692 2211 570 1003 967 950 504 124 894 333 775 523 905 197 12 337 195 310 1325 1016 638 50 907 361 179 336 313 102 309 555 733 871 490 414 375 318 66 625 336 267 276 162 203 25 112 216 252 146 42 233 232 333 27 ...
result:
ok 10 lines
Test #4:
score: 0
Accepted
time: 138ms
memory: 11276kb
input:
10 100000 01010111111101011100011111111010011001111111110001100111111101011111110011101111110110111011010111011011010011111110101111111011111111011101011111011001110101111011011010110100011111001101001011111101111101111111111100101101000111111110111101111111111011111100111011101110110101111010101101...
output:
25019 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok 10 lines
Test #5:
score: 0
Accepted
time: 98ms
memory: 25788kb
input:
10 100000 00111110110011111111111010011111011111101010110111111110011110111111111111000110101110110111111101011111111111010101111111011001110110011101111001110111101101110110101000011111110100101110110100111110001111011100111101011010111111011011100011111011110111111110011110111111001111111010011100...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok 10 lines
Test #6:
score: 0
Accepted
time: 118ms
memory: 23908kb
input:
10 100000 00111100100100001111011000100000000000111001100000000000100000101001001010010000001000010010111000001011010000000000001000000000010100000010010010000001000010001000000100000001010000000000000000000001000110000010100100000010000011000000000010010000100010100000000100000100100011000000001000...
output:
4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 4415 ...
result:
ok 10 lines
Test #7:
score: 0
Accepted
time: 158ms
memory: 27904kb
input:
10 100000 00111101111001101110101101111110100001010100011011100001011100000110000100100010111010011001111011100010010011111100000011111011001001000110000101101001011110000000011100001010100001000110110101111010000100000111001110001100001001001000101110100111111000101101100000011001110111001111101011...
output:
210 210 210 210 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok 10 lines
Test #8:
score: 0
Accepted
time: 167ms
memory: 25456kb
input:
10 100000 00010011111100101111110000110010101110000000001111011110011010011011101011010000111100001001111111111001000110100010001111010111101100101111101100001001100110000011010100110110010101000010111001001010110111011000010100110101110001100110101010101001100010100000100000100101011110000100001001...
output:
6360 6360 4803 4803 1549 1549 1555 1555 1555 1595 1555 1549 1549 1555 1555 1600 1555 1549 1549 1549 1555 1555 1555 1555 1595 1549 1555 1555 1555 1555 1595 1595 1600 1555 1600 1600 1595 1549 1555 1555 1549 1600 1595 1600 1555 1595 1595 1549 1549 1549 1549 1555 1549 1549 1600 1595 1555 1549 1549 1555 ...
result:
ok 10 lines
Test #9:
score: 0
Accepted
time: 207ms
memory: 14208kb
input:
10 100000 11000111101111111101001011010110110111010011000111011111011111110111110000110101111111011101111011111111101110011100011101111111001011111101011111110010011111101111111011101101100110101010011111110111111101100101010011111111111100101111111101111100011100111110111111011111011001111110011101...
output:
18217 12003 6214 6012 5991 3232 2982 3008 3004 2973 3017 1780 1451 1499 1483 1513 1495 1486 1516 1499 1474 1509 1508 1037 743 738 713 722 776 752 731 741 771 759 735 731 755 740 776 733 765 736 738 753 756 739 769 678 359 362 380 364 374 342 370 356 364 393 382 367 385 360 371 370 371 383 387 387 37...
result:
ok 10 lines
Test #10:
score: 0
Accepted
time: 186ms
memory: 21236kb
input:
10 100000 10111111011011110010111111111111110111101110110001011111101110111011111111111101101011111101101001100111011011011101001110110110101010010001010111111111111111111011011011101011011101100001111101111110111110010011011111111011101110111111111110010011110011111011011011111111101111001110111111...
output:
50037 0 50035 0 50034 0 50033 0 50033 0 50032 0 50030 0 50029 0 50029 0 50027 0 50025 0 50024 0 50023 0 50022 0 50021 0 50020 0 50019 0 50019 0 50018 0 50017 0 50015 0 50014 0 50012 0 50012 0 50011 0 50011 0 50010 0 50009 0 50008 0 50006 0 50005 0 50003 0 50002 0 50000 0 49999 0 49998 0 49997 0 4999...
result:
ok 10 lines
Extra Test:
score: 0
Extra Test Passed