oj.uz

Submission #576713

# Submission time Handle Problem Language Result Execution time Memory
576713 2022-06-13T10:24:17 Z Soumya1 Misspelling (JOI22_misspelling) C++17
100 / 100
 688 ms 147828 KB 
#include <bits/stdc++.h>
#ifdef __LOCAL__
  #include <debug_local.h>
#endif
using namespace std;
const int mod = 1e9 + 7;
const int mxN = 5e5 + 5;
const int alpha = 26;
int dp[mxN][alpha];
vector<int> s[mxN], g[mxN];
int sl[mxN], gl[mxN];
void testCase() {
  int n, m;
  cin >> n >> m;
  while (m--) {
    int a, b;
    cin >> a >> b;
    if (a < b) {
      s[a].push_back(b);
    } else {
      g[b].push_back(a);
    }
  }
  set<int> gst, lst;
  for (int i = 1; i <= n; i++) gst.insert(i);
  lst = gst;
  for (int i = n; i >= 1; i--) {
    sort(s[i].begin(), s[i].end());
    sort(g[i].begin(), g[i].end());
    if (!s[i].empty()) {
      int x = s[i].back();
      auto it = gst.upper_bound(x);
      while (it != gst.begin() && *(--it) > i) {
        gl[*it] = i;
        gst.erase(it);
        it = gst.upper_bound(x);
      }
    }
    if (!g[i].empty()) {
      int x = g[i].back();
      auto it = lst.upper_bound(x);
      while (it != lst.begin() && *(--it) > i) {
        sl[*it] = i;
        lst.erase(it);
        it = lst.upper_bound(x);
      }
    }
  }
  for (int j = 0; j < 26; j++) dp[1][j] = 1;
  for (int i = 2; i <= n; i++) {
    int ss[26], gg[26];
    memset(ss, 0, sizeof ss);
    memset(gg, 0, sizeof gg);
    for (int j = 0; j < 26; j++) {
      if (j > 0) ss[j - 1] = dp[i - 1][j] - dp[sl[i]][j];
      if (j < 25) gg[j + 1] = dp[i - 1][j] - dp[gl[i]][j];
    }
    for (int j = 0; j < 26; j++) {
      ss[j] %= mod;
      gg[j] %= mod;
    }
    for (int j = 1; j < 26; j++) {
      gg[j] += gg[j - 1];
      gg[j] %= mod;
    }
    for (int j = 24; j >= 0; j--) {
      ss[j] += ss[j + 1];
      ss[j] %= mod;
    }
    for (int j = 0; j < 26; j++) {
      dp[i][j] = (ss[j] + gg[j]) % mod;
      dp[i][j] += dp[i - 1][j];
      dp[i][j] %= mod;
    }
  }
  int ans = 0;
  for (int j = 0; j < 26; j++) {
    ans += dp[n][j];
    ans %= mod;
  }
  if (ans < 0) ans += mod;
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23784 KB Output is correct
3 Correct 12 ms 23752 KB Output is correct
4 Correct 11 ms 23784 KB Output is correct
5 Correct 11 ms 23824 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 12 ms 23828 KB Output is correct
8 Correct 13 ms 23728 KB Output is correct
9 Correct 12 ms 23828 KB Output is correct
10 Correct 11 ms 23764 KB Output is correct
11 Correct 11 ms 23828 KB Output is correct
12 Correct 12 ms 23728 KB Output is correct
13 Correct 13 ms 23732 KB Output is correct
14 Correct 12 ms 23824 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23784 KB Output is correct
3 Correct 12 ms 23752 KB Output is correct
4 Correct 11 ms 23784 KB Output is correct
5 Correct 11 ms 23824 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 12 ms 23828 KB Output is correct
8 Correct 13 ms 23728 KB Output is correct
9 Correct 12 ms 23828 KB Output is correct
10 Correct 11 ms 23764 KB Output is correct
11 Correct 11 ms 23828 KB Output is correct
12 Correct 12 ms 23728 KB Output is correct
13 Correct 13 ms 23732 KB Output is correct
14 Correct 12 ms 23824 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23764 KB Output is correct
17 Correct 13 ms 23876 KB Output is correct
18 Correct 12 ms 23764 KB Output is correct
19 Correct 13 ms 23792 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 12 ms 23832 KB Output is correct
22 Correct 15 ms 23960 KB Output is correct
23 Correct 13 ms 23804 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 12 ms 23828 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23860 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 564 ms 141292 KB Output is correct
6 Correct 603 ms 147736 KB Output is correct
7 Correct 582 ms 147716 KB Output is correct
8 Correct 595 ms 147660 KB Output is correct
9 Correct 570 ms 147696 KB Output is correct
10 Correct 32 ms 28684 KB Output is correct
11 Correct 12 ms 23876 KB Output is correct
12 Correct 13 ms 23744 KB Output is correct
13 Correct 688 ms 147812 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23784 KB Output is correct
3 Correct 12 ms 23752 KB Output is correct
4 Correct 11 ms 23784 KB Output is correct
5 Correct 11 ms 23824 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 12 ms 23828 KB Output is correct
8 Correct 13 ms 23728 KB Output is correct
9 Correct 12 ms 23828 KB Output is correct
10 Correct 11 ms 23764 KB Output is correct
11 Correct 11 ms 23828 KB Output is correct
12 Correct 12 ms 23728 KB Output is correct
13 Correct 13 ms 23732 KB Output is correct
14 Correct 12 ms 23824 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23764 KB Output is correct
17 Correct 13 ms 23876 KB Output is correct
18 Correct 12 ms 23764 KB Output is correct
19 Correct 13 ms 23792 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 12 ms 23832 KB Output is correct
22 Correct 15 ms 23960 KB Output is correct
23 Correct 13 ms 23804 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 12 ms 23828 KB Output is correct
26 Correct 35 ms 28688 KB Output is correct
27 Correct 32 ms 28140 KB Output is correct
28 Correct 30 ms 28180 KB Output is correct
29 Correct 37 ms 28632 KB Output is correct
30 Correct 34 ms 28588 KB Output is correct
31 Correct 151 ms 36360 KB Output is correct
32 Correct 35 ms 28612 KB Output is correct
33 Correct 34 ms 28676 KB Output is correct
34 Correct 34 ms 28540 KB Output is correct
35 Correct 138 ms 36584 KB Output is correct
36 Correct 28 ms 27636 KB Output is correct
37 Correct 33 ms 28336 KB Output is correct
38 Correct 31 ms 28232 KB Output is correct
39 Correct 30 ms 28052 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23784 KB Output is correct
3 Correct 12 ms 23752 KB Output is correct
4 Correct 11 ms 23784 KB Output is correct
5 Correct 11 ms 23824 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 12 ms 23828 KB Output is correct
8 Correct 13 ms 23728 KB Output is correct
9 Correct 12 ms 23828 KB Output is correct
10 Correct 11 ms 23764 KB Output is correct
11 Correct 11 ms 23828 KB Output is correct
12 Correct 12 ms 23728 KB Output is correct
13 Correct 13 ms 23732 KB Output is correct
14 Correct 12 ms 23824 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23764 KB Output is correct
17 Correct 13 ms 23876 KB Output is correct
18 Correct 12 ms 23764 KB Output is correct
19 Correct 13 ms 23792 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 12 ms 23832 KB Output is correct
22 Correct 15 ms 23960 KB Output is correct
23 Correct 13 ms 23804 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 12 ms 23828 KB Output is correct
26 Correct 13 ms 23764 KB Output is correct
27 Correct 13 ms 23860 KB Output is correct
28 Correct 12 ms 23764 KB Output is correct
29 Correct 12 ms 23764 KB Output is correct
30 Correct 564 ms 141292 KB Output is correct
31 Correct 603 ms 147736 KB Output is correct
32 Correct 582 ms 147716 KB Output is correct
33 Correct 595 ms 147660 KB Output is correct
34 Correct 570 ms 147696 KB Output is correct
35 Correct 32 ms 28684 KB Output is correct
36 Correct 12 ms 23876 KB Output is correct
37 Correct 13 ms 23744 KB Output is correct
38 Correct 688 ms 147812 KB Output is correct
39 Correct 35 ms 28688 KB Output is correct
40 Correct 32 ms 28140 KB Output is correct
41 Correct 30 ms 28180 KB Output is correct
42 Correct 37 ms 28632 KB Output is correct
43 Correct 34 ms 28588 KB Output is correct
44 Correct 151 ms 36360 KB Output is correct
45 Correct 35 ms 28612 KB Output is correct
46 Correct 34 ms 28676 KB Output is correct
47 Correct 34 ms 28540 KB Output is correct
48 Correct 138 ms 36584 KB Output is correct
49 Correct 28 ms 27636 KB Output is correct
50 Correct 33 ms 28336 KB Output is correct
51 Correct 31 ms 28232 KB Output is correct
52 Correct 30 ms 28052 KB Output is correct
53 Correct 532 ms 136748 KB Output is correct
54 Correct 520 ms 134824 KB Output is correct
55 Correct 631 ms 146044 KB Output is correct
56 Correct 639 ms 146004 KB Output is correct
57 Correct 602 ms 147752 KB Output is correct
58 Correct 576 ms 147828 KB Output is correct
59 Correct 567 ms 147752 KB Output is correct
60 Correct 676 ms 143572 KB Output is correct
61 Correct 417 ms 122380 KB Output is correct
62 Correct 612 ms 139740 KB Output is correct
63 Correct 558 ms 135680 KB Output is correct
64 Correct 506 ms 130792 KB Output is correct