結果

問題 No.1074 増殖
ユーザー heno239heno239
提出日時 2020-06-05 21:45:46
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,980 bytes
コンパイル時間 1,404 ms
コンパイル使用メモリ 128,628 KB
実行使用メモリ 11,176 KB
最終ジャッジ日時 2023-08-22 14:54:46
合計ジャッジ時間 2,936 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
7,472 KB
testcase_01 AC 3 ms
7,472 KB
testcase_02 AC 4 ms
7,472 KB
testcase_03 AC 4 ms
7,452 KB
testcase_04 AC 4 ms
7,404 KB
testcase_05 AC 3 ms
7,472 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 61 ms
10,920 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

void chmin(int &a, int b) {
	a = min(a, b);
}
void chmax(int &a, int b) {
	a = max(a, b);
}
ll mod_pow(ll a, ll n, ll m = mod) {
	a %= m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

vector<ll> calc(vector<ll> x, vector<ll> y) {
	vector<ll> res;
	set<LP> st;
	st.insert({ 0,INF });
	st.insert({ INF,0 });
	int n = x.size();
	rep(i, n) {
		LP p = { x[i],INF+1 };
		st.insert(p);
		auto itr = st.find(p);
		auto itr2 = st.find(p);
		ll csum = 0;

		ll cx = x[i];
		ll cy;
		itr2++;
		cy = (*itr2).second;

		vector<LP> ers;
		ers.push_back(p);
		if (y[i] <= cy) {

		}
		else {
			while (true) {
				itr--;
				LP to = *itr;
				ll px = to.first, py = to.second;
				csum += (cx - px)*(y[i] - cy);
				if (py > y[i]) {
					break;
				}
				else {
					cx = px, cy = py;
					ers.push_back(to);
				}
			}
			st.insert({ x[i],y[i] });
		}

		res.push_back(csum);
		for (LP p : ers)st.erase(p);
	}
	return res;
}
void solve() {
	int n; cin >> n;
	vector<int> lx(n), ly(n), rx(n), ry(n);
	rep(i, n)cin >> lx[i] >> ly[i] >> rx[i] >> ry[i];
	vector<ll> x[2], y[2];
	rep(i, n) {
		x[0].push_back(-lx[i]);
		x[1].push_back(rx[i]);
		y[0].push_back(-ly[i]);
		y[1].push_back(ry[i]);
	}
	vector<ll> ans(n);
	rep(s, 2)rep(t, 2) {
		vector<ll> u = calc(x[s], y[t]);
		rep(i, n)ans[i] += u[i];
	}
	rep(i, n) {
		cout << ans[i] << "\n";
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init_f();
	//init();
	solve();
	stop
		return 0;
}
0