QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#655359#9227. Henry the Plumberreal_sigma_teamWA 1ms4288kbC++233.5kb2024-10-19 03:12:522024-10-19 03:12:52

Judging History

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

  • [2024-10-19 03:12:52]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:4288kb
  • [2024-10-19 03:12:52]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;

constexpr int K = 3;
constexpr double PI = acos(-1);

using vec = std::array<double, K>;
using line = std::array<double, 3>;

vec operator+(const vec& a, const vec& b) {
    vec c;
    for (int i = 0; i < K; i++) {
        c[i] = a[i] + b[i];
    }
    return c;
}

vec operator-(const vec& a, const vec& b) {
    vec c;
    for (int i = 0; i < K; i++) {
        c[i] = a[i] - b[i];
    }
    return c;
}

double operator*(const vec& a, const vec& b) {
    double res = 0;
    for (int i = 0; i < K; i++) {
        res += a[i] * b[i];
    }
    return res;
}

double len(const vec& a) {
    return sqrt(a * a);
}

double angle(const vec& a, const vec& b) {
    vec c = a - b;
    return acos((a * a + b * b - c * c) / (2.0 * len(a) * len(b)));
}

line lin(const vec& norm, const vec& point) {
    line res;
    res[0] = norm[0] / len(norm);
    res[1] = norm[1] / len(norm);
    if (res[0] < 0 || (res[0] == 0 && res[1] < 0)) {
        res[0] *= -1;
        res[1] *= -1;
    }
    res[2] = -(res[0] * point[0] + res[1] * point[1]);
    return res;
}

bool operator==(const line& a, const line& b) {
    bool res = true;
    for (int i = 0; i < 3; i++) {
        res &= abs(a[i] - b[i]) < 5e-7;
    }
    return res;
}

bool colinear(const line& a, const line& b) {
    bool res = true;
    for (int i = 0; i < 2; i++) {
        res &= abs(a[i] - b[i]) < 5e-7;
    }
    return res;
}

double val(const line& a, const vec& b) {
    return a[0] * b[0] + a[1] * b[1] + a[2];
}

vec inter(line a, line b) {
    vec res;
    res[2] = 0;
    if (b[0] == 0) {
        swap(a, b);
    }
    if (a[0] != 0) {
        double coef = a[0] / b[0];
        for (int i = 0; i < K; i++) {
            a[i] -= b[i] * coef;
        }
    }
    res[1] = -a[2] / a[1];
    res[0] = -(res[1] * b[1] + b[2]) / b[0];
    return res;
}

void solve() {
    vec norm1, point1, norm2, point2;
    cin >> point1[0] >> point1[1] >> point1[2] >> norm1[0] >> norm1[1];
    cin >> point2[0] >> point2[1] >> point2[2] >> norm2[0] >> norm2[1];
    norm1[2] = 0;
    norm2[2] = 0;
    line l1 = lin(norm1, point1);
    line l2 = lin(norm2, point2);
    // cout << l1[0] << ' ' << l1[1] << ' ' << l1[2] << '\n';
    // cout << l2[0] << ' ' << l2[1] << ' ' << l2[2] << '\n';
    if (abs(val(l1, point2)) < 1e-8 && abs(val(l2, point1)) < 1e-8) {
        cout << "2\n";
        return;
    }
    if (colinear(l1, l2)) {
        cout << "4\n";
        return;
    }
    vec point = inter(l1, l2);
    // cout << point[0] << ' ' << point[1] << '\n';
    double l = -10000, r = 10000;
    while (r - l > 1e-10) {
        double m1 = (2 * l + r) / 3;
        double m2 = (l + 2 * r) / 3;
        point[2] = m1;
        double a1 = angle(point1 - point, point2 - point);
        point[2] = m2;
        double a2 = angle(point1 - point, point2 - point);
        if (a1 > a2) {
            r = m2;
        } else {
            l = m1;
        }
    }
    point[2] = l;
    double a = angle(point1 - point, point2 - point);
    if ((point == point2 || point == point1) && (abs(a - PI / 2) < 1e-5)) {
        cout << "4\n";
        return;
    }
    // cout << l << ' ' << a << ' ' << PI / 2 << '\n';
    if (a >= PI / 2) {
        cout << "3\n";
        return;
    }
    cout << "4\n";
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(30);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}

详细

Test #1:

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

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: 4092kb

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: 4244kb

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: 4100kb

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: 4208kb

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: 0ms
memory: 4208kb

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: 0ms
memory: 4248kb

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: 3996kb

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: 4288kb

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: 4240kb

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: 4208kb

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: 4288kb

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:

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

result:

wrong answer 14th numbers differ - expected: '4', found: '3'