#591001 (C++17) No.1312 Snake Eyes

提出ソース

結果

問題	No.1312 Snake Eyes
ユーザー	ningenMe
提出日時	2020-12-09 04:02:55
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	3,715 bytes
コンパイル時間	2,488 ms
コンパイル使用メモリ	215,444 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-19 00:58:14
合計ジャッジ時間	8,990 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	WA	-
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	3 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	3 ms 6,944 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	2 ms 6,940 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,944 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	2 ms 6,940 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,940 KB
testcase_30	AC	2 ms 6,944 KB
testcase_31	AC	3 ms 6,940 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	AC	2 ms 6,940 KB
testcase_34	AC	2 ms 6,944 KB
testcase_35	AC	3 ms 6,940 KB
testcase_36	AC	2 ms 6,944 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	4 ms 6,944 KB
testcase_39	AC	8 ms 6,944 KB
testcase_40	AC	8 ms 6,944 KB
testcase_41	AC	7 ms 6,944 KB
testcase_42	AC	3 ms 6,940 KB
testcase_43	AC	7 ms 6,940 KB
testcase_44	AC	4 ms 6,940 KB
testcase_45	AC	6 ms 6,940 KB
testcase_46	AC	7 ms 6,944 KB
testcase_47	AC	5 ms 6,944 KB
testcase_48	AC	173 ms 6,940 KB
testcase_49	AC	156 ms 6,944 KB
testcase_50	AC	123 ms 6,940 KB
testcase_51	AC	64 ms 6,940 KB
testcase_52	AC	193 ms 6,940 KB
testcase_53	AC	143 ms 6,940 KB
testcase_54	AC	170 ms 6,944 KB
testcase_55	AC	81 ms 6,940 KB
testcase_56	AC	107 ms 6,940 KB
testcase_57	AC	109 ms 6,944 KB
testcase_58	AC	145 ms 6,940 KB
testcase_59	AC	55 ms 6,944 KB
testcase_60	AC	106 ms 6,944 KB
testcase_61	AC	191 ms 6,940 KB
testcase_62	AC	75 ms 6,940 KB
testcase_63	AC	3 ms 6,944 KB
testcase_64	AC	9 ms 6,944 KB
testcase_65	AC	23 ms 6,944 KB
testcase_66	AC	2 ms 6,940 KB
testcase_67	AC	2 ms 6,944 KB
testcase_68	AC	10 ms 6,940 KB
testcase_69	AC	2 ms 6,944 KB
testcase_70	AC	156 ms 6,944 KB
testcase_71	AC	93 ms 6,944 KB
testcase_72	AC	10 ms 6,944 KB
testcase_73	AC	3 ms 6,944 KB
testcase_74	AC	2 ms 6,944 KB
testcase_75	AC	3 ms 6,944 KB
testcase_76	AC	193 ms 6,944 KB
testcase_77	AC	195 ms 6,944 KB
testcase_78	AC	195 ms 6,944 KB
testcase_79	AC	145 ms 6,940 KB
testcase_80	AC	194 ms 6,940 KB
testcase_81	AC	204 ms 6,940 KB
testcase_82	AC	195 ms 6,940 KB
testcase_83	AC	193 ms 6,944 KB
testcase_84	AC	193 ms 6,940 KB
testcase_85	AC	177 ms 6,940 KB
testcase_86	AC	167 ms 6,940 KB
testcase_87	AC	96 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = 1'000'000'000LL + 7; //'
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
int msb(int x) {return x?31-__builtin_clz(x):-1;}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

/*
 * @title NBase - N進数
 * @docs md/util/NBase.md
 */
class NBase{
public:
	inline static vector<long long> translate(long long X,long long N) {
		assert(abs(N)>1);
		vector<long long> res;
		while(1) {
			long long b = (X%abs(N)+abs(N)) % abs(N);
			res.push_back(b);
			(X -= b) /= N;
			if(X==0) break;
		}
		return res;
	}
	//Digit Sum
	inline static constexpr long long digit_sum(long long N, long long K) {
		long long sum = 0;
		for (; N > 0; N /= K) sum += N % K;
		return sum;
	}
};

//divisor O(sqrt(N))
set<long long> Divisor(long long N) {
    set<long long> ret;
    for (long long i = 1; i*i <= N; ++i) {
        if (N%i == 0) {
            ret.insert(i);
            ret.insert(N / i);
        }
    }
    return ret;
}

//verify https://atcoder.jp/contests/abc112/tasks/abc112_d

/**
 * @url 
 * @est
 */ 
int main() {
    cin.tie(0);ios::sync_with_stdio(false);
    ll N; cin >> N;
    corner(N==1,2);
    ll ans = N-1;
    for(ll p=2;p*p<=N;++p) {
        auto v = NBase::translate(N,p);
        int flg=1;
        for(int i=0;i+1<v.size();++i)if(v[i]!=v[i+1])flg=0;
        if(flg) chmin(ans,p);
    }
    auto D = Divisor(N);
    for(ll k:D) {
        ll p = N/k-1;
        if(p>0 && p>(N/p)) chmin(ans,p);
    }
    cout << ans << endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード