답안 #211337

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
211337	2020-03-20T06:16:19 Z	eric_xiao	Job Scheduling (IOI19_job)	C++14	0 / 100	12 ms	1408 KB

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll N,t,ans;
ll DSU[300009],up[300009],fin[300009];
vector<int> tim,cost,par;
ll Find(ll a)
{
    if(a == DSU[a]) return a;
    DSU[a] = Find(DSU[a]);
    return DSU[a];
}
struct cmp{
    bool operator()(ll a, ll b)const {
        return cost[a]*tim[b] > cost[b]*tim[a];
    }
};
set<ll,cmp> st;
ll scheduling_cost(vector<int> P,vector<int> U,vector<int> D)
{
    N = P.size();
    par = P;
    cost = U;
    tim = D;
    ll i;
    for(i = 0;i < N;i++)
    {
         DSU[i] = i;
         st.insert(i);
    }
    for(i = 0;i < N;i++)
    {
         ll now = *st.begin();
         st.erase(now);
         if(P[now] == -1 || fin[Find(P[now])] == 1)
         {
             t += tim[now];
             ans += cost[now]*t;
             fin[now] = 1;
             continue;
         }
         ll top = up[P[now]];
         st.erase(top);
         ans -= cost[top]*tim[now];
         cost[top] += cost[now];
         tim[top] += tim[now];
         st.insert(top);
         DSU[now] = top;
    }
    return ans;
}

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Incorrect	4 ms	384 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	288 KB	Output is correct
4	Correct	5 ms	512 KB	Output is correct
5	Incorrect	12 ms	1408 KB	Output isn't correct
6	Halted	0 ms	0 KB	-