oj.uz

Submission #485601

# Submission time Handle Problem Language Result Execution time Memory
485601 2021-11-08T13:40:55 Z cheissmart Bitaro, who Leaps through Time (JOI19_timeleap) C++14
100 / 100
 1246 ms 95812 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("trapv")
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
 
string _reset = "\u001b[0m", _yellow = "\u001b[33m", _bold = "\u001b[1m";
void DBG() { cerr << "]" << _reset << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}
#ifdef CHEISSMART
#define debug(...) cerr << _yellow << _bold << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define debug(...)
#endif
 
const int INF = 1e9 + 7, N = 3e5 + 7;
 
int n, q;

struct node {
	int l, r, x, y;
	ll cost;
	bool type; //0: only l, r
	node(int _l = 0, int _r = 0) {
		l = _l, r = _r;
		x = y = 0, type = 0, cost = 0;
		assert(l <= r);
	}
	pair<int, ll> eval(int pos) {
		ll ans = 0;
		int pre = pos;
		pos = max(pos, l), pos = min(pos, r);
		ans += max(0, pre - pos);
		if(type) {
			ans += cost;
			pre = pos, pos = x;
			ans += max(0, pre - pos);
			pos = y;
		}
		return {pos, ans};
	}
	friend node operator + (node lhs, node rhs) {
		node res;
		if(lhs.type) { 
			res.l = lhs.l, res.r = lhs.r, res.x = lhs.x, res.type = 1;
			auto [pos, cost] = rhs.eval(lhs.y);
			res.cost = lhs.cost + cost;
			res.y = pos;
		} else {
			if(max(lhs.l, rhs.l) <= min(lhs.r, rhs.r)) {
				res = rhs;
				res.l = max(lhs.l, rhs.l);
				res.r = min(lhs.r, rhs.r);
			} else {
				res.l = lhs.l, res.r = lhs.r, res.type = 1;
				if(rhs.l > lhs.r) {
					res.x = rhs.l;
				} else {
					assert(rhs.r < lhs.l);
					res.x = rhs.r;
				}
				tie(res.y, res.cost) = rhs.eval(res.x);
			}
		}
		return res;
	}
};

struct DS {
	node t[N * 4];
	void upd(int pos, node x, int v = 1, int tl = 0, int tr = n) {
		if(tr - tl == 1) {
			assert(pos == tl);
			t[v] = x;
			return;
		}
		int tm = (tl + tr) / 2;
		if(pos < tm)
			upd(pos, x, v * 2, tl, tm);
		else
			upd(pos, x, v * 2 + 1, tm, tr);
		t[v] = t[v * 2] + t[v * 2 + 1];
	}
	void upd(int i, int l, int r) {
		l -= i, r -= i;
		upd(i, node(l, r));
	}
	node qry(int l, int r, int v = 1, int tl = 0, int tr = n) {
		if(l <= tl && tr <= r)
			return t[v];
		int tm = (tl + tr) / 2;
		if(r <= tm)
			return qry(l, r, v * 2, tl, tm);
		else if(l >= tm)
			return qry(l, r, v * 2 + 1, tm, tr);
		else
			return qry(l, r, v * 2, tl, tm) + qry(l, r, v * 2 + 1, tm, tr);
	}
};



DS t1, t2;
 
signed main()
{
	IO_OP;
 
	cin >> n >> q;
	for(int i = 0; i < n - 1; i++) {
		int l, r;
		cin >> l >> r;
		r--;
		t1.upd(i, l, r);
		t2.upd(n - i - 2, l, r);
	}
 
	while(q--) {
		int op;
		cin >> op;
		if(op == 1) {
			int p, l, r;
			cin >> p >> l >> r;
			r--, p--;
			t1.upd(p, l, r);
			t2.upd(n - p - 2, l, r);
		} else {
			int a, b, c, d;
			cin >> a >> b >> c >> d;
			a--, c--;
			if(a == c) {
				cout << max(b - d, 0) << '\n';
			} else if(a < c) {
				b -= a, d -= c;
				// cout << t1.qqry(a, b, c, d) << '\n';
				auto u = t1.qry(a, c);
				auto [pos, cost] = u.eval(b);
				cost += max(pos - d, 0);
				cout << cost << '\n';
			} else { // a > c
				a--;
				a = n - a - 2, c = n - c - 2;
				c++;
				b -= a, d -= c;
				// cout << t2.qqry(a, b, c, d) << '\n';
				auto u = t2.qry(a, c);
				auto [pos, cost] = u.eval(b);
				cost += max(pos - d, 0);
				cout << cost << '\n';
			}
		}
	}
 
}

Compilation message

timeleap.cpp: In function 'node operator+(node, node)':
timeleap.cpp:61:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   61 |    auto [pos, cost] = rhs.eval(lhs.y);
      |         ^
timeleap.cpp: In function 'int main()':
timeleap.cpp:152:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  152 |     auto [pos, cost] = u.eval(b);
      |          ^
timeleap.cpp:162:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  162 |     auto [pos, cost] = u.eval(b);
      |          ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 75432 KB Output is correct
2 Correct 36 ms 75328 KB Output is correct
3 Correct 36 ms 75368 KB Output is correct
4 Correct 34 ms 75352 KB Output is correct
5 Correct 35 ms 75444 KB Output is correct
6 Correct 34 ms 75340 KB Output is correct
7 Correct 34 ms 75360 KB Output is correct
8 Correct 36 ms 75408 KB Output is correct
9 Correct 34 ms 75436 KB Output is correct
10 Correct 34 ms 75332 KB Output is correct
11 Correct 36 ms 75376 KB Output is correct
12 Correct 37 ms 75480 KB Output is correct
13 Correct 36 ms 75336 KB Output is correct
14 Correct 36 ms 75344 KB Output is correct
15 Correct 36 ms 75340 KB Output is correct
16 Correct 36 ms 75368 KB Output is correct
17 Correct 36 ms 75444 KB Output is correct
18 Correct 36 ms 75448 KB Output is correct
19 Correct 36 ms 75332 KB Output is correct
20 Correct 35 ms 75444 KB Output is correct
21 Correct 36 ms 75380 KB Output is correct
22 Correct 37 ms 75564 KB Output is correct
23 Correct 36 ms 75332 KB Output is correct
24 Correct 36 ms 75332 KB Output is correct
25 Correct 36 ms 75408 KB Output is correct
26 Correct 37 ms 75432 KB Output is correct
27 Correct 36 ms 75456 KB Output is correct
28 Correct 36 ms 75408 KB Output is correct
29 Correct 37 ms 75408 KB Output is correct
30 Correct 36 ms 75332 KB Output is correct
31 Correct 36 ms 75404 KB Output is correct
32 Correct 41 ms 75468 KB Output is correct
33 Correct 38 ms 75332 KB Output is correct
34 Correct 36 ms 75420 KB Output is correct
35 Correct 37 ms 75380 KB Output is correct
36 Correct 38 ms 75356 KB Output is correct
37 Correct 37 ms 75380 KB Output is correct
38 Correct 36 ms 75352 KB Output is correct
39 Correct 36 ms 75332 KB Output is correct
40 Correct 36 ms 75436 KB Output is correct
41 Correct 34 ms 75364 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1012 ms 89296 KB Output is correct
2 Correct 979 ms 94276 KB Output is correct
3 Correct 997 ms 94248 KB Output is correct
4 Correct 981 ms 94296 KB Output is correct
5 Correct 1100 ms 94176 KB Output is correct
6 Correct 1004 ms 94140 KB Output is correct
7 Correct 1030 ms 94356 KB Output is correct
8 Correct 1075 ms 95756 KB Output is correct
9 Correct 977 ms 94992 KB Output is correct
10 Correct 1012 ms 95308 KB Output is correct
11 Correct 1020 ms 95300 KB Output is correct
12 Correct 1059 ms 95780 KB Output is correct
13 Correct 1076 ms 95812 KB Output is correct
14 Correct 35 ms 75420 KB Output is correct

Subtask #3
66.0 / 66.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 75432 KB Output is correct
2 Correct 36 ms 75328 KB Output is correct
3 Correct 36 ms 75368 KB Output is correct
4 Correct 34 ms 75352 KB Output is correct
5 Correct 35 ms 75444 KB Output is correct
6 Correct 34 ms 75340 KB Output is correct
7 Correct 34 ms 75360 KB Output is correct
8 Correct 36 ms 75408 KB Output is correct
9 Correct 34 ms 75436 KB Output is correct
10 Correct 34 ms 75332 KB Output is correct
11 Correct 36 ms 75376 KB Output is correct
12 Correct 37 ms 75480 KB Output is correct
13 Correct 36 ms 75336 KB Output is correct
14 Correct 36 ms 75344 KB Output is correct
15 Correct 36 ms 75340 KB Output is correct
16 Correct 36 ms 75368 KB Output is correct
17 Correct 36 ms 75444 KB Output is correct
18 Correct 36 ms 75448 KB Output is correct
19 Correct 36 ms 75332 KB Output is correct
20 Correct 35 ms 75444 KB Output is correct
21 Correct 36 ms 75380 KB Output is correct
22 Correct 37 ms 75564 KB Output is correct
23 Correct 36 ms 75332 KB Output is correct
24 Correct 36 ms 75332 KB Output is correct
25 Correct 36 ms 75408 KB Output is correct
26 Correct 37 ms 75432 KB Output is correct
27 Correct 36 ms 75456 KB Output is correct
28 Correct 36 ms 75408 KB Output is correct
29 Correct 37 ms 75408 KB Output is correct
30 Correct 36 ms 75332 KB Output is correct
31 Correct 36 ms 75404 KB Output is correct
32 Correct 41 ms 75468 KB Output is correct
33 Correct 38 ms 75332 KB Output is correct
34 Correct 36 ms 75420 KB Output is correct
35 Correct 37 ms 75380 KB Output is correct
36 Correct 38 ms 75356 KB Output is correct
37 Correct 37 ms 75380 KB Output is correct
38 Correct 36 ms 75352 KB Output is correct
39 Correct 36 ms 75332 KB Output is correct
40 Correct 36 ms 75436 KB Output is correct
41 Correct 34 ms 75364 KB Output is correct
42 Correct 1012 ms 89296 KB Output is correct
43 Correct 979 ms 94276 KB Output is correct
44 Correct 997 ms 94248 KB Output is correct
45 Correct 981 ms 94296 KB Output is correct
46 Correct 1100 ms 94176 KB Output is correct
47 Correct 1004 ms 94140 KB Output is correct
48 Correct 1030 ms 94356 KB Output is correct
49 Correct 1075 ms 95756 KB Output is correct
50 Correct 977 ms 94992 KB Output is correct
51 Correct 1012 ms 95308 KB Output is correct
52 Correct 1020 ms 95300 KB Output is correct
53 Correct 1059 ms 95780 KB Output is correct
54 Correct 1076 ms 95812 KB Output is correct
55 Correct 35 ms 75420 KB Output is correct
56 Correct 1136 ms 92204 KB Output is correct
57 Correct 1084 ms 91692 KB Output is correct
58 Correct 1179 ms 92484 KB Output is correct
59 Correct 1167 ms 92420 KB Output is correct
60 Correct 1102 ms 91948 KB Output is correct
61 Correct 1189 ms 92588 KB Output is correct
62 Correct 1184 ms 92452 KB Output is correct
63 Correct 1187 ms 92476 KB Output is correct
64 Correct 1213 ms 92476 KB Output is correct
65 Correct 1150 ms 92300 KB Output is correct
66 Correct 1197 ms 92120 KB Output is correct
67 Correct 1220 ms 92484 KB Output is correct
68 Correct 1147 ms 91640 KB Output is correct
69 Correct 1246 ms 92608 KB Output is correct
70 Correct 1135 ms 91856 KB Output is correct
71 Correct 1074 ms 91056 KB Output is correct
72 Correct 1115 ms 91300 KB Output is correct
73 Correct 1196 ms 91916 KB Output is correct
74 Correct 1212 ms 91980 KB Output is correct
75 Correct 1213 ms 92172 KB Output is correct
76 Correct 1204 ms 92612 KB Output is correct
77 Correct 33 ms 75460 KB Output is correct