oj.uz

Submission #128432

# Submission time Handle Problem Language Result Execution time Memory
128432 2019-07-10T22:40:42 Z qkxwsm New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 327728 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 300013

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;
ppp arr[MAXN];
ppi quer[MAXN];
int ans[MAXN];
multiset<int> pts[MAXN];
vector<array<int, 4> > segments;
vector<array<int, 4> > events;
unordered_map<ll, vi> cancer;
vpi seg[MAXN << 3];
int iter[MAXN << 3];

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.resize(2 * N + Q);
	cancer.clear();
	segments.clear();
	FOR(i, 0, K) pts[i].clear();
	FOR(i, 0, N)
	{
		int t1 = arr[i].se.fi, t2 = arr[i].se.se, ty = arr[i].fi.fi, x = arr[i].fi.se;
		events[2 * i] = {t1, -1, ty, x};
		events[2 * i + 1] = {t2 + 1, -2, ty, x};
	}
	FOR(i, 0, Q)
	{
		int t = quer[i].fi.se, x = quer[i].fi.fi, qid = quer[i].se;
		events[2 * N + i] = {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);
		freopen("file.out", "w", stdout);
	}
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> K >> 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(arr, arr + N);
	FOR(i, 0, Q)
	{
		cin >> quer[i].fi.fi >> quer[i].fi.se; quer[i].se = i;
	}
	sort(quer, quer + Q, 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';
	}
	// cerr << "time elapsed = " << clock() / ((CLOCKS_PER_SEC) / 1000) << " ms" << endl;
	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);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:202:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen("file.out", "w", stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 70904 KB Output is correct
2 Correct 66 ms 70776 KB Output is correct
3 Correct 66 ms 70904 KB Output is correct
4 Correct 66 ms 70904 KB Output is correct
5 Correct 68 ms 71032 KB Output is correct
6 Correct 69 ms 71132 KB Output is correct
7 Correct 70 ms 71160 KB Output is correct
8 Correct 69 ms 71276 KB Output is correct
9 Correct 69 ms 71144 KB Output is correct
10 Correct 70 ms 71160 KB Output is correct
11 Correct 68 ms 71164 KB Output is correct
12 Correct 69 ms 71160 KB Output is correct
13 Correct 68 ms 71032 KB Output is correct
14 Correct 68 ms 71032 KB Output is correct
15 Correct 74 ms 71376 KB Output is correct
16 Correct 69 ms 71156 KB Output is correct
17 Correct 69 ms 71160 KB Output is correct
18 Correct 68 ms 71160 KB Output is correct
19 Correct 69 ms 71160 KB Output is correct
20 Correct 72 ms 71152 KB Output is correct
21 Correct 69 ms 71160 KB Output is correct
22 Correct 70 ms 71160 KB Output is correct
23 Correct 69 ms 71160 KB Output is correct
24 Correct 69 ms 71132 KB Output is correct
25 Correct 69 ms 71408 KB Output is correct
26 Correct 69 ms 71160 KB Output is correct
27 Correct 69 ms 71032 KB Output is correct
28 Correct 68 ms 71160 KB Output is correct
29 Correct 70 ms 71004 KB Output is correct
30 Correct 68 ms 71032 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 70904 KB Output is correct
2 Correct 66 ms 70776 KB Output is correct
3 Correct 66 ms 70904 KB Output is correct
4 Correct 66 ms 70904 KB Output is correct
5 Correct 68 ms 71032 KB Output is correct
6 Correct 69 ms 71132 KB Output is correct
7 Correct 70 ms 71160 KB Output is correct
8 Correct 69 ms 71276 KB Output is correct
9 Correct 69 ms 71144 KB Output is correct
10 Correct 70 ms 71160 KB Output is correct
11 Correct 68 ms 71164 KB Output is correct
12 Correct 69 ms 71160 KB Output is correct
13 Correct 68 ms 71032 KB Output is correct
14 Correct 68 ms 71032 KB Output is correct
15 Correct 74 ms 71376 KB Output is correct
16 Correct 69 ms 71156 KB Output is correct
17 Correct 69 ms 71160 KB Output is correct
18 Correct 68 ms 71160 KB Output is correct
19 Correct 69 ms 71160 KB Output is correct
20 Correct 72 ms 71152 KB Output is correct
21 Correct 69 ms 71160 KB Output is correct
22 Correct 70 ms 71160 KB Output is correct
23 Correct 69 ms 71160 KB Output is correct
24 Correct 69 ms 71132 KB Output is correct
25 Correct 69 ms 71408 KB Output is correct
26 Correct 69 ms 71160 KB Output is correct
27 Correct 69 ms 71032 KB Output is correct
28 Correct 68 ms 71160 KB Output is correct
29 Correct 70 ms 71004 KB Output is correct
30 Correct 68 ms 71032 KB Output is correct
31 Correct 1353 ms 126188 KB Output is correct
32 Correct 492 ms 96480 KB Output is correct
33 Correct 1426 ms 126064 KB Output is correct
34 Correct 1295 ms 126120 KB Output is correct
35 Correct 1473 ms 126056 KB Output is correct
36 Correct 1442 ms 125872 KB Output is correct
37 Correct 990 ms 122384 KB Output is correct
38 Correct 988 ms 122080 KB Output is correct
39 Correct 805 ms 115364 KB Output is correct
40 Correct 863 ms 117056 KB Output is correct
41 Correct 1157 ms 120888 KB Output is correct
42 Correct 1155 ms 121184 KB Output is correct
43 Correct 462 ms 99548 KB Output is correct
44 Correct 1122 ms 120260 KB Output is correct
45 Correct 991 ms 116520 KB Output is correct
46 Correct 855 ms 110632 KB Output is correct
47 Correct 627 ms 108456 KB Output is correct
48 Correct 588 ms 107048 KB Output is correct
49 Correct 758 ms 111912 KB Output is correct
50 Correct 860 ms 118824 KB Output is correct
51 Correct 742 ms 109992 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5035 ms 327728 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5039 ms 324256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 70904 KB Output is correct
2 Correct 66 ms 70776 KB Output is correct
3 Correct 66 ms 70904 KB Output is correct
4 Correct 66 ms 70904 KB Output is correct
5 Correct 68 ms 71032 KB Output is correct
6 Correct 69 ms 71132 KB Output is correct
7 Correct 70 ms 71160 KB Output is correct
8 Correct 69 ms 71276 KB Output is correct
9 Correct 69 ms 71144 KB Output is correct
10 Correct 70 ms 71160 KB Output is correct
11 Correct 68 ms 71164 KB Output is correct
12 Correct 69 ms 71160 KB Output is correct
13 Correct 68 ms 71032 KB Output is correct
14 Correct 68 ms 71032 KB Output is correct
15 Correct 74 ms 71376 KB Output is correct
16 Correct 69 ms 71156 KB Output is correct
17 Correct 69 ms 71160 KB Output is correct
18 Correct 68 ms 71160 KB Output is correct
19 Correct 69 ms 71160 KB Output is correct
20 Correct 72 ms 71152 KB Output is correct
21 Correct 69 ms 71160 KB Output is correct
22 Correct 70 ms 71160 KB Output is correct
23 Correct 69 ms 71160 KB Output is correct
24 Correct 69 ms 71132 KB Output is correct
25 Correct 69 ms 71408 KB Output is correct
26 Correct 69 ms 71160 KB Output is correct
27 Correct 69 ms 71032 KB Output is correct
28 Correct 68 ms 71160 KB Output is correct
29 Correct 70 ms 71004 KB Output is correct
30 Correct 68 ms 71032 KB Output is correct
31 Correct 1353 ms 126188 KB Output is correct
32 Correct 492 ms 96480 KB Output is correct
33 Correct 1426 ms 126064 KB Output is correct
34 Correct 1295 ms 126120 KB Output is correct
35 Correct 1473 ms 126056 KB Output is correct
36 Correct 1442 ms 125872 KB Output is correct
37 Correct 990 ms 122384 KB Output is correct
38 Correct 988 ms 122080 KB Output is correct
39 Correct 805 ms 115364 KB Output is correct
40 Correct 863 ms 117056 KB Output is correct
41 Correct 1157 ms 120888 KB Output is correct
42 Correct 1155 ms 121184 KB Output is correct
43 Correct 462 ms 99548 KB Output is correct
44 Correct 1122 ms 120260 KB Output is correct
45 Correct 991 ms 116520 KB Output is correct
46 Correct 855 ms 110632 KB Output is correct
47 Correct 627 ms 108456 KB Output is correct
48 Correct 588 ms 107048 KB Output is correct
49 Correct 758 ms 111912 KB Output is correct
50 Correct 860 ms 118824 KB Output is correct
51 Correct 742 ms 109992 KB Output is correct
52 Correct 1254 ms 135196 KB Output is correct
53 Correct 1174 ms 128480 KB Output is correct
54 Correct 1396 ms 129068 KB Output is correct
55 Correct 1100 ms 127644 KB Output is correct
56 Correct 1180 ms 130284 KB Output is correct
57 Correct 1051 ms 123004 KB Output is correct
58 Correct 1122 ms 126456 KB Output is correct
59 Correct 1210 ms 129368 KB Output is correct
60 Correct 1162 ms 122932 KB Output is correct
61 Correct 609 ms 126176 KB Output is correct
62 Correct 1266 ms 141424 KB Output is correct
63 Correct 1478 ms 132036 KB Output is correct
64 Correct 1336 ms 131064 KB Output is correct
65 Correct 1204 ms 129048 KB Output is correct
66 Correct 1127 ms 123300 KB Output is correct
67 Correct 828 ms 108948 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 70904 KB Output is correct
2 Correct 66 ms 70776 KB Output is correct
3 Correct 66 ms 70904 KB Output is correct
4 Correct 66 ms 70904 KB Output is correct
5 Correct 68 ms 71032 KB Output is correct
6 Correct 69 ms 71132 KB Output is correct
7 Correct 70 ms 71160 KB Output is correct
8 Correct 69 ms 71276 KB Output is correct
9 Correct 69 ms 71144 KB Output is correct
10 Correct 70 ms 71160 KB Output is correct
11 Correct 68 ms 71164 KB Output is correct
12 Correct 69 ms 71160 KB Output is correct
13 Correct 68 ms 71032 KB Output is correct
14 Correct 68 ms 71032 KB Output is correct
15 Correct 74 ms 71376 KB Output is correct
16 Correct 69 ms 71156 KB Output is correct
17 Correct 69 ms 71160 KB Output is correct
18 Correct 68 ms 71160 KB Output is correct
19 Correct 69 ms 71160 KB Output is correct
20 Correct 72 ms 71152 KB Output is correct
21 Correct 69 ms 71160 KB Output is correct
22 Correct 70 ms 71160 KB Output is correct
23 Correct 69 ms 71160 KB Output is correct
24 Correct 69 ms 71132 KB Output is correct
25 Correct 69 ms 71408 KB Output is correct
26 Correct 69 ms 71160 KB Output is correct
27 Correct 69 ms 71032 KB Output is correct
28 Correct 68 ms 71160 KB Output is correct
29 Correct 70 ms 71004 KB Output is correct
30 Correct 68 ms 71032 KB Output is correct
31 Correct 1353 ms 126188 KB Output is correct
32 Correct 492 ms 96480 KB Output is correct
33 Correct 1426 ms 126064 KB Output is correct
34 Correct 1295 ms 126120 KB Output is correct
35 Correct 1473 ms 126056 KB Output is correct
36 Correct 1442 ms 125872 KB Output is correct
37 Correct 990 ms 122384 KB Output is correct
38 Correct 988 ms 122080 KB Output is correct
39 Correct 805 ms 115364 KB Output is correct
40 Correct 863 ms 117056 KB Output is correct
41 Correct 1157 ms 120888 KB Output is correct
42 Correct 1155 ms 121184 KB Output is correct
43 Correct 462 ms 99548 KB Output is correct
44 Correct 1122 ms 120260 KB Output is correct
45 Correct 991 ms 116520 KB Output is correct
46 Correct 855 ms 110632 KB Output is correct
47 Correct 627 ms 108456 KB Output is correct
48 Correct 588 ms 107048 KB Output is correct
49 Correct 758 ms 111912 KB Output is correct
50 Correct 860 ms 118824 KB Output is correct
51 Correct 742 ms 109992 KB Output is correct
52 Execution timed out 5035 ms 327728 KB Time limit exceeded
53 Halted 0 ms 0 KB -