#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int cnt[2][100002];
ll solve(int l,int r)
{
queue<int> q[2];
fup(i,l,r,1)
{
if(cnt[0][i]>1)
{
fup(T,2,cnt[0][i],1)q[0].push(i);
}
if(cnt[1][i]>1)
{
fup(T,2,cnt[1][i],1)q[1].push(i);
}
}
ll res=0;
q[0].push(INF);q[1].push(INF);
fup(i,l,r,1)
{
if(!cnt[0][i])
{
int t0=q[0].front(),t1=q[1].front();
if(t1<t0)
{
res+=abs(t1-i)+1;
q[1].pop();
}
else
{
res+=abs(t0-i);
q[0].pop();
}
}
if(!cnt[1][i])
{
int t0=q[0].front(),t1=q[1].front();
if(t0<t1)
{
res+=abs(t0-i)+1;
q[0].pop();
}
else
{
res+=abs(t1-i);
q[1].pop();
}
}
}
return res;
}
int main() {
int n;
scanf("%d",&n);
ll ans=0;
fup(i,0,2*n-1,1)
{
int x,y;
scanf("%d%d",&x,&y);
y--;
if(x<=1)
{
ans+=1-x;
if(y>0)
{
ans+=y-1;
cnt[1][1]++;
}
else
{
ans-=y;
cnt[0][1]++;
}
}
else if(x<n)
{
if(y>0)
{
ans+=y-1;
cnt[1][x]++;
}
else
{
ans-=y;
cnt[0][x]++;
}
}
else
{
ans+=x-n;
if(y>0)
{
ans+=y-1;
cnt[1][n]++;
}
else
{
ans-=y;
cnt[0][n]++;
}
}
}
int c=0;
for(int i=0,j=1;j<=n;j++)
{
c+=cnt[0][j]+cnt[1][j];
if(c==2*(j-i))
{
ans+=solve(i+1,j);
c=0;
i=j;
}
}
printf("%lld",ans);
}
Compilation message
joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:95:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
~~~~~^~~~~~~~~
joi2019_ho_t4.cpp:100:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
~~~~~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Output is correct |
| 2 |
Correct |
4 ms |
248 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
376 KB |
Output is correct |
| 5 |
Correct |
5 ms |
256 KB |
Output is correct |
| 6 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Output is correct |
| 2 |
Correct |
4 ms |
248 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
376 KB |
Output is correct |
| 5 |
Correct |
5 ms |
256 KB |
Output is correct |
| 6 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Output is correct |
| 2 |
Correct |
4 ms |
248 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
376 KB |
Output is correct |
| 5 |
Correct |
5 ms |
256 KB |
Output is correct |
| 6 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
