#include <bits/stdc++.h>
#include "gap.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
const ll inf = 1e18;
ll a[N];
vector<ll> vec;
void rec(ll l, ll r){
if (l > r) return;
ll mn, mx;
MinMax(l, r, &mn, &mx);
if (mn == -1) return;
vec.pb(mn);
if (mn != mx)
vec.pb(mx);
ll md = (mx+mn)/2;
rec(mn+1, md);
rec(md+1, mx-1);
}
ll findGap(int t, int n)
{
if (t == 1){
int l = 1, r = n;
ll mn = 0, mx = 1e18, ans = 0;
while(l <= r){
ll s = mn, t = mx;
MinMax(s, t, &mn, &mx);
a[l] = mn;
a[r] = mx;
if (l > 1) ans = max(ans, a[l]-a[l-1]);
if (r < n) ans = max(ans, a[r+1]-a[r]);
l++;
r--;
mn++;
mx--;
}
if (n == 2) return a[2]-a[1];
return ans;
}
rec(0, inf);
ll ans = 0;
sort(all(vec));
for (int i = 1; i < vec.size(); i++) ans = max(ans, vec[i]-vec[i-1]);
return ans;
}
// int main ()
// {
// ios::sync_with_stdio(false);
// cin.tie(0);
// cin >> t;
// while (t--){
// }
// }
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:63:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | for (int i = 1; i < vec.size(); i++) ans = max(ans, vec[i]-vec[i-1]);
| ~~^~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
0 ms |
208 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Correct |
0 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
208 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
0 ms |
208 KB |
Output is correct |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
7 ms |
592 KB |
Output is correct |
| 17 |
Correct |
7 ms |
720 KB |
Output is correct |
| 18 |
Correct |
10 ms |
592 KB |
Output is correct |
| 19 |
Correct |
7 ms |
688 KB |
Output is correct |
| 20 |
Correct |
6 ms |
620 KB |
Output is correct |
| 21 |
Correct |
28 ms |
1768 KB |
Output is correct |
| 22 |
Correct |
29 ms |
1832 KB |
Output is correct |
| 23 |
Correct |
29 ms |
1828 KB |
Output is correct |
| 24 |
Correct |
29 ms |
1828 KB |
Output is correct |
| 25 |
Correct |
26 ms |
1828 KB |
Output is correct |
| 26 |
Correct |
29 ms |
1808 KB |
Output is correct |
| 27 |
Correct |
32 ms |
1736 KB |
Output is correct |
| 28 |
Correct |
34 ms |
1864 KB |
Output is correct |
| 29 |
Correct |
28 ms |
1840 KB |
Output is correct |
| 30 |
Correct |
23 ms |
1736 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 6 |
Partially correct |
1 ms |
208 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
336 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 16 |
Partially correct |
11 ms |
848 KB |
Partially correct |
| 17 |
Partially correct |
12 ms |
848 KB |
Partially correct |
| 18 |
Partially correct |
11 ms |
808 KB |
Partially correct |
| 19 |
Partially correct |
11 ms |
848 KB |
Partially correct |
| 20 |
Partially correct |
8 ms |
912 KB |
Partially correct |
| 21 |
Partially correct |
43 ms |
2208 KB |
Partially correct |
| 22 |
Partially correct |
43 ms |
2252 KB |
Partially correct |
| 23 |
Partially correct |
43 ms |
2176 KB |
Partially correct |
| 24 |
Partially correct |
49 ms |
2236 KB |
Partially correct |
| 25 |
Partially correct |
37 ms |
2208 KB |
Partially correct |
| 26 |
Partially correct |
45 ms |
2236 KB |
Partially correct |
| 27 |
Partially correct |
43 ms |
2240 KB |
Partially correct |
| 28 |
Partially correct |
43 ms |
2248 KB |
Partially correct |
| 29 |
Partially correct |
50 ms |
2224 KB |
Partially correct |
| 30 |
Partially correct |
31 ms |
2168 KB |
Partially correct |
| 31 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 32 |
Partially correct |
0 ms |
208 KB |
Partially correct |
