# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231772 | jamielim | Coin Collecting (JOI19_ho_t4) | C++14 | 5 ms | 384 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;
int main(){
int n;
scanf("%d",&n);
int x[2*n],y[2*n];
long long ans=0;
for(int i=0;i<2*n;i++){
scanf("%d%d",&x[i],&y[i]);
if(x[i]<1){ans+=(long long)(1-x[i]);x[i]=1;}
else if(x[i]>n){ans+=(long long)(x[i]-n);x[i]=n;}
if(y[i]<1){ans+=(long long)(1-y[i]);y[i]=1;}
else if(y[i]>2){ans+=(long long)(y[i]-2);y[i]=2;}
}
int c=0;
for(int i=0;i<2*n;i++)if(y[i]==1)c++;
ans+=(long long)abs(n-c);
sort(x,x+2*n);
for(int i=0;i<2*n;i++){
ans+=(long long)abs(x[i]-(i/2+1));
}
printf("%lld",ans);
}
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... |