oj.uz

답안 #113778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113778 2019-05-28T08:12:18 Z ckodser 새 집 (APIO18_new_home) C++14
12 / 100
 5000 ms 126848 KB 
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 200005, INF = 2e8 + 10;
int n, k, A[N], TP[N], L[N], R[N];
int q, B[N], T[N], P[N], rev[N], res[N];
vector < int > U, S[N], E[N], Q[N];
multiset < int > ST[N];
struct SEGT
{
	multiset < int > MS[N * 2];
	inline void Add(int le, int ri, int val)
	{
		le += q; ri += q;
		for (; le < ri; le >>= 1, ri >>= 1)
		{
			if (le & 1) MS[le ++].insert(val);
			if (ri & 1) MS[-- ri].insert(val);
		}
	}
	inline void Del(multiset < int > &SS, int val)
	{
		auto it = SS.lower_bound(val);
		if ((*it) == val)
			SS.erase(it);
	}
	inline void Del(int le, int ri, int val)
	{
		le += q; ri += q;
		for (; le < ri; le >>= 1, ri >>= 1)
		{
			if (le & 1) Del(MS[le], val), le ++;
			if (ri & 1) ri --, Del(MS[ri], val);
		}
	}
	inline int Get(int i)
	{
		int Mn = INT_MAX, Mx = INT_MIN;
		for (int id = i + q; id; id >>= 1)
			if (MS[id].size())
			{
				Mn = min(Mn, *MS[id].begin());
				Mx = max(Mx, *MS[id].rbegin());
			}
		return (max(Mx - B[P[i]], B[P[i]] - Mn));
	}
};
SEGT SG;
inline bool CMP(int i, int j)
{
	return (B[i] < B[j]);
}
inline void Fix(int l, int r, int tp)
{
	B[q] = l; int le = lower_bound(P, P + q, q, CMP) - P;
	B[q] = r; int ri = upper_bound(P, P + q, q, CMP) - P;
	B[q] = (l + r) >> 1; int md = upper_bound(P, P + q, q, CMP) - P;
	if (tp == 1)
	{
		SG.Add(le, md, l);
		SG.Add(md, ri, r);
	}
	else
	{
		SG.Del(le, md, l);
		SG.Del(md, ri, r);
	}
}
int main()
{
	scanf("%d%d%d", &n, &k, &q);
	for (int i = 0; i < n; i++)
		scanf("%d%d%d%d", &A[i], &TP[i], &L[i], &R[i]), U.pb(L[i]), U.pb(R[i] + 1);
	for (int i = 0; i < q; i++)
		scanf("%d%d", &B[i], &T[i]);

	for (int i = 0; i < 10; i++)
		U.pb(i);

	sort(U.begin(), U.end());
	U.resize(unique(U.begin(), U.end()) - U.begin());
	for (int i = 0; i < n; i++)
	{
		L[i] = (int)(lower_bound(U.begin(), U.end(), L[i]) - U.begin());
		R[i] = (int)(lower_bound(U.begin(), U.end(), R[i] + 1) - U.begin());

		S[L[i]].pb(i); E[R[i]].pb(i);
	}
	for (int i = 0; i < q; i++)
	{
		T[i] = (int)(upper_bound(U.begin(), U.end(), T[i]) - U.begin()) - 1;
		Q[T[i]].pb(i); P[i] = i;
	}
	sort(P, P + q, CMP);
	for (int i = 0; i < q; i++)
		rev[P[i]] = i;
	int bad = k;
	for (int i = 1; i <= k; i++)
	{
		ST[i].insert(-INF);
		ST[i].insert(INF);
		SG.Add(0, q, INF);
	}
	for (int i = 0; i <= (int)U.size(); i++)
	{
		for (int &id : E[i])
		{
			int tp = TP[id], l, r;
			auto it = ST[tp].lower_bound(A[id]);
			it = ST[tp].erase(it);
			r = * it; it --; l = * it;
			Fix(l, A[id], -1);
			Fix(A[id], r, -1);
			Fix(l, r, 1);
			bad += (ST[tp].size() == 2);
		}
		for (int &id : S[i])
		{
			int tp = TP[id], l, r;
			bad -= (ST[tp].size() == 2);
			auto it = ST[tp].lower_bound(A[id]);
			r = * it; it --; l = * it;
			ST[tp].insert(A[id]);
			Fix(l, r, -1);
			Fix(l, A[id], 1);
			Fix(A[id], r, 1);
		}
		for (int &id : Q[i])
		{
			if (bad)
				res[id] = -1;
			else
				res[id] = SG.Get(rev[id]);
		}
	}
	for (int i = 0; i < q; i++)
		printf("%d\n", res[i]);
	return 0;
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &k, &q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:74:61: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", &A[i], &TP[i], &L[i], &R[i]), U.pb(L[i]), U.pb(R[i] + 1);
   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
new_home.cpp:76:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &B[i], &T[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 42616 KB Output is correct
2 Correct 35 ms 42624 KB Output is correct
3 Correct 38 ms 42616 KB Output is correct
4 Correct 38 ms 42716 KB Output is correct
5 Correct 39 ms 42744 KB Output is correct
6 Correct 40 ms 42744 KB Output is correct
7 Correct 39 ms 42872 KB Output is correct
8 Correct 40 ms 43000 KB Output is correct
9 Correct 40 ms 43100 KB Output is correct
10 Correct 38 ms 42744 KB Output is correct
11 Correct 39 ms 42716 KB Output is correct
12 Correct 39 ms 42872 KB Output is correct
13 Correct 39 ms 42744 KB Output is correct
14 Correct 38 ms 42752 KB Output is correct
15 Correct 41 ms 42872 KB Output is correct
16 Correct 39 ms 42872 KB Output is correct
17 Correct 39 ms 42752 KB Output is correct
18 Correct 41 ms 42744 KB Output is correct
19 Correct 40 ms 42872 KB Output is correct
20 Correct 39 ms 42744 KB Output is correct
21 Correct 38 ms 42864 KB Output is correct
22 Correct 39 ms 43008 KB Output is correct
23 Correct 40 ms 43000 KB Output is correct
24 Correct 39 ms 42872 KB Output is correct
25 Correct 42 ms 42744 KB Output is correct
26 Correct 39 ms 42624 KB Output is correct
27 Correct 43 ms 42716 KB Output is correct
28 Correct 38 ms 42744 KB Output is correct
29 Correct 38 ms 42744 KB Output is correct
30 Correct 40 ms 42676 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 42616 KB Output is correct
2 Correct 35 ms 42624 KB Output is correct
3 Correct 38 ms 42616 KB Output is correct
4 Correct 38 ms 42716 KB Output is correct
5 Correct 39 ms 42744 KB Output is correct
6 Correct 40 ms 42744 KB Output is correct
7 Correct 39 ms 42872 KB Output is correct
8 Correct 40 ms 43000 KB Output is correct
9 Correct 40 ms 43100 KB Output is correct
10 Correct 38 ms 42744 KB Output is correct
11 Correct 39 ms 42716 KB Output is correct
12 Correct 39 ms 42872 KB Output is correct
13 Correct 39 ms 42744 KB Output is correct
14 Correct 38 ms 42752 KB Output is correct
15 Correct 41 ms 42872 KB Output is correct
16 Correct 39 ms 42872 KB Output is correct
17 Correct 39 ms 42752 KB Output is correct
18 Correct 41 ms 42744 KB Output is correct
19 Correct 40 ms 42872 KB Output is correct
20 Correct 39 ms 42744 KB Output is correct
21 Correct 38 ms 42864 KB Output is correct
22 Correct 39 ms 43008 KB Output is correct
23 Correct 40 ms 43000 KB Output is correct
24 Correct 39 ms 42872 KB Output is correct
25 Correct 42 ms 42744 KB Output is correct
26 Correct 39 ms 42624 KB Output is correct
27 Correct 43 ms 42716 KB Output is correct
28 Correct 38 ms 42744 KB Output is correct
29 Correct 38 ms 42744 KB Output is correct
30 Correct 40 ms 42676 KB Output is correct
31 Correct 3538 ms 91696 KB Output is correct
32 Correct 2273 ms 60996 KB Output is correct
33 Correct 1144 ms 58232 KB Output is correct
34 Correct 3249 ms 68984 KB Output is correct
35 Correct 2594 ms 83264 KB Output is correct
36 Correct 1195 ms 65444 KB Output is correct
37 Correct 845 ms 52588 KB Output is correct
38 Correct 561 ms 51568 KB Output is correct
39 Correct 459 ms 50876 KB Output is correct
40 Correct 451 ms 50824 KB Output is correct
41 Correct 1305 ms 51436 KB Output is correct
42 Correct 1371 ms 51664 KB Output is correct
43 Correct 255 ms 49540 KB Output is correct
44 Correct 1242 ms 51440 KB Output is correct
45 Correct 974 ms 51064 KB Output is correct
46 Correct 686 ms 50796 KB Output is correct
47 Correct 412 ms 50284 KB Output is correct
48 Correct 442 ms 50316 KB Output is correct
49 Correct 520 ms 50492 KB Output is correct
50 Correct 871 ms 51088 KB Output is correct
51 Correct 509 ms 50580 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 109 ms 47460 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 116 ms 47516 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 42616 KB Output is correct
2 Correct 35 ms 42624 KB Output is correct
3 Correct 38 ms 42616 KB Output is correct
4 Correct 38 ms 42716 KB Output is correct
5 Correct 39 ms 42744 KB Output is correct
6 Correct 40 ms 42744 KB Output is correct
7 Correct 39 ms 42872 KB Output is correct
8 Correct 40 ms 43000 KB Output is correct
9 Correct 40 ms 43100 KB Output is correct
10 Correct 38 ms 42744 KB Output is correct
11 Correct 39 ms 42716 KB Output is correct
12 Correct 39 ms 42872 KB Output is correct
13 Correct 39 ms 42744 KB Output is correct
14 Correct 38 ms 42752 KB Output is correct
15 Correct 41 ms 42872 KB Output is correct
16 Correct 39 ms 42872 KB Output is correct
17 Correct 39 ms 42752 KB Output is correct
18 Correct 41 ms 42744 KB Output is correct
19 Correct 40 ms 42872 KB Output is correct
20 Correct 39 ms 42744 KB Output is correct
21 Correct 38 ms 42864 KB Output is correct
22 Correct 39 ms 43008 KB Output is correct
23 Correct 40 ms 43000 KB Output is correct
24 Correct 39 ms 42872 KB Output is correct
25 Correct 42 ms 42744 KB Output is correct
26 Correct 39 ms 42624 KB Output is correct
27 Correct 43 ms 42716 KB Output is correct
28 Correct 38 ms 42744 KB Output is correct
29 Correct 38 ms 42744 KB Output is correct
30 Correct 40 ms 42676 KB Output is correct
31 Correct 3538 ms 91696 KB Output is correct
32 Correct 2273 ms 60996 KB Output is correct
33 Correct 1144 ms 58232 KB Output is correct
34 Correct 3249 ms 68984 KB Output is correct
35 Correct 2594 ms 83264 KB Output is correct
36 Correct 1195 ms 65444 KB Output is correct
37 Correct 845 ms 52588 KB Output is correct
38 Correct 561 ms 51568 KB Output is correct
39 Correct 459 ms 50876 KB Output is correct
40 Correct 451 ms 50824 KB Output is correct
41 Correct 1305 ms 51436 KB Output is correct
42 Correct 1371 ms 51664 KB Output is correct
43 Correct 255 ms 49540 KB Output is correct
44 Correct 1242 ms 51440 KB Output is correct
45 Correct 974 ms 51064 KB Output is correct
46 Correct 686 ms 50796 KB Output is correct
47 Correct 412 ms 50284 KB Output is correct
48 Correct 442 ms 50316 KB Output is correct
49 Correct 520 ms 50492 KB Output is correct
50 Correct 871 ms 51088 KB Output is correct
51 Correct 509 ms 50580 KB Output is correct
52 Correct 2791 ms 126848 KB Output is correct
53 Correct 2496 ms 101708 KB Output is correct
54 Correct 4605 ms 120356 KB Output is correct
55 Correct 2410 ms 77556 KB Output is correct
56 Correct 2370 ms 90268 KB Output is correct
57 Correct 1897 ms 59260 KB Output is correct
58 Correct 2542 ms 77648 KB Output is correct
59 Correct 2510 ms 90608 KB Output is correct
60 Correct 1942 ms 59544 KB Output is correct
61 Correct 812 ms 86120 KB Output is correct
62 Correct 2825 ms 126812 KB Output is correct
63 Correct 3811 ms 112048 KB Output is correct
64 Correct 4136 ms 99540 KB Output is correct
65 Correct 3654 ms 67192 KB Output is correct
66 Correct 1586 ms 52460 KB Output is correct
67 Execution timed out 5033 ms 63240 KB Time limit exceeded

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 42616 KB Output is correct
2 Correct 35 ms 42624 KB Output is correct
3 Correct 38 ms 42616 KB Output is correct
4 Correct 38 ms 42716 KB Output is correct
5 Correct 39 ms 42744 KB Output is correct
6 Correct 40 ms 42744 KB Output is correct
7 Correct 39 ms 42872 KB Output is correct
8 Correct 40 ms 43000 KB Output is correct
9 Correct 40 ms 43100 KB Output is correct
10 Correct 38 ms 42744 KB Output is correct
11 Correct 39 ms 42716 KB Output is correct
12 Correct 39 ms 42872 KB Output is correct
13 Correct 39 ms 42744 KB Output is correct
14 Correct 38 ms 42752 KB Output is correct
15 Correct 41 ms 42872 KB Output is correct
16 Correct 39 ms 42872 KB Output is correct
17 Correct 39 ms 42752 KB Output is correct
18 Correct 41 ms 42744 KB Output is correct
19 Correct 40 ms 42872 KB Output is correct
20 Correct 39 ms 42744 KB Output is correct
21 Correct 38 ms 42864 KB Output is correct
22 Correct 39 ms 43008 KB Output is correct
23 Correct 40 ms 43000 KB Output is correct
24 Correct 39 ms 42872 KB Output is correct
25 Correct 42 ms 42744 KB Output is correct
26 Correct 39 ms 42624 KB Output is correct
27 Correct 43 ms 42716 KB Output is correct
28 Correct 38 ms 42744 KB Output is correct
29 Correct 38 ms 42744 KB Output is correct
30 Correct 40 ms 42676 KB Output is correct
31 Correct 3538 ms 91696 KB Output is correct
32 Correct 2273 ms 60996 KB Output is correct
33 Correct 1144 ms 58232 KB Output is correct
34 Correct 3249 ms 68984 KB Output is correct
35 Correct 2594 ms 83264 KB Output is correct
36 Correct 1195 ms 65444 KB Output is correct
37 Correct 845 ms 52588 KB Output is correct
38 Correct 561 ms 51568 KB Output is correct
39 Correct 459 ms 50876 KB Output is correct
40 Correct 451 ms 50824 KB Output is correct
41 Correct 1305 ms 51436 KB Output is correct
42 Correct 1371 ms 51664 KB Output is correct
43 Correct 255 ms 49540 KB Output is correct
44 Correct 1242 ms 51440 KB Output is correct
45 Correct 974 ms 51064 KB Output is correct
46 Correct 686 ms 50796 KB Output is correct
47 Correct 412 ms 50284 KB Output is correct
48 Correct 442 ms 50316 KB Output is correct
49 Correct 520 ms 50492 KB Output is correct
50 Correct 871 ms 51088 KB Output is correct
51 Correct 509 ms 50580 KB Output is correct
52 Execution timed out 109 ms 47460 KB Time limit exceeded (wall clock)
53 Halted 0 ms 0 KB -