CSES - Datatähti 2025 loppu

CSES - Datatähti 2025 loppu - Results

Submission details
Task:	Suunnistus
Sender:	Verlet
Submission time:	2025-01-18 13:41:32 +0200
Language:	C++ (C++17)
Status:	READY
Result:	31

Feedback
group	verdict	score
#1	ACCEPTED	31
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.00 s	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.00 s	1, 2, 3	details
#6	ACCEPTED	0.00 s	1, 2, 3	details
#7	WRONG ANSWER	0.01 s	2, 3	details
#8	WRONG ANSWER	0.01 s	2, 3	details
#9	WRONG ANSWER	0.01 s	2, 3	details
#10	WRONG ANSWER	0.01 s	3	details
#11	WRONG ANSWER	0.01 s	3	details
#12	WRONG ANSWER	0.01 s	3	details
#13	WRONG ANSWER	0.01 s	3	details
#14	WRONG ANSWER	0.01 s	2, 3	details
#15	WRONG ANSWER	0.00 s	3	details
#16	WRONG ANSWER	0.00 s	3	details
#17	WRONG ANSWER	0.01 s	2, 3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:111:9: warning: unused variable 'distance' [-Wunused-variable]
  111 |     int distance = 0;
      |         ^~~~~~~~

Code

#include <bits/stdc++.h>

#define newl "\n"

#define X first
#define Y second

#define N 502

using namespace std;

typedef long long ll;

typedef pair<int, int> ip;
typedef pair<ll, ll> lp;

struct Move
{
    ip p;
    int d;
};

char m[N][N];
bool v[N][N];

int h, w, k;

void clear_visited()
{
    for (int y = 1; y <= h; y++)
    for (int x = 1; x <= w; x++)
    {
        v[x][y] = false;
    }
}

bool valid(ip p)
{
    return v[p.X][p.Y] == false && m[p.X][p.Y] != '#';
}

int bfs(ip & start, char target)
{
    queue<Move> q;

    q.push({start, 0});

    while (q.size() > 0)
    {
        Move move = q.front(); q.pop();

        if (!valid(move.p)) continue;

        int x = move.p.X;
        int y = move.p.Y;
        int d = move.d;

        v[x][y] = true;

        if (m[x][y] == target)
        {
            start.X = x;
            start.Y = y;
            return d;
        }

        q.push({{x+1, y}, d+1});
        q.push({{x-1, y}, d+1});
        q.push({{x, y+1}, d+1});
        q.push({{x, y-1}, d+1});
    }
    return -1;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    for (int y = 0; y < N; y++)
    for (int x = 0; x < N; x++)
    {
        m[x][y] = '#';
    }

    cin >> h >> w >> k;

    ip start, end;

    for (int y = 1; y <= h; y++)
    for (int x = 1; x <= w; x++)
    {
        char c; cin >> c;

        if (c != '#') m[x][y] = c;
        if (c == 'S') start = {x, y};
        if (c == 'E') end =  {x, y};
    }

    // cout << "Start: " << start.X << " " << start.Y << endl;
    // cout << "End: " << end.X << " " << end.Y << endl;

    // for (int y = 0; y <= h+1; y++)
    // {
    //     for (int x = 0; x <= w+1; x++)
    //     {
    //         cout << m[x][y] << " ";
    //     }
    //     cout << endl;
    // }

    int distance = 0;

    if (k == 0)
    {
        cout << bfs(start, 'E') << endl;;
    }
    
    // for (int i = 1; i <= k; i++)
    // {
    //     distance += bfs(start, i+48);
    //     clear_visited();
    // }
    // distance += bfs(start, 'E');

    // cout << distance << endl;
}

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
(empty)

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
`301` view save

user output
`301` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
`253` view save

user output
`253` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
`-1` view save

user output
`-1` view save

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: ACCEPTED

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

correct output
`166` view save

user output
`166` view save

Test 7

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`3447` view save

user output
(empty)

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`4952` view save

user output
(empty)

Test 9

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`-1` view save

user output
(empty)

Test 10

Group: 3

Verdict: WRONG ANSWER

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

correct output
`205` view save

user output
(empty)

Test 11

Group: 3

Verdict: WRONG ANSWER

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

correct output
`157` view save

user output
(empty)

Test 12

Group: 3

Verdict: WRONG ANSWER

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: WRONG ANSWER

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

correct output
`1313` view save

user output
(empty)

Test 14

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`1124942` view save

user output
(empty)

Test 15

Group: 3

Verdict: WRONG ANSWER

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
(empty)

Test 17

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`-1` view save

user output
(empty)

Datatähti 2025 loppu

Suunnistus

Compiler report

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 (Verlet)