oj.uz

답안 #1055056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055056 2024-08-12T14:15:24 Z Adomas08 Palembang Bridges (APIO15_bridge) C++14
41 / 100
 2000 ms 7376 KB 
        #include <bits/stdc++.h>

        using namespace std;
        int k, n;
        long long curans;
        vector <int> h;
        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;
        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 {
                dans++;
                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--){
            ans = dans;
            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 (z[i] != -1){
                    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, g, 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++){
            h = z;
            curans = dans;
            if (N != 1){
                start.push_back(v[N-1]);
                ends.erase(ends.begin());
            }
            f = findmedian(start);
            g = findmedian(ends);
            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 (h[i*2] != -1){
                    if (f < a[i*2])  c = 2 * (a[i*2] - f);
                    else c = 2 * (f - a[i*2+1]);
                    if (g < a[i*2]) c = min(2 * (a[i*2] - g), c);
                    else c = min(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:12:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for (int i = 0; i < j.size(); i++){
      |                         ~~^~~~~~~~~~
bridge.cpp: In function 'int main()':
bridge.cpp:70:23: warning: unused variable 'xans' [-Wunused-variable]
   70 |             long long xans;
      |                       ^~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 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 -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.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 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 1 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 1 ms 348 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 344 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 18 ms 348 KB Output is correct
14 Correct 57 ms 344 KB Output is correct
15 Correct 67 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 18 ms 536 KB Output is correct
18 Correct 11 ms 604 KB Output is correct
19 Correct 20 ms 516 KB Output is correct
20 Correct 21 ms 344 KB Output is correct
21 Correct 49 ms 556 KB Output is correct
22 Correct 22 ms 348 KB Output is correct
23 Correct 18 ms 564 KB Output is correct
24 Correct 22 ms 344 KB Output is correct

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 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 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 20 ms 344 KB Output is correct
14 Correct 59 ms 344 KB Output is correct
15 Correct 65 ms 540 KB Output is correct
16 Correct 2 ms 524 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 9 ms 520 KB Output is correct
19 Correct 20 ms 348 KB Output is correct
20 Correct 21 ms 348 KB Output is correct
21 Correct 52 ms 556 KB Output is correct
22 Correct 36 ms 556 KB Output is correct
23 Correct 17 ms 348 KB Output is correct
24 Correct 22 ms 556 KB Output is correct
25 Execution timed out 2096 ms 7376 KB Time limit exceeded
26 Halted 0 ms 0 KB -