Submission #1193735

#	Time	Username	Problem	Language	Result	Execution time	Memory
1193735		omarrrr	City Mapping (NOI18_citymapping)	C++20	9 / 100	94 ms	20116 KiB

citymapping

#include "citymapping.h"
#include<bits/stdc++.h>

#define ll long long
#define F first
#define Ss second
#define pb push_back

using namespace std;
ll m[1001][1001],linkk[1005];
bool vis[1001];





void find_roads(int n, int Q, int A[], int B[], int W[]) {
    vector<pair<ll,pair<ll,ll>>>v;

    ll link[n+65];
    for(ll i=1;i<=n;i++){
        for(ll j=i+1;j<=n;j++){
            ll d=get_distance(i,j);
            v.pb({d,{i,j}});
            m[i][j]=m[j][i]=d;
        }
        link[i]=0;
    }
    sort(v.begin(),v.end());
    ll cnt=0,i=0;
    while(cnt<n-1){
        if(link[v[i].Ss.F]<3 && link[v[i].Ss.Ss]<3){
            link[v[i].Ss.F]++;
            link[v[i].Ss.Ss]++;
            A[cnt]=v[i].Ss.F;
            B[cnt]=v[i].Ss.Ss;
            W[cnt]=v[i].F;
            cnt++;
        }
        i++;
    }
   // cout<<cnt<<"\n";


    return;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 43