Submission #89756

#TimeUsernameProblemLanguageResultExecution timeMemory
89756inomDivide and conquer (IZhO14_divide)C++14
17 / 100
55 ms7424 KiB
#include<bits/stdc++.h> #include<ext/pb_ds/tree_policy.hpp> #include<ext/pb_ds/assoc_container.hpp> #define fi first #define se second #define new new228 #define pb push_back #define rank rank228 #define int long long #define sz(c) (int)(c).size() #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() using namespace std; using namespace __gnu_pbds; #pragma GCC optimize("Ofast") #pragma GCC optimize("no-stack-protector") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native") #pragma GCC optimize("fast-math") #pragma warning(disable : 4996) typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // st.oreder_of_key(); const int L = 20; const int N = 200200; const int INF = 1e15; const int MOD = 998244353; int TN = 1; int n; int x[N], g[N], d[N]; int preg[N], pred[N]; void solve() { scanf("%lld", &n); for (int i = 1; i <= n; i++) { scanf("%lld %lld %lld", x + i, g + i, d + i); pred[i] = pred[i - 1] + d[i]; preg[i] = preg[i - 1] + g[i]; } int l = 1, r = 1, ans = 0; while (l <= r) { // printf("%lld %lld\n", l, r); int len = x[r] - x[l], energy = pred[r] - pred[l - 1]; if (energy < 0) { break; } if (len <= energy) { ans = max(ans, preg[r] - preg[l - 1]); r++; } else { l++; } } printf("%lld\n", ans); return; } signed main() { // ios_base::sync_with_stdio(0); // in; out; // cin >> TN; while (TN--) { solve(); } return 0; }

Compilation message (stderr)

divide.cpp:23:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable : 4996)
 
divide.cpp: In function 'void solve()':
divide.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
divide.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld", x + i, g + i, d + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...