Submission #1111558

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111558		gohchingjayk	Trains (BOI24_trains)	C++17	0 / 100	6 ms	336 KiB

Main

#include <bits/stdc++.h>

using namespace std;
using i64 = int64_t;

int mod = 1'000'000'007;
// vector<int> parents[10000];
// int dp[10000];

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

	int N; cin >> N;

	int covered_until = 0;
	int covered = 0;
	for (int i = 0; i < N; ++i) {
		int d, x;
		cin >> d >> x;
		if (d == 0) continue;
		covered += (i <= covered_until);
		covered_until = max(covered_until, i + x);

/*
		for (int j = i + d; j < N && j <= i + d * x; ++j) {
			parents[j].emplace_back(i);
		}
*/
	}
/*
	memset(dp, 0, sizeof(dp));
	int sum = dp[0] = 1;
	for (int i = 1; i < N; ++i) {
		for (int parent : parents[i]) {
			dp[i] = (dp[i] + dp[parent]) % mod;
		}
		sum = (sum + dp[i]) % mod;
	}
	cout << sum;
*/
	cout << covered;
}

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