oj.uz

Submission #955840

# Submission time Handle Problem Language Result Execution time Memory
955840 2024-03-31T15:04:25 Z thunopro Divide and conquer (IZhO14_divide) C++14
0 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 500009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 
#define TIME (1.0*clock()/TIME_PERS_SEC) 
#define re exit(0); 

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ;} 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ;} 

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
}

mt19937 rng (time(0)) ; 

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n ; 
struct shape {
	int x , g , d ; 
}a[maxn];

ll res ; 
ll sumd [maxn] , sumg [maxn] ; 
int main ()
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 
	cin >> n ;
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i].x >> a [i].g >> a [i].d , sumd [i] = sumd [i-1] + a [i].d , sumg [i] = sumg [i-1] + a [i].g ;
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		for ( int j = 0 ; j < i ; j ++ ) 
		{
			if ( a[i].x - a[j].x <= sumd [i] - sumd [j] ) chkmax (res,sumg[i]-sumg[j]) ; 
		}
	}  
	cout << res ; 
}

Compilation message

divide.cpp: In function 'void rf()':
divide.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 17.0

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

Subtask #2
0 / 31.0

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

Subtask #3
0 / 52.0

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