CSES - Datatähti 2025 loppu

Submission details
Task:	Suunnistus
Sender:	AH
Submission time:	2025-01-18 14:47:55 +0200
Language:	C++ (C++20)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#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	WRONG ANSWER	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	ACCEPTED	0.01 s	3	details
#11	ACCEPTED	0.01 s	3	details
#12	WRONG ANSWER	0.01 s	3	details
#13	WRONG ANSWER	0.02 s	3	details
#14	WRONG ANSWER	0.01 s	2, 3	details
#15	ACCEPTED	0.01 s	3	details
#16	ACCEPTED	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:36:20: warning: variable 'cur' set but not used [-Wunused-but-set-variable]
   36 |     pair<int, int> cur = S;
      |                    ^~~

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
typedef tree<int,null_type,less<>,rb_tree_tag,tree_order_statistics_node_update> index_set;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
 
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define FOR(i,a,b) for (int i = a; i < b; i++)
 
constexpr ll MOD = 1000000007;

char c[510][510];
int z[510][510];
int e[510][510];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n, m, k; cin >> n >> m >> k;
    pair<int, int> S, E;
    FOR(i,0,n) {
        string x; cin >> x;
        FOR(j,0,m) {
            c[i][j] = x[j];
            if (c[i][j] == 'S') S = {i, j};
            if (c[i][j] == 'E') E = {i, j};
        }
    }
    pair<int, int> cur = S;
    FOR(i,0,1) {
        queue<pair<int, int>> q;
        q.emplace(S.F, S.S);
        while (!q.empty()) {
            auto s = q.front(); q.pop();
            if (z[s.F][s.S] || c[s.F][s.S] == '#') continue;
            if (s.F == E.F && s.S == E.S) break;
            //cout << s.F << " " << s.S << "\n";
            z[s.F][s.S] = 1;
            if (s.F > 0) q.emplace(s.F-1, s.S), e[s.F-1][s.S] = e[s.F][s.S] + 1;
            if (s.F < n-1) q.emplace(s.F+1, s.S), e[s.F+1][s.S] = e[s.F][s.S] + 1;
            if (s.S > 0) q.emplace(s.F, s.S-1), e[s.F][s.S-1] = e[s.F][s.S] + 1;
            if (s.S < m-1) q.emplace(s.F, s.S+1), e[s.F][s.S+1] = e[s.F][s.S] + 1;
        }
        cout << e[E.F][E.S] << "\n";
    }

}

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
`15` view save

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

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

correct output
`-1` view save

user output
`0` 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
`249` view save

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`4952` view save

user output
`234` view save

Test 9

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`-1` view save

user output
`0` view save

Test 10

Group: 3

Verdict: ACCEPTED

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

correct output
`205` view save

user output
`205` view save

Test 11

Group: 3

Verdict: ACCEPTED

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

correct output
`157` view save

user output
`157` view save

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
`0` view save

Test 13

Group: 3

Verdict: WRONG ANSWER

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

correct output
`1313` view save

user output
`539` view save

Test 14

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`1124942` view save

user output
`124998` view save

Test 15

Group: 3

Verdict: ACCEPTED

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

correct output
`332` view save

user output
`332` view save

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
`135` view save

user output
`135` view save

Test 17

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`-1` view save

user output
`453` view save

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