# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
992351 | 2024-06-04T09:56:09 Z | Brinyon | Road Construction (JOI21_road_construction) | C++14 | 10000 ms | 2097152 KB |
#include<bits/stdc++.h> #define MAXN 250001 using namespace std; struct point{ long long x,y; }; long long dist(point a,point b){ return abs(a.x-b.x)+abs(a.y-b.y); } long long n,k; point a[MAXN]; bool cmp(point a,point b){ if(a.x==b.x) return a.y<b.y; return a.x<b.x; } priority_queue<long long> pq; int main(){ cin>>n>>k; for(long long i=0;i<n;i++){ long long x,y; cin>>a[i].x>>a[i].y; } sort(a,a+n,cmp); for(long long i=0;i<n;i++){ for(long long i1=i-1;i1>=0;i1--){ long long dst=dist(a[i],a[i1]); if(pq.size()<k || dst<pq.top()) pq.push(dst); } } vector<long long> v; while(!pq.empty()){ v.push_back(pq.top()); pq.pop(); } for(long long i=v.size()-1;i>=0;i--){ cout<<v[i]<<"\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 97 ms | 13668 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 10053 ms | 1055088 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 4138 ms | 2097152 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 4138 ms | 2097152 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 97 ms | 13668 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 97 ms | 13668 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |