結果
問題 | No.1665 quotient replace |
ユーザー | keijak |
提出日時 | 2021-09-04 04:27:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 674 ms / 3,000 ms |
コード長 | 4,093 bytes |
コンパイル時間 | 2,224 ms |
コンパイル使用メモリ | 214,932 KB |
実行使用メモリ | 15,280 KB |
最終ジャッジ日時 | 2023-08-22 09:20:31 |
合計ジャッジ時間 | 26,533 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
7,332 KB |
testcase_01 | AC | 10 ms
7,576 KB |
testcase_02 | AC | 9 ms
7,588 KB |
testcase_03 | AC | 560 ms
11,312 KB |
testcase_04 | AC | 562 ms
11,472 KB |
testcase_05 | AC | 561 ms
11,316 KB |
testcase_06 | AC | 562 ms
11,396 KB |
testcase_07 | AC | 562 ms
11,260 KB |
testcase_08 | AC | 565 ms
11,400 KB |
testcase_09 | AC | 566 ms
11,268 KB |
testcase_10 | AC | 595 ms
12,784 KB |
testcase_11 | AC | 633 ms
14,304 KB |
testcase_12 | AC | 571 ms
11,536 KB |
testcase_13 | AC | 674 ms
15,216 KB |
testcase_14 | AC | 653 ms
15,228 KB |
testcase_15 | AC | 659 ms
15,220 KB |
testcase_16 | AC | 655 ms
15,216 KB |
testcase_17 | AC | 653 ms
15,280 KB |
testcase_18 | AC | 300 ms
9,612 KB |
testcase_19 | AC | 183 ms
8,744 KB |
testcase_20 | AC | 332 ms
9,752 KB |
testcase_21 | AC | 361 ms
9,888 KB |
testcase_22 | AC | 220 ms
9,004 KB |
testcase_23 | AC | 446 ms
10,464 KB |
testcase_24 | AC | 299 ms
9,608 KB |
testcase_25 | AC | 219 ms
8,948 KB |
testcase_26 | AC | 568 ms
11,388 KB |
testcase_27 | AC | 562 ms
11,396 KB |
testcase_28 | AC | 566 ms
11,260 KB |
testcase_29 | AC | 565 ms
11,652 KB |
testcase_30 | AC | 609 ms
13,160 KB |
testcase_31 | AC | 635 ms
14,212 KB |
testcase_32 | AC | 630 ms
14,296 KB |
testcase_33 | AC | 589 ms
12,456 KB |
testcase_34 | AC | 620 ms
13,648 KB |
testcase_35 | AC | 612 ms
13,448 KB |
testcase_36 | AC | 614 ms
13,380 KB |
testcase_37 | AC | 615 ms
13,300 KB |
testcase_38 | AC | 625 ms
13,784 KB |
testcase_39 | AC | 600 ms
12,848 KB |
testcase_40 | AC | 604 ms
12,924 KB |
testcase_41 | AC | 606 ms
12,968 KB |
testcase_42 | AC | 10 ms
7,444 KB |
testcase_43 | AC | 10 ms
7,520 KB |
ソースコード
#include <bits/stdc++.h> #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template<typename T, typename U> inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template<typename T, typename U> inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template<typename T> inline int ssize(const T &a) { return (int) std::size(a); } template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &a) { for (auto &x: a) is >> x; return is; } template<typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) { return os << "(" << a.first << ", " << a.second << ")"; } template<typename Container> std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template<typename T, typename = void> struct is_iterable : std::false_type {}; template<typename T> struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())), decltype(std::end(std::declval<T>()))>> : std::true_type { }; template<typename T, typename = std::enable_if_t< is_iterable<T>::value && !std::is_same<T, std::string_view>::value && !std::is_same<T, std::string>::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } void print() { std::cout << "\n"; } template<class T> void print(const T &x) { std::cout << x << "\n"; } template<typename Head, typename... Tail> void print(const Head &head, Tail... tail) { std::cout << head << " "; print(tail...); } struct Input { template<typename T> operator T() const { T x; std::cin >> x; return x; } } in; #ifdef MY_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; const int L = 1'000'005; struct PrimeSieve { std::vector<int> spf; // smallest prime factors table. std::vector<int> primes; explicit PrimeSieve(int n) : spf(n + 1) { // O(n) for (int i = 2; i <= n; ++i) { if (spf[i] == 0) { spf[i] = i; primes.push_back(i); } for (const auto &p: primes) { if (i * p > n or p > spf[i]) break; spf[i * p] = p; } } } inline bool is_prime(int n) const { return spf[n] == n; } auto factorize(int n) const { assert(0 < n and n < int(spf.size())); std::vector<std::pair<int, int>> res; while (n > 1) { const int p = spf[n]; int count = 0; do { n /= p; ++count; } while (n % p == 0); res.emplace_back(p, count); } return res; } } sieve(L); // O(d(n)) + sorting std::vector<i64> enumerate_divisors( const std::vector<std::pair<int, int>> &fac) { std::vector<i64> res = {1}; for (auto[p, k]: fac) { int sz = res.size(); for (int i = 0; i < sz; ++i) { i64 pp = 1; for (int j = 0; j < k; ++j) { pp *= p; res.push_back(res[i] * pp); } } } //std::sort(res.begin(), res.end()); return res; } auto main() -> int { ios_base::sync_with_stdio(false), cin.tie(nullptr); const int n = in; vector<int> a(n); cin >> a; int amax = *max_element(ALL(a)); vector<int> g(amax + 1, -1); g[1] = 0; for (int x = 2; x <= amax; ++x) { auto ds = enumerate_divisors(sieve.factorize(x)); set<int> s; for (auto d: ds) { if (d == x) continue; s.insert(g[d]); } int mex = -1; for (int j = 0;; ++j) { if (s.count(j)) continue; mex = j; break; } g[x] = mex; } int gall = 0; REP(i, n) { gall ^= g[a[i]]; } print(gall == 0 ? "black" : "white"); }