oj.uz

답안 #349401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
349401 2021-01-17T14:18:10 Z sinamhdv Park (BOI16_park) C++11
27 / 100
 1732 ms 748 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1000 * 1000 * 1000;
const ll LINF = (ll)INF * INF;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define msub(a, b) ((mod + ((ll)(a) - (b)) % mod) % mod)
#define mdiv(a, b) ((ll)(a) * poww((b), mod - 2) % mod)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

#define MAXN 2020

int n, m;
int w, h;
int tx[MAXN], ty[MAXN], tr[MAXN];
int ans[5][5];
int cn;
int comp[MAXN];

int crad;

bool olap(int a, int b)
{
	if (a > n && b > n)
		return false;
	if (a > b)
		swap(a, b);
	if (b > n)	// C - L
	{
		b -= n;
		int d;
		if (b == 1)
			d = ty[a] - crad;
		else if (b== 2)
			d = w - tx[a] - crad;
		else if (b == 3)
			d = h - ty[a] - crad;
		else if (b == 4)
			d = tx[a] - crad;

		return (tr[a] + crad > d);
	}
	else	// C - C
	{
		int dx = abs(tx[a] - tx[b]);
		int dy = abs(ty[a] - ty[b]);
		int dr = tr[a] + tr[b] + 2 * crad;
		return ((ll)dr * dr > (ll)dx*dx + (ll)dy*dy);
	}
}

void dfs(int v)
{
	comp[v] = cn;
	FOR(i, 1, n + 5)
	{
		if (comp[i] || !olap(v, i))
			continue;
		dfs(i);
	}
}

bool check(int r, int src, int dst)
{
	memset(comp, 0, sizeof(comp));
	cn = 0;

	crad = r;

	FOR(i, 1, n + 5)
	{
		if (!comp[i])
		{
			cn++;
			dfs(i);
		}
	}

	//dbgr(comp + 1, comp + n + 5);

	dbgr(comp + n + 1, comp + n + 5);

	if (abs(src - dst) == 2)
	{
		int x1 = src + n;
		int x2 = (src % 4) + 1 + n;
		int y1 = dst + n;
		int y2 = (dst % 4) + 1 + n;

		dbg(src);
		dbg(dst);
		//cout << x1 << ' ' << x2 << ' ' << y1 << ' ' << y2 << endl;

		return (comp[x1] != comp[y2] && comp[x1] != comp[y1] && comp[x2] != comp[y1] && comp[x2] != comp[y2]);
	}
	else
	{
		if (src > dst)
			swap(src, dst);
		if (src == 1 && dst == 4)
			swap(src, dst);

		dbg(src);
		dbg(dst);

		bool res = true;
		FOR(i, 1, 5)
			if (i != src)
				res &= (comp[src + n] != comp[i + n]);
		return res;
	}
}

int32_t main(void)
{
	//fast_io;
	scanf("%d %d %d %d", &n, &m, &w, &h);
	FOR(i, 1, n + 1)
	{
		scanf("%d %d %d", tx + i, ty + i, tr + i);
	}
/*
	while (true)
	{
		int s, d, r;
		cin >> r >> s >> d;
		cout << check(r, s, d) << endl << flush;
	}
	*/

	int e1, r;
	scanf("%d %d", &r, &e1);

	FOR(e2, 1, 5)
	{
		if (e2 ==e1)
			continue;
	int l = 1, r = INF + 10;
	if (!check(l, e1, e2))
	{
		ans[e1][e2] = -1;
		continue;
	}
	while (r - l > 1)
	{
		int mid = (r + l) / 2;
		if (check(mid, e1, e2))
			l = mid;
		else
			r = mid;
	}
	ans[e1][e2] = l;
	}


	while (m--)
	{
		int e = e1;
		char res[8] = {0,0,0,0,0,0,0,0};
		char *ptr = res;
		FOR(i, 1, 5)
		{
			if (e == i || ans[e][i] >= r || ans[i][e] >= r)
				*ptr++ = (i + '0');
		}
		puts(res);
	}
	return 0;
}

Compilation message

park.cpp: In function 'int32_t main()':
park.cpp:135:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  135 |  scanf("%d %d %d %d", &n, &m, &w, &h);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
park.cpp:138:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  138 |   scanf("%d %d %d", tx + i, ty + i, tr + i);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
park.cpp:150:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  150 |  scanf("%d %d", &r, &e1);
      |  ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1706 ms 456 KB Output is correct
2 Correct 1693 ms 456 KB Output is correct
3 Correct 1682 ms 492 KB Output is correct
4 Correct 1717 ms 456 KB Output is correct
5 Correct 1732 ms 492 KB Output is correct
6 Correct 1699 ms 492 KB Output is correct
7 Correct 915 ms 364 KB Output is correct
8 Correct 728 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1706 ms 456 KB Output is correct
2 Correct 1693 ms 456 KB Output is correct
3 Correct 1682 ms 492 KB Output is correct
4 Correct 1717 ms 456 KB Output is correct
5 Correct 1732 ms 492 KB Output is correct
6 Correct 1699 ms 492 KB Output is correct
7 Correct 915 ms 364 KB Output is correct
8 Correct 728 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Incorrect 23 ms 748 KB Output isn't correct
12 Halted 0 ms 0 KB -