Submission #895973

#	Time	Username	Problem	Language	Result	Execution time	Memory
895973		hmm789	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	35 ms	6484 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
#define MOD 998244353

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, x, y, ans = 0;
    cin >> n;
    int a[n][2];
    memset(a, 0, sizeof(a));
    for(int i = 0; i < 2*n; i++) {
        cin >> x >> y;
        if(x < 1) {
            ans += 1-x;
            x = 1;
        } else if(x > n) {
            ans += x-n;
            x = n;
        }
        if(y < 1) {
            ans += 1-y;
            y = 1;
        } else if(y > 2) {
            ans += y-2;
            y = 2;
        }
        x--; y--;
        a[x][y]++;
    }
    int a1 = 0, a2 = 0;
    for(int i = 0; i < n; i++) {
        a1 += a[i][0]-1;
        a2 += a[i][1]-1;
        if(a1 < 0 && a2 > 0) {
            int tmp = min(-a1, a2);
            a1 += tmp; a2 -= tmp; ans += tmp;
        } else if(a2 < 0 && a1 > 0) {
            int tmp = min(-a2, a1);
            a2 += tmp; a1 -= tmp; ans += tmp;
        }
        ans += abs(a1) + abs(a2);
    }
    cout << ans;
}

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