Submission #1016916

#	Time	Username	Problem	Language	Result	Execution time	Memory
1016916		TroySer	Palembang Bridges (APIO15_bridge)	C++17	0 / 100	1 ms	348 KiB

bridge

#include <bits/stdc++.h>

using namespace std;

const long long int INF = 1e18;

long long int K, N;
long long int build1, build2;
char zone1, zone2;

long long int Dmin = 0;

struct Place {
    char zone;
    long long int building;
};

vector<pair<Place, Place> > people;

int main() {
    cin >> K >> N;
    for (int i = 0; i < N; i++) {
        cin >> zone1 >> build1 >> zone2 >> build2;
        if (zone1 == zone2) {
            Dmin += build2 - build1;
        } else {
            people.push_back(make_pair(
                (Place){zone1, build1}, 
                (Place){zone2, build2}
            ));
        }
    }

    int M = people.size();
    long long int possibleMin = INF;
    for (int i = 0; i < M; i++) {
        long long int currK = people[i].first.building;
        long long int currMin = 0;
        for (int j = 0; j < M; j++) {
            currMin += abs(people[j].first.building - currK);
            currMin++;
            currMin += abs(people[j].second.building - currK);
        }
        possibleMin = min(currMin, possibleMin);

        currK = people[i].second.building;
        currMin = 0;
        for (int j = 0; j < M; j++) {
            currMin += abs(people[j].first.building - currK);
            currMin++;
            currMin += abs(people[j].second.building - currK);
        }
        possibleMin = min(currMin, possibleMin);
    }

    cout << possibleMin + Dmin << "\n";
}

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