CCF 201803-2 碰撞的小球

#include <iostream>
//#include <bits/stdc++.h>
#include <string>

using namespace std;

typedef struct {
    int location;
    int foreOrback;
}table;

bool isequal(table *tab,int i,int n,int L);
void change(table &tt);

void move(table *tab,int n,int L)
{
    for(int i=0;i<n;i++)
    {
        if(isequal(tab,i,n,L))
            tab[i].location+=tab[i].foreOrback;
        else
        {
            //change(tab[i]);
            tab[i].location+=tab[i].foreOrback;
        }
    }
}

bool isequal(table *tab,int i,int n,int L)
{
    if(tab[i].location==L&&tab[i].foreOrback==1)
    {
        tab[i].foreOrback=-1;
        return false;
    }
    else if(tab[i].location==0&&tab[i].foreOrback==-1)
    {
        tab[i].foreOrback=1;
        return false;
    }
    for(int j=0;j<n;j++)
    {
        if(j!=i)
        {
            if(tab[j].location==tab[i].location)
            {
                change(tab[j]);
                change(tab[i]);
                return false;
            }
        }
    }
    return true;
}

void change(table &tt)
{
    if(tt.foreOrback==-1)
        tt.foreOrback=1;
    else
        tt.foreOrback=-1;
}

int main()
{
    int n,L,t;
    cin>>n>>L>>t;
    table *s;
    s=new table[n];
    for(int i=0;i<n;i++)
    {
        cin>>s[i].location;
        s[i].foreOrback=1;
    }
    while(t--)
    {
        move(s,n,L);
    }
    for(int i=0;i<n;i++)
    {
        if(i==0)
            cout<<s[i].location;
        else
            cout<<" "<<s[i].location;
    }
    return 0;
}