제출 #17912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
17912		Adilkhan	은행 (IZhO14_bank)	C++98	71 / 100	1079 ms	636 KiB

bank

#include <bits/stdc++.h>

#define pb push_back
#define endl "\n"
#define mp make_pair 
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fname ""
#define sz(x) (int)(x.size())

typedef long long ll;

using namespace std;

const ll N = (ll)(5e5) + 322;
const ll INF = (ll)(1e9);
const ll mod = (ll)(1e9) + 7;
const double eps = 1e-9;

int n, m, x, nz, sum;

vector <int> a, b; 

void calc(int pmsk, int x) {
	if (x == n) {
		puts("YES"); exit(0);
	}
	for (int mask = 0; mask < (1 << m); ++mask) {
		if ((mask & pmsk)) {continue;}
		if (m - (__builtin_popcount(mask) + __builtin_popcount(pmsk)) < (n - x - 1)) {continue;}
	  sum = 0;
		for (int i = 0; i < m; ++i) {
			if (mask & (1 << i)) {
				sum += b[i];			
			}				
		}	
		if (sum == a[x]) {
			calc(pmsk ^ mask, x + 1);
		}
	}
}

int main () {
	//ios_base :: sync_with_stdio (false); cin.tie(0);
	//freopen(fname".in", "r", stdin);
	//freopen(fname".out", "w", stdout);
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &x); a.pb(x);
	}
	for (int i = 1; i <= m; ++i) {
		scanf("%d", &x); b.pb(x);
	}
	if (n > m) {
		puts("NO");	return 0;
	}
	if (n == m) {
		sort(all(a)); sort(all(b));
		if (a == b) {
			puts("YES");
		}else {
			puts("NO");
		}
		return 0;
	}
	sort(all(a));
	reverse(all(a));
	calc(0, 0);
  puts("NO");
  return 0;
}

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

bank.cpp: In function 'int main()':
bank.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
bank.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &x); a.pb(x);
   ~~~~~^~~~~~~~~~
bank.cpp:53:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &x); b.pb(x);
   ~~~~~^~~~~~~~~~

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