oj.uz

답안 #958318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958318 2024-04-05T11:51:32 Z amine_aroua Kitchen (BOI19_kitchen) C++17
100 / 100
 22 ms 1628 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>

const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;

ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (gcd)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (lcm)

// HERE IS THE SOLUTION

signed main()
{
    boost;
    cin.tie(0);
    cout.tie(0);
    int n ,  m , k;
    cin>>n>>m>>k;
    vi a(n) , b(m);
    int sb = 0 , sa = 0;
    fore(i , n)
    {
        cin>>a[i];
        if(a[i] < k)
        {
            cout<<"Impossible"<<nl;
            return 0;
        }
        sa+=a[i];
    }
    fore(i , m)
    {
        cin>>b[i];
        sb+=b[i];
    }
    int s = sb - sa;
    if(s < 0)
    {
        cout<<"Impossible"<<nl;
        return 0;
    }
    int dp[sb + 1] , reach[sb + 1];
    fore(i , sb + 1)
    {
        dp[i] = -INF;
        reach[i] = 0;
    }
    dp[0] = 0;
    reach[0] = 1;
    for(auto x : b)
    {
        forn(j , sb , 0)
        {
            if(j + x <= sb && reach[j])
            {
                reach[j + x] = 1;
                dp[j + x] = max(dp[j + x] , dp[j] + min(n , x));
            }
        }
    }
    int ans = -1;
    fore(i , sb + 1)
    {
        if(dp[i] >= n*k && i >= sa)
        {
            ans = i;
            break;
        }
    }
    if(ans != -1)
        cout<<ans - sa<<nl;
    else
        cout<<"Impossible"<<nl;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1372 KB Output is correct
2 Correct 11 ms 1116 KB Output is correct
3 Correct 14 ms 1116 KB Output is correct
4 Correct 22 ms 1628 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 9 ms 1240 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 14 ms 1372 KB Output is correct
15 Correct 11 ms 1116 KB Output is correct
16 Correct 14 ms 1116 KB Output is correct
17 Correct 22 ms 1628 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 9 ms 1240 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 11 ms 1372 KB Output is correct
26 Correct 15 ms 1372 KB Output is correct
27 Correct 5 ms 860 KB Output is correct
28 Correct 11 ms 1216 KB Output is correct
29 Correct 15 ms 1368 KB Output is correct
30 Correct 22 ms 1628 KB Output is correct