# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707639 | 2023-03-09T15:34:40 Z | Alihan_8 | Watching (JOI13_watching) | C++17 | 111 ms | 31700 KB |
#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; #define all(x) x.begin(), x.end() #define pb push_back // define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> #define mpr make_pair #define ln '\n' void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} #define int long long const int N = 2e3+1; int dp[N][N]; signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n, P, Q; cin >> n >> P >> Q; vector <int> p(n); for ( auto &i: p ) cin >> i; P = min(P, n), Q = min(Q, n); sort(all(p)); p.erase(unique(all(p)), p.end()); n = (int)p.size(); auto ok = [&](int w){ memset(dp, 0, sizeof(dp)); auto get = [&](int x){ return lower_bound(all(p), x+1)-p.begin(); }; auto chmax = [&](int &l, int r){ l = max(l, r); }; for ( int i = 1; i <= n; i++ ){ for ( int j = 0; j <= P; j++ ){ for ( int k = 0; k <= Q; k++ ){ int L = get(p[dp[j][k]]+w-1), R = get(p[dp[j][k]]+2*w-1); if ( j+1 <= P ) chmax(dp[j+1][k], L); if ( k+1 <= Q ) chmax(dp[j][k+1], R); } } } return dp[P][Q] == n; }; int l = 1, r = 1e9+1; while ( l < r ){ int md = (l+r) >> 1; if ( ok(md) ) r = md; else l = md+1; } cout << l; cout << '\n'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 108 ms | 31700 KB | Output is correct |
2 | Incorrect | 106 ms | 31644 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 111 ms | 31660 KB | Output is correct |
2 | Incorrect | 105 ms | 31648 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |