Submission #1000157

# Submission time Handle Problem Language Result Execution time Memory
1000157 2024-06-16T18:16:08 Z OAleksa Trains (BOI24_trains) C++14
100 / 100
97 ms 8424 KB
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
using namespace std;
const int N = 1e5 + 69;
const int B = 320;
const int mod = 1e9 + 7;
int n, d[N], x[N], dp[N];
vector<int> cnt[B];
vector<tuple<int, int, int>> who[N];
int add(int x, int y) {
	x += y;
	if (x >= mod)
		x -= mod;
	return x;
}
int sub(int x, int y) {
	x -= y;
	x = (x + 1000ll * mod) % mod;
	return x;
}
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tt = 1;
	//cin >> tt;
	while (tt--) {
		cin >> n;
		for (int i = 1;i <= n;i++) {
			cin >> d[i] >> x[i];
			x[i] = min(x[i], n);
		}
		for (int i = 1;i < B;i++)
			cnt[i].resize(i);
		dp[1] = 1;
		for (int i = 1;i <= n;i++) {
			for (int j = 1;j < B;j++) {
				int x = i % j;
				dp[i] = add(dp[i], cnt[j][x]);
			}
			if (d[i] >= B) {
				for (int j = i + d[i], j1 = 1;j <= n && j1 <= x[i];j += d[i], j1++) {
					dp[j] = add(dp[j], dp[i]);
				}
			}
			else {
				if (d[i] != 0) {
					int when = i + x[i] * d[i];
					if (when <= n) 
						who[when].push_back({d[i], i % d[i], dp[i]});
					cnt[d[i]][i % d[i]] = add(cnt[d[i]][i % d[i]], dp[i]);
				}
			}
			for (auto j : who[i]) {
				int a, b, c;
				tie(a, b, c) = j;
				cnt[a][b] = sub(cnt[a][b], c);
			}
		}
		int ans = 0;
		for (int i = 1;i <= n;i++)
			ans = add(ans, dp[i]);
		cout << ans;
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 5036 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 5036 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 9 ms 5212 KB Output is correct
21 Correct 4 ms 4956 KB Output is correct
22 Correct 9 ms 4956 KB Output is correct
23 Correct 7 ms 4952 KB Output is correct
24 Correct 4 ms 4956 KB Output is correct
25 Correct 8 ms 5156 KB Output is correct
26 Correct 5 ms 4956 KB Output is correct
27 Correct 8 ms 4956 KB Output is correct
28 Correct 10 ms 4952 KB Output is correct
29 Correct 10 ms 4956 KB Output is correct
30 Correct 10 ms 5156 KB Output is correct
31 Correct 10 ms 4956 KB Output is correct
32 Correct 10 ms 5156 KB Output is correct
33 Correct 11 ms 5208 KB Output is correct
34 Correct 9 ms 5144 KB Output is correct
35 Correct 9 ms 4956 KB Output is correct
36 Correct 9 ms 5152 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 7 ms 4956 KB Output is correct
3 Correct 5 ms 4956 KB Output is correct
4 Correct 8 ms 4956 KB Output is correct
5 Correct 69 ms 7764 KB Output is correct
6 Correct 84 ms 5468 KB Output is correct
7 Correct 86 ms 5832 KB Output is correct
8 Correct 1 ms 4952 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 10 ms 4956 KB Output is correct
12 Correct 86 ms 5552 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 10 ms 4956 KB Output is correct
15 Correct 86 ms 5468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 44 ms 4952 KB Output is correct
2 Correct 36 ms 5200 KB Output is correct
3 Correct 86 ms 5468 KB Output is correct
4 Correct 65 ms 5208 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 9 ms 5148 KB Output is correct
8 Correct 86 ms 5516 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 5036 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 9 ms 5212 KB Output is correct
21 Correct 4 ms 4956 KB Output is correct
22 Correct 9 ms 4956 KB Output is correct
23 Correct 7 ms 4952 KB Output is correct
24 Correct 4 ms 4956 KB Output is correct
25 Correct 8 ms 5156 KB Output is correct
26 Correct 5 ms 4956 KB Output is correct
27 Correct 8 ms 4956 KB Output is correct
28 Correct 10 ms 4952 KB Output is correct
29 Correct 10 ms 4956 KB Output is correct
30 Correct 10 ms 5156 KB Output is correct
31 Correct 10 ms 4956 KB Output is correct
32 Correct 10 ms 5156 KB Output is correct
33 Correct 11 ms 5208 KB Output is correct
34 Correct 9 ms 5144 KB Output is correct
35 Correct 9 ms 4956 KB Output is correct
36 Correct 9 ms 5152 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 7 ms 4956 KB Output is correct
39 Correct 5 ms 4956 KB Output is correct
40 Correct 8 ms 4956 KB Output is correct
41 Correct 69 ms 7764 KB Output is correct
42 Correct 84 ms 5468 KB Output is correct
43 Correct 86 ms 5832 KB Output is correct
44 Correct 1 ms 4952 KB Output is correct
45 Correct 1 ms 4956 KB Output is correct
46 Correct 1 ms 4956 KB Output is correct
47 Correct 10 ms 4956 KB Output is correct
48 Correct 86 ms 5552 KB Output is correct
49 Correct 1 ms 4956 KB Output is correct
50 Correct 10 ms 4956 KB Output is correct
51 Correct 86 ms 5468 KB Output is correct
52 Correct 44 ms 4952 KB Output is correct
53 Correct 36 ms 5200 KB Output is correct
54 Correct 86 ms 5468 KB Output is correct
55 Correct 65 ms 5208 KB Output is correct
56 Correct 1 ms 4956 KB Output is correct
57 Correct 1 ms 4956 KB Output is correct
58 Correct 9 ms 5148 KB Output is correct
59 Correct 86 ms 5516 KB Output is correct
60 Correct 72 ms 5448 KB Output is correct
61 Correct 89 ms 5468 KB Output is correct
62 Correct 93 ms 8424 KB Output is correct
63 Correct 85 ms 5464 KB Output is correct
64 Correct 90 ms 5468 KB Output is correct
65 Correct 97 ms 5464 KB Output is correct
66 Correct 85 ms 5464 KB Output is correct
67 Correct 87 ms 5464 KB Output is correct
68 Correct 89 ms 5548 KB Output is correct
69 Correct 94 ms 7804 KB Output is correct
70 Correct 86 ms 5548 KB Output is correct
71 Correct 86 ms 5468 KB Output is correct
72 Correct 85 ms 5468 KB Output is correct