oj.uz

Submission #882815

# Submission time Handle Problem Language Result Execution time Memory
882815 2023-12-03T18:36:33 Z LucaIlie Misspelling (JOI22_misspelling) C++17
8 / 100
 4000 ms 526092 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], dp[MAX_N + 1][MAX_N + 1][MAX_N + 1][SIGMA], maxR1[MAX_N + 1], maxR2[MAX_N + 1];

int main() {
    int n, m;

    cin >> n >> m;
    n++;
    for ( int i = 0; i < m; i++ ) {
        cin >> l[i] >> r[i];
        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] );
        }
    }

    dp[1][0][0][0] = 1;
    for ( int i = 1; i < n; i++ ) {
        for ( int r1 = 0; r1 <= n; r1++ ) {
            for ( int r2 = 0; r2 <= n; r2++ ) {
                for ( int l = 0; l < SIGMA; l++ ) {
                    int newR1 = max( r1, maxR1[i] ), newR2 = max( r2, maxR2[i] );
                    if ( newR1 <= i && newR2 <= i ) {
                        for ( int m = 0; m < SIGMA; m++ )
                            dp[i + 1][newR1][newR2][m] = (dp[i + 1][newR1][newR2][m] + dp[i][r1][r2][l]) % MOD;
                    } else if ( newR1 > i && newR2 <= i ) {
                        for ( int m = 0; m < l; m++ )
                            dp[i + 1][0][newR2][m] = (dp[i + 1][0][newR2][m] + dp[i][r1][r2][l]) % MOD;
                        dp[i + 1][newR1][newR2][l] = (dp[i + 1][newR1][newR2][l] + dp[i][r1][r2][l]) % MOD;
                    } else if ( newR1 <= i && newR2 > i ) {
                        for ( int m = l + 1; m < SIGMA; m++ )
                            dp[i + 1][newR1][0][m] = (dp[i + 1][newR1][0][m] + dp[i][r1][r2][l]) % MOD;
                        dp[i + 1][newR1][newR2][l] = (dp[i + 1][newR1][newR2][l] + dp[i][r1][r2][l]) % MOD;
                    } else
                        dp[i + 1][newR1][newR2][l] = (dp[i + 1][newR1][newR2][l] + dp[i][r1][r2][l]) % MOD;
                }
            }
        }
    }

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

    int ans = 0;
    for ( int r1 = 0; r1 <= n; r1++ ) {
        for ( int r2 = 0; r2 <= n; r2++ ) {
            for ( int l = 0; l < SIGMA; l++ )
                ans = (ans + dp[n][r1][r2][l]) % MOD;
        }
    }

    cout << ans;


    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8692 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 1 ms 8636 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 2 ms 9164 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8568 KB Output is correct
14 Correct 2 ms 9048 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8692 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 1 ms 8636 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 2 ms 9164 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8568 KB Output is correct
14 Correct 2 ms 9048 KB Output is correct
15 Incorrect 2967 ms 526092 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 1 ms 8536 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Execution timed out 4049 ms 71848 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8692 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 1 ms 8636 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 2 ms 9164 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8568 KB Output is correct
14 Correct 2 ms 9048 KB Output is correct
15 Incorrect 2967 ms 526092 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8692 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 1 ms 8636 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 2 ms 9164 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8568 KB Output is correct
14 Correct 2 ms 9048 KB Output is correct
15 Incorrect 2967 ms 526092 KB Output isn't correct
16 Halted 0 ms 0 KB -