CSU 1507 超大型LED显示屏 第十届湖南省赛题

题目链接：http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1507

解题思路：这是一道模拟题，看了那么多人的代码，我觉得我的代码是最简的，哈哈，其实就是分数变幻的时候要计算灯管的亮数复杂一点，我就直接暴力咯

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
const int M=;
int c[]={,,,,,,,,,};
char a[],b[];
struct node
{
  int x,y,z;
}t[M];
int main()
{
 int ca=;
  while()
  {
    int i=-,g=,h=,x1,y1,z1;
    long long sum=;
    while(scanf("%s",a)!=EOF)
    {
     scanf("%d:%d:%d",&x1,&y1,&z1);
     i++;
     t[i].x=x1;t[i].y=y1;t[i].z=z1;
     int ans=(t[i].x-t[i-].x)*+(t[i].y-t[i-].y)*+t[i].z-t[i-].z;
     if(strcmp(a,"START")==) continue;
      if(h>){sum+=ans*(c[h/]+c[h/%]+c[h%]);}
      else  if(h>) {sum+=ans*(c[h/]+c[h%]);}
      else sum+=ans*(c[h%]);
      if(g>){sum+=ans*(c[g/]+c[g/%]+c[g%]);}
      else  if(g>) {sum+=ans*(c[g/]+c[g%]);}
      else {sum+=ans*(c[g%]);}
      if(strcmp(a,"END")==) break;
      int x2;
      scanf("%s%d",b,&x2);
      if(strcmp(b,"home"))  h+=x2;
      else if(strcmp(b,"guest")) g+=x2;
      }
      if(i==-) break;
      printf("Case %d: %lld\n",ca++,sum);
  }
  return ;
}

改善代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
const int M=;
int c[]={,,,,,,,,,};
char a[],b[];
long long sum;
struct node
{
  int x,y,z;
}t[M];
int work(int x)
{
  if(x==) return c[];
  int s=;
  while(x)
  {
   s+=c[x%];
   x/=;
  }
  return s;
}
int main()
{
 int ca=;
  while()
  {
    int i=-,g=,h=,x1,y1,z1;
    sum=;
    while(scanf("%s",a)!=EOF)
    {
     scanf("%d:%d:%d",&x1,&y1,&z1);
     i++;
     t[i].x=x1;t[i].y=y1;t[i].z=z1;
     int ans=(t[i].x-t[i-].x)*+(t[i].y-t[i-].y)*+t[i].z-t[i-].z;
     if(strcmp(a,"START")==) continue;
     sum+=ans*(work(h)+work(g));
     if(strcmp(a,"END")==) break;
     int x2;
     scanf("%s%d",b,&x2);
     if(strcmp(b,"home"))  h+=x2;
     else if(strcmp(b,"guest")) g+=x2;
     }
    if(i==-) break;
    printf("Case %d: %lld\n",ca++,sum);
 }
  return ;
}