oj.uz

Submission #994578

# Submission time Handle Problem Language Result Execution time Memory
994578 2024-06-08T01:51:35 Z kym Trains (BOI24_trains) C++14
50 / 100
 649 ms 9696 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#ifdef LOCAL
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
const int MAXN = 100005;
const int inf=1000000500ll;
const long long oo =1000000000000000500ll;
const int MOD = (int)1e9+7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int> pi; 
const int sqn=100;
int n;
int D[MAXN], X[MAXN];
int dp[MAXN];
int R[sqn+5][sqn+5];
vector<array<int,3>> C[MAXN]; // at C_i, we need to remove x.first from x.second

int32_t main() 
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n;
	dp[1]=1;
	for(int i=1;i<=n;i++){
		cin>>D[i]>>X[i];
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		for(int r=1;r<=sqn;r++){
			dp[i]=(dp[i] + R[r][i%r])%MOD;
		}
		if(D[i] > sqn){
			for(int t=1;t<=X[i];t++){
				int idx=i+t*D[i];
				if(idx<=n){
					dp[idx] = (dp[idx] + dp[i])%MOD;
				}
			}
		} else{
			R[D[i]][i%D[i]]=(R[D[i]][i%D[i]]+dp[i])%MOD;
			int idx=min(n+1,i+X[i]*D[i]);
			C[idx].push_back({D[i],i%D[i],dp[i]});
		}
		for(auto x:C[i]){
			R[x[0]][x[1]]=(R[x[0]][x[1]]-x[2]+MOD)%MOD;
		}
		ans=(ans+dp[i])%MOD;
	}
	cout<<ans;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 9048 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 9048 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 5 ms 5060 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 6 ms 5152 KB Output is correct
5 Correct 42 ms 7508 KB Output is correct
6 Correct 56 ms 8388 KB Output is correct
7 Correct 55 ms 9696 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 6 ms 5200 KB Output is correct
12 Correct 57 ms 8448 KB Output is correct
13 Correct 1 ms 4696 KB Output is correct
14 Correct 7 ms 5148 KB Output is correct
15 Correct 56 ms 8992 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6504 KB Output is correct
2 Correct 24 ms 6356 KB Output is correct
3 Correct 54 ms 9160 KB Output is correct
4 Correct 40 ms 9416 KB Output is correct
5 Correct 649 ms 4696 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 6 ms 5148 KB Output is correct
8 Correct 57 ms 9676 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 9048 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -