oj.uz

Submission #778843

# Submission time Handle Problem Language Result Execution time Memory
778843 2023-07-10T20:12:20 Z aZvezda Misspelling (JOI22_misspelling) C++14
100 / 100
 1154 ms 245424 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifndef LOCAL
#define cerr if(false)cerr
#endif

const ll mod = 1e9 + 7;

const ll MAX_N = 5e5 + 10;
const ll MAX_ALPH = 26;
ll dp[MAX_N][MAX_ALPH], pref[MAX_N][MAX_ALPH];
vector<pair<ll, ll> > starting[MAX_N];
ll n, m;

ll sum(ll l, ll r, ll ind) {
	if(r < l) { return 0; }
	if(l == 0) {
		return pref[r][ind];
	} else {
		return pref[r][ind] - pref[l - 1][ind];
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);

	cin >> n >> m;
	for(ll i = 1; i <= m; i ++) {
		ll a, b;
		cin >> a >> b;
		if(a < b) {
			starting[a].push_back({b - 1, i});
		} else {
			starting[b].push_back({a - 1, -i});
		}
	}

	priority_queue<pair<ll, ll> > red, blue;
	for(ll i = 0; i < MAX_ALPH; i ++) {
		dp[0][i] = 1;
		pref[0][i] = 1;
	}
	for(ll i = 1; i < n; i ++) {
		for(const auto &it : starting[i]) {
			if(it.second < 0) {
				red.push({i, it.first});
			} else {
				blue.push({i, it.first});
			}
		}
		while(!red.empty() && red.top().second < i) { red.pop(); }
		while(!blue.empty() && blue.top().second < i) { blue.pop(); }

		ll last_red = red.empty() ? 0 : red.top().first;
		ll last_blue = blue.empty() ? 0 : blue.top().first;
		ll l = min(last_red, last_blue), r = max(last_red, last_blue);

		cerr << "Found diff " << last_red << " " << last_blue << endl;

		const auto fix = [&](auto &x) { x = (x % mod + mod) % mod; };

		for(ll j = 0; j < MAX_ALPH; j ++) {
			for(ll k = 0; k < j; k ++) {
				dp[i][k] += sum(r, i - 1, j);
				if(last_red > last_blue) {
					dp[i][k] += sum(l, r - 1, j);	
				}
				fix(dp[i][k]);
			}
			for(ll k = j + 1; k < MAX_ALPH; k ++) {
				dp[i][k] += sum(r, i - 1, j);
				if(last_red < last_blue) {
					dp[i][k] += sum(l, r - 1, j);	
				}
				fix(dp[i][k]);
			}
		}

		for(ll j = 0; j < MAX_ALPH; j ++) {
			cerr << dp[i][j] << " ";
			pref[i][j] = (pref[i - 1][j] + dp[i][j]) % mod;
		}
		cerr << endl;
	}
	ll ans = 0;
	for(ll i = 0; i < MAX_ALPH; i ++) {
		ans = (ans + pref[n - 1][i]) % mod;
	}
	cout << ans << endl;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 12076 KB Output is correct
13 Correct 6 ms 12016 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 12068 KB Output is correct
16 Correct 6 ms 12080 KB Output is correct
17 Correct 6 ms 12116 KB Output is correct
18 Correct 6 ms 12116 KB Output is correct
19 Correct 6 ms 12116 KB Output is correct
20 Correct 7 ms 12116 KB Output is correct
21 Correct 7 ms 12072 KB Output is correct
22 Correct 8 ms 12756 KB Output is correct
23 Correct 6 ms 12116 KB Output is correct
24 Correct 6 ms 12116 KB Output is correct
25 Correct 6 ms 12180 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11988 KB Output is correct
2 Correct 5 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 8 ms 11988 KB Output is correct
5 Correct 1029 ms 244908 KB Output is correct
6 Correct 1034 ms 244756 KB Output is correct
7 Correct 1069 ms 244536 KB Output is correct
8 Correct 1020 ms 245424 KB Output is correct
9 Correct 1101 ms 244164 KB Output is correct
10 Correct 46 ms 21468 KB Output is correct
11 Correct 6 ms 12052 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 1127 ms 243212 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 12076 KB Output is correct
13 Correct 6 ms 12016 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 12068 KB Output is correct
16 Correct 6 ms 12080 KB Output is correct
17 Correct 6 ms 12116 KB Output is correct
18 Correct 6 ms 12116 KB Output is correct
19 Correct 6 ms 12116 KB Output is correct
20 Correct 7 ms 12116 KB Output is correct
21 Correct 7 ms 12072 KB Output is correct
22 Correct 8 ms 12756 KB Output is correct
23 Correct 6 ms 12116 KB Output is correct
24 Correct 6 ms 12116 KB Output is correct
25 Correct 6 ms 12180 KB Output is correct
26 Correct 46 ms 21564 KB Output is correct
27 Correct 46 ms 20800 KB Output is correct
28 Correct 46 ms 20820 KB Output is correct
29 Correct 58 ms 21376 KB Output is correct
30 Correct 49 ms 21468 KB Output is correct
31 Correct 196 ms 46144 KB Output is correct
32 Correct 56 ms 21300 KB Output is correct
33 Correct 46 ms 21368 KB Output is correct
34 Correct 51 ms 21376 KB Output is correct
35 Correct 159 ms 46908 KB Output is correct
36 Correct 44 ms 20172 KB Output is correct
37 Correct 58 ms 21012 KB Output is correct
38 Correct 56 ms 20940 KB Output is correct
39 Correct 45 ms 20560 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 12076 KB Output is correct
13 Correct 6 ms 12016 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 12068 KB Output is correct
16 Correct 6 ms 12080 KB Output is correct
17 Correct 6 ms 12116 KB Output is correct
18 Correct 6 ms 12116 KB Output is correct
19 Correct 6 ms 12116 KB Output is correct
20 Correct 7 ms 12116 KB Output is correct
21 Correct 7 ms 12072 KB Output is correct
22 Correct 8 ms 12756 KB Output is correct
23 Correct 6 ms 12116 KB Output is correct
24 Correct 6 ms 12116 KB Output is correct
25 Correct 6 ms 12180 KB Output is correct
26 Correct 5 ms 11988 KB Output is correct
27 Correct 5 ms 11988 KB Output is correct
28 Correct 6 ms 11988 KB Output is correct
29 Correct 8 ms 11988 KB Output is correct
30 Correct 1029 ms 244908 KB Output is correct
31 Correct 1034 ms 244756 KB Output is correct
32 Correct 1069 ms 244536 KB Output is correct
33 Correct 1020 ms 245424 KB Output is correct
34 Correct 1101 ms 244164 KB Output is correct
35 Correct 46 ms 21468 KB Output is correct
36 Correct 6 ms 12052 KB Output is correct
37 Correct 6 ms 11988 KB Output is correct
38 Correct 1127 ms 243212 KB Output is correct
39 Correct 46 ms 21564 KB Output is correct
40 Correct 46 ms 20800 KB Output is correct
41 Correct 46 ms 20820 KB Output is correct
42 Correct 58 ms 21376 KB Output is correct
43 Correct 49 ms 21468 KB Output is correct
44 Correct 196 ms 46144 KB Output is correct
45 Correct 56 ms 21300 KB Output is correct
46 Correct 46 ms 21368 KB Output is correct
47 Correct 51 ms 21376 KB Output is correct
48 Correct 159 ms 46908 KB Output is correct
49 Correct 44 ms 20172 KB Output is correct
50 Correct 58 ms 21012 KB Output is correct
51 Correct 56 ms 20940 KB Output is correct
52 Correct 45 ms 20560 KB Output is correct
53 Correct 1000 ms 230704 KB Output is correct
54 Correct 1059 ms 230824 KB Output is correct
55 Correct 1151 ms 244628 KB Output is correct
56 Correct 1108 ms 244536 KB Output is correct
57 Correct 1020 ms 244196 KB Output is correct
58 Correct 1137 ms 242296 KB Output is correct
59 Correct 1016 ms 244592 KB Output is correct
60 Correct 1154 ms 243336 KB Output is correct
61 Correct 910 ms 215564 KB Output is correct
62 Correct 1131 ms 236688 KB Output is correct
63 Correct 1111 ms 229936 KB Output is correct
64 Correct 1047 ms 222944 KB Output is correct