oj.uz

답안 #128457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128457 2019-07-11T00:09:25 Z qkxwsm 새 집 (APIO18_new_home) C++14
57 / 100
 5000 ms 412488 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)
{
	// 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, Q + 2});
}
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(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));
	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]});
	}
	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:184: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:185: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

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 42616 KB Output is correct
2 Correct 41 ms 42616 KB Output is correct
3 Correct 41 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 44 ms 42800 KB Output is correct
7 Correct 44 ms 42872 KB Output is correct
8 Correct 43 ms 43000 KB Output is correct
9 Correct 44 ms 43000 KB Output is correct
10 Correct 43 ms 42872 KB Output is correct
11 Correct 43 ms 42872 KB Output is correct
12 Correct 44 ms 42804 KB Output is correct
13 Correct 41 ms 42772 KB Output is correct
14 Correct 42 ms 42744 KB Output is correct
15 Correct 42 ms 42872 KB Output is correct
16 Correct 44 ms 42860 KB Output is correct
17 Correct 42 ms 42876 KB Output is correct
18 Correct 43 ms 42872 KB Output is correct
19 Correct 43 ms 43020 KB Output is correct
20 Correct 43 ms 42872 KB Output is correct
21 Correct 55 ms 42904 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 55 ms 43000 KB Output is correct
24 Correct 54 ms 43000 KB Output is correct
25 Correct 52 ms 42876 KB Output is correct
26 Correct 52 ms 42872 KB Output is correct
27 Correct 42 ms 42852 KB Output is correct
28 Correct 42 ms 42944 KB Output is correct
29 Correct 42 ms 42872 KB Output is correct
30 Correct 42 ms 42744 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 42616 KB Output is correct
2 Correct 41 ms 42616 KB Output is correct
3 Correct 41 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 44 ms 42800 KB Output is correct
7 Correct 44 ms 42872 KB Output is correct
8 Correct 43 ms 43000 KB Output is correct
9 Correct 44 ms 43000 KB Output is correct
10 Correct 43 ms 42872 KB Output is correct
11 Correct 43 ms 42872 KB Output is correct
12 Correct 44 ms 42804 KB Output is correct
13 Correct 41 ms 42772 KB Output is correct
14 Correct 42 ms 42744 KB Output is correct
15 Correct 42 ms 42872 KB Output is correct
16 Correct 44 ms 42860 KB Output is correct
17 Correct 42 ms 42876 KB Output is correct
18 Correct 43 ms 42872 KB Output is correct
19 Correct 43 ms 43020 KB Output is correct
20 Correct 43 ms 42872 KB Output is correct
21 Correct 55 ms 42904 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 55 ms 43000 KB Output is correct
24 Correct 54 ms 43000 KB Output is correct
25 Correct 52 ms 42876 KB Output is correct
26 Correct 52 ms 42872 KB Output is correct
27 Correct 42 ms 42852 KB Output is correct
28 Correct 42 ms 42944 KB Output is correct
29 Correct 42 ms 42872 KB Output is correct
30 Correct 42 ms 42744 KB Output is correct
31 Correct 1145 ms 90084 KB Output is correct
32 Correct 282 ms 53308 KB Output is correct
33 Correct 1053 ms 88420 KB Output is correct
34 Correct 1010 ms 88676 KB Output is correct
35 Correct 1186 ms 89944 KB Output is correct
36 Correct 1192 ms 89952 KB Output is correct
37 Correct 980 ms 84324 KB Output is correct
38 Correct 818 ms 84072 KB Output is correct
39 Correct 653 ms 77540 KB Output is correct
40 Correct 724 ms 79016 KB Output is correct
41 Correct 919 ms 83556 KB Output is correct
42 Correct 938 ms 83812 KB Output is correct
43 Correct 267 ms 54536 KB Output is correct
44 Correct 864 ms 82916 KB Output is correct
45 Correct 787 ms 79516 KB Output is correct
46 Correct 629 ms 73156 KB Output is correct
47 Correct 501 ms 71544 KB Output is correct
48 Correct 487 ms 69860 KB Output is correct
49 Correct 607 ms 74724 KB Output is correct
50 Correct 709 ms 81476 KB Output is correct
51 Correct 591 ms 72824 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3997 ms 284452 KB Output is correct
2 Correct 3962 ms 260904 KB Output is correct
3 Correct 3959 ms 407140 KB Output is correct
4 Correct 3728 ms 274712 KB Output is correct
5 Correct 3860 ms 256328 KB Output is correct
6 Correct 3929 ms 261480 KB Output is correct
7 Correct 3917 ms 412488 KB Output is correct
8 Correct 3709 ms 289084 KB Output is correct
9 Correct 3660 ms 270044 KB Output is correct
10 Correct 3662 ms 262596 KB Output is correct
11 Correct 3588 ms 257216 KB Output is correct
12 Correct 3495 ms 262532 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 42616 KB Output is correct
2 Correct 41 ms 42616 KB Output is correct
3 Correct 41 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 44 ms 42800 KB Output is correct
7 Correct 44 ms 42872 KB Output is correct
8 Correct 43 ms 43000 KB Output is correct
9 Correct 44 ms 43000 KB Output is correct
10 Correct 43 ms 42872 KB Output is correct
11 Correct 43 ms 42872 KB Output is correct
12 Correct 44 ms 42804 KB Output is correct
13 Correct 41 ms 42772 KB Output is correct
14 Correct 42 ms 42744 KB Output is correct
15 Correct 42 ms 42872 KB Output is correct
16 Correct 44 ms 42860 KB Output is correct
17 Correct 42 ms 42876 KB Output is correct
18 Correct 43 ms 42872 KB Output is correct
19 Correct 43 ms 43020 KB Output is correct
20 Correct 43 ms 42872 KB Output is correct
21 Correct 55 ms 42904 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 55 ms 43000 KB Output is correct
24 Correct 54 ms 43000 KB Output is correct
25 Correct 52 ms 42876 KB Output is correct
26 Correct 52 ms 42872 KB Output is correct
27 Correct 42 ms 42852 KB Output is correct
28 Correct 42 ms 42944 KB Output is correct
29 Correct 42 ms 42872 KB Output is correct
30 Correct 42 ms 42744 KB Output is correct
31 Correct 1145 ms 90084 KB Output is correct
32 Correct 282 ms 53308 KB Output is correct
33 Correct 1053 ms 88420 KB Output is correct
34 Correct 1010 ms 88676 KB Output is correct
35 Correct 1186 ms 89944 KB Output is correct
36 Correct 1192 ms 89952 KB Output is correct
37 Correct 980 ms 84324 KB Output is correct
38 Correct 818 ms 84072 KB Output is correct
39 Correct 653 ms 77540 KB Output is correct
40 Correct 724 ms 79016 KB Output is correct
41 Correct 919 ms 83556 KB Output is correct
42 Correct 938 ms 83812 KB Output is correct
43 Correct 267 ms 54536 KB Output is correct
44 Correct 864 ms 82916 KB Output is correct
45 Correct 787 ms 79516 KB Output is correct
46 Correct 629 ms 73156 KB Output is correct
47 Correct 501 ms 71544 KB Output is correct
48 Correct 487 ms 69860 KB Output is correct
49 Correct 607 ms 74724 KB Output is correct
50 Correct 709 ms 81476 KB Output is correct
51 Correct 591 ms 72824 KB Output is correct
52 Correct 1053 ms 98904 KB Output is correct
53 Correct 929 ms 89876 KB Output is correct
54 Correct 1131 ms 92004 KB Output is correct
55 Correct 931 ms 90244 KB Output is correct
56 Correct 929 ms 92404 KB Output is correct
57 Correct 848 ms 84832 KB Output is correct
58 Correct 895 ms 89004 KB Output is correct
59 Correct 932 ms 91672 KB Output is correct
60 Correct 917 ms 85424 KB Output is correct
61 Correct 343 ms 69604 KB Output is correct
62 Correct 929 ms 100452 KB Output is correct
63 Correct 1166 ms 95204 KB Output is correct
64 Correct 1119 ms 94052 KB Output is correct
65 Correct 1037 ms 91492 KB Output is correct
66 Correct 923 ms 85856 KB Output is correct
67 Correct 344 ms 55012 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 42616 KB Output is correct
2 Correct 41 ms 42616 KB Output is correct
3 Correct 41 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 44 ms 42800 KB Output is correct
7 Correct 44 ms 42872 KB Output is correct
8 Correct 43 ms 43000 KB Output is correct
9 Correct 44 ms 43000 KB Output is correct
10 Correct 43 ms 42872 KB Output is correct
11 Correct 43 ms 42872 KB Output is correct
12 Correct 44 ms 42804 KB Output is correct
13 Correct 41 ms 42772 KB Output is correct
14 Correct 42 ms 42744 KB Output is correct
15 Correct 42 ms 42872 KB Output is correct
16 Correct 44 ms 42860 KB Output is correct
17 Correct 42 ms 42876 KB Output is correct
18 Correct 43 ms 42872 KB Output is correct
19 Correct 43 ms 43020 KB Output is correct
20 Correct 43 ms 42872 KB Output is correct
21 Correct 55 ms 42904 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 55 ms 43000 KB Output is correct
24 Correct 54 ms 43000 KB Output is correct
25 Correct 52 ms 42876 KB Output is correct
26 Correct 52 ms 42872 KB Output is correct
27 Correct 42 ms 42852 KB Output is correct
28 Correct 42 ms 42944 KB Output is correct
29 Correct 42 ms 42872 KB Output is correct
30 Correct 42 ms 42744 KB Output is correct
31 Correct 1145 ms 90084 KB Output is correct
32 Correct 282 ms 53308 KB Output is correct
33 Correct 1053 ms 88420 KB Output is correct
34 Correct 1010 ms 88676 KB Output is correct
35 Correct 1186 ms 89944 KB Output is correct
36 Correct 1192 ms 89952 KB Output is correct
37 Correct 980 ms 84324 KB Output is correct
38 Correct 818 ms 84072 KB Output is correct
39 Correct 653 ms 77540 KB Output is correct
40 Correct 724 ms 79016 KB Output is correct
41 Correct 919 ms 83556 KB Output is correct
42 Correct 938 ms 83812 KB Output is correct
43 Correct 267 ms 54536 KB Output is correct
44 Correct 864 ms 82916 KB Output is correct
45 Correct 787 ms 79516 KB Output is correct
46 Correct 629 ms 73156 KB Output is correct
47 Correct 501 ms 71544 KB Output is correct
48 Correct 487 ms 69860 KB Output is correct
49 Correct 607 ms 74724 KB Output is correct
50 Correct 709 ms 81476 KB Output is correct
51 Correct 591 ms 72824 KB Output is correct
52 Correct 3997 ms 284452 KB Output is correct
53 Correct 3962 ms 260904 KB Output is correct
54 Correct 3959 ms 407140 KB Output is correct
55 Correct 3728 ms 274712 KB Output is correct
56 Correct 3860 ms 256328 KB Output is correct
57 Correct 3929 ms 261480 KB Output is correct
58 Correct 3917 ms 412488 KB Output is correct
59 Correct 3709 ms 289084 KB Output is correct
60 Correct 3660 ms 270044 KB Output is correct
61 Correct 3662 ms 262596 KB Output is correct
62 Correct 3588 ms 257216 KB Output is correct
63 Correct 3495 ms 262532 KB Output is correct
64 Execution timed out 5037 ms 283176 KB Time limit exceeded
65 Halted 0 ms 0 KB -