oj.uz

Submission #318983

# Submission time Handle Problem Language Result Execution time Memory
318983 2020-11-03T16:01:45 Z alextodoran Job Scheduling (IOI19_job) C++17
24 / 100
 288 ms 67680 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);
}

ll answer = 0;
set <Node> notJoined[N_MAX];

void mergeSets (int u, int v)
{
   answer += (ll)cost[u].d * cost[v].u;
   cost[u].d += cost[v].d;
   cost[u].u += cost[v].u;
   set <Node> &in = notJoined[u];
   set <Node> &from = notJoined[v];

   if(in.size() < from.size())
       swap(in, from);
   while(from.empty() == false)
   {
       in.insert(*from.begin());
       from.erase(from.begin());
   }
}

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

int order[N_MAX];

int curr;

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]};
       answer += (ll)cost[i].u * cost[i].d;
   }
   for(int i = 2; i <= n; i++)
       sons[parent[i]].push_back(i);
   dfs(1);
   while(!notJoined[1].empty())
   {
       int v = notJoined[1].begin()->u;
       notJoined[1].erase(notJoined[1].begin());
       mergeSets(1, v);
   }
   return answer;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 10 ms 14592 KB Output is correct
4 Correct 11 ms 14700 KB Output is correct
5 Correct 39 ms 25568 KB Output is correct
6 Correct 70 ms 36836 KB Output is correct
7 Correct 101 ms 48100 KB Output is correct
8 Correct 129 ms 59236 KB Output is correct
9 Correct 136 ms 59444 KB Output is correct
10 Correct 135 ms 59236 KB Output is correct
11 Correct 10 ms 14444 KB Output is correct
12 Correct 130 ms 59360 KB Output is correct
13 Correct 133 ms 59236 KB Output is correct
14 Correct 131 ms 59364 KB Output is correct
15 Correct 129 ms 59108 KB Output is correct
16 Correct 125 ms 59236 KB Output is correct
17 Correct 151 ms 59364 KB Output is correct
18 Correct 131 ms 59352 KB Output is correct
19 Correct 130 ms 59112 KB Output is correct
20 Correct 135 ms 67680 KB Output is correct

Subtask #2
7.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 Correct 10 ms 14444 KB Output is correct
4 Correct 282 ms 36496 KB Output is correct
5 Correct 258 ms 36568 KB Output is correct
6 Correct 256 ms 36568 KB Output is correct
7 Correct 270 ms 36504 KB Output is correct
8 Correct 260 ms 36636 KB Output is correct
9 Correct 271 ms 36696 KB Output is correct
10 Correct 250 ms 36568 KB Output is correct
11 Correct 256 ms 36568 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory 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 14572 KB Output is correct
5 Correct 17 ms 15596 KB Output is correct
6 Correct 258 ms 37212 KB Output is correct
7 Correct 249 ms 37080 KB Output is correct
8 Correct 256 ms 37080 KB Output is correct
9 Correct 288 ms 37208 KB Output is correct
10 Correct 10 ms 14444 KB Output is correct
11 Correct 11 ms 14572 KB Output is correct
12 Correct 16 ms 15468 KB Output is correct
13 Correct 17 ms 15596 KB Output is correct
14 Correct 264 ms 37080 KB Output is correct
15 Correct 254 ms 37208 KB Output is correct
16 Correct 268 ms 37128 KB Output is correct
17 Correct 270 ms 37080 KB Output is correct
18 Correct 255 ms 37080 KB Output is correct
19 Correct 255 ms 37080 KB Output is correct
20 Correct 254 ms 37080 KB Output is correct
21 Correct 271 ms 37080 KB Output is correct
22 Correct 258 ms 37208 KB Output is correct
23 Correct 252 ms 37036 KB Output is correct
24 Correct 249 ms 37208 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 11 ms 14444 KB Output is correct
3 Incorrect 10 ms 14444 KB Output isn't correct
4 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 10 ms 14444 KB Output is correct
3 Correct 10 ms 14592 KB Output is correct
4 Correct 11 ms 14700 KB Output is correct
5 Correct 39 ms 25568 KB Output is correct
6 Correct 70 ms 36836 KB Output is correct
7 Correct 101 ms 48100 KB Output is correct
8 Correct 129 ms 59236 KB Output is correct
9 Correct 136 ms 59444 KB Output is correct
10 Correct 135 ms 59236 KB Output is correct
11 Correct 10 ms 14444 KB Output is correct
12 Correct 130 ms 59360 KB Output is correct
13 Correct 133 ms 59236 KB Output is correct
14 Correct 131 ms 59364 KB Output is correct
15 Correct 129 ms 59108 KB Output is correct
16 Correct 125 ms 59236 KB Output is correct
17 Correct 151 ms 59364 KB Output is correct
18 Correct 131 ms 59352 KB Output is correct
19 Correct 130 ms 59112 KB Output is correct
20 Correct 135 ms 67680 KB Output is correct
21 Correct 10 ms 14572 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 36496 KB Output is correct
25 Correct 258 ms 36568 KB Output is correct
26 Correct 256 ms 36568 KB Output is correct
27 Correct 270 ms 36504 KB Output is correct
28 Correct 260 ms 36636 KB Output is correct
29 Correct 271 ms 36696 KB Output is correct
30 Correct 250 ms 36568 KB Output is correct
31 Correct 256 ms 36568 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 14572 KB Output is correct
36 Correct 17 ms 15596 KB Output is correct
37 Correct 258 ms 37212 KB Output is correct
38 Correct 249 ms 37080 KB Output is correct
39 Correct 256 ms 37080 KB Output is correct
40 Correct 288 ms 37208 KB Output is correct
41 Correct 10 ms 14444 KB Output is correct
42 Correct 11 ms 14572 KB Output is correct
43 Correct 16 ms 15468 KB Output is correct
44 Correct 17 ms 15596 KB Output is correct
45 Correct 264 ms 37080 KB Output is correct
46 Correct 254 ms 37208 KB Output is correct
47 Correct 268 ms 37128 KB Output is correct
48 Correct 270 ms 37080 KB Output is correct
49 Correct 255 ms 37080 KB Output is correct
50 Correct 255 ms 37080 KB Output is correct
51 Correct 254 ms 37080 KB Output is correct
52 Correct 271 ms 37080 KB Output is correct
53 Correct 258 ms 37208 KB Output is correct
54 Correct 252 ms 37036 KB Output is correct
55 Correct 249 ms 37208 KB Output is correct
56 Correct 11 ms 14444 KB Output is correct
57 Incorrect 122 ms 45236 KB Output isn't correct
58 Halted 0 ms 0 KB -