Amigos

Solution by dudu — 100 pts

Code / Notes

// Source: https://usaco.guide/general/io

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

int main() {
    int N, K;
    cin >> N >> K;

    vector<int> P1, P2;
    for (int i = 0; i < N; i++) {
        int x;
        cin >> x;
        if (x == 1) {
            P1.push_back(i);
        }
    }
    for (int i = 0; i < N; i++) {
        int x;
        cin >> x;
        if (x == 1) {
            P2.push_back(i);
        }
    }

    long long ans = 0;
    for (int i = 0; i < P1.size(); i++) {
        ans += abs(P1[i]-P2[i]);
    }
    cout << ans << endl;
}

Last updated 1 month, 2 weeks ago

« Back to problem