제출 #862613

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862613		Requiem	은행 (IZhO14_bank)	C++17	100 / 100	136 ms	25300 KiB

bank

#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 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 = 23;
int a[MAXN],b[MAXN];
int n,m;
int peoplecover[(1<<20)+1],leftover[(1<<20+1)];
main() 
{ 
    fast; 
    // freopen(TASKNAME".inp","r",stdin); 
    // freopen(TASKNAME".out","w",stdout); 
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=m;i++){
        cin>>b[i];
    }
    memset(peoplecover,-1,sizeof(peoplecover));
    memset(leftover,-1,sizeof(leftover));
    peoplecover[0] = 0;
    leftover[0] = 0;
    for(int msk=0;msk<(1<<m);msk++){
        for(int j=0;j<m;j++){
            if (msk & (1<<j)){
                int prevmsk = msk ^ (1<<j);
                int curr_budget = leftover[prevmsk] + b[j+1];
                if (peoplecover[prevmsk] == -1) continue;
                int nxtp = a[peoplecover[prevmsk]+1];
                // cout<<msk<<' '<<prevmsk<<' '<<peoplecover[prevmsk]<<' '<<leftover[prevmsk]<<' '<<a[nxtp]<<endl;

                if (curr_budget < nxtp and peoplecover[msk] <= peoplecover[prevmsk]){
                    leftover[msk] = curr_budget;
                    peoplecover[msk] = peoplecover[prevmsk];
                }
                else if (curr_budget == nxtp and peoplecover[msk] <= peoplecover[prevmsk] + 1){
                    leftover[msk] = 0;
                    peoplecover[msk] = peoplecover[prevmsk] + 1;
                }
            }
        }
        // cout<<msk<<' '<<peoplecover[msk]<<' '<<leftover[msk]<<endl;
        if (peoplecover[msk] == n){
            cout<<"YES"<<endl;
            return 0;
        }
    }
    cout<<"NO"<<endl;
 
    
} 

컴파일 시 표준 에러 (stderr) 메시지

bank.cpp:23:43: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   23 | int peoplecover[(1<<20)+1],leftover[(1<<20+1)];
      |                                         ~~^~
bank.cpp:24:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   24 | main()
      | ^~~~

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