oj.uz

답안 #1054586

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054586 2024-08-12T10:51:07 Z Adomas08 Palembang Bridges (APIO15_bridge) C++14
63 / 100
 2000 ms 8344 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;
    priority_queue <int> q;
    int k, n;
    ios_base::sync_with_stdio(false);
    cin >> k >> n;
    long long 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]);
        }
    }
    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;
        for (int N = 1; N <= n; N++){
        vector <int> h = z;
        sort(v.begin(), v.end(), sorting);
        long long curans = 0;
        vector <pair<int, int>> start(v.begin(), v.begin() + N);
        vector <pair<int, int>> ends(v.begin() + N, v.end());
        int f = findmedian(start);
        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;
            }
        }
        int g = findmedian(ends);
        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]){
            curans += a[i*2+1] - a[i*2];
        }
        else{
            if (h[i*2] == -1){
                curans += a[i*2+1] - a[i*2] + 1;
            }
            else{
                long long c = LLONG_MAX;
                if (f < a[i*2])  c = min(1 + a[i*2+1] - a[i*2] + 2 * (a[i*2] - f), c);
                if (f > a[i*2+1]) c = min(1 + a[i*2+1] - a[i*2] + 2 * (f - a[i*2+1]), c);
                if (g < a[i*2]) c = min(1 + a[i*2+1] - a[i*2] + 2 * (a[i*2] - g), c);
                if (g > a[i*2+1]) c = min(1 + a[i*2+1] - a[i*2] + 2 * (g - a[i*2+1]), c);
                if (c == LLONG_MAX){
                }
                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++){
      |                     ~~^~~~~~~~~~

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 0 ms 348 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

# 결과 실행 시간 메모리 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 476 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 17 ms 5932 KB Output is correct
13 Correct 28 ms 5952 KB Output is correct
14 Correct 21 ms 5576 KB Output is correct
15 Correct 16 ms 3536 KB Output is correct
16 Correct 16 ms 5996 KB Output is correct
17 Correct 19 ms 5956 KB Output is correct
18 Correct 22 ms 6120 KB Output is correct
19 Correct 25 ms 6108 KB Output is correct
20 Correct 18 ms 6088 KB Output is correct
21 Correct 28 ms 6040 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 468 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 39 ms 576 KB Output is correct
14 Correct 82 ms 348 KB Output is correct
15 Correct 91 ms 344 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 23 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 39 ms 572 KB Output is correct
20 Correct 45 ms 344 KB Output is correct
21 Correct 71 ms 568 KB Output is correct
22 Correct 50 ms 348 KB Output is correct
23 Correct 39 ms 344 KB Output is correct
24 Correct 52 ms 568 KB Output is correct

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 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 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 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 2 ms 344 KB Output is correct
13 Correct 39 ms 604 KB Output is correct
14 Correct 80 ms 568 KB Output is correct
15 Correct 91 ms 348 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 23 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 39 ms 572 KB Output is correct
20 Correct 56 ms 568 KB Output is correct
21 Correct 71 ms 568 KB Output is correct
22 Correct 50 ms 344 KB Output is correct
23 Correct 39 ms 344 KB Output is correct
24 Correct 46 ms 348 KB Output is correct
25 Execution timed out 2090 ms 8344 KB Time limit exceeded
26 Halted 0 ms 0 KB -