oj.uz

Submission #117555

# Submission time Handle Problem Language Result Execution time Memory
117555 2019-06-16T14:39:51 Z MAMBA Palembang Bridges (APIO15_bridge) C++17
100 / 100
 322 ms 23940 KB 
#include <bits/stdc++.h>

using namespace std;

inline void read() {}
template <class S>
inline void read(S &arg) {
  cin >> arg;
}
template <class S>
inline void readA(S Lptr, S Rptr) {
  while (Lptr != Rptr) {
    read(*Lptr);
    Lptr++;
  }
}
template <class S, class... T>
inline void read(S &arg, T &... rest) {
  read(arg);
  read(rest...);
}

inline void write() {}
template <class S>
inline void write(S arg) {
  cout << arg;
}
template <class S>
inline void weiteA(S Lptr, S Rptr) {
  if (Lptr != Rptr) {
    write(*Lptr);
    Lptr++;
  }
  while (Lptr != Rptr) {
    write(' ');
    write(*Lptr);
    Lptr++;
  }
}
template <class S, class... T>
inline void write(S arg, T... rest) {
  write(arg);
  write(' ');
  write(rest...);
}

#define rep(i, j, k) for (int i = j; i < (int)k; i++)
#define pb push_back
#define mt make_tuple
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

template <class T, class S>
inline bool smin(T &a, S b) {
  return (T)b < a ? a = b, 1 : 0;
}
template <class T, class S>
inline bool smax(T &a, S b) {
  return a < (T)b ? a = b, 1 : 0;
}

constexpr int MOD = 998244353;
constexpr int N = 1e6 + 10;

template <typename T>
inline T mod(T &v) {
  return v = (v % MOD + MOD) % MOD;
}
template <typename S, typename T>
inline S add(S &l, T r) {
  return mod(l += r);
}
ll po(ll v, ll u) {
  return u ? po(v * v % MOD, u >> 1) * (u & 1 ? v : 1) % MOD : 1;
}

int k, n, cnt;
ll bias, local;
pii p[N];

multiset<int> st[2];
multiset<int>::iterator it;
ll res[N][2];

inline void insert(int b, pii a) {
  st[b].insert(a.first);
  st[b].insert(a.second);
}

inline void f(int id) {
  insert(id, p[0]);
  res[0][id] = p[0].second - p[0].first;
  it = st[id].begin();
  rep(i, 1, cnt) {
    insert(id, p[i]);
    int del = abs(p[i].first - *it) + abs(p[i].second - *it);
    if (p[i].first >= *it) {
      int tmp = *it;
      it++;
      del -= 2 * (*it - tmp);
    } else if (*it > p[i].second)
      it--;
    res[i][id] = res[i - 1][id] + del;
  }
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);

  read(k, n);
  rep(i, 0, n) {
    char a, b;
    int A, B;
    read(a, A, b, B);
    if (A > B) swap(A, B);
    p[cnt++] = {A, B};
    if (a == b) {
      bias += abs(A - B);
      cnt--;
    }
  }

  bias += cnt;

  sort(p, p + cnt,
       [](pii l, pii r) { return l.first + l.second < r.first + r.second; });

  f(0);
  reverse(p, p + cnt);
  f(1);
  if (k == 1) return write(bias + res[cnt - 1][0]), 0;

  ll best = bias + res[cnt - 1][0];

  rep(i, 1, cnt) smin(best, bias + res[i - 1][0] + res[cnt - i - 1][1]);

  write(best);

  return 0;
}

Subtask #1
8.0 / 8.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 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 3 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 2 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 133 ms 21496 KB Output is correct
13 Correct 306 ms 21496 KB Output is correct
14 Correct 226 ms 19364 KB Output is correct
15 Correct 150 ms 12792 KB Output is correct
16 Correct 138 ms 21468 KB Output is correct
17 Correct 142 ms 21496 KB Output is correct
18 Correct 116 ms 21468 KB Output is correct
19 Correct 139 ms 21468 KB Output is correct
20 Correct 143 ms 21504 KB Output is correct
21 Correct 148 ms 21496 KB Output is correct

Subtask #3
9.0 / 9.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 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct

Subtask #4
32.0 / 32.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 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 3 ms 640 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct

Subtask #5
37.0 / 37.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 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 4 ms 640 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 128 ms 21496 KB Output is correct
26 Correct 190 ms 21588 KB Output is correct
27 Correct 291 ms 21524 KB Output is correct
28 Correct 303 ms 23800 KB Output is correct
29 Correct 322 ms 23940 KB Output is correct
30 Correct 145 ms 12792 KB Output is correct
31 Correct 144 ms 23160 KB Output is correct
32 Correct 136 ms 23800 KB Output is correct
33 Correct 102 ms 23416 KB Output is correct
34 Correct 131 ms 23800 KB Output is correct
35 Correct 135 ms 23500 KB Output is correct
36 Correct 139 ms 23648 KB Output is correct
37 Correct 122 ms 22264 KB Output is correct