結果
問題 | No.1651 Removing Cards |
ユーザー |
![]() |
提出日時 | 2021-08-25 23:59:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 801 ms / 2,000 ms |
コード長 | 6,352 bytes |
コンパイル時間 | 1,963 ms |
コンパイル使用メモリ | 197,708 KB |
最終ジャッジ日時 | 2025-01-24 01:53:29 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define all(a) (a).begin(), (a).end()#define uniq(a) (a).erase(unique(all(a)), (a).end())using ll = long long;using ull = unsigned long long;using vll = vector<ll>;using pll = pair<ll, ll>;template <typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;constexpr double PI = 3.1415926535897932384626433832795028;constexpr ll DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};constexpr ll DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};ull bit(int n) { return 1ull << n; }template <typename T> T sign(T a) { return (a > 0) - (a < 0); }template <typename T> T cdiv(T a, T b) { return (a - 1 + b) / b; }template <typename T> T sq(const T &a) { return a * a; }template <typename T, typename U> bool chmax(T &a, const U &b) {if (a < b) {a = b;return true;}return false;}template <typename T, typename U> bool chmin(T &a, const U &b) {if (b < a) {a = b;return true;}return false;}template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {os << "(" << a.first << ", " << a.second << ")";return os;}template <typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {auto [t, u, v] = a;os << "(" << t << ", " << u << ", " << v << ")";return os;}template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {os << "(";for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }os << ")";return os;}template <typename T> ostream &operator<<(ostream &os, const deque<T> &a) {os << "(";for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }os << ")";return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &a) {os << "{";for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }os << "}";return os;}template <typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {os << "{";for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }os << "}";return os;}template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {os << "{";for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }os << "}";return os;}struct setup {static constexpr ll PREC = 20;setup() {cout << fixed << setprecision(PREC);cerr << fixed << setprecision(PREC);};} setup;#ifdef ONLINE_JUDGE#define dump(...) (void(0))#elsevoid debug() { cerr << endl; }template <typename Head, typename... Tail> void debug(Head &&head, Tail &&... tail) {cerr << head;if (sizeof...(Tail)) cerr << ", ";debug(tail...);}#define dump(...) cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ", debug(__VA_ARGS__)#endifstruct rep {struct itr {int v;itr(int v) : v(v) {}void operator++() { ++v; }int operator*() const { return v; }bool operator!=(const itr &i) const { return v != i.v; }};int l, r;rep(int r) : l(min(0, r)), r(r) {}rep(int l, int r) : l(min(l, r)), r(r) {}itr begin() const { return l; };itr end() const { return r; };};struct per {struct itr {int v;itr(int v) : v(v) {}void operator++() { --v; }int operator*() const { return v; }bool operator!=(const itr &i) const { return v != i.v; }};int l, r;per(int r) : l(min(0, r)), r(r) {}per(int l, int r) : l(min(l, r)), r(r) {}itr begin() const { return r - 1; };itr end() const { return l - 1; };};template <ll MOD = 1000000007> struct modint {ll val;modint(ll val = 0) : val(val >= 0 ? val % MOD : (MOD - (-val) % MOD) % MOD) {}static ll mod() { return MOD; }modint inv() const {ll a = val, b = MOD, u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return modint(u);}modint pow(ll p) const {modint res = 1, mul = val;while (p) {if (p & 1) res *= mul;mul *= mul;p >>= 1;}return res;}modint &operator+=(const modint &a) {if ((val += a.val) >= MOD) val -= MOD;return *this;}modint &operator-=(const modint &a) {if ((val += MOD - a.val) >= MOD) val -= MOD;return *this;}modint &operator*=(const modint &a) {(val *= a.val) %= MOD;return *this;}modint &operator/=(const modint &a) { return *this *= a.inv(); }bool operator==(const modint &a) const { return val == a.val; }bool operator!=(const modint &a) const { return rel_ops::operator!=(*this, a); }modint operator+() const { return *this; }modint operator-() const { return modint(-val); }friend modint operator+(const modint &a, const modint &b) { return modint(a) += b; }friend modint operator-(const modint &a, const modint &b) { return modint(a) -= b; }friend modint operator*(const modint &a, const modint &b) { return modint(a) *= b; }friend modint operator/(const modint &a, const modint &b) { return modint(a) /= b; }friend istream &operator>>(istream &is, modint &a) {ll val;is >> val;a = modint(val);return is;}friend ostream &operator<<(ostream &os, const modint &a) { return os << a.val; }};template <typename F> long long discrete_binary_search(long long ok, long long ng, F is_ok) {while (abs(ok - ng) > 1) {long long mid = (ok + ng) / 2;(is_ok(mid) ? ok : ng) = mid;}return ok;}int main() {ll k, q;cin >> k >> q;vll gnct{0};while (gnct.back() < 1e18) {ll x = gnct.back();gnct.emplace_back(discrete_binary_search(1, LLONG_MAX, [&](ll y) { return x >= cdiv((__int128_t)(k - 1) * (y - 1), (__int128_t)k); }));}while (q--) {ll n;cin >> n;cout << *prev(lower_bound(all(gnct), n)) + 1 << endl;}}