結果
問題 | No.1074 増殖 |
ユーザー | Shuz* |
提出日時 | 2020-06-05 23:28:47 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 8,097 bytes |
コンパイル時間 | 1,790 ms |
コンパイル使用メモリ | 175,848 KB |
実行使用メモリ | 7,680 KB |
最終ジャッジ日時 | 2024-05-09 23:52:46 |
合計ジャッジ時間 | 3,146 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 59 ms
7,680 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 21 ms
6,944 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
ソースコード
#include <bits/stdc++.h> using namespace std; // Define using ll = long long; using ull = unsigned long long; using ld = long double; template <class T> using pvector = vector<pair<T, T>>; template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>; constexpr const ll dx[4] = {1, 0, -1, 0}; constexpr const ll dy[4] = {0, 1, 0, -1}; constexpr const ll MOD = 1e9 + 7; constexpr const ll mod = 998244353; constexpr const ll INF = 1LL << 60; constexpr const ll inf = 1 << 30; constexpr const char rt = '\n'; constexpr const char sp = ' '; #define mp make_pair #define mt make_tuple #define pb push_back #define eb emplace_back #define elif else if #define all(a, v, ...) \ ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v) #define rall(a, v, ...) \ ([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v) #define fi first #define se second 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; } // Debug #define debug(...) \ { \ cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \ for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \ cerr << rt; \ } #define dump(a, h, w) \ { \ cerr << __LINE__ << ": " << #a << " = [" << rt; \ rep(_i, h) { \ rep(_j, w) cerr << a[_i][_j] << sp; \ cerr << rt; \ } \ cerr << "]" << rt; \ } #define vdump(a, n) \ { \ cerr << __LINE__ << ": " << #a << " = ["; \ rep(_i, n) if (_i) cerr << sp << a[_i]; \ else cerr << a[_i]; \ cerr << "]" << rt; \ } // Loop #define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i) #define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i) #define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i) #define each(i, a) for (auto &&i : a) // Stream #define fout(n) cout << fixed << setprecision(n) struct io { io() { cin.tie(nullptr), ios::sync_with_stdio(false); } } io; // Speed #pragma GCC optimize("Ofast") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") // Math inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; } inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; } inline constexpr ll modulo(const ll n, const ll m = MOD) { ll k = n % m; return k + m * (k < 0); } inline constexpr ll chmod(ll &n, const ll m = MOD) { n %= m; return n += m * (n < 0); } inline constexpr ll mpow(ll a, ll n, const ll m = MOD) { ll r = 1; rep(i, 64) { if (n & (1LL << i)) r *= a; chmod(r, m); a *= a; chmod(a, m); } return r; } inline ll inv(const ll n, const ll m = MOD) { ll a = n, b = m, x = 1, y = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); x -= t * y; swap(x, y); } return modulo(x, m); } ll N, A, B, C, D; ll W[20001], X[20001], Y[20001], Z[20001]; set<ll> w, x, y, z; signed main() { cin >> N; w.insert(0); x.insert(0); y.insert(0); z.insert(0); W[0] = X[0] = Y[0] = Z[0] = INF; rep(i, N) { ll res = 0; cin >> A >> B >> C >> D; swap(A, C); swap(B, D); { w.insert(A); auto it = w.lower_bound(A), lit = it; lit--; if (W[*it] < B) { W[*it] = B; ll t = 0; auto nit = it; nit++; if (nit != w.end()) t = W[*nit]; if (W[*nit] > W[*it]) goto n1; res += (*it - *lit) * (W[*it] - t); if (lit != w.begin() and W[*lit] < B) { it = lit, lit--; while (true) { res += (*it - *lit) * (B - W[*it]); if (W[*lit] >= B or lit == w.begin()) { w.erase(it); break; } it = w.erase(it), it--, lit = it, lit--; } } } } n1:; { x.insert(-C); auto it = x.lower_bound(-C), lit = it; lit--; if (X[*it] < B) { X[*it] = B; ll t = 0; auto nit = it; nit++; if (nit != x.end()) t = X[*nit]; if (X[*nit] > X[*it]) goto n2; res += (*it - *lit) * (X[*it] - t); if (lit != x.begin() and X[*lit] < B) { it = lit, lit--; while (true) { res += (*it - *lit) * (B - X[*it]); if (X[*lit] >= B or lit == x.begin()) { x.erase(it); break; } it = x.erase(it), it--, lit = it, lit--; } } } } n2:; { y.insert(-C); auto it = y.lower_bound(-C), lit = it; lit--; if (Y[*it] < -D) { Y[*it] = -D; ll t = 0; auto nit = it; nit++; if (nit != y.end()) t = Y[*nit]; if (Y[*nit] > Y[*it]) goto n3; res += (*it - *lit) * (Y[*it] - t); if (lit != y.begin() and Y[*lit] < -D) { it = lit, lit--; while (true) { res += (*it - *lit) * (-D - Y[*it]); if (Y[*lit] >= -D or lit == y.begin()) { y.erase(it); break; } it = y.erase(it), it--, lit = it, lit--; } } } } n3:; { z.insert(A); auto it = z.lower_bound(A), lit = it; lit--; if (Z[*it] < -D) { Z[*it] = -D; ll t = 0; auto nit = it; nit++; if (nit != z.end()) t = Z[*nit]; if (Z[*nit] > Z[*it]) goto n4; res += (*it - *lit) * (Z[*it] - t); if (lit != z.begin() and Z[*lit] < -D) { it = lit, lit--; while (true) { res += (*it - *lit) * (-D - Z[*it]); if (Z[*lit] >= -D or lit == z.begin()) { z.erase(it); break; } it = z.erase(it), it--, lit = it, lit--; } } } } n4:; cout << res << rt; } } // -g -D_GLIBCXX_DEBUG -fsanitize=undefined