oj.uz

Submission #121501

# Submission time Handle Problem Language Result Execution time Memory
121501 2019-06-26T15:22:54 Z IOrtroiii Palembang Bridges (APIO15_bridge) C++14
22 / 100
 419 ms 15448 KB 
/*
1 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
*/
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

ll lsum;
ll rsum;
multiset<int> lval;
multiset<int> rval;

void add(int u, int v) {
   rsum += u;
   rval.insert(u);
   rsum += v;
   rval.insert(v);
   while (rval.size() > lval.size()) {
      int x = *rval.begin();
      rsum -= x;
      rval.erase(rval.find(x));
      lsum += x;
      lval.insert(x);
   }
   while (*--lval.end() > *rval.begin()) {
      int x = *--lval.end();
      int y = *rval.begin();
      lsum -= x;
      lval.erase(lval.find(x));
      lsum += y;
      lval.insert(y);
      rsum -= y;
      rval.erase(rval.find(y));
      rsum += x;
      rval.insert(x);
   }
}

vector<ll> eval(vector<pair<int, int>> vals) {
   lsum = 0;
   lval.clear();
   rsum = 0;
   rval.clear();
   int n = vals.size();
   vector<ll> f(1, 0);
   for (int i = 0; i < n; ++i) {
      add(vals[i].first, vals[i].second);
      f.push_back(rsum - lsum);
   }
   return f;
}

int main() {
   ios_base::sync_with_stdio(false);
   int k, n;
   cin >> k >> n;
   ll ans = 0;
   vector<pair<int, int>> vals;
   for (int i = 0; i < n; ++i) {
      string p, q;
      int s, t;
      cin >> p >> s >> q >> t;
      if (p == q) {
         ans += abs(s - t);
      } else {
         ++ans;
         vals.emplace_back(s, t);
      }
   }
   sort(vals.begin(), vals.end(), [&](pair<int, int> u, pair<int, int> v) {
      return u.first + u.second < v.first + v.second;
   });
   auto f = eval(vals);
   reverse(vals.begin(), vals.end());
   auto g = eval(vals);
   int m = vals.size();
   ll mn = 1e18;
   for (int i = 0; i < (k == 1 ? 1 : m); ++i) {
      mn = min(mn, f[i] + g[m - i]);
   }
   cout << ans + mn << "\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 420 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 177 ms 13916 KB Output is correct
13 Correct 419 ms 15420 KB Output is correct
14 Correct 311 ms 13232 KB Output is correct
15 Correct 186 ms 9092 KB Output is correct
16 Correct 190 ms 15132 KB Output is correct
17 Correct 222 ms 15448 KB Output is correct
18 Correct 138 ms 15168 KB Output is correct
19 Correct 217 ms 15432 KB Output is correct
20 Correct 192 ms 15068 KB Output is correct
21 Correct 230 ms 15324 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -