Submission #245604

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;

int x[50000];
int y[50000];

int main(){
	ios_base::sync_with_stdio(false);
	int n;
	ll s1, s2;
	cin >> n >> s1 >> s2;
	for(int i = 0; i < n; ++i){ cin >> x[i] >> y[i]; }
	ll answer0 = 0, answer1 = 0;
	for(int i = 0; i < n; ++i){
		const int xi = x[i], yi = y[i];
		for(int j = 0; j + 3 < i; j += 4){
			const ll t0 = static_cast<ll>(xi - x[j]) * (yi - y[j]);
			answer0 += (s1 <= t0) & (t0 <= s2);
			const ll t1 = static_cast<ll>(xi - x[j + 1]) * (yi - y[j + 1]);
			answer1 += (s1 <= t1) & (t1 <= s2);
			const ll t2 = static_cast<ll>(xi - x[j + 2]) * (yi - y[j + 2]);
			answer0 += (s1 <= t2) & (t2 <= s2);
			const ll t3 = static_cast<ll>(xi - x[j + 3]) * (yi - y[j + 3]);
			answer1 += (s1 <= t3) & (t3 <= s2);
		}
		for(int j = i & ~3; j < i; ++j){
			const ll t0 = static_cast<ll>(xi - x[j]) * (yi - y[j]);
			answer0 += (s1 <= t0) & (t0 <= s2);
		}
	}
	cout << answer0 + answer1 << endl;
	return 0;
}

Submission Info

Judge Result