#695857 (C++17) No.1665 quotient replace

提出ソース

結果

問題	No.1665 quotient replace
ユーザー	yuto1115
提出日時	2021-09-03 22:54:09
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	361 ms / 3,000 ms
コード長	6,637 bytes
コンパイル時間	3,431 ms
コンパイル使用メモリ	211,156 KB
実行使用メモリ	7,052 KB
最終ジャッジ日時	2023-08-22 00:06:26
合計ジャッジ時間	9,408 ms
ジャッジサーバーID （参考情報）	judge13 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	9 ms 6,940 KB
testcase_01	AC	9 ms 6,744 KB
testcase_02	AC	9 ms 6,792 KB
testcase_03	AC	9 ms 7,012 KB
testcase_04	AC	9 ms 6,816 KB
testcase_05	AC	9 ms 6,764 KB
testcase_06	AC	12 ms 6,844 KB
testcase_07	AC	10 ms 6,964 KB
testcase_08	AC	11 ms 6,956 KB
testcase_09	AC	18 ms 6,844 KB
testcase_10	AC	124 ms 6,904 KB
testcase_11	AC	267 ms 6,732 KB
testcase_12	AC	36 ms 6,992 KB
testcase_13	AC	349 ms 6,888 KB
testcase_14	AC	349 ms 6,880 KB
testcase_15	AC	359 ms 6,944 KB
testcase_16	AC	352 ms 6,880 KB
testcase_17	AC	361 ms 6,876 KB
testcase_18	AC	9 ms 6,736 KB
testcase_19	AC	9 ms 6,868 KB
testcase_20	AC	9 ms 6,876 KB
testcase_21	AC	9 ms 6,744 KB
testcase_22	AC	10 ms 6,792 KB
testcase_23	AC	9 ms 7,052 KB
testcase_24	AC	9 ms 6,760 KB
testcase_25	AC	9 ms 6,940 KB
testcase_26	AC	9 ms 6,888 KB
testcase_27	AC	10 ms 6,760 KB
testcase_28	AC	13 ms 6,812 KB
testcase_29	AC	19 ms 6,948 KB
testcase_30	AC	95 ms 6,880 KB
testcase_31	AC	137 ms 6,896 KB
testcase_32	AC	267 ms 6,764 KB
testcase_33	AC	103 ms 7,048 KB
testcase_34	AC	210 ms 6,884 KB
testcase_35	AC	194 ms 6,964 KB
testcase_36	AC	204 ms 6,844 KB
testcase_37	AC	184 ms 6,956 KB
testcase_38	AC	230 ms 6,868 KB
testcase_39	AC	157 ms 6,792 KB
testcase_40	AC	153 ms 6,880 KB
testcase_41	AC	149 ms 6,788 KB
testcase_42	AC	9 ms 6,880 KB
testcase_43	AC	9 ms 6,764 KB

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

ソースコード

raw source code

#include<bits/stdc++.h>
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(i, n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i, s, n, d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(i, n) for (ll i = ll(n)-1; i >= 0; i--)
#define rrep2(i, n, t) for (ll i = ll(n)-1; i >= (ll)t; i--)
#define rrep3(i, n, t, d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)
#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define SUM(a) accumulate(all(a),0LL)
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SZ(a) int(a.size())
#define popcount(x) __builtin_popcountll(x)
#define pf push_front
#define pb push_back
#define ef emplace_front
#define eb emplace_back
#define ppf pop_front
#define ppb pop_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0);
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vp = vector<P>;
using vvp = vector<vp>;

template<class S, class T>
istream &operator>>(istream &is, pair<S, T> &p) { return is >> p.first >> p.second; }

template<class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << '{' << p.first << ", " << p.second << '}'; }

template<class S, class T, class U>
istream &operator>>(istream &is, tuple<S, T, U> &t) { return is >> get<0>(t) >> get<1>(t) >> get<2>(t); }

template<class S, class T, class U>
ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {
    return os << '{' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t) << '}';
}

template<class T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &t : v) { is >> t; }
    return is;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '[';
    rep(i, v.size()) os << v[i] << (i == int(v.size() - 1) ? "" : ", ");
    return os << ']';
}

template<class T>
ostream &operator<<(ostream &os, const set<T> &st) {
    os << '{';
    auto it = st.begin();
    while (it != st.end()) {
        os << (it == st.begin() ? "" : ", ") << *it;
        it++;
    }
    return os << '}';
}

template<class T>
void vecout(const vector<T> &v, char div = '\n') {
    rep(i, v.size()) cout << v[i] << (i == int(v.size() - 1) ? '\n' : div);
}

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

void scan() {}

template<class Head, class... Tail>
void scan(Head &head, Tail &... tail) {
    cin >> head;
    scan(tail...);
}

template<class T>
void print(const T &t) { cout << t << '\n'; }

template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail) {
    cout << head << ' ';
    print(tail...);
}

template<class... T>
void fin(const T &... a) {
    print(a...);
    exit(0);
}

struct Init_io {
    Init_io() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        cout << boolalpha << fixed << setprecision(15);
        cerr << boolalpha << fixed << setprecision(15);
    }
} init_io;

const string yes[] = {"no", "yes"};
const string Yes[] = {"No", "Yes"};
const string YES[] = {"NO", "YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T, class S>
vector<T> cumsum(const vector<S> &v, bool shift_one = true) {
    int n = v.size();
    vector<T> res;
    if (shift_one) {
        res.resize(n + 1);
        rep(i, n) res[i + 1] = res[i] + v[i];
    } else {
        res.resize(n);
        if (n) {
            res[0] = v[0];
            rep(i, 1, n) res[i] = res[i - 1] + v[i];
        }
    }
    return res;
}

vvi graph(int n, int m, bool directed = false, int origin = 1) {
    vvi G(n);
    rep(_, m) {
        INT(u, v);
        u -= origin, v -= origin;
        G[u].pb(v);
        if (!directed) G[v].pb(u);
    }
    return G;
}

template<class T>
vector<vector<pair<int, T>>> weighted_graph(int n, int m, bool directed = false, int origin = 1) {
    vector<vector<pair<int, T>>> G(n);
    rep(_, m) {
        int u, v;
        T w;
        scan(u, v, w);
        u -= origin, v -= origin;
        G[u].eb(v, w);
        if (!directed) G[v].eb(u, w);
    }
    return G;
}

class sieve {
    int n;
    vi val;
    
    void init() {
        rep(i, n + 1) val[i] = i;
        for (int i = 2; i * i <= n; i++) {
            if (val[i] != i) continue;
            for (int j = i * 2; j <= n; j += i) {
                if (val[j] == j) val[j] = i;
            }
        }
    }

public:
    sieve(int n) : n(n), val(n + 1) {
        init();
    }
    
    map<int, int> factor_list(int x) {
        if (n < 2) return {};
        map<int, int> ret;
        int now = x;
        while (now > 1) {
            ret[val[now]]++;
            now /= val[now];
        }
        return ret;
    }
    
    vi unique_factor(int x) {
        map<int, int> m = factor_list(x);
        vi ret;
        for (P p : m) ret.pb(p.first);
        return ret;
    };
    
    bool is_prime(int x) {
        return x >= 2 and val[x] == x;
    }
    
    int count_divisor(int x) {
        int ret = 1;
        map<int, int> fl = factor_list(x);
        for (auto p : fl) ret *= p.second + 1;
        return ret;
    };
    
    vi prime_list() {
        vi res;
        rep(i, 2, n + 1) if (is_prime(i)) res.pb(i);
        return res;
    }
} sv(1000010);

int main() {
    INT(n);
    int x = 0;
    rep(_,n) {
        INT(a);
        if(a == 1) continue;
        map<int,int> mp = sv.factor_list(a);
        int cnt = 0;
        for(auto [_,s] : mp) cnt += s;
        x ^= cnt;
    }
    print(x ? "white" : "black");
}

yukicoder

結果

テストケース

ソースコード