oj.uz

Submission #841162

# Submission time Handle Problem Language Result Execution time Memory
841162 2023-09-01T10:06:56 Z peijar Amusement Park (CEOI19_amusementpark) C++17
100 / 100
 1664 ms 608492 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<pair<int, Mint>>> interesting(1 << n);

  interesting[0].emplace_back(0, 1);
  for (int added = 0; added < (1 << n); ++added) {
    sort(interesting[added].begin(), interesting[added].end());
    vector<pair<int, Mint>> compressed;
    for (auto [bad, ways] : interesting[added]) {
      if (compressed.empty() or compressed.back().first != bad)
        compressed.emplace_back(bad, 0);
      auto &[b, w] = compressed.back();
      w += ways;
    }
    int complement = (1 << n) - 1 - added;
    for (auto [bad, ways] : 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;
          interesting[added ^ (1 << nxt)].emplace_back(nxtBad, ways);
        }
    }
  }
  Mint sol = 0;
  for (auto [bad, ways] : interesting[(1 << n) - 1]) {
    assert(!bad);
    sol += ways;
  }
  cout << sol * m / 2 << endl;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 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 244 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 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 244 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 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 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 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 1 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 340 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 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 360 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 464 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

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 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 244 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 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 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 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 1 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 340 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 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 360 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 464 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 26 ms 10316 KB Output is correct
66 Correct 39 ms 14796 KB Output is correct
67 Correct 36 ms 14540 KB Output is correct
68 Correct 37 ms 15184 KB Output is correct
69 Correct 8 ms 4308 KB Output is correct
70 Correct 11 ms 5844 KB Output is correct
71 Correct 11 ms 5764 KB Output is correct
72 Correct 10 ms 5840 KB Output is correct
73 Correct 12 ms 6484 KB Output is correct
74 Correct 12 ms 6484 KB Output is correct
75 Correct 13 ms 6540 KB Output is correct
76 Correct 12 ms 6596 KB Output is correct
77 Correct 51 ms 20060 KB Output is correct
78 Correct 71 ms 26420 KB Output is correct
79 Correct 97 ms 36708 KB Output is correct
80 Correct 86 ms 33740 KB Output is correct
81 Correct 99 ms 38228 KB Output is correct
82 Correct 95 ms 37452 KB Output is correct
83 Correct 98 ms 37876 KB Output is correct
84 Correct 69 ms 27728 KB Output is correct
85 Correct 16 ms 9172 KB Output is correct
86 Correct 24 ms 12600 KB Output is correct
87 Correct 26 ms 12620 KB Output is correct
88 Correct 23 ms 12628 KB Output is correct
89 Correct 27 ms 14096 KB Output is correct
90 Correct 34 ms 14156 KB Output is correct
91 Correct 28 ms 14164 KB Output is correct
92 Correct 27 ms 14164 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 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 244 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 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 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 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 1 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 340 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 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 360 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 464 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 26 ms 10316 KB Output is correct
66 Correct 39 ms 14796 KB Output is correct
67 Correct 36 ms 14540 KB Output is correct
68 Correct 37 ms 15184 KB Output is correct
69 Correct 8 ms 4308 KB Output is correct
70 Correct 11 ms 5844 KB Output is correct
71 Correct 11 ms 5764 KB Output is correct
72 Correct 10 ms 5840 KB Output is correct
73 Correct 12 ms 6484 KB Output is correct
74 Correct 12 ms 6484 KB Output is correct
75 Correct 13 ms 6540 KB Output is correct
76 Correct 12 ms 6596 KB Output is correct
77 Correct 51 ms 20060 KB Output is correct
78 Correct 71 ms 26420 KB Output is correct
79 Correct 97 ms 36708 KB Output is correct
80 Correct 86 ms 33740 KB Output is correct
81 Correct 99 ms 38228 KB Output is correct
82 Correct 95 ms 37452 KB Output is correct
83 Correct 98 ms 37876 KB Output is correct
84 Correct 69 ms 27728 KB Output is correct
85 Correct 16 ms 9172 KB Output is correct
86 Correct 24 ms 12600 KB Output is correct
87 Correct 26 ms 12620 KB Output is correct
88 Correct 23 ms 12628 KB Output is correct
89 Correct 27 ms 14096 KB Output is correct
90 Correct 34 ms 14156 KB Output is correct
91 Correct 28 ms 14164 KB Output is correct
92 Correct 27 ms 14164 KB Output is correct
93 Correct 303 ms 131960 KB Output is correct
94 Correct 105 ms 42844 KB Output is correct
95 Correct 43 ms 21580 KB Output is correct
96 Correct 340 ms 150436 KB Output is correct
97 Correct 329 ms 147776 KB Output is correct
98 Correct 305 ms 128620 KB Output is correct
99 Correct 72 ms 26868 KB Output is correct
100 Correct 136 ms 49848 KB Output is correct
101 Correct 213 ms 79048 KB Output is correct
102 Correct 249 ms 90816 KB Output is correct
103 Correct 12 ms 7508 KB Output is correct
104 Correct 16 ms 9172 KB Output is correct
105 Correct 57 ms 25220 KB Output is correct
106 Correct 279 ms 104788 KB Output is correct
107 Correct 23 ms 14676 KB Output is correct
108 Correct 128 ms 53836 KB Output is correct
109 Correct 646 ms 229104 KB Output is correct
110 Correct 1582 ms 562148 KB Output is correct
111 Correct 269 ms 96560 KB Output is correct
112 Correct 231 ms 89420 KB Output is correct
113 Correct 239 ms 88624 KB Output is correct
114 Correct 39 ms 19532 KB Output is correct
115 Correct 56 ms 27340 KB Output is correct
116 Correct 58 ms 27272 KB Output is correct
117 Correct 62 ms 27536 KB Output is correct
118 Correct 65 ms 30924 KB Output is correct
119 Correct 66 ms 30872 KB Output is correct
120 Correct 73 ms 31188 KB Output is correct
121 Correct 66 ms 31064 KB Output is correct
122 Correct 400 ms 147800 KB Output is correct
123 Correct 635 ms 228684 KB Output is correct
124 Correct 627 ms 233292 KB Output is correct
125 Correct 623 ms 227328 KB Output is correct
126 Correct 559 ms 209868 KB Output is correct
127 Correct 407 ms 154128 KB Output is correct
128 Correct 282 ms 106712 KB Output is correct
129 Correct 177 ms 69952 KB Output is correct
130 Correct 66 ms 31660 KB Output is correct
131 Correct 94 ms 42292 KB Output is correct
132 Correct 135 ms 59852 KB Output is correct
133 Correct 135 ms 59852 KB Output is correct
134 Correct 135 ms 60168 KB Output is correct
135 Correct 151 ms 68172 KB Output is correct
136 Correct 160 ms 68184 KB Output is correct
137 Correct 156 ms 68596 KB Output is correct
138 Correct 151 ms 68556 KB Output is correct
139 Correct 158 ms 71264 KB Output is correct
140 Correct 181 ms 71372 KB Output is correct
141 Correct 167 ms 71340 KB Output is correct
142 Correct 1516 ms 547668 KB Output is correct
143 Correct 1537 ms 562252 KB Output is correct
144 Correct 1216 ms 439696 KB Output is correct
145 Correct 930 ms 347772 KB Output is correct
146 Correct 487 ms 190000 KB Output is correct
147 Correct 166 ms 65820 KB Output is correct
148 Correct 1445 ms 532360 KB Output is correct
149 Correct 1492 ms 553436 KB Output is correct
150 Correct 1664 ms 608492 KB Output is correct
151 Correct 282 ms 119716 KB Output is correct
152 Correct 284 ms 125004 KB Output is correct
153 Correct 365 ms 150452 KB Output is correct
154 Correct 364 ms 150684 KB Output is correct
155 Correct 381 ms 150680 KB Output is correct
156 Correct 337 ms 150864 KB Output is correct
157 Correct 364 ms 150640 KB Output is correct
158 Correct 372 ms 151340 KB Output is correct
159 Correct 371 ms 157492 KB Output is correct
160 Correct 387 ms 157908 KB Output is correct
161 Correct 377 ms 157540 KB Output is correct
162 Correct 365 ms 158256 KB Output is correct
163 Correct 379 ms 158520 KB Output is correct
164 Correct 385 ms 158528 KB Output is correct
165 Correct 371 ms 159224 KB Output is correct
166 Correct 376 ms 159492 KB Output is correct
167 Correct 386 ms 158864 KB Output is correct