oj.uz

Submission #926001

# Submission time Handle Problem Language Result Execution time Memory
926001 2024-02-12T12:40:53 Z treap_enjoyer Palembang Bridges (APIO15_bridge) C++14
22 / 100
 115 ms 2392 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast,unroll-loops")

#define ll long long
#define all(x) x.begin(), x.end()
#define ld long double
#define pii pair<int, int>

using namespace std;
using namespace __gnu_pbds;

template<class T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int INF = 1e9 + 7;
const int MAXN = 1e5 + 5;
struct st{
    bool a;
    bool b;
    int x;
    int y;
};
int n;
vector<st> a;
long long calc(int pos){
    ll d = 0;
    for(int i = 1; i <= n; i++){
        if(a[i].a != a[i].b){
            if(pos < a[i].x) d += (a[i].x - pos) * 2;
            if(pos > a[i].y) d += (pos - a[i].y) * 2;
            d += a[i].y - a[i].x + 1;
        }
        else d += a[i].y - a[i].x;
    }
    return d;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // ifstream cin("input.txt");
    // ofstream cout("output.txt");
    int k;
    cin >> k >> n;
    a.resize(n + 1);
    {
    char a1, b1;
    for(int i = 1; i <= n; i++){
        cin >> a1 >> a[i].x >> b1 >> a[i].y;
        a[i].a = a1 - 'A';
        a[i].b = b1 - 'A';
        if(a[i].x > a[i].y) swap(a[i].x, a[i].y);
    }
    }
    int l = 0, r = 1e9;
    ll ans = 1e18;
    while(l <= r){
        int m1 = l + (r - l) / 3;
        int m2 = r - (r - l) / 3;
        ans = min(ans, calc(m1));
        ans = min(ans, calc(m2));
        if(calc(m1) < calc(m2)){
            r = m2 - 1;
        }
        else{
            l = m1 + 1;
        }
    }
    for(int i = l; i <= r; i++){
        ans = min(ans, calc(i));
    }
    cout << ans << endl;
}

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 468 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 344 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 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 452 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 37 ms 1716 KB Output is correct
13 Correct 115 ms 2392 KB Output is correct
14 Correct 69 ms 1624 KB Output is correct
15 Correct 66 ms 1364 KB Output is correct
16 Correct 39 ms 2132 KB Output is correct
17 Correct 40 ms 1820 KB Output is correct
18 Correct 38 ms 1880 KB Output is correct
19 Correct 107 ms 2140 KB Output is correct
20 Correct 90 ms 1880 KB Output is correct
21 Correct 101 ms 1884 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 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 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 460 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 -

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