이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
lo cev;
string s;
vector<int> v;
//~ 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) {
lo at=0;
if(b.size()>=r.size()){
for(lo i=0;i<(int)b.size();i++){
cev+=abs(b[i]-r[min(at++,(lo)r.size()-1ll)]);
}
}
else{
for(lo i=0;i<(int)r.size();i++){
cev+=abs(r[i]-b[min(at,(lo)b.size()-1ll)]);
if(i>=(int)r.size()-(int)b.size())at++;
}
}
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... |