제출 #297305

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

bridge

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

ll k, n;
ll s, t, numLeft, numRight, distFrom0;
char p, q;
vector<pair<ll, ll> > events;


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> k >> n;
    ll minSum = 0;
    numLeft = numRight = distFrom0 = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> p >> s >> q >> t;
        if (p == q)
        {
            minSum += abs(t - s);
        }
        else
        {
            minSum += 1 + abs(t - s);
            ll b = max(t, s);
            ll a = min(t, s);
            events.push_back({a, -1});
            events.push_back({b, 1});
            numRight++;
            distFrom0 += a;
        }
    }
    //cout << "Min sum is " << minSum << "\n";
    //cout << "Initial dist: " << distFrom0 << "\n";
    sort(events.begin(), events.end());
    ll prevLocation = 0;
    ll finAns = 1000000000000000;
    for (int i = 0; i < events.size(); i++)
    {
        ll currLocation = events[i].first;
        distFrom0 -= numRight * (currLocation - prevLocation);
        distFrom0 += numLeft * (currLocation - prevLocation);
        if (events[i].second == -1)
        {
            numRight--;
        }
        else
        {
            numLeft++;
        }
        finAns = min(finAns, minSum + 2 * distFrom0);
        //cout << "At location " << currLocation << " dist is " << distFrom0 << '\n'; 
        prevLocation = currLocation;
    }
    cout << finAns << "\n";    
}

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

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

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