oj.uz

Submission #937092

# Submission time Handle Problem Language Result Execution time Memory
937092 2024-03-03T13:13:07 Z Pannda Misspelling (JOI22_misspelling) C++17
100 / 100
 637 ms 253012 KB 
#include <bits/stdc++.h>
using namespace std;

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

    static constexpr int P = 1e9 + 7;

    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] + dp[i][c + 1]) % P;
        }
        for (int c = 1; c < 26; c++) {
            lower[i][c] = (lower[i][c - 1] + dp[i][c - 1]) % P;
        }
    };
    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++) {
            dp[i][c] = (dp[i][c] + f) % P;
            for (int j : adj0) {
                dp[i][c] = (dp[i][c] - upper[j][c] + P) % P;
            }
            for (int j : adj1) {
                dp[i][c] = (dp[i][c] - lower[j][c] + P) % P;
            }
        }
        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 1 ms 348 KB Output is correct
4 Correct 1 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 344 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 1 ms 348 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 1 ms 348 KB Output is correct
4 Correct 1 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 344 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 1 ms 348 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 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 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 576 ms 253008 KB Output is correct
6 Correct 587 ms 253012 KB Output is correct
7 Correct 557 ms 252904 KB Output is correct
8 Correct 568 ms 252832 KB Output is correct
9 Correct 566 ms 252900 KB Output is correct
10 Correct 22 ms 10580 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 637 ms 252904 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 1 ms 348 KB Output is correct
4 Correct 1 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 344 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 1 ms 348 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 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 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 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 21 ms 10328 KB Output is correct
27 Correct 18 ms 10332 KB Output is correct
28 Correct 18 ms 10328 KB Output is correct
29 Correct 23 ms 10328 KB Output is correct
30 Correct 23 ms 10332 KB Output is correct
31 Correct 76 ms 10652 KB Output is correct
32 Correct 21 ms 10332 KB Output is correct
33 Correct 22 ms 10328 KB Output is correct
34 Correct 23 ms 10332 KB Output is correct
35 Correct 76 ms 10320 KB Output is correct
36 Correct 15 ms 10328 KB Output is correct
37 Correct 23 ms 10328 KB Output is correct
38 Correct 21 ms 10332 KB Output is correct
39 Correct 21 ms 10332 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 1 ms 348 KB Output is correct
4 Correct 1 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 344 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 1 ms 348 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 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 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 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 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 576 ms 253008 KB Output is correct
31 Correct 587 ms 253012 KB Output is correct
32 Correct 557 ms 252904 KB Output is correct
33 Correct 568 ms 252832 KB Output is correct
34 Correct 566 ms 252900 KB Output is correct
35 Correct 22 ms 10580 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 637 ms 252904 KB Output is correct
39 Correct 21 ms 10328 KB Output is correct
40 Correct 18 ms 10332 KB Output is correct
41 Correct 18 ms 10328 KB Output is correct
42 Correct 23 ms 10328 KB Output is correct
43 Correct 23 ms 10332 KB Output is correct
44 Correct 76 ms 10652 KB Output is correct
45 Correct 21 ms 10332 KB Output is correct
46 Correct 22 ms 10328 KB Output is correct
47 Correct 23 ms 10332 KB Output is correct
48 Correct 76 ms 10320 KB Output is correct
49 Correct 15 ms 10328 KB Output is correct
50 Correct 23 ms 10328 KB Output is correct
51 Correct 21 ms 10332 KB Output is correct
52 Correct 21 ms 10332 KB Output is correct
53 Correct 538 ms 252900 KB Output is correct
54 Correct 456 ms 252900 KB Output is correct
55 Correct 580 ms 252908 KB Output is correct
56 Correct 583 ms 252904 KB Output is correct
57 Correct 597 ms 252772 KB Output is correct
58 Correct 573 ms 252760 KB Output is correct
59 Correct 561 ms 252900 KB Output is correct
60 Correct 595 ms 252672 KB Output is correct
61 Correct 372 ms 252752 KB Output is correct
62 Correct 564 ms 252904 KB Output is correct
63 Correct 555 ms 252904 KB Output is correct
64 Correct 538 ms 252900 KB Output is correct