oj.uz

Submission #245806

# Submission time Handle Problem Language Result Execution time Memory
245806 2020-07-07T13:07:20 Z quocnguyen1012 Job Scheduling (IOI19_job) C++14
26 / 100
 842 ms 17632 KB 
#ifndef LOCAL
#include "job.h"
#endif // LOCAL
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 2e5 + 5;

int cost[maxn], tim[maxn];
int N;
int lab[maxn], mark[maxn];
ll t = 0, res;

int finds(int u)
{
  if(lab[u] == u) return u;
  return lab[u] = finds(lab[u]);
}

struct cmp
{
  bool operator ()(int a, int b) const
  {
    return 1ll * cost[a] * tim[b] > 1ll * cost[b] * tim[a];
  }
};
multiset<int, cmp> se;

ll scheduling_cost(std::vector<int> p, std::vector<int> u, std::vector<int> d)
{
  N = p.size();
  for(int i = 0; i < N; ++i){
    tim[i] = d[i];
    cost[i] = u[i];
    lab[i] = i;
  }
  for(int i = 0; i < N; ++i)
    se.insert(i);
  for(int i = 0; i < N; ++i){
    int now = *se.begin();
    se.erase(now);
    //cerr << now << '\n';
    if(p[now] == -1 || mark[finds(p[now])]){
      t += tim[now];
      res += 1ll * cost[now] * t;
      mark[now] = 1;
      continue;
    }
    int top = finds(p[now]);
    se.erase(top);
    res -= 1ll * cost[top] * tim[now];
    cost[top] += cost[now];
    tim[top] += tim[now];
    se.insert(top);
    lab[now] = top;
  }
  return res;
}

#ifdef LOCAL
signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  int n; cin >> n;
  vector<int> p(n), u(n), d(n);
  for(auto & it : p) cin >> it;
  for(auto & it : u) cin >> it;
  for(auto & it : d) cin >> it;
  cout << scheduling_cost(p, u, d);
}
#endif // LOCAL

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 88 ms 4604 KB Output is correct
6 Correct 238 ms 8572 KB Output is correct
7 Correct 478 ms 12792 KB Output is correct
8 Correct 667 ms 16888 KB Output is correct
9 Correct 655 ms 16760 KB Output is correct
10 Correct 743 ms 16888 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 771 ms 16888 KB Output is correct
13 Correct 403 ms 17116 KB Output is correct
14 Correct 379 ms 17512 KB Output is correct
15 Correct 228 ms 16864 KB Output is correct
16 Correct 317 ms 17632 KB Output is correct
17 Correct 667 ms 16888 KB Output is correct
18 Correct 712 ms 16772 KB Output is correct
19 Correct 178 ms 17016 KB Output is correct
20 Correct 166 ms 17400 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Incorrect 12 ms 1152 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 744 ms 16828 KB Output is correct
3 Correct 707 ms 16888 KB Output is correct
4 Incorrect 842 ms 16992 KB Output isn't correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct

Subtask #6
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 88 ms 4604 KB Output is correct
6 Correct 238 ms 8572 KB Output is correct
7 Correct 478 ms 12792 KB Output is correct
8 Correct 667 ms 16888 KB Output is correct
9 Correct 655 ms 16760 KB Output is correct
10 Correct 743 ms 16888 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 771 ms 16888 KB Output is correct
13 Correct 403 ms 17116 KB Output is correct
14 Correct 379 ms 17512 KB Output is correct
15 Correct 228 ms 16864 KB Output is correct
16 Correct 317 ms 17632 KB Output is correct
17 Correct 667 ms 16888 KB Output is correct
18 Correct 712 ms 16772 KB Output is correct
19 Correct 178 ms 17016 KB Output is correct
20 Correct 166 ms 17400 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Incorrect 5 ms 384 KB Output isn't correct
24 Halted 0 ms 0 KB -