Submission #797010

#TimeUsernameProblemLanguageResultExecution timeMemory
797010vjudge1Road Construction (JOI21_road_construction)C++14
5 / 100
52 ms9188 KiB
#include<bits/stdc++.h> #define ll long long #define fi first #define se second using namespace std ; int main() { ios_base::sync_with_stdio( 0 ) ; cin.tie( 0 ) ; cout.tie( 0 ) ; ll n, k ; cin >> n >> k ; pair<ll, ll> p[n + 1] ; vector<ll> v ; for(ll i = 1 ; i <= n ; i++) cin >> p[i].fi >> p[i].se ; if(n <= 1000) { for(ll i = 1 ; i <= n ; i++) for(ll j = i + 1 ; j <= n ; j++) v.push_back(abs(p[i].fi - p[j].fi) + abs(p[i].se - p[j].se)) ; sort(v.begin(), v.end()) ; for(ll i = 0 ; i < k ; i++) cout << v[i] << '\n' ; return 0 ; } 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...