oj.uz

Submission #128458

# Submission time Handle Problem Language Result Execution time Memory
128458 2019-07-11T00:31:31 Z qkxwsm New Home (APIO18_new_home) C++14
57 / 100
 5000 ms 412468 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 << 2];
int iter[MAXN << 2];
vi compress;

void ins(int l, int r, int t)
{
	l = (l + r + 1) >> 1;
	cancer[1ll * INF * l + r].PB(SZ(segments));
	segments.PB({l, r, t, Q + 2});
}
void del(int l, int r, int t)
{
	l = (l + r + 1) >> 1;
	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()
{
	FOR(i, 0, (1 << (33 - __builtin_clz(Q + 2))) + 1)
	{
		seg[i].clear();
		iter[i] = 0;
	}
	events.clear();
	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;
		if (t1 == t2) continue;
		events.PB({t1, -1, ty, x});
		events.PB({t2, -2, ty, 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 t = events[i][0], 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);
			ins(lt, pos, t + 1);
			ins(pos, rt, t + 1);
			del(lt, rt, t);
		}
		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, t);
			del(pos, rt, t);
			ins(lt, rt, t + 1);
		}
	}
	sort(ALL(segments));
	// cerr << "time elapsed = " << clock() / ((CLOCKS_PER_SEC) / 1000) << " ms" << endl;
	FOR(i, 0, SZ(segments))
	{
		int l = segments[i][2], r = segments[i][3];
		if (l > r) continue;
		inseg(1, 0, Q + 2, l, r, {segments[i][0], segments[i][1]});
	}
	// cerr << "time elapsed = " << clock() / ((CLOCKS_PER_SEC) / 1000) << " ms" << endl;
	build(1, 0, Q + 2);
	FOR(i, 0, Q)
	{
		ckmax(ans[quer[i].se], query(1, 0, Q + 2, quer[i].fi.se + 1, quer[i].fi.fi));
	}
}
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--; arr[i].se.se++;
	}
	FOR(i, 0, Q)
	{
		cin >> quer[i].fi.fi >> quer[i].fi.se; quer[i].se = i;
		compress.PB(quer[i].fi.se);
	}
	compress.PB(INF);
	compress.PB(0);
	sort(ALL(compress)); compress.erase(unique(ALL(compress)), compress.end());
	FOR(i, 0, Q)
	{
		quer[i].fi.se = LB(ALL(compress), quer[i].fi.se) - compress.begin();
	}
	FOR(i, 0, N)
	{
		arr[i].se.fi = LB(ALL(compress), arr[i].se.fi) - compress.begin();
		arr[i].se.se = LB(ALL(compress), arr[i].se.se) - compress.begin();
	}
	sort(arr, arr + N);
	sort(quer, quer + Q);
	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;
	}
	reverse(quer, quer + Q);
	solve();
	FOR(i, 0, Q)
	{
		if (ans[i] >= LIM)
		{
			cout << "-1\n";
			continue;
		}
		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:178: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:179: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 50 ms 42616 KB Output is correct
2 Correct 40 ms 42616 KB Output is correct
3 Correct 40 ms 42616 KB Output is correct
4 Correct 40 ms 42616 KB Output is correct
5 Correct 42 ms 42744 KB Output is correct
6 Correct 43 ms 42872 KB Output is correct
7 Correct 43 ms 42872 KB Output is correct
8 Correct 43 ms 42872 KB Output is correct
9 Correct 43 ms 43000 KB Output is correct
10 Correct 44 ms 42872 KB Output is correct
11 Correct 43 ms 42872 KB Output is correct
12 Correct 43 ms 42744 KB Output is correct
13 Correct 42 ms 42744 KB Output is correct
14 Correct 42 ms 42744 KB Output is correct
15 Correct 52 ms 42872 KB Output is correct
16 Correct 43 ms 42872 KB Output is correct
17 Correct 53 ms 42872 KB Output is correct
18 Correct 45 ms 42852 KB Output is correct
19 Correct 53 ms 42872 KB Output is correct
20 Correct 43 ms 42872 KB Output is correct
21 Correct 43 ms 42744 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 43 ms 42872 KB Output is correct
24 Correct 44 ms 42844 KB Output is correct
25 Correct 44 ms 42928 KB Output is correct
26 Correct 42 ms 42872 KB Output is correct
27 Correct 42 ms 42824 KB Output is correct
28 Correct 42 ms 42872 KB Output is correct
29 Correct 43 ms 42872 KB Output is correct
30 Correct 41 ms 42744 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 42616 KB Output is correct
2 Correct 40 ms 42616 KB Output is correct
3 Correct 40 ms 42616 KB Output is correct
4 Correct 40 ms 42616 KB Output is correct
5 Correct 42 ms 42744 KB Output is correct
6 Correct 43 ms 42872 KB Output is correct
7 Correct 43 ms 42872 KB Output is correct
8 Correct 43 ms 42872 KB Output is correct
9 Correct 43 ms 43000 KB Output is correct
10 Correct 44 ms 42872 KB Output is correct
11 Correct 43 ms 42872 KB Output is correct
12 Correct 43 ms 42744 KB Output is correct
13 Correct 42 ms 42744 KB Output is correct
14 Correct 42 ms 42744 KB Output is correct
15 Correct 52 ms 42872 KB Output is correct
16 Correct 43 ms 42872 KB Output is correct
17 Correct 53 ms 42872 KB Output is correct
18 Correct 45 ms 42852 KB Output is correct
19 Correct 53 ms 42872 KB Output is correct
20 Correct 43 ms 42872 KB Output is correct
21 Correct 43 ms 42744 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 43 ms 42872 KB Output is correct
24 Correct 44 ms 42844 KB Output is correct
25 Correct 44 ms 42928 KB Output is correct
26 Correct 42 ms 42872 KB Output is correct
27 Correct 42 ms 42824 KB Output is correct
28 Correct 42 ms 42872 KB Output is correct
29 Correct 43 ms 42872 KB Output is correct
30 Correct 41 ms 42744 KB Output is correct
31 Correct 1101 ms 89700 KB Output is correct
32 Correct 281 ms 53224 KB Output is correct
33 Correct 1081 ms 88292 KB Output is correct
34 Correct 1094 ms 88496 KB Output is correct
35 Correct 1223 ms 89684 KB Output is correct
36 Correct 1217 ms 89680 KB Output is correct
37 Correct 828 ms 84068 KB Output is correct
38 Correct 842 ms 83688 KB Output is correct
39 Correct 668 ms 77284 KB Output is correct
40 Correct 703 ms 78820 KB Output is correct
41 Correct 863 ms 83172 KB Output is correct
42 Correct 891 ms 83364 KB Output is correct
43 Correct 254 ms 54372 KB Output is correct
44 Correct 846 ms 82616 KB Output is correct
45 Correct 826 ms 79076 KB Output is correct
46 Correct 640 ms 73060 KB Output is correct
47 Correct 512 ms 71312 KB Output is correct
48 Correct 485 ms 69576 KB Output is correct
49 Correct 624 ms 74468 KB Output is correct
50 Correct 755 ms 81256 KB Output is correct
51 Correct 702 ms 72932 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4183 ms 284008 KB Output is correct
2 Correct 4061 ms 260772 KB Output is correct
3 Correct 3987 ms 406848 KB Output is correct
4 Correct 3800 ms 275020 KB Output is correct
5 Correct 3952 ms 256236 KB Output is correct
6 Correct 4054 ms 261272 KB Output is correct
7 Correct 4019 ms 412468 KB Output is correct
8 Correct 3797 ms 288900 KB Output is correct
9 Correct 3719 ms 270060 KB Output is correct
10 Correct 3752 ms 262596 KB Output is correct
11 Correct 3959 ms 257152 KB Output is correct
12 Correct 3506 ms 262500 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 42616 KB Output is correct
2 Correct 40 ms 42616 KB Output is correct
3 Correct 40 ms 42616 KB Output is correct
4 Correct 40 ms 42616 KB Output is correct
5 Correct 42 ms 42744 KB Output is correct
6 Correct 43 ms 42872 KB Output is correct
7 Correct 43 ms 42872 KB Output is correct
8 Correct 43 ms 42872 KB Output is correct
9 Correct 43 ms 43000 KB Output is correct
10 Correct 44 ms 42872 KB Output is correct
11 Correct 43 ms 42872 KB Output is correct
12 Correct 43 ms 42744 KB Output is correct
13 Correct 42 ms 42744 KB Output is correct
14 Correct 42 ms 42744 KB Output is correct
15 Correct 52 ms 42872 KB Output is correct
16 Correct 43 ms 42872 KB Output is correct
17 Correct 53 ms 42872 KB Output is correct
18 Correct 45 ms 42852 KB Output is correct
19 Correct 53 ms 42872 KB Output is correct
20 Correct 43 ms 42872 KB Output is correct
21 Correct 43 ms 42744 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 43 ms 42872 KB Output is correct
24 Correct 44 ms 42844 KB Output is correct
25 Correct 44 ms 42928 KB Output is correct
26 Correct 42 ms 42872 KB Output is correct
27 Correct 42 ms 42824 KB Output is correct
28 Correct 42 ms 42872 KB Output is correct
29 Correct 43 ms 42872 KB Output is correct
30 Correct 41 ms 42744 KB Output is correct
31 Correct 1101 ms 89700 KB Output is correct
32 Correct 281 ms 53224 KB Output is correct
33 Correct 1081 ms 88292 KB Output is correct
34 Correct 1094 ms 88496 KB Output is correct
35 Correct 1223 ms 89684 KB Output is correct
36 Correct 1217 ms 89680 KB Output is correct
37 Correct 828 ms 84068 KB Output is correct
38 Correct 842 ms 83688 KB Output is correct
39 Correct 668 ms 77284 KB Output is correct
40 Correct 703 ms 78820 KB Output is correct
41 Correct 863 ms 83172 KB Output is correct
42 Correct 891 ms 83364 KB Output is correct
43 Correct 254 ms 54372 KB Output is correct
44 Correct 846 ms 82616 KB Output is correct
45 Correct 826 ms 79076 KB Output is correct
46 Correct 640 ms 73060 KB Output is correct
47 Correct 512 ms 71312 KB Output is correct
48 Correct 485 ms 69576 KB Output is correct
49 Correct 624 ms 74468 KB Output is correct
50 Correct 755 ms 81256 KB Output is correct
51 Correct 702 ms 72932 KB Output is correct
52 Correct 1151 ms 98996 KB Output is correct
53 Correct 970 ms 89960 KB Output is correct
54 Correct 1164 ms 92132 KB Output is correct
55 Correct 936 ms 90084 KB Output is correct
56 Correct 946 ms 92388 KB Output is correct
57 Correct 946 ms 85092 KB Output is correct
58 Correct 1018 ms 88932 KB Output is correct
59 Correct 992 ms 91700 KB Output is correct
60 Correct 920 ms 85432 KB Output is correct
61 Correct 343 ms 69572 KB Output is correct
62 Correct 1010 ms 100324 KB Output is correct
63 Correct 1138 ms 95088 KB Output is correct
64 Correct 1194 ms 94180 KB Output is correct
65 Correct 1123 ms 91516 KB Output is correct
66 Correct 990 ms 85604 KB Output is correct
67 Correct 347 ms 55140 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 42616 KB Output is correct
2 Correct 40 ms 42616 KB Output is correct
3 Correct 40 ms 42616 KB Output is correct
4 Correct 40 ms 42616 KB Output is correct
5 Correct 42 ms 42744 KB Output is correct
6 Correct 43 ms 42872 KB Output is correct
7 Correct 43 ms 42872 KB Output is correct
8 Correct 43 ms 42872 KB Output is correct
9 Correct 43 ms 43000 KB Output is correct
10 Correct 44 ms 42872 KB Output is correct
11 Correct 43 ms 42872 KB Output is correct
12 Correct 43 ms 42744 KB Output is correct
13 Correct 42 ms 42744 KB Output is correct
14 Correct 42 ms 42744 KB Output is correct
15 Correct 52 ms 42872 KB Output is correct
16 Correct 43 ms 42872 KB Output is correct
17 Correct 53 ms 42872 KB Output is correct
18 Correct 45 ms 42852 KB Output is correct
19 Correct 53 ms 42872 KB Output is correct
20 Correct 43 ms 42872 KB Output is correct
21 Correct 43 ms 42744 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 43 ms 42872 KB Output is correct
24 Correct 44 ms 42844 KB Output is correct
25 Correct 44 ms 42928 KB Output is correct
26 Correct 42 ms 42872 KB Output is correct
27 Correct 42 ms 42824 KB Output is correct
28 Correct 42 ms 42872 KB Output is correct
29 Correct 43 ms 42872 KB Output is correct
30 Correct 41 ms 42744 KB Output is correct
31 Correct 1101 ms 89700 KB Output is correct
32 Correct 281 ms 53224 KB Output is correct
33 Correct 1081 ms 88292 KB Output is correct
34 Correct 1094 ms 88496 KB Output is correct
35 Correct 1223 ms 89684 KB Output is correct
36 Correct 1217 ms 89680 KB Output is correct
37 Correct 828 ms 84068 KB Output is correct
38 Correct 842 ms 83688 KB Output is correct
39 Correct 668 ms 77284 KB Output is correct
40 Correct 703 ms 78820 KB Output is correct
41 Correct 863 ms 83172 KB Output is correct
42 Correct 891 ms 83364 KB Output is correct
43 Correct 254 ms 54372 KB Output is correct
44 Correct 846 ms 82616 KB Output is correct
45 Correct 826 ms 79076 KB Output is correct
46 Correct 640 ms 73060 KB Output is correct
47 Correct 512 ms 71312 KB Output is correct
48 Correct 485 ms 69576 KB Output is correct
49 Correct 624 ms 74468 KB Output is correct
50 Correct 755 ms 81256 KB Output is correct
51 Correct 702 ms 72932 KB Output is correct
52 Correct 4183 ms 284008 KB Output is correct
53 Correct 4061 ms 260772 KB Output is correct
54 Correct 3987 ms 406848 KB Output is correct
55 Correct 3800 ms 275020 KB Output is correct
56 Correct 3952 ms 256236 KB Output is correct
57 Correct 4054 ms 261272 KB Output is correct
58 Correct 4019 ms 412468 KB Output is correct
59 Correct 3797 ms 288900 KB Output is correct
60 Correct 3719 ms 270060 KB Output is correct
61 Correct 3752 ms 262596 KB Output is correct
62 Correct 3959 ms 257152 KB Output is correct
63 Correct 3506 ms 262500 KB Output is correct
64 Execution timed out 5038 ms 283028 KB Time limit exceeded
65 Halted 0 ms 0 KB -