oj.uz

답안 #1000191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000191 2024-06-17T00:42:14 Z Benq Tower (JOI24_tower) C++17
100 / 100
 121 ms 22616 KB 
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;

using ll = long long;
using db = long double;  // or double, if TL is tight
using str = string;      // yay python!

// pairs
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
#define mp make_pair
#define f first
#define s second

#define tcT template <class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T>;
tcT, size_t SZ > using AR = array<T, SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;
using vpd = V<pd>;

// vectors
#define sz(x) int(size(x))
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()

#define lb lower_bound
#define ub upper_bound
tcT > int lwb(const V<T> &a, const T &b) { return int(lb(all(a), b) - bg(a)); }
tcT > int upb(const V<T> &a, const T &b) { return int(ub(all(a), b) - bg(a)); }

// loops
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a : x)

const int MOD = 998244353;  // 1e9+7;
const int MX = (int)2e5 + 5;
const ll BIG = 1e18;  // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1, 0, -1, 0}, dy[4]{0, 1, 0, -1};  // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

// bitwise ops
// also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); }  // # of bits set
constexpr int bits(int x) {  // assert(x >= 0); // make C++11 compatible until
	                         // USACO updates ...
	return x == 0 ? 0 : 31 - __builtin_clz(x);
}  // floor(log2(x))
constexpr int p2(int x) { return 1 << x; }
constexpr int msk2(int x) { return p2(x) - 1; }

ll cdiv(ll a, ll b) {
	return a / b + ((a ^ b) > 0 && a % b);
}  // divide a by b rounded up
ll fdiv(ll a, ll b) {
	return a / b - ((a ^ b) < 0 && a % b);
}  // divide a by b rounded down

tcT > bool ckmin(T &a, const T &b) {
	return b < a ? a = b, 1 : 0;
}  // set a = min(a,b)
tcT > bool ckmax(T &a, const T &b) {
	return a < b ? a = b, 1 : 0;
}  // set a = max(a,b)

tcTU > T fstTrue(T lo, T hi, U f) {
	++hi;
	assert(lo <= hi);  // assuming f is increasing
	while (lo < hi) {  // find first index such that f is true
		T mid = lo + (hi - lo) / 2;
		f(mid) ? hi = mid : lo = mid + 1;
	}
	return lo;
}
tcTU > T lstTrue(T lo, T hi, U f) {
	--lo;
	assert(lo <= hi);  // assuming f is decreasing
	while (lo < hi) {  // find first index such that f is true
		T mid = lo + (hi - lo + 1) / 2;
		f(mid) ? lo = mid : hi = mid - 1;
	}
	return lo;
}
tcT > void remDup(vector<T> &v) {  // sort and remove duplicates
	sort(all(v));
	v.erase(unique(all(v)), end(v));
}
tcTU > void safeErase(T &t, const U &u) {
	auto it = t.find(u);
	assert(it != end(t));
	t.erase(it);
}

inline namespace IO {
#define SFINAE(x, ...)                                                         \
	template <class, class = void> struct x : std::false_type {};              \
	template <class T> struct x<T, std::void_t<__VA_ARGS__>> : std::true_type {}

SFINAE(DefaultI, decltype(std::cin >> std::declval<T &>()));
SFINAE(DefaultO, decltype(std::cout << std::declval<T &>()));
SFINAE(IsTuple, typename std::tuple_size<T>::type);
SFINAE(Iterable, decltype(std::begin(std::declval<T>())));

template <auto &is> struct Reader {
	template <class T> void Impl(T &t) {
		if constexpr (DefaultI<T>::value) is >> t;
		else if constexpr (Iterable<T>::value) {
			for (auto &x : t) Impl(x);
		} else if constexpr (IsTuple<T>::value) {
			std::apply([this](auto &...args) { (Impl(args), ...); }, t);
		} else static_assert(IsTuple<T>::value, "No matching type for read");
	}
	template <class... Ts> void read(Ts &...ts) { ((Impl(ts)), ...); }
};

template <class... Ts> void re(Ts &...ts) { Reader<cin>{}.read(ts...); }
#define def(t, args...)                                                        \
	t args;                                                                    \
	re(args);

template <auto &os, bool debug, bool print_nd> struct Writer {
	string comma() const { return debug ? "," : ""; }
	template <class T> constexpr char Space(const T &) const {
		return print_nd && (Iterable<T>::value or IsTuple<T>::value) ? '\n'
		                                                             : ' ';
	}
	template <class T> void Impl(T const &t) const {
		if constexpr (DefaultO<T>::value) os << t;
		else if constexpr (Iterable<T>::value) {
			if (debug) os << '{';
			int i = 0;
			for (auto &&x : t)
				((i++) ? (os << comma() << Space(x), Impl(x)) : Impl(x));
			if (debug) os << '}';
		} else if constexpr (IsTuple<T>::value) {
			if (debug) os << '(';
			std::apply(
			    [this](auto const &...args) {
				    int i = 0;
				    (((i++) ? (os << comma() << " ", Impl(args)) : Impl(args)),
				     ...);
			    },
			    t);
			if (debug) os << ')';
		} else static_assert(IsTuple<T>::value, "No matching type for print");
	}
	template <class T> void ImplWrapper(T const &t) const {
		if (debug) os << "\033[0;31m";
		Impl(t);
		if (debug) os << "\033[0m";
	}
	template <class... Ts> void print(Ts const &...ts) const {
		((Impl(ts)), ...);
	}
	template <class F, class... Ts>
	void print_with_sep(const std::string &sep, F const &f,
	                    Ts const &...ts) const {
		ImplWrapper(f), ((os << sep, ImplWrapper(ts)), ...), os << '\n';
	}
	void print_with_sep(const std::string &) const { os << '\n'; }
};

template <class... Ts> void pr(Ts const &...ts) {
	Writer<cout, false, true>{}.print(ts...);
}
template <class... Ts> void ps(Ts const &...ts) {
	Writer<cout, false, true>{}.print_with_sep(" ", ts...);
}
}  // namespace IO

inline namespace Debug {
template <typename... Args> void err(Args... args) {
	Writer<cerr, true, false>{}.print_with_sep(" | ", args...);
}
template <typename... Args> void errn(Args... args) {
	Writer<cerr, true, true>{}.print_with_sep(" | ", args...);
}

void err_prefix(str func, int line, string args) {
	cerr << "\033[0;31m\u001b[1mDEBUG\033[0m"
	     << " | "
	     << "\u001b[34m" << func << "\033[0m"
	     << ":"
	     << "\u001b[34m" << line << "\033[0m"
	     << " - "
	     << "[" << args << "] = ";
}

#ifdef LOCAL
#define dbg(args...) err_prefix(__FUNCTION__, __LINE__, #args), err(args)
#define dbgn(args...) err_prefix(__FUNCTION__, __LINE__, #args), errn(args)
#else
#define dbg(...)
#define dbgn(args...)
#endif

const auto beg_time = std::chrono::high_resolution_clock::now();
// https://stackoverflow.com/questions/47980498/accurate-c-c-clock-on-a-multi-core-processor-with-auto-overclock?noredirect=1&lq=1
double time_elapsed() {
	return chrono::duration<double>(std::chrono::high_resolution_clock::now() -
	                                beg_time)
	    .count();
}
}  // namespace Debug

inline namespace FileIO {
void setIn(str s) { freopen(s.c_str(), "r", stdin); }
void setOut(str s) { freopen(s.c_str(), "w", stdout); }
void setIO(str s = "") {
	cin.tie(0)->sync_with_stdio(0);  // unsync C / C++ I/O streams
	cout << fixed << setprecision(12);
	// cin.exceptions(cin.failbit);
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) setIn(s + ".in"), setOut(s + ".out");  // for old USACO
}
}  // namespace FileIO

ll D;

struct Ival {
	ll l, r;
	ll min_ans, max_ans, increase;
	bool contains(ll x) {
		assert(l <= x && x <= r);
		return true;
	}
	ll query_max_ans(ll x) {
		assert(1 <= increase && increase <= D);
		assert(contains(x));
		return max_ans + (x - l - increase + D) / D;
	}
	ll find_first(ll ans) {
		assert(ans >= max_ans);
		if (ans <= max_ans) return l;
		return l + increase + (ans - max_ans - 1) * D;
	}
};

int main() {
	// read read read
	setIO();
	def(int, N, Q);
	re(D);
	def(int, A, B);
	vpl banned(N);
	re(banned);
	V<Ival> sofar;
	sofar.pb({0, banned.ft.f - 1, 0, 0, D});
	int ptr = 0, ptr2 = 0;
	auto find_next = [&](ll x) {
		assert(sofar.at(ptr).contains(x));
		ll ans_init = sofar[ptr].query_max_ans(x);
		ckmax(ptr2, ptr);
		while (ptr2 < sz(sofar) &&
		       sofar[ptr2].query_max_ans(sofar[ptr2].r) <= ans_init) {
			assert(sofar[ptr2].query_max_ans(sofar[ptr2].r) == ans_init);
			++ptr2;
		}
		if (ptr2 == sz(sofar)) return BIG;
		return sofar[ptr2].find_first(ans_init + 1);
	};
	auto add_ival = [&](ll l, ll r) {
		while (ptr < sz(sofar) && sofar[ptr].r < l - D) ++ptr;
		if (ptr == sz(sofar)) return;
		l = max(l, sofar.at(ptr).l + D);
		if (l > r) return;
		sofar.pb({l, r, sofar[ptr].min_ans + 1,
		          sofar[ptr].query_max_ans(l - D) + 1,
		          min(D, find_next(l - D) - (l - D))});
	};
	F0R(i, N)
	add_ival(banned.at(i).s + 1, (i + 1 == N ? BIG : banned.at(i + 1).f) - 1);
	auto calc_ans = [&](ll x, ll jump) {
		return jump * B + (x - D * jump) * A;
	};
	rep(Q) {
		def(ll, x);
		int i =
		    lstTrue(0, sz(sofar) - 1, [&](int p) { return sofar[p].l <= x; });
		if (sofar.at(i).r < x) {
			ps(-1);
			continue;
		}
		ll ret = LLONG_MAX;
		for (ll test : {sofar.at(i).min_ans, sofar.at(i).query_max_ans(x)}) {
			ckmin(ret, calc_ans(x, test));
		}
		ps(ret);
	}
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */

Compilation message

Main.cpp: In function 'void FileIO::setIn(str)':
Main.cpp:246:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  246 | void setIn(str s) { freopen(s.c_str(), "r", stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void FileIO::setOut(str)':
Main.cpp:247:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  247 | void setOut(str s) { freopen(s.c_str(), "w", stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 37 ms 3420 KB Output is correct
4 Correct 37 ms 3408 KB Output is correct
5 Correct 41 ms 3220 KB Output is correct
6 Correct 40 ms 3412 KB Output is correct
7 Correct 37 ms 3412 KB Output is correct
8 Correct 90 ms 16832 KB Output is correct
9 Correct 87 ms 17264 KB Output is correct
10 Correct 85 ms 18104 KB Output is correct
11 Correct 83 ms 17084 KB Output is correct
12 Correct 82 ms 16832 KB Output is correct
13 Correct 43 ms 8528 KB Output is correct
14 Correct 56 ms 9416 KB Output is correct
15 Correct 41 ms 7820 KB Output is correct
16 Correct 60 ms 18632 KB Output is correct
17 Correct 45 ms 8272 KB Output is correct
18 Correct 46 ms 8528 KB Output is correct
19 Correct 22 ms 2648 KB Output is correct
20 Correct 21 ms 2616 KB Output is correct
21 Correct 21 ms 2652 KB Output is correct
22 Correct 23 ms 3676 KB Output is correct
23 Correct 23 ms 2644 KB Output is correct
24 Correct 24 ms 3592 KB Output is correct
25 Correct 23 ms 2652 KB Output is correct
26 Correct 24 ms 3676 KB Output is correct
27 Correct 21 ms 2640 KB Output is correct
28 Correct 24 ms 3668 KB Output is correct
29 Correct 21 ms 2652 KB Output is correct
30 Correct 25 ms 3668 KB Output is correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 556 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2560 KB Output is correct
2 Correct 30 ms 2488 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 99 ms 20676 KB Output is correct
5 Correct 97 ms 20820 KB Output is correct
6 Correct 96 ms 20400 KB Output is correct
7 Correct 109 ms 20416 KB Output is correct
8 Correct 98 ms 21172 KB Output is correct
9 Correct 101 ms 20660 KB Output is correct
10 Correct 97 ms 21336 KB Output is correct
11 Correct 107 ms 21164 KB Output is correct
12 Correct 100 ms 21744 KB Output is correct
13 Correct 102 ms 21752 KB Output is correct
14 Correct 66 ms 13256 KB Output is correct
15 Correct 62 ms 12032 KB Output is correct
16 Correct 85 ms 12176 KB Output is correct
17 Correct 96 ms 21172 KB Output is correct
18 Correct 95 ms 20156 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 37 ms 3420 KB Output is correct
4 Correct 37 ms 3408 KB Output is correct
5 Correct 41 ms 3220 KB Output is correct
6 Correct 40 ms 3412 KB Output is correct
7 Correct 37 ms 3412 KB Output is correct
8 Correct 90 ms 16832 KB Output is correct
9 Correct 87 ms 17264 KB Output is correct
10 Correct 85 ms 18104 KB Output is correct
11 Correct 83 ms 17084 KB Output is correct
12 Correct 82 ms 16832 KB Output is correct
13 Correct 43 ms 8528 KB Output is correct
14 Correct 56 ms 9416 KB Output is correct
15 Correct 41 ms 7820 KB Output is correct
16 Correct 60 ms 18632 KB Output is correct
17 Correct 45 ms 8272 KB Output is correct
18 Correct 46 ms 8528 KB Output is correct
19 Correct 22 ms 2648 KB Output is correct
20 Correct 21 ms 2616 KB Output is correct
21 Correct 21 ms 2652 KB Output is correct
22 Correct 23 ms 3676 KB Output is correct
23 Correct 23 ms 2644 KB Output is correct
24 Correct 24 ms 3592 KB Output is correct
25 Correct 23 ms 2652 KB Output is correct
26 Correct 24 ms 3676 KB Output is correct
27 Correct 21 ms 2640 KB Output is correct
28 Correct 24 ms 3668 KB Output is correct
29 Correct 21 ms 2652 KB Output is correct
30 Correct 25 ms 3668 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 556 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 600 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 21 ms 2560 KB Output is correct
49 Correct 30 ms 2488 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 99 ms 20676 KB Output is correct
52 Correct 97 ms 20820 KB Output is correct
53 Correct 96 ms 20400 KB Output is correct
54 Correct 109 ms 20416 KB Output is correct
55 Correct 98 ms 21172 KB Output is correct
56 Correct 101 ms 20660 KB Output is correct
57 Correct 97 ms 21336 KB Output is correct
58 Correct 107 ms 21164 KB Output is correct
59 Correct 100 ms 21744 KB Output is correct
60 Correct 102 ms 21752 KB Output is correct
61 Correct 66 ms 13256 KB Output is correct
62 Correct 62 ms 12032 KB Output is correct
63 Correct 85 ms 12176 KB Output is correct
64 Correct 96 ms 21172 KB Output is correct
65 Correct 95 ms 20156 KB Output is correct
66 Correct 121 ms 21336 KB Output is correct
67 Correct 100 ms 22356 KB Output is correct
68 Correct 95 ms 20372 KB Output is correct
69 Correct 106 ms 20724 KB Output is correct
70 Correct 97 ms 21468 KB Output is correct
71 Correct 100 ms 20328 KB Output is correct
72 Correct 99 ms 20308 KB Output is correct
73 Correct 94 ms 20396 KB Output is correct
74 Correct 112 ms 22192 KB Output is correct
75 Correct 102 ms 20144 KB Output is correct
76 Correct 90 ms 17368 KB Output is correct
77 Correct 106 ms 21420 KB Output is correct
78 Correct 68 ms 13508 KB Output is correct
79 Correct 105 ms 22616 KB Output is correct
80 Correct 115 ms 20852 KB Output is correct
81 Correct 105 ms 21424 KB Output is correct
82 Correct 105 ms 22192 KB Output is correct
83 Correct 60 ms 12176 KB Output is correct
84 Correct 61 ms 11996 KB Output is correct
85 Correct 59 ms 11872 KB Output is correct
86 Correct 64 ms 12744 KB Output is correct
87 Correct 60 ms 11920 KB Output is correct