oj.uz

Submission #966255

# Submission time Handle Problem Language Result Execution time Memory
966255 2024-04-19T15:24:44 Z Neco_arc Palembang Bridges (APIO15_bridge) C++17
100 / 100
 164 ms 16360 KB 
#include <bits/stdc++.h>

#define ll long long
#define all(x) x.begin(), x.end()
#define Neco "Palembang Bridges"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 2e5 + 7

using namespace std;

const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll GetRandom(ll l, ll r)
{
    return uniform_int_distribution<ll> (l, r)(rng);
}

int n, N, k;
ll Sum, pre[maxn], suf[maxn];
ll Sum1, Sum2, ans = 1e18;
multiset<int> S1, S2;
pair<int, int> a[maxn];

void Peko() {
    if(S2.size() > S1.size()) {
        int val = *S2.begin();
        S1.insert(val), S2.erase(S2.begin());
        Sum1 -= val, Sum2 -= val;
    }

    if(S1.size() > S2.size() + 1) {
        int val = *S1.rbegin();
        S1.erase(prev(S1.end())), S2.insert(val);
        Sum1 += val, Sum2 += val;
    }
}

void Add(int x) {
    int mid = S1.empty() ? 0 : *S1.rbegin();
    if(x > mid) S2.insert(x), Sum2 += x;
    else S1.insert(x), Sum1 -= x;

    Peko();
}

void solve()
{

    cin >> k >> n;
    fi(i, 1, n) {
        char T1, T2; int x, y;
        cin >> T1 >> x >> T2 >> y;

        if(T1 == T2) Sum += abs(x - y);
        else a[++N] = {x, y};
    }

    sort(a + 1, a + 1 + N, [](pair<int, int> x, pair<int, int> y) { return x.first + x.second < y.first + y.second; } );

    fi(i, 1, N) {
        Add(a[i].first), Add(a[i].second);
        ll mid = *S1.rbegin(), L1 = S1.size(), L2 = S2.size();

        pre[i] = mid * L1 - mid * L2 + Sum1 + Sum2;
    }

    S1.clear(), S2.clear(), Sum1 = Sum2 = 0;

    fid(i, N, 1) {
        Add(a[i].first), Add(a[i].second);
        ll mid = *S1.rbegin(), L1 = S1.size(), L2 = S2.size();
        suf[i] = mid * L1 - mid * L2 + Sum1 + Sum2;
    }

    if(k == 1) ans = Sum + suf[1];
    else
    {
        fi(i, 0, N) ans = min(ans, Sum + pre[i] + suf[i + 1]);
    }

    cout << ans + N;

}


int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if(fopen(Neco".inp", "r")) {
        freopen(Neco".inp", "r", stdin);
        freopen(Neco".out", "w", stdout);
    }


    int nTest = 1;
//    cin >> nTest;


    while(nTest--)
    {
        solve();
    }


    return 0;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:103:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |         freopen(Neco".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:104:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |         freopen(Neco".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4572 KB Output is correct
10 Correct 2 ms 4444 KB Output is correct
11 Correct 2 ms 4572 KB Output is correct
12 Correct 96 ms 14888 KB Output is correct
13 Correct 164 ms 16320 KB Output is correct
14 Correct 133 ms 14332 KB Output is correct
15 Correct 76 ms 11308 KB Output is correct
16 Correct 83 ms 15484 KB Output is correct
17 Correct 100 ms 16312 KB Output is correct
18 Correct 77 ms 15952 KB Output is correct
19 Correct 98 ms 16332 KB Output is correct
20 Correct 96 ms 15696 KB Output is correct
21 Correct 93 ms 15956 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4568 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4572 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4568 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4696 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4568 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 2 ms 4440 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4604 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4696 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4560 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4504 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 1 ms 4708 KB Output is correct
24 Correct 2 ms 4896 KB Output is correct
25 Correct 110 ms 15108 KB Output is correct
26 Correct 129 ms 14928 KB Output is correct
27 Correct 147 ms 15736 KB Output is correct
28 Correct 146 ms 16244 KB Output is correct
29 Correct 147 ms 16360 KB Output is correct
30 Correct 67 ms 10576 KB Output is correct
31 Correct 83 ms 15444 KB Output is correct
32 Correct 95 ms 16016 KB Output is correct
33 Correct 75 ms 15696 KB Output is correct
34 Correct 96 ms 15760 KB Output is correct
35 Correct 95 ms 15440 KB Output is correct
36 Correct 93 ms 15700 KB Output is correct
37 Correct 97 ms 14836 KB Output is correct