CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Ratsun reitit
Sender:	nireo
Submission time:	2020-09-29 11:32:34 +0300
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	27
#2	ACCEPTED	31
#3	ACCEPTED	42

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 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	2, 3	details
#9	ACCEPTED	0.01 s	2, 3	details
#10	ACCEPTED	0.01 s	2, 3	details
#11	ACCEPTED	0.01 s	3	details
#12	ACCEPTED	0.01 s	3	details
#13	ACCEPTED	0.01 s	3	details

Code

#pragma GCC optimize("O3")
#pragma GCC target("sse4")

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int a[110][110];
int n;

int main() {
    cin >> n;
    int m = n + 1;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j) a[i][j] = m;
    a[1][1] = 0;
    for (int i = 0; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            for (int k = 1; k <= n; ++k)
                if (a[j][k] == i) {
                    if (a[j + 2][k + 1] == m && j + 2 <= n && k + 1 <= n)
                        a[j + 2][k + 1] = a[j][k] + 1;

                    if (a[j + 2][k - 1] == m && j + 2 <= n && k - 1 >= 1)
                        a[j + 2][k - 1] = a[j][k] + 1;

                    if (a[j + 1][k + 2] == m && j + 1 <= n && k + 2 <= n)
                        a[j + 1][k + 2] = a[j][k] + 1;

                    if (a[j + 1][k - 2] == m && j + 1 <= n && k - 2 >= 1)
                        a[j + 1][k - 2] = a[j][k] + 1;

                    if (a[j - 2][k + 1] == m && j - 2 >= 1 && k + 1 <= n)
                        a[j - 2][k + 1] = a[j][k] + 1;

                    if (a[j - 2][k - 1] == m && j - 2 >= 1 && k - 1 >= 1)
                        a[j - 2][k - 1] = a[j][k] + 1;

                    if (a[j - 1][k + 2] == m && j - 1 >= 1 && k + 2 <= n)
                        a[j - 1][k + 2] = a[j][k] + 1;

                    if (a[j - 1][k - 2] == m && j - 1 >= 1 && k - 2 >= 1)
                        a[j - 1][k - 2] = a[j][k] + 1;
                }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) cout << a[i][j] << " ";
        cout << "\n";
    }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4` view save

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

user output
`0 3 2 5 3 4 1 2 2 1 4 3 5 2 3 2` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`5` view save

correct output
`0 3 2 3 2 3 4 1 2 3 2 1 4 3 2 3 2 3 2 3 2 3 2 3 4` view save

user output
`0 3 2 3 2 3 4 1 2 3 2 1 4 3 2 3 2 3 2 3 2 3 2 3 4` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`6` view save

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

user output
`0 3 2 3 2 3 3 4 1 2 3 4 2 1 4 3 2 3 3 2 3 2 3 4 2 3 2 3 4 3 ...` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`7` view save

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

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

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`8` view save

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

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

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`9` view save

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

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

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10` view save

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

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

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`25` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`49` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`50` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 11

Group: 3

Verdict: ACCEPTED

input
`75` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 12

Group: 3

Verdict: ACCEPTED

input
`99` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 13

Group: 3

Verdict: ACCEPTED

input
`100` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Datatähti 2021 alku

Ratsun reitit

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

Tasks

Submissions (nireo)