제출 #1033574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1033574		vjudge1	Trains (BOI24_trains)	C++17	8 / 100	2089 ms	1048576 KiB

Main

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//g++ .cpp -o .exe -g -D_GLIBCXX_DEBUG -ftrapv
//gdb .exe
//b _exit
//r
//(input)
//where
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pear=pair<ll, ll>;
#define fi first
#define se second
#define nl << '\n'
#define uk << ' '
ll mod=1e9+7;
void dfs(ll u, ll& ans, vector<vector<ll>>& adj){
	 ans++;
	 ans%=mod;
	 for(auto v:adj[u]){
	 	dfs(v, ans, adj);
	 }
	 return;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
//	freopen(".inp","r",stdin);
//	freopen(".out","w",stdout);
	cin.exceptions(cin.failbit);
	ll n;
	cin >> n;
	ll i, j;
	vector<vector<ll>> adj(n+1);
	for(i=1; i<=n; i++){
		ll d, x;
		cin >> d >> x;
		if(d==0) continue;
		for(j=1; j<=x; j++){
			if(i+d*j>n) break;
			adj[i].push_back(i+d*j);
		}
	}
	ll ans=0;
	dfs(1, ans, adj);
	cout << ans;
}

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