-
Notifications
You must be signed in to change notification settings - Fork 0
/
TOI04_Cromartie Mountain.c
49 lines (49 loc) · 1.13 KB
/
TOI04_Cromartie Mountain.c
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
/*
TASK: MOUNTAIN
LANG: C++
AUTHOR: Tapat Toungsakul
CENTER: Home
*/
#include <stdio.h>
int main()
{
int n,i,j;
scanf("%d",&n);
int len = 0, hei = 0, s[n], h[n];
char map[hei][len];
for(i=0;i<n;i++)
{
scanf("%d%d",&s[i],&h[i]);
s[i]--;
len = len > s[i] - 1 + 2*h[i] ? len : s[i] - 1 + 2*h[i];
hei = hei > h[i] ? hei : h[i];
}
len++;
for(i=0;i<hei;i++) for(j=0;j<len;j++) map[i][j] = '.';
for(i=0;i<n;i++)
{
int m = s[i], p = hei-1;
while(m <= s[i] + h[i] - 1)
{
if (map[p][m] == '.') map[p][m] = '/';
else if (map[p][m] == '\\') map[p][m] = 'v';
for (j=p+1;j<hei;j++) map[j][m] = 'X';
m++;
p--;
}
p++;
while(m <= s[i] + 2*(h[i]) - 1)
{
if (map[p][m] == '.') map[p][m] = '\\';
else if (map[p][m] == '/') map[p][m] = 'v';
for (j=p+1;j<hei;j++) map[j][m] = 'X';
m++;
p++;
}
}
for(i=0;i<hei;i++)
{
for(j=0;j<len;j++) printf("%c", map[i][j]);
printf("\n");
}
}