oj.uz

Submission #1040421

# Submission time Handle Problem Language Result Execution time Memory
1040421 2024-08-01T03:49:40 Z vjudge1 Divide and conquer (IZhO14_divide) C++14
100 / 100
 44 ms 7996 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ; 

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

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 add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

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

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 ; 
int x [maxn] , g [maxn] , e [maxn] ; 
ll sume [maxn] , sumg [maxn] ; 

vector<ll> v ; 
void mapping () 
{
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		v . pb (sume[i]-x[i]) , v . pb (sume[i-1]-x[i]) ; 
	}
	sort (v.begin(),v.end()) ; 
	v.resize(unique(v.begin(),v.end())-v.begin()) ; 
}

ll bit [maxn] ; 
void update ( int x , ll w )
{
	while ( x < maxn ) chkmin (bit[x],w) , x += (x&-x) ; 
}
ll get ( int x ) 
{
	ll res = 1e18 ; 
	while ( x ) chkmin (res,bit[x]) , x -= (x&-x) ;
	return res ; 
}
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 >> x [i] >> g [i] >> e [i] ; 
	for ( int i = 1 ; i <= n ; i ++ ) sumg [i] = sumg [i-1] + g [i] , sume [i] = sume [i-1] + e [i] ; 
	
	mapping () ; 
	
	ll res = 0 ; 
	memset (bit,0x3f,sizeof bit) ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		update (_lower(sume[i-1]-x[i]),sumg[i-1]) ; 
		chkmax (res,sumg[i]-get(_lower(sume[i]-x[i]))) ; 
	}
	cout << res ; 
}

Compilation message

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

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 0 ms 4700 KB Output is correct
4 Correct 0 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 0 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 0 ms 4700 KB Output is correct
10 Correct 0 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 3 ms 4956 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 0 ms 4700 KB Output is correct
4 Correct 0 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 0 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 0 ms 4700 KB Output is correct
10 Correct 0 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 3 ms 4956 KB Output is correct
25 Correct 2 ms 5208 KB Output is correct
26 Correct 3 ms 5088 KB Output is correct
27 Correct 4 ms 5088 KB Output is correct
28 Correct 21 ms 6108 KB Output is correct
29 Correct 15 ms 6108 KB Output is correct
30 Correct 34 ms 7896 KB Output is correct
31 Correct 26 ms 7896 KB Output is correct
32 Correct 28 ms 7808 KB Output is correct
33 Correct 26 ms 7996 KB Output is correct
34 Correct 31 ms 7896 KB Output is correct
35 Correct 44 ms 7776 KB Output is correct
36 Correct 27 ms 7892 KB Output is correct