結果

問題 No.1625 三角形の質問
ユーザー heno239heno239
提出日時 2021-07-24 00:37:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,007 bytes
コンパイル時間 1,952 ms
コンパイル使用メモリ 159,764 KB
実行使用メモリ 29,400 KB
最終ジャッジ日時 2024-07-19 01:14:43
合計ジャッジ時間 7,670 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
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-10;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % 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, ll 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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1000000;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

struct Seg2T {
private:
	vector<ll> node; int sz;
	vector<int> vy;
	const ll init_c = -1;
public:
	ll f(ll a, ll b) {
		return max(a, b);
	}
	void add(int y) {
		vy.push_back(y);
	}
	void complete() {
		sort(vy.begin(), vy.end());
		vy.erase(unique(vy.begin(), vy.end()), vy.end());
		int n = vy.size();
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, init_c);
	}
	void update(int k, ll c) {
		k = lower_bound(vy.begin(), vy.end(), k) - vy.begin();
		k += sz - 1;
		node[k] = f(node[k], c);
		while (k > 0) {
			k = (k - 1) / 2;
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	ll query(int a, int b, int k, int l, int r) {
		if (r <= a || b <= l)return init_c;
		if (a <= l && r <= b)return node[k];
		else {
			ll vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			ll vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
	ll query(int a, int b) {
		a = lower_bound(vy.begin(), vy.end(), a) - vy.begin();
		b = lower_bound(vy.begin(), vy.end(), b) - vy.begin();
		return query(a, b, 0, 0, sz);
	}
};

struct SegT {
private:
	int sz;
	vector<Seg2T> node;
	const ll init_c = -1;
public:
	ll f(ll a, ll b) {
		return max(a, b);
	}
	SegT(vector<P> v) {
		int n = v.size();
		sz = 1; while (sz < n)sz *= 2; node.resize(sz * 2 - 1);
		rep(i, n) {
			int k = v[i].first, y = v[i].second;
			k += sz - 1;
			node[k].add(y);
			while (k > 0) {
				k = (k - 1) / 2;
				node[k].add(y);
			}
		}
		rep(i, 2 * sz - 1)node[i].complete();
	}
	void update(int x, int y, ll c) {
		x += sz - 1;
		node[x].update(y, c);
		while (x) {
			x = (x - 1) / 2;
			node[x].update(y, c);
		}
	}
	ll query(int a, int b, int x, int y, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = sz;
		if (r <= a || b <= l)return init_c;
		else if (a <= l && r <= b)return node[k].query(x, y);
		else {
			ll vl = query(a, b, x, y, k * 2 + 1, l, (l + r) / 2);
			ll vr = query(a, b, x, y, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
};

struct ste {
	ll lx, rx, score;
};
void solve() {
	int n, q; cin >> n >> q;
	vector<ste> vs(n);
	rep(i, n) {
		ll x[3], y[3];
		rep(j, 3)cin >> x[j] >> y[j];
		ste s;
		s.lx = min({ x[0],x[1],x[2] });
		s.rx = max({ x[0],x[1],x[2] });
		ll dx1 = x[1] - x[0];
		ll dy1 = y[1] - y[0];
		ll dx2 = x[2] - x[0];
		ll dy2 = y[2] - y[0];
		ll score = abs(dx1 * dy2 - dx2 * dy1);
		s.score = score;
		vs[i] = s;
	}
	vector<ste> vq(q);
	vector<P> qs(q);
	vector<int> typ(q);
	rep(i, q) {
		int t; cin >> t;
		typ[i] = t;
		if (t == 1) {
			ll x[3], y[3];
			rep(j, 3)cin >> x[j] >> y[j];
			ste s;
			s.lx = min({ x[0],x[1],x[2] });
			s.rx = max({ x[0],x[1],x[2] });
			ll dx1 = x[1] - x[0];
			ll dy1 = y[1] - y[0];
			ll dx2 = x[2] - x[0];
			ll dy2 = y[2] - y[0];
			ll score = abs(dx1 * dy2 - dx2 * dy1);
			s.score = score;
			vq[i] = s;
		}
		else {
			int l, r; cin >> l >> r;
			qs[i] = { l,r };
		}
	}
	vector<int> vx;
	rep(i, n) {
		vx.push_back(vs[i].lx);
		vx.push_back(vs[i].rx);
	}
	rep(i, q) {
		if (typ[i] == 1) {
			vx.push_back(vq[i].lx);
			vx.push_back(vq[i].rx);
		}
		else {
			vx.push_back(qs[i].first);
			vx.push_back(qs[i].second);
		}
	}
	sort(all(vx));
	vx.erase(unique(all(vx)), vx.end());
	vector<P> ori;
	auto find_loc = [&](int x) {
		return lower_bound(all(vx), x) - vx.begin();
	};
	rep(i, n) {
		vs[i].lx = find_loc(vs[i].lx);
		vs[i].rx = find_loc(vs[i].rx);
		ori.push_back({ vs[i].lx,vs[i].rx });
	}
	rep(i, q) {
		if (typ[i] == 1) {
			vq[i].lx = find_loc(vq[i].lx);
			vq[i].rx = find_loc(vq[i].rx);
			ori.push_back({ vq[i].lx,vq[i].rx });
		}
		else {
			qs[i].first = find_loc(qs[i].first);
			qs[i].second = find_loc(qs[i].second);
		}
	}
	//SegT st(ori);
	rep(i, n) {
		//st.update(vs[i].lx, vs[i].rx, vs[i].score);
	}
	rep(i, q) {
		if (typ[i] == 1) {
			//st.update(vq[i].lx, vq[i].rx, vq[i].score);
		}
		else {
			//ll ans = st.query(qs[i].first, vx.size(), 0, qs[i].second + 1);
			//cout << ans << "\n";
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0