Submission #1158382

#	Time	Username	Problem	Language	Result	Execution time	Memory
1158382		mendeke	Road Construction (JOI21_road_construction)	C++20	5 / 100	10118 ms	641836 KiB

road_construction

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(x) x.begin(), x.end()

const int mod = 1e9 + 7;
const int N = 250005;

using namespace std;

ll tt, n, m, k;
pair <ll, ll> a[N];
multiset <ll> ans;

int main (){
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		cin >> a[i].F >> a[i].S;	
	}
	sort (a + 1, a + n + 1);
	for (int i = 1; i <= n; i++){
		for (int j = i + 1; j <= min (n, (ll)5000 + i); j++){
			ans.insert (a[j].F - a[i].F + abs (a[i].S - a[j].S));
		}
	}
	for (auto i: ans){
		cout << i << '\n';
		m--;
		if (m == 0){
			break;
		}
	}
}

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