# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
793525 | 2023-07-25T23:34:27 Z | fuad27 | Road Construction (JOI21_road_construction) | C++17 | 10000 ms | 16964 KB |
#include<bits/stdc++.h> // #pragma GCC optimize("O3,unroll-loops") // #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") using namespace std; void solve() { int n, k; cin >> n >> k; int x[n], y[n]; multiset<unsigned int> s; for(int i = 0;i<n;i++) { cin >> x[i] >> y[i]; } for(int i = 0;i<n;i++) for(int j = i+1;j<n;j++){ s.insert((unsigned int)abs(x[i]-x[j])+abs(y[i]-y[j])); while(s.size()>k) { s.erase(--s.end()); } } for(auto it=s.begin();it!=s.end();it++)cout << *it << "\n"; } int main () { cin.tie(0)->sync_with_stdio(0); int t=1; while(t--)solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 168 ms | 14556 KB | Output is correct |
2 | Correct | 165 ms | 14600 KB | Output is correct |
3 | Correct | 96 ms | 14668 KB | Output is correct |
4 | Correct | 99 ms | 14632 KB | Output is correct |
5 | Correct | 172 ms | 13500 KB | Output is correct |
6 | Correct | 21 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 10055 ms | 16964 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 10040 ms | 7244 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 10040 ms | 7244 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 168 ms | 14556 KB | Output is correct |
2 | Correct | 165 ms | 14600 KB | Output is correct |
3 | Correct | 96 ms | 14668 KB | Output is correct |
4 | Correct | 99 ms | 14632 KB | Output is correct |
5 | Correct | 172 ms | 13500 KB | Output is correct |
6 | Correct | 21 ms | 340 KB | Output is correct |
7 | Execution timed out | 10080 ms | 14848 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 168 ms | 14556 KB | Output is correct |
2 | Correct | 165 ms | 14600 KB | Output is correct |
3 | Correct | 96 ms | 14668 KB | Output is correct |
4 | Correct | 99 ms | 14632 KB | Output is correct |
5 | Correct | 172 ms | 13500 KB | Output is correct |
6 | Correct | 21 ms | 340 KB | Output is correct |
7 | Execution timed out | 10055 ms | 16964 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |