Submission #1157665

#	Time	Username	Problem	Language	Result	Execution time	Memory
1157665		KluydQ	Road Construction (JOI21_road_construction)	C++20	5 / 100	2466 ms	2106872 KiB

road_construction

#include <bits/stdc++.h>

#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
#define int long long
#define ll long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define mkp make_pair
 
using namespace std;
 
const int N = 2e5 + 123;
const int inf = 1e18;
const int mod = 1e9 + 7;
const double eps = 1e-13;
 
int a[N], b[N], n, m, k, z, x[N], y[N];
vector <pii> g[N];

mt19937 rng( chrono::steady_clock::now().time_since_epoch().count());
 
int rand( int l, int r )
{
    uniform_int_distribution <int> uid( l, r );
    return uid( rng );
}
void solve()
{
	cin >> n >> k;
	vector <int> v;
	
	FOR( i, 1, n, 1 )
	{
		cin >> x[i] >> y[i];
		FOR( j, 1, i - 1, 1 ) v.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
	}
	sort( all(v) );
	FOR( i, 0, k - 1, 1 ) cout << v[i] << '\n';
}
signed main()
{
//	freopen("connect.in", "r", stdin);
//	freopen("connect.out", "w", stdout);
	    
    respagold
    
    int test = 1;
    
    if( !test ) cin >> test;
	
	while( test -- )
	{
		solve();
	}
}
// solved by KluydQ

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