oj.uz

답안 #926470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926470 2024-02-13T05:18:15 Z Pragmatism Kitchen (BOI19_kitchen) C++17
100 / 100
 23 ms 1124 KB 
//Bismillahir-Rahmanir-Rahim

#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,popcnt,avx,avx2")

#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define pld pair <long double, long double>
#define ll long long
#define ld long double
#define x first
#define y second
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define skip continue
#define bpop(x) (ll)__builtin_popcountll(x)

using namespace std;

const int N = 3e2 + 7;
const int M = 5e3 + 7;
const int maxA = 2e6 + 7;
const int inf = 1e9 + 7;
const ll INF = 2e18 + 7;
const int MOD = 1e9 + 7;
const ld eps = 1e-9;

pii dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define int long long

bool ok[N * N];
int n, m, k, a[N], b[N], dp[N * N];
void solve() {
    cin >> n >> m >> k;
    int sum = 0;
    for (int i = 1;i <= n;i++) {
        cin >> a[i], sum += a[i];
        if (a[i] < k)cout << "Impossible", exit(0);
    }
    for (int i = 1;i <= m;i++)cin >> b[i];
    ok[0] = 1;
    for (int i = 1;i <= m;i++) {
        for (int w = N * N - 1;w >= 0;w--) {
            if (ok[w] && w + b[i] < N * N)dp[w + b[i]] = max(dp[w + b[i]], dp[w] + min(n, b[i])), ok[w + b[i]] = 1;
        }
    }
    for (int w = sum;w < N * N;w++) {
        if (dp[w] >= n * k)cout << w - sum, exit(0);
    }
    cout << "Impossible";
}
signed main() {
    //srand(time(NULL));
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    //freopen("tests.in", "r", stdin);
    //freopen("milkorder.out", "w", stdout);
    int test = 1;
    //cin >> test;
    for (int t = 1;t <= test;t++) {
        //cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Compilation message

kitchen.cpp:4: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    4 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 860 KB Output is correct
2 Correct 11 ms 940 KB Output is correct
3 Correct 20 ms 856 KB Output is correct
4 Correct 23 ms 1124 KB Output is correct
5 Correct 23 ms 1116 KB Output is correct
6 Correct 10 ms 860 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 13 ms 860 KB Output is correct
15 Correct 11 ms 940 KB Output is correct
16 Correct 20 ms 856 KB Output is correct
17 Correct 23 ms 1124 KB Output is correct
18 Correct 23 ms 1116 KB Output is correct
19 Correct 10 ms 860 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 9 ms 860 KB Output is correct
26 Correct 11 ms 860 KB Output is correct
27 Correct 11 ms 616 KB Output is correct
28 Correct 15 ms 860 KB Output is correct
29 Correct 18 ms 860 KB Output is correct
30 Correct 23 ms 1116 KB Output is correct