Submission #211061

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
211061	2020-03-19T06:38:53 Z	SorahISA	Job Scheduling (IOI19_job)	C++17	19 / 100	119 ms	13800 KB

#include "job.h"

// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(0, 1); \
                 auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;

struct Job {
    int need, mult, cost;
};

int scheduling_cost(vector<int32_t> p, vector<int32_t> u, vector<int32_t> d) {
    int n = p.size(), t = d[0], ans = t*u[0];
    vector<Job> v;
    for (int i = 1; i < n; ++i) v.pb({p[i], u[i], d[i]});
    
    sort(v.begin(), v.end(), [](auto a, auto b) {
        return a.cost*b.mult < b.cost*a.mult;
    });
    
    for (auto x : v) ans += (t += x.cost) * x.mult;
    return ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	111 ms	13032 KB	Output is correct
5	Correct	109 ms	13036 KB	Output is correct
6	Correct	108 ms	13032 KB	Output is correct
7	Correct	105 ms	13032 KB	Output is correct
8	Correct	104 ms	13196 KB	Output is correct
9	Correct	106 ms	13032 KB	Output is correct
10	Correct	106 ms	13032 KB	Output is correct
11	Correct	110 ms	13032 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	11 ms	1212 KB	Output is correct
6	Correct	116 ms	13800 KB	Output is correct
7	Correct	119 ms	13672 KB	Output is correct
8	Correct	116 ms	13572 KB	Output is correct
9	Correct	116 ms	13672 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	6 ms	512 KB	Output is correct
12	Correct	9 ms	1092 KB	Output is correct
13	Correct	11 ms	1220 KB	Output is correct
14	Correct	111 ms	13672 KB	Output is correct
15	Correct	112 ms	13672 KB	Output is correct
16	Correct	111 ms	13676 KB	Output is correct
17	Correct	119 ms	13576 KB	Output is correct
18	Correct	117 ms	13672 KB	Output is correct
19	Correct	114 ms	13800 KB	Output is correct
20	Correct	112 ms	13672 KB	Output is correct
21	Correct	108 ms	13672 KB	Output is correct
22	Correct	114 ms	13672 KB	Output is correct
23	Correct	111 ms	13724 KB	Output is correct
24	Correct	115 ms	13676 KB	Output is correct