제출 #293041

#제출 시각아이디문제언어결과실행 시간메모리
293041AutoratchJob Scheduling (IOI19_job)C++14
24 / 100
198 ms18024 KiB
#include "job.h" #include <bits/stdc++.h> using namespace std; const int N = 2e5 + 1; int n; vector<int> adj[N],rev; bool visited[N]; priority_queue<pair<double,int> > q; long long now,ans; long long scheduling_cost(vector<int> p,vector<int> u,vector<int> d) { n = p.size(); for(int i = 0;i < n;i++) q.push({(double)u[i]/(double)d[i],i}); while(!q.empty()) { int x = q.top().second; q.pop(); rev.clear(); while(x!=-1 and !visited[x]) rev.push_back(x),x = p[x]; reverse(rev.begin(),rev.end()); for(int x : rev) now+=d[x],ans+=now*u[x],visited[x] = true; } 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...