제출 #256863

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
256863		Osama_Alkhodairy	Coin Collecting (JOI19_ho_t4)	C++17	0 / 100	1 ms	384 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 100001;

int n, a[2][N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    ll ans = 0;
    for(int i = 0 ; i < 2 * n ; i++){
        int x, y;
        cin >> x >> y;
        int nx = min(n, max(1, x));
        int ny = min(2, max(1, y));
        ans += abs(nx - x) + abs(ny - y);
        a[ny - 1][nx - 1]++;
    }
    int sum = 0;
    for(int j = 0 ; j < n - 1 ; j++){
        sum += a[0][j] + a[1][j];
        int sz = (j + 1) * 2;
        ans += abs(sum - sz);
    }
    sum = 0;
    for(int j = 0 ; j < n ; j++){
        sum += a[0][j];
    }
    ans += abs(sum - n);
    cout << ans << endl;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63