# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223080 | MKopchev | Cloud Computing (CEOI18_clo) | C++14 | 851 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 MX=50*2000+42,nmax=2e3+42;
const long long inf=1e18;
struct comp
{
int cores,rate,gain;
};
comp inp[nmax*2];
int n,m;
long long dp[2][MX];
void my_clean(int id)
{
for(int i=0;i<MX;i++)
dp[id][i]=-inf;
}
void add(int which)
{
//ignore
for(int i=0;i<MX;i++)
dp[which&1][i]=dp[!(which&1)][i];
//take
for(int i=0;i<MX;i++)
{
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... |