oj.uz

Submission #674066

# Submission time Handle Problem Language Result Execution time Memory
674066 2022-12-22T20:32:54 Z someone Misspelling (JOI22_misspelling) C++14
100 / 100
 285 ms 234000 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 5e5 + 42, L = 26, INF = 1e18 + 42, MOD = 1e9 + 7;

int n, m, maxFin[N][2], first[N][2], a[N], b[N], dp[N][L][2];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        cin >> a[i] >> b[i];
        a[i]--, b[i]--;
        if(a[i] < b[i])
            maxFin[a[i]][0] = max(maxFin[a[i]][0], b[i]);
        else
            maxFin[b[i]][1] = max(maxFin[b[i]][1], a[i]);
    }
    
    dp[n][0][0] = 1;
    for(int i = n-1; i > -1; i--) {
        for(int j = 0; j < 2; j++) {
            first[i][j] = i;
            if(maxFin[i][j]) {
                first[i][j] = first[maxFin[i][j]][j];
                for(int k = i+1; k <= maxFin[i][j] && first[k][j] != first[i][j]; k++)
                    first[k][j] = first[i][j];
            }
        }
        
        if(maxFin[i][0]) {
            int fi = first[i][0];
            for(int j = 0; j < L; j++)
                dp[i][j][1] = dp[fi][j][1];
        } else {
            int sum = 0;
            for(int j = L-1; j > -1; j--) {
                sum += dp[i+1][j][1];
                dp[i][j][1] += sum;
                sum += dp[i+1][j][0];
            }
        }
        
        if(maxFin[i][1]) {
            int fi = first[i][1];
            for(int j = 0; j < L; j++)
                dp[i][j][0] = dp[fi][j][0];
        } else {
            int sum = 0;
            for(int j = 0; j < L; j++) {
                sum += dp[i+1][j][0];
                dp[i][j][0] += sum;
                sum += dp[i+1][j][1];
            }
        }
        for(int j = 0; j < L; j++)
            dp[i][j][0] %= MOD,
            dp[i][j][1] %= MOD;
    }
    int sum = 0;
    for(int j = 0; j < L; j++)
        sum = (sum + dp[0][j][0] + dp[0][j][1]) % MOD;
    cout << sum;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 226 ms 233840 KB Output is correct
6 Correct 223 ms 233960 KB Output is correct
7 Correct 209 ms 233900 KB Output is correct
8 Correct 212 ms 233936 KB Output is correct
9 Correct 228 ms 233844 KB Output is correct
10 Correct 9 ms 9556 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 285 ms 233880 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 13 ms 9608 KB Output is correct
27 Correct 8 ms 9388 KB Output is correct
28 Correct 8 ms 9300 KB Output is correct
29 Correct 9 ms 9596 KB Output is correct
30 Correct 10 ms 9620 KB Output is correct
31 Correct 81 ms 22172 KB Output is correct
32 Correct 9 ms 9612 KB Output is correct
33 Correct 9 ms 9556 KB Output is correct
34 Correct 10 ms 9624 KB Output is correct
35 Correct 87 ms 22288 KB Output is correct
36 Correct 6 ms 8788 KB Output is correct
37 Correct 9 ms 9432 KB Output is correct
38 Correct 8 ms 9300 KB Output is correct
39 Correct 7 ms 9172 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 226 ms 233840 KB Output is correct
31 Correct 223 ms 233960 KB Output is correct
32 Correct 209 ms 233900 KB Output is correct
33 Correct 212 ms 233936 KB Output is correct
34 Correct 228 ms 233844 KB Output is correct
35 Correct 9 ms 9556 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 285 ms 233880 KB Output is correct
39 Correct 13 ms 9608 KB Output is correct
40 Correct 8 ms 9388 KB Output is correct
41 Correct 8 ms 9300 KB Output is correct
42 Correct 9 ms 9596 KB Output is correct
43 Correct 10 ms 9620 KB Output is correct
44 Correct 81 ms 22172 KB Output is correct
45 Correct 9 ms 9612 KB Output is correct
46 Correct 9 ms 9556 KB Output is correct
47 Correct 10 ms 9624 KB Output is correct
48 Correct 87 ms 22288 KB Output is correct
49 Correct 6 ms 8788 KB Output is correct
50 Correct 9 ms 9432 KB Output is correct
51 Correct 8 ms 9300 KB Output is correct
52 Correct 7 ms 9172 KB Output is correct
53 Correct 194 ms 226848 KB Output is correct
54 Correct 197 ms 226644 KB Output is correct
55 Correct 255 ms 233992 KB Output is correct
56 Correct 246 ms 234000 KB Output is correct
57 Correct 246 ms 233932 KB Output is correct
58 Correct 210 ms 233836 KB Output is correct
59 Correct 221 ms 233884 KB Output is correct
60 Correct 257 ms 233840 KB Output is correct
61 Correct 127 ms 211748 KB Output is correct
62 Correct 238 ms 230220 KB Output is correct
63 Correct 222 ms 226652 KB Output is correct
64 Correct 170 ms 223092 KB Output is correct