# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
949227 |
2024-03-19T04:00:18 Z |
steveonalex |
Gap (APIO16_gap) |
C++14 |
|
0 ms |
0 KB |
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
int n;
vector<ll> a;
void MinMax(ll l, ll r, ll *mn, ll *mx){
cout << "? " << l << " " << r << "\n";
ll idx1 = lower_bound(ALL(a), l) - a.begin();
ll idx2 = upper_bound(ALL(a), r) - a.begin() - 1;
if (idx1 > idx2){
*mn = -1;
*mx = -1;
}
*mn = a[idx1];
*mx = a[idx2];
}
namespace Sub1{
ll solve(int n){
vector<ll> a;
ll l = 0, r = 1e18;
for(int i = 0; i<n; i += 2){
ll L, R;
MinMax(l, r, &L, &R);
a.push_back(L); a.push_back(R);
l = L + 1, r = R - 1;
}
sort(ALL(a));
ll ans = 0;
for(int i = 1; i<a.size(); ++i) maximize(ans, a[i] - a[i-1]);
return ans;
}
}
namespace Sub2{
vector<pair<ll, ll>> a;
ll cap = 0;
void dnc(ll l, ll r){
if (r - l <= cap){
ll L, R;
MinMax(l, r, &L, &R);
if (L != -1) a.push_back({L, R});
return;
}
ll mid = (l + r) >> 1;
dnc(l, mid);
dnc(mid + 1, r);
}
ll solve(int n){
a.clear();
ll l = 0, r = 1e18;
ll L, R;
MinMax(l, r, &L, &R);
l = L, r = R;
cap = (r - l) / n;
dnc(l, r);
ll ans = 0;
for(int i = 1; i<a.size(); ++i) maximize(ans, a[i].first - a[i-1].second);
return ans;
}
}
ll findGap(int T, int N){
if (T == 1) return Sub1::solve(N);
return Sub2::solve(N);
}
// int main(void){
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// cin >> n;
// a.resize(n);
// for(int i= 0; i<n; ++i) cin >> a[i];
// cout << findGap(2, n) << "\n";
// return 0;
// }
Compilation message
gap.cpp: In function 'll Sub1::solve(int)':
gap.cpp:76:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | for(int i = 1; i<a.size(); ++i) maximize(ans, a[i] - a[i-1]);
| ~^~~~~~~~~
gap.cpp: In function 'll Sub2::solve(int)':
gap.cpp:107:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
107 | for(int i = 1; i<a.size(); ++i) maximize(ans, a[i].first - a[i-1].second);
| ~^~~~~~~~~
/usr/bin/ld: /tmp/cc2ssUE4.o: in function `MinMax(long long, long long, long long*, long long*)':
grader.cpp:(.text+0x0): multiple definition of `MinMax(long long, long long, long long*, long long*)'; /tmp/ccDwtEO4.o:gap.cpp:(.text+0x420): first defined here
collect2: error: ld returned 1 exit status