Submission #726879

#	Time	Username	Problem	Language	Result	Execution time	Memory
726879		Koyote	Palembang Bridges (APIO15_bridge)	C++11	0 / 100	1 ms	336 KiB

bridge

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

const int N = 1e5 + 2;
struct inp {
    char a, b;
    int x, y;
    void read() { cin >> a >> x >> b >> y; }
} arr[N];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int k, n; cin >> k >> n;
    for (int i = 1; i <= n; i++) arr[i].read();
    if (k == 1) {
        vector<int> tmp;
        for (int i = 1; i <= n; i++)
            tmp.push_back(arr[i].x), tmp.push_back(arr[i].y);
        sort(tmp.begin(), tmp.end());
        int med = tmp[n];
        long long ans = 0;
        for (int i = 1; i <= n; i++) {
            if (arr[i].a != arr[i].b)
                ans += abs(arr[i].x - med) + abs(arr[i].y - med) + 1;
            else ans += abs(arr[i].y - arr[i].x);
        }
        cout << ans << '\n';
    } else {
        
    }
}

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