| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 617907 | snasibov05 | Palembang Bridges (APIO15_bridge) | C++14 | 1 ms | 212 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;
#define oo 1000000000000000000ll
#define int long long
struct data{
char t1, t2;
int x1, x2;
};
signed main() {
int k, n; cin >> k >> n;
vector<int> arr;
vector<data> v(n);
for (int i = 0; i < n; ++i){
char t1, t2; int x1, x2;
cin >> t1 >> x1 >> t2 >> x2;
v[i] = {t1, t2, x1, x2};
if (t1 != t2) arr.push_back(x1), arr.push_back(x2);
}
int ans = oo;
for (int i = 0; i < arr.size(); ++i){
for (int j = i+1; j < arr.size(); ++j){
int cur = 0;
for (int x = 0; x < n; ++x){
if (v[x].t1 == v[x].t2) cur += abs(v[x].x1 - v[x].x2);
else{
int c = abs(v[x].x1 - arr[i]) + abs(v[x].x2 - arr[i]) + 1;
c = min(c, abs(v[x].x1 - arr[j]) + abs(v[x].x2 - arr[j]) + 1);
cur += c;
}
}
ans = min(ans, cur);
}
}
cout << ans << "\n";
return 0;
}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... | ||||
