oj.uz

Submission #937094

# Submission time Handle Problem Language Result Execution time Memory
937094 2024-03-03T13:15:55 Z Pannda Misspelling (JOI22_misspelling) C++17
100 / 100
 573 ms 253076 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    static constexpr int P = 1e9 + 7;

    auto add = [](int &x, int y) {
        x += y;
        if (x >= P) x -= P;
        if (x < 0) x += P;
    };

    int n, m;
    cin >> n >> m;

    vector<int> enforce0(n, -1); // enforces s[i] >= s[i + 1]
    vector<int> enforce1(n, -1); // enforces s[i] <= s[i + 1]

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        if (a < b) enforce0[a] = max(enforce0[a], b);
        else enforce1[b] = max(enforce1[b], a);
    }

    vector<int> all(n);
    iota(all.begin(), all.end(), 0);
    set<int> s0(all.begin(), all.end());
    set<int> s1(all.begin(), all.end());

    vector<vector<int>> dp(n, vector<int>(26, 0));
    vector<vector<int>> upper(n, vector<int>(26, 0));
    vector<vector<int>> lower(n, vector<int>(26, 0));
    dp[n - 1] = vector<int>(26, 1);
    int f = accumulate(dp[n - 1].begin(), dp[n - 1].end(), 0LL) % P;

    auto update = [&](int i) {
        for (int c = 24; c >= 0; c--) {
            upper[i][c] = upper[i][c + 1];
            add(upper[i][c], dp[i][c + 1]);
        }
        for (int c = 1; c < 26; c++) {
            lower[i][c] = lower[i][c - 1];
            add(lower[i][c], dp[i][c - 1]);
        }
    };
    update(n - 1);

    for (int i = n - 2; i >= 0; i--) {
        vector<int> adj0;
        vector<int> adj1;
        if (enforce0[i] != -1) {
            while (true) {
                auto it = s0.upper_bound(i);
                if (it == s0.end() || *it > enforce0[i]) break;
                adj0.push_back(*it);
                s0.erase(it);
            }
        }
        if (enforce1[i] != -1) {
            while (true) {
                auto it = s1.upper_bound(i);
                if (it == s1.end() || *it > enforce1[i]) break;
                adj1.push_back(*it);
                s1.erase(it);
            }
        }
        for (int c = 0; c < 26; c++) {
            add(dp[i][c], f);
            for (int j : adj0) {
                add(dp[i][c], -upper[j][c]);
            }
            for (int j : adj1) {
                add(dp[i][c], -lower[j][c]);
            }
        }
        update(i);
        f = accumulate(dp[i].begin(), dp[i].end(), 0LL) % P;
    }

    cout << f << '\n';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 1 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 0 ms 348 KB Output is correct
13 Correct 0 ms 360 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 1 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 0 ms 348 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 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 2 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 573 ms 252904 KB Output is correct
6 Correct 557 ms 253012 KB Output is correct
7 Correct 567 ms 252908 KB Output is correct
8 Correct 559 ms 252736 KB Output is correct
9 Correct 569 ms 252960 KB Output is correct
10 Correct 21 ms 10332 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 523 ms 252908 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 1 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 0 ms 348 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 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 2 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 23 ms 10332 KB Output is correct
27 Correct 21 ms 10332 KB Output is correct
28 Correct 18 ms 10328 KB Output is correct
29 Correct 21 ms 10328 KB Output is correct
30 Correct 21 ms 10332 KB Output is correct
31 Correct 75 ms 10312 KB Output is correct
32 Correct 22 ms 10328 KB Output is correct
33 Correct 26 ms 10580 KB Output is correct
34 Correct 21 ms 10408 KB Output is correct
35 Correct 76 ms 10324 KB Output is correct
36 Correct 14 ms 10332 KB Output is correct
37 Correct 20 ms 10332 KB Output is correct
38 Correct 19 ms 10428 KB Output is correct
39 Correct 19 ms 10576 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 1 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 0 ms 348 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 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 2 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 573 ms 252904 KB Output is correct
31 Correct 557 ms 253012 KB Output is correct
32 Correct 567 ms 252908 KB Output is correct
33 Correct 559 ms 252736 KB Output is correct
34 Correct 569 ms 252960 KB Output is correct
35 Correct 21 ms 10332 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 523 ms 252908 KB Output is correct
39 Correct 23 ms 10332 KB Output is correct
40 Correct 21 ms 10332 KB Output is correct
41 Correct 18 ms 10328 KB Output is correct
42 Correct 21 ms 10328 KB Output is correct
43 Correct 21 ms 10332 KB Output is correct
44 Correct 75 ms 10312 KB Output is correct
45 Correct 22 ms 10328 KB Output is correct
46 Correct 26 ms 10580 KB Output is correct
47 Correct 21 ms 10408 KB Output is correct
48 Correct 76 ms 10324 KB Output is correct
49 Correct 14 ms 10332 KB Output is correct
50 Correct 20 ms 10332 KB Output is correct
51 Correct 19 ms 10428 KB Output is correct
52 Correct 19 ms 10576 KB Output is correct
53 Correct 516 ms 253076 KB Output is correct
54 Correct 451 ms 252752 KB Output is correct
55 Correct 531 ms 252908 KB Output is correct
56 Correct 543 ms 253012 KB Output is correct
57 Correct 567 ms 253012 KB Output is correct
58 Correct 561 ms 252704 KB Output is correct
59 Correct 570 ms 252752 KB Output is correct
60 Correct 524 ms 252904 KB Output is correct
61 Correct 319 ms 252756 KB Output is correct
62 Correct 517 ms 252704 KB Output is correct
63 Correct 494 ms 252756 KB Output is correct
64 Correct 497 ms 252804 KB Output is correct