forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
97 lines (79 loc) · 2.34 KB
/
C.cpp
File metadata and controls
97 lines (79 loc) · 2.34 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define double long double
using namespace std;
struct Point {
double x, y, z;
Point() {}
Point(double x, double y, double z) : x(x), y(y), z(z) {}
Point operator - (const Point& a) const {
return Point(x-a.x, y-a.y, z-a.z);
}
Point operator + (const Point& a) const {
return Point(x+a.x, y+a.y, z+a.z);
}
Point operator / (double k) const {
return Point(x/k, y/k, z/k);
}
Point operator * (double k) const {
return Point(x*k, y*k, z*k);
}
double len() {
return sqrt(x*x + y*y + z*z);
}
void read() {
cin >> x >> y >> z;
}
} P[10111], H, cur;
double vp, vh, t[10111];
int n;
bool can(double time) {
int i = 0;
while (i < n && t[i+1] <= time) {
++i;
}
double extra = time - t[i];
if (extra < 1e-12) {
cur = P[i];
} else {
cur = P[i] + (P[i+1] - P[i]) / (P[i+1] - P[i]).len() * extra * vp;
}
return (H - cur).len() / vh <= time + 1e-12;
}
int main() {
ios :: sync_with_stdio(false);
cout << (fixed) << setprecision(12);
while (cin >> n) {
FOR(i,0,n) P[i].read();
cin >> vh >> vp;
H.read();
t[0] = 0;
FOR(i,1,n) {
t[i] = t[i-1] + (P[i] - P[i-1]).len() / vp;
}
if (!can(t[n])) {
puts("NO");
continue;
}
double l = 0., r = t[n], res = t[n];
REP(turn,500) {
double mid = (l + r) / 2.0;
if (can(mid)) {
res = mid;
r = mid;
}
else l = mid;
}
cout << "YES\n";
cout << res << '\n';
cout << cur.x << ' ' << cur.y << ' ' << cur.z << '\n';
}
}