oj.uz

답안 #113777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113777 2019-05-28T08:10:37 Z ckodser 새 집 (APIO18_new_home) C++14
47 / 100
 4616 ms 109944 KB 
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 120005, 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 23 ms 25720 KB Output is correct
2 Correct 23 ms 25728 KB Output is correct
3 Correct 23 ms 25728 KB Output is correct
4 Correct 23 ms 25728 KB Output is correct
5 Correct 26 ms 25856 KB Output is correct
6 Correct 25 ms 25856 KB Output is correct
7 Correct 26 ms 26112 KB Output is correct
8 Correct 26 ms 25984 KB Output is correct
9 Correct 26 ms 25976 KB Output is correct
10 Correct 26 ms 25856 KB Output is correct
11 Correct 25 ms 25728 KB Output is correct
12 Correct 26 ms 25728 KB Output is correct
13 Correct 26 ms 25720 KB Output is correct
14 Correct 26 ms 25880 KB Output is correct
15 Correct 27 ms 25884 KB Output is correct
16 Correct 29 ms 25984 KB Output is correct
17 Correct 27 ms 25856 KB Output is correct
18 Correct 40 ms 25976 KB Output is correct
19 Correct 26 ms 25984 KB Output is correct
20 Correct 25 ms 25856 KB Output is correct
21 Correct 25 ms 25984 KB Output is correct
22 Correct 26 ms 26112 KB Output is correct
23 Correct 26 ms 25984 KB Output is correct
24 Correct 27 ms 25976 KB Output is correct
25 Correct 27 ms 25804 KB Output is correct
26 Correct 25 ms 25728 KB Output is correct
27 Correct 25 ms 25848 KB Output is correct
28 Correct 25 ms 25856 KB Output is correct
29 Correct 25 ms 25728 KB Output is correct
30 Correct 24 ms 25728 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25720 KB Output is correct
2 Correct 23 ms 25728 KB Output is correct
3 Correct 23 ms 25728 KB Output is correct
4 Correct 23 ms 25728 KB Output is correct
5 Correct 26 ms 25856 KB Output is correct
6 Correct 25 ms 25856 KB Output is correct
7 Correct 26 ms 26112 KB Output is correct
8 Correct 26 ms 25984 KB Output is correct
9 Correct 26 ms 25976 KB Output is correct
10 Correct 26 ms 25856 KB Output is correct
11 Correct 25 ms 25728 KB Output is correct
12 Correct 26 ms 25728 KB Output is correct
13 Correct 26 ms 25720 KB Output is correct
14 Correct 26 ms 25880 KB Output is correct
15 Correct 27 ms 25884 KB Output is correct
16 Correct 29 ms 25984 KB Output is correct
17 Correct 27 ms 25856 KB Output is correct
18 Correct 40 ms 25976 KB Output is correct
19 Correct 26 ms 25984 KB Output is correct
20 Correct 25 ms 25856 KB Output is correct
21 Correct 25 ms 25984 KB Output is correct
22 Correct 26 ms 26112 KB Output is correct
23 Correct 26 ms 25984 KB Output is correct
24 Correct 27 ms 25976 KB Output is correct
25 Correct 27 ms 25804 KB Output is correct
26 Correct 25 ms 25728 KB Output is correct
27 Correct 25 ms 25848 KB Output is correct
28 Correct 25 ms 25856 KB Output is correct
29 Correct 25 ms 25728 KB Output is correct
30 Correct 24 ms 25728 KB Output is correct
31 Correct 3478 ms 75640 KB Output is correct
32 Correct 2139 ms 44916 KB Output is correct
33 Correct 1097 ms 41996 KB Output is correct
34 Correct 3180 ms 52720 KB Output is correct
35 Correct 2549 ms 67052 KB Output is correct
36 Correct 1155 ms 49164 KB Output is correct
37 Correct 786 ms 36384 KB Output is correct
38 Correct 492 ms 35180 KB Output is correct
39 Correct 429 ms 34636 KB Output is correct
40 Correct 407 ms 34416 KB Output is correct
41 Correct 1219 ms 35232 KB Output is correct
42 Correct 1354 ms 35312 KB Output is correct
43 Correct 228 ms 33268 KB Output is correct
44 Correct 1188 ms 35180 KB Output is correct
45 Correct 923 ms 34880 KB Output is correct
46 Correct 656 ms 34552 KB Output is correct
47 Correct 398 ms 34160 KB Output is correct
48 Correct 348 ms 34028 KB Output is correct
49 Correct 492 ms 34132 KB Output is correct
50 Correct 913 ms 34680 KB Output is correct
51 Correct 502 ms 34388 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25720 KB Output is correct
2 Correct 23 ms 25728 KB Output is correct
3 Correct 23 ms 25728 KB Output is correct
4 Correct 23 ms 25728 KB Output is correct
5 Correct 26 ms 25856 KB Output is correct
6 Correct 25 ms 25856 KB Output is correct
7 Correct 26 ms 26112 KB Output is correct
8 Correct 26 ms 25984 KB Output is correct
9 Correct 26 ms 25976 KB Output is correct
10 Correct 26 ms 25856 KB Output is correct
11 Correct 25 ms 25728 KB Output is correct
12 Correct 26 ms 25728 KB Output is correct
13 Correct 26 ms 25720 KB Output is correct
14 Correct 26 ms 25880 KB Output is correct
15 Correct 27 ms 25884 KB Output is correct
16 Correct 29 ms 25984 KB Output is correct
17 Correct 27 ms 25856 KB Output is correct
18 Correct 40 ms 25976 KB Output is correct
19 Correct 26 ms 25984 KB Output is correct
20 Correct 25 ms 25856 KB Output is correct
21 Correct 25 ms 25984 KB Output is correct
22 Correct 26 ms 26112 KB Output is correct
23 Correct 26 ms 25984 KB Output is correct
24 Correct 27 ms 25976 KB Output is correct
25 Correct 27 ms 25804 KB Output is correct
26 Correct 25 ms 25728 KB Output is correct
27 Correct 25 ms 25848 KB Output is correct
28 Correct 25 ms 25856 KB Output is correct
29 Correct 25 ms 25728 KB Output is correct
30 Correct 24 ms 25728 KB Output is correct
31 Correct 3478 ms 75640 KB Output is correct
32 Correct 2139 ms 44916 KB Output is correct
33 Correct 1097 ms 41996 KB Output is correct
34 Correct 3180 ms 52720 KB Output is correct
35 Correct 2549 ms 67052 KB Output is correct
36 Correct 1155 ms 49164 KB Output is correct
37 Correct 786 ms 36384 KB Output is correct
38 Correct 492 ms 35180 KB Output is correct
39 Correct 429 ms 34636 KB Output is correct
40 Correct 407 ms 34416 KB Output is correct
41 Correct 1219 ms 35232 KB Output is correct
42 Correct 1354 ms 35312 KB Output is correct
43 Correct 228 ms 33268 KB Output is correct
44 Correct 1188 ms 35180 KB Output is correct
45 Correct 923 ms 34880 KB Output is correct
46 Correct 656 ms 34552 KB Output is correct
47 Correct 398 ms 34160 KB Output is correct
48 Correct 348 ms 34028 KB Output is correct
49 Correct 492 ms 34132 KB Output is correct
50 Correct 913 ms 34680 KB Output is correct
51 Correct 502 ms 34388 KB Output is correct
52 Correct 2878 ms 109944 KB Output is correct
53 Correct 2610 ms 84844 KB Output is correct
54 Correct 4552 ms 103320 KB Output is correct
55 Correct 2260 ms 60656 KB Output is correct
56 Correct 2350 ms 73468 KB Output is correct
57 Correct 1801 ms 42484 KB Output is correct
58 Correct 2565 ms 60736 KB Output is correct
59 Correct 2683 ms 73672 KB Output is correct
60 Correct 2105 ms 42592 KB Output is correct
61 Correct 821 ms 69132 KB Output is correct
62 Correct 3015 ms 109792 KB Output is correct
63 Correct 3971 ms 95112 KB Output is correct
64 Correct 4131 ms 82544 KB Output is correct
65 Correct 3635 ms 50140 KB Output is correct
66 Correct 1459 ms 35620 KB Output is correct
67 Correct 4616 ms 46356 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25720 KB Output is correct
2 Correct 23 ms 25728 KB Output is correct
3 Correct 23 ms 25728 KB Output is correct
4 Correct 23 ms 25728 KB Output is correct
5 Correct 26 ms 25856 KB Output is correct
6 Correct 25 ms 25856 KB Output is correct
7 Correct 26 ms 26112 KB Output is correct
8 Correct 26 ms 25984 KB Output is correct
9 Correct 26 ms 25976 KB Output is correct
10 Correct 26 ms 25856 KB Output is correct
11 Correct 25 ms 25728 KB Output is correct
12 Correct 26 ms 25728 KB Output is correct
13 Correct 26 ms 25720 KB Output is correct
14 Correct 26 ms 25880 KB Output is correct
15 Correct 27 ms 25884 KB Output is correct
16 Correct 29 ms 25984 KB Output is correct
17 Correct 27 ms 25856 KB Output is correct
18 Correct 40 ms 25976 KB Output is correct
19 Correct 26 ms 25984 KB Output is correct
20 Correct 25 ms 25856 KB Output is correct
21 Correct 25 ms 25984 KB Output is correct
22 Correct 26 ms 26112 KB Output is correct
23 Correct 26 ms 25984 KB Output is correct
24 Correct 27 ms 25976 KB Output is correct
25 Correct 27 ms 25804 KB Output is correct
26 Correct 25 ms 25728 KB Output is correct
27 Correct 25 ms 25848 KB Output is correct
28 Correct 25 ms 25856 KB Output is correct
29 Correct 25 ms 25728 KB Output is correct
30 Correct 24 ms 25728 KB Output is correct
31 Correct 3478 ms 75640 KB Output is correct
32 Correct 2139 ms 44916 KB Output is correct
33 Correct 1097 ms 41996 KB Output is correct
34 Correct 3180 ms 52720 KB Output is correct
35 Correct 2549 ms 67052 KB Output is correct
36 Correct 1155 ms 49164 KB Output is correct
37 Correct 786 ms 36384 KB Output is correct
38 Correct 492 ms 35180 KB Output is correct
39 Correct 429 ms 34636 KB Output is correct
40 Correct 407 ms 34416 KB Output is correct
41 Correct 1219 ms 35232 KB Output is correct
42 Correct 1354 ms 35312 KB Output is correct
43 Correct 228 ms 33268 KB Output is correct
44 Correct 1188 ms 35180 KB Output is correct
45 Correct 923 ms 34880 KB Output is correct
46 Correct 656 ms 34552 KB Output is correct
47 Correct 398 ms 34160 KB Output is correct
48 Correct 348 ms 34028 KB Output is correct
49 Correct 492 ms 34132 KB Output is correct
50 Correct 913 ms 34680 KB Output is correct
51 Correct 502 ms 34388 KB Output is correct
52 Execution timed out 67 ms 28652 KB Time limit exceeded (wall clock)
53 Halted 0 ms 0 KB -