oj.uz

Submission #695303

# Submission time Handle Problem Language Result Execution time Memory
695303 2023-02-05T00:16:12 Z GusterGoose27 Misspelling (JOI22_misspelling) C++11
100 / 100
 1157 ms 398492 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 5e5;
const int MOD = 1e9+7;
int n, m;
int add[2][MAXN]; // each interval is either nonintersecting on the right, inter
vector<int> del[2][MAXN]; // each interval is either nonintersecting on the right, inter
int dp[MAXN][26];
int cur_sum[MAXN][26][2]; // node, letter, 0 is sum of smaller things, 1 is sum of bigger things
int presum[MAXN][26][2];
int cur_allow[26];

class stree {
public:
	int lp, rp;
	stree *l = nullptr;
	stree *r = nullptr;
	int c = 0; // c = min(lc, rc)
	int lz = 0;
	stree(int lv, int rv) {
		lp = lv;
		rp = rv;
		if (lp < rp) {
			int mid = (lp+rp)/2;
			l = new stree(lp, mid);
			r = new stree(mid+1, rp);
		}
	}
	void add_to(int v) {
		c += v;
		lz += v;
	}
	void prop() {
		l->add_to(lz);
		r->add_to(lz);
		lz = 0;
	}
	int leftmost() { // leftmost thing which is 0
		if (c) return n;
		if (lp == rp) return lp;
		prop();
		int ql = l->leftmost();
		if (ql < n) return ql;
		return r->leftmost();
	}
	void upd(int lv, int rv, int v = 1) {
		if (lp > rv || rp < lv) return;
		if (lp >= lv && rp <= rv) {
			add_to(v);
			return;
		}
		prop();
		l->upd(lv, rv, v);
		r->upd(lv, rv, v);
	}
};

void make_sums(int i) {
	for (int j = 1; j < 26; j++) {
		cur_sum[i][j][0] = (cur_sum[i][j-1][0]+dp[i][j-1])%MOD;
		presum[i][j][0] = cur_sum[i][j][0];
		if (i) presum[i][j][0] = (presum[i][j][0]+presum[i-1][j][0])%MOD;
		cur_allow[j] = (cur_allow[j]+cur_sum[i][j][0])%MOD;
	}
	for (int j = 24; j >= 0; j--) {
		cur_sum[i][j][1] = (cur_sum[i][j+1][1]+dp[i][j+1])%MOD;
		presum[i][j][1] = cur_sum[i][j][1];
		if (i) presum[i][j][1] = (presum[i][j][1]+presum[i-1][j][1])%MOD;
		cur_allow[j] = (cur_allow[j]+cur_sum[i][j][1])%MOD;
	}
}

stree *trees[2];

void ins(int l, int r, int j) {
	for (int i = 0; i < 26; i++) {
		int amt = presum[r][i][j]-((l == 0) ? 0 : presum[l-1][i][j]);
		amt = (MOD+amt)%MOD;
		cur_allow[i] += amt;
		cur_allow[i] %= MOD;
	}
}

void rem(int l, int r, int j) {
	for (int i = 0; i < 26; i++) {
		int amt = -presum[r][i][j]+((l == 0) ? 0 : presum[l-1][i][j]);
		amt = (MOD+amt)%MOD;
		cur_allow[i] += amt;
		cur_allow[i] %= MOD;
	}
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> m;
	fill(add[0], add[0]+n, -1);
	fill(add[1], add[1]+n, -1);
	for (int i = 0; i < m; i++) {
		int x, y; cin >> x >> y;
		x--; y--;
		if (x < y) add[0][x] = max(add[0][x], y);
		else add[1][y] = max(add[1][y], x);
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 2; j++) {
			if (add[j][i] != -1) {
				del[j][add[j][i]].push_back(i);
			}
		}
	}
	int ans = 0;
	trees[0] = new stree(0, n-1);
	trees[1] = new stree(0, n-1);
	for (int i = 0; i < n; i++) {
		if (i == 0) {
			for (int j = 0; j < 26; j++) dp[i][j] = 1;
			ans += 26;
		}
		else {
			for (int j = 0; j < 26; j++) {
				dp[i][j] = cur_allow[j];
				ans += cur_allow[j];
				ans %= MOD;
			}
		}
		make_sums(i);
		for (int j = 0; j < 2; j++) {
			if (add[j][i] >= 0) {
				int l = trees[j]->leftmost();
				if (l <= i) {
					rem(l, i, j);
				}
				trees[j]->upd(0, i);
			}
			for (int v: del[j][i]) {
				trees[j]->upd(0, v, -1);
				int l = trees[j]->leftmost();
				if (l <= v) ins(l, v, j);
			}
		}
	}
	cout << ans << "\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23844 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23840 KB Output is correct
4 Correct 12 ms 23832 KB Output is correct
5 Correct 12 ms 23792 KB Output is correct
6 Correct 12 ms 23836 KB Output is correct
7 Correct 11 ms 23764 KB Output is correct
8 Correct 11 ms 23832 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 12 ms 23916 KB Output is correct
11 Correct 12 ms 23836 KB Output is correct
12 Correct 12 ms 23840 KB Output is correct
13 Correct 12 ms 23828 KB Output is correct
14 Correct 12 ms 23836 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23844 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23840 KB Output is correct
4 Correct 12 ms 23832 KB Output is correct
5 Correct 12 ms 23792 KB Output is correct
6 Correct 12 ms 23836 KB Output is correct
7 Correct 11 ms 23764 KB Output is correct
8 Correct 11 ms 23832 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 12 ms 23916 KB Output is correct
11 Correct 12 ms 23836 KB Output is correct
12 Correct 12 ms 23840 KB Output is correct
13 Correct 12 ms 23828 KB Output is correct
14 Correct 12 ms 23836 KB Output is correct
15 Correct 12 ms 23892 KB Output is correct
16 Correct 11 ms 23976 KB Output is correct
17 Correct 12 ms 23936 KB Output is correct
18 Correct 12 ms 23892 KB Output is correct
19 Correct 12 ms 23904 KB Output is correct
20 Correct 13 ms 23892 KB Output is correct
21 Correct 14 ms 24000 KB Output is correct
22 Correct 13 ms 23968 KB Output is correct
23 Correct 13 ms 23928 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 12 ms 23988 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 12 ms 23852 KB Output is correct
4 Correct 12 ms 23800 KB Output is correct
5 Correct 776 ms 398492 KB Output is correct
6 Correct 770 ms 398332 KB Output is correct
7 Correct 774 ms 398384 KB Output is correct
8 Correct 791 ms 398280 KB Output is correct
9 Correct 766 ms 398328 KB Output is correct
10 Correct 39 ms 38676 KB Output is correct
11 Correct 11 ms 23892 KB Output is correct
12 Correct 12 ms 23740 KB Output is correct
13 Correct 1157 ms 398396 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23844 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23840 KB Output is correct
4 Correct 12 ms 23832 KB Output is correct
5 Correct 12 ms 23792 KB Output is correct
6 Correct 12 ms 23836 KB Output is correct
7 Correct 11 ms 23764 KB Output is correct
8 Correct 11 ms 23832 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 12 ms 23916 KB Output is correct
11 Correct 12 ms 23836 KB Output is correct
12 Correct 12 ms 23840 KB Output is correct
13 Correct 12 ms 23828 KB Output is correct
14 Correct 12 ms 23836 KB Output is correct
15 Correct 12 ms 23892 KB Output is correct
16 Correct 11 ms 23976 KB Output is correct
17 Correct 12 ms 23936 KB Output is correct
18 Correct 12 ms 23892 KB Output is correct
19 Correct 12 ms 23904 KB Output is correct
20 Correct 13 ms 23892 KB Output is correct
21 Correct 14 ms 24000 KB Output is correct
22 Correct 13 ms 23968 KB Output is correct
23 Correct 13 ms 23928 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 12 ms 23988 KB Output is correct
26 Correct 40 ms 38724 KB Output is correct
27 Correct 33 ms 38204 KB Output is correct
28 Correct 35 ms 38172 KB Output is correct
29 Correct 41 ms 38444 KB Output is correct
30 Correct 41 ms 38512 KB Output is correct
31 Correct 117 ms 43820 KB Output is correct
32 Correct 40 ms 38744 KB Output is correct
33 Correct 40 ms 38684 KB Output is correct
34 Correct 40 ms 38428 KB Output is correct
35 Correct 121 ms 43660 KB Output is correct
36 Correct 27 ms 37844 KB Output is correct
37 Correct 39 ms 38348 KB Output is correct
38 Correct 43 ms 38160 KB Output is correct
39 Correct 31 ms 38100 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23844 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23840 KB Output is correct
4 Correct 12 ms 23832 KB Output is correct
5 Correct 12 ms 23792 KB Output is correct
6 Correct 12 ms 23836 KB Output is correct
7 Correct 11 ms 23764 KB Output is correct
8 Correct 11 ms 23832 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 12 ms 23916 KB Output is correct
11 Correct 12 ms 23836 KB Output is correct
12 Correct 12 ms 23840 KB Output is correct
13 Correct 12 ms 23828 KB Output is correct
14 Correct 12 ms 23836 KB Output is correct
15 Correct 12 ms 23892 KB Output is correct
16 Correct 11 ms 23976 KB Output is correct
17 Correct 12 ms 23936 KB Output is correct
18 Correct 12 ms 23892 KB Output is correct
19 Correct 12 ms 23904 KB Output is correct
20 Correct 13 ms 23892 KB Output is correct
21 Correct 14 ms 24000 KB Output is correct
22 Correct 13 ms 23968 KB Output is correct
23 Correct 13 ms 23928 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 12 ms 23988 KB Output is correct
26 Correct 11 ms 23764 KB Output is correct
27 Correct 11 ms 23764 KB Output is correct
28 Correct 12 ms 23852 KB Output is correct
29 Correct 12 ms 23800 KB Output is correct
30 Correct 776 ms 398492 KB Output is correct
31 Correct 770 ms 398332 KB Output is correct
32 Correct 774 ms 398384 KB Output is correct
33 Correct 791 ms 398280 KB Output is correct
34 Correct 766 ms 398328 KB Output is correct
35 Correct 39 ms 38676 KB Output is correct
36 Correct 11 ms 23892 KB Output is correct
37 Correct 12 ms 23740 KB Output is correct
38 Correct 1157 ms 398396 KB Output is correct
39 Correct 40 ms 38724 KB Output is correct
40 Correct 33 ms 38204 KB Output is correct
41 Correct 35 ms 38172 KB Output is correct
42 Correct 41 ms 38444 KB Output is correct
43 Correct 41 ms 38512 KB Output is correct
44 Correct 117 ms 43820 KB Output is correct
45 Correct 40 ms 38744 KB Output is correct
46 Correct 40 ms 38684 KB Output is correct
47 Correct 40 ms 38428 KB Output is correct
48 Correct 121 ms 43660 KB Output is correct
49 Correct 27 ms 37844 KB Output is correct
50 Correct 39 ms 38348 KB Output is correct
51 Correct 43 ms 38160 KB Output is correct
52 Correct 31 ms 38100 KB Output is correct
53 Correct 732 ms 384600 KB Output is correct
54 Correct 723 ms 384612 KB Output is correct
55 Correct 991 ms 393000 KB Output is correct
56 Correct 1004 ms 392908 KB Output is correct
57 Correct 773 ms 398268 KB Output is correct
58 Correct 789 ms 398268 KB Output is correct
59 Correct 772 ms 398236 KB Output is correct
60 Correct 986 ms 391496 KB Output is correct
61 Correct 374 ms 376012 KB Output is correct
62 Correct 872 ms 388528 KB Output is correct
63 Correct 726 ms 385080 KB Output is correct
64 Correct 578 ms 380996 KB Output is correct