QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#786115#6404. Shuttle TourStayAloneAC ✓3574ms548208kbC++174.0kb2024-11-26 20:22:172024-11-26 20:22:17

Judging History

你现在查看的是最新测评结果

  • [2024-11-26 20:22:17]
  • 评测
  • 测评结果:AC
  • 用时:3574ms
  • 内存:548208kb
  • [2024-11-26 20:22:17]
  • 提交

answer

//This is real Sp
//Author:Leftist_G / Shunpower
//Cloud Island & Rain Temperature
//May the force be with you and me.
#include <bits/stdc++.h>
#define ET return 0
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ll long long
#define ull unsigned long long
#define inf INT_MAX
#define uinf INT_MIN
#define pii pair<int,int>
#define pll pair<ll,ll>
#define debug puts("--------Chery AK IOI--------");
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define pt puts("")
#define fr1(i,a,b) for(int i=a;i<=b;i++)
#define fr2(i,a,b) for(int i=a;i>=b;i--)
#define fv(i,p) for(int i=0;i<p.size();i++)
#define ld long double
#define il inline
#define ptc putchar
using namespace std;
const int N=2e5+10;
int n,q;
char s[N];
vector <pii> p[N];
ll dis[N];
int dep[N];
int f[N][19];
int hson[N],top[N],dfn[N];
int lnkn[N];
int tot,tlt;
int LCA(int u,int v){
	if(dep[u]<dep[v]) swap(u,v);
	int k=dep[u]-dep[v];
	fr2(i,18,0){
		if(k>=(1<<i)){
			k-=(1<<i);
			u=f[u][i];
		}
	}
	if(u==v) return u;
	fr2(i,18,0){
		if(f[u][i]!=f[v][i]) u=f[u][i],v=f[v][i];
	}
	return f[u][0];
}
ll dist(int u,int v){
	return dis[u]+dis[v]-2ll*dis[LCA(u,v)];
}
void dfs1(int x,int fa){
	f[x][0]=fa;
	for(auto y:p[x]){
		if(y.fi==fa) continue;
		dep[y.fi]=dep[x]+1;
		dis[y.fi]=dis[x]+y.se;
		hson[x]=y.fi;
		dfs1(y.fi,x);
	}
}
void dfs2(int x,int tp,int fa){
	top[x]=tp;
	tot++;
	dfn[x]=tot;
	if(hson[x]) dfs2(hson[x],tp,x);
	for(auto y:p[x]){
		if(y.fi==fa||hson[x]==y.fi) continue;
		tlt++;
		lnkn[y.fi]=tlt;
		dfs2(y.fi,y.fi,x);
	}
}
#define mid (l+r>>1)
struct info{
	int maxn,minn;
	int nmax,nmin;
};
struct sgtlink{
	info a[N<<2];
	il info pushup(info ls,info rs){
		info ans;
		ans.maxn=max(ls.maxn,rs.maxn);
		ans.minn=min(ls.minn,rs.minn);
		ans.nmax=get<1>(max(tie(ls.maxn,ls.nmax),tie(rs.maxn,rs.nmax)));
		ans.nmin=get<1>(min(tie(ls.minn,ls.nmin),tie(rs.minn,rs.nmin)));
		return ans;
	}
	il void build(int p,int l,int r,int id){
		if(l==r){
			if(s[l]=='1'&&lnkn[top[l]]==id) a[p]={dep[l],dep[l],l,l};
			else a[p]={(int)-1e9,(int)1e9,0,0};
			return;
		}
		build(p<<1,l,mid,id);
		build(p<<1|1,mid+1,r,id);
		a[p]=pushup(a[p<<1],a[p<<1|1]);
	}
	il void flip(int p,int l,int r,int d){
		if(l==r){
			if(s[l]=='1'){
				a[p]={(int)-1e9,(int)1e9,0,0};
				s[l]='0';
			}
			else{
				a[p]={dep[l],dep[l],l,l};
				s[l]='1';
			}
			return;
		}
		if(d<=mid) flip(p<<1,l,mid,d);
		else flip(p<<1|1,mid+1,r,d);
		a[p]=pushup(a[p<<1],a[p<<1|1]);
	}
	il info query(int p,int l,int r,int ml,int mr){
		if(ml<=l&&r<=mr) return a[p];
		if(ml<=mid&&mid<mr) return pushup(query(p<<1,l,mid,ml,mr),query(p<<1|1,mid+1,r,ml,mr));
		else if(ml>mid) return query(p<<1|1,mid+1,r,ml,mr);
		else if(mid>=mr) return query(p<<1,l,mid,ml,mr);
		else throw("ip");
	}
} T[51];
#undef mid
int main(){
#ifdef Shun
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin>>n>>q;
	fr1(i,1,n) cin>>s[i];
	fr1(i,2,n){
		int u,v,w;
		cin>>u>>v>>w;
		p[u].pb(mp(v,w)),p[v].pb(mp(u,w));
	}
	dfs1(1,1);
	fr1(j,1,18){
		fr1(i,1,n) f[i][j]=f[f[i][j-1]][j-1];
	}
	tlt++;
	lnkn[1]=tlt;
	dfs2(1,1,1);
	fr1(i,1,tlt) T[i].build(1,1,n,i);
	while(q--){
		int op;
		cin>>op;
		if(op==1){
			int x;
			cin>>x;
			T[lnkn[top[x]]].flip(1,1,n,x);
		}
		else{
			int l,r;
			cin>>l>>r;
			ll ans=0;
			vector <int> keys;
			fr1(i,1,tlt){
				info qry=T[i].query(1,1,n,l,r);
				if(qry.nmax){
					keys.pb(qry.nmax),keys.pb(qry.nmin);
					// cout<<qry.nmax<<" "<<qry.nmin<<endl;
					// ans+=dis[qry.nmax]-dis[qry.nmin];
				}
			}
			if(keys.empty()){
				cout<<"-1\n";
				continue;
			}
			sort(keys.begin(),keys.end(),[](int &x,int &y){
				return dfn[x]<dfn[y];
			});
			// for(auto i:keys) cout<<i<<" ";
			// cout<<endl;
			fr1(i,0,keys.size()-2) ans+=dist(keys[i],keys[i+1]);//cout<<dist(keys[i],keys[i+1])<<" ";
			ans+=dist(keys[0],keys.back());
			cout<<ans<<'\n';
		}
	}
	ET;
}
//ALL FOR Zhang Junhao.

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 15288kb

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: 228ms
memory: 60912kb

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: 227ms
memory: 62268kb

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: 189ms
memory: 61200kb

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: 15496kb

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: 111ms
memory: 64152kb

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: 116ms
memory: 74348kb

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: 226ms
memory: 547912kb

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: 0
Accepted
time: 3574ms
memory: 548208kb

input:

200000 200000
1010011001010010101000001000111111110110111100000011000110010101000001101110111000100011010101100011001011101100010100000010100000100110100001000111010000011001010111001001000000111001100110010100101010111000000000011110101110010101110110110101100001011001101010101001000010000010000000...

output:

185874943612396
186901189463748
185325592077116
187007806200644
185723936146376
186683200699722
186830061692652
186256265895174
186860903405924
186810412385682
186744028102060
186994420108608
186831837842360
180459525430870
186966649455016
186952309712742
185810351127924
186849618327982
186494273101...

result:

ok 100000 numbers

Test #10:

score: 0
Accepted
time: 3571ms
memory: 547552kb

input:

200000 200000
1101100101010001011001101010110111010000001100111000100010001111101101110111001101000001101011010000001110101101001010011000001011000101010111001101100100101001100111010001101010011100101100010110000011110101101011000011101101010111101000000111100100011101000110011100011000010010001011...

output:

187559700459682
187535810670694
187366757549978
187509694959444
186405180245408
187572993046976
186802217032708
186278525122374
187171989295434
187404069323808
187366390326582
184670301024044
186230793287498
187530780070456
187597311483370
187406310330638
187384636670170
187047338416520
187544270920...

result:

ok 100000 numbers

Test #11:

score: 0
Accepted
time: 3515ms
memory: 547684kb

input:

200000 200000
0011111000111101101011111111000010101011010000100000110110010110010000011010101011101001100001001001000001100110010100101101001111000111010011110100000100000001111111000001000101000011110001101101111000101001100010010011001101100111110000110001100001100011110011001100100010000010001101...

output:

187057082821034
187050489592834
185798962075874
186490497612254
185547643085476
185839649755426
186731725449660
186845143722558
186446910671932
186830913714546
186903848544526
186827856700414
187012840145598
187030896936824
186738571374322
186338959389628
186977751482606
187075649881228
186978915850...

result:

ok 100000 numbers

Test #12:

score: 0
Accepted
time: 0ms
memory: 15248kb

input:

1 3
0
2 1 1
1 1
2 1 1

output:

-1
0

result:

ok 2 number(s): "-1 0"

Test #13:

score: 0
Accepted
time: 0ms
memory: 15088kb

input:

7 2
0001100
1 2 1
2 3 10
3 4 100
4 5 1000
3 6 10000
6 7 100000
2 1 7
2 2 6

output:

2000
2000

result:

ok 2 number(s): "2000 2000"