Submission #293067

#	Time	Username	Problem	Language	Result	Execution time	Memory
293067		Autoratch	Job Scheduling (IOI19_job)	C++14	24 / 100	155 ms	14952 KiB

job

#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)d[i]/(double)u[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+=(long long)d[x],ans+=now*(long long)u[x],visited[x] = true;
    }
    return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 0 / 18
• Subtask 5: 0 / 21
• Subtask 6: 0 / 37