| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 995495 |
2024-06-09T07:24:06 Z |
12345678 |
Trains (BOI24_trains) |
C++17 |
|
2000 ms |
5192 KB |
#include <bits/stdc++.h>
using namespace std;
const int nx=1e5+5, mod=1e9+7, kx=255;
int n, d[nx], x[nx], qs[kx][kx], dp[nx], res, k=1;
vector<int> rem[nx];
void add(int idx)
{
if (d[idx]==0) return;
if (d[idx]>k)
{
for (int i=idx+d[idx], j=0; j<x[idx]&&i<=n; j++, i+=d[idx]) dp[i]=(dp[i]+dp[idx])%mod;
}
else
{
qs[d[idx]][idx%d[idx]]=(qs[d[idx]][idx%d[idx]]+dp[idx])%mod;
if (idx+((long long)x[idx])*d[idx]<=n) rem[idx+((long long)x[idx])*d[idx]].push_back(idx);
}
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n; i++) cin>>d[i]>>x[i];
dp[1]=1;
add(1);
for (int i=2; i<=n; i++)
{
for (int j=1; j<=k; j++) dp[i]=((dp[i]+qs[j][i%j])%mod+mod)%mod;
add(i);
for (auto idx:rem[i]) qs[d[idx]][i%d[idx]]=((qs[d[idx]][i%d[idx]]-dp[idx])%mod+mod)%mod;
}
for (int i=1; i<=n; i++) res=(res+dp[i])%mod;
cout<<res;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2908 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2908 KB |
Output is correct |
| 5 |
Correct |
10 ms |
5192 KB |
Output is correct |
| 6 |
Correct |
12 ms |
3928 KB |
Output is correct |
| 7 |
Correct |
11 ms |
4128 KB |
Output is correct |
| 8 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
273 ms |
3164 KB |
Output is correct |
| 2 |
Correct |
187 ms |
3160 KB |
Output is correct |
| 3 |
Execution timed out |
2078 ms |
3932 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
