oj.uz

Submission #478256

# Submission time Handle Problem Language Result Execution time Memory
478256 2021-10-06T17:56:13 Z Kitonds Bank (IZhO14_bank) C++17
100 / 100
 155 ms 16816 KB 
#include <bits/stdc++.h>
 
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define read(A) freopen((A + ".in").c_str(),"r",stdin) 
#define write(A) freopen((A + ".out").c_str(),"w",stdout) 
#define ll long long
#define pb push_back
#define ull unsigned long long
#define int long long
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef pair<int, int> ii;      
typedef vector<ii> vii;      
typedef vector<int> vi; 
typedef vector<ll> vl;
typedef pair<int, ii> iii;
typedef vector<iii> viii;
constexpr int pct(int x) { return __builtin_popcount(x); } 
const int DFS_WHITE = 0;
const int DFS_BLACK = 1;
const int INF = 1e18;
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7 ;

void setIO(string filename = ""){
  ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  if(filename.size() == 0)
    return;
  read(filename);
  write(filename);
}

int n, m, k;

void solve(){
  cin>>n>>m;
  vi A(n), B(m);
  for (int i=0; i<n; i++){
    cin>>A[i];
  }
  for (int i=0; i<m; i++){
    cin>>B[i];
  }
  vi cover(1 << m, -1);
  vi left(1 << m, -1);
  cover[0] = 0;
  left[0] = 0;
  for (int i=0; i<(1<<m); i++){
    for (int j=0; j<m; j++){
      if ((i & (1 << j)) == 0){
        continue;
      }
      int prev = i & (~(1 << j));
      if (cover[prev] == -1){
        continue;
      }
      int tmp = left[prev] + B[j];
      int cur = A[cover[prev]];
      if (tmp < cur){
        cover[i] = cover[prev];
        left[i] = tmp;
      }
      else if (tmp == cur){
        cover[i] = cover[prev] + 1;
        left[i] = 0;
      }
    }
  // /  cout<<i<<" "<<cover[i]<<endl;
    if (cover[i] == n){
      cout<<"YES";
      return;
    }
  }
  cout<<"NO";
} 

int tc = 1;
signed main() {
  setIO();
  int test = 1;
//  cin>>test;
  while(test--){
    solve();
  //  cout<<endl;
    tc++;
  }
}

Compilation message

bank.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("O3")
      | 
bank.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("unroll-loops")
      | 
bank.cpp: In function 'void setIO(std::string)':
bank.cpp:7:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | #define read(A) freopen((A + ".in").c_str(),"r",stdin)
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:34:3: note: in expansion of macro 'read'
   34 |   read(filename);
      |   ^~~~
bank.cpp:8:25: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 | #define write(A) freopen((A + ".out").c_str(),"w",stdout)
      |                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:35:3: note: in expansion of macro 'write'
   35 |   write(filename);
      |   ^~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 75 ms 16732 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 8 ms 16708 KB Output is correct
9 Correct 102 ms 16716 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 584 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 568 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 75 ms 16732 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 8 ms 16708 KB Output is correct
9 Correct 102 ms 16716 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 312 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 584 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 568 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 2 ms 588 KB Output is correct
30 Correct 2 ms 588 KB Output is correct
31 Correct 116 ms 16724 KB Output is correct
32 Correct 118 ms 16716 KB Output is correct
33 Correct 92 ms 16716 KB Output is correct
34 Correct 78 ms 16724 KB Output is correct
35 Correct 77 ms 16716 KB Output is correct
36 Correct 74 ms 16728 KB Output is correct
37 Correct 75 ms 16724 KB Output is correct
38 Correct 75 ms 16716 KB Output is correct
39 Correct 9 ms 16716 KB Output is correct
40 Correct 78 ms 16692 KB Output is correct
41 Correct 76 ms 16716 KB Output is correct
42 Correct 134 ms 16724 KB Output is correct
43 Correct 83 ms 16816 KB Output is correct
44 Correct 77 ms 16636 KB Output is correct
45 Correct 8 ms 16716 KB Output is correct
46 Correct 106 ms 16732 KB Output is correct
47 Correct 84 ms 16732 KB Output is correct
48 Correct 8 ms 16716 KB Output is correct
49 Correct 77 ms 16716 KB Output is correct
50 Correct 101 ms 16716 KB Output is correct
51 Correct 74 ms 16724 KB Output is correct
52 Correct 83 ms 16624 KB Output is correct
53 Correct 155 ms 16648 KB Output is correct
54 Correct 122 ms 16740 KB Output is correct
55 Correct 108 ms 16716 KB Output is correct
56 Correct 100 ms 16724 KB Output is correct
57 Correct 100 ms 16716 KB Output is correct
58 Correct 111 ms 16716 KB Output is correct