Submission #386572

#TimeUsernameProblemLanguageResultExecution timeMemory
386572limabeansRoad Construction (JOI21_road_construction)C++17
5 / 100
2041 ms2097156 KiB
#include <bits/stdc++.h> using namespace std; template<typename T> void out(T x) { cout << x << endl; exit(0); } #define watch(x) cout << (#x) << " is " << (x) << endl using ll = long long; const int maxn = 1e6 + 5; ll dist(pair<ll,ll> a, pair<ll,ll> b) { return abs(a.first-b.first)+abs(a.second-b.second); } int n,k; pair<int,int> a[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n>>k; for (int i=0; i<n; i++) { cin>>a[i].first>>a[i].second; } vector<ll> res; for (int i=0; i<n; i++) { for (int j=i+1; j<n; j++) { res.push_back(dist(a[i],a[j])); } } sort(res.begin(),res.end()); for (int i=0; i<k; i++) { cout<<res[i]<<"\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...