oj.uz

Submission #937089

# Submission time Handle Problem Language Result Execution time Memory
937089 2024-03-03T13:08:53 Z Pannda Misspelling (JOI22_misspelling) C++17
100 / 100
 1525 ms 126728 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));
    dp[n - 1] = vector<int>(26, 1);
    int f = accumulate(dp[n - 1].begin(), dp[n - 1].end(), 0LL) % P;

    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) {
                for (int d = c + 1; d < 26; d++) {
                    dp[i][c] = (dp[i][c] - dp[j][d] + P) % P;
                }
            }
            for (int j : adj1) {
                for (int d = c - 1; d >= 0; d--) {
                    dp[i][c] = (dp[i][c] - dp[j][d] + P) % P;
                }
            }
        }
        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 1 ms 348 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 452 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 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 1 ms 348 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 452 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 452 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 1 ms 344 KB Output is correct
24 Correct 1 ms 344 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 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 1406 ms 126548 KB Output is correct
6 Correct 1411 ms 126444 KB Output is correct
7 Correct 1409 ms 126548 KB Output is correct
8 Correct 1408 ms 126452 KB Output is correct
9 Correct 1408 ms 126588 KB Output is correct
10 Correct 55 ms 5212 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1475 ms 126588 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 452 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 452 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 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 55 ms 5212 KB Output is correct
27 Correct 32 ms 5212 KB Output is correct
28 Correct 31 ms 5212 KB Output is correct
29 Correct 58 ms 5440 KB Output is correct
30 Correct 59 ms 5464 KB Output is correct
31 Correct 108 ms 10320 KB Output is correct
32 Correct 57 ms 5212 KB Output is correct
33 Correct 56 ms 5212 KB Output is correct
34 Correct 58 ms 5468 KB Output is correct
35 Correct 114 ms 10300 KB Output is correct
36 Correct 8 ms 5212 KB Output is correct
37 Correct 58 ms 5172 KB Output is correct
38 Correct 58 ms 5212 KB Output is correct
39 Correct 57 ms 5072 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 452 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 452 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 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 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 1406 ms 126548 KB Output is correct
31 Correct 1411 ms 126444 KB Output is correct
32 Correct 1409 ms 126548 KB Output is correct
33 Correct 1408 ms 126452 KB Output is correct
34 Correct 1408 ms 126588 KB Output is correct
35 Correct 55 ms 5212 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1475 ms 126588 KB Output is correct
39 Correct 55 ms 5212 KB Output is correct
40 Correct 32 ms 5212 KB Output is correct
41 Correct 31 ms 5212 KB Output is correct
42 Correct 58 ms 5440 KB Output is correct
43 Correct 59 ms 5464 KB Output is correct
44 Correct 108 ms 10320 KB Output is correct
45 Correct 57 ms 5212 KB Output is correct
46 Correct 56 ms 5212 KB Output is correct
47 Correct 58 ms 5468 KB Output is correct
48 Correct 114 ms 10300 KB Output is correct
49 Correct 8 ms 5212 KB Output is correct
50 Correct 58 ms 5172 KB Output is correct
51 Correct 58 ms 5212 KB Output is correct
52 Correct 57 ms 5072 KB Output is correct
53 Correct 1412 ms 123192 KB Output is correct
54 Correct 770 ms 123188 KB Output is correct
55 Correct 1490 ms 126504 KB Output is correct
56 Correct 1525 ms 126728 KB Output is correct
57 Correct 1409 ms 126688 KB Output is correct
58 Correct 1417 ms 126544 KB Output is correct
59 Correct 1407 ms 126448 KB Output is correct
60 Correct 1489 ms 126448 KB Output is correct
61 Correct 344 ms 119828 KB Output is correct
62 Correct 1478 ms 125012 KB Output is correct
63 Correct 1473 ms 123140 KB Output is correct
64 Correct 1462 ms 121484 KB Output is correct