제출 #210888

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
210888	2020-03-19 01:31:29	daniel920712	Job Scheduling (IOI19_job)	C++14	24 / 100	162 ms	24424 KiB

job

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "job.h"
#include <vector>
#include <queue>
using namespace std;
vector < int > Next[200005];
struct A
{
    long long u,t,where;
}all[200005];
bool operator > (A a,A b)
{
    return a.u*b.t<b.u*a.t;
}
priority_queue < A , vector < A > , greater < A > > how;
long long scheduling_cost(std::vector<int> p, std::vector<int> u, std::vector<int> d)
{
    long long N=(long long) u.size(),ans=0,t=0,i;
    for(i=0;i<N;i++)
    {
        all[i].u=u[i];
        all[i].t=d[i];
        all[i].where=i;
    }
    for(i=1;i<N;i++) Next[p[i]].push_back(i);
    how.push(all[0]);
    while(!how.empty())
    {
        A a=how.top();
        how.pop();
        t+=a.t;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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