Submission #1277976

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277976		turali12	Bank (IZhO14_bank)	C++20	0 / 100	1 ms	572 KiB

bank

#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define pb push_back
#define rall(x) x.rbegin(),x.rend()
const int N=1e6+1,mod=998244353,MOD=1e9+7,INF=9223372036854775807;
/*bool lex(const string &a,const string &b){
    if(a.size()!=b.size())
        return a.size()<b.size();
    return a<b;
}*/
/*bool cmp(const pair<int,int>&a,const pair<int,int>&b){
    if(a.first!=b.first){
        return a.first<b.first;
    }
    return a.second<b.second;
}*/
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int testcasescount=1;
    //cin>>testcasescount;
    while(testcasescount--){
        int n,m,x;
        cin>>n>>m>>x;
        vector<int>a(m);
        for(int i=0;i<m;i++){
            cin>>a[i];
        }
        vector<bool>dp(x+1);
        dp[0]=true;
        for(int i=0;i<m;i++){
            for(int j=a[i];j<=x;j++){
                dp[j]=dp[j-a[i]];
            }
        }
        if(!dp[x]){
            cout<<"NO";
        }
        else{
            cout<<"YES";
        }
    }
}

• Subtask 1: 0 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29