제출 #925949

#제출 시각아이디문제언어결과실행 시간메모리
925949vjudge1Kitchen (BOI19_kitchen)C++17
100 / 100
28 ms1172 KiB
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") #include<bits/stdc++.h> using namespace std; #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define sz(a) (int)a.size() #define s second #define f first using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}}; const int N = 2e5 + 1, mod = 998244353; const ll inf = 1e9; double eps = 1e-15; bool flg = 0; void slv() { int n, m, k; cin >> n >> m >> k; int a[n], v = 0; for (int i = 0; i < n; i++) { cin >> a[i]; v += a[i]; if (a[i] < k) { cout << "Impossible"; return; } } int b[m], w = 0; for (int i = 0; i < m; i++) { cin >> b[i]; w += b[i]; } int pr[w + 1]; vector<int> dp(w + 1, -inf); dp[0] = 0; for (int i = 0; i < m; i++) { for (int j = w; j >= b[i]; j--) { if (dp[j] < dp[j - b[i]] + min(n, b[i])) { dp[j] = dp[j - b[i]] + min(n, b[i]); pr[j] = i; } } } for (int x = v; x <= w; x++) { if (dp[x] < k * n) continue; cout << x - v; return; } cout << "Impossible"; } main() { //freopen("rsq.in", "r", stdin); //freopen("rsq.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); int tp = 1; if (flg) cin >> tp; while (tp--) { slv(); } } //wenomechainsama

컴파일 시 표준 에러 (stderr) 메시지

kitchen.cpp: In function 'void slv()':
kitchen.cpp:48:6: warning: variable 'pr' set but not used [-Wunused-but-set-variable]
   48 |  int pr[w + 1];
      |      ^~
kitchen.cpp: At global scope:
kitchen.cpp:67:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   67 | main() {
      | ^~~~
#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...