Submission #881862

#	Time	Username	Problem	Language	Result	Execution time	Memory
881862		marvinthang	Sweeping (JOI20_sweeping)	C++17	64 / 100	5770 ms	528132 KiB

sweeping

/*************************************
*    author: marvinthang             *
*    created: 02.12.2023 08:47:56    *
*************************************/

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;


#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

void process(void) {
	int n, m, q; cin >> n >> m >> q;
	vector <pair <int, int>> dusts(m); cin >> dusts;
	vector <ordered_set <pair <int, int>>> x_order(q + 1), y_order(q + 1);
	vector <pair <int, int>> pos(1);
	REP(i, dusts.size()) {
		x_order[0].insert(pair{dusts[i].fi, i});
		y_order[0].insert(pair{dusts[i].se, i});
	}
	vector <int> in_set(m);
	map <int, int> px;
	px[0] = 0;
	auto add = [&] (int i, int p) {
		x_order[in_set[i]].erase(pair{dusts[i].fi, i});
		y_order[in_set[i]].erase(pair{dusts[i].se, i});
		in_set[i] = p;
		x_order[p].insert(pair{dusts[i].fi, i});
		y_order[p].insert(pair{dusts[i].se, i});
	};
	while (q--) {
		int t, a; cin >> t >> a;
		if (t == 1) {
			--a;
			cout << max(dusts[a].fi, pos[in_set[a]].fi) << ' ' << max(dusts[a].se, pos[in_set[a]].se) << '\n';
		} else if (t == 2) {
			auto it = prev(px.upper_bound(n - a));
			if (it->fi == n - a) continue;
			int p = it->se;
			int q = pos.size();
			pos.emplace_back(n - a, pos[p].se);
			pos[p].se = a + 1;
			px[n - a] = q;
			if (y_order[p].order_of_key(pair{a + 1, 0}) * 2 <= y_order[p].size()) {
				while (!y_order[p].empty() && y_order[p].begin()->fi <= a) {
					add(y_order[p].begin()->se, q);
				}
			} else {
				while (!y_order[p].empty() && y_order[p].rbegin()->fi > a) {
					add(y_order[p].rbegin()->se, q);
				}
				swap(pos[p], pos[q]);
				swap(px[pos[p].fi], px[pos[q].fi]);
			}
		} else if (t == 3) {
			auto it = prev(px.upper_bound(a + 1));
			if (it->fi == a + 1) continue;
			int p = it->se;
			int q = pos.size();
			pos.emplace_back(a + 1, pos[p].se);
			pos[p].se = n - a;
			px[a + 1] = q;
			if (x_order[p].order_of_key(pair{a + 1, 0}) * 2 <= x_order[p].size()) {
				while (!x_order[p].empty() && x_order[p].begin()->fi <= a) {
					add(x_order[p].begin()->se, q);
				}
				swap(pos[p], pos[q]);
				swap(px[pos[p].fi], px[pos[q].fi]);
			} else {
				while (!x_order[p].empty() && x_order[p].rbegin()->fi > a) {
					add(x_order[p].rbegin()->se, q);
				}
			}
		}
	}
}

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

Compilation message (stderr)

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

• Subtask 1: 0 / 1
• Subtask 2: 0 / 10
• Subtask 3: 11 / 11
• Subtask 4: 53 / 53
• Subtask 5: 0 / 25