oj.uz

Submission #875995

# Submission time Handle Problem Language Result Execution time Memory
875995 2023-11-21T03:51:06 Z marvinthang Circle selection (APIO18_circle_selection) C++17
12 / 100
 314 ms 30360 KB 
/*************************************
*    author: marvinthang             *
*    created: 21.11.2023 10:16:16    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

const int INF = 1e9;

struct Circle {
	int x, y, r, idx;
	Circle(int x, int y, int r, int idx): x(x), y(y), r(r), idx(idx) {}
	bool operator < (const Circle &ot) { return pair {r, ot.idx} > pair {ot.r, idx}; }
};

void process(void) {
	int n; cin >> n;
	vector <Circle> circles;
	int min_x = INF, min_y = INF, max_x = 0;
	REP(i, n) {
		int x, y, r; cin >> x >> y >> r;
		circles.emplace_back(x, y, r, i);
		min_x = min(min_x, x);
		min_y = min(min_y, y);
		max_x = max(max_x, x);
	}
	vector <vector <pair <int, int>>> List(1);
	REP(i, n) {
		circles[i].x -= min_x;
		circles[i].y -= min_y;
	}
	sort(ALL(circles));
	REP(i, n) List[0].emplace_back(circles[i].y, i);
	sort(ALL(List[0]));
	int lg = __lg(max_x - min_x) + 1;
	vector <int> res(n, -1);
	auto sqr = [&] (int x) {
		return 1LL * x * x;
	};
	auto intersection = [&] (int i, int j) {
		return sqr(circles[i].x - circles[j].x) + sqr(circles[i].y - circles[j].y) <= sqr(circles[i].r + circles[j].r);
	};
	REP(i, n) if (res[circles[i].idx] < 0) {
		while (lg && circles[i].r <= MASK(lg - 1)) {
			--lg;
			vector <vector <pair <int, int>>> new_list;
			for (auto List: List) {
				vector <vector <pair <int, int>>> cur(2);
				for (auto v: List) if (res[circles[v.se].idx] < 0) cur[(circles[v.se].x >> lg) & 1].push_back(v);
				REP(i, 2) if (!cur[i].empty()) new_list.push_back(cur[i]);
			}
			List = move(new_list);
		}
		auto cmp = [&] (const vector <pair <int, int>> &a, const int &x) { 
			return (circles[a[0].se].x >> lg) < x; 
		};
		for (auto it = lower_bound(ALL(List), (circles[i].x >> lg) - 2, cmp); it != List.end() && cmp(*it, (circles[i].x >> lg) + 3); ++it) {
			for (auto tl = lower_bound(ALL(*it), pair {circles[i].y - circles[i].r, -1}); tl != it->end() && tl->fi <= circles[i].y + circles[i].r; ++tl) 
				if (res[circles[tl->se].idx] < 0 && intersection(tl->se, i)) res[circles[tl->se].idx] = circles[i].idx;
		}

	}
	REP(i, n) cout << res[i] + 1 << ' ';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("circle_selection");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
circle_selection.cpp:105:2: note: in expansion of macro 'file'
  105 |  file("circle_selection");
      |  ^~~~
circle_selection.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
circle_selection.cpp:105:2: note: in expansion of macro 'file'
  105 |  file("circle_selection");
      |  ^~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 600 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 26024 KB Output is correct
2 Correct 127 ms 24564 KB Output is correct
3 Correct 124 ms 27248 KB Output is correct
4 Correct 118 ms 25004 KB Output is correct
5 Correct 154 ms 25320 KB Output is correct
6 Correct 281 ms 28600 KB Output is correct
7 Correct 154 ms 26032 KB Output is correct
8 Correct 178 ms 24760 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 99 ms 9140 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 314 ms 30360 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 600 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 600 KB Output isn't correct
9 Halted 0 ms 0 KB -