結果

問題 No.1067 #いろいろな色 / Red and Blue and more various colors (Middle)
ユーザー suta28407928suta28407928
提出日時 2020-05-29 23:18:59
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 212 ms / 2,000 ms
コード長 3,869 bytes
コンパイル時間 1,169 ms
コンパイル使用メモリ 107,824 KB
実行使用メモリ 28,784 KB
最終ジャッジ日時 2024-04-27 03:14:00
合計ジャッジ時間 3,456 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 3 ms
6,944 KB
testcase_05 AC 3 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 3 ms
6,944 KB
testcase_09 AC 3 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 117 ms
16,336 KB
testcase_12 AC 92 ms
16,068 KB
testcase_13 AC 132 ms
6,940 KB
testcase_14 AC 76 ms
6,940 KB
testcase_15 AC 43 ms
7,400 KB
testcase_16 AC 53 ms
16,076 KB
testcase_17 AC 14 ms
6,940 KB
testcase_18 AC 89 ms
9,968 KB
testcase_19 AC 83 ms
6,940 KB
testcase_20 AC 69 ms
15,812 KB
testcase_21 AC 211 ms
28,712 KB
testcase_22 AC 209 ms
28,400 KB
testcase_23 AC 212 ms
28,784 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <ctime>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,1,0,-1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
//const int mod = 1e9 + 7;
const int mod = 998244353;

double dist(ll a, ll b, ll c, ll d){
	double res = sqrt((a-c)*(a-c) + (b-d)*(b-d));
	return res;
}

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
	return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
	return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
	return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
	return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
	a += rhs.a;
	if (a >= Modulus) {
	  a -= Modulus;
	}
	return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
	if (a < rhs.a) {
	  a += Modulus;
	}
	a -= rhs.a;
	return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
	a = a * rhs.a % Modulus;
	return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
	u64 exp = Modulus - 2;
	while (exp) {
	  if (exp % 2) {
		*this *= rhs;
	  }
	  rhs *= rhs;
	  exp /= 2;
	}
	return *this;
  }
};

using mint = modint<mod>;

mint dp[2][6005];
struct dat{
	ll m,p,id;
	bool operator< (const dat &d) const {
		return m < d.m;
	}
};

int main(){
	ll n,q; cin >> n >> q;
	vector<dat> query;
	vl a(n); rep(i,n) cin >> a[i];
	rep(i,q){
		ll l,r,p; cin >> l >> r >> p;
		for(ll j=l; j<=r; j++){
			query.push_back({j,p,i});
		}
	}
	ll Q = query.size();
	sort(rall(query));
	vl ans(q,0);
	sort(rall(a));
	vector<pair<ll,mint>> v;
	dp[0][0] = 1;
	mint acc = 1;
	ll id = 0;
	rep(i,n) acc *= a[i];
	rep(i,n){
		rep(j,n+1){
			dp[1][j] += dp[0][j] * (a[i] - 1);
			dp[1][j+1] += dp[0][j];
		}
		while(id < Q && query[id].m > a[i]){
			mint tmp = dp[0][query[id].p] * acc;
			ll tmp2 = tmp.value();
			ans[query[id].id] ^= tmp2;
			//print2(query[id].m, dp[0][query[id].p].value());
			id++;
		}
		swap(dp[0], dp[1]);
		rep(j,n+1) dp[1][j] = 0;
		acc /= a[i];
	}
	while(id < Q){
		ans[query[id].id] ^= dp[0][query[id].p].value();
		//print2(query[id].m, dp[0][query[id].p].value());
		id++;
	}
	rep(i,q){
		cout << ans[i] % mod << "\n";
	}
}
0