QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#786105 | #6404. Shuttle Tour | StayAlone | TL | 184ms | 352260kb | C++17 | 4.5kb | 2024-11-26 20:19:45 | 2024-11-26 20:19:45 |
Judging History
answer
#include <bits/stdc++.h>
#define rep1(i, l, r) for (int i = l; i <= int(r); ++i)
#define rep2(i, l, r) for (int i = l; i >= int(r); --i)
#define rer(i, l, r, a) rep1(i, l, r) read(a[i])
#define ptc putchar
#define il inline
#define eb emplace_back
#define ef emplace_front
#define mp make_pair
#define fst first
#define snd second
#define sqr(x) ((x) * (x))
#define ls(x) x << 1
#define rs(x) x << 1 | 1
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef __int128 bll;
// typedef unsigned __int128 ubll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5 + 10, LOGN = log2(MAXN) + 1, inf = ~0U >> 2, INF = ~0U >> 1;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
namespace stupid_lrc {
template <typename T> il bool read(T &x) {
x = 0; bool f = false; char ch;
while (!isdigit(ch = getchar())) {
f ^= !(ch ^ '-');
if (ch == EOF) return false;
}
while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch & 15), ch = getchar();
if (f) x = ~x + 1; return true;
}
il int read() {int x; read(x); return x;}
template <typename T> il bool read(pair <T, T> &x) {return read(x.fst) && read(x.snd);}
template <typename T> il void gmin(T &x, T y) {x = x < y ? x : y;}
template <typename T> il void gmax(T &x, T y) {x = x > y ? x : y;}
template <typename T, typename ...L>
il bool read(T &x, L &...y) {return read(x) && read(y...);}
template <typename T> il T lowbit(const T &x) {return x & -x;}
}
using namespace stupid_lrc;
int n, q, cnt, dep[MAXN], a[MAXN], dfn[MAXN], edfn[MAXN], stp, id[MAXN];
int f[MAXN][20]; ll sum[MAXN]; char s[MAXN];
vector <pii> lnk[MAXN];
struct {
#define STZ MAXN << 2
int mii[STZ], maa[STZ];
il void pushup(int x) {
mii[x] = min(mii[ls(x)], mii[rs(x)]);
maa[x] = max(maa[ls(x)], maa[rs(x)]);
}
il void build(int x, int l, int r, int t) {
if (l == r) {
if (t == id[l] && a[l]) maa[x] = mii[x] = dfn[l];
else maa[x] = -1, mii[x] = inf;
return;
} int mid = l + r >> 1;
build(ls(x), l, mid, t); build(rs(x), mid + 1, r, t);
pushup(x);
}
il void upd(int x, int l, int r, int k, int t) {
if (l == r) {
if (t == id[l] && a[l]) maa[x] = mii[x] = dfn[l];
else maa[x] = -1, mii[x] = inf;
return;
} int mid = l + r >> 1;
k <= mid ? upd(ls(x), l, mid, k, t) : upd(rs(x), mid + 1, r, k, t);
pushup(x);
}
il int query1(int x, int l, int r, int ql, int qr) {
if (l > qr || r < ql) return inf;
if (l >= ql && r <= qr) return mii[x];
int mid = l + r >> 1;
return min(query1(ls(x), l, mid, ql, qr), query1(rs(x), mid + 1, r, ql, qr));
}
il int query2(int x, int l, int r, int ql, int qr) {
if (l > qr || r < ql) return -1;
if (l >= ql && r <= qr) return maa[x];
int mid = l + r >> 1;
return max(query2(ls(x), l, mid, ql, qr), query2(rs(x), mid + 1, r, ql, qr));
}
} T[55];
il void dfs(int x, int p, int t) {
dfn[x] = ++stp; id[x] = t; edfn[stp] = x;
bool fg = 0; f[x][0] = p; dep[x] = dep[p] + 1;
for (auto t : lnk[x]) if (t.fst ^ p) {
sum[t.fst] = sum[x] + t.snd;
if (fg) dfs(t.fst, x, ++cnt);
else dfs(t.fst, x, cnt), fg = 1;
}
}
il ll dis(int x, int y) {
ll ans = sum[x] + sum[y];
if (dep[x] < dep[y]) swap(x, y);
rep2(i, 17, 0) if (dep[x] - dep[y] >= 1 << i) x = f[x][i];
if (x == y) return ans - sum[x] * 2;
rep2(i, 17, 0) if (f[x][i] ^ f[y][i]) x = f[x][i], y = f[y][i];
return ans - sum[f[x][0]] * 2;
}
il void solve() {
mt19937 rand(time(0));
read(n, q); cnt = 0; scanf("%s", s + 1);
rep1(i, 1, n) a[i] = s[i] & 15;
int u, v, w;
rep1(i, 2, n) read(u, v, w), lnk[u].eb(v, w), lnk[v].eb(u, w);
rep1(i, 1, n) shuffle(begin(lnk[i]), end(lnk[i]), rand);
dfs(1, 0, ++cnt);
rep1(j, 1, 17) rep1(i, 1, n) f[i][j] = f[f[i][j - 1]][j - 1];
rep1(i, 1, cnt) T[i].build(1, 1, n, i);
while (q--) {
int op = read();
if (op == 1) {
int x = read(); a[x] ^= 1;
T[id[x]].upd(1, 1, n, x, id[x]);
} else {
vector <int> dot; int l, r; read(l, r);
rep1(i, 1, cnt) {
int x = T[i].query1(1, 1, n, l, r), y = T[i].query2(1, 1, n, l, r);
if (x >= 1 && x <= n) dot.eb(edfn[x]);
if (y >= 1 && y <= n && x != y) dot.eb(edfn[y]);
} sort(begin(dot), end(dot), [&](const int &x, const int &y){return dfn[x] < dfn[y];});
if (dot.empty()) {
puts("-1");
continue;
} int q = dot.size(); ll ans = 0;
rep1(i, 0, q - 1) ans += dis(dot[i], dot[(i + 1) % q]);
printf("%lld\n", ans);
}
}
}
int main() {
for (int T = 1; T--; ) solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 4ms
memory: 24172kb
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: 184ms
memory: 109560kb
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: 184ms
memory: 118212kb
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: 178ms
memory: 112712kb
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: 0ms
memory: 19308kb
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: 82ms
memory: 59216kb
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: 82ms
memory: 65276kb
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: 105ms
memory: 352260kb
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...