結果

問題 No.2974 関数の芽
ユーザー ecottea
提出日時 2024-11-29 23:16:42
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 15,823 bytes
コンパイル時間 5,279 ms
コンパイル使用メモリ 286,636 KB
実行使用メモリ 35,456 KB
最終ジャッジ日時 2024-11-29 23:16:59
合計ジャッジ時間 12,805 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 13 WA * 11
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9e18int -2^31 2^31 = 2e9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
using mint = modint998244353;
//using mint = static_modint<1000000007>;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(...)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
//
/*
* Frac<T>() : O(1)
* 0
* T int, ll, __int128, boost::multiprecision::int256_t
*
* Frac<T>(T num) : O(1)
* num
*
* Frac<T>(T num, T dnm) : O(1)
* num / dnm
*
* a == b, a != b, a < b, a > b, a <= b, a >= b : O(1)
*
*
* a + b, a - b, a * b, a / b : O(1)
*
* 使
*
* reduction() : O(log min(num, dnm))
*
*
* together(Frac& a, Frac& b) : O(log min(a.dnm, b.dnm))
* a b
*
* together(vector<Frac>& as) : O(|as| log dnm)
* as
*
* T floor() : O(1)
* floor
*
* T ceil() : O(1)
* ceil
*
* bool integerQ() : O(1)
*
*/
template <class T = ll>
struct Frac {
//
T num, dnm;
//
Frac() : num(0), dnm(1) {}
Frac(T num) : num(num), dnm(1) {}
Frac(T num_, T dnm_) : num(num_), dnm(dnm_) {
// verify : https://atcoder.jp/contests/abc244/tasks/abc244_h
Assert(dnm != 0);
if (dnm < 0) { num *= -1; dnm *= -1; }
}
//
Frac(const Frac& b) = default;
Frac& operator=(const Frac& b) = default;
//
operator double() const { return (double)num / (double)dnm; }
//
bool operator==(const Frac& b) const {
//
if (dnm == b.dnm) return num == b.num;
return num * b.dnm == b.num * dnm;
}
bool operator!=(const Frac& b) const { return !(*this == b); }
bool operator<(const Frac& b) const {
// verify : https://atcoder.jp/contests/abc308/tasks/abc308_c
//
if (dnm == b.dnm) return num < b.num;
return (num * b.dnm < b.num * dnm);
}
bool operator>=(const Frac& b) const { return !(*this < b); }
bool operator>(const Frac& b) const { return b < *this; }
bool operator<=(const Frac& b) const { return !(*this > b); }
//
bool operator==(T b) const { return num == b * dnm; }
bool operator!=(T b) const { return num != b * dnm; }
bool operator<(T b) const { return num < b * dnm; }
bool operator>=(T b) const { return num >= b * dnm; }
bool operator>(T b) const { return num > b * dnm; }
bool operator<=(T b) const { return num <= b * dnm; }
friend bool operator==(T a, const Frac& b) { return a * b.dnm == b.num; }
friend bool operator!=(T a, const Frac& b) { return a * b.dnm != b.num; }
friend bool operator<(T a, const Frac& b) { return a * b.dnm < b.num; }
friend bool operator>=(T a, const Frac& b) { return a * b.dnm >= b.num; }
friend bool operator>(T a, const Frac& b) { return a * b.dnm > b.num; }
friend bool operator<=(T a, const Frac& b) { return a * b.dnm <= b.num; }
//
Frac& operator+=(const Frac& b) {
// verify : https://www.codechef.com/problems/ARCTR
//
if (dnm == b.dnm) num += b.num;
else { num = num * b.dnm + b.num * dnm; dnm *= b.dnm; }
return *this;
}
Frac& operator-=(const Frac& b) {
// verify : https://www.codechef.com/problems/ARCTR
//
if (dnm == b.dnm) num -= b.num;
else { num = num * b.dnm - b.num * dnm; dnm *= b.dnm; }
return *this;
}
Frac& operator*=(const Frac& b) { num *= b.num; dnm *= b.dnm; return *this; }
Frac& operator/=(const Frac& b) {
// verify : https://atcoder.jp/contests/abc301/tasks/abc301_g
Assert(b.num != 0);
num *= b.dnm; dnm *= b.num;
if (dnm < 0) { num *= -1; dnm *= -1; }
return *this;
}
Frac operator+(const Frac& b) const { Frac a = *this; return a += b; }
Frac operator-(const Frac& b) const { Frac a = *this; return a -= b; }
Frac operator*(const Frac& b) const { Frac a = *this; return a *= b; }
Frac operator/(const Frac& b) const { Frac a = *this; return a /= b; }
Frac operator-() const { return Frac(*this) *= Frac(-1); }
//
Frac& operator+=(T c) { num += dnm * c; return *this; }
Frac& operator-=(T c) { num -= dnm * c; return *this; }
Frac& operator*=(T c) { num *= c; return *this; }
Frac& operator/=(T c) {
Assert(c != T(0));
dnm *= c;
if (dnm < 0) { num *= -1; dnm *= -1; }
return *this;
}
Frac operator+(T c) const { Frac a = *this; return a += c; }
Frac operator-(T c) const { Frac a = *this; return a -= c; }
Frac operator*(T c) const { Frac a = *this; return a *= c; }
Frac operator/(T c) const { Frac a = *this; return a /= c; }
friend Frac operator+(T c, const Frac& a) { return a + c; }
friend Frac operator-(T c, const Frac& a) { return Frac(c) - a; }
friend Frac operator*(T c, const Frac& a) { return a * c; }
friend Frac operator/(T c, const Frac& a) { return Frac(c) / a; }
//
void reduction() {
// verify : https://atcoder.jp/contests/abc229/tasks/abc229_h
auto g = gcd(num, dnm);
num /= g; dnm /= g;
}
// a b
friend void together(Frac& a, Frac& b) {
// verify : https://atcoder.jp/contests/abc229/tasks/abc229_h
T dnm = lcm(a.dnm, b.dnm);
a.num *= dnm / a.dnm; a.dnm = dnm;
b.num *= dnm / b.dnm; b.dnm = dnm;
}
// as
friend void together(vector<Frac>& as) {
// verify : https://yukicoder.me/problems/617
T dnm = 1;
repe(a, as) dnm = lcm(dnm, a.dnm);
repea(a, as) {
a.num *= dnm / a.dnm;
a.dnm = dnm;
}
}
// floor
T floor() const {
// verify : https://www.codechef.com/problems/LINEFIT?tab=statement
if (num >= 0) return num / dnm;
else return -((-num + dnm - 1) / dnm);
}
// ceil
T ceil() const {
// verify : https://www.codechef.com/problems/LINEFIT?tab=statement
if (num >= 0) return (num + dnm - 1) / dnm;
else return -((-num) / dnm);
}
//
bool integerQ() const {
// verify : https://atcoder.jp/contests/ttpc2022/tasks/ttpc2022_g
return num % dnm == 0;
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const Frac& a) { os << a.num << '/' << a.dnm; return os; }
#endif
};
using F = Frac<ll>;
//O(n log n)
/*
* a[0..n) a_cp[0..n)
* xs[j] j
*
* a a_cp[i] a[i]
* xs[j] j
*/
template <class T>
int coordinate_compression(const vector<T>& a, vi& a_cp, vector<T>* xs = nullptr) {
// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_o
int n = sz(a);
if (xs == nullptr) xs = new vector<T>;
// *xs : a x
*xs = a;
uniq(*xs);
// a[i] xs
a_cp.resize(n);
rep(i, n) a_cp[i] = lbpos(*xs, a[i]);
return sz(*xs);
}
//
/*
* S ∋ x = {v, i, 1} : i 1 v
* F ∋ f = {a, b} : f(x) = a x + b
* x op y : vx + vy
* f act x : v a i + b
* f comp g : (af + ag) i + (bf + bg)
*/
// verify : https://atcoder.jp/contests/abc268/tasks/abc268_e
using T117 = F;
using S117 = tuple<T117, T117, T117>; // (v, i, 1)
using F117 = pair<T117, T117>; // (1, a, b; 0, 1, 0; 0, 0, 1)
S117 op117(S117 x, S117 y) {
auto [vx, sx, cx] = x; // (vx, sx, cx)
auto [vy, sy, cy] = y; // (vy, sy, cy)
// (vx, sx, cx) + (vy, sy, cy) = (vx + vy, sx + sy, cx + cy)
return { vx + vy, sx + sy, cx + cy };
}
S117 e117() { return { 0, 0, 0 }; }
S117 act117(F117 f, S117 x) {
auto [v, s, c] = x; // (v, s, c)
auto [a, b] = f; // (1, a, b; 0, 1, 0; 0, 0, 1)
// (1, a, b; 0, 1, 0; 0, 0, 1).(v, s, c) = (v + a s + b c, s, c)
return { v + a * s + b * c, s, c };
}
F117 comp117(F117 f, F117 g) {
auto [a, b] = f; // (1, a, b; 0, 1, 0; 0, 0, 1)
auto [c, d] = g; // (1, c, d; 0, 1, 0; 0, 0, 1)
// (1, a, b; 0, 1, 0; 0, 0, 1).(1, c, d; 0, 1, 0; 0, 0, 1) = (1, a + c, b + d; 0, 1, 0; 0, 0, 1)
return { a + c, b + d };
}
F117 id117() { return { 0, 0 }; }
#define LinearAdd_Sum_mmonoid S117, op117, e117, F117, act117, comp117, id117
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int q;
cin >> q;
vl a1(q), b1(q), a2(q), b2(q), x(q);
rep(j, q) cin >> a1[j] >> b1[j] >> a2[j] >> b2[j] >> x[j];
vector<F> x0(2 * q);
rep(j, q) {
if (a1[j] != 0) x0[2 * j + 0] = F(-b1[j], a1[j]);
if (a2[j] != 0) x0[2 * j + 1] = F(-b2[j], a2[j]);
}
x0.push_back(F(-INF));
x0.push_back(F(INF));
x0.push_back(F(-INF-1));
x0.push_back(F(INF+1));
vi X; vector<F> xs;
auto m = coordinate_compression(x0, X, &xs);
dump(m); dump(X); dump(xs);
vector<S117> ini(m - 1);
rep(j, m - 1) {
auto l = xs[j];
auto r = xs[j + 1];
ini[j] = { 0, (l + r) * (r - l) * F(1, 2), r - l };
}
dump(ini);
lazy_segtree<LinearAdd_Sum_mmonoid> seg(ini);
rep(j, q) {
if (a1[j] > 0) {
seg.apply(X[2 * j + 0], m - 1, { a1[j], b1[j] });
}
else if (a1[j] < 0) {
seg.apply(0, X[2 * j + 0], { a1[j], b1[j] });
}
else if (b1[j] > 0) {
seg.apply(0, m - 1, { a1[j], b1[j]});
}
if (a2[j] > 0) {
seg.apply(X[2 * j + 1], m - 1, { -a2[j], -b2[j] });
}
else if (a2[j] < 0) {
seg.apply(0, X[2 * j + 1], { -a2[j], -b2[j] });
}
else if (b2[j] > 0) {
seg.apply(0, m - 1, { -a2[j], -b2[j] });
}
dump(seg);
auto i = lbpos(xs, x[j]);
dump("i:", i);
if (xs[i] == x[j]) {
if (get<0>(seg.get(i - 1)) != F(0)) {
Yes(0);
continue;
}
if (get<0>(seg.get(i)) != F(0)) {
Yes(0);
continue;
}
if (get<0>(seg.get(i + 1)) != F(0)) {
Yes(0);
continue;
}
}
else {
if (get<0>(seg.get(i - 1)) != F(0)) {
Yes(0);
continue;
}
if (get<0>(seg.get(i)) != F(0)) {
Yes(0);
continue;
}
}
Yes(1);
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0