結果

問題 No.854 公平なりんご分配
ユーザー ningenMeningenMe
提出日時 2019-07-26 22:02:01
言語 C++11
(gcc 11.4.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,410 bytes
コンパイル時間 1,236 ms
コンパイル使用メモリ 160,720 KB
最終ジャッジ日時 2024-11-14 21:30:44
合計ジャッジ時間 3,771 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:23:25: error: ‘make_v’ function uses ‘auto’ type specifier without trailing return type
   23 | template<typename... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
      |                         ^~~~
main.cpp:23:25: note: deduced return type only available with ‘-std=c++14’ or ‘-std=gnu++14’

ソースコード

diff # 

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

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr ll MOD = (ll)1e9 + 7;
constexpr ll MOD2 = 998244353;
constexpr ll HIGHINF = (ll)1e18;
constexpr ll LOWINF = (ll)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template<typename T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template<typename... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(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;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; 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<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
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;}


//Eratosthenes O(N)
vector<bool> Eratosthenes(int N) {
    vector<bool> res(N + 1, true);
    res[0] = res[1%(N+1)] = false;
    for (int i = 1; i*i <= N; i++) if (res[i]) for (int j = 2 * i; j <= N; j += i) res[j] = false;
    return res;
}


template<class T> class Segment_Tree_Range_Maximum_Query {
public:
	size_t N, M;
	T ini;
	vector<T> node;

	Segment_Tree_Range_Maximum_Query(const vector<T> & ar, const T ini) : M(ar.size()), ini(ini) {
		for (N = 1; N < M; N *= 2);
		node.resize(2 * N - 1, ini);
		for (int i = 0; i<M; ++i) node[i + N - 1] = ar[i];
		for (int i = N - 2; i >= 0; --i) node[i] = max(node[2 * i + 1], node[2 * i + 2]);
	}

	Segment_Tree_Range_Maximum_Query(const size_t M, const T ini) : M(M), ini(ini) {
		for (N = 1; N < M; N *= 2);
		node.resize(2 * N - 1, ini);
	}

	void update(size_t idx, const T var) {
		idx += (N - 1);
		node[idx] = var;
		while (idx > 0) {
			idx = (idx - 1) / 2;
			node[idx] = max(node[2 * idx + 1], node[2 * idx + 2]);
		}
	}

	T getvar(const int a, const int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = N;
		if (r <= a || b <= l) return ini;
		if (a <= l && r <= b) return node[k];
		T vl = getvar(a, b, 2 * k + 1, l, (l + r) / 2);
		T vr = getvar(a, b, 2 * k + 2, (l + r) / 2, r);
		return max(vl, vr);
	}

	T operator[](size_t idx) {
		return node[idx + N - 1];
	}

	T operator[](pair<size_t, size_t> p) {
		return getvar(p.first, p.second);
	}


	void print() {
		cout << "{ " << getvar(0, 1);
		for (int i = 1; i < M; ++i) cout << ", " << getvar(i, i + 1);
		cout << " }" << endl;
	}
};


int main() {
    SPEED
    ll N; cin >> N;
    auto era = Eratosthenes(2000);
    V<ll> p;
    for(int i = 2; i <= 2000; ++i) if(era[i]) p.push_back(i);
    ll M = p.size();
    V<V<ll>> sum(N+1,V<ll>(M,0));
    Segment_Tree_Range_Maximum_Query<int> Seg(N+1,0);
    for(int i = 1; i <= N; ++i){
        ll A; cin >> A;
        Seg.update(i,A==0);
        if(!A) continue;
        for(int j = 0; j < M; ++j){
            while(A%p[j]==0){
                A /= p[j];
                sum[i][j]++;
            }
        }
    }
    for(int j = 0; j < M; ++j){
        for(int i = 1; i <= N; ++i) sum[i][j] += sum[i-1][j];
    }

    int Q; cin >> Q;
    V<int> ans(Q,1);
    for(int i = 0; i < Q; ++i){
        ll S,L,R; cin >> S >> L >> R;
        V<int> cnt(M,0);
        if(Seg.getvar(L,R+1)) continue;
        int flg = 1;
        for(int j = 0; j < M && flg; ++j){
            while(S%p[j]==0){
                S /= p[j];
                cnt[j]++;
            }
            if(sum[R][j] - sum[L-1][j] < cnt[j]) flg = 0;
        }
        if(S!=1) flg = 0;
        ans[i] = flg;
    }
    for(int i = 0; i < Q; ++i) cout << (ans[i]?"Yes":"NO") << endl;

    return 0;
}
0