oj.uz

답안 #545649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
545649 2022-04-05T05:14:21 Z 8e7 새 집 (APIO18_new_home) C++17
47 / 100
 4276 ms 160800 KB 
//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 60005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
const int inf = 2e8;
struct store{
	int x, a, b;
	store(){x = a = b = 0;}
	store(int u, int v, int w){x = u, a = v, b = w;}
};
vector<store> seg[maxn];

struct query{
	int x, ti, id;
	query(){x = ti = id = 0;}
} que[maxn];

int ans[maxn];
struct event{
	int x, val, l, r, ch;
	event(){x = val = l = r = ch = 0;}
	event(int a, int b, int c, int d, int e){x = a, val = b, l = c, r = d, ch = e;}
};
vector<event> lev, rev;
struct segtree{
	int type; //1: max, 0:min
	multiset<int> seg[4*maxn];
	void modify(int cur, int l, int r, int ql, int qr, int v, int ch) {
		if (r <= l || ql >= r || qr <= l || qr == ql) return;
		
		if (ql <= l && qr >= r) {
			if (ch == 1) seg[cur].insert(v);
			else seg[cur].erase(seg[cur].find(v));
			return;
		}
		int m = (l + r) / 2;
		modify(cur*2, l, m, ql, qr, v, ch);
		modify(cur*2+1, m, r, ql, qr, v, ch);
	}	
	int query(int cur, int l, int r, int ind) {
		if (r <= l || ind >= r || ind < l) return type ? -inf : inf;
		int val;
		if (type) val = (seg[cur].size() ? *prev(seg[cur].end()) : -inf);
		else val = (seg[cur].size() ? *seg[cur].begin() : inf);
		if (r - l == 1) return val;
		int m = (l + r) / 2, rec;
		if (ind < m) rec = query(cur*2, l, m, ind);
		else rec = query(cur*2+1, m, r, ind);
		return type ? max(val, rec) : min(val, rec);
	}	
} ltr, rtr;


int main() {
	io
	int n, k, q;
	cin >> n >> k >> q;
	vector<int> tv;
	for (int i = 1;i <= k;i++) seg[i].push_back(store(-inf, 0, inf));
	for (int i = 0;i < n;i++) {
		store s;
		int ty;
		cin >> s.x >> ty >> s.a >> s.b;		
		s.b++;
		//tv.push_back(s.a), tv.push_back(s.b);	
		seg[ty].push_back(s);
	}
	for (int i = 1;i <= k;i++) seg[i].push_back(store(inf, 0, inf));
	for (int i = 0;i < q;i++) {
		cin >> que[i].x >> que[i].ti;
		que[i].id = i;
		tv.push_back(que[i].ti);
	}
	sort(tv.begin(), tv.end());
	tv.resize(int(unique(tv.begin(), tv.end()) - tv.begin()));
	//pary(tv.begin(), tv.end());
	auto conv = [&] (int x){
		return lower_bound(tv.begin(), tv.end(), x) - tv.begin();
	};
	for (int i = 1;i <= k;i++) {
		set<pii> se;

		debug("type", i);
		auto add_seg = [&] (int l, int r, int u, int d) {
			if (d <= u) return;
			int m = (l + r + 1) / 2;	
			debug("seg", l, r, u, d);
			lev.push_back(event(l, l, u, d, 1));
			lev.push_back(event(m, l, u, d, -1));
			rev.push_back(event(m, r, u, d, 1));
			rev.push_back(event(r, r, u, d, -1));
		};
		sort(seg[i].begin(), seg[i].end(), [&] (store x, store y){return x.x < y.x;});
		for (auto &p:seg[i]) {
			p.a = conv(p.a), p.b = conv(p.b);	
			if (se.empty()) {
				se.insert({p.a, p.x});
				se.insert({p.b+1, p.x});
			} else {
				if (p.a == p.b) continue;
				auto it = se.lower_bound(make_pair(p.a, -inf));	
				int cur = p.a;
				while (it != se.end() && it->ff <= p.b) {
					if (it != se.begin()) add_seg(prev(it)->ss, p.x, cur, it->ff);
					cur = it->ff;
					it = next(it);
				}
				if (it != se.begin()) add_seg(prev(it)->ss, p.x, cur, p.b);

				it = se.lower_bound(make_pair(p.a, -inf));
				int last = prev(it)->ss;
				while (it != se.end() && it->ff < p.b) {
					last = it->ss;	
					se.erase(it);
					it = se.lower_bound(make_pair(p.a, -inf));
				}
				se.insert(make_pair(p.a, p.x));
				if (it->ff > p.b) {
					se.insert(make_pair(p.b, last));	
				}
			}
		}	
	}
	for (int i = 0;i < q;i++) que[i].ti = conv(que[i].ti);	
	sort(que, que + q, [&] (query x, query y){return x.x < y.x;});		
	sort(lev.begin(), lev.end(), [&] (event x, event y){return x.x == y.x ? x.ch > y.ch : x.x < y.x;});
	sort(rev.begin(), rev.end(), [&] (event x, event y){return x.x == y.x ? x.ch > y.ch : x.x < y.x;});

	int lid = 0, rid = 0;
	rtr.type = 1;
	for (int i = 0;i < q;i++) {
		query cur = que[i];
		while (lid < lev.size() && lev[lid].x <= cur.x) {
			ltr.modify(1, 0, q, lev[lid].l, lev[lid].r, lev[lid].val, lev[lid].ch);
			lid++;
		}
		while (rid < rev.size() && rev[rid].x <= cur.x) {
			rtr.modify(1, 0, q, rev[rid].l, rev[rid].r, rev[rid].val, rev[rid].ch);
			rid++;
		}
		ans[cur.id] = max(cur.x - ltr.query(1, 0, q, cur.ti), rtr.query(1, 0, q, cur.ti) - cur.x);		
	}
	for (int i = 0;i < q;i++) {
		cout << (ans[i] >= inf/2 ? -1 : ans[i]) << "\n";
	}
}
/*

*/

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:12:20: warning: statement has no effect [-Wunused-value]
   12 | #define debug(...) 0
      |                    ^
new_home.cpp:99:3: note: in expansion of macro 'debug'
   99 |   debug("type", i);
      |   ^~~~~
new_home.cpp: In lambda function:
new_home.cpp:12:20: warning: statement has no effect [-Wunused-value]
   12 | #define debug(...) 0
      |                    ^
new_home.cpp:103:4: note: in expansion of macro 'debug'
  103 |    debug("seg", l, r, u, d);
      |    ^~~~~
new_home.cpp: In function 'int main()':
new_home.cpp:149:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<event>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |   while (lid < lev.size() && lev[lid].x <= cur.x) {
      |          ~~~~^~~~~~~~~~~~
new_home.cpp:153:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<event>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  153 |   while (rid < rev.size() && rev[rid].x <= cur.x) {
      |          ~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 24916 KB Output is correct
2 Correct 13 ms 24988 KB Output is correct
3 Correct 12 ms 24916 KB Output is correct
4 Correct 12 ms 24996 KB Output is correct
5 Correct 14 ms 25112 KB Output is correct
6 Correct 15 ms 25172 KB Output is correct
7 Correct 16 ms 25376 KB Output is correct
8 Correct 16 ms 25300 KB Output is correct
9 Correct 16 ms 25428 KB Output is correct
10 Correct 16 ms 25172 KB Output is correct
11 Correct 18 ms 25124 KB Output is correct
12 Correct 15 ms 25100 KB Output is correct
13 Correct 15 ms 25088 KB Output is correct
14 Correct 13 ms 25044 KB Output is correct
15 Correct 15 ms 25268 KB Output is correct
16 Correct 16 ms 25252 KB Output is correct
17 Correct 14 ms 25184 KB Output is correct
18 Correct 15 ms 25272 KB Output is correct
19 Correct 16 ms 25388 KB Output is correct
20 Correct 15 ms 25140 KB Output is correct
21 Correct 13 ms 25136 KB Output is correct
22 Correct 17 ms 25428 KB Output is correct
23 Correct 16 ms 25284 KB Output is correct
24 Correct 16 ms 25348 KB Output is correct
25 Correct 14 ms 25260 KB Output is correct
26 Correct 14 ms 25172 KB Output is correct
27 Correct 14 ms 25116 KB Output is correct
28 Correct 14 ms 25128 KB Output is correct
29 Correct 13 ms 25044 KB Output is correct
30 Correct 15 ms 25112 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 24916 KB Output is correct
2 Correct 13 ms 24988 KB Output is correct
3 Correct 12 ms 24916 KB Output is correct
4 Correct 12 ms 24996 KB Output is correct
5 Correct 14 ms 25112 KB Output is correct
6 Correct 15 ms 25172 KB Output is correct
7 Correct 16 ms 25376 KB Output is correct
8 Correct 16 ms 25300 KB Output is correct
9 Correct 16 ms 25428 KB Output is correct
10 Correct 16 ms 25172 KB Output is correct
11 Correct 18 ms 25124 KB Output is correct
12 Correct 15 ms 25100 KB Output is correct
13 Correct 15 ms 25088 KB Output is correct
14 Correct 13 ms 25044 KB Output is correct
15 Correct 15 ms 25268 KB Output is correct
16 Correct 16 ms 25252 KB Output is correct
17 Correct 14 ms 25184 KB Output is correct
18 Correct 15 ms 25272 KB Output is correct
19 Correct 16 ms 25388 KB Output is correct
20 Correct 15 ms 25140 KB Output is correct
21 Correct 13 ms 25136 KB Output is correct
22 Correct 17 ms 25428 KB Output is correct
23 Correct 16 ms 25284 KB Output is correct
24 Correct 16 ms 25348 KB Output is correct
25 Correct 14 ms 25260 KB Output is correct
26 Correct 14 ms 25172 KB Output is correct
27 Correct 14 ms 25116 KB Output is correct
28 Correct 14 ms 25128 KB Output is correct
29 Correct 13 ms 25044 KB Output is correct
30 Correct 15 ms 25112 KB Output is correct
31 Correct 1563 ms 45404 KB Output is correct
32 Correct 217 ms 36984 KB Output is correct
33 Correct 724 ms 42000 KB Output is correct
34 Correct 1541 ms 46332 KB Output is correct
35 Correct 1181 ms 42444 KB Output is correct
36 Correct 745 ms 41996 KB Output is correct
37 Correct 648 ms 42020 KB Output is correct
38 Correct 558 ms 41772 KB Output is correct
39 Correct 438 ms 41992 KB Output is correct
40 Correct 428 ms 41856 KB Output is correct
41 Correct 2045 ms 67580 KB Output is correct
42 Correct 2005 ms 68648 KB Output is correct
43 Correct 67 ms 32392 KB Output is correct
44 Correct 1789 ms 66544 KB Output is correct
45 Correct 1218 ms 60064 KB Output is correct
46 Correct 588 ms 48140 KB Output is correct
47 Correct 378 ms 48328 KB Output is correct
48 Correct 307 ms 44508 KB Output is correct
49 Correct 436 ms 50144 KB Output is correct
50 Correct 837 ms 60960 KB Output is correct
51 Correct 394 ms 47284 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 197 ms 69584 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 169 ms 63312 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 24916 KB Output is correct
2 Correct 13 ms 24988 KB Output is correct
3 Correct 12 ms 24916 KB Output is correct
4 Correct 12 ms 24996 KB Output is correct
5 Correct 14 ms 25112 KB Output is correct
6 Correct 15 ms 25172 KB Output is correct
7 Correct 16 ms 25376 KB Output is correct
8 Correct 16 ms 25300 KB Output is correct
9 Correct 16 ms 25428 KB Output is correct
10 Correct 16 ms 25172 KB Output is correct
11 Correct 18 ms 25124 KB Output is correct
12 Correct 15 ms 25100 KB Output is correct
13 Correct 15 ms 25088 KB Output is correct
14 Correct 13 ms 25044 KB Output is correct
15 Correct 15 ms 25268 KB Output is correct
16 Correct 16 ms 25252 KB Output is correct
17 Correct 14 ms 25184 KB Output is correct
18 Correct 15 ms 25272 KB Output is correct
19 Correct 16 ms 25388 KB Output is correct
20 Correct 15 ms 25140 KB Output is correct
21 Correct 13 ms 25136 KB Output is correct
22 Correct 17 ms 25428 KB Output is correct
23 Correct 16 ms 25284 KB Output is correct
24 Correct 16 ms 25348 KB Output is correct
25 Correct 14 ms 25260 KB Output is correct
26 Correct 14 ms 25172 KB Output is correct
27 Correct 14 ms 25116 KB Output is correct
28 Correct 14 ms 25128 KB Output is correct
29 Correct 13 ms 25044 KB Output is correct
30 Correct 15 ms 25112 KB Output is correct
31 Correct 1563 ms 45404 KB Output is correct
32 Correct 217 ms 36984 KB Output is correct
33 Correct 724 ms 42000 KB Output is correct
34 Correct 1541 ms 46332 KB Output is correct
35 Correct 1181 ms 42444 KB Output is correct
36 Correct 745 ms 41996 KB Output is correct
37 Correct 648 ms 42020 KB Output is correct
38 Correct 558 ms 41772 KB Output is correct
39 Correct 438 ms 41992 KB Output is correct
40 Correct 428 ms 41856 KB Output is correct
41 Correct 2045 ms 67580 KB Output is correct
42 Correct 2005 ms 68648 KB Output is correct
43 Correct 67 ms 32392 KB Output is correct
44 Correct 1789 ms 66544 KB Output is correct
45 Correct 1218 ms 60064 KB Output is correct
46 Correct 588 ms 48140 KB Output is correct
47 Correct 378 ms 48328 KB Output is correct
48 Correct 307 ms 44508 KB Output is correct
49 Correct 436 ms 50144 KB Output is correct
50 Correct 837 ms 60960 KB Output is correct
51 Correct 394 ms 47284 KB Output is correct
52 Correct 4276 ms 157884 KB Output is correct
53 Correct 4120 ms 160800 KB Output is correct
54 Correct 4135 ms 108628 KB Output is correct
55 Correct 2311 ms 95336 KB Output is correct
56 Correct 2501 ms 109332 KB Output is correct
57 Correct 2039 ms 77816 KB Output is correct
58 Correct 2981 ms 101860 KB Output is correct
59 Correct 3238 ms 115264 KB Output is correct
60 Correct 2232 ms 80616 KB Output is correct
61 Correct 139 ms 44428 KB Output is correct
62 Correct 4174 ms 159368 KB Output is correct
63 Correct 3979 ms 126520 KB Output is correct
64 Correct 3891 ms 114328 KB Output is correct
65 Correct 3671 ms 93708 KB Output is correct
66 Correct 2332 ms 75488 KB Output is correct
67 Correct 449 ms 49372 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 24916 KB Output is correct
2 Correct 13 ms 24988 KB Output is correct
3 Correct 12 ms 24916 KB Output is correct
4 Correct 12 ms 24996 KB Output is correct
5 Correct 14 ms 25112 KB Output is correct
6 Correct 15 ms 25172 KB Output is correct
7 Correct 16 ms 25376 KB Output is correct
8 Correct 16 ms 25300 KB Output is correct
9 Correct 16 ms 25428 KB Output is correct
10 Correct 16 ms 25172 KB Output is correct
11 Correct 18 ms 25124 KB Output is correct
12 Correct 15 ms 25100 KB Output is correct
13 Correct 15 ms 25088 KB Output is correct
14 Correct 13 ms 25044 KB Output is correct
15 Correct 15 ms 25268 KB Output is correct
16 Correct 16 ms 25252 KB Output is correct
17 Correct 14 ms 25184 KB Output is correct
18 Correct 15 ms 25272 KB Output is correct
19 Correct 16 ms 25388 KB Output is correct
20 Correct 15 ms 25140 KB Output is correct
21 Correct 13 ms 25136 KB Output is correct
22 Correct 17 ms 25428 KB Output is correct
23 Correct 16 ms 25284 KB Output is correct
24 Correct 16 ms 25348 KB Output is correct
25 Correct 14 ms 25260 KB Output is correct
26 Correct 14 ms 25172 KB Output is correct
27 Correct 14 ms 25116 KB Output is correct
28 Correct 14 ms 25128 KB Output is correct
29 Correct 13 ms 25044 KB Output is correct
30 Correct 15 ms 25112 KB Output is correct
31 Correct 1563 ms 45404 KB Output is correct
32 Correct 217 ms 36984 KB Output is correct
33 Correct 724 ms 42000 KB Output is correct
34 Correct 1541 ms 46332 KB Output is correct
35 Correct 1181 ms 42444 KB Output is correct
36 Correct 745 ms 41996 KB Output is correct
37 Correct 648 ms 42020 KB Output is correct
38 Correct 558 ms 41772 KB Output is correct
39 Correct 438 ms 41992 KB Output is correct
40 Correct 428 ms 41856 KB Output is correct
41 Correct 2045 ms 67580 KB Output is correct
42 Correct 2005 ms 68648 KB Output is correct
43 Correct 67 ms 32392 KB Output is correct
44 Correct 1789 ms 66544 KB Output is correct
45 Correct 1218 ms 60064 KB Output is correct
46 Correct 588 ms 48140 KB Output is correct
47 Correct 378 ms 48328 KB Output is correct
48 Correct 307 ms 44508 KB Output is correct
49 Correct 436 ms 50144 KB Output is correct
50 Correct 837 ms 60960 KB Output is correct
51 Correct 394 ms 47284 KB Output is correct
52 Runtime error 197 ms 69584 KB Execution killed with signal 11
53 Halted 0 ms 0 KB -