oj.uz

Submission #950335

# Submission time Handle Problem Language Result Execution time Memory
950335 2024-03-20T08:30:30 Z JakobZorz Palembang Bridges (APIO15_bridge) C++17
22 / 100
 63 ms 2792 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;

vector<pair<int,int>>arr;

ll eval(int br){
    ll res=0;
    for(auto[i,j]:arr)
        res+=2*max(0,max(i-br,br-j));
    return res;
}

ll eval2(int br1,int br2){
    ll res=0;
    for(auto[i,j]:arr)
        res+=2*max(0,min(max(i-br1,br1-j),max(i-br2,br2-j)));
    return res;
}

ll eval3(int br){
    int l=br,r=1e9+1;
    while(l<r-1){
        int m=(l+r)/2;
        if(eval2(br,m)>eval2(br,m+1))
            l=m;
        else
            r=m;
    }
    return eval2(br,r);
}

void solve(){
    int k,n;
    cin>>k>>n;
    ll res1=0;
    for(int i=0;i<n;i++){
        char c1,c2;
        int a1,a2;
        cin>>c1>>a1>>c2>>a2;
        res1+=abs(a1-a2);
        if(c1!=c2){
            res1++;
            if(a1>a2)
                swap(a1,a2);
            arr.emplace_back(a1,a2);
        }
    }
    
    vector<int>pos;
    for(auto[i,j]:arr){
        pos.push_back(i);
        pos.push_back(j);
    }
    sort(pos.begin(),pos.end());
    
    ll res2=1e18;
    if(k==1){
        int l=-1,r=1e9+1;
        while(l<r-1){
            int m=(l+r)/2;
            if(eval(m)>eval(m+1))
                l=m;
            else
                r=m;
        }
        res2=eval(r);
    }else{ // k == 2
        int l=-1,r=1e9+1;
        while(l<r-1){
            int m=(l+r)/2;
            if(eval3(m)>eval3(m+1))
                l=m;
            else
                r=m;
        }
        res2=eval3(r);
    }
    
    cout<<res1+res2<<"\n";
}
 
int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("/Users/jakob/cp_testing/test.txt","r",stdin);//freopen("output.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}
 
 
/*

 
1 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
 
24

2 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
 
22


 */

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 24 ms 2772 KB Output is correct
13 Correct 63 ms 2776 KB Output is correct
14 Correct 39 ms 2516 KB Output is correct
15 Correct 38 ms 1496 KB Output is correct
16 Correct 23 ms 2776 KB Output is correct
17 Correct 29 ms 2776 KB Output is correct
18 Correct 29 ms 2776 KB Output is correct
19 Correct 37 ms 2776 KB Output is correct
20 Correct 30 ms 2776 KB Output is correct
21 Correct 34 ms 2792 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -