oj.uz

Submission #317922

# Submission time Handle Problem Language Result Execution time Memory
317922 2020-10-30T20:14:51 Z ali_tavakoli Palembang Bridges (APIO15_bridge) C++17
63 / 100
 2000 ms 5476 KB 
//In the name of Allah
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()

const int N = 1e5 + 5;

int n, k, med[N][2], med2[N][2];
ll base;

vector<pair<ll, pair<ll, ll> > > ve;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    priority_queue<int> q1;
    priority_queue<int, vector<int>, greater<int> > q2;
    cin >> k >> n;
    for(ll i = 0; i < n; i++)
    {
        char ch1, ch2;
        ll p, q;
        cin >> ch1 >> p >> ch2 >> q;
        if(ch1 != ch2)
        {
            ve.pb({p + q, {min(p, q), max(p, q)}});
            base ++;
        }
        else
            base += abs(p - q);
    }
    sort(all(ve));

    for(ll i = 0; i < (ll)ve.size(); i++)
    {
        auto x = ve[i];

        q1.push(x.S.F);
        q2.push(x.S.S);
        while(q1.top() > q2.top())
        {
            ll to1 = q1.top(), to2 = q2.top();
            q1.pop();q2.pop();
            q1.push(to2);
            q2.push(to1);
        }
        med[i][0] = q1.top();
        med[i][1] = q2.top();
    }

    //cout << med[ve.size() - 1][0] << " " << med[ve.size() - 1][1] << endl;

    //if(!n)
        //cout << base << endl;
    
    if(!ve.size())
    {
        cout << base << endl;
        return 0;
    }

    if(k == 1|| ve.size() == 1)
    {
        ll ans1, ans2;
        ans1 = ans2 = 0;
        for(ll i = 0; i < ve.size(); i++)
        {
            ans1 += abs(ve[i].S.F - med[ve.size() - 1][0]);
            ans1 += abs(ve[i].S.S - med[ve.size() - 1][0]);
            ans2 += abs(ve[i].S.F - med[ve.size() - 1][1]);
            ans2 += abs(ve[i].S.S - med[ve.size() - 1][1]);
        }
        cout << min(ans1, ans2) + base << endl;
    }
    else
    {
        ll ans = 1e18 + 5;
        while(q1.size())q1.pop();
        while(q2.size())q2.pop();
        for(ll i = ve.size() - 1; i >= 0; i--)
        {
            auto x = ve[i];

            q1.push(x.S.F);
            q2.push(x.S.S);
            while(q1.top() > q2.top())
            {
                ll to1 = q1.top(), to2 = q2.top();
                q1.pop();q2.pop();
                q1.push(to2);
                q2.push(to1);
            }
            med2[i][0] = q1.top();
            med2[i][1] = q2.top();
        }

        for(int i = 0; i < ve.size() - 1; i++)
        {
            ll ans1, ans2, ans3, ans4;
            ans1 = ans2 = ans3 = ans4 = 0;
            for(int j = 0; j <= i; j++)
            {
                ans1 += abs(ve[j].S.F - med[i][0]);
                ans1 += abs(ve[j].S.S - med[i][0]);
                ans2 += abs(ve[j].S.F - med[i][1]);
                ans2 += abs(ve[j].S.S - med[i][1]);
            }
            for(int j = i + 1; j < ve.size(); j++)
            {
                ans3 += abs(ve[j].S.F - med2[i + 1][0]);
                ans3 += abs(ve[j].S.S - med2[i + 1][0]);
                ans4 += abs(ve[j].S.F - med2[i + 1][1]);
                ans4 += abs(ve[j].S.S - med2[i + 1][1]);
            }
            
            ans = min(ans, min(ans1, ans2) + min(ans3, ans4));
        }

        ll ans1, ans2;
        ans1 = ans2 = 0;
        for(ll i = 0; i < ve.size(); i++)
        {
            ans1 += abs(ve[i].S.F - med[ve.size() - 1][0]);
            ans1 += abs(ve[i].S.S - med[ve.size() - 1][0]);
            ans2 += abs(ve[i].S.F - med[ve.size() - 1][1]);
            ans2 += abs(ve[i].S.S - med[ve.size() - 1][1]);
        }
        ans = min(ans, min(ans1, ans2));

        cout << ans + base << endl;
    }
}

/*
1 5 B 0 A 4 B 1 B 3 A 5 B 7 B 2 A 6 B 1 A 7

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 'int main()':
bridge.cpp:72:25: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         for(ll i = 0; i < ve.size(); i++)
      |                       ~~^~~~~~~~~~~
bridge.cpp:103:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |         for(int i = 0; i < ve.size() - 1; i++)
      |                        ~~^~~~~~~~~~~~~~~
bridge.cpp:114:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |             for(int j = i + 1; j < ve.size(); j++)
      |                                ~~^~~~~~~~~~~
bridge.cpp:127:25: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |         for(ll i = 0; i < ve.size(); i++)
      |                       ~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 32 ms 4700 KB Output is correct
13 Correct 60 ms 4708 KB Output is correct
14 Correct 49 ms 4324 KB Output is correct
15 Correct 35 ms 3052 KB Output is correct
16 Correct 33 ms 4712 KB Output is correct
17 Correct 55 ms 4704 KB Output is correct
18 Correct 39 ms 4712 KB Output is correct
19 Correct 63 ms 4708 KB Output is correct
20 Correct 44 ms 4704 KB Output is correct
21 Correct 59 ms 4704 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
32.0 / 32.0

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

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 4 ms 512 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Execution timed out 2089 ms 5476 KB Time limit exceeded
26 Halted 0 ms 0 KB -