Submission #1159513

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159513		AlgorithmWarrior	Palembang Bridges (APIO15_bridge)	C++20	22 / 100	65 ms	1508 KiB

bridge

#include <bits/stdc++.h>

using namespace std;

int k,n;
long long rasp;
vector<int>poz;

void read(){
    cin>>k>>n;
    int i;
    for(i=1;i<=n;++i){
        char tip1,tip2;
        int poz1,poz2;
        cin>>tip1>>poz1>>tip2>>poz2;
        if(tip1==tip2)
            rasp+=abs(poz1-poz2);
        else{
            ++rasp;
            poz.push_back(poz1);
            poz.push_back(poz2);
        }
    }
}

void solve(){
    sort(poz.begin(),poz.end());
    int median=poz.size()/2;
    int i;
    for(i=0;i<(int)poz.size();++i)
        rasp+=abs(poz[median]-poz[i]);
}

int main(){
    read();
    solve();
    cout<<rasp;
    return 0;
}

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