# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14534 | dohyun0324 | Palembang Bridges (APIO15_bridge) | C++98 | 163 ms | 6536 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>
using namespace std;
priority_queue<int>q;
priority_queue<int,vector<int>,greater<int> >q2;
char c1,c2;
long long dap,d[3][100010],dap2,dap3;
int t,w2,k,n,x1,x2,w,arr[200010];
struct data{
int x,y;
bool operator<(const data&r)const{
return (x+y)<r.x+r.y;
}
}a[100010];
void pro(int p)
{
int c=0;
long long sum=0,sum2=0,mid=0,i;
while(q.size()) q.pop();
while(q2.size()) q2.pop();
q.push(min(a[1].x,a[1].y)); q2.push(max(a[1].x,a[1].y));
d[p][1]=abs(a[1].x-a[1].y);
sum=min(a[1].x,a[1].y); sum2=a[1].x+a[1].y;
for(i=2;i<=w;i++){
sum2+=a[i].x+a[i].y;
if(q.top()>a[i].x){
sum+=a[i].x-q.top();
q2.push(q.top()); q.pop(); q.push(a[i].x);
}
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... |