Submission #1083796
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include <random>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("-1"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
#define bn(x) ((1<<x)-1)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const int MX = 2005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;
// Mod int
const int mod = 1000000007;
struct mint;
mint ex(mint a, ll t);
struct mint {
ll x;
mint():x(0){}
mint(ll x):x((x%mod+mod)%mod){}
// mint(ll x):x(x){}
mint& fix() { x = (x%mod+mod)%mod; return *this;}
mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
mint& operator/=(const mint& a){ (x*=ex(a,mod-2).x)%=mod; return *this;}
mint operator+(const mint& a)const{ return mint(*this) += a;}
mint operator-(const mint& a)const{ return mint(*this) -= a;}
mint operator*(const mint& a)const{ return mint(*this) *= a;}
mint operator/(const mint& a)const{ return mint(*this) /= a;}
bool operator<(const mint& a)const{ return x < a.x;}
bool operator==(const mint& a)const{ return x == a.x;}
};
istream& operator>>(istream&i,mint&a){i>>a.x;return i;}
ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;}
typedef vector<mint> vm;
mint ex(mint a, ll t) {
if(!t) return 1;
mint res = ex(a,t/2);
res *= res;
return (t&1)?res*a:res;
}
//
mint dp[MX][MX];
int main() {
int n, m;
scanf("%d%d",&n,&m); --m;
dp[0][0] = 1;
rep(i,m) {
vm s(n+1);
rep(j,n) s[j+1] = s[j]+dp[i][j];
rep(j,n-1-i) {
dp[i+1][j] = dp[i][j+1];
dp[i+1][j] += s[j+1];
}
}
mint ans;
rep(i,n) {
ans += dp[m][i];
}
rep(i,n-m-2) ans *= 2;
cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time
2017-01-28 22:14:44+0900
Task
F - Solitaire
User
snuke
Language
C++14 (GCC 5.4.1)
Score
1200
Code Size
3726 Byte
Status
AC
Exec Time
50 ms
Memory
31616 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:101:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m); --m;
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1200 / 1200
Status
Set Name
Test Cases
Sample
00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All
00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt
Case Name
Status
Exec Time
Memory
00_example_01.txt
AC
34 ms
31616 KB
00_example_02.txt
AC
34 ms
31616 KB
00_example_03.txt
AC
44 ms
31616 KB
01.txt
AC
34 ms
31616 KB
02.txt
AC
38 ms
31616 KB
03.txt
AC
34 ms
31616 KB
04.txt
AC
34 ms
31616 KB
05.txt
AC
34 ms
31616 KB
06.txt
AC
34 ms
31616 KB
07.txt
AC
34 ms
31616 KB
08.txt
AC
34 ms
31616 KB
09.txt
AC
48 ms
31616 KB
10.txt
AC
33 ms
31616 KB
11.txt
AC
33 ms
31616 KB
12.txt
AC
48 ms
31616 KB
13.txt
AC
34 ms
31616 KB
14.txt
AC
41 ms
31616 KB
15.txt
AC
35 ms
31616 KB
16.txt
AC
41 ms
31616 KB
17.txt
AC
40 ms
31616 KB
18.txt
AC
45 ms
31616 KB
19.txt
AC
45 ms
31616 KB
20.txt
AC
39 ms
31616 KB
21.txt
AC
34 ms
31616 KB
22.txt
AC
50 ms
31616 KB
23.txt
AC
33 ms
31616 KB