# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519026 | A_D | Cloud Computing (CEOI18_clo) | C++14 | 1040 ms | 2176 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
#define ii pair<int,int>
#define F first
#define S second
using namespace std;
const int N=1e5+100;
int dp[N];
int dp2[N];
vector<pair<int,ii>> vec;
void solve()
{
for(int i=1;i<N;i++)dp[i]=-1e18;
for(int i=1;i<N;i++)dp2[i]=-1e18;
int n,m;
cin>>n;
while(n--){
int c,f,v;
cin>>c>>f>>v;
vec.push_back({f,{c,-v}});
}
cin>>m;
while(m--){
int c,f,v;
cin>>c>>f>>v;
vec.push_back({f,{-c,v}});
}
sort(vec.begin(),vec.end());
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... |