oj.uz

답안 #684566

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684566 2023-01-21T18:36:45 Z MarwenElarbi 은행 (IZhO14_bank) C++14
100 / 100
 201 ms 172784 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));
    }
    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 = 1; 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();
            while (nabba[k]==sum)
            {
                tab[k].pb(i);
                k++;
            } 
        }
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 172620 KB Output is correct
2 Correct 64 ms 172608 KB Output is correct
3 Correct 69 ms 172640 KB Output is correct
4 Correct 72 ms 172588 KB Output is correct
5 Correct 125 ms 172628 KB Output is correct
6 Correct 67 ms 172580 KB Output is correct
7 Correct 96 ms 172624 KB Output is correct
8 Correct 129 ms 172668 KB Output is correct
9 Correct 131 ms 172548 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 172628 KB Output is correct
2 Correct 64 ms 172556 KB Output is correct
3 Correct 68 ms 172544 KB Output is correct
4 Correct 67 ms 172620 KB Output is correct
5 Correct 66 ms 172592 KB Output is correct
6 Correct 66 ms 172600 KB Output is correct
7 Correct 76 ms 172552 KB Output is correct
8 Correct 76 ms 172568 KB Output is correct
9 Correct 73 ms 172640 KB Output is correct
10 Correct 67 ms 172576 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 172616 KB Output is correct
2 Correct 69 ms 172576 KB Output is correct
3 Correct 67 ms 172544 KB Output is correct
4 Correct 71 ms 172620 KB Output is correct
5 Correct 66 ms 172560 KB Output is correct
6 Correct 69 ms 172636 KB Output is correct
7 Correct 68 ms 172608 KB Output is correct
8 Correct 70 ms 172576 KB Output is correct
9 Correct 74 ms 172544 KB Output is correct
10 Correct 68 ms 172684 KB Output is correct
11 Correct 66 ms 172660 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 172620 KB Output is correct
2 Correct 64 ms 172608 KB Output is correct
3 Correct 69 ms 172640 KB Output is correct
4 Correct 72 ms 172588 KB Output is correct
5 Correct 125 ms 172628 KB Output is correct
6 Correct 67 ms 172580 KB Output is correct
7 Correct 96 ms 172624 KB Output is correct
8 Correct 129 ms 172668 KB Output is correct
9 Correct 131 ms 172548 KB Output is correct
10 Correct 64 ms 172628 KB Output is correct
11 Correct 64 ms 172556 KB Output is correct
12 Correct 68 ms 172544 KB Output is correct
13 Correct 67 ms 172620 KB Output is correct
14 Correct 66 ms 172592 KB Output is correct
15 Correct 66 ms 172600 KB Output is correct
16 Correct 76 ms 172552 KB Output is correct
17 Correct 76 ms 172568 KB Output is correct
18 Correct 73 ms 172640 KB Output is correct
19 Correct 67 ms 172576 KB Output is correct
20 Correct 66 ms 172616 KB Output is correct
21 Correct 69 ms 172576 KB Output is correct
22 Correct 67 ms 172544 KB Output is correct
23 Correct 71 ms 172620 KB Output is correct
24 Correct 66 ms 172560 KB Output is correct
25 Correct 69 ms 172636 KB Output is correct
26 Correct 68 ms 172608 KB Output is correct
27 Correct 70 ms 172576 KB Output is correct
28 Correct 74 ms 172544 KB Output is correct
29 Correct 68 ms 172684 KB Output is correct
30 Correct 66 ms 172660 KB Output is correct
31 Correct 126 ms 172608 KB Output is correct
32 Correct 201 ms 172756 KB Output is correct
33 Correct 120 ms 172612 KB Output is correct
34 Correct 123 ms 172664 KB Output is correct
35 Correct 123 ms 172668 KB Output is correct
36 Correct 126 ms 172628 KB Output is correct
37 Correct 123 ms 172620 KB Output is correct
38 Correct 124 ms 172668 KB Output is correct
39 Correct 155 ms 172672 KB Output is correct
40 Correct 123 ms 172668 KB Output is correct
41 Correct 128 ms 172668 KB Output is correct
42 Correct 126 ms 172620 KB Output is correct
43 Correct 124 ms 172624 KB Output is correct
44 Correct 124 ms 172680 KB Output is correct
45 Correct 139 ms 172672 KB Output is correct
46 Correct 128 ms 172672 KB Output is correct
47 Correct 137 ms 172732 KB Output is correct
48 Correct 120 ms 172584 KB Output is correct
49 Correct 123 ms 172620 KB Output is correct
50 Correct 125 ms 172628 KB Output is correct
51 Correct 133 ms 172784 KB Output is correct
52 Correct 130 ms 172636 KB Output is correct
53 Correct 186 ms 172712 KB Output is correct
54 Correct 125 ms 172620 KB Output is correct
55 Correct 140 ms 172592 KB Output is correct
56 Correct 142 ms 172676 KB Output is correct
57 Correct 141 ms 172680 KB Output is correct
58 Correct 148 ms 172676 KB Output is correct