oj.uz

Submission #596927

# Submission time Handle Problem Language Result Execution time Memory
596927 2022-07-15T09:26:22 Z AlexLuchianov Misspelling (JOI22_misspelling) C++14
100 / 100
 881 ms 114708 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <set>
#include <numeric>

using ll = long long;

int const nmax = 500000;
int const modulo = 1000000007;
int const sigma = 26;
std::vector<int> g[5 + nmax];

int dp[5 + nmax][1 + sigma];
int sum[1 + sigma], type[5 + nmax];

std::set<int> myset[4];

void affectSum(int pos, int mode, int coef) {
  int acc = 0;
  for(int i = 0; i < sigma; i++) { 
    if((mode & 1) == 0)
      sum[i] = (1LL * modulo + sum[i] + coef * acc) % modulo;
    acc += dp[pos][i];
    if(modulo <= acc)
      acc -= modulo;
  }
  acc = 0;
  for(int i = sigma - 1; 0 <= i; i--) {
    if((mode & 2) == 0)
      sum[i] = (1LL * modulo + sum[i] + coef * acc) % modulo;
    acc += dp[pos][i];
    if(modulo <= acc)
      acc -= modulo;
  }
}

int main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);
  int n, m;
  std::cin >> n >> m;
  for(int i = 1;i <= m; i++) {
    int x, y;
    std::cin >> x >> y;
    if(x < y)
      g[x].push_back(y);
    else
      g[y].push_back(-x);
  }

  for(int i = 0; i < sigma; i++)
    sum[i] = dp[n][i] = 1;
  
  std::vector<int> tempSet(n);
  std::iota(tempSet.begin(), tempSet.end(), 1);
  myset[0] = std::set<int>(tempSet.begin(), tempSet.end());
  affectSum(n, 0, 1);

  for(int i = n - 1; 1 <= i; i--) {
    for(auto to : g[i]) {
      if(0 < to) {
        std::set<int>::iterator it = myset[0].lower_bound(i + 1);
        while(it != myset[0].end() && *it <= to) {
          affectSum(*it, 0, -1);
          type[*it] = 1;
          affectSum(*it, 1, 1);
          myset[1].insert(*it);
          myset[0].erase(it++);
        }
        it = myset[2].lower_bound(i + 1);
        while(it != myset[2].end() && *it <= to) {
          affectSum(*it, 2, -1);
          type[*it] = 3;
          affectSum(*it, 3, 1);
          myset[3].insert(*it);
          myset[2].erase(it++);
        }
      } else {
        to = -to;
        std::set<int>::iterator it = myset[0].lower_bound(i + 1);
        while(it != myset[0].end() && *it <= to) {
          affectSum(*it, 0, -1);
          type[*it] = 2;
          affectSum(*it, 2, 1);
          myset[2].insert(*it);
          myset[0].erase(it++);
        }
        it = myset[1].lower_bound(i + 1);
        while(it != myset[1].end() && *it <= to) {
          affectSum(*it, 1, -1);
          type[*it] = 3;
          affectSum(*it, 3, 1);
          myset[3].insert(*it);
          myset[1].erase(it++);
        }
      }
    }
    for(int j = 0; j < sigma; j++)
      dp[i][j] = sum[j];
    affectSum(i, 0, 1);
  }
  
  int result = 0;
  for(int i = 0; i < sigma;i++) {
    result += dp[1][i];
    if(modulo <= result)
      result -= modulo;
  }
  std::cout << result << '\n';
  return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12084 KB Output is correct
5 Correct 9 ms 11988 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12044 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 8 ms 12076 KB Output is correct
12 Correct 8 ms 11988 KB Output is correct
13 Correct 8 ms 12068 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12084 KB Output is correct
5 Correct 9 ms 11988 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12044 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 8 ms 12076 KB Output is correct
12 Correct 8 ms 11988 KB Output is correct
13 Correct 8 ms 12068 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 7 ms 12068 KB Output is correct
16 Correct 7 ms 12116 KB Output is correct
17 Correct 7 ms 12076 KB Output is correct
18 Correct 7 ms 12116 KB Output is correct
19 Correct 8 ms 12068 KB Output is correct
20 Correct 8 ms 12072 KB Output is correct
21 Correct 8 ms 11988 KB Output is correct
22 Correct 9 ms 12244 KB Output is correct
23 Correct 7 ms 11988 KB Output is correct
24 Correct 7 ms 12068 KB Output is correct
25 Correct 7 ms 12072 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 8 ms 12104 KB Output is correct
3 Correct 8 ms 12080 KB Output is correct
4 Correct 6 ms 12060 KB Output is correct
5 Correct 730 ms 114500 KB Output is correct
6 Correct 752 ms 114388 KB Output is correct
7 Correct 709 ms 114404 KB Output is correct
8 Correct 744 ms 114408 KB Output is correct
9 Correct 735 ms 114440 KB Output is correct
10 Correct 36 ms 16024 KB Output is correct
11 Correct 7 ms 12116 KB Output is correct
12 Correct 8 ms 12076 KB Output is correct
13 Correct 881 ms 109292 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12084 KB Output is correct
5 Correct 9 ms 11988 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12044 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 8 ms 12076 KB Output is correct
12 Correct 8 ms 11988 KB Output is correct
13 Correct 8 ms 12068 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 7 ms 12068 KB Output is correct
16 Correct 7 ms 12116 KB Output is correct
17 Correct 7 ms 12076 KB Output is correct
18 Correct 7 ms 12116 KB Output is correct
19 Correct 8 ms 12068 KB Output is correct
20 Correct 8 ms 12072 KB Output is correct
21 Correct 8 ms 11988 KB Output is correct
22 Correct 9 ms 12244 KB Output is correct
23 Correct 7 ms 11988 KB Output is correct
24 Correct 7 ms 12068 KB Output is correct
25 Correct 7 ms 12072 KB Output is correct
26 Correct 30 ms 16040 KB Output is correct
27 Correct 28 ms 15584 KB Output is correct
28 Correct 32 ms 15572 KB Output is correct
29 Correct 51 ms 15856 KB Output is correct
30 Correct 48 ms 15908 KB Output is correct
31 Correct 195 ms 23568 KB Output is correct
32 Correct 32 ms 16108 KB Output is correct
33 Correct 42 ms 16112 KB Output is correct
34 Correct 39 ms 15808 KB Output is correct
35 Correct 195 ms 23684 KB Output is correct
36 Correct 19 ms 15100 KB Output is correct
37 Correct 38 ms 15716 KB Output is correct
38 Correct 30 ms 15544 KB Output is correct
39 Correct 31 ms 15376 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12084 KB Output is correct
5 Correct 9 ms 11988 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12044 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 8 ms 12076 KB Output is correct
12 Correct 8 ms 11988 KB Output is correct
13 Correct 8 ms 12068 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 7 ms 12068 KB Output is correct
16 Correct 7 ms 12116 KB Output is correct
17 Correct 7 ms 12076 KB Output is correct
18 Correct 7 ms 12116 KB Output is correct
19 Correct 8 ms 12068 KB Output is correct
20 Correct 8 ms 12072 KB Output is correct
21 Correct 8 ms 11988 KB Output is correct
22 Correct 9 ms 12244 KB Output is correct
23 Correct 7 ms 11988 KB Output is correct
24 Correct 7 ms 12068 KB Output is correct
25 Correct 7 ms 12072 KB Output is correct
26 Correct 7 ms 11988 KB Output is correct
27 Correct 8 ms 12104 KB Output is correct
28 Correct 8 ms 12080 KB Output is correct
29 Correct 6 ms 12060 KB Output is correct
30 Correct 730 ms 114500 KB Output is correct
31 Correct 752 ms 114388 KB Output is correct
32 Correct 709 ms 114404 KB Output is correct
33 Correct 744 ms 114408 KB Output is correct
34 Correct 735 ms 114440 KB Output is correct
35 Correct 36 ms 16024 KB Output is correct
36 Correct 7 ms 12116 KB Output is correct
37 Correct 8 ms 12076 KB Output is correct
38 Correct 881 ms 109292 KB Output is correct
39 Correct 30 ms 16040 KB Output is correct
40 Correct 28 ms 15584 KB Output is correct
41 Correct 32 ms 15572 KB Output is correct
42 Correct 51 ms 15856 KB Output is correct
43 Correct 48 ms 15908 KB Output is correct
44 Correct 195 ms 23568 KB Output is correct
45 Correct 32 ms 16108 KB Output is correct
46 Correct 42 ms 16112 KB Output is correct
47 Correct 39 ms 15808 KB Output is correct
48 Correct 195 ms 23684 KB Output is correct
49 Correct 19 ms 15100 KB Output is correct
50 Correct 38 ms 15716 KB Output is correct
51 Correct 30 ms 15544 KB Output is correct
52 Correct 31 ms 15376 KB Output is correct
53 Correct 662 ms 103456 KB Output is correct
54 Correct 483 ms 103416 KB Output is correct
55 Correct 760 ms 109772 KB Output is correct
56 Correct 801 ms 109808 KB Output is correct
57 Correct 667 ms 114708 KB Output is correct
58 Correct 647 ms 114496 KB Output is correct
59 Correct 658 ms 114512 KB Output is correct
60 Correct 754 ms 107908 KB Output is correct
61 Correct 228 ms 90936 KB Output is correct
62 Correct 674 ms 104780 KB Output is correct
63 Correct 628 ms 101472 KB Output is correct
64 Correct 597 ms 97308 KB Output is correct