Submission #1157815

#	Time	Username	Problem	Language	Result	Execution time	Memory
1157815		arkanefury	Road Construction (JOI21_road_construction)	C++20	0 / 100	10109 ms	712076 KiB

road_construction

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define in insert
#define lb lower_bound
#define F first
#define S second
#define sz size()
#define int long long
#define all(v) v.begin(),v.end()
#define FOR1(x, n) for(int j = x; j <= n; j ++)
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0);
const int N =  2e5+5;
int n,m,k,sum=0,x,y, ans, r, cnt, l, mod = 1e9+7, dp[N], a[N], b[N];
string s, str;
map<pair<int, int>, int>mp;
void solve(){
    srand(time(0));
    cin >> n >> m;
    FOR(i, 1, n, 1)cin >> a[i] >> b[i];
    int start = 1;
     int end = n;
    multiset<int>st;
    FOR(i, 1, n, 1){
        for(int j = 1; j <= 100; j ++){
        int x = rand() % (end - start + 1) + start;
        if(x != i && !mp[{x,i}])st.in(abs(a[x] - a[i] + (b[x] - b[i]))), mp[{x,i}]=mp[{i,x}]=1;
    }
    }
    for(auto i : st){
        cout <<  i << '\n';
        m--;
        if(!m)break;
    }
}
signed main(){
    nikita
    int tt = 1;
    if(!tt)cin >> tt;
    FOR(i, 1, tt, 1)solve();
}

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