oj.uz

Submission #882979

# Submission time Handle Problem Language Result Execution time Memory
882979 2023-12-04T10:11:29 Z LucaIlie Misspelling (JOI22_misspelling) C++17
89 / 100
 4000 ms 220324 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;
    for ( int i = 1; i <= n; i++ ) {
        int r1 = maxR1[i - 1], p1 = i - 1;
        while ( r1 < i && p1 > 0 ) {
            p1--;
            r1 = max( r1, maxR1[p1] );
        }

        int r2 = maxR2[i - 1], p2 = i - 1;
        while ( r2 < i && p2 > 0 ) {
            p2--;
            r2 = max( r2, maxR2[p2] );
        }

        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;
    }
    
    /*for ( int i = 0; i <= n; i++ ) {
        for ( int l = 0; l < SIGMA; l++ )
            printf( "%d ", dp[i][l] );
        printf( "\n" );
    }*/

    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 6492 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 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 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 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 6492 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 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 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 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 6580 KB Output is correct
17 Correct 2 ms 6500 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6652 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6744 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 6492 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 6492 KB Output is correct
5 Correct 2238 ms 213620 KB Output is correct
6 Correct 2265 ms 220116 KB Output is correct
7 Correct 2274 ms 220324 KB Output is correct
8 Correct 2234 ms 220120 KB Output is correct
9 Correct 2229 ms 220304 KB Output is correct
10 Correct 91 ms 14104 KB Output is correct
11 Correct 2 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 2253 ms 220260 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 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 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 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 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 6580 KB Output is correct
17 Correct 2 ms 6500 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6652 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6744 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 91 ms 13892 KB Output is correct
27 Correct 273 ms 13904 KB Output is correct
28 Correct 274 ms 13876 KB Output is correct
29 Correct 92 ms 14052 KB Output is correct
30 Correct 92 ms 14216 KB Output is correct
31 Correct 268 ms 21080 KB Output is correct
32 Correct 89 ms 14264 KB Output is correct
33 Correct 88 ms 14076 KB Output is correct
34 Correct 89 ms 14164 KB Output is correct
35 Correct 263 ms 21196 KB Output is correct
36 Correct 434 ms 13916 KB Output is correct
37 Correct 87 ms 13996 KB Output is correct
38 Correct 85 ms 14044 KB Output is correct
39 Correct 85 ms 13904 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 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 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 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 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 6580 KB Output is correct
17 Correct 2 ms 6500 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6652 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6744 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 1 ms 6492 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 6492 KB Output is correct
30 Correct 2238 ms 213620 KB Output is correct
31 Correct 2265 ms 220116 KB Output is correct
32 Correct 2274 ms 220324 KB Output is correct
33 Correct 2234 ms 220120 KB Output is correct
34 Correct 2229 ms 220304 KB Output is correct
35 Correct 91 ms 14104 KB Output is correct
36 Correct 2 ms 6488 KB Output is correct
37 Correct 1 ms 6488 KB Output is correct
38 Correct 2253 ms 220260 KB Output is correct
39 Correct 91 ms 13892 KB Output is correct
40 Correct 273 ms 13904 KB Output is correct
41 Correct 274 ms 13876 KB Output is correct
42 Correct 92 ms 14052 KB Output is correct
43 Correct 92 ms 14216 KB Output is correct
44 Correct 268 ms 21080 KB Output is correct
45 Correct 89 ms 14264 KB Output is correct
46 Correct 88 ms 14076 KB Output is correct
47 Correct 89 ms 14164 KB Output is correct
48 Correct 263 ms 21196 KB Output is correct
49 Correct 434 ms 13916 KB Output is correct
50 Correct 87 ms 13996 KB Output is correct
51 Correct 85 ms 14044 KB Output is correct
52 Correct 85 ms 13904 KB Output is correct
53 Execution timed out 4034 ms 213808 KB Time limit exceeded
54 Halted 0 ms 0 KB -