oj.uz

Submission #33578

# Submission time Handle Problem Language Result Execution time Memory
33578 2017-10-30T09:43:23 Z RockyB Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 8036 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n;
ll ans;
int x[N], g[N], d[N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> x[i] >> g[i] >> d[i];;
	}
	for (int i = 1; i <= n; i++) {
		ll cur = 0, can = 0;
		for (int j = i; j <= n; j++) {
			can += d[j];
			cur += g[j];
			if (x[j] - x[i] <= can) ans = max(ans, cur);
		}
	}
	cout << ans;
	ioi
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 8036 KB Output is correct
2 Correct 86 ms 8036 KB Output is correct
3 Correct 83 ms 8036 KB Output is correct
4 Execution timed out 1000 ms 8036 KB Execution timed out
5 Halted 0 ms 0 KB -