oj.uz

Submission #882977

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

using namespace std;

const int MAX_N = 200;
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];
int dp[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 j = i - 1; j > max( p1, p2 ); j-- ) {
            for ( int l = 0; l < SIGMA; l++ ) {
                for ( int m = 0; m < SIGMA; m++ ) {
                    if ( m == l )
                        continue;
                    dp[i][l] = (dp[i][l] + dp[j][m]) % MOD;
                }
            }
        }
        if ( p1 > p2 ) {
            for ( int j = p1; j > p2; j-- ) {
                for ( int l = 0; l < SIGMA; l++ ) {
                    for ( int m = l + 1; m < SIGMA; m++ )
                        dp[i][l] = (dp[i][l] + dp[j][m]) % MOD;
                }
            }
        } else {
            for ( int j = p2; j > p1; j-- ) {
                for ( int l = 0; l < SIGMA; l++ ) {
                    for ( int m = 0; m < l; m++ )
                        dp[i][l] = (dp[i][l] + dp[j][m]) % MOD;
                }
            }
        }
    }


    /*for ( int i = 0; i <= n; i++ ) {
        for ( int l = 0; l < SIGMA; l++ )
            printf( "%d ", dp[i][l] );
        printf( "\n" );
    }*/

    long long 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 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4448 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4448 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4448 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4452 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4448 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4448 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4448 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4452 KB Output is correct
15 Correct 20 ms 4440 KB Output is correct
16 Correct 8 ms 4444 KB Output is correct
17 Correct 4 ms 4448 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 3 ms 4568 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 3 ms 4444 KB Output is correct
23 Correct 39 ms 4568 KB Output is correct
24 Correct 5 ms 4444 KB Output is correct
25 Correct 1 ms 4552 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4452 KB Output is correct
2 Correct 1 ms 4452 KB Output is correct
3 Correct 1 ms 4448 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Runtime error 296 ms 12484 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4448 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4448 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4448 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4452 KB Output is correct
15 Correct 20 ms 4440 KB Output is correct
16 Correct 8 ms 4444 KB Output is correct
17 Correct 4 ms 4448 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 3 ms 4568 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 3 ms 4444 KB Output is correct
23 Correct 39 ms 4568 KB Output is correct
24 Correct 5 ms 4444 KB Output is correct
25 Correct 1 ms 4552 KB Output is correct
26 Execution timed out 4003 ms 4704 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4448 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4448 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4448 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4452 KB Output is correct
15 Correct 20 ms 4440 KB Output is correct
16 Correct 8 ms 4444 KB Output is correct
17 Correct 4 ms 4448 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 3 ms 4568 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 3 ms 4444 KB Output is correct
23 Correct 39 ms 4568 KB Output is correct
24 Correct 5 ms 4444 KB Output is correct
25 Correct 1 ms 4552 KB Output is correct
26 Correct 1 ms 4452 KB Output is correct
27 Correct 1 ms 4452 KB Output is correct
28 Correct 1 ms 4448 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Runtime error 296 ms 12484 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -