Submission #1052846

#TimeUsernameProblemLanguageResultExecution timeMemory
1052846vjudge1Trains (BOI24_trains)C++17
21 / 100
165 ms1408 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define vll vector<ll> #define all(x) begin(x),end(x) #define pb push_back const int N=1e4+10,mod=1e9+7; ll ways[N],suf[N],d[N],x[N]; void solve() { ll n; cin>>n; for(int i=1;i<=n;i++) { cin>>d[i]>>x[i]; ways[i]=1; } for(int i=n;i>=1;i--) { if(d[i]==0)continue; for(int t=1;t<=x[i] and (i+(d[i]*t))<=n;t++) { ways[i]=(ways[i]+ways[i+(d[i]*t)])%mod; } } cout<<ways[1]%mod<<endl; } int main() { cin.tie(0);cout.tie(0); ios::sync_with_stdio(0); int t=1; // cin>>t; while(t--) 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...