oj.uz

Submission #166384

# Submission time Handle Problem Language Result Execution time Memory
166384 2019-12-02T03:21:25 Z abil Divide and conquer (IZhO14_divide) C++17
17 / 100
 61 ms 7160 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
#define int long long

using namespace std;

const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (1e15 + 9);

int x[N], g[N], c[N], pr[N], prg[N];
main()
{
	int n;
	scanf("%lld", &n);
	for(int i = 1;i <= n; i++){
		scanf("%lld%lld%lld", &x[i], &g[i], &c[i]);
		pr[i] = pr[i - 1] + c[i];
		prg[i] = prg[i - 1] + g[i];
	}
	int ans = 0;
	for(int i = 1;i <= n; i++){
		int l = i, r = n;
		while(r - l > 1){
			int mid = (r + l) >> 1;
			if(pr[mid] - pr[i - 1] >= x[mid] - x[i]){
				l = mid;
			}
			else{
				r = mid;
			}
		}
		if(pr[r] - pr[i - 1] >= x[r] - x[i]){
			l = r;
		}
		ans = max(ans, prg[l] - prg[i - 1]);
	}
	cout << ans;
}

Compilation message

divide.cpp:17:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
divide.cpp: In function 'int main()':
divide.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
divide.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &x[i], &g[i], &c[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 424 KB Output is correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 6 ms 888 KB Output is correct
3 Correct 6 ms 888 KB Output is correct
4 Correct 25 ms 3320 KB Output is correct
5 Correct 29 ms 3576 KB Output is correct
6 Correct 61 ms 7160 KB Output is correct
7 Correct 52 ms 6008 KB Output is correct
8 Correct 47 ms 6264 KB Output is correct
9 Correct 44 ms 5880 KB Output is correct
10 Incorrect 44 ms 6008 KB Output isn't correct
11 Halted 0 ms 0 KB -