#include <iostream>
#include <algorithm>
using namespace std;
/*
w = 6
单行,坐标变换
双行,坐标不变
8 -> 7
7 / 6 = 1
7 % 6 = 1
(1, 1) 变为 (1, 4)
2 -> 1
1 / 6 = 0
1 % 6 = 1
(0, 1)
*/
int w, m, n;
int main()
{
cin >> w >> m >> n;
m --, n --;
int x1, y1, x2, y2;
x1 = m / w;
y1 = m % w;
x2 = n / w;
y2 = n % w;
if(x1 % 2 != 0) y1 = w - y1 - 1;
if(x2 % 2 != 0) y2 = w - y2 - 1;
cout << abs(x1 - x2) + abs(y1 - y2) << endl;
return 0;
}
1219. 移动距离
最新推荐文章于 2024-10-08 20:32:22 发布