QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#635623#9462. Safest Buildingsucup-team1264#WA 1ms3724kbC++201.2kb2024-10-12 20:23:312024-10-12 20:23:32

Judging History

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

  • [2024-10-12 20:23:32]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3724kb
  • [2024-10-12 20:23:31]
  • 提交

answer

// https://www.youtube.com/watch?v=CrymicX875M
// Angel of mercy
// How did you move me
// Why am I on my feet again

#ifndef ONLINE_JUDGE
#include "templates/debug.hpp"
#else
#define debug(...)
#endif

#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;

void solve() {
    int n, R, r; cin >> n >> R >> r;
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
    }
    vector<double> dist(n);
    for (int i = 0; i < n; i++) {
        dist[i] = max<double>(hypot(x[i], y[i]), R - r);
    }
    double eps = 1e-9;
    vector<int> ans;
    for (int i = 0; i < n; i++) {
        if (ans.empty() || dist[i] < dist[ans.back()] - eps) {
            ans = {i};
        } else if (abs(dist[i] - dist[ans.back()]) < eps) {
            ans.push_back(i);
        }
    }
    int m = ans.size();
    cout << m << "\n";
    for (int i = 0; i < m; i++) {
        cout << ans[i] + 1 << " \n"[i == m - 1];
    }
}
#undef int

// Make bold hypotheses and verify carefully
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    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
3 10 5
3 4
3 5
3 6
3 10 4
-7 -6
4 5
5 4

output:

1
1
2
2 3

result:

ok 5 tokens

Test #2:

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

input:

100
6 100 50
42 -31
-66 7
13 84
94 13
51 -14
-18 9
12 100 50
-78 56
-56 -64
-22 54
-41 14
-14 55
21 -83
75 21
-51 56
-31 74
-34 79
22 -37
1 -12
14 100 50
15 71
-44 41
-56 78
-48 22
42 -2
-70 28
51 -34
49 -31
-36 67
63 70
34 9
27 -33
36 -93
-52 -19
8 100 14
21 89
67 60
-12 -3
24 -37
-51 14
-30 8
-75 ...

output:

1
6
3
4 11 12
3
5 11 12
6
3 4 5 6 7 8
9
1 3 4 6 8 9 11 12 13
2
1 5
3
2 5 7
1
9
1
11
1
5
15
5 8 10 13 14 21 22 23 25 26 28 29 33 36 37
6
4 5 12 13 16 28
16
18 20 29 30 31 38 39 49 53 58 64 67 69 71 72 73
51
1 2 3 4 5 6 7 9 10 11 12 13 14 17 18 19 20 21 22 23 24 25 26 27 28 30 31 32 33 34 35 36 37 38 ...

result:

wrong answer 3rd words differ - expected: '1', found: '3'