結果
問題 | No.348 カゴメカゴメ |
ユーザー | Konton7 |
提出日時 | 2020-09-26 13:19:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
MLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 15,166 bytes |
コンパイル時間 | 2,583 ms |
コンパイル使用メモリ | 225,116 KB |
実行使用メモリ | 541,696 KB |
最終ジャッジ日時 | 2024-06-29 00:17:29 |
合計ジャッジ時間 | 11,876 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 444 ms
291,712 KB |
testcase_01 | AC | 3 ms
5,376 KB |
testcase_02 | AC | 479 ms
380,656 KB |
testcase_03 | AC | 219 ms
41,984 KB |
testcase_04 | AC | 4 ms
5,376 KB |
testcase_05 | AC | 4 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 16 ms
14,976 KB |
testcase_13 | AC | 5 ms
5,376 KB |
testcase_14 | AC | 3 ms
5,376 KB |
testcase_15 | MLE | - |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 386 ms
214,528 KB |
testcase_24 | AC | 375 ms
195,840 KB |
testcase_25 | AC | 387 ms
219,760 KB |
testcase_26 | AC | 387 ms
215,552 KB |
testcase_27 | AC | 371 ms
195,328 KB |
testcase_28 | AC | 382 ms
209,384 KB |
testcase_29 | AC | 383 ms
214,272 KB |
testcase_30 | AC | 385 ms
215,424 KB |
testcase_31 | AC | 378 ms
192,768 KB |
testcase_32 | AC | 384 ms
211,840 KB |
testcase_33 | AC | 34 ms
23,424 KB |
testcase_34 | AC | 34 ms
22,656 KB |
testcase_35 | AC | 33 ms
22,656 KB |
testcase_36 | AC | 33 ms
21,632 KB |
testcase_37 | AC | 34 ms
23,680 KB |
testcase_38 | AC | 33 ms
23,040 KB |
testcase_39 | AC | 34 ms
22,400 KB |
testcase_40 | AC | 35 ms
23,040 KB |
testcase_41 | AC | 33 ms
22,272 KB |
testcase_42 | AC | 33 ms
21,888 KB |
testcase_43 | AC | 6 ms
5,376 KB |
testcase_44 | AC | 5 ms
5,376 KB |
testcase_45 | AC | 5 ms
5,376 KB |
testcase_46 | AC | 6 ms
5,376 KB |
testcase_47 | AC | 6 ms
5,888 KB |
testcase_48 | AC | 6 ms
5,504 KB |
testcase_49 | AC | 6 ms
5,376 KB |
testcase_50 | AC | 6 ms
5,888 KB |
testcase_51 | AC | 6 ms
5,376 KB |
testcase_52 | AC | 6 ms
5,632 KB |
ソースコード
#include <bits/stdc++.h> // #include <set> // #include <vector> // #include <ostream> // #include <atcoder/notall> using namespace std; using ll = long long; using VI = vector<int>; using VL = vector<ll>; using VD = vector<double>; using VS = vector<string>; using VB = vector<bool>; using VVB = vector<vector<bool>>; using VVI = vector<VI>; using VVL = vector<VL>; using VVD = vector<VD>; using PII = std::pair<int, int>; using VPII = std::vector<std::pair<int, int>>; using PLL = std::pair<ll, ll>; using VPLL = std::vector<std::pair<ll, ll>>; using TI3 = std::tuple<int, int, int>; using TI4 = std::tuple<int, int, int, int>; using TL3 = std::tuple<ll, ll, ll>; using TL4 = std::tuple<ll, ll, ll, ll>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d)) #define allpt(v) (v).begin(), (v).end() #define allpt_c(v) (v).cbegin(), (v).cend() #define allpt_r(v) (v).rbegin(), (v).rend() #define allpt_cr(v) (v).crbegin(), (v).crend() const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9; const int mod = mod1; const ll inf = 1e18; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; const string alphabets = "abcdefghijklmnopqrstuvwxyz"; template <typename T> void show1dvec(const vector<T> &v) { if (v.size() == 0) return; int n = v.size() - 1; rep(i, n) cout << v[i] << wsp; cout << v[n] << rt; return; } void show2dvec(const vector<string> &v) { int n = v.size(); rep(i, n) cout << v[i] << rt; } template <typename T> void show2dvec(const vector<vector<T>> &v) { int n = v.size(); rep(i, n) show1dvec(v[i]); } template <typename T> void range_sort(vector<T> &arr, int l, int r) { sort(arr.begin() + l, arr.begin() + r); } template <typename T, typename S> void show1dpair(const vector<pair<T, S>> &v) { int n = v.size(); rep(i, n) cout << v[i].first << wsp << v[i].second << rt; return; } template <typename T, typename S> void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) { int n = v.size(); rep(i, n) { t.push_back(v[i].first); s.push_back(v[i].second); } return; } template <typename T> void maxvec(vector<T> &v) { T s = v[0]; int n = v.size(); rep(i, n - 1) { if (s > v[i + 1]) { v[i + 1] = s; } s = v[i + 1]; } } template <typename T, typename S> bool myfind(T t, S s) { return find(t.cbegin(), t.cend(), s) != t.cend(); } bool check(int y, int x, int h, int w) { return 0 <= y && y < h && 0 <= x && x < w; } bool iskadomatsu(int a, int b, int c) { return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c)); } double euc_dist(PII a, PII b) { return sqrt(pow(a.first - b.first, 2) + pow(a.second - b.second, 2)); } VS split(string s, char c) { VS ret; string part; s += c; rep(i, s.length()) { if (s[i] == c) { if (part != "") ret.emplace_back(part); part = ""; } else if (s[i] != c) { part += s[i]; } } return ret; } template <typename T, typename S, typename R> ll pow_mod(T p, S q, R mod = 1ll) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r, ret %= mod; r = (r * r) % mod, q /= 2; } return ret % mod; } template <typename T, typename S> ll pow_no_mod(T p, S q) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r; r = (r * r), q /= 2; } return ret; } void make_frac_tables(VL &frac_list, VL &frac_inv_list) { rep(i, frac_list.size() - 1) { frac_list[i + 1] *= frac_list[i] * (i + 1); frac_list[i + 1] %= mod; frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod); frac_inv_list[i + 1] %= mod; } } pair<VL, VL> make_frac_tables(int n) { VL frac_list(n + 1, 1), frac_inv_list(n + 1, 1); rep(i, n) { frac_list[i + 1] *= frac_list[i] * (i + 1); frac_list[i + 1] %= mod; frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod); frac_inv_list[i + 1] %= mod; } return make_pair(frac_list, frac_inv_list); } ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) { if (a < b) return 0; if (b < 0) return 0; ll ret = frac_list[a]; ret *= frac_inv_list[b]; ret %= mod; ret *= frac_inv_list[a - b]; ret %= mod; return ret; } struct vec2d { ll x; ll y; vec2d(ll _x, ll _y) { x = _x; y = _y; } ll dot(vec2d p) { return x * p.x + y * p.y; } vec2d diff(vec2d p) { return vec2d(x - p.x, y - p.y); } }; // void djkstra(int n, vector<vec2d> point_list, const VVL cost_list, // const VVI &connect) { // const ll llm = 1e18; // VVL min_cost(n, VL(n, llm)); // min_cost[0][0] = 0; // vector<PII> search = {make_pair(0, 0)}; // vector<PII> new_search; // while (!search.empty()) { // for (auto [p, q] : search) { // for (auto r : connect[p]) { // if (point_list[r] // .diff(point_list[p]) // .dot(point_list[q].diff(point_list[p])) <= 0 && // min_cost[r][p] > cost_list[r][p] + min_cost[p][q]) { // min_cost[r][p] = cost_list[r][p] + min_cost[p][q]; // new_search.emplace_back(make_pair(r, p)); // } // } // } // search.clear(); // search = new_search; // new_search.clear(); // // show1dvec(search); // // show1dvec(shortest); // } // auto ans = *min_element(allpt_c(min_cost[1])); // cout << ((ans == llm) ? -1 : ans) << rt; // // show2dvec(min_cost); // } struct node { int parent = -1; ll weight = 0; int depth = 0; int subtree = 0; VPII children; VPII connect; node(int n) { parent = -1; weight = 0; depth = 0; subtree = 0; children; connect; } }; struct graph { int _n; int root = 0; vector<node> nodes; graph(int n) { _n = n; rep(i, _n) nodes.emplace_back(node(_n)); } void getconnect1() { int a, b; cin >> a >> b; a--, b--; nodes[a].connect.emplace_back(b, 0); nodes[b].connect.emplace_back(a, 0); } void getconnect2() { int a, b, c; cin >> a >> b >> c; a--, b--; nodes[a].connect.emplace_back(b, c); nodes[b].connect.emplace_back(a, c); } void showparent() { rep(i, _n - 1) cout << nodes[i].parent << wsp; cout << nodes[_n - 1].parent << rt; } void showweight() { rep(i, _n - 1) cout << nodes[i].weight << wsp; cout << nodes[_n - 1].weight << rt; } void showsubtree() { rep(i, _n - 1) cout << nodes[i].subtree << wsp; cout << nodes[_n - 1].subtree << rt; } void showdepth() { rep(i, _n - 1) cout << nodes[i].depth << wsp; cout << nodes[_n - 1].depth << rt; } }; struct point { int x; int y; point() { x = 0; y = 0; } point(int _x, int _y) { x = _x; y = _y; } void pointinput() { int _x, _y; cin >> _x >> _y; x = _x; y = _y; } void pointinv() { swap(x, y); } }; double pointseuc(point a, point b) { return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2)); } double dist_segment_point(TL3 segment, point p) { double a = get<0>(segment); double b = get<1>(segment); double c = get<2>(segment); return abs(a * p.x + b * p.y - c) / (a * a + b * b + c * c); } TL3 segment_parameter(point p, point q) { ll a, b, c; a = q.y - p.y; b = p.x - q.x; c = a * p.x + b * p.y; TL3 ret = (TL3){a, b, c}; // cout << a << b << c << rt; return ret; } int cross_check(TL3 segment, point p) { ll a = get<0>(segment); ll b = get<1>(segment); ll c = get<2>(segment); auto f = a * p.x + b * p.y - c; int ret; if (f > 0) ret = 1; if (f == 0) ret = 0; if (f < 0) ret = -1; return ret; } template <typename T> class RangeMinorMaxorSumQuery // 0-index { int const intmax = 1147483647; int const intmin = 0; vector<T> sgt; int n; int k; public: RangeMinorMaxorSumQuery(int n1, int f = -1) { if (f == -1) f = -1; else if (f == 0) f = intmin; int na = 1; int ka = 0; while (na < n1) { na *= 2; ka++; } for (int i = 0; i < 2 * na; i++) sgt.push_back(f); n = na; k = ka; } void update_min(int i, int x) { i += n; sgt[i] = x; while (i > 1) { i /= 2; sgt[i] = min(sgt[2 * i], sgt[2 * i + 1]); } } void update_max(int i, T x) { i += n; sgt[i] = x; while (i > 1) { i /= 2; sgt[i] = max(sgt[2 * i], sgt[2 * i + 1]); } } void update_sum(int i, T x) { i += n; sgt[i] = x; while (i > 1) { i /= 2; sgt[i] = sgt[2 * i] + sgt[2 * i + 1]; } } void add_sum(int i, T x) { i += n; sgt[i] += x; while (i > 1) { i /= 2; sgt[i] = sgt[2 * i] + sgt[2 * i + 1]; } } T getmin(int a, int b, int k = 1, int l = 0, int r = -1) //閉区間 l <= x < r とする { if (r == -1) r = n; if (r <= a || b <= l) return intmax; if (a == l && b == r) return sgt[k]; else return min( getmin(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2), getmin(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r)); } T getmax(int a, int b, int k = 1, int l = 0, int r = -1) //閉区間 l <= x < r とする { if (r == -1) r = n; if (r <= a || b <= l) return intmin; if (a == l && b == r) return sgt[k]; else return max( getmax(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2), getmax(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r)); } T getsum(int a, int b, int k = 1, int l = 0, int r = -1) //閉区間 l <= x < r とする { if (r == -1) r = n; if (r <= a || b <= l) return intmin; if (a == l && b == r) return sgt[k]; else return getsum(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2) + getsum(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r); } T operator[](int i) { return sgt[i + n]; } void printsegtree() { for (int i = 0; i < 2 * n; i++) { cout << sgt[i] << " "; } cout << endl; } }; void dfs_ring(int y, int x, int c, VVI &ring_id, const VS &big_field) { ring_id[y][x] = c; rep2(dy, -1, 2) rep2(dx, -1, 2) if (big_field[y + dy][x + dx] == 'x' && ring_id[y + dy][x + dx] == -1) { dfs_ring(y + dy, x + dx, c, ring_id, big_field); } } void dfs_space(int y, int x, int c, int h2, int w2, VVI &space_id, const VS &big_field) { space_id[y][x] = c; rep2(dy, -1, 2) rep2(dx, -1, 2) if (check(y + dy, x + dx, h2, w2) && big_field[y + dy][x + dx] == '.' && space_id[y + dy][x + dx] == -1) { dfs_space(y + dy, x + dx, c, h2, w2, space_id, big_field); } } void dfs_dp(int v, const VVI &children, VVI &dp, VI &ring_str) { dp[0][v] += ring_str[v]; for (auto u : children[v]) { dfs_dp(u, children, dp, ring_str); dp[0][v] += dp[1][u]; dp[1][v] += max(dp[0][u], dp[1][u]); } } int main() { cin.tie(0); ios::sync_with_stdio(false); // リアクティブ問題のときはコメントアウト #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); // for debug cin.rdbuf(in.rdbuf()); // for debug #endif int h, w, h2, w2, c{0}, d, l; cin >> h >> w; h += 2, w += 2, h2 = 2 * h, w2 = 2 * w; VS original_field(h, string(w, '.')); VS big_field(h2, string(w2, '.')); VI depth; VVI ring_id(h2, VI(w2, -1)); VVI space_id(h2, VI(w2, -1)); rep2(i, 1, h - 1) rep2(j, 1, w - 1) cin >> original_field[i][j]; rep(i, h) rep(j, w) { big_field[2 * i][2 * j] = big_field[2 * i + 1][2 * j] = big_field[2 * i][2 * j + 1] = big_field[2 * i + 1][2 * j + 1] = original_field[i][j]; } rep(i, h - 1) rep(j, w - 1) { if (big_field[2 * i + 1][2 * j + 1] == 'x' && big_field[2 * i + 2][2 * j + 2] == 'x') big_field[2 * i + 2][2 * j + 1] = 'x'; if (big_field[2 * i + 1][2 * j + 2] == 'x' && big_field[2 * i + 2][2 * j + 1] == 'x') big_field[2 * i + 1][2 * j + 1] = 'x'; } // show2dvec(original_field); // show2dvec(big_field); rep(i, h2) rep(j, w2) if (big_field[i][j] == 'x' && ring_id[i][j] == -1) { ++c; dfs_ring(i, j, c, ring_id, big_field); } dfs_space(1, 1, 0, h2, w2, space_id, big_field); rep(i, h2) rep(j, w2) if (space_id[i][j] == -1 && big_field[i][j] == '.') { d = -1; rep2(di, -1, 2) rep2(dj, -1, 2) d = max(d, ring_id[i + di][j + dj]); dfs_space(i, j, d, h2, w2, space_id, big_field); } // show2dvec(ring_id); // show2dvec(space_id); VI ring_str(c + 1, 0); VI parent(c + 1, -1); VVI children(c + 1); VVI dp(2, VI(c + 1, 0)); rep(i, h) rep(j, w) if (ring_id[2 * i][2 * j] >= 0) { ++ring_str[ring_id[2 * i][2 * j]]; } rep(i, h2) rep(j, w2) if (ring_id[i][j] == -1) ring_id[i][j] = space_id[i][j]; rep(i, h2) { depth.clear(); depth.emplace_back(0); l = 1; rep(j, w2 - 1) { if (ring_id[i][j] != ring_id[i][j + 1]) { if (l == 1) { if (parent[ring_id[i][j + 1]] == -1) parent[ring_id[i][j + 1]] = ring_id[i][j]; ++l; depth.emplace_back(ring_id[i][j + 1]); } else if (parent[ring_id[i][j]] != ring_id[i][j + 1] ) { if (parent[ring_id[i][j + 1]] == -1) parent[ring_id[i][j + 1]] = ring_id[i][j]; ++l; depth.emplace_back(ring_id[i][j + 1]); } else { --l; depth.pop_back(); } } } } rep2(i, 1, c + 1) children[parent[i]].emplace_back(i); // show1dvec(parent); // show1dvec(ring_str); // show2dvec(children); dfs_dp(0, children, dp, ring_str); // show2dvec(dp); cout << dp[1][0] << rt; return 0; }