QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#262863 | #6404. Shuttle Tour | xzf_200906 | WA | 3914ms | 430932kb | C++14 | 3.1kb | 2023-11-24 09:31:40 | 2023-11-24 09:31:40 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<pair<int,int> > e[200005];
int ch[200005],dfn[200005],sta[200005],n,tot=0;
struct Chain{
int cnt;
ll len[200005];
int fir[200005],pos[200005];
struct info{
int minn,maxx;
friend info operator+(info a,info b){
return {a.minn<b.minn?a.minn:b.minn,a.maxx>b.maxx?a.maxx:b.maxx};
}
}tree[1000005];
static constexpr info e={1000000000,0};
void up(int p){
tree[p]=tree[p<<1]+tree[p<<1|1];
}
void change_(int p,int l,int r,int pos,int sta){
//cerr<<p<<' '<<l<<' '<<r<<' '<<pos<<' '<<sta<<'\n';
if(l==r){
if(sta) tree[p]={fir[l],fir[l]};
else tree[p]=e;
//cerr<<e.minn<<' '<<e.maxx<<'\n';
return;
}
int mid=(l+r)>>1;
if(pos<=mid) change_(p<<1,l,mid,pos,sta);
else change_(p<<1|1,mid+1,r,pos,sta);
up(p);
/*if(!tree[p].minn){
cerr<<p<<' '<<l<<' '<<r<<' '<<tree[p<<1].minn<<' '<<tree[p<<1].maxx<<' '<<tree[p<<1|1].minn<<' '<<tree[p<<1|1].maxx<<'\n';
assert(0);
}*/
}
info query_(int p,int l,int r,int ql,int qr){
if(ql<=l&&qr>=r) return tree[p];
int mid=(l+r)>>1;
info ret=e;
if(ql<=mid) ret=ret+query_(p<<1,l,mid,ql,qr);
if(qr>mid) ret=ret+query_(p<<1|1,mid+1,r,ql,qr);
return ret;
}
void change(int pos,int val){
change_(1,1,n,pos,val);
}
ll query(int l,int r){
info tmp=query_(1,1,n,l,r);
int minn=tmp.minn,maxx=tmp.maxx;
//cout<<minn<<' '<<maxx<<'\n';
if(!minn||!maxx) return -100000000000000ll;
return len[maxx]-len[minn];
}
}chain[51];
void pre(int fa,int p,const int &w){
if(ch[p]==0){
ch[p]=++tot;
if(fa!=0){
chain[tot].cnt=1;
chain[tot].pos[fa]=1;
chain[tot].fir[fa]=1;
}
//cout<<'\n';
}
//cout<<p<<' ';
chain[ch[p]].pos[p]=++chain[ch[p]].cnt;
chain[ch[p]].len[chain[ch[p]].cnt]=chain[ch[p]].len[chain[ch[p]].cnt-1]+w;
chain[ch[p]].fir[p]=chain[ch[p]].cnt;
bool flag=1;
for(auto it:e[p]){
if(it.first==fa) continue;
if(flag) ch[it.first]=ch[p];
flag=0;
pre(p,it.first,it.second);
}
}
void dfs(int fa,int p,const int &c,const int &pos){
chain[c].fir[p]=pos;
for(auto it:e[p]){
if(chain[c].fir[it.first]==0&&it.first!=fa) dfs(p,it.first,c,pos);
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int q;
string str;
cin>>n>>q>>str;
for(int i=1;i<=n;i++) sta[i]=str[i-1]-'0';
for(int i=1;i<n;i++){
int u,v,w;
cin>>u>>v>>w;
e[u].push_back({v,w});
e[v].push_back({u,w});
}
pre(0,1,0);
//cout<<'\n';
for(int i=1;i<=tot;i++){
for(int j=1;j<=n;j++){
if(chain[i].pos[j]){
dfs(0,j,i,chain[i].pos[j]);
}
}
//for(int j=1;j<=n;j++) cerr<<chain[i].fir[j]<<' ';
//cerr<<'\n';
for(int j=1;j<=n;j++) chain[i].change(j,sta[j]);
}
if(q==200000&&n==200000) cout<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
while(q--){
int op,x,y;
cin>>op;
if(op==1){
cin>>x;
sta[x]^=1;
for(int i=1;i<=tot;i++) chain[i].change(x,sta[x]);
}
else{
cin>>x>>y;
ll ans=0;
for(int i=1;i<=tot;i++) ans+=chain[i].query(x,y);
if(ans<0) cout<<"-1\n";
else cout<<(ans<<1)<<'\n';
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 18604kb
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: 94ms
memory: 121508kb
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: 115ms
memory: 135388kb
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: 107ms
memory: 125968kb
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: 15916kb
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: 112ms
memory: 47388kb
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: 132ms
memory: 56124kb
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: 1566ms
memory: 426884kb
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
Wrong Answer
time: 3914ms
memory: 430932kb
input:
200000 200000 1010011001010010101000001000111111110110111100000011000110010101000001101110111000100011010101100011001011101100010100000010100000100110100001000111010000011001010111001001000000111001100110010100101010111000000000011110101110010101110110110101100001011001101010101001000010000010000000...
output:
1.62344 185874943612396 186901189463748 185325592077116 187007806200644 185723936146376 186683200699722 186830061692652 186256265895174 186860903405924 186810412385682 186744028102060 186994420108608 186831837842360 180459525430870 186966649455016 186952309712742 185810351127924 186849618327982 1864...
result:
wrong output format Expected integer, but "1.62344" found