Submission #671584

#	Time	Username	Problem	Language	Result	Execution time	Memory
671584		Baytoro	Divide and conquer (IZhO14_divide)	C++17	48 / 100	1093 ms	1876 KiB

divide

#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e9+9,mod=1e9+7;
int n,m;
int f(vector<int> xs, vector<int> ds, int id){
	vector<int> suf(n+2);
	for(int i=id;i<=n;i++){
		suf[i]=(ds[i]-ds[id-1])-(xs[i]-xs[id]);
	}
	for(int i=n;i>=0;i--){
		if(i<n) suf[i]=max(suf[i-1],suf[i]);
		if(suf[i]>=0) return i;
	}
	return n;
}
void solve(){
	cin>>n;
	vector<int> x(n+1),g(n+1),d(n+1),suf(n+1);
	for(int i=1;i<=n;i++)
		cin>>x[i]>>g[i]>>d[i];
	for(int i=1;i<=n;i++){
		d[i]+=d[i-1];
		g[i]+=g[i-1];
	}
	int res=0;
	for(int i=1;i<=n;i++){
		for(int j=i;j<=n;j++){
			if(d[j]-d[i-1]>=x[j]-x[i]){
				//cout<<i<<' '<<j<<endl;
				res=max(res,g[j]-g[i-1]);
			}
		}
	}
	cout<<res<<endl;
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

Compilation message (stderr)

divide.cpp:48:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   48 | main(){
      | ^~~~
divide.cpp: In function 'void fopn(std::string)':
divide.cpp:12:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
divide.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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