QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#695033#9462. Safest Buildings333zhanWA 1ms3648kbC++20802b2024-10-31 19:11:072024-10-31 19:11:09

Judging History

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

  • [2024-10-31 19:11:09]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3648kb
  • [2024-10-31 19:11:07]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long

using namespace std;

constexpr int inf = 1E18;

void solve () {
    int n, R, r;
    cin >> n >> R >> r;

    int minn = inf; 
    vector <int> x (n), y (n);
    for (int i = 0; i < n; i ++) {
        cin >> x[i] >> y[i];
        minn = min (minn, x[i] * x[i] + y[i] * y[i]);
    }

    vector <int> p;
    for (int i = 0; i < n; i ++) {
        if (x[i] * x[i] + y[i] * y[i] == minn) {
            p.push_back (i);
        }
    }

    cout << p.size () << '\n';
    for (auto x : p) {
        cout << x + 1 << " \n"[x == p.back ()];
    }
}

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

    int T = 1;
    cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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
1
12
1
11
1
3
1
12
1
1
1
5
1
9
1
11
1
5
1
29
1
5
1
29
1
33
1
21
1
35
1
29
1
14
1
14
1
13
1
10
1
19
1
14
1
9
1
10
1
3
1
14
1
14
1
27
1
28
1
40
1
24
1
10
1
28
1
6
1
12
1
35
1
47
1
7
1
42
1
9
1
3
1
65
1
41
1
37
1
63
1
6
1
8
1
23
1
9
1
1
1
17
1
21
1
33
1
43
1
32
1
20
1
23
1
8
1
31
1
23
1
23
1
40
1
1...

result:

wrong answer 7th words differ - expected: '4', found: '1'