Submission #1087379


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define X first
#define Y second
#define REP(i,a) for(int i=0;i<a;++i)
#define REPP(i,a,b) for(int i=a;i<b;++i)
#define FILL(a,x) memset(a,x,sizeof(a))
#define foreach( gg,itit )  for( typeof(gg.begin()) itit=gg.begin();itit!=gg.end();itit++ )
#define mp make_pair
#define pb push_back
#define all(s) s.begin(),s.end()
#define present(c,x) ((c).find(x) != (c).end())
const double EPS = 1e-8;
const int mod = 1e9+7;
const int N = 1e6+10;
const ll INF = 1e18;

//#define DEBUG
ll power(ll x,ll y){
  ll t=1;
  while(y>0){
    if(y%2) y-=1,t=t*x%mod;
    else y/=2,x=x*x%mod;
  }
  return t;
}
#ifdef DEBUG
#define dprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#else
#define dprintf(fmt,...)
#endif

ll nck[5005][5005],dp[5005],fac[5005],inv[5005];
int main(){
  int n,a,b,c; scanf("%d%d%d%d",&n,&a,&b,&c);
  if(b%2==1){
    //assert(0);
    printf("0\n"); exit(0);
  }
  nck[0][0]=1;
  fac[0]=1;
  inv[0]=1;
  REPP(i,1,n+1){
    
    nck[i][0]=1;

    REPP(j,1,i+1) nck[i][j]=(nck[i-1][j]+nck[i-1][j-1])%mod;
  }
  b/=2;
  ll ans=0;
  REP(i,c+1){
    REP(j,i+1)if(i-j<=a){
      if(b||j) dp[i]+=nck[b+j-1][j]*nck[a][i-j]%mod*nck[b+a][a]%mod;
    }
    dp[i]%=mod;
    //printf("%d %lld\n",i,dp[i]);
    if((c-i)%3==0){
      ans+=dp[i]*nck[a+b+(c-i)/3][a+b]%mod;
    }
  }
  printf("%lld\n",ans%mod);
  return 0;
}

Submission Info

Submission Time
Task J - 123 Pairs
User alecsyde
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1531 Byte
Status WA
Exec Time 181 ms
Memory 116992 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 2
AC × 47
WA × 5
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 162 ms 116864 KB
001.txt AC 158 ms 116992 KB
002.txt AC 149 ms 116992 KB
003.txt AC 151 ms 116992 KB
004.txt AC 158 ms 116992 KB
005.txt AC 149 ms 116992 KB
006.txt AC 148 ms 116992 KB
007.txt WA 157 ms 116992 KB
008.txt AC 149 ms 116992 KB
009.txt AC 149 ms 116992 KB
010.txt WA 147 ms 115840 KB
011.txt AC 145 ms 113920 KB
012.txt WA 156 ms 115584 KB
013.txt AC 8 ms 5248 KB
014.txt AC 8 ms 5376 KB
015.txt AC 157 ms 104448 KB
016.txt AC 24 ms 16128 KB
017.txt AC 66 ms 45824 KB
018.txt AC 21 ms 14208 KB
019.txt AC 87 ms 57728 KB
020.txt AC 87 ms 64640 KB
021.txt AC 166 ms 114432 KB
022.txt AC 119 ms 91776 KB
023.txt AC 153 ms 116992 KB
024.txt AC 170 ms 116992 KB
025.txt AC 153 ms 116992 KB
026.txt AC 161 ms 116992 KB
027.txt AC 169 ms 116992 KB
028.txt AC 156 ms 116992 KB
029.txt AC 158 ms 116992 KB
030.txt AC 167 ms 116992 KB
031.txt AC 171 ms 116992 KB
032.txt AC 151 ms 116992 KB
033.txt AC 3 ms 256 KB
034.txt AC 86 ms 59008 KB
035.txt AC 132 ms 94720 KB
036.txt AC 77 ms 56960 KB
037.txt AC 3 ms 640 KB
038.txt AC 181 ms 116992 KB
039.txt AC 3 ms 256 KB
040.txt AC 3 ms 256 KB
041.txt AC 157 ms 116992 KB
042.txt AC 149 ms 116992 KB
043.txt AC 3 ms 256 KB
044.txt AC 2 ms 256 KB
045.txt AC 2 ms 256 KB
046.txt WA 2 ms 256 KB
047.txt WA 2 ms 256 KB
048.txt AC 2 ms 256 KB
049.txt AC 3 ms 256 KB
example0.txt AC 3 ms 256 KB
example1.txt AC 7 ms 4096 KB