제출 #945711

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
945711		kxd	Road Construction (JOI21_road_construction)	C++17	5 / 100	2524 ms	2097152 KiB

road_construction

#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif

using namespace std;
const int N = 2e5+5;
const int inf = 1e9;	
const int INF = 1e18;
const int MOD = 1e9+7;

pii a[N];

signed main() {
	INIT
	#ifdef DEBUG
	freopen("input.txt", "r", stdin);
	#endif
	///////////
	int n, k;
	cin >> n >> k;
	forn(i,n) cin >> a[i].ft >> a[i].sd;
	vector<int> v;
	forn(i,n) {
		forn(j,i) {
			v.pb(abs(a[j].ft-a[i].ft)+abs(a[j].sd-a[i].sd));
		}
	}
	sort(all(v));
	forn(i,k) cout << v[i] << endl;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 20
• Subtask 5: 0 / 27
• Subtask 6: 0 / 35