oj.uz

Submission #1054824

# Submission time Handle Problem Language Result Execution time Memory
1054824 2024-08-12T12:26:26 Z Adomas08 Palembang Bridges (APIO15_bridge) C++14
63 / 100
 2000 ms 8160 KB 
    #include <bits/stdc++.h>

    using namespace std;
    int k, n;
    bool sorting(pair <int, int> a, pair <int, int> b){
    return a.first + a.second < b.first + b.second;
    }
    int findmedian(vector<pair<int, int>> j){
    vector <int> d;
    for (int i = 0; i < j.size(); i++){
        d.push_back(j[i].first);
        d.push_back(j[i].second);
    }
    d.erase(remove(d.begin(), d.end(), -1), d.end());
    sort (d.begin(), d.end());
    if (d.size() == 0) return 0;
    return (d[d.size() / 2] + d[d.size() / 2 - 1]) / 2;
    }
    int main(){
    long long ans = 0, dans = 0;
    priority_queue <int> q;
    int k, n;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> k >> n;
    int a[n*2];
    vector <int> z;
    vector <pair<int,int>> v;
    char b[n], d[n];
    for (int i = 0; i < n; i++){
        cin >> b[i] >> a[i*2] >> d[i] >> a[i*2+1];
        if (b[i] == d[i]){
            v.push_back({-1, -1});
            z.push_back(-1);
            z.push_back(-1);
        }
        else {
            v.push_back({a[i*2], a[i*2+1]});
            z.push_back(a[i*2]);
            z.push_back(a[i*2+1]);
        }
        if (a[i*2] > a[i*2+1]){
            swap(a[i*2], a[i*2+1]);
        }
        dans += a[i*2+1] - a[i*2];
    }
    int f;
    if (k == 1){
    while (k--){
        f = findmedian(v);
        for (int i = 0; i < n; i++){
            if (f >= a[i*2] && f <= a[i*2+1]){
                v[i].first = -1;
                v[i].second = -1;
            }
        }
    }
    for (int i = 0; i < n; i++){
        if (b[i] == d[i]){
            ans += a[i*2+1] - a[i*2];
        }
        else{
            if (v[i].first == -1){
                ans += a[i*2+1] - a[i*2] + 1;
            }
            else{
                if (f < a[i*2]) ans += 1 + a[i*2+1] - a[i*2] + 2 * (a[i*2] - f);
                if (f > a[i*2+1]) ans += 1 + a[i*2+1] - a[i*2] + 2 * (f - a[i*2+1]);
            }
        }
    }
    }
    else{
        ans = LLONG_MAX;
        long long xans;
        int f = -1, g = -1, af, ag, c;
        sort(v.begin(), v.end(), sorting);
        vector <pair<int, int>>start(v.begin(), v.begin() + 1);
        vector <pair<int, int>>ends(v.begin() + 1, v.end());
        for (int N = 1; N <= n; N++){
        if (f != -1){
            af = f;
            ag = g;
        }
        vector <int> h = z;
        long long curans = dans;
        if (N != 1){
            start.push_back(v[N-1]);
            ends.erase(ends.begin());
            if (v[N-1].first >= f && v[N-1].second >= f) f = findmedian(start);
            else if (v[N-1].first <= f && v[N-1].second <= f) f = findmedian(start);
            if (v[N-1].first >= g && v[N-1].second >= g) g = findmedian(ends);
            else if (v[N-1].first <= g && v[N-1].second <= g) g = findmedian(ends);
        }
        else{
        f = findmedian(start);
        g = findmedian(ends);
        }
        if (af != f || ag != g){
        for (int i = 0; i < n; i++){
            if (f >= a[i*2] && f <= a[i*2+1]){
                h[i*2] = -1;
                h[i*2+1] = -1;
            }
        }
        for (int i = 0; i < n; i++){
            if (g >= a[i*2] && g <= a[i*2+1]){
                h[i*2] = -1;
                h[i*2+1] = -1;
            }
        }
        for (int i = 0; i < n; i++){
        if (b[i] != d[i]){
            if (h[i*2] == -1){
                curans +=  1;
            }
            else{
                if (f < a[i*2])  c = 1 + 2 * (a[i*2] - f);
                else c = 1 + 2 * (f - a[i*2+1]);
                if (g < a[i*2]) c = min(1 + 2 * (a[i*2] - g), c);
                else c = min(1 + 2 * (g - a[i*2+1]), c);
                curans += c;
            }
        }
    }

    ans = min(curans, ans);
        }
        }
    }
    cout << ans;
    }

Compilation message

bridge.cpp: In function 'int findmedian(std::vector<std::pair<int, int> >)':
bridge.cpp:10:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i = 0; i < j.size(); i++){
      |                     ~~^~~~~~~~~~
bridge.cpp: In function 'int main()':
bridge.cpp:75:19: warning: unused variable 'xans' [-Wunused-variable]
   75 |         long long xans;
      |                   ^~~~
bridge.cpp:99:27: warning: 'ag' may be used uninitialized in this function [-Wmaybe-uninitialized]
   99 |         if (af != f || ag != g){
      |                        ~~~^~~~
bridge.cpp:99:16: warning: 'af' may be used uninitialized in this function [-Wmaybe-uninitialized]
   99 |         if (af != f || ag != g){
      |             ~~~^~~~

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 0 ms 348 KB Output is correct
5 Correct 0 ms 380 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 13 ms 5240 KB Output is correct
13 Correct 26 ms 5164 KB Output is correct
14 Correct 20 ms 4808 KB Output is correct
15 Correct 15 ms 3024 KB Output is correct
16 Correct 16 ms 5320 KB Output is correct
17 Correct 20 ms 5316 KB Output is correct
18 Correct 23 ms 5312 KB Output is correct
19 Correct 29 ms 5316 KB Output is correct
20 Correct 20 ms 5320 KB Output is correct
21 Correct 23 ms 5320 KB Output is correct

Subtask #3
9.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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #4
32.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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 16 ms 348 KB Output is correct
14 Correct 38 ms 540 KB Output is correct
15 Correct 50 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 12 ms 348 KB Output is correct
18 Correct 6 ms 524 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 21 ms 348 KB Output is correct
21 Correct 1 ms 540 KB Output is correct
22 Correct 22 ms 588 KB Output is correct
23 Correct 14 ms 352 KB Output is correct
24 Correct 24 ms 344 KB Output is correct

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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 16 ms 568 KB Output is correct
14 Correct 38 ms 560 KB Output is correct
15 Correct 50 ms 348 KB Output is correct
16 Correct 2 ms 520 KB Output is correct
17 Correct 13 ms 516 KB Output is correct
18 Correct 7 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 22 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 22 ms 580 KB Output is correct
23 Correct 14 ms 576 KB Output is correct
24 Correct 22 ms 580 KB Output is correct
25 Execution timed out 2021 ms 8160 KB Time limit exceeded
26 Halted 0 ms 0 KB -