hihocoder1513 小Hi的烦恼

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<bitset> 
using namespace std;
bitset<30010>a[30010][6],ans;
int d[30010][6];
int main(){
      int n,m,i,j,k;
      scanf("%d",&n);
      for(i=1;i<=n;i++)
        for(j=1;j<=5;j++){
          int x;
          scanf("%d",&x);
          d[x][j]=i;
        }
      for(i=2;i<=n;i++)
        for(j=1;j<=5;j++){
          a[d[i][j]][j]=a[d[i-1][j]][j];
          a[d[i][j]][j][d[i-1][j]]=1;
        }
      for(i=1;i<=n;i++){
          ans=a[i][1]&a[i][2]&a[i][3]&a[i][4]&a[i][5];
          printf("%d\n",ans.count());
      }
      return 0;
}