oj.uz

답안 #966747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966747 2024-04-20T09:38:48 Z PM1 Sprinkler (JOI22_sprinkler) C++17
53 / 100
 4000 ms 129884 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define ll long long
const int mxn=2e5+5;
int n,M,q,h[mxn],st[mxn],fn[mxn],cnt,dis[mxn],par[mxn];
int fnd[mxn][42][2];
vector<int>v[mxn],d[mxn];
struct segment{
	vector<ll>val;
	int sz=0;
	void build(){
		while(__builtin_popcount(sz)!=1){
			sz++;
		}
		val.resize(sz*2,1);
	}
	void add(int i,int l,int r,int tl,int tr,int w){
		if(l>r||l>tr||r<tl||tl>tr){
			return ;
		}
		if(l>=tl&&r<=tr){
			val[i]*=w;
			val[i]%=M;
			return ;
		}
		int m=(l+r)>>1;
		add((i<<1),l,m,tl,tr,w);
		add((i<<1)^1,m+1,r,tl,tr,w);
		return ;
	}
	int get(int i){
		if(i==0){
			return 1;
		}
		int ret=val[i]*get((i>>1))%M;
		return ret;
	}
}seg[mxn];
void dfs(int z){
	st[z]=++cnt;
	d[dis[z]].push_back(st[z]);
	for(auto i:v[z]){
		if(i!=par[z]){
			par[i]=z;
			dis[i]=dis[z]+1;
			dfs(i);
		}
	}
	fn[z]=cnt;
}
void add(int x,int y,ll w){
	if(d[x].size()==0)return;
	int l=fnd[y][x-dis[y]][0];
	int r=fnd[y][x-dis[y]][1];
	seg[x].add(1,0,seg[x].sz-1,l,r,w);
}
void up(int x,int dd,int w){
	for(;dd>=1 && x!=1;dd--){
		int z=dis[x]+dd,zz=dis[x]+dd-1;
		add(z,x,w);
		add(zz,x,w);
		x=par[x];
	}
	for(;dd>=0;dd--){
		add(dis[x]+dd,x,w);
	}
}
void get(int z,int x){
	int l=fnd[x][0][0];
	cout<<seg[z].get(l+seg[z].sz)<<'\n';
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>M;
	for(int i=1;i<n;i++){
		int x,y;
		cin>>x>>y;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	for(int i=1;i<=n;i++)
		cin>>h[i];
	dfs(1);
	for(int i=0;i<=n;i++){
		seg[i].sz=d[i].size();
		seg[i].build();
	}
	for(int i=1;i<=n;i++){
		fnd[i][0][1]=fnd[i][0][0]=lower_bound(d[dis[i]].begin(),d[dis[i]].end(),st[i])-d[dis[i]].begin();
		for(int j=1;j<=40 && dis[i]+j<mxn;j++){
			int dd=dis[i]+j;
			fnd[i][j][0]=lower_bound(d[dd].begin(),d[dd].end(),st[i])-d[dd].begin();
			fnd[i][j][1]=upper_bound(d[dd].begin(),d[dd].end(),fn[i])-d[dd].begin()-1;
		}
	}
	for(int i=1;i<=n;i++){
		int l=fnd[i][0][0];
		seg[dis[i]].add(1,0,seg[dis[i]].sz-1,l,l,h[i]);
	}
	cin>>q;
	while(q--){
		int ty,x,dd,w;
		cin>>ty;
		if(ty==1){
			cin>>x>>dd>>w;
			up(x,dd,w);
		}

		else{
			cin>>x;
			get(dis[x],x);
		}
		
	}
	return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 17240 KB Output is correct
2 Correct 5 ms 16988 KB Output is correct
3 Correct 5 ms 16988 KB Output is correct
4 Correct 5 ms 17244 KB Output is correct
5 Correct 7 ms 17232 KB Output is correct
6 Correct 6 ms 16988 KB Output is correct
7 Correct 5 ms 17064 KB Output is correct
8 Correct 6 ms 17064 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 5 ms 17320 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 4 ms 16988 KB Output is correct
14 Correct 4 ms 16988 KB Output is correct
15 Correct 5 ms 16988 KB Output is correct
16 Correct 4 ms 16988 KB Output is correct
17 Correct 4 ms 16984 KB Output is correct
18 Correct 4 ms 16984 KB Output is correct
19 Correct 5 ms 16988 KB Output is correct
20 Correct 4 ms 17012 KB Output is correct
21 Correct 4 ms 16988 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 5 ms 16988 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 4 ms 16988 KB Output is correct
28 Correct 4 ms 17092 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 885 ms 113936 KB Output is correct
3 Correct 1157 ms 114104 KB Output is correct
4 Correct 397 ms 123392 KB Output is correct
5 Correct 1058 ms 114072 KB Output is correct
6 Correct 668 ms 113464 KB Output is correct
7 Correct 538 ms 113876 KB Output is correct
8 Correct 341 ms 113992 KB Output is correct
9 Correct 364 ms 129884 KB Output is correct
10 Correct 390 ms 127992 KB Output is correct
11 Correct 900 ms 114064 KB Output is correct
12 Correct 1033 ms 114232 KB Output is correct
13 Correct 371 ms 113904 KB Output is correct
14 Correct 439 ms 115440 KB Output is correct
15 Correct 407 ms 111200 KB Output is correct
16 Correct 434 ms 111316 KB Output is correct
17 Correct 522 ms 111284 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 4 ms 16988 KB Output is correct
20 Correct 4 ms 16988 KB Output is correct
21 Correct 4 ms 16988 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 885 ms 113936 KB Output is correct
3 Correct 1157 ms 114104 KB Output is correct
4 Correct 397 ms 123392 KB Output is correct
5 Correct 1058 ms 114072 KB Output is correct
6 Correct 668 ms 113464 KB Output is correct
7 Correct 538 ms 113876 KB Output is correct
8 Correct 341 ms 113992 KB Output is correct
9 Correct 364 ms 129884 KB Output is correct
10 Correct 390 ms 127992 KB Output is correct
11 Correct 900 ms 114064 KB Output is correct
12 Correct 1033 ms 114232 KB Output is correct
13 Correct 371 ms 113904 KB Output is correct
14 Correct 439 ms 115440 KB Output is correct
15 Correct 407 ms 111200 KB Output is correct
16 Correct 434 ms 111316 KB Output is correct
17 Correct 522 ms 111284 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 4 ms 16988 KB Output is correct
20 Correct 4 ms 16988 KB Output is correct
21 Correct 4 ms 16988 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 4 ms 16984 KB Output is correct
24 Correct 924 ms 111892 KB Output is correct
25 Correct 1194 ms 110752 KB Output is correct
26 Correct 436 ms 128340 KB Output is correct
27 Correct 1000 ms 113584 KB Output is correct
28 Correct 668 ms 113652 KB Output is correct
29 Correct 589 ms 114160 KB Output is correct
30 Correct 379 ms 113656 KB Output is correct
31 Correct 421 ms 124204 KB Output is correct
32 Correct 453 ms 128028 KB Output is correct
33 Correct 889 ms 114096 KB Output is correct
34 Correct 1122 ms 114004 KB Output is correct
35 Correct 5 ms 16984 KB Output is correct
36 Correct 4 ms 16988 KB Output is correct
37 Correct 4 ms 16988 KB Output is correct
38 Correct 4 ms 16988 KB Output is correct
39 Correct 5 ms 16988 KB Output is correct
40 Correct 4 ms 16988 KB Output is correct
41 Correct 4 ms 16988 KB Output is correct
42 Correct 4 ms 16988 KB Output is correct
43 Correct 4 ms 16988 KB Output is correct
44 Correct 4 ms 16984 KB Output is correct
45 Correct 4 ms 17060 KB Output is correct
46 Correct 4 ms 17056 KB Output is correct
47 Correct 4 ms 16988 KB Output is correct
48 Correct 4 ms 16988 KB Output is correct
49 Correct 4 ms 16988 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 562 ms 126436 KB Output is correct
3 Correct 2593 ms 122856 KB Output is correct
4 Correct 938 ms 123156 KB Output is correct
5 Correct 1835 ms 111272 KB Output is correct
6 Correct 1066 ms 111224 KB Output is correct
7 Correct 782 ms 111616 KB Output is correct
8 Correct 303 ms 111272 KB Output is correct
9 Correct 593 ms 121768 KB Output is correct
10 Correct 2159 ms 125640 KB Output is correct
11 Correct 1288 ms 111416 KB Output is correct
12 Correct 3878 ms 112044 KB Output is correct
13 Correct 2967 ms 112016 KB Output is correct
14 Correct 2480 ms 114260 KB Output is correct
15 Correct 5 ms 17060 KB Output is correct
16 Correct 4 ms 16988 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 4 ms 17012 KB Output is correct
19 Correct 4 ms 16988 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 631 ms 123600 KB Output is correct
3 Correct 2931 ms 118728 KB Output is correct
4 Correct 1129 ms 119300 KB Output is correct
5 Correct 1798 ms 110808 KB Output is correct
6 Correct 1024 ms 110888 KB Output is correct
7 Correct 785 ms 110048 KB Output is correct
8 Correct 298 ms 110368 KB Output is correct
9 Correct 623 ms 126028 KB Output is correct
10 Correct 2070 ms 123996 KB Output is correct
11 Correct 1294 ms 111776 KB Output is correct
12 Execution timed out 4077 ms 109924 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 17240 KB Output is correct
2 Correct 5 ms 16988 KB Output is correct
3 Correct 5 ms 16988 KB Output is correct
4 Correct 5 ms 17244 KB Output is correct
5 Correct 7 ms 17232 KB Output is correct
6 Correct 6 ms 16988 KB Output is correct
7 Correct 5 ms 17064 KB Output is correct
8 Correct 6 ms 17064 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 5 ms 17320 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 4 ms 16988 KB Output is correct
14 Correct 4 ms 16988 KB Output is correct
15 Correct 5 ms 16988 KB Output is correct
16 Correct 4 ms 16988 KB Output is correct
17 Correct 4 ms 16984 KB Output is correct
18 Correct 4 ms 16984 KB Output is correct
19 Correct 5 ms 16988 KB Output is correct
20 Correct 4 ms 17012 KB Output is correct
21 Correct 4 ms 16988 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 5 ms 16988 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 4 ms 16988 KB Output is correct
28 Correct 4 ms 17092 KB Output is correct
29 Correct 4 ms 16988 KB Output is correct
30 Correct 885 ms 113936 KB Output is correct
31 Correct 1157 ms 114104 KB Output is correct
32 Correct 397 ms 123392 KB Output is correct
33 Correct 1058 ms 114072 KB Output is correct
34 Correct 668 ms 113464 KB Output is correct
35 Correct 538 ms 113876 KB Output is correct
36 Correct 341 ms 113992 KB Output is correct
37 Correct 364 ms 129884 KB Output is correct
38 Correct 390 ms 127992 KB Output is correct
39 Correct 900 ms 114064 KB Output is correct
40 Correct 1033 ms 114232 KB Output is correct
41 Correct 371 ms 113904 KB Output is correct
42 Correct 439 ms 115440 KB Output is correct
43 Correct 407 ms 111200 KB Output is correct
44 Correct 434 ms 111316 KB Output is correct
45 Correct 522 ms 111284 KB Output is correct
46 Correct 4 ms 16988 KB Output is correct
47 Correct 4 ms 16988 KB Output is correct
48 Correct 4 ms 16988 KB Output is correct
49 Correct 4 ms 16988 KB Output is correct
50 Correct 4 ms 16988 KB Output is correct
51 Correct 4 ms 16984 KB Output is correct
52 Correct 924 ms 111892 KB Output is correct
53 Correct 1194 ms 110752 KB Output is correct
54 Correct 436 ms 128340 KB Output is correct
55 Correct 1000 ms 113584 KB Output is correct
56 Correct 668 ms 113652 KB Output is correct
57 Correct 589 ms 114160 KB Output is correct
58 Correct 379 ms 113656 KB Output is correct
59 Correct 421 ms 124204 KB Output is correct
60 Correct 453 ms 128028 KB Output is correct
61 Correct 889 ms 114096 KB Output is correct
62 Correct 1122 ms 114004 KB Output is correct
63 Correct 5 ms 16984 KB Output is correct
64 Correct 4 ms 16988 KB Output is correct
65 Correct 4 ms 16988 KB Output is correct
66 Correct 4 ms 16988 KB Output is correct
67 Correct 5 ms 16988 KB Output is correct
68 Correct 4 ms 16988 KB Output is correct
69 Correct 4 ms 16988 KB Output is correct
70 Correct 4 ms 16988 KB Output is correct
71 Correct 4 ms 16988 KB Output is correct
72 Correct 4 ms 16984 KB Output is correct
73 Correct 4 ms 17060 KB Output is correct
74 Correct 4 ms 17056 KB Output is correct
75 Correct 4 ms 16988 KB Output is correct
76 Correct 4 ms 16988 KB Output is correct
77 Correct 4 ms 16988 KB Output is correct
78 Correct 3 ms 16984 KB Output is correct
79 Correct 562 ms 126436 KB Output is correct
80 Correct 2593 ms 122856 KB Output is correct
81 Correct 938 ms 123156 KB Output is correct
82 Correct 1835 ms 111272 KB Output is correct
83 Correct 1066 ms 111224 KB Output is correct
84 Correct 782 ms 111616 KB Output is correct
85 Correct 303 ms 111272 KB Output is correct
86 Correct 593 ms 121768 KB Output is correct
87 Correct 2159 ms 125640 KB Output is correct
88 Correct 1288 ms 111416 KB Output is correct
89 Correct 3878 ms 112044 KB Output is correct
90 Correct 2967 ms 112016 KB Output is correct
91 Correct 2480 ms 114260 KB Output is correct
92 Correct 5 ms 17060 KB Output is correct
93 Correct 4 ms 16988 KB Output is correct
94 Correct 4 ms 16988 KB Output is correct
95 Correct 4 ms 17012 KB Output is correct
96 Correct 4 ms 16988 KB Output is correct
97 Correct 4 ms 16988 KB Output is correct
98 Correct 631 ms 123600 KB Output is correct
99 Correct 2931 ms 118728 KB Output is correct
100 Correct 1129 ms 119300 KB Output is correct
101 Correct 1798 ms 110808 KB Output is correct
102 Correct 1024 ms 110888 KB Output is correct
103 Correct 785 ms 110048 KB Output is correct
104 Correct 298 ms 110368 KB Output is correct
105 Correct 623 ms 126028 KB Output is correct
106 Correct 2070 ms 123996 KB Output is correct
107 Correct 1294 ms 111776 KB Output is correct
108 Execution timed out 4077 ms 109924 KB Time limit exceeded
109 Halted 0 ms 0 KB -