# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
682500 | vjudge1 | Road Construction (JOI21_road_construction) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define all(a) sort(a.begin(), a.end())
#define allr(a) reverse(a.begin(), a.end())
#define rall(a) sort(a.rbegin(), a.rend())
#define ll long long
#define pb push_back
#define pob pop_back
#define ff first
#define ss second
#define mk make_pair
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll x[n + 2], y[n + 2];
vector<ll> ans;
for(ll i = 0; i < n; i++){
cin >> x[i] >> y[i];
}
for(ll i = 0; i < n; i++){
for(ll j = 0; j < n; j++){
v.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
}
}
for(ll i = 0; i < k; i++){
cout << v[i] << '\n';
}
}