QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#102203#6378. LaLa and Monster Hunting (Part 1)whatever#WA 4ms8208kbC++141.9kb2023-05-02 15:55:122023-05-02 15:55:16

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-05-02 15:55:16]
  • 评测
  • 测评结果:WA
  • 用时:4ms
  • 内存:8208kb
  • [2023-05-02 15:55:12]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ull = unsigned long long;

constexpr int mod = 998244353;
void addt(int &x, int y) {x += y, x >= mod && (x -= mod);}
int add(int x, int y) {return x += y, x >= mod && (x -= mod), x;}
int ksm(int a, int b) {
  int s = 1;
  while(b) {
    if(b & 1) s = 1ll * s * a % mod;
    a = 1ll * a * a % mod, b >>= 1;
  }
  return s;
}

bool Mbe;
constexpr int N = 1e6 + 5;
constexpr double eps = 1e-8;
constexpr double Pi = acos(-1);

ll n, x[N], y[N], r[N];

bool Med;
int main() {
  fprintf(stderr, "%.3lf MB\n", (&Mbe - &Med) / 1048576.0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  
  cin >> n;
  double Ll = 0, Lr = Pi, Rl = 0, Rr = Pi;
  auto adjust = [&](double &x, double norm) {
    while(x < norm) x += 2 * Pi;
    while(x > norm + 2 * Pi) x -= 2 * Pi;
  };
  for(int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i] >> r[i];
    if(r[i] * r[i] >= x[i] * x[i] + y[i] * y[i]) cout << "Yes\n", exit(0);
    double Theta = atan2(y[i], x[i]);
    double Delta = asin(1. * r[i] / sqrt(x[i] * x[i] + y[i] * y[i]));
    double l = Theta - Delta, r = Theta + Delta;
    // cout << "see " << l << " " << r << "\n";

    double _l = r + Pi, _r = l;
    adjust(_l, 0), adjust(_r, _l);
    Ll = max(Ll, _l), Lr = min(Lr, _r);
    // cout << "check " << i << " " << _l << " " << _r << "\n";

    _l = r, _r = l + Pi;
    adjust(_l, 0), adjust(_r, _l);
    Rl = max(Rl, _l), Rr = min(Rr, _r);
    // cout << "check " << i << " " << _l << " " << _r << "\n";
  }
  if(Ll + eps < Lr || Rl + eps < Rr) cout << "No\n";
  else cout << "Yes\n";

  cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
  return 0;
}
/*
g++ E.cpp -o E -std=c++14 -O2 -DALEX_WEI
*/

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 7860kb

input:

3
-3 0 1
0 0 3
3 0 1

output:

Yes

result:

ok answer is YES

Test #2:

score: 0
Accepted
time: 2ms
memory: 8208kb

input:

3
2 0 1
0 2 1
-5 -5 3

output:

Yes

result:

ok answer is YES

Test #3:

score: 0
Accepted
time: 0ms
memory: 8140kb

input:

1
3 3 1

output:

No

result:

ok answer is NO

Test #4:

score: 0
Accepted
time: 3ms
memory: 7756kb

input:

1
-3 -2 5

output:

Yes

result:

ok answer is YES

Test #5:

score: 0
Accepted
time: 4ms
memory: 7748kb

input:

2
1 3 5
-2 -6 1

output:

Yes

result:

ok answer is YES

Test #6:

score: 0
Accepted
time: 1ms
memory: 8128kb

input:

3
-14 7 7
2 -1 3
8 -1 9

output:

Yes

result:

ok answer is YES

Test #7:

score: 0
Accepted
time: 3ms
memory: 7692kb

input:

4
5 -3 9
-10 6 5
4 2 2
-8 10 2

output:

Yes

result:

ok answer is YES

Test #8:

score: 0
Accepted
time: 3ms
memory: 7552kb

input:

5
-2 -1 4
9 10 5
-9 2 4
6 -3 5
0 -4 10

output:

Yes

result:

ok answer is YES

Test #9:

score: 0
Accepted
time: 3ms
memory: 7672kb

input:

6
-3 -1 6
3 1 8
1 2 4
1 -3 5
3 7 4
5 5 4

output:

Yes

result:

ok answer is YES

Test #10:

score: 0
Accepted
time: 2ms
memory: 7804kb

input:

7
3 -2 5
-1 10 7
-1 10 3
1 -5 5
-9 -9 4
-5 -10 5
1 4 9

output:

Yes

result:

ok answer is YES

Test #11:

score: 0
Accepted
time: 3ms
memory: 7628kb

input:

8
3 -1 5
1 7 2
-2 -10 6
-1 6 4
-2 0 9
0 9 6
-7 1 7
5 -2 7

output:

Yes

result:

ok answer is YES

Test #12:

score: 0
Accepted
time: 3ms
memory: 7820kb

input:

9
-1 0 8
2 0 8
-8 -10 2
8 -2 1
-5 -8 0
-2 -3 5
-7 -4 9
-3 9 8
-10 10 7

output:

Yes

result:

ok answer is YES

Test #13:

score: 0
Accepted
time: 3ms
memory: 7556kb

input:

10
-3 0 4
3 -1 8
7 0 6
-6 -10 2
4 5 2
-7 -5 0
-7 4 7
10 7 0
-3 0 9
7 -6 6

output:

Yes

result:

ok answer is YES

Test #14:

score: 0
Accepted
time: 3ms
memory: 7664kb

input:

11
0 -4 7
5 9 4
-8 0 2
-10 8 5
7 9 1
7 8 8
4 -8 5
8 6 9
2 -7 8
3 4 0
10 -8 10

output:

Yes

result:

ok answer is YES

Test #15:

score: 0
Accepted
time: 3ms
memory: 7748kb

input:

12
2 3 5
-5 -9 5
5 -10 3
9 -10 9
-4 -10 0
10 5 1
-3 -5 7
2 10 10
0 7 10
-10 -7 5
-7 1 9
0 4 8

output:

Yes

result:

ok answer is YES

Test #16:

score: 0
Accepted
time: 3ms
memory: 7696kb

input:

13
3 0 5
-12 0 4
2 2 8
6 3 4
5 -3 0
3 -4 9
-9 5 9
-1 -3 5
4 -1 2
1 -3 10
-10 2 3
-7 9 7
-6 9 3

output:

Yes

result:

ok answer is YES

Test #17:

score: 0
Accepted
time: 3ms
memory: 7864kb

input:

14
2 1 4
8 -3 0
-7 -4 2
10 -6 5
-4 -4 4
1 1 2
4 6 5
-3 -5 5
10 -10 1
4 -6 2
-4 9 3
-3 10 8
-6 6 10
8 -8 1

output:

Yes

result:

ok answer is YES

Test #18:

score: 0
Accepted
time: 3ms
memory: 7628kb

input:

15
1 2 6
-1 -2 3
9 -10 2
0 5 6
8 10 8
-2 -6 9
-7 4 0
6 -10 1
-6 -3 10
7 -3 2
5 -9 5
10 0 3
9 -6 1
0 -1 3
-8 -3 5

output:

Yes

result:

ok answer is YES

Test #19:

score: 0
Accepted
time: 2ms
memory: 7676kb

input:

16
0 -8 9
1 -4 0
-8 -3 7
-6 -7 7
3 -7 9
-9 7 10
4 1 1
-9 2 7
1 -7 7
-5 -3 3
4 4 3
-1 -9 2
-4 -1 7
-8 -2 10
-6 1 3
-1 -8 3

output:

Yes

result:

ok answer is YES

Test #20:

score: 0
Accepted
time: 0ms
memory: 7856kb

input:

17
0 4 7
-6 8 0
6 6 4
3 -8 7
-6 2 6
-10 8 3
-10 9 8
-9 1 9
-10 8 2
-9 0 7
-5 1 1
2 -4 5
-3 -5 0
-4 0 6
1 -2 0
6 -4 4
-2 -7 3

output:

Yes

result:

ok answer is YES

Test #21:

score: 0
Accepted
time: 1ms
memory: 8128kb

input:

18
-3 -3 1
5 5 8
7 -6 8
-10 3 4
10 1 2
7 -10 10
3 -4 9
1 5 6
-10 -4 1
3 -4 2
4 -5 9
3 -6 4
3 1 7
9 -3 5
6 9 8
5 -6 2
9 -2 5
10 3 2

output:

Yes

result:

ok answer is YES

Test #22:

score: 0
Accepted
time: 1ms
memory: 7804kb

input:

19
4 -1 8
-5 5 1
-5 -4 7
-9 -10 7
-8 6 0
10 10 6
2 -6 9
1 1 6
-9 -6 7
-8 -5 5
2 -7 9
1 -1 4
-7 4 5
-3 3 10
1 6 6
2 4 6
-7 3 10
-5 -4 8
9 -4 6

output:

Yes

result:

ok answer is YES

Test #23:

score: 0
Accepted
time: 3ms
memory: 7552kb

input:

20
1 0 2
-10 3 7
9 -3 7
0 -10 7
7 -6 8
-5 6 7
5 6 5
7 8 8
-4 -10 9
-8 -10 8
2 -5 5
-5 -5 9
-5 9 10
1 9 1
-7 6 4
0 -1 6
-5 7 9
-1 -4 5
-4 4 6
3 6 2

output:

Yes

result:

ok answer is YES

Test #24:

score: 0
Accepted
time: 3ms
memory: 8144kb

input:

3
-6 -6 2
-10 -8 8
-7 -7 5

output:

No

result:

ok answer is NO

Test #25:

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

input:

4
-7 -9 3
-3 -6 2
9 -1 2
0 -7 3

output:

Yes

result:

wrong answer expected NO, found YES