牛客练习赛95 B(数学学的不行)

题目
题意: 给定平面上n个点，选出有多少个三个点点对组成一个三角形，满足面积不是整数。
思路: 根据上边这个公式，发现我们只需要关注每个点x、y坐标的奇偶性即可。分别枚举三个点的x、y坐标的奇偶性，满足绝对值里边的式子是奇数即可。
时间复杂度: O(2 ^ 6)
代码:

// Problem: Non-interger Area
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/11185/B
// Memory Limit: 1048576 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
int a[2][2];
void solve()
{
   read(n);
   for(int i=0;i<n;++i)
   {
   	 int x,y; read(x),read(y);
   	 a[x&1][y&1] ++ ;
   }
   ll ans = 0;
   fir(x1,0,1)
   fir(y1,0,1)
   fir(x2,0,1)
   fir(y2,0,1)
   fir(x3,0,1)
   fir(y3,0,1)
   {
   	 int tmp = (x1 - x3) * (y2 - y3) - (x2 - x3) * (y1 - y3); //把公式一列，刚开始&1表示奇数，最后&1也表示奇数.
   	 if(tmp & 1) //最后是奇数
   	 {
   	 	// cout<<x1<<" "<<y1<<" ";
   	 	// cout<<x2<<" "<<y2<<" ";
   	 	// cout<<x3<<" "<<y3<<" ";
   	 	// cout<<endl;
   	 	ans += 1ll * a[x1][y1] * a[x2][y2] * a[x3][y3];
   	 }
   }
   write(ans/6);
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}