oj.uz

답안 #423252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
423252 2021-06-10T20:43:26 Z abdzag Kitchen (BOI19_kitchen) C++17
0 / 100
 119 ms 4932 KB 
#include<bits/stdc++.h>
#include<unordered_map>
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define trav(a,v) for(auto& a: v)
#define sz(v) v.size()
#define all(v) v.begin(),v.end()
#define vi vector<int>

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long long inf = 1e15;

using namespace std;
int main() {
	cin.sync_with_stdio(false);
	ll n, m, k;
	cin >> n >> m >> k;
	vector<ll> v(n);
	vector<ll> v2(m);
	rep(i, 0, n)cin >> v[i];
	rep(i, 0, m)cin >> v2[i];
	ll sum = 0;
	rep(i, 0, n)sum += v[i];
	set<ll> s;
	vector<bool> dp(1e5);
	dp[0] = 1;
	rep(i, 0, m) {
		rep(j, 0, 1e5) {
			if (dp[j] && j + v2[i] < 1e5) {
				dp[j + v2[i]] = 1;
			}
		}
	}
	rep(i, 0, 1e5)if (dp[i])s.insert(i);
	if (s.lower_bound(sum) == s.end())cout << "impossible" << endl;
	else cout << *(s.lower_bound(sum)) - sum << endl;
	return 0;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 2508 KB Output is correct
2 Correct 11 ms 2496 KB Output is correct
3 Incorrect 20 ms 4256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 2508 KB Output is correct
2 Correct 11 ms 2496 KB Output is correct
3 Incorrect 20 ms 4256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 119 ms 4796 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 37 ms 4932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 2508 KB Output is correct
2 Correct 11 ms 2496 KB Output is correct
3 Incorrect 20 ms 4256 KB Output isn't correct
4 Halted 0 ms 0 KB -