oj.uz

Submission #46039

# Submission time Handle Problem Language Result Execution time Memory
46039 2018-04-17T03:46:44 Z mirbek01 Palembang Bridges (APIO15_bridge) C++17
31 / 100
 2000 ms 78868 KB 
# include <bits/stdc++.h>
#pragma GCC optimize("Ofast")


# define f first
# define s second

using namespace std;

const int N = 1e5 + 2;

struct st{
      int cnt, l, r;
      long long sum = 0;
      st(){
            cnt = sum = l = r = 0;
      }
}t[N * 30];

int n, k, cn, sz = 1, root[N];
long long ans = 1e18, p1[N], s1[N], p2[N], s2[N], ss;
vector <int> v, v1, v2;
pair < pair <int, int> , pair <char, char> > a[N];
pair <int, pair <int, int> > b[N];

void update(int ov, int nv, int pos, int tl = 0, int tr = 1e9){
      if(tl == tr){
            t[nv].cnt = t[ov].cnt + 1;
            t[nv].sum = t[ov].sum + tl;
      } else {
            int tm = (tl + tr) >> 1;
            if(pos <= tm){
                  if(!t[nv].l) t[nv].l = ++ sz;
                  t[nv].r = t[ov].r;
                  update(t[ov].l, t[nv].l, pos, tl, tm);
            } else {
                  if(!t[nv].r) t[nv].r = ++ sz;
                  t[nv].l = t[ov].l;
                  update(t[ov].r, t[nv].r, pos, tm + 1, tr);
            }
            t[nv].sum = t[ t[nv].l ].sum + t[ t[nv].r ].sum;
            t[nv].cnt = t[ t[nv].l ].cnt + t[ t[nv].r ].cnt;
      }
}

pair <long long, int> get(int ov, int nv, int l, int r, int tl = 0, int tr = 1e9){
      if(t[nv].cnt - t[ov].cnt <= 0) return {0, 0};
      if(l <= tl && tr <= r) return {t[nv].sum - t[ov].sum, t[nv].cnt - t[ov].cnt};
      int tm = (tl + tr) >> 1;
      pair <long long, int> res, cp;
      if(l <= tm) res = get(t[ov].l, t[nv].l, l, r, tl, tm);
      if(tm < r){
            cp = get(t[ov].r, t[nv].r, l, r, tm + 1, tr);
            res.f += cp.f;
            res.s += cp.s;
      }
      return res;
}

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

      cin >> k >> n;

      for(int i = 1; i <= n; i ++){
            cin >> a[i].s.f >> a[i].f.f >> a[i].s.s >> a[i].f.s;
            if(a[i].f.f > a[i].f.s) swap(a[i].f.f, a[i].f.s);
            if(a[i].s.f != a[i].s.s) {
                  cn ++;
                  v1.push_back(a[i].f.f), v2.push_back(a[i].f.s);
                  b[cn] = {(a[i].f.f + a[i].f.s + 1), {a[i].f.f, a[i].f.s}};
            } else {
                  ss += abs(a[i].f.s - a[i].f.f);
            }
            v.push_back(a[i].f.f);
            v.push_back(a[i].f.s);
      }

      v1.push_back(-1e9);
      v2.push_back(-1e9);

      sort(b + 1, b + cn + 1);
      sort(v.begin(), v.end());
      v.resize(unique(v.begin(), v.end()) - v.begin());
      sort(v1.begin(), v1.end());
      sort(v2.begin(), v2.end());

      for(int i = 1; i <= cn; i ++){
            p1[i] = p1[i - 1] + v1[i];
            p2[i] = p2[i - 1] + v2[i];
      }
      for(int i = cn; i >= 1; i --){
            s1[i] = s1[i + 1] + v1[i];
            s2[i] = s2[i + 1] + v2[i];
      }

      int pos = 0, ps = 0;

      for(int i = 0; i < v.size(); i ++){
            long long res = 0;
            int x = v[i];
            while(pos + 1 <= cn && v1[pos + 1] <= x) pos ++;
            while(ps + 1 <= cn && v2[ps + 1] <= x) ps ++;
            res += x * 1ll * pos - p1[pos];
            res += x * 1ll * ps - p2[ps];
            res += s1[pos + 1] - x * 1ll * (cn - pos);
            res += s2[ps + 1] - x * 1ll * (cn - ps);
            ans = min(ans, res + cn + ss);
      }

      if(k == 2){
            long long mn = 1e18;
            for(int i = 1; i <= cn; i ++){
                  root[i * 2 - 1] = ++ sz;
                  update(root[i * 2 - 2], root[i * 2 - 1], b[i].s.f);
                  root[i * 2] = ++ sz;
                  update(root[i * 2 - 1], root[i * 2], b[i].s.s);
            }
            for(int i = 0; i < v.size(); i ++){
                  ps = 0;
                  long long sum1 = 0, sum2 = 0;
                  int cnt1 = 0, cnt2 = 0;
                  for(int j = i + 1; j < v.size(); j ++){
                        long long res = 0;
                        int x = (v[i] + v[j] + 1);
                        while(b[ps + 1].f <= x && ps + 1 <= cn) {
                              ps ++;
                              if(b[ps].s.f <= v[i]) sum1 += b[ps].s.f, cnt1 ++;
                              else sum2 += b[ps].s.f, cnt2 ++;
                              if(b[ps].s.s <= v[i]) sum1 += b[ps].s.s, cnt1 ++;
                              else sum2 += b[ps].s.s, cnt2 ++;
                        }
                        res += v[i] * 1ll * cnt1 - sum1;
                        res += sum2 - v[i] * 1ll * cnt2;
                        pair <long long, int> p = get(root[ps * 2], root[cn * 2], 0, v[j]);
                        res += v[j] * 1ll * p.s - p.f;
                        p = get(root[ps * 2], root[cn * 2], v[j] + 1, 1e9);
                        res += p.f - v[j] * 1ll * p.s;
                        if(mn > res) mn = res;
                  }
            }
            ans = min(ans, mn + cn + ss);
      }

      cout << ans;
//      cin.get(); cin.get();
}
/***
2 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
***/

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:100:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 0; i < v.size(); i ++){
                      ~~^~~~~~~~~~
bridge.cpp:120:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < v.size(); i ++){
                            ~~^~~~~~~~~~
bridge.cpp:124:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                   for(int j = i + 1; j < v.size(); j ++){
                                      ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 70776 KB Output is correct
2 Correct 61 ms 70892 KB Output is correct
3 Correct 58 ms 70944 KB Output is correct
4 Correct 59 ms 71136 KB Output is correct
5 Correct 55 ms 71136 KB Output is correct
6 Correct 58 ms 71136 KB Output is correct
7 Correct 54 ms 71144 KB Output is correct
8 Correct 61 ms 71144 KB Output is correct
9 Correct 57 ms 71144 KB Output is correct
10 Correct 58 ms 71144 KB Output is correct
11 Correct 60 ms 71144 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 71144 KB Output is correct
2 Correct 59 ms 71144 KB Output is correct
3 Correct 54 ms 71144 KB Output is correct
4 Correct 57 ms 71148 KB Output is correct
5 Correct 56 ms 71168 KB Output is correct
6 Correct 54 ms 71168 KB Output is correct
7 Correct 56 ms 71168 KB Output is correct
8 Correct 55 ms 71168 KB Output is correct
9 Correct 61 ms 71168 KB Output is correct
10 Correct 58 ms 71168 KB Output is correct
11 Correct 60 ms 71168 KB Output is correct
12 Correct 91 ms 78868 KB Output is correct
13 Correct 149 ms 78868 KB Output is correct
14 Correct 124 ms 78868 KB Output is correct
15 Correct 101 ms 78868 KB Output is correct
16 Correct 95 ms 78868 KB Output is correct
17 Correct 116 ms 78868 KB Output is correct
18 Correct 111 ms 78868 KB Output is correct
19 Correct 134 ms 78868 KB Output is correct
20 Correct 102 ms 78868 KB Output is correct
21 Correct 130 ms 78868 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 78868 KB Output is correct
2 Correct 60 ms 78868 KB Output is correct
3 Correct 57 ms 78868 KB Output is correct
4 Correct 68 ms 78868 KB Output is correct
5 Correct 58 ms 78868 KB Output is correct
6 Correct 55 ms 78868 KB Output is correct
7 Correct 58 ms 78868 KB Output is correct
8 Correct 90 ms 78868 KB Output is correct
9 Correct 61 ms 78868 KB Output is correct
10 Correct 73 ms 78868 KB Output is correct
11 Correct 54 ms 78868 KB Output is correct
12 Correct 66 ms 78868 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 78868 KB Output is correct
2 Correct 60 ms 78868 KB Output is correct
3 Correct 56 ms 78868 KB Output is correct
4 Correct 69 ms 78868 KB Output is correct
5 Correct 61 ms 78868 KB Output is correct
6 Correct 54 ms 78868 KB Output is correct
7 Correct 56 ms 78868 KB Output is correct
8 Correct 78 ms 78868 KB Output is correct
9 Correct 60 ms 78868 KB Output is correct
10 Correct 90 ms 78868 KB Output is correct
11 Correct 54 ms 78868 KB Output is correct
12 Correct 75 ms 78868 KB Output is correct
13 Correct 59 ms 78868 KB Output is correct
14 Correct 65 ms 78868 KB Output is correct
15 Correct 1664 ms 78868 KB Output is correct
16 Correct 54 ms 78868 KB Output is correct
17 Correct 59 ms 78868 KB Output is correct
18 Correct 285 ms 78868 KB Output is correct
19 Correct 61 ms 78868 KB Output is correct
20 Execution timed out 2056 ms 78868 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 78868 KB Output is correct
2 Correct 53 ms 78868 KB Output is correct
3 Correct 55 ms 78868 KB Output is correct
4 Correct 67 ms 78868 KB Output is correct
5 Correct 58 ms 78868 KB Output is correct
6 Correct 55 ms 78868 KB Output is correct
7 Correct 54 ms 78868 KB Output is correct
8 Correct 77 ms 78868 KB Output is correct
9 Correct 64 ms 78868 KB Output is correct
10 Correct 71 ms 78868 KB Output is correct
11 Correct 54 ms 78868 KB Output is correct
12 Correct 78 ms 78868 KB Output is correct
13 Correct 56 ms 78868 KB Output is correct
14 Correct 60 ms 78868 KB Output is correct
15 Correct 1760 ms 78868 KB Output is correct
16 Correct 54 ms 78868 KB Output is correct
17 Correct 67 ms 78868 KB Output is correct
18 Correct 272 ms 78868 KB Output is correct
19 Correct 59 ms 78868 KB Output is correct
20 Execution timed out 2049 ms 78868 KB Time limit exceeded
21 Halted 0 ms 0 KB -