# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
906315 | 2024-01-14T00:57:54 Z | vjudge1 | Job Scheduling (IOI19_job) | C++17 | 58 ms | 16200 KB |
#include "job.h" #include <vector> #pragma GCC target ("avx2") #pragma GCC optimize ("O3") #pragma GCC optimize ("unroll-loops") #include<bits/stdc++.h> #include<math.h> using namespace std; typedef long long int ll; typedef long double ld; typedef pair<ll, ll> pl; typedef vector<ll> vl; #define FD(i, r, l) for(ll i = r; i > (l); --i) #define K first #define V second #define G(x) ll x; cin >> x; #define GD(x) ld x; cin >> x; #define GS(s) string s; cin >> s; #define EX(x) { cout << x << '\n'; exit(0); } #define A(a) (a).begin(), (a).end() #define F(i, l, r) for (ll i = l; i < (r); ++i) #define NN #define M 1000000007 // 998244353 vl adj[200010]; long long scheduling_cost(std::vector<int> p, std::vector<int> u, std::vector<int> d) { ll ans = 0; int n = (int)p.size(); bool case1 = true,case2 = true; for(int i=1;i<n;i++){ case1 &= p[i]==i-1; case2 &= p[i]==0; case2 &= d[i]==1; adj[p[i]].push_back(i); } if(case1){ ll time = 0; for(int i=0;i<n;i++){ time += d[i]; ans += time*u[i]; } return ans; } auto cmp = [&](int i,int j){ return -u[i]*d[j] < -u[j]*d[i]; }; priority_queue<ll, vector<ll>, greater<ll>> pq; ans += d[0] * u[0]; ll time = d[0]; for (auto x: adj[0]) pq.push(x); while (pq.size()) { auto i = pq.top(); pq.pop(); time += d[i]; ans += time * u[i]; for (auto y: adj[i]) pq.push(y); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4952 KB | Output is correct |
2 | Correct | 2 ms | 4956 KB | Output is correct |
3 | Correct | 2 ms | 4952 KB | Output is correct |
4 | Correct | 2 ms | 4956 KB | Output is correct |
5 | Correct | 15 ms | 7772 KB | Output is correct |
6 | Correct | 28 ms | 10588 KB | Output is correct |
7 | Correct | 42 ms | 13140 KB | Output is correct |
8 | Correct | 56 ms | 15928 KB | Output is correct |
9 | Correct | 55 ms | 15952 KB | Output is correct |
10 | Correct | 58 ms | 15924 KB | Output is correct |
11 | Correct | 2 ms | 4952 KB | Output is correct |
12 | Correct | 51 ms | 16200 KB | Output is correct |
13 | Correct | 51 ms | 15952 KB | Output is correct |
14 | Correct | 56 ms | 15952 KB | Output is correct |
15 | Correct | 55 ms | 15928 KB | Output is correct |
16 | Correct | 55 ms | 15952 KB | Output is correct |
17 | Correct | 52 ms | 15956 KB | Output is correct |
18 | Correct | 57 ms | 15932 KB | Output is correct |
19 | Correct | 53 ms | 15952 KB | Output is correct |
20 | Correct | 54 ms | 15952 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4952 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4956 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 4956 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4952 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4952 KB | Output is correct |
2 | Correct | 2 ms | 4956 KB | Output is correct |
3 | Correct | 2 ms | 4952 KB | Output is correct |
4 | Correct | 2 ms | 4956 KB | Output is correct |
5 | Correct | 15 ms | 7772 KB | Output is correct |
6 | Correct | 28 ms | 10588 KB | Output is correct |
7 | Correct | 42 ms | 13140 KB | Output is correct |
8 | Correct | 56 ms | 15928 KB | Output is correct |
9 | Correct | 55 ms | 15952 KB | Output is correct |
10 | Correct | 58 ms | 15924 KB | Output is correct |
11 | Correct | 2 ms | 4952 KB | Output is correct |
12 | Correct | 51 ms | 16200 KB | Output is correct |
13 | Correct | 51 ms | 15952 KB | Output is correct |
14 | Correct | 56 ms | 15952 KB | Output is correct |
15 | Correct | 55 ms | 15928 KB | Output is correct |
16 | Correct | 55 ms | 15952 KB | Output is correct |
17 | Correct | 52 ms | 15956 KB | Output is correct |
18 | Correct | 57 ms | 15932 KB | Output is correct |
19 | Correct | 53 ms | 15952 KB | Output is correct |
20 | Correct | 54 ms | 15952 KB | Output is correct |
21 | Incorrect | 2 ms | 4952 KB | Output isn't correct |
22 | Halted | 0 ms | 0 KB | - |