//```// YF YUSUF
#define YF ios_base::sync_with_stdio(0);cout.setf(ios::fixed);
#define YUSUF cout.precision(0);cout.tie(0);cin.tie(0);
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <set>
// #include <map>
// #include <algorithm>
// #include <unordered_map>
// #include <cmath>
// #include <numeric>
// #include <queue>
// #include <stack>
// #include <cassert>
// #include <climits>
// #include <string>
// #include <cstdlib>
using namespace std;
#ifdef YF_CHECK
bool Output=1;
// #include "g/debug.h"
// #include "g/bigint.h"
// #include "g/text.h"
#else
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")
bool Output=0;
#define deb(x...) 42
#endif
#ifdef DEV
bool LOUT=1;
#else
bool LOUT=0;
#endif
using ll = long long;
using ld = long double;
using sll = set <ll>;
using vll = vector <ll>;
using mll = map <ll,ll>;
using pll = pair <ll,ll>;
using vvl = vector <vll>;
using vpll = vector <pll>;
template<class T>T MIN(T&a,T b){a=min(a,b);return a;}
template<class T>T MAX(T&a,T b){a=max(a,b);return a;}
#define revers(a) reverse(all(a))
#define all(a) a.begin(),a.end()
#define sortt(a) sort(all(a))
#define sgr v+v+1,(tl+tr)/2+1,tr
#define sgl v+v,tl,(tl+tr)/2
#define pb push_back
#define ins insert
#define S second
#define F first
ll BP(ll a,ll b,ll mod=1e9+7){
if(b==0)return 1;
ll q=BP(a,b/2,mod);
return ((q*q)%mod*(b%2?a:1ll))%mod;
}
ll f(ll x){return x*(x+1)/2;}
ll dup(ll a,ll b){return (a+b-1)/b;}
ll lcm(ll a,ll b){return a/__gcd(a,b)*b;}
ll invf(ll x){return (-1+sqrt(1+8*x))/2;}
ll log(ll x){return 63 - __builtin_clzll(x);}
const ll mod=998244353;
const ll INF=1e18;
const ll inf=1e9+7;
const ll N =1e6+7;
ll n,k;
void YF_MAIN(ll TEST){
cin>>k>>n;
ll sum = 0, add = 10 * n * inf;
vvl V;
for(int i=1;i<=n;i++){
char a,b;
ll v,u;
cin>>a>>v>>b>>u;
sum+=abs(v - u);
if(a==b)continue;
if(v>u)swap(v, u);
V.pb({v+u,v,u});
sum++;
}
sortt(V);
ll m = V.size();
for(int k=0;k<m-1;k++){
vpll a,b;
vll A,B;
for(int i=0;i<m;i++){
(i<=k ? a : b).pb({V[i][1], V[i][2]});
}
for(auto [f,s] : a){
// cout<<f<<" "<<s<<" A\n";
A.pb(f);
A.pb(s);
}
for(auto [f,s] : b){
// cout<<f<<" "<<s<<" B\n";
B.pb(f);
B.pb(s);
}
// cout<<"\n";
sortt(A);ll aa = A[A.size()/2];
sortt(B);ll bb = B[B.size()/2];
ll now = 0;
for(auto [f, s] : a)
now += max(0ll, min((f-aa),(aa-s)));
for(auto [f, s] : b)
now += max(0ll, min((f-bb),(bb-s)));
MIN(add, now);
}
cout<<sum + add*2;
}
bool TECT=0;
bool CASE=0;
bool OUTP=1;
const ll LN=1e1 + 7; ll lg[LN];
const ll SN=2e1 + 7; ll SM[SN];
const ll FN=2e1 + 7;
ll FACT[FN],inv[FN],FMOD=inf;
ll PER(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PER(n,k)*inv[k ]%FMOD;}
void BEFORE(){
for(ll i=2;i<SN;i++){
if(SM[i])continue;
for(ll j=i;j<SN;j+=i)
MAX(SM[j],i);
}
for(int i=2;i<LN;i++) lg[i]=lg[i/2]+1;
FACT[0]=inv[0]=1;
for(int i=1;i<FN;i++){
FACT[i]=FACT[i-1]*i%FMOD;
if(i<5e5+7)inv[i]=BP(FACT[i],FMOD-2,FMOD);
}
}
signed main(){
if(OUTP){YF YUSUF}
// freopen((".in"),"r",stdin);freopen((".out"),"w",stdout);
cout<<(LOUT && Output ? "\nYF_OUTPUT:\n\n" : "");
int TEST=1;
if(TECT)
cin>>TEST;
BEFORE();
for(int T=1;T<=TEST;T++){
if(CASE)
cout<<"Case "<<T<<": ";
YF_MAIN(T);
cout<<(T==TEST ? "" : "\n");
}
return 0;
}
//```
# | 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... |