oj.uz

Submission #883550

# Submission time Handle Problem Language Result Execution time Memory
883550 2023-12-05T11:59:17 Z SalihSahin Palembang Bridges (APIO15_bridge) C++14
22 / 100
 49 ms 4316 KB 
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair 
using namespace std;

typedef long long ll;

const int inf = 1e9 * 2;
const int mod = 1e9 + 7;
const int N = 3e4 + 5;


ll dis(pair<ll, ll> i, ll p){
    if(i.first <= p && i.second >= p) return 0;
    else if(i.first > p) return i.first - p;
    else return p - i.second;
}

vector<pair<int, int> > a;

ll check(int m){
    ll val = 0;
    for(auto itr: a){
        val += dis(itr, m) * 2;
    }

    return val;
}

int32_t main(){
    ios_base::sync_with_stdio(false), cin.tie();
    int k, n;
    cin>>k>>n;
    ll ans = 0;
    char h, o;
    int hx, ox;

    for(int i = 0; i < n; i++){
        cin>>h>>hx>>o>>ox;
        if(h != o){
            if(hx > ox) swap(hx, ox);
            a.pb(mp(hx, ox));
        }
        ans += abs(hx - ox);
    }
    ans += a.size();

    if(!a.size()){
        cout<<ans<<endl;
    }
    else if(k == 1){
        int l = 0, r = mod;
        while(l < r){
            int m = (l + r)/2;

            ll x = check(m), y = check(m+1);

            if(x <= y) r = m;
            else l = m + 1;
        }

        ans += check(l);
        cout<<ans<<endl;
    }
    else{
        cout<<0<<endl;
    }
    return 0;
}

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 0 ms 348 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 480 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 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 344 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 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 18 ms 3288 KB Output is correct
13 Correct 47 ms 4312 KB Output is correct
14 Correct 28 ms 3544 KB Output is correct
15 Correct 28 ms 2776 KB Output is correct
16 Correct 20 ms 3800 KB Output is correct
17 Correct 25 ms 4308 KB Output is correct
18 Correct 22 ms 4012 KB Output is correct
19 Correct 46 ms 4316 KB Output is correct
20 Correct 41 ms 4044 KB Output is correct
21 Correct 49 ms 4224 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.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 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -