QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#787275#6404. Shuttle TourSymbolizeTL 200ms903932kbC++203.9kb2024-11-27 10:44:572024-11-27 10:44:57

Judging History

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

  • [2024-11-27 10:44:57]
  • 评测
  • 测评结果:TL
  • 用时:200ms
  • 内存:903932kb
  • [2024-11-27 10:44:57]
  • 提交

answer

/*
	Luogu name: Symbolize
	Luogu uid: 672793
*/
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define rep1(i,l,r) for(register int i=l;i<=r;++i)
#define rep2(i,l,r) for(register int i=l;i>=r;--i)
#define rep3(i,x,y,z) for(register int i=x[y];~i;i=z[i])
#define rep4(i,x) for(auto i:x)
#define debug() puts("----------")
const int N=2e5+10;
const int inf=0x3f3f3f3f3f3f3f3f;
using namespace std;
int n,q,h[N],e[N<<1],ne[N<<1],w[N<<1],idx,fa[N][21],dep[N],dist[N],dfn[N],kase,id[N],top[N],cnt=1;
bool a[N];
struct Segment_Tree
{
	int id;
	struct node
	{
		int l,r;
		int Min,Max;
	}tr[N<<2];
	int ls(int p){return p<<1;}
	int rs(int p){return p<<1|1;}
	void push_up(int p)
	{
		tr[p].Min=min(tr[ls(p)].Min,tr[rs(p)].Min);
		tr[p].Max=max(tr[ls(p)].Max,tr[rs(p)].Max);
		return;
	}
	void build(int p,int l,int r)
	{
		tr[p]={l,r,inf,-inf};
		if(tr[p].l==tr[p].r)
		{
			if(a[l]&&top[l]==id) tr[p].Min=tr[p].Max=dfn[l];
			return;
		}
		int mid=l+r>>1;
		build(ls(p),l,mid);
		build(rs(p),mid+1,r);
		push_up(p);
		return;
	}
	void update(int p,int x)
	{
		if(tr[p].l==tr[p].r)
		{
			if(a[x]&&top[x]==id) tr[p].Min=tr[p].Max=dfn[x];
			else tr[p].Min=inf,tr[p].Max=-inf;
			return;
		}
		int mid=tr[p].l+tr[p].r>>1;
		if(x<=mid) update(ls(p),x);
		else update(rs(p),x);
		push_up(p);
		return;
	}
	pii query(int p,int l,int r)
	{
		pii ans={inf,-inf};
		if(tr[p].l>=l&&tr[p].r<=r) return make_pair(tr[p].Min,tr[p].Max);
		int mid=tr[p].l+tr[p].r>>1;
		if(l<=mid)
		{
			pii now=query(ls(p),l,r);
			ans.x=min(ans.x,now.x);
			ans.y=max(ans.y,now.y);
		}
		if(r>mid)
		{
			pii now=query(rs(p),l,r);
			ans.x=min(ans.x,now.x);
			ans.y=max(ans.y,now.y);
		}
		return ans;
	}
}seg[55];
int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
	return f*x;
}
void add(int x,int y,int z)
{
	e[idx]=y;
	ne[idx]=h[x];
	w[idx]=z;
	h[x]=idx++;
	return;
}
void dfs(int x,int Fa)
{
	fa[x][0]=Fa;
	dep[x]=dep[Fa]+1;
	top[x]=cnt;
	dfn[x]=++kase;
	id[kase]=x;
	bool res=0;
	rep3(i,h,x,ne)
	{
		int to=e[i];
		if(to==Fa) continue;
		dist[to]=dist[x]+w[i];
		if(res) ++cnt;
		res=1;
		dfs(to,x);
	}
	return;
}
void init()
{
	rep1(j,1,20) rep1(i,1,n) fa[i][j]=fa[fa[i][j-1]][j-1];
	return;
}
void plc(int &x,int k)
{
	int kase=0;
	while(k)
	{
		if(k&1) x=fa[x][kase];
		k>>=1;
		++kase;
	}
	return;
}
int lca(int x,int y)
{
	if(dep[x]<dep[y]) swap(x,y);
	plc(x,dep[x]-dep[y]);
	if(x==y) return x;
	rep2(i,20,0)
	{
		if(fa[x][i]!=fa[y][i])
		{
			x=fa[x][i];
			y=fa[y][i];
		}
	}
	return fa[x][0];
}
int dis(int x,int y){return dist[x]+dist[y]-2*dist[lca(x,y)];}
bool cmp(int x,int y){return dfn[x]<dfn[y];}
signed main()
{
	memset(h,-1,sizeof h);
	n=read();
	q=read();
	rep1(i,1,n)
	{
		char ch;
		cin>>ch;
		a[i]=ch-'0';
	}
	rep1(i,1,n-1)
	{
		int u=read();
		int v=read();
		int w=read();
		add(u,v,w);
		add(v,u,w);
	}
	dfs(1,0);
//	rep1(i,1,n) cout<<top[i]<<" ";
//	putchar('\n');
	rep1(i,1,cnt) seg[i].id=i,seg[i].build(1,1,n);
	init();
	while(q--)
	{
		int opt=read();
		if(opt==1)
		{
			int x=read();
			a[x]^=1;
			seg[top[x]].update(1,x);
		}
		else
		{
			int l=read();
			int r=read();
			vector<int> v;
			rep1(i,1,cnt) 
			{
				pii now=seg[i].query(1,l,r);
				if(now.x>=1&&now.x<=n) v.push_back(id[now.x]);
				if(now.y>=1&&now.y<=n&&now.x!=now.y) v.push_back(id[now.y]);
			}
			if(!v.size())
			{
				puts("-1");
				continue;
			}
			sort(v.begin(),v.end(),cmp);
//			rep4(x,v) cout<<x<<" ";
//			putchar('\n');
			int len=v.size()-1,ans=dis(v[len],v[0]);
			rep1(i,1,len) ans+=dis(v[i-1],v[i]);
			cout<<ans<<"\n";
		}
	}
	return 0;
}
/*
5 1
10010
1 2 1
1 3 10
2 4 100
3 5 1000
2 1 1
*/

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 21556kb

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: 141ms
memory: 63284kb

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: 152ms
memory: 66648kb

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: 143ms
memory: 62540kb

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

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: 76ms
memory: 102832kb

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: 70ms
memory: 121300kb

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: 200ms
memory: 903932kb

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...

result: