feat(cf): 952
This commit is contained in:
parent
0cb0d11ba9
commit
ceda5687f2
30 changed files with 1302 additions and 12 deletions
107
codeforces/952/d.cc
Normal file
107
codeforces/952/d.cc
Normal file
|
|
@ -0,0 +1,107 @@
|
|||
#include <bits/stdc++.h>
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename... Args>
|
||||
void dbg(std::string const &str, Args &&...args) {
|
||||
std::cout << std::vformat(str, std::make_format_args(args...));
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void dbg(T const &t) {
|
||||
std::cout << t;
|
||||
}
|
||||
|
||||
template <std::ranges::range T>
|
||||
void dbgln(T const &t) {
|
||||
if constexpr (std::is_convertible_v<T, char const *>) {
|
||||
std::cout << t << '\n';
|
||||
} else {
|
||||
for (auto const &e : t) {
|
||||
std::cout << e << ' ';
|
||||
}
|
||||
std::cout << '\n';
|
||||
}
|
||||
}
|
||||
|
||||
void dbgln() {
|
||||
std::cout << '\n';
|
||||
}
|
||||
|
||||
template <typename... Args>
|
||||
void dbgln(std::string const &str, Args &&...args) {
|
||||
dbg(str, std::forward<Args>(args)...);
|
||||
cout << '\n';
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void dbgln(T const &t) {
|
||||
dbg(t);
|
||||
cout << '\n';
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
constexpr T MIN = std::numeric_limits<T>::min();
|
||||
|
||||
template <typename T>
|
||||
constexpr T MAX = std::numeric_limits<T>::min();
|
||||
|
||||
template <typename T>
|
||||
static T sc(auto &&x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define ll long long
|
||||
#define ld long double
|
||||
#define vec vector
|
||||
#define endl '\n'
|
||||
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (r).rbegin(), (x).rend()
|
||||
#define sz(x) static_cast<int>((x).size())
|
||||
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a))
|
||||
#define ROF(a, b, c) for (int(a) = (b); (a) > (c); --(a))
|
||||
|
||||
void solve() {
|
||||
int n, m;
|
||||
cin >> n >> m;
|
||||
int bot = -1, top;
|
||||
int left = -1, right;
|
||||
FOR(r, 0, n) {
|
||||
string s;
|
||||
cin >> s;
|
||||
FOR(c, 0, m) {
|
||||
if (s[c] == '#') {
|
||||
if (bot == -1)
|
||||
bot = r;
|
||||
top = r;
|
||||
if (left == -1)
|
||||
left = c;
|
||||
right = c;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
dbgln("{} {}", bot + (top - bot) / 2 + 1, left + (right - left) / 2 + 1);
|
||||
}
|
||||
|
||||
int main() {
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue