#412283 (C++11) No.947 ABC包囲網

提出ソース

結果

問題	No.947 ABC包囲網
ユーザー	ysuzuki5321
提出日時	2019-12-27 17:38:44
言語	C++11 (gcc 11.4.0)
結果	TLE
実行時間	-
コード長	15,072 bytes
コンパイル時間	1,409 ms
コンパイル使用メモリ	115,292 KB
実行使用メモリ	139,836 KB
最終ジャッジ日時	2024-10-08 16:00:39
合計ジャッジ時間	9,456 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	123 ms 134,400 KB
testcase_01	AC	116 ms 129,024 KB
testcase_02	AC	115 ms 128,896 KB
testcase_03	AC	121 ms 129,280 KB
testcase_04	AC	119 ms 129,152 KB
testcase_05	AC	119 ms 129,152 KB
testcase_06	AC	119 ms 129,152 KB
testcase_07	AC	116 ms 129,152 KB
testcase_08	AC	115 ms 129,152 KB
testcase_09	AC	116 ms 129,152 KB
testcase_10	AC	116 ms 129,152 KB
testcase_11	AC	116 ms 129,152 KB
testcase_12	AC	119 ms 129,152 KB
testcase_13	AC	121 ms 129,152 KB
testcase_14	AC	119 ms 129,024 KB
testcase_15	AC	130 ms 129,152 KB
testcase_16	AC	117 ms 129,280 KB
testcase_17	AC	123 ms 128,896 KB
testcase_18	AC	130 ms 129,152 KB
testcase_19	AC	132 ms 129,152 KB
testcase_20	AC	131 ms 129,152 KB
testcase_21	AC	131 ms 129,152 KB
testcase_22	AC	129 ms 129,152 KB
testcase_23	AC	128 ms 129,152 KB
testcase_24	AC	130 ms 129,152 KB
testcase_25	AC	130 ms 128,896 KB
testcase_26	AC	131 ms 129,024 KB
testcase_27	AC	131 ms 129,024 KB
testcase_28	AC	269 ms 129,024 KB
testcase_29	TLE	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-
testcase_42	--	-
testcase_43	--	-
testcase_44	--	-
testcase_45	--	-
testcase_46	--	-
testcase_47	--	-
testcase_48	--	-
testcase_49	--	-
testcase_50	--	-
testcase_51	--	-
testcase_52	--	-
testcase_53	--	-
testcase_54	--	-
testcase_55	--	-
testcase_56	--	-
testcase_57	--	-
testcase_58	--	-
testcase_59	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <stdio.h>
#include <sstream>
#include <string.h>
#include <vector>
#include <map>
#include <algorithm>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <limits>
#include <iomanip>
#include <ctype.h>
#include <unordered_map>
#include <random>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>, greater<pair<ll, pll>>> plpllgreaterq;
#define bit(x,v) ((ll)x << v)

const ll INF = 1000000007;
const int MAX = 310000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % MOD;
		inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
		finv[i] = finv[i - 1] * inv[i] % MOD;
	}
}

// 二項係数計算
long long COM(int n, int k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}
int pr[200010];
int lank[200010];
void uini(int n) {
	for (size_t i = 0; i <= n; i++)
	{
		pr[i] = i;
	}
}

int parent(int x) {
	if (x == pr[x]) return x;
	return pr[x] = parent(pr[x]);
}

int same(int x, int y) {
	return parent(x) == parent(y);
}

bool unit(int x, int y) {
	int px = parent(x);
	int py = parent(y);

	if (px == py) return false;
	if (lank[px] < lank[py]) {
		pr[py] = px;
		lank[px] += lank[py] + 1;
	}
	else {
		pr[px] = py;
		lank[py] += lank[px] + 1;
	}
	return true;
}

ll bit[200010];
int max_n = 200000;
int pm = 0;
void add(int x) {

	while (max_n >= x)
	{
		bit[x]++;
		x += x & -x;
	}
}
void sub(int x) {
	while (max_n >= x)
	{
		bit[x]--;
		x += x & -x;
	}
}
ll merge(ll* a, int left, int mid, int right) {
	ll n1 = mid - left;
	ll n2 = right - mid;
	vector<int> L(n1 + 1);
	vector<int> R(n2 + 1);
	for (size_t i = 0; i < n1; i++)
	{
		L[i] = a[left + i];
	}
	for (size_t i = 0; i < n2; i++)
	{
		R[i] = a[mid + i];
	}

	L[n1] = INF;
	R[n2] = INF;
	ll i = 0;
	ll j = 0;
	ll r = 0;
	for (size_t k = left; k < right; k++)
	{
		if (L[i] <= R[j]) {
			a[k] = L[i];
			i++;
		}
		else {
			a[k] = R[j];
			r += n1 - i;
			j++;
		}
	}
	return r;
}
ll merge2(pair<int, char>* a, int left, int mid, int right) {
	ll n1 = mid - left;
	ll n2 = right - mid;
	vector<pair<int, char>> L(n1 + 1);
	vector<pair<int, char>> R(n2 + 1);
	for (size_t i = 0; i < n1; i++)
	{
		L[i] = a[left + i];
	}
	for (size_t i = 0; i < n2; i++)
	{
		R[i] = a[mid + i];
	}

	L[n1] = make_pair(INF, ' ');
	R[n2] = make_pair(INF, ' ');
	ll i = 0;
	ll j = 0;
	ll r = 0;
	for (size_t k = left; k < right; k++)
	{
		if (L[i].first <= R[j].first) {
			a[k] = L[i];
			i++;
		}
		else {
			a[k] = R[j];
			r += n1 - i;
			j++;
		}
	}
	return r;
}
ll mergeSort2(pair<int, char>* a, int left, int right) {
	ll res = 0;
	if (left + 1 < right) {
		int mid = (left + right) / 2;
		res = mergeSort2(a, left, mid);
		res += mergeSort2(a, mid, right);
		res += merge2(a, left, mid, right);
	}
	return res;
}
ll mergeSort(ll* a, int left, int right) {
	ll res = 0;
	if (left + 1 < right) {
		int mid = (left + right) / 2;
		res = mergeSort(a, left, mid);
		res += mergeSort(a, mid, right);
		res += merge(a, left, mid, right);
	}
	return res;
}
int partition(pair<int, char>* a, int p, int r) {
	pair<int, char> x = a[r];
	int i = p - 1;
	for (size_t j = p; j < r; j++)
	{
		if (a[j].first <= x.first) {
			i++;
			swap(a[i], a[j]);
		}
	}
	swap(a[i + 1], a[r]);
	return i + 1;
}
void quick(pair<int, char>* a, int p, int r) {
	if (p < r) {
		int q = partition(a, p, r);
		quick(a, p, q - 1);
		quick(a, q + 1, r);
	}
}

ll n;
int ci = 0;
ll P[1000010];
struct Node {
	int key;
	int priority;
	Node* parent, * left, * right;
	Node(int key, int priority);
	Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
	left = &NIL;
	right = &NIL;
}
Node* root = new Node();
void cenrec(Node* k) {
	if (k->key == NIL.key) return;
	cenrec(k->left);
	cout << " " << k->key;
	cenrec(k->right);
}
void fastrec(Node* k)
{
	if (k->key == NIL.key) return;
	cout << " " << k->key;
	fastrec(k->left);
	fastrec(k->right);
}
void insert(Node* v) {
	Node* y = &NIL;
	Node* x = root;
	while (x->key != NIL.key)
	{
		y = x;
		if (v->key < x->key) {
			x = x->left;
		}
		else {
			x = x->right;
		}
	}
	v->parent = y;
	if (y->key == NIL.key) {
		root = v;
	}
	else if (v->key < y->key) {
		y->left = v;
	}
	else {
		y->right = v;
	}

}

Node* find(Node* k, ll v)
{
	if (k->key == NIL.key) return &NIL;
	if (k->key == v) return k;
	if (v < k->key) return find(k->left, v);
	return find(k->right, v);
}
void delp12(Node* x) {
	if (x->key == NIL.key)  return;
	Node* l = x->left;
	Node* r = x->right;
	Node* pr = x->parent;

	if (l->key == NIL.key
		&& r->key == NIL.key) {
		if (pr->left == x) {
			pr->left = &NIL;
		}
		else pr->right = &NIL;
	}
	else if (l->key != NIL.key) {
		if (pr->left == x) {
			pr->left = l;
		}
		else pr->right = l;
		l->parent = pr;
	}
	else if (r->key != NIL.key) {
		if (pr->left == x) {
			pr->left = r;
		}
		else pr->right = r;
		r->parent = pr;
	}
}
Node* get_next(Node* k) {
	if (k->key == NIL.key) return &NIL;
	Node* res = get_next(k->left);
	if (res->key != NIL.key) return res;
	return k;
}
void del(Node* x) {

	if (x->key == NIL.key) return;
	Node* l = x->left;
	Node* r = x->right;
	Node* pr = x->parent;

	if (l->key != NIL.key && r->key != NIL.key) {
		Node* nex = get_next(r);
		x->key = nex->key;
		delp12(nex);
	}
	else {
		delp12(x);
	}
}
Node* rightRotate(Node* t) {
	Node* s = t->left;
	t->left = s->right;
	s->right = t;
	return s;
}
Node* leftRotate(Node* t) {
	Node* s = t->right;
	t->right = s->left;
	s->left = t;
	return s;
}
Node* _insert(Node* t, int key, int priority) {
	if (t->key == NIL.key) {
		return new Node(key, priority);
	}
	if (key == t->key) {
		return t;
	}

	if (key < t->key) {
		t->left = _insert(t->left, key, priority);
		if (t->priority < t->left->priority) {
			t = rightRotate(t);
		}
	}
	else {
		t->right = _insert(t->right, key, priority);
		if (t->priority < t->right->priority) {
			t = leftRotate(t);
		}
	}
	return t;
}
Node* delete1(Node* t, int key);
Node* _delete(Node* t, int key) {
	if (t->left->key == NIL.key && t->right->key == NIL.key) {
		return &NIL;
	}
	else if (t->left->key == NIL.key) {
		t = leftRotate(t);
	}
	else if (t->right->key == NIL.key) {
		t = rightRotate(t);
	}
	else
	{
		if (t->left->priority > t->right->priority) {
			t = rightRotate(t);
		}
		else
			t = leftRotate(t);
	}
	return delete1(t, key);
}
Node* delete1(Node* t, int key) {
	if (t->key == NIL.key) {
		return &NIL;
	}
	if (key < t->key) {
		t->left = delete1(t->left, key);
	}
	else if (key > t->key) {
		t->right = delete1(t->right, key);
	}
	else return _delete(t, key);
	return t;
}
int H;
int left(int i) {
	return i * 2 + 1;
}
int right(int i) {
	return i * 2 + 2;
}

ll heap[2000010];
void maxHeapify(int i) {
	int l = left(i);
	int r = right(i);
	int largest = 0;
	if (l < H && heap[l] > heap[i])
		largest = l;
	else
		largest = i;
	if (r < H && heap[r] > heap[largest])
		largest = r;

	if (largest != i) {
		swap(heap[i], heap[largest]);
		maxHeapify(largest);
	}
}
int pare(int i) {
	return (i - 1) / 2;
}
void raise(int i) {
	int l = pare(i);
	if (l < 0) return;

	if (heap[l] < heap[i]) {
		swap(heap[i], heap[l]);
		raise(l);
	}
}
void minHeapify(int i) {
	int l = left(i);
	int r = right(i);
	int minimam = 0;
	if (l < H && heap[l] < heap[i])
		minimam = l;
	else
		minimam = i;
	if (r < H && heap[r] < heap[minimam])
		minimam = r;

	if (minimam != i) {
		swap(heap[i], heap[minimam]);
		minHeapify(minimam);
	}
}
void buildMaxHeap() {
	for (int i = H / 2; i >= 0; i--)
	{
		maxHeapify(i);
	}
}

int dx[] = { -1,0,1,0 };
int dy[] = { 0,-1,0,1 };
std::vector<int> find_all(const std::string str, const std::string subStr) {
	std::vector<int> result;

	int subStrSize = subStr.size();
	int pos = str.find(subStr);

	while (pos != std::string::npos) {
		result.push_back(pos);
		pos = str.find(subStr, pos + 1);
	}

	return result;
}
//ll memo[100010];
//ll next[100010];
//ll dm[100010];
//int f[100010];
//ll rec(int x) {
//
//	if (~memo[x]) return memo[x];
//	if (x == n) { 
//		dm[n] = 1;
//		return 1; 
//	}
//	ll *res = &memo[x];
//	*res = 0;
//	set<int> st;
//	st.insert(f[x]);
//	for (int i = x + 1; i <= n; i++)
//	{
//		if (~memo[i]) {
//			*res += memo[i] + 1;
//			*res %= INF;
//			break;
//		}
//
//		*res += rec(i);
//		*res %= INF;
//		if (st.find(f[i]) != st.end()) {break; }
//		st.insert(f[i]);
//	}
//
//	return *res;
//}
#define bit(x,v) ((ll)x << v)

class BIT {

	static const int MAX_N = 200010;
public:
	BIT() { memset(bit, 0, sizeof(bit)); }
	int bit[MAX_N + 1], n;
	int sum(int i) {
		int s = 0;
		while (i > 0)
		{
			s += bit[i];
			i -= i & -i;
		}
		return s;
	}

	void add(int i, int x) {
		while (i <= n)
		{
			bit[i] += x;
			i += i & -i;
		}
	}
	void clear() {
		memset(bit, 0, sizeof(bit));
	}
	int a[MAX_N];
	void bable_swap_count() {
		ll ans = 0;
		for (size_t j = 0; j < n; j++)
		{
			ans += j - sum(a[j]);
			add(a[j], 1);
		}
		printf("%lld\n", ans);
	}

	int search(int s, int x) {

		ll half = (s + x) / 2;
		ll sh = sum(x);

		ll sl = sum(half);

		ll st = sum(s);
		if (sh - sl == 0) {
			return x;
		}
		if (sh - sl < x - half) {
			return search(half, x);
		}

		if (sl - st == 0) {
			return half;
		}

		if (sl - st < half - s) {
			return search(s, half);
		}
		return -1;
	}

	int lankSearch(int lank) {
		return lankSearch(lank, 0, MAX_N);
	}
	int lankSearch(int lank, int s, int t) {

		ll half = (s + t) / 2;

		ll v = sum(half);
		ll v1 = sum(t);
		ll v2 = sum(s);
		if (lank == 1) {
			if (s + 1 >= t) return t;
			else if (v - v2 > 0) {
				return lankSearch(lank, s, half);
			}
			else return lankSearch(lank, half, t);
		}

		if ((v - v2) < lank) {
			return lankSearch(lank - (v - v2), half, t);
		}
		if ((v - v2) >= lank) {
			return lankSearch(lank, s, half);
		}

		return -1;
	}
};
//void test() {
//	double m;
//	cin >> m;
//	//p11(15, m);
//	double b = 5854;
//	double ba = 4224.96;
//	double bb = (ba / 12);
//	double ret = 222;
//	double mon = 23.472;
//	cout << fixed << endl;
//
//	for (double i = 5; i <= 15; i++)
//	{
//		double p = b * i;
//		double u = ba * i;
//		double r = ret * (15 - i) - (bb * (15 - i));
//		double m = mon * i;
//		cout << i << " mon:" << m << " ret:" << p + r << " pay:" << u << " gross" << p + r - u << " %:" << (p + r) / u << endl;
//	}
//	//double reib = 21542.8;
//	//double reiba = 17358.264;
//	double reib = 8298;
//	double reiba = 5599.44;
//	double reim = 46.662;
//	double ret2 = 233.1;
//	cout << "reti" << endl;
//	for (double i = 0; i <= 5; i++)
//	{
//		double p = reib * i;
//		double u = reiba * i;
//		double m = reim * i;
//		double r = -(ret2 * (5 - i));
//		cout << i << " mon:" << m << " ret:" << p + r << " u:" << u << " gross:" << p + r - u << " %" << (p + r) / u << endl;
//	}
//	cout << "resutl " << endl;
//	for (double i = 5; i <= 15; i++)
//	{
//		double p = b * i;
//		double u = ba * i;
//		double r = ret * (15 - i) - (bb * (15 - i));
//		double m = mon * i;
//		for (double j = 0; j <= 5; j++)
//		{
//			double p2 = reib * j;
//			double u2 = reiba * j;
//			double m2 = reim * j;
//			double r2 = -(ret2 * (5 - j));
//			if (m + m2 > (585.39 - 230)) continue;
//			cout << (int)i << " " << (int)j << " mon:" << m + m2 << " ret:" << p + p2;
//			cout << " u:" << u + u2 << " gross:" << (p + r - u) + (p2 + r2 - u2);
//			cout << " %" << ((p + r) + (p2 + r2)) / (u + u2) << endl;
//		}
//		cout << endl;
//	}
//}
vector<ll> getp(ll n) {

	vector<ll> res;
	ll a = 2;
	if (n % 2 == 0) {
		res.push_back(2);
		while (n % 2 == 0)n /= 2;
	}

	for (ll i = 3; i * i <= n; i += 2)
	{
		if (n % i == 0) {
			res.push_back(i);
			while (n % i == 0)n /= i;
		}
	}
	if (n != 1) res.push_back(n);
	return res;
}
vector<ll> getDivisors(ll n) {

	vector<ll> res;
	ll a = 2;
	res.push_back(1);
	for (ll i = 2; i * i <= n; i++)
	{
		
		if (n % i == 0) {
			res.push_back(i);
			if(n / i != i)
				res.push_back(n / i);
		}
	}
	return res;
}
const int hi = 2000000;
int tb[hi];
void elast() {
	fill(tb, tb + hi, 1);
	for (int i = 2; i * i < hi; i++)
	{
		if (tb[i] == 0) continue;
		int ti = i * 2;
		while (ti < hi)
		{
			tb[ti] = 0;
			ti += i;
		}
	}
}
pii check(int x1, int y1, int x2, int y2) {

	if (x1 > x2) {
		swap(x1, x2);
		swap(y1, y2);
	}

	if (x2 == x1 && x2 == 0) return make_pair(0, 0);
	bool yok = (y1 >= 0 && 0 >= y2)
		|| (y2 >= 0 && 0 >= y1);
	if (x2 == x1) {
		if (yok)
			return make_pair(0, x2 > 0 ? 1 : -1);
	}
	// y = ax + b;
	// a = y / x
	double a = double(y2 - y1) / double(x2 - x1);
	// b = y - ax
	double b = y2 - a * x2;
	double judge = y2 * double(x2 - x1) - double(y2 - y1) * x2;
	if (judge == 0) {
		return make_pair(0, 0);
	}
	bool ok = (x1 <= 0 && 0 <= x2);
	pii res;
	if (b > 0) {
		if (ok) {
			res.first = 1;
		}
	}
	else {
		if (ok) res.first = -1;
	}
	// 0 = ax + b;
	// -b = ax
	// -(b/a)= x
	double xp = -(b / a);
	if (xp > 0) {
		if (yok) res.second = 1;
	}
	else {
		if (yok) res.second = -1;
	}
	return res;
}
void solv() {

	cin >> n;
	int x[4010], y[4010];
	for (size_t i = 0; i < n; i++)
	{
		cin >> x[i] >> y[i];
	}
	pii mp[4010][4010];
	for (size_t i = 0; i < n; i++)
	{
		for (size_t j = i + 1; j < n; j++)
		{

			mp[i][j] = check(x[i], y[i], x[j], y[j]);
			mp[j][i] = mp[i][j];
		}
	}

	vector<int> uy;
	vector<int> by;
	for (size_t i = 0; i < n; i++)
	{
		if (y[i] > 0) uy.push_back(i);
		else by.push_back(i);
	}
	int res = 0;
	for (size_t i = 0; i < uy.size(); i++)
	{
		for (size_t j = i + 1; j < uy.size(); j++)
		{
			for (size_t k = 0; k < by.size(); k++)
			{
				
				pii p1 = mp[uy[i]][uy[j]];
				pii p2 = mp[uy[i]][by[k]];
				pii p3 = mp[uy[j]][by[k]];
				int u = 0;
				if (p1.first < 0 || p2.first < 0 || p3.first < 0) {
					u++;
				}
				if (p1.first > 0 || p2.first > 0 || p3.first > 0) {
					u++;
				}
				if (p1.second < 0 || p2.second < 0 || p3.second < 0)u++;
				if (p1.second > 0 || p2.second > 0 || p3.second > 0)u++;

				if (u==4)res++;
			}
		}
	}
	for (size_t i = 0; i < by.size(); i++)
	{
		for (size_t j = i + 1; j < by.size(); j++)
		{
			for (size_t k = 0; k < uy.size(); k++)
			{
				pii p1 = mp[by[i]][by[j]];
				pii p2 = mp[by[i]][uy[k]];
				pii p3 = mp[by[j]][uy[k]];
				int u = 0;
				if (p1.first < 0 || p2.first < 0 || p3.first < 0) {
					u++;
				}
				if (p1.first > 0 || p2.first > 0 || p3.first > 0) {
					u++;
				}
				if (p1.second < 0 || p2.second < 0 || p3.second < 0)u++;
				if (p1.second > 0 || p2.second > 0 || p3.second > 0)u++;

				if (u == 4)
					res++;
			}
		}
	}

	cout << res << endl;
}

int main() {
	//COMinit();
	solv();
	return 0;
}

yukicoder

結果

テストケース

ソースコード