제출 #1139216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1139216		why1	Trains (BOI24_trains)	C++20	100 / 100	313 ms	254080 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int,int>
#define sz size()
#define all(v) v.begin(),v.end()
#define fi first
#define se second

const int N = 2e5;
const int mod = 1e9+7;
const int INF = 1e9;

const int di[] = {1, -1, 0, 0};
const int dj[] = {0, 0, 1, -1};

const int M = 320;

int n;
ll d[N+1],x[N+1];
ll add[M][M];
ll add_pos[N+1][M];

void slow(){
    ll dp[n+1];
	memset(dp,0,sizeof(dp));
	dp[1]=1;
	for(int i = 2; i <= n; i++){
		for(int j = 1; j < i; j++){
			if(d[j]==0)
				continue;
			int k=(i-j)/d[j];
			if(i%d[j]==j%d[j] && 1<=k && k<=x[j]){
				dp[i]=(dp[i]+dp[j])%mod;
			}
		}
	}
	ll ans=0;
	for(int i = 1; i <= n; i++){
		ans=(ans+dp[i])%mod;
	}
	cout<<"SLOW: \n";
	for(int i = 1; i <= n; i++){
		cout<<dp[i]<<" ";
	}
	cout<<"\n";
	cout<<ans<<"\n";
}

void solve() {
	cin>>n;
	for(int i = 1; i <= n; i++){
		cin>>d[i]>>x[i];
	}
	ll dp[n+1];
	memset(dp,0,sizeof(dp));
	dp[1]=1;
	for(int i = 1; i <= n; i++){
		for(int d = 1; d < M; d++){
			add[d][i%d]=(add[d][i%d]+add_pos[i][d])%mod;
	        dp[i]=(dp[i]+add[d][i%d])%mod;
	    }
	    if(d[i]!=0){
            if(d[i]>=M){
                for(int j = 1; j <= x[i]; j++){
                    if(i+d[i]*j>n) break;
                    dp[i+d[i]*j]=(dp[i+d[i]*j]+dp[i])%mod;
                }
            }
            else{
				//add[d[i]][i%d[i]]=(add[d[i]][i%d[i]]+dp[i])%mod;
				add_pos[i+d[i]][d[i]]=(add_pos[i+d[i]][d[i]]+dp[i])%mod;
				if(i+d[i]*(x[i]+1)<=n)
					add_pos[i+d[i]*(x[i]+1)][d[i]]=(add_pos[i+d[i]*(x[i]+1)][d[i]]-dp[i]+mod)%mod;
            }
	    }
	}
	int ans=0;
	for(int i = 1; i <= n; i++){
	    ans=(ans+dp[i])%mod;
	}
	cout<<ans<<"\n";
}

int main() {

	//freopen("cowrun.in","r",stdin);
	//freopen("cowrun.out","w",stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

	int t=1;
	//cin>>t;
	while(t--) {
        solve();
	}

    return 0;
}

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