Submission #567277

#	Time	Username	Problem	Language	Result	Execution time	Memory
567277		zaneyu	Misspelling (JOI22_misspelling)	C++14	28 / 100	410 ms	8460 KiB

misspelling

/*input
3 2
1 3
3 2
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=200+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int dp[maxn][maxn][26];
int r1[maxn],r2[maxn];
int main(){
    int n,m;
    cin>>n>>m;
    REP(i,m){
        int a,b;
        cin>>a>>b;
        if(a<b){
            MXTO(r1[a],b);
        }
        else{
            MXTO(r2[b],a);
        }
    }
    REP(j,26) dp[1][1][j]=1;
    for(int i=2;i<=n;i++){
        int a=0,b=0;
        for(int j=i-1;j>=1;j--){
            MXTO(a,r1[j]);
            MXTO(b,r2[j]);
            REP(z,26){
                dp[i][j][z]+=dp[i-1][j][z];
                dp[i][j][z]%=MOD;
                REP(x,26){
                    if(x==z) continue;
                    if(a>=i and z<x) continue;
                    if(b>=i and z>x) continue;
                    dp[i][i][x]+=dp[i-1][j][z];
                    dp[i][i][x]%=MOD;
                }
            }
        }
    }
    int ans=0;
    REP1(i,n) REP(j,26) ans+=dp[n][i][j],ans%=MOD;
    cout<<ans<<'\n';
} 

• Subtask 1: 8 / 8
• Subtask 2: 20 / 20
• Subtask 3: 0 / 29
• Subtask 4: 0 / 32
• Subtask 5: 0 / 11