# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129418 | neki | Cloud Computing (CEOI18_clo) | C++14 | 1519 ms | 5484 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 maxn 2010
#define loop(i, a, b) for(int i=a;i<b;i++)
#define cc(a) cout<< a << endl;
using namespace std;
long long inf=LONG_LONG_MIN/2;
struct event{
int co, f, val;
};
long long max(long long a, long long b){return (a>b) ? a:b;}
bool cmp(event a, event b){
if(a.f>b.f) return true;
if(a.f==b.f) return (a.co>b.co);
return false;
}
event es[2* maxn];
int main() {
int n;cin >> n;
loop(i, 0, n){
scanf("%d%d%d", &es[i].co, &es[i].f, &es[i].val);
es[i].val*=-1;
}
int m;cin >> m;
loop(i, n, n+m){
scanf("%d%d%d", &es[i].co, &es[i].f, &es[i].val);
es[i].co*=-1;
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... |