# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
462428 | idk321 | Cloud Computing (CEOI18_clo) | C++17 | 455 ms | 1276 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*
ll tryAll(int i, vector<array<int, 3>>& comps, vector<int> cores, ll cost) {
if (i == comps.size()) {
return solveFor(cur, cost);
}
ll best = tryAll(i + 1, comps, cores, cost);
for (int j = 0; j < comps[i][0]; i++) cores.push(comps[1]);
cost += comps[i][2];
best = max(best, cost);
return best;
}
ll solveFor(vector<int> cores, ll cost) {
ll sum = 0;
return sum - cost;
}
*/
bool comp(const array<int, 4>& ar1, const array<int, 4>& ar2) {
if (ar1[1] == ar2[1]) {
if (ar1[3] == ar2[3]) return false;
if (ar1[3] == 0) return true;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |