# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145338 | TadijaSebez | Coin Collecting (JOI19_ho_t4) | C++11 | 78 ms | 4984 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;
#define ll long long
const int N=100050;
int cnt[N][2];
int main()
{
int n,x,y;
scanf("%i",&n);
ll ans=0;
for(int i=1;i<=2*n;i++)
{
scanf("%i %i",&x,&y);
if(x<1) ans+=1-x,x=1;
if(x>n) ans+=x-n,x=n;
if(y<1) ans+=1-y,y=1;
if(y>2) ans+=y-2,y=2;
cnt[x][y-1]++;
}
int b[2]={0,0};
for(int i=1;i<=n;i++)
{
b[0]+=cnt[i][0]-1;
b[1]+=cnt[i][1]-1;
if(b[0]>0 && b[1]<0)
{
int t=min(b[0],-b[1]);
ans+=t;b[0]-=t;b[1]+=t;
}
if(b[1]>0 && b[0]<0)
{
int t=min(b[1],-b[0]);
ans+=t;b[1]-=t;b[0]+=t;
}
ans+=abs(b[0])+abs(b[1]);
}
printf("%lld\n",ans);
return 0;
}
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... |