-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
93 lines (91 loc) · 2.97 KB
/
Program.cs
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
using System;
using System.Collections.Generic;
namespace BombEnemy
{
class Program
{
static void Main(string[] args)
{
char[][] grid = new[]
{
new[] {'0', 'E', 'E', 'E', 'E', 'E', 'E', 'E', 'E', 'E', 'E', 'W'}
};
Console.WriteLine(MaxKilledEnemies(grid));
}
static int MaxKilledEnemies(char[][] grid)
{
var res = 0;
if (grid.Length == 0 || grid[0].Length == 0) return res;
var rowKill = new Dictionary<int, List<int[]>>();
var colKill = new Dictionary<int, List<int[]>>();
var bombs = new List<int[]>();
for (int r = 0; r < grid.Length; r++)
{
if (!rowKill.ContainsKey(r))
rowKill[r] = new List<int[]>();
var count = 0;
for (int c = 0; c < grid[0].Length; c++)
{
if(grid[r][c] == '0')
bombs.Add(new []{r, c});
else if (grid[r][c] == 'E')
count++;
else
{
rowKill[r].Add(new []{c, count});
count = 0;
}
}
rowKill[r].Add(new[] { grid[0].Length, count });
}
for (int c = 0; c < grid[0].Length; c++)
{
if (!colKill.ContainsKey(c))
colKill[c] = new List<int[]>();
var count = 0;
for (int r = 0; r < grid.Length; r++)
{
if (grid[r][c] == 'E')
count++;
else if (grid[r][c] == 'W')
{
colKill[c].Add(new []{r, count});
count = 0;
}
}
colKill[c].Add(new[] { grid.Length, count });
}
foreach (var bomb in bombs)
{
int kills = 0;
if (rowKill.ContainsKey(bomb[0]))
{
var temp = rowKill[bomb[0]];
int pos = BinarySearch(temp, bomb[1]);
kills += temp[pos][1];
}
if (colKill.ContainsKey(bomb[1]))
{
var temp = colKill[bomb[1]];
int pos = BinarySearch(temp, bomb[0]);
kills += temp[pos][1];
}
res = Math.Max(res, kills);
}
return res;
}
static int BinarySearch(List<int[]> list, int target)
{
int li = 0, hi = list.Count - 1;
while (li < hi)
{
int mid = li + (hi - li) / 2;
if (list[mid][0] > target)
hi = mid;
else
li = mid + 1;
}
return li;
}
}
}