Submission #560819

#TimeUsernameProblemLanguageResultExecution timeMemory
560819tamthegodGap (APIO16_gap)C++14
Compilation error
0 ms0 KiB
#include "gap.h" #include<iostream> #include<iomanip> #include<algorithm> #include<stack> #include<queue> #include<string> #include<string.h> #include<cmath> #include<vector> #include<map> #include<unordered_map> #include<set> #include<unordered_set> #include<cstdio> #include<bitset> #include<chrono> #include<random> #include<ext/rope> /* ordered_set #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> */ #define pb push_back #define fi first #define se second using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; const int maxN = 1e5 + 5; const int mod = 1e9 + 7; const ll oo = 1e18; ll a[maxN]; ll findGap(int T, int n) { ll res = 0; MinMax(0, oo, &a[1], &a[n]); ll pre = a[1]; ll h = (a[n] - a[1] + n - 2) / (n - 1); ll now = a[1]; while(true) { int p, q; MinMax(now, now + h, &p, &q); res = max(res, q - pre); pre = q; now += h; if(q == a[n]) break; } return res; }

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:48:30: error: cannot convert 'int*' to 'long long int*'
   48 |         MinMax(now, now + h, &p, &q);
      |                              ^~
      |                              |
      |                              int*
In file included from gap.cpp:1:
gap.h:1:35: note:   initializing argument 3 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
    1 | void MinMax(long long, long long, long long*, long long*);
      |                                   ^~~~~~~~~~