제출 #1181219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1181219		asli_bg	Palembang Bridges (APIO15_bridge)	C++20	22 / 100	324 ms	26300 KiB

bridge

#include<bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long

typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2

const int MAXN=3e4+5;
const int MOD=1e9+7;
const int INF=1e18;

map<int,int> tut;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n,k;
    cin>>k>>n;
    vector<char> p(n+1), q(n+1);
    vi s(n+1), t(n+1);

    set<int> cur;

    int ans=0;
    int top=0;
    int tt=0;
    FORE(i,1,n+1){
        cin>>p[i]>>s[i]>>q[i]>>t[i];
        cur.insert(s[i]);
        cur.insert(t[i]);

        if(p[i]!=q[i]){
            top+=t[i]+s[i];
            tt+=2;
            tut[s[i]]++;
            tut[t[i]]++;
        }
        else ans+=abs(t[i]-s[i]);
    }

    vi vec;
    for(auto el:cur) vec.pb(el);

    int sz=vec.size();

    if(k==1){
        int res=INF;
        int say=0;
        int tane=0;
        FOR(i,sz){ //vec[i] de ise köprü
            say+=tut[vec[i]]*vec[i];
            tane+=tut[vec[i]];
            int say2=top-say;
            res=min(res,tane*vec[i]-say+say2-((tt-tane)*vec[i]));
        }   

        cout<<ans+res+tt/2<<endl;
    }
} 

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