oj.uz

Submission #683147

# Submission time Handle Problem Language Result Execution time Memory
683147 2023-01-17T19:55:09 Z ghostwriter Park (BOI16_park) C++17
100 / 100
 537 ms 67368 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 int N = 2004;
const int M = 1e5;
int n, m, w, h, p[N], ans[M][4], op1[4][4], op2[4][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) {
	op1[0][2] = op1[0][3] = 1;
	op1[1][2] = op1[1][3] = 1;
	op1[2][0] = op1[2][1] = 1;
	op1[3][0] = op1[3][1] = 1;
	op2[0][1] = op2[0][2] = 1;
	op2[1][0] = op2[1][3] = 1;
	op2[2][0] = op2[2][3] = 1;
	op2[3][1] = op2[3][2] = 1;
	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 > 0) {
			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 (op1[e][j] && getp(n + 1) == getp(n + 3)) ans[id][j] = 0;
			if (op2[e][j] && 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
----------------------------------------------------------------
*/

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 484 ms 66116 KB Output is correct
2 Correct 472 ms 66164 KB Output is correct
3 Correct 467 ms 66136 KB Output is correct
4 Correct 482 ms 66164 KB Output is correct
5 Correct 462 ms 66056 KB Output is correct
6 Correct 472 ms 66096 KB Output is correct
7 Correct 454 ms 66188 KB Output is correct
8 Correct 452 ms 66244 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 4232 KB Output is correct
2 Correct 47 ms 4104 KB Output is correct
3 Correct 56 ms 4108 KB Output is correct
4 Correct 47 ms 4184 KB Output is correct
5 Correct 48 ms 4104 KB Output is correct
6 Correct 45 ms 4168 KB Output is correct
7 Correct 41 ms 3256 KB Output is correct
8 Correct 41 ms 3312 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 484 ms 66116 KB Output is correct
2 Correct 472 ms 66164 KB Output is correct
3 Correct 467 ms 66136 KB Output is correct
4 Correct 482 ms 66164 KB Output is correct
5 Correct 462 ms 66056 KB Output is correct
6 Correct 472 ms 66096 KB Output is correct
7 Correct 454 ms 66188 KB Output is correct
8 Correct 452 ms 66244 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 48 ms 4232 KB Output is correct
12 Correct 47 ms 4104 KB Output is correct
13 Correct 56 ms 4108 KB Output is correct
14 Correct 47 ms 4184 KB Output is correct
15 Correct 48 ms 4104 KB Output is correct
16 Correct 45 ms 4168 KB Output is correct
17 Correct 41 ms 3256 KB Output is correct
18 Correct 41 ms 3312 KB Output is correct
19 Correct 537 ms 67232 KB Output is correct
20 Correct 500 ms 67336 KB Output is correct
21 Correct 499 ms 67368 KB Output is correct
22 Correct 512 ms 67256 KB Output is correct
23 Correct 521 ms 67236 KB Output is correct
24 Correct 490 ms 67284 KB Output is correct