結果
| 問題 |
No.2404 Vertical Throw Up
|
| コンテスト | |
| ユーザー |
 asaringo
|
| 提出日時 | 2023-08-13 14:39:21 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 37 ms / 2,000 ms |
| コード長 | 9,412 bytes |
| コンパイル時間 | 1,968 ms |
| コンパイル使用メモリ | 213,928 KB |
| 最終ジャッジ日時 | 2025-02-16 07:47:24 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 30 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e ...) e
#define overload5(a, b, c, d, e, f ...) f
#define overload6(a, b, c, d, e, f, g ...) g
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
typedef long long ll;
typedef long double ld;
#define chmin(a,b) a = min(a,b);
#define chmax(a,b) a = max(a,b);
#define bit_count(x) __builtin_popcountll(x)
#define leading_zero_count(x) __builtin_clz(x)
#define trailing_zero_count(x) __builtin_ctz(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)
#define rep1(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl;
#define print(...) printall(__VA_ARGS__);
#define debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(T,n,a) vector<T>(n,a)
#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))
#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))
#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))
template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}
struct Int128t {
private:
__int128_t v;
public:
Int128t() {}
Int128t(const long long &a) { v = a; }
Int128t(const string &s) { parse(s); }
long long long_val() { return (long long)v; }
__int128_t val() { return v; }
__int128_t abs() { return v < 0 ? -v : v; }
void set(const long long &a) { v = a; }
void parse(const string &s) {
v = 0;
for ( char c : s ) {
if ( isdigit(c) ) v = v * 10 + (c - '0');
}
if ( s[0] == '-' ) v *= -1;
}
Int128t operator+=(const Int128t &a) {
v += a.v;
return *this;
}
Int128t operator-=(const Int128t &a) {
v -= a.v;
return *this;
}
Int128t operator*=(const Int128t &a) {
v *= a.v;
return *this;
}
Int128t operator/=(const Int128t &a) {
v /= a.v;
return *this;
}
Int128t operator%=(const Int128t &a) {
v %= a.v;
return *this;
}
Int128t& operator++() {
++v;
return *this;
}
Int128t operator++(int) {
Int128t tmp(*this);
++v;
return tmp;
}
Int128t& operator--() {
--v;
return *this;
}
Int128t operator--(int) {
Int128t tmp(*this);
--v;
return tmp;
}
Int128t operator-() const { return Int128t(-v); }
Int128t operator+(const Int128t &p) const { return Int128t(*this) += p; }
Int128t operator-(const Int128t &p) const { return Int128t(*this) -= p; }
Int128t operator*(const Int128t &p) const { return Int128t(*this) *= p; }
Int128t operator/(const Int128t &p) const { return Int128t(*this) /= p; }
Int128t operator%(const Int128t &p) const { return Int128t(*this) %= p; }
bool operator<(const Int128t &a) const { return v < a.v; }
bool operator>(const Int128t &a) const { return v > a.v; }
bool operator<=(const Int128t &a) const { return v <= a.v; }
bool operator>=(const Int128t &a) const { return v >= a.v; }
bool operator==(const Int128t &a) const { return v == a.v; }
bool operator!=(const Int128t &a) const { return v != a.v; }
friend istream &operator>>(istream &is, Int128t &v) {
string s;
is >> s;
v.parse(s);
return is;
}
friend ostream &operator<<(ostream &os, const Int128t &v) {
if ( !ostream::sentry(os) ) return os;
char buf[64];
char *d = end(buf);
__uint128_t tmp = (v.v < 0 ? -v.v : v.v);
do {
d--;
*d = char(tmp % 10 + '0');
tmp /= 10;
} while ( tmp );
if ( v.v < 0 ) {
d--;
*d = '-';
}
int len = end(buf) - d;
if ( os.rdbuf()->sputn(d, len) != len ) { os.setstate(ios_base::badbit); }
return os;
}
};
using int128t = Int128t;
template <typename T, T (*x_low)(), T (*x_high)(), T (*id)()>
struct DynamicLiChaoTree {
struct Line {
T a, b;
Line(T a, T b): a(a), b(b) {}
inline T get(T x) const { return a * x + b; }
};
struct Node {
Line x;
Node *l, *r;
Node(const Line &x): x(x), l{nullptr}, r{nullptr} {}
};
Node *root;
private:
Node *_add_line(Node *t, Line &x, const T &l, const T &r, const T &x_l, const T &x_r) {
if(!t) return new Node(x);
T t_l = t->x.get(l);
T t_r = t->x.get(r);
if(t_l <= x_l && t_r <= x_r) return t;
if(t_l >= x_l && t_r >=x_r) {
t->x = x;
return t;
}
T m = (l + r) / 2;
if(m == r) --m;
T t_m = t->x.get(m);
T x_m = x.get(m);
if(t_m > x_m) {
swap(t->x, x);
if(x_l >= t_l) t->l = _add_line(t->l, x, l, m, t_l, t_m);
else t->r = _add_line(t->r, x, m+1, r, t_m+x.a, t_r);
}
else{
if(t_l >= x_l) t->l = _add_line(t->l, x, l, m, x_l, x_m);
else t->r = _add_line(t->r, x, m+1, r, x_m+x.a, x_r);
}
return t;
}
Node *_add_segment(Node *t, Line &x, const T &a, const T &b, const T &l, const T &r, const T &x_l, const T &x_r) {
if(r < a || b < l) return t;
if(a <= l && r <= b) {
Line y{x};
return *add_line(t, y, l, r, x_l, x_r);
}
if(t) {
T t_l = t->x.get(l);
T t_r = t->x.get(r);
if(t_l <= x_l && t_r <= x_r) return t;
}
else t = new Node(Line(0, id()));
T m = (l + r) / 2;
if(m == r) --m;
T x_m = x.get(m);
t->l = _add_segment(t->l, x, a, b, l, m, x_l, x_m);
t->r = _add_segment(t->r, x, a, b, m+1, r, x_m+x.a, x_r);
return t;
}
T _query(Node *t, const T &l, const T &r, const T &x) const {
if(!t) return id();
if(l == r) return t->x.get(x);
T m = (l + r) / 2;
if(m == r) --m;
if(x <= m) return min(t->x.get(x), _query(t->l, l, m, x));
return min(t->x.get(x), _query(t->r, m+1, r, x));
}
public:
DynamicLiChaoTree(): root{nullptr} {}
void add_line(const T &a, const T &b){
Line x(a, b);
root = _add_line(root, x, x_low(), x_high(), x.get(x_low()), x.get(x_high()));
}
void add_segment(const T &l, const T &r, const T &a, const T &b){
Line x(a, b);
root = _add_segment(root, x, l, r-1, x_low(), x_high(), x.get(x_low()), x.get(x_high()));
}
T query(const T &x) const {
return _query(root, x_low(), x_high(), x);
}
};
namespace MyStruct{
using Type = int128t;
Type x_low() { return Type(0); };
Type x_high() { return Type(2e9); };
Type id() { return Type(1e18); };
};
void solve(){
ll a, q;
cin >> a >> q;
DynamicLiChaoTree<MyStruct::Type,MyStruct::x_low,MyStruct::x_high,MyStruct::id> S;
rep(i,q){
int t;
cin >> t;
if(t == 1){
ll x, y;
cin >> x >> y;
S.add_line(-a*(x+y),a*x*y);
}
if(t == 2){
ll x;
cin >> x;
auto res = -S.query(x) -a * x * x;
chmax(res,int128t(0));
pt(res)
}
}
}
int main(){
fast_io
int t = 1;
// cin >> t;
rep(i,t) solve();
}