oj.uz

답안 #1063458

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063458 2024-08-17T18:49:59 Z DeathIsAwe Palembang Bridges (APIO15_bridge) C++17
31 / 100
 133 ms 14832 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long


bool compare(pair<int,int> a, pair<int,int> b) {
    if (a.first == b.first) {
        return a.second > b.second;
    }
    return a.first < b.first;
}


int32_t main() {
    char p, q;
    int s, t, k, n; cin >> k >> n;
    ll ans = 0;
    unordered_map<int,int> bruh;
    unordered_map<int,int> sus;
    vector<int> bridgeplaces;
    vector<pair<int, int>> housework;


    if (k == 2) {
    ll baseans = 0;
    for (int i=0;i<n;i++) {
        cin >> p >> s >> q >> t;
        if (p == q) {
            baseans += abs(s - t);
            continue;
        }
        if (t > s) {
            swap(t, s);
        }
        housework.push_back(make_pair(s + t, s - t));
    }
    n = housework.size();
    if (n == 0) {
        cout << baseans;
        return 0;
    }
    if (n == 1) {
        cout << baseans + housework[0].second + 1;
    }


    unordered_set<int> posset;
    pair<int,int> dum;
    vector<int> posplaces;
    for (int i=0;i<n;i++) {
        if (posset.find((housework[i].first - housework[i].second) / 2) == posset.end()) {
            posset.insert((housework[i].first - housework[i].second) / 2);
            posplaces.push_back((housework[i].first - housework[i].second) / 2);
        }
        if (posset.find((housework[i].first + housework[i].second) / 2) == posset.end()) {
            posset.insert((housework[i].first + housework[i].second) / 2);
            posplaces.push_back((housework[i].first + housework[i].second) / 2);
        }
    }


    sort(posplaces.begin(), posplaces.end());
    sort(housework.begin(), housework.end(), compare);
    vector<int> ansright(n-1), ansleft(n-1);
    priority_queue<int, vector<int>, greater<int>> lefttown, righttown;
    ll ahead = 0, behind = 0, curpos = 0, sigma, tate; ans = 0;
    for (int i=0;i<n-1;i++) {
        ans += housework[i].second + 1;
        sigma = (housework[i].first - housework[i].second) / 2;
        tate = (housework[i].first + housework[i].second) / 2;
        if (sigma > posplaces[curpos]) {
            ahead++;
            ans += 2 * (sigma - posplaces[curpos]);
            lefttown.push(sigma);
        }
        if (tate == posplaces[curpos]) {
            behind++;
        } else {
            righttown.push(tate);
        }
        while (ahead > behind) {
            curpos++;
            ans -= 2*(ahead - behind)*(posplaces[curpos] - posplaces[curpos - 1]);
            while (!lefttown.empty() && lefttown.top() == posplaces[curpos]) {
                lefttown.pop();
                ahead--;
            }
            while (!righttown.empty() && righttown.top() == posplaces[curpos]) {
                righttown.pop();
                behind++;
            }
        }
        //cout << posplaces[curpos] << '\n';
        ansleft[i] = ans;
    }


    priority_queue<int> lefttown2, righttown2;
    ahead = 0; behind = 0; curpos = posplaces.size() - 1; ans = 0;
    for (int i=n-1;i>0;i--) {
        ans += housework[i].second + 1;
        sigma = (housework[i].first - housework[i].second) / 2;
        tate = (housework[i].first + housework[i].second) / 2;
        if (tate < posplaces[curpos]) {
            ahead++;
            ans += 2 * (posplaces[curpos] - tate);
            righttown2.push(tate);
        }
        if (sigma == posplaces[curpos]) {
            behind++;
        } else {
            lefttown.push(sigma);
        }
        lefttown2.push(sigma);
        while (ahead > behind) {
            curpos--;
            ans -= 2*(ahead - behind)*(posplaces[curpos + 1] - posplaces[curpos]);
            while (!righttown2.empty() && righttown2.top() == posplaces[curpos]) {
                righttown2.pop();
                ahead--;
            }
            while (!lefttown2.empty() && lefttown2.top() == posplaces[curpos]) {
                lefttown2.pop();
                behind++;
            }
        }
        ansright[i - 1] = ans;
    }


    //for (int i=0;i<n-1;i++) {
    //    cout << ansright[i] << ' ';
    //} cout << '\n';
    //for (int i=0;i<n-1;i++) {
    //    cout << ansleft[i] << ' ';
    //} cout << '\n';


    ll realans = INT64_MAX;
    for (int i=0;i<n-1;i++) {
        realans = min(realans, ansleft[i] + ansright[i]);
    }
    cout << realans + baseans;


    return 0;
    }


    ll ahead = 0;
    for (int i=0;i<n;i++) {
        cin >> p >> s >> q >> t;
        if (t > s) {
            swap(t, s);
        }
        if (p == q) {
            ans += abs(s - t);
            continue;
        }
        ahead++;
        housework.push_back(make_pair(t, s));
        if (bruh.find(s) == bruh.end()) {
            bruh[s] = 1;
            if (sus.find(s) == sus.end()) {
                bridgeplaces.push_back(s);
            }
        } else {
            bruh[s]++;
        }
        if (sus.find(t) == sus.end()) {
            sus[t] = 1;
            if (bruh.find(t) == bruh.end()) {
                bridgeplaces.push_back(t);
            }
        } else {
            sus[t]++;
        }
    }


    sort(bridgeplaces.begin(), bridgeplaces.end());
    for (pair<int,int> i: housework) {
        ans += i.first + i.second + 1;
    }
    ll curans = ans;
    ll prev = 0;
    ll visitednum = 0;
    for (int i=0;i<bridgeplaces.size();i++) {
        curans += 2 * (bridgeplaces[i] - prev) * (visitednum - ahead);
        //cout << visitednum << ' ' << ahead << ' ' << bridgeplaces[i] << ' ' << curans << '\n';
        if (bruh.find(bridgeplaces[i]) != bruh.end()) {
            visitednum += bruh[bridgeplaces[i]];
        }
        if (sus.find(bridgeplaces[i]) != sus.end()) {
            ahead -= sus[bridgeplaces[i]];
        }
        ans = min(ans, curans);
        prev = bridgeplaces[i];
    }
    cout << ans;
}

Compilation message

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 476 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 560 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 27 ms 3280 KB Output is correct
13 Correct 131 ms 14712 KB Output is correct
14 Correct 40 ms 4304 KB Output is correct
15 Correct 65 ms 8672 KB Output is correct
16 Correct 50 ms 3812 KB Output is correct
17 Correct 107 ms 14832 KB Output is correct
18 Correct 72 ms 14356 KB Output is correct
19 Correct 133 ms 14608 KB Output is correct
20 Correct 55 ms 3792 KB Output is correct
21 Correct 109 ms 14616 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 424 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 436 KB Output is correct
10 Correct 0 ms 436 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 0 ms 344 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Incorrect 1 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Incorrect 1 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -