oj.uz

Submission #660026

# Submission time Handle Problem Language Result Execution time Memory
660026 2022-11-20T08:56:21 Z highway_to_hell Palembang Bridges (APIO15_bridge) C++14
31 / 100
 1787 ms 5748 KB 
/*  * In the name of GOD  */
 
#pragma GCC optimize("O3,unroll-loops")
 
#include "bits/stdc++.h"
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
#define F first
#define S second
#define mk make_pair
#define int long long
const int N = 101234;
pii p[N];
int k, n, cnt = 0, sum = 0;
 
int get (int a, int b) {
    int ans = 0;
    for (int i = 0; i < n; i++) {
        ans += min(abs(p[i].F - a) + abs(p[i].S - a), abs(p[i].F - b) + abs(p[i].S - b));
    }
    return ans;
}
 
void solve1() {
    int mn = LLONG_MAX;
    vector <int> w;
    for (int i = 0; i < n; i++) {
        w.push_back(p[i].F);
        w.push_back(p[i].S);
    }
    sort(w.begin(), w.end());
    int mid = (int)w.size() / 2;
    mn = get(w[mid], w[mid]);
    cout << mn + sum << '\n';
}
 
vector <int> v;
 
int get3(int I) {
    int i = v[I];
    int mn = LLONG_MAX;
    int l = I, r = (int)v.size();
    while (r - l > 10) {
        int md = (l + r) / 2;
        int j = v[md];
        int j2 = v[md - 1];
        if (get(i, j) >= get(i, j2)) {
            r = md;
            mn = min(mn, get(i, j2));
        } else {
            l = md;
            mn = min(mn, get(i, j));
        }
    }
    for (int k = l - 69; k <= r + 69; k++)
        if (k < (int)v.size() && k > 0)
            mn = min(mn, get(i, v[k]));
    return mn;
}
 
int get2(int I) {
    int i = v[I], mn = LLONG_MAX;
    for (int j : v) {
        mn = min(mn, get(i, j));
    }
    return mn;
}
 
void solve2() {
    int mn = LLONG_MAX;
    for (int I = 0; I < (int)v.size(); I++) {
        mn = min(mn, get3(I));
    }
    int l = 0, r = (int)v.size();
    while (r - l > 10) {
        int j = (l + r) / 2;
        int j2 = (l + r) / 2 - 1;
        if (get2(j) >= get2(j2)) {
            r = (l + r) / 2;
            mn = min(mn, get2(j2));
        } else {
            l = (l + r) / 2;
            mn = min(mn, get2(j));
        }
    }
    for (int k = l - 69; k <= r + 69; k++)
        if (k < (int)v.size() && k > 0)
            mn = min(mn, get2(k));
    cout << mn + sum << '\n';
}
 
int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    cin >> k >> n;
    for (int i = 0; i < n; i++) {
        char c1, c2;
        int a1, a2;
        cin >> c1 >> a1 >> c2 >> a2;
        if (c1 == c2)
            sum += abs(a1 - a2);
        else {
            if (c1 == 'B')
                swap(a1, a2);
            sum++;
            p[cnt] = mk(a1, a2);
            cnt++;
            v.push_back(a1);
            v.push_back(a2);
        }
    }
    sort(v.begin(), v.end());
    n = cnt;
    if (n == 0) {
        cout << sum << '\n';
        return 0;
    }
    if (k == 1)
        solve1();
    else
        solve2();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 340 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 340 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
2 Correct 0 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 340 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 352 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 24 ms 5744 KB Output is correct
13 Correct 55 ms 5632 KB Output is correct
14 Correct 41 ms 5408 KB Output is correct
15 Correct 33 ms 3144 KB Output is correct
16 Correct 30 ms 5708 KB Output is correct
17 Correct 33 ms 5696 KB Output is correct
18 Correct 48 ms 5732 KB Output is correct
19 Correct 58 ms 5748 KB Output is correct
20 Correct 37 ms 5708 KB Output is correct
21 Correct 48 ms 5748 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 10 ms 212 KB Output is correct
4 Correct 11 ms 332 KB Output is correct
5 Correct 4 ms 328 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 13 ms 324 KB Output is correct
8 Correct 14 ms 212 KB Output is correct
9 Correct 13 ms 212 KB Output is correct
10 Correct 21 ms 332 KB Output is correct
11 Correct 12 ms 212 KB Output is correct
12 Correct 18 ms 212 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 12 ms 332 KB Output is correct
4 Correct 12 ms 332 KB Output is correct
5 Correct 4 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 12 ms 212 KB Output is correct
8 Correct 14 ms 212 KB Output is correct
9 Correct 14 ms 332 KB Output is correct
10 Correct 15 ms 332 KB Output is correct
11 Correct 12 ms 324 KB Output is correct
12 Correct 15 ms 212 KB Output is correct
13 Correct 1335 ms 352 KB Output is correct
14 Correct 1721 ms 348 KB Output is correct
15 Correct 1711 ms 344 KB Output is correct
16 Correct 125 ms 340 KB Output is correct
17 Correct 489 ms 344 KB Output is correct
18 Correct 253 ms 340 KB Output is correct
19 Correct 1306 ms 348 KB Output is correct
20 Correct 1758 ms 348 KB Output is correct
21 Correct 1377 ms 344 KB Output is correct
22 Correct 1717 ms 348 KB Output is correct
23 Correct 1309 ms 460 KB Output is correct
24 Incorrect 1681 ms 348 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 9 ms 212 KB Output is correct
4 Correct 12 ms 328 KB Output is correct
5 Correct 4 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 12 ms 328 KB Output is correct
8 Correct 14 ms 336 KB Output is correct
9 Correct 14 ms 340 KB Output is correct
10 Correct 14 ms 332 KB Output is correct
11 Correct 13 ms 320 KB Output is correct
12 Correct 13 ms 324 KB Output is correct
13 Correct 1287 ms 348 KB Output is correct
14 Correct 1684 ms 352 KB Output is correct
15 Correct 1615 ms 348 KB Output is correct
16 Correct 149 ms 340 KB Output is correct
17 Correct 471 ms 340 KB Output is correct
18 Correct 230 ms 340 KB Output is correct
19 Correct 1313 ms 352 KB Output is correct
20 Correct 1675 ms 356 KB Output is correct
21 Correct 1304 ms 348 KB Output is correct
22 Correct 1665 ms 352 KB Output is correct
23 Correct 1299 ms 348 KB Output is correct
24 Incorrect 1787 ms 352 KB Output isn't correct
25 Halted 0 ms 0 KB -