Submission #1001017


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>
#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("0"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
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 = 5005, 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;
}
struct comb {
  vm f, g;
  comb(){}
  comb(int mx):f(mx+1),g(mx+1) {
    f[0] = 1;
    rrep(i,mx) f[i] = f[i-1]*i;
    g[mx] = ex(f[mx],mod-2);
    for(int i=mx;i>0;i--) g[i-1] = g[i]*i;
  }
  mint c(int a, int b) {
    if (a < b) return 0;
    return f[a]*g[b]*g[a-b];
  }
};
//


int main() {
  int n;
  scanf("%d",&n);
  int a,b,o;
  scanf("%d%d%d",&o,&b,&a);
  if (b&1) dame;
  b /= 2;
  mint ans;
  comb c(MX*10);
  rep(i,a/3+1)rep(j,a-i*3+1) {
    if (i*3+j > a) continue;
    if (!b && j) continue;
    mint now = 1;
    if (b) now *= c.c(j+b-1,b-1);
    now *= c.c(i+b,i);
    int s = i+b;
    int k = a-i*3-j;
    int l = o-k;
    if (l < 0) continue;
    now *= c.c(s+k,s);
    now *= c.c(s+k+l,l);
    // if (now.x) cout<<i<<" "<<j<<" "<<s<<" "<<k<<" "<<l<<" "<<now<<endl;
    ans += now;
  }
  cout<<ans<<endl;
  return 0;
}





























Submission Info

Submission Time
Task J - 123 Pairs
User snuke
Language C++14 (GCC 5.4.1)
Score 1500
Code Size 4183 Byte
Status AC
Exec Time 50 ms
Memory 1152 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:111:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:113:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&o,&b,&a);
                           ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1500 / 1500
Status
AC × 2
AC × 52
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 16 ms 1024 KB
001.txt AC 50 ms 1024 KB
002.txt AC 4 ms 1024 KB
003.txt AC 4 ms 1024 KB
004.txt AC 50 ms 1024 KB
005.txt AC 4 ms 1024 KB
006.txt AC 4 ms 1024 KB
007.txt AC 10 ms 1024 KB
008.txt AC 4 ms 1024 KB
009.txt AC 4 ms 1024 KB
010.txt AC 4 ms 1024 KB
011.txt AC 4 ms 1024 KB
012.txt AC 10 ms 1024 KB
013.txt AC 4 ms 1024 KB
014.txt AC 4 ms 1024 KB
015.txt AC 27 ms 1024 KB
016.txt AC 7 ms 1024 KB
017.txt AC 9 ms 1024 KB
018.txt AC 5 ms 1024 KB
019.txt AC 14 ms 1024 KB
020.txt AC 6 ms 1024 KB
021.txt AC 28 ms 1024 KB
022.txt AC 6 ms 1024 KB
023.txt AC 8 ms 1024 KB
024.txt AC 33 ms 1024 KB
025.txt AC 7 ms 1024 KB
026.txt AC 14 ms 1152 KB
027.txt AC 20 ms 1024 KB
028.txt AC 10 ms 1024 KB
029.txt AC 12 ms 1024 KB
030.txt AC 46 ms 1024 KB
031.txt AC 24 ms 1024 KB
032.txt AC 5 ms 1024 KB
033.txt AC 3 ms 256 KB
034.txt AC 24 ms 1024 KB
035.txt AC 13 ms 1024 KB
036.txt AC 6 ms 1024 KB
037.txt AC 4 ms 1024 KB
038.txt AC 43 ms 1024 KB
039.txt AC 3 ms 256 KB
040.txt AC 3 ms 256 KB
041.txt AC 34 ms 1024 KB
042.txt AC 4 ms 1024 KB
043.txt AC 4 ms 1024 KB
044.txt AC 4 ms 1024 KB
045.txt AC 4 ms 1024 KB
046.txt AC 4 ms 1024 KB
047.txt AC 4 ms 1024 KB
048.txt AC 4 ms 1024 KB
049.txt AC 4 ms 1024 KB
example0.txt AC 4 ms 1152 KB
example1.txt AC 4 ms 1024 KB