# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503963 | krit3379 | Cloud Computing (CEOI18_clo) | C++14 | 691 ms | 1996 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;
#define N 2005
struct A{
int c,f,v;
bool operator<(const A& o)const{
if(f!=o.f)return f>o.f;
return c>o.c;
}
};
A a[2*N];
long long dp[2][100005],ans,nn=100000;
int main(){
int n,m,i,j,k,now=0,prev,c,f,v;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d %d %d",&a[i].c,&a[i].f,&a[i].v),a[i].v*=-1;
scanf("%d",&m);
for(i=n+1;i<=n+m;i++)scanf("%d %d %d",&a[i].c,&a[i].f,&a[i].v),a[i].c*=-1;
sort(a+1,a+n+m+1);
n+=m;
for(i=1;i<=nn;i++)dp[now][i]=-1e18;
for(i=1;i<=n;i++){
prev=now;
now=1-now;
c=a[i].c;
f=a[i].f;
v=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... |