#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;
vector <int> type1[MAXN];
vector <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--) {
for (auto k : type2[i - 1]) {
flag &= (pos > k);
}
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--) {
for (auto k : type1[i - 1]) {
flag &= (pos > k);
}
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 - 1].push_back(r);
} else {
type2[l - 1].push_back(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';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
76636 KB |
Output is correct |
2 |
Correct |
12 ms |
76632 KB |
Output is correct |
3 |
Correct |
12 ms |
76636 KB |
Output is correct |
4 |
Correct |
11 ms |
76636 KB |
Output is correct |
5 |
Correct |
12 ms |
76528 KB |
Output is correct |
6 |
Correct |
12 ms |
76636 KB |
Output is correct |
7 |
Correct |
14 ms |
76692 KB |
Output is correct |
8 |
Correct |
14 ms |
76636 KB |
Output is correct |
9 |
Correct |
13 ms |
76636 KB |
Output is correct |
10 |
Correct |
12 ms |
76636 KB |
Output is correct |
11 |
Correct |
12 ms |
76532 KB |
Output is correct |
12 |
Correct |
12 ms |
76636 KB |
Output is correct |
13 |
Correct |
12 ms |
76632 KB |
Output is correct |
14 |
Correct |
13 ms |
76636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
76636 KB |
Output is correct |
2 |
Correct |
12 ms |
76632 KB |
Output is correct |
3 |
Correct |
12 ms |
76636 KB |
Output is correct |
4 |
Correct |
11 ms |
76636 KB |
Output is correct |
5 |
Correct |
12 ms |
76528 KB |
Output is correct |
6 |
Correct |
12 ms |
76636 KB |
Output is correct |
7 |
Correct |
14 ms |
76692 KB |
Output is correct |
8 |
Correct |
14 ms |
76636 KB |
Output is correct |
9 |
Correct |
13 ms |
76636 KB |
Output is correct |
10 |
Correct |
12 ms |
76636 KB |
Output is correct |
11 |
Correct |
12 ms |
76532 KB |
Output is correct |
12 |
Correct |
12 ms |
76636 KB |
Output is correct |
13 |
Correct |
12 ms |
76632 KB |
Output is correct |
14 |
Correct |
13 ms |
76636 KB |
Output is correct |
15 |
Correct |
45 ms |
76880 KB |
Output is correct |
16 |
Correct |
32 ms |
76636 KB |
Output is correct |
17 |
Correct |
34 ms |
76636 KB |
Output is correct |
18 |
Correct |
36 ms |
76632 KB |
Output is correct |
19 |
Correct |
29 ms |
76636 KB |
Output is correct |
20 |
Correct |
29 ms |
76636 KB |
Output is correct |
21 |
Correct |
35 ms |
76636 KB |
Output is correct |
22 |
Correct |
351 ms |
76884 KB |
Output is correct |
23 |
Correct |
54 ms |
76736 KB |
Output is correct |
24 |
Correct |
35 ms |
76636 KB |
Output is correct |
25 |
Correct |
30 ms |
76636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
76524 KB |
Output is correct |
2 |
Correct |
12 ms |
76760 KB |
Output is correct |
3 |
Correct |
12 ms |
76636 KB |
Output is correct |
4 |
Correct |
13 ms |
76632 KB |
Output is correct |
5 |
Execution timed out |
4051 ms |
98776 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
76636 KB |
Output is correct |
2 |
Correct |
12 ms |
76632 KB |
Output is correct |
3 |
Correct |
12 ms |
76636 KB |
Output is correct |
4 |
Correct |
11 ms |
76636 KB |
Output is correct |
5 |
Correct |
12 ms |
76528 KB |
Output is correct |
6 |
Correct |
12 ms |
76636 KB |
Output is correct |
7 |
Correct |
14 ms |
76692 KB |
Output is correct |
8 |
Correct |
14 ms |
76636 KB |
Output is correct |
9 |
Correct |
13 ms |
76636 KB |
Output is correct |
10 |
Correct |
12 ms |
76636 KB |
Output is correct |
11 |
Correct |
12 ms |
76532 KB |
Output is correct |
12 |
Correct |
12 ms |
76636 KB |
Output is correct |
13 |
Correct |
12 ms |
76632 KB |
Output is correct |
14 |
Correct |
13 ms |
76636 KB |
Output is correct |
15 |
Correct |
45 ms |
76880 KB |
Output is correct |
16 |
Correct |
32 ms |
76636 KB |
Output is correct |
17 |
Correct |
34 ms |
76636 KB |
Output is correct |
18 |
Correct |
36 ms |
76632 KB |
Output is correct |
19 |
Correct |
29 ms |
76636 KB |
Output is correct |
20 |
Correct |
29 ms |
76636 KB |
Output is correct |
21 |
Correct |
35 ms |
76636 KB |
Output is correct |
22 |
Correct |
351 ms |
76884 KB |
Output is correct |
23 |
Correct |
54 ms |
76736 KB |
Output is correct |
24 |
Correct |
35 ms |
76636 KB |
Output is correct |
25 |
Correct |
30 ms |
76636 KB |
Output is correct |
26 |
Execution timed out |
4025 ms |
77500 KB |
Time limit exceeded |
27 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
76636 KB |
Output is correct |
2 |
Correct |
12 ms |
76632 KB |
Output is correct |
3 |
Correct |
12 ms |
76636 KB |
Output is correct |
4 |
Correct |
11 ms |
76636 KB |
Output is correct |
5 |
Correct |
12 ms |
76528 KB |
Output is correct |
6 |
Correct |
12 ms |
76636 KB |
Output is correct |
7 |
Correct |
14 ms |
76692 KB |
Output is correct |
8 |
Correct |
14 ms |
76636 KB |
Output is correct |
9 |
Correct |
13 ms |
76636 KB |
Output is correct |
10 |
Correct |
12 ms |
76636 KB |
Output is correct |
11 |
Correct |
12 ms |
76532 KB |
Output is correct |
12 |
Correct |
12 ms |
76636 KB |
Output is correct |
13 |
Correct |
12 ms |
76632 KB |
Output is correct |
14 |
Correct |
13 ms |
76636 KB |
Output is correct |
15 |
Correct |
45 ms |
76880 KB |
Output is correct |
16 |
Correct |
32 ms |
76636 KB |
Output is correct |
17 |
Correct |
34 ms |
76636 KB |
Output is correct |
18 |
Correct |
36 ms |
76632 KB |
Output is correct |
19 |
Correct |
29 ms |
76636 KB |
Output is correct |
20 |
Correct |
29 ms |
76636 KB |
Output is correct |
21 |
Correct |
35 ms |
76636 KB |
Output is correct |
22 |
Correct |
351 ms |
76884 KB |
Output is correct |
23 |
Correct |
54 ms |
76736 KB |
Output is correct |
24 |
Correct |
35 ms |
76636 KB |
Output is correct |
25 |
Correct |
30 ms |
76636 KB |
Output is correct |
26 |
Correct |
12 ms |
76524 KB |
Output is correct |
27 |
Correct |
12 ms |
76760 KB |
Output is correct |
28 |
Correct |
12 ms |
76636 KB |
Output is correct |
29 |
Correct |
13 ms |
76632 KB |
Output is correct |
30 |
Execution timed out |
4051 ms |
98776 KB |
Time limit exceeded |
31 |
Halted |
0 ms |
0 KB |
- |