Submission #936564

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936564	2024-03-02T07:50:22 Z	TAhmed33	Misspelling (JOI22_misspelling)	C++	100 / 100	1118 ms	64316 KB

misspelling

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int add (int a, int b) {
	a += b; if (a >= MOD) a -= MOD;
	return a;
}
int sub (int a, int b) {
	a -= b; if (a < 0) a += MOD;
	return a;
}
int mul (int a, int b) {
	return (a * 1ll * b) % MOD;
}
const int MAXN = 5e5 + 25;
int dp[MAXN][27];
int n, m, type1[MAXN], type2[MAXN];
int main () {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int a, b;
		cin >> a >> b;
		int l = min(a, b), r = max(a, b);
		if (a > b) {
			type1[l] = max(type1[l], r);
		} else {
			type2[l] = max(type2[l], r);
		}
	}
	for (int i = 0; i < 26; i++) {
		dp[1][i] = 1;
	}
	vector <pair <int, int>> s1, s2;
	s1.push_back({1, type1[1]});
	s2.push_back({1, type2[1]});
	for (int i = 2; i <= n; i++) {
		for (int j = 0; j < 26; j++) {
			int l = 0, r = (int)s2.size() - 1, ans = -1;
			while (l <= r) {
				int mid = (l + r) / 2;
				if (s2[mid].second >= i) {
					l = mid + 1; ans = mid;
				} else {
					r = mid - 1; 
				}
			}
			for (int k = 0; k < j; k++) {
				dp[i][j] = add(dp[i][j], sub(dp[i - 1][k], ans == -1 ? 0 : dp[s2[ans].first][k]));
			}
			l = 0, r = (int)s1.size() - 1, ans = -1;
			while (l <= r) {
				int mid = (l + r) / 2;
				if (s1[mid].second >= i) {
					l = mid + 1; ans = mid;
				} else {
					r = mid - 1; 
				}
			}
			for (int k = j + 1; k < 26; k++) {
				dp[i][j] = add(dp[i][j], sub(dp[i - 1][k], ans == -1 ? 0 : dp[s1[ans].first][k]));
			}
			dp[i][j] = add(dp[i][j], dp[i - 1][j]);
		}
		while (!s1.empty() && s1.back().second < type1[i]) s1.pop_back();
		s1.push_back({i, type1[i]});
		while (!s2.empty() && s2.back().second < type2[i]) s2.pop_back();
		s2.push_back({i, type2[i]});
	}
	int sum = 0;
	for (int i = 0; i < 26; i++) {
		sum = add(sum, dp[n][i]);
	}
	cout << sum << '\n';
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2648 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2648 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	4 ms	2392 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct

Subtask #3
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	898 ms	57160 KB	Output is correct
6	Correct	892 ms	56944 KB	Output is correct
7	Correct	902 ms	57172 KB	Output is correct
8	Correct	894 ms	57180 KB	Output is correct
9	Correct	910 ms	57064 KB	Output is correct
10	Correct	35 ms	4180 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1084 ms	57068 KB	Output is correct

Subtask #4
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2648 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	4 ms	2392 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	35 ms	4184 KB	Output is correct
27	Correct	34 ms	4688 KB	Output is correct
28	Correct	34 ms	4820 KB	Output is correct
29	Correct	42 ms	4544 KB	Output is correct
30	Correct	42 ms	4436 KB	Output is correct
31	Correct	215 ms	9524 KB	Output is correct
32	Correct	36 ms	4436 KB	Output is correct
33	Correct	36 ms	4552 KB	Output is correct
34	Correct	44 ms	4400 KB	Output is correct
35	Correct	242 ms	9528 KB	Output is correct
36	Correct	31 ms	4608 KB	Output is correct
37	Correct	44 ms	4440 KB	Output is correct
38	Correct	45 ms	4744 KB	Output is correct
39	Correct	43 ms	4436 KB	Output is correct

Subtask #5
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2648 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	4 ms	2392 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	898 ms	57160 KB	Output is correct
31	Correct	892 ms	56944 KB	Output is correct
32	Correct	902 ms	57172 KB	Output is correct
33	Correct	894 ms	57180 KB	Output is correct
34	Correct	910 ms	57064 KB	Output is correct
35	Correct	35 ms	4180 KB	Output is correct
36	Correct	1 ms	2392 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1084 ms	57068 KB	Output is correct
39	Correct	35 ms	4184 KB	Output is correct
40	Correct	34 ms	4688 KB	Output is correct
41	Correct	34 ms	4820 KB	Output is correct
42	Correct	42 ms	4544 KB	Output is correct
43	Correct	42 ms	4436 KB	Output is correct
44	Correct	215 ms	9524 KB	Output is correct
45	Correct	36 ms	4436 KB	Output is correct
46	Correct	36 ms	4552 KB	Output is correct
47	Correct	44 ms	4400 KB	Output is correct
48	Correct	242 ms	9528 KB	Output is correct
49	Correct	31 ms	4608 KB	Output is correct
50	Correct	44 ms	4440 KB	Output is correct
51	Correct	45 ms	4744 KB	Output is correct
52	Correct	43 ms	4436 KB	Output is correct
53	Correct	965 ms	60736 KB	Output is correct
54	Correct	950 ms	64080 KB	Output is correct
55	Correct	1075 ms	64316 KB	Output is correct
56	Correct	1077 ms	64196 KB	Output is correct
57	Correct	912 ms	63572 KB	Output is correct
58	Correct	907 ms	63912 KB	Output is correct
59	Correct	912 ms	63808 KB	Output is correct
60	Correct	1118 ms	63768 KB	Output is correct
61	Correct	914 ms	62560 KB	Output is correct
62	Correct	1087 ms	61952 KB	Output is correct
63	Correct	1072 ms	60640 KB	Output is correct
64	Correct	1090 ms	59204 KB	Output is correct

Submission #936564

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 20.0 / 20.0

Subtask #3 29.0 / 29.0

Subtask #4 32.0 / 32.0

Subtask #5 11.0 / 11.0

Subtask #1
8.0 / 8.0

Subtask #2
20.0 / 20.0

Subtask #3
29.0 / 29.0

Subtask #4
32.0 / 32.0

Subtask #5
11.0 / 11.0