oj.uz

Submission #318981

# Submission time Handle Problem Language Result Execution time Memory
318981 2020-11-03T15:57:01 Z alextodoran Job Scheduling (IOI19_job) C++17
5 / 100
 132 ms 67812 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[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 25700 KB Output is correct
6 Correct 81 ms 36836 KB Output is correct
7 Correct 98 ms 48104 KB Output is correct
8 Correct 132 ms 59364 KB Output is correct
9 Correct 130 ms 59364 KB Output is correct
10 Correct 132 ms 59364 KB Output is correct
11 Correct 10 ms 14572 KB Output is correct
12 Correct 130 ms 59364 KB Output is correct
13 Correct 131 ms 59364 KB Output is correct
14 Correct 127 ms 59364 KB Output is correct
15 Correct 128 ms 59108 KB Output is correct
16 Correct 128 ms 59184 KB Output is correct
17 Correct 127 ms 59492 KB Output is correct
18 Correct 128 ms 59364 KB Output is correct
19 Correct 127 ms 59108 KB Output is correct
20 Correct 130 ms 67812 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 12.0

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

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 Incorrect 10 ms 14444 KB Output isn't correct
2 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 25700 KB Output is correct
6 Correct 81 ms 36836 KB Output is correct
7 Correct 98 ms 48104 KB Output is correct
8 Correct 132 ms 59364 KB Output is correct
9 Correct 130 ms 59364 KB Output is correct
10 Correct 132 ms 59364 KB Output is correct
11 Correct 10 ms 14572 KB Output is correct
12 Correct 130 ms 59364 KB Output is correct
13 Correct 131 ms 59364 KB Output is correct
14 Correct 127 ms 59364 KB Output is correct
15 Correct 128 ms 59108 KB Output is correct
16 Correct 128 ms 59184 KB Output is correct
17 Correct 127 ms 59492 KB Output is correct
18 Correct 128 ms 59364 KB Output is correct
19 Correct 127 ms 59108 KB Output is correct
20 Correct 130 ms 67812 KB Output is correct
21 Incorrect 10 ms 14464 KB Output isn't correct
22 Halted 0 ms 0 KB -