Submission #3009843


Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
 
#define mod 1000000007
int n,m,l,r,x,ans=0;
vector<pair<int,int> > v[305];
int f[305][305][305];
 
inline bool check(int r,int g,int b){
    int k=max(r,max(g,b));
    for(int i=0;i<v[k].size();i++){
        int cnt=0;
        int l=v[k][i].first,x=v[k][i].second;
        if(r>=l)cnt++;
        if(g>=l)cnt++;
        if(b>=l)cnt++;
        if(cnt!=x)return false;
    }
    return true;
}
 
inline void add(int &x,const int &y){
    x+=y;if(x>=mod)x-=mod;
}
 
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&l,&r,&x);
        v[r].push_back(make_pair(l,x));
    }
    f[0][0][0]=1;
    register int r,g,b;
    for(r=0;r<=n;r++)
    for(g=0;g<=n;g++)
    for(b=0;b<=n;b++){
        if(f[r][g][b]==0)continue;
        if(!check(r,g,b)){
            f[r][g][b]=0;
            continue;
        }
        int k=max(r,max(g,b));
        add(f[k+1][g][b],f[r][g][b]);
        add(f[r][k+1][b],f[r][g][b]);
        add(f[r][g][k+1],f[r][g][b]);
        if(k==n)add(ans,f[r][g][b]);
    }
    printf("%d",ans);
}

Submission Info

Submission Time
Task E - RGB Sequence
User luogu_bot1
Language C++ (GCC 5.4.1)
Score 800
Code Size 1172 Byte
Status AC
Exec Time 368 ms
Memory 110848 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
./Main.cpp:31:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&l,&r,&x);
                                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 4
AC × 47
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 2 ms 2432 KB
1_00.txt AC 50 ms 107136 KB
1_01.txt AC 44 ms 108928 KB
1_02.txt AC 44 ms 108928 KB
1_03.txt AC 42 ms 72064 KB
1_04.txt AC 55 ms 109184 KB
1_05.txt AC 45 ms 108928 KB
1_06.txt AC 44 ms 108928 KB
1_07.txt AC 26 ms 24960 KB
1_08.txt AC 51 ms 109696 KB
1_09.txt AC 45 ms 109312 KB
1_10.txt AC 51 ms 108416 KB
1_11.txt AC 24 ms 16896 KB
1_12.txt AC 47 ms 105856 KB
1_13.txt AC 46 ms 110336 KB
1_14.txt AC 52 ms 109568 KB
1_15.txt AC 47 ms 95232 KB
1_16.txt AC 57 ms 108928 KB
1_17.txt AC 45 ms 108928 KB
1_18.txt AC 47 ms 108928 KB
1_19.txt AC 35 ms 67968 KB
1_20.txt AC 51 ms 107136 KB
1_21.txt AC 45 ms 109184 KB
1_22.txt AC 54 ms 110336 KB
1_23.txt AC 50 ms 107008 KB
1_24.txt AC 51 ms 110464 KB
1_25.txt AC 45 ms 109184 KB
1_26.txt AC 47 ms 107520 KB
1_27.txt AC 30 ms 35712 KB
1_28.txt AC 48 ms 109056 KB
1_29.txt AC 44 ms 109056 KB
1_30.txt AC 47 ms 107264 KB
1_31.txt AC 45 ms 103040 KB
1_32.txt AC 47 ms 109824 KB
1_33.txt AC 44 ms 108928 KB
1_34.txt AC 47 ms 108032 KB
1_35.txt AC 47 ms 107520 KB
1_36.txt AC 42 ms 105600 KB
1_37.txt AC 43 ms 109312 KB
1_38.txt AC 47 ms 109184 KB
1_39.txt AC 37 ms 74624 KB
1_40.txt AC 368 ms 110848 KB
1_41.txt AC 56 ms 110848 KB
1_42.txt AC 43 ms 108928 KB