CSES - Leirikisa 9.12.2021

CSES - Leirikisa 9.12.2021 - Results

Submission details
Task:	Ruudukko
Sender:	motsgar
Submission time:	2021-12-09 14:32:16 +0200
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	17
#2	ACCEPTED	42
#3	ACCEPTED	41

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1	details
#2	ACCEPTED	0.01 s	1	details
#3	ACCEPTED	0.01 s	1	details
#4	ACCEPTED	0.01 s	1	details
#5	ACCEPTED	0.01 s	1	details
#6	ACCEPTED	0.01 s	2	details
#7	ACCEPTED	0.01 s	2	details
#8	ACCEPTED	0.01 s	2	details
#9	ACCEPTED	0.01 s	2	details
#10	ACCEPTED	0.01 s	2	details
#11	ACCEPTED	0.02 s	3	details
#12	ACCEPTED	0.01 s	3	details
#13	ACCEPTED	0.01 s	3	details
#14	ACCEPTED	0.01 s	3	details
#15	ACCEPTED	0.01 s	3	details

Code

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main(int argc, char **argv)
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;
    vector<vector<char>> v(n);
    vector<vector<bool>> u(n);


    for (int i = 0; i < n; i++)
    {
        v[i].resize(n);
        u[i].resize(n);
        for (int j = 0; j < n; j++)
        {
            u[i][j] = false;
            cin >> v[i][j];
        }
    }

    vector<pair<int,int>> p;
    p.push_back(make_pair(0, 0));

    cout << v[0][0];


    for (int i = 0; i < 2*n - 1; i++)
    {
        vector<pair<int,int>> pc;
        char smallest = 'Z';
        for (auto pa : p)
        {
            if (pa.second + 1 >= n || pa.first + 1 >= n)
            {
                bool w;
                if (pa.second + 1 >= n) w = false;
                else w = true;

                if (w == false && pa.first + 1 >= n)
                {
                    goto exit;
                }

                if (w)
                {
                    if (u[pa.first][pa.second + 1]) continue;
                    char b = v[pa.first][pa.second + 1];
                    if (b <  smallest) pc.clear();
                    if (b <= smallest)
                    pc.push_back(make_pair(pa.first, pa.second + 1));
                    u[pa.first][pa.second + 1] = true;
                    if (b < smallest) smallest = b;
                }
                else
                {
                    if (u[pa.first + 1][pa.second]) continue;
                    char a = v[pa.first + 1][pa.second];
                    if (a <  smallest) pc.clear();
                    if (a <= smallest)
                    pc.push_back(make_pair(pa.first + 1, pa.second));
                    u[pa.first + 1][pa.second] = true;
                    if (a < smallest) smallest = a;
                }
                continue;
            }
            if (pa.second + 1 >= n || v[pa.first + 1][pa.second] < v[pa.first][pa.second + 1]) 
            {
                if (u[pa.first + 1][pa.second]) continue;
                char a = v[pa.first + 1][pa.second];
                if (a <  smallest) pc.clear();
                if (a <= smallest)
                pc.push_back(make_pair(pa.first + 1, pa.second));
                u[pa.first + 1][pa.second] = true;
                if (a < smallest) smallest = a;
            }
            else if (pa.first + 1 >= n || v[pa.first][pa.second + 1] < v[pa.first + 1][pa.second])
            {
                if (u[pa.first][pa.second + 1]) continue;
                char b = v[pa.first][pa.second + 1];
                if (b <  smallest) pc.clear();
                if (b <= smallest)
                pc.push_back(make_pair(pa.first, pa.second + 1));
                u[pa.first][pa.second + 1] = true;

                if (b < smallest) smallest = b;
            }
            else
            {
                char b = v[pa.first][pa.second + 1];
                if (b <  smallest) pc.clear();
                if (b <= smallest)
                {
                    if (!u[pa.first][pa.second + 1])
                    pc.push_back(make_pair(pa.first, pa.second + 1));
                    if (!u[pa.first + 1][pa.second])
                    pc.push_back(make_pair(pa.first + 1, pa.second));
                    u[pa.first][pa.second + 1] = true;
                    u[pa.first + 1][pa.second] = true;

                }
                if (b < smallest) smallest = b;
            }
        }
        p = pc;
        cout << smallest;
    }
    exit:
    cout << '\n';
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`5 AAAAA AAAAA AAAAA AAAAA ...` view save

correct output
`AAAAAAAAB` view save

user output
`AAAAAAAAB` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`5 ABABA BABAB ABABA BABAB ...` view save

correct output
`ABABABABA` view save

user output
`ABABABABA` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`5 WRYIU TWLKH UJMJC GRDJW ...` view save

correct output
`WRWJMDJWK` view save

user output
`WRWJMDJWK` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`5 RUEAE ZYHHW KDBPD DXREW ...` view save

correct output
`RUEAEWDWX` view save

user output
`RUEAEWDWX` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`5 SRGYR MYDOB GNOVM SZOZK ...` view save

correct output
`SMGNOOLTU` view save

user output
`SMGNOOLTU` view save

Test 6

Group: 2

Verdict: ACCEPTED

input
`100 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

correct output
`AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

user output
`AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` Truncated

Test 7

Group: 2

Verdict: ACCEPTED

input
`100 ABABABABABABABABABABABABABABAB...` view save

correct output
`ABABABABABABABABABABABABABABAB...` view save

user output
`ABABABABABABABABABABABABABABAB...` Truncated

Test 8

Group: 2

Verdict: ACCEPTED

input
`100 FWOVNYKNMMQCNHJGUYPNEDXGVVGONC...` view save

correct output
`FWDBDECKBHKIACOVUCJGDJOHAYIBHO...` view save

user output
`FWDBDECKBHKIACOVUCJGDJOHAYIBHO...` Truncated

Test 9

Group: 2

Verdict: ACCEPTED

input
`100 ETGCJABWKMAAEOQXWFFYMDJBMNKMQK...` view save

correct output
`EAARGLBRLHCDHHBPABHDAJBEEBHQBE...` view save

user output
`EAARGLBRLHCDHHBPABHDAJBEEBHQBE...` Truncated

Test 10

Group: 2

Verdict: ACCEPTED

input
`100 GNWMLJNHSBAADUFCSGIZMWHZTVDHNR...` view save

correct output
`GEGOFRDKBNLLEUOPOEQCEFMTKANLNC...` view save

user output
`GEGOFRDKBNLLEUOPOEQCEFMTKANLNC...` Truncated

Test 11

Group: 3

Verdict: ACCEPTED

input
`500 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

correct output
`AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

user output
`AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` Truncated

Test 12

Group: 3

Verdict: ACCEPTED

input
`500 ABABABABABABABABABABABABABABAB...` view save

correct output
`ABABABABABABABABABABABABABABAB...` view save

user output
`ABABABABABABABABABABABABABABAB...` Truncated

Test 13

Group: 3

Verdict: ACCEPTED

input
`500 HGADXTSFXYIEMDWMFIVQGHTACFUPYI...` view save

correct output
`HGADEJOGAKPJCRAHTABRSDLAVGBFAG...` view save

user output
`HGADEJOGAKPJCRAHTABRSDLAVGBFAG...` Truncated

Test 14

Group: 3

Verdict: ACCEPTED

input
`500 SBLNMAZESQVGWAPZYHQJMQTNGMEZWS...` view save

correct output
`SBLCAMDHILGIDRCIDUNMMAHFYCENOS...` view save

user output
`SBLCAMDHILGIDRCIDUNMMAHFYCENOS...` Truncated

Test 15

Group: 3

Verdict: ACCEPTED

input
`500 AOXYXRYFWPYWQDPWXQITLHQQUAYZAJ...` view save

correct output
`AOJLDOAPBGEKSGCNKBUMKAJCCWCOOD...` view save

user output
`AOJLDOAPBGEKSGCNKBUMKAJCCWCOOD...` Truncated

Leirikisa 9.12.2021

Ruudukko

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Tasks

Submissions (motsgar)