oj.uz

Submission #210795

# Submission time Handle Problem Language Result Execution time Memory
210795 2020-03-18T11:10:17 Z SorahISA Job Scheduling (IOI19_job) C++17
5 / 100
 133 ms 5132 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 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;

int scheduling_cost(vector<int32_t> p, vector<int32_t> u, vector<int32_t> d) {
    int n = p.size(), t = 0, ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += (t += d[i]) * u[i];
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 33 ms 1528 KB Output is correct
6 Correct 63 ms 2680 KB Output is correct
7 Correct 89 ms 3804 KB Output is correct
8 Correct 114 ms 4984 KB Output is correct
9 Correct 121 ms 5112 KB Output is correct
10 Correct 125 ms 4956 KB Output is correct
11 Correct 6 ms 256 KB Output is correct
12 Correct 117 ms 5128 KB Output is correct
13 Correct 113 ms 5128 KB Output is correct
14 Correct 119 ms 5032 KB Output is correct
15 Correct 126 ms 5132 KB Output is correct
16 Correct 133 ms 5012 KB Output is correct
17 Correct 115 ms 4984 KB Output is correct
18 Correct 122 ms 4984 KB Output is correct
19 Correct 118 ms 5112 KB Output is correct
20 Correct 123 ms 5016 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 33 ms 1528 KB Output is correct
6 Correct 63 ms 2680 KB Output is correct
7 Correct 89 ms 3804 KB Output is correct
8 Correct 114 ms 4984 KB Output is correct
9 Correct 121 ms 5112 KB Output is correct
10 Correct 125 ms 4956 KB Output is correct
11 Correct 6 ms 256 KB Output is correct
12 Correct 117 ms 5128 KB Output is correct
13 Correct 113 ms 5128 KB Output is correct
14 Correct 119 ms 5032 KB Output is correct
15 Correct 126 ms 5132 KB Output is correct
16 Correct 133 ms 5012 KB Output is correct
17 Correct 115 ms 4984 KB Output is correct
18 Correct 122 ms 4984 KB Output is correct
19 Correct 118 ms 5112 KB Output is correct
20 Correct 123 ms 5016 KB Output is correct
21 Incorrect 7 ms 256 KB Output isn't correct
22 Halted 0 ms 0 KB -