제출 #865960

#제출 시각아이디문제언어결과실행 시간메모리
865960SorahISAJob Scheduling (IOI19_job)C++17
21 / 100
3091 ms8904 KiB
#include "job.h" #include <bits/stdc++.h> using namespace std; using int64 = long long; int64 scheduling_cost(vector<int> p, vector<int> u, vector<int> d) { int N = p.size(); vector<int> alive(N, 1); int64 tim = 0, ans = 0; for (int _round = 0; _round < N; ++_round) { int id = -1; for (int i = 0; i < N; ++i) { if (alive[i] and (id == -1 or int64(d[i]) * u[id] < int64(d[id]) * u[i])) id = i; } if (p[id] == -1) { tim += d[id]; ans += int64(u[id]) * tim; } else { ans -= int64(d[id]) * u[p[id]]; d[p[id]] += d[id]; u[p[id]] += u[id]; } alive[id] = 0; for (int i = 0; i < N; ++i) { if (p[i] == id) p[i] = p[id]; } } 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...