Submission #501034

#	Time	Username	Problem	Language	Result	Execution time	Memory
501034		EliteCallsYou	Divide and conquer (IZhO14_divide)	C++17	17 / 100	2 ms	304 KiB

divide

# include <bits/stdc++.h>
using namespace std ;
//############################################################################
# define read(a)/**/for(int i=0;i<int(sizeof(a)/sizeof(a[0]));i++){cin>>a[i];}
# define print(x)/**/for(auto zx:x){cout<<zx<<' ';}
const char* tochar(string a){return a.c_str();}
void files(){freopen("planting.in","r",stdin);freopen("planting.out","w",stdout);}
void speed(){ios_base::sync_with_stdio(false);cin.tie(0);}
long long gcd(long long a,long long b){if(!b){return a;}a%=b;return gcd(b,a);}
long long lcm(long long a,long long b){return a /gcd(a,b) * b;}
//###########################################################################
const int N = 1e5 + 5 ;
const long long MOD = 1e17+7 ;
//###########################################################################
void hack(){}
//###########################################################################
int main(){
	int n ; cin >> n ;
	int x[n],g[n],e[n] ;
	for ( int i = 0 ; i < n ; i ++ ){
		cin >> x[i] >> g[i] >> e[i] ;
	}
	int mx = 0 ;
	for ( int i = 0 ; i < n ; i ++ ){
		int energy = 0, gold = 0 ;
		for ( int j = i ; j < n ; j ++ ){

			energy += e[j] ;
			gold += g[j] ;

			int dist = x[j]-x[i] ;
			if ( energy >= dist ){
				mx = max(mx,gold) ;
			}
		}
	}
	cout << mx << '\n' ;
}	

Compilation message (stderr)

divide.cpp: In function 'void files()':
divide.cpp:7:21: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | void files(){freopen("planting.in","r",stdin);freopen("planting.out","w",stdout);}
      |              ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
divide.cpp:7:54: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | void files(){freopen("planting.in","r",stdin);freopen("planting.out","w",stdout);}
      |                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 0 / 31
• Subtask 3: 0 / 52