# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332426 | zaneyu | Palembang Bridges (APIO15_bridge) | C++14 | 107 ms | 7512 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<stdio.h>
#include<algorithm>
#include<queue>
#define abs2(a) ((a)<0?-(a):(a))
#define MX 100010
using namespace std;
typedef long long lld;
struct routes {
lld s, e;
bool operator< (const routes& c) const {
return s+e < c.s+c.e;
}
}arr[MX];
struct hset {
priority_queue<lld> mxheap, miheap;
lld mxsum, misum;
void clear(){
mxsum=misum=0;
while(!mxheap.empty())mxheap.pop();
while(!miheap.empty())miheap.pop();
}
void ins(lld a, lld b){
if(mxheap.empty()){
mxheap.push(a), mxsum+=a;
miheap.push(-b), misum+=b;
return;
}
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... |