Submission #1052849

#TimeUsernameProblemLanguageResultExecution timeMemory
1052849vjudge1Trains (BOI24_trains)C++17
16 / 100
10 ms4716 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=1e5+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; } suf[n+1]=0; for(int i=n;i>=1;i--) { int j=min(n,i+x[i]); ways[i] =(((suf[i+1]-suf[j+1])%mod)+mod)%mod; ways[i] = (ways[i]+1)%mod; suf[i]=(suf[i+1]+ways[i])%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...