oj.uz

Submission #660926

# Submission time Handle Problem Language Result Execution time Memory
660926 2022-11-23T14:36:56 Z danikoynov Palembang Bridges (APIO15_bridge) C++14
63 / 100
 100 ms 5940 KB 
#include <bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 1e5 + 10, smalln = 2010;

struct work
{
    ll x, y;
} w[maxn];

int k, n;
ll pref[smalln][2];

bool cmp(work w1, work w2)
{
    return w1.x + w1.y < w2.x + w2.y;
}

struct median
{
    multiset < ll > lf, rf;
    ll lf_sum, rf_sum;

    median()
    {
        lf_sum = 0;
        rf_sum = 0;
    }

    void add(ll x)
    {
        lf.insert(x);
        if (!lf.empty() && !rf.empty())
        {
            if (*lf.rbegin() > *rf.begin())
            {
                ll s1 = *lf.rbegin(), s2 = *rf.begin();
                lf_sum = lf_sum + s2 - s1;
                rf_sum = rf_sum + s1 - s2;
                lf.erase(lf.find(s1));
                rf.erase(rf.find(s2));
                lf.insert(s2);
                rf.insert(s1);
            }
        }
        lf_sum += x;

        if (lf.size() - 1 > rf.size())
        {
            lf_sum -= *lf.rbegin();
            rf_sum += *lf.rbegin();
            rf.insert(*lf.rbegin());
            lf.erase(lf.find(*lf.rbegin()));
            ///cout << lf_sum << " : " << rf_sum << " : " << x << endl;
        }
    }

    ll calc()
    {
        return rf_sum - lf_sum;
    }
};

void solve()
{
    cin >> k >> n;
    ll ans = 0;
    vector < ll > v, sx;
    for (int i = 1; i <= n; i ++)
    {
        char c1, c2;
        cin >> c1 >> w[i].x >> c2 >> w[i].y;
        if (w[i].x > w[i].y)
            swap(w[i].x, w[i].y);
        if (c1 == c2)
        {
            ans = ans + w[i].y - w[i].x;
            i --;
            n --;
        }
        else
        {
            v.push_back(w[i].y);
            v.push_back(w[i].x);
            sx.push_back(w[i].x + w[i].y);
            ans ++;
        }
    }

    //for (int i = 1; i <= n; i ++)
      //  cout << w[i].x << " - " << w[i].y << endl;
    if (k == 1)
    {

        sort(v.begin(), v.end());
        for (int i = 0; i < v.size() / 2; i ++)
            ans = ans - (v[i]);
        for (int i = v.size() / 2; i < v.size(); i ++)
            ans = ans + v[i];

        cout << ans << endl;

    }
    else
    {
        ll best = 1e18;
        if (v.empty())
            best = 0;
        sort(w + 1, w + n + 1, cmp);
        sort(v.begin(), v.end());

        median go_right, go_left;

        for (int i = 1; i <= n; i ++)
        {
            go_right.add(w[i].x);
            go_right.add(w[i].y);
            pref[i][0] = go_right.calc();
        }

        for (int i = n; i > 0; i --)
        {
            go_left.add(w[i].x);
            go_left.add(w[i].y);
            pref[i][1] = go_left.calc();
        }

        for (int i = 0; i <= n; i ++)
        {
            best = min(best, pref[i][0] + pref[i + 1][1]);
        }

        cout << ans + best << endl;

    }


}

int main()
{
    solve();
    return 0;
}
/**
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 'void solve()':
bridge.cpp:106:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |         for (int i = 0; i < v.size() / 2; i ++)
      |                         ~~^~~~~~~~~~~~~~
bridge.cpp:108:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |         for (int i = v.size() / 2; i < v.size(); i ++)
      |                                    ~~^~~~~~~~~~

Subtask #1
8.0 / 8.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 304 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 376 KB Output is correct
7 Correct 2 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 360 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 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 46 ms 5468 KB Output is correct
13 Correct 100 ms 5504 KB Output is correct
14 Correct 70 ms 5124 KB Output is correct
15 Correct 61 ms 3300 KB Output is correct
16 Correct 78 ms 5384 KB Output is correct
17 Correct 89 ms 5500 KB Output is correct
18 Correct 83 ms 5572 KB Output is correct
19 Correct 99 ms 5560 KB Output is correct
20 Correct 81 ms 5648 KB Output is correct
21 Correct 90 ms 5504 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 0 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 308 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 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 444 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 576 KB Output is correct
20 Correct 2 ms 572 KB Output is correct
21 Correct 2 ms 496 KB Output is correct
22 Correct 2 ms 580 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 3 ms 468 KB Output is correct

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 1 ms 340 KB Output is correct
4 Correct 1 ms 212 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 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 1 ms 340 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 3 ms 576 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 576 KB Output is correct
25 Incorrect 59 ms 5940 KB Output isn't correct
26 Halted 0 ms 0 KB -