이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define fr first
#define se second
#define sc scanf
#define pf printf
#define ld long double
#define ll long long
#define pb push_back
#define sq(n) n * n
#define r_0 return 0
#define pr pair < ll, ll >
#define prr pair < pair < ll, ll >, ll >
#define fin(s) freopen( s, "r", stdin )
#define fout(s) freopen( s, "w", stdout )
#define TIME ios_base::sync_with_stdio(0)
using namespace std;
const ll INF = 1e9;
const ll N = 2e3 + 3;
const ll mod = 998244353;
const ld eps = 1e-7;
ll n, m;
ll b[N], a[N];
bool dfs( ll x, ll sum, ll state, ll k, ll num ){
if( x > n ){
return 1;
}
if( sum == 0 ){
return dfs( x + 1, a[x + 1], state, 1, num );
}
bool mx = 0;
for( int i = k; i <= m; i ++ ){
if( m - num < n - x )break;
if( sum < b[i] || ( state >> i ) & 1 == 1 )continue;
mx = max( dfs( x, sum - b[i], ( state | ( 1 << i ) ), i + 1, num + 1 ), mx );
}
return mx;
}
main(){
TIME;
//fin( "bank.in" );
//fout( "bank.out" );
cin >> n >> m;
for( int i = 1; i <= n; i ++ ){
cin >> a[i];
}
for( int i = 1; i <= m; i ++ )cin >> b[i];
ll x = dfs( 1, a[1], 0, 1, 0 );
if( x == 0 ){ cout << "NO"; }
else cout << "YES";
}
컴파일 시 표준 에러 (stderr) 메시지
bank.cpp: In function 'bool dfs(long long int, long long int, long long int, long long int, long long int)':
bank.cpp:36:46: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
if( sum < b[i] || ( state >> i ) & 1 == 1 )continue;
~~^~~~
bank.cpp: At global scope:
bank.cpp:42:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main(){
^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |