oj.uz

Submission #671618

# Submission time Handle Problem Language Result Execution time Memory
671618 2022-12-13T11:10:07 Z smartmonky Divide and conquer (IZhO14_divide) C++14
100 / 100
 29 ms 3484 KB 
#include <bits/stdc++.h>
  
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
using namespace std;
 
const int N = 500001;
int f[N],s[N], pos[N], m[N];
int n;
main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++){
		int a, b, c;
		cin >> a >>b >> c;
		pos[i] = a;
		f[i] = b + f[i - 1];
		s[i] = c + s[i - 1];
		m[i] = s[i] - a;
	}
	for (int i = n - 1; i >= 1; i--){
		m[i] = max(m[i] ,m[i+1]);
	}
	int ans = 0;
	for(int i = 1; i <= n; i++){
		int l = i, r = n, res;
		while(l <= r){
			int mid = (l + r) >> 1;
			if(s[i - 1] - pos[i] <= m[mid]){
				res = mid;
				l = mid + 1;
			}else
				r = mid - 1;
		}
		ans = max(ans ,f[res] - f[i-1]);
	}
	cout << ans;
}

Compilation message

divide.cpp:14:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   14 | main(){
      | ^~~~
divide.cpp: In function 'int main()':
divide.cpp:41:23: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   41 |   ans = max(ans ,f[res] - f[i-1]);
      |                  ~~~~~^

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 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 340 KB Output is correct
19 Correct 0 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 1 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 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 340 KB Output is correct
19 Correct 0 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 1 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 3 ms 648 KB Output is correct
28 Correct 14 ms 1876 KB Output is correct
29 Correct 14 ms 1896 KB Output is correct
30 Correct 29 ms 3392 KB Output is correct
31 Correct 23 ms 3412 KB Output is correct
32 Correct 25 ms 3468 KB Output is correct
33 Correct 24 ms 3412 KB Output is correct
34 Correct 28 ms 3448 KB Output is correct
35 Correct 25 ms 3484 KB Output is correct
36 Correct 26 ms 3412 KB Output is correct