QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#811101#9869. Horizon ScanningToboWA 28ms3888kbC++201.2kb2024-12-12 15:29:102024-12-12 15:29:10

Judging History

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

  • [2024-12-12 15:29:10]
  • 评测
  • 测评结果:WA
  • 用时:28ms
  • 内存:3888kb
  • [2024-12-12 15:29:10]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using i128 = __int128_t;

bool Memory_begin;

bool Memory_end;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cerr << (&Memory_end - &Memory_begin) / 1048576.0 << "MB" << '\n';

    int t;
    cin >> t;
    while (t--)
    {
        int n, k;
        cin >> n >> k;
        vector<long double> a(n);
        for (int i = 0, x, y; i < n; i++)
        {
            cin >> x >> y;
            a[i] = atan2((long double)y, (long double)x);
        }
        if (n == k)
        {
            cout << fixed << setprecision(10) << acosl(-1) * 2 << '\n';
            continue;
        }
        sort(a.begin(), a.end());
        for (int i = 0; i < n; i++)
            a.push_back(a[i]);
        long double pi = acosl(-1), ans1 = 0;
        for (int i = 0; i < n; i++)
        {
            long double cur = a[i + k] - a[i];
            if (cur < 0)
                cur += pi * 2;
            ans1 = max(ans1, cur);
        }
        if (fabs(ans1) <= 1e-7)
            ans1 = pi * 2;
        cout << fixed << setprecision(10) << ans1 << '\n';
    }
}
/*
 */

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

5
1 1
0 1
8 2
1 0
1 1
0 1
-1 1
-1 0
-1 -1
0 -1
1 -1
4 2
-1 1
0 1
0 2
1 1
4 2
-1000000000 0
-998244353 1
998244353 1
1000000000 0
3 1
0 1
0 2
0 -1

output:

6.2831853072
1.5707963268
5.4977871438
3.1415926546
3.1415926536

result:

ok 5 numbers

Test #2:

score: -100
Wrong Answer
time: 28ms
memory: 3888kb

input:

10000
16 1
-10 -6
-5 -6
-4 9
-2 5
-2 10
1 -7
1 -5
1 6
3 1
4 -9
6 -10
6 -3
6 1
8 -5
8 -4
9 -4
17 4
-9 2
-8 -4
-8 -3
-8 -1
-6 -2
-6 -1
-6 8
-5 -8
-5 10
-4 8
-2 -8
4 -9
4 0
5 -3
8 -5
9 -2
10 10
10 6
-7 2
-4 6
-2 -7
-2 -1
-1 7
1 -9
1 8
3 -4
7 -4
9 -2
14 3
-9 10
-8 -10
-8 -8
-6 -7
-6 -5
-1 -7
-1 -2
0 -1
...

output:

1.6929914975
2.5748634361
4.6527582673
2.7726331074
5.7427658069
4.8576989910
3.4198923126
2.8127999621
6.2831853072
6.2831853072
5.1172807667
6.1467827028
3.8420890235
2.3424967168
3.4633432080
6.2831853072
5.9614347528
3.3247034709
5.2627749281
5.6724593428
1.6738779353
1.1141908549
2.4087775518
6...

result:

wrong answer 42nd numbers differ - expected: '6.2831853', found: '6.2599337', error = '0.0037006'