| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1303466 | nanaseyuzuki | Trains (BOI24_trains) | C++20 | 121 ms | 4768 KiB |
#include <bits/stdc++.h>
// Kazusa_Megumi
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
using namespace std;
const int mn = 5e5 + 5, mod = 1e9 + 7, inf = 2e9, B = 317;
int n, x[mn], d[mn], dp[mn], val[B + 5][B + 5];
vector <int> ed[mn];
void solve() {
cin >> n;
dp[1] = 1;
for(int i = 1; i <= n; i++){
cin >> d[i] >> x[i];
if(d[i] && d[i] <= B){
int final = min(i + x[i] * d[i] + 1, n + 1);
// cerr << i << ' ' << final << '\n';
ed[final].push_back(i);
}
}
for(int i = 1; i <= n; i++){
for(auto j : ed[i]){
int y = d[j];
val[y][j % y] = ((val[y][j % y] - dp[j]) % mod + mod) % mod;
}
for(int j = 1; j <= B; j++) dp[i] = (dp[i] + val[j][i % j]) % mod;
if(d[i] > B){
for(int j = 1; j <= x[i]; j++){
int nxt = i + j * d[i];
if(nxt > n) break;
dp[nxt] = (dp[nxt] + dp[i]) % mod;
}
}
else{
if(d[i] == 0) continue;
val[d[i]][i % d[i]] = (val[d[i]][i % d[i]] + dp[i]) % mod;
}
}
int res = 0;
for(int i = 1; i <= n; i++) res = (res + dp[i]) % mod;
cout << res << '\n';
}
main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
if (fopen("Kazuki.INP", "r")) {
freopen("Kazuki.INP", "r", stdin);
freopen("Kazuki.OUT", "w", stdout);
}
int t = 1;
// cin >> t;
while (t--) solve();
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
