oj.uz

답안 #1054999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054999 2024-08-12T13:46:58 Z Adomas08 Palembang Bridges (APIO15_bridge) C++14
63 / 100
 2000 ms 7968 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());
        }
        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:93:27: warning: 'ag' may be used uninitialized in this function [-Wmaybe-uninitialized]
   93 |         if (af != f || ag != g){
      |                        ~~~^~~~
bridge.cpp:93:16: warning: 'af' may be used uninitialized in this function [-Wmaybe-uninitialized]
   93 |         if (af != f || ag != g){
      |             ~~~^~~~

Subtask #1
8.0 / 8.0

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

# 결과 실행 시간 메모리 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 0 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 376 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 0 ms 508 KB Output is correct
12 Correct 22 ms 5832 KB Output is correct
13 Correct 30 ms 6936 KB Output is correct
14 Correct 21 ms 5828 KB Output is correct
15 Correct 16 ms 4208 KB Output is correct
16 Correct 18 ms 6384 KB Output is correct
17 Correct 22 ms 7268 KB Output is correct
18 Correct 33 ms 6592 KB Output is correct
19 Correct 26 ms 7100 KB Output is correct
20 Correct 22 ms 6620 KB Output is correct
21 Correct 28 ms 6700 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 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 344 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 17 ms 348 KB Output is correct
14 Correct 57 ms 348 KB Output is correct
15 Correct 76 ms 556 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 16 ms 348 KB Output is correct
18 Correct 9 ms 348 KB Output is correct
19 Correct 23 ms 584 KB Output is correct
20 Correct 25 ms 348 KB Output is correct
21 Correct 52 ms 344 KB Output is correct
22 Correct 40 ms 348 KB Output is correct
23 Correct 15 ms 344 KB Output is correct
24 Correct 24 ms 344 KB Output is correct

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 360 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 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 344 KB Output is correct
13 Correct 16 ms 560 KB Output is correct
14 Correct 56 ms 348 KB Output is correct
15 Correct 69 ms 348 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 9 ms 344 KB Output is correct
19 Correct 18 ms 576 KB Output is correct
20 Correct 41 ms 580 KB Output is correct
21 Correct 49 ms 344 KB Output is correct
22 Correct 24 ms 344 KB Output is correct
23 Correct 25 ms 344 KB Output is correct
24 Correct 26 ms 576 KB Output is correct
25 Execution timed out 2031 ms 7968 KB Time limit exceeded
26 Halted 0 ms 0 KB -