Submission #246332

#TimeUsernameProblemLanguageResultExecution timeMemory
246332aloo123Divide and conquer (IZhO14_divide)C++14
48 / 100
1097 ms3328 KiB
#include <algorithm> #include <bitset> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <limits> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <ratio> #include <set> #include <sstream> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> #include <climits> // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/trie_policy.hpp> #define ll long long #define ld long double #define mp make_pair #define pb push_back #define in insert #define vll vector<ll> #define endl "\n" #define pll pair<ll,ll> #define f first #define s second #define int ll #define sz(x) (ll)x.size() #define all(x) (x.begin(),x.end()) using namespace std; // using namespace __gnu_pbds; // typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> os; const ll INF = 1e12; const ll N =(1e5+5); // TODO : change value as per problem const ll MOD = 1e9+7; struct nice { ll x; ll g; ll e; }; nice a[N]; ll gold[N]; ll energy[N]; bool cmp(nice b, nice c){ return (b.x < c.x); } void solve(){ ll n; cin >> n; for(int i =1;i<=n;i++){ cin >> a[i].x >> a[i].g >> a[i].e; gold[i] = gold[i-1] + a[i].g; energy[i] = energy[i-1] + a[i].e; } sort(a+1,a+n+1,cmp); ll ans = 0; for(ll l = 1;l<=n;l++){ for(ll r = l;r<=n;r++){ ll tote = energy[r]-energy[l-1]; if(tote >= (a[r].x-a[l].x)){ ans = max(gold[r]-gold[l-1],ans); } } } cout << ans << endl; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(NULL); ll tt=1; // cin >> tt; while(tt--){ solve(); } } /* Pick a Range [L,R] such that : a) The sum of energy levels in the range >= R-L+1 b) Sum of Gold is maximal Possible */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...