제출 #1196218

#제출 시각아이디문제언어결과실행 시간메모리
1196218ezzzayPalembang Bridges (APIO15_bridge)C++20
0 / 100
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define ff first #define ss second #define pb push_back const int N=3e5+5; int dist(int a, int b){ return abs(a-b); } signed main(){ int k,n; cin>>k>>n; int s=0; vector<int>vc; vector<pair<int,int>>vec; for(int i=1;i<=n;i++){ char x,y; int a,b; cin>>x>>a>>y>>b; if(x==y){ s+=abs(a-b); } else{ s++; vc.pb(a); vc.pb(b); vec.pb({a,b}); } } sort(vc.begin(),vc.end()); int m=vc.size(); int ans=1e18; for(int a:vc){ for(int b:vc){ int h=0; for(auto p:vec){ int l=p.ff,r=p.ss; h+=min(dist(a,l)+dist(a,r),dist(b,l)+dist(b,r)); } ans=min(ans,h); } } cout<<ans+s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...