关键词:模的简化
题意:可以转化为求两点(x1,y1),(x2,y2)之间的线段经过多少个整点(x3,y3)满足x3,y3都是10的倍数?
解法:
1.x1==x2||y1==y2:退化为平行于轴线的线段上有几个整数点横纵坐标都是10的倍数,遍历从某个点出发后的10个相邻点,记录第几个点横纵坐标都是10的倍数即可
2.x1!=x2&&y1!=y2:
1)求出线段上的所有整点。求gcd(y2-y1,x2-x1),这是线段上被格点分割的区间数目。
2)遍历前10个相邻格点,判断每个格点是否满足条件。第10*k+l个格点与第l个节点满足性相同。因此可以用带余除法简化
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<math.h>
#define y1 y11
#define mem(a,b) memset(a,sizeof(a),b)
using namespace std;
typedef long long ll;
int t;
double tx1,ty1,tx2,ty2;
ll x1,y1,x2,y2,d,sum[20],ans;
ll gcd(ll a,ll b){
return b==0?a:gcd(b,a%b);
}
ll f(double x){
return round(10*x);
}
int main(){
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
scanf("%d",&t);
for(int cas=0;cas<t;cas++){
scanf("%lf%lf%lf%lf",&tx1,&ty1,&tx2,&ty2);
x1=f(tx1),y1=f(ty1);
x2=f(tx2),y2=f(ty2);
if(x1==x2&&y1==y2){
if(x1%10==0&&y1%10==0) printf("1\n");
else printf("0\n");
continue;
}
if(x1==x2&&y1!=y2){
if(y1>y2) swap(y1,y2);
for(ll i=0;i<10;i++){
if(i==0) sum[i]=0; else sum[i]=sum[i-1];
ll tmpy=y1+i;
if(x1%10==0&&tmpy%10==0) sum[i]++;
}
d=y2-y1;
ans=(d/10)*sum[9]+sum[d%10];
printf("%lld\n",ans);
continue;
}
if(x1!=x2&&y1==y2){
if(x1>x2) swap(x1,x2);
for(ll i=0;i<10;i++){
if(i==0) sum[i]=0; else sum[i]=sum[i-1];
ll tmpx=x1+i;
if(y1%10==0&&tmpx%10==0) sum[i]++;
}
d=x2-x1;
ans=(d/10)*sum[9]+sum[d%10];
printf("%lld\n",ans);
continue;
}
d=gcd(abs(y2-y1),abs(x2-x1));
if(x1>x2&&y1>y2) { swap(x1,x2),swap(y1,y2); }
if(x1>x2&&y1<y2) { swap(x1,x2),swap(y1,y2); }
ll dx=abs((x2-x1)/d),dy=abs((y2-y1)/d);
for(ll i=0;i<10;i++){
if(i==0) sum[i]=0;
else sum[i]=sum[i-1];
ll tmpx,tmpy;
if(x1<x2&&y1<y2) tmpx=x1+dx*i,tmpy=y1+dy*i;
else if(x1<x2&&y1>y2) tmpx=x1+dx*i,tmpy=y1-dy*i;
if(tmpx%10==0&&tmpy%10==0) sum[i]++;
}
ans=(d/10)*sum[9]+sum[d%10];
printf("%lld\n",ans);
}
return 0;
}