結果

問題 No.1651 Removing Cards
ユーザー snukesnuke
提出日時 2021-08-21 18:55:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 246 ms / 2,000 ms
コード長 3,256 bytes
コンパイル時間 2,433 ms
コンパイル使用メモリ 212,676 KB
実行使用メモリ 13,452 KB
最終ジャッジ日時 2024-10-15 09:32:05
合計ジャッジ時間 11,011 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 7 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 3 ms
6,820 KB
testcase_05 AC 2 ms
6,816 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,820 KB
testcase_08 AC 2 ms
6,820 KB
testcase_09 AC 200 ms
6,820 KB
testcase_10 AC 204 ms
6,816 KB
testcase_11 AC 201 ms
6,816 KB
testcase_12 AC 197 ms
6,816 KB
testcase_13 AC 205 ms
6,816 KB
testcase_14 AC 200 ms
6,816 KB
testcase_15 AC 239 ms
11,948 KB
testcase_16 AC 241 ms
13,452 KB
testcase_17 AC 246 ms
12,936 KB
testcase_18 AC 238 ms
11,772 KB
testcase_19 AC 236 ms
12,156 KB
testcase_20 AC 239 ms
13,060 KB
testcase_21 AC 240 ms
12,024 KB
testcase_22 AC 223 ms
12,560 KB
testcase_23 AC 205 ms
6,820 KB
testcase_24 AC 167 ms
6,816 KB
testcase_25 AC 191 ms
12,668 KB
testcase_26 AC 191 ms
12,072 KB
testcase_27 AC 243 ms
13,244 KB
testcase_28 AC 242 ms
13,012 KB
testcase_29 AC 231 ms
12,164 KB
testcase_30 AC 235 ms
12,268 KB
testcase_31 AC 237 ms
12,196 KB
testcase_32 AC 188 ms
6,820 KB
testcase_33 AC 185 ms
6,820 KB
testcase_34 AC 185 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define dsrep(i,t,s) for(int i = (t)-1; i >= (s); --i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define bn(x) ((1<<(x))-1)
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T> >;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using P = pair<int,int>;
using T3 = tuple<int,int,int>;
using vi = vc<int>;
using vvi = vv<int>;
using vl = vc<ll>;
using vp = vc<P>;
using vt = vc<T3>;
int getInt(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
vc<string> split(const string& s,char d=' '){vc<string> r(1);for(char c:s)if(c==d)r.pb("");else r.back()+=c;return r;}
string operator*(const string& s,int t){return join(vc<string>(t,s));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;
using l3 = __int128_t;
using ul3 = __uint128_t;
std::ostream &operator<<(std::ostream &o, l3 x) {
  string s;
  bool sg = x < 0;
  ul3 ux = sg?-x:x;
  do {s += '0'+ux%10; ux /= 10;} while (ux);
  if (sg) s += '-';
  reverse(rng(s));
  return o<<s;
}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}

struct Solver {
  void solve() {
    int k,q;
    scanf("%d%d",&k,&q);
    vc<l3> x;
    x.pb(1);
    while (x.back() <= 1e18) {
      x.pb(dup(x.back()*k, k-1));
    }
    rep(qi,q) {
      ll n;
      cin>>n;
      auto it = upper_bound(rng(x), n);
      --it;
      ll ans = *it;
      cout<<ans<<endl;
    }
  }
};

int main() {
  int ts = 1;
  // scanf("%d",&ts);
  rrep(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0