oj.uz

Submission #318917

# Submission time Handle Problem Language Result Execution time Memory
318917 2020-11-03T12:29:29 Z alextodoran Job Scheduling (IOI19_job) C++17
5 / 100
 185 ms 262148 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)
        solveAll(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

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 13 ms 14628 KB Output is correct
3 Correct 12 ms 14444 KB Output is correct
4 Correct 13 ms 14700 KB Output is correct
5 Correct 59 ms 26216 KB Output is correct
6 Correct 81 ms 37976 KB Output is correct
7 Correct 118 ms 49768 KB Output is correct
8 Correct 146 ms 61464 KB Output is correct
9 Correct 150 ms 61532 KB Output is correct
10 Correct 154 ms 61480 KB Output is correct
11 Correct 10 ms 14444 KB Output is correct
12 Correct 167 ms 61588 KB Output is correct
13 Correct 147 ms 61540 KB Output is correct
14 Correct 148 ms 61384 KB Output is correct
15 Correct 152 ms 61284 KB Output is correct
16 Correct 164 ms 61340 KB Output is correct
17 Correct 157 ms 61476 KB Output is correct
18 Correct 150 ms 61540 KB Output is correct
19 Correct 154 ms 57028 KB Output is correct
20 Correct 151 ms 66060 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14572 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Runtime error 153 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14444 KB Output is correct
2 Correct 11 ms 14620 KB Output is correct
3 Correct 10 ms 14448 KB Output is correct
4 Correct 14 ms 14572 KB Output is correct
5 Runtime error 185 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 14444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14532 KB Output is correct
2 Incorrect 11 ms 14484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 13 ms 14628 KB Output is correct
3 Correct 12 ms 14444 KB Output is correct
4 Correct 13 ms 14700 KB Output is correct
5 Correct 59 ms 26216 KB Output is correct
6 Correct 81 ms 37976 KB Output is correct
7 Correct 118 ms 49768 KB Output is correct
8 Correct 146 ms 61464 KB Output is correct
9 Correct 150 ms 61532 KB Output is correct
10 Correct 154 ms 61480 KB Output is correct
11 Correct 10 ms 14444 KB Output is correct
12 Correct 167 ms 61588 KB Output is correct
13 Correct 147 ms 61540 KB Output is correct
14 Correct 148 ms 61384 KB Output is correct
15 Correct 152 ms 61284 KB Output is correct
16 Correct 164 ms 61340 KB Output is correct
17 Correct 157 ms 61476 KB Output is correct
18 Correct 150 ms 61540 KB Output is correct
19 Correct 154 ms 57028 KB Output is correct
20 Correct 151 ms 66060 KB Output is correct
21 Correct 10 ms 14572 KB Output is correct
22 Correct 10 ms 14444 KB Output is correct
23 Runtime error 153 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -