oj.uz

답안 #128456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128456 2019-07-11T00:03:45 Z qkxwsm 새 집 (APIO18_new_home) C++14
57 / 100
 5000 ms 417516 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, 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(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});
	}
	FOR(i, 0, Q)
	{
		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 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);
	vector<array<int, 3> > queries;
	// FOR(i, 0, SZ(events))
	// {
	// 	if (events[i][1] == 0)
	// 	{
	// 		int t = events[i][0], qid = events[i][2], pos = events[i][3];
	// 		queries.PB({pos, t, qid});
	// 	}
	// }
	sort(quer, quer + Q);
	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, 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();
	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:199: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:200: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 39 ms 42616 KB Output is correct
3 Correct 40 ms 42744 KB Output is correct
4 Correct 51 ms 42588 KB Output is correct
5 Correct 42 ms 42744 KB Output is correct
6 Correct 42 ms 42872 KB Output is correct
7 Correct 42 ms 42872 KB Output is correct
8 Correct 42 ms 42872 KB Output is correct
9 Correct 42 ms 42872 KB Output is correct
10 Correct 43 ms 42872 KB Output is correct
11 Correct 42 ms 42872 KB Output is correct
12 Correct 42 ms 42872 KB Output is correct
13 Correct 41 ms 42820 KB Output is correct
14 Correct 41 ms 42744 KB Output is correct
15 Correct 42 ms 42872 KB Output is correct
16 Correct 43 ms 42872 KB Output is correct
17 Correct 43 ms 42872 KB Output is correct
18 Correct 43 ms 42872 KB Output is correct
19 Correct 43 ms 42872 KB Output is correct
20 Correct 43 ms 42812 KB Output is correct
21 Correct 41 ms 42932 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 43 ms 42872 KB Output is correct
24 Correct 43 ms 42872 KB Output is correct
25 Correct 42 ms 42872 KB Output is correct
26 Correct 42 ms 42872 KB Output is correct
27 Correct 53 ms 42744 KB Output is correct
28 Correct 51 ms 42872 KB Output is correct
29 Correct 50 ms 42796 KB Output is correct
30 Correct 41 ms 42716 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 42616 KB Output is correct
2 Correct 39 ms 42616 KB Output is correct
3 Correct 40 ms 42744 KB Output is correct
4 Correct 51 ms 42588 KB Output is correct
5 Correct 42 ms 42744 KB Output is correct
6 Correct 42 ms 42872 KB Output is correct
7 Correct 42 ms 42872 KB Output is correct
8 Correct 42 ms 42872 KB Output is correct
9 Correct 42 ms 42872 KB Output is correct
10 Correct 43 ms 42872 KB Output is correct
11 Correct 42 ms 42872 KB Output is correct
12 Correct 42 ms 42872 KB Output is correct
13 Correct 41 ms 42820 KB Output is correct
14 Correct 41 ms 42744 KB Output is correct
15 Correct 42 ms 42872 KB Output is correct
16 Correct 43 ms 42872 KB Output is correct
17 Correct 43 ms 42872 KB Output is correct
18 Correct 43 ms 42872 KB Output is correct
19 Correct 43 ms 42872 KB Output is correct
20 Correct 43 ms 42812 KB Output is correct
21 Correct 41 ms 42932 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 43 ms 42872 KB Output is correct
24 Correct 43 ms 42872 KB Output is correct
25 Correct 42 ms 42872 KB Output is correct
26 Correct 42 ms 42872 KB Output is correct
27 Correct 53 ms 42744 KB Output is correct
28 Correct 51 ms 42872 KB Output is correct
29 Correct 50 ms 42796 KB Output is correct
30 Correct 41 ms 42716 KB Output is correct
31 Correct 1270 ms 90596 KB Output is correct
32 Correct 312 ms 55136 KB Output is correct
33 Correct 1137 ms 89056 KB Output is correct
34 Correct 1081 ms 89400 KB Output is correct
35 Correct 1221 ms 90480 KB Output is correct
36 Correct 1272 ms 90628 KB Output is correct
37 Correct 902 ms 84868 KB Output is correct
38 Correct 883 ms 84640 KB Output is correct
39 Correct 722 ms 78248 KB Output is correct
40 Correct 770 ms 79708 KB Output is correct
41 Correct 909 ms 84132 KB Output is correct
42 Correct 937 ms 84416 KB Output is correct
43 Correct 276 ms 56672 KB Output is correct
44 Correct 932 ms 83628 KB Output is correct
45 Correct 1025 ms 80096 KB Output is correct
46 Correct 656 ms 73824 KB Output is correct
47 Correct 641 ms 72152 KB Output is correct
48 Correct 538 ms 70768 KB Output is correct
49 Correct 632 ms 75412 KB Output is correct
50 Correct 847 ms 82116 KB Output is correct
51 Correct 645 ms 73740 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4018 ms 288672 KB Output is correct
2 Correct 4059 ms 265268 KB Output is correct
3 Correct 4222 ms 411524 KB Output is correct
4 Correct 3894 ms 279700 KB Output is correct
5 Correct 4290 ms 261084 KB Output is correct
6 Correct 4030 ms 266308 KB Output is correct
7 Correct 4035 ms 417516 KB Output is correct
8 Correct 3817 ms 293856 KB Output is correct
9 Correct 3780 ms 275080 KB Output is correct
10 Correct 3740 ms 267456 KB Output is correct
11 Correct 3705 ms 261976 KB Output is correct
12 Correct 3552 ms 267508 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5035 ms 287808 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 39 ms 42616 KB Output is correct
3 Correct 40 ms 42744 KB Output is correct
4 Correct 51 ms 42588 KB Output is correct
5 Correct 42 ms 42744 KB Output is correct
6 Correct 42 ms 42872 KB Output is correct
7 Correct 42 ms 42872 KB Output is correct
8 Correct 42 ms 42872 KB Output is correct
9 Correct 42 ms 42872 KB Output is correct
10 Correct 43 ms 42872 KB Output is correct
11 Correct 42 ms 42872 KB Output is correct
12 Correct 42 ms 42872 KB Output is correct
13 Correct 41 ms 42820 KB Output is correct
14 Correct 41 ms 42744 KB Output is correct
15 Correct 42 ms 42872 KB Output is correct
16 Correct 43 ms 42872 KB Output is correct
17 Correct 43 ms 42872 KB Output is correct
18 Correct 43 ms 42872 KB Output is correct
19 Correct 43 ms 42872 KB Output is correct
20 Correct 43 ms 42812 KB Output is correct
21 Correct 41 ms 42932 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 43 ms 42872 KB Output is correct
24 Correct 43 ms 42872 KB Output is correct
25 Correct 42 ms 42872 KB Output is correct
26 Correct 42 ms 42872 KB Output is correct
27 Correct 53 ms 42744 KB Output is correct
28 Correct 51 ms 42872 KB Output is correct
29 Correct 50 ms 42796 KB Output is correct
30 Correct 41 ms 42716 KB Output is correct
31 Correct 1270 ms 90596 KB Output is correct
32 Correct 312 ms 55136 KB Output is correct
33 Correct 1137 ms 89056 KB Output is correct
34 Correct 1081 ms 89400 KB Output is correct
35 Correct 1221 ms 90480 KB Output is correct
36 Correct 1272 ms 90628 KB Output is correct
37 Correct 902 ms 84868 KB Output is correct
38 Correct 883 ms 84640 KB Output is correct
39 Correct 722 ms 78248 KB Output is correct
40 Correct 770 ms 79708 KB Output is correct
41 Correct 909 ms 84132 KB Output is correct
42 Correct 937 ms 84416 KB Output is correct
43 Correct 276 ms 56672 KB Output is correct
44 Correct 932 ms 83628 KB Output is correct
45 Correct 1025 ms 80096 KB Output is correct
46 Correct 656 ms 73824 KB Output is correct
47 Correct 641 ms 72152 KB Output is correct
48 Correct 538 ms 70768 KB Output is correct
49 Correct 632 ms 75412 KB Output is correct
50 Correct 847 ms 82116 KB Output is correct
51 Correct 645 ms 73740 KB Output is correct
52 Correct 1079 ms 99756 KB Output is correct
53 Correct 955 ms 90960 KB Output is correct
54 Correct 1158 ms 93200 KB Output is correct
55 Correct 1004 ms 91360 KB Output is correct
56 Correct 987 ms 93512 KB Output is correct
57 Correct 1074 ms 85984 KB Output is correct
58 Correct 945 ms 89952 KB Output is correct
59 Correct 991 ms 92504 KB Output is correct
60 Correct 935 ms 86288 KB Output is correct
61 Correct 371 ms 70664 KB Output is correct
62 Correct 985 ms 101344 KB Output is correct
63 Correct 1069 ms 96244 KB Output is correct
64 Correct 1130 ms 95200 KB Output is correct
65 Correct 1082 ms 92380 KB Output is correct
66 Correct 1149 ms 86712 KB Output is correct
67 Correct 392 ms 56380 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 42616 KB Output is correct
2 Correct 39 ms 42616 KB Output is correct
3 Correct 40 ms 42744 KB Output is correct
4 Correct 51 ms 42588 KB Output is correct
5 Correct 42 ms 42744 KB Output is correct
6 Correct 42 ms 42872 KB Output is correct
7 Correct 42 ms 42872 KB Output is correct
8 Correct 42 ms 42872 KB Output is correct
9 Correct 42 ms 42872 KB Output is correct
10 Correct 43 ms 42872 KB Output is correct
11 Correct 42 ms 42872 KB Output is correct
12 Correct 42 ms 42872 KB Output is correct
13 Correct 41 ms 42820 KB Output is correct
14 Correct 41 ms 42744 KB Output is correct
15 Correct 42 ms 42872 KB Output is correct
16 Correct 43 ms 42872 KB Output is correct
17 Correct 43 ms 42872 KB Output is correct
18 Correct 43 ms 42872 KB Output is correct
19 Correct 43 ms 42872 KB Output is correct
20 Correct 43 ms 42812 KB Output is correct
21 Correct 41 ms 42932 KB Output is correct
22 Correct 43 ms 43000 KB Output is correct
23 Correct 43 ms 42872 KB Output is correct
24 Correct 43 ms 42872 KB Output is correct
25 Correct 42 ms 42872 KB Output is correct
26 Correct 42 ms 42872 KB Output is correct
27 Correct 53 ms 42744 KB Output is correct
28 Correct 51 ms 42872 KB Output is correct
29 Correct 50 ms 42796 KB Output is correct
30 Correct 41 ms 42716 KB Output is correct
31 Correct 1270 ms 90596 KB Output is correct
32 Correct 312 ms 55136 KB Output is correct
33 Correct 1137 ms 89056 KB Output is correct
34 Correct 1081 ms 89400 KB Output is correct
35 Correct 1221 ms 90480 KB Output is correct
36 Correct 1272 ms 90628 KB Output is correct
37 Correct 902 ms 84868 KB Output is correct
38 Correct 883 ms 84640 KB Output is correct
39 Correct 722 ms 78248 KB Output is correct
40 Correct 770 ms 79708 KB Output is correct
41 Correct 909 ms 84132 KB Output is correct
42 Correct 937 ms 84416 KB Output is correct
43 Correct 276 ms 56672 KB Output is correct
44 Correct 932 ms 83628 KB Output is correct
45 Correct 1025 ms 80096 KB Output is correct
46 Correct 656 ms 73824 KB Output is correct
47 Correct 641 ms 72152 KB Output is correct
48 Correct 538 ms 70768 KB Output is correct
49 Correct 632 ms 75412 KB Output is correct
50 Correct 847 ms 82116 KB Output is correct
51 Correct 645 ms 73740 KB Output is correct
52 Correct 4018 ms 288672 KB Output is correct
53 Correct 4059 ms 265268 KB Output is correct
54 Correct 4222 ms 411524 KB Output is correct
55 Correct 3894 ms 279700 KB Output is correct
56 Correct 4290 ms 261084 KB Output is correct
57 Correct 4030 ms 266308 KB Output is correct
58 Correct 4035 ms 417516 KB Output is correct
59 Correct 3817 ms 293856 KB Output is correct
60 Correct 3780 ms 275080 KB Output is correct
61 Correct 3740 ms 267456 KB Output is correct
62 Correct 3705 ms 261976 KB Output is correct
63 Correct 3552 ms 267508 KB Output is correct
64 Execution timed out 5035 ms 287808 KB Time limit exceeded
65 Halted 0 ms 0 KB -