CSES - Datatähti 2025 loppu

CSES - Datatähti 2025 loppu - Results

Submission details
Task:	Suunnistus
Sender:	PMak
Submission time:	2025-01-18 14:16:08 +0200
Language:	C++ (C++17)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.00 s	3	details
#2	RUNTIME ERROR	0.02 s	1, 2, 3	details
#3	RUNTIME ERROR	0.02 s	1, 2, 3	details
#4	RUNTIME ERROR	0.02 s	1, 2, 3	details
#5	ACCEPTED	0.00 s	1, 2, 3	details
#6	WRONG ANSWER	0.00 s	1, 2, 3	details
#7	RUNTIME ERROR	0.02 s	2, 3	details
#8	RUNTIME ERROR	0.02 s	2, 3	details
#9	RUNTIME ERROR	0.02 s	2, 3	details
#10	RUNTIME ERROR	0.02 s	3	details
#11	RUNTIME ERROR	0.02 s	3	details
#12	RUNTIME ERROR	0.02 s	3	details
#13	RUNTIME ERROR	0.03 s	3	details
#14	RUNTIME ERROR	0.02 s	2, 3	details
#15	RUNTIME ERROR	0.00 s	3	details
#16	WRONG ANSWER	0.00 s	3	details
#17	RUNTIME ERROR	0.03 s	2, 3	details

Code

#include<bits/stdc++.h>
#define FOR(i, n) for (i = 0; i < n; ++i)
#define pii pair<int, int>
using namespace std;

const int N = 5;
const int mx = 1000000000;
int grid[N][N]; // -1 = obstacle, 0 = start, path, 10 = end, 1-9: controls
int dis[N][N];
int vis[N][N];
int n, m, k;
int dif[][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};

int bfs(pii st) {
    queue<pair<pii, int>> q;
    q.push({st, 0});

    int a, b, i, j, d, x; pii p;
    while (!q.empty())  {
        tie(p, d) = q.front();
        tie(a, b) = p;
        q.pop();

        FOR (x, 4) {
            i = a+dif[x][0]; j = b+dif[x][1];
            if (i < 0 || i >= n) continue;
            if (j < 0 || j >= m) continue;
            if (vis[i][j]) continue;
            vis[i][j] = true;
            if (grid[i][j] == -1) continue;

            if (grid[i][j] == 10) {
                return d+1;
            }
            q.push({{i, j}, d+1});
        }
    }
    return -1;
}

int main() {
    memset(grid, -1, sizeof(grid));
    memset(vis, 0, sizeof(vis));

    int i, j;
    cin >> n >> m >> k;

    char ch;
    pii start = {0, 0};
    FOR (i, n) {
        FOR (j, m) {
            cin >> ch;
            dis[i][j] = mx;
            if (ch == '#') grid[i][j] = -1;
            else if (ch == '.') grid[i][j] = 0;
            else if (ch == 'S') {
                grid[i][j] = 0;
                start = {i, j};
                dis[i][j] = 0;
            }
            else if (ch == 'E') grid[i][j] = 10;
            else grid[i][j] = int(ch-'0');
        }
    }

    int length = bfs(start);
    cout << length;
}

Test details

Test 1

Group: 3

Verdict: WRONG ANSWER

input
`10 10 9 S293#35616 #662963731 54975451#7 5162589168 ...` view save

correct output
`25` view save

user output
`-1` view save

Test 2

Group: 1, 2, 3

Verdict: RUNTIME ERROR

input
`500 500 0 .................................` view save

correct output
`301` view save

user output
(empty)

Test 3

Group: 1, 2, 3

Verdict: RUNTIME ERROR

input
`500 500 0 .#.........#.#..##..#............` view save

correct output
`253` view save

user output
(empty)

Test 4

Group: 1, 2, 3

Verdict: RUNTIME ERROR

input
`500 500 0 ...#......##.##.#.#..##..#..##...` view save

correct output
`-1` view save

user output
(empty)

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`500 1 0 . . . . ...` view save

correct output
`77` view save

user output
`77` view save

Test 6

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 500 0 .................................` view save

correct output
`166` view save

user output
`-1` view save

Test 7

Group: 2, 3

Verdict: RUNTIME ERROR

input
`500 500 9 .................................` view save

correct output
`3447` view save

user output
(empty)

Test 8

Group: 2, 3

Verdict: RUNTIME ERROR

input
`500 500 9 .#........#..................#...` view save

correct output
`4952` view save

user output
(empty)

Test 9

Group: 2, 3

Verdict: RUNTIME ERROR

input
`500 500 9 ##.########.##########.#..#......` view save

correct output
`-1` view save

user output
(empty)

Test 10

Group: 3

Verdict: RUNTIME ERROR

input
`500 500 9 623475428948841896621266296765...` view save

correct output
`205` view save

user output
(empty)

Test 11

Group: 3

Verdict: RUNTIME ERROR

input
`500 500 9 7##814125813#3463#272134469457...` view save

correct output
`157` view save

user output
(empty)

Test 12

Group: 3

Verdict: RUNTIME ERROR

input
`500 500 9 ##67##36##5#3###67###8972#61##...` view save

correct output
`-1` view save

user output
(empty)

Test 13

Group: 3

Verdict: RUNTIME ERROR

input
`500 500 9 ....................#...#........` view save

correct output
`1313` view save

user output
(empty)

Test 14

Group: 2, 3

Verdict: RUNTIME ERROR

input
`499 499 9 S#...#...#...#...#...#...#...#...` view save

correct output
`1124942` view save

user output
(empty)

Test 15

Group: 3

Verdict: RUNTIME ERROR

input
`500 1 9 1 6 1 3 ...` view save

correct output
`332` view save

user output
(empty)

Test 16

Group: 3

Verdict: WRONG ANSWER

input
`1 500 9 996327784392827829434482995353...` view save

correct output
`135` view save

user output
`-1` view save

Test 17

Group: 2, 3

Verdict: RUNTIME ERROR

input
`500 500 9 .................................` view save

correct output
`-1` view save

user output
(empty)

Datatähti 2025 loppu

Suunnistus

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

Test 16

Test 17

Tasks

Submissions (PMak)