Submission #97527

#	Time	Username	Problem	Language	Result	Execution time	Memory
97527		dalgerok	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	99 ms	7540 KiB

joi2019_ho_t4

#include<bits/stdc++.h>
using namespace std;


const int N = 1e5 + 5;




int n;


int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n;
    cin >> n;
    int a[3][n + 1];
    memset(a, 0, sizeof(a));
    long long ans = 0;
    for(int i = 1; i <= 2 * n; i++){
        int x, y;
        cin >> x >> y;
        if(y < 1){
            ans += 1 - y;
            y = 1;
        }
        else if(y > 2){
            ans += y - 2;
            y = 2;
        }
        if(x < 1){
            ans += 1 - x;
            x = 1;
        }
        else if(x > n){
            ans += x - n;
            x = n;
        }
        a[y][x] += 1;
    }
    vector < int > q[3], s[3];
    for(int i = 1; i <= n; i++){
        q[1].push_back(i);
        q[2].push_back(i);
        for(int j = 1; j <= 2; j++){
            for(int k = 1; k <= a[j][i]; k++){
                s[j].push_back(i);
            }
        }
        for(int j = 1; j <= 2; j++){
            while(!q[j].empty() && !s[j].empty()){
                ans += abs(q[j].back() - s[j].back());
                q[j].pop_back();
                s[j].pop_back();
            }
        }
        for(int j = 1; j <= 2; j++){
            while(!q[j].empty() && !s[3 - j].empty()){
                ans += abs(q[j].back() - s[3 - j].back()) + 1;
                q[j].pop_back();
                s[3 - j].pop_back();
            }
        }
    }
    cout << ans;
}

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