oj.uz

Submission #80969

# Submission time Handle Problem Language Result Execution time Memory
80969 2018-10-23T10:18:07 Z farukkastamonuda Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 4448 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define lo long long 
#define inf 1000000000
#define md 1000000007
#define li 100005
#define mp make_pair
#define pb push_back
using namespace std;
int n,beg;
lo int x[li], g[li], d[li];
lo int cev, sume[li], sumg[li];
int main(){
	scanf("%d", &n);
	//cin>>n;
	for(int i = 1; i <= n; i ++){
		scanf("%lld %lld %lld", &x[i], &g[i], &d[i]);
		sume[i] = sume[i - 1] + d[i];
		sumg[i] = sumg[i - 1] + g[i]; 
	}
	for(int i = 1; i <= n; i ++){
		int bas = i, son = n;
		while(bas <= son){
			int mid = (bas + son) / 2;
			if(x[mid] - x[i] <= sume[mid] - sume[i - 1]) bas = mid + 1;
			else son = son - 1;
		}
		cev = max(cev, sumg[son] - sumg[i - 1]);
	}
	printf("%lld\n", cev);
	return 0;
}

Compilation message

divide.cpp: In function 'int main()':
divide.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
divide.cpp:18: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], &d[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 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 508 KB Output is correct
9 Correct 2 ms 548 KB Output is correct
10 Correct 2 ms 548 KB Output is correct
11 Correct 2 ms 676 KB Output is correct
12 Correct 2 ms 676 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 676 KB Output is correct
2 Correct 2 ms 676 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 3 ms 676 KB Output is correct
5 Correct 4 ms 676 KB Output is correct
6 Correct 3 ms 704 KB Output is correct
7 Correct 2 ms 720 KB Output is correct
8 Correct 2 ms 720 KB Output is correct
9 Correct 4 ms 720 KB Output is correct
10 Correct 6 ms 720 KB Output is correct
11 Correct 23 ms 736 KB Output is correct
12 Correct 26 ms 736 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 736 KB Output is correct
2 Correct 5 ms 992 KB Output is correct
3 Correct 6 ms 992 KB Output is correct
4 Correct 25 ms 2528 KB Output is correct
5 Correct 30 ms 2528 KB Output is correct
6 Correct 60 ms 4448 KB Output is correct
7 Correct 45 ms 4448 KB Output is correct
8 Correct 45 ms 4448 KB Output is correct
9 Correct 43 ms 4448 KB Output is correct
10 Execution timed out 1081 ms 4448 KB Time limit exceeded
11 Halted 0 ms 0 KB -