Submission #999492

# Submission time Handle Problem Language Result Execution time Memory
999492 2024-06-15T15:35:45 Z esomer Trains (BOI24_trains) C++17
100 / 100
618 ms 358024 KB
#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e9 + 7;

typedef long long ll;

ll sumLast(vector<ll>& suf, int x){
	if(x >= (int)suf.size()) return suf.back();
	if(!x) return 0;
	return (suf.back() + MOD - suf[(int)suf.size() - x - 1]) % MOD;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int N; cin >> N;
	vector<int> x(N), d(N);
	for(int i = 0; i < N; i++){
		cin >> d[i] >> x[i];
	}
	int sqr = sqrt(N);
	vector<vector<vector<ll>>> suffix(sqr);
	//It's efficiente because each index will be in sqrt vectors.
	for(int i = 1; i < sqr; i++){
		suffix[i].assign(i, {0});
	}
	vector<ll> dp(N, 0);
	for(int i = N - 1; i >= 0; i--){
		dp[i]++; //Just ending there.
		if(d[i] >= sqr){
			int curr = i + d[i];
			int currMult = 1;
			while(curr < N && currMult <= x[i]){
				dp[i] += dp[curr]; dp[i] %= MOD;
				currMult++;
				curr += d[i];
			}
		}else if(d[i] > 0){
			int md = i % d[i];
			//I want the sum of the last x ones.
			dp[i] += sumLast(suffix[d[i]][md], x[i]);
			dp[i] %= MOD;
		}
		for(int div = 1; div < sqr; div++){
			int md = i % div;
			suffix[div][md].push_back((suffix[div][md].back() + dp[i]) % MOD);
		}
	}
	cout << dp[0] << "\n";
}
# 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 344 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
# 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 344 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 12 ms 9308 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 15 ms 12044 KB Output is correct
23 Correct 7 ms 6488 KB Output is correct
24 Correct 4 ms 3672 KB Output is correct
25 Correct 13 ms 10332 KB Output is correct
26 Correct 4 ms 4188 KB Output is correct
27 Correct 11 ms 9560 KB Output is correct
28 Correct 15 ms 12224 KB Output is correct
29 Correct 19 ms 12136 KB Output is correct
30 Correct 15 ms 12100 KB Output is correct
31 Correct 16 ms 12120 KB Output is correct
32 Correct 14 ms 12124 KB Output is correct
33 Correct 15 ms 12240 KB Output is correct
34 Correct 14 ms 12124 KB Output is correct
35 Correct 18 ms 12124 KB Output is correct
36 Correct 20 ms 12124 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 6492 KB Output is correct
3 Correct 4 ms 4188 KB Output is correct
4 Correct 13 ms 9564 KB Output is correct
5 Correct 362 ms 250232 KB Output is correct
6 Correct 515 ms 357956 KB Output is correct
7 Correct 518 ms 357952 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 18 ms 12100 KB Output is correct
12 Correct 524 ms 357844 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 15 ms 12168 KB Output is correct
15 Correct 533 ms 357836 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 174 ms 122056 KB Output is correct
2 Correct 131 ms 91716 KB Output is correct
3 Correct 532 ms 357952 KB Output is correct
4 Correct 344 ms 225068 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 15 ms 12240 KB Output is correct
8 Correct 516 ms 357912 KB Output is correct
# 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 344 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 12 ms 9308 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 15 ms 12044 KB Output is correct
23 Correct 7 ms 6488 KB Output is correct
24 Correct 4 ms 3672 KB Output is correct
25 Correct 13 ms 10332 KB Output is correct
26 Correct 4 ms 4188 KB Output is correct
27 Correct 11 ms 9560 KB Output is correct
28 Correct 15 ms 12224 KB Output is correct
29 Correct 19 ms 12136 KB Output is correct
30 Correct 15 ms 12100 KB Output is correct
31 Correct 16 ms 12120 KB Output is correct
32 Correct 14 ms 12124 KB Output is correct
33 Correct 15 ms 12240 KB Output is correct
34 Correct 14 ms 12124 KB Output is correct
35 Correct 18 ms 12124 KB Output is correct
36 Correct 20 ms 12124 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 7 ms 6492 KB Output is correct
39 Correct 4 ms 4188 KB Output is correct
40 Correct 13 ms 9564 KB Output is correct
41 Correct 362 ms 250232 KB Output is correct
42 Correct 515 ms 357956 KB Output is correct
43 Correct 518 ms 357952 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 18 ms 12100 KB Output is correct
48 Correct 524 ms 357844 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 15 ms 12168 KB Output is correct
51 Correct 533 ms 357836 KB Output is correct
52 Correct 174 ms 122056 KB Output is correct
53 Correct 131 ms 91716 KB Output is correct
54 Correct 532 ms 357952 KB Output is correct
55 Correct 344 ms 225068 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 15 ms 12240 KB Output is correct
59 Correct 516 ms 357912 KB Output is correct
60 Correct 439 ms 277640 KB Output is correct
61 Correct 545 ms 357884 KB Output is correct
62 Correct 519 ms 357976 KB Output is correct
63 Correct 602 ms 357952 KB Output is correct
64 Correct 516 ms 357968 KB Output is correct
65 Correct 569 ms 358000 KB Output is correct
66 Correct 515 ms 357976 KB Output is correct
67 Correct 570 ms 358024 KB Output is correct
68 Correct 525 ms 357948 KB Output is correct
69 Correct 542 ms 357948 KB Output is correct
70 Correct 570 ms 357924 KB Output is correct
71 Correct 618 ms 358004 KB Output is correct
72 Correct 523 ms 357952 KB Output is correct