oj.uz

답안 #106824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106824 2019-04-20T16:04:28 Z polyfish 새 집 (APIO18_new_home) C++14
12 / 100
 5000 ms 101460 KB 
//Pantyhose(black) + glasses = infinity

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

#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) {cerr << #A << " = "; for (int _=1; _<=n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; for (int _=0; _<n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define FILE_NAME "new_home"

const int MAX_N = 300002;
const int INF = 1e9+100;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

struct treap {

	struct item {
		int L, R, max_r, prior;
		item *l, *r;

		item(int L=0, int R=0): L(L), R(R) {
			max_r = R;
			prior = uniform_int_distribution<int>(1, INF)(rng);
//			prior = 1;
            l = r = nullptr;
		}
	};

	typedef item * pitem;

	pitem root = nullptr;

	int get_max_r(pitem t) {
		return t ? t->max_r : 0;
	}

	void upd(pitem t) {
		if (t)
			t->max_r = max(t->R, max(get_max_r(t->l), get_max_r(t->r)));
	}

	void split(pitem t, pitem &l, pitem &r, int key) {
		if (!t) {
			l = r = nullptr;
		}
		else {
			if (key>t->L)
				split(t->r, t->r, r, key), l = t;
			else
				split(t->l, l, t->l, key), r = t;
		}

		upd(t);
	}

	void merge(pitem &t, pitem l, pitem r) {
		if (!l || !r) {
			t = l ? l : r;
		}
		else {
			if (l->prior>r->prior)
				merge(l->r, l->r, r), t = l;
			else
				merge(r->l, l, r->l), t = r;
		}

		upd(t);
	}

	void insert(pitem &t, pitem it) {
		if (!t) {
			t = it;
		}
		else {
			if (it->prior>t->prior)
				split(t, it->l, it->r, it->L), t = it;
			else
				insert(it->L<t->L ? t->l : t->r, it);
		}

		upd(t);
	}

	void erase(pitem &t, int L, int R) {
		if (!t)
			return;

		if (t->L==L && t->R==R)
			merge(t, t->l, t->r);
		else
			erase(L<t->L ? t->l : t->r, L, R);

		upd(t);
	}

	int get(pitem t, int L) {
		if (!t)
			return -INF;

		if (L<t->L)
			return get(t->l, L);

		return max(max(t->R, get_max_r(t->l)), get(t->r, L));
	}

	void insert(int L, int R) {
		insert(root, new item(L, R));
	}

	void erase(int L, int R) {
		erase(root, L, R);
	}

	int get(int L) {
		return get(root, L);
	}
};

struct store {
	int x, t, a, b;
};

struct query {
	int l, y;
};

int n, k, nQueries, res[MAX_N];
vector<int> T, store_event[MAX_N*2], q[MAX_N*2];
store s[MAX_N];
query Q[MAX_N];
map<int, int> pos[MAX_N*2];
treap interval_set;

void read_input() {
	cin >> n >> k >> nQueries;

	for (int i=1; i<=n; ++i)
		cin >> s[i].x >> s[i].t >> s[i].a >> s[i].b;

	for (int i=1; i<=nQueries; ++i) {
		cin >> Q[i].l >> Q[i].y;
	}
}

void compress() {
	for (int i=1; i<=n; ++i) {
		T.push_back(s[i].a);
		T.push_back(s[i].b);
	}

	for (int i=1; i<=nQueries; ++i)
		T.push_back(Q[i].y);

	sort(T.begin(), T.end());
	T.resize(unique(T.begin(), T.end()) - T.begin());

	#define get_pos(P, x) lower_bound(P.begin(), P.end(), x) - P.begin() + 1
	for (int i=1; i<=n; ++i) {
		s[i].a = get_pos(T, s[i].a);
		s[i].b = get_pos(T, s[i].b);
	}

	for (int i=1; i<=nQueries; ++i)
		Q[i].y = get_pos(T, Q[i].y);
	#undef uniq
}

void init() {
	for (int i=1; i<=n; ++i) {
		store_event[s[i].a].push_back(i);
		store_event[s[i].b+1].push_back(-i);
	}

	for (int i=1; i<=nQueries; ++i) {
		q[Q[i].y].push_back(i);
	}

	for (int i=1; i<=k; ++i) {
		++pos[i][-INF];
		++pos[i][INF];
		interval_set.insert(-INF, INF);
	}
}

void add_store(int idx) {
	++pos[s[idx].t][s[idx].x];

	if (pos[s[idx].t][s[idx].x]==1) {
		auto u = pos[s[idx].t].lower_bound(s[idx].x);
		--u;
		auto v = pos[s[idx].t].upper_bound(s[idx].x);
//		debug(u->first);
//        debug(v->first);

		interval_set.erase(u->first, v->first);
		interval_set.insert(u->first, s[idx].x);
		interval_set.insert(s[idx].x, v->first);
	}
}

void remove_store(int idx) {
	--pos[s[idx].t][s[idx].x];

	if (!pos[s[idx].t][s[idx].x]) {
		auto u = pos[s[idx].t].lower_bound(s[idx].x);
		--u;
		auto v = pos[s[idx].t].upper_bound(s[idx].x);
//        debug(u->first);
//        debug(v->first);

		interval_set.erase(u->first, s[idx].x);
		interval_set.erase(s[idx].x, v->first);
		interval_set.insert(u->first, v->first);
        pos[s[idx].t].erase(s[idx].x);
	}
}

int bisect(int x) {
	int l = 0, r = 2e8;

	for (int mid=(l+r)/2; mid!=l && r!=mid; mid=(l+r)/2) {
		if (interval_set.get(x-mid-1)>x+mid)
			l = mid;
		else
			r = mid;
	}

	for (int i=l; i<=r; ++i) {
		if (interval_set.get(x-i-1)<=x+i)
			return i;
	}

	return -1;
}

void solve() {
	for (int i=1; i<=T.size(); ++i) {
		for (auto x : store_event[i]) {
			if (x>0)
				add_store(x);
			else
				remove_store(-x);
		}

//		debug(interval_set.get(0));
		for (auto x : q[i])
			res[x] = bisect(Q[x].l);
	}

	for (int i=1; i<=nQueries; ++i)
		cout << res[i] << '\n';
}

int main() {
	#ifdef GLASSES_GIRL
		freopen(FILE_NAME".in", "r", stdin);
//		freopen(FILE_NAME".out", "w", stdout);
	#endif
	ios::sync_with_stdio(0); cin.tie(0);

	read_input();
	compress();
	init();
	solve();
}

Compilation message

new_home.cpp: In function 'void solve()':
new_home.cpp:239:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=1; i<=T.size(); ++i) {
                ~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 56696 KB Output is correct
2 Correct 56 ms 56696 KB Output is correct
3 Correct 53 ms 56696 KB Output is correct
4 Correct 58 ms 56824 KB Output is correct
5 Correct 58 ms 56824 KB Output is correct
6 Correct 62 ms 56796 KB Output is correct
7 Correct 91 ms 56960 KB Output is correct
8 Correct 68 ms 56812 KB Output is correct
9 Correct 80 ms 56952 KB Output is correct
10 Correct 60 ms 56780 KB Output is correct
11 Correct 59 ms 56824 KB Output is correct
12 Correct 56 ms 56824 KB Output is correct
13 Correct 57 ms 56824 KB Output is correct
14 Correct 58 ms 56828 KB Output is correct
15 Correct 70 ms 57028 KB Output is correct
16 Correct 64 ms 56952 KB Output is correct
17 Correct 60 ms 56828 KB Output is correct
18 Correct 61 ms 56856 KB Output is correct
19 Correct 62 ms 56824 KB Output is correct
20 Correct 58 ms 56824 KB Output is correct
21 Correct 81 ms 56824 KB Output is correct
22 Correct 87 ms 56952 KB Output is correct
23 Correct 66 ms 56916 KB Output is correct
24 Correct 63 ms 56824 KB Output is correct
25 Correct 69 ms 56824 KB Output is correct
26 Correct 60 ms 56824 KB Output is correct
27 Correct 60 ms 56824 KB Output is correct
28 Correct 59 ms 56832 KB Output is correct
29 Correct 58 ms 56824 KB Output is correct
30 Correct 60 ms 56824 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 56696 KB Output is correct
2 Correct 56 ms 56696 KB Output is correct
3 Correct 53 ms 56696 KB Output is correct
4 Correct 58 ms 56824 KB Output is correct
5 Correct 58 ms 56824 KB Output is correct
6 Correct 62 ms 56796 KB Output is correct
7 Correct 91 ms 56960 KB Output is correct
8 Correct 68 ms 56812 KB Output is correct
9 Correct 80 ms 56952 KB Output is correct
10 Correct 60 ms 56780 KB Output is correct
11 Correct 59 ms 56824 KB Output is correct
12 Correct 56 ms 56824 KB Output is correct
13 Correct 57 ms 56824 KB Output is correct
14 Correct 58 ms 56828 KB Output is correct
15 Correct 70 ms 57028 KB Output is correct
16 Correct 64 ms 56952 KB Output is correct
17 Correct 60 ms 56828 KB Output is correct
18 Correct 61 ms 56856 KB Output is correct
19 Correct 62 ms 56824 KB Output is correct
20 Correct 58 ms 56824 KB Output is correct
21 Correct 81 ms 56824 KB Output is correct
22 Correct 87 ms 56952 KB Output is correct
23 Correct 66 ms 56916 KB Output is correct
24 Correct 63 ms 56824 KB Output is correct
25 Correct 69 ms 56824 KB Output is correct
26 Correct 60 ms 56824 KB Output is correct
27 Correct 60 ms 56824 KB Output is correct
28 Correct 59 ms 56832 KB Output is correct
29 Correct 58 ms 56824 KB Output is correct
30 Correct 60 ms 56824 KB Output is correct
31 Correct 2520 ms 74816 KB Output is correct
32 Correct 153 ms 61040 KB Output is correct
33 Correct 926 ms 74064 KB Output is correct
34 Correct 2394 ms 74400 KB Output is correct
35 Correct 1519 ms 74736 KB Output is correct
36 Correct 1124 ms 74696 KB Output is correct
37 Correct 661 ms 74064 KB Output is correct
38 Correct 656 ms 74224 KB Output is correct
39 Correct 388 ms 74152 KB Output is correct
40 Correct 405 ms 74096 KB Output is correct
41 Correct 1598 ms 74160 KB Output is correct
42 Correct 3360 ms 73980 KB Output is correct
43 Correct 3198 ms 61804 KB Output is correct
44 Correct 1363 ms 74260 KB Output is correct
45 Correct 724 ms 74200 KB Output is correct
46 Correct 400 ms 74108 KB Output is correct
47 Correct 346 ms 73516 KB Output is correct
48 Correct 316 ms 73196 KB Output is correct
49 Correct 473 ms 73456 KB Output is correct
50 Correct 1604 ms 74080 KB Output is correct
51 Correct 367 ms 73456 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5034 ms 84492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5041 ms 101460 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 56696 KB Output is correct
2 Correct 56 ms 56696 KB Output is correct
3 Correct 53 ms 56696 KB Output is correct
4 Correct 58 ms 56824 KB Output is correct
5 Correct 58 ms 56824 KB Output is correct
6 Correct 62 ms 56796 KB Output is correct
7 Correct 91 ms 56960 KB Output is correct
8 Correct 68 ms 56812 KB Output is correct
9 Correct 80 ms 56952 KB Output is correct
10 Correct 60 ms 56780 KB Output is correct
11 Correct 59 ms 56824 KB Output is correct
12 Correct 56 ms 56824 KB Output is correct
13 Correct 57 ms 56824 KB Output is correct
14 Correct 58 ms 56828 KB Output is correct
15 Correct 70 ms 57028 KB Output is correct
16 Correct 64 ms 56952 KB Output is correct
17 Correct 60 ms 56828 KB Output is correct
18 Correct 61 ms 56856 KB Output is correct
19 Correct 62 ms 56824 KB Output is correct
20 Correct 58 ms 56824 KB Output is correct
21 Correct 81 ms 56824 KB Output is correct
22 Correct 87 ms 56952 KB Output is correct
23 Correct 66 ms 56916 KB Output is correct
24 Correct 63 ms 56824 KB Output is correct
25 Correct 69 ms 56824 KB Output is correct
26 Correct 60 ms 56824 KB Output is correct
27 Correct 60 ms 56824 KB Output is correct
28 Correct 59 ms 56832 KB Output is correct
29 Correct 58 ms 56824 KB Output is correct
30 Correct 60 ms 56824 KB Output is correct
31 Correct 2520 ms 74816 KB Output is correct
32 Correct 153 ms 61040 KB Output is correct
33 Correct 926 ms 74064 KB Output is correct
34 Correct 2394 ms 74400 KB Output is correct
35 Correct 1519 ms 74736 KB Output is correct
36 Correct 1124 ms 74696 KB Output is correct
37 Correct 661 ms 74064 KB Output is correct
38 Correct 656 ms 74224 KB Output is correct
39 Correct 388 ms 74152 KB Output is correct
40 Correct 405 ms 74096 KB Output is correct
41 Correct 1598 ms 74160 KB Output is correct
42 Correct 3360 ms 73980 KB Output is correct
43 Correct 3198 ms 61804 KB Output is correct
44 Correct 1363 ms 74260 KB Output is correct
45 Correct 724 ms 74200 KB Output is correct
46 Correct 400 ms 74108 KB Output is correct
47 Correct 346 ms 73516 KB Output is correct
48 Correct 316 ms 73196 KB Output is correct
49 Correct 473 ms 73456 KB Output is correct
50 Correct 1604 ms 74080 KB Output is correct
51 Correct 367 ms 73456 KB Output is correct
52 Execution timed out 5106 ms 70108 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 56696 KB Output is correct
2 Correct 56 ms 56696 KB Output is correct
3 Correct 53 ms 56696 KB Output is correct
4 Correct 58 ms 56824 KB Output is correct
5 Correct 58 ms 56824 KB Output is correct
6 Correct 62 ms 56796 KB Output is correct
7 Correct 91 ms 56960 KB Output is correct
8 Correct 68 ms 56812 KB Output is correct
9 Correct 80 ms 56952 KB Output is correct
10 Correct 60 ms 56780 KB Output is correct
11 Correct 59 ms 56824 KB Output is correct
12 Correct 56 ms 56824 KB Output is correct
13 Correct 57 ms 56824 KB Output is correct
14 Correct 58 ms 56828 KB Output is correct
15 Correct 70 ms 57028 KB Output is correct
16 Correct 64 ms 56952 KB Output is correct
17 Correct 60 ms 56828 KB Output is correct
18 Correct 61 ms 56856 KB Output is correct
19 Correct 62 ms 56824 KB Output is correct
20 Correct 58 ms 56824 KB Output is correct
21 Correct 81 ms 56824 KB Output is correct
22 Correct 87 ms 56952 KB Output is correct
23 Correct 66 ms 56916 KB Output is correct
24 Correct 63 ms 56824 KB Output is correct
25 Correct 69 ms 56824 KB Output is correct
26 Correct 60 ms 56824 KB Output is correct
27 Correct 60 ms 56824 KB Output is correct
28 Correct 59 ms 56832 KB Output is correct
29 Correct 58 ms 56824 KB Output is correct
30 Correct 60 ms 56824 KB Output is correct
31 Correct 2520 ms 74816 KB Output is correct
32 Correct 153 ms 61040 KB Output is correct
33 Correct 926 ms 74064 KB Output is correct
34 Correct 2394 ms 74400 KB Output is correct
35 Correct 1519 ms 74736 KB Output is correct
36 Correct 1124 ms 74696 KB Output is correct
37 Correct 661 ms 74064 KB Output is correct
38 Correct 656 ms 74224 KB Output is correct
39 Correct 388 ms 74152 KB Output is correct
40 Correct 405 ms 74096 KB Output is correct
41 Correct 1598 ms 74160 KB Output is correct
42 Correct 3360 ms 73980 KB Output is correct
43 Correct 3198 ms 61804 KB Output is correct
44 Correct 1363 ms 74260 KB Output is correct
45 Correct 724 ms 74200 KB Output is correct
46 Correct 400 ms 74108 KB Output is correct
47 Correct 346 ms 73516 KB Output is correct
48 Correct 316 ms 73196 KB Output is correct
49 Correct 473 ms 73456 KB Output is correct
50 Correct 1604 ms 74080 KB Output is correct
51 Correct 367 ms 73456 KB Output is correct
52 Execution timed out 5034 ms 84492 KB Time limit exceeded
53 Halted 0 ms 0 KB -