oj.uz

Submission #569062

# Submission time Handle Problem Language Result Execution time Memory
569062 2022-05-26T14:43:44 Z dantoh000 Misspelling (JOI22_misspelling) C++14
100 / 100
 1200 ms 116480 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m;
int up[500005];
int down[500005];
int dp[500005][30];
set<int> gup, gdown;
int tot[500005];
int mod = 1000000007;

int main(){
    scanf("%d%d",&n,&m);
    for (int i = 1; i <= n; i++){
        up[i] = down[i] = i;
    }
    for (int i = 0,a,b; i < m; i++){
        scanf("%d%d",&a,&b);
        if (a < b) up[a] = max(up[a], b);
        else down[b] = max(down[b], a);
    }
    for (int i = 1; i <= n+1; i++){
        gup.insert(i);
        gdown.insert(i);
    }
    for (int i = 0; i < 26; i++) tot[i] = 1;
    for (int i = n; i >= 1; i--){
        while (*gup.lower_bound(i+1) <= up[i]){
            int tmp = *gup.lower_bound(i+1);
            gup.erase(tmp);
            ///printf("%d cannot transition to %d up\n");
            int pfx = 0;
            for (int j = 25; j >= 0; j--){
                tot[j] = (tot[j] - pfx + mod)%mod;
                pfx = (pfx + dp[tmp][j])%mod;
            }
        }
        while (*gdown.lower_bound(i+1) <= down[i]){
            int tmp = *gdown.lower_bound(i+1);
            gdown.erase(tmp);
            ///printf("%d cannot transition to %d down\n");
            int pfx = 0;
            for (int j = 0; j < 26; j++){
                tot[j] = (tot[j] - pfx + mod)%mod;
                pfx = (pfx + dp[tmp][j])%mod;
            }
        }
        int sum = 0;
        for (int j = 0; j < 26; j++){

            dp[i][j] = tot[j];
            //printf("%d ",dp[i][j]);
            sum = (sum+dp[i][j])%mod;
        }
        //printf("\n");
        for (int j = 0; j < 26; j++){
            tot[j] = ((tot[j] + sum)%mod - dp[i][j] + mod)%mod;
        }
    }
    int ans = 0;
    for (int i = 0; i < 26; i++){
        ans = (ans + dp[1][i])%mod;
    }
    printf("%d\n",ans);




}

Compilation message

misspelling.cpp: In function 'int main()':
misspelling.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
misspelling.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         scanf("%d%d",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~

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 360 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 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 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 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 360 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 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 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 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 316 KB Output is correct
16 Correct 1 ms 324 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 320 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1031 ms 116384 KB Output is correct
6 Correct 1036 ms 116364 KB Output is correct
7 Correct 1071 ms 116276 KB Output is correct
8 Correct 1030 ms 116300 KB Output is correct
9 Correct 1022 ms 116392 KB Output is correct
10 Correct 34 ms 4812 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1193 ms 116432 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 360 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 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 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 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 316 KB Output is correct
16 Correct 1 ms 324 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 320 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 35 ms 4812 KB Output is correct
27 Correct 27 ms 4816 KB Output is correct
28 Correct 33 ms 4752 KB Output is correct
29 Correct 36 ms 4892 KB Output is correct
30 Correct 35 ms 4876 KB Output is correct
31 Correct 120 ms 9860 KB Output is correct
32 Correct 37 ms 4792 KB Output is correct
33 Correct 46 ms 4892 KB Output is correct
34 Correct 44 ms 4812 KB Output is correct
35 Correct 123 ms 9548 KB Output is correct
36 Correct 20 ms 4696 KB Output is correct
37 Correct 35 ms 4812 KB Output is correct
38 Correct 33 ms 4796 KB Output is correct
39 Correct 34 ms 4752 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 360 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 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 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 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 316 KB Output is correct
16 Correct 1 ms 324 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 320 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 320 KB Output is correct
30 Correct 1031 ms 116384 KB Output is correct
31 Correct 1036 ms 116364 KB Output is correct
32 Correct 1071 ms 116276 KB Output is correct
33 Correct 1030 ms 116300 KB Output is correct
34 Correct 1022 ms 116392 KB Output is correct
35 Correct 34 ms 4812 KB Output is correct
36 Correct 1 ms 316 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1193 ms 116432 KB Output is correct
39 Correct 35 ms 4812 KB Output is correct
40 Correct 27 ms 4816 KB Output is correct
41 Correct 33 ms 4752 KB Output is correct
42 Correct 36 ms 4892 KB Output is correct
43 Correct 35 ms 4876 KB Output is correct
44 Correct 120 ms 9860 KB Output is correct
45 Correct 37 ms 4792 KB Output is correct
46 Correct 46 ms 4892 KB Output is correct
47 Correct 44 ms 4812 KB Output is correct
48 Correct 123 ms 9548 KB Output is correct
49 Correct 20 ms 4696 KB Output is correct
50 Correct 35 ms 4812 KB Output is correct
51 Correct 33 ms 4796 KB Output is correct
52 Correct 34 ms 4752 KB Output is correct
53 Correct 1090 ms 113124 KB Output is correct
54 Correct 885 ms 113108 KB Output is correct
55 Correct 1200 ms 116480 KB Output is correct
56 Correct 1154 ms 116440 KB Output is correct
57 Correct 1139 ms 116352 KB Output is correct
58 Correct 1173 ms 116444 KB Output is correct
59 Correct 1093 ms 116276 KB Output is correct
60 Correct 1162 ms 116400 KB Output is correct
61 Correct 665 ms 109832 KB Output is correct
62 Correct 1198 ms 114948 KB Output is correct
63 Correct 1147 ms 113120 KB Output is correct
64 Correct 1126 ms 111596 KB Output is correct