oj.uz

Submission #994563

# Submission time Handle Problem Language Result Execution time Memory
994563 2024-06-08T01:19:56 Z pavement Trains (BOI24_trains) C++17
21 / 100
 2000 ms 86992 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int MOD = (int)1e9 + 7, LIM = 200, LIM2 = 200;
int N, d[100005], x[100005], dp[100005];
vector<int> vec[LIM2 + 5][LIM2];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> d[i] >> x[i];
	}
	for (int i = N; i >= 1; i--) {
		if (d[i]) {
			int num_stops = min(x[i], (N - i) / d[i]);
			if (num_stops <= LIM) {
				for (int j = 1; j <= num_stops; j++) {
					dp[i] = (dp[i] + dp[i + j * d[i]]) % MOD;
				}
			} else {
				assert(d[i] <= LIM2);
				for (int j = 1; j <= num_stops; j++) {
					dp[i] = (dp[i] + vec[d[i]][i % d[i]][vec[d[i]][i % d[i]].size() - j]) % MOD;
				}
			}
		}
		dp[i] = (dp[i] + 1) % MOD;
		for (int j = 1; j <= LIM2; j++) {
			vec[j][i % j].pb(dp[i]);
		}
	}
	cout << dp[1] << '\n';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1396 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1396 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 30 ms 11428 KB Output is correct
21 Correct 10 ms 5244 KB Output is correct
22 Correct 27 ms 13660 KB Output is correct
23 Correct 84 ms 9552 KB Output is correct
24 Correct 12 ms 6488 KB Output is correct
25 Correct 25 ms 12124 KB Output is correct
26 Correct 49 ms 6988 KB Output is correct
27 Correct 153 ms 11704 KB Output is correct
28 Correct 45 ms 13648 KB Output is correct
29 Correct 216 ms 13648 KB Output is correct
30 Correct 24 ms 13512 KB Output is correct
31 Correct 118 ms 13588 KB Output is correct
32 Correct 208 ms 13516 KB Output is correct
33 Correct 24 ms 13660 KB Output is correct
34 Correct 23 ms 13660 KB Output is correct
35 Correct 22 ms 13656 KB Output is correct
36 Correct 30 ms 13648 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 85 ms 9548 KB Output is correct
3 Correct 49 ms 6996 KB Output is correct
4 Correct 157 ms 11728 KB Output is correct
5 Correct 130 ms 86992 KB Output is correct
6 Execution timed out 2096 ms 41164 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1326 ms 57804 KB Output is correct
2 Correct 934 ms 47472 KB Output is correct
3 Execution timed out 2079 ms 62412 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1396 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 30 ms 11428 KB Output is correct
21 Correct 10 ms 5244 KB Output is correct
22 Correct 27 ms 13660 KB Output is correct
23 Correct 84 ms 9552 KB Output is correct
24 Correct 12 ms 6488 KB Output is correct
25 Correct 25 ms 12124 KB Output is correct
26 Correct 49 ms 6988 KB Output is correct
27 Correct 153 ms 11704 KB Output is correct
28 Correct 45 ms 13648 KB Output is correct
29 Correct 216 ms 13648 KB Output is correct
30 Correct 24 ms 13512 KB Output is correct
31 Correct 118 ms 13588 KB Output is correct
32 Correct 208 ms 13516 KB Output is correct
33 Correct 24 ms 13660 KB Output is correct
34 Correct 23 ms 13660 KB Output is correct
35 Correct 22 ms 13656 KB Output is correct
36 Correct 30 ms 13648 KB Output is correct
37 Correct 1 ms 1368 KB Output is correct
38 Correct 85 ms 9548 KB Output is correct
39 Correct 49 ms 6996 KB Output is correct
40 Correct 157 ms 11728 KB Output is correct
41 Correct 130 ms 86992 KB Output is correct
42 Execution timed out 2096 ms 41164 KB Time limit exceeded
43 Halted 0 ms 0 KB -