【题解】CH0503 树状数组+排序

题目链接

#include<cstdio>
#include<cstring>
#define _rep(i,a,b) for(int i=(a);i<=(b);i++)
const int N=3e5+10;
int n;
int a[N];
inline int lowbit(int x)
{
    return x&(-x);
}
inline void update(int x)
{
    while(x<=n*n)
    {
        a[x]++;
        x+=lowbit(x);
    }
}
inline int query(int x)
{
    int ret=0;
    while(x)
    {
        ret+=a[x];
        x-=lowbit(x);
    }
    return ret;
}
inline int solve()
{
    int cnt=0,x;
    memset(a,0,sizeof(a));
    _rep(i,1,n*n)
    {
        scanf("%d",&x);
        if(!x)continue;
        cnt+=query(n*n)-query(x);
        update(x);
    }
    return cnt;
}
int main()
{
    //freopen("in.txt","r",stdin);
    while(~scanf("%d",&n))
    {
        if((solve()&1)==(solve()&1))puts("TAK");
        else puts("NIE");
    }
    return 0;
}