CSES - KILO 2017 2/5 - Results
Submission details
Task:Gold
Sender:Olli Järviniemi
Submission time:2017-09-12 18:21:38 +0300
Language:C++
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.03 sdetails
#3ACCEPTED0.03 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.05 sdetails
#6ACCEPTED0.04 sdetails
#7ACCEPTED0.04 sdetails
#8ACCEPTED0.03 sdetails
#9ACCEPTED0.03 sdetails
#10ACCEPTED0.04 sdetails
#11ACCEPTED0.03 sdetails
#12ACCEPTED0.04 sdetails
#13ACCEPTED0.04 sdetails
#14ACCEPTED0.06 sdetails
#15ACCEPTED0.05 sdetails
#16ACCEPTED0.04 sdetails
#17ACCEPTED0.05 sdetails
#18ACCEPTED0.04 sdetails
#19ACCEPTED0.06 sdetails
#20ACCEPTED0.03 sdetails
#21ACCEPTED0.03 sdetails
#22ACCEPTED0.04 sdetails
#23ACCEPTED0.04 sdetails
#24ACCEPTED0.03 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:27:25: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
   q.push(make_pair(a, b));
                         ^
input/code.cpp:27:25: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]

Code

#include <iostream>
#include <queue>
using namespace std;
queue<pair<int, int> > q;
char game[60][60];
bool safe[60][60];
bool seen[60][60];

int main() {
  int w, h;
  cin >> w >> h;
  int a, b;
  for(int i = 1; i <= h; i++) {
    for(int j = 1; j <= w; j++) {
      char c;
      cin >> c;
      game[i][j] = c;
      if(c == 'P') {
         a = i;
         b = j;
      }
    }
  }

  safe[a][b] = true;
  int gold = 0;
  q.push(make_pair(a, b));
  while(!q.empty()) {
    int row = q.front().first;
    int col = q.front().second;
    q.pop();
    if(game[row][col] == '#') {
      continue;
    }
    if(seen[row][col]) {
      continue;
    }
    seen[row][col] = true;
    if(game[row][col] == 'G') {
      gold++;
    }
    if(game[row-1][col] != 'T' && game[row+1][col] != 'T' && game[row][col-1] != 'T' && game[row][col+1] != 'T') {
      safe[row-1][col] = true;
      safe[row+1][col] = true;
      safe[row][col-1] = true;
      safe[row][col+1] = true;
      if(!seen[row+1][col]) {
        q.push(make_pair(row+1, col));
      }
      if(!seen[row-1][col]) {
        q.push(make_pair(row-1, col));
      }
      if(!seen[row][col+1]) {
        q.push(make_pair(row, col+1));
      }
      if(!seen[row][col-1]) {
        q.push(make_pair(row, col-1));
      }
      continue;
    }
    if(safe[row-1][col] && !seen[row-1][col]) {
        q.push(make_pair(row-1, col));
    }
    if(safe[row+1][col] && !seen[row+1][col]) {
      q.push(make_pair(row+1, col));
    }
    if(safe[row][col-1] && !seen[row][col-1]) {
      q.push(make_pair(row, col-1));
    }
    if(safe[row][col+1] && !seen[row][col+1]) {
      q.push(make_pair(row, col+1));
    }
  }

  cout << gold << "\n";

}

Test details

Test 1

Verdict: ACCEPTED

input
8 6
########
#...GTG#
#..PG.G#
#...G#G#
...

correct output
4

user output
4

Test 2

Verdict: ACCEPTED

input
7 4
#######
#P.GTG#
#..TGG#
#######

correct output
1

user output
1

Test 3

Verdict: ACCEPTED

input
50 50
##############################...

correct output
2303

user output
2303

Test 4

Verdict: ACCEPTED

input
50 50
##############################...

correct output
1

user output
1

Test 5

Verdict: ACCEPTED

input
50 50
##############################...

correct output
0

user output
0

Test 6

Verdict: ACCEPTED

input
50 50
##############################...

correct output
2

user output
2

Test 7

Verdict: ACCEPTED

input
50 50
##############################...

correct output
1196

user output
1196

Test 8

Verdict: ACCEPTED

input
50 50
##############################...

correct output
1

user output
1

Test 9

Verdict: ACCEPTED

input
50 50
##############################...

correct output
0

user output
0

Test 10

Verdict: ACCEPTED

input
50 50
##############################...

correct output
130

user output
130

Test 11

Verdict: ACCEPTED

input
50 50
##############################...

correct output
0

user output
0

Test 12

Verdict: ACCEPTED

input
3 3
###
#P#
###

correct output
0

user output
0

Test 13

Verdict: ACCEPTED

input
3 50
###
#G#
#T#
#G#
...

correct output
45

user output
45

Test 14

Verdict: ACCEPTED

input
50 3
##############################...

correct output
45

user output
45

Test 15

Verdict: ACCEPTED

input
5 4
#####
#TGG#
#G#P#
#####

correct output
2

user output
2

Test 16

Verdict: ACCEPTED

input
37 20
##############################...

correct output
0

user output
0

Test 17

Verdict: ACCEPTED

input
16 37
################
#.G.G.G#GG.G.#G#
##....G...#G..##
#G...#.#GG.....#
...

correct output
0

user output
0

Test 18

Verdict: ACCEPTED

input
17 42
#################
##G...#.....##..#
#G..........G.###
#.G..##G.G.G...G#
...

correct output
0

user output
0

Test 19

Verdict: ACCEPTED

input
42 24
##############################...

correct output
133

user output
133

Test 20

Verdict: ACCEPTED

input
32 35
##############################...

correct output
736

user output
736

Test 21

Verdict: ACCEPTED

input
21 43
#####################
#G.##G#GGGGG#G#GG##G#
#GG##GGT#GG###GG#GGG#
#GGGTGG..G#G...TG##G#
...

correct output
0

user output
0

Test 22

Verdict: ACCEPTED

input
47 14
##############################...

correct output
252

user output
252

Test 23

Verdict: ACCEPTED

input
18 21
##################
##G.T#.GGG.G....##
#G..T....GG.G#..G#
#.#..#..#..TG#G.G#
...

correct output
97

user output
97

Test 24

Verdict: ACCEPTED

input
32 16
##############################...

correct output
69

user output
69