oj.uz

답안 #906314

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
906314 2024-01-14T00:56:52 Z vjudge1 Job Scheduling (IOI19_job) C++17
5 / 100
 61 ms 15956 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

job.cpp: In function 'long long int scheduling_cost(std::vector<int>, std::vector<int>, std::vector<int>)':
job.cpp:55:10: warning: variable 'cmp' set but not used [-Wunused-but-set-variable]
   55 |     auto cmp = [&](int i,int j){
      |          ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 5108 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 16 ms 7788 KB Output is correct
6 Correct 29 ms 10580 KB Output is correct
7 Correct 46 ms 13136 KB Output is correct
8 Correct 52 ms 15936 KB Output is correct
9 Correct 55 ms 15952 KB Output is correct
10 Correct 53 ms 15936 KB Output is correct
11 Correct 3 ms 4952 KB Output is correct
12 Correct 61 ms 15940 KB Output is correct
13 Correct 55 ms 15936 KB Output is correct
14 Correct 55 ms 15952 KB Output is correct
15 Correct 55 ms 15956 KB Output is correct
16 Correct 53 ms 15956 KB Output is correct
17 Correct 57 ms 15952 KB Output is correct
18 Correct 52 ms 15908 KB Output is correct
19 Correct 54 ms 15952 KB Output is correct
20 Correct 53 ms 15904 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4952 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 5108 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 16 ms 7788 KB Output is correct
6 Correct 29 ms 10580 KB Output is correct
7 Correct 46 ms 13136 KB Output is correct
8 Correct 52 ms 15936 KB Output is correct
9 Correct 55 ms 15952 KB Output is correct
10 Correct 53 ms 15936 KB Output is correct
11 Correct 3 ms 4952 KB Output is correct
12 Correct 61 ms 15940 KB Output is correct
13 Correct 55 ms 15936 KB Output is correct
14 Correct 55 ms 15952 KB Output is correct
15 Correct 55 ms 15956 KB Output is correct
16 Correct 53 ms 15956 KB Output is correct
17 Correct 57 ms 15952 KB Output is correct
18 Correct 52 ms 15908 KB Output is correct
19 Correct 54 ms 15952 KB Output is correct
20 Correct 53 ms 15904 KB Output is correct
21 Incorrect 2 ms 4956 KB Output isn't correct
22 Halted 0 ms 0 KB -