oj.uz

답안 #841155

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
841155 2023-09-01T09:56:07 Z peijar Amusement Park (CEOI19_amusementpark) C++17
100 / 100
 2170 ms 608456 KB 
#include <bits/extc++.h> /** keep-include */
#include <bits/stdc++.h>
#define int long long
using namespace std;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
  bool first = true;
  string res = "[";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "]";
  return res;
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << to_string(H);
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

using ll = int;
// To use most bits rather than just the lowest ones:
struct chash { // large odd number for C
  const uint64_t C = ll(4e18 * acos(0)) | 71;
  ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};

using hash_table = __gnu_pbds::gp_hash_table<int, int, chash>;

template <const int32_t MOD> struct ModInt {
  int32_t x;
  ModInt() : x(0) {}
  ModInt(long long u) : x(u % MOD) {
    if (x < 0)
      x += MOD;
  }
  friend bool operator==(const ModInt &a, const ModInt &b) {
    return a.x == b.x;
  }
  friend bool operator!=(const ModInt &a, const ModInt &b) {
    return a.x != b.x;
  }
  friend bool operator<(const ModInt &a, const ModInt &b) { return a.x < b.x; }
  friend bool operator>(const ModInt &a, const ModInt &b) { return a.x > b.x; }
  friend bool operator<=(const ModInt &a, const ModInt &b) {
    return a.x <= b.x;
  }
  friend bool operator>=(const ModInt &a, const ModInt &b) {
    return a.x >= b.x;
  }
  static ModInt sign(long long k) {
    return ((k & 1) ? ModInt(MOD - 1) : ModInt(1));
  }

  ModInt &operator+=(const ModInt &m) {
    x += m.x;
    if (x >= MOD)
      x -= MOD;
    return *this;
  }
  ModInt &operator-=(const ModInt &m) {
    x -= m.x;
    if (x < 0LL)
      x += MOD;
    return *this;
  }
  ModInt &operator*=(const ModInt &m) {
    x = (1LL * x * m.x) % MOD;
    return *this;
  }

  friend ModInt operator-(const ModInt &a) {
    ModInt res(a);
    if (res.x)
      res.x = MOD - res.x;
    return res;
  }
  friend ModInt operator+(const ModInt &a, const ModInt &b) {
    return ModInt(a) += ModInt(b);
  }
  friend ModInt operator-(const ModInt &a, const ModInt &b) {
    return ModInt(a) -= ModInt(b);
  }
  friend ModInt operator*(const ModInt &a, const ModInt &b) {
    return ModInt(a) *= ModInt(b);
  }

  static long long fp(long long u, long long k) {
    long long res = 1LL;
    while (k > 0LL) {
      if (k & 1LL)
        res = (res * u) % MOD;
      u = (u * u) % MOD;
      k /= 2LL;
    }
    return res;
  }

  static constexpr int mod() { return MOD; }

  ModInt fastpow(long long k) { return ModInt(fp(x, k)); }
  ModInt inv() {
    assert(x);
    return ModInt(fp(x, MOD - 2));
  }
  ModInt &operator/=(const ModInt &m) { return *this *= ModInt(m).inv(); }
  friend ModInt operator/(const ModInt &a, const ModInt &b) {
    return ModInt(a) *= ModInt(b).inv();
  }

  friend ostream &operator<<(ostream &out, const ModInt &a) {
    return out << a.x;
  }
  friend istream &operator>>(istream &in, ModInt &a) { return in >> a.x; }
  friend string to_string(ModInt u) { return to_string(u.x); }
};

// const int MOD = 1e9 + 7;
const int MOD = 998244353;
using Mint = ModInt<MOD>;

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

  int n, m;
  cin >> n >> m;
  vector<int> adj(n);
  vector<int> bitAdj(n);
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    adj[u] |= 1 << v;
    bitAdj[u] |= 1 << v;
    bitAdj[v] |= 1 << u;
  }

  vector<int> areBad(n);
  for (int u = 0; u < n; ++u)
    for (int v = 0; v < u; ++v)
      if (!((1 << v) & bitAdj[u]))
        areBad[u] |= 1 << v;
  vector<vector<tuple<int, Mint, Mint>>> interesting(1 << n);

  interesting[0].emplace_back(0, 1, 0);
  for (int added = 0; added < (1 << n); ++added) {
    sort(interesting[added].begin(), interesting[added].end());
    vector<tuple<int, Mint, Mint>> compressed;
    for (auto [bad, ways, sum] : interesting[added]) {
      if (compressed.empty() or get<0>(compressed.back()) != bad)
        compressed.emplace_back(bad, 0, 0);
      auto &[b, w, s] = compressed.back();
      w += ways;
      s += sum;
    }
    int complement = (1 << n) - 1 - added;
    for (auto [bad, ways, sum] : compressed) {
      for (int nxt = 0; nxt < n; ++nxt)
        if (!((1 << nxt) & added) and !((1 << nxt) & bad)) {
          int nxtBad = bad & (bad ^ bitAdj[nxt]);
          nxtBad |= areBad[nxt] & complement;
          int cntFlip = __builtin_popcount(adj[nxt] & added);
          interesting[added ^ (1 << nxt)].emplace_back(nxtBad, ways,
                                                       cntFlip * ways + sum);
        }
    }
    if (added < (1 << n) - 1)
      interesting[added].clear();
  }
  Mint sol = 0;
  for (auto [bad, ways, sum] : interesting[(1 << n) - 1]) {
    assert(!bad);
    sol += sum;
  }
  cout << sol << endl;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 428 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 468 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 428 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 35 ms 10312 KB Output is correct
66 Correct 45 ms 14852 KB Output is correct
67 Correct 44 ms 14544 KB Output is correct
68 Correct 45 ms 15192 KB Output is correct
69 Correct 11 ms 4300 KB Output is correct
70 Correct 15 ms 5840 KB Output is correct
71 Correct 15 ms 5832 KB Output is correct
72 Correct 15 ms 5844 KB Output is correct
73 Correct 17 ms 6476 KB Output is correct
74 Correct 17 ms 6540 KB Output is correct
75 Correct 18 ms 6612 KB Output is correct
76 Correct 18 ms 6592 KB Output is correct
77 Correct 69 ms 20044 KB Output is correct
78 Correct 84 ms 26500 KB Output is correct
79 Correct 125 ms 36772 KB Output is correct
80 Correct 114 ms 33728 KB Output is correct
81 Correct 121 ms 38168 KB Output is correct
82 Correct 115 ms 37540 KB Output is correct
83 Correct 120 ms 37856 KB Output is correct
84 Correct 83 ms 27724 KB Output is correct
85 Correct 23 ms 9096 KB Output is correct
86 Correct 33 ms 12476 KB Output is correct
87 Correct 33 ms 12628 KB Output is correct
88 Correct 32 ms 12620 KB Output is correct
89 Correct 38 ms 14172 KB Output is correct
90 Correct 38 ms 14088 KB Output is correct
91 Correct 38 ms 14180 KB Output is correct
92 Correct 36 ms 14192 KB Output is correct

Subtask #5
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 428 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 35 ms 10312 KB Output is correct
66 Correct 45 ms 14852 KB Output is correct
67 Correct 44 ms 14544 KB Output is correct
68 Correct 45 ms 15192 KB Output is correct
69 Correct 11 ms 4300 KB Output is correct
70 Correct 15 ms 5840 KB Output is correct
71 Correct 15 ms 5832 KB Output is correct
72 Correct 15 ms 5844 KB Output is correct
73 Correct 17 ms 6476 KB Output is correct
74 Correct 17 ms 6540 KB Output is correct
75 Correct 18 ms 6612 KB Output is correct
76 Correct 18 ms 6592 KB Output is correct
77 Correct 69 ms 20044 KB Output is correct
78 Correct 84 ms 26500 KB Output is correct
79 Correct 125 ms 36772 KB Output is correct
80 Correct 114 ms 33728 KB Output is correct
81 Correct 121 ms 38168 KB Output is correct
82 Correct 115 ms 37540 KB Output is correct
83 Correct 120 ms 37856 KB Output is correct
84 Correct 83 ms 27724 KB Output is correct
85 Correct 23 ms 9096 KB Output is correct
86 Correct 33 ms 12476 KB Output is correct
87 Correct 33 ms 12628 KB Output is correct
88 Correct 32 ms 12620 KB Output is correct
89 Correct 38 ms 14172 KB Output is correct
90 Correct 38 ms 14088 KB Output is correct
91 Correct 38 ms 14180 KB Output is correct
92 Correct 36 ms 14192 KB Output is correct
93 Correct 418 ms 131916 KB Output is correct
94 Correct 138 ms 42788 KB Output is correct
95 Correct 66 ms 21588 KB Output is correct
96 Correct 474 ms 150560 KB Output is correct
97 Correct 423 ms 147820 KB Output is correct
98 Correct 414 ms 128640 KB Output is correct
99 Correct 95 ms 26956 KB Output is correct
100 Correct 178 ms 49920 KB Output is correct
101 Correct 288 ms 79024 KB Output is correct
102 Correct 303 ms 90656 KB Output is correct
103 Correct 22 ms 7500 KB Output is correct
104 Correct 28 ms 9172 KB Output is correct
105 Correct 92 ms 25364 KB Output is correct
106 Correct 373 ms 104816 KB Output is correct
107 Correct 44 ms 14668 KB Output is correct
108 Correct 213 ms 53908 KB Output is correct
109 Correct 829 ms 229140 KB Output is correct
110 Correct 1972 ms 562148 KB Output is correct
111 Correct 319 ms 96496 KB Output is correct
112 Correct 278 ms 89444 KB Output is correct
113 Correct 286 ms 88576 KB Output is correct
114 Correct 68 ms 19496 KB Output is correct
115 Correct 82 ms 27268 KB Output is correct
116 Correct 80 ms 27340 KB Output is correct
117 Correct 74 ms 27468 KB Output is correct
118 Correct 89 ms 31076 KB Output is correct
119 Correct 88 ms 30812 KB Output is correct
120 Correct 86 ms 31112 KB Output is correct
121 Correct 89 ms 31052 KB Output is correct
122 Correct 518 ms 147908 KB Output is correct
123 Correct 760 ms 228712 KB Output is correct
124 Correct 787 ms 233392 KB Output is correct
125 Correct 755 ms 227256 KB Output is correct
126 Correct 696 ms 209900 KB Output is correct
127 Correct 520 ms 154152 KB Output is correct
128 Correct 361 ms 106756 KB Output is correct
129 Correct 244 ms 69976 KB Output is correct
130 Correct 92 ms 31432 KB Output is correct
131 Correct 146 ms 42340 KB Output is correct
132 Correct 221 ms 59896 KB Output is correct
133 Correct 192 ms 60024 KB Output is correct
134 Correct 174 ms 60220 KB Output is correct
135 Correct 226 ms 68064 KB Output is correct
136 Correct 248 ms 68208 KB Output is correct
137 Correct 239 ms 68536 KB Output is correct
138 Correct 211 ms 68568 KB Output is correct
139 Correct 253 ms 71268 KB Output is correct
140 Correct 270 ms 71480 KB Output is correct
141 Correct 243 ms 71376 KB Output is correct
142 Correct 1949 ms 547708 KB Output is correct
143 Correct 1999 ms 562060 KB Output is correct
144 Correct 1559 ms 439492 KB Output is correct
145 Correct 1243 ms 347864 KB Output is correct
146 Correct 718 ms 190032 KB Output is correct
147 Correct 220 ms 65832 KB Output is correct
148 Correct 1932 ms 532236 KB Output is correct
149 Correct 1918 ms 553416 KB Output is correct
150 Correct 2170 ms 608456 KB Output is correct
151 Correct 405 ms 119592 KB Output is correct
152 Correct 449 ms 125104 KB Output is correct
153 Correct 502 ms 150360 KB Output is correct
154 Correct 514 ms 150500 KB Output is correct
155 Correct 490 ms 150680 KB Output is correct
156 Correct 474 ms 150944 KB Output is correct
157 Correct 494 ms 150636 KB Output is correct
158 Correct 483 ms 151312 KB Output is correct
159 Correct 502 ms 157516 KB Output is correct
160 Correct 503 ms 157856 KB Output is correct
161 Correct 536 ms 157484 KB Output is correct
162 Correct 519 ms 158280 KB Output is correct
163 Correct 596 ms 158556 KB Output is correct
164 Correct 533 ms 158588 KB Output is correct
165 Correct 548 ms 159184 KB Output is correct
166 Correct 530 ms 159524 KB Output is correct
167 Correct 510 ms 158788 KB Output is correct