Submission #881805

#	Time	Username	Problem	Language	Result	Execution time	Memory
881805		marvinthang	Sweeping (JOI20_sweeping)	C++17	10 / 100	703 ms	63020 KiB

sweeping

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

#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

void process(void) {
	int n, m, q; cin >> n >> m >> q;
	vector <pair <int, int>> dusts(m); cin >> dusts;
	vector <int> len;
	vector <int> last(m);
	vector <pair <int, int>> queries, events;
	int cnt = 0;
	REP(i, q) {
		int t, a; cin >> t >> a;
		if (t == 1) {
			--a;
			queries.emplace_back(a, cnt);
			events.emplace_back(dusts[a].se, -(int) queries.size());
		} else if (t == 2) {
			events.emplace_back(a, cnt++);
		} else {
			int b; cin >> b;
			last.push_back(cnt);
			dusts.emplace_back(a, b);
		}
	}
	sort(events.rbegin(), events.rend());
	vector <int> st(cnt * 4 + 23, n);
	function<void(int, int, int, int, int)> update = [&] (int i, int l, int r, int p, int v) {
		if (r - l == 1) {
			st[i] = v;
			return;
		}
		int m = l + r >> 1;
		if (p < m) update(i << 1, l, m, p, v);
		else update(i << 1 | 1, m, r, p, v);
		st[i] = min(st[i << 1], st[i << 1 | 1]);
	};
	function<int(int, int, int, int, int)> get = [&] (int i, int l, int r, int u, int v) {
		if (l >= v || r <= u) return n;
		if (u <= l && r <= v) {
			return st[i];
		}
		int m = l + r >> 1;
		return min(get(i << 1, l, m, u, v), get(i << 1 | 1, m, r, u, v));
	};
	vector <pair <int, int>> res(queries.size());
	for (auto [y, i]: events) {
		if (i >= 0) {
			update(1, 0, cnt, i, y);
		} else {
			i = -i - 1;
			int a = queries[i].fi;
			int v = get(1, 0, cnt, last[a], queries[i].se);
			res[i] = dusts[a];
			res[i].fi = max(res[i].fi, n - v);
		}
	}
	REP(i, queries.size()) cout << res[i].fi << ' ' << res[i].se << '\n';
}

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 lambda function:
sweeping.cpp:73:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   73 |   int m = l + r >> 1;
      |           ~~^~~
sweeping.cpp: In lambda function:
sweeping.cpp:83:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   83 |   int m = l + r >> 1;
      |           ~~^~~
sweeping.cpp: In function 'int main()':
sweeping.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sweeping.cpp:103:2: note: in expansion of macro 'file'
  103 |  file("JOI20_sweeping");
      |  ^~~~
sweeping.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sweeping.cpp:103:2: note: in expansion of macro 'file'
  103 |  file("JOI20_sweeping");
      |  ^~~~

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