Submission #1087271

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1087271	2024-09-12T12:08:04 Z	PieArmy	Toll (BOI17_toll)	C++17	100 / 100	76 ms	18772 KB

toll

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++){
					if(nex[x][i-1][a]==sonsuz)break;
					int y=((x/k)+pie(i-1))*k+a;
					if(y>=n)break;
					if(nex[y][i-1][b]==sonsuz)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	25 ms	16988 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	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	23 ms	16992 KB	Output is correct
9	Correct	22 ms	16984 KB	Output is correct
10	Correct	11 ms	16216 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	36 ms	17652 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	0 ms	348 KB	Output is correct
7	Correct	2 ms	860 KB	Output is correct
8	Correct	3 ms	864 KB	Output is correct
9	Correct	22 ms	16916 KB	Output is correct
10	Correct	55 ms	18128 KB	Output is correct
11	Correct	39 ms	17612 KB	Output is correct
12	Correct	36 ms	17240 KB	Output is correct
13	Correct	52 ms	12116 KB	Output is correct
14	Correct	29 ms	11120 KB	Output is correct
15	Correct	47 ms	11000 KB	Output is correct
16	Correct	45 ms	11048 KB	Output is correct

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	468 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	600 KB	Output is correct
7	Correct	2 ms	1116 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	1 ms	836 KB	Output is correct
10	Correct	21 ms	16868 KB	Output is correct
11	Correct	38 ms	17496 KB	Output is correct
12	Correct	57 ms	18132 KB	Output is correct
13	Correct	54 ms	18256 KB	Output is correct
14	Correct	50 ms	17740 KB	Output is correct
15	Correct	42 ms	11000 KB	Output is correct
16	Correct	42 ms	10844 KB	Output is correct

Subtask #4
31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	468 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	600 KB	Output is correct
7	Correct	2 ms	1116 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	1 ms	836 KB	Output is correct
10	Correct	21 ms	16868 KB	Output is correct
11	Correct	38 ms	17496 KB	Output is correct
12	Correct	57 ms	18132 KB	Output is correct
13	Correct	54 ms	18256 KB	Output is correct
14	Correct	50 ms	17740 KB	Output is correct
15	Correct	42 ms	11000 KB	Output is correct
16	Correct	42 ms	10844 KB	Output is correct
17	Correct	37 ms	17488 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 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	2 ms	832 KB	Output is correct
25	Correct	2 ms	860 KB	Output is correct
26	Correct	2 ms	740 KB	Output is correct
27	Correct	19 ms	16860 KB	Output is correct
28	Correct	61 ms	18004 KB	Output is correct
29	Correct	52 ms	18256 KB	Output is correct
30	Correct	45 ms	17708 KB	Output is correct

Subtask #5
44.0 / 44.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	16988 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	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	23 ms	16992 KB	Output is correct
9	Correct	22 ms	16984 KB	Output is correct
10	Correct	11 ms	16216 KB	Output is correct
11	Correct	36 ms	17652 KB	Output is correct
12	Correct	0 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	864 KB	Output is correct
19	Correct	22 ms	16916 KB	Output is correct
20	Correct	55 ms	18128 KB	Output is correct
21	Correct	39 ms	17612 KB	Output is correct
22	Correct	36 ms	17240 KB	Output is correct
23	Correct	52 ms	12116 KB	Output is correct
24	Correct	29 ms	11120 KB	Output is correct
25	Correct	47 ms	11000 KB	Output is correct
26	Correct	45 ms	11048 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	0 ms	468 KB	Output is correct
29	Correct	0 ms	468 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	600 KB	Output is correct
33	Correct	2 ms	1116 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	1 ms	836 KB	Output is correct
36	Correct	21 ms	16868 KB	Output is correct
37	Correct	38 ms	17496 KB	Output is correct
38	Correct	57 ms	18132 KB	Output is correct
39	Correct	54 ms	18256 KB	Output is correct
40	Correct	50 ms	17740 KB	Output is correct
41	Correct	42 ms	11000 KB	Output is correct
42	Correct	42 ms	10844 KB	Output is correct
43	Correct	37 ms	17488 KB	Output is correct
44	Correct	0 ms	344 KB	Output is correct
45	Correct	0 ms	344 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	2 ms	832 KB	Output is correct
51	Correct	2 ms	860 KB	Output is correct
52	Correct	2 ms	740 KB	Output is correct
53	Correct	19 ms	16860 KB	Output is correct
54	Correct	61 ms	18004 KB	Output is correct
55	Correct	52 ms	18256 KB	Output is correct
56	Correct	45 ms	17708 KB	Output is correct
57	Correct	76 ms	18772 KB	Output is correct
58	Correct	22 ms	16984 KB	Output is correct
59	Correct	45 ms	17628 KB	Output is correct

Submission #1087271

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