結果
問題 | No.455 冬の大三角 |
ユーザー |
|
提出日時 | 2023-02-23 20:44:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 25 ms / 2,000 ms |
コード長 | 4,015 bytes |
コンパイル時間 | 3,406 ms |
コンパイル使用メモリ | 252,428 KB |
最終ジャッジ日時 | 2025-02-10 20:04:25 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 54 |
ソースコード
#pragma region Macros// #pragma GCC target("avx,avx2,fma")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#include <bits/extc++.h>// #include <bits/stdc++.h>using namespace std;using namespace __gnu_pbds;// using namespace __gnu_cxx;// #include <atcoder/fenwicktree>// #include <atcoder/segtree>// #include <atcoder/maxflow>// using namespace atcoder;// #include <boost/multiprecision/cpp_int.hpp>// namespace mp = boost::multiprecision;// using Bint = mp::cpp_int;#define TO_STRING(var) # var#define pb emplace_back#define int ll#define endl '\n'using ll = long long;using ld = long double;const ld PI = acos(-1);const ld EPS = 1e-10;const ll INFL = 1LL << 61;// const int MOD = 998244353;const int MOD = 1000000007;__attribute__((constructor))void constructor() {ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);}template<int mod> class modint{public:int val = 0;modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }modint(const modint &r) { val = r.val; } // コピーコンストラクタmodint operator -(){ return modint(-val); } // 単項modint operator +(const modint &r) { return modint(*this) += r; }modint operator -(const modint &r) { return modint(*this) -= r; }modint operator *(const modint &r) { return modint(*this) *= r; }modint operator /(const modint &r) { return modint(*this) /= r; }modint &operator +=(const modint &r) {val += r.val;if (val >= mod) val -= mod;return *this;}modint &operator -=(const modint &r) {if (val < r.val) val += mod;val -= r.val;return *this;}modint &operator *=(const modint &r) {val = val * r.val % mod;return *this;}modint &operator /=(const modint &r) {int a = r.val, b = mod, u = 1, v = 0;while (b) {int t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}val = val * u % mod;if (val < 0) val += mod;return *this;}bool operator ==(const modint& r) { return this -> val == r.val; }bool operator <(const modint& r) { return this -> val < r.val; }bool operator !=(const modint& r) { return this -> val != r.val; }};using mint = modint<MOD>;istream &operator >>(istream &is, mint& x) {int t; is >> t;x = t;return (is);}ostream &operator <<(ostream &os, const mint& x) {return os << x.val;}mint modpow(const mint &a, int n) {if (n == 0) return 1;mint t = modpow(a, n / 2);t = t * t;if (n & 1) t = t * a;return t;}int modpow(int x, int N, int mod) {int ret = 1;while (N > 0) {if (N % 2 == 1) ret = ret * x % mod;x = x * x % mod;N /= 2;}return ret;}int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }#pragma endregionsigned main() {int H, W;cin >> H >> W;vector<vector<char>> S(H,vector<char>(W));pair<int,int> p1, p2;int cnt = 0;for (int i = 0; i < H; i++) {for (int j = 0; j < W; j++) {cin >> S[i][j];if (S[i][j] == '*') {if (cnt == 0) p1 = make_pair(i, j);if (cnt == 1) p2 = make_pair(i, j);cnt++;}}}pair<int,int> p3;for (int i = 0; i < H; i++) {for (int j = 0; j < W; j++) {if (p1.first == p2.first && p2.first == i) continue;if (p1.second == p2.second && p2.second == j) continue;if ((p1.first - p2.first) * (p2.first - i) == (p1.second - p2.second) * (p2.second - j)) continue;p3 = make_pair(i, j);break;}}for (int i = 0; i < H; i++) {for (int j = 0; j < W; j++) {if (i == p3.first && j == p3.second) cout << "*";else cout << S[i][j];}cout << endl;}}