oj.uz

Submission #684559

# Submission time Handle Problem Language Result Execution time Memory
684559 2023-01-21T18:20:03 Z MarwenElarbi Bank (IZhO14_bank) C++14
46 / 100
 122 ms 172748 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
const int MOD = 1e9+7;
const int nax = 2*1e5+5;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
typedef complex<int> Point;
#define X real()
#define Y imag()
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
int n,m;
vi tab[21];
int dp[21][1<<21];
int search(int x,int y)
{
    if (x==n) return 1;
    if (dp[x][y]!=-1) return dp[x][y];
    dp[x][y]=0;
    for (int i = 0; i < tab[x].size(); ++i)
    {
        if ((tab[x][i]&y))continue;
        int k=(tab[x][i]+y);
        //cout <<k<<endl;
        dp[x][y]=max(dp[x][y],search(x+1,k));
    }
    //cout << x<< " "<<y<<" "<<dp[x][y]<<endl;
    return dp[x][y];
}
int main(){
    optimise;
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif*/
    //setIO("movie");  
    cin>>n>>m;
    memset(dp,-1,sizeof dp);
    set<int> people;
    vi nabba(n);
    vi ckecks(m);
    for (int i = 0; i < n; ++i)
    {
        cin>>nabba[i];
        people.insert(nabba[i]);
    }
    sort(nabba.begin(),nabba.end());
    for (int i = 0; i < m; ++i)
    {
         cin>>ckecks[i];
    }
    for (int i = 0; i < (1<<m); ++i)
    {
        int sum=0;
        for (int j = 0; j < m; ++j)
        {
            if (i&(1<<j)) sum+=ckecks[j];
        }
        //cout <<sum<<endl;
        if (people.count(sum))
        {
            int k=lower_bound(nabba.begin(),nabba.end(),sum)-nabba.begin();
            tab[k].pb(i);
        }
    }
    int c=search(0,0);
    if (c==1) cout<< "YES"<<endl;
    else cout << "NO"<<endl; 
}

Compilation message

bank.cpp: In function 'int search(int, int)':
bank.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i = 0; i < tab[x].size(); ++i)
      |                     ~~^~~~~~~~~~~~~~~
bank.cpp: In function 'void setIO(std::string)':
bank.cpp:31:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:32:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 172660 KB Output is correct
2 Correct 68 ms 172620 KB Output is correct
3 Correct 69 ms 172600 KB Output is correct
4 Correct 71 ms 172592 KB Output is correct
5 Correct 118 ms 172664 KB Output is correct
6 Correct 65 ms 172672 KB Output is correct
7 Correct 62 ms 172660 KB Output is correct
8 Correct 122 ms 172672 KB Output is correct
9 Correct 121 ms 172664 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 172552 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 172596 KB Output is correct
2 Correct 64 ms 172544 KB Output is correct
3 Correct 71 ms 172664 KB Output is correct
4 Correct 69 ms 172592 KB Output is correct
5 Correct 65 ms 172748 KB Output is correct
6 Correct 67 ms 172552 KB Output is correct
7 Correct 63 ms 172596 KB Output is correct
8 Correct 64 ms 172620 KB Output is correct
9 Correct 78 ms 172644 KB Output is correct
10 Correct 71 ms 172620 KB Output is correct
11 Correct 65 ms 172616 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 172660 KB Output is correct
2 Correct 68 ms 172620 KB Output is correct
3 Correct 69 ms 172600 KB Output is correct
4 Correct 71 ms 172592 KB Output is correct
5 Correct 118 ms 172664 KB Output is correct
6 Correct 65 ms 172672 KB Output is correct
7 Correct 62 ms 172660 KB Output is correct
8 Correct 122 ms 172672 KB Output is correct
9 Correct 121 ms 172664 KB Output is correct
10 Incorrect 66 ms 172552 KB Output isn't correct
11 Halted 0 ms 0 KB -