oj.uz

Submission #643127

# Submission time Handle Problem Language Result Execution time Memory
643127 2022-09-21T09:09:55 Z minase Palembang Bridges (APIO15_bridge) C++17
100 / 100
 92 ms 5652 KB 
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

priority_queue<int> lpq;
priority_queue<int, vector<int>, greater<int>> rpq;
i64 lsum, rsum;

bool cmp(pair<int, int> a, pair<int, int> b) {
  return a.first + a.second < b.first + b.second;
}

void insert(int x) {
  int median = (lpq.size() ? lpq.top() : 1000000001);
  if (x <= median) {
    lpq.push(x);
    lsum += x;
  } else {
    rpq.push(x);
    rsum += x;
  }

  if (rpq.size() + 1 < lpq.size()) {
    int nxt = lpq.top();
    lpq.pop();
    rpq.push(nxt);
    lsum -= nxt;
    rsum += nxt;
  } else if (lpq.size() < rpq.size()) {
    int nxt = rpq.top();
    rpq.pop();
    lpq.push(nxt);
    rsum -= nxt;
    lsum += nxt;
  }
}

i64 pref[100001];

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int k, n;
  i64 same_side = 0;
  vector<pair<int, int>> v = {{0, 0}};
  cin >> k >> n;
  for (int i = 0; i < n; i++) {
    char a, b;
    int x, y;
    cin >> a >> x >> b >> y;
    if (a == b)
      same_side += abs(x - y);
    else
      v.push_back({x, y});
  }
  sort(v.begin(), v.end(), cmp);
  n = v.size() - 1;
  same_side += n;

  lsum = rsum = 0;
  for (int i = 1; i <= n; i++) {
    insert(v[i].first);
    insert(v[i].second);
    pref[i] = rsum - lsum;
  }

  i64 ans = pref[n];

  if (k == 2) {
    while (lpq.size())
      lpq.pop();
    while (rpq.size())
      rpq.pop();
    lsum = rsum = 0;

    for (int i = n; i > 0; i--) {
      insert(v[i].first);
      insert(v[i].second);
      ans = min(ans, rsum - lsum + pref[i - 1]);
    }
  }
  cout << same_side + ans;
  return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 27 ms 3916 KB Output is correct
13 Correct 52 ms 5560 KB Output is correct
14 Correct 41 ms 4600 KB Output is correct
15 Correct 36 ms 3476 KB Output is correct
16 Correct 33 ms 4900 KB Output is correct
17 Correct 40 ms 5364 KB Output is correct
18 Correct 42 ms 5440 KB Output is correct
19 Correct 45 ms 5444 KB Output is correct
20 Correct 40 ms 5364 KB Output is correct
21 Correct 48 ms 5272 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 42 ms 3916 KB Output is correct
26 Correct 71 ms 4520 KB Output is correct
27 Correct 92 ms 5040 KB Output is correct
28 Correct 87 ms 5652 KB Output is correct
29 Correct 86 ms 5360 KB Output is correct
30 Correct 44 ms 3020 KB Output is correct
31 Correct 43 ms 4772 KB Output is correct
32 Correct 62 ms 5428 KB Output is correct
33 Correct 64 ms 5020 KB Output is correct
34 Correct 73 ms 5356 KB Output is correct
35 Correct 46 ms 5320 KB Output is correct
36 Correct 65 ms 5192 KB Output is correct
37 Correct 36 ms 3908 KB Output is correct