oj.uz

답안 #985858

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
985858 2024-05-19T07:41:44 Z vyshniak_n Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 1 ms 456 KB 
//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 1e5 + 10;
const ll mod = 1e9 + 7;
const ll K = 200;
const ll LOG = 8;

void solve() {
    ll n;
    cin >> n;

    vector <ll> x(2 * n), y(2 * n);
    ll ans = 0;
    for (ll i = 0; i < 2 * n; i++) {
        cin >> x[i] >> y[i];

        if (x[i] > n) ans += x[i] - n, x[i] = n;
        if (x[i] < 1) ans += 1 - x[i], x[i] = 1;
        if (y[i] < 1) ans += 1 - y[i], y[i] = 1;
        if (y[i] > 2) ans += y[i] - 2, y[i] = 2;
    }

    sort(all(x));

    for (ll i = 1; i <= n; i++) {
        ans += abs(x[(i - 1) * 2] - i);
        ans += abs(x[(i - 1) * 2 + 1] - i);
    }

    ll cnt[3] = {0, 0, 0};
    for (ll i = 0; i < 2 * n; i++)
        cnt[y[i]]++;
    ans += max(n - cnt[1], n - cnt[2]);
    cout << ans << el;
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*
*/

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 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 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 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 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 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 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -