oj.uz

답안 #318913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
318913 2020-11-03T12:23:27 Z alextodoran Job Scheduling (IOI19_job) C++17
24 / 100
 173 ms 56916 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>
#include "job.h"

using namespace std;

typedef long long ll;

const int N_MAX = 200002;

int n;

struct Cost
{
    int d, u;
};

Cost cost[N_MAX];

int parent[N_MAX];

vector <int> sons[N_MAX];

bool operator < (const Cost &a, const Cost &b)
{
    return a.d * b.u < b.d * a.u;
}

struct Node
{
    int u;
    Cost c;
};

bool operator < (const Node &u, const Node &v)
{
    return make_pair(u.c, u) > make_pair(v.c, u);
}

set <Node> notJoined[N_MAX];

void mergeSets (set <Node>* in, set <Node>* from)
{
    bool swapped = false;
    if(in->size() < from->size())
    {
        swap(in, from);
        swapped = true;
    }
    while(from->empty() == false)
    {
        in->insert(*from->begin());
        from->erase(from->begin());
    }
    if(swapped == true)
        swap(in, from);
}

bool isRoot[N_MAX];

void dfs (int u)
{
    for(int v : sons[u])
    {
        dfs(v);
        notJoined[u].insert(Node{v, cost[v]});
    }
    isRoot[u] = true;
    while(notJoined[u].empty() == false)
    {
        int v = notJoined[u].begin()->u;
        if(cost[u] < cost[v])
            break;
        notJoined[u].erase(notJoined[u].begin());
        isRoot[v] = false;
        cost[u].d += cost[v].d;
        cost[u].u += cost[v].u;
        mergeSets(&notJoined[u], &notJoined[v]);
    }
}

int order[N_MAX];

int curr;

void solveOne (int u)
{
    order[++curr] = u;
    vector <pair <Cost, int> > aux;
    for(int v : sons[u])
        //if(isRoot[v] == false)
            aux.push_back(make_pair(cost[v], v));
    sort(aux.begin(), aux.end());
    for(pair <Cost, int> p : aux)
        solveOne(p.second);
}

void solveAll (int u)
{
    solveOne(u);
    vector <int> aux;
    while(notJoined[u].empty() == false)
    {
        int v = notJoined[u].begin()->u;
        notJoined[u].erase(notJoined[u].begin());
        aux.push_back(v);
    }
    reverse(aux.begin(), aux.end());
    for(int v : aux)
        solveOne(v);
}

ll scheduling_cost (vector <int> p, vector <int> u, vector <int> d)
{
    n = p.size();
    for(int i = 1; i <= n; i++)
    {
        parent[i] = p[i - 1] + 1;
        cost[i] = Cost{d[i - 1], u[i - 1]};
    }
    for(int i = 2; i <= n; i++)
        sons[parent[i]].push_back(i);
    //dfs(1);
    solveOne(1);
    int currTime = 0;
    ll ans = 0;
    for(int i = 1; i <= n; i++)
    {
        int j = order[i];
        currTime += d[j - 1];
        ans += 1LL * currTime * u[j - 1];
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14444 KB Output is correct
2 Correct 11 ms 14444 KB Output is correct
3 Correct 12 ms 14484 KB Output is correct
4 Correct 10 ms 14732 KB Output is correct
5 Correct 39 ms 24264 KB Output is correct
6 Correct 67 ms 34020 KB Output is correct
7 Correct 101 ms 43748 KB Output is correct
8 Correct 129 ms 56752 KB Output is correct
9 Correct 126 ms 56804 KB Output is correct
10 Correct 172 ms 56804 KB Output is correct
11 Correct 12 ms 14444 KB Output is correct
12 Correct 144 ms 56908 KB Output is correct
13 Correct 128 ms 56916 KB Output is correct
14 Correct 160 ms 56808 KB Output is correct
15 Correct 131 ms 56792 KB Output is correct
16 Correct 149 ms 56740 KB Output is correct
17 Correct 130 ms 56844 KB Output is correct
18 Correct 131 ms 56676 KB Output is correct
19 Correct 125 ms 56776 KB Output is correct
20 Correct 137 ms 56804 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14440 KB Output is correct
2 Correct 11 ms 14572 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 114 ms 27984 KB Output is correct
5 Correct 112 ms 27860 KB Output is correct
6 Correct 115 ms 27924 KB Output is correct
7 Correct 112 ms 27932 KB Output is correct
8 Correct 118 ms 27952 KB Output is correct
9 Correct 112 ms 27880 KB Output is correct
10 Correct 113 ms 28160 KB Output is correct
11 Correct 113 ms 27984 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14620 KB Output is correct
2 Correct 13 ms 14572 KB Output is correct
3 Correct 10 ms 14444 KB Output is correct
4 Correct 13 ms 14444 KB Output is correct
5 Correct 15 ms 15324 KB Output is correct
6 Correct 118 ms 28496 KB Output is correct
7 Correct 151 ms 28500 KB Output is correct
8 Correct 173 ms 28592 KB Output is correct
9 Correct 134 ms 28624 KB Output is correct
10 Correct 11 ms 14448 KB Output is correct
11 Correct 12 ms 14524 KB Output is correct
12 Correct 14 ms 15212 KB Output is correct
13 Correct 17 ms 15324 KB Output is correct
14 Correct 114 ms 28576 KB Output is correct
15 Correct 112 ms 28456 KB Output is correct
16 Correct 118 ms 28532 KB Output is correct
17 Correct 111 ms 28500 KB Output is correct
18 Correct 115 ms 28472 KB Output is correct
19 Correct 115 ms 28500 KB Output is correct
20 Correct 110 ms 28500 KB Output is correct
21 Correct 120 ms 28500 KB Output is correct
22 Correct 127 ms 28520 KB Output is correct
23 Correct 113 ms 28468 KB Output is correct
24 Correct 115 ms 28496 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14444 KB Output is correct
2 Correct 11 ms 14444 KB Output is correct
3 Correct 12 ms 14484 KB Output is correct
4 Correct 10 ms 14732 KB Output is correct
5 Correct 39 ms 24264 KB Output is correct
6 Correct 67 ms 34020 KB Output is correct
7 Correct 101 ms 43748 KB Output is correct
8 Correct 129 ms 56752 KB Output is correct
9 Correct 126 ms 56804 KB Output is correct
10 Correct 172 ms 56804 KB Output is correct
11 Correct 12 ms 14444 KB Output is correct
12 Correct 144 ms 56908 KB Output is correct
13 Correct 128 ms 56916 KB Output is correct
14 Correct 160 ms 56808 KB Output is correct
15 Correct 131 ms 56792 KB Output is correct
16 Correct 149 ms 56740 KB Output is correct
17 Correct 130 ms 56844 KB Output is correct
18 Correct 131 ms 56676 KB Output is correct
19 Correct 125 ms 56776 KB Output is correct
20 Correct 137 ms 56804 KB Output is correct
21 Correct 12 ms 14440 KB Output is correct
22 Correct 11 ms 14572 KB Output is correct
23 Correct 11 ms 14444 KB Output is correct
24 Correct 114 ms 27984 KB Output is correct
25 Correct 112 ms 27860 KB Output is correct
26 Correct 115 ms 27924 KB Output is correct
27 Correct 112 ms 27932 KB Output is correct
28 Correct 118 ms 27952 KB Output is correct
29 Correct 112 ms 27880 KB Output is correct
30 Correct 113 ms 28160 KB Output is correct
31 Correct 113 ms 27984 KB Output is correct
32 Correct 10 ms 14620 KB Output is correct
33 Correct 13 ms 14572 KB Output is correct
34 Correct 10 ms 14444 KB Output is correct
35 Correct 13 ms 14444 KB Output is correct
36 Correct 15 ms 15324 KB Output is correct
37 Correct 118 ms 28496 KB Output is correct
38 Correct 151 ms 28500 KB Output is correct
39 Correct 173 ms 28592 KB Output is correct
40 Correct 134 ms 28624 KB Output is correct
41 Correct 11 ms 14448 KB Output is correct
42 Correct 12 ms 14524 KB Output is correct
43 Correct 14 ms 15212 KB Output is correct
44 Correct 17 ms 15324 KB Output is correct
45 Correct 114 ms 28576 KB Output is correct
46 Correct 112 ms 28456 KB Output is correct
47 Correct 118 ms 28532 KB Output is correct
48 Correct 111 ms 28500 KB Output is correct
49 Correct 115 ms 28472 KB Output is correct
50 Correct 115 ms 28500 KB Output is correct
51 Correct 110 ms 28500 KB Output is correct
52 Correct 120 ms 28500 KB Output is correct
53 Correct 127 ms 28520 KB Output is correct
54 Correct 113 ms 28468 KB Output is correct
55 Correct 115 ms 28496 KB Output is correct
56 Incorrect 10 ms 14536 KB Output isn't correct
57 Halted 0 ms 0 KB -