C++14(g++5.4) 解法, 执行用时: 6ms, 内存消耗: 384K, 提交时间: 2020-07-23 01:31:59

#include<bits/stdc++.h>
using namespace std;
int main(){
	int t;
	cin>>t;
	while(t--){
		double x1,x2,x3,y1,y2,y3;
		cin>>x1>>y1>>x2>>y2>>x3>>y3;
		double k=((x1-x2)*(x3-x2)+(y1-y2)*(y3-y2))/((x3-x2)*(x3-x2)+(y3-y2)*(y3-y2));
		printf("%.7lf %.7lf\n",x2+k*(x3-x2),y2+k*(y3-y2));
	}
} 

C 解法, 执行用时: 4ms, 内存消耗: 348K, 提交时间: 2023-01-10 15:00:17

#include<stdio.h>
int main(){
	int T;
	double px,py,ux,uy,vx,vy,x,y,k;
	scanf("%d",&T);
	while(T--){
		scanf("%lf%lf%lf%lf%lf%lf",&px,&py,&ux,&uy,&vx,&vy);
		k=(uy-vy)/(ux-vx);
		x=(px+k*py+k*k*vx-k*vy)/(k*k+1);
        y=k*(x-vx)+vy;
		printf("%lf %lf\n",x,y);
	}
	return 0;
}

C++(clang++ 11.0.1) 解法, 执行用时: 8ms, 内存消耗: 492K, 提交时间: 2023-03-28 12:04:08

#include<bits/stdc++.h>
using namespace std;
int T;
double px,py,ux,uy,vx,vy;
int main(){
	cin>>T;
	while(T--){
		cin>>px>>py>>ux>>uy>>vx>>vy;
		double k=(uy-vy)/(ux-vx);
		double x=(k*py-k*uy+k*k*ux+px)/(k*k+1);
		double y=k*(x-ux)+uy;
		printf("%.7lf %.7lf\n",x,y);
	}
} 

Python3 解法, 执行用时: 85ms, 内存消耗: 4636K, 提交时间: 2022-11-14 17:40:08

T=int(input())
for i in range(T):
    a,b,c,d,e,f=map(eval,input().split())
    k1=(f-d)/(e-c)
    m=f-(k1*e)
    x=((b*k1)-(k1*m)+a)/(1+pow(k1,2))
    y=(k1*x)+m
    print('%.7f'%x,end=' ')
    print('%.7f'%y)