oj.uz

Submission #978045

# Submission time Handle Problem Language Result Execution time Memory
978045 2024-05-08T17:28:27 Z LOLOLO Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 2 ms 5164 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
 
#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 2e5 + 100;
vector <int> save[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

    vector <pair <int, int>> dot;
    for (int i = 1; i <= n * 2; i++) {
        int x, y;
        cin >> x >> y;
        dot.pb({x, y});
    }

    sort(all(dot));

    ll ans = 0;

    for (int i = 0; i < n * 2; i++) {
        int p = i / 2 + 1;
        save[p].pb(dot[i].s);
        ans += abs(dot[i].f - p);
    }

    for (int i = 1; i <= n; i++) {
        ans += min(abs(save[i][0] - 1) + abs(save[i][1] - 2), abs(save[i][1] - 1) + abs(save[i][0] - 2));
    }

    cout << ans << '\n';

    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5160 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 5164 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Incorrect 1 ms 4960 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5160 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 5164 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Incorrect 1 ms 4960 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5160 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 5164 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Incorrect 1 ms 4960 KB Output isn't correct
7 Halted 0 ms 0 KB -