# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698919 | dattranxxx | Cloud Computing (CEOI18_clo) | C++11 | 1313 ms | 2040 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;
using ll = long long;
const int N = 4005 * 50;
struct Item {
int f, t, c, v;
bool operator < (const Item& b) const {
if (f == b.f) return t < b.t;
return f > b.f;
}
} a[N];
int n, m;
const ll INF = 1e15;
ll dp[2][N];
void cmax(ll& x, ll y) { x = max(x, y); }
int main() {
cin.tie(0)->sync_with_stdio(0); cout.tie(0);
cin >> n;
int W = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i].c >> a[i].f >> a[i].v;
a[i].t = 0;
W += a[i].c;
}
cin >> m;
# | 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... |