oj.uz

답안 #128428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128428 2019-07-10T22:31:25 Z qkxwsm 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 427260 KB 
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}
template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) ((x).size()))
#define ALL(x) (x).begin(), (x).end()
#define LIM 100000007
#define INF 1000000007
#define LLINF 2696969696969696969ll
#define MAXN 2100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef pair<pii, pii> ppp;
typedef pair<pii, int> ppi;

int N, K, Q, S;
vector<ppp> arr;
vector<ppi> quer;
int ans[MAXN];
multiset<int> pts[MAXN];
vector<array<int, 4> > segments;
vector<array<int, 4> > events;
map<ll, vi> cancer;
vpi seg[MAXN];
int iter[MAXN];

void ins(int l, int r, int t)
{
	// cerr << "ins " << l << ' ' << r << " time " << t << endl;
	l = (l + r + 1) >> 1;
	cancer[1ll * INF * l + r].PB(SZ(segments));
	segments.PB({l, r, t, SZ(events) + 1});
}
void del(int l, int r, int t)
{
	// cerr << "del " << l << ' ' << r << " time " << t << endl;
	l = (l + r + 1) >> 1;
	// cerr << "rem " << (cancer[{l, r}]).size() << endl;
	segments[cancer[1ll * INF * l + r].back()][3] = t;
	cancer[1ll * INF * l + r].pop_back();
}

void inseg(int w, int L, int R, int a, int b, pii p)
{
	if (a <= L && R <= b)
	{
		seg[w].PB(p);
		return;
	}
	int mid = (L + R) >> 1;
	if (a <= mid) inseg(w << 1, L, mid, a, b, p);
	if (mid < b) inseg(w << 1 | 1, mid + 1, R, a, b, p);
	return;
}
void build(int w, int L, int R)
{
	if (L != R)
	{
		int mid = (L + R) >> 1;
		build(w << 1, L, mid);
		build(w << 1 | 1, mid + 1, R);
	}
	FOR(i, 1, SZ(seg[w]))
	{
		ckmax(seg[w][i].se, seg[w][i - 1].se);
	}
}
int query(int w, int L, int R, int a, int x)
{
	int res = -INF;
	while(iter[w] + 1 < SZ(seg[w]) && seg[w][iter[w] + 1].fi <= x)
	{
		iter[w]++;
	}
	if (iter[w] < SZ(seg[w]) && seg[w][iter[w]].fi <= x)
	{
		res = -x + seg[w][iter[w]].se;
	}
	if (L == R) return res;
	int mid = (L + R) >> 1;
	if (a <= mid) ckmax(res, query(w << 1, L, mid, a, x));
	else ckmax(res, query(w << 1 | 1, mid + 1, R, a, x));
	return res;
}

void solve()
{
	//consider distnace functions with negative slope ONLY.
	//arr: something of type t and position p in times (t1, t2)
	//quer: query of position p at time t, qid i
	FOR(i, 0, (1 << (33 - __builtin_clz(SZ(events)))))
	{
		seg[i].clear();
		iter[i] = 0;
	}
	events.clear();
	cancer.clear();
	segments.clear();
	FOR(i, 0, K) pts[i].clear();
	FOR(i, 0, SZ(arr))
	{
		int t1 = arr[i].se.fi, t2 = arr[i].se.se, ty = arr[i].fi.fi, x = arr[i].fi.se;
		events.PB({t1, -1, ty, x});
		events.PB({t2 + 1, -2, ty, x});
	}
	FOR(i, 0, SZ(quer))
	{
		int t = quer[i].fi.se, x = quer[i].fi.fi, qid = quer[i].se;
		events.PB({t, 0, qid, x});
	}
	sort(ALL(events));
	FOR(i, 0, K)
	{
		pts[i].insert(2 * LIM);
		pts[i].insert(-2 * LIM);
		ins(-2 * LIM, 2 * LIM, 0);
	}
	FOR(i, 0, SZ(events))
	{
		int typ = events[i][2], pos = events[i][3];
		if (events[i][1] == -1)
		{
			auto it = pts[typ].UB(pos);
			int rt = *it, lt = *prev(it);
			pts[typ].insert(pos);
			//then between lt and rt you generate some new segments!
			//at time i you have to erase a segment! and then insert two new segments!
			//WARNING: IF NOT DISTINCT, PLEASE CHECK THIS PLACE
			ins(lt, pos, i + 1);
			ins(pos, rt, i + 1);
			del(lt, rt, i + 1);
		}
		if (events[i][1] == -2)
		{
			pts[typ].erase(pts[typ].find(pos));
			auto it = pts[typ].UB(pos);
			int rt = *it, lt = *prev(it);
			del(lt, pos, i + 1);
			del(pos, rt, i + 1);
			ins(lt, rt, i + 1);
		}
	}
	sort(ALL(segments));
	FOR(i, 0, SZ(segments))
	{
		int l = segments[i][2], r = segments[i][3];
		inseg(1, 0, SZ(events) + 1, l, r, {segments[i][0], segments[i][1]});
	}
	//ok cool we have the segments
	build(1, 0, SZ(events));
	vector<array<int, 3> > queries;
	FOR(i, 0, SZ(events))
	{
		if (events[i][1] == 0)
		{
			int qid = events[i][2], pos = events[i][3];
			queries.PB({pos, i + 1, qid});
		}
	}
	sort(ALL(queries));
	for (auto p : queries)
	{
		ckmax(ans[p[2]], query(1, 0, SZ(events) + 1, p[1], p[0]));
	}
}
bool cmp(ppi a, ppi b)
{
	return a.fi.se < b.fi.se;
}

int32_t main()
{
	if (fopen("file.in", "r"))
	{
		freopen("file.in", "r", stdin);
	}
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> K >> Q;
	arr.resize(N); quer.resize(Q);
	FOR(i, 0, N)
	{
		cin >> arr[i].fi.se >> arr[i].fi.fi >> arr[i].se.fi >> arr[i].se.se;
		arr[i].fi.fi--;
	}
	sort(ALL(arr));
	FOR(i, 0, Q)
	{
		cin >> quer[i].fi.fi >> quer[i].fi.se; quer[i].se = i;
	}
	sort(ALL(quer), cmp);
	solve();
	FOR(i, 0, N)
	{
		arr[i].fi.se = 100000001 - arr[i].fi.se;
	}
	FOR(i, 0, Q)
	{
		quer[i].fi.fi = 100000001 - quer[i].fi.fi;
	}
	solve();
	//events: OPEN/CLOSE a store at time t, position p, type x, ASK at time t, position p
	FOR(i, 0, Q)
	{
		if (ans[i] >= LIM)
		{
			cout << "-1\n";
			continue;
		}
		// cerr << "ans " << ans[i] << endl;
		cout << ans[i] << '\n';
	}
	return 0;
}

Compilation message

new_home.cpp: In function 'int32_t main()':
new_home.cpp:201:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen("file.in", "r", stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 148344 KB Output is correct
2 Correct 136 ms 148344 KB Output is correct
3 Correct 136 ms 148344 KB Output is correct
4 Correct 135 ms 148344 KB Output is correct
5 Correct 140 ms 148520 KB Output is correct
6 Correct 139 ms 148604 KB Output is correct
7 Correct 139 ms 148600 KB Output is correct
8 Correct 160 ms 148768 KB Output is correct
9 Correct 142 ms 148728 KB Output is correct
10 Correct 139 ms 148728 KB Output is correct
11 Correct 140 ms 148600 KB Output is correct
12 Correct 138 ms 148600 KB Output is correct
13 Correct 139 ms 148604 KB Output is correct
14 Correct 139 ms 148660 KB Output is correct
15 Correct 140 ms 148612 KB Output is correct
16 Correct 139 ms 148700 KB Output is correct
17 Correct 139 ms 148600 KB Output is correct
18 Correct 142 ms 148728 KB Output is correct
19 Correct 140 ms 148744 KB Output is correct
20 Correct 140 ms 148600 KB Output is correct
21 Correct 138 ms 148600 KB Output is correct
22 Correct 138 ms 148712 KB Output is correct
23 Correct 139 ms 148728 KB Output is correct
24 Correct 139 ms 148824 KB Output is correct
25 Correct 150 ms 148892 KB Output is correct
26 Correct 170 ms 148600 KB Output is correct
27 Correct 139 ms 148580 KB Output is correct
28 Correct 141 ms 148672 KB Output is correct
29 Correct 137 ms 148600 KB Output is correct
30 Correct 140 ms 148472 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 148344 KB Output is correct
2 Correct 136 ms 148344 KB Output is correct
3 Correct 136 ms 148344 KB Output is correct
4 Correct 135 ms 148344 KB Output is correct
5 Correct 140 ms 148520 KB Output is correct
6 Correct 139 ms 148604 KB Output is correct
7 Correct 139 ms 148600 KB Output is correct
8 Correct 160 ms 148768 KB Output is correct
9 Correct 142 ms 148728 KB Output is correct
10 Correct 139 ms 148728 KB Output is correct
11 Correct 140 ms 148600 KB Output is correct
12 Correct 138 ms 148600 KB Output is correct
13 Correct 139 ms 148604 KB Output is correct
14 Correct 139 ms 148660 KB Output is correct
15 Correct 140 ms 148612 KB Output is correct
16 Correct 139 ms 148700 KB Output is correct
17 Correct 139 ms 148600 KB Output is correct
18 Correct 142 ms 148728 KB Output is correct
19 Correct 140 ms 148744 KB Output is correct
20 Correct 140 ms 148600 KB Output is correct
21 Correct 138 ms 148600 KB Output is correct
22 Correct 138 ms 148712 KB Output is correct
23 Correct 139 ms 148728 KB Output is correct
24 Correct 139 ms 148824 KB Output is correct
25 Correct 150 ms 148892 KB Output is correct
26 Correct 170 ms 148600 KB Output is correct
27 Correct 139 ms 148580 KB Output is correct
28 Correct 141 ms 148672 KB Output is correct
29 Correct 137 ms 148600 KB Output is correct
30 Correct 140 ms 148472 KB Output is correct
31 Correct 1869 ms 209196 KB Output is correct
32 Correct 566 ms 173540 KB Output is correct
33 Correct 1746 ms 208180 KB Output is correct
34 Correct 1675 ms 208104 KB Output is correct
35 Correct 1799 ms 209220 KB Output is correct
36 Correct 1849 ms 208848 KB Output is correct
37 Correct 1229 ms 203744 KB Output is correct
38 Correct 1244 ms 203748 KB Output is correct
39 Correct 966 ms 196836 KB Output is correct
40 Correct 1045 ms 198624 KB Output is correct
41 Correct 1606 ms 202412 KB Output is correct
42 Correct 1724 ms 202500 KB Output is correct
43 Correct 517 ms 177224 KB Output is correct
44 Correct 1651 ms 201820 KB Output is correct
45 Correct 1521 ms 197848 KB Output is correct
46 Correct 1275 ms 192100 KB Output is correct
47 Correct 769 ms 189412 KB Output is correct
48 Correct 721 ms 188004 KB Output is correct
49 Correct 906 ms 192932 KB Output is correct
50 Correct 1089 ms 199908 KB Output is correct
51 Correct 924 ms 191080 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 148344 KB Output is correct
2 Correct 136 ms 148344 KB Output is correct
3 Correct 136 ms 148344 KB Output is correct
4 Correct 135 ms 148344 KB Output is correct
5 Correct 140 ms 148520 KB Output is correct
6 Correct 139 ms 148604 KB Output is correct
7 Correct 139 ms 148600 KB Output is correct
8 Correct 160 ms 148768 KB Output is correct
9 Correct 142 ms 148728 KB Output is correct
10 Correct 139 ms 148728 KB Output is correct
11 Correct 140 ms 148600 KB Output is correct
12 Correct 138 ms 148600 KB Output is correct
13 Correct 139 ms 148604 KB Output is correct
14 Correct 139 ms 148660 KB Output is correct
15 Correct 140 ms 148612 KB Output is correct
16 Correct 139 ms 148700 KB Output is correct
17 Correct 139 ms 148600 KB Output is correct
18 Correct 142 ms 148728 KB Output is correct
19 Correct 140 ms 148744 KB Output is correct
20 Correct 140 ms 148600 KB Output is correct
21 Correct 138 ms 148600 KB Output is correct
22 Correct 138 ms 148712 KB Output is correct
23 Correct 139 ms 148728 KB Output is correct
24 Correct 139 ms 148824 KB Output is correct
25 Correct 150 ms 148892 KB Output is correct
26 Correct 170 ms 148600 KB Output is correct
27 Correct 139 ms 148580 KB Output is correct
28 Correct 141 ms 148672 KB Output is correct
29 Correct 137 ms 148600 KB Output is correct
30 Correct 140 ms 148472 KB Output is correct
31 Correct 1869 ms 209196 KB Output is correct
32 Correct 566 ms 173540 KB Output is correct
33 Correct 1746 ms 208180 KB Output is correct
34 Correct 1675 ms 208104 KB Output is correct
35 Correct 1799 ms 209220 KB Output is correct
36 Correct 1849 ms 208848 KB Output is correct
37 Correct 1229 ms 203744 KB Output is correct
38 Correct 1244 ms 203748 KB Output is correct
39 Correct 966 ms 196836 KB Output is correct
40 Correct 1045 ms 198624 KB Output is correct
41 Correct 1606 ms 202412 KB Output is correct
42 Correct 1724 ms 202500 KB Output is correct
43 Correct 517 ms 177224 KB Output is correct
44 Correct 1651 ms 201820 KB Output is correct
45 Correct 1521 ms 197848 KB Output is correct
46 Correct 1275 ms 192100 KB Output is correct
47 Correct 769 ms 189412 KB Output is correct
48 Correct 721 ms 188004 KB Output is correct
49 Correct 906 ms 192932 KB Output is correct
50 Correct 1089 ms 199908 KB Output is correct
51 Correct 924 ms 191080 KB Output is correct
52 Correct 1547 ms 214352 KB Output is correct
53 Correct 1459 ms 208192 KB Output is correct
54 Correct 2302 ms 210208 KB Output is correct
55 Correct 1625 ms 208180 KB Output is correct
56 Correct 1533 ms 210300 KB Output is correct
57 Correct 1527 ms 204184 KB Output is correct
58 Correct 1589 ms 208052 KB Output is correct
59 Correct 1704 ms 210580 KB Output is correct
60 Correct 1586 ms 204268 KB Output is correct
61 Correct 658 ms 203648 KB Output is correct
62 Correct 1560 ms 220388 KB Output is correct
63 Correct 1854 ms 213148 KB Output is correct
64 Correct 1777 ms 212612 KB Output is correct
65 Correct 1778 ms 210512 KB Output is correct
66 Correct 1620 ms 204732 KB Output is correct
67 Correct 981 ms 186468 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 148344 KB Output is correct
2 Correct 136 ms 148344 KB Output is correct
3 Correct 136 ms 148344 KB Output is correct
4 Correct 135 ms 148344 KB Output is correct
5 Correct 140 ms 148520 KB Output is correct
6 Correct 139 ms 148604 KB Output is correct
7 Correct 139 ms 148600 KB Output is correct
8 Correct 160 ms 148768 KB Output is correct
9 Correct 142 ms 148728 KB Output is correct
10 Correct 139 ms 148728 KB Output is correct
11 Correct 140 ms 148600 KB Output is correct
12 Correct 138 ms 148600 KB Output is correct
13 Correct 139 ms 148604 KB Output is correct
14 Correct 139 ms 148660 KB Output is correct
15 Correct 140 ms 148612 KB Output is correct
16 Correct 139 ms 148700 KB Output is correct
17 Correct 139 ms 148600 KB Output is correct
18 Correct 142 ms 148728 KB Output is correct
19 Correct 140 ms 148744 KB Output is correct
20 Correct 140 ms 148600 KB Output is correct
21 Correct 138 ms 148600 KB Output is correct
22 Correct 138 ms 148712 KB Output is correct
23 Correct 139 ms 148728 KB Output is correct
24 Correct 139 ms 148824 KB Output is correct
25 Correct 150 ms 148892 KB Output is correct
26 Correct 170 ms 148600 KB Output is correct
27 Correct 139 ms 148580 KB Output is correct
28 Correct 141 ms 148672 KB Output is correct
29 Correct 137 ms 148600 KB Output is correct
30 Correct 140 ms 148472 KB Output is correct
31 Correct 1869 ms 209196 KB Output is correct
32 Correct 566 ms 173540 KB Output is correct
33 Correct 1746 ms 208180 KB Output is correct
34 Correct 1675 ms 208104 KB Output is correct
35 Correct 1799 ms 209220 KB Output is correct
36 Correct 1849 ms 208848 KB Output is correct
37 Correct 1229 ms 203744 KB Output is correct
38 Correct 1244 ms 203748 KB Output is correct
39 Correct 966 ms 196836 KB Output is correct
40 Correct 1045 ms 198624 KB Output is correct
41 Correct 1606 ms 202412 KB Output is correct
42 Correct 1724 ms 202500 KB Output is correct
43 Correct 517 ms 177224 KB Output is correct
44 Correct 1651 ms 201820 KB Output is correct
45 Correct 1521 ms 197848 KB Output is correct
46 Correct 1275 ms 192100 KB Output is correct
47 Correct 769 ms 189412 KB Output is correct
48 Correct 721 ms 188004 KB Output is correct
49 Correct 906 ms 192932 KB Output is correct
50 Correct 1089 ms 199908 KB Output is correct
51 Correct 924 ms 191080 KB Output is correct
52 Execution timed out 5036 ms 427260 KB Time limit exceeded
53 Halted 0 ms 0 KB -