oj.uz

답안 #92087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
92087 2019-01-01T12:22:43 Z Randooom 은행 (IZhO14_bank) C++14
52 / 100
 1000 ms 408 KB 
#include <bits/stdc++.h>
#define in freopen ("bank.in", "r", stdin);
#define out freopen("bank.out", "w", stdout);
#define ll long long int

const int val = (2e5) + 5;
const int inf = (1e9) + 7;
double eps = 0.000000001;

using namespace std;

int n, m, a[25], b[25];

void rec(int id, int s, int mask){
    if(id == n){
        cout << "YES" << endl;
        exit(0);
    }
    if(mask == (1<<m)-1 && id < n){
        cout << "NO" << endl;
        exit(0);
    }
    for(int i=0; i<m; ++i){
        if((mask & (1 << i)) == 0){
            if(s + b[i] < a[id]){
                rec(id, s+b[i], mask | (1 << i));
            }
            else if(s + b[i] == a[id]){
                rec(id+1, 0, mask | (1 << i));
            }
        }
    }
}

int solve(){
    cin >> n >> m;
    for(int i=0; i<n; ++i){
        cin >> a[i];
    }
    for(int i=0; i<m; ++i){
        cin >> b[i];
    }
    rec(0, 0, 0);
    cout << "NO" <<  endl;
}

int main(){
    //in out
	ios_base::sync_with_stdio(0);
    solve();
    return 0;
}

Compilation message

bank.cpp: In function 'int solve()':
bank.cpp:45:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Execution timed out 1076 ms 256 KB Time limit exceeded

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 19 ms 408 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 32 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Execution timed out 1076 ms 256 KB Time limit exceeded