# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431008 | Runtime_error_ | Cloud Computing (CEOI18_clo) | C++14 | 818 ms | 2060 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 ll long long
using namespace std;
const ll N = 2009,C = 55,MX = 1e18+9;
ll n,m,SumCores,ans;
ll dp[2][N*C];
struct item{
ll type;//1 costumer 2 computer
ll clock;//sort decreasingly and forget about it
ll cores;//the knapsack size, + for computers, - for costumers, keep this >=0
ll price;// - for computers, + for costumers: maximize this
bool operator<(const item &other)const {
if(clock == other.clock)
return type > other.type;
return clock > other.clock;
}
}a[N<<1];
signed main(){
scanf("%lld",&n);
for(ll i=1;i<=n;i++)
scanf("%lld%lld%lld",&a[i].cores,&a[i].clock,&a[i].price),
a[i].type = 2,
a[i].price*=-1,
SumCores += a[i].cores;
scanf("%d",&m);
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... |