OJ Board

Code: Select all

#include <iostream>

using namespace std;

struct point{
	int value;
	int cost;
	bool is_wall;
	bool is_bumper; 	
	
}grid[55][55];

int nextdir(int dir)
{
	if(dir == 0)return 3;
	if(dir == 1)return 0;
	if(dir == 2)return 1;
	if(dir == 3)return 2;
}

int getpoint(int x,int y)
{
	if(grid[x][y].is_bumper)return grid[x][y].value;
	return 0;
}

int gettime(int x,int y)
{
	if(grid[x][y].is_bumper||grid[x][y].is_wall)return grid[x][y].cost+1;
	
	return 1;
}
int solve(int sx,int sy,int dir,int timeleft)
{
	int one_point = 0;
	while(1)
	{
		
		switch(dir)
		{
			case 0:sx++;break;	
			case 1:sy++;break;
			case 2:sx--;break;
			case 3:sy--;break;
		
		}
		
		timeleft -= gettime(sx,sy);
		if(timeleft  < 1)return one_point;
		one_point += getpoint(sx,sy);	
			
		if(grid[sx][sy].is_wall||grid[sx][sy].is_bumper)
		{
			if(dir == 0)sx--;
			if(dir == 1)sy--;
			if(dir == 2)sx++;
			if(dir == 3)sy++;
			dir = nextdir(dir);
			
		}
		
	}	
	
}

int main()
{
	int m,n,i,j;
	int wallcost,n_bumper;
	int x,y,p_value,p_cost;
	int dir,timeleft;
	int sum_point = 0;
	cin>>m>>n;
	
	for(i = 1;i <= m;i++)
		for(j = 1;j <=n;j++)
			{
				grid[i][j].value = 0;
				grid[i][j].cost = 0;
				grid[i][j].is_wall = false;
				grid[i][j].is_bumper = false;
			}
	
	cin>>wallcost;
	
	for(i = 1; i <= m;i++)
	{
		grid[i][1].is_wall = true;	
		grid[i][1].cost =wallcost;
		grid[i][n].is_wall = true;	
		grid[i][n].cost = wallcost;
	}
		
	for(i = 1; i <= n;i++)
	{
		grid[1][i].is_wall = true;
		grid[1][i].cost = wallcost;
		grid[m][i].is_wall = true;
		grid[m][i].cost = wallcost;
	}
	
	
	
	cin>>n_bumper;
	
	for(i = 0;i < n_bumper;i++)
	{
		cin>>x>>y>>p_value>>p_cost;
		grid[x][y].is_bumper = true;
		grid[x][y].value = p_value;
		grid[x][y].cost = p_cost;
	}
	
	while(cin>>x>>y>>dir>>timeleft)
	{
		int one_point = 0;
		one_point = solve(x,y,dir,timeleft);
		cout<<one_point<<endl;
		sum_point += one_point;
	}
	
	cout<<sum_point<<endl;
	return 0;	
}

Code: Select all

#include<stdio.h>
#include<stdlib.h>

typedef struct
{
  int type;
  int cost; 
  int point;
}grid;

typedef struct
{
  int x,y;
  int life;
  int point;
  int mode;
}pinball;

int height;
int width;

grid map[51][51];

int cost_wall;

int n_bumper;

int sum_point;

void makewall();
void move(int mode,pinball *ballPtr);

int main()
{
  int i,j;
  int temp_x,temp_y,temp_p,temp_c;
  
  pinball *ball;
  
  scanf(" %d %d",&width,&height);
  scanf(" %d",&cost_wall);
  scanf(" %d",&n_bumper);
  
  for( i=0 ; i<n_bumper ; i++ )
  {
    scanf(" %d %d %d %d",&temp_x,&temp_y,&temp_p,&temp_c);
    map[temp_x][temp_y].type = 2;
    map[temp_x][temp_y].cost = temp_c;
    map[temp_x][temp_y].point = temp_p;
  }
  makewall();
  
  ball = ( pinball* )malloc( sizeof(pinball) );
  
  while( scanf(" %d %d %d %d",&(ball->x),&(ball->y)
                             ,&(ball->mode),&(ball->life) )==4 )
  {
    ball->point = 0;
    
    while( ball->life > 0 )
      move( ball->mode , ball );
      
    sum_point += ball->point; 
    
    printf("%d\n",ball->point);
  }
  printf("%d\n",sum_point);
  
  return 0;
}

void makewall()
{
  int i;
  
  for( i=1 ; i<=width ; i++ )
  {
    map[i][1].cost = map[i][height].cost = cost_wall;
    map[i][1].point = map[i][height].point = 0;
    map[i][1].type = map[i][height].type = 1;
  }
  for( i=1 ; i<=height ; i++ )
  {
    map[1][i].cost = map[width][i].cost = cost_wall;
    map[1][i].point = map[width][i].point = 0;
    map[1][i].type = map[width][i].type = 1;
  }
}

void move(int mode,pinball *ballPtr)
{
  int i,j;
  int cost;

  switch(mode)
  {
    case 0:
      for( i=ballPtr->x + 1 ; i<=width ; i++ )
      {
        if( map[i][ballPtr->y].type != 0 )
        {
          ballPtr->life -= i - ballPtr->x;
          if( ballPtr->life > 0 )
          {
            ballPtr->life -= map[i][ballPtr->y].cost;
            if( ballPtr->life > 0 )
            {
              ballPtr->point += map[i][ballPtr->y].point;
              ballPtr->x = i - 1;
              ballPtr->mode = 3;
            }
          }
          break;
        }
      }
      break;
    case 1:
      for( i=ballPtr->y + 1 ; i<=height ; i++ )
      {
        if( map[ballPtr->x][i].type != 0 )
        {
          ballPtr->life -= i - ballPtr->y;
          if( ballPtr->life > 0 )
          {
            ballPtr->life -= map[ballPtr->x][i].cost;
            if( ballPtr->life > 0 )
            {
              ballPtr->point += map[ballPtr->x][i].point;
              ballPtr->y = i - 1;
              ballPtr->mode = 0;
            }
          }
          break;
        }
      }
      break;
    case 2:
      for( i=ballPtr->x - 1 ; i>=1 ; i-- )
      {
        if( map[i][ballPtr->y].type != 0 )
        {
          ballPtr->life -= ballPtr->x - i;
          if( ballPtr->life > 0 )
          {
            ballPtr->life -= map[i][ballPtr->y].cost;
            if( ballPtr->life > 0 )
            {
              ballPtr->point += map[i][ballPtr->y].point;
              ballPtr->x = i + 1;
              ballPtr->mode = 1;
            }
          }
          break;
        }
      }
      break;
    case 3:
      for( i=ballPtr->y - 1 ; i>=1 ; i-- )
      {
        if( map[ballPtr->x][i].type != 0 )
        {
          ballPtr->life -= ballPtr->y - i;
          if( ballPtr->life > 0 )
          {
            ballPtr->life -= map[ballPtr->x][i].cost;
            if( ballPtr->life > 0 )
            {
              ballPtr->point += map[ballPtr->x][i].point;
              ballPtr->y = i + 1;
              ballPtr->mode = 2;
            }
          }
          break;
        }
      }
      break;
  }
}

Code: Select all

4WWWW 
3W.BW 
2WB.W
1WWWW
 1234