제출 #585447

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

bridge

#include<bits/stdc++.h>

#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int k, n;
int res = 0;
int m = 0;
vector<int> vc;
struct TCitizen
{
    char p;
    int s;
    char q;
    int t;
} a[maxN];
void ReadInput()
{
    cin >> k >> n;
    for(int i=1; i<=n; i++)
    {
        char p, q;
        int s, t;
        cin >> p >> s >> q >> t;
        if(p == q)
        {
            res += abs(s - t);
            continue;
        }
        vc.pb(s);
        vc.pb(t);
        if(s > t) swap(s, t);
        a[++m] = {p, s, q, t};
    }
}
void Solve()
{
    int _min = oo;
    sort(vc.begin(), vc.end());
    vc.erase(unique(vc.begin(), vc.end()), vc.end());
    sort(a + 1, a + m + 1, [](TCitizen p, TCitizen q)
    {
        return p.t < q.t;
    });
    int p = 1;
    int mid = vc.size() / 2;

    for(int i=mid; i<min((int)vc.size(), i+2); i++)
    {
        int x = vc[i];
        int val = 0;
        for(int i=1; i<=m; i++)
            val += abs(x - a[i].s) + abs(x - a[i].t) + 1;
        _min = min(_min, val);
    }
    cout << res + _min;
}
int32_t main()
{
    //freopen("x.inp", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}

컴파일 시 표준 에러 (stderr) 메시지

bridge.cpp: In function 'void Solve()':
bridge.cpp:54:9: warning: unused variable 'p' [-Wunused-variable]
   54 |     int p = 1;
      |         ^

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