답안 #1052938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1052938	2024-08-11T06:23:25 Z	vjudge1	Trains (BOI24_trains)	C++17	16 / 100	196 ms	5212 KB

Main

#include <iostream>
#include <vector>

using namespace std;
const int N = 1e5 + 5;
int dp[N], mod = 1e9 + 7, Ans;
int Mod[505][505];
vector<pair<int,int>> rem[N];

int main(){
	int n;
	cin>>n;
	dp[1] = 1;
	for (int i=1, d, x;i<=n;i++){
		cin>>d>>x;
		for (int m=1;m<=500;m++)
			dp[i] = (dp[i] + Mod[m][i % m]) % mod;

		if (d > 500){
			for (int j=d;j/d<=x and i + j <= n;j++)
				dp[j + i] = (dp[j + i] + dp[i]) % mod;
		}
		else if (d){
			Mod[d][i % d] = (Mod[d][i % d] + dp[i]) % mod;
		}

		if (d and d * x + i <= n)
			rem[d * x + i].push_back({i, d});
		
		for (auto [ind, d_ind] : rem[i])
			Mod[d_ind][ind % d_ind] = (Mod[d_ind][ind % d_ind] - dp[ind] + mod) % mod;
		Ans = (Ans + dp[i]) % mod;
		// exit by removing those 
	}
	cout<<Ans<<'\n';
}

Subtask #1

0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2652 KB	Output is correct
2	Correct	0 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	0 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	0 ms	2652 KB	Output is correct
8	Runtime error	2 ms	5212 KB	Execution killed with signal 11
9	Halted	0 ms	0 KB	-

Subtask #2

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2652 KB	Output is correct
2	Correct	0 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	0 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	0 ms	2652 KB	Output is correct
8	Runtime error	2 ms	5212 KB	Execution killed with signal 11
9	Halted	0 ms	0 KB	-

Subtask #3

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2652 KB	Output is correct
2	Correct	14 ms	2812 KB	Output is correct
3	Correct	9 ms	2652 KB	Output is correct
4	Correct	16 ms	2792 KB	Output is correct
5	Correct	143 ms	4772 KB	Output is correct
6	Correct	184 ms	3152 KB	Output is correct
7	Correct	196 ms	3408 KB	Output is correct
8	Correct	1 ms	2652 KB	Output is correct
9	Correct	0 ms	2652 KB	Output is correct
10	Correct	1 ms	2652 KB	Output is correct
11	Correct	21 ms	2904 KB	Output is correct
12	Correct	194 ms	3140 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	20 ms	2652 KB	Output is correct
15	Correct	191 ms	2932 KB	Output is correct

Subtask #4

0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	2 ms	5208 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2652 KB	Output is correct
2	Correct	0 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	0 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	0 ms	2652 KB	Output is correct
8	Runtime error	2 ms	5212 KB	Execution killed with signal 11
9	Halted	0 ms	0 KB	-