oj.uz

Submission #1093525

# Submission time Handle Problem Language Result Execution time Memory
1093525 2024-09-27T02:16:52 Z RiverFlow Palembang Bridges (APIO15_bridge) C++14
22 / 100
 46 ms 7440 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)2e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

pair<int, int> c[N];

void main_code() {
    int k, n; cin >> k >> n;
    long long ans = 0;
    vec<ii> px;
    long long s1 = 0, s2 = 0;

    for(int i = 1; i <= n; ++i) {
        char a, b; int x, y;
        cin >> a >> x >> b >> y;
        if (a == b) {
            ans += abs(x - y);
            continue ;
        }
        if (x > y) swap(x, y);
        c[i] = _mp(x, y);
        ++ans;
        s2 += x + y;
        px.push_back(_mp(x, i));
        px.push_back(_mp(y, 0));
        px.push_back(_mp(y + 1, -i));
    }
    sort(px.begin(), px.end());
    int cl = 0, cr = sz(px) / 3;
    long long s3 = 0;
    long long res = LLONG_MAX;
    if (sz(px) == 0) res = 0;
    for(int i = 0, j = 0; i < sz(px); i = j + 1) {
        while (j + 1 < sz(px) and px[j + 1].fi == px[i].fi) ++j;
        for(int k = i; k <= j; ++k) {
            if (px[k].second > 0) {
                auto [l, r] = c[px[k].second];
                s2 -= l + r;
                s3 += r - l;
                --cr;
            } else if (px[k].second < 0) {
                auto [l, r] = c[-px[k].second];
                s3 -= r - l;
                s1 += -l - r;
                ++cl;
            }
        }
        int x = px[i].first;
        res = min(res, 2LL * x * cl + s1 + s3 + s2 - 2LL * cr * x);
    }
    cout << ans + res;
}


/*     Let the river flows naturally     */

Compilation message

bridge.cpp: In function 'void main_code()':
bridge.cpp:78:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   78 |                 auto [l, r] = c[px[k].second];
      |                      ^
bridge.cpp:83:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   83 |                 auto [l, r] = c[-px[k].second];
      |                      ^
bridge.cpp: In function 'int main()':
bridge.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 30 ms 5972 KB Output is correct
13 Correct 46 ms 7380 KB Output is correct
14 Correct 37 ms 6612 KB Output is correct
15 Correct 24 ms 4056 KB Output is correct
16 Correct 28 ms 6848 KB Output is correct
17 Correct 25 ms 7440 KB Output is correct
18 Correct 32 ms 7116 KB Output is correct
19 Correct 39 ms 7372 KB Output is correct
20 Correct 34 ms 7120 KB Output is correct
21 Correct 35 ms 7380 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 464 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 464 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -