제출 #776890

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
776890		marvinthang	Event Hopping 2 (JOI21_event2)	C++17	100 / 100	145 ms	24392 KiB

event2

/*************************************
*    author: marvinthang             *
*    created: 08.07.2023 18:03:51    *
*************************************/

#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--; )
#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 << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int MAX = 2e5 + 5;
const int LOG = 20;

int N, K, L[MAX], R[MAX], nxt[MAX][LOG];

void init(void) {
	cin >> N >> K;
	REP(i, N) cin >> L[i] >> R[i];
}

int countSeg(int l, int r) {
	int res = 0;
	REPD(i, LOG) if (nxt[l][i] <= r) {
		res ^= MASK(i);
		l = nxt[l][i];
	}
	return res;
}

void process(void) {
	vector <int> v;
	REP(i, N) {
		v.push_back(L[i]);
		v.push_back(R[i]);
	}
	sort(ALL(v));
	v.erase(unique(ALL(v)), v.end());
	REP(i, v.size() + 1) nxt[i][0] = v.size();
	REP(i, N) {
		L[i] = lower_bound(ALL(v), L[i]) - v.begin();
		R[i] = lower_bound(ALL(v), R[i]) - v.begin();
		minimize(nxt[L[i]][0], R[i]);
	}
	REPD(i, v.size()) minimize(nxt[i][0], nxt[i + 1][0]);
	FOR(k, 1, LOG) REP(i, v.size() + 1) nxt[i][k] = nxt[nxt[i][k - 1]][k - 1];
	int cnt = countSeg(0, (int) v.size() - 1);
	if (cnt < K) return void(cout << "-1\n");
	map <int, int> mp;
	mp[0] = mp[(int) v.size() - 1] = 0;
	int sz = K;
	REP(i, N) {
		auto it = mp.lower_bound(R[i]);
		int l = prev(it)->se;
		int r = it->fi;
		if (l > L[i]) continue;
		int add = countSeg(l, L[i]) + 1 + countSeg(R[i], r) - countSeg(l, r);
		if (cnt + add >= K) {
			cout << i + 1 << '\n';
			cnt += add;
			mp[L[i]] = R[i];
			if (!--sz) return;
		}
	}
}

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

컴파일 시 표준 에러 (stderr) 메시지

event2.cpp: In function 'int main()':
event2.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
event2.cpp:104:2: note: in expansion of macro 'file'
  104 |  file("event2");
      |  ^~~~
event2.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
event2.cpp:104:2: note: in expansion of macro 'file'
  104 |  file("event2");
      |  ^~~~

• Subtask 1: 7 / 7
• Subtask 2: 1 / 1
• Subtask 3: 31 / 31
• Subtask 4: 61 / 61