제출 #745887

#제출 시각아이디문제언어결과실행 시간메모리
745887vjudge1Kitchen (BOI19_kitchen)C++17
0 / 100
215 ms90576 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 300; const int M = 15; int main(){ int n, m, k; cin >> n >> m >> k; vector <int> whours(n); for(int i = 0; i < n; i++){ cin >> whours[i]; } vector <int> reality(m); for(int i = 0; i < m; i++){ cin >> reality[i]; } /*for(int i : whours) cout << i <<endl; for(int i : reality) cout << i;*/ int cntw = 0; int cntr = 0; int dif = n*k; int maxi = N*(M+1); int darab, darab2 = 0; for(int i = 0; i < whours.size(); i++){ cntw += whours[i]; } if(m < k || dif > maxi)cout << "Impossible\n"; int dp[maxi+1][maxi+1]; for(int c = 0; c < reality.size(); c++){ darab = min(darab, c); darab2 = c; } for(int i = maxi; i >= darab; i--){ for(int j = maxi; j >= darab2; j--){ dp[darab][darab2] |= dp[i - darab][j - darab2]; } } for(int i = cntw; i < maxi; i++){ for(int j = dif; j < maxi; j++){ if(dp[j][i]){ cout << i - maxi << '\n'; } } //cout << "Impossible\n"; } /*else if(m == 2 && k == 1){ for(int i = 0; i < reality.size(); i++){ cntr = min(cntr, reality[i]); } cout << cntr - cntw; } else{ for(int i = 0; i < reality.size(); i++){ cntr += reality[i]; } cout << cntr - cntw; }*/ }

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

kitchen.cpp: In function 'int main()':
kitchen.cpp:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for(int i = 0; i < whours.size(); i++){
      |                 ~~^~~~~~~~~~~~~~~
kitchen.cpp:35:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for(int c = 0; c < reality.size(); c++){
      |                 ~~^~~~~~~~~~~~~~~~
kitchen.cpp:23:6: warning: unused variable 'cntr' [-Wunused-variable]
   23 |  int cntr = 0;
      |      ^~~~
kitchen.cpp:42:22: warning: 'darab' may be used uninitialized in this function [-Wmaybe-uninitialized]
   42 |    dp[darab][darab2] |= dp[i - darab][j - darab2];
      |    ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...