# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56559 | leejseo | Palembang Bridges (APIO15_bridge) | C++98 | 72 ms | 1808 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 <bits/stdc++.h>
using namespace std;
int K, N;
void solve1(){
long long ans = 0;
vector<int> L;
int u, v;
char x, y;
for(int i=0; i<N; i++){
scanf("%c %d %c %d\n", &x, &u, &y, &v);
if (x == y) ans += abs(u-v);
else{
L.push_back(u);
L.push_back(v);
}
}
sort(L.begin(), L.end());
int M = L.size();
if (M == 0){
printf("%lld\n", ans);
return;
}
long long mid = L[M/2];
for (int i=0; i<M; i++) ans += abs(L[i] - mid);
ans += M/2;
printf("%lld\n", ans);
L.clear();
return;
}
void solve2(){
long long ans = 0;
vector<int> L;
int u, v;
char x, y;
for(int i=0; i<N; i++){
scanf("%c %d %c %d\n", &x, &u, &y, &v);
if (x == y) ans += abs(u-v);
else{
L.push_back(u);
L.push_back(v);
}
}
sort(L.begin(), L.end());
int M = L.size();
if (M == 0){
printf("%lld\n", ans);
return;
}
long long cross = (int) 1e15;
long long temp;
for (int i=0; i<M; i++){
for (int j=0; j<i; j++){
long long b1 = L[i];
long long b2 = L[j];
temp = 0;
for (int k=0; k<M; k++){
temp += min(abs(L[k]-b1), abs(L[k]-b2));
}
cross = min(cross, temp);
}
}
ans += cross;
ans += M/2;
printf("%lld\n", ans);
return;
}
int main(void){
scanf("%d%d\n", &K, &N);
if (K == 1) solve1();
else solve2();
}
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... |