제출 #367370

#제출 시각아이디문제언어결과실행 시간메모리
367370PurpleCrayonJob Scheduling (IOI19_job)C++17
0 / 100
1 ms544 KiB
#include "job.h" #include <bits/stdc++.h> using namespace std; #define sz(v) int(v.size()) #define ar array typedef long long ll; ll scheduling_cost(vector<int> p, vector<int> u, vector<int> d) { int n=sz(p); vector<vector<int>> ch(n); for (int i = 1; i < n; i++) ch[p[i]].push_back(i); auto cmp = [&](int i, int j) -> bool { return ll(d[j])*ll(u[i]) < ll(d[i])*ll(u[j]); }; priority_queue<int, vector<int>, decltype(cmp)> roots(cmp); ll ans=0, t=0; roots.push(0); while (sz(roots)){ int c=roots.top(); roots.pop(); t += d[c], ans += t*u[c]; for (auto nxt : ch[c]) roots.push(nxt); } cout << ans << '\n'; }

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

job.cpp: In function 'll scheduling_cost(std::vector<int>, std::vector<int>, std::vector<int>)':
job.cpp:28:1: warning: no return statement in function returning non-void [-Wreturn-type]
   28 | }
      | ^
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...