#include
#include
#include
#include
using namespace std;
const int MAXN=250;
typedef struct
{
  string p_id;
  int sum;
  int r;
  int c;
  int selected;
  int select;
  string start;
  string startp;
  string arrive;
  string arrivep;
  int acx[MAXN][MAXN];
} node;
typedef struct Pnode
{
  node data;
  struct Pnode *next;
} Pnode,*Plist;
typedef struct
{
  int r;
  int c;
  string name;
  string kp_id;
  string k_id;
} node1;
typedef struct Knode
{
  node1 data;
  struct Knode *next;
} Knode,*Klist;
void init(Plist &l)
{
  l=new Pnode;
  l->next=NULL;
}
void init(Klist &L)
{
  L=new Knode;
  L->next=NULL;
}
void creatp(Plist &l,int e)
{
  cout<>ll->data.p_id;
    cout<<" ";
    cin>>ll->data.start;
    cout<<" ";
    cin>>ll->data.startp;
    cout<<" ";
    cin>>ll->data.arrive;
    cout<<" ";
    cin>>ll->data.arrivep;
    cout<<" ";
    cin>>ll->data.r;
    cout<<" ";
    cin>>ll->data.c;
    cout<<" ";
    cin>>ll->data.sum;
    cout<<" ";
    cin>>ll->data.selected;
    cout<<" ";
    cin>>ll->data.select;
    for(int j=1; j<=ll->data.r; j++)
      for(int v=1; v<=l->data.c; v++)
        ll->data.acx[j][v]=0;
    ll->next=NULL;
    r->next=ll;
    r=ll;
  }
}
void creatk(Klist &L,node1 e)
{
  Klist LL=new Knode;
  LL->data=e;
  LL->next=NULL;
  Klist r;
  r=L;
  while(r->next!=NULL)
  {
    r=r->next;
  }
  r->next=LL;
  //cout<next->data.r<next;
  while(p!=NULL)
  {
    cout<<'\t'<<'\t'<<'\t'<<'\t'<<'\t'<data.p_id<<" "<data.start<<" "<data.startp<<" "<data.arrive<<" "<data.arrivep<<" "<data.sum<<" "<data.selected<<" "<data.select<data.r; i++)
    {
      cout<<'\t'<<'\t'<<'\t'<<'\t'<<'\t';
      for(int j=1; j<=p->data.c; j++)
        cout<data.acx[i][j];
      cout<next;
  }
  return ;
}
void alter(Plist &l,node1 e,int flag)
{
  Pnode *p,*pre;
  p=l->next;
  while(p->data.p_id!=e.kp_id)
  {
    pre=p;
    p=p->next;
  }
  if(flag)
  {
    p->data.select-=1;
    p->data.selected+=1;
    p->data.acx[e.r][e.c]=1;
  }
  else
  {
    p->data.select+=1;
    p->data.selected-=1;
    p->data.acx[e.r][e.c]=0;
  }
  return ;
}
int delet(Klist &L,node1 e)
{
  Klist p,pre;
  p=L;
  while(p->next!=NULL)
  {
    if(p->data.name==e.name&&p->data.k_id==e.k_id&&p->data.kp_id==e.kp_id)
      break;
    pre=p;
    p=p->next;
  }
  if(p==NULL)
    return 0;
  else
  {
    //cout<<"hjdhfjks"<next=p->next;
    free(p);
    return 1;
  }
}
int searchh(Klist &L,node1 e)
{
  Knode *p;
  p=L->next;
  while(p!=NULL)
  {
    if(p->data.name==e.name&&p->data.k_id==e.k_id&&p->data.kp_id==e.kp_id)
    {
      cout<data.r<<"行"<data.c<<"列"<next;
  }
  return 0;
}
void showone(Plist &l,node1 e)
{
  Pnode *p;
  p=l->next;
  while(p!=NULL)
  {
    if(p->data.p_id==e.kp_id)
    {
      cout<data.p_id<<" "<data.start<<" "<data.startp<<" "<data.arrive<<" "<data.arrivep<<" "<data.sum<<" "<data.selected<<" "<data.select<next;
  while(p!=NULL)
  {
    //cout<data.acx[e.r][e.c]<data.p_id==e.kp_id)
    {
      if(p->data.acx[e.r][e.c])
        return 0;
    }
    p=p->next;
  }
  return 1;
}
int main()
{
  Plist l;
  Klist L;
  init(l);
  init(L);
  int choose,n;
  node p;
  node1 k;
  cout<>n;
  system("cls");
  creatp(l,n);
  system("cls");
  while(1)
  {
    cout<>choose;
    system("cls");
    if(!choose)
    {
      cout<<'\t'<<'\t'<<'\t'<<'\t'<<'\t'<>k.name>>k.k_id;
      cout<<'\t'<<'\t'<<'\t'<<'\t'<<'\t'<<"输入客户选择的航班号,位置（行，列）:";
      cin>>k.kp_id>>k.r>>k.c;
      if(judge(l,k))
      {
        creatk(L,k);
        alter(l,k,1);
      }
      else
      {
        cout<>k.name>>k.k_id>>k.kp_id;
      int flag=delet(L,k);
      if(flag)
      {
        alter(l,k,0);
        cout<<'\t'<<'\t'<<'\t'<<'\t'<<'\t'<<"退票成功"<>k.name>>k.k_id>>k.kp_id;
      int flag=searchh(L,k);
      if(flag)
      {
        showone(l,k);
      }
      else
      {
        cout<<'\t'<<'\t'<<'\t'<<'\t'<<'\t'<<"查找失败，请重新输入"<