WF 2016题解(待填坑)

C. Ceiling Function

SB题

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
typedef long long ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
int n,k;
#define MAXN (1000)
#define MAXK (1000)
int a[MAXN][MAXK]={0};
int l[MAXN]={0},r[MAXN]={0},rot[MAXN]={0},c[MAXN];
void inse(int &rot,int id,int p) {
    if (!rot) {
        c[rot=id]=p;
        return;
    }
    if (p<c[rot]) {
        inse(l[rot],id,p);
    } else if (p>c[rot]) {
        inse(r[rot],id,p);
    }
} 
vector<string> ans;
char s[2000],siz=0;
void dfs(int x){
    s[siz++] = '(';
//  cout<<"(";
    if (l[x]) dfs(l[x]);
    s[siz++] = ' ';

//  cout<<" ";
    if (r[x]) dfs(r[x]);
    s[siz++] = ')';
//  cout<<")";
}
int main()
{
//  freopen("C.in","r",stdin);
//  freopen(".out","w",stdout);

    while(cin>>n>>k) {
        For(i,n){
            MEM(l)
            MEM(r)
            MEM(c)
            For(j,k) {
                cin>>a[i][j];
                inse(rot[i],j,a[i][j]);
            }
            siz=0;
            dfs(1);//cout<<endl;
            s[siz]=0;
            ans.pb(string(s));
        }
        sort(ans.begin(),ans.end());
//      cout<<ans.size()<<endl;
//      Rep(i,5) cout<<ans[i]<<endl;
        int m=unique(ans.begin(),ans.end())-ans.begin();
        cout<<m<<endl;
    } 

    return 0;
}