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 "wiring.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
//~ #define int long long
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;
queue<PII> q;
//~ inline int f(int x,int y){
//~ if(x>r.size() && y>b.size())return 0;
//~ }
long long min_total_length(vector<int> r, vector<int> b) {
int at=0,bt=0;
while(at<(int)r.size() && bt<(int)b.size()){
if(r[at]<b[bt]){
if(q.size()==0){q.push(mp(r[at],1));at++;continue;}
PII p=q.front();
if(p.se==1){q.push(mp(r[at],1));at++;continue;}
q.pop();
cev+=r[at]-p.fi;
at++;
}
else{
if(q.size()==0){q.push(mp(b[bt],2));bt++;continue;}
PII p=q.front();
if(p.se==2){q.push(mp(b[bt],2));bt++;continue;}
q.pop();
cev+=b[bt]-p.fi;
bt++;
}
}
while(at<(int)r.size()){
cev+=abs(r[at++]-b[(int)b.size()-1]);
}
while(bt<(int)b.size()){
cev+=abs(b[bt++]-r[(int)r.size()-1]);
}
return cev;
}
# | 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... |