oj.uz

답안 #932466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932466 2024-02-23T12:48:47 Z VMaksimoski008 Palembang Bridges (APIO15_bridge) C++14
31 / 100
 2000 ms 2184 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int k, n;
    cin >> k >> n;

    ll ans = 0, ans2 = 0;
    vector<int> v;
    vector<pii> p;

    for(int i=0; i<n; i++) {
        char a, b;
        int c, d;
        cin >> a >> c >> b >> d;

        if(a == b) {
            ans += abs(c - d);
            ans2 += abs(c - d);
        } else {
            v.push_back(c);
            v.push_back(d);
            p.push_back({ c, d });
        }
    }

    if(v.size() == 0) {
        cout << ans << '\n';
        return 0;
    }

    sort(all(v));

    if(k == 1) {
        ll med = (v[v.size()/2] + v[v.size()/2-1]) / 2;

        for(int &x : v) ans += abs(med - x);

        cout << ans + v.size() / 2 << '\n';
        return 0;
    } 

    ans = 1e18;
    for(int i=0; i<v.size(); i++) {
        for(int j=i+1; j<v.size(); j++) {
            ll res = 0;
            for(pii &x : p)
                res += min(abs(x.first - v[i]) + abs(x.second - v[i]), abs(x.first - v[j]) + abs(x.second - v[j]));
            ans = min(ans, res);
        }
    }

    cout << ans + ans2 + v.size() / 2 << '\n';
    return 0;
}

Compilation message

bridge.cpp: In function 'int32_t main()':
bridge.cpp:61:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for(int i=0; i<v.size(); i++) {
      |                  ~^~~~~~~~~
bridge.cpp:62:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         for(int j=i+1; j<v.size(); j++) {
      |                        ~^~~~~~~~~

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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 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 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 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 2 ms 448 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 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 36 ms 1992 KB Output is correct
13 Correct 80 ms 1984 KB Output is correct
14 Correct 51 ms 2092 KB Output is correct
15 Correct 47 ms 1572 KB Output is correct
16 Correct 55 ms 2000 KB Output is correct
17 Correct 71 ms 1992 KB Output is correct
18 Correct 67 ms 1988 KB Output is correct
19 Correct 79 ms 2184 KB Output is correct
20 Correct 74 ms 1992 KB Output is correct
21 Correct 79 ms 2000 KB Output is correct

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

Subtask #4
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 4 ms 348 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Execution timed out 2093 ms 440 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 4 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 5 ms 344 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Execution timed out 2091 ms 348 KB Time limit exceeded
14 Halted 0 ms 0 KB -