oj.uz

답안 #733930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733930 2023-05-01T12:08:00 Z Vanilla Kitchen (BOI19_kitchen) C++17
100 / 100
 243 ms 3684 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 301;
const int maxs = maxn * maxn + 1;
bitset <maxs> dp [maxn];
int a[maxn];
int b[maxn];
int n,m,k;

void solve(int id){
    
    return;
}


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    cin >> n >> m >> k;
    int sa = 0;
    for (int i = 0; i < n; i++){
        cin >> a[i];
        sa+=a[i];
    }
    for (int i = 0; i < m; i++){
        cin >> b[i];
    }
    for (int i = 0; i < n; i++){
        if (a[i] < k) {
            cout << "Impossible";
            return 0;
        }
    }
    sort(b, b + m);
    dp[0][0] = 1;
    for (int val: b) {
        if (val >= n) {
            for (int i = m - 1; i >= 0; i--) dp[i + 1] |= dp[i] << val;
        }
        else {
            for (int i = maxs - val - 1; i >= 0; i--){
                int r1 = min(i / n, m);
                int r2 = min((i + val) / n, m);
                if (dp[r1][i]) dp[r2][i + val] = 1;
            }
        }
    }
    for (int i = sa; i < maxs; i++){
        for (int j = k; j <= m; j++){
            if (dp[j][i]) {
                cout << i - sa;
                return 0;
            }
        }
    }
    cout << "Impossible\n";
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 352 KB Output is correct
2 Correct 181 ms 340 KB Output is correct
3 Correct 188 ms 460 KB Output is correct
4 Correct 192 ms 348 KB Output is correct
5 Correct 166 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 186 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 352 KB Output is correct
2 Correct 181 ms 340 KB Output is correct
3 Correct 188 ms 460 KB Output is correct
4 Correct 192 ms 348 KB Output is correct
5 Correct 166 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 186 ms 348 KB Output is correct
9 Correct 189 ms 500 KB Output is correct
10 Correct 180 ms 500 KB Output is correct
11 Correct 192 ms 500 KB Output is correct
12 Correct 194 ms 352 KB Output is correct
13 Correct 163 ms 356 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 177 ms 1248 KB Output is correct
2 Correct 210 ms 988 KB Output is correct
3 Correct 197 ms 3544 KB Output is correct
4 Correct 227 ms 3532 KB Output is correct
5 Correct 243 ms 3588 KB Output is correct
6 Correct 191 ms 912 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 173 ms 772 KB Output is correct
2 Correct 166 ms 772 KB Output is correct
3 Correct 176 ms 668 KB Output is correct
4 Correct 188 ms 772 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 352 KB Output is correct
2 Correct 181 ms 340 KB Output is correct
3 Correct 188 ms 460 KB Output is correct
4 Correct 192 ms 348 KB Output is correct
5 Correct 166 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 186 ms 348 KB Output is correct
9 Correct 189 ms 500 KB Output is correct
10 Correct 180 ms 500 KB Output is correct
11 Correct 192 ms 500 KB Output is correct
12 Correct 194 ms 352 KB Output is correct
13 Correct 163 ms 356 KB Output is correct
14 Correct 177 ms 1248 KB Output is correct
15 Correct 210 ms 988 KB Output is correct
16 Correct 197 ms 3544 KB Output is correct
17 Correct 227 ms 3532 KB Output is correct
18 Correct 243 ms 3588 KB Output is correct
19 Correct 191 ms 912 KB Output is correct
20 Correct 173 ms 772 KB Output is correct
21 Correct 166 ms 772 KB Output is correct
22 Correct 176 ms 668 KB Output is correct
23 Correct 188 ms 772 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 177 ms 2652 KB Output is correct
26 Correct 211 ms 3028 KB Output is correct
27 Correct 155 ms 2108 KB Output is correct
28 Correct 203 ms 3032 KB Output is correct
29 Correct 230 ms 3096 KB Output is correct
30 Correct 226 ms 3684 KB Output is correct