Submission #1052863

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1052863	2024-08-11T05:03:17 Z	vjudge1	Trains (BOI24_trains)	C++17	21 / 100	2000 ms	2648 KB

Main

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
using namespace std;
#define int long long
int const mod=1e9+7;
inline void solve()
{
	int n;
	cin>>n;
	int d[n],x[n];
	for (int i=0;i<n;i++)
		cin>>d[i]>>x[i];
	int ans[n]={};
	ans[0]=1;
	for (int i=0;i<n;i++)
	{
		if (d[i]==0)
			continue;
		for (int j=1;j<=x[i]&&i+d[i]*j<n;j++)
		{
			ans[i+d[i]*j]+=ans[i];
			ans[i+d[i]*j]%=mod;
		}
	}
	int z=0;
	for (auto i:ans)
		z=(z+i)%mod;
	cout<<z<<endl;
}
signed main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct

Subtask #2
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	4 ms	604 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	19 ms	600 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	2 ms	604 KB	Output is correct
26	Correct	11 ms	560 KB	Output is correct
27	Correct	39 ms	604 KB	Output is correct
28	Correct	8 ms	604 KB	Output is correct
29	Correct	60 ms	600 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	27 ms	660 KB	Output is correct
32	Correct	55 ms	600 KB	Output is correct
33	Correct	2 ms	600 KB	Output is correct
34	Correct	1 ms	600 KB	Output is correct
35	Correct	1 ms	600 KB	Output is correct
36	Correct	4 ms	604 KB	Output is correct

Subtask #3
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	27 ms	604 KB	Output is correct
3	Correct	12 ms	600 KB	Output is correct
4	Correct	41 ms	604 KB	Output is correct
5	Correct	6 ms	2140 KB	Output is correct
6	Execution timed out	2020 ms	2648 KB	Time limit exceeded
7	Halted	0 ms	0 KB	-

Subtask #4
0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	372 ms	1372 KB	Output is correct
2	Correct	261 ms	1368 KB	Output is correct
3	Execution timed out	2053 ms	2648 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	4 ms	604 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	19 ms	600 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	2 ms	604 KB	Output is correct
26	Correct	11 ms	560 KB	Output is correct
27	Correct	39 ms	604 KB	Output is correct
28	Correct	8 ms	604 KB	Output is correct
29	Correct	60 ms	600 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	27 ms	660 KB	Output is correct
32	Correct	55 ms	600 KB	Output is correct
33	Correct	2 ms	600 KB	Output is correct
34	Correct	1 ms	600 KB	Output is correct
35	Correct	1 ms	600 KB	Output is correct
36	Correct	4 ms	604 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	27 ms	604 KB	Output is correct
39	Correct	12 ms	600 KB	Output is correct
40	Correct	41 ms	604 KB	Output is correct
41	Correct	6 ms	2140 KB	Output is correct
42	Execution timed out	2020 ms	2648 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

Submission #1052863

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 13.0 / 13.0

Subtask #3 0 / 16.0

Subtask #4 0 / 34.0

Subtask #5 0 / 29.0

Subtask #1
8.0 / 8.0

Subtask #2
13.0 / 13.0

Subtask #3
0 / 16.0

Subtask #4
0 / 34.0

Subtask #5
0 / 29.0