# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1033647 | BuiDucManh123 | Trains (BOI24_trains) | C++14 | 2137 ms | 825256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define taskname ""
using namespace std;
const int mod=1e9+7;
ll n,i,a[200009],d[200009],x[200009],f[350][350],ans[200009],res,j,block;
map<ll,int>add[350];
int main() {
if (fopen(taskname".inp","r")) {
freopen(taskname".inp","r",stdin);
freopen(taskname".out","w",stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
for(i=1;i<=n;i++){
cin>>d[i]>>x[i];
}ans[1]=1;
block=sqrt(n);
for(i=1;i<=n;i++){
for(j=1;j<block;j++){
f[j][i%j]+=add[j][i];
f[j][i%j]%=mod;
f[j][i%j]=(f[j][i%j]+mod)%mod;
ans[i]+=f[j][i%j];
ans[i]%=mod;
}
if(d[i]>=block){
if(d[i]>0){
for(j=i+d[i];j<=min(n,i+d[i]*x[i]);j+=d[i]){
ans[j]+=ans[i];
ans[j]%=mod;
}
}
}else{
if(d[i]>0){
f[d[i]][i%d[i]]+=ans[i];
f[d[i]][i%d[i]]%=mod;
add[d[i]][i+d[i]*(x[i]+1)]-=ans[i];
add[d[i]][i+d[i]*(x[i]+1)]%=mod;
}
}
}for(i=1;i<=n;i++) res+=ans[i],res%=mod;;
cout<<(res+mod)%mod;
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... |