| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 586456 | krit3379 | City Mapping (NOI18_citymapping) | C++17 | 44 ms | 8280 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "citymapping.h"
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 1005
long long dis[N][N],dis1[N],ma,id,last,last_node;
vector<pair<long long,long long>> v;
void find_roads(int n,int q,int a[], int b[],int w[]){
int i,j;
if(q==500000){
for(i=1;i<=n;i++)for(j=i+1;j<=n;j++)dis[i][j]=dis[j][i]=get_distance(i,j);
}
else if(q==12000){
for(i=2;i<=n;i++)dis1[i]=get_distance(1,i);
for(i=1;i<=n;i++)if(dis1[i]>ma)ma=dis1[i],id=i;
for(i=1;i<=n;i++)if(i!=id)v.push_back({get_distance(id,i),i});
sort(v.begin(),v.end());
last=0;
last_node=id;
for(i=0;i<v.size();i++){
a[i]=last_node;
b[i]=v[i].second;
w[i]=v[i].first-last;
last=v[i].first;
last_node=v[i].second;
}
}
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
