提出 #58033519

ソースコード 拡げる

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n)  for(int i=0;i<(n);++i)
#define sizc(x) ((int)x.size())
#define allc(x) x.begin(),x.end()
#define fir first
#define sec second
using Z=modint998244353;
constexpr int N = 305;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n)  for(int i=0;i<(n);++i)
#define sizc(x) ((int)x.size())
#define allc(x) x.begin(),x.end()
#define fir first
#define sec second

using Z=modint998244353;

constexpr int N = 305;

int n,a[N];

Z f[N];

int s[N][N];

int qry(int l1,int r1,int l2,int r2){
    return s[r1][r2]-s[r1][l2-1]-s[l1-1][r2]+s[l1-1][l2-1];
}

signed main(){
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin>>n;
    rep(i,1,n){
        int x;cin>>x;
        cin>>a[x];
    }
    a[0]=n+1,f[0]=1;
    rep(i,0,n+1){
        if(i)rep(j,0,n+1)s[i][j]=s[i-1][j];
        rep(j,a[i],n+1)++s[i][j];
    }
    rep(i,1,n+1){
        rep(j,0,i-1)if(a[j]>a[i]){
            bool gg=0;
            rep(k,j+1,i-1)if(a[k]<a[j]&&a[k]>a[i]){
                bool flg=0;
                if(qry(j+1,k-1,a[i]+1,a[k]-1))flg=1;
                if(qry(k+1,i-1,a[k]+1,a[j]-1))flg=1;
                if(!flg){gg=1;break;}
            }
            if(!gg)f[i]+=f[j];
        }
    }
    cout<<f[n+1].val()<<'\n';
}

提出情報

ジャッジ結果