#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
typedef vector<pi> vpi;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
os << "[";
for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
os << "]\n";
return os;
}
#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << "" << p.first << " " << p.second << "";
return os;
}
void usaco(string taskname) {
string fin = taskname + ".in";
string fout = taskname + ".out";
const char *FIN = fin.c_str();
const char *FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T> &v) {
int n = v.size();
for (int i = 0; i < n; i++)
cin >> v[i];
}
template<typename T>
vector<T> UNQ(vector<T> a) {
vector<T> ans;
for (T t: a)
if (ans.empty() || t != ans.back())
ans.push_back(t);
return ans;
}
ll ceil(ll a, ll b) {
ll ans = a / b;
if (a % b)ans++;
return ans;
}
ld log(ld a, ld b) { return log(b) / log(a); }
ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
ll ans = 1;
while (exp) {
if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
base = ((base % M) * (base % M)) % M;
exp /= 2;
}
return ans;
}
string to_base(int n, int new_base) {
string s;
int nn = n;
while (nn) {
s += to_string(nn % new_base);
nn /= new_base;
}
reverse(all(s));
return s;
}
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
if (b == 0)return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll x = (a / gcd(a, b));
return b * x;
}
vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
if (mx == 1e18 + 1)
mx = n;
vl ans(n);
for (int i = 0; i < n; i++)
ans[i] = (mn + rand() % (mx - mn + 1));
return ans;
}
string substr(string s, int l, int r) {
string ans;
for (int i = l; i <= r; i++)
ans += s[i];
return ans;
}
void solve();
int main() {
GLHF;
int t = 1;
//cin >> t;
while (t--)
solve();
}
ll n,p,q;
vpl a;
int lb(ll x){
if(x>=a.back().first)
return n;
return ((upper_bound(all(a), pl({x,1e9})))->second);
}
bool ok(int k){
vvi dp(q+1,vi(p+1));
dp[0][0]=-1;
for(int i=1; i<=q; i++) {
dp[i][0] = lb(a[dp[i - 1][0]+1].first + 2 * k-1)-1;
if(dp[i][0]>=n-1)
return 1;
}
for(int i=1; i<=p; i++) {
dp[0][i] = lb(a[dp[0][i - 1]+1].first + k-1)-1;
if(dp[0][i]>=n-1)
return 1;
}
for(int i=1; i<=q; i++)
for(int j=1; j<=p; j++){
int v1=0,v2=0;
v1=lb(a[dp[i][j-1]+1].first+k-1)-1;
v2=lb(a[dp[i-1][j]+1].first+2*k-1)-1;
dp[i][j]=max(v1,v2);
if(dp[i][j]>=n-1)
return 1;
}
return 0;
}
void solve() {
cin >> n >> p >> q;
vi s(n);
read(s);
sort(all(s));
s=UNQ(s);
a.resize(s.size());
for(int i=0; i<s.size(); i++)
a[i].first=s[i],a[i].second=i;
n=a.size();
p=min(p,n);
q=min(q,n);
ll l=1,r=1e9,ans=-1;
while(l<=r){
ll m=(l+r)/2;
if(ok(m))
ans=m,r=m-1;
else
l=m+1;
}
out(ans)
}
Compilation message
watching.cpp: In function 'void solve()':
watching.cpp:188:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
188 | for(int i=0; i<s.size(); i++)
| ~^~~~~~~~~
watching.cpp: In function 'void usaco(std::string)':
watching.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
57 | freopen(FIN, "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~
watching.cpp:58:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
58 | freopen(FOUT, "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
0 ms |
204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
256 KB |
Output is correct |
| 3 |
Correct |
450 ms |
9336 KB |
Output is correct |
| 4 |
Correct |
6 ms |
984 KB |
Output is correct |
| 5 |
Correct |
9 ms |
1036 KB |
Output is correct |
| 6 |
Correct |
188 ms |
16204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
86 ms |
756 KB |
Output is correct |
| 9 |
Correct |
112 ms |
716 KB |
Output is correct |
| 10 |
Correct |
71 ms |
1056 KB |
Output is correct |
| 11 |
Correct |
65 ms |
1036 KB |
Output is correct |
| 12 |
Correct |
811 ms |
4280 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
332 KB |
Output is correct |
| 15 |
Correct |
1 ms |
332 KB |
Output is correct |
