oj.uz

Submission #547794

# Submission time Handle Problem Language Result Execution time Memory
547794 2022-04-11T18:42:10 Z nonsensenonsense1 Misspelling (JOI22_misspelling) C++17
100 / 100
 291 ms 57348 KB 
#include <cstdio>
#include <utility>
#include <algorithm>

const int md = 1000000007;

inline int add(int a, int b) {
	a += b;
	if (a >= md) a -= md;
	return a;
}
inline int sub(int a, int b) {
	a -= b;
	if (a < 0) a += md;
	return a;
}
inline int mul(int a, int b) {
	return (long long)a * b % md;
}

const int A = 26;
const int N = 500000;
int n, m, d[N][A], sum[2][A];
bool u[2][N];
std::pair<std::pair<int, int>, bool> a[N];
std::vector<int> un[2];

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; ++i) {
		int x, y;
		scanf("%d%d", &x, &y);
		--x;
		--y;
		if (x < y) a[i] = std::make_pair(std::make_pair(x, y), 1);
		else a[i] = std::make_pair(std::make_pair(y, x), 0);
	}
	std::sort(a, a + m);
	for (int i = n - 1, j = m - 1; i >= 0; --i) {
		if (i + 1 < n) {
			for (int j = 0; j < A; ++j) 
				for (int k = 0; k < 2; ++k) sum[k][j] = add(sum[k][j], d[i + 1][j]);
			un[0].push_back(i);
			un[1].push_back(i);
		}
		while (j >= 0 && a[j].first.first == i) {
			while (!un[a[j].second].empty() && un[a[j].second].back() < a[j].first.second) {
				for (int k = 0; k < A; ++k) sum[!a[j].second][k] = sub(sum[!a[j].second][k], d[un[a[j].second].back() + 1][k]);
				un[a[j].second].pop_back();
			}
			--j;
		}
		int less = 1;
		for (int x = 0; x < A; ++x) {
			d[i][x] = less;
			less = add(less, sum[1][x]);
		}
		less = 0;
		for (int x = A - 1; x >= 0; --x) {
			d[i][x] = add(d[i][x], less);
			less = add(less, sum[0][x]);
		}
	}
	int ans = 0;
	for (int i = 0; i < A; ++i) ans = add(ans, d[0][i]);
	printf("%d\n", ans);
	return 0;
}

Compilation message

misspelling.cpp: In function 'int main()':
misspelling.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
misspelling.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |   scanf("%d%d", &x, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 263 ms 56920 KB Output is correct
6 Correct 276 ms 56984 KB Output is correct
7 Correct 262 ms 57000 KB Output is correct
8 Correct 267 ms 56924 KB Output is correct
9 Correct 291 ms 56968 KB Output is correct
10 Correct 10 ms 2516 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 262 ms 56956 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 10 ms 2516 KB Output is correct
27 Correct 7 ms 2580 KB Output is correct
28 Correct 8 ms 2644 KB Output is correct
29 Correct 15 ms 2516 KB Output is correct
30 Correct 14 ms 2516 KB Output is correct
31 Correct 159 ms 8224 KB Output is correct
32 Correct 10 ms 2516 KB Output is correct
33 Correct 10 ms 2516 KB Output is correct
34 Correct 10 ms 2516 KB Output is correct
35 Correct 138 ms 8108 KB Output is correct
36 Correct 4 ms 2560 KB Output is correct
37 Correct 10 ms 2460 KB Output is correct
38 Correct 8 ms 2388 KB Output is correct
39 Correct 7 ms 2388 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 292 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 263 ms 56920 KB Output is correct
31 Correct 276 ms 56984 KB Output is correct
32 Correct 262 ms 57000 KB Output is correct
33 Correct 267 ms 56924 KB Output is correct
34 Correct 291 ms 56968 KB Output is correct
35 Correct 10 ms 2516 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 262 ms 56956 KB Output is correct
39 Correct 10 ms 2516 KB Output is correct
40 Correct 7 ms 2580 KB Output is correct
41 Correct 8 ms 2644 KB Output is correct
42 Correct 15 ms 2516 KB Output is correct
43 Correct 14 ms 2516 KB Output is correct
44 Correct 159 ms 8224 KB Output is correct
45 Correct 10 ms 2516 KB Output is correct
46 Correct 10 ms 2516 KB Output is correct
47 Correct 10 ms 2516 KB Output is correct
48 Correct 138 ms 8108 KB Output is correct
49 Correct 4 ms 2560 KB Output is correct
50 Correct 10 ms 2460 KB Output is correct
51 Correct 8 ms 2388 KB Output is correct
52 Correct 7 ms 2388 KB Output is correct
53 Correct 208 ms 54408 KB Output is correct
54 Correct 159 ms 56204 KB Output is correct
55 Correct 251 ms 57348 KB Output is correct
56 Correct 265 ms 57272 KB Output is correct
57 Correct 263 ms 57036 KB Output is correct
58 Correct 270 ms 56984 KB Output is correct
59 Correct 265 ms 57020 KB Output is correct
60 Correct 263 ms 56964 KB Output is correct
61 Correct 109 ms 55016 KB Output is correct
62 Correct 231 ms 55600 KB Output is correct
63 Correct 215 ms 54092 KB Output is correct
64 Correct 165 ms 52584 KB Output is correct