# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467033 | Qw3rTy | Cloud Computing (CEOI18_clo) | C++11 | 1855 ms | 2252 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>
#define int long long
using namespace std;
const int maxN = 2e3+5;
const int maxC = 50+5;
struct ds{
int c,f,v;
bool order;
ds(){};
ds(int c, int f, int v, bool order){
this -> c = c;
this -> f = f;
this -> v = v;
this -> order = order;
}
}a[maxN<<1];
bool cmp(ds a, ds b){
return a.f > b.f;
}
int N,M;
int cnt = 0;
int f[2][maxN*maxC]; //f[i][j] = max profit given first i items and j cores with frequency higher than current
int maxF = 0;
signed main(){
ios_base::sync_with_stdio(false);
# | 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... |