# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
640663 | devariaota | Palembang Bridges (APIO15_bridge) | C++17 | 2068 ms | 13592 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;
#pragma GCC optimize("Ofast")
typedef long long ll;
// const ll mod = 1e9 + 7;
const ll MAXN = 1e6 + 5;
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define sc second
#define endl '\n'
#define gl ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main()
{
gl;
ll k, n;
cin >> k >> n;
ll sum = 0;
vll v;
set<ll> st;
for (int i = 0; i < n; i++)
{
char a, b;
ll x, y;
cin >> a >> x >> b >> y;
if (a == b)
sum += abs(x - y);
else
{
sum++;
v.pb(x);
v.pb(y);
st.insert(x);
st.insert(y);
}
}
sort(v.begin(), v.end());
ll ans = 1e18;
for (ll i : st)
{
ll cur = 0;
for (int j = 0; j < v.size(); j++)
{
cur += abs(i - v[j]);
}
ans = min(ans, cur);
}
if (ans == 1e18)
ans = 0;
cout << ans + sum << endl;
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... |