oj.uz

Submission #91517

# Submission time Handle Problem Language Result Execution time Memory
91517 2018-12-28T03:39:30 Z SOIVIEONE Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 4388 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>

#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a)*(a)
#define M(a, b) make_pair(a,b)
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) (x.begin(), x.end())
#define deb(x) cerr << #x << " = " << x << '\n'
#define N 222222

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

const ld pi = 2 * acos(0.0);
template<class T> bool umin(T& a, T b){if(a>b){a=b;return 1;}return 0;}
template<class T> bool umax(T& a, T b){if(a<b){a=b;return 1;}return 0;}
template<class T, class TT> bool pal(T a, TT n){int k=0;for(int i=0;i<=n/2;i++){if(a[i]!=a[n-i-1]){k=1;break;}}return k?0:1;}

//int month[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
ll x[N], g[N], e[N], dp[N], pd[N];
int main()
{
	int n;
	cin >> n;
	for(int i = 1; i <= n; i ++)
		cin >> x[i] >> g[i] >> e[i],
		dp[i] += dp[i - 1] + e[i],
		pd[i] += pd[i - 1] + g[i];
	ll ans = 0;
	for(int i = 1; i <= n; i ++)
	for(int j = i; j <= n; j ++)
	{
		ll q = dp[j] - dp[i - 1];
		if(x[j] - x[i] > q)
			continue;
		umax(ans, (ll)((pd[j] - pd[i - 1])));
	}
	cout << ans;




	





	getchar();
	getchar();
	return 0;
	//ios::sync_with_stdio(false);
	//cin.tie(0);
}

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 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 556 KB Output is correct
5 Correct 2 ms 556 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 2 ms 672 KB Output is correct
10 Correct 2 ms 672 KB Output is correct
11 Correct 2 ms 672 KB Output is correct
12 Correct 2 ms 672 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 672 KB Output is correct
2 Correct 2 ms 672 KB Output is correct
3 Correct 2 ms 672 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 3 ms 904 KB Output is correct
6 Correct 4 ms 904 KB Output is correct
7 Correct 3 ms 904 KB Output is correct
8 Correct 3 ms 916 KB Output is correct
9 Correct 4 ms 916 KB Output is correct
10 Correct 5 ms 1092 KB Output is correct
11 Correct 17 ms 1132 KB Output is correct
12 Correct 17 ms 1244 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1348 KB Output is correct
2 Correct 65 ms 1688 KB Output is correct
3 Correct 76 ms 1868 KB Output is correct
4 Execution timed out 1081 ms 4388 KB Time limit exceeded
5 Halted 0 ms 0 KB -