oj.uz

Submission #882980

# Submission time Handle Problem Language Result Execution time Memory
882980 2023-12-04T10:21:28 Z LucaIlie Misspelling (JOI22_misspelling) C++17
100 / 100
 2253 ms 220336 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 5e5;
const int MAX_M = 5e5;
const int SIGMA = 26;
const int MOD = 1e9 + 7;
int l[MAX_M], r[MAX_M], t[MAX_M], maxR1[MAX_N + 1], maxR2[MAX_N + 1];
long long dp[MAX_N + 1][SIGMA], sp[MAX_N + 1][SIGMA];

int main() {
    int n, m;

    cin >> n >> m;
    for ( int i = 0; i < m; i++ ) {
        cin >> l[i] >> r[i];
        if ( l[i] > r[i] ) {
            swap( l[i], r[i] );
            t[i] = 2;
            maxR2[l[i]] = max( maxR2[l[i]], r[i] );
        } else {
            t[i] = 1;
            maxR1[l[i]] = max( maxR1[l[i]], r[i] );
        }
    }

    for ( int l = 0; l < SIGMA; l++ )
        dp[1][l] = 1;
    vector<int> s1, s2;
    for ( int i = 1; i <= n; i++ ) {
        while ( !s1.empty() && maxR1[i - 1] >= maxR1[s1.back()] )
            s1.pop_back();
        s1.push_back( i - 1 );
        while ( !s2.empty() && maxR2[i - 1] >= maxR2[s2.back()] )
            s2.pop_back();
        s2.push_back( i - 1 );

        int st, dr;

        st = -1, dr = s1.size();
        while ( dr - st > 1 ) {
            int p = (st + dr) / 2;
            if ( maxR1[s1[p]] >= i )
                st = p;
            else
                dr = p;
        }
        int p1 = (st == -1 ? 0 : s1[st]);

        st = -1, dr = s2.size();
        while ( dr - st > 1 ) {
            int p = (st + dr) / 2;
            if ( maxR2[s2[p]] >= i )
                st = p;
            else
                dr = p;
        }
        int p2 = (st == -1 ? 0 : s2[st]);

        for ( int l = 0; l < SIGMA; l++ ) {
            for ( int m = 0; m < SIGMA; m++ ) {
                if ( m == l )
                    continue;
                dp[i][l] = (dp[i][l] + sp[i - 1][m] - sp[max( p1, p2 )][m] + MOD) % MOD;
            }
        }
        if ( p1 > p2 ) {
            for ( int l = 0; l < SIGMA; l++ ) {
                for ( int m = l + 1; m < SIGMA; m++ )
                    dp[i][l] = (dp[i][l] + sp[p1][m] - sp[p2][m] + MOD) % MOD;
            }
        } else {
            for ( int l = 0; l < SIGMA; l++ ) {
                for ( int m = 0; m < l; m++ )
                    dp[i][l] = (dp[i][l] + sp[p2][m] - sp[p1][m] + MOD) % MOD;
            }
        }

        for ( int l = 0; l < SIGMA; l++ )
            sp[i][l] = (sp[i - 1][l] + dp[i][l]) % MOD;
    }
    
    int ans = 0;
    for ( int i = 1; i <= n; i++ ) {
        for ( int l = 0; l < SIGMA; l++ )
            ans = (ans + dp[i][l]) % MOD;
    }

    cout << ans;

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6500 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6592 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6500 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6592 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6616 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 5 ms 6492 KB Output is correct
23 Correct 2 ms 6648 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 2253 ms 213668 KB Output is correct
6 Correct 2242 ms 213760 KB Output is correct
7 Correct 2221 ms 213544 KB Output is correct
8 Correct 2223 ms 213716 KB Output is correct
9 Correct 2219 ms 213704 KB Output is correct
10 Correct 90 ms 13988 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 2249 ms 213704 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6500 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6592 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6616 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 5 ms 6492 KB Output is correct
23 Correct 2 ms 6648 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 88 ms 13964 KB Output is correct
27 Correct 86 ms 13828 KB Output is correct
28 Correct 85 ms 13904 KB Output is correct
29 Correct 90 ms 13852 KB Output is correct
30 Correct 90 ms 13896 KB Output is correct
31 Correct 264 ms 15712 KB Output is correct
32 Correct 91 ms 14108 KB Output is correct
33 Correct 88 ms 13960 KB Output is correct
34 Correct 88 ms 13852 KB Output is correct
35 Correct 279 ms 15668 KB Output is correct
36 Correct 83 ms 13804 KB Output is correct
37 Correct 86 ms 14080 KB Output is correct
38 Correct 84 ms 13900 KB Output is correct
39 Correct 83 ms 13844 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6500 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6592 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6616 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 5 ms 6492 KB Output is correct
23 Correct 2 ms 6648 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 1 ms 6488 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6488 KB Output is correct
30 Correct 2253 ms 213668 KB Output is correct
31 Correct 2242 ms 213760 KB Output is correct
32 Correct 2221 ms 213544 KB Output is correct
33 Correct 2223 ms 213716 KB Output is correct
34 Correct 2219 ms 213704 KB Output is correct
35 Correct 90 ms 13988 KB Output is correct
36 Correct 3 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 2249 ms 213704 KB Output is correct
39 Correct 88 ms 13964 KB Output is correct
40 Correct 86 ms 13828 KB Output is correct
41 Correct 85 ms 13904 KB Output is correct
42 Correct 90 ms 13852 KB Output is correct
43 Correct 90 ms 13896 KB Output is correct
44 Correct 264 ms 15712 KB Output is correct
45 Correct 91 ms 14108 KB Output is correct
46 Correct 88 ms 13960 KB Output is correct
47 Correct 88 ms 13852 KB Output is correct
48 Correct 279 ms 15668 KB Output is correct
49 Correct 83 ms 13804 KB Output is correct
50 Correct 86 ms 14080 KB Output is correct
51 Correct 84 ms 13900 KB Output is correct
52 Correct 83 ms 13844 KB Output is correct
53 Correct 2136 ms 211752 KB Output is correct
54 Correct 2147 ms 214268 KB Output is correct
55 Correct 2249 ms 220128 KB Output is correct
56 Correct 2241 ms 220216 KB Output is correct
57 Correct 2214 ms 220336 KB Output is correct
58 Correct 2234 ms 220336 KB Output is correct
59 Correct 2233 ms 220192 KB Output is correct
60 Correct 2223 ms 220320 KB Output is correct
61 Correct 1977 ms 208028 KB Output is correct
62 Correct 2173 ms 218108 KB Output is correct
63 Correct 2114 ms 216080 KB Output is correct
64 Correct 2081 ms 213832 KB Output is correct