# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163785 | Alexa2001 | Cloud Computing (CEOI18_clo) | C++17 | 441 ms | 2168 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;
const int Nmax = 2004;
typedef long long ll;
const ll inf = 1e18;
struct ev
{
int c, v, f, tip;
} a[2 * Nmax];
int n, m;
void solve()
{
vector<ll> dp(50 * (n - m) + 1), old(50 * (n - m) + 1, -inf);
int i, j;
old[0] = 0;
for(i=1; i<=n; ++i)
{
if(a[i].tip == 0)
{
for(j=0; j<a[i].c; ++j) dp[j] = old[j];
for(j=a[i].c; j<dp.size(); ++j)
dp[j] = max(old[j], old[j-a[i].c] - a[i].v);
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... |