제출 #400039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
400039		MeGustaElArroz23	Palembang Bridges (APIO15_bridge)	C++14	0 / 100	1 ms	332 KiB

bridge

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

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

int main(){
    int k,n;
    cin >> k >> n;
    int sol=0;
    vii v;
    for (int i=n;i>0;i--){
        char a,b;
        int x,y;
        cin >> a >> x >> b >> y;
        if (a==b){
            sol+=abs(x-y);
            n--;
        }
        else v.push_back(pii{x,y});
    }
    if (k==1){
        vi a;
        for (pii x:v){
            a.push_back(x.first);
            a.push_back(x.second);
        }
        int median=v.size();
        //auto it=a.begin();
        //for (int i=1;i<median;i++) it++;
        //nth_element(a.begin(),it,a.end());
        //int piv=*it;
        sort(a.begin(),a.end());
        int piv=a[median];
        for (pii x:v){
            sol++;
            sol+=abs(x.first-piv);
            sol+=abs(x.second-piv);
        }
        cout << sol<<'\n';
    }
}

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