oj.uz

Submission #14534

# Submission time Handle Problem Language Result Execution time Memory
14534 2015-05-19T06:53:07 Z dohyun0324 Palembang Bridges (APIO15_bridge) C++
100 / 100
 163 ms 6536 KB 
#include<stdio.h>
#include<algorithm>
#include<queue>
using namespace std;
priority_queue<int>q;
priority_queue<int,vector<int>,greater<int> >q2;
char c1,c2;
long long dap,d[3][100010],dap2,dap3;
int t,w2,k,n,x1,x2,w,arr[200010];
struct data{
    int x,y;
    bool operator<(const data&r)const{
        return (x+y)<r.x+r.y;
    }
}a[100010];
void pro(int p)
{
    int c=0;
    long long sum=0,sum2=0,mid=0,i;
    while(q.size()) q.pop();
    while(q2.size()) q2.pop();
    q.push(min(a[1].x,a[1].y)); q2.push(max(a[1].x,a[1].y));
    d[p][1]=abs(a[1].x-a[1].y);
    sum=min(a[1].x,a[1].y); sum2=a[1].x+a[1].y;
    for(i=2;i<=w;i++){
        sum2+=a[i].x+a[i].y;
        if(q.top()>a[i].x){
            sum+=a[i].x-q.top();
            q2.push(q.top()); q.pop(); q.push(a[i].x);
        }
        else q2.push(a[i].x);
        sum+=q2.top(); q.push(q2.top()); q2.pop();
        if(q.top()>a[i].y){
            sum+=a[i].y-q.top();
            q2.push(q.top()); q.pop(); q.push(a[i].y);
        }
        else q2.push(a[i].y);
        mid=q.top();
        d[p][i]=mid*i-sum+(sum2-sum)-mid*i;
    }
}
int main()
{
    int i;
    scanf("%d %d",&k,&n);
    for(i=1;i<=n;i++){
        scanf(" %c %d %c %d",&c1,&x1,&c2,&x2);
        if(c1==c2) dap+=abs(x2-x1);
        else{w++; a[w].x=x1; a[w].y=x2; arr[++w2]=x1; arr[++w2]=x2;}
    }
    dap2=dap;
    sort(a+1,a+w+1); sort(arr+1,arr+w2+1);
    if(k==1 || k==2){
        for(i=1;i<=w2;i++) dap+=abs(arr[i]-arr[w]);
        dap3=dap;
    }
    if(k==2){
        dap=1e+15;
        pro(1); reverse(a+1,a+w+1); pro(2);
        for(i=1;i<=w;i++) dap=min(dap,d[1][i]+d[2][w-i]);
    }
    if(k==2) printf("%lld",min(dap3+w,dap+w+dap2));
    else printf("%lld",dap3+w);
    return 0;
}

Compilation message

bridge.cpp: In function 'void pro(int)':
bridge.cpp:18:9: warning: unused variable 'c' [-Wunused-variable]
     int c=0;
         ^
bridge.cpp: In function 'int main()':
bridge.cpp:45:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&k,&n);
                         ^
bridge.cpp:47:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %c %d %c %d",&c1,&x1,&c2,&x2);
                                              ^

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5084 KB Output is correct
2 Correct 0 ms 5084 KB Output is correct
3 Correct 0 ms 5084 KB Output is correct
4 Correct 0 ms 5084 KB Output is correct
5 Correct 0 ms 5084 KB Output is correct
6 Correct 0 ms 5084 KB Output is correct
7 Correct 0 ms 5084 KB Output is correct
8 Correct 0 ms 5084 KB Output is correct
9 Correct 0 ms 5084 KB Output is correct
10 Correct 0 ms 5084 KB Output is correct
11 Correct 0 ms 5084 KB Output is correct
12 Correct 33 ms 5084 KB Output is correct
13 Correct 76 ms 5084 KB Output is correct
14 Correct 63 ms 5084 KB Output is correct
15 Correct 46 ms 5084 KB Output is correct
16 Correct 39 ms 5084 KB Output is correct
17 Correct 39 ms 5084 KB Output is correct
18 Correct 49 ms 5084 KB Output is correct
19 Correct 66 ms 5084 KB Output is correct
20 Correct 46 ms 5084 KB Output is correct
21 Correct 63 ms 5084 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
32.0 / 32.0

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

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5084 KB Output is correct
2 Correct 0 ms 5084 KB Output is correct
3 Correct 0 ms 5084 KB Output is correct
4 Correct 0 ms 5084 KB Output is correct
5 Correct 0 ms 5084 KB Output is correct
6 Correct 0 ms 5084 KB Output is correct
7 Correct 0 ms 5084 KB Output is correct
8 Correct 0 ms 5084 KB Output is correct
9 Correct 0 ms 5084 KB Output is correct
10 Correct 0 ms 5084 KB Output is correct
11 Correct 0 ms 5084 KB Output is correct
12 Correct 0 ms 5084 KB Output is correct
13 Correct 0 ms 5084 KB Output is correct
14 Correct 0 ms 5084 KB Output is correct
15 Correct 0 ms 5084 KB Output is correct
16 Correct 0 ms 5084 KB Output is correct
17 Correct 0 ms 5084 KB Output is correct
18 Correct 0 ms 5084 KB Output is correct
19 Correct 0 ms 5084 KB Output is correct
20 Correct 0 ms 5084 KB Output is correct
21 Correct 0 ms 5084 KB Output is correct
22 Correct 0 ms 5084 KB Output is correct
23 Correct 0 ms 5084 KB Output is correct
24 Correct 0 ms 5084 KB Output is correct
25 Correct 53 ms 6536 KB Output is correct
26 Correct 116 ms 6536 KB Output is correct
27 Correct 163 ms 6536 KB Output is correct
28 Correct 153 ms 6536 KB Output is correct
29 Correct 149 ms 6536 KB Output is correct
30 Correct 73 ms 5764 KB Output is correct
31 Correct 76 ms 6536 KB Output is correct
32 Correct 119 ms 6536 KB Output is correct
33 Correct 116 ms 6536 KB Output is correct
34 Correct 133 ms 6536 KB Output is correct
35 Correct 63 ms 6536 KB Output is correct
36 Correct 109 ms 6536 KB Output is correct
37 Correct 46 ms 6536 KB Output is correct