oj.uz

Submission #245744

# Submission time Handle Problem Language Result Execution time Memory
245744 2020-07-07T10:14:29 Z quocnguyen1012 Job Scheduling (IOI19_job) C++14
26 / 100
 751 ms 19192 KB 
#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;

ll 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];
  }
};
set<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 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 85 ms 4856 KB Output is correct
6 Correct 259 ms 9336 KB Output is correct
7 Correct 450 ms 13944 KB Output is correct
8 Correct 712 ms 18456 KB Output is correct
9 Correct 698 ms 18360 KB Output is correct
10 Correct 733 ms 18428 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 727 ms 18424 KB Output is correct
13 Correct 372 ms 18472 KB Output is correct
14 Correct 367 ms 18936 KB Output is correct
15 Correct 222 ms 18424 KB Output is correct
16 Correct 270 ms 19192 KB Output is correct
17 Correct 751 ms 18424 KB Output is correct
18 Correct 707 ms 18368 KB Output is correct
19 Correct 173 ms 18296 KB Output is correct
20 Correct 155 ms 19192 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 4 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 5 ms 384 KB Output is correct
2 Correct 4 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 Incorrect 12 ms 1280 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 704 ms 18320 KB Output is correct
3 Correct 682 ms 18424 KB Output is correct
4 Incorrect 683 ms 18424 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 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 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 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 85 ms 4856 KB Output is correct
6 Correct 259 ms 9336 KB Output is correct
7 Correct 450 ms 13944 KB Output is correct
8 Correct 712 ms 18456 KB Output is correct
9 Correct 698 ms 18360 KB Output is correct
10 Correct 733 ms 18428 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 727 ms 18424 KB Output is correct
13 Correct 372 ms 18472 KB Output is correct
14 Correct 367 ms 18936 KB Output is correct
15 Correct 222 ms 18424 KB Output is correct
16 Correct 270 ms 19192 KB Output is correct
17 Correct 751 ms 18424 KB Output is correct
18 Correct 707 ms 18368 KB Output is correct
19 Correct 173 ms 18296 KB Output is correct
20 Correct 155 ms 19192 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Incorrect 5 ms 384 KB Output isn't correct
24 Halted 0 ms 0 KB -