Submission #417341

#TimeUsernameProblemLanguageResultExecution timeMemory
417341rama_pangJob Scheduling (IOI19_job)C++17
0 / 100
95 ms8236 KiB
#include "job.h" #include <bits/stdc++.h> using namespace std; using lint = long long; lint scheduling_cost(vector<int> p, vector<int> u, vector<int> d) { int n = p.size(); lint ans = 0; if (accumulate(begin(p), end(p), 0ll) == 0) { sort(begin(u), end(u)); lint t = 0; for (int i = 0; i < n; i++) { ans += (t + d[i]) * u[i]; t += d[i]; } } else { lint t = 0; for (int i = 0; i < n; i++) { ans += (t + d[i]) * u[i]; t += d[i]; } } return ans; }
#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...