Submission #837283
Source Code Expand
Copy
// {{{ by shik
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define FOR(it,c) for ( auto it=(c).begin(); it!=(c).end(); it++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#ifdef SHIK
template<typename T>
void _dump( const char* s, T&& head ) { cerr<<s<<"="<<head<<endl; }
template<typename T, typename... Args>
void _dump( const char* s, T&& head, Args&&... tail ) {
int c=0;
while ( *s!=',' || c!=0 ) {
if ( *s=='(' || *s=='[' || *s=='{' ) c++;
if ( *s==')' || *s==']' || *s=='}' ) c--;
cerr<<*s++;
}
cerr<<"="<<head<<", ";
_dump(s+1,tail...);
}
#define dump(...) do { \
fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); \
_dump(#__VA_ARGS__, __VA_ARGS__); \
} while (0)
template<typename Iter>
ostream& _out( ostream &s, Iter b, Iter e ) {
s<<"[";
for ( auto it=b; it!=e; it++ ) s<<(it==b?"":" ")<<*it;
s<<"]";
return s;
}
template<typename A, typename B>
ostream& operator <<( ostream &s, const pair<A,B> &p ) { return s<<"("<<p.first<<","<<p.second<<")"; }
template<typename T>
ostream& operator <<( ostream &s, const vector<T> &c ) { return _out(s,ALL(c)); }
template<typename T, size_t N>
ostream& operator <<( ostream &s, const array<T,N> &c ) { return _out(s,ALL(c)); }
template<typename T>
ostream& operator <<( ostream &s, const set<T> &c ) { return _out(s,ALL(c)); }
template<typename A, typename B>
ostream& operator <<( ostream &s, const map<A,B> &c ) { return _out(s,ALL(c)); }
#else
#define dump(...)
#endif
template<typename T>
void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( long long &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }
void R() {}
template<typename T, typename... U>
void R( T& head, U&... tail ) {
_R(head);
R(tail...);
}
template<typename T>
void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
template<typename T>
void _W( const vector<T> &x ) {
for ( auto i=x.cbegin(); i!=x.cend(); i++ ) {
if ( i!=x.cbegin() ) putchar(' ');
_W(*i);
}
}
void W() {}
template<typename T, typename... U>
void W( const T& head, const U&... tail ) {
_W(head);
putchar(sizeof...(tail)?' ':'\n');
W(tail...);
}
#ifdef SHIK
#define FILEIO(...)
#else
#define FILEIO(name) do {\
freopen(name ".in","r",stdin); \
freopen(name ".out","w",stdout); \
} while (0)
#endif
// }}}
const int N=410;
const LL MOD=1e9+7;
int n,a[N],b[N],c;
LL dp[2][N];
int main() {
R(n,c);
REP(i,n) R(a[i]);
REP(i,n) R(b[i]);
dp[0][0]=1;
int u=0;
REP(i,n) {
memset(dp[u^1],0,sizeof(dp[u^1]));
REP(j,c+1) {
LL me=dp[u][j]%MOD;
if ( !me ) continue;
LL x=1;
REP1(k,0,c-j) {
dp[u^1][j+k]+=me*x%MOD;
x=x*a[i]%MOD;
}
}
u^=1;
}
int ans=dp[u][c]%MOD;
W(ans);
return 0;
}
Submission Info
Submission Time
2016-08-13 21:35:45+0900
Task
E - Children and Candies
User
shik
Language
C++14 (GCC 5.4.1)
Score
400
Code Size
3398 Byte
Status
WA
Exec Time
346 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘void _R(long long int&)’:
./Main.cpp:62:46: warning: format ‘%ld’ expects argument of type ‘long int*’, but argument 2 has type ‘long long int*’ [-Wformat=]
void _R( long long &x ) { scanf("%" PRId64,&x); }
^
./Main.cpp: In function ‘void _R(int&)’:
./Main.cpp:61:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
void _R( int &x ) { scanf("%d",&x); }
^
./Main.cpp: In function ‘void _R(long long int&)’:
./Main.cpp:62:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
void _R( long long &x ) { scanf("%" PRId64,&x); }
^
./Main.cpp: In function ‘void _R(double&)’:
./Main.cpp:63:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-resu...
Judge Result
Set Name
Sample
Subtask
All
Score / Max Score
0 / 0
400 / 400
0 / 400
Status
Set Name
Test Cases
Sample
0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt
Subtask
0_001, 0_003, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt
All
0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 2_017.txt, 2_018.txt, 2_019.txt, 2_020.txt, 2_021.txt, 2_022.txt, 2_023.txt, 2_024.txt, 2_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt
Case Name
Status
Exec Time
Memory
0_000.txt
WA
6 ms
256 KB
0_001.txt
AC
4 ms
256 KB
0_002.txt
WA
4 ms
256 KB
0_003.txt
AC
4 ms
256 KB
0_004.txt
WA
4 ms
256 KB
1_005.txt
AC
4 ms
256 KB
1_006.txt
AC
4 ms
256 KB
1_007.txt
AC
4 ms
256 KB
1_008.txt
AC
5 ms
256 KB
1_009.txt
AC
4 ms
256 KB
1_010.txt
AC
4 ms
256 KB
1_011.txt
AC
5 ms
256 KB
1_012.txt
AC
5 ms
256 KB
1_013.txt
AC
4 ms
256 KB
1_014.txt
AC
340 ms
256 KB
1_015.txt
AC
343 ms
256 KB
1_016.txt
AC
343 ms
256 KB
2_017.txt
WA
4 ms
256 KB
2_018.txt
WA
4 ms
256 KB
2_019.txt
WA
4 ms
256 KB
2_020.txt
WA
4 ms
256 KB
2_021.txt
WA
5 ms
256 KB
2_022.txt
WA
4 ms
256 KB
2_023.txt
WA
346 ms
256 KB
2_024.txt
WA
345 ms
256 KB
2_025.txt
WA
57 ms
256 KB
2_026.txt
WA
5 ms
256 KB
2_027.txt
WA
270 ms
256 KB
2_028.txt
WA
9 ms
256 KB
2_029.txt
WA
5 ms
256 KB