fork download
copy 
  1. //http://w...content-available-to-author-only...m.br/meublog/competir/robo-colecionador-maratona2010/
  2. //https://w...content-available-to-author-only...m.br/judge/problems/view/1121
  3.  
  4. #include<stdio.h>
  5. struct pos {
  6.     int x;
  7.     int y;
  8.     int prox_x;
  9.     int prox_y;
  10. }pos;
  11.  
  12. int main (void) {
  13.     int L, C, S;
  14.     while (scanf("%d %d %d", &L, &C, &S)&&L!=0) {
  15.         int i, j, fig=0;
  16.         char tab[L][C], cmd[S+1];
  17.         getchar();
  18.         for(i=0; i<L; i++) {
  19.             for(j=0; j<C; j++) {
  20.                 tab[i][j]=getchar();
  21.                 if(tab[i][j]!='.'&&tab[i][j]!='*'&&tab[i][j]!='#') {
  22.                     pos.x=i;
  23.                     pos.y=j;
  24.                     switch (tab[i][j]) {
  25.                         case 'N':
  26.                             pos.prox_x=i-1;
  27.                             pos.prox_y=j;
  28.                             break;
  29.                         case 'S':
  30.                             pos.prox_x=i+1;
  31.                             pos.prox_y=j;
  32.                             break;
  33.                         case 'L':
  34.                             pos.prox_x=i;
  35.                             pos.prox_y=j+1;
  36.                             break;
  37.                         case 'O':
  38.                             pos.prox_x=i;
  39.                             pos.prox_y=j-1;
  40.                             break;
  41.                     }
  42.                 }
  43.             }
  44.             getchar();
  45.         }
  46.         scanf("%s", cmd);
  47.         for (i=0; i<S; i++) {
  48.             switch (cmd[i]) {
  49.                 case 'D':
  50.                     if (pos.prox_y==pos.y) {
  51.                         if (pos.prox_x>pos.x) {
  52.                             pos.prox_x=pos.x;
  53.                             pos.prox_y=pos.y-1;
  54.                         }
  55.                         else {
  56.                             pos.prox_x=pos.x;
  57.                             pos.prox_y=pos.y+1;
  58.                         }
  59.                     }
  60.                     else {
  61.                         if (pos.prox_y>pos.y) {
  62.                             pos.prox_y=pos.y;
  63.                             pos.prox_x=pos.x+1;
  64.                         }
  65.                         else {
  66.                             pos.prox_y=pos.y;
  67.                             pos.prox_x=pos.x-1;
  68.                         }
  69.                     }
  70.                     break;
  71.                 case 'E':
  72.                     if (pos.prox_x==pos.x) {
  73.                         if (pos.prox_y>pos.y) {
  74.                             pos.prox_y=pos.y;
  75.                             pos.prox_x=pos.x-1;
  76.                         }
  77.                         else {
  78.                             pos.prox_y=pos.y;
  79.                             pos.prox_x=pos.x+1;
  80.                         }
  81.                     }
  82.                     else {
  83.                         if (pos.prox_x>pos.x) {
  84.                             pos.prox_x=pos.x;
  85.                             pos.prox_y=pos.y+1;
  86.                         }
  87.                         else {
  88.                             pos.prox_x=pos.x;
  89.                             pos.prox_y=pos.y-1;
  90.                         }
  91.                     }
  92.                     break;
  93.                 case 'F':
  94.                     if (tab[pos.prox_x][pos.prox_y]!='#'&&(pos.prox_x<L&&pos.prox_x>-1)&&(pos.prox_y<C&&pos.prox_y>-1)) {
  95.                         if (tab[pos.prox_x][pos.prox_y]=='*') {
  96.                             tab[pos.prox_x][pos.prox_y]='.';
  97.                             fig++;
  98.                         }
  99.                         if (pos.prox_y==pos.y) {
  100.                             if (pos.prox_x>pos.x) {
  101.                                 pos.x=pos.prox_x;
  102.                                 pos.prox_x++;
  103.  
  104.                             }
  105.                             else {
  106.                                 pos.x=pos.prox_x;
  107.                                 pos.prox_x--;
  108.                             }
  109.                         }
  110.                         else {
  111.                             if (pos.prox_y>pos.y) {
  112.                                 pos.y=pos.prox_y;
  113.                                 pos.prox_y++;
  114.  
  115.                             }
  116.                             else {
  117.                                 pos.y=pos.prox_y;
  118.                                 pos.prox_y--;
  119.                             }
  120.                         }
  121.                     }
  122.                     break;
  123.             }
  124.  
  125.         }
  126.         printf("%d\n", fig);
  127.     }
  128.     return 0;
  129. }
Success #stdin #stdout 0s 5440KB
comments (?)
stdin
copy 
3 3 2
***
*N*
***
DE
4 4 5
...#
*#O.
*.*.
*.#.
FFEFF
10 10 20
....*.....
.......*..
.....*....
..*.#.....
...#N.*..*
...*......
..........
..........
..........
..........
FDFFFFFFEEFFFFFFEFDF
0 0 0
stdout
copy 
0
1
3
https://ideone.com/LwbdEH
Robô Colecionador [Maratona 2010]
language:
C (gcc 8.3)
created:
2 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!