oj.uz

답안 #318929

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
318929 2020-11-03T12:49:36 Z alextodoran Job Scheduling (IOI19_job) C++17
24 / 100
 312 ms 72292 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.u) > make_pair(v.c, v.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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 10 ms 14444 KB Output is correct
4 Correct 11 ms 14700 KB Output is correct
5 Correct 49 ms 27748 KB Output is correct
6 Correct 87 ms 41060 KB Output is correct
7 Correct 127 ms 54372 KB Output is correct
8 Correct 158 ms 67908 KB Output is correct
9 Correct 163 ms 67684 KB Output is correct
10 Correct 155 ms 67684 KB Output is correct
11 Correct 11 ms 14444 KB Output is correct
12 Correct 159 ms 67812 KB Output is correct
13 Correct 165 ms 67812 KB Output is correct
14 Correct 158 ms 67652 KB Output is correct
15 Correct 160 ms 67580 KB Output is correct
16 Correct 160 ms 67684 KB Output is correct
17 Correct 155 ms 67684 KB Output is correct
18 Correct 157 ms 67684 KB Output is correct
19 Correct 153 ms 63204 KB Output is correct
20 Correct 154 ms 72292 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 10 ms 14444 KB Output is correct
4 Correct 282 ms 38868 KB Output is correct
5 Correct 272 ms 38868 KB Output is correct
6 Correct 281 ms 38868 KB Output is correct
7 Correct 278 ms 38868 KB Output is correct
8 Correct 284 ms 38996 KB Output is correct
9 Correct 267 ms 38996 KB Output is correct
10 Correct 312 ms 35928 KB Output is correct
11 Correct 276 ms 38868 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 10 ms 14444 KB Output is correct
4 Correct 11 ms 14700 KB Output is correct
5 Correct 18 ms 15792 KB Output is correct
6 Correct 262 ms 38932 KB Output is correct
7 Correct 258 ms 39040 KB Output is correct
8 Correct 260 ms 38868 KB Output is correct
9 Correct 251 ms 38868 KB Output is correct
10 Correct 10 ms 14444 KB Output is correct
11 Correct 11 ms 14572 KB Output is correct
12 Correct 17 ms 15596 KB Output is correct
13 Correct 19 ms 15792 KB Output is correct
14 Correct 252 ms 38868 KB Output is correct
15 Correct 257 ms 38996 KB Output is correct
16 Correct 256 ms 38868 KB Output is correct
17 Correct 259 ms 38868 KB Output is correct
18 Correct 264 ms 38904 KB Output is correct
19 Correct 256 ms 38868 KB Output is correct
20 Correct 268 ms 38992 KB Output is correct
21 Correct 260 ms 38868 KB Output is correct
22 Correct 260 ms 38868 KB Output is correct
23 Correct 267 ms 38872 KB Output is correct
24 Correct 260 ms 38996 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 10 ms 14444 KB Output is correct
4 Correct 11 ms 14700 KB Output is correct
5 Correct 49 ms 27748 KB Output is correct
6 Correct 87 ms 41060 KB Output is correct
7 Correct 127 ms 54372 KB Output is correct
8 Correct 158 ms 67908 KB Output is correct
9 Correct 163 ms 67684 KB Output is correct
10 Correct 155 ms 67684 KB Output is correct
11 Correct 11 ms 14444 KB Output is correct
12 Correct 159 ms 67812 KB Output is correct
13 Correct 165 ms 67812 KB Output is correct
14 Correct 158 ms 67652 KB Output is correct
15 Correct 160 ms 67580 KB Output is correct
16 Correct 160 ms 67684 KB Output is correct
17 Correct 155 ms 67684 KB Output is correct
18 Correct 157 ms 67684 KB Output is correct
19 Correct 153 ms 63204 KB Output is correct
20 Correct 154 ms 72292 KB Output is correct
21 Correct 11 ms 14444 KB Output is correct
22 Correct 10 ms 14444 KB Output is correct
23 Correct 10 ms 14444 KB Output is correct
24 Correct 282 ms 38868 KB Output is correct
25 Correct 272 ms 38868 KB Output is correct
26 Correct 281 ms 38868 KB Output is correct
27 Correct 278 ms 38868 KB Output is correct
28 Correct 284 ms 38996 KB Output is correct
29 Correct 267 ms 38996 KB Output is correct
30 Correct 312 ms 35928 KB Output is correct
31 Correct 276 ms 38868 KB Output is correct
32 Correct 10 ms 14444 KB Output is correct
33 Correct 10 ms 14444 KB Output is correct
34 Correct 10 ms 14444 KB Output is correct
35 Correct 11 ms 14700 KB Output is correct
36 Correct 18 ms 15792 KB Output is correct
37 Correct 262 ms 38932 KB Output is correct
38 Correct 258 ms 39040 KB Output is correct
39 Correct 260 ms 38868 KB Output is correct
40 Correct 251 ms 38868 KB Output is correct
41 Correct 10 ms 14444 KB Output is correct
42 Correct 11 ms 14572 KB Output is correct
43 Correct 17 ms 15596 KB Output is correct
44 Correct 19 ms 15792 KB Output is correct
45 Correct 252 ms 38868 KB Output is correct
46 Correct 257 ms 38996 KB Output is correct
47 Correct 256 ms 38868 KB Output is correct
48 Correct 259 ms 38868 KB Output is correct
49 Correct 264 ms 38904 KB Output is correct
50 Correct 256 ms 38868 KB Output is correct
51 Correct 268 ms 38992 KB Output is correct
52 Correct 260 ms 38868 KB Output is correct
53 Correct 260 ms 38868 KB Output is correct
54 Correct 267 ms 38872 KB Output is correct
55 Correct 260 ms 38996 KB Output is correct
56 Incorrect 10 ms 14444 KB Output isn't correct
57 Halted 0 ms 0 KB -