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 c[200005][3];
int main()
{
int n;
cin>>n;
ll ans = 0;
for(int i=0;i<2*n;i++){
int x,y;
cin>>x>>y;
if(x<1){
ans+=1-x;
x = 1;
}else if(x>n){
ans+=x-n;
x = n;
}
if(y<1){
ans+=1-y;
y = 1;
}else if(y>2){
ans+=y-2;
y = 2;
}
c[x][y]++;
}
int cnt = 0;
for(int i=1;i<=n;i++)cnt+=c[i][1];
ans+=abs(cnt-n);
cnt = 0;
for(int i=1;i<=n;i++){
cnt+=c[i][1] + c[i][2];
cnt-=2;
ans+=abs(cnt);
}
cout<<ans<<'\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |