# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1264791 | Nika533 | Trains (BOI24_trains) | C++20 | 2095 ms | 2632 KiB |
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
using namespace std;
const int N=1e5+5;
int n,d[N],x[N],dp[N];
main() {
cin>>n;
for (int i=1; i<=n; i++) cin>>d[i]>>x[i];
dp[1]=1;
int ans=0;
for (int i=1; i<=n; i++) {
if (d[i]!=0) {
for (int j=i+d[i]; j<=min(n,i+d[i]*x[i]); j+=d[i]) {
dp[j]+=dp[i]; dp[j]%=MOD;
}
}
ans+=dp[i]; ans%=MOD;
}
cout<<ans<<endl;
}
컴파일 시 표준 에러 (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... |