oj.uz

Submission #936563

# Submission time Handle Problem Language Result Execution time Memory
936563 2024-03-02T07:49:15 Z TAhmed33 Misspelling (JOI22_misspelling) C++
28 / 100
 4000 ms 57144 KB 
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int add (int a, int b) {
	a += b; if (a >= MOD) a -= MOD;
	return a;
}
int sub (int a, int b) {
	a -= b; if (a < 0) a += MOD;
	return a;
}
int mul (int a, int b) {
	return (a * 1ll * b) % MOD;
}
const int MAXN = 5e5 + 25;
int dp[MAXN][27];
int n, m;
int type1[MAXN];
int type2[MAXN];
int ans (int pos, int c) {
	int &ret = dp[pos][c];
	if (ret != -1) return ret;
	if (pos == 1) return ret = 1;
	ret = 0;
	for (int j = 0; j < c; j++) {
		bool flag = 1;
		for (int i = pos - 1; i >= 1; i--) {
			flag &= pos > type2[i];
			if (flag) ret = add(ret, ans(i, j));
		}
	}
	for (int j = c + 1; j < 26; j++) {
		bool flag = 1;
		for (int i = pos - 1; i >= 1; i--) {
			flag &= pos > type1[i];
			if (flag) ret = add(ret, ans(i, j));
		}
	}
	return ret;
}
int main () {
	memset(dp, -1, sizeof(dp));
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int a, b;
		cin >> a >> b;
		int l = min(a, b), r = max(a, b);
		if (a > b) {
			type1[l] = max(type1[l], r);
		} else {
			type2[l] = max(type2[l], r);
		}
	}
	int sum = 0;
	for (int i = 0; i < 26; i++) {
		for (int j = 1; j <= n; j++) {
			sum = add(sum, ans(j, i));
		}
	}
	cout << sum << '\n';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 54876 KB Output is correct
2 Correct 8 ms 54876 KB Output is correct
3 Correct 9 ms 54788 KB Output is correct
4 Correct 9 ms 54772 KB Output is correct
5 Correct 8 ms 54876 KB Output is correct
6 Correct 9 ms 54808 KB Output is correct
7 Correct 8 ms 54872 KB Output is correct
8 Correct 9 ms 54876 KB Output is correct
9 Correct 8 ms 54876 KB Output is correct
10 Correct 10 ms 54876 KB Output is correct
11 Correct 8 ms 54740 KB Output is correct
12 Correct 8 ms 54872 KB Output is correct
13 Correct 8 ms 54876 KB Output is correct
14 Correct 9 ms 54876 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 54876 KB Output is correct
2 Correct 8 ms 54876 KB Output is correct
3 Correct 9 ms 54788 KB Output is correct
4 Correct 9 ms 54772 KB Output is correct
5 Correct 8 ms 54876 KB Output is correct
6 Correct 9 ms 54808 KB Output is correct
7 Correct 8 ms 54872 KB Output is correct
8 Correct 9 ms 54876 KB Output is correct
9 Correct 8 ms 54876 KB Output is correct
10 Correct 10 ms 54876 KB Output is correct
11 Correct 8 ms 54740 KB Output is correct
12 Correct 8 ms 54872 KB Output is correct
13 Correct 8 ms 54876 KB Output is correct
14 Correct 9 ms 54876 KB Output is correct
15 Correct 36 ms 54876 KB Output is correct
16 Correct 26 ms 54964 KB Output is correct
17 Correct 23 ms 54964 KB Output is correct
18 Correct 18 ms 54876 KB Output is correct
19 Correct 22 ms 54876 KB Output is correct
20 Correct 20 ms 54872 KB Output is correct
21 Correct 21 ms 54876 KB Output is correct
22 Correct 22 ms 54936 KB Output is correct
23 Correct 51 ms 54876 KB Output is correct
24 Correct 26 ms 54876 KB Output is correct
25 Correct 18 ms 54876 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 54876 KB Output is correct
2 Correct 8 ms 54760 KB Output is correct
3 Correct 8 ms 54876 KB Output is correct
4 Correct 8 ms 54872 KB Output is correct
5 Execution timed out 4066 ms 57144 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 54876 KB Output is correct
2 Correct 8 ms 54876 KB Output is correct
3 Correct 9 ms 54788 KB Output is correct
4 Correct 9 ms 54772 KB Output is correct
5 Correct 8 ms 54876 KB Output is correct
6 Correct 9 ms 54808 KB Output is correct
7 Correct 8 ms 54872 KB Output is correct
8 Correct 9 ms 54876 KB Output is correct
9 Correct 8 ms 54876 KB Output is correct
10 Correct 10 ms 54876 KB Output is correct
11 Correct 8 ms 54740 KB Output is correct
12 Correct 8 ms 54872 KB Output is correct
13 Correct 8 ms 54876 KB Output is correct
14 Correct 9 ms 54876 KB Output is correct
15 Correct 36 ms 54876 KB Output is correct
16 Correct 26 ms 54964 KB Output is correct
17 Correct 23 ms 54964 KB Output is correct
18 Correct 18 ms 54876 KB Output is correct
19 Correct 22 ms 54876 KB Output is correct
20 Correct 20 ms 54872 KB Output is correct
21 Correct 21 ms 54876 KB Output is correct
22 Correct 22 ms 54936 KB Output is correct
23 Correct 51 ms 54876 KB Output is correct
24 Correct 26 ms 54876 KB Output is correct
25 Correct 18 ms 54876 KB Output is correct
26 Execution timed out 4048 ms 54876 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 54876 KB Output is correct
2 Correct 8 ms 54876 KB Output is correct
3 Correct 9 ms 54788 KB Output is correct
4 Correct 9 ms 54772 KB Output is correct
5 Correct 8 ms 54876 KB Output is correct
6 Correct 9 ms 54808 KB Output is correct
7 Correct 8 ms 54872 KB Output is correct
8 Correct 9 ms 54876 KB Output is correct
9 Correct 8 ms 54876 KB Output is correct
10 Correct 10 ms 54876 KB Output is correct
11 Correct 8 ms 54740 KB Output is correct
12 Correct 8 ms 54872 KB Output is correct
13 Correct 8 ms 54876 KB Output is correct
14 Correct 9 ms 54876 KB Output is correct
15 Correct 36 ms 54876 KB Output is correct
16 Correct 26 ms 54964 KB Output is correct
17 Correct 23 ms 54964 KB Output is correct
18 Correct 18 ms 54876 KB Output is correct
19 Correct 22 ms 54876 KB Output is correct
20 Correct 20 ms 54872 KB Output is correct
21 Correct 21 ms 54876 KB Output is correct
22 Correct 22 ms 54936 KB Output is correct
23 Correct 51 ms 54876 KB Output is correct
24 Correct 26 ms 54876 KB Output is correct
25 Correct 18 ms 54876 KB Output is correct
26 Correct 9 ms 54876 KB Output is correct
27 Correct 8 ms 54760 KB Output is correct
28 Correct 8 ms 54876 KB Output is correct
29 Correct 8 ms 54872 KB Output is correct
30 Execution timed out 4066 ms 57144 KB Time limit exceeded
31 Halted 0 ms 0 KB -