oj.uz

Submission #947857

# Submission time Handle Problem Language Result Execution time Memory
947857 2024-03-17T07:03:21 Z quanlt206 Job Scheduling (IOI19_job) C++17
12 / 100
 72 ms 10804 KB 
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 2e5 + 7;

int p[N], u[N], d[N], n;

bool checkSub1() {
    REP(i, 1, n)
        if (p[i] != i - 1) return false;
    return true;
}
namespace sub1 {
    ll Process() {
        ll res = 0, sum_t = 0;
        REP(i, 0, n) {
            sum_t+=d[i];
            res+=1LL * u[i] * sum_t;
        }
        return res;
    }
}

bool checkSub2() {
    REP(i, 1, n)
        if (p[i] != 0) return false;
    REP(i, 0, n)
        if (d[i] != 1) return false;
    return true;
}

namespace sub2 {
    ll Process() {
        vector<int> node;
        ll res = 0, sum_t = 0;
        sum_t+=d[0];
        res+=sum_t * u[0];
        REP(i, 1, n) node.push_back(i);
        sort(all(node), [=](int x, int y){
             return u[x] > u[y];
        });
        for (auto x : node) {
            sum_t+=d[x];
            res+=sum_t * u[x];
        }
        return res;
    }
}

int64_t scheduling_cost(vector<int> P, vector<int> U, vector<int> D) {
    n = P.size();
    REP(i, 0, n) {
        p[i] = P[i];
        u[i] = U[i];
        d[i] = D[i];
    }
    if (checkSub1()) {
        return sub1::Process();
    }
    if (checkSub2()) {
        return sub2::Process();
    }
}

Compilation message

job.cpp: In function 'int64_t scheduling_cost(std::vector<int>, std::vector<int>, std::vector<int>)':
job.cpp:101:1: warning: control reaches end of non-void function [-Wreturn-type]
  101 | }
      | ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 11 ms 2908 KB Output is correct
6 Correct 23 ms 5720 KB Output is correct
7 Correct 34 ms 8272 KB Output is correct
8 Correct 56 ms 10576 KB Output is correct
9 Correct 52 ms 10544 KB Output is correct
10 Correct 46 ms 10580 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 46 ms 10596 KB Output is correct
13 Correct 45 ms 10444 KB Output is correct
14 Correct 46 ms 10576 KB Output is correct
15 Correct 59 ms 10584 KB Output is correct
16 Correct 45 ms 10804 KB Output is correct
17 Correct 45 ms 10584 KB Output is correct
18 Correct 45 ms 10608 KB Output is correct
19 Correct 45 ms 10580 KB Output is correct
20 Correct 47 ms 10588 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 58 ms 10292 KB Output is correct
5 Correct 58 ms 10312 KB Output is correct
6 Correct 62 ms 10568 KB Output is correct
7 Correct 58 ms 10164 KB Output is correct
8 Correct 72 ms 10372 KB Output is correct
9 Correct 56 ms 10572 KB Output is correct
10 Correct 59 ms 10304 KB Output is correct
11 Correct 62 ms 10188 KB Output is correct

Subtask #3
0 / 12.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 11 ms 2908 KB Output is correct
6 Correct 23 ms 5720 KB Output is correct
7 Correct 34 ms 8272 KB Output is correct
8 Correct 56 ms 10576 KB Output is correct
9 Correct 52 ms 10544 KB Output is correct
10 Correct 46 ms 10580 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 46 ms 10596 KB Output is correct
13 Correct 45 ms 10444 KB Output is correct
14 Correct 46 ms 10576 KB Output is correct
15 Correct 59 ms 10584 KB Output is correct
16 Correct 45 ms 10804 KB Output is correct
17 Correct 45 ms 10584 KB Output is correct
18 Correct 45 ms 10608 KB Output is correct
19 Correct 45 ms 10580 KB Output is correct
20 Correct 47 ms 10588 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 58 ms 10292 KB Output is correct
25 Correct 58 ms 10312 KB Output is correct
26 Correct 62 ms 10568 KB Output is correct
27 Correct 58 ms 10164 KB Output is correct
28 Correct 72 ms 10372 KB Output is correct
29 Correct 56 ms 10572 KB Output is correct
30 Correct 59 ms 10304 KB Output is correct
31 Correct 62 ms 10188 KB Output is correct
32 Incorrect 0 ms 344 KB Output isn't correct
33 Halted 0 ms 0 KB -