제출 #671826

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
671826		Baytoro	은행 (IZhO14_bank)	C++17	19 / 100	71 ms	16708 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e18,mod=1e9+7;
int n,m;
void get(int x){
	for(int i=0;i<m;i++)
		cout<<((x&(1<<i))?1:0);
}
int dp[(1<<20)+5];
int ok[(1<<20)+5];
void solve(){
	memset(ok,-1,sizeof(ok));
	cin>>n>>m;
	vector<int> a(n+1),b(m+1);
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=0;i<m;i++) cin>>b[i];
	for(int i=0;i<n;i++){
		for(int mask=1;mask<(1<<m);mask++){
			for(int j=0;j<m;j++){
				if(mask&(1<<j)){
					//cout<<ok[(mask^(1<<j))]<<endl;
					if(ok[mask^(1<<j)]!=i-1) continue;
					dp[mask]=(dp[mask^(1<<j)])+b[j];
					//get(mask);cout<<' '<<dp[mask];
					if(dp[mask]>a[i]) continue;
					if(dp[mask]==a[i]){
						dp[mask]=0;
						ok[mask]=i;
						if(i==n-1){
							cout<<"YES\n";
							return;
						}
					}
				}
			}
		}
	}
	cout<<"NO\n";
	
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

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

bank.cpp:53:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   53 | main(){
      | ^~~~
bank.cpp: In function 'void fopn(std::string)':
bank.cpp:12:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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