結果
| 問題 |
No.2404 Vertical Throw Up
|
| コンテスト | |
| ユーザー |
 fuppy_kyopro
|
| 提出日時 | 2023-08-04 21:56:37 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 86 ms / 2,000 ms |
| コード長 | 6,459 bytes |
| コンパイル時間 | 13,276 ms |
| コンパイル使用メモリ | 300,936 KB |
| 最終ジャッジ日時 | 2025-02-15 22:41:24 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 30 |
ソースコード
//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
#include <bits/stdc++.h>
// #include <atcoder/all>
// #include <atcoder/convolution>
using namespace std;
// using namespace atcoder;
// #define _GLIBCXX_DEBUG
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
cerr << " " << v[iiiiiiii]; \
cerr << endl;
#define DEBUG_MAT(v) \
cerr << #v << endl; \
for (int iv = 0; iv < v.size(); iv++) { \
for (int jv = 0; jv < v[iv].size(); jv++) { \
cerr << v[iv][jv] << " "; \
} \
cerr << endl; \
}
typedef long long ll;
// #define int ll
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
Setup_io() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(25);
}
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'
template <typename T, const T id>
class convex_hull_trick {
struct line {
T a, b;
line(T a_ = 0, T b_ = 0) : a(a_), b(b_) {}
T get(T x) { return a * x + b; }
};
struct node {
line l;
node *lch, *rch;
node(line l_) : l(l_), lch(nullptr), rch(nullptr) {}
~node() {
if (lch) delete lch;
if (rch) delete rch;
}
};
private:
const int n;
const vector<T> pos;
node *root;
public:
convex_hull_trick(const vector<T> &pos_) : n(pos_.size()), pos(pos_), root(nullptr) {}
~convex_hull_trick() {
if (root) delete root;
}
void insert(T a, T b) {
line l(a, b);
root = modify(root, 0, n - 1, l);
}
T get(T x) const {
int t = lower_bound(pos.begin(), pos.end(), x) - pos.begin();
assert(t < n && pos[t] == x);
return sub(root, 0, n - 1, t);
}
private:
node *modify(node *p, int lb, int ub, line &l) {
if (!p) return new node(l);
if (p->l.get(pos[lb]) >= l.get(pos[lb]) && p->l.get(pos[ub]) >= l.get(pos[ub])) return p;
if (p->l.get(pos[lb]) <= l.get(pos[lb]) && p->l.get(pos[ub]) <= l.get(pos[ub])) {
p->l = l;
return p;
}
int c = (lb + ub) / 2;
if (p->l.get(pos[c]) < l.get(pos[c])) swap(p->l, l);
if (p->l.get(pos[lb]) <= l.get(pos[lb]))
p->lch = modify(p->lch, lb, c, l);
else
p->rch = modify(p->rch, c + 1, ub, l);
return p;
}
T sub(node *p, int lb, int ub, int t) const {
if (!p) return id;
if (ub - lb == 0) return p->l.get(pos[t]);
int c = (lb + ub) / 2;
if (t <= c) return max(p->l.get(pos[t]), sub(p->lch, lb, c, t));
return max(p->l.get(pos[t]), sub(p->rch, c + 1, ub, t));
}
};
signed main() {
// 多分通らない
int a;
cin >> a;
int q;
cin >> q;
vector<tuple<int, int, int>> inputs;
vl as;
while (q--) {
int ty;
cin >> ty;
ll a = -1, b = -1;
if (ty == 1) {
cin >> a >> b;
as.push_back(b);
} else {
cin >> a;
as.push_back(a);
}
inputs.emplace_back(ty, a, b);
}
sort(all(as));
UNIQUE(as);
convex_hull_trick<ll, -(ll)8e18> cht(as);
int cnt = 0;
for (auto [ty, aa, bb] : inputs) {
if (ty == 1) {
ll s, t;
s = aa;
t = bb;
ll b = (t - s) * a;
cnt++;
cht.insert(2 * a * s + b, -a * s * s - b * s);
} else {
if (cnt == 0) {
cout << 0 << endl;
continue;
}
ll t = aa;
ll mi = cht.get(t);
ll ans = mi;
ans -= a * t * t;
if (ans <= 0) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
}
}
}