Submission #1149562

#TimeUsernameProblemLanguageResultExecution timeMemory
1149562Perl32Road Construction (JOI21_road_construction)C++20
0 / 100
2730 ms2103860 KiB
//I wrote this code 4 u <3 #include <bits/stdc++.h> using namespace std; using ll = long long; #ifdef LOCAL #include "algo/debug.h" #else #define debug(...) 42 #endif signed main(int32_t argc, char *argv[]) { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; vector<pair<int, int>> a(n); for (auto& [x, y] : a) cin >> x >> y; vector<int> srt; auto dst = [&](int i, int j) { return abs(a[i].first - a[j].first) + abs(a[i].second - a[j].second); }; for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { srt.push_back(dst(i, j)); } } ranges::sort(srt); for (int i = 0; i < k; ++i) cout << srt[i] << '\n'; } /* */
#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...