oj.uz

Submission #922600

# Submission time Handle Problem Language Result Execution time Memory
922600 2024-02-05T19:04:44 Z esomer Misspelling (JOI22_misspelling) C++17
100 / 100
 1374 ms 167504 KB 
#include<bits/stdc++.h>
 
using namespace std;

const int MOD = 1e9 + 7;

#define int long long

int sum(int l, int r, vector<int>& pre){
    if(l > r) return 0;
    if(l > 0) return (pre[r] - pre[l-1] + MOD) % MOD;
    else return pre[r];
}

void solve(){
    int n, m; cin >> n >> m;
    vector<pair<vector<int>, vector<int>>> ends(n);
    for(int i = 0; i < m; i++){
        int a, b; cin >> a >> b; a--; b--;
        int type = 1;
        if(a > b) {type = 2; swap(a, b);}
        a++;
        if(type == 1) ends[b].first.push_back(a); //In type 1, i is >= than i + 1.
        else ends[b].second.push_back(a); //In type 2, i is <= than i + 1.
        // cout << "i "<< i << " type "<< type << " a "<< a << " b "<< b << "\n";
    }
    vector<pair<int, int>> mx(n, {0, 0});
    pair<set<int>, set<int>> curr; curr.first.insert(0); curr.second.insert(0);
    for(int i = n - 1; i >= 0; i--){
        curr.first.erase(i+1);
        curr.second.erase(i+1);
        for(int& y : ends[i].first) curr.first.insert(y);
        for(int& y : ends[i].second) curr.second.insert(y);
        mx[i].first = *curr.first.rbegin();
        mx[i].second = *curr.second.rbegin();
    }
    vector<vector<int>> prefix(26, vector<int>(n, 0));
    for(int i = 0; i < 26; i++) prefix[i][0] = 1;
    for(int i = 1; i < n; i++){
        // cout << "i "<< i << " mx "<< mx[i].first << " "<< mx[i].second << "\n";
        vector<int> dp(26, 0);
        for(int j = 0; j < 26; j++){
            for(int q = 0; q < 26; q++){
                if(q == j) continue;
                if(q < j){
                    dp[q] = (dp[q] + sum(mx[i].second, i-1, prefix[j])) % MOD;
                }else{
                    dp[q] = (dp[q] + sum(mx[i].first, i-1, prefix[j])) % MOD;
                }
            }
        }
        for(int j = 0; j < 26; j++){
            prefix[j][i] = (prefix[j][i-1] + dp[j]) % MOD;
        }
        // cout << "i "<< i << endl;
        // for(int j = 0; j < 26; j++){
        //     cout << "j "<< j << " dp " << dp[j] << "\n";
        // }
    }
    int ans = 0;
    for(int i = 0; i < 26; i++) ans = (ans + sum(0, n-1, prefix[i])) % MOD;
    cout << ans << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    // int tt; cin >> tt;
    int tt = 1;
    while(tt--) solve();
    return 0;
}

Subtask #1
8.0 / 8.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 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 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 452 KB Output is correct

Subtask #2
20.0 / 20.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 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 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 452 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 452 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 604 KB Output is correct
23 Correct 1 ms 456 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 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1006 ms 159544 KB Output is correct
6 Correct 984 ms 159536 KB Output is correct
7 Correct 999 ms 159736 KB Output is correct
8 Correct 997 ms 159572 KB Output is correct
9 Correct 1004 ms 159552 KB Output is correct
10 Correct 43 ms 6744 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 360 KB Output is correct
13 Correct 1262 ms 167504 KB Output is correct

Subtask #4
32.0 / 32.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 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 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 452 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 452 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 604 KB Output is correct
23 Correct 1 ms 456 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 41 ms 6744 KB Output is correct
27 Correct 44 ms 6488 KB Output is correct
28 Correct 36 ms 6488 KB Output is correct
29 Correct 44 ms 6708 KB Output is correct
30 Correct 45 ms 6756 KB Output is correct
31 Correct 173 ms 17720 KB Output is correct
32 Correct 41 ms 7000 KB Output is correct
33 Correct 42 ms 6744 KB Output is correct
34 Correct 53 ms 7004 KB Output is correct
35 Correct 165 ms 18472 KB Output is correct
36 Correct 28 ms 5980 KB Output is correct
37 Correct 47 ms 6748 KB Output is correct
38 Correct 50 ms 6580 KB Output is correct
39 Correct 47 ms 6236 KB Output is correct

Subtask #5
11.0 / 11.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 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 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 452 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 452 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 604 KB Output is correct
23 Correct 1 ms 456 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 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1006 ms 159544 KB Output is correct
31 Correct 984 ms 159536 KB Output is correct
32 Correct 999 ms 159736 KB Output is correct
33 Correct 997 ms 159572 KB Output is correct
34 Correct 1004 ms 159552 KB Output is correct
35 Correct 43 ms 6744 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 360 KB Output is correct
38 Correct 1262 ms 167504 KB Output is correct
39 Correct 41 ms 6744 KB Output is correct
40 Correct 44 ms 6488 KB Output is correct
41 Correct 36 ms 6488 KB Output is correct
42 Correct 44 ms 6708 KB Output is correct
43 Correct 45 ms 6756 KB Output is correct
44 Correct 173 ms 17720 KB Output is correct
45 Correct 41 ms 7000 KB Output is correct
46 Correct 42 ms 6744 KB Output is correct
47 Correct 53 ms 7004 KB Output is correct
48 Correct 165 ms 18472 KB Output is correct
49 Correct 28 ms 5980 KB Output is correct
50 Correct 47 ms 6748 KB Output is correct
51 Correct 50 ms 6580 KB Output is correct
52 Correct 47 ms 6236 KB Output is correct
53 Correct 1184 ms 150612 KB Output is correct
54 Correct 953 ms 150612 KB Output is correct
55 Correct 1231 ms 160720 KB Output is correct
56 Correct 1285 ms 160724 KB Output is correct
57 Correct 1026 ms 159572 KB Output is correct
58 Correct 1042 ms 159580 KB Output is correct
59 Correct 981 ms 159568 KB Output is correct
60 Correct 1374 ms 161264 KB Output is correct
61 Correct 764 ms 137296 KB Output is correct
62 Correct 1261 ms 159356 KB Output is correct
63 Correct 1224 ms 152664 KB Output is correct
64 Correct 1177 ms 145496 KB Output is correct