QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#137300#2350. Integer CowS_Explosion#WA 2ms3644kbC++201.2kb2023-08-10 09:58:292023-08-10 09:58:32

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-10 09:58:32]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3644kb
  • [2023-08-10 09:58:29]
  • 提交

answer

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long double ld;
typedef long long ll;
const ld eps=1e-10;
int T;
ll r,Xc,Yc,X0,Y0,ansX,ansY,ans;
ld X1,Y1,l;
ll dist2(ll X1,ll Y1,ll X2,ll Y2){
    return (X1-X2)*(X1-X2)+(Y1-Y2)*(Y1-Y2);
}
ld dist(ld X1,ld Y1,ld X2,ld Y2){
    return sqrt((X1-X2)*(X1-X2)+(Y1-Y2)*(Y1-Y2));
}
bool is_point_in_circle(ll X0,ll Y0,ll Xc,ll Yc,ll r){
    return dist2(X0,Y0,Xc,Yc)<=r*r;
}
int main(){
    ios::sync_with_stdio(false);
    ll X,Y;
    cin>>T;
    while(T--){
        ans=9e18;
        cin>>Xc>>Yc>>r>>X0>>Y0;
        if(is_point_in_circle(X0,Y0,Xc,Yc,r)){
            cout<<0<<'\n';
            cout<<X0<<' '<<Y0<<'\n';
            continue;
        }
        l=dist(X0,Y0,Xc,Yc);
        X1=((l-r)*Xc+r*X0)/l;
        Y1=((l-r)*Yc+r*Y0)/l;
        for(X=X1-10;X<=X1+10;X++)
            for(Y=Y1-10;Y<=Y1+10;Y++){
                if(!is_point_in_circle(X,Y,Xc,Yc,r))
                    continue;
                ll cur=dist2(X0,Y0,X,Y);
                if(cur<ans)
                    ans=cur,ansX=X,ansY=Y;
            }
        cout<<1<<'\n';
        cout<<X0<<' '<<Y0<<' '<<ansX<<' '<<ansY<<'\n';
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
1 2 1 1 2
3 2 5 -10 3
0 0 1 10 0

output:

0
1 2
1
-10 3 -2 2
1
10 0 1 0

result:

ok correct (3 test cases)

Test #2:

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

input:

1
0 0 1 0 0

output:

0
0 0

result:

ok correct (1 test case)

Test #3:

score: 0
Accepted
time: 2ms
memory: 3468kb

input:

100
-1 0 2 -3 -2
0 -2 2 -2 0
2 -1 1 0 1
-1 -3 1 -1 0
-1 2 2 -1 -1
2 -2 2 0 -3
-2 -3 2 -3 -2
0 1 2 2 1
-1 0 1 -2 -2
2 -2 2 -1 -2
1 2 2 -2 2
-1 2 1 -1 2
-2 1 2 -3 -2
-1 1 1 -1 1
2 2 1 1 -3
2 0 1 -2 -1
-1 2 1 -2 0
2 -2 2 -2 -1
-2 -2 1 1 -2
-1 1 2 2 1
2 -3 1 0 -1
-3 -3 2 2 -1
2 1 1 -1 1
-3 -2 1 -2 -3
0 ...

output:

1
-3 -2 -2 -1
1
-2 0 -1 -1
1
0 1 1 -1
1
-1 0 -1 -2
1
-1 -1 -1 0
1
0 -3 0 -2
0
-3 -2
0
2 1
1
-2 -2 -1 -1
1
-1 -2 0 -2
1
-2 2 -1 2
0
-1 2
1
-3 -2 -2 -1
0
-1 1
1
1 -3 2 1
1
-2 -1 1 0
1
-2 0 -1 1
1
-2 -1 0 -2
1
1 -2 -1 -2
1
2 1 1 1
1
0 -1 1 -3
1
2 -1 -1 -3
1
-1 1 1 1
1
-2 -3 -3 -3
0
-2 -2
0
-2 -2
0
1 -1...

result:

ok correct (100 test cases)

Test #4:

score: 0
Accepted
time: 2ms
memory: 3380kb

input:

100
-5 9 1 -2 -7
3 1 6 9 2
-2 -1 2 -7 3
-10 -8 7 -8 6
0 3 9 -6 -7
6 4 9 -1 4
8 6 7 -7 7
3 -7 7 2 0
-5 -1 6 -7 -7
-5 8 7 -9 -6
-6 -5 5 -10 -9
-7 1 9 7 -2
-4 9 4 8 3
3 -9 6 2 -2
-1 -7 3 -8 2
-2 -5 4 -1 0
1 2 9 -5 5
0 9 5 -4 -1
-10 8 2 -3 -7
-8 -3 3 2 -3
3 3 7 -4 6
6 0 6 -3 5
-7 5 9 9 9
2 0 2 8 -10
2 1...

output:

1
-2 -7 -5 8
1
9 2 8 2
1
-7 3 -4 -1
1
-8 6 -10 -1
1
-6 -7 -4 -5
0
-1 4
1
-7 7 1 6
1
2 0 2 -1
1
-7 -7 -7 -6
1
-9 -6 -8 2
1
-10 -9 -10 -8
1
7 -2 2 1
1
8 3 -1 7
1
2 -2 3 -3
1
-8 2 -3 -5
1
-1 0 -2 -1
0
-5 5
1
-4 -1 -3 5
1
-3 -7 -10 6
1
2 -3 -5 -3
1
-4 6 -3 6
1
-3 5 1 3
1
9 9 1 9
1
8 -10 2 -2
1
7 -1 5 1
...

result:

ok correct (100 test cases)

Test #5:

score: 0
Accepted
time: 2ms
memory: 3640kb

input:

100
-52 -13 72 44 58
79 -58 32 60 11
-50 21 75 95 65
-37 -61 21 -74 -40
0 -88 14 11 -49
10 -80 46 79 -17
75 -94 90 61 -34
-80 19 85 -7 -20
-72 42 56 67 -89
21 51 39 20 88
82 32 56 88 -82
3 51 31 -45 -53
50 12 91 9 46
-45 29 25 76 27
-19 -14 81 22 97
5 93 35 98 64
54 90 88 -100 63
-60 -18 81 -20 8
34...

output:

1
44 58 7 28
1
60 11 68 -28
1
95 65 22 42
1
-74 -40 -54 -49
1
11 -49 5 -75
1
79 -17 43 -48
0
61 -34
0
-7 -20
1
67 -89 -30 5
0
20 88
1
88 -82 82 -24
1
-45 -53 -10 23
0
9 46
1
76 27 -20 29
1
22 97 9 62
1
98 64 39 85
1
-100 63 -33 77
0
-20 8
1
62 16 46 51
1
-46 66 -79 -27
1
62 -91 -11 -54
1
-55 -54 73 ...

result:

ok correct (100 test cases)

Test #6:

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

input:

100
-14 48 115 -133 160
80 40 30 181 139
114 -109 102 -111 -14
-51 175 113 40 -116
-44 -171 69 6 -128
18 -23 159 94 170
-150 71 199 -167 -181
82 173 50 -138 41
-27 -126 119 195 134
-129 16 169 -103 51
183 136 117 -196 54
25 61 27 166 12
-156 63 199 -8 -56
-143 138 31 -137 125
48 16 44 -83 37
150 -16...

output:

1
-133 160 -99 125
1
181 139 102 60
1
-111 -14 19 -72
1
40 -116 -18 67
0
6 -128
1
94 170 76 125
1
-167 -181 -167 -127
1
-138 41 40 146
1
195 134 53 -38
0
-103 51
1
-196 54 69 110
1
166 12 50 51
0
-8 -56
0
-137 125
1
-83 37 5 25
1
-71 -195 9 -183
1
-77 -188 -51 120
1
-88 135 -100 -179
0
170 90
1
-25 ...

result:

ok correct (100 test cases)

Test #7:

score: -100
Wrong Answer
time: 0ms
memory: 3376kb

input:

100
30 194 241 273 -11
476 -181 37 -18 -139
-162 496 295 113 250
-413 467 26 -100 312
-322 -120 423 -86 222
464 231 266 -421 497
249 -467 327 -183 -486
-316 486 468 -295 -286
92 141 487 -146 -13
108 -300 14 318 17
229 -180 49 -247 -464
-385 326 56 -493 62
-365 349 114 -258 293
44 -443 26 -139 -313
6...

output:

1
273 -11 217 42
1
-18 -139 439 -181
1
113 250 60 302
1
-100 312 -389 457
0
-86 222
1
-421 497 208 303
1
-183 -486 -77 -486
1
-295 -286 -295 19
0
-146 -13
1
318 17 115 -288
1
-247 -464 187 -205
1
-493 62 -408 275
1
-258 293 -264 297
1
-139 -313 23 -428
1
-458 -334 55 71
1
210 -353 304 215
0
-118 -26...

result:

wrong answer the distance of your solution has travelled is longer than expected. (test case 8)