Submission #949142

#TimeUsernameProblemLanguageResultExecution timeMemory
949142quanlt206Gap (APIO16_gap)C++17
0 / 100
16 ms2920 KiB
#include "gap.h" #include<bits/stdc++.h> #define X first #define Y second #define all(x) begin(x), end(x) #define FOR(i, a, b) for(int i = (a); i <= (b); i++) #define FORD(i, b, a) for(int i = (b); i >= (a); i--) #define REP(i, a, b) for (int i = (a); i < (b); i++) #define mxx max_element #define mnn min_element #define SQR(x) (1LL * (x) * (x)) #define MASK(i) (1LL << (i)) #define Point Vector #define left Left #define right Right #define div Div using namespace std; typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ld; typedef pair<db, db> pdb; typedef pair<ld, ld> pld; typedef pair<int, int> pii; typedef pair<int, pii> piii; typedef pair<ll, ll> pll; typedef pair<ll, pll> plll; typedef pair<ll, int> pli; typedef pair<ll, pii> plii; template<class A, class B> bool maximize(A& x, B y) { if (x < y) return x = y, true; else return false; } template<class A, class B> bool minimize(A& x, B y) { if (x > y) return x = y, true; else return false; } /* END OF TEMPLATE */ const int N = 1e5 + 7; ll a[N], b[N]; int n; ll findGap(int T, int n) { int l = 1, r = n; ll s = 0, t = 1e18; while (l <= r) { ll* mn; ll* mx; MinMax(s, t, mn, mx); a[l] = *mn; a[r] = *mx; l++; r--; s = *mn + 1; t = *mx - 1; } ll res = 0; REP(i, 1, n) maximize(res, a[i + 1] - a[i]); return res; }

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:54:15: warning: 'mn' may be used uninitialized in this function [-Wmaybe-uninitialized]
   54 |         MinMax(s, t, mn, mx);
      |         ~~~~~~^~~~~~~~~~~~~~
gap.cpp:54:15: warning: 'mx' may be used uninitialized in this function [-Wmaybe-uninitialized]
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...