oj.uz

답안 #880400

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880400 2023-11-29T10:37:45 Z MilosMilutinovic Misspelling (JOI22_misspelling) C++14
57 / 100
 4000 ms 219752 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) {
      for (int j = mx_a + 1; j <= mx_b; j++) {
        for (int c = 0; c < A; c++) {
          for (int cc = c + 1; cc < A; cc++) {
            dp[i][cc] = ckadd(dp[i][cc], dp[j][c]);
          }
        }
      }
    } else {
      for (int j = mx_b + 1; j <= mx_a; j++) {
        for (int c = 0; c < A; c++) {
          for (int cc = 0; cc < c; cc++) {
            dp[i][cc] = ckadd(dp[i][cc], dp[j][c]);
          }
        }
      }
    }
    /* for (int c = 0; c < A; c++) {
      for (int j = min(mx_a, mx_b) + 1; 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]);
          }
        }
      }
    } */
    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

# 결과 실행 시간 메모리 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 344 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 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 344 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 4 ms 1116 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

# 결과 실행 시간 메모리 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 958 ms 219628 KB Output is correct
6 Correct 1352 ms 219636 KB Output is correct
7 Correct 1207 ms 219476 KB Output is correct
8 Correct 938 ms 219752 KB Output is correct
9 Correct 1377 ms 219628 KB Output is correct
10 Correct 29 ms 9308 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3738 ms 219628 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 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 344 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 4 ms 1116 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 27 ms 9052 KB Output is correct
27 Execution timed out 4035 ms 8280 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 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 344 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 4 ms 1116 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 958 ms 219628 KB Output is correct
31 Correct 1352 ms 219636 KB Output is correct
32 Correct 1207 ms 219476 KB Output is correct
33 Correct 938 ms 219752 KB Output is correct
34 Correct 1377 ms 219628 KB Output is correct
35 Correct 29 ms 9308 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 3738 ms 219628 KB Output is correct
39 Correct 27 ms 9052 KB Output is correct
40 Execution timed out 4035 ms 8280 KB Time limit exceeded
41 Halted 0 ms 0 KB -