oj.uz

Submission #908779

# Submission time Handle Problem Language Result Execution time Memory
908779 2024-01-16T20:35:10 Z Ahmed57 Misspelling (JOI22_misspelling) C++17
100 / 100
 945 ms 156676 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
long long mod = 1000000007;
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("outout.txt","w",stdout);
    int n,m;
    cin>>n>>m;
    vector<pair<int,int>> rng[n+1];
    for(int i = 0;i<m;i++){
        int a,b;cin>>a>>b;
        a--;b--;
        if(a<b){
            rng[a+1].push_back({b+1,0});
        }else{
            rng[b+1].push_back({a+1,1});
        }
    }
    int dp[n+1][26];
    memset(dp,0,sizeof dp);
    long long lol1[26] = {0},lol2[26] = {0};
    for(int i = 0;i<26;i++)dp[n][i] = 1;
    set<int> s1,s2;
    s1.insert(n);
    s2.insert(n);
    for(int i = 0;i<26;i++){
        lol1[i]+=dp[n][i];
        lol2[i]+=dp[n][i];
    }
    for(int i = n-1;i>=0;i--){
        for(auto j:rng[i]){
            if(j.second==0){
                while(!s1.empty()&&(*s1.begin())<=j.first){
                    for(int e =0;e<26;e++){
                        lol1[e]-=dp[(*s1.begin())][e];
                        lol1[e]%=mod;lol1[e]+=mod;lol1[e]%=mod;
                    }
                    s1.erase(s1.begin());
                }
            }else{
                while(!s2.empty()&&(*s2.begin())<=j.first){
                    for(int e =0;e<26;e++){
                        lol2[e]-=dp[(*s2.begin())][e];
                        lol2[e]%=mod;lol2[e]+=mod;lol2[e]%=mod;
                    }
                    s2.erase(s2.begin());
                }
            }
        }
        long long nah =0;
        for(int j = 0;j<26;j++){
            dp[i][j]+=nah;dp[i][j]%=mod;
            nah+=lol1[j];nah%=mod;
        }
        nah = 0;
        for(int j = 25;j>=0;j--){
            dp[i][j]+=nah;dp[i][j]%=mod;
            nah+=lol2[j];nah%=mod;
        }
        s1.insert(i);
        s2.insert(i);
        for(int j = 0;j<26;j++){
            dp[i][j]++;dp[i][j]%=mod;
            lol1[j]+=dp[i][j];lol1[j]%=mod;
            lol2[j]+=dp[i][j];lol2[j]%=mod;
        }
    }
    long long nah = 0;
    for(int i = 0;i<26;i++){
        nah+=dp[1][i];
        nah%=mod;
    }
    cout<<nah<<endl;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 791 ms 136224 KB Output is correct
6 Correct 783 ms 136276 KB Output is correct
7 Correct 811 ms 136228 KB Output is correct
8 Correct 797 ms 136212 KB Output is correct
9 Correct 789 ms 136224 KB Output is correct
10 Correct 31 ms 5720 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 868 ms 133736 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 504 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 34 ms 5724 KB Output is correct
27 Correct 27 ms 6224 KB Output is correct
28 Correct 27 ms 6292 KB Output is correct
29 Correct 34 ms 5724 KB Output is correct
30 Correct 33 ms 5720 KB Output is correct
31 Correct 115 ms 22608 KB Output is correct
32 Correct 31 ms 5720 KB Output is correct
33 Correct 31 ms 5724 KB Output is correct
34 Correct 32 ms 5724 KB Output is correct
35 Correct 116 ms 23824 KB Output is correct
36 Correct 27 ms 6688 KB Output is correct
37 Correct 31 ms 5468 KB Output is correct
38 Correct 30 ms 5208 KB Output is correct
39 Correct 30 ms 5208 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 504 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 456 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 791 ms 136224 KB Output is correct
31 Correct 783 ms 136276 KB Output is correct
32 Correct 811 ms 136228 KB Output is correct
33 Correct 797 ms 136212 KB Output is correct
34 Correct 789 ms 136224 KB Output is correct
35 Correct 31 ms 5720 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 868 ms 133736 KB Output is correct
39 Correct 34 ms 5724 KB Output is correct
40 Correct 27 ms 6224 KB Output is correct
41 Correct 27 ms 6292 KB Output is correct
42 Correct 34 ms 5724 KB Output is correct
43 Correct 33 ms 5720 KB Output is correct
44 Correct 115 ms 22608 KB Output is correct
45 Correct 31 ms 5720 KB Output is correct
46 Correct 31 ms 5724 KB Output is correct
47 Correct 32 ms 5724 KB Output is correct
48 Correct 116 ms 23824 KB Output is correct
49 Correct 27 ms 6688 KB Output is correct
50 Correct 31 ms 5468 KB Output is correct
51 Correct 30 ms 5208 KB Output is correct
52 Correct 30 ms 5208 KB Output is correct
53 Correct 788 ms 127496 KB Output is correct
54 Correct 713 ms 148496 KB Output is correct
55 Correct 915 ms 137440 KB Output is correct
56 Correct 945 ms 137296 KB Output is correct
57 Correct 791 ms 136216 KB Output is correct
58 Correct 790 ms 136404 KB Output is correct
59 Correct 794 ms 136216 KB Output is correct
60 Correct 931 ms 133716 KB Output is correct
61 Correct 807 ms 156676 KB Output is correct
62 Correct 858 ms 128980 KB Output is correct
63 Correct 811 ms 124396 KB Output is correct
64 Correct 799 ms 119636 KB Output is correct