結果

問題 No.3049 Contest Coordinator
コンテスト
ユーザー mihhiael
提出日時 2025-03-07 23:35:13
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 6,298 bytes
コンパイル時間 2,660 ms
コンパイル使用メモリ 186,408 KB
実行使用メモリ 11,112 KB
最終ジャッジ日時 2025-03-07 23:35:22
合計ジャッジ時間 8,821 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 8 WA * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if __has_include("all.h")
#include "all.h"
#else
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <set>
#include <unordered_set>
#include <map>
#include <vector>
#include <string>
#include <deque>
#include <queue>
#include <iomanip>
#include <ranges>
#include <concepts>
#include <numeric>
#include <random>
#include <atcoder/modint>
#include <atcoder/segtree>
#include <atcoder/dsu>
#endif

using namespace std;
using ll = long long;
using pall = pair<ll, ll>;
template<class T> using vec = vector<T>;
template<class T> using veve = vec<vec<T>>;
using vell = vec<ll>;
using vebo = basic_string<bool>;
using vevell = veve<ll>;
template<class T> using uset = unordered_set<T>;
template<class T> using mset = multiset<T>;
template<class T> using priority_queue_ascend = priority_queue<T, vec<T>, greater<T>>;
static const ll inf = numeric_limits<ll>::max();
static const string sp = " ";
static const string lf = "\n";
static const auto &npos = string::npos;
static const vec<pall> grid_move4 = {
	{0, 1},
	{-1, 0},
	{0, -1},
	{1, 0}
};
static const vec<pall> grid_move8 = [] {
	auto ret = grid_move4;
	ret.insert(ret.end(), {
		{-1, 1},
		{-1, -1},
		{1, -1},
		{1, 1}
	});
	return ret;
}();
static constexpr ll MOD = 998244353;
// static constexpr ll MOD = 1e9 + 7;
#define cont continue
#define br break
static auto &ciN = cin;
static auto &icn = cin;
static auto &icN = cin;
static constexpr bool ture = true;
using itn = int;

using namespace atcoder;
using mint = static_modint<MOD>;

#define times(N) static_assert(is_integral_v<decltype((N) + 0)>, "times(): N must be integral"); for(typedef decltype((N) + 0) _int; [[maybe_unused]] const _int _i: views::iota((_int)0, (N)))

template<int M>
istream &operator>>(istream &in, static_modint<M> &i) {
	intmax_t tmp;
	in >> tmp;
	i = tmp;
	return in;
}
template<int M>
ostream &operator<<(ostream &out, const static_modint<M> &i) {
	return out << i.val();
}

template<class T, class U>
istream &operator>>(istream &in, pair<T, U> &p) {
	return in >> p.first >> p.second;
}
template<class T, class U>
ostream &operator<<(ostream &out, const pair<T, U> &p) {
	return out << p.first << sp << p.second;
}

template<class T>
istream &operator>>(istream &in, vec<T> &v) {
	for(auto &e: v) {
		in >> e;
	}
	return in;
}

void out(const ranges::range auto &v, const string &delim, ostream &out = cout) {
	for(const auto &e: v) {
		out << e << delim;
	}
}

[[nodiscard]] constexpr const string &yesno(const bool cond, const string &yes="Yes", const string &no="No") noexcept {
	if(cond) return yes;
	return no;
}


// [mi, ma)
[[nodiscard]] uint64_t randint(const uint64_t mi, const uint64_t ma) noexcept {
	static random_device seed;
	static mt19937_64 mt(seed());
	if(mi > ma) [[unlikely]] return randint(ma, mi);
	if(mi == ma) [[unlikely]] return mi;
	const uint64_t w = ma - mi;
	uint64_t r;
	do {
		r = mt();
	} while(mt.max() - mt.max() % w <= r);
	return r % w + mi;
}


template<class T, class U>
requires common_with<T, U>
[[nodiscard]] constexpr auto min(T &&a, U &&b) noexcept {
	return std::min<common_type_t<T, U>>(std::forward<T>(a), std::forward<U>(b));
}
template<class T, class U>
requires common_with<T, U>
[[nodiscard]] constexpr auto max(T &&a, U &&b) noexcept {
	return std::max<common_type_t<T, U>>(std::forward<T>(a), std::forward<U>(b));
}

template<class T>
[[nodiscard]] const T &min(const vec<T> &v) {
	return *ranges::min_element(v);
}
template<class T>
[[nodiscard]] const T &max(const vec<T> &v) {
	return *ranges::max_element(v);
}
template<class T>
[[nodiscard]] T reduce(const ranges::range auto &v) {
	return reduce(v.begin(), v.end());
}

[[nodiscard]] constexpr ll powll(ll a, ll b, const ll m = inf) {
	if(b < 0) [[unlikely]] throw invalid_argument("powll(): exponent less than zero");
	if(m < 1) [[unlikely]] throw invalid_argument("powll(): modulo less than one");
	a %= m;
	ll ret = 1;
	while(b) {
		if(b % 2) ret *= a, ret %= m;
		a *= a, a %= m;
		b /= 2;
	}
	return ret;
}

template<class T, class U>
requires assignable_from<T&, U> && totally_ordered_with<T, U>
bool mini(T &var, const U &val) noexcept {
	const bool cmp = var > val;
	if(cmp) var = val;
	return cmp;
}
template<class T, class U>
requires assignable_from<T&, U> && totally_ordered_with<T, U>
bool maxi(T &var, const U &val) noexcept {
	const bool cmp = var < val;
	if(cmp) var = val;
	return cmp;
}

namespace myclass {
	class [[nodiscard]] grid_base {
		public:
		grid_base(const ll h, const ll w) noexcept : height(h), width(w) {}

		[[nodiscard]] ll operator()(const ll i, const ll j) const noexcept {
			if(!isvalid(i, j)) return -1;
			return i * width + j;
		}

		[[nodiscard]] ll operator()(const pall &p) const noexcept {
			return (*this)(p.first, p.second);
		}

		protected:
		bool isvalid(const ll i, const ll j) const noexcept {
			return 0 <= i && 0 <= j && i < height && j < width;
		}
		const ll height, width;
	};
}

using grid_lite = myclass::grid_base;

class [[nodiscard]] grid_seen : public myclass::grid_base {
	public:
	grid_seen(const ll h, const ll w) : grid_base(h, w) {
		visited = vebo(h * w, false);
	}

	[[nodiscard]] bool &seen(const ll i, const ll j) & {
		if(!isvalid(i, j)) [[unlikely]] throw out_of_range("grid::seen(): out of range");
		return visited[i * width + j];
	}

	[[nodiscard]] bool &seen(const pall &p) & {
		return seen(p.first, p.second);
	}

	private:
	vebo visited;
};

template<convertible_to<ll> auto upper, class... Args>
constexpr auto grid(Args... args) {
	if constexpr (ll(upper) < ll(1e7)) {
		return grid_seen(forward<Args>(args)...);
	} else {
		return grid_lite(forward<Args>(args)...);
	}
}

template<class T>
auto erase_single(multiset<T> &mset, const T &v) {
	const auto it = mset.find(v);
	if(it == mset.end()) [[unlikely]] throw invalid_argument("erase_single(): why v not in mset!?!?");
	return mset.erase(it);
}

void solve();

int main(void) {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	solve();
	return 0;
}

void solve() {
	ll n, t, x, y;
	cin >> n >> t >> x >> y;
	vell d(n);
	cin >> d;
	ranges::sort(d);
	vell delta(n-1);
	times(n-1) {
		delta[_i] = d[_i+1] - d[_i];
	}
	ranges::sort(delta);
	ll ans = 0;
	cout << 0 << sp;
	times(n-1) {
		ans += ll(delta[_i] > t) * x;
		cout << ans << " \n"[_i == n-2];
	}
}
0