-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathCoffee.java
131 lines (128 loc) · 2.47 KB
/
Coffee.java
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner s=new Scanner(System.in);
int w=s.nextInt();
int h=s.nextInt();
Corner a[][]=new Corner[h][w];
s.nextLine();
for(int i=0;i<h;i++)
{
String line=s.nextLine();
String vals[]=line.split("\\*");
for(int j=0;j<w;j++)
{
a[i][j]=new Corner(vals[j]);
}
}
for(int i=0;i<7;i++)
{
s.nextLine();
for(int j=0;j<h;j++)
{
String line=s.nextLine();
String vals[]=line.split("\\*");
for(int k=0;k<w;k++)
{
a[j][k].nsold[i]=Integer.parseInt(vals[k]);
if(a[j][k].nshops==0)
a[j][k].dailyinc[i]=a[j][k].nsold[i];
else if(a[j][k].nshops==3)
a[j][k].dailyinc[i]=0;
else
a[j][k].dailyinc[i]=((double)a[j][k].nsold[i])/((double)a[j][k].nshops);
}
}
}
for(int i=0;i<7;i++)
{
for(int j=0;j<h;j++)
{
for(int k=0;k<w;k++)
{
if(a[j][k].nshops==3&&a[j][k].nsold[i]>=5)
{
if(j-1>=0)
{
if(k-1>=0)
{
if(a[j-1][k-1].nshops!=3)
a[j-1][k-1].dailyinc[i]++;
}
if(k+1<w)
{
if(a[j-1][k+1].nshops!=3)
a[j-1][k+1].dailyinc[i]++;
}
}
if(j+1<h)
{
if(k-1>=0)
{
if(a[j+1][k-1].nshops!=3)
a[j+1][k-1].dailyinc[i]++;
}
if(k+1<w)
{
if(a[j+1][k+1].nshops!=3)
a[j+1][k+1].dailyinc[i]++;
}
}
}
}
}
}
for(int i=0;i<7;i++)
{
for(int j=0;j<h;j++)
{
for(int k=0;k<w;k++)
{
if(a[j][k].dailyinc[i]<20)
a[j][k].dailyinc[i]=0;
}
}
}
int tx=0,ty=0,max=-1;
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
int sum=0;
for(int k=0;k<7;k++)
{
sum+=a[i][j].dailyinc[k];
}
if(sum>max)
{
max=sum;
tx=i;
ty=j;
}
}
}
System.out.println((tx+1)+" "+(ty+1));
}
}
class Corner
{
int nshops;
int nsold[]=new int[7];
double dailyinc[]=new double[7];
Corner(String t)
{
if(t.equals("-"))
nshops=0;
else if(t.equals("L"))
nshops=1;
else if(t.equals("M"))
nshops=2;
else
nshops=3;
}
}