Lista

#include <bits/stdc++.h>

using namespace std;

#define ull unsigned long long
#define ll long long

int ans[1001];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> noskipws;
    int n;
    cin >> n;
    cin.ignore(1);

    ll prev = 0;
    char digP[10] = {};

    vector<ll> ans;
    ans.reserve(n);

    for (int i = 0; i < n; ++i){
        ll num = 0;
        vector<char> numstck;
        vector<pair<int,int>> qIn;
        char u = 0;
        char c;
        cin >> c;
        while(c != '\n'){
            numstck.emplace_back(c);
            ++u;
            cin >> c;
        }

        char qdig[10];

        int y = 0;
        for (auto j = numstck.rbegin(); j != numstck.rend(); ++j, ++y) {
            if(*j == '?'){
                qIn.emplace_back(y, 0);
                qdig[y] = 0;
            }else{
                num += pow(10, (y))*(*j-'0');
                qdig[y] = *j-'0';
            }
        }


        int f = y-1;
        auto iter = numstck.begin();
        if(*iter == '?'){
            while(*next(iter) == '?' && next(iter) != numstck.end()){
                --f;
                ++iter;
            }
            num += pow(10, f);
            qIn.pop_back();
            qIn.emplace_back(f, 1);
            qdig[f] = 1;
        }

        ll n2 = prev;
        int in = 0;

        if(num > prev){
            goto suc;
        }

        while (n2 >= 10) {
            if((char) (n2 % 10) > qdig[in]){
                num += pow(10, in)*(((char) (n2 % 10))-qdig[in]);
                qdig[in] = (char) (n2 % 10);
            }
            n2 /= 10;
            ++in;
        }


        for (const auto &item : qIn){
            while(qdig[item.first] < 9){
                ++qdig[item.first];
                num += pow(10, item.first);
                if(num > prev){
                    goto suc;
                }
            }
        }

        if(num > prev){
            goto suc;
        }

        cout << "IMPOSSIBLE";
        flush(std::cout);
        return 0;
        suc:
        prev = num;

        fill(digP, digP+numstck.size(), 0);
        n2 = num;

        in = numstck.size()-1;
        while (n2 != 0) {
            digP[in] = (n2 % 10);
            n2 /= 10;
            --in;
        }

        ans.emplace_back(num);
    }

    for (const auto &item : ans){
        cout << item << "\n";
    }

    flush(std::cout);
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: WRONG ANSWER

Test 9

Group: 3

Verdict: WRONG ANSWER

Test 10

Group: 3

Verdict: WRONG ANSWER