# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161122 | AlgorithmWarrior | Cloud Computing (CEOI18_clo) | C++20 | 213 ms | 1260 KiB |
#include <bits/stdc++.h>
using namespace std;
int const MAX=4005;
int const MAXC=1e5+5;
long long const INF=1e18;
struct event{
int cap,crt,val,type;
bool operator<(event ot){
if(crt!=ot.crt)
return crt>ot.crt;
return type<ot.type;
}
}events[MAX];
int n,m;
int total;
void read(){
cin>>n;
int i;
for(i=1;i<=n;++i){
cin>>events[i].cap>>events[i].crt>>events[i].val;
events[i].type=1;
}
cin>>m;
for(i=n+1;i<=n+m;++i){
cin>>events[i].cap>>events[i].crt>>events[i].val;
events[i].type=2;
}
# | 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... |