Submission #1052891

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1052891	2024-08-11T05:35:53 Z	vjudge1	Trains (BOI24_trains)	C++17	42 / 100	18 ms	7496 KB

Main

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

#include <iostream>
#include <map>
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]={};
	map<int,int>val[n]={};
	ans[0]=1;
	for (int i=0;i<n;i++)
	{
		for (auto& j:val[i])
		{
			j.second%=mod;
			ans[i]+=j.second;
			ans[i]%=mod;
		}
		if (d[i]&&x[i]&&i+d[i]<n)
		{
			val[i+d[i]][d[i]]+=ans[i];
			int g=min((n-i-1)/d[i],x[i])+1;
			if (i+d[i]*g<n)
				val[i+d[i]*g][d[i]]-=ans[i];
		}
		for (auto j:val[i])
		{
			if (i+j.first<n&&j.second!=0)
				val[i+j.first][j.first]+=j.second;
		}
		val[i]={};
	}
	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	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	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

0 / 13.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	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	Incorrect	7 ms	1152 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	860 KB	Output is correct
3	Incorrect	1 ms	604 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #4

34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	3848 KB	Output is correct
2	Correct	15 ms	3164 KB	Output is correct
3	Correct	17 ms	7256 KB	Output is correct
4	Correct	17 ms	5468 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	1116 KB	Output is correct
8	Correct	14 ms	7496 KB	Output is correct

Subtask #5

0 / 29.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	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	Incorrect	7 ms	1152 KB	Output isn't correct
21	Halted	0 ms	0 KB	-