oj.uz

Submission #115257

# Submission time Handle Problem Language Result Execution time Memory
115257 2019-06-06T12:19:05 Z AngusRitossa Bitaro, who Leaps through Time (JOI19_timeleap) C++14
34 / 100
 3000 ms 105832 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
	#define D(x...) printf(x)
#else
	#define D(x...)
#endif
typedef long long ll;
struct zigzag
{
	bool isline;
	int height; // if line
	ll addtoall;
	int a, b; // if not line
	vector<pair<pair<int, int>, pair<bool, int> > > add; // first pair range of elements, 2nd bool as to whether to add current loc, then add amount
};
zigzag merge(zigzag a, zigzag &b)
{
	if (a.isline)
	{
		for (auto f : b.add)
		{
			if (f.first.first <= a.height && a.height <= f.first.second)
			{
				a.addtoall += f.second.second;
				if (f.second.first) a.addtoall += a.height;
			}
		}
		if (b.isline)
		{
			a.addtoall += b.addtoall;
			a.height = b.height;
		}
		else
		{
			if (b.a > a.height) a.height = b.a;
			else if (b.b < a.height) a.height = b.b;
		}
		return a;
	}
	else
	{
		if (b.isline)
		{
			a.isline = 1;
			for (auto f : b.add)
			{
				if (f.first.first <= a.a && a.a <= f.first.second)
				{
					ll am = f.second.second;
					if (f.second.first) am += a.a;
					a.add.push_back({ { -1.1e9, a.a }, { 0, am }});
				}
				int bot = max(f.first.first, a.a+1);
				int top = min(f.first.second, a.b-1);
				if (bot <= top) 
				{
					a.add.push_back({ { bot, top }, f.second });
				}
				if (f.first.first <= a.b && a.b <= f.first.second)
				{
					ll am = f.second.second;
					if (f.second.first) am += a.b;
					a.add.push_back({ { a.b, 1.1e9 }, { 0, am }});
				}
			}
			a.addtoall += b.addtoall;
			a.height = b.height;
			return a;
		}
		else if (b.a >= a.b) // second one is completely above
		{
			// just make a into a line and return
			a.isline = 1;
			a.height = b.a;
			return a;
		}
		else if (b.b <= a.a) // second one is completely below
		{
			// make into a line, moving all groups down
			a.isline = 1;
			a.height = b.b;
			a.add.clear();
			a.add.push_back({ { a.a+1, 1.1e9 }, { 1, -a.height }});
			a.add.push_back({ { -1.1e9, a.a }, { 0, a.a-a.height }});
			return a;
		}
		else // overlap
		{
			a.add.clear();
			a.b = min(a.b, b.b);
			a.a = max(a.a, b.a);
			assert(a.a <= a.b);
			a.add.push_back({ { a.b, 1.1e9 }, { 1, -a.b } });
			if (a.a == a.b)
			{
				a.isline = 1;
				a.height = a.a;
			}
			return a;
		}
	}
}
zigzag rangetree[300010*4];
void update(int node, pair<int, int> val, int curr = 1, int cstart = 0, int cend = 300010)
{
	if (cstart == cend)
	{
		rangetree[curr].a = val.first, rangetree[curr].b = val.second;
		rangetree[curr].add = { { { val.second, 1.1e9 }, { 1, -val.second } } };
		if (rangetree[curr].a == rangetree[curr].b)
		{
			rangetree[curr].isline = 1;
			rangetree[curr].height = rangetree[curr].a;
		}
		else rangetree[curr].isline = 0;
		return;
	}
	int mid = (cstart+cend)/2;
	if (node <= mid) update(node, val, 2*curr, cstart, mid);
	else update(node, val, 2*curr+1, mid+1, cend);
	rangetree[curr] = merge(rangetree[2*curr], rangetree[2*curr+1]);
};
vector<int> qstuff;
void query(int s, int e, int curr = 1, int cstart = 0, int cend = 300010)
{
	if (s <= cstart && cend <= e) { qstuff.push_back(curr); return; }
	int mid = (cstart+cend)/2;
	if (e <= mid) query(s, e, 2*curr, cstart, mid);
	else if (s > mid) query(s, e, 2*curr+1, mid+1, cend);
	else query(s, e, 2*curr, cstart, mid), query(s, e, 2*curr+1, mid+1, cend);
}
ll A[300010], B[300010], C[300010], D[300010], T[300010], L[300010], R[300010], ANS[300010], l[300010], r[300010];
int n, q;
void dothing(bool reverse)
{
	for (int i = 1; i < n; i++) 
	{
		l[i] = L[i], r[i] = R[i];
		if (reverse) l[i] = L[n-i], r[i] = R[n-i];
		l[i]-=i;
		r[i]-=i+1;
		D("%lld %lld\n", l[i], r[i]);
		update(i, { l[i], r[i] });
		assert(l[i] <= r[i]);
	}
	for (int i = 0; i < q; i++)
	{
		ll t, a, b, c, d;
		t = T[i];
		if (t == 1)
		{
			ll a = A[i], x = B[i], y = C[i];
			if (reverse) a = n-a;
			l[a] = x-a, r[a] = y-a-1;
			assert(l[a] <= r[a]);
			update(a, { l[a], r[a] });
			continue;
		}
		a = A[i], b = B[i], c = C[i], d = D[i];
		if (a > c && !reverse) continue;
		if (reverse)
		{
			if (a <= c) continue;
			a = n-a+1, c = n-c+1;
		} 
		b-=a, d-=c;
		if (a == c)
		{
			ANS[i] = max(0ll, b-d);
			continue;
		}
		qstuff.clear();
		query(a, c-1);
		zigzag q = rangetree[qstuff[0]];
		for (int f = 1; f < qstuff.size(); f++) q = merge(q, rangetree[qstuff[f]]);
		ll ans = q.addtoall;
		for (auto f : q.add)
		{
			if (f.first.first <= b && b <= f.first.second)
			{
				ans += f.second.second;
				if (f.second.first) ans += b;
			}
		}
		int endpoint = q.height;
		if (!q.isline)
		{
			if (b < q.a) endpoint = q.a;
			else if (b > q.b) endpoint = q.b;
			else endpoint = b;
		}
		ans += max(0ll, endpoint-d);
		ANS[i] = ans;
	}
}
int main()
{
	scanf("%d%d", &n, &q);
	for (int i = 1; i < n; i++) scanf("%lld%lld", &L[i], &R[i]);
	for (int i = 0; i < q; i++)
	{
		scanf("%lld", &T[i]);
		if (T[i] == 1) scanf("%lld%lld%lld", &A[i], &B[i], &C[i]);
		else scanf("%lld%lld%lld%lld", &A[i], &B[i], &C[i], &D[i]);
	}
	dothing(0);
	dothing(1);
	for (int i = 0; i < q; i++)
	{
		if (T[i] == 2) printf("%lld\n", ANS[i]);
	}
}

Compilation message

timeleap.cpp: In function 'void dothing(bool)':
timeleap.cpp:176:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int f = 1; f < qstuff.size(); f++) q = merge(q, rangetree[qstuff[f]]);
                   ~~^~~~~~~~~~~~~~~
timeleap.cpp: In function 'int main()':
timeleap.cpp:199:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &q);
  ~~~~~^~~~~~~~~~~~~~~~
timeleap.cpp:200:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i < n; i++) scanf("%lld%lld", &L[i], &R[i]);
                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
timeleap.cpp:203:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &T[i]);
   ~~~~~^~~~~~~~~~~~~~~
timeleap.cpp:204:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   if (T[i] == 1) scanf("%lld%lld%lld", &A[i], &B[i], &C[i]);
                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
timeleap.cpp:205:13: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   else scanf("%lld%lld%lld%lld", &A[i], &B[i], &C[i], &D[i]);
        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 56700 KB Output is correct
2 Correct 51 ms 56704 KB Output is correct
3 Correct 50 ms 56824 KB Output is correct
4 Correct 51 ms 56696 KB Output is correct
5 Correct 50 ms 56696 KB Output is correct
6 Correct 50 ms 56824 KB Output is correct
7 Correct 51 ms 56952 KB Output is correct
8 Correct 51 ms 56712 KB Output is correct
9 Correct 52 ms 56696 KB Output is correct
10 Correct 50 ms 56696 KB Output is correct
11 Correct 54 ms 56952 KB Output is correct
12 Correct 57 ms 56952 KB Output is correct
13 Correct 55 ms 56952 KB Output is correct
14 Correct 54 ms 57084 KB Output is correct
15 Correct 56 ms 57080 KB Output is correct
16 Correct 54 ms 56952 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 55 ms 57080 KB Output is correct
19 Correct 57 ms 56956 KB Output is correct
20 Correct 55 ms 56984 KB Output is correct
21 Correct 52 ms 56952 KB Output is correct
22 Correct 52 ms 56920 KB Output is correct
23 Correct 54 ms 56952 KB Output is correct
24 Correct 52 ms 56952 KB Output is correct
25 Correct 52 ms 56952 KB Output is correct
26 Correct 52 ms 56952 KB Output is correct
27 Correct 53 ms 56952 KB Output is correct
28 Correct 54 ms 56916 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 52 ms 56952 KB Output is correct
31 Correct 54 ms 57080 KB Output is correct
32 Correct 54 ms 56952 KB Output is correct
33 Correct 68 ms 56956 KB Output is correct
34 Correct 53 ms 56972 KB Output is correct
35 Correct 53 ms 56952 KB Output is correct
36 Correct 56 ms 56952 KB Output is correct
37 Correct 55 ms 56952 KB Output is correct
38 Correct 54 ms 56952 KB Output is correct
39 Correct 53 ms 56952 KB Output is correct
40 Correct 52 ms 57080 KB Output is correct
41 Correct 48 ms 56824 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1987 ms 103152 KB Output is correct
2 Correct 1973 ms 101628 KB Output is correct
3 Correct 1940 ms 101972 KB Output is correct
4 Correct 1933 ms 101112 KB Output is correct
5 Correct 1984 ms 103128 KB Output is correct
6 Correct 1918 ms 102588 KB Output is correct
7 Correct 1903 ms 103784 KB Output is correct
8 Correct 1971 ms 105160 KB Output is correct
9 Correct 1866 ms 101240 KB Output is correct
10 Correct 2056 ms 103472 KB Output is correct
11 Correct 1979 ms 103276 KB Output is correct
12 Correct 2276 ms 105436 KB Output is correct
13 Correct 2283 ms 105832 KB Output is correct
14 Correct 53 ms 56696 KB Output is correct

Subtask #3
0 / 66.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 56700 KB Output is correct
2 Correct 51 ms 56704 KB Output is correct
3 Correct 50 ms 56824 KB Output is correct
4 Correct 51 ms 56696 KB Output is correct
5 Correct 50 ms 56696 KB Output is correct
6 Correct 50 ms 56824 KB Output is correct
7 Correct 51 ms 56952 KB Output is correct
8 Correct 51 ms 56712 KB Output is correct
9 Correct 52 ms 56696 KB Output is correct
10 Correct 50 ms 56696 KB Output is correct
11 Correct 54 ms 56952 KB Output is correct
12 Correct 57 ms 56952 KB Output is correct
13 Correct 55 ms 56952 KB Output is correct
14 Correct 54 ms 57084 KB Output is correct
15 Correct 56 ms 57080 KB Output is correct
16 Correct 54 ms 56952 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 55 ms 57080 KB Output is correct
19 Correct 57 ms 56956 KB Output is correct
20 Correct 55 ms 56984 KB Output is correct
21 Correct 52 ms 56952 KB Output is correct
22 Correct 52 ms 56920 KB Output is correct
23 Correct 54 ms 56952 KB Output is correct
24 Correct 52 ms 56952 KB Output is correct
25 Correct 52 ms 56952 KB Output is correct
26 Correct 52 ms 56952 KB Output is correct
27 Correct 53 ms 56952 KB Output is correct
28 Correct 54 ms 56916 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 52 ms 56952 KB Output is correct
31 Correct 54 ms 57080 KB Output is correct
32 Correct 54 ms 56952 KB Output is correct
33 Correct 68 ms 56956 KB Output is correct
34 Correct 53 ms 56972 KB Output is correct
35 Correct 53 ms 56952 KB Output is correct
36 Correct 56 ms 56952 KB Output is correct
37 Correct 55 ms 56952 KB Output is correct
38 Correct 54 ms 56952 KB Output is correct
39 Correct 53 ms 56952 KB Output is correct
40 Correct 52 ms 57080 KB Output is correct
41 Correct 48 ms 56824 KB Output is correct
42 Correct 1987 ms 103152 KB Output is correct
43 Correct 1973 ms 101628 KB Output is correct
44 Correct 1940 ms 101972 KB Output is correct
45 Correct 1933 ms 101112 KB Output is correct
46 Correct 1984 ms 103128 KB Output is correct
47 Correct 1918 ms 102588 KB Output is correct
48 Correct 1903 ms 103784 KB Output is correct
49 Correct 1971 ms 105160 KB Output is correct
50 Correct 1866 ms 101240 KB Output is correct
51 Correct 2056 ms 103472 KB Output is correct
52 Correct 1979 ms 103276 KB Output is correct
53 Correct 2276 ms 105436 KB Output is correct
54 Correct 2283 ms 105832 KB Output is correct
55 Correct 53 ms 56696 KB Output is correct
56 Correct 2794 ms 100944 KB Output is correct
57 Correct 2857 ms 98932 KB Output is correct
58 Correct 2956 ms 101840 KB Output is correct
59 Correct 2925 ms 102264 KB Output is correct
60 Correct 2825 ms 100168 KB Output is correct
61 Correct 2937 ms 103416 KB Output is correct
62 Correct 2976 ms 103256 KB Output is correct
63 Execution timed out 3040 ms 103004 KB Time limit exceeded
64 Halted 0 ms 0 KB -