oj.uz

Submission #978417

# Submission time Handle Problem Language Result Execution time Memory
978417 2024-05-09T08:06:53 Z nnin Palembang Bridges (APIO15_bridge) C++17
22 / 100
 34 ms 4904 KB 
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
using ll = long long;
#define f first
#define s second
 
vector<pii> cross;
int N, K;
 
ll check1(int bridge) {
    ll ret = 0;
    for(auto [st, en]:cross) {
        if(bridge<st) ret += (ll)st-bridge+en-bridge;
        else if(bridge>en) ret += (ll)bridge-st+bridge-en;
        else ret += (ll)en-st;
    }
    return ret;
}
 
ll check2(int br1, int br2) {
    ll ret = 0;
    for(auto [st, en]:cross) {
        if((st<=br1&&br1<=en) || (st<=br2&&br2<=en)) ret += (ll)en-st;
        else if(br2<st) ret += (ll)st-br2+en-br2;
        else if(br1>en) ret += (ll)br1-st+br1-en;
        else ret += min((ll)st-br1+en-br1, (ll)br2-st+br2-en);
    }
    return ret;
}
 
ll one() {
    vector<int> v;
    for(auto [st, en]:cross) {
        v.push_back(st);
        v.push_back(en);
    }
    sort(v.begin(), v.end());
    return min(check1(v[((int)v.size()-1)/2]), check1(v[(int)v.size()/2]));
}
 
ll two() {
    vector<int> v;
    for(auto [st, en]:cross) {
        v.push_back(st);
        v.push_back(en);
    }
    sort(v.begin(), v.end());
    int med1 = ((int)v.size()-1)/2;
    int med2 = (int)v.size()/2;
    set<int> l, r;
    l.insert(v[med1/2]);
    l.insert(v[(med1+1)/2]);
    l.insert(v[med2/2]);
    l.insert(v[(med2+1)/2]);
    r.insert(v[(med1+v.size()-1)/2]);
    r.insert(v[(med1+v.size())/2]);
    r.insert(v[(med2+v.size()-1)/2]);
    r.insert(v[(med2+v.size())/2]);
    ll ret = 1e18;
    for(int med1:l) for(int med2:r) {
        ret = min(ret, check2(med1, med2));
    }
    return ret;
}
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin>>K>>N;
    ll ans = 0;
    for(int i=0;i<N;i++) {
        char z1, z2;
        int b1, b2;
        cin>>z1>>b1>>z2>>b2;
        if(z1==z2) {
            ans += abs(b1-b2);
        } else {
            cross.push_back({min(b1, b2), max(b1, b2)});
        }
    }
    if(cross.empty()) {
        cout<<ans;
        return 0;
    }
    ans += cross.size();
    if(K==1) cout<<ans+one();
    else cout<<ans+two();
}

Subtask #1
8.0 / 8.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 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 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

Subtask #2
14.0 / 14.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 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 488 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 512 KB Output is correct
12 Correct 19 ms 3484 KB Output is correct
13 Correct 34 ms 4812 KB Output is correct
14 Correct 24 ms 3800 KB Output is correct
15 Correct 22 ms 2776 KB Output is correct
16 Correct 18 ms 4312 KB Output is correct
17 Correct 22 ms 4824 KB Output is correct
18 Correct 25 ms 4568 KB Output is correct
19 Correct 32 ms 4904 KB Output is correct
20 Correct 29 ms 4544 KB Output is correct
21 Correct 29 ms 4584 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 544 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -