Test

#include<vector>
using namespace std;

class PiecewiseLinearFunctionDiv2
{
public:
    vector <int> countSolutions(vector <int> Y, vector <int> query)
    {
        vector<int> result;
        for(int i =0; i< query.size(); i++)
        {
            int searchNum = query[i];
            int start = 0;
            int solution=0;
            if(searchNum == Y[start]) solution++;
            for(int j =1; j< Y.size(); j++)
            {
                if(max(Y[start], Y[j]) > searchNum && min( Y[start],  Y[j]) < searchNum)
                {
                    solution++;
                }
                if(searchNum == Y[j])
                {
                    if(searchNum == Y[start])
                    {
                        solution =-1;
                        break;
                    }
                    solution++;
                    //j++;
                }
                start = j;
            }

            result.push_back(solution);
        }
        return result;
    }
};