oj.uz

답안 #887803

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887803 2023-12-15T08:56:07 Z Requiem 은행 (IZhO14_bank) C++17
100 / 100
 89 ms 20712 KB 
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 1000000007
#define INF 1e18
#define fi first
#define se second
#define endl "\n"
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define pi 3.14159265359
#define TASKNAME "Bank"
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; } 
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; } 
using namespace std; 
typedef pair<int,int> ii; 
typedef pair<int,ii> iii; 
typedef vector<int> vi; 
const int MAXN = (1<<20) + 9;
int leftover[MAXN];
int dp[MAXN];
int n, m, a[MAXN], b[MAXN];
main() 
{ 
    fast; 
   if (fopen(TASKNAME".inp","r")){
        freopen(TASKNAME".inp","r",stdin); 
        freopen(TASKNAME".out","w",stdout); 
   } 
   memset(dp,-1,sizeof(dp));
   dp[0] = 0;
   leftover[0] = 0;
   cin>>n>>m;
   for(int i=1;i<=n;i++){
       cin>>a[i];
   }
   for(int i=1;i<=m;i++){ 
       cin>>b[i];
   }

   for(int i=1;i<(1<<m);i++){
       for(int j=0;j<m;j++){
           if (i & (1 << j)){
               int prvmsk = i ^ (1<<j);
               int prvans = dp[prvmsk];
               if (leftover[prvmsk] + b[j+1] == a[prvans+1]){
                   dp[i] = prvans+1;
                   leftover[i] = 0;
               }
               else if (leftover[prvmsk] + b[j+1] < a[prvans+1]) {
                   dp[i] = prvans;
                   leftover[i] = leftover[prvmsk] + b[j+1];
               }
           }
       } 
       if (dp[i] == n) {
           cout<<"YES"<<endl;
           return 0;
       } 
   }
   cout<<"NO"<<endl;

}

Compilation message

bank.cpp:25:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   25 | main()
      | ^~~~
bank.cpp: In function 'int main()':
bank.cpp:29:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen(TASKNAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:30:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         freopen(TASKNAME".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12752 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Correct 70 ms 12776 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 75 ms 20560 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12768 KB Output is correct
5 Correct 2 ms 13144 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12792 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12752 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Correct 70 ms 12776 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 75 ms 20560 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12768 KB Output is correct
14 Correct 2 ms 13144 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 3 ms 12888 KB Output is correct
25 Correct 3 ms 12636 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12792 KB Output is correct
29 Correct 2 ms 12632 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 82 ms 20564 KB Output is correct
32 Correct 85 ms 20560 KB Output is correct
33 Correct 73 ms 20108 KB Output is correct
34 Correct 71 ms 13740 KB Output is correct
35 Correct 70 ms 14020 KB Output is correct
36 Correct 71 ms 12960 KB Output is correct
37 Correct 71 ms 13084 KB Output is correct
38 Correct 69 ms 12636 KB Output is correct
39 Correct 2 ms 12888 KB Output is correct
40 Correct 71 ms 12860 KB Output is correct
41 Correct 69 ms 12884 KB Output is correct
42 Correct 89 ms 20700 KB Output is correct
43 Correct 72 ms 16504 KB Output is correct
44 Correct 74 ms 12784 KB Output is correct
45 Correct 2 ms 12632 KB Output is correct
46 Correct 77 ms 20564 KB Output is correct
47 Correct 70 ms 13000 KB Output is correct
48 Correct 2 ms 12636 KB Output is correct
49 Correct 69 ms 12864 KB Output is correct
50 Correct 76 ms 20696 KB Output is correct
51 Correct 74 ms 13144 KB Output is correct
52 Correct 72 ms 20560 KB Output is correct
53 Correct 85 ms 20696 KB Output is correct
54 Correct 81 ms 20560 KB Output is correct
55 Correct 76 ms 20712 KB Output is correct
56 Correct 79 ms 20696 KB Output is correct
57 Correct 77 ms 20560 KB Output is correct
58 Correct 77 ms 20696 KB Output is correct