제출 #908779

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
908779		Ahmed57	Misspelling (JOI22_misspelling)	C++17	100 / 100	945 ms	156676 KiB

misspelling

#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 / 8
• Subtask 2: 20 / 20
• Subtask 3: 29 / 29
• Subtask 4: 32 / 32
• Subtask 5: 11 / 11