Submission #1052863

#TimeUsernameProblemLanguageResultExecution timeMemory
1052863vjudge1Trains (BOI24_trains)C++17
21 / 100
2053 ms2648 KiB
/* بسم الله الرحمن الرحيم Author: (:Muhammad Aneeq:) */ #include <iostream> using namespace std; #define int long long int const mod=1e9+7; inline void solve() { int n; cin>>n; int d[n],x[n]; for (int i=0;i<n;i++) cin>>d[i]>>x[i]; int ans[n]={}; ans[0]=1; for (int i=0;i<n;i++) { if (d[i]==0) continue; for (int j=1;j<=x[i]&&i+d[i]*j<n;j++) { ans[i+d[i]*j]+=ans[i]; ans[i+d[i]*j]%=mod; } } int z=0; for (auto i:ans) z=(z+i)%mod; cout<<z<<endl; } signed main() { ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...