QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#310990 | #6404. Shuttle Tour | PlentyOfPenalty | TL | 1462ms | 618744kb | C++17 | 5.0kb | 2024-01-21 20:36:14 | 2024-01-21 20:36:14 |
Judging History
answer
#include "bits/stdc++.h"
typedef long long ll;
typedef unsigned un;
using namespace std;
typedef std::pair<ll, ll> pll;
typedef std::pair<int, ll> pil;
const int MAXN = 200011;
const ll INF = 5e18;
pll merge(pll a, pll b) {
if (a.second == INF) return b;
return pll(max(a.first, b.first), min(a.second, b.second));
}
int n, q;
struct Segment_Tree {
struct node {
ll maxv, minv;
} t[MAXN << 2 | 1];
#define rt t[num]
void pushup(un num) {
rt.maxv = max(t[num << 1].maxv, t[num << 1 | 1].maxv);
rt.minv = min(t[num << 1].minv, t[num << 1 | 1].minv);
}
void build(ll *arr, un l = 1, un r = n, un num = 1) {
if (l == r) {
if (arr[l] == -1)
rt.maxv = 0, rt.minv = INF;
else
rt.maxv = rt.minv = arr[l];
// rt.maxv = 0, rt.minv = INF;
return;
}
un mid = (l + r) >> 1;
build(arr, l, mid, num << 1), build(arr, mid + 1, r, num << 1 | 1);
pushup(num);
}
void modify(un pos, ll val, un l = 1, un r = n, un num = 1) {
if (l == r) {
if (val == -1)
rt.maxv = 0, rt.minv = INF;
else
rt.maxv = rt.minv = val;
return;
}
un mid = (l + r) >> 1;
if (pos <= mid)
modify(pos, val, l, mid, num << 1);
else
modify(pos, val, mid + 1, r, num << 1 | 1);
pushup(num);
}
pll Query(un ql, un qr, un l = 1, un r = n, un num = 1) {
if (ql <= l && r <= qr) return pll(rt.maxv, rt.minv);
pll res(0, INF);
un mid = (l + r) >> 1;
if (ql <= mid) res = merge(res, Query(ql, qr, l, mid, num << 1));
if (qr > mid) res = merge(res, Query(ql, qr, mid + 1, r, num << 1 | 1));
return res;
}
} sgt[51];
std::vector<pll> g[MAXN];
ll ctrb[MAXN][51];
// std::vector<pil>ctrb[MAXN];
int fa[MAXN], top[MAXN], loc[MAXN];
ll dis[MAXN], val[MAXN];
int cur = 0;
string s;
void push(int u, int sp, int c, int d) {
// if (s[u] == '1') sgt[c].modify(u, dis[d]); //, printf("sgt[%d] modify %d %lld\n", c, u, dis[d]);
ctrb[u][c] = dis[d];
// ctrb[u].push_back(pil(c,d));
for (auto P : g[u]) {
int v = P.first;
if (v != sp && v != fa[u]) push(v, sp, c, d);
}
}
void dfs(int u, int t, bool type) {
// printf("u=%d,t=%d\n",u,t);
if (type) ++cur, t = u;
top[u] = t, loc[u] = cur;
// printf("loc[%d]=%d\n", u, cur);
int p = u;
while (p) {
ctrb[u][loc[p]] = dis[p];
// ctrb[u].emplace_back(pil(loc[p],dis[p]));
// if (s[u] == '1') sgt[loc[p]].modify(u, dis[p]); //, printf("sgt[%d] modify %d %lld\n", loc[p], u, dis[p]);
p = fa[top[p]];
}
// printf("now,u=%d\n", u);
bool flag = 0;
for (auto P : g[u]) {
int v = P.first;
ll w = P.second;
if (v == fa[u]) continue;
fa[v] = u, dis[v] = dis[u] + w;
dfs(v, t, flag);
flag = 1;
}
}
int main() {
memset(ctrb, -1, sizeof ctrb);
// freopen("K.in","r",stdin);
cin.tie(0)->sync_with_stdio(0);
cin >> n >> q >> s;
s.insert(s.begin(), 0);
for (int i = 1; i < n; ++i) {
int u, v, w;
cin >> u >> v >> w;
g[u].emplace_back(pll(v, w));
g[v].emplace_back(pll(u, w));
}
// for(int i=1;i<=n;++i)val[0][i]=-1;
dfs(1, 1, 1);
for (int u = 1; u <= n; ++u) {
int flag = 0;
for (auto P : g[u]) {
int v = P.first;
if (v == fa[u]) continue;
if (flag) push(1, v, loc[v], u);
flag = 1;
}
}
for (int k = 1; k <= cur; ++k) {
// printf("k=%d\n", k);
for (int i = 1; i <= n; ++i)
val[i] = -1;
for (int u = 1; u <= n; ++u)
if (s[u] == '1' && ctrb[u][k] != -1) val[u] = ctrb[u][k]; //, printf("ctrb[%d,%d]=%lld\n", u, k, ctrb[u][k]);
sgt[k].build(val);
}
// puts("Pass dfs!");
while (q--) {
int op;
cin >> op;
if (op == 1) {
int x;
cin >> x;
if (s[x] == '1') {
for (int c = 1; c <= cur; ++c)
if (ctrb[x][c] != -1) sgt[c].modify(x, -1);
s[x] = '0';
} else {
for (int c = 1; c <= cur; ++c)
if (ctrb[x][c] != -1) sgt[c].modify(x, ctrb[x][c]);
s[x] = '1';
}
} else {
int l, r, cnt = 0;
cin >> l >> r;
ll ans = 0;
for (int k = 1; k <= cur; ++k) {
pll f = sgt[k].Query(l, r);
if (f.first >= f.second)
ans += f.first - f.second;
else
++cnt;
}
if (cnt == cur)
cout << "-1\n";
else
cout << (ans << 1) << '\n';
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 97820kb
input:
5 6 10110 1 2 1 1 3 10 2 4 100 3 5 1000 2 1 5 1 3 2 1 5 2 2 4 2 5 5 2 1 1
output:
222 202 0 -1 0
result:
ok 5 number(s): "222 202 0 -1 0"
Test #2:
score: 0
Accepted
time: 109ms
memory: 142896kb
input:
50 200000 00100100100001101010110100000111100011101110011010 14 47 940241413 11 43 331483591 37 38 496247070 47 46 832459694 7 15 16479291 1 30 402388666 30 8 513064064 46 50 739311480 5 4 761894947 32 41 631669659 17 24 715786564 35 20 763151642 32 33 492466005 39 11 186023146 9 7 805081251 3 42 25...
output:
17149847378 -1 26540740138 29613692754 21307948558 27003443184 11893407374 18332625722 20412196350 20281573062 29727468956 9593307160 9380710234 23682775470 16688997988 2856655228 14982588156 0 -1 9140136614 26193602866 22558599316 24807163344 19126284190 8533875940 7695830712 18079494744 0 27004673...
result:
ok 100000 numbers
Test #3:
score: 0
Accepted
time: 127ms
memory: 144948kb
input:
50 200000 10010001110011101101101011010011100101101010111001 1 25 560163135 2 7 696374536 33 39 14485266 39 22 456690113 4 5 267811886 18 6 657680382 3 43 865617406 25 14 885515220 41 34 919525052 42 50 410634144 8 3 487403277 3 30 701549676 2 43 54223104 7 34 691078766 14 23 323352590 26 48 4936558...
output:
17177676326 31373486130 15290175638 8192974494 22734716092 27802380120 6315957348 0 15780401446 15929384564 26423899248 9639532596 21199366790 26413065782 -1 29063665908 29925313598 28651879288 17144176262 16526083688 28206620550 26873163342 14840246174 32414950818 29985336496 0 11937422088 11131990...
result:
ok 100000 numbers
Test #4:
score: 0
Accepted
time: 110ms
memory: 138860kb
input:
50 200000 01011001001010000100001101100111011001101011101000 34 29 654100339 33 5 947063765 45 25 962067151 11 13 509130797 26 47 988757358 49 22 75267557 7 11 431530851 46 1 531969122 22 43 449891945 34 6 526679193 50 17 499004364 22 23 226725950 26 48 203414490 11 44 900725507 10 29 451714017 35 2...
output:
24080362406 0 0 21418182584 28358635244 28257750030 24520294678 21418182584 0 15335211126 28621468542 18664505530 19335499776 32374868794 23618866752 26801803500 24116134918 27676993638 30222353942 25612316674 20504702130 28400398734 29472795250 24400110084 20586186786 25612316674 0 30067400886 1297...
result:
ok 100000 numbers
Test #5:
score: 0
Accepted
time: 4ms
memory: 93856kb
input:
2 10 01 1 2 340134039 2 1 2 1 1 2 1 2 1 2 2 1 1 1 2 2 2 2 1 2 2 2 2 1 1
output:
0 680268078 0 0 -1
result:
ok 5 number(s): "0 680268078 0 0 -1"
Test #6:
score: 0
Accepted
time: 130ms
memory: 136524kb
input:
200000 100 1100001001001101010000111111011011101010001011011011011010101111010001111010101100101001010000110100100011111010011100101010010001011010111100101110010000101010000100111100000011001100111101110011000011010011011011100101100111101010111101110111001111111010001010010000110110100000111000111...
output:
187263442365796 187267199881816 187176203274470 187269896250018 187239740690858 186974761323092 187257776119514 187269896250018 187035239640930 186911636122472 187263030332128 187121605387264 187264313877130 187263442365796 187269896250018 187249588971104 187263442365796 187263442365796 187264313877...
result:
ok 50 numbers
Test #7:
score: 0
Accepted
time: 155ms
memory: 148060kb
input:
200000 100 1000100001000101011000010111101000110001110111010000000010100100001110001110011001001011000010001000101111000111000100111101111111011111101101011110010101110000011011000101010000101110000100101000101110011111110000010011010010001001010001101000001111001001011111110100100011011100010100101...
output:
187406582272754 187713357625510 187713357625510 187710409039730 187708440524170 187705546874918 187675370061160 187696435101958 187704004975728 187708440524170 187708440524170 187490194913408 186797006090958 187708440524170 187708440524170 187694259450196 187691068337432 187699562335668 187708440524...
result:
ok 50 numbers
Test #8:
score: 0
Accepted
time: 1462ms
memory: 618744kb
input:
200000 100 1101110101111010101100101110111101001010101100011111011010101101001011000101011011110110110001000000110000100110101010001011100110100101010110001111000100011010101011100011111010111001011110110001001010000001010100000000100010010000110100101010000111010100100111001011101001000011010101011...
output:
187071935465024 186902015424650 186944515923806 187083386398370 187083386398370 186176053533638 187210565613960 186840136921858 187059112646348 186963648681914 187157614978100 187171857507720 186687953621656 187037985042418 184267618052908 185811051686090 186716949587794 186666528269428 186754258305...
result:
ok 50 numbers
Test #9:
score: -100
Time Limit Exceeded
input:
200000 200000 1010011001010010101000001000111111110110111100000011000110010101000001101110111000100011010101100011001011101100010100000010100000100110100001000111010000011001010111001001000000111001100110010100101010111000000000011110101110010101110110110101100001011001101010101001000010000010000000...
output:
185874943612396 186901189463748 185325592077116 187007806200644 185723936146376 186683200699722 186830061692652 186256265895174 186860903405924 186810412385682 186744028102060 186994420108608 186831837842360 180459525430870 186966649455016 186952309712742 185810351127924 186849618327982 186494273101...