oj.uz

답안 #366752

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366752 2021-02-15T09:18:03 Z ACmachine Kitchen (BOI19_kitchen) C++17
100 / 100
 97 ms 1408 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, m, k;
    cin >> n >> m >> k;
    vi a(n); cin >> a;
    vi b(m); cin >> b;
    REP(i, n){
        if(a[i] < k){
            cout << "Impossible" << "\n";
            return 0;
        }
    }
    int sum_a = accumulate(all(a), 0);
    const int mxsum = 100000;
    vector<int> dp(mxsum, -1e7);
    vector<int> new_dp(mxsum, -1e7);
	dp[0] = 0;
    REP(i, m){
        REP(j, mxsum){
            new_dp[j] = max(new_dp[j], dp[j]);
            if(j - b[i] < 0) continue;
            new_dp[j] = max(new_dp[j], dp[j - b[i]] + min(b[i], n));
        }
        dp.swap(new_dp);
        fill(all(new_dp), -1e7);
    }
    int ans = INF;
    REP(j, mxsum){
        if(dp[j] >= k * n && j >= sum_a)
            ans = min(ans, j - sum_a); 
    }
    if(ans == INF){
        cout << "Impossible\n";
    }
    else{
        cout << ans << "\n";
    }
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 1260 KB Output is correct
2 Correct 68 ms 1408 KB Output is correct
3 Correct 97 ms 1132 KB Output is correct
4 Correct 88 ms 1132 KB Output is correct
5 Correct 85 ms 1132 KB Output is correct
6 Correct 70 ms 1260 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1132 KB Output is correct
2 Correct 13 ms 1132 KB Output is correct
3 Correct 13 ms 1132 KB Output is correct
4 Correct 13 ms 1132 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 2 ms 1132 KB Output is correct
3 Correct 2 ms 1132 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 2 ms 1132 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 1132 KB Output is correct
9 Correct 7 ms 1132 KB Output is correct
10 Correct 6 ms 1132 KB Output is correct
11 Correct 9 ms 1132 KB Output is correct
12 Correct 6 ms 1132 KB Output is correct
13 Correct 6 ms 1132 KB Output is correct
14 Correct 80 ms 1260 KB Output is correct
15 Correct 68 ms 1408 KB Output is correct
16 Correct 97 ms 1132 KB Output is correct
17 Correct 88 ms 1132 KB Output is correct
18 Correct 85 ms 1132 KB Output is correct
19 Correct 70 ms 1260 KB Output is correct
20 Correct 13 ms 1132 KB Output is correct
21 Correct 13 ms 1132 KB Output is correct
22 Correct 13 ms 1132 KB Output is correct
23 Correct 13 ms 1132 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 62 ms 1132 KB Output is correct
26 Correct 72 ms 1176 KB Output is correct
27 Correct 48 ms 1132 KB Output is correct
28 Correct 76 ms 1132 KB Output is correct
29 Correct 76 ms 1132 KB Output is correct
30 Correct 90 ms 1132 KB Output is correct