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;
const int N=1e5+5;
int tab[N][3];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
long long ans=0;
for(int i=0; i<2*n; i++){
int x, y;
cin>>x>>y;
if(x>n){
ans+=x-n;
x=n;
}
if(x<1){
ans+=1-x;
x=1;
}
if(y<1){
ans+=1-y;
y=1;
}
if(y>2){
ans+=y-2;
y=2;
}
//cout<<ans<<" "<<x<<" "<<y<<"\n";
tab[x][y]++;
}
long long ile=0, x=0;
//potrzebne=2*i
for(int i=1; i<=n; i++){
x+=tab[i][1];
ile+=tab[i][1]+tab[i][2];
ans+=abs(ile-2*i);
}
ans+=abs(x-n);
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |