School-CCC Track the cars - Level 3 - BAD

#include <bits/stdc++.h>

using namespace std;

ifstream fin("text.in");
ofstream fout("text.out");

struct observator {
    string id, time, latitiude, longitude;
};

struct rectangle {
    string x2, y2, x1, y1;
};

bool bigger(string s, string t) {
    string S, T;
    int ps = 0, pt = 0;
    while(ps < (int)s.size() && isdigit(s[ps]))
        S.push_back(s[ps++]);
    while(pt < (int)t.size() && isdigit(t[pt]))
        T.push_back(t[pt++]);
    if(S.size() > T.size())
        return true;
    if(S.size() < T.size())
        return false;
    int dim = S.size();
    int p = 0;
    while(p < dim && S[p] == T[p])
        ++p;
    if(p != dim)
        return S[p] > T[p];
    ++ps, ++pt;
    S.clear(), T.clear();
    while(ps < (int)s.size() && isdigit(s[ps]))
        S.push_back(s[ps++]);
    while(pt < (int)t.size() && isdigit(t[pt]))
        T.push_back(t[pt++]);
    dim = min(S.size(), T.size());
    p = 0;
    while(p < dim && S[p] == T[p])
        ++p;
    if(p != dim)
        return S[p] > T[p];
    return S.size() > T.size();
}

int main() {
    string s;
    fin >> s;
    int p = 0;
    rectangle r;
    while(isdigit(s[p]) || s[p] == '.')
        r.x2.push_back(s[p++]);
    ++p;
    while(isdigit(s[p]) || s[p] == '.')
        r.y2.push_back(s[p++]);
    ++p;
    while(isdigit(s[p]) || s[p] == '.')
        r.x1.push_back(s[p++]);
    ++p;
    while(isdigit(s[p]) || s[p] == '.')
        r.y1.push_back(s[p++]);
    // fout << r.x2 << ' ' << r.y2 << ' ' << r.x1 << ' ' << r.y1 << endl;
    int N;
    fin >> N;
    vector < observator > a(N);
    map < string , bool > sol;
    for(auto& x : a) {
        fin >> s;
        int p = 0;
        while(isalnum(s[p]) || s[p] == '-')
            x.id.push_back(s[p++]);
        ++p;
        while(isdigit(s[p]) || s[p] == ':')
            x.time.push_back(s[p++]);
        ++p;
        while(isdigit(s[p]) || s[p] == '.')
            x.latitiude.push_back(s[p++]);
        ++p;
        while(isdigit(s[p]) || s[p] == '.')
            x.longitude.push_back(s[p++]);
        // fout << x.id << ' ' << x.time << ' ' << x.latitiude << ' ' << x.longitude << endl;
        if(bigger(r.x2, x.latitiude) && bigger(x.latitiude, r.x1) && bigger(r.y2, x.longitude) && bigger(x.longitude, r.y1))
            sol[x.id] = true;
    }
    int cnt = 0;
    for(auto x : sol) {
        ++cnt;
        if(cnt > 1)
            fout << ',';
        fout << x.first;
    }
}