Submission #1265009

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265009		MaksimOJ	Trains (BOI24_trains)	C++20	58 / 100	1820 ms	807580 KiB

Main

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define all(x) x.begin(), x.end()
#define sz(x) ((int) ((x).size()))
#define print(x, y) for(auto it = x; it != y; it++){cout << *it << " ";}cout <<"\n";

using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using ld = long double;
using P = pair<ld, ld>;

//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>


const int N = 2e5+5;
const int SQ = 400;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
const int BAZA = 69313;

int n;
pii niz[N];
ll dp[N];
ll mat[SQ][SQ];
deque<pii> suf[SQ][SQ];

ll add(ll x, ll y){
	if(x + y < 0) return MOD + x + y;
	return (x + y) % MOD;
}

ll mul(ll x, ll y){
	return (x * y) % MOD;
}


int main(){
	//ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n;
	for(int i = 0; i< n; i++){
		cin >> niz[i].first >> niz[i].second;
		niz[i].second ++;
		//if(niz[i].first != 0) niz[i].second = min((n - i) / niz[i].first, niz[i].second); 
	}
	/*
	cout << "____________\n";
	for(int i = 0; i < n; i++){
		cout << niz[i].first << " " << niz[i].second << "\n";
	}*/
	int sq = SQ;
	
	for(int i = n - 1; i >= 0; i--){
		dp[i] = 1;

		if(niz[i].first == 0);
		else if(niz[i].first > sq){
			//cout << "> " << sq << "\n";
			int cnt = 0;
			for(int j = i + niz[i].first; j < n; j += niz[i].first){
				cnt ++;
				if(cnt > niz[i].second) continue;
				dp[i] = add(dp[i], dp[j]);
				
			}
		}
		else{
			//cout << "ost: " << i % niz[i].first << " " << niz[i].first << "\n";
			//cout << "Adding " << mat[niz[i].first][i % niz[i].first] << "\n";
			dp[i] = add(dp[i], mat[niz[i].first][i % niz[i].first]);
			//cout << "ind " << i + niz[i].first * niz[i].second << "\n";
			auto it = upper_bound(suf[niz[i].first][i % niz[i].first].begin(), suf[niz[i].first][i % niz[i].first].end(), make_pair((ll)i + niz[i].first * niz[i].second, 0ll));
			if(it != suf[niz[i].first][i % niz[i].first].end()){
				
				int poz = it - suf[niz[i].first][i % niz[i].first].begin();
				//cout << "removing " << suf[niz[i].first][i % niz[i].first][poz].second << "\n";
				dp[i] = add(dp[i], -suf[niz[i].first][i % niz[i].first][poz].second);
			}
			//else cout << "no it\n";
		}
		//cout << "DP[" << i << "] = " << dp[i] << "\n";
		for(int j = 1; j < SQ; j++){
			mat[j][i % j] = add(mat[j][i % j], dp[i]);
			suf[j][i % j].push_front({i, dp[i]});
			if(suf[j][i % j].size() != 1) suf[j][i % j][0].second = add(suf[j][i % j][0].second, suf[j][i % j][1].second);
		}
	}
	cout << dp[0] << "\n";
	return 0;
}

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