oj.uz

답안 #245800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245800 2020-07-07T12:36:46 Z quocnguyen1012 Job Scheduling (IOI19_job) C++14
26 / 100
 706 ms 17612 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

# 결과 실행 시간 메모리 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 6 ms 384 KB Output is correct
5 Correct 89 ms 4472 KB Output is correct
6 Correct 223 ms 8696 KB Output is correct
7 Correct 450 ms 12792 KB Output is correct
8 Correct 686 ms 16888 KB Output is correct
9 Correct 706 ms 16888 KB Output is correct
10 Correct 692 ms 16888 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 666 ms 16888 KB Output is correct
13 Correct 361 ms 16760 KB Output is correct
14 Correct 385 ms 17612 KB Output is correct
15 Correct 230 ms 16888 KB Output is correct
16 Correct 332 ms 17580 KB Output is correct
17 Correct 674 ms 16760 KB Output is correct
18 Correct 672 ms 17144 KB Output is correct
19 Correct 181 ms 16760 KB Output is correct
20 Correct 162 ms 17528 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 308 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Incorrect 13 ms 1152 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 698 ms 16888 KB Output is correct
3 Correct 667 ms 16820 KB Output is correct
4 Incorrect 673 ms 16864 KB Output isn't correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 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 4 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 6 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

# 결과 실행 시간 메모리 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 6 ms 384 KB Output is correct
5 Correct 89 ms 4472 KB Output is correct
6 Correct 223 ms 8696 KB Output is correct
7 Correct 450 ms 12792 KB Output is correct
8 Correct 686 ms 16888 KB Output is correct
9 Correct 706 ms 16888 KB Output is correct
10 Correct 692 ms 16888 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 666 ms 16888 KB Output is correct
13 Correct 361 ms 16760 KB Output is correct
14 Correct 385 ms 17612 KB Output is correct
15 Correct 230 ms 16888 KB Output is correct
16 Correct 332 ms 17580 KB Output is correct
17 Correct 674 ms 16760 KB Output is correct
18 Correct 672 ms 17144 KB Output is correct
19 Correct 181 ms 16760 KB Output is correct
20 Correct 162 ms 17528 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Incorrect 6 ms 384 KB Output isn't correct
24 Halted 0 ms 0 KB -