제출 #1059320

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1059320		ten_xd	Trains (BOI24_trains)	C++17	0 / 100	2060 ms	1624 KiB

Main

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define all(t) t.begin(), t.end()
#define pb push_back

const int N = 1e5+5, INF = 2e9+54321, mod = 1e9+7;
const ll INF_L = (ll)2e18+54321;

int n, wyn;
int D[N], X[N], dp[N];

void solve()
{
	cin >> n;
	rep(i,n) cin >> D[i] >> X[i];

	wyn = 0, dp[0] = 1;
	rep(i,n)
	{
		wyn += dp[i];
		for(int j = 1; j <= X[i] and i+j*D[i] < n; ++j) dp[i+j*D[i]] = (dp[i+j*D[i]]+dp[i]) % mod;
	}

	cout << wyn << '\n';
}

int main()
{   
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int T = 1;
   	//cin >> T;
    while(T--) solve();

    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 13
• Subtask 3: 0 / 16
• Subtask 4: 0 / 34
• Subtask 5: 0 / 29