제출 #932464

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

bridge

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int k, n;
    cin >> k >> n;

    ll ans = 0;
    vector<int> v;

    for(int i=0; i<n; i++) {
        char a, b;
        int c, d;
        cin >> a >> c >> b >> d;

        if(a == b) {
            ans += abs(c - d);
        } else {
            v.push_back(c);
            v.push_back(d);
        }
    }

    if(v.size() == 0) {
        cout << ans << '\n';
        return 0;
    }

    // sort(all(v));
    // ll med = (v[v.size()/2] + v[v.size()/2-1]) / 2;

    // for(int &x : v) ans += abs(med - x);

    // cout << ans + v.size() / 2 << '\n';
    return 0;
}

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