結果
問題 | No.1074 増殖 |
ユーザー |
![]() |
提出日時 | 2020-06-05 21:59:26 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 50 ms / 2,000 ms |
コード長 | 2,988 bytes |
コンパイル時間 | 2,372 ms |
コンパイル使用メモリ | 200,704 KB |
最終ジャッジ日時 | 2025-01-10 22:33:12 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
ソースコード
#include <bits/stdc++.h>using namespace std;using int64 = long long;const int mod = 1e9 + 7;// const int mod = 998244353;const int64 infll = (1LL << 62) - 1;const int inf = (1 << 30) - 1;struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template< typename T = int64 >vector< T > make_v(size_t a) {return vector< T >(a);}template< typename T, typename... Ts >auto make_v(size_t a, Ts... ts) {return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));}template< typename T, typename V >typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {t = v;}template< typename T, typename V >typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {for(auto &e : t) fill_v(e, v);}template< typename F >struct FixPoint : F {FixPoint(F &&f) : F(forward< F >(f)) {}template< typename... Args >decltype(auto) operator()(Args &&... args) const {return F::operator()(*this, forward< Args >(args)...);}};template< typename F >inline decltype(auto) MFP(F &&f) {return FixPoint< F >{forward< F >(f)};}struct RectangleUnion {map< int64, int64 > data;int64 sum;RectangleUnion() : sum(0) {data[0] = 1LL << 60;data[1LL << 60] = 0;}void addPoint(int64 x, int64 y) {auto p = data.lower_bound(x);if(p->second >= y) return;const int64 nxtY = p->second;--p;while(p->second <= y) {auto it = *p;p = --data.erase(p);sum -= (it.first - p->first) * (it.second - nxtY);}sum += (x - p->first) * (y - nxtY);data[x] = y;}int64 getSum() {return (sum);}};int main() {int N;cin >> N;RectangleUnion x[4];int64 pre = 0;for(int i = 0; i < N; i++) {int xa, ya, xb, yb;cin >> xa >> ya >> xb >> yb;x[0].addPoint(-xa, -ya);x[1].addPoint(xb, yb);x[2].addPoint(-xa, yb);x[3].addPoint(xb, -ya);int64 nxt = x[0].getSum() + x[1].getSum() + x[2].getSum() + x[3].getSum();cout << nxt - pre << "\n";pre = nxt;}}