oj.uz

Submission #115256

# Submission time Handle Problem Language Result Execution time Memory
115256 2019-06-06T12:13:13 Z AngusRitossa Bitaro, who Leaps through Time (JOI19_timeleap) C++14
34 / 100
 3000 ms 106708 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 merge2(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]);
};
zigzag query(int s, int e, int curr = 1, int cstart = 0, int cend = 300010)
{
	if (s <= cstart && cend <= e) return rangetree[curr];
	int mid = (cstart+cend)/2;
	if (e <= mid) return query(s, e, 2*curr, cstart, mid);
	else if (s > mid) return query(s, e, 2*curr+1, mid+1, cend);
	else return merge2(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;
		}
		zigzag q = query(a, c-1);
		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()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> q;
	for (int i = 1; i < n; i++) cin >> L[i] >> R[i];
	for (int i = 0; i < q; i++)
	{
		cin >> T[i];
		if (T[i] == 1) cin >> A[i] >> B[i] >> C[i];
		else cin >> A[i] >> B[i] >> C[i] >> D[i];
	}
	dothing(0);
	dothing(1);
	for (int i = 0; i < q; i++)
	{
		if (T[i] == 2) cout << ANS[i] << "\n";
	}
}

Subtask #1
4.0 / 4.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1782 ms 103352 KB Output is correct
2 Correct 1731 ms 103288 KB Output is correct
3 Correct 1767 ms 103560 KB Output is correct
4 Correct 1714 ms 102496 KB Output is correct
5 Correct 1878 ms 104568 KB Output is correct
6 Correct 1825 ms 104004 KB Output is correct
7 Correct 1752 ms 104928 KB Output is correct
8 Correct 1803 ms 106360 KB Output is correct
9 Correct 1646 ms 102648 KB Output is correct
10 Correct 1844 ms 104696 KB Output is correct
11 Correct 1748 ms 104412 KB Output is correct
12 Correct 1855 ms 106516 KB Output is correct
13 Correct 1899 ms 106708 KB Output is correct
14 Correct 50 ms 56796 KB Output is correct

Subtask #3
0 / 66.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 56824 KB Output is correct
2 Correct 52 ms 56824 KB Output is correct
3 Correct 51 ms 56696 KB Output is correct
4 Correct 53 ms 56696 KB Output is correct
5 Correct 52 ms 56824 KB Output is correct
6 Correct 51 ms 56824 KB Output is correct
7 Correct 50 ms 56824 KB Output is correct
8 Correct 53 ms 56824 KB Output is correct
9 Correct 51 ms 56924 KB Output is correct
10 Correct 50 ms 56696 KB Output is correct
11 Correct 55 ms 56952 KB Output is correct
12 Correct 56 ms 56952 KB Output is correct
13 Correct 54 ms 56924 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 54 ms 57080 KB Output is correct
16 Correct 64 ms 56952 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 53 ms 56924 KB Output is correct
19 Correct 52 ms 56952 KB Output is correct
20 Correct 54 ms 57080 KB Output is correct
21 Correct 52 ms 56952 KB Output is correct
22 Correct 53 ms 56924 KB Output is correct
23 Correct 52 ms 56940 KB Output is correct
24 Correct 53 ms 56952 KB Output is correct
25 Correct 52 ms 56880 KB Output is correct
26 Correct 52 ms 56920 KB Output is correct
27 Correct 52 ms 57052 KB Output is correct
28 Correct 53 ms 56956 KB Output is correct
29 Correct 52 ms 56952 KB Output is correct
30 Correct 54 ms 56952 KB Output is correct
31 Correct 70 ms 56952 KB Output is correct
32 Correct 55 ms 56956 KB Output is correct
33 Correct 55 ms 56956 KB Output is correct
34 Correct 55 ms 57080 KB Output is correct
35 Correct 57 ms 56912 KB Output is correct
36 Correct 55 ms 56952 KB Output is correct
37 Correct 62 ms 56952 KB Output is correct
38 Correct 53 ms 56952 KB Output is correct
39 Correct 51 ms 56952 KB Output is correct
40 Correct 57 ms 57080 KB Output is correct
41 Correct 48 ms 56796 KB Output is correct
42 Correct 1782 ms 103352 KB Output is correct
43 Correct 1731 ms 103288 KB Output is correct
44 Correct 1767 ms 103560 KB Output is correct
45 Correct 1714 ms 102496 KB Output is correct
46 Correct 1878 ms 104568 KB Output is correct
47 Correct 1825 ms 104004 KB Output is correct
48 Correct 1752 ms 104928 KB Output is correct
49 Correct 1803 ms 106360 KB Output is correct
50 Correct 1646 ms 102648 KB Output is correct
51 Correct 1844 ms 104696 KB Output is correct
52 Correct 1748 ms 104412 KB Output is correct
53 Correct 1855 ms 106516 KB Output is correct
54 Correct 1899 ms 106708 KB Output is correct
55 Correct 50 ms 56796 KB Output is correct
56 Correct 2819 ms 101976 KB Output is correct
57 Correct 2757 ms 99616 KB Output is correct
58 Correct 2887 ms 102440 KB Output is correct
59 Correct 2962 ms 102888 KB Output is correct
60 Correct 2747 ms 100648 KB Output is correct
61 Correct 2983 ms 103620 KB Output is correct
62 Correct 2907 ms 103632 KB Output is correct
63 Correct 2888 ms 103432 KB Output is correct
64 Correct 2849 ms 103512 KB Output is correct
65 Correct 2934 ms 101920 KB Output is correct
66 Correct 2713 ms 102080 KB Output is correct
67 Correct 2725 ms 103104 KB Output is correct
68 Correct 2616 ms 100760 KB Output is correct
69 Correct 2767 ms 104332 KB Output is correct
70 Correct 2627 ms 100564 KB Output is correct
71 Correct 2746 ms 99584 KB Output is correct
72 Correct 2842 ms 100824 KB Output is correct
73 Execution timed out 3026 ms 103616 KB Time limit exceeded
74 Halted 0 ms 0 KB -