oj.uz

답안 #370154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370154 2021-02-23T12:35:43 Z AmineWeslati Kitchen (BOI19_kitchen) C++14
100 / 100
 506 ms 117100 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e9;
const int MX = 300 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


int N,M,K;
vi a(MX),b(MX);

int s1,s2;
bool check(){
	if(K>M) return 0;
	s1=0,s2=0;
	FOR(i,0,N){
		if(a[i]<K) return 0;
		s1+=a[i];
	}
	FOR(i,0,M) s2+=b[i];
	if(s1>s2) return 0;
	return 1;
}

int memo[MX][MX*MX];
int solve(int i, int r){
	if(i==M){
		if(!r) return 0;
		return -INF;
	}

	if(memo[i][r]!=-1) return memo[i][r];
	
	int ans=solve(i+1,r);
	if(b[i]<=r) ckmax(ans,solve(i+1,r-b[i])+min(N,b[i]));
	return memo[i][r]=ans;
}

int main() {
    boost; IO();

    cin>>N>>M>>K;
    FOR(i,0,N) cin>>a[i];
    FOR(i,0,M) cin>>b[i];

    if(!check()){
    	cout << "Impossible" << endl;
    	return 0;
    }

    memset(memo,-1,sizeof(memo));
    FOR(i,s1,s2+1) if(solve(0,i)>=N*K){
    	cout << i-s1 << endl;
    	return 0;
    }
    cout << "Impossible" << endl;

   	

    

    return 0;
}
//Change your approach

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 116972 KB Output is correct
2 Correct 64 ms 116972 KB Output is correct
3 Correct 64 ms 116972 KB Output is correct
4 Correct 64 ms 116972 KB Output is correct
5 Correct 72 ms 116972 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 116972 KB Output is correct
2 Correct 64 ms 116972 KB Output is correct
3 Correct 64 ms 116972 KB Output is correct
4 Correct 64 ms 116972 KB Output is correct
5 Correct 72 ms 116972 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 67 ms 117080 KB Output is correct
10 Correct 65 ms 116972 KB Output is correct
11 Correct 67 ms 116972 KB Output is correct
12 Correct 64 ms 116972 KB Output is correct
13 Correct 66 ms 116972 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 116972 KB Output is correct
2 Correct 135 ms 116972 KB Output is correct
3 Correct 193 ms 117100 KB Output is correct
4 Correct 289 ms 116972 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 172 ms 116972 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 117100 KB Output is correct
2 Correct 66 ms 116972 KB Output is correct
3 Correct 65 ms 116904 KB Output is correct
4 Correct 64 ms 116972 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 116972 KB Output is correct
2 Correct 64 ms 116972 KB Output is correct
3 Correct 64 ms 116972 KB Output is correct
4 Correct 64 ms 116972 KB Output is correct
5 Correct 72 ms 116972 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 67 ms 117080 KB Output is correct
10 Correct 65 ms 116972 KB Output is correct
11 Correct 67 ms 116972 KB Output is correct
12 Correct 64 ms 116972 KB Output is correct
13 Correct 66 ms 116972 KB Output is correct
14 Correct 146 ms 116972 KB Output is correct
15 Correct 135 ms 116972 KB Output is correct
16 Correct 193 ms 117100 KB Output is correct
17 Correct 289 ms 116972 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 172 ms 116972 KB Output is correct
20 Correct 74 ms 117100 KB Output is correct
21 Correct 66 ms 116972 KB Output is correct
22 Correct 65 ms 116904 KB Output is correct
23 Correct 64 ms 116972 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 282 ms 117100 KB Output is correct
26 Correct 506 ms 116972 KB Output is correct
27 Correct 107 ms 116972 KB Output is correct
28 Correct 178 ms 116972 KB Output is correct
29 Correct 231 ms 117100 KB Output is correct
30 Correct 301 ms 116972 KB Output is correct