#include <bits/stdc++.h>
using namespace std;
const int md = 1e9 + 7;
int ckadd(int a, int b) {
return a + b >= md ? a + b - md : a + b;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(m), b(m);
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
--a[i]; --b[i];
}
const int A = 26;
vector<vector<int>> dp(n, vector<int>(A));
dp[0] = vector<int>(A, 1);
for (int i = 1; i < n; i++) {
int mx_a = -1;
for (int j = 0; j < m; j++) {
if (a[j] == b[j]) {
continue;
}
if (a[j] <= b[j] && b[j] >= i && a[j] < i) {
mx_a = max(mx_a, a[j]);
}
}
int mx_b = -1;
for (int j = 0; j < m; j++) {
if (a[j] == b[j]) {
continue;
}
if (a[j] >= b[j] && a[j] >= i && b[j] < i) {
mx_b = max(mx_b, b[j]);
}
}
for (int c = 0; c < A; c++) {
for (int j = 0; j < i; j++) {
for (int cc = 0; cc < A; cc++) {
if (c == cc) {
continue;
}
bool ok = true;
if (cc < c && j <= mx_a) {
ok = false;
}
if (cc > c && j <= mx_b) {
ok = false;
}
if (ok) {
dp[i][c] = ckadd(dp[i][c], dp[j][cc]);
}
}
}
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < A; j++) {
ans = ckadd(ans, dp[i][j]);
}
}
cout << ans << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
456 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
600 KB |
Output is correct |
13 |
Correct |
0 ms |
452 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
456 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
600 KB |
Output is correct |
13 |
Correct |
0 ms |
452 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
27 ms |
488 KB |
Output is correct |
16 |
Correct |
23 ms |
348 KB |
Output is correct |
17 |
Correct |
22 ms |
348 KB |
Output is correct |
18 |
Correct |
22 ms |
348 KB |
Output is correct |
19 |
Correct |
23 ms |
348 KB |
Output is correct |
20 |
Correct |
22 ms |
348 KB |
Output is correct |
21 |
Correct |
22 ms |
348 KB |
Output is correct |
22 |
Correct |
42 ms |
604 KB |
Output is correct |
23 |
Correct |
43 ms |
348 KB |
Output is correct |
24 |
Correct |
23 ms |
344 KB |
Output is correct |
25 |
Correct |
22 ms |
596 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
600 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Execution timed out |
4077 ms |
77300 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
456 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
600 KB |
Output is correct |
13 |
Correct |
0 ms |
452 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
27 ms |
488 KB |
Output is correct |
16 |
Correct |
23 ms |
348 KB |
Output is correct |
17 |
Correct |
22 ms |
348 KB |
Output is correct |
18 |
Correct |
22 ms |
348 KB |
Output is correct |
19 |
Correct |
23 ms |
348 KB |
Output is correct |
20 |
Correct |
22 ms |
348 KB |
Output is correct |
21 |
Correct |
22 ms |
348 KB |
Output is correct |
22 |
Correct |
42 ms |
604 KB |
Output is correct |
23 |
Correct |
43 ms |
348 KB |
Output is correct |
24 |
Correct |
23 ms |
344 KB |
Output is correct |
25 |
Correct |
22 ms |
596 KB |
Output is correct |
26 |
Execution timed out |
4078 ms |
3416 KB |
Time limit exceeded |
27 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
456 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
600 KB |
Output is correct |
13 |
Correct |
0 ms |
452 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
27 ms |
488 KB |
Output is correct |
16 |
Correct |
23 ms |
348 KB |
Output is correct |
17 |
Correct |
22 ms |
348 KB |
Output is correct |
18 |
Correct |
22 ms |
348 KB |
Output is correct |
19 |
Correct |
23 ms |
348 KB |
Output is correct |
20 |
Correct |
22 ms |
348 KB |
Output is correct |
21 |
Correct |
22 ms |
348 KB |
Output is correct |
22 |
Correct |
42 ms |
604 KB |
Output is correct |
23 |
Correct |
43 ms |
348 KB |
Output is correct |
24 |
Correct |
23 ms |
344 KB |
Output is correct |
25 |
Correct |
22 ms |
596 KB |
Output is correct |
26 |
Correct |
0 ms |
600 KB |
Output is correct |
27 |
Correct |
1 ms |
344 KB |
Output is correct |
28 |
Correct |
0 ms |
344 KB |
Output is correct |
29 |
Correct |
0 ms |
348 KB |
Output is correct |
30 |
Execution timed out |
4077 ms |
77300 KB |
Time limit exceeded |
31 |
Halted |
0 ms |
0 KB |
- |