제출 #1028003

#제출 시각아이디문제언어결과실행 시간메모리
1028003AbitoTrains (BOI24_trains)C++17
21 / 100
2094 ms2132 KiB
#include <bits/stdc++.h> #define F first #define S second #define pb push_back #define ppb pop_back #define ep insert #define endl '\n' #define elif else if #define pow pwr #define sqrt sqrtt //#define int long long #define ll long long #define y1 YONE typedef unsigned long long ull; using namespace std; const int N=1e5+5,M=1e9+7; int dp[N],d[N],x[N],n; int32_t main(){ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); cin>>n; for (int i=1;i<=n;i++) cin>>d[i]>>x[i]; for (int i=n;i;i--){ dp[i]=1; if (!d[i]) continue; for (int j=i+d[i];j<=n && (j-i)/d[i]<=x[i];j+=d[i]){ dp[i]=(dp[i]+dp[j])%M; } } cout<<dp[1]<<endl; return 0; }
#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...