oj.uz

Submission #1016960

# Submission time Handle Problem Language Result Execution time Memory
1016960 2024-07-08T16:23:47 Z TroySer Palembang Bridges (APIO15_bridge) C++17
0 / 100
 1 ms 448 KB 
#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;

long long int cost(long long int currK) {
    long long int currMin = 0;
    for (int j = 0; j < people.size(); j++) {
        currMin += abs(people[j].first.building - currK);
        currMin++;
        currMin += abs(people[j].second.building - currK);
    }
    return currMin;
}

const bool cmp(const pair<Place, Place> &a, pair<Place, Place> &b) {
    return a.first.building < b.first.building;
}

const bool cmp2(const pair<Place, Place> &a, pair<Place, Place> &b) {
    return a.second.building < b.second.building;
}

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

    int M = people.size();
    // cout << M << "\n";
    long long int possibleMin = INF;

    if (M == 0) possibleMin = 0;
    else {
        sort(people.begin(), people.end(), cmp);

        for (int i = M/2; i <= M/2 + 1; i++) {
            possibleMin = min(possibleMin, cost(people[i].first.building));
            possibleMin = min(possibleMin, cost(people[i].second.building));
        }

        sort(people.begin(), people.end(), cmp2);
        for (int i = M/2; i <= M/2 + 1; i++) {
            possibleMin = min(possibleMin, cost(people[i].first.building));
            possibleMin = min(possibleMin, cost(people[i].second.building));
        }
    }

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

Compilation message

bridge.cpp: In function 'long long int cost(long long int)':
bridge.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<Place, Place> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for (int j = 0; j < people.size(); j++) {
      |                     ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 448 KB Output is correct
5 Incorrect 1 ms 448 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 432 KB Output isn't correct
4 Halted 0 ms 0 KB -