Submission #1868440


Source Code Expand

#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=305,P=1000000007;

std::vector<pii>p[N];
int n,m,f[N][N][N];

int main()
{
	in,n,m;
	fo1(i,m)
	{
		int l,r,x;
		in,l,r,x;
		p[r].pb(mp(l,x));
	}
	f[0][0][0]=1;
	int ans=0;
	fo(i,0,n)fo(j,0,n)fo(k,0,n)
	{
		int t=max(max(i,j),k);
		foe(l,p[t])
		{
			if((i>=l->xx)+(j>=l->xx)+(k>=l->xx)!=l->yy)f[i][j][k]=0;
		}
		if(t!=n)
			(f[t+1][j][k]+=f[i][j][k])%=P,
			(f[i][t+1][k]+=f[i][j][k])%=P,
			(f[i][j][t+1]+=f[i][j][k])%=P;
		else (ans+=f[i][j][k])%=P;
	}
	out,ans,'\n';
}

Submission Info

Submission Time
Task E - RGB Sequence
User mcfx
Language C++14 (GCC 5.4.1)
Score 800
Code Size 3743 Byte
Status AC
Exec Time 370 ms
Memory 110848 KB

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 1 ms 2432 KB
1_00.txt AC 351 ms 108800 KB
1_01.txt AC 326 ms 110848 KB
1_02.txt AC 327 ms 110848 KB
1_03.txt AC 362 ms 110848 KB
1_04.txt AC 366 ms 110848 KB
1_05.txt AC 324 ms 108800 KB
1_06.txt AC 324 ms 110848 KB
1_07.txt AC 326 ms 108800 KB
1_08.txt AC 357 ms 108800 KB
1_09.txt AC 332 ms 110848 KB
1_10.txt AC 311 ms 108800 KB
1_11.txt AC 319 ms 108800 KB
1_12.txt AC 341 ms 106624 KB
1_13.txt AC 336 ms 110848 KB
1_14.txt AC 319 ms 108800 KB
1_15.txt AC 369 ms 110848 KB
1_16.txt AC 362 ms 110848 KB
1_17.txt AC 335 ms 110848 KB
1_18.txt AC 313 ms 108800 KB
1_19.txt AC 317 ms 108800 KB
1_20.txt AC 352 ms 108800 KB
1_21.txt AC 334 ms 110848 KB
1_22.txt AC 323 ms 110848 KB
1_23.txt AC 363 ms 110848 KB
1_24.txt AC 370 ms 110848 KB
1_25.txt AC 333 ms 110848 KB
1_26.txt AC 299 ms 106752 KB
1_27.txt AC 316 ms 110848 KB
1_28.txt AC 361 ms 110848 KB
1_29.txt AC 330 ms 110848 KB
1_30.txt AC 315 ms 108800 KB
1_31.txt AC 346 ms 108800 KB
1_32.txt AC 368 ms 110848 KB
1_33.txt AC 329 ms 110848 KB
1_34.txt AC 313 ms 108800 KB
1_35.txt AC 318 ms 108800 KB
1_36.txt AC 331 ms 106624 KB
1_37.txt AC 324 ms 108800 KB
1_38.txt AC 327 ms 110848 KB
1_39.txt AC 335 ms 110848 KB
1_40.txt AC 328 ms 110848 KB
1_41.txt AC 333 ms 110848 KB
1_42.txt AC 333 ms 110848 KB