よじろめ覚書

私の理解度重視のソースコードです。

ABC057B - Checkpoints

問題:B - Checkpoints

#include <cstdlib>
#include <iostream>
using namespace std;

#define REP(i, n) for(int i = 0; i < (n); ++i)

int main(void) {
    const int INF = 1e9;
    int n, m, a[50], b[50], c[50], d[50], min_dist, ans;

    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    REP(i, n) {
        cin >> a[i] >> b[i];
    }
    REP(i, m) {
        cin >> c[i] >> d[i];
    }

    REP(i, n) {
        min_dist = INF;
        REP(j, m) {
            if (min_dist > abs(a[i] - c[j]) + abs(b[i] - d[j])) {
                ans = j + 1;
                min_dist = abs(a[i] - c[j]) + abs(b[i] - d[j]);
            }
        }

        cout << ans << "\n";
    }

    return 0;
}