oj.uz

답안 #906310

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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 2644 KB Output is correct
7 Correct 34 ms 3924 KB Output is correct
8 Correct 45 ms 4944 KB Output is correct
9 Correct 45 ms 4948 KB Output is correct
10 Correct 45 ms 4944 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 45 ms 5076 KB Output is correct
13 Correct 46 ms 4948 KB Output is correct
14 Correct 49 ms 4944 KB Output is correct
15 Correct 45 ms 4948 KB Output is correct
16 Correct 45 ms 5084 KB Output is correct
17 Correct 44 ms 4948 KB Output is correct
18 Correct 46 ms 4948 KB Output is correct
19 Correct 45 ms 5056 KB Output is correct
20 Correct 48 ms 5084 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 60 ms 6484 KB Output is correct
5 Correct 60 ms 6612 KB Output is correct
6 Correct 61 ms 6484 KB Output is correct
7 Correct 60 ms 6480 KB Output is correct
8 Correct 63 ms 6480 KB Output is correct
9 Correct 63 ms 6636 KB Output is correct
10 Correct 61 ms 6600 KB Output is correct
11 Correct 66 ms 6700 KB Output is correct

Subtask #3
0 / 12.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 2644 KB Output is correct
7 Correct 34 ms 3924 KB Output is correct
8 Correct 45 ms 4944 KB Output is correct
9 Correct 45 ms 4948 KB Output is correct
10 Correct 45 ms 4944 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 45 ms 5076 KB Output is correct
13 Correct 46 ms 4948 KB Output is correct
14 Correct 49 ms 4944 KB Output is correct
15 Correct 45 ms 4948 KB Output is correct
16 Correct 45 ms 5084 KB Output is correct
17 Correct 44 ms 4948 KB Output is correct
18 Correct 46 ms 4948 KB Output is correct
19 Correct 45 ms 5056 KB Output is correct
20 Correct 48 ms 5084 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 60 ms 6484 KB Output is correct
25 Correct 60 ms 6612 KB Output is correct
26 Correct 61 ms 6484 KB Output is correct
27 Correct 60 ms 6480 KB Output is correct
28 Correct 63 ms 6480 KB Output is correct
29 Correct 63 ms 6636 KB Output is correct
30 Correct 61 ms 6600 KB Output is correct
31 Correct 66 ms 6700 KB Output is correct
32 Incorrect 1 ms 348 KB Output isn't correct
33 Halted 0 ms 0 KB -