# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
504064 | ToroTN | Cloud Computing (CEOI18_clo) | C++14 | 849 ms | 1988 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;
int n,m,c,f,value,c2,f2,value2,core,cost,type,fraud,holo;
long long dp[2][100005];
tuple<int,int,int,int> v[4005];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&c,&f,&value);
v[i-1]={f,2,c,value};
}
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&c2,&f2,&value2);
v[n+i-1]={f2,1,c2,value2};
}
v[n+m]={-1,-1,-1,-1};
sort(v,v+n+m+1);
for(int i=0;i<=1;i++)
{
for(int j=0;j<=100000;j++)
{
dp[i][j]=-1e18;
}
}
dp[0][0]=0;
for(int i=1;i<=n+m;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... |