aboutsummaryrefslogtreecommitdiff
path: root/tests/performance/09_gameoflife-gosper.sy
blob: 6238833e49b1a12d41e83848394fb84e25023e9c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
int sheet1[500][500] = {};
int sheet2[500][500] = {};
int active = 1;
int width;
int height;
int steps;

void read_map() {
  width = getint();
  height = getint();
  // width <= 498, height <= 498
  steps = getint();
  getch();

  int i = 1;
  int j = 1;

  while (j <= height) {
    i = 1;
    while (i <= width) {
      int get = getch();
      if (get == 35) {
        sheet1[j][i] = 1;
      } else {
        sheet1[j][i] = 0;
      }
      i = i + 1;
    }
    // line feed
    getch();
    j = j + 1;
  }
}

void put_map() {
  int i = 1;
  int j = 1;

  while (j <= height) {
    i = 1;
    while (i <= width) {
      if (sheet1[j][i] == 1) {
        putch(35);
      } else {
        putch(46);
      }
      i = i + 1;
    }
    // line feed
    putch(10);
    j = j + 1;
  }
}

void swap12() {
  int i = 1;
  int j = 1;

  while (j <= height) {
    i = 1;
    while (i <= width) {
      sheet1[j][i] = sheet2[j][i];
      i = i + 1;
    }
    j = j + 1;
  }
}

void step(int source[][500], int target[][500]) {
  int i = 1;
  int j = 1;

  while (j <= height) {
    i = 1;
    while (i <= width) {
      int alive_count = source[j - 1][i - 1] + source[j - 1][i] +
                        source[j - 1][i + 1] + source[j][i - 1] +
                        source[j][i + 1] + source[j + 1][i - 1] +
                        source[j + 1][i] + source[j + 1][i + 1];
      if (source[j][i] == 1 && alive_count == 2) {
        target[j][i] = 1;
      } else if (alive_count == 3) {
        target[j][i] = 1;
      } else {
        target[j][i] = 0;
      }
      i = i + 1;
    }
    j = j + 1;
  }
}

int main() {
  read_map();
  starttime();
  while (steps > 0) {
    if (active == 1) {
      step(sheet1, sheet2);
      active = 2;
    } else {
      step(sheet2, sheet1);
      active = 1;
    }
    steps = steps - 1;
  }
  stoptime();
  if (active == 2) {
    swap12();
  }
  put_map();
  return 0;
}