oj.uz

Submission #906309

# Submission time Handle Problem Language Result Execution time Memory
906309 2024-01-14T00:51:41 Z vjudge1 Job Scheduling (IOI19_job) C++17
5 / 100
 56 ms 5200 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


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;
    }

    if(case1){
        ll time = 0;
        for(int i=0;i<n;i++){
            time += d[i];
            ans += time*u[i];
        }
        return ans;
    }

    if(case2 or 1){
        ll time = d[0];
        ans += time*u[0];

        vl ord(n-1); iota(ord.begin(),ord.end(),1);

        sort(ord.begin(),ord.end(), [&](int i,int j){
            return -u[i]*d[i] > -u[j]*d[j];
        });

        for(auto i : ord){
            time += d[i];
            ans += time*u[i];
        }

        return ans;
    }

    return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 12 ms 1372 KB Output is correct
6 Correct 23 ms 2760 KB Output is correct
7 Correct 41 ms 3912 KB Output is correct
8 Correct 47 ms 5096 KB Output is correct
9 Correct 45 ms 5080 KB Output is correct
10 Correct 45 ms 4948 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 56 ms 5076 KB Output is correct
13 Correct 45 ms 4948 KB Output is correct
14 Correct 45 ms 4944 KB Output is correct
15 Correct 47 ms 4948 KB Output is correct
16 Correct 48 ms 5072 KB Output is correct
17 Correct 56 ms 5080 KB Output is correct
18 Correct 46 ms 4944 KB Output is correct
19 Correct 47 ms 5200 KB Output is correct
20 Correct 48 ms 4948 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 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 348 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 348 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 12 ms 1372 KB Output is correct
6 Correct 23 ms 2760 KB Output is correct
7 Correct 41 ms 3912 KB Output is correct
8 Correct 47 ms 5096 KB Output is correct
9 Correct 45 ms 5080 KB Output is correct
10 Correct 45 ms 4948 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 56 ms 5076 KB Output is correct
13 Correct 45 ms 4948 KB Output is correct
14 Correct 45 ms 4944 KB Output is correct
15 Correct 47 ms 4948 KB Output is correct
16 Correct 48 ms 5072 KB Output is correct
17 Correct 56 ms 5080 KB Output is correct
18 Correct 46 ms 4944 KB Output is correct
19 Correct 47 ms 5200 KB Output is correct
20 Correct 48 ms 4948 KB Output is correct
21 Incorrect 1 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -