| Task: | Suunnistus |
| Sender: | Pikaksi |
| Submission time: | 2025-01-18 13:34:16 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 31 |
| #2 | ACCEPTED | 12 |
| #3 | ACCEPTED | 57 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 3 | details |
| #2 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.02 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 | ACCEPTED | 0.14 s | 2, 3 | details |
| #8 | ACCEPTED | 0.16 s | 2, 3 | details |
| #9 | ACCEPTED | 0.01 s | 2, 3 | details |
| #10 | ACCEPTED | 0.04 s | 3 | details |
| #11 | ACCEPTED | 0.04 s | 3 | details |
| #12 | ACCEPTED | 0.01 s | 3 | details |
| #13 | ACCEPTED | 0.15 s | 3 | details |
| #14 | ACCEPTED | 0.07 s | 2, 3 | details |
| #15 | ACCEPTED | 0.00 s | 3 | details |
| #16 | ACCEPTED | 0.00 s | 3 | details |
| #17 | ACCEPTED | 0.03 s | 2, 3 | details |
Compiler report
input/code.cpp: In function 'void solve()':
input/code.cpp:33:11: warning: 'sx' may be used uninitialized in this function [-Wmaybe-uninitialized]
33 | q.push({sy, sx, 0, 0});
| ~~~~~~^~~~~~~~~~~~~~~~
input/code.cpp:33:11: warning: 'sy' may be used uninitialized in this function [-Wmaybe-uninitialized]Code
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
// chmod u+x b.sh
void solve(); int main() {
ios_base::sync_with_stdio(0); cout.tie(0);
solve();
}
char t[510][510];
bool vi[15][510][510];
void solve()
{
int h, w, r;
cin >> h >> w >> r;
int sy, sx;
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
char a;
cin >> a;
t[y][x] = a;
if (a == 'S') {
sy = y;
sx = x;
}
}
}
queue<array<int, 4>> q;
q.push({sy, sx, 0, 0});
while (!q.empty()) {
auto [y, x, lay, dst] = q.front(); q.pop();
if (t[y][x] == '#') continue;
if (vi[lay][y][x]) continue;
vi[lay][y][x] = true;
//cout << "x: " << x << " y: " << y <<" lay = " << lay << " dst = " << dst << endl;
if (lay == r && t[y][x] == 'E') {
cout << dst;
return;
}
int nlay = (t[y][x] == lay + '1') ? lay + 1 : lay;
static pair<int, int> dirs[4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
for (auto [dy, dx] : dirs) {
int nx = x + dx;
int ny = y + dy;
if (nx < 0 || ny < 0 || nx >= w || ny >= h) continue;
q.push({ny, nx, nlay, dst + 1});
}
}
cout << -1;
}Test details
Test 1
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 10 10 9 S293#35616 #662963731 54975451#7 5162589168 ... |
| correct output |
|---|
| 25 |
| user output |
|---|
| 25 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 0 ................................. |
| correct output |
|---|
| 301 |
| user output |
|---|
| 301 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 0 .#.........#.#..##..#............ |
| correct output |
|---|
| 253 |
| user output |
|---|
| 253 |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 0 ...#......##.##.#.#..##..#..##... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 1 0 . . . . ... |
| correct output |
|---|
| 77 |
| user output |
|---|
| 77 |
Test 6
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 0 ................................. |
| correct output |
|---|
| 166 |
| user output |
|---|
| 166 |
Test 7
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 9 ................................. |
| correct output |
|---|
| 3447 |
| user output |
|---|
| 3447 |
Test 8
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 9 .#........#..................#... |
| correct output |
|---|
| 4952 |
| user output |
|---|
| 4952 |
Test 9
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 9 ##.########.##########.#..#...... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 10
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 9 623475428948841896621266296765... |
| correct output |
|---|
| 205 |
| user output |
|---|
| 205 |
Test 11
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 9 7##814125813#3463#272134469457... |
| correct output |
|---|
| 157 |
| user output |
|---|
| 157 |
Test 12
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 9 ##67##36##5#3###67###8972#61##... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 13
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 9 ....................#...#........ |
| correct output |
|---|
| 1313 |
| user output |
|---|
| 1313 |
Test 14
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 499 499 9 S#...#...#...#...#...#...#...#... |
| correct output |
|---|
| 1124942 |
| user output |
|---|
| 1124942 |
Test 15
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 500 1 9 1 6 1 3 ... |
| correct output |
|---|
| 332 |
| user output |
|---|
| 332 |
Test 16
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 9 996327784392827829434482995353... |
| correct output |
|---|
| 135 |
| user output |
|---|
| 135 |
Test 17
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 500 9 ................................. |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
