oj.uz

Submission #556965

# Submission time Handle Problem Language Result Execution time Memory
556965 2022-05-04T13:03:53 Z DanShaders Misspelling (JOI22_misspelling) C++17
100 / 100
 2281 ms 129052 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;

namespace x = __gnu_pbds;
template <typename T>
using ordered_set = x::tree<T, x::null_type, less<T>, x::rb_tree_tag, x::tree_order_statistics_node_update>;

template <typename T>
using normal_queue = priority_queue<T, vector<T>, greater<>>;

#define all(x) begin(x), end(x)
#define sz(x) ((int) (x).size())
#define x first
#define y second
using ll = long long;
using ld = long double;

#define int ll

const int N = 1 << 19, C = 26, MOD = 1e9 + 7;

int dp[N][C + 1], t[2][2 * N];

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m;
	cin >> n >> m;
	fill(t[0], t[2], -1);
	for (int i = 0; i < m; ++i) {
		int u, v;
		cin >> u >> v;
		--u, --v;
		int l = N + min(u, v) + 1, r = N + max(u, v);
		bool at = u > v;
		while (l <= r) {
			if (l & 1)	t[at][l] = max(t[at][l], min(u, v));
			if (!(r & 1))	t[at][r] = max(t[at][r], min(u, v));
			l = (l + 1) / 2;
			r = (r - 1) / 2;
		}
	}
	for (int i = 0; i < 2; ++i) {
		for (int j = 0; j < N; ++j) {
			t[i][2 * j] = max(t[i][2 * j], t[i][j]);
			t[i][2 * j + 1] = max(t[i][2 * j + 1], t[i][j]);
		}
	}

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < C; ++j) {
			dp[i][j] = 0;
		}
	}
	for (int i = 0; i < C; ++i) {
		dp[n - 1][i] = 1;
	}

	for (int i = n - 1; i > 0; --i) {
		for (int j = 0; j < C; ++j) {
			(dp[i][j] += dp[i + 1][j]) %= MOD;
		}
		for (int c0 = 0; c0 < C; ++c0) {
			int j0 = t[0][N + i], j1 = t[1][N + i];
			for (int c1 = 0; c1 < C; ++c1) {
				if (c0 != c1) {
					(dp[i - 1][c1] += dp[i][c0]) %= MOD;
					(dp[max(j0, j1)][c1] -= dp[i][c0]) %= MOD;
					// for (int j = max(j0, j1) + 1; j < i; ++j) {
					// 	(dp[j][c1] += dp[i][c0]) %= MOD;
					// }
				}
			}
			if (j0 < j1) {
				for (int c1 = 0; c1 < c0; ++c1) {
					(dp[max(j0, j1)][c1] += dp[i][c0]) %= MOD;
					(dp[min(j0, j1)][c1] -= dp[i][c0]) %= MOD;
					// for (int j = min(j0, j1) + 1; j <= max(j0, j1); ++j) {
					// 	(dp[j][c1] += dp[i][c0]) %= MOD;
					// }
				}
			} else {
				for (int c1 = c0 + 1; c1 < C; ++c1) {
					(dp[max(j0, j1)][c1] += dp[i][c0]) %= MOD;
					(dp[min(j0, j1)][c1] -= dp[i][c0]) %= MOD;
					// for (int j = min(j0, j1) + 1; j <= max(j0, j1); ++j) {
					// 	(dp[j][c1] += dp[i][c0]) %= MOD;
					// }
				}
			}
		}
	}
	for (int j = 0; j < C; ++j) {
		(dp[0][j] += dp[1][j]) %= MOD;
	}

	cout << (accumulate(dp[0], dp[1], 0ll) % MOD + MOD) % MOD;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 9 ms 16712 KB Output is correct
3 Correct 9 ms 16652 KB Output is correct
4 Correct 9 ms 16740 KB Output is correct
5 Correct 10 ms 16736 KB Output is correct
6 Correct 9 ms 16728 KB Output is correct
7 Correct 11 ms 16724 KB Output is correct
8 Correct 10 ms 16724 KB Output is correct
9 Correct 10 ms 16724 KB Output is correct
10 Correct 11 ms 16724 KB Output is correct
11 Correct 10 ms 16724 KB Output is correct
12 Correct 10 ms 16716 KB Output is correct
13 Correct 9 ms 16712 KB Output is correct
14 Correct 10 ms 16632 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 9 ms 16712 KB Output is correct
3 Correct 9 ms 16652 KB Output is correct
4 Correct 9 ms 16740 KB Output is correct
5 Correct 10 ms 16736 KB Output is correct
6 Correct 9 ms 16728 KB Output is correct
7 Correct 11 ms 16724 KB Output is correct
8 Correct 10 ms 16724 KB Output is correct
9 Correct 10 ms 16724 KB Output is correct
10 Correct 11 ms 16724 KB Output is correct
11 Correct 10 ms 16724 KB Output is correct
12 Correct 10 ms 16716 KB Output is correct
13 Correct 9 ms 16712 KB Output is correct
14 Correct 10 ms 16632 KB Output is correct
15 Correct 10 ms 16740 KB Output is correct
16 Correct 11 ms 16784 KB Output is correct
17 Correct 12 ms 16708 KB Output is correct
18 Correct 10 ms 16708 KB Output is correct
19 Correct 10 ms 16748 KB Output is correct
20 Correct 11 ms 16744 KB Output is correct
21 Correct 10 ms 16708 KB Output is correct
22 Correct 12 ms 16724 KB Output is correct
23 Correct 11 ms 16740 KB Output is correct
24 Correct 11 ms 16724 KB Output is correct
25 Correct 11 ms 16724 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 9 ms 16688 KB Output is correct
3 Correct 9 ms 16692 KB Output is correct
4 Correct 10 ms 16724 KB Output is correct
5 Correct 2180 ms 122400 KB Output is correct
6 Correct 2237 ms 122400 KB Output is correct
7 Correct 2212 ms 122396 KB Output is correct
8 Correct 2281 ms 122400 KB Output is correct
9 Correct 2204 ms 122396 KB Output is correct
10 Correct 95 ms 20968 KB Output is correct
11 Correct 11 ms 16724 KB Output is correct
12 Correct 9 ms 16724 KB Output is correct
13 Correct 2242 ms 122400 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 9 ms 16712 KB Output is correct
3 Correct 9 ms 16652 KB Output is correct
4 Correct 9 ms 16740 KB Output is correct
5 Correct 10 ms 16736 KB Output is correct
6 Correct 9 ms 16728 KB Output is correct
7 Correct 11 ms 16724 KB Output is correct
8 Correct 10 ms 16724 KB Output is correct
9 Correct 10 ms 16724 KB Output is correct
10 Correct 11 ms 16724 KB Output is correct
11 Correct 10 ms 16724 KB Output is correct
12 Correct 10 ms 16716 KB Output is correct
13 Correct 9 ms 16712 KB Output is correct
14 Correct 10 ms 16632 KB Output is correct
15 Correct 10 ms 16740 KB Output is correct
16 Correct 11 ms 16784 KB Output is correct
17 Correct 12 ms 16708 KB Output is correct
18 Correct 10 ms 16708 KB Output is correct
19 Correct 10 ms 16748 KB Output is correct
20 Correct 11 ms 16744 KB Output is correct
21 Correct 10 ms 16708 KB Output is correct
22 Correct 12 ms 16724 KB Output is correct
23 Correct 11 ms 16740 KB Output is correct
24 Correct 11 ms 16724 KB Output is correct
25 Correct 11 ms 16724 KB Output is correct
26 Correct 97 ms 20948 KB Output is correct
27 Correct 99 ms 20952 KB Output is correct
28 Correct 98 ms 21016 KB Output is correct
29 Correct 99 ms 21044 KB Output is correct
30 Correct 100 ms 21168 KB Output is correct
31 Correct 224 ms 25112 KB Output is correct
32 Correct 94 ms 21112 KB Output is correct
33 Correct 95 ms 21140 KB Output is correct
34 Correct 124 ms 21164 KB Output is correct
35 Correct 268 ms 24380 KB Output is correct
36 Correct 90 ms 20936 KB Output is correct
37 Correct 95 ms 21088 KB Output is correct
38 Correct 98 ms 21056 KB Output is correct
39 Correct 94 ms 21000 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 9 ms 16712 KB Output is correct
3 Correct 9 ms 16652 KB Output is correct
4 Correct 9 ms 16740 KB Output is correct
5 Correct 10 ms 16736 KB Output is correct
6 Correct 9 ms 16728 KB Output is correct
7 Correct 11 ms 16724 KB Output is correct
8 Correct 10 ms 16724 KB Output is correct
9 Correct 10 ms 16724 KB Output is correct
10 Correct 11 ms 16724 KB Output is correct
11 Correct 10 ms 16724 KB Output is correct
12 Correct 10 ms 16716 KB Output is correct
13 Correct 9 ms 16712 KB Output is correct
14 Correct 10 ms 16632 KB Output is correct
15 Correct 10 ms 16740 KB Output is correct
16 Correct 11 ms 16784 KB Output is correct
17 Correct 12 ms 16708 KB Output is correct
18 Correct 10 ms 16708 KB Output is correct
19 Correct 10 ms 16748 KB Output is correct
20 Correct 11 ms 16744 KB Output is correct
21 Correct 10 ms 16708 KB Output is correct
22 Correct 12 ms 16724 KB Output is correct
23 Correct 11 ms 16740 KB Output is correct
24 Correct 11 ms 16724 KB Output is correct
25 Correct 11 ms 16724 KB Output is correct
26 Correct 9 ms 16724 KB Output is correct
27 Correct 9 ms 16688 KB Output is correct
28 Correct 9 ms 16692 KB Output is correct
29 Correct 10 ms 16724 KB Output is correct
30 Correct 2180 ms 122400 KB Output is correct
31 Correct 2237 ms 122400 KB Output is correct
32 Correct 2212 ms 122396 KB Output is correct
33 Correct 2281 ms 122400 KB Output is correct
34 Correct 2204 ms 122396 KB Output is correct
35 Correct 95 ms 20968 KB Output is correct
36 Correct 11 ms 16724 KB Output is correct
37 Correct 9 ms 16724 KB Output is correct
38 Correct 2242 ms 122400 KB Output is correct
39 Correct 97 ms 20948 KB Output is correct
40 Correct 99 ms 20952 KB Output is correct
41 Correct 98 ms 21016 KB Output is correct
42 Correct 99 ms 21044 KB Output is correct
43 Correct 100 ms 21168 KB Output is correct
44 Correct 224 ms 25112 KB Output is correct
45 Correct 94 ms 21112 KB Output is correct
46 Correct 95 ms 21140 KB Output is correct
47 Correct 124 ms 21164 KB Output is correct
48 Correct 268 ms 24380 KB Output is correct
49 Correct 90 ms 20936 KB Output is correct
50 Correct 95 ms 21088 KB Output is correct
51 Correct 98 ms 21056 KB Output is correct
52 Correct 94 ms 21000 KB Output is correct
53 Correct 2129 ms 125568 KB Output is correct
54 Correct 2152 ms 125496 KB Output is correct
55 Correct 2230 ms 122456 KB Output is correct
56 Correct 2249 ms 129052 KB Output is correct
57 Correct 2247 ms 128760 KB Output is correct
58 Correct 2160 ms 125384 KB Output is correct
59 Correct 2161 ms 122460 KB Output is correct
60 Correct 2281 ms 124808 KB Output is correct
61 Correct 2005 ms 122300 KB Output is correct
62 Correct 2225 ms 127292 KB Output is correct
63 Correct 2132 ms 125708 KB Output is correct
64 Correct 2101 ms 123928 KB Output is correct