oj.uz

답안 #547793

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547793 2022-04-11T18:40:31 Z nonsensenonsense1 Misspelling (JOI22_misspelling) C++17
100 / 100
 680 ms 57808 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;
		}
		for (int x = 0; x < A; ++x) {
			d[i][x] = 1;
			for (int y = x + 1; y < A; ++y) d[i][x] = add(d[i][x], sum[0][y]);
			for (int y = 0; y < x; ++y) d[i][x] = add(d[i][x], sum[1][y]);
		}
	}
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 0 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 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 0 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 1 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 1 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 655 ms 57404 KB Output is correct
6 Correct 672 ms 57696 KB Output is correct
7 Correct 680 ms 57484 KB Output is correct
8 Correct 669 ms 57508 KB Output is correct
9 Correct 665 ms 57532 KB Output is correct
10 Correct 26 ms 2508 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 658 ms 57476 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 0 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 1 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 1 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 28 ms 2468 KB Output is correct
27 Correct 21 ms 2636 KB Output is correct
28 Correct 22 ms 2624 KB Output is correct
29 Correct 26 ms 2556 KB Output is correct
30 Correct 27 ms 2548 KB Output is correct
31 Correct 168 ms 8508 KB Output is correct
32 Correct 27 ms 2492 KB Output is correct
33 Correct 29 ms 2664 KB Output is correct
34 Correct 27 ms 2468 KB Output is correct
35 Correct 158 ms 8344 KB Output is correct
36 Correct 20 ms 2600 KB Output is correct
37 Correct 27 ms 2484 KB Output is correct
38 Correct 29 ms 2340 KB Output is correct
39 Correct 24 ms 2416 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 0 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 1 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 1 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 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 0 ms 300 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 296 KB Output is correct
30 Correct 655 ms 57404 KB Output is correct
31 Correct 672 ms 57696 KB Output is correct
32 Correct 680 ms 57484 KB Output is correct
33 Correct 669 ms 57508 KB Output is correct
34 Correct 665 ms 57532 KB Output is correct
35 Correct 26 ms 2508 KB Output is correct
36 Correct 1 ms 292 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 658 ms 57476 KB Output is correct
39 Correct 28 ms 2468 KB Output is correct
40 Correct 21 ms 2636 KB Output is correct
41 Correct 22 ms 2624 KB Output is correct
42 Correct 26 ms 2556 KB Output is correct
43 Correct 27 ms 2548 KB Output is correct
44 Correct 168 ms 8508 KB Output is correct
45 Correct 27 ms 2492 KB Output is correct
46 Correct 29 ms 2664 KB Output is correct
47 Correct 27 ms 2468 KB Output is correct
48 Correct 158 ms 8344 KB Output is correct
49 Correct 20 ms 2600 KB Output is correct
50 Correct 27 ms 2484 KB Output is correct
51 Correct 29 ms 2340 KB Output is correct
52 Correct 24 ms 2416 KB Output is correct
53 Correct 615 ms 54732 KB Output is correct
54 Correct 537 ms 56356 KB Output is correct
55 Correct 655 ms 57380 KB Output is correct
56 Correct 678 ms 57808 KB Output is correct
57 Correct 655 ms 57480 KB Output is correct
58 Correct 657 ms 57460 KB Output is correct
59 Correct 628 ms 57048 KB Output is correct
60 Correct 646 ms 57132 KB Output is correct
61 Correct 475 ms 55072 KB Output is correct
62 Correct 659 ms 56040 KB Output is correct
63 Correct 598 ms 54280 KB Output is correct
64 Correct 580 ms 52784 KB Output is correct