Contest Duration: - (local time) (100 minutes) Back to Home

Submission #13815410

Source Code Expand

Copy
#include <bits/stdc++.h>
//    #include <boost/multiprecision/cpp_int.hpp>
#define int  long long
#define inf  1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define PI 3.14159265358979323846
#define  mp make_pair
#define  pb push_back
#define EPS (1e-8)

int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
using namespace std;
class pa3{
public:
int x;
int y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}

};

class pa4{
public:
int x;
int y,z,w;
pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}

};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}

};

string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}

int Gcd(int v,int b){
if(v==0) return b;
if(b==0) return v;
if(v>b) return Gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return Gcd(v,b%v);
}

int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
pa operator+(const pa & l,const pa & r) {
return {l.first+r.first,l.second+r.second};
}
pa operator-(const pa & l,const pa & r) {
return {l.first-r.first,l.second-r.second};
}
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
wa%=warukazu;
if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
ll zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}

int pr[1000100];
int inv[1000110];

int comb(int nn,int rr){
if(rr<0 || rr>nn || nn<0) return 0;
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}

void gya(int ert){
pr[0]=1;
for(int i=1;i<=ert;i++){
pr[i]=((ll)pr[i-1]*i)%mod;
}
inv[ert]=beki(pr[ert],mod-2,mod);
for(int i=ert-1;i>=0;i--){
inv[i]=(ll)inv[i+1]*(i+1)%mod;
}
}

//   cin.tie(0);
//	ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//   mt19937(clock_per_sec);

int dp[3010][3010]={};
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
mod=998244353;

int n,s;
cin>>n>>s;
dp[0][0]=1;
for(int i=0;i<n;i++){
int t;
cin>>t;
for(int j=0;j<=s;j++){
dp[i+1][j]+=2*dp[i][j];
dp[i+1][j]%=mod;
if(j+t<=s){
dp[i+1][j+t]+=dp[i][j];
dp[i+1][j+t]%=mod;
}
}
}
cout<<dp[n][s]<<endl;
return 0;
}

#### Submission Info

Submission Time 2020-05-31 21:19:59+0900 F - Knapsack for All Subsets smiken C++ (GCC 9.2.1) 600 8459 Byte AC 187 ms 74208 KB

#### Judge Result

Set Name sample All
Score / Max Score 0 / 0 600 / 600
Status
 AC × 3
 AC × 27
Set Name Test Cases
sample sample01, sample02, sample03
All 11, 12, 13, 14, 15, 21, 22, 23, 24, 25, 31, 32, 33, 34, 35, 41, 42, 43, 44, 45, 51, 52, 53, 54, sample01, sample02, sample03
Case Name Status Exec Time Memory
11 AC 2 ms 3760 KB
12 AC 4 ms 4196 KB
13 AC 3 ms 4532 KB
14 AC 2 ms 3772 KB
15 AC 2 ms 3664 KB
21 AC 19 ms 16452 KB
22 AC 82 ms 39416 KB
23 AC 62 ms 35408 KB
24 AC 84 ms 49452 KB
25 AC 17 ms 10808 KB
31 AC 84 ms 40904 KB
32 AC 111 ms 49872 KB
33 AC 107 ms 47368 KB
34 AC 105 ms 48624 KB
35 AC 108 ms 48640 KB
41 AC 185 ms 74120 KB
42 AC 183 ms 74108 KB
43 AC 187 ms 74056 KB
44 AC 183 ms 74148 KB
45 AC 185 ms 74208 KB
51 AC 1 ms 3480 KB
52 AC 1 ms 3596 KB
53 AC 17 ms 15648 KB
54 AC 15 ms 15648 KB
sample01 AC 2 ms 3616 KB
sample02 AC 2 ms 3516 KB
sample03 AC 2 ms 3660 KB