oj.uz

답안 #589920

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589920 2022-07-05T11:53:28 Z dxz05 Palembang Bridges (APIO15_bridge) C++14
63 / 100
 2000 ms 12412 KB 
#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 5555;

long long Solve_One_Bridge(const vector<int> &a, const vector<int> &b){
    vector<int> c;
    for (int i : a) c.push_back(i);
    for (int i : b) c.push_back(i);

    sort(all(c));

    long long res = 0;
    int mid = c[(int)c.size() / 2 - 1];

    for (int i : c) res += abs(i - mid);

    return res;
}

long long cost(const vector<int> &a, const vector<int> &b, int x, int y){
    ll res = 0;
    for (int i = 0; i < a.size(); i++){
        res += min(abs(a[i] - x) + abs(b[i] - x), abs(a[i] - y) + abs(b[i] - y));
    }
    return res;
}

void solve(int TC) {
    int k, n;
    cin >> k >> n;

    long long ans = 0;

    vector<int> a, b;
    while (n--){
        char p, q;
        int x, y;
        cin >> p >> x >> q >> y;

        if (p == q){
            ans += abs(x - y);
        } else {
            ans++;
            if (x > y) swap(x, y);
            a.push_back(x);
            b.push_back(y);
        }

    }

    n = a.size();

    if (n == 0){
        cout << ans << endl;
        return;
    }

    if (k == 1) {
        cout << ans + Solve_One_Bridge(a, b) << endl;
        return;
    }

    set<int> positions;
    for (int i : a) positions.insert(i);
    for (int i : b) positions.insert(i);

    vector<int> pos;
    for (int i : positions) pos.push_back(i);

    ll best = LLINF;
    for (int i = 0; i < pos.size(); i++){
        int x = pos[i];
        int l = i, r = pos.size() - 1;
        while (r - l >= 3){
            int m1 = l + (r - l) / 3;
            int m2 = r - (r - l) / 3;

            ll f1 = cost(a, b, x, pos[m1]);
            ll f2 = cost(a, b, x, pos[m2]);

            best = min({best, f1, f2});

            if (f1 > f2){
                l = m1;
            } else {
                r = m2;
            }
        }

        for (int j = l; j <= r; j++) best = min(best, cost(a, b, x, pos[j]));
    }

    cout << ans + best << endl;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
    //    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

#ifdef dddxxz
    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif

    return 0;
}

Compilation message

bridge.cpp: In function 'long long int cost(const std::vector<int>&, const std::vector<int>&, int, int)':
bridge.cpp:61:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for (int i = 0; i < a.size(); i++){
      |                     ~~^~~~~~~~~~
bridge.cpp: In function 'void solve(int)':
bridge.cpp:110:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     for (int i = 0; i < pos.size(); i++){
      |                     ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 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 356 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 340 KB Output is correct
11 Correct 1 ms 352 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 332 KB Output is correct
6 Correct 1 ms 332 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
12 Correct 20 ms 3024 KB Output is correct
13 Correct 46 ms 4584 KB Output is correct
14 Correct 29 ms 3392 KB Output is correct
15 Correct 23 ms 2896 KB Output is correct
16 Correct 27 ms 3872 KB Output is correct
17 Correct 40 ms 4536 KB Output is correct
18 Correct 36 ms 4176 KB Output is correct
19 Correct 40 ms 4536 KB Output is correct
20 Correct 38 ms 4104 KB Output is correct
21 Correct 45 ms 4300 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 312 KB Output is correct
15 Correct 35 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 5 ms 328 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 36 ms 444 KB Output is correct
21 Correct 36 ms 340 KB Output is correct
22 Correct 35 ms 340 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 36 ms 444 KB Output is correct

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 2 ms 328 KB Output is correct
15 Correct 35 ms 448 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 39 ms 464 KB Output is correct
21 Correct 38 ms 340 KB Output is correct
22 Correct 34 ms 440 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 36 ms 336 KB Output is correct
25 Correct 19 ms 2000 KB Output is correct
26 Correct 121 ms 2288 KB Output is correct
27 Execution timed out 2083 ms 12412 KB Time limit exceeded
28 Halted 0 ms 0 KB -