結果
問題 | No.1074 増殖 |
ユーザー |
![]() |
提出日時 | 2020-12-04 20:49:31 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 3,378 bytes |
コンパイル時間 | 2,511 ms |
コンパイル使用メモリ | 208,344 KB |
最終ジャッジ日時 | 2025-01-16 16:05:31 |
ジャッジサーバーID (参考情報) |
judge4 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
ソースコード
#define MOD_TYPE 1#pragma region Macros#include <bits/stdc++.h>using namespace std;#if 0#include <boost/multiprecision/cpp_int.hpp>#include <boost/multiprecision/cpp_dec_float.hpp>using Int = boost::multiprecision::cpp_int;using lld = boost::multiprecision::cpp_dec_float_100;#endif#if 1#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#endifusing ll = long long int;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using pld = pair<ld, ld>;template <typename Q_type>using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);constexpr int INF = (int)1e9 + 10;constexpr ll LINF = (ll)4e18;constexpr double PI = acos(-1.0);constexpr double EPS = 1e-7;constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)#define rep(i, n) REP(i, 0, n)#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)#define repi(i, n) REPI(i, 0, n)#define MP make_pair#define MT make_tuple#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"#define all(v) v.begin(), v.end()#define NP(v) next_permutation(all(v))#define dbg(x) cerr << #x << ":" << x << "\n";struct io_init{io_init(){cin.tie(0);ios::sync_with_stdio(false);cout << setprecision(30) << setiosflags(ios::fixed);};} io_init;template <typename T>inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}template <typename T>inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}inline ll CEIL(ll a, ll b){return (a + b - 1) / b;}template <typename A, size_t N, typename T>inline void Fill(A (&array)[N], const T &val){fill((T *)array, (T *)(array + N), val);}template <typename T, typename U>constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept{is >> p.first >> p.second;return is;}template <typename T, typename U>constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept{os << p.first << " " << p.second;return os;}#pragma endregion// 原点を頂点に持つ長方形群の和集合の面積を管理struct RectArea{map<ll, ll> mp; // 凸包ll S = 0; // 総面積RectArea() { mp[0] = 4e18, mp[ll(4e18)] = 0; }void add(ll x, ll y){if (y <= mp.lower_bound(x)->second)return;auto itr = mp.upper_bound(x);S += (x - prev(itr)->first) * (y - itr->second);itr = prev(itr);while (itr->second <= y){ll dx = itr->first - prev(itr)->first;ll dy = y - itr->second;S += dx * dy;itr = prev(mp.erase(itr));}mp[x] = y;}};void solve(){int n;cin >> n;RectArea ra[4];ll pre = 0;rep(i, n){int xa, ya, xb, yb;cin >> xa >> ya >> xb >> yb;xa *= -1, ya *= -1;ra[0].add(xa, ya);ra[1].add(xb, ya);ra[2].add(xa, yb);ra[3].add(xb, yb);ll S = 0;rep(i, 4) S += ra[i].S;cout << S - pre << "\n";pre = S;}}int main(){solve();}