# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17588 | comet | Palembang Bridges (APIO15_bridge) | C++98 | 126 ms | 7032 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>
#include <vector>
#include <queue>
#include <cstring>
#include <cassert>
#include <cstdlib>
#include <ctime>
using namespace std;
typedef long long ll;
int N,K,n;
struct pp{
ll x,y;
bool operator<(const pp& r)const{
return x+y<r.x+r.y;
}
}a[100010];
ll base;
ll L[100010],R[100010];
priority_queue<ll> lo;
priority_queue<ll,vector<ll>,greater<ll> > hi;
ll loSum,hiSum;
void init(){
while(!lo.empty())lo.pop();
while(!hi.empty())hi.pop();
loSum=hiSum=0;
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... |