/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
int n, m; cin >> n >> m; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) { int x, l = 1, r = n, p = -1; cin >> x; while (l <= r) { int mid = l + r >> 1; if (a[mid] >= x) { p = mid; r = mid - 1; } else l = mid + 1; } if (p == -1 || a[p] != x) p = -1; cout << p << " \n"[i == m]; } return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
voidsolve(){ int n; i64 h; cin >> n >> h; vector<i64> a(n); for (i64 &x : a) cin >> x;
i64 l = 1, r = h, ans = h; while (l <= r) { i64 mid = l + r >> 1; i64 sum = mid; for (int i = 0; i + 1 < n; i++) { sum += min(mid, a[i + 1] - a[i]); if (sum >= h) break; } if (sum >= h) { ans = mid; r = mid - 1; } else l = mid + 1; } cout << ans << '\n'; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
int len, n, m; cin >> len >> n >> m; vector<int> a(n + 2); for (int i = 1; i <= n; i++) cin >> a[i]; a[n + 1] = len;
auto check = [&](int x) { int cnt = 0, lst = 0; for (int i = 1; i <= n + 1; i++) { if (a[i] - a[lst] < x) cnt++; else lst = i; } return cnt <= m; };
int l = 1, r = len, ans = 0; while (l <= r) { int mid = l + r >> 1; if (check(mid)) { ans = mid; l = mid + 1; } else r = mid - 1; } cout << ans << '\n'; return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
constexprint V = 1'000'000;
i64 calc(i64 a, i64 b){ return a * a * a + a * a * b + a * b * b + b * b * b; }
i64 n, ans = numeric_limits<i64>::max(); cin >> n; for (int a = 0; a <= V; a++) { int l = 0, r = V, p = V; while (l <= r) { int mid = l + r >> 1; if (calc(a, mid) >= n) { p = mid; r = mid - 1; } else l = mid + 1; } ans = min(ans, calc(a, p)); } cout << ans << '\n'; return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
int n; cin >> n; vector<i64> h(n), s(n), d(n); i64 r = 0; for (int i = 0; i < n; i++) { cin >> h[i] >> s[i]; r = max(r, h[i] + s[i] * (n - 1)); }
auto check = [&](i64 x) { for (int i = 0; i < n; i++) { if (x < h[i]) returnfalse; d[i] = (x - h[i]) / s[i]; } sort(d.begin(), d.end()); for (int i = 0; i < n; i++) if (d[i] < i) returnfalse; returntrue; };
i64 l = 0, ans = r; while (l <= r) { i64 mid = l + r >> 1; if (check(mid)) { ans = mid; r = mid - 1; } else l = mid + 1; } cout << ans << '\n'; return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
int n, k; cin >> n >> k; vector<double> w(n), p(n), a(n); for (int i = 0; i < n; i++) cin >> w[i] >> p[i];
auto check = [&](double x) { for (int i = 0; i < n; i++) a[i] = w[i] * (p[i] - x); sort(a.rbegin(), a.rend()); double sum = 0; for (int i = 0; i < k; i++) sum += a[i]; return sum >= 0; };
double l = 0, r = 100; for (int t = 1; t <= 100; t++) { double mid = (l + r) / 2; if (check(mid)) l = mid; else r = mid; } cout << fixed << setprecision(10) << l << '\n'; return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
intask(const vector<int> &s){ cout << "? " << s.size(); for (int x : s) cout << ' ' << x; cout << endl; int ans; cin >> ans; if (ans == -1) exit(0); return ans; }
intget(int r, const vector<int> &ex){ int l = 1, ans = -1; while (l <= r) { int mid = l + r >> 1; vector<int> s(mid); iota(s.begin(), s.end(), 1); for (int x : ex) s.push_back(x); int res = ask(s); if ((res & 1) ^ ((int)s.size() & 1)) { ans = mid; r = mid - 1; } else l = mid + 1; } return ans; }
int t; cin >> t; while (t--) { int n; cin >> n; int z = get(2 * n + 1, {}); int y = get(z - 1, {z}); int x = get(y - 1, {y, z}); cout << "! " << x << ' ' << y << ' ' << z << endl; } return0; }