結果
問題 | No.1338 Giant Class |
ユーザー |
![]() |
提出日時 | 2021-01-15 21:51:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 114 ms / 2,000 ms |
コード長 | 5,552 bytes |
コンパイル時間 | 3,022 ms |
コンパイル使用メモリ | 225,108 KB |
最終ジャッジ日時 | 2025-01-17 19:11:24 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 21 |
ソースコード
#pragma GCC optimize("Ofast")#include "bits/stdc++.h"// Begin Header {{{using namespace std;#ifndef DEBUG#define dump(...)#endif#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)constexpr size_t operator""_zu(unsigned long long value) { return value; };constexpr intmax_t operator""_jd(unsigned long long value) { return value; };constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };constexpr int INF = 0x3f3f3f3f;constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;template <class T, class Compare = less<>>using MaxHeap = priority_queue<T, vector<T>, Compare>;template <class T, class Compare = greater<>>using MinHeap = priority_queue<T, vector<T>, Compare>;inline void input() {}template <class Head, class... Tail>inline void input(Head&& head, Tail&&... tail) {cin >> head;input(forward<Tail>(tail)...);}template <class Container, class Value = typename Container::value_type,enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>inline istream& operator>>(istream &is, Container &vs) {for (auto &v: vs) is >> v;return is;}inline void output() { cout << "\n"; }template <class Head, class... Tail>inline void output(Head&& head, Tail&&... tail) {cout << head;if (sizeof...(tail)) cout << " ";output(forward<Tail>(tail)...);}template <class Container, class Value = typename Container::value_type,enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>inline ostream& operator<<(ostream &os, const Container &vs) {static constexpr const char *delim[] = {" ", ""};for (auto it = begin(vs); it != end(vs); ++it) {os << delim[it == begin(vs)] << *it;}return os;}template <class Iterator>inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") {for (auto it = Begin; it != End; ++it) {cout << ((it == Begin) ? "" : delim) << *it;}cout << last;}template <class T>inline vector<T> makeVector(const T &init_value, size_t sz) {return vector<T>(sz, init_value);}template <class T, class... Args>inline auto makeVector(const T &init_value, size_t sz, Args... args) {return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));}template <class Func>class FixPoint : Func {public:explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}template <class... Args>constexpr decltype(auto) operator()(Args&&... args) const {return Func::operator()(*this, std::forward<Args>(args)...);}};template <class Func>static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {return FixPoint<Func>{forward<Func>(f)};}template <class Container>struct reverse_t {Container &c;reverse_t(Container &c) : c(c) {}auto begin() { return c.rbegin(); }auto end() { return c.rend(); }};template <class Container>auto reversed(Container &c) {return reverse_t<Container>(c);}template <class T>inline bool chmax(T &a, const T &b) noexcept {return b > a && (a = b, true);}template <class T>inline bool chmin(T &a, const T &b) noexcept {return b < a && (a = b, true);}template <class T>inline T diff(const T &a, const T &b) noexcept {return a < b ? b - a : a - b;}void operator|=(vector<bool>::reference lhs, const bool rhs) {lhs = lhs | rhs;}void ioinit() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);clog << fixed << setprecision(10);}// }}} End Header// Compress {{{template <class T>class Compress {vector<T> xs;public:Compress() = default;Compress(const vector<T> &vs) {add(vs);}void add(const vector<T> &vs) {copy(vs.begin(), vs.end(), back_inserter(xs));}void add(const T &x) {xs.emplace_back(x);}void build() {sort(xs.begin(), xs.end());xs.erase(unique(xs.begin(), xs.end()), xs.end());}vector<intmax_t> get(const vector<T> &vs) const {vector<intmax_t> ret;transform(vs.begin(), vs.end(), back_inserter(ret), [&](const T &v) {return distance(xs.begin(), lower_bound(xs.begin(), xs.end(), v));});return ret;}unordered_map<T, intmax_t> dict() const {unordered_map<T, intmax_t> ret;for (intmax_t i = 0; i < xs.size(); ++i) {ret[xs[i]] = i;}return ret;}const size_t size() const {return xs.size();}const T &operator[](size_t k) const {return xs[k];}};// }}}signed main() {ioinit();var(intmax_t, H, W, Q);vector<intmax_t> ys(Q), xs(Q);rep(i, 0, Q) input(ys[i], xs[i]), ys[i]--;Compress<intmax_t> zip(xs);zip.build();xs = zip.get(xs);intmax_t res = H * W;vector<set<intmax_t>> us(zip.size());for (auto& u: us) u.insert(H);rep(i, 0, Q) {res -= *us[xs[i]].begin();us[xs[i]].insert(ys[i]);res += *us[xs[i]].begin();output(res);}return 0;}