Submission #35890659

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);
#define mem(a,v) memset(a,v,sizeof(a))
const int xd[4]={1,0,-1,0},yd[4]={0,1,0,-1};
bool dx[20003]={0},dy[20003]={0};
int main(){
    faster
    int n;
    cin>>n;
    int x,y,xx=0,yy=0;
    cin>>x>>y;
    vector<int> vx,vy;
    for(int i=1;i<=n;i++){
        int a;
        cin>>a;
        if(i&1){
            if(i==1){
                dx[0]=1;
                xx+=a;
                continue;
            }
            vx.pb(a),xx+=a;
        }
        else vy.pb(a),yy+=a;
    }
    //cout<<"xx="<<xx<<" yy="<<yy<<"\n";
    xx-=x;
    yy-=y;
    if(xx<0||yy<0||xx&1||yy&1){
        cout<<"No\n";
        return 0;
    }
    xx/=2;
    yy/=2;
    dy[0]=1;
    //cout<<sz(vx)<<"hi\n";
    for(int i=0;i<sz(vx);i++){
        //cout<<"hi\n";
        for(int j=20000;j-vx[i]>=0;j--){
            if(dx[j-vx[i]])
                dx[j]=1;
        }
    }
    for(int i=0;i<sz(vy);i++){
        for(int j=20000;j-vy[i]>=0;j--){
            if(dy[j-vy[i]])
                dy[j]=1;
        }
    }
    if(dx[xx]&&dy[yy])
        cout<<"Yes\n";
    else cout<<"No\n";
}

Submission Info

Judge Result