Submission #908808

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
908808	2024-01-16T22:39:25 Z	MinaRagy06	Misspelling (JOI22_misspelling)	C++17	100 / 100	606 ms	219144 KB

misspelling

#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int mod = 1e9 + 7;
struct mint {
	int v;
	mint(long long x) {
		if (x >= mod) x %= mod;
		v = x;
	}
	mint() {v = 0;}
	mint& operator+=(mint b) {
		if ((v += b.v) >= mod) {
			v -= mod;
		}
		return *this;
	}
	mint& operator-=(mint b) {
		if ((v -= b.v) < 0) {
			v += mod;
		}
		return *this;
	}
	mint& operator*=(mint b) {
		v = 1ll * v * b.v % mod;
		return *this;
	}
	mint power(mint a, int b) {
		mint ans = 1;
		while (b) {
			if (b & 1) {
				ans *= a;
			}
			a *= a, b >>= 1;
		}
		return ans;
	}
	mint& operator/=(mint b) {
		v = 1ll * v * power(b, mod - 2).v % mod;
		return *this;
	}
	friend mint operator+(mint a, mint b) {
		return a += b;
	}
	friend mint operator-(mint a, mint b) {
		return a -= b;
	}
	friend mint operator*(mint a, mint b) {
		return a *= b;
	}
	friend mint operator/(mint a, mint b) {
		return a /= b;
	}
	friend istream& operator>>(istream &is, mint a) {
		return is >> a.v;
	}
	friend ostream& operator<<(ostream &os, mint a) {
		return os << a.v;
	}
};

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<int> st[n][2];
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		a--, b--;
		if (a < b) {
			//s[i - 1] > s[i]
			st[a + 1][0].push_back(b + 1);
		} else {
			//s[i - 1] < s[i]
			st[b + 1][1].push_back(a + 1);
		}
	}
	mint dp[n + 1][26], prfx[n + 1][26], sufx[n + 1][26];
	for (int j = 0; j < 26; j++) prfx[n][j] = sufx[n][j] = dp[n][j] = 1;
	for (int j = 1; j < 26; j++) prfx[n][j] += prfx[n][j - 1];
	for (int j = 24; j >= 0; j--) sufx[n][j] += sufx[n][j + 1];
	set<int> active[2];
	mint sum[26][2];
	for (int i = n - 1; i >= 0; i--) {
		active[0].insert(i);
		active[1].insert(i);
		for (int j = 0; j < 26; j++) {
			if (j - 1 >= 0) sum[j][0] += prfx[i + 1][j - 1];
			if (j + 1 < 26) sum[j][1] += sufx[i + 1][j + 1];
		}
		for (auto en : st[i][0]) {
			auto it = active[1].lower_bound(i);
			while (it != active[1].end() && *it < en) {
				for (int j = 0; j + 1 < 26; j++) {
					sum[j][1] -= sufx[*it + 1][j + 1];
				}
				active[1].erase(it);
				it = active[1].lower_bound(i);
			}
		}
		for (auto en : st[i][1]) {
			auto it = active[0].lower_bound(i);
			while (it != active[0].end() && *it < en) {
				for (int j = 1; j < 26; j++) {
					sum[j][0] -= prfx[*it + 1][j - 1];
				}
				active[0].erase(it);
				it = active[0].lower_bound(i);
			}
		}
		for (int j = 0; j < 26; j++) {
			prfx[i][j] = sufx[i][j] = dp[i][j] = sum[j][0] + sum[j][1] + 1;
		}
		for (int j = 1; j < 26; j++) {
			prfx[i][j] += prfx[i][j - 1];
		}
		for (int j = 24; j >= 0; j--) {
			sufx[i][j] += sufx[i][j + 1];
		}
	}
	mint ans = 0;
	for (int j = 0; j < 26; j++) {
		ans += dp[1][j];
	}
	cout << ans << '\n';
	return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	368 ms	192300 KB	Output is correct
6	Correct	372 ms	192152 KB	Output is correct
7	Correct	360 ms	192220 KB	Output is correct
8	Correct	359 ms	192208 KB	Output is correct
9	Correct	360 ms	192408 KB	Output is correct
10	Correct	15 ms	8104 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	524 ms	192464 KB	Output is correct

Subtask #4
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	460 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	456 KB	Output is correct
22	Correct	2 ms	604 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	14 ms	8024 KB	Output is correct
27	Correct	14 ms	8536 KB	Output is correct
28	Correct	14 ms	8536 KB	Output is correct
29	Correct	15 ms	8028 KB	Output is correct
30	Correct	15 ms	8152 KB	Output is correct
31	Correct	92 ms	11088 KB	Output is correct
32	Correct	14 ms	8028 KB	Output is correct
33	Correct	14 ms	8024 KB	Output is correct
34	Correct	16 ms	7772 KB	Output is correct
35	Correct	92 ms	11476 KB	Output is correct
36	Correct	14 ms	9048 KB	Output is correct
37	Correct	15 ms	7772 KB	Output is correct
38	Correct	16 ms	7772 KB	Output is correct
39	Correct	14 ms	7516 KB	Output is correct

Subtask #5
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	460 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	456 KB	Output is correct
22	Correct	2 ms	604 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	368 ms	192300 KB	Output is correct
31	Correct	372 ms	192152 KB	Output is correct
32	Correct	360 ms	192220 KB	Output is correct
33	Correct	359 ms	192208 KB	Output is correct
34	Correct	360 ms	192408 KB	Output is correct
35	Correct	15 ms	8104 KB	Output is correct
36	Correct	1 ms	344 KB	Output is correct
37	Correct	0 ms	344 KB	Output is correct
38	Correct	524 ms	192464 KB	Output is correct
39	Correct	14 ms	8024 KB	Output is correct
40	Correct	14 ms	8536 KB	Output is correct
41	Correct	14 ms	8536 KB	Output is correct
42	Correct	15 ms	8028 KB	Output is correct
43	Correct	15 ms	8152 KB	Output is correct
44	Correct	92 ms	11088 KB	Output is correct
45	Correct	14 ms	8028 KB	Output is correct
46	Correct	14 ms	8024 KB	Output is correct
47	Correct	16 ms	7772 KB	Output is correct
48	Correct	92 ms	11476 KB	Output is correct
49	Correct	14 ms	9048 KB	Output is correct
50	Correct	15 ms	7772 KB	Output is correct
51	Correct	16 ms	7772 KB	Output is correct
52	Correct	14 ms	7516 KB	Output is correct
53	Correct	362 ms	186780 KB	Output is correct
54	Correct	451 ms	211024 KB	Output is correct
55	Correct	470 ms	199252 KB	Output is correct
56	Correct	476 ms	199420 KB	Output is correct
57	Correct	365 ms	198832 KB	Output is correct
58	Correct	382 ms	198832 KB	Output is correct
59	Correct	361 ms	198700 KB	Output is correct
60	Correct	575 ms	194812 KB	Output is correct
61	Correct	606 ms	219144 KB	Output is correct
62	Correct	485 ms	190856 KB	Output is correct
63	Correct	421 ms	186664 KB	Output is correct
64	Correct	375 ms	182096 KB	Output is correct

Submission #908808

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