bzoj 1100

思路：好脑洞啊。。。 把边和角转化为字符串，然后用反串跑kmp。。。

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define pii pair<int, int>
 
using namespace std;
 
const int N = 1e5 + ;
const int M = 1e6 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 +;
 
int n, m;
LL a[N << ], b[N << ];
int nx[N << ];
struct Point {
    LL x, y;
    Point(LL x = , LL y = ) {
        this->x = x;
        this->y = y;
    }
 
    Point operator - (const Point &rhs) const {
        return Point(x - rhs.x, y - rhs.y);
    }
} p[N];
 
typedef Point Vector;
LL dis(const Point &a, const Point &b) {
    return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
 
LL cross(Vector a, Vector b) {
    return a.x * b.y - a.y * b.x;
}
 
void getNext() {
    int k = ;
    for(int i = ; i < m; i++) {
        while(k >  && b[k] != b[i]) k = nx[k - ];
        if(b[k] == b[i]) k++;
        nx[i] = k;
    }
}
 
int kmp() {
    int k = , ans = ;
    for(int i = ; i < n; i++) {
        while(k >  && b[k] != a[i]) k = nx[k - ];
        if(b[k] == a[i]) k++;
        if(k == m) {
            ans++;
            k = nx[k - ];
        }
    }
    return ans;
}
 
int main(){
    int T; scanf("%d", &T);
    while(T--) {
        scanf("%d", &n);
        for(int i = ; i < n; i++) {
            scanf("%lld%lld", &p[i].x, &p[i].y);
        }
 
        for(int i = ; i < n; i++) {
            Vector v1 = p[(i + ) % n] - p[i];
            Vector v2 = p[(i -  + n) % n] - p[i];
            a[i << ] = cross(v1, v2);
        }
 
        for(int i = ; i < n; i++) {
            a[i <<  | ] = dis(p[i], p[(i + ) % n]);
        }
 
        for(int i =  * n; i <  * n; i++) {
            a[i] = a[i -  * n];
        }
 
        m =  * n;
        n =  * n;
 
        for(int i = ; i < m; i++) {
            b[i] = a[i];
        }
        reverse(b, b + m);
 
        getNext();
        printf("%d\n", kmp());
    }
    return ;
}
 
/*
*/