| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1283099 | vibeduck | Self Study (JOI22_ho_t2) | C++20 | 149 ms | 5080 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
struct X {
long long a, b;
};
inline __int128 ceil_div128(__int128 p, __int128 q) {
return (p + q - 1) / q;
}
bool ok(vector<X> &v, long long val, long long m) {
__int128 bal = 0;
for (int i = 0; i < (int)v.size(); i++) {
long long a = v[i].a, b = v[i].b;
long long c = max(a, b);
__int128 ops = ceil_div128((__int128)val, (__int128)c);
if (ops <= m) {
bal += (__int128)m - ops;
continue;
}
__int128 todo = (__int128)val - (__int128)c * (__int128)m;
__int128 need = ceil_div128(todo, (__int128)b);
if (bal < need) return false;
bal -= need;
}
return true;
}
inline void solve() {
int n, m; cin >> n >> m;
vector<X> v(n);
for (int i = 0; i < n; i++) cin >> v[i].a;
for (int i = 0; i < n; i++) cin >> v[i].b;
sort(v.begin(), v.end(), [](const X& L, const X& R){
long long cL = max(L.a, L.b), cR = max(R.a, R.b);
if (cL != cR) return cL > cR;
return L.b > R.b;
});
int lo = 0;
int hi = 2e18;
while (hi > lo + 1) {
int mid = (lo + hi) / 2;
if (ok(v, mid, m)) lo = mid;
else hi = mid;
}
cout << lo << '\n';
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
