結果
問題 | No.1651 Removing Cards |
ユーザー | n_vip |
提出日時 | 2021-08-20 22:23:36 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 424 ms / 2,000 ms |
コード長 | 5,836 bytes |
コンパイル時間 | 1,886 ms |
コンパイル使用メモリ | 148,260 KB |
実行使用メモリ | 12,408 KB |
最終ジャッジ日時 | 2024-10-14 04:17:40 |
合計ジャッジ時間 | 11,694 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 122 ms
5,248 KB |
testcase_03 | AC | 3 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 3 ms
5,248 KB |
testcase_06 | AC | 3 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 3 ms
5,248 KB |
testcase_09 | AC | 32 ms
5,248 KB |
testcase_10 | AC | 32 ms
5,248 KB |
testcase_11 | AC | 34 ms
5,248 KB |
testcase_12 | AC | 33 ms
5,248 KB |
testcase_13 | AC | 33 ms
5,248 KB |
testcase_14 | AC | 33 ms
5,248 KB |
testcase_15 | AC | 415 ms
12,408 KB |
testcase_16 | AC | 403 ms
12,280 KB |
testcase_17 | AC | 414 ms
12,152 KB |
testcase_18 | AC | 396 ms
12,280 KB |
testcase_19 | AC | 398 ms
12,156 KB |
testcase_20 | AC | 389 ms
12,284 KB |
testcase_21 | AC | 398 ms
12,280 KB |
testcase_22 | AC | 398 ms
12,284 KB |
testcase_23 | AC | 31 ms
5,248 KB |
testcase_24 | AC | 20 ms
5,248 KB |
testcase_25 | AC | 401 ms
12,156 KB |
testcase_26 | AC | 380 ms
12,388 KB |
testcase_27 | AC | 418 ms
12,280 KB |
testcase_28 | AC | 417 ms
12,280 KB |
testcase_29 | AC | 422 ms
12,280 KB |
testcase_30 | AC | 424 ms
12,280 KB |
testcase_31 | AC | 418 ms
12,276 KB |
testcase_32 | AC | 28 ms
5,248 KB |
testcase_33 | AC | 29 ms
5,248 KB |
testcase_34 | AC | 30 ms
5,248 KB |
ソースコード
#include <string> #include <vector> #include<iostream> #include<cstdio> #include<cstdlib> #include<stack> #include<queue> #include<cmath> #include<algorithm> #include<functional> #include<list> #include<deque> #include<bitset> #include<set> #include<map> #include<unordered_map> #include<unordered_set> #include<cstring> #include<sstream> #include<complex> #include<iomanip> #include<numeric> #include<cassert> #include<random> #define X first #define Y second #define pb push_back #define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X)) #define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X)) #define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X)) #define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X)) #define repe(X,Y) for ((X) = 0;(X) < (Y);++(X)) #define peat(X,Y) for (;(X) < (Y);++(X)) #define all(X) (X).begin(),(X).end() #define rall(X) (X).rbegin(),(X).rend() #define eb emplace_back #define UNIQUE(X) (X).erase(unique(all(X)),(X).end()) #define Endl endl #define NL <<"\n" #define cauto const auto using namespace std; using ll=long long; using pii=pair<int,int>; using pll=pair<ll,ll>; template<class T> using vv=vector<vector<T>>; template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;} template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;} //#undef NUIP #ifdef NUIP #include "benri.h" #else #define out(args...) #endif void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";} #ifdef __cpp_init_captures template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);} template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));} #endif template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};} template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;} template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};} template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;} template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;} template<class T=ll> T read(){ T re; cin>>re; return re;} template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;} template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;} template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;} vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;} vv<int> readG(const int &n){ return readG(n,n-1);} vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;} vv<int> readD(const int &n){ return readD(n,n-1);} template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;} template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);} template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); } return g;} template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);} #ifdef __cpp_init_captures template<typename T> vector<T> readT(int n, T v){ return readV(n,v);} template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...)); return re;} template<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }; (void)l;} template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){ addadd(lhs, rhs, index_sequence_for<T...>{}); return lhs;} template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;} template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }; (void)l;} template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){ subsub(lhs, rhs, index_sequence_for<T...>{}); return lhs;} template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;} template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);} template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;} #endif #define TT cauto TTT=read();rep(_,TTT) const ll MOD=1e9+7; //998244353; map<ll,ll> memo; ll dfs(const ll n, const ll d){ // out(n,d,1); if(n<d) return n-1; if(cauto it=memo.find(n);it!=memo.end()) return it->Y; cauto re=(dfs(n-(n+d-1)/d,d)*d+d-1)/(d-1); // out(n,d,re,1); return memo[n]=re;; } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout<<fixed<<setprecision(0); cauto d=read(); cauto q=read(); cauto qs=readV(q); vector<pll> memo; reps(i,1,d) memo.eb(i,i-1); cauto ub=1000000000000000000; for(ll i=d;i<=ub;){ cauto li=*lower_bound(all(memo),pll(i-(i+d-1)/d,-1)); ll r=i; rrep(j,60){ r+=1ll<<j; if(r-(r+d-1)/d>li.X) r-=1ll<<j; } memo.eb(r,li.Y+li.Y/(d-1)+1); i=r+1; } out(memo.size(),1); for(cauto &n:qs) cout<<lower_bound(all(memo),pll(n,-1))->Y+1 NL; // rep(i,200) cout<<dfs(i,d)<<","; cout NL; return 0; }