| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 683142 |
2023-01-17T19:45:31 Z |
ghostwriter |
Park (BOI16_park) |
C++17 |
|
505 ms |
66164 KB |
// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Tran The Bao - ghostwriter
Training for VOI23 gold medal
----------------------------------------------------------------
GOAT
----------------------------------------------------------------
*/
#define sq(x) ((x) * (x))
struct Point {
int x, y;
Point() {}
Point(int x, int y) : x(x), y(y) {}
};
struct Circle {
Point c;
int r;
Circle() {}
Circle(Point c, int r) : c(c), r(r) {}
};
ldb dis(const Point &a, const Point &b) { return sqrt((ldb)sq(1LL * a.x - b.x) + sq(1LL * a.y - b.y)); }
ldb dis(const Circle &a, const Circle &b) { return dis(a.c, b.c) - a.r - b.r; }
struct Query {
int r, e, id;
Query() {}
Query(int r, int e, int id) : r(r), e(e), id(id) {}
};
struct Edge {
int u, v;
ldb w;
Edge() {}
Edge(int u, int v, ldb w) : u(u), v(v), w(w) {}
};
const ldb eps = 1e-9;
const int N = 2004;
const int M = 1e5;
int n, m, w, h, p[N], ans[M][4];
pi d[4] = {{0, 3}, {0, 1}, {1, 2}, {2, 3}};
Circle a[N];
Query q[M];
vector<Edge> e;
void reinit(int test_id) {
}
void input(int test_id) {
cin >> n >> m;
cin >> w >> h;
FRN(i, n) cin >> a[i].c.x >> a[i].c.y >> a[i].r;
FRN(i, m) {
cin >> q[i].r >> q[i].e;
--q[i].e;
q[i].id = i;
}
}
bool cmp(const Query &a, const Query &b) { return a.r < b.r; }
bool cmp1(const Edge &a, const Edge &b) { return a.w < b.w; }
int getp(int x) { return x == p[x]? x : p[x] = getp(p[x]); }
void join(int x, int y) {
x = getp(x);
y = getp(y);
if (x == y) return;
p[y] = x;
}
void solve(int test_id) {
sort(q, q + m, cmp);
FRN(i, n)
FOR(j, i + 1, n + 3)
if (j < n) e.pb(Edge(i, j, dis(a[i], a[j])));
else {
int jn = j - n;
if (jn == 0) e.pb(Edge(i, j, a[i].c.y - a[i].r));
if (jn == 1) e.pb(Edge(i, j, w - a[i].c.x - a[i].r));
if (jn == 2) e.pb(Edge(i, j, h - a[i].c.y - a[i].r));
if (jn == 3) e.pb(Edge(i, j, a[i].c.x - a[i].r));
}
sort(all(e), cmp1);
FRN(i, n + 4) p[i] = i;
int cpos = 0;
FRN(i, m) {
WHILE(cpos < sz(e) && 2 * q[i].r - e[cpos].w > -eps) {
join(e[cpos].u, e[cpos].v);
++cpos;
}
int id = q[i].id, e = q[i].e;
FRN(j, 4) {
ans[id][j] = 1;
if (j == e) continue;
if (getp(d[e].st + n) == getp(d[e].nd + n)) ans[id][j] = 0;
if (getp(d[j].st + n) == getp(d[j].nd + n)) ans[id][j] = 0;
if (((min(e, j) == 0 && max(e, j) == 3) || (min(e, j) == 1 && max(e, j) == 2)) && getp(n + 1) == getp(n + 3)) ans[id][j] = 0;
if (((min(e, j) == 0 && max(e, j) == 1) || (min(e, j) == 2 && max(e, j) == 2)) && getp(n) == getp(n + 2)) ans[id][j] = 0;
}
}
FRN(i, m) {
FRN(j, 4) {
if (!ans[i][j]) continue;
cout << j + 1;
}
cout << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
int test_num = 1;
// cin >> test_num; // comment if the problem does not requires multitest
FOR(i, 1, test_num) {
input(i); // input in noninteractive sections for case #i
solve(i); // main function to solve case #i
reinit(i); // reinit global data to default used in case #i
}
#ifdef LOCAL
cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
#endif
return 0;
}
/*
5 3
16 11
11 8 1
6 10 1
7 3 2
10 4 1
15 5 1
1 1
2 2
2 1
----------------------------------------------------------------
From Benq:
stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
460 ms |
66144 KB |
Output is correct |
| 2 |
Correct |
505 ms |
66068 KB |
Output is correct |
| 3 |
Correct |
469 ms |
66160 KB |
Output is correct |
| 4 |
Correct |
470 ms |
66120 KB |
Output is correct |
| 5 |
Correct |
481 ms |
66164 KB |
Output is correct |
| 6 |
Correct |
455 ms |
66088 KB |
Output is correct |
| 7 |
Incorrect |
455 ms |
66100 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
46 ms |
4208 KB |
Output is correct |
| 2 |
Correct |
44 ms |
4116 KB |
Output is correct |
| 3 |
Incorrect |
49 ms |
4196 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
460 ms |
66144 KB |
Output is correct |
| 2 |
Correct |
505 ms |
66068 KB |
Output is correct |
| 3 |
Correct |
469 ms |
66160 KB |
Output is correct |
| 4 |
Correct |
470 ms |
66120 KB |
Output is correct |
| 5 |
Correct |
481 ms |
66164 KB |
Output is correct |
| 6 |
Correct |
455 ms |
66088 KB |
Output is correct |
| 7 |
Incorrect |
455 ms |
66100 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
