Submission

Score: 100

User: Nathlol2

Problemset: A.Circle Area

Language: cpp

Time: 0.003 second

Submitted On: 2025-06-05 16:25:09

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define sc second
#define inf (int)2e9
#define INF (ll)1e18
#define MOD (ll)1000000007
//998244353

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define vt vector
#define ar array
#define pb push_back
#define eb emplace_back
#define all(arrname) (arrname).begin(), (arrname).end()
#define rall(arrname) (arrname).rbegin(), (arrname).rend()
#define sz(arrname) (int)(arrname).size()

const int d4x[4] = {-1, 0, 1, 0}, d4y[4] = {0, 1, 0, -1};
const int d8x[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, d8y[8] = {0, 1, 1, 1, 0, -1, -1, -1};

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

    int n, m;
    cin >> n >> m;
    string a[n];
    for(int i = 0;i<n;i++){
        cin >> a[i];
    }
	for(int i = 0;i<n;i++){
	    for(int j = 0;j<m;j++){
	        if(a[i][j] == '#'){
	            int l = 0;
	            int tmp = i;
	            double c = 0;
	            while(i < n && a[i][j] == '#'){
	                ++i;
	                ++l;
	                ++c;
	            }
	            l = (l + 1) / 2;
	            cout << tmp + l << ' ' << j + 1 << '\n' << fixed << setprecision(2) << 3.14 * (c / 2.0) * (c / 2.0);
	            return 0;
	        }
	    }
	}
	return 0;
}