oj.uz

Submission #318986

# Submission time Handle Problem Language Result Execution time Memory
318986 2020-11-03T16:13:00 Z alextodoran Job Scheduling (IOI19_job) C++17
24 / 100
 324 ms 67940 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 (ll)a.d * b.u < (ll)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[v] < cost[u])
           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 14444 KB Output is correct
4 Correct 11 ms 14700 KB Output is correct
5 Correct 40 ms 25580 KB Output is correct
6 Correct 69 ms 36708 KB Output is correct
7 Correct 103 ms 48040 KB Output is correct
8 Correct 127 ms 59108 KB Output is correct
9 Correct 127 ms 59108 KB Output is correct
10 Correct 127 ms 59236 KB Output is correct
11 Correct 10 ms 14444 KB Output is correct
12 Correct 126 ms 59148 KB Output is correct
13 Correct 127 ms 59236 KB Output is correct
14 Correct 120 ms 59108 KB Output is correct
15 Correct 122 ms 59364 KB Output is correct
16 Correct 121 ms 59032 KB Output is correct
17 Correct 126 ms 59108 KB Output is correct
18 Correct 127 ms 59136 KB Output is correct
19 Correct 137 ms 67940 KB Output is correct
20 Correct 120 ms 59112 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 11 ms 14444 KB Output is correct
4 Correct 250 ms 36568 KB Output is correct
5 Correct 324 ms 36596 KB Output is correct
6 Correct 261 ms 36568 KB Output is correct
7 Correct 254 ms 36568 KB Output is correct
8 Correct 250 ms 36568 KB Output is correct
9 Correct 249 ms 36568 KB Output is correct
10 Correct 248 ms 36568 KB Output is correct
11 Correct 255 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 11 ms 14700 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 244 ms 37080 KB Output is correct
7 Correct 248 ms 37080 KB Output is correct
8 Correct 259 ms 37080 KB Output is correct
9 Correct 250 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 257 ms 37212 KB Output is correct
15 Correct 260 ms 37080 KB Output is correct
16 Correct 257 ms 37080 KB Output is correct
17 Correct 247 ms 37080 KB Output is correct
18 Correct 248 ms 37080 KB Output is correct
19 Correct 264 ms 37140 KB Output is correct
20 Correct 246 ms 37080 KB Output is correct
21 Correct 244 ms 37208 KB Output is correct
22 Correct 254 ms 37264 KB Output is correct
23 Correct 262 ms 37080 KB Output is correct
24 Correct 250 ms 37080 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 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 10 ms 14592 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

# 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 14700 KB Output is correct
5 Correct 40 ms 25580 KB Output is correct
6 Correct 69 ms 36708 KB Output is correct
7 Correct 103 ms 48040 KB Output is correct
8 Correct 127 ms 59108 KB Output is correct
9 Correct 127 ms 59108 KB Output is correct
10 Correct 127 ms 59236 KB Output is correct
11 Correct 10 ms 14444 KB Output is correct
12 Correct 126 ms 59148 KB Output is correct
13 Correct 127 ms 59236 KB Output is correct
14 Correct 120 ms 59108 KB Output is correct
15 Correct 122 ms 59364 KB Output is correct
16 Correct 121 ms 59032 KB Output is correct
17 Correct 126 ms 59108 KB Output is correct
18 Correct 127 ms 59136 KB Output is correct
19 Correct 137 ms 67940 KB Output is correct
20 Correct 120 ms 59112 KB Output is correct
21 Correct 10 ms 14572 KB Output is correct
22 Correct 10 ms 14444 KB Output is correct
23 Correct 11 ms 14444 KB Output is correct
24 Correct 250 ms 36568 KB Output is correct
25 Correct 324 ms 36596 KB Output is correct
26 Correct 261 ms 36568 KB Output is correct
27 Correct 254 ms 36568 KB Output is correct
28 Correct 250 ms 36568 KB Output is correct
29 Correct 249 ms 36568 KB Output is correct
30 Correct 248 ms 36568 KB Output is correct
31 Correct 255 ms 36568 KB Output is correct
32 Correct 10 ms 14444 KB Output is correct
33 Correct 11 ms 14700 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 244 ms 37080 KB Output is correct
38 Correct 248 ms 37080 KB Output is correct
39 Correct 259 ms 37080 KB Output is correct
40 Correct 250 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 257 ms 37212 KB Output is correct
46 Correct 260 ms 37080 KB Output is correct
47 Correct 257 ms 37080 KB Output is correct
48 Correct 247 ms 37080 KB Output is correct
49 Correct 248 ms 37080 KB Output is correct
50 Correct 264 ms 37140 KB Output is correct
51 Correct 246 ms 37080 KB Output is correct
52 Correct 244 ms 37208 KB Output is correct
53 Correct 254 ms 37264 KB Output is correct
54 Correct 262 ms 37080 KB Output is correct
55 Correct 250 ms 37080 KB Output is correct
56 Incorrect 10 ms 14444 KB Output isn't correct
57 Halted 0 ms 0 KB -