oj.uz

답안 #950332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950332 2024-03-20T08:24:31 Z JakobZorz Palembang Bridges (APIO15_bridge) C++17
22 / 100
 64 ms 4824 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;
}

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+=k;
            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
        
    }
    
    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


 */

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 348 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 496 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 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 23 ms 3532 KB Output is correct
13 Correct 64 ms 4824 KB Output is correct
14 Correct 40 ms 3800 KB Output is correct
15 Correct 37 ms 2780 KB Output is correct
16 Correct 24 ms 4168 KB Output is correct
17 Correct 30 ms 4816 KB Output is correct
18 Correct 30 ms 4444 KB Output is correct
19 Correct 37 ms 4816 KB Output is correct
20 Correct 29 ms 4556 KB Output is correct
21 Correct 37 ms 4568 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -