-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1985D Manhattan Circle.cpp
66 lines (59 loc) · 1.33 KB
/
1985D Manhattan Circle.cpp
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
/*
Author : MishkatIT
Created : Tuesday 11-06-2024 21:13:05
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
using ll = long long;
using ld = long double;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 10;
const ll inf = 1e9;
const ll linf = 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc;
cin >> tc;
while (tc--) {
int n, m;
cin >> n >> m;
vector<vector<char>> v(n, vector<char>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> v[i][j];
}
}
int row = -1;
int mx = 0;
for (int i = 0; i < n; i++) {
int tmx = 0;
for (int j = 0; j < m; j++) {
tmx += (v[i][j] == '#');
}
if (tmx > mx) {
mx = tmx;
row = i + 1;
}
}
int col = -1;
mx = 0;
for (int j = 0; j < m; j++) {
int tmx = 0;
for (int i = 0; i < n; i++) {
tmx += (v[i][j] == '#');
}
if (tmx > mx) {
mx = tmx;
col = j + 1;
}
}
cout << row << ' ' << col << '\n';
}
return 0;
}