Submission #1087281

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1087281	2024-09-12T12:11:54 Z	PieArmy	Toll (BOI17_toll)	C++17	100 / 100	65 ms	18204 KB

toll

#pragma GCC optimize("unroll-loops,no-stack-protector,O3,fast-math")
int pie(int army){return (1<<army);}
#include <bits/stdc++.h>
const int sonsuz=1000000005;
using namespace std;

int k,n,m,q;
int nex[50001][16][5];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	cin>>k>>n>>m>>q;
	for(int i=0;i<n;i++){
		for(int j=0;j<16;j++){
			for(int l=0;l<k;l++){
				nex[i][j][l]=sonsuz;
			}
		}
	}
	for(int i=1;i<=m;i++){
		int a,b,t;cin>>a>>b>>t;
		nex[a][0][b%k]=min(t,nex[a][0][b%k]);
	}
	for(int i=1;i<16;i++){
		for(int x=0;x<n;x++){
			for(int a=0;a<k;a++){
				for(int b=0;b<k;b++){
					int y=((x/k)+pie(i-1))*k+a;
					if(y>=n)continue;
					nex[x][i][b]=min(nex[x][i][b],nex[x][i-1][a]+nex[y][i-1][b]);
				}
			}
		}
	}
	while(q--){
		int yunuy,suayp;cin>>yunuy>>suayp;
		int pos=yunuy/k,tar=suayp/k;
		int ans[k];for(int &x:ans)x=sonsuz;
		ans[yunuy%k]=0;
		for(int i=0;i<16;i++){
			if((tar-pos)&pie(i)){
				int yeni[k];for(int &x:yeni)x=sonsuz;
				for(int a=0;a<k;a++){
					if(ans[a]==sonsuz)continue;
					for(int b=0;b<k;b++){
						if(nex[pos*k+a][i][b]==sonsuz)continue;
						yeni[b]=min(yeni[b],ans[a]+nex[pos*k+a][i][b]);
					}
				}
				for(int j=0;j<k;j++){
					ans[j]=yeni[j];
				}
				pos+=pie(i);
			}
		}
		if(ans[suayp%k]==sonsuz){
			cout<<-1;
		}
		else cout<<ans[suayp%k];
		cout<<'\n';
	}
}

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	16720 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	464 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	604 KB	Output is correct
8	Correct	27 ms	16732 KB	Output is correct
9	Correct	23 ms	16732 KB	Output is correct
10	Correct	14 ms	16220 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	16980 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	2 ms	860 KB	Output is correct
8	Correct	3 ms	860 KB	Output is correct
9	Correct	23 ms	16728 KB	Output is correct
10	Correct	52 ms	17556 KB	Output is correct
11	Correct	40 ms	16952 KB	Output is correct
12	Correct	36 ms	16988 KB	Output is correct
13	Correct	38 ms	11224 KB	Output is correct
14	Correct	28 ms	10888 KB	Output is correct
15	Correct	26 ms	10576 KB	Output is correct
16	Correct	26 ms	10580 KB	Output is correct

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	604 KB	Output is correct
8	Correct	1 ms	604 KB	Output is correct
9	Correct	1 ms	860 KB	Output is correct
10	Correct	20 ms	16836 KB	Output is correct
11	Correct	33 ms	16940 KB	Output is correct
12	Correct	53 ms	17488 KB	Output is correct
13	Correct	56 ms	18052 KB	Output is correct
14	Correct	40 ms	17372 KB	Output is correct
15	Correct	25 ms	10580 KB	Output is correct
16	Correct	26 ms	10588 KB	Output is correct

Subtask #4
31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	604 KB	Output is correct
8	Correct	1 ms	604 KB	Output is correct
9	Correct	1 ms	860 KB	Output is correct
10	Correct	20 ms	16836 KB	Output is correct
11	Correct	33 ms	16940 KB	Output is correct
12	Correct	53 ms	17488 KB	Output is correct
13	Correct	56 ms	18052 KB	Output is correct
14	Correct	40 ms	17372 KB	Output is correct
15	Correct	25 ms	10580 KB	Output is correct
16	Correct	26 ms	10588 KB	Output is correct
17	Correct	35 ms	16988 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	3 ms	956 KB	Output is correct
25	Correct	2 ms	860 KB	Output is correct
26	Correct	3 ms	860 KB	Output is correct
27	Correct	25 ms	16732 KB	Output is correct
28	Correct	49 ms	17632 KB	Output is correct
29	Correct	55 ms	17488 KB	Output is correct
30	Correct	50 ms	17232 KB	Output is correct

Subtask #5
44.0 / 44.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	16720 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	464 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	604 KB	Output is correct
8	Correct	27 ms	16732 KB	Output is correct
9	Correct	23 ms	16732 KB	Output is correct
10	Correct	14 ms	16220 KB	Output is correct
11	Correct	34 ms	16980 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	2 ms	860 KB	Output is correct
18	Correct	3 ms	860 KB	Output is correct
19	Correct	23 ms	16728 KB	Output is correct
20	Correct	52 ms	17556 KB	Output is correct
21	Correct	40 ms	16952 KB	Output is correct
22	Correct	36 ms	16988 KB	Output is correct
23	Correct	38 ms	11224 KB	Output is correct
24	Correct	28 ms	10888 KB	Output is correct
25	Correct	26 ms	10576 KB	Output is correct
26	Correct	26 ms	10580 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	604 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	860 KB	Output is correct
36	Correct	20 ms	16836 KB	Output is correct
37	Correct	33 ms	16940 KB	Output is correct
38	Correct	53 ms	17488 KB	Output is correct
39	Correct	56 ms	18052 KB	Output is correct
40	Correct	40 ms	17372 KB	Output is correct
41	Correct	25 ms	10580 KB	Output is correct
42	Correct	26 ms	10588 KB	Output is correct
43	Correct	35 ms	16988 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	3 ms	956 KB	Output is correct
51	Correct	2 ms	860 KB	Output is correct
52	Correct	3 ms	860 KB	Output is correct
53	Correct	25 ms	16732 KB	Output is correct
54	Correct	49 ms	17632 KB	Output is correct
55	Correct	55 ms	17488 KB	Output is correct
56	Correct	50 ms	17232 KB	Output is correct
57	Correct	65 ms	18204 KB	Output is correct
58	Correct	25 ms	16720 KB	Output is correct
59	Correct	41 ms	16976 KB	Output is correct

Submission #1087281

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 10.0 / 10.0

Subtask #3 8.0 / 8.0

Subtask #4 31.0 / 31.0

Subtask #5 44.0 / 44.0

Subtask #1
7.0 / 7.0

Subtask #2
10.0 / 10.0

Subtask #3
8.0 / 8.0

Subtask #4
31.0 / 31.0

Subtask #5
44.0 / 44.0