UVA457 Linear Cellular Automata【模拟】

A biologist is experimenting with DNA modification of bacterial colonies being grown in a linear array of culture dishes. By changing the DNA, he is able “program” the bacteria to respond to the population density of the neighboring dishes. Population is measured on a four point scale (from 0 to 3). The DNA information is represented as an array DNA, indexed from 0 to 9, of population density values and is interpreted as follows:
    • In any given culture dish, let K be the sum of that culture dish’s density and the densities of the dish immediately to the left and the dish immediately to the right. Then, by the next day, that
dish will have a population density of DNA[K].
    • The dish at the far left of the line is considered to have a left neighbor with population density 0.
    • The dish at the far right of the line is considered to have a right neighbor with population density 0.
    Now, clearly, some DNA programs cause all the bacteria to die off (e.g., [0,0,0,0,0,0,0,0,0,0]). Others result in immediate population explosions (e.g., [3,3,3,3,3,3,3,3,3,3]). The biologist is interested in how some of the less obvious intermediate DNA programs might behave.
    Write a program to simulate the culture growth in a line of 40 dishes, assuming that dish 20 starts with a population density of 1 and all other dishes start with a population density of 0.
Input
The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.
    For each input set your program will read in the DNA program (10 integer values) on one line.
Output
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.
    For each input set it should print the densities of the 40 dishes for each of the next 50 days. Each day’s printout should occupy one line of 40 characters. Each dish is represented by a single character on that line. Zero population densities are to be printed as the character ‘ ’. Population density 1 will be printed as the character ‘.’. Population density 2 will be printed as the character ‘x’. Population density 3 will be printed as the character ‘W’.
Note: Whe show only the first ten lines of output (the total number of lines must be 50) and the spaces have been replaced with the character ‘b’ for ease of reading. The actual output file will use the ASCII-space character, not ‘b’.
Sample Input
1
0 1 2 0 1 3 3 2 3 0
Sample Output
bbbbbbbbbbbbbbbbbbb.bbbbbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbbbbb…bbbbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbbbb.xbx.bbbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbbb.bb.bb.bbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbb…bbbbbbbbbbbbbbbb
bbbbbbbbbbbbbb.xbbbbbbbx.bbbbbbbbbbbbbbb
bbbbbbbbbbbbb.bbxbbbbbxbb.bbbbbbbbbbbbbb
bbbbbbbbbbbb…xxxbbbxxx…bbbbbbbbbbbbb
bbbbbbbbbbb.xb.WW.xbx.WW.bx.bbbbbbbbbbbb
bbbbbbbbbb.bbb.xxWb.bWxx.bbb.bbbbbbbbbbb

问题链接：UVA457 Linear Cellular Automata
问题简述：（略）
问题分析：
简单模拟题，不解释。
需要注意数组大小。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA457 Linear Cellular Automata */#include <bits/stdc++.h>using namespace std;const int N = 10;
const int M = 40;
const int K = 50;
int a[M + 2], b[M + 2], dna[N];int main()
{int t;scanf("%d", &t);while(t--) {memset(a, 0, sizeof(a));memset(b, 0,sizeof(b));for(int i = 0; i < N; i++)scanf("%d", &dna[i]);a[M / 2] = b[M / 2] = 1;for(int i = 0; i < K; i++) {for(int j = 1; j <= M; j++) {if(a[j] == 0) putchar(' ');else if(a[j] == 1) putchar('.');else if(a[j] == 2) putchar('x');else if(a[j] == 3) putchar('W');b[j] = dna[a[j - 1] + a[j] + a[j + 1]];}putchar('\n');for(int j = 1; j <= M; j++)a[j] = b[j];}if(t) putchar('\n');}return 0;
}

UVA457 Linear Cellular Automata【模拟】相关推荐

A.457 - Linear Cellular Automata
2019独角兽企业重金招聘Python工程师标准>>> 第一天除了第20个培养皿密度为1外,其余全为0. 从第二天开始,第i个等于前一天的第i-1个+第i个+第i+1个的和所代表的 ...
元胞自动机（Cellular Automata）
元胞自动机(Cellular Automata,简称CA,也有人译为细胞自动机.点格自动机.分子自动机或单元自动机).是一时间和空间都离散的动力系统.散布在规则格网 (Lattice Grid)中的每 ...
用matlab做元胞自动机预测,元胞自动机(Cellular Automata)与城市规划及其MATLAB实现——莆田市城市发展预测...
前言探索元胞自动机用于城市规划,是由于前不久在CSDN上看到相关案例后大开眼界,兴趣使然,想对家乡做一个城市发展预测,遂在巨人的肩膀上做一些探索与更正.文章末尾有这些案例的链接,感谢并致敬这些先行者 ...
元胞自动机(Cellular Automata)与城市规划及其MATLAB实现——莆田市城市发展预测
github:https://github.com/Myoontyee/CA-city-planning-for-Putian-by-MATLAB 前言探索元胞自动机用于城市规划,是由于前不久在CS ...
A data-driven two-lane traffic flow model based on cellular automata
A data-driven two-lane traffic flow model based on cellular automata 这是一篇发表在 Physica A 上的一篇论文.cellul ...
POJ 3095 Linear Pachinko 字符串模拟
http://poj.org/problem?id=3095 简单字符串模拟 Linear Pachinko Time Limit:1000MSMemory Limit:65536K Descript ...
Competitive Programming 3题解
题目一览: Competitive Programming 3: The New Lower Bound of Programming Contests(1) Competitive Programm ...
AOAPC I: Beginning Algorithm Contests 题解
AOAPC I: Beginning Algorithm Contests 题解 AOAPC I: Beginning Algorithm Contests (Rujia Liu) - Virtual ...
提取了下刘汝佳推荐的题号...
今天闲来没事上uva oj提取了下刘汝佳推荐的acm题号,原始数据如下: Volume 0. Getting Started 10055 - Hashmat the Brave Warrior ...

UVA457 Linear Cellular Automata【模拟】

UVA457 Linear Cellular Automata【模拟】相关推荐

最新文章

热门文章