CSES - Datatähti 2022 loppu

CSES - Datatähti 2022 loppu - Results

Submission details
Task:	Lista
Sender:	Mahtimursu
Submission time:	2022-01-22 14:48:20 +0200
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	13
#2	ACCEPTED	26
#3	ACCEPTED	61

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	2, 3	details
#3	ACCEPTED	0.01 s	3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	3	details
#9	ACCEPTED	0.01 s	3	details
#10	ACCEPTED	0.01 s	3	details

Code

#include <bits/stdc++.h>
 
typedef long long ll;
 
#define M 1000000007
#define N (1 << 18)
 
using namespace std;
 
vector<string> solve(vector<string> v) {
    int n = v.size();
 
    vector<string> ans;
    vector<string> emp;
 
    string cur = v[0];
 
    for (int i = 0; i < (int)cur.size(); ++i) {
        if (cur[i] == '?') {
            if (i == 0) {
                cur[i] = '1';
            } else {
                cur[i] = '0';
            }
        }
    }
 
    ans.push_back(cur);
 
    for (int i = 1; i < n; ++i) {
        if (cur.size() > v[i].size()) {
            return emp;
        }
        if (cur.size() < v[i].size()) {
            // Just make low
            cur = v[i];
            for (int j = 0; j < (int)cur.size(); ++j) {
                if (cur[j] == '?') {
                    if (j == 0) {
                        cur[j] = '1';
                    } else {
                        cur[j] = '0';
                    }
                }
            }
 
            ans.push_back(cur);
        } else {
            // Improve
            bool gt = false;
            int len = cur.size();
            string orig = v[i];
            for (int j = 0; j < len; ++j) {
                if (v[i][j] != '?') {
                    if (v[i][j] > cur[j]) gt = 1;
                    if (v[i][j] < cur[j] && !gt) {
                        for (int k = j - 1; k >= -1; k--) {
                            if (k == -1) {
                                //cout << "Here 1" << endl;
                                return emp;
                            }
 
                            if (orig[k] == '?') {
                                if (v[i][k] != '9') {
                                    v[i][k]++;
                                    break;
                                } else {
                                    v[i][k] = (k == 0) ? '1' : '0';
                                }
                            }
                        }
                        gt = 1;
                    }
                    if (j == len - 1 && !gt) {
                        for (int k = j - 1; k >= -1; k--) {
                            if (k == -1) {
                                //cout << "Here 1" << endl;
                                return emp;
                            }
 
                            if (orig[k] == '?') {
                                if (v[i][k] != '9') {
                                    v[i][k]++;
                                    break;
                                } else {
                                    v[i][k] = (k == 0) ? '1' : '0';
                                }
                            }
                        }
                        gt = 1;
                    }
                } else {
                    if (j != len - 1 || gt) {
                        if (gt) {
                            v[i][j] = '0';
                        } else {
                            v[i][j] = cur[j];
                        }
                    } else {
                        if (cur[j] != '9') {
                            v[i][j] = cur[j] + 1;
                            gt = 1;
                        } else {
                            v[i][j] = '0';
                            for (int k = j - 1; k >= -1; k--) {
                                if (k == -1) {
                                    //cout << "Here 2" << endl;
                                    return emp;
                                }
 
                                if (orig[k] == '?') {
                                    if (v[i][k] != '9') {
                                        v[i][k]++;
                                        break;
                                    } else {
                                        v[i][k] = '0';
                                    }
                                }
                            }
                            gt = 1;
                        }
                    }
                }
            }
            if (!gt) {
                //cout << "Here 3 " << i << " cur " << cur << " vi " << v[i] << endl;
                return emp;
            }
            cur = v[i];
            ans.push_back(cur);
        }
    }
 
    return ans;
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<string> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
 
    vector<string> ans = solve(v);
 
    if (ans.size() == 0) {
        cout << "IMPOSSIBLE\n";
        return 0;
    }
 
    for (auto x : ans) {
        cout << x << "\n";
    }
 
    return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`100 ?? ?? ?? ?? ...` view save

correct output
`10 11 12 13 20 ...` view save

user output
`10 11 12 13 20 ...` Truncated

Test 2

Group: 2, 3

Verdict: ACCEPTED

input
`1000 8?? ??8? ???? ???? ...` view save

correct output
`800 1080 1081 1082 1083 ...` view save

user output
`800 1080 1081 1082 1083 ...` Truncated

Test 3

Group: 3

Verdict: ACCEPTED

input
`1000 ?????? ?????9? ??98??? ?????5? ...` view save

correct output
`100000 1000090 1098000 1098050 4100001 ...` view save

user output
`100000 1000090 1098000 1098050 4100001 ...` Truncated

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`100 ? ? ? ? ...` view save

correct output
`1 2 3 4 5 ...` view save

user output
`1 2 3 4 5 ...` Truncated

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 ??? ??` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 123 ??? 124` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`5 1?? ??? 2?? ??? ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 8

Group: 3

Verdict: ACCEPTED

input
`1000 ????????? ????????? ????????? ????????? ...` view save

correct output
`100000000 100000001 100000002 100000003 100000004 ...` view save

user output
`100000000 100000001 100000002 100000003 100000004 ...` Truncated

Test 9

Group: 3

Verdict: ACCEPTED

input
`900 ???000000 ???000000 ???000000 ???000000 ...` view save

correct output
`100000000 101000000 102000000 103000000 104000000 ...` view save

user output
`100000000 101000000 102000000 103000000 104000000 ...` Truncated

Test 10

Group: 3

Verdict: ACCEPTED

input
`1000 ???1????? ???0????? ???1????? ???0????? ...` view save

correct output
`100100000 101000000 101100000 102000000 102100000 ...` view save

user output
`100100000 101000000 101100000 102000000 102100000 ...` Truncated

Datatähti 2022 loppu

Lista

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Tasks

Submissions (Mahtimursu)