제출 #1014551

#제출 시각아이디문제언어결과실행 시간메모리
1014551Error404Kitchen (BOI19_kitchen)C++17
0 / 100
1 ms2652 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; void dfs(int from,int pr){ tin[from]= ++timer; up[0][from] = pr; for(int i=1 ; i <= LOG; i++){ up[i][from] = up[i-1][up[i-1][from]]; } for(int to :g[from]){ if(to==pr) continue; dfs(to,from); } tout[from]=++timer; } bool anc(int u,int v){ return tin[u]<=tin[v] && tout[u]>=tout[v]; } ll dfs1(int from,int pr){ ll sum = val[from]; ll hk; for(int to :g[from]){ if(to==pr) continue; hk = dfs1(to,from); sum+=hk; int a = min(from,to); int b = max(from,to); mp[{a,b}]+=hk; } return sum; } int lca(int u, int v){ if(anc(u,v)) return u; if(anc(v,u)) return v; for(int i = LOG; i > 0; i--){ if(anc(up[i][u], v)) continue; u= up[i][u]; } return up[0][u]; } signed main(){ int n,m,k,a,b; cin >>n >> m >> k; int dish[n+1], chef[m+1]; for(int i= 1; i<= n; i++){ cin >> dish[i]; } multiset<int>st; for(int i = 1; i <=m; i++){ cin >> chef[i]; st.insert(chef[i]); } ll ans = 0; bool flag = false; for(int i = 1; i <=n; i++){ auto j = st.lower_bound(dish[i]); if(j==st.end()) { cout << "Impossible"<<endl; return 0; } ans += (*j)-dish[i]; st.erase(j); } cout << ans << endl; }

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

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