結果

問題 No.824 Many Shifts Hard
ユーザー mcfx0mcfx0
提出日時 2019-06-28 18:54:56
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 227 ms / 2,000 ms
コード長 3,750 bytes
コンパイル時間 1,489 ms
コンパイル使用メモリ 160,192 KB
実行使用メモリ 58,624 KB
最終ジャッジ日時 2024-07-02 04:15:11
合計ジャッジ時間 3,934 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 10 ms
9,728 KB
testcase_03 AC 51 ms
26,624 KB
testcase_04 AC 60 ms
18,816 KB
testcase_05 AC 153 ms
48,768 KB
testcase_06 AC 7 ms
5,376 KB
testcase_07 AC 58 ms
11,648 KB
testcase_08 AC 99 ms
45,568 KB
testcase_09 AC 141 ms
34,048 KB
testcase_10 AC 19 ms
6,400 KB
testcase_11 AC 46 ms
10,752 KB
testcase_12 AC 74 ms
23,936 KB
testcase_13 AC 54 ms
41,856 KB
testcase_14 AC 79 ms
58,496 KB
testcase_15 AC 74 ms
53,888 KB
testcase_16 AC 11 ms
10,880 KB
testcase_17 AC 79 ms
58,112 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 80 ms
58,496 KB
testcase_20 AC 227 ms
58,496 KB
testcase_21 AC 3 ms
5,376 KB
testcase_22 AC 227 ms
58,624 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 __attribute__((always_inline))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)
#define fre(i,x)for(__typeof((x).rend())i=(x).rbegin();i!=(x).rend();++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 UC unsigned char
#define RX x=0;UC 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;UC 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;UC 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){UC 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;

int n,m,f[N][N][N];

int main()
{
	in,n,m;
	f[0][1][0]=1;
	fo0(i,m)fo1(j,i+1)fo0(k,j)
	{
		int v=f[i][j][k];
		//if(v)out,i,' ',j,' ',k,' ',v,'\n';
		f[i+1][j+1][k]=(f[i+1][j+1][k]+v)%P;
		if(k+1<j)f[i+1][j][k+1]=(f[i+1][j][k+1]+v)%P;
		f[i+1][j][k]=(f[i+1][j][k]+(ll)v*(!k?n-1:n-2))%P;
	}
	//fo1(j,m)out,f[m][j][j-1],' ';out,'\n';
	int ans=0;
	fo1(i,n)fo0(j,m)if(i+j<=n)ans=(ans+(ll)f[m][j+1][j]*i)%P;
	out,ans,'\n';
}
0