oj.uz

Submission #417339

# Submission time Handle Problem Language Result Execution time Memory
417339 2021-06-03T14:57:47 Z rama_pang Job Scheduling (IOI19_job) C++17
0 / 100
 1 ms 204 KB 
#include "job.h"

#include <bits/stdc++.h>
using namespace std;

using lint = long long;

lint scheduling_cost(vector<int> p, vector<int> u, vector<int> d) {
  int n = p.size();
  lint ans = 0;
  if (accumulate(begin(p), end(p), 0ll) == 0) {
    sort(begin(u), end(u));
    lint t = 0;
    for (int i = 0; i < n; i++) {
      ans += (t + d[i]) * u[i];
    }
  } else {
    lint t = 0;
    for (int i = 0; i < n; i++) {
      ans += (t + d[i]) * u[i];
    }
  }
	return ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 37.0

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