# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
906956 | ibm2006 | Road Construction (JOI21_road_construction) | C++17 | 1750 ms | 2097156 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n,i,j,k,l,r,x,y,z,w,s,t;
pair<ll,ll> p[1100000];
vector<ll> v;
int main()
{
scanf("%lld %lld",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%lld %lld",&x,&y);
p[i]={x,y};
}
for(i=1;i<=n;i++)
{
for(j=1;j<i;j++)
{
v.push_back(max(p[i].first-p[j].first,p[j].first-p[i].first)+max(p[i].second-p[j].second,p[j].second-p[i].second));
}
}
sort(v.begin(),v.end());
for(i=0;i<k;i++)
{
printf("%lld\n",v[i]);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |