제출 #1138654

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138654		PlayVoltz	Trains (BOI24_trains)	C++20	100 / 100	426 ms	226660 KiB

Main

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int BLK = 200;
const int MOD = 1000000007;

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	vector<int> dp(n+2, 0);
	vector<pii> vect(n+1);
	vector<vector<vector<int> > > s(BLK, vector<vector <int> >(BLK, {0}));
	for (int i=1; i<=n; ++i)cin>>vect[i].fi>>vect[i].se;
	for (int i=n; i>=1; --i){
		dp[i]=1;
		if (vect[i].fi>=BLK)for (int j=1; j<=vect[i].se&&i+j*vect[i].fi<=n; ++j)dp[i]=(dp[i]+dp[i+j*vect[i].fi])%MOD;
		else if (vect[i].fi){
			dp[i]=(dp[i]+s[vect[i].fi][i%vect[i].fi].back())%MOD;
			dp[i]=(dp[i]+MOD-s[vect[i].fi][i%vect[i].fi][max((int)s[vect[i].fi][i%vect[i].fi].size()-vect[i].se-1, 0ll)])%MOD;
		}
		for (int j=1; j<BLK; ++j)s[j][i%j].pb((dp[i]+s[j][i%j].back())%MOD);
	}
	cout<<dp[1];
}

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