oj.uz

Submission #221850

# Submission time Handle Problem Language Result Execution time Memory
221850 2020-04-11T09:35:44 Z MKopchev Palembang Bridges (APIO15_bridge) C++14
100 / 100
 102 ms 7816 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=1e5+42;

char take()
{
    char c=getchar();
    while(c!='A'&&c!='B')c=getchar();
    return c;
}

int k,n;

pair<int,int> inp[nmax];

long long extra=0;

bool cmp(pair<int,int> a,pair<int,int> b)
{
    return a.first+a.second<b.first+b.second;
}

long long pref[nmax],suff[nmax];

long long vals[2][nmax];

priority_queue< int > maxi,mini,idle;

long long maxi_sum=0,mini_sum=0;

void add_maxi(int val)
{
    maxi_sum+=val;
    maxi.push(-val);
}
void pop_maxi()
{
    maxi_sum-=(-maxi.top());
    maxi.pop();
}

void add_mini(int val)
{
    mini_sum+=val;
    mini.push(val);
}
void pop_mini()
{
    mini_sum-=(mini.top());
    mini.pop();
}

long long ask()
{
    int median=mini.top();

    long long sum_1=maxi_sum-1LL*median*maxi.size();

    long long sum_2=1LL*median*mini.size()-mini_sum;

    return sum_1+sum_2;
}

void go(int id)
{
    maxi_sum=0;
    mini_sum=0;

    maxi=idle;
    mini=idle;

    for(int i=1;i<=n;i++)
    {
        add_maxi(inp[i].second);

        add_mini(inp[i].first);

        while(mini.top()>-maxi.top())
        {
            int maxi_top=-maxi.top();

            int mini_top=mini.top();

            pop_maxi();

            pop_mini();

            add_maxi(mini_top);

            add_mini(maxi_top);
        }

        vals[id][i]=ask();

        //cout<<"in! "<<inp[i].first<<" "<<inp[i].second<<" -> "<<vals[id][i]<<" "<<maxi.top()<<" "<<mini.top()<<" "<<maxi_sum<<" "<<mini_sum<<endl;
    }
}
int main()
{
    scanf("%i%i",&k,&n);

    for(int i=1;i<=n;i++)
    {
        char type_1,type_2;

        int where_1,where_2;

        type_1=take();
        scanf("%i",&where_1);

        type_2=take();
        scanf("%i",&where_2);

        if(where_1>where_2)swap(where_1,where_2);

        if(type_1==type_2){extra+=abs(where_1-where_2);i--;n--;}
        else inp[i]={where_1,where_2};
    }

    extra+=n;

    if(n==0)
    {
        printf("%lld\n",extra);
        return 0;
    }

    sort(inp+1,inp+n+1,cmp);

    go(0);

    if(k==1)
    {
        printf("%lld\n",extra+vals[0][n]);
        return 0;
    }

    reverse(inp+1,inp+n+1);

    go(1);

    for(int i=0;i<=n;i++)
        pref[i]=vals[0][i];

    for(int i=0;i<=n;i++)
        suff[i]=vals[1][n+1-i];

    long long output=1e18;

    for(int i=0;i<=n;i++)
        output=min(output,pref[i]+suff[i+1]);
    /*
    for(int i=1;i<=n;i++)cout<<pref[i]<<" ";cout<<endl;
    for(int i=1;i<=n;i++)cout<<suff[i]<<" ";cout<<endl;
    cout<<output<<endl;
    */

    printf("%lld\n",output+extra);
    return 0;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:100:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i",&k,&n);
     ~~~~~^~~~~~~~~~~~~~
bridge.cpp:109:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&where_1);
         ~~~~~^~~~~~~~~~~~~~~
bridge.cpp:112:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&where_2);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 392 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 41 ms 3700 KB Output is correct
13 Correct 78 ms 5228 KB Output is correct
14 Correct 61 ms 3820 KB Output is correct
15 Correct 49 ms 3316 KB Output is correct
16 Correct 43 ms 4588 KB Output is correct
17 Correct 72 ms 5232 KB Output is correct
18 Correct 46 ms 4844 KB Output is correct
19 Correct 80 ms 5228 KB Output is correct
20 Correct 57 ms 4988 KB Output is correct
21 Correct 75 ms 4972 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
32.0 / 32.0

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

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 47 ms 5996 KB Output is correct
26 Correct 76 ms 6200 KB Output is correct
27 Correct 95 ms 7160 KB Output is correct
28 Correct 100 ms 7532 KB Output is correct
29 Correct 98 ms 7532 KB Output is correct
30 Correct 53 ms 4212 KB Output is correct
31 Correct 44 ms 6900 KB Output is correct
32 Correct 99 ms 7816 KB Output is correct
33 Correct 50 ms 7148 KB Output is correct
34 Correct 102 ms 7532 KB Output is correct
35 Correct 68 ms 7084 KB Output is correct
36 Correct 97 ms 7276 KB Output is correct
37 Correct 42 ms 6124 KB Output is correct