# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134141 | dragonslayerit | Cloud Computing (CEOI18_clo) | C++14 | 393 ms | 1280 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 <cstdio>
#include <algorithm>
const long long INF=1e15+7;
struct Event{
enum{
TYPE_COMPUTER=1,
TYPE_CUSTOMER=2,
}type;
int C,F,V;
void read(){
scanf("%d %d %d",&C,&F,&V);
}
bool operator<(Event e)const{
if(F!=e.F) return F>e.F;
return type<e.type;
}
}events[4000];
long long profit[100001];
void setmax(long long& x,long long y){
x=std::max(x,y);
}
int main(){
int N;
scanf("%d",&N);
for(int i=0;i<N;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... |