Submission #3425904

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define maxn 310
#define mod 1000000007
using namespace std;
typedef long long ll;
int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
    while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=getchar();}
    return x*f; 
}
int n,m;
struct P{
    int l,co;
};
vector<P> v[maxn];
ll f[maxn][maxn][maxn];
void add(ll &x,ll y)
{
    x=(x+y)%mod;
}
ll ans;
int main()
{
    n=read();m=read();
    for(int i=1;i<=m;i++)
    {
        int x=read(),y=read(),z=read();
        P tmp;
        tmp.l=x;tmp.co=z;
        v[y].push_back(tmp);
    }
    f[0][0][0]=1;
    for(int r=0;r<=n;r++)
    {
        for(int g=0;g<=n;g++)
        {
            for(int b=0;b<=n;b++)
            {
                if(f[r][g][b])
                {
                    int k=max(r,max(g,b));
                    ll &val=f[r][g][b];
                    for(int i=0;i<v[k].size();i++)
                    {
                        int cnt=0;
                        if(v[k][i].l<=r)  cnt++;
                        if(v[k][i].l<=g)  cnt++;
                        if(v[k][i].l<=b)  cnt++;
                        if(cnt!=v[k][i].co)  val=0;
                    }
                    if(k<n)
                    {
                        add(f[r][g][k+1],val);
                        add(f[r][k+1][b],val);
                        add(f[k+1][g][b],val);
                    }
                    else{
                        add(ans,val); 
                    }
                }
            }
        }
    }
    printf("%lld\n",ans);
    return 0;
}

Submission Info

Judge Result