Submission #3455194
Source Code Expand
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
prayer
*/
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) rep(i,v.size())cout<<" "<<v[i];cout<<endl<<endl;
#define show2d(v) rep(i,v.size()){rep(j,v[i].size())cout<<" "<<v[i][j];cout<<endl;}cout<<endl;
using namespace std;
//kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
// #define mt make_tuple
// typedef tuple<int,int,int> tp;
// typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int MOD=1000000007;
int f(int n,int m){
vi dp(n,1);
rep(i,m){
rep(j,n-1)(dp[j]+=dp[j+1])%=MOD;
dp[n-1]=0;
rep(j,n-1)(dp[n-1-j]+=dp[n-2-j])%=MOD;
}
int sum=0;
rep(i,n)(sum+=dp[i]);
return sum;
}
signed main(){
int n,m;
cin>>n>>m;
cout<<(MOD+f(n+1,m)-f(n,m))%MOD<<endl;
}
Submission Info
Submission Time |
|
Task |
D - Piling Up |
User |
ixmel_rd |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2734 Byte |
Status |
WA |
Exec Time |
371 ms |
Memory |
384 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 900 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
2 ms |
384 KB |
sample_03.txt |
AC |
124 ms |
256 KB |
subtask_1_01.txt |
AC |
61 ms |
256 KB |
subtask_1_02.txt |
AC |
22 ms |
256 KB |
subtask_1_03.txt |
AC |
96 ms |
256 KB |
subtask_1_04.txt |
WA |
98 ms |
256 KB |
subtask_1_05.txt |
AC |
263 ms |
256 KB |
subtask_1_06.txt |
WA |
97 ms |
256 KB |
subtask_1_07.txt |
WA |
113 ms |
256 KB |
subtask_1_08.txt |
WA |
35 ms |
256 KB |
subtask_1_09.txt |
AC |
239 ms |
256 KB |
subtask_1_10.txt |
AC |
371 ms |
256 KB |
subtask_1_11.txt |
WA |
98 ms |
256 KB |
subtask_1_12.txt |
AC |
66 ms |
256 KB |
subtask_1_13.txt |
WA |
85 ms |
256 KB |
subtask_1_14.txt |
WA |
37 ms |
256 KB |
subtask_1_15.txt |
WA |
34 ms |
256 KB |
subtask_1_16.txt |
AC |
117 ms |
256 KB |
subtask_1_17.txt |
WA |
37 ms |
256 KB |
subtask_1_18.txt |
WA |
52 ms |
256 KB |
subtask_1_19.txt |
AC |
45 ms |
256 KB |
subtask_1_20.txt |
AC |
124 ms |
256 KB |
subtask_1_21.txt |
AC |
1 ms |
256 KB |
subtask_1_22.txt |
AC |
1 ms |
256 KB |
subtask_1_23.txt |
AC |
1 ms |
256 KB |
subtask_1_24.txt |
AC |
1 ms |
256 KB |
subtask_1_25.txt |
AC |
1 ms |
256 KB |
subtask_1_26.txt |
AC |
1 ms |
256 KB |
subtask_1_27.txt |
AC |
1 ms |
256 KB |