QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#692205#9227. Henry the PlumberStargazerWA 1ms3700kbC++172.3kb2024-10-31 14:04:002024-10-31 14:04:01

Judging History

你现在查看的是最新测评结果

  • [2024-10-31 14:04:01]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3700kb
  • [2024-10-31 14:04:00]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define y1 xxxxx
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<22|1;
char ibuf[RLEN],*ib,*ob;
inline char gc(){
    (ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
    return (ib==ob)?EOF:*ib++;
}
inline int read(){
	char ch=gc();
	int res=0;bool f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
template<typename tp>inline void chemx(tp &a,tp b){(a<b)?(a=b):0;}
template<typename tp>inline void chemn(tp &a,tp b){(a>b)?(a=b):0;}
#define int long long

int x1,y1,z1,p1,q1;
int x2,y2,z2,p2,q2;

struct pt{
    int x,y;
    pt(int _x=0,int _y=0):x(_x),y(_y){}
    friend inline pt operator +(cs pt &a,cs pt &b){
        return pt(a.x+b.x,a.y+b.y);
    }
    friend inline pt operator -(const pt &a,const pt &b){
        return pt(a.x-b.x,a.y-b.y);
    }
    friend inline ll operator *(const pt &a,const pt &b){
        return 1ll*a.x*b.y-1ll*a.y*b.x;
    }
	friend inline ll operator ^(const pt &a,const pt &b){
		return 1ll*a.x*b.x+1ll*a.y*b.y;
	}
    friend inline bool operator <(const pt &a,const pt &b){
        return (a.x==b.x)?a.y<b.y:a.x<b.x;
    }
};
long double eps=1e-10;
void solve(){
	cin>>x1>>y1>>z1>>p1>>q1;
	pt v1=pt(p1,q1),A=pt(x1,y1);
	cin>>x2>>y2>>z2>>p2>>q2;
	pt v2=pt(p2,q2),B=pt(x2,y2);
	x2-=x1,y2-=y1,z2-=z1;
	pt C=A-B;
//	cout<<C.x<<" "<<C.y<<" "<<v1.x<<" "<<v1.y<<'\n';
	if((C^v1)==0&&(C^v2)==0)puts("2");
	else{
		int a1=p1,b1=q1,c1=0;
		int a2=-p2,b2=-q2,c2=1ll*p2*x2+1ll*q2*y2;
		if(a1*b2-a2*b1==0){
			puts("4");return;
		}
		long double xx=1.0*(b1*c2+b2*c1)/(a1*b2-a2*b1);
		long double yy;
		if(b1==0){
			yy=-1.0*(a2*xx+c2)/b2;
		}
		else yy=-1.0*(a1*xx+c1)/b1;
	//	cout<<xx<<" "<<yy<<'\n';
		long double del=z2*z2-4*(xx*xx-x2*xx+yy*yy-y2*yy);
		if((fabs(xx)<eps&&fabs(yy)<eps)||(fabs(xx-x2)<eps&&fabs(yy-y2)<eps)){
			if(z1!=z2){
				puts("3");
			}
			else puts("4");
			return;
		}
		//cout<<del<<'\n';
		if(del>=-eps){
			puts("3");
		}
		else puts("4");
	}
}

signed main(){
	#ifdef Stargazer
	freopen("1.in","r",stdin);
	#endif
	int T;cin>>T;
	while(T--)solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3692kb

input:

2
-1 -1 3
1 1
2 2 3
2 2
5 5 1
3 0
7 6 -2
1 -2

output:

4
3

result:

ok 2 number(s): "4 3"

Test #2:

score: 0
Accepted
time: 1ms
memory: 3564kb

input:

100
-13 -5 -7
-19 19
-19 -13 0
-7 15
-20 20 19
-17 18
20 -20 -1
18 -19
-18 15 -14
-19 18
19 -20 6
20 -19
-12 9 1
7 -16
-13 -14 -8
8 -13
-19 16 9
20 -19
19 -18 -11
19 -18
19 20 -8
12 20
-11 -9 18
-19 -18
8 11 -13
12 -18
18 13 8
4 -18
-16 20 17
-19 18
20 -18 -3
20 -19
-17 -20 -5
-18 -19
19 16 15
19 20...

output:

4
4
4
4
4
4
3
4
4
4
3
4
4
3
3
4
3
4
4
4
4
4
4
4
4
4
4
4
3
3
3
4
4
4
4
4
4
4
4
4
4
4
4
4
3
4
4
4
4
4
3
4
3
4
4
4
3
4
4
4
4
4
4
4
3
4
3
4
4
4
4
4
4
4
4
4
4
4
4
3
4
4
4
4
4
4
4
3
3
4
3
4
4
4
4
4
4
4
4
4

result:

ok 100 numbers

Test #3:

score: 0
Accepted
time: 1ms
memory: 3568kb

input:

100
20 -9 -19
9 13
-12 14 -18
-17 12
2 -3 -2
2 -19
-8 9 -15
-19 3
-16 -16 -18
2 15
19 17 -6
-10 11
14 -20 -6
-19 7
-17 -8 -1
-7 -15
7 -15 3
2 13
-15 -9 11
15 2
-17 20 13
11 -8
-12 18 16
-18 -17
-17 15 -2
-20 1
8 -6 0
-16 -19
-5 -14 16
-17 10
-7 -16 17
-10 -13
1 1 -13
17 11
-3 -3 -18
4 -17
19 -6 -17
...

output:

3
4
4
4
3
3
4
3
3
4
4
3
4
4
3
3
4
3
4
4
4
4
3
4
3
4
4
3
3
4
4
4
3
4
3
3
4
3
3
4
3
4
3
4
3
4
3
4
4
3
3
4
3
3
4
3
3
4
4
3
3
4
4
3
4
3
3
4
3
3
3
4
3
4
3
4
3
4
3
4
4
3
3
4
3
4
4
4
4
3
3
3
3
4
3
3
4
4
4
4

result:

ok 100 numbers

Test #4:

score: 0
Accepted
time: 1ms
memory: 3568kb

input:

100
10 -9 -13
8 -7
-3 3 -15
-5 11
-14 -20 -17
13 -13
3 20 16
-20 8
-2 -15 -20
8 20
20 -10 15
12 6
4 2 20
14 14
-13 6 -20
-10 20
-18 -15 19
10 9
4 18 -11
-16 -15
20 -11 6
15 -10
-17 -19 -6
-6 8
-19 -19 -18
-11 -9
-6 4 18
11 -5
2 -18 20
0 -12
-10 -18 -17
20 -20
19 19 17
2 -11
-20 2 -16
-19 13
-6 6 -5
...

output:

4
3
4
3
4
4
3
3
3
4
4
3
3
3
4
4
3
3
3
4
4
4
3
4
3
3
3
3
4
4
3
4
4
3
4
3
3
4
4
3
3
3
4
4
3
4
4
4
4
4
3
4
3
4
4
4
3
4
4
3
4
4
3
3
3
4
3
3
3
3
4
4
4
4
3
4
4
3
4
3
4
3
3
3
4
4
3
4
3
4
4
3
4
3
4
4
3
3
4
4

result:

ok 100 numbers

Test #5:

score: 0
Accepted
time: 1ms
memory: 3632kb

input:

100
4 -19 -4
4 18
-15 20 -15
-16 18
-11 -10 -13
-7 14
20 -17 0
6 -20
-12 18 -8
3 -14
20 16 17
10 17
0 19 -17
-11 6
18 -19 -7
13 -13
-17 17 -17
-5 -1
17 -13 19
-10 -12
9 -3 -19
-12 -2
-16 11 13
12 -8
17 12 11
-1 20
13 -14 -5
-4 16
-20 8 -16
16 -3
9 -3 -6
14 -12
16 4 9
-16 -10
-15 -3 -17
-20 -2
20 2 1...

output:

4
4
3
4
3
4
4
4
4
4
3
4
3
4
3
3
4
3
3
4
3
4
3
3
4
4
4
4
4
3
3
4
3
4
3
4
4
4
4
4
3
4
4
4
3
4
4
4
4
4
4
4
4
3
4
4
4
4
4
3
3
3
4
4
4
4
4
3
3
4
3
4
4
4
4
3
4
4
3
4
3
4
3
4
4
4
4
4
4
3
4
3
4
4
4
4
3
4
4
4

result:

ok 100 numbers

Test #6:

score: 0
Accepted
time: 1ms
memory: 3628kb

input:

100
-1 -13 -13
-14 -8
-1 -3 15
6 -14
19 -1 -16
-20 -14
-16 12 18
20 17
-19 17 -6
16 13
15 -8 18
16 10
17 20 0
0 -13
-19 -19 15
-14 -14
-11 -16 17
17 18
0 2 -10
20 -5
-8 -16 0
3 12
-19 0 -3
1 -14
-18 3 -12
-14 -15
20 1 17
20 -4
-20 6 20
20 -7
20 1 -9
-13 -4
2 17 -18
11 13
8 16 14
-12 16
-11 12 -20
0 ...

output:

3
4
4
4
3
4
4
4
3
4
4
4
3
4
3
4
3
4
3
3
4
4
3
3
3
4
4
4
3
3
4
4
4
3
4
4
4
4
3
3
4
4
4
4
4
4
3
4
4
3
3
3
4
3
3
4
4
4
3
4
4
3
3
3
3
4
4
4
4
3
3
3
4
4
3
4
3
3
4
3
3
4
3
4
4
3
3
3
4
4
3
3
4
3
3
3
3
3
4
3

result:

ok 100 numbers

Test #7:

score: 0
Accepted
time: 1ms
memory: 3660kb

input:

100
-16 0 17
16 16
16 -12 -16
14 12
19 -13 -20
-16 -8
-14 20 14
-6 -20
6 -19 12
18 -2
7 20 -19
3 -20
19 -5 12
-16 -12
-9 -11 0
19 4
11 -20 12
14 -14
-19 16 1
-12 -1
-8 -14 11
-15 2
9 -11 18
4 20
-14 3 -16
-20 -4
11 -16 7
-10 -11
20 16 -19
-10 8
-20 0 13
-17 -8
20 -17 2
14 -2
-17 13 7
-8 -11
-8 -6 -2...

output:

4
3
3
4
4
3
3
4
3
3
3
4
3
4
4
4
4
4
4
4
4
4
4
4
4
3
4
4
4
4
4
3
4
4
3
4
3
4
4
4
4
4
4
3
4
3
4
4
4
3
3
3
4
4
4
3
4
4
4
3
4
3
4
4
4
4
4
4
3
3
3
4
3
4
4
4
3
4
4
3
3
4
3
4
3
4
4
3
4
3
4
3
4
3
4
3
3
4
3
4

result:

ok 100 numbers

Test #8:

score: 0
Accepted
time: 0ms
memory: 3624kb

input:

1
1 -1 1
1 1
1 1 2
-1 1

output:

3

result:

ok 1 number(s): "3"

Test #9:

score: 0
Accepted
time: 1ms
memory: 3700kb

input:

100
20 19 -6
18 19
-19 -20 14
19 20
-1 19 -19
6 18
12 -20 19
18 19
4 0 -18
-19 10
-13 12 7
-8 11
-19 -18 -9
-19 -20
18 20 11
18 19
-19 19 8
18 -19
18 -19 -12
-19 20
11 12 9
-15 -2
-12 -12 -4
3 11
-19 9 -10
-18 3
-3 -19 4
20 11
-19 -20 10
-20 -19
17 20 -10
19 18
-17 -20 14
19 20
17 20 -6
-18 -19
9 -1...

output:

4
4
4
4
4
4
3
4
4
3
4
4
4
4
3
4
4
3
4
4
4
4
3
4
4
4
4
3
4
4
3
4
4
3
3
4
4
4
4
4
4
4
4
4
4
3
4
4
3
4
3
4
4
4
4
3
3
4
4
4
3
3
4
4
3
4
3
3
4
3
4
3
4
4
4
4
4
4
4
3
4
4
3
4
4
3
4
4
4
4
4
4
4
4
4
3
4
4
4
4

result:

ok 100 numbers

Test #10:

score: 0
Accepted
time: 1ms
memory: 3624kb

input:

100
13 -13 12
5 12
12 20 14
-14 -8
18 -17 -5
-1 -17
-10 9 9
-10 18
13 -17 -1
19 -18
11 1 -2
-17 -18
16 19 -17
-8 6
-14 -1 16
-18 6
4 -14 18
-10 14
13 3 12
-1 -14
-20 1 -11
12 15
20 4 -20
-7 -17
8 -19 1
-9 -10
-19 8 -4
-17 18
6 -14 -12
-12 -5
-12 6 19
-18 -11
-16 -16 -10
15 16
12 18 -9
-17 16
-18 5 -...

output:

4
4
4
4
4
4
4
4
4
4
4
4
4
3
3
3
3
4
3
4
3
3
4
4
4
4
4
4
3
3
3
3
3
3
3
3
4
3
4
3
4
4
4
4
4
3
4
3
3
4
4
3
3
3
3
3
4
3
3
3
3
3
3
3
3
3
3
4
4
4
4
3
4
3
4
4
4
4
3
4
4
3
3
3
3
4
4
4
4
3
4
3
4
4
3
4
4
4
4
4

result:

ok 100 numbers

Test #11:

score: 0
Accepted
time: 1ms
memory: 3628kb

input:

73
14 -7 7
1 10
-16 -4 11
1 10
-14 -13 -16
1 -8
-6 -12 -10
-2 16
-5 -10 -12
0 -13
15 -10 0
0 -2
19 20 19
17 -9
-14 -20 -15
-20 6
3 19 4
-16 -1
5 -13 11
-16 -1
-19 -20 -17
0 11
-19 -20 -10
2 -3
-9 -15 -18
1 -13
17 -13 -11
1 -13
10 -20 17
8 -1
15 20 1
16 -2
-20 -18 8
0 -11
12 -18 17
0 -10
-4 0 10
9 0
...

output:

2
2
2
4
2
2
2
2
2
2
2
2
2
4
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
2
2
2
3
2
2
2
2
2
4
2
2
2
2
2
2
4
3
4
2
2
2
2
2
4
3
2
2
2
4
2
2
2
2
2
4
2
2
3
2
2

result:

ok 73 numbers

Test #12:

score: -100
Wrong Answer
time: 1ms
memory: 3596kb

input:

100
-20 -20 10
-1 1
20 20 10
-1 6
15 -19 12
-17 20
-18 20 10
17 15
7 -19 0
-16 13
18 17 -10
11 15
17 13 9
-16 15
-6 -13 14
-13 -20
-19 2 13
-8 13
20 -13 -12
-19 -8
-20 20 4
-11 -11
20 -20 4
10 -10
-12 3 0
12 -17
-14 20 17
12 17
6 -19 7
-11 -20
14 8 -6
17 -13
-12 10 -2
19 20
15 -15 -9
-20 3
4 19 -19
...

output:

3
3
4
3
3
3
4
3
3
4
3
3
3
3
3
4
3
4
4
4
3
3
3
4
3
4
3
3
4
4
3
3
4
3
3
3
3
3
3
3
4
3
4
4
3
4
3
4
4
3
3
3
4
3
4
4
3
3
4
4
4
4
3
3
4
3
3
4
3
3
3
3
4
3
3
4
4
4
3
4
3
3
4
3
3
3
3
4
4
3
4
3
3
4
4
4
3
4
4
3

result:

wrong answer 1st numbers differ - expected: '4', found: '3'