oj.uz

답안 #630914

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630914 2022-08-17T10:24:47 Z valerikk Bitaro, who Leaps through Time (JOI19_timeleap) C++17
4 / 100
 3000 ms 8064 KB 
#include <bits/stdc++.h>

using namespace std;

long long solve(vector<int> l, vector<int> r) {
	int n = l.size();
	for (int i = 0; i < n; ++i) {
		l[i] -= i;
		r[i] -= i;
	}
	int t = -1e9;
	long long res = 0;
	for (int i = 0; i < n; ++i) {
		if (t > r[i]) {
			res += t - r[i];
			t = r[i];
		}
		if (t < l[i]) {
			t = l[i];
		}
	}
	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, q;
	cin >> n >> q;
	vector<int> l(n), r(n);
	for (int i = 0; i < n - 1; ++i) {
		cin >> l[i] >> r[i];
		--r[i];
	}
	while (q--) {
		int t;
		cin >> t;
		if (t == 1) {
			int p, s, e;
			cin >> p >> s >> e;
			--p, --e;
			l[p] = s, r[p] = e;
		}
		if (t == 2) {
			int a, b, c, d;
			cin >> a >> b >> c >> d;
			--a, --c;
			if (a == c) {
				cout << max(0, b - d) << "\n";
			} else {
				vector<int> cl, cr;
				cl.push_back(b - 1);
				cr.push_back(b - 1);
				if (a < c) {
					for (int i = a; i < c; ++i) {
						cl.push_back(l[i]);
						cr.push_back(r[i]);
					}
				} else {
					for (int i = a - 1; i >= c; --i) {
						cl.push_back(l[i]);
						cr.push_back(r[i]);
					}
				}
				cl.push_back(d);
				cr.push_back(d);
				cout << solve(cl, cr) << "\n";
			}
		}
	}
	return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 3 ms 352 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 3 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 3 ms 340 KB Output is correct
39 Correct 3 ms 340 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3092 ms 8064 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 66.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 3 ms 352 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 3 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 3 ms 340 KB Output is correct
39 Correct 3 ms 340 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Execution timed out 3092 ms 8064 KB Time limit exceeded
43 Halted 0 ms 0 KB -