Lista

#include <bits/stdc++.h>

#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second

using namespace std;

int main()
{

    int n; cin >> n;
    ll prevlen = 0;
    int prevstring[9];
    int ans[n][9];
    int arr[n];
    int orgn = n;
    vector<string> ss(n);;
    for(int i = 0; i < n; ++i){
        cin >> ss[i];
    }

    for(int h = 0; h < n; ++h){
        int newlen = 0;
        string s = ss[h];
        int m = s.size();
        arr[h] = m;
        if(m<prevlen){
            cout << "IMPOSSIBLE\n";
            return 0;
        }


        else if(m>prevlen){

            int new_s[9];

            for(int i = 0; i < m; ++i){
                newlen++;
                char c = s[i];

                if(c=='?'){
                    if(!i){
                        new_s[i] = 1;
                    }
                    else{
                        new_s[i] = 0;
                    }
                }

                else{
                    new_s[i] = c-'0';
                }

            }
            for(int i = 0; i < m; ++i){
                prevstring[i] = new_s[i];
                ans[h][i] = new_s[i];
            }
            prevlen = newlen;
        }


        else{

            bool tight = 1;
            int new_s[9];

            for(int i = 0; i < m; ++i){
                newlen++;
                char c = s[i];

                if(c!='?'){

                    int prev_x = prevstring[i];
                    int x = c - '0';


                if(tight){

                    if(prev_x>x){
                        cout << "IMPOSSIBLE\n";
                        return 0;
                    }

                    else if(prev_x<x){
                        tight = 0;
                    }

                }

                new_s[i] = x;
            }

            else if(c=='?'){

                if(!tight){
                    if(i==0){
                        new_s[i] = 1;
                    }
                    else{
                        new_s[i] = 0;
                    }
                }

                else if(tight){

                    if(i==m-1){
                        if(prevstring[i]==9){
                            cout << "IMPOSSIBLE\n";
                            return 0;
                        }
                        int new_c = prevstring[i];
                        new_c++;
                        //cout << x << " " << add << "\n";
                        //cout << "newwccwew: " << new_c << " " << add << "\n";
                        new_s[i] = new_c;
                        continue;

                    }
                    //we want to check the next element whether it is fine
                    bool putequal = 1;
                    for(int k = i+1; k < m; ++i){

                        if(s[k]=='?'&&prevstring[k]!=9)break;

                        else if(s[k]=='?'&&prevstring[k]==9 && k!= m-1)continue;

                        else if(s[k]=='?'&&prevstring[k]==9 && k == m-1){
                            putequal=0;
                            break;
                        }
                        int cur = s[k] - '0';
                        int pr = prevstring[k];
                        if(cur>pr)break;
                        else if(cur==pr)continue;
                        putequal = 0;
                        break;

                    }
                    if(putequal){

                        int newc = prevstring[i];
                        new_s[i] = newc;

                    }
                    else{
                        tight = 0;
                        if(prevstring[i]==9){
                            cout << "IMPOSSIBLE\n";
                            return 0;
                        }
                        int newc = prevstring[i];
                        newc++;
                        new_s[i] = newc;

                    }


                }


            }
        }
            for(int i = 0; i < m; ++i){
                prevstring[i] = new_s[i];
                ans[h][i] = new_s[i];
            }
            prevlen = newlen;

        }
    }
    for(int i = 0; i < orgn; ++i){
        for(int k = 0; k < arr[i]; ++k){
            cout << ans[i][k];
        }
        cout << "\n";
    }

    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED