# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921773 | Ludissey | Palembang Bridges (APIO15_bridge) | C++14 | 2089 ms | 604 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>
#define int long long
using namespace std;
vector<char> P;
vector<int> S;
vector<char> Q;
vector<int> T;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int l=0;
int r=100;
int n,k; cin >> k >> n;
P.resize(n);
S.resize(n);
Q.resize(n);
T.resize(n);
for (int i = 0; i < n; i++){
cin >> P[i] >> S[i] >> Q[i] >> T[i];
}
int mn=1e12;
for (int j = 0; j < n*2; j++)
{
int x1;
if(j%2==0) x1=S[j/2];
else x1=T[j/2];
for (int j2 = j+1; j2 < n*2; j2++){
int sum=0;
int x2;
if(j%2==0) x2=S[j2/2];
else x2=T[j2/2];
for (int i = 0; i < n; i++)
{
if(P[i]!=Q[i]) {
int s1=abs(x1-S[i])+1+abs(x1-T[i]);
int s2=abs(x2-S[i])+1+abs(x2-T[i]);
sum+=min(s1,s2);
}
else sum+=abs(S[i]-T[i]);
}
mn=min(sum,mn);
}
}
cout << mn<< "\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... |