제출 #922680

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
922680		irmuun	Palembang Bridges (APIO15_bridge)	C++17	9 / 100	2070 ms	600 KiB

bridge

#include<bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll k,n;
    cin>>k>>n;
    vector<char>p(n),q(n);
    vector<ll>s(n),t(n);
    set<ll>st;
    for(ll i=0;i<n;i++){
        cin>>p[i]>>s[i]>>q[i]>>t[i];
        if(s[i]>t[i]) swap(s[i],t[i]);
        st.insert(s[i]);
        st.insert(t[i]);
    }
    ll ans=1e18;
    for(auto x:st){
        for(auto y:st){
            ll cur=0;
            for(ll i=0;i<n;i++){
                if(p[i]==q[i]){
                    cur+=t[i]-s[i];
                }
                else{
                    ll c1=abs(s[i]-x)+abs(t[i]-x),c2=abs(s[i]-y)+abs(t[i]-y);
                    cur+=min(c1,c2)+1;
                }
            }
            ans=min(ans,cur);
        }
    }
    cout<<ans;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 14
• Subtask 3: 9 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37