| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 850144 | Qwesz | Palembang Bridges (APIO15_bridge) | C++14 | 1 ms | 356 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 <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
using ll = long long;
ll k, n, dis = 0, lef = 0, rig = 0, out = 0;
vector<pair<int, int>> vec;
int main(){
cin >> k >> n;
for(int i = 0; i < n; i++){
char a, b; int x, y;
cin >> a >> x >> b >> y;
if(a == b) dis += abs(x - y);
else{
dis += abs(x - y) + 1;
vec.push_back({min(x, y), 0});
vec.push_back({max(x, y), 1});
rig += min(x, y);
}
}
sort(vec.begin(), vec.end());
//cout << dis << " " << rig << endl;
out = dis + 2 * rig;
for(int i = 0; i < vec.size(); i++){
if(vec[i].second == 0) rig -= vec[i].first;
if(vec[i].second == 1) lef += vec[i].first;
out = min(out, dis + 2 * abs(rig - lef));
//cout << out << " " << lef << " " << rig << endl;
}
cout << out << endl;
}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... | ||||
