oj.uz

Submission #417156

# Submission time Handle Problem Language Result Execution time Memory
417156 2021-06-03T12:18:00 Z pavement Event Hopping 2 (JOI21_event2) C++17
1 / 100
 568 ms 90700 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<iii, null_type, greater<iii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, K, L[500005], R[500005], A[500005], ft2[500005], ft3[500005];
bool rec;
vector<int> ans, v;
set<ii> cfm;
multiset<ii> ft[500005];
set<iii> S;
vector<iii> tmp;

bool intersect(int a, int b, int c, int d) {
	if (a > c) swap(a, c), swap(b, d);
	return b > c;
}

inline int ls(int x) { return x & -x; }

ii qry(int p) {
	ii ret = mp(LLONG_MAX, LLONG_MAX);
	for (; p <= 2 * N; p += ls(p))
		if (!ft[p].empty()) ret = min(ret, *ft[p].begin());
	return ret;
}

void potadd(int x) {
	for (int p = L[x]; p; p -= ls(p))
		ft[p].emplace(R[x], x);
}

void potdel(int x) {
	for (int p = L[x]; p; p -= ls(p)) {
		assert(ft[p].find(mp(R[x], x)) != ft[p].end());
		ft[p].erase(ft[p].find(mp(R[x], x)));
	}
}

int ft2_qry(int p) {
	int r = 0;
	for (; p; p -= ls(p)) r += ft2[p];
	return r;
}

void ft2_upd(int p, int v) {
	for (; p <= 2 * N; p += ls(p)) ft2[p] += v;
}

int ft3_qry(int p) {
	p = 2 * N - p + 1;
	int r = 0;
	for (; p; p -= ls(p)) r += ft3[p];
	return r;
}

void ft3_upd(int p, int v) {
	p = 2 * N - p + 1;
	for (; p <= 2 * N; p += ls(p)) ft3[p] += v;
}

void addseg(int x) {
	int lim;
	auto it = S.lower_bound(mt(R[x], 0ll, 0ll));
	if (it == S.end()) lim = LLONG_MAX;
	else lim = g0(*it);
	vector<set<iii>::iterator> todel;
	while (1) {
		if (it == S.begin()) break;
		--it;
		if (intersect(g0(*it), g1(*it), L[x], R[x])) {
			ft2_upd(g1(*it), -1);
			ft3_upd(g0(*it), -1);
			potadd(g2(*it));
			todel.pb(it);
		} else break;
	}
	for (auto i : todel) S.erase(i);
	ft2_upd(R[x], 1);
	ft3_upd(L[x], 1);
	S.emplace(L[x], R[x], x);
	potdel(x);
	auto tmp = qry(R[x]);
	if (tmp.second != LLONG_MAX && tmp.first <= lim) {
		assert(!rec);
		rec = 1;
		addseg(tmp.second);
		rec = 0;
	}
}

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> K;
	for (int i = 1; i <= N; i++) cin >> L[i] >> R[i], v.pb(L[i]), v.pb(R[i]);
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for (int i = 1; i <= N; i++) {
		L[i] = lower_bound(v.begin(), v.end(), L[i]) - v.begin() + 1;
		R[i] = lower_bound(v.begin(), v.end(), R[i]) - v.begin() + 1;
		tmp.eb(R[i], L[i], i);
	}
	sort(tmp.begin(), tmp.end());
	int lastr = LLONG_MIN;
	for (int i = 1; i <= N; i++) potadd(i);
	for (auto [r, l, i] : tmp)
		if (lastr <= l) {
			ft2_upd(R[i], 1);
			ft3_upd(L[i], 1);
			S.emplace(l, r, i);
			potdel(i);
			lastr = r;
		}
	if (S.size() < K) return cout << "-1\n", 0;
	for (int i = 1; i <= N; i++) {
		auto it = cfm.lower_bound(mp(R[i], 0ll));
		bool yep = 1;
		if (it != cfm.begin()) {
			--it;
			if (intersect(it->first, it->second, L[i], R[i])) yep = 0;
		}
		if (!yep) continue;
		A[i] = ft2_qry(L[i]) + ft3_qry(R[i]) + 1;
		auto tmp = qry(R[i]);
		auto it2 = S.lower_bound(mt(R[i], 0ll, 0ll));
		if (tmp.second != LLONG_MAX && (it2 == S.end() || tmp.first <= g0(*it2))) A[i]++;
		if (A[i] >= K) {
			cfm.emplace(L[i], R[i]);
			ans.pb(i);
			addseg(i);
		}
	}
	assert(ans.size() >= K);
	for (int i = 0; i < K; i++) cout << ans[i] << '\n';
}

Compilation message

event2.cpp:114:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  114 | main() {
      | ^~~~
event2.cpp: In function 'int main()':
event2.cpp:137:15: warning: comparison of integer expressions of different signedness: 'std::set<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  137 |  if (S.size() < K) return cout << "-1\n", 0;
      |      ~~~~~~~~~^~~
In file included from /usr/include/c++/10/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp:45,
                 from /usr/include/c++/10/ext/pb_ds/detail/container_base_dispatch.hpp:90,
                 from /usr/include/c++/10/ext/pb_ds/assoc_container.hpp:48,
                 from event2.cpp:2:
event2.cpp:156:20: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  156 |  assert(ans.size() >= K);
      |         ~~~~~~~~~~~^~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23796 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23796 KB Output is correct
4 Correct 550 ms 88988 KB Output is correct
5 Correct 552 ms 89128 KB Output is correct
6 Correct 565 ms 90032 KB Output is correct
7 Correct 565 ms 89688 KB Output is correct
8 Correct 539 ms 88688 KB Output is correct
9 Correct 568 ms 90700 KB Output is correct
10 Correct 557 ms 89772 KB Output is correct
11 Correct 555 ms 89652 KB Output is correct
12 Incorrect 563 ms 88600 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23728 KB Output is correct
3 Correct 13 ms 23756 KB Output is correct
4 Correct 14 ms 23764 KB Output is correct
5 Correct 14 ms 23840 KB Output is correct
6 Correct 16 ms 23792 KB Output is correct
7 Correct 14 ms 23804 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23756 KB Output is correct
10 Correct 13 ms 23776 KB Output is correct
11 Correct 13 ms 23716 KB Output is correct
12 Correct 13 ms 23756 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 13 ms 23756 KB Output is correct
15 Correct 13 ms 23752 KB Output is correct
16 Correct 13 ms 23756 KB Output is correct
17 Correct 15 ms 23748 KB Output is correct
18 Correct 13 ms 23756 KB Output is correct
19 Correct 14 ms 23836 KB Output is correct
20 Correct 15 ms 23836 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Correct 15 ms 23848 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 13 ms 23756 KB Output is correct
26 Correct 14 ms 23756 KB Output is correct
27 Correct 13 ms 23756 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23728 KB Output is correct
3 Correct 13 ms 23756 KB Output is correct
4 Correct 14 ms 23764 KB Output is correct
5 Correct 14 ms 23840 KB Output is correct
6 Correct 16 ms 23792 KB Output is correct
7 Correct 14 ms 23804 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23756 KB Output is correct
10 Correct 13 ms 23776 KB Output is correct
11 Correct 13 ms 23716 KB Output is correct
12 Correct 13 ms 23756 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 13 ms 23756 KB Output is correct
15 Correct 13 ms 23752 KB Output is correct
16 Correct 13 ms 23756 KB Output is correct
17 Correct 15 ms 23748 KB Output is correct
18 Correct 13 ms 23756 KB Output is correct
19 Correct 14 ms 23836 KB Output is correct
20 Correct 15 ms 23836 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Correct 15 ms 23848 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 13 ms 23756 KB Output is correct
26 Correct 14 ms 23756 KB Output is correct
27 Correct 13 ms 23756 KB Output is correct
28 Correct 19 ms 25160 KB Output is correct
29 Correct 19 ms 25228 KB Output is correct
30 Correct 19 ms 25180 KB Output is correct
31 Correct 20 ms 25140 KB Output is correct
32 Correct 20 ms 25144 KB Output is correct
33 Correct 19 ms 25120 KB Output is correct
34 Correct 19 ms 25164 KB Output is correct
35 Correct 27 ms 25364 KB Output is correct
36 Correct 31 ms 25428 KB Output is correct
37 Correct 29 ms 25432 KB Output is correct
38 Correct 21 ms 25184 KB Output is correct
39 Correct 27 ms 25324 KB Output is correct
40 Correct 26 ms 25368 KB Output is correct
41 Correct 26 ms 25288 KB Output is correct
42 Correct 21 ms 25268 KB Output is correct
43 Incorrect 23 ms 25292 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23796 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23796 KB Output is correct
4 Correct 550 ms 88988 KB Output is correct
5 Correct 552 ms 89128 KB Output is correct
6 Correct 565 ms 90032 KB Output is correct
7 Correct 565 ms 89688 KB Output is correct
8 Correct 539 ms 88688 KB Output is correct
9 Correct 568 ms 90700 KB Output is correct
10 Correct 557 ms 89772 KB Output is correct
11 Correct 555 ms 89652 KB Output is correct
12 Incorrect 563 ms 88600 KB Output isn't correct
13 Halted 0 ms 0 KB -