Submission #1059498

#TimeUsernameProblemLanguageResultExecution timeMemory
1059498mindiyakKitchen (BOI19_kitchen)C++14
0 / 100
6 ms716 KiB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops") #include <bits/stdc++.h> #include <string> #include <iostream> #include <cmath> #include <numeric> #include <stack> #include <queue> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<ld, ld> pd; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<vector<int>> vvi; typedef vector<vector<pi>> vvpi; typedef vector<ld> vd; typedef vector<long long> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; #define FOR(i, a, b) for (int i = a; i < (b); i++) #define F0R(i, a) for (int i = 0; i < (a); i++) #define FORd(i, a, b) for (int i = (b)-1; i >= a; i--) #define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--) #define trav(a, x) for (auto &a : x) #define uid(a, b) uniform_int_distribution<int>(a, b)(rng) #define len(x) (int)(x).size() #define mp make_pair #define pb push_back #define F first #define nl endl #define S second #define lb lower_bound #define ub upper_bound #define aint(x) x.begin(), x.end() #define raint(x) x.rbegin(), x.rend() #define ins insert const int M = 1e9+7; void init(string name) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } void fastIO() { ios_base::sync_with_stdio(0); cin.tie(0); } int n,m,k; void solve() { cin >> n >> m >> k; bool ok = 1; vi food(n); FOR(i,0,n)cin >> food[i]; vi chefs(n); FOR(i,0,m)cin >> chefs[i]; FOR(i,0,n)ok = ok & (food[i] >= k); int suma = 0,sumb = 0; FOR(i,0,n)suma += food[i]; FOR(i,0,m)sumb += chefs[i]; ok = ok & (sumb >= suma); // cerr << ok << endl; if(ok == 0){ cout << "Impossible" << endl; } const int NMAX = 300*300; vi dp(NMAX+2,-1); sumb = 0; dp[0] = 0; for(int i=1;i<=m;i++){ for(int j=sumb;j>=0;j--){ if(dp[j]!=-1) dp[j+chefs[i-1]]=max(dp[j+chefs[i-1]],dp[j]+min(n,chefs[i-1])); } sumb += chefs[i-1]; } FOR(i,0,20)cerr << dp[i] << " "; cerr << endl; FOR(i,suma,NMAX+1){ if(dp[i] >= n*k){ cout << i-suma << endl; return; } } cout << "Impossible" << endl; } int main() { fastIO(); // init("test"); int t = 1; // cin >> t; while (t--) solve(); return 0; }

Compilation message (stderr)

kitchen.cpp: In function 'void init(std::string)':
kitchen.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
kitchen.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...