oj.uz

Submission #88306

# Submission time Handle Problem Language Result Execution time Memory
88306 2018-12-05T08:49:28 Z dimash241 Divide and conquer (IZhO14_divide) C++17
17 / 100
 153 ms 1944 KB 
# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (int i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (int i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int x[N], g[N], d[N];

int main () {
	cin >> n;
	For (i, 1, n) cin >> x[i] >> g[i] >> d[i];

    ll ans = 0, r = 1;
    ll sum = d[1], gold = g[1];
    	
    For (i, 1, n) {
    	if (r < i) {
    		sum = d[i], gold = g[i];
    		r = i;
    	}
    	while (r + 1 <= n && sum + d[r + 1] >= x[r + 1] - x[i]) {
    		r ++;
    		sum += d[r];
    		gold += g[r];
    	}

    	ans = max(ans, gold);

    	gold -= g[i];
    	sum -=  d[i];
    }   

    cout << ans;

    return Accepted;
}

// Coded By OB

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 468 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 636 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct

Subtask #2
0 / 31.0

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

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 11 ms 748 KB Output is correct
3 Correct 14 ms 748 KB Output is correct
4 Correct 61 ms 1132 KB Output is correct
5 Correct 71 ms 1136 KB Output is correct
6 Correct 153 ms 1816 KB Output is correct
7 Correct 109 ms 1816 KB Output is correct
8 Correct 114 ms 1944 KB Output is correct
9 Correct 111 ms 1944 KB Output is correct
10 Incorrect 104 ms 1944 KB Output isn't correct
11 Halted 0 ms 0 KB -