oj.uz

답안 #942649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
942649 2024-03-11T02:26:19 Z damwuan Kitchen (BOI19_kitchen) C++17
50 / 100
 36 ms 604 KB 



#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define bit(n,i) ((n>>i)&1)
#define all(x) x.begin(),x.end()
//#pragma GCC optimize("O2,unroll-loops")
//#pragma GCC target("avx,avx2,bmi,bmi2,sse,sse2,sse3,ssse3,sse4,popcnt")
//#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
typedef pair<db,db> pdd;
typedef pair<ll,ll> pll;
const ll maxn=300;
const ll maxk=2e5+5;
const ll block_sz=317;
const ll inf=1e9;
const ll mod=111539786;

int n,m,k,a[maxn],b[maxn],sum;
vector<int> dp;
void sol()
{
    cin >> n>>m>>k;
    for1(i,1,n) cin >> a[i];
    for1(i,1,m) cin >> b[i];
    if (k>m)
    {
        cout << "Impossible";
        return;
    }

    for1(i,1,n)
    {
        if (a[i]< k)
        {
            cout << "Impossible";
            return;
        }
        sum+=(a[i]);
    }
//    return;
    dp.resize(300*300+1,-inf);
    dp[0]=0;
    for1(i,1,m)
    {
        for2(j,300*300,0)
        {
            if (j-b[i]>=0) dp[j]=max(dp[j],dp[j-b[i]]+min(b[i],n));
        }
    }
//    cerr<<m<<' '<<sum<<' '<< dp[m][sum]<<'\n';
    for1(i,sum,300*300)
    {
        if (dp[i] >= n*k)
        {
            cout << i-sum<<'\n';
//            cerr<< i-sum<<'\n';
            return;
        }
    }
    cout << "Impossible\n";

}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("KITCHEN.inp","r",stdin);
//    freopen("KITCHEN.out","w",stdout);

    int t=1;//cin >> t;
    while (t--)
    {
        sol();
    }
}
/*

C[i-1][i+j-1]*C[sz[u]-i][sz[u]+sz[v]-i]
*/

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 604 KB Output is correct
2 Correct 26 ms 604 KB Output is correct
3 Correct 35 ms 604 KB Output is correct
4 Correct 36 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 24 ms 604 KB Output is correct

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -