oj.uz

Submission #794081

# Submission time Handle Problem Language Result Execution time Memory
794081 2023-07-26T09:09:41 Z alex_2008 Divide and conquer (IZhO14_divide) C++14
100 / 100
 38 ms 7128 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int x[N], suffmx[N];
ll d[N], g[N];
int main() {
	int n;
	scanf("%d", &n);
	vector <pair<ll, int>> v;
	v.push_back({ -2e9, 0 });
	for (int i = 1; i <= n; i++) {
		scanf("%d %lld %lld", &x[i], &g[i], &d[i]);
		d[i] += d[i - 1];
		g[i] += g[i - 1];
		v.push_back({ d[i] - x[i], i });
	}
	sort(v.begin(), v.end());
	for (int i = n; i >= 1; i--) {
		suffmx[i] = max(suffmx[i + 1], v[i].second);
	}
	ll answer = 0;
	for (int i = 1; i <= n; i++) {
		ll cur = d[i - 1] - x[i];
		int l = 1, r = n, ans = -1;
		while (l <= r) {
			int mid = (l + r) / 2;
			if (v[mid].first >= cur) {
				ans = mid;
				r = mid - 1;
			}
			else l = mid + 1;
		}
		answer = max(answer, g[suffmx[ans]] - g[i - 1]);
	}
	printf("%lld\n", answer);
}

Compilation message

divide.cpp: In function 'int main()':
divide.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
divide.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |   scanf("%d %lld %lld", &x[i], &g[i], &d[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 692 KB Output is correct
24 Correct 2 ms 720 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 692 KB Output is correct
24 Correct 2 ms 720 KB Output is correct
25 Correct 2 ms 648 KB Output is correct
26 Correct 4 ms 980 KB Output is correct
27 Correct 4 ms 980 KB Output is correct
28 Correct 21 ms 3400 KB Output is correct
29 Correct 17 ms 3628 KB Output is correct
30 Correct 38 ms 7128 KB Output is correct
31 Correct 31 ms 6036 KB Output is correct
32 Correct 34 ms 6100 KB Output is correct
33 Correct 31 ms 5924 KB Output is correct
34 Correct 33 ms 5848 KB Output is correct
35 Correct 34 ms 6396 KB Output is correct
36 Correct 32 ms 6612 KB Output is correct