제출 #1014610

#제출 시각아이디문제언어결과실행 시간메모리
1014610Error404Kitchen (BOI19_kitchen)C++17
21 / 100
86 ms137812 KiB
#include "bits/stdc++.h" using namespace std; #define ll long long #define f first #define s second #define pi pair<ll,ll> #define vi vector<ll> #define vd vector<double> #define vpi vector<pi> #define pb push_back #define INF 1e18 #define endl '\n' //#define int ll #define pii pair<pi,ll> const int mod = 1e9+7; const int MAX = 1e5+1; const int LOG = 30; vi g[MAX]; int tin[MAX], val[MAX], tout[MAX]; int up[LOG+1][MAX]; map<pi,int>mp; vector<pi>order; int timer = 0; signed main(){ int n,m,k,a,b; cin >>n >> m >> k; int dish[n+1], chef[m+1]; ll sum = 0, target = 0;; for(int i= 1; i<= n; i++){ cin >> dish[i]; target += dish[i]; if(dish[i]<k) { cout << "Impossible" << endl; return 0; } } for(int i = 1; i <=m; i++){ cin >> chef[i]; sum +=chef[i]; } ll dp[m+1][sum+1]; memset(dp,0,sizeof(dp)); dp[0][0]=0; for(int i =1; i <= m; i++){ for(int j = 0; j<=sum; j++){ dp[i][j] = dp[i-1][j]; if(j>=chef[i] ) dp[i][j] = max(dp[i][j], dp[i-1][j-chef[i]]+ min(chef[i], n)); } } for(int i = target; i <= sum; i++){ // cout <<dp[m][i]<<" "<< i << endl; if(dp[m][i]>=n*k){ cout << i-target << endl; return 0; } } cout << "Impossible" << endl; }

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

kitchen.cpp: In function 'int main()':
kitchen.cpp:30:15: warning: unused variable 'a' [-Wunused-variable]
   30 |     int n,m,k,a,b;
      |               ^
kitchen.cpp:30:17: warning: unused variable 'b' [-Wunused-variable]
   30 |     int n,m,k,a,b;
      |                 ^
#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...