oj.uz

Submission #880403

# Submission time Handle Problem Language Result Execution time Memory
880403 2023-11-29T10:43:12 Z MilosMilutinovic Misspelling (JOI22_misspelling) C++14
100 / 100
 1246 ms 226372 KB 
#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 cksub(int a, int b) {
  return a >= b ? a - b : a - b + md;
}

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);
  multiset<int> sa, sb;
  vector<vector<vector<int>>> qs(n, vector<vector<int>>(2));
  for (int i = 0; i < m; i++) {
    if (a[i] == b[i]) {
      continue;
    }
    if (a[i] < b[i]) {
      sa.insert(a[i]);
      qs[b[i]][0].push_back(a[i]);
    }
    if (a[i] > b[i]) {
      sb.insert(b[i]);
      qs[a[i]][1].push_back(b[i]);
    }
  }
  vector<vector<int>> pref(n, vector<int>(A));
  for (int i = 0; i < A; i++) {
    pref[0][i] = dp[0][i];
  }
  auto GetSum = [&](int L, int R, int c) {
    L = max(0, L);
    R = min(R, n - 1);
    if (L > R) {
      return 0;
    }
    return cksub(pref[R][c], (L == 0 ? 0 : pref[L - 1][c]));
  };
  for (int i = 1; i < n; i++) {
    int mx_a = -1;
    int mx_b = -1;
    if (!sa.empty()) {
      auto it = sa.lower_bound(i);
      if (it != sa.begin()) {
        mx_a = *prev(it);
      }
    }
    if (!sb.empty()) {
      auto it = sb.lower_bound(i);
      if (it != sb.begin()) {
        mx_b = *prev(it);
      }
    }
    {
      int total = 0;
      for (int c = 0; c < A; c++) {
        total = ckadd(total, GetSum(max(mx_a, mx_b) + 1, i - 1, c));
      }
      for (int c = 0; c < A; c++) {
        dp[i][c] = ckadd(dp[i][c], cksub(total, GetSum(max(mx_a, mx_b) + 1, i - 1, c)));
      }
    }
    if (mx_a <= mx_b) {
      int total = 0;
      for (int j = 0; j < A; j++) {
        total = ckadd(total, GetSum(mx_a + 1, mx_b, j));
      }
      for (int j = A - 1; j >= 0; j--) {
        total = cksub(total, GetSum(mx_a + 1, mx_b, j));
        dp[i][j] = ckadd(dp[i][j], total);
      }
    } else {
      int total = 0;
      for (int j = 0; j < A; j++) {
        total = ckadd(total, GetSum(mx_b + 1, mx_a, j));
      }
      for (int j = 0; j < A; j++) {
        total = cksub(total, GetSum(mx_b + 1, mx_a, j));
        dp[i][j] = ckadd(dp[i][j], total);
      }
    }
    for (int j = 0; j < A; j++) {
      pref[i][j] = ckadd(pref[i - 1][j], dp[i][j]);
    }
    for (int v : qs[i][0]) {
      sa.erase(sa.find(v));
    }
    for (int v : qs[i][1]) {
      sb.erase(sb.find(v));
    }
  }
  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;
}

Subtask #1
8.0 / 8.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 1 ms 348 KB Output is correct
4 Correct 0 ms 504 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.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 1 ms 348 KB Output is correct
4 Correct 0 ms 504 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 4 ms 1112 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct

Subtask #3
29.0 / 29.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 470 ms 219404 KB Output is correct
6 Correct 493 ms 219728 KB Output is correct
7 Correct 459 ms 219632 KB Output is correct
8 Correct 522 ms 219480 KB Output is correct
9 Correct 468 ms 219416 KB Output is correct
10 Correct 20 ms 9048 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1140 ms 219628 KB Output is correct

Subtask #4
32.0 / 32.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 1 ms 348 KB Output is correct
4 Correct 0 ms 504 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 4 ms 1112 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 20 ms 9052 KB Output is correct
27 Correct 17 ms 8028 KB Output is correct
28 Correct 17 ms 8328 KB Output is correct
29 Correct 20 ms 9052 KB Output is correct
30 Correct 21 ms 9052 KB Output is correct
31 Correct 564 ms 44048 KB Output is correct
32 Correct 17 ms 9308 KB Output is correct
33 Correct 17 ms 9308 KB Output is correct
34 Correct 22 ms 9268 KB Output is correct
35 Correct 742 ms 44276 KB Output is correct
36 Correct 9 ms 7512 KB Output is correct
37 Correct 19 ms 8796 KB Output is correct
38 Correct 17 ms 8284 KB Output is correct
39 Correct 13 ms 7772 KB Output is correct

Subtask #5
11.0 / 11.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 1 ms 348 KB Output is correct
4 Correct 0 ms 504 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 4 ms 1112 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 470 ms 219404 KB Output is correct
31 Correct 493 ms 219728 KB Output is correct
32 Correct 459 ms 219632 KB Output is correct
33 Correct 522 ms 219480 KB Output is correct
34 Correct 468 ms 219416 KB Output is correct
35 Correct 20 ms 9048 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1140 ms 219628 KB Output is correct
39 Correct 20 ms 9052 KB Output is correct
40 Correct 17 ms 8028 KB Output is correct
41 Correct 17 ms 8328 KB Output is correct
42 Correct 20 ms 9052 KB Output is correct
43 Correct 21 ms 9052 KB Output is correct
44 Correct 564 ms 44048 KB Output is correct
45 Correct 17 ms 9308 KB Output is correct
46 Correct 17 ms 9308 KB Output is correct
47 Correct 22 ms 9268 KB Output is correct
48 Correct 742 ms 44276 KB Output is correct
49 Correct 9 ms 7512 KB Output is correct
50 Correct 19 ms 8796 KB Output is correct
51 Correct 17 ms 8284 KB Output is correct
52 Correct 13 ms 7772 KB Output is correct
53 Correct 506 ms 198996 KB Output is correct
54 Correct 524 ms 198896 KB Output is correct
55 Correct 869 ms 221996 KB Output is correct
56 Correct 862 ms 222076 KB Output is correct
57 Correct 476 ms 226056 KB Output is correct
58 Correct 465 ms 226372 KB Output is correct
59 Correct 455 ms 226132 KB Output is correct
60 Correct 1246 ms 222292 KB Output is correct
61 Correct 223 ms 176468 KB Output is correct
62 Correct 924 ms 211620 KB Output is correct
63 Correct 667 ms 200276 KB Output is correct
64 Correct 416 ms 188756 KB Output is correct