{"fast_code_id":"6503235e2ed1aeb76cf82e78625582c15e3841c654ad650c6534ce2c8de91033","fast_id":"c889f83c4952dc23fd2f04fdda1dd4628b2136c34b58d3ca47f7cc041bb41f14","fast_time":0.0179541085,"language":"cpp","measured_fast_code_id":"c889f83c4952dc23fd2f04fdda1dd4628b2136c34b58d3ca47f7cc041bb41f14","measured_slow_code_id":"e7d027f7954fe67d8c9c56d39bc4f18c31847726565d4df641d0ea5cce783092","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_10033","problem_id":"p04040","slow_code_id":"78359b56a8205b18363eccd9861fbf6d616bfbe9eb44387ef6ca94ecb9e89c85","slow_id":"e7d027f7954fe67d8c9c56d39bc4f18c31847726565d4df641d0ea5cce783092","slow_time":0.4006953053,"speedup":22.317750018052973,"stratum":"8+","sampling_key":"106accddb666834d185018582115e9574efdb70a1daa2498bd23555cc3b607f0","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#define int long long\n\n#define N 200002\n\nusing namespace std;\n\nconst int mod = 1000000007;\n\nint a, b, x, y, i, j, f[N], inv[N];\n\nint poww(int a, int b)\n\n{\n\n  int ans = 1, base = a;\n\n  while (b) {\n\n    if (b & 1)\n      ans = ans * base % mod;\n\n    base = base * base % mod;\n\n    b >>= 1;\n  }\n\n  return ans;\n}\n\nint C(int n, int m)\n\n{\n\n  return f[n] * inv[m] % mod * inv[n - m] % mod;\n}\n\nsigned main()\n\n{\n\n  cin >> a >> b >> x >> y;\n\n  f[0] = 1;\n\n  for (i = 1; i <= 200000; i++)\n    f[i] = f[i - 1] * i % mod;\n\n  inv[200000] = poww(f[200000], mod - 2);\n\n  for (i = 199999; i >= 0; i--)\n    inv[i] = inv[i + 1] * (i + 1) % mod;\n\n  int ans = C(a + b - 2, b - 1);\n\n  for (i = a - x + 1; i <= a - x + 1; i++) {\n\n    for (j = 1; j <= y; j++)\n      ans = (ans - C(i + j - 3, j - 1) * C(a + b - i - j, b - j) % mod + mod) % mod;\n  }\n\n  cout << (ans + mod) % mod << endl;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define MOD 1000000007\n\n#define MAXN 200005\n\n#define LL long long\n\nLL inv[MAXN], s[MAXN];\n\nint N;\n\nint n, m, x, y;\n\nLL Pow(LL a, int b)\n\n{\n\n  LL ans = 1;\n\n  while (b)\n\n  {\n\n    if (b & 1)\n      ans = ans * a % MOD;\n\n    a = a * a % MOD;\n\n    b >>= 1;\n  }\n\n  return ans;\n}\n\nvoid Pre()\n\n{\n\n  s[0] = 1;\n\n  for (int i = 1; i <= N; i++)\n\n    s[i] = s[i - 1] * i % MOD;\n\n  inv[0] = 1;\n\n  inv[N] = Pow(s[N], MOD - 2);\n\n  for (int i = N - 1; i > 0; i--)\n\n    inv[i] = inv[i + 1] * (i + 1) % MOD;\n}\n\nLL C(int a, int b)\n\n{\n\n  if (a < 0 || b < 0)\n    return 1;\n\n  return s[a] * inv[b] % MOD * inv[a - b] % MOD;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  scanf(\"%d%d\", &x, &y);\n\n  N = n + m - 2;\n\n  Pre();\n\n  LL ans = 0;\n\n  for (int i = y + 1; i <= m; i++)\n\n  {\n\n    ans += C(n - x + i - 2, i - 1) * C(x + m - i - 1, x - 1) % MOD;\n\n    ans %= MOD;\n  }\n\n  printf(\"%lld\\n\", ans);\n}"}
{"fast_code_id":"2c793dbe4b840bf21560370ebc6fd9d0586394fac8661209b4b1466d6b688413","fast_id":"af85ff90099f356749dc45a90f8d208bb94c40d50d767f26705cd6d8b745e5b8","fast_time":0.1045896269,"language":"cpp","measured_fast_code_id":"af85ff90099f356749dc45a90f8d208bb94c40d50d767f26705cd6d8b745e5b8","measured_slow_code_id":"9a7f72758e4c969d9cc99ba3eb5eb21c0cfa002d72262a754051b19ee769d03e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_10112","problem_id":"p02573","slow_code_id":"a3fb58771c8949e75fa52e4d3dd805f9ec8fafab7e65e2043ddaf164ea4bda6f","slow_id":"9a7f72758e4c969d9cc99ba3eb5eb21c0cfa002d72262a754051b19ee769d03e","slow_time":1.2593510432,"speedup":12.040879009962316,"stratum":"8+","sampling_key":"b98ed5b11fa768651f94c7e8b0d9eb3c1a69d8d9ee732b90f9a1062867b06208","slow_code":"#include <iostream>\n\n#include <set>\n\n#include <vector>\n\n#include <string>\n\n#include <algorithm>\n\n#include <cmath>\n\nusing namespace std;\n\nusing ll = long long;\n\n#define rep(i, a, b) for (ll i = a; i < ll(b); i++)\n\n#define repr(i, a, b) for (ll i = a; i >= ll(b); i--)\n\n#define endl \"\\n\"\n\n#define ALL(x) x.begin(), x.end()\n\n#define ALLR(x) x.rbegin(), x.rend()\n\n#define INF 1e9\n\n#define DEBUG(x) cout << \"debug: \" << x << endl\n\nvector<bool> seen(200001);\n\nset<int> graph[200001];\n\nint surch(const set<int> g) {\n\n  int succ = 0;\n\n  for (auto x : g) {\n\n    if (seen[x])\n      continue;\n\n    seen[x] = true;\n\n    succ++;\n\n    succ += surch(graph[x]);\n  }\n\n  return succ;\n}\n\nint n, m;\n\nint main() {\n\n  cin >> n >> m;\n\n  rep(_, 0, m) {\n\n    int a, b;\n    cin >> a >> b;\n\n    a--;\n    b--;\n\n    graph[a].insert(b);\n\n    graph[b].insert(a);\n  }\n\n  int ans = 1;\n\n  rep(i, 0, n) {\n\n    if (seen[i])\n      continue;\n\n    int tmp = surch(graph[i]);\n\n    ans = max(ans, tmp);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\nusing namespace std;\n\nusing ll = long long;\n\n#define rep(i, a, b) for (ll i = a; i < ll(b); i++)\n\n#define endl \"\\n\"\n\nstruct UnionFind {\n\n  vector<int> data;\n\n  UnionFind(int size = 0) : data(size, -1) {}\n\n  int root(int x) {\n\n    if (data[x] < 0)\n      return x;\n\n    return x = root(data[x]);\n  }\n\n  bool unite(int x, int y) {\n\n    x = root(x);\n    y = root(y);\n\n    if (x == y)\n      return false;\n\n    if (data[x] > data[y])\n      swap(x, y);\n\n    data[x] += data[y];\n\n    data[y] = x;\n\n    return true;\n  }\n\n  bool same(int x, int y) { return root(x) == root(y); }\n\n  int size(int x) { return -data[root(x)]; }\n};\n\nint n, m;\n\nint main() {\n\n  cin >> n >> m;\n\n  UnionFind UF(n);\n\n  rep(i, 0, m) {\n\n    int a, b;\n    cin >> a >> b;\n\n    a--;\n    b--;\n\n    UF.unite(a, b);\n  }\n\n  int ans = 0;\n\n  rep(i, 0, n) { ans = max(ans, UF.size(i)); }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"bc3b2a44632ab7bdf5b79be06ccfa4d371b95ba6b5f2975f481cba99718a3101","fast_id":"6fc57d3099722b85aae2a32c2f7ba263bee7963c406266a2a1fd148c21274ccd","fast_time":0.0811469465,"language":"cpp","measured_fast_code_id":"6fc57d3099722b85aae2a32c2f7ba263bee7963c406266a2a1fd148c21274ccd","measured_slow_code_id":"0f770f6c133495a7edc3b6c68297963f84cd822658c30a1f3bf2ed7c02bfc45d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_10118","problem_id":"p03184","slow_code_id":"16ab07ec4ecbbb48c83e87e91d1e6e9fba7dae85bc1d1558cdb440982ba73205","slow_id":"0f770f6c133495a7edc3b6c68297963f84cd822658c30a1f3bf2ed7c02bfc45d","slow_time":0.5480431379,"speedup":6.753712388919034,"stratum":"4-8","sampling_key":"28b56969c1ce10e58ba13cc4a07fac5e5616493718d60ea174648378a9d16327","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <queue>\n\n#include <string>\n\n#include <map>\n\n#include <set>\n\n#include <tuple>\n\n#include <deque>\n\n#include <numeric>\n\n#include <bitset>\n\n#include <iomanip>\n\n#include <cassert>\n\n#include <chrono>\n\n#include <random>\n\n#include <limits>\n\n#include <iterator>\n\n#include <functional>\n\n#include <sstream>\n\nusing namespace std;\n\n#define chmax(x, y) x = max(x, y)\n\n#define chmin(x, y) x = min(x, y)\n\ntypedef long long ll;\n\ntypedef pair<int, int> P;\n\ntypedef pair<int, double> Pid;\n\ntypedef pair<double, int> Pdi;\n\nconst double PI = 3.1415926535897932;\n\nconst double EPS = 1e-15;\n\nconst int INF = 1001001001;\n\nconst ll mod = 1e+9 + 7;\n\n#define chadd(x, y) x = (x + y) % mod\n\nll mod_pow(ll x, int n) {\n\n  if (n == 0)\n    return 1;\n\n  ll res = 1;\n\n  while (n > 0) {\n\n    if (n & 1)\n      res = res * x % mod;\n\n    x = x * x % mod;\n\n    n >>= 1;\n  }\n\n  return res;\n}\n\nstruct Combination {\n\n  int sz;\n\n  vector<ll> fact;\n\n  vector<ll> ifact;\n\n  Combination(int sz = 2 * 1e+5) : sz(sz) {\n\n    fact = vector<ll>(sz + 1);\n\n    ifact = vector<ll>(sz + 1);\n\n    fact[0] = 1;\n\n    for (ll i = 1; i <= sz; ++i) {\n\n      fact[i] = fact[i - 1] * i % mod;\n    }\n\n    ifact[sz] = mod_pow(fact[sz], mod - 2);\n\n    for (ll i = sz; i > 0; --i) {\n\n      ifact[i - 1] = ifact[i] * i % mod;\n    }\n  }\n\n  ll get_combination(int n, int r) {\n\n    if (n < 0 || r < 0 || n < r)\n      return 0;\n\n    return fact[n] * ifact[r] % mod * ifact[n - r] % mod;\n  }\n};\n\nll dp[3005][2];\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  int h, w, n;\n\n  cin >> h >> w >> n;\n\n  vector<P> rc(n);\n\n  for (int i = 0; i < n; ++i) {\n\n    int r, c;\n\n    cin >> r >> c;\n\n    --r, --c;\n\n    rc[i] = P(r, c);\n  }\n\n  rc.push_back(P(0, 0));\n\n  rc.push_back(P(h - 1, w - 1));\n\n  sort(rc.begin(), rc.end());\n\n  Combination c;\n\n  dp[0][1] = 1;\n\n  for (int i = 1; i <= n + 1; ++i) {\n\n    for (int j = 0; j < 2; ++j) {\n\n      for (int k = 0; k < i; ++k) {\n\n        if (rc[i].second < rc[k].second)\n          continue;\n\n        int N = rc[i].first + rc[i].second - rc[k].first - rc[k].second;\n\n        int K = rc[i].first - rc[k].first;\n\n        ll add = dp[k][j ^ 1] * c.get_combination(N, K) % mod;\n\n        chadd(dp[i][j], add);\n      }\n    }\n  }\n\n  ll res = (dp[n + 1][0] - dp[n + 1][1]) % mod;\n\n  if (res < 0)\n    res += mod;\n\n  cout << res << endl;\n}","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <queue>\n\n#include <string>\n\n#include <map>\n\n#include <set>\n\n#include <stack>\n\n#include <tuple>\n\n#include <deque>\n\n#include <numeric>\n\n#include <bitset>\n\n#include <iomanip>\n\n#include <cassert>\n\n#include <chrono>\n\n#include <random>\n\n#include <limits>\n\n#include <iterator>\n\n#include <functional>\n\n#include <sstream>\n\n#include <complex>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing ull = uint64_t;\n\nusing P = pair<int, int>;\n\nconstexpr double EPS = 1e-9;\n\nconstexpr int INF = 1001001001;\n\nconstexpr int mod = 1000000007;\n\ntemplate <class T>\n\ninline bool chmax(T &x, T y) {\n\n  if (x < y) {\n\n    x = y;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <class T>\n\ninline bool chmin(T &x, T y) {\n\n  if (x > y) {\n\n    x = y;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <int mod>\n\nstruct ModInt {\n\n  int x;\n\n  ModInt() : x(0) {}\n\n  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n  ModInt &operator+=(const ModInt &p) {\n\n    if ((x += p.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  ModInt &operator-=(const ModInt &p) {\n\n    if ((x += mod - p.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  ModInt &operator*=(const ModInt &p) {\n\n    x = (int)(1LL * x * p.x % mod);\n\n    return *this;\n  }\n\n  ModInt &operator/=(const ModInt &p) {\n\n    *this *= p.inverse();\n\n    return *this;\n  }\n\n  ModInt operator-() const { return ModInt(-x); }\n\n  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\n  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\n  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\n  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\n  bool operator==(const ModInt &p) const { return x == p.x; }\n\n  bool operator!=(const ModInt &p) const { return x != p.x; }\n\n  ModInt inverse() const {\n\n    int a = x, b = mod, u = 1, v = 0, t;\n\n    while (b > 0) {\n\n      t = a / b;\n\n      swap(a -= t * b, b);\n\n      swap(u -= t * v, v);\n    }\n\n    return ModInt(u);\n  }\n\n  ModInt pow(int64_t n) const {\n\n    ModInt ret(1), mul(x);\n\n    while (n > 0) {\n\n      if (n & 1)\n        ret *= mul;\n\n      mul *= mul;\n\n      n >>= 1;\n    }\n\n    return ret;\n  }\n\n  friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\n\n  friend istream &operator>>(istream &is, ModInt &a) {\n\n    int64_t t;\n\n    is >> t;\n\n    a = ModInt<mod>(t);\n\n    return (is);\n  }\n\n  static int get_mod() { return mod; }\n};\n\nusing modint = ModInt<mod>;\n\ntemplate <typename T>\n\nstruct Combination {\n\n  int sz;\n\n  vector<T> fact_;\n\n  vector<T> ifact_;\n\n  vector<T> inv_;\n\n  Combination(int n = 1e+6) : sz(n) {\n\n    fact_.resize(sz + 1);\n\n    ifact_.resize(sz + 1);\n\n    inv_.resize(sz + 1);\n\n    fact_[0] = ifact_[sz] = inv_[0] = 1;\n\n    for (int i = 1; i <= sz; ++i)\n      fact_[i] = fact_[i - 1] * i;\n\n    ifact_[sz] /= fact_[sz];\n\n    for (int i = sz; i > 0; --i)\n      ifact_[i - 1] = ifact_[i] * i;\n\n    for (int i = 1; i <= sz; ++i)\n      inv_[i] = ifact_[i] * fact_[i - 1];\n  }\n\n  inline T fact(int k) const { return fact_[k]; }\n\n  inline T ifact(int k) const { return ifact_[k]; }\n\n  inline T inv(int k) const { return inv_[k]; }\n\n  T get_permutation(int n, int k) {\n\n    if (n < 0 || k < 0 || n < k)\n      return 0;\n\n    return fact(n) * ifact(n - k);\n  }\n\n  T get_combination(int n, int k) {\n\n    if (n < 0 || k < 0 || n < k)\n      return 0;\n\n    return fact(n) * ifact(k) * ifact(n - k);\n  }\n};\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  int H, W, N;\n\n  cin >> H >> W >> N;\n\n  vector<P> ps(N);\n\n  for (int i = 0; i < N; ++i)\n    cin >> ps[i].first >> ps[i].second;\n\n  ps.emplace_back(1, 1);\n\n  ps.emplace_back(H, W);\n\n  sort(ps.begin(), ps.end());\n\n  Combination<modint> c(H + W);\n\n  vector<vector<modint>> dp(N + 2, vector<modint>(2));\n\n  dp[0][1] = 1;\n\n  for (int i = 0; i <= N; ++i) {\n\n    int sx = ps[i].first, sy = ps[i].second;\n\n    for (int j = i + 1; j <= N + 1; ++j) {\n\n      int tx = ps[j].first, ty = ps[j].second;\n\n      if (ty < sy)\n        continue;\n\n      modint X = c.get_combination(tx + ty - sx - sy, tx - sx);\n\n      for (int k = 0; k < 2; ++k) {\n\n        if (dp[i][k] == 0)\n          continue;\n\n        int nk = k ^ 1;\n\n        dp[j][nk] += X * dp[i][k];\n      }\n    }\n  }\n\n  cout << dp[N + 1][0] - dp[N + 1][1] << endl;\n}"}
{"fast_code_id":"7feb4f36a8b52ccd2b7c7ca2682b7889109f3d42cce02db965b4c182f6a1cb1d","fast_id":"77dbadc25352098089b91dcc483b3c73047de54b77c178306d7e17f8283a4a3d","fast_time":0.1593194592,"language":"cpp","measured_fast_code_id":"77dbadc25352098089b91dcc483b3c73047de54b77c178306d7e17f8283a4a3d","measured_slow_code_id":"d2a25a39d9762a6cfca0b8fb4d3691f50c41af0b81f4c0ba00b653210504bad0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1051","problem_id":"p03362","slow_code_id":"cae5fce4661158d7faa613ce86a2ded57cbea8094ca90692b288eb269a3cded7","slow_id":"d2a25a39d9762a6cfca0b8fb4d3691f50c41af0b81f4c0ba00b653210504bad0","slow_time":0.3332756716,"speedup":2.091870467509094,"stratum":"2-4","sampling_key":"174c45f96f4ffd32bb99a3408fa1cd2b8551ddd015eb85422497ede6cc19e7c3","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nvector<int> calc(int n)\n\n{\n\n  const int sz = 55556;\n\n  vector<int> sieve(sz, 1);\n\n  sieve[0] = sieve[1] = 0;\n\n  for (int i = 2; i < (int)sieve.size(); ++i) {\n\n    for (int m = 2; i * m < sz; ++m) {\n\n      sieve[i * m] = 0;\n    }\n  }\n\n  int cnt = 0;\n\n  vector<int> ret;\n\n  for (int i = 2; i < (int)sieve.size() && cnt < n; ++i) {\n\n    if (sieve[i] && (i % 5 == 1)) {\n\n      ++cnt;\n\n      ret.push_back(i);\n    }\n  }\n\n  return ret;\n}\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  vector<int> p = calc(n);\n\n  copy(p.begin(), p.end(), ostream_iterator<int>(cout, \" \"));\n\n  printf(\"\\n\");\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int INF = 1000000000;\n\nvoid sieve(vector<int> &primes)\n\n{\n\n  int n = primes.size();\n\n  primes[0] = primes[1] = 0;\n\n  for (int i = 2; i * i < n; ++i) {\n\n    if (not primes[i]) {\n      continue;\n    }\n\n    for (int j = i * i; j < n; j += i) {\n\n      primes[j] = 0;\n    }\n  }\n}\n\nint main()\n\n{\n\n  int N;\n  scanf(\"%d\", &N);\n\n  int upper = 55555;\n\n  vector<int> primes(upper + 5, 1);\n\n  sieve(primes);\n\n  int cnt = 0;\n\n  vector<int> ans;\n\n  for (int p = 2; p <= 55555; ++p) {\n\n    if (primes[p] and (p % 5) == 1) {\n\n      ans.push_back(p);\n\n      if (++cnt == N) {\n        break;\n      }\n    }\n  }\n\n  printf(\"%d\", ans[0]);\n\n  for (int i = 1; i < N; ++i) {\n\n    printf(\" %d\", ans[i]);\n  }\n\n  printf(\"\\n\");\n\n  return 0;\n}\n"}
{"fast_code_id":"7868335e6bd3219cb60933b75e87b601cfc7dd91cabe7ebb91e792d579109ba9","fast_id":"606584b546256bd319712e420af9fa40a00cd43e260485006797f68c0680abd1","fast_time":0.0108315193,"language":"cpp","measured_fast_code_id":"606584b546256bd319712e420af9fa40a00cd43e260485006797f68c0680abd1","measured_slow_code_id":"1dc8f2d03912916593f7cbb1a1872f261fb7d65fbe67de240eed19cace5d6b68","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_108","problem_id":"p03440","slow_code_id":"4116ee63417236f0ad881f40abe62aff171a82cff42071138a94a0b3eca0b083","slow_id":"1dc8f2d03912916593f7cbb1a1872f261fb7d65fbe67de240eed19cace5d6b68","slow_time":0.3684096279,"speedup":34.012737982196086,"stratum":"8+","sampling_key":"018e09f292f4b70975823fa0104db8efb84a0b10a1c1cd3eaa03aca530dc1c0d","slow_code":"#include <bits/stdc++.h>\n\ntypedef long long LL;\n\nconst int MAXN = 1e5 + 5;\n\nint n, m, w[MAXN];\n\nstd::multiset<int> st[MAXN];\n\nstd::set<std::pair<int, int> > spec;\n\nint fa[MAXN], part;\n\nint Find(int x) { return fa[x] == x ? x : fa[x] = Find(fa[x]); }\n\nvoid merge(int u, int v) {\n\n  if (Find(u) == Find(v))\n    return;\n\n  if (st[fa[u]].size() > st[fa[v]].size())\n    std::swap(u, v);\n\n  --part;\n\n  for (int i : st[fa[u]]) {\n\n    st[fa[v]].insert(i);\n  }\n\n  st[fa[u]].clear();\n\n  if (!st[fa[v]].empty())\n    spec.insert(std::make_pair(st[fa[v]].size(), fa[v]));\n\n  fa[fa[u]] = fa[v];\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n  part = n;\n\n  for (int i = 0; i < n; ++i) {\n\n    fa[i] = i;\n\n    scanf(\"%d\", w + i);\n\n    st[i].insert(w[i]);\n\n    spec.insert(std::make_pair(1, i));\n  }\n\n  for (int i = 1; i <= m; ++i) {\n\n    static int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    spec.erase(spec.find(std::make_pair(st[Find(u)].size(), Find(u))));\n\n    spec.erase(spec.find(std::make_pair(st[Find(v)].size(), Find(v))));\n\n    merge(u, v);\n  }\n\n  LL ans = 0;\n\n  while (part > 1) {\n\n    if (spec.size() < 2) {\n\n      puts(\"Impossible\");\n\n      return 0;\n    }\n\n    auto x = *--spec.end();\n\n    spec.erase(--spec.end());\n\n    auto y = *--spec.end();\n\n    spec.erase(--spec.end());\n\n    int u = x.second, v = y.second;\n\n    ans += *st[Find(u)].begin() + *st[Find(v)].begin();\n\n    st[Find(u)].erase(st[Find(u)].begin());\n\n    st[Find(v)].erase(st[Find(v)].begin());\n\n    merge(u, v);\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define F(i, a, b) for (int i = (a); i <= (b); ++i)\n\nusing namespace std;\n\ntypedef long long ll;\n\nint n, m;\n\nint a[100001], b[100001], t;\n\nint fa[100001];\n\nint ff(int x) { return fa[x] ? fa[x] = ff(fa[x]) : x; }\n\nll Sum;\n\nint main() {\n\n  int x, y;\n\n  scanf(\"%d%d\", &n, &m);\n\n  if (m == n - 1)\n    return puts(\"0\"), 0;\n\n  F(i, 1, n) scanf(\"%d\", a + i), Sum += a[i];\n\n  F(i, 1, m) {\n\n    scanf(\"%d%d\", &x, &y);\n\n    x = ff(x + 1);\n    y = ff(y + 1);\n\n    Sum -= max(a[x], a[y]);\n\n    b[++t] = max(a[x], a[y]);\n\n    if (a[x] > a[y])\n      fa[x] = y;\n\n    else\n      fa[y] = x;\n  }\n\n  if (t < n - m - 2)\n    return puts(\"Impossible\"), 0;\n\n  sort(b + 1, b + t + 1);\n\n  F(i, 1, n - m - 2) Sum += b[i];\n\n  printf(\"%lld\", Sum);\n\n  return 0;\n}"}
{"fast_code_id":"884d8bc3b1937f4a297314bd0f1c6d3981d7bdcebae2d54bcabcec85864aca0b","fast_id":"b6e46d95ded4207bc8f61629dcdf87fd85b7be148f134139f3da5ab3f0e25759","fast_time":0.0055521326,"language":"cpp","measured_fast_code_id":"b6e46d95ded4207bc8f61629dcdf87fd85b7be148f134139f3da5ab3f0e25759","measured_slow_code_id":"fd0acee7f6769aa1467111dbe68902cdcda4a5722c2296fde97a7368453300c2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11033","problem_id":"p03294","slow_code_id":"b1efa96e45e94c78065ba0ba5c136b9cc9592a7e32a6eb6020c21931bdb89330","slow_id":"fd0acee7f6769aa1467111dbe68902cdcda4a5722c2296fde97a7368453300c2","slow_time":0.0291902943,"speedup":5.257492283235455,"stratum":"4-8","sampling_key":"0e8ab6631007c453c816d98c16ff519683d80b0b0a7263754f2b69bd46627d42","slow_code":"#include <iostream>\n\n#include <cstdio>\n\nusing namespace std;\n\nconst int maxn = 3010;\n\nint a[maxn];\n\nint main()\n\n{\n\n  int n;\n  scanf(\"%d\", &n);\n\n  int sum = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    int t;\n\n    scanf(\"%d\", &t);\n\n    sum += (t - 1);\n  }\n\n  printf(\"%d\\n\", sum);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\nll num[3010];\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%lld\", &num[i]);\n\n    num[i]--;\n  }\n\n  ll res = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    res += num[i];\n  }\n\n  printf(\"%lld\", res);\n\n  return 0;\n}\n"}
{"fast_code_id":"528533f6f0516a79d69199a44b59c106f354af65a750652bb44fbbd8c219cdfd","fast_id":"438d4fbd76a150c7d9621f288f2fdd3f0076a1d1fe24e9d76b9c50d9449a11d3","fast_time":0.0236401557,"language":"cpp","measured_fast_code_id":"438d4fbd76a150c7d9621f288f2fdd3f0076a1d1fe24e9d76b9c50d9449a11d3","measured_slow_code_id":"9cefd0600b965ca0ff9015734292d5200a2e7dc65b88a0ed012c7134477dae06","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11075","problem_id":"p02796","slow_code_id":"ff4271998ef8e29b730dc16d35d836f0f6edbeb81f9b14959ccef2609d7fe7f2","slow_id":"9cefd0600b965ca0ff9015734292d5200a2e7dc65b88a0ed012c7134477dae06","slow_time":0.1934895091,"speedup":8.18478150294078,"stratum":"8+","sampling_key":"11e645df4acf34c44962622f2086d581ab38218395f76b26d9db89ba6547e425","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  pair<int, int> XL[100000];\n\n  rep(i, N) {\n\n    int x, l;\n\n    cin >> x >> l;\n\n    XL[i] = mp(x + l, x - l);\n  }\n\n  sort(XL, XL + N);\n\n  int mae = -2e9;\n\n  int kotae = 0;\n\n  rep(i, N) {\n\n    if (mae <= XL[i].second) {\n\n      kotae++;\n\n      mae = XL[i].first;\n    }\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nvoid pakuri_sort(int N, ll A[]) {\n\n  const int b = 8;\n\n  ll tmp[100001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n  }\n}\n\nint main() {\n\n  int N = getint();\n\n  ll XL[100000];\n\n  const ll k = 1e9;\n\n  rep(i, N) {\n\n    int x = getint(), l = getint();\n\n    XL[i] = (x - l + k << 32) + x + l;\n  }\n\n  pakuri_sort(N, XL);\n\n  ll mae = -2e9;\n\n  int kotae = 0;\n\n  const ll m = (1ll << 32) - 1;\n\n  rep(i, N) {\n\n    if (mae <= (XL[i] >> 32) - k) {\n\n      kotae++;\n\n      mae = XL[i] & m;\n    }\n  }\n\n  printf(\"%d\\n\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"434b8b759e506915f6656050976a4c8b332ddbd56da7ecab8a81a03b26079fb4","fast_id":"b0b88cb2733513cdb828cb277e978d9be413e4c3a12fb8e9845cf213e3944347","fast_time":0.1050834716,"language":"cpp","measured_fast_code_id":"b0b88cb2733513cdb828cb277e978d9be413e4c3a12fb8e9845cf213e3944347","measured_slow_code_id":"e7ab9fce74c66c34b2e177f0b152249cbf43bc74a7b1088af372a25ad442637b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11141","problem_id":"p02373","slow_code_id":"3e2f8c3b96ec27ab48bb517c43a4223b2de33b82ad86a4a0c46dbf94c6c244f0","slow_id":"e7ab9fce74c66c34b2e177f0b152249cbf43bc74a7b1088af372a25ad442637b","slow_time":0.4102151579,"speedup":3.9037077063982344,"stratum":"2-4","sampling_key":"01b66d7489b262b7d7f9afa23ee85ffae75c14b231db576fb68b5dd3236da9bc","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <map>\n\n#include <string.h>\n\n#include <algorithm>\n\n#define P pair<int, int>\n\n#define INF (1 << 30)\n\nusing namespace std;\n\nvector<int> Ind(100010);\n\nvector<bool> f(100010, false);\n\nvector<vector<int>> T(100010);\n\nvector<P> ET;\n\nvoid dfs(int n, int dep) {\n\n  f[n] = true;\n\n  ET.emplace_back(make_pair(dep, n));\n\n  Ind[n] = ET.size() - 1;\n\n  for (int next : T[n]) {\n\n    if (f[next] == true)\n      continue;\n\n    dfs(next, dep + 1);\n\n    ET.emplace_back(make_pair(dep, n));\n  }\n}\n\nP RMQ(int a, int b, int k, int l, int r, vector<P> &node) {\n\n  if (r <= a || b <= l) {\n    return P(INF, INF);\n  }\n\n  if (a <= l && r <= b)\n    return node[k];\n\n  P vl = RMQ(a, b, 2 * k + 1, l, (l + r) / 2, node);\n\n  P vr = RMQ(a, b, 2 * k + 2, (l + r) / 2, r, node);\n\n  return min(vl, vr);\n}\n\nint main() {\n\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  int n_;\n  cin >> n_;\n\n  for (int i = 0; i < n_; i++) {\n\n    int k;\n    cin >> k;\n\n    for (int j = 0; j < k; j++) {\n\n      int c;\n      cin >> c;\n\n      T[i].emplace_back(c);\n\n      T[c].emplace_back(i);\n    }\n  }\n\n  dfs(0, 0);\n\n  n_ = ET.size();\n\n  int n = 1;\n\n  while (n < n_)\n    n *= 2;\n\n  vector<P> node(2 * n - 1, P(INF, INF));\n\n  for (int i = 0; i < n_; i++) {\n    node[n - 1 + i] = ET[i];\n  }\n\n  for (int i = n - 2; i >= 0; i--) {\n    node[i] = min(node[2 * i + 1], node[2 * i + 2]);\n  }\n\n  int q;\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n\n    int u, v;\n    cin >> u >> v;\n\n    int a = Ind[u], b = Ind[v];\n\n    if (a > b) {\n      swap(a, b);\n    }\n\n    if (a == b) {\n      cout << u << endl;\n      continue;\n    }\n\n    cout << RMQ(a, b, 0, 0, n, node).second << endl;\n  }\n}","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\n#define INF 1 << 30\n\n#define LINF 1LL << 60\n\nclass LCA {\n\npublic:\n  ll V;\n\n  vector<vector<ll>> T;\n\n  vector<pll> ET;\n\n  vector<int> visited;\n\n  vector<ll> Ind;\n\n  ll N;\n\n  vector<pll> node;\n\n  LCA(ll V) : V(V) {\n\n    T.resize(V);\n    Ind.resize(V);\n  }\n\n  void add_edge(ll u, ll v) {\n\n    T[u].emplace_back(v);\n\n    T[v].emplace_back(u);\n  }\n\n  void fit() {\n\n    visited.clear();\n    visited.assign(V, 0);\n\n    dfs(0, 0);\n\n    ll N_ = ET.size();\n\n    N = 1;\n\n    while (N < N_)\n      N *= 2;\n\n    node.clear();\n    node.assign(2 * N - 1, make_pair(INF, INF));\n\n    for (int i = 0; i < N_; i++)\n      node[N - 1 + i] = ET[i];\n\n    for (int k = N - 2; k >= 0; k--)\n      node[k] = min(node[2 * k + 1], node[2 * k + 2]);\n  }\n\n  void dfs(ll n, ll dep) {\n\n    visited[n] = 1;\n\n    ET.emplace_back(make_pair(dep, n));\n\n    Ind[n] = (int)ET.size() - 1;\n\n    for (auto next : T[n]) {\n\n      if (visited[next] == 1)\n        continue;\n\n      dfs(next, dep + 1);\n\n      ET.emplace_back(make_pair(dep, n));\n    }\n  }\n\n  pll RMQ(ll a, ll b) { return RMQ(a, b, 0, 0, N); }\n\n  pll RMQ(ll a, ll b, ll k, ll l, ll r) {\n\n    if (r <= a || b <= l)\n      return make_pair(INF, INF);\n\n    if (a <= l && r <= b)\n      return node[k];\n\n    auto vl = RMQ(a, b, 2 * k + 1, l, (l + r) / 2);\n\n    auto vr = RMQ(a, b, 2 * k + 2, (l + r) / 2, r);\n\n    return min(vl, vr);\n  }\n\n  ll solve(ll s, ll t) {\n\n    ll idx1 = Ind[s], idx2 = Ind[t];\n\n    if (idx1 > idx2)\n      swap(idx1, idx2);\n\n    return RMQ(idx1, idx2 + 1).second;\n  }\n};\n\nint main(void) {\n\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  ll n;\n  cin >> n;\n\n  LCA lca(n);\n\n  for (int i = 0; i < n; i++) {\n\n    ll k;\n    cin >> k;\n\n    for (int j = 0; j < k; j++) {\n\n      ll c;\n      cin >> c;\n\n      lca.add_edge(i, c);\n    }\n  }\n\n  lca.fit();\n\n  ll q;\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n\n    ll u, v;\n    cin >> u >> v;\n\n    cout << lca.solve(u, v) << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"1cf3aa9c851cf40249a007ead37a63aa2a011f05eebe380e279fd6dcca65f570","fast_id":"d38ff829217f893214f20364cd88c7bc0e7810d3cdef9ce1ad4f64ae2b2db4cd","fast_time":0.1078374823,"language":"cpp","measured_fast_code_id":"d38ff829217f893214f20364cd88c7bc0e7810d3cdef9ce1ad4f64ae2b2db4cd","measured_slow_code_id":"7405d61b472e468886b08ee4a51201c86388887d1351a55c86dbb59137a9767c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11144","problem_id":"p03740","slow_code_id":"fabf8e8835ffd192327d2424d56c3aa2d0580f42c5a84eda81880adcd7a0cbbe","slow_id":"7405d61b472e468886b08ee4a51201c86388887d1351a55c86dbb59137a9767c","slow_time":0.6750366546,"speedup":6.259759039274232,"stratum":"4-8","sampling_key":"f1ae725909d7a4e7d06d789bf9052dffda1e0b7aac4c6e782fb1325350d29b9e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define repr(i, a, b) for (int i = a; i < b; i++)\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)\n\n#define reprev(i, n) reprrev(i, 0, n)\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\nconst ll mod = 1e9 + 7;\n\nvoid chmod(ll &M) {\n\n  if (M >= mod)\n    M %= mod;\n\n  else if (M < 0) {\n\n    M += (abs(M) / mod + 1) * mod;\n\n    M %= mod;\n  }\n}\n\nint getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };\n\nint getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };\n\nvector<vector<int>> memo(1110, vector<int>(1110, -1));\n\nint rec(int x, int y) {\n\n  if (memo[x][y] != -1)\n    return memo[x][y];\n\n  if (x <= 1 && y <= 1)\n    return memo[x][y] = 0;\n\n  int ans = 0;\n\n  for (int i = 1; 2 * i <= x; ++i)\n    if (!rec(x - 2 * i, y + i))\n      ans = 1;\n\n  for (int i = 1; 2 * i <= y; ++i)\n    if (!rec(x + i, y - 2 * i))\n      ans = 1;\n\n  return memo[x][y] = ans;\n}\n\nint main(void) {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  ll x, y;\n  cin >> x >> y;\n\n  if (x <= 1 && y <= 1)\n    cout << \"Brown\\n\";\n\n  else if (abs(x - y) <= 1)\n    cout << \"Brown\\n\";\n\n  else\n    cout << \"Alice\\n\";\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define repr(i, a, b) for (int i = a; i < b; i++)\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)\n\n#define reprev(i, n) reprrev(i, 0, n)\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\nconst ll mod = 1e9 + 7;\n\nvoid chmod(ll &M) {\n\n  if (M >= mod)\n    M %= mod;\n\n  else if (M < 0) {\n\n    M += (abs(M) / mod + 1) * mod;\n\n    M %= mod;\n  }\n}\n\nll modpow(ll x, ll n) {\n\n  if (n == 0)\n    return 1;\n\n  ll res = modpow(x, n / 2);\n\n  if (n % 2 == 0)\n    return res * res % mod;\n\n  else\n    return res * res % mod * x % mod;\n}\n\nint getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };\n\nint getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };\n\ndouble argument(const pair<double, double> &a, const pair<double, double> &b) {\n\n  double ax = a.first, ay = a.second, bx = b.first, by = b.second;\n\n  return atan2(by - ay, bx - ax);\n}\n\nint main() {\n\n  cin.tie(nullptr);\n\n  ios::sync_with_stdio(false);\n\n  ll x, y;\n  cin >> x >> y;\n\n  cout << (abs(x - y) <= 1 ? \"Brown\\n\" : \"Alice\\n\");\n\n  return 0;\n}"}
{"fast_code_id":"87f6c0d52238ea1a1e2fdbe7f6e5d1c8c6b61198bcb9705beb7170b0462411ca","fast_id":"2bd865bcfd883b7b18ded1b983de578c0bbb2d72a83476588ab03a01ce16a276","fast_time":0.1055962571,"language":"cpp","measured_fast_code_id":"2bd865bcfd883b7b18ded1b983de578c0bbb2d72a83476588ab03a01ce16a276","measured_slow_code_id":"872bf32630e90398de2463898c7ff05476043ffbfaee9ff9b8ab8740a5117816","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11146","problem_id":"p02328","slow_code_id":"7cdf246ef6e6b1785026c5d63a698dbe40c6b9b3a778b63d4506f0d62c34eedb","slow_id":"872bf32630e90398de2463898c7ff05476043ffbfaee9ff9b8ab8740a5117816","slow_time":0.4000786432,"speedup":3.7887578043710795,"stratum":"2-4","sampling_key":"3da0dfb1d6e9f788a4055968c8d66ae86b5c6944b3d29bafbc9793f039b981b2","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 1 << 17;\n\nconst ll INF = (1e9) + 10;\n\nclass RMQ {\n\npublic:\n  ll n, dat[2 * N - 1];\n\n  RMQ() {\n\n    n = N;\n\n    for (int i = 0; i < 2 * n - 1; i++)\n      dat[i] = INF;\n  }\n\n  void update(int k, ll a) {\n\n    k += n - 1;\n\n    dat[k] = a;\n\n    while (k > 0) {\n\n      k = (k - 1) / 2;\n\n      dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);\n    }\n  }\n\n  ll query(int a, int b, int k = 0, int l = 0, int r = N) {\n\n    if (r <= a || b <= l)\n      return INF;\n\n    if (a <= l && r <= b)\n      return dat[k];\n\n    ll vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\n    ll vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\n    return min(vl, vr);\n  }\n};\n\nll n, A[N];\n\nvector<int> Idx;\n\nll L[N], R[N];\n\nvoid calc(ll arr[]) {\n\n  RMQ rmq;\n\n  for (int i = 0; i < n; i++) {\n\n    int idx = lower_bound(Idx.begin(), Idx.end(), A[i]) - Idx.begin();\n\n    ll val = -rmq.query(0, idx);\n\n    if (val == -INF)\n      val = -1;\n\n    arr[i] = i - val - 1;\n\n    rmq.update(idx, -i);\n  }\n}\n\nint main() {\n\n  cin >> n;\n\n  Idx.resize(n);\n\n  for (int i = 0; i < n; i++)\n    cin >> A[i], Idx[i] = A[i];\n\n  sort(Idx.begin(), Idx.end());\n\n  Idx.erase(unique(Idx.begin(), Idx.end()), Idx.end());\n\n  calc(L);\n\n  reverse(A, A + n);\n\n  calc(R);\n\n  reverse(A, A + n);\n\n  ll ans = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    ll w = L[i] + R[n - 1 - i] + 1;\n\n    ans = max(ans, w * A[i]);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define int long long\n\n#define N 200000\n\nusing namespace std;\n\nint n;\n\nstruct dat {\n  int h, i;\n};\n\nint calc(int A[]) {\n\n  stack<dat> S;\n\n  int res = 0;\n\n  for (int i = 0; i <= n; i++) {\n\n    int h = A[i];\n\n    if (S.empty() || S.top().h < h)\n      S.push((dat){h, i});\n\n    else if (S.top().h > h) {\n\n      int ni = i;\n\n      while (!S.empty() && S.top().h > h) {\n\n        dat t = S.top();\n        S.pop();\n\n        ni = t.i;\n\n        int area = (i - t.i) * t.h;\n\n        res = max(res, area);\n      }\n\n      res = max(res, (i - ni) * h);\n\n      S.push((dat){h, ni});\n    }\n  }\n\n  return res;\n}\n\nint A[N];\n\nsigned main() {\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n    cin >> A[i];\n\n  cout << calc(A) << endl;\n\n  return 0;\n}"}
{"fast_code_id":"b5c717a50a3200a22ef4297847b69bc9076e5fc4f30ccb19d7e8bdac8b85decd","fast_id":"b08a9c3cd7bdcbc6290c3cb45f98281d5b3b6c22063c84514c562eceeebfa37f","fast_time":0.0554472115,"language":"cpp","measured_fast_code_id":"b08a9c3cd7bdcbc6290c3cb45f98281d5b3b6c22063c84514c562eceeebfa37f","measured_slow_code_id":"78ad2998d59e62275c1ab24a70fdc83b5194c9276e98b0875730c4e6162b3593","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11148","problem_id":"p01980","slow_code_id":"d27e54e2795f29cb2fd92c0dd26e1375b94549144ae2bda0835fff054a75ca16","slow_id":"78ad2998d59e62275c1ab24a70fdc83b5194c9276e98b0875730c4e6162b3593","slow_time":0.1691749419,"speedup":3.05109918647577,"stratum":"2-4","sampling_key":"1e30ece7b4368638e99ce86745e8e552422fa893a200a78092a9a4607d623182","slow_code":"\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <string>\n\n#include <cstring>\n\n#include <deque>\n\n#include <list>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <utility>\n\n#include <algorithm>\n\n#include <map>\n\n#include <set>\n\n#include <complex>\n\n#include <cmath>\n\n#include <limits>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <ctime>\n\n#include <cassert>\n\n#include <numeric>\n\n#include <fstream>\n\n#include <functional>\n\nusing namespace std;\n\n#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)\n\n#define repq(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)\n\n#define repr(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)\n\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n\n#define int long long int\n\ntemplate <typename T> void chmax(T &a, T b) { a = max(a, b); }\n\ntemplate <typename T> void chmin(T &a, T b) { a = min(a, b); }\n\ntemplate <typename T> void chadd(T &a, T b) { a = a + b; }\n\ntypedef pair<int, int> pii;\n\ntypedef long long ll;\n\nint dx[] = {0, 0, 1, -1};\n\nint dy[] = {1, -1, 0, 0};\n\nconst ll INF = 1001001001001001LL;\n\nconst ll MOD = 1000000007LL;\n\nstruct Query {\n\n  int day, lhs, rhs, mode, idx;\n\n  bool operator<(const Query &q) const {\n\n    if (day != q.day)\n      return day < q.day;\n\n    return mode < q.mode;\n  }\n};\n\nconst int SIZE = 1 << 17;\n\ntemplate <typename T>\n\nstruct segtree {\n\n  T node[2 * SIZE], I;\n\n  T (*upd_f)(T, T), (*qry_f)(T, T);\n\n  segtree(T (*op1)(T, T), T (*op2)(T, T), T X) {\n\n    upd_f = op1;\n\n    qry_f = op2;\n\n    I = X;\n\n    fill(node, node + 2 * SIZE, I);\n  }\n\n  void init(vector<T> vec) {\n\n    int N = (int)vec.size();\n\n    for (int i = 0; i < N; i++) {\n\n      node[SIZE - 1 + i] = vec[i];\n    }\n\n    for (int i = SIZE - 2; i >= 0; i--) {\n\n      node[i] = qry_f(node[2 * i + 1], node[2 * i + 2]);\n    }\n  }\n\n  void update(int idx, T val) {\n\n    idx += SIZE - 1;\n\n    node[idx] = upd_f(node[idx], val);\n\n    while (idx > 0) {\n\n      idx = (idx - 1) / 2;\n\n      node[idx] = qry_f(node[2 * idx + 1], node[2 * idx + 2]);\n    }\n  }\n\n  T query(int a, int b, int l = 0, int r = SIZE, int k = 0) {\n\n    if (b <= l || r <= a)\n      return I;\n\n    if (a <= l && r <= b)\n      return node[k];\n\n    int mid = (l + r) / 2;\n\n    T vl = query(a, b, l, mid, 2 * k + 1);\n\n    T vr = query(a, b, mid, r, 2 * k + 2);\n\n    return qry_f(vl, vr);\n  }\n};\n\nint upd(int a, int b) { return max(a, b); }\n\nint fnd(int a, int b) { return max(a, b); }\n\nsegtree<int> seg(upd, fnd, -1);\n\nsigned main() {\n\n  int N, M, Q;\n  cin >> N >> M >> Q;\n\n  vector<Query> querys;\n\n  for (int i = 0; i < M; i++) {\n\n    int D, A, B;\n    cin >> D >> A >> B;\n\n    querys.push_back(Query{D, A, B, 2, -1});\n  }\n\n  for (int i = 0; i < Q; i++) {\n\n    int E, S, T;\n    cin >> E >> S >> T;\n\n    querys.push_back(Query{E, S, T, 1, i});\n  }\n\n  vector<string> ans(Q);\n\n  sort(querys.begin(), querys.end());\n\n  for (int i = 0; i < M + Q; i++) {\n\n    if (querys[i].mode == 1) {\n\n      int val = seg.query(0, querys[i].lhs + 1);\n\n      while (1) {\n\n        int tmp = seg.query(0, val + 1);\n\n        if (tmp <= val)\n          break;\n\n        val = tmp;\n      }\n\n      if (val >= querys[i].rhs || querys[i].lhs >= querys[i].rhs) {\n\n        ans[querys[i].idx] = \"Yes\";\n\n      }\n\n      else {\n\n        ans[querys[i].idx] = \"No\";\n      }\n\n      seg.update(querys[i].lhs, val);\n\n    }\n\n    else {\n\n      int idx = querys[i].lhs, val = querys[i].rhs;\n\n      seg.update(idx, val);\n    }\n  }\n\n  for (int i = 0; i < Q; i++) {\n\n    cout << ans[i] << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define all(v) (v).begin(), (v).end()\n\n#define resz(v, ...) (v).clear(), (v).resize(__VA_ARGS__)\n\n#define reps(i, m, n) for (int i = (int)(m); i < (int)(n); i++)\n\n#define rep(i, n) reps(i, 0, n)\n\ntemplate <class T1, class T2> void chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <class T1, class T2> void chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\nusing Pi = pair<int, int>;\n\nusing Tapris = tuple<int, int, int, int, int>;\n\nusing vint = vector<int>;\n\nconst int inf = 1LL << 55;\n\nconst int mod = 1e9 + 7;\n\nstruct SegmentTree {\n\n  vint data;\n\n  vint lazy;\n\n  int sz;\n\n  SegmentTree(int n) {\n\n    sz = 1;\n    while (sz < n)\n      sz *= 2;\n\n    resz(data, 2 * sz - 1);\n\n    rep(i, sz) data[i + sz - 1] = i + 1;\n\n    for (int i = sz - 2; i >= 0; --i) {\n\n      data[i] = max(data[2 * i + 1], data[2 * i + 2]);\n    }\n\n    resz(lazy, 2 * sz - 1, -1);\n  }\n\n  void push(int k, int l, int r) {\n\n    if (~lazy[k]) {\n\n      chmax(data[k], lazy[k]);\n\n      if (r - l > 1) {\n\n        chmax(lazy[2 * k + 1], lazy[k]);\n\n        chmax(lazy[2 * k + 2], lazy[k]);\n      }\n\n      lazy[k] = -1;\n    }\n  }\n\n  void update(int a, int b, int x, int k, int l, int r) {\n\n    push(k, l, r);\n\n    if (r <= a || b <= l)\n      return;\n\n    if (a <= l && r <= b) {\n\n      chmax(lazy[k], x);\n\n      push(k, l, r);\n\n      return;\n    }\n\n    update(a, b, x, 2 * k + 1, l, (l + r) / 2);\n\n    update(a, b, x, 2 * k + 2, (l + r) / 2, r);\n\n    data[k] = max(data[2 * k + 1], data[2 * k + 2]);\n  }\n\n  void update(int a, int b, int x) { update(a, b, x, 0, 0, sz); }\n\n  int query(int a, int b, int k, int l, int r) {\n\n    push(k, l, r);\n\n    if (r <= a || b <= l)\n      return -1;\n\n    if (a <= l && r <= b)\n      return data[k];\n\n    int vl = query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n    int vr = query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n    return max(vl, vr);\n  }\n\n  int query(int a, int b) { return query(a, b, 0, 0, sz); }\n};\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios_base::sync_with_stdio(0);\n\n  cout << fixed << setprecision(12);\n\n  int n, m, q;\n\n  cin >> n >> m >> q;\n\n  vint d(m), a(m), b(m);\n\n  rep(i, m) cin >> d[i] >> a[i] >> b[i], --a[i];\n\n  vint e(q), s(q), t(q);\n\n  rep(i, q) cin >> e[i] >> s[i] >> t[i], --s[i];\n\n  vector<Tapris> vec;\n\n  rep(i, m) vec.emplace_back(d[i], 1, a[i], b[i], i);\n\n  rep(i, q) vec.emplace_back(e[i], 0, s[i], t[i], i);\n\n  sort(all(vec));\n\n  SegmentTree seg(n);\n\n  vector<string> ans(q);\n\n  rep(i, vec.size()) {\n\n    int v, w, x, y, z;\n\n    tie(v, w, x, y, z) = vec[i];\n\n    if (w == 0) {\n\n      if (x + 1 >= y) {\n\n        ans[z] = \"Yes\";\n\n        continue;\n      }\n\n      int mr = seg.query(x, x + 1);\n\n      int tmp = seg.query(x, mr);\n\n      while (mr != tmp) {\n\n        mr = tmp;\n\n        tmp = seg.query(x, mr);\n      }\n\n      ans[z] = (mr >= y ? \"Yes\" : \"No\");\n\n      seg.update(x, mr, mr);\n\n    } else {\n\n      seg.update(x, y, y);\n    }\n  }\n\n  rep(i, ans.size()) cout << ans[i] << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"15db54d9dac4868fbc1fb0017dcc8fe4674b7be2a9054d2fbba463f11c04314e","fast_id":"65750488906e8dce6b425a5a2708438516c3178ecf66e9d1bc0308254c4f340d","fast_time":0.105519148,"language":"cpp","measured_fast_code_id":"65750488906e8dce6b425a5a2708438516c3178ecf66e9d1bc0308254c4f340d","measured_slow_code_id":"c9bb14ba03272e52bbc0591ec870bcfccce933da047fb0e740794c9d3e41d14b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11359","problem_id":"p03330","slow_code_id":"76281808a2d90a37836c09831273dec1654b8a43ff81b845cd008276342f98a9","slow_id":"c9bb14ba03272e52bbc0591ec870bcfccce933da047fb0e740794c9d3e41d14b","slow_time":0.3303332481,"speedup":3.1305526471839973,"stratum":"2-4","sampling_key":"8322b91e1d804cd1dd8a8566b52ad1bfe4682e14fbf0c7f248fdd26f74c63f49","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nusing int64 = int64_t;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\n#define print(x) cout << (x) << '\\n'\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  int n, c;\n  cin >> n >> c;\n\n  int64 D[40][40] = {};\n\n  int64 C[510][510] = {};\n\n  rep(i, c) { rep(j, c) cin >> D[i][j]; }\n\n  rep(i, n) { rep(j, n) cin >> C[i][j]; }\n\n  int sum0[40] = {}, sum1[40] = {}, sum2[40] = {};\n\n  for (int i = 1; i <= c; ++i) {\n\n    for (int j = 0; j < n; ++j) {\n\n      for (int k = 0; k < n; ++k) {\n\n        if ((j + k) % 3 == 0) {\n\n          sum0[i] += D[C[j][k] - 1][i - 1];\n\n        }\n\n        else if ((j + k) % 3 == 1) {\n\n          sum1[i] += D[C[j][k] - 1][i - 1];\n\n        }\n\n        else if ((j + k) % 3 == 2) {\n\n          sum2[i] += D[C[j][k] - 1][i - 1];\n        }\n      }\n    }\n  }\n\n  int ans = 1e9;\n\n  for (int i = 1; i <= c; ++i) {\n\n    for (int j = 1; j <= c; ++j) {\n\n      for (int k = 1; k <= c; ++k) {\n\n        if (i != j && j != k && k != i) {\n\n          ans = min(ans, sum0[i] + sum1[j] + sum2[k]);\n        }\n      }\n    }\n  }\n\n  print(ans);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\ninline void fastin(int &num) {\n\n  int c;\n\n  num = 0;\n\n  c = getchar_unlocked();\n\n  for (; (c > 47 && c < 58); c = getchar_unlocked())\n    num = (num << 3) + (num << 1) + c - 48;\n}\n\ninline void fastout(int n) {\n\n  int N = n, rev, count = 0;\n\n  rev = N;\n\n  if (N == 0) {\n    putchar_unlocked('0');\n    putchar_unlocked('\\n');\n    return;\n  }\n\n  while ((rev % 10) == 0) {\n    ++count;\n    rev /= 10;\n  }\n\n  rev = 0;\n\n  while (N != 0) {\n    rev = (rev << 3) + (rev << 1) + N % 10;\n    N /= 10;\n  }\n\n  while (rev != 0) {\n    putchar_unlocked(rev % 10 + '0');\n    rev /= 10;\n  }\n\n  while (count--)\n    putchar_unlocked('0');\n}\n\nint main() {\n\n  int n, c;\n  fastin(n);\n  fastin(c);\n\n  int D[40][40];\n\n  int C[510][510];\n\n  for (int i = 0; i < c; ++i) {\n\n    for (int j = 0; j < c; ++j)\n      fastin(D[i][j]);\n  }\n\n  for (int i = 0; i < n; ++i) {\n\n    for (int j = 0; j < n; ++j)\n      fastin(C[i][j]);\n  }\n\n  int sum0[40] = {}, sum1[40] = {}, sum2[40] = {};\n\n  for (int i = 1; i <= c; ++i) {\n\n    for (int j = 0; j < n; ++j) {\n\n      for (int k = 0; k < n; ++k) {\n\n        if ((j + k) % 3 == 0) {\n\n          sum0[i] += D[C[j][k] - 1][i - 1];\n\n        }\n\n        else if ((j + k) % 3 == 1) {\n\n          sum1[i] += D[C[j][k] - 1][i - 1];\n\n        }\n\n        else if ((j + k) % 3 == 2) {\n\n          sum2[i] += D[C[j][k] - 1][i - 1];\n        }\n      }\n    }\n  }\n\n  int ans = 1e9;\n\n  for (int i = 1; i <= c; ++i) {\n\n    for (int j = 1; j <= c; ++j) {\n\n      for (int k = 1; k <= c; ++k) {\n\n        if (i != j && j != k && k != i) {\n\n          ans = min(ans, sum0[i] + sum1[j] + sum2[k]);\n        }\n      }\n    }\n  }\n\n  fastout(ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"447e9248211fcd4085a7df5f57f24c9f8324960a4ffa89a7fbd9789cd31d7d45","fast_id":"1a00c16d648ab0bd4b1422fc6a1e49abec44fce7dee6168daa28ce4722809705","fast_time":0.1049263575,"language":"cpp","measured_fast_code_id":"1a00c16d648ab0bd4b1422fc6a1e49abec44fce7dee6168daa28ce4722809705","measured_slow_code_id":"90078b49849536552f1006837c319e0b7e53ee991655247c5c3186c873286b94","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11368","problem_id":"p02607","slow_code_id":"987d72f1326f7b5a0c11c74fa7538036f65b03dc0f66d563ce5bd9c20f8e6828","slow_id":"90078b49849536552f1006837c319e0b7e53ee991655247c5c3186c873286b94","slow_time":0.2760025871,"speedup":2.6304409461655047,"stratum":"2-4","sampling_key":"13b8a0ea67f1a26989b17bc33664e5814127bdc3000be4db330a7c4245cce2e0","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define oo (long long)1e18\n\n#define ll long long\n\n#define setdp memset(dp, -1, sizeof(dp))\n\nconst ll mod = 1e9 + 7;\n\nvoid _IOS() {\n  ios::sync_with_stdio(0);\n  cin.tie(0);\n  cout.tie(0);\n  cin.sync_with_stdio(0);\n}\n\n#define PI 3.14159265359\n\nint n, l, r, x;\n\nvector<int> b(200009), a(200009);\n\nint main()\n\n{\n\n  cin >> n;\n\n  int ans = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> a[i];\n\n    if (i & 1 && a[i] & 1)\n\n      ans++;\n  }\n\n  cout << ans;\n}\n","fast_code":"#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n, j = 1, c = 0;\n\n  cin >> n;\n\n  int a[n];\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n\n    if (a[i] % 2 != 0 && j % 2 != 0)\n\n      c = c + 1;\n\n    j = j + 1;\n  }\n\n  cout << c << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"8777cab31281f569aa6603544836662c10b9338878c93c743049304bb0221bfe","fast_id":"a7cf5602153cc57d258f0363bb0f5ea6dcc5d38b5eeaf54b3e0c9b91a0a27a11","fast_time":0.0093044417,"language":"cpp","measured_fast_code_id":"a7cf5602153cc57d258f0363bb0f5ea6dcc5d38b5eeaf54b3e0c9b91a0a27a11","measured_slow_code_id":"3b89a72643d86901303962ba4f52ccb5a1507bb51746673e952b72dedcd6fd7b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11394","problem_id":"p03842","slow_code_id":"4fef653961bb12940b3446b79c443a5d3ab512919c2eeb7f811d390b816e60c2","slow_id":"3b89a72643d86901303962ba4f52ccb5a1507bb51746673e952b72dedcd6fd7b","slow_time":0.0614669501,"speedup":6.6061943404943895,"stratum":"4-8","sampling_key":"031dc0b5459e13523f08d645d5e5ef8ff88aca77273007793b61d6d252d8a578","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\nusing namespace std;\n\nint p1[110000], p2[110000];\n\nint a[110000];\n\nint lb[110000];\n\ninline void jio() {\n  puts(\"0\");\n  exit(0);\n}\n\nbool lowb[110000];\n\nlong long ff[110000];\n\nint ljrose[110000];\n\nlong long renleizhihui[110000];\n\nint main()\n\n{\n\n  int n;\n  scanf(\"%d\", &n);\n\n  memset(p1, 0, sizeof(p1));\n\n  memset(p2, 0, sizeof(p2));\n\n  int lben = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n\n    if (a[i] < 1 || a[i] > n)\n      jio();\n\n    if (a[i] == i)\n      lb[++lben] = i;\n\n    if (p1[a[i]] == 0)\n      p1[a[i]] = i;\n\n    else if (p2[a[i]] == 0)\n      p2[a[i]] = i;\n\n    else\n      jio();\n  }\n\n  int ss = 0;\n\n  memset(lowb, false, sizeof(lowb));\n\n  for (int i = 1; i <= lben; i++)\n\n  {\n\n    lowb[lb[i]] = true;\n\n    if (p1[lb[i]] != lb[i])\n      p1[lb[i]] ^= p2[lb[i]] ^= p1[lb[i]] ^= p2[lb[i]];\n\n    if (p2[lb[i]] != 0)\n      lowb[p2[lb[i]]] = true;\n\n    if (p2[lb[i]] == 0)\n      ss++;\n\n    else if (p1[p2[lb[i]]] != 0)\n      jio();\n  }\n\n  long long lbsl = 1;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int xx = 0, yy = 0;\n\n    long long s = 2;\n\n    if (p2[i] != 0 && lowb[i] == false)\n\n    {\n\n      lowb[i] = true;\n\n      xx = p1[i];\n      yy = p2[i];\n\n      lowb[xx] = lowb[yy] = true;\n\n      while (true)\n\n      {\n\n        if (yy > 0)\n\n        {\n\n          int xr = xx, yr = yy;\n\n          if (p2[xr] != 0 && p1[yr] != 0)\n            jio();\n\n          if (p1[xr] != 0 && p2[yr] != 0)\n            jio();\n\n          if (p1[xr] != 0 && p1[yr] != 0)\n            xx = p1[xr], yy = p1[yr];\n\n          else if (p2[xr] != 0)\n            xx = p1[xr], yy = p2[xr];\n\n          else if (p2[yr] != 0)\n            xx = p1[yr], yy = p2[yr];\n\n          else if (p1[xr] != 0)\n            xx = p1[xr], yy = 0;\n\n          else if (p1[yr] != 0)\n            xx = p1[yr], yy = 0;\n\n          else\n            xx = yy = 0;\n\n        }\n\n        else\n\n        {\n\n          int xr = xx;\n\n          if (p2[xr] != 0)\n            xx = p1[xr], yy = p2[xr], s = s * 2 % 1000000007;\n\n          else if (p1[xr] != 0)\n            xx = p1[xr], yy = 0;\n\n          else\n            xx = yy = 0;\n        }\n\n        lowb[xx] = lowb[yy] = true;\n\n        if (xx == 0 && yy == 0)\n          jio();\n\n        if (xx == i || yy == i)\n\n        {\n\n          if (yy == i)\n            xx ^= yy ^= xx ^= yy;\n\n          if (yy == 0)\n            break;\n\n          if (p1[yy] != 0)\n            jio();\n\n          else\n\n          {\n\n            if (s % 2 == 0)\n              s = s / 2;\n\n            else\n              s = (s + 1000000007) / 2;\n\n            break;\n          }\n        }\n      }\n\n      lbsl = lbsl * s % 1000000007;\n    }\n  }\n\n  ff[0] = 1;\n  ff[1] = 1;\n  ff[2] = 2;\n\n  for (int i = 3; i <= n; i++)\n    ff[i] = (ff[i - 1] + ff[i - 2] * (i - 1) % 1000000007) % 1000000007;\n\n  memset(ljrose, 0, sizeof(ljrose));\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (lowb[i] == false)\n\n    {\n\n      long long sr = 1;\n      int j = a[i];\n\n      lowb[i] = true;\n\n      while (j != i)\n        lowb[j] = true, j = a[j], sr++;\n\n      ljrose[sr]++;\n    }\n  }\n\n  for (int i = 2; i <= n; i++)\n\n  {\n\n    if (i % 2 == 1)\n\n    {\n\n      renleizhihui[0] = 1;\n      renleizhihui[1] = 2;\n      renleizhihui[2] = 4 + i;\n\n      for (int j = 3; j <= ljrose[i]; j++)\n        renleizhihui[j] = (renleizhihui[j - 1] * 2 +\n                           renleizhihui[j - 2] * (j - 1) % 1000000007 * i % 1000000007) %\n                          1000000007;\n\n      lbsl = lbsl * renleizhihui[ljrose[i]] % 1000000007;\n\n      continue;\n    }\n\n    renleizhihui[0] = 1;\n    renleizhihui[1] = 1;\n    renleizhihui[2] = 1 + i;\n\n    for (int j = 3; j <= ljrose[i]; j++)\n      renleizhihui[j] =\n          (renleizhihui[j - 1] + renleizhihui[j - 2] * (j - 1) % 1000000007 * i % 1000000007) %\n          1000000007;\n\n    lbsl = lbsl * renleizhihui[ljrose[i]] % 1000000007;\n  }\n\n  lbsl = lbsl * ff[ss] % 1000000007;\n\n  printf(\"%lld\\n\", lbsl);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cctype>\n\n#define RI register int\n\n#define g (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, size, stdin), p1 == p2) ? EOF : *p1++)\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int mod = 1e9 + 7, N = 1e5 + 10, size = N << 2;\n\nchar buf[size], *p1 = buf, *p2 = buf;\n\nvoid qr(int &x) {\n\n  char c = g;\n  x = 0;\n\n  while (!isdigit(c))\n    c = g;\n\n  while (isdigit(c))\n    x = x * 10 + c - '0', c = g;\n}\n\nint n;\nll ans;\n\nint a[N], deg[N], vis[N], footL[N], sum[N], f[N];\n\nbool cir[N];\n\ninline int qm(int x) { return x >= mod ? x - mod : x; }\n\nvoid workcir(int x) {\n\n  int now = 0, fr = 0, frL = 0, ed = 0;\n\n  while (cir[x]) {\n\n    ++now;\n    cir[x] = 0;\n\n    if (footL[x]) {\n\n      if (!fr)\n        ed = fr = now, frL = footL[x];\n\n      else {\n\n        ans = ans * ((footL[x] < now - ed) + (footL[x] <= now - ed)) % mod;\n\n        ed = now;\n      }\n    }\n\n    x = a[x];\n  }\n\n  if (!ed)\n    ++sum[now];\n\n  else\n    ans = ans * ((frL < now - ed + fr) + (frL <= now - ed + fr)) % mod;\n}\n\nvoid work() {\n\n  for (RI i = 1; i <= n; i++) {\n\n    if (deg[i])\n      continue;\n\n    int x = i, len = 0;\n    while (!cir[x])\n      x = a[x], ++len;\n\n    footL[x] = len;\n  }\n\n  ans = f[0] = 1;\n\n  for (RI i = 1; i <= n; i++)\n    if (cir[i])\n      workcir(i);\n\n  for (RI i = 1; i <= n && ans; i++) {\n\n    for (RI j = 1; j <= sum[i]; j++) {\n\n      if (i > 1 && (i & 1))\n        f[j] = qm(f[j - 1] << 1);\n\n      else\n        f[j] = f[j - 1];\n\n      if (j > 1)\n        f[j] = qm(f[j] + (ll)f[j - 2] * (j - 1) % mod * i % mod);\n    }\n\n    ans = ans * f[sum[i]] % mod;\n  }\n}\n\nint main() {\n\n  qr(n);\n\n  for (RI i = 1; i <= n; i++)\n    qr(a[i]), ++deg[a[i]];\n\n  for (RI i = 1; i <= n; i++)\n    if (!vis[i]) {\n\n      int x = i;\n      while (!vis[x])\n        vis[x] = i, x = a[x];\n\n      if (vis[x] != i)\n        continue;\n\n      while (!cir[x])\n        cir[x] = 1, x = a[x];\n    }\n\n  for (RI i = 1; i <= n; i++)\n\n    if ((cir[i] && deg[i] > 2) || (!cir[i] && deg[i] > 1))\n      return puts(\"0\"), 0;\n\n  work();\n  printf(\"%lld\\n\", ans);\n  return 0;\n}"}
{"fast_code_id":"eba3576bfc91ab3e37fba46f845fd716b5277d669f8992e4b01f10b68bbc5f5c","fast_id":"2bed5f5927fc75950c7e07b0abaf3231de37443974c72ca47c8119c6ab3593fa","fast_time":0.0010521231,"language":"cpp","measured_fast_code_id":"2bed5f5927fc75950c7e07b0abaf3231de37443974c72ca47c8119c6ab3593fa","measured_slow_code_id":"b9a249ef5d43539fe8494a27d6d75763116717a6d6ac3e916e6c384f4af90cd5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11427","problem_id":"p03277","slow_code_id":"4b0610cf1e4edbf95920f6aeedf98aafc58d2bdb5cc3fc836386f9f8df93c7cb","slow_id":"b9a249ef5d43539fe8494a27d6d75763116717a6d6ac3e916e6c384f4af90cd5","slow_time":0.0140142897,"speedup":13.320009512194915,"stratum":"8+","sampling_key":"8622e4a0f8c24949952accd4396d6a3b3deec9fdab8e12a181e56f99f34976e1","slow_code":"#include <bits/stdc++.h>\n\n#define fi first\n\n#define se second\n\n#define ll long long\n\n#define pb push_back\n\n#define mp make_pair\n\n#define mt make_tuple\n\nusing namespace std;\n\nconst int N = 1e5;\n\nint niz[N + 10];\n\nint binNiz[N + 10];\n\nint odnos[N + 10];\n\nset<int> Set;\n\nvector<int> brojevi;\n\nll n;\n\nint seg[15 * N + 10];\n\nvoid update(int t, int start, int end, int ind, int x)\n\n{\n\n  if (start == end)\n\n  {\n\n    seg[t] += x;\n\n    return;\n  }\n\n  int mid = (start + end) / 2;\n\n  if (start <= ind && ind <= mid)\n    update(2 * t, start, mid, ind, x);\n\n  else\n    update(2 * t + 1, mid + 1, end, ind, x);\n\n  seg[t] = seg[2 * t] + seg[2 * t + 1];\n\n  return;\n}\n\nint query(int t, int start, int end, int l, int r)\n\n{\n\n  if (end < l || start > r)\n    return 0;\n\n  if (start >= l && end <= r)\n    return seg[t];\n\n  int mid = (start + end) / 2;\n\n  int x1 = query(2 * t, start, mid, l, r);\n\n  int x2 = query(2 * t + 1, mid + 1, end, l, r);\n\n  return (x1 + x2);\n}\n\nll calc(int ind)\n\n{\n\n  int x = brojevi[ind];\n\n  memset(seg, 0, sizeof(seg));\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (niz[i] >= x)\n      binNiz[i] = 1;\n\n    else\n      binNiz[i] = 0;\n  }\n\n  ll belo = 0;\n\n  ll crno = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (binNiz[i] == 1)\n      crno++;\n\n    else\n      belo++;\n\n    odnos[i] = crno - belo;\n\n    odnos[i] += N;\n  }\n\n  ll res = 0;\n\n  update(1, 0, 2 * N, N, 1);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int vr = odnos[i];\n\n    res += query(1, 0, 2 * N, 0, vr);\n\n    update(1, 0, 2 * N, vr, 1);\n  }\n\n  return res;\n}\n\nint binarna(int l, int r)\n\n{\n\n  if (l == r)\n    return l;\n\n  int p = (l + r + 1) / 2;\n\n  ll res = calc(p);\n\n  ll uk = n * (n + 1) / 2;\n\n  if (res >= (uk + 1) / 2)\n    return binarna(p, r);\n\n  return binarna(l, p - 1);\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> niz[i];\n\n    Set.insert(niz[i]);\n  }\n\n  for (set<int>::iterator it = Set.begin(); it != Set.end(); it++)\n\n    brojevi.pb(*it);\n\n  cout << brojevi[binarna(0, brojevi.size() - 1)];\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/detail/standard_policies.hpp>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\ntemplate <typename T>\n\nusing ordered_set =\n    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n\ntemplate <typename T>\n\nusing normal_queue = priority_queue<T, vector<T>, greater<T>>;\n\n#define int long long\n\nbool check(int x, int n, vector<int> &a) {\n\n  int cnt = 0, nw = 0;\n\n  ordered_set<pair<int, int>> c;\n\n  c.insert({0, 0});\n\n  for (int i = 0; i < n; ++i) {\n\n    if (a[i] >= x) {\n\n      nw++;\n\n    } else {\n\n      nw--;\n    }\n\n    cnt += c.order_of_key({nw, n + 10});\n\n    c.insert({nw, i + 1});\n  }\n\n  return cnt >= (n * (n + 1) / 2 + 1) / 2;\n}\n\nvoid solve() {\n\n  int n;\n\n  cin >> n;\n\n  vector<int> a(n);\n\n  for (int i = 0; i < n; ++i) {\n\n    cin >> a[i];\n  }\n\n  int l = -1, r = 1e9 + 10;\n\n  while (r - l > 1) {\n\n    int m = (l + r) / 2;\n\n    if (check(m, n, a)) {\n\n      l = m;\n\n    } else {\n\n      r = m;\n    }\n  }\n\n  cout << l << \"\\n\";\n}\n\nsigned main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int t = 1;\n\n  while (t--) {\n\n    solve();\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"239271fd7deb1d01fc934ec2a2d066aaf771859c2693190b3317449ae6d8704f","fast_id":"1a28f9087ce6125fbafcd02956609ee6b001b0ae1310e31d001e225a98bee2bc","fast_time":0.0661732423,"language":"cpp","measured_fast_code_id":"1a28f9087ce6125fbafcd02956609ee6b001b0ae1310e31d001e225a98bee2bc","measured_slow_code_id":"a98e65c2cc39c8e49ca406cfd72e39a4d69471eb444eaeaeece9a2da36b0cb33","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11442","problem_id":"p01622","slow_code_id":"5ab4992d749839c1b86382e1b6b2800461f42bd67b8fdbc357079d03261cd5e2","slow_id":"a98e65c2cc39c8e49ca406cfd72e39a4d69471eb444eaeaeece9a2da36b0cb33","slow_time":0.1454137774,"speedup":2.197470946651801,"stratum":"2-4","sampling_key":"0fdadee8c4f748f7b0540cd816bea0e5f90a426c153cdd05022935742daaaf14","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <cstdio>\n\n#include <functional>\n\n#include <set>\n\n#include <queue>\n\n#include <cctype>\n\n#include <climits>\n\n#include <stack>\n\nusing namespace std;\n\nint main() {\n\n  int n;\n\n  int r[1000], w[1000];\n\n  int sum_r = 0, sum_w = 0, idx = 0;\n\n  while (scanf(\"%d\", &n), n) {\n\n    sum_r = sum_w = idx = 0;\n\n    for (int i = 0; i < n; i++) {\n\n      scanf(\"%d %d\", &r[i], &w[i]);\n\n      sum_r += r[i];\n\n      sum_w += w[i];\n\n      if (r[idx] < r[i])\n        idx = i;\n    }\n\n    int r0 = r[idx], r = sum_r - r0;\n\n    w[idx] = 0;\n\n    if (r0 <= r) {\n\n      cout << sum_r + sum_w << endl;\n\n    } else {\n\n      int res = 2 * r0;\n\n      bool dp[1001][1000] = {};\n\n      dp[0][0] = true;\n\n      for (int i = 0; i < n; i++) {\n\n        for (int j = 0; j < 1000; j++) {\n\n          if (dp[i][j]) {\n\n            dp[i + 1][j] = true;\n\n            if (j + w[i] < 1000)\n\n              dp[i + 1][j + w[i]] = true;\n          }\n        }\n      }\n\n      int opt = r0 - r;\n\n      while (!dp[n][opt])\n        opt--;\n\n      res += sum_w - opt;\n\n      printf(\"%d\\n\", res);\n    }\n  }\n}","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <cstdio>\n\n#include <functional>\n\n#include <set>\n\n#include <queue>\n\n#include <cctype>\n\n#include <climits>\n\n#include <stack>\n\nusing namespace std;\n\nint main() {\n\n  int n;\n\n  int r[1000], w[1000];\n\n  int sum_r = 0, sum_w = 0, idx = 0;\n\n  while (scanf(\"%d\", &n), n) {\n\n    sum_r = sum_w = idx = 0;\n\n    for (int i = 0; i < n; i++) {\n\n      scanf(\"%d %d\", &r[i], &w[i]);\n\n      sum_r += r[i];\n\n      sum_w += w[i];\n\n      if (r[idx] < r[i])\n        idx = i;\n    }\n\n    int r0 = r[idx], r = sum_r - r0;\n\n    w[idx] = 0;\n\n    if (r0 <= r) {\n\n      cout << sum_r + sum_w << endl;\n\n    } else {\n\n      int res = 2 * r0;\n\n      bool cur[1001] = {};\n\n      cur[0] = true;\n\n      for (int i = 0; i < n; i++) {\n\n        bool next[1001] = {};\n\n        for (int j = 0; j < 1000; j++) {\n\n          if (cur[j]) {\n\n            next[j] = true;\n\n            if (j + w[i] < 1000)\n\n              next[j + w[i]] = true;\n          }\n        }\n\n        swap(cur, next);\n      }\n\n      int opt = r0 - r;\n\n      while (!cur[opt])\n        opt--;\n\n      res += sum_w - opt;\n\n      printf(\"%d\\n\", res);\n    }\n  }\n}"}
{"fast_code_id":"77c5b38d0a7e94e08fd7b36ec1e63ee5539ba0815364082ffedcb196a8093c45","fast_id":"d0ef48a9dd7a6d3065f64f6c5491c0b180cab411f39944d14ffd4d645e6f08c3","fast_time":0.0192293736,"language":"cpp","measured_fast_code_id":"d0ef48a9dd7a6d3065f64f6c5491c0b180cab411f39944d14ffd4d645e6f08c3","measured_slow_code_id":"a49ca54bae6005ffd6e1605229ade254cfc03f6494b718bcf2575a5b60373b70","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11462","problem_id":"p03257","slow_code_id":"65602af61ac682d757900f0ec6c54b7089bc2d98715972316e5792b21f0c3c52","slow_id":"a49ca54bae6005ffd6e1605229ade254cfc03f6494b718bcf2575a5b60373b70","slow_time":0.051968639,"speedup":2.7025653607354116,"stratum":"2-4","sampling_key":"9c31b33177e0c7044368d80ed0af310056626e0b99815441ea32ba42225a7bd1","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, cnt = 2;\n\nlong long res[507][507];\n\nmap<int, int> a, b;\n\nint nxt()\n\n{\n\n  while (1)\n\n  {\n\n    bool ok = 1;\n\n    for (int i = 2; i * i <= cnt && ok; i++)\n\n      if (cnt % i == 0)\n        ok = 0;\n\n    if (ok)\n      return cnt++;\n\n    cnt++;\n  }\n\n  return 0;\n}\n\nlong long gcd(long long a, long long b)\n\n{\n\n  if (!b)\n    return a;\n\n  return gcd(b, a % b);\n}\n\nlong long lcm(long long a, long long b)\n\n{\n\n  if (!a || !b)\n    return 0;\n\n  return a / gcd(a, b) * b;\n}\n\nint main()\n\n{\n\n  cin >> n;\n\n  if (n == 2) {\n\n    printf(\"4 7\\n23 10\\n\");\n\n    return 0;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n      res[i][j] = 1;\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n      if (((i + j) & 1) && !a[i + j])\n\n        a[i + j] = nxt();\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n      if (((i + j) & 1) && !b[i - j])\n\n        b[i - j] = nxt();\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n      if ((i + j) & 1)\n\n      {\n\n        res[i][j] = 1LL * a[i + j] * b[i - j];\n\n        res[i - 1][j] = lcm(res[i - 1][j], res[i][j]);\n\n        res[i][j - 1] = lcm(res[i][j - 1], res[i][j]);\n\n        res[i + 1][j] = lcm(res[i + 1][j], res[i][j]);\n\n        res[i][j + 1] = lcm(res[i][j + 1], res[i][j]);\n      }\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n      if (!((i + j) & 1))\n\n        res[i][j]++;\n\n  for (int i = 1; i <= n; i++, putchar('\\n'))\n\n    for (int j = 1; j <= n; j++)\n\n      printf(\"%lld \", res[i][j]);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define int long long\n\nusing namespace std;\n\nint n, a[1100][1100];\n\nint tot, p[110000];\nbool vis[110000];\n\nvoid init() {\n\n  vis[1] = true;\n\n  for (int i = 2; i <= 10000; i++) {\n\n    if (!vis[i])\n      p[++tot] = i;\n\n    if (tot == 1000)\n      break;\n\n    for (int j = 1; j <= tot && (i * p[j] <= 10000); j++) {\n\n      vis[i * p[j]] = true;\n\n      if (i % p[j] == 0)\n        break;\n    }\n  }\n}\n\ninline int lcm(int x, int y) {\n\n  if (!x || !y)\n    return x | y;\n\n  return x / __gcd(x, y) * y;\n}\n\nsigned main() {\n\n  init();\n\n  scanf(\"%lld\", &n);\n\n  if (n == 2) {\n\n    puts(\"4 7\\n23 10\");\n\n    return 0;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n      if (((i + j) & 1) == 0)\n\n        a[i][j] = p[(i + j) / 2] * p[(i - j + n + 1) / 2 + n];\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n      if (!a[i][j])\n\n        a[i][j] =\n            lcm(lcm(a[i - 1][j], a[i][j - 1]), lcm(a[i][j + 1], a[i + 1][j])) +\n            1;\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = 1; j < n; j++)\n      printf(\"%lld \", a[i][j]);\n\n    printf(\"%lld\\n\", a[i][n]);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"6e0e2ba495a98b22239eb5fad606406ccd9950eb80b1d1569d44c57b3be5b2bf","fast_id":"d26dcc8b24dddb019c58d9eb3e88c5cbffba83dcef41fcbb599d064261f316dd","fast_time":0.0815817371,"language":"cpp","measured_fast_code_id":"d26dcc8b24dddb019c58d9eb3e88c5cbffba83dcef41fcbb599d064261f316dd","measured_slow_code_id":"fb3c1fb0cee54ce3a137085083d8d840d6c5cb83285f329fdbccee5c8cea040c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11473","problem_id":"p03031","slow_code_id":"5e65410d741d1996fcbe353c6acb6aeacf3551e1e1a06400d8c4de6cc63b5429","slow_id":"fb3c1fb0cee54ce3a137085083d8d840d6c5cb83285f329fdbccee5c8cea040c","slow_time":0.2889889631,"speedup":3.542324218296156,"stratum":"2-4","sampling_key":"19dd71cd9db63a2220edfddca0cb2197d72a970b65492a83ff11d1e93d86d37e","slow_code":"\n\n#ifndef _GLIBCXX_NO_ASSERT\n\n#include <cassert>\n\n#endif\n\n#include <cctype>\n\n#include <cerrno>\n\n#include <cfloat>\n\n#include <ciso646>\n\n#include <climits>\n\n#include <clocale>\n\n#include <cmath>\n\n#include <csetjmp>\n\n#include <csignal>\n\n#include <cstdarg>\n\n#include <cstddef>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <ctime>\n\n#if __cplusplus >= 201103L\n\n#include <ccomplex>\n\n#include <cfenv>\n\n#include <cinttypes>\n\n#include <cstdbool>\n\n#include <cstdint>\n\n#include <ctgmath>\n\n#include <cwchar>\n\n#include <cwctype>\n\n#endif\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <complex>\n\n#include <deque>\n\n#include <exception>\n\n#include <fstream>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <ios>\n\n#include <iosfwd>\n\n#include <iostream>\n\n#include <istream>\n\n#include <iterator>\n\n#include <limits>\n\n#include <list>\n\n#include <locale>\n\n#include <map>\n\n#include <memory>\n\n#include <new>\n\n#include <numeric>\n\n#include <ostream>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <stdexcept>\n\n#include <streambuf>\n\n#include <string>\n\n#include <typeinfo>\n\n#include <utility>\n\n#include <valarray>\n\n#include <vector>\n\n#if __cplusplus >= 201103L\n\n#include <array>\n\n#include <atomic>\n\n#include <chrono>\n\n#include <condition_variable>\n\n#include <forward_list>\n\n#include <future>\n\n#include <initializer_list>\n\n#include <mutex>\n\n#include <random>\n\n#include <ratio>\n\n#include <regex>\n\n#include <scoped_allocator>\n\n#include <system_error>\n\n#include <thread>\n\n#include <tuple>\n\n#include <typeindex>\n\n#include <type_traits>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#endif\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i <= sqrt(x); i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint gcd(int x, int y) {\n\n  if (y == 0) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint par[300004];\n\nint rankmy[300004];\n\nint find(int x) {\n\n  if (par[x] == x) {\n\n    return x;\n  }\n\n  return par[x] = find(par[x]);\n}\n\nvoid unite(int x, int y) {\n\n  x = find(x);\n\n  y = find(y);\n\n  if (x == y) {\n\n    return;\n  }\n\n  if (rankmy[x] < rankmy[y]) {\n\n    par[x] = y;\n\n  } else {\n\n    par[y] = x;\n\n    if (rankmy[x] == rankmy[y]) {\n\n      rankmy[x]++;\n    }\n  }\n}\n\nbool same(int x, int y) { return find(x) == find(y); }\n\nvoid init(int n) {\n\n  for (int i = 0; i <= n; i++) {\n\n    par[i] = i;\n  }\n}\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\nvector<int> v[100004];\n\nbool went[100004];\n\nvoid dfs(int x) {\n\n  went[x] = true;\n\n  for (int i = 0; i < v[x].size(); i++) {\n\n    if (!went[v[x][i]]) {\n\n      dfs(v[x][i]);\n    }\n  }\n}\n\nint n, m, q[14], ans;\n\nvector<int> vec[14];\n\nsigned main() {\n\n  cin >> n >> m;\n\n  for (int i = 0; i < m; i++) {\n\n    int k;\n\n    cin >> k;\n\n    for (int j = 0; j < k; j++) {\n\n      int p;\n\n      cin >> p;\n\n      p--;\n\n      vec[i].push_back(p);\n    }\n  }\n\n  for (int i = 0; i < m; i++) {\n\n    cin >> q[i];\n  }\n\n  for (int i = 0; i < mypow(2, n); i++) {\n\n    bitset<30> bits(i);\n\n    bool ok = true;\n\n    for (int j = 0; j < m; j++) {\n\n      int g = 0;\n\n      for (int k = 0; k < vec[j].size(); k++) {\n\n        if (bits[vec[j][k]]) {\n\n          g++;\n        }\n      }\n\n      if ((g & 1) != q[j]) {\n\n        ok = false;\n\n        break;\n      }\n    }\n\n    if (ok) {\n\n      ans++;\n    }\n  }\n\n  cout << ans << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\n#define intt long long\n\n#define P pair<int, int>\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\ninline int gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\ninline int lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\nint fukugen(vector<int> l) {\n\n  int ans = 0;\n\n  for (int i = 0; i < (int)l.size(); i++) {\n\n    ans *= 10;\n\n    ans += l[i];\n  }\n\n  return ans;\n}\n\nint nanjyo(int n) {\n\n  int ans = 0;\n\n  while (n > 1) {\n\n    ans++;\n\n    n /= 2;\n  }\n\n  return ans;\n}\n\nbool intersect(pair<pair<int, int>, pair<int, int>> p1,\n               pair<pair<int, int>, pair<int, int>> p2) {\n\n  int men11 =\n      (p2.first.first - p1.first.first) * (p2.second.second - p1.first.second) -\n      (p2.second.first - p1.first.first) * (p2.first.second - p1.first.second);\n\n  int men12 = (p2.first.first - p1.second.first) *\n                  (p2.second.second - p1.second.second) -\n              (p2.second.first - p1.second.first) *\n                  (p2.first.second - p1.second.second);\n\n  int men21 =\n      (p1.first.first - p2.first.first) * (p1.second.second - p2.first.second) -\n      (p1.second.first - p2.first.first) * (p1.first.second - p2.first.second);\n\n  int men22 = (p1.first.first - p2.second.first) *\n                  (p1.second.second - p2.second.second) -\n              (p1.second.first - p2.second.first) *\n                  (p1.first.second - p2.second.second);\n\n  return ((signbit(men11)) ^ (signbit(men12))) &&\n         ((signbit(men21)) ^ (signbit(men22)));\n}\n\ntemplate <class T, class U>\n\ninline bool chmax(T &lhs, const U &rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\ntemplate <class T, class U>\n\ninline bool chmin(T &lhs, const U &rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\nvoid Yes() { cout << \"Yes\" << endl; }\n\nvoid No() { cout << \"No\" << endl; }\n\nvoid YES() { cout << \"YES\" << endl; }\n\nvoid NO() { cout << \"NO\" << endl; }\n\nint yakusuu(int x) {\n\n  int ans = 0;\n\n  for (int i = 1; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      if (i * i == x) {\n\n        ans++;\n\n      }\n\n      else\n        ans += 2;\n    }\n  }\n\n  return ans;\n}\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, n) for (int i = 1; i <= n; i++)\n\nint n, m, k[14], s[14][14], p[14], ans;\n\nsigned main() {\n\n  cin >> n >> m;\n\n  rep(i, m) {\n\n    cin >> k[i];\n\n    rep(j, k[i]) {\n\n      cin >> s[i][j];\n\n      s[i][j]--;\n    }\n  }\n\n  rep(i, m) cin >> p[i];\n\n  rep(i, mypow(2, n)) {\n\n    bitset<20> bits(i);\n\n    bool ok = 1;\n\n    rep(j, m) {\n\n      int cnt = 0;\n\n      rep(l, k[j]) {\n\n        if (bits[s[j][l]])\n          cnt++;\n      }\n\n      if ((cnt & 1) != p[j]) {\n\n        ok = 0;\n\n        break;\n      }\n    }\n\n    if (ok) {\n\n      ans++;\n    }\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"79d2268b85c78c155b93393679ca7f1976550a45b1583c10391d5c5ccb89243d","fast_id":"57741927b63193dd2ef43e95bece568e195441a2064c13eadcb0a2d33c132011","fast_time":0.0726054094,"language":"cpp","measured_fast_code_id":"57741927b63193dd2ef43e95bece568e195441a2064c13eadcb0a2d33c132011","measured_slow_code_id":"3038d624cc3f1725b4745160cc435912047fc9b727c8e69cfe13132c66c14c20","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11474","problem_id":"p03286","slow_code_id":"0bd3700a6ad67d85c2dca4e3db123df2ab746a51d80100bcf09965040512a6c3","slow_id":"3038d624cc3f1725b4745160cc435912047fc9b727c8e69cfe13132c66c14c20","slow_time":0.2532560914,"speedup":3.488116016325362,"stratum":"2-4","sampling_key":"3ee47a44465b5e1f5525dfbd389d60a8eae67a26ab749b04ee47ce3298eea2bd","slow_code":"#include <stdio.h>\n\n#include <sstream>\n\n#include <string.h>\n\n#include <vector>\n\n#include <map>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <set>\n\n#include <cctype>\n\n#include <queue>\n\n#include <stack>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <deque>\n\n#include <limits>\n\n#include <iomanip>\n\n#include <ctype.h>\n\n#include <unordered_map>\n\n#include <random>\n\n#define _USE_MATH_DEFINES\n\n#include <iostream>\n\n#include <math.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<int, char> pic;\n\n#define bit(x, v) ((ll)x << v)\n\nconst ll INF = 1000000007;\n\nconst int MAX = 210000;\n\nconst int MOD = 1000000007;\n\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid COMinit() {\n\n  fac[0] = fac[1] = 1;\n\n  finv[0] = finv[1] = 1;\n\n  inv[1] = 1;\n\n  for (int i = 2; i < MAX; i++) {\n\n    fac[i] = fac[i - 1] * i % MOD;\n\n    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n\n    finv[i] = finv[i - 1] * inv[i] % MOD;\n  }\n}\n\nlong long COM(int n, int k) {\n\n  if (n < k)\n    return 0;\n\n  if (n < 0 || k < 0)\n    return 0;\n\n  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nll gcd(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  return gcd(b, a % b);\n}\n\nint pr[100010];\n\nvoid uini(int n) {\n\n  for (size_t i = 0; i <= n; i++)\n\n  {\n\n    pr[i] = i;\n  }\n}\n\nint parent(int x) {\n\n  if (x == pr[x])\n    return x;\n\n  return pr[x] = parent(pr[x]);\n}\n\nint same(int x, int y) { return parent(x) == parent(y); }\n\nbool unit(int x, int y) {\n\n  int px = parent(x);\n\n  int py = parent(y);\n\n  if (px == py)\n    return false;\n\n  if (px < py) {\n\n    pr[py] = px;\n\n  }\n\n  else {\n\n    pr[px] = py;\n  }\n\n  return true;\n}\n\nll bit[200010];\n\nint max_n = 200000;\n\nint pm = 0;\n\nvoid add(int x) {\n\n  while (max_n >= x)\n\n  {\n\n    bit[x]++;\n\n    x += x & -x;\n  }\n}\n\nvoid sub(int x) {\n\n  while (max_n >= x)\n\n  {\n\n    bit[x]--;\n\n    x += x & -x;\n  }\n}\n\nll merge(ll *a, int left, int mid, int right) {\n\n  ll n1 = mid - left;\n\n  ll n2 = right - mid;\n\n  vector<int> L(n1 + 1);\n\n  vector<int> R(n2 + 1);\n\n  for (size_t i = 0; i < n1; i++)\n\n  {\n\n    L[i] = a[left + i];\n  }\n\n  for (size_t i = 0; i < n2; i++)\n\n  {\n\n    R[i] = a[mid + i];\n  }\n\n  L[n1] = INF;\n\n  R[n2] = INF;\n\n  ll i = 0;\n\n  ll j = 0;\n\n  ll r = 0;\n\n  for (size_t k = left; k < right; k++)\n\n  {\n\n    if (L[i] <= R[j]) {\n\n      a[k] = L[i];\n\n      i++;\n\n    }\n\n    else {\n\n      a[k] = R[j];\n\n      r += n1 - i;\n\n      j++;\n    }\n  }\n\n  return r;\n}\n\nll merge2(pair<int, char> *a, int left, int mid, int right) {\n\n  ll n1 = mid - left;\n\n  ll n2 = right - mid;\n\n  vector<pair<int, char>> L(n1 + 1);\n\n  vector<pair<int, char>> R(n2 + 1);\n\n  for (size_t i = 0; i < n1; i++)\n\n  {\n\n    L[i] = a[left + i];\n  }\n\n  for (size_t i = 0; i < n2; i++)\n\n  {\n\n    R[i] = a[mid + i];\n  }\n\n  L[n1] = make_pair(INF, ' ');\n\n  R[n2] = make_pair(INF, ' ');\n\n  ll i = 0;\n\n  ll j = 0;\n\n  ll r = 0;\n\n  for (size_t k = left; k < right; k++)\n\n  {\n\n    if (L[i].first <= R[j].first) {\n\n      a[k] = L[i];\n\n      i++;\n\n    }\n\n    else {\n\n      a[k] = R[j];\n\n      r += n1 - i;\n\n      j++;\n    }\n  }\n\n  return r;\n}\n\nll mergeSort2(pair<int, char> *a, int left, int right) {\n\n  ll res = 0;\n\n  if (left + 1 < right) {\n\n    int mid = (left + right) / 2;\n\n    res = mergeSort2(a, left, mid);\n\n    res += mergeSort2(a, mid, right);\n\n    res += merge2(a, left, mid, right);\n  }\n\n  return res;\n}\n\nll mergeSort(ll *a, int left, int right) {\n\n  ll res = 0;\n\n  if (left + 1 < right) {\n\n    int mid = (left + right) / 2;\n\n    res = mergeSort(a, left, mid);\n\n    res += mergeSort(a, mid, right);\n\n    res += merge(a, left, mid, right);\n  }\n\n  return res;\n}\n\nint partition(pair<int, char> *a, int p, int r) {\n\n  pair<int, char> x = a[r];\n\n  int i = p - 1;\n\n  for (size_t j = p; j < r; j++)\n\n  {\n\n    if (a[j].first <= x.first) {\n\n      i++;\n\n      swap(a[i], a[j]);\n    }\n  }\n\n  swap(a[i + 1], a[r]);\n\n  return i + 1;\n}\n\nvoid quick(pair<int, char> *a, int p, int r) {\n\n  if (p < r) {\n\n    int q = partition(a, p, r);\n\n    quick(a, p, q - 1);\n\n    quick(a, q + 1, r);\n  }\n}\n\nll n;\n\nvector<pii> es[100010];\n\nint ci = 0;\n\nll P[1000010];\n\nstruct Node {\n\n  int key;\n\n  int priority;\n\n  Node *parent, *left, *right;\n\n  Node(int key, int priority);\n\n  Node() {}\n};\n\nNode NIL;\n\nNode::Node(int key, int priority) : key(key), priority(priority) {\n\n  left = &NIL;\n\n  right = &NIL;\n}\n\nNode *root = new Node();\n\nvoid cenrec(Node *k) {\n\n  if (k->key == NIL.key)\n    return;\n\n  cenrec(k->left);\n\n  cout << \" \" << k->key;\n\n  cenrec(k->right);\n}\n\nvoid fastrec(Node *k)\n\n{\n\n  if (k->key == NIL.key)\n    return;\n\n  cout << \" \" << k->key;\n\n  fastrec(k->left);\n\n  fastrec(k->right);\n}\n\nvoid insert(Node *v) {\n\n  Node *y = &NIL;\n\n  Node *x = root;\n\n  while (x->key != NIL.key)\n\n  {\n\n    y = x;\n\n    if (v->key < x->key) {\n\n      x = x->left;\n\n    }\n\n    else {\n\n      x = x->right;\n    }\n  }\n\n  v->parent = y;\n\n  if (y->key == NIL.key) {\n\n    root = v;\n\n  }\n\n  else if (v->key < y->key) {\n\n    y->left = v;\n\n  }\n\n  else {\n\n    y->right = v;\n  }\n}\n\nNode *find(Node *k, ll v)\n\n{\n\n  if (k->key == NIL.key)\n    return &NIL;\n\n  if (k->key == v)\n    return k;\n\n  if (v < k->key)\n    return find(k->left, v);\n\n  return find(k->right, v);\n}\n\nvoid delp12(Node *x) {\n\n  if (x->key == NIL.key)\n    return;\n\n  Node *l = x->left;\n\n  Node *r = x->right;\n\n  Node *pr = x->parent;\n\n  if (l->key == NIL.key\n\n      && r->key == NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = &NIL;\n\n    }\n\n    else\n      pr->right = &NIL;\n\n  }\n\n  else if (l->key != NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = l;\n\n    }\n\n    else\n      pr->right = l;\n\n    l->parent = pr;\n\n  }\n\n  else if (r->key != NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = r;\n\n    }\n\n    else\n      pr->right = r;\n\n    r->parent = pr;\n  }\n}\n\nNode *get_next(Node *k) {\n\n  if (k->key == NIL.key)\n    return &NIL;\n\n  Node *res = get_next(k->left);\n\n  if (res->key != NIL.key)\n    return res;\n\n  return k;\n}\n\nvoid del(Node *x) {\n\n  if (x->key == NIL.key)\n    return;\n\n  Node *l = x->left;\n\n  Node *r = x->right;\n\n  Node *pr = x->parent;\n\n  if (l->key != NIL.key && r->key != NIL.key) {\n\n    Node *nex = get_next(r);\n\n    x->key = nex->key;\n\n    delp12(nex);\n\n  }\n\n  else {\n\n    delp12(x);\n  }\n}\n\nNode *rightRotate(Node *t) {\n\n  Node *s = t->left;\n\n  t->left = s->right;\n\n  s->right = t;\n\n  return s;\n}\n\nNode *leftRotate(Node *t) {\n\n  Node *s = t->right;\n\n  t->right = s->left;\n\n  s->left = t;\n\n  return s;\n}\n\nNode *_insert(Node *t, int key, int priority) {\n\n  if (t->key == NIL.key) {\n\n    return new Node(key, priority);\n  }\n\n  if (key == t->key) {\n\n    return t;\n  }\n\n  if (key < t->key) {\n\n    t->left = _insert(t->left, key, priority);\n\n    if (t->priority < t->left->priority) {\n\n      t = rightRotate(t);\n    }\n\n  }\n\n  else {\n\n    t->right = _insert(t->right, key, priority);\n\n    if (t->priority < t->right->priority) {\n\n      t = leftRotate(t);\n    }\n  }\n\n  return t;\n}\n\nNode *delete1(Node *t, int key);\n\nNode *_delete(Node *t, int key) {\n\n  if (t->left->key == NIL.key && t->right->key == NIL.key) {\n\n    return &NIL;\n\n  }\n\n  else if (t->left->key == NIL.key) {\n\n    t = leftRotate(t);\n\n  }\n\n  else if (t->right->key == NIL.key) {\n\n    t = rightRotate(t);\n\n  }\n\n  else\n\n  {\n\n    if (t->left->priority > t->right->priority) {\n\n      t = rightRotate(t);\n\n    }\n\n    else\n\n      t = leftRotate(t);\n  }\n\n  return delete1(t, key);\n}\n\nNode *delete1(Node *t, int key) {\n\n  if (t->key == NIL.key) {\n\n    return &NIL;\n  }\n\n  if (key < t->key) {\n\n    t->left = delete1(t->left, key);\n\n  }\n\n  else if (key > t->key) {\n\n    t->right = delete1(t->right, key);\n\n  }\n\n  else\n    return _delete(t, key);\n\n  return t;\n}\n\nint H;\n\nint left(int i) { return i * 2 + 1; }\n\nint right(int i) { return i * 2 + 2; }\n\nll heap[2000010];\n\nvoid maxHeapify(int i) {\n\n  int l = left(i);\n\n  int r = right(i);\n\n  int largest = 0;\n\n  if (l < H && heap[l] > heap[i])\n\n    largest = l;\n\n  else\n\n    largest = i;\n\n  if (r < H && heap[r] > heap[largest])\n\n    largest = r;\n\n  if (largest != i) {\n\n    swap(heap[i], heap[largest]);\n\n    maxHeapify(largest);\n  }\n}\n\nint pare(int i) { return (i - 1) / 2; }\n\nvoid raise(int i) {\n\n  int l = pare(i);\n\n  if (l < 0)\n    return;\n\n  if (heap[l] < heap[i]) {\n\n    swap(heap[i], heap[l]);\n\n    raise(l);\n  }\n}\n\nvoid minHeapify(int i) {\n\n  int l = left(i);\n\n  int r = right(i);\n\n  int minimam = 0;\n\n  if (l < H && heap[l] < heap[i])\n\n    minimam = l;\n\n  else\n\n    minimam = i;\n\n  if (r < H && heap[r] < heap[minimam])\n\n    minimam = r;\n\n  if (minimam != i) {\n\n    swap(heap[i], heap[minimam]);\n\n    minHeapify(minimam);\n  }\n}\n\nvoid buildMaxHeap() {\n\n  for (int i = H / 2; i >= 0; i--)\n\n  {\n\n    maxHeapify(i);\n  }\n}\n\nint dx[] = {-1, 0, 1, 0};\n\nint dy[] = {0, -1, 0, 1};\n\nstd::vector<int> find_all(const std::string str, const std::string subStr) {\n\n  std::vector<int> result;\n\n  int subStrSize = subStr.size();\n\n  int pos = str.find(subStr);\n\n  while (pos != std::string::npos) {\n\n    result.push_back(pos);\n\n    pos = str.find(subStr, pos + 1);\n  }\n\n  return result;\n}\n\nvoid solv() {\n\n  cin >> n;\n\n  if (n == 0) {\n    cout << 0 << endl;\n    return;\n  }\n\n  vector<int> v;\n\n  while (n != 0)\n\n  {\n\n    if (n % -2 != 0) {\n\n      v.push_back(1);\n\n      n -= 1;\n\n    }\n\n    else\n      v.push_back(0);\n\n    n /= -2;\n  }\n\n  reverse(v.begin(), v.end());\n\n  for (size_t i = 0; i < v.size(); i++)\n\n  {\n\n    cout << v[i];\n  }\n\n  cout << endl;\n}\n\nint main() {\n\n  solv();\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <sstream>\n\n#include <string.h>\n\n#include <vector>\n\n#include <map>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <set>\n\n#include <cctype>\n\n#include <queue>\n\n#include <stack>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <deque>\n\n#include <limits>\n\n#include <iomanip>\n\n#include <ctype.h>\n\n#include <unordered_map>\n\n#include <random>\n\n#include <numeric>\n\n#include <iostream>\n\n#include <array>\n\n#define _USE_MATH_DEFINES\n\n#include <iostream>\n\n#include <math.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<ll, double> pld;\n\ntypedef pair<double, double> pdd;\n\ntypedef pair<double, ll> pdl;\n\ntypedef pair<int, char> pic;\n\ntypedef vector<ll> vl;\n\ntypedef vector<int> vi;\n\ntypedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;\n\ntypedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;\n\ntypedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>, greater<pair<ll, pll>>> plpllgreaterq;\n\ntypedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;\n\ntypedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;\n\nint dx[] = {-1, 0, 1, 0};\n\nint dy[] = {0, -1, 0, 1};\n\n#define bit(x, v) ((ll)x << v)\n\n#define rep(x, n) for (int x = 0; x < n; x++)\n\n#define rep2(x, f, v) for (int x = f; x < v; x++)\n\n#define EPS (1e-10)\n\n#define EQ(a, b) (std::abs(a - b) < EPS)\n\n#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))\n\n#define all(a) a.begin(), a.end()\n\n#define all0(a) memset(a, 0, sizeof(a))\n\n#define alm1(a) memset(a, -1, sizeof(a))\n\nconst ll INF = 1000000007;\n\nconst int MAX = 2000010;\n\nconst int MOD = 1000000007;\n\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid COMinit() {\n\n  fac[0] = fac[1] = 1;\n\n  finv[0] = finv[1] = 1;\n\n  inv[1] = 1;\n\n  for (int i = 2; i < MAX; i++) {\n\n    fac[i] = fac[i - 1] * i % MOD;\n\n    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n\n    finv[i] = finv[i - 1] * inv[i] % MOD;\n  }\n}\n\nlong long COM(int n, int k) {\n\n  if (n < k)\n    return 0;\n\n  if (n < 0 || k < 0)\n    return 0;\n\n  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nll gcd(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  return gcd(b, a % b);\n}\n\nint pr[100010];\n\nint lank[100010];\n\nvoid uini(int n) {\n\n  for (size_t i = 0; i <= n; i++)\n\n  {\n\n    pr[i] = i;\n\n    lank[i] = 1;\n  }\n}\n\nint parent(int x) {\n\n  if (x == pr[x])\n    return x;\n\n  return pr[x] = parent(pr[x]);\n}\n\nint same(int x, int y) { return parent(x) == parent(y); }\n\nbool unit(int x, int y) {\n\n  int px = parent(x);\n\n  int py = parent(y);\n\n  if (px == py)\n    return false;\n\n  if (lank[py] < lank[px]) {\n\n    pr[py] = px;\n\n    lank[px] += lank[py];\n\n  }\n\n  else {\n\n    pr[px] = py;\n\n    lank[py] += lank[px];\n  }\n\n  return true;\n}\n\nll bit[200010];\n\nint max_n = 200000;\n\nint pm = 0;\n\nvoid add(int x) {\n\n  while (max_n >= x)\n\n  {\n\n    bit[x]++;\n\n    x += x & -x;\n  }\n}\n\nvoid sub(int x) {\n\n  while (max_n >= x)\n\n  {\n\n    bit[x]--;\n\n    x += x & -x;\n  }\n}\n\nll merge(ll *a, int left, int mid, int right) {\n\n  ll n1 = mid - left;\n\n  ll n2 = right - mid;\n\n  vector<int> L(n1 + 1);\n\n  vector<int> R(n2 + 1);\n\n  for (size_t i = 0; i < n1; i++)\n\n  {\n\n    L[i] = a[left + i];\n  }\n\n  for (size_t i = 0; i < n2; i++)\n\n  {\n\n    R[i] = a[mid + i];\n  }\n\n  L[n1] = INF;\n\n  R[n2] = INF;\n\n  ll i = 0;\n\n  ll j = 0;\n\n  ll r = 0;\n\n  for (size_t k = left; k < right; k++)\n\n  {\n\n    if (L[i] <= R[j]) {\n\n      a[k] = L[i];\n\n      i++;\n\n    }\n\n    else {\n\n      a[k] = R[j];\n\n      r += n1 - i;\n\n      j++;\n    }\n  }\n\n  return r;\n}\n\nll merge2(pair<int, char> *a, int left, int mid, int right) {\n\n  ll n1 = mid - left;\n\n  ll n2 = right - mid;\n\n  vector<pair<int, char>> L(n1 + 1);\n\n  vector<pair<int, char>> R(n2 + 1);\n\n  for (size_t i = 0; i < n1; i++)\n\n  {\n\n    L[i] = a[left + i];\n  }\n\n  for (size_t i = 0; i < n2; i++)\n\n  {\n\n    R[i] = a[mid + i];\n  }\n\n  L[n1] = make_pair(INF, ' ');\n\n  R[n2] = make_pair(INF, ' ');\n\n  ll i = 0;\n\n  ll j = 0;\n\n  ll r = 0;\n\n  for (size_t k = left; k < right; k++)\n\n  {\n\n    if (L[i].first <= R[j].first) {\n\n      a[k] = L[i];\n\n      i++;\n\n    }\n\n    else {\n\n      a[k] = R[j];\n\n      r += n1 - i;\n\n      j++;\n    }\n  }\n\n  return r;\n}\n\nll mergeSort2(pair<int, char> *a, int left, int right) {\n\n  ll res = 0;\n\n  if (left + 1 < right) {\n\n    int mid = (left + right) / 2;\n\n    res = mergeSort2(a, left, mid);\n\n    res += mergeSort2(a, mid, right);\n\n    res += merge2(a, left, mid, right);\n  }\n\n  return res;\n}\n\nll mergeSort(ll *a, int left, int right) {\n\n  ll res = 0;\n\n  if (left + 1 < right) {\n\n    int mid = (left + right) / 2;\n\n    res = mergeSort(a, left, mid);\n\n    res += mergeSort(a, mid, right);\n\n    res += merge(a, left, mid, right);\n  }\n\n  return res;\n}\n\nint partition(pair<int, char> *a, int p, int r) {\n\n  pair<int, char> x = a[r];\n\n  int i = p - 1;\n\n  for (size_t j = p; j < r; j++)\n\n  {\n\n    if (a[j].first <= x.first) {\n\n      i++;\n\n      swap(a[i], a[j]);\n    }\n  }\n\n  swap(a[i + 1], a[r]);\n\n  return i + 1;\n}\n\nvoid quick(pair<int, char> *a, int p, int r) {\n\n  if (p < r) {\n\n    int q = partition(a, p, r);\n\n    quick(a, p, q - 1);\n\n    quick(a, q + 1, r);\n  }\n}\n\nll n;\n\nint ci = 0;\n\nll P[1000010];\n\nstruct Node {\n\n  int key;\n\n  int priority;\n\n  Node *parent, *left, *right;\n\n  Node(int key, int priority);\n\n  Node() {}\n};\n\nNode NIL;\n\nNode::Node(int key, int priority) : key(key), priority(priority) {\n\n  left = &NIL;\n\n  right = &NIL;\n}\n\nNode *root = new Node();\n\nvoid cenrec(Node *k) {\n\n  if (k->key == NIL.key)\n    return;\n\n  cenrec(k->left);\n\n  cout << \" \" << k->key;\n\n  cenrec(k->right);\n}\n\nvoid fastrec(Node *k)\n\n{\n\n  if (k->key == NIL.key)\n    return;\n\n  cout << \" \" << k->key;\n\n  fastrec(k->left);\n\n  fastrec(k->right);\n}\n\nvoid insert(Node *v) {\n\n  Node *y = &NIL;\n\n  Node *x = root;\n\n  while (x->key != NIL.key)\n\n  {\n\n    y = x;\n\n    if (v->key < x->key) {\n\n      x = x->left;\n\n    }\n\n    else {\n\n      x = x->right;\n    }\n  }\n\n  v->parent = y;\n\n  if (y->key == NIL.key) {\n\n    root = v;\n\n  }\n\n  else if (v->key < y->key) {\n\n    y->left = v;\n\n  }\n\n  else {\n\n    y->right = v;\n  }\n}\n\nNode *find(Node *k, ll v)\n\n{\n\n  if (k->key == NIL.key)\n    return &NIL;\n\n  if (k->key == v)\n    return k;\n\n  if (v < k->key)\n    return find(k->left, v);\n\n  return find(k->right, v);\n}\n\nvoid delp12(Node *x) {\n\n  if (x->key == NIL.key)\n    return;\n\n  Node *l = x->left;\n\n  Node *r = x->right;\n\n  Node *pr = x->parent;\n\n  if (l->key == NIL.key\n\n      && r->key == NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = &NIL;\n\n    }\n\n    else\n      pr->right = &NIL;\n\n  }\n\n  else if (l->key != NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = l;\n\n    }\n\n    else\n      pr->right = l;\n\n    l->parent = pr;\n\n  }\n\n  else if (r->key != NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = r;\n\n    }\n\n    else\n      pr->right = r;\n\n    r->parent = pr;\n  }\n}\n\nNode *get_next(Node *k) {\n\n  if (k->key == NIL.key)\n    return &NIL;\n\n  Node *res = get_next(k->left);\n\n  if (res->key != NIL.key)\n    return res;\n\n  return k;\n}\n\nvoid del(Node *x) {\n\n  if (x->key == NIL.key)\n    return;\n\n  Node *l = x->left;\n\n  Node *r = x->right;\n\n  Node *pr = x->parent;\n\n  if (l->key != NIL.key && r->key != NIL.key) {\n\n    Node *nex = get_next(r);\n\n    x->key = nex->key;\n\n    delp12(nex);\n\n  }\n\n  else {\n\n    delp12(x);\n  }\n}\n\nNode *rightRotate(Node *t) {\n\n  Node *s = t->left;\n\n  t->left = s->right;\n\n  s->right = t;\n\n  return s;\n}\n\nNode *leftRotate(Node *t) {\n\n  Node *s = t->right;\n\n  t->right = s->left;\n\n  s->left = t;\n\n  return s;\n}\n\nNode *_insert(Node *t, int key, int priority) {\n\n  if (t->key == NIL.key) {\n\n    return new Node(key, priority);\n  }\n\n  if (key == t->key) {\n\n    return t;\n  }\n\n  if (key < t->key) {\n\n    t->left = _insert(t->left, key, priority);\n\n    if (t->priority < t->left->priority) {\n\n      t = rightRotate(t);\n    }\n\n  }\n\n  else {\n\n    t->right = _insert(t->right, key, priority);\n\n    if (t->priority < t->right->priority) {\n\n      t = leftRotate(t);\n    }\n  }\n\n  return t;\n}\n\nNode *delete1(Node *t, int key);\n\nNode *_delete(Node *t, int key) {\n\n  if (t->left->key == NIL.key && t->right->key == NIL.key) {\n\n    return &NIL;\n\n  }\n\n  else if (t->left->key == NIL.key) {\n\n    t = leftRotate(t);\n\n  }\n\n  else if (t->right->key == NIL.key) {\n\n    t = rightRotate(t);\n\n  }\n\n  else\n\n  {\n\n    if (t->left->priority > t->right->priority) {\n\n      t = rightRotate(t);\n\n    }\n\n    else\n\n      t = leftRotate(t);\n  }\n\n  return delete1(t, key);\n}\n\nNode *delete1(Node *t, int key) {\n\n  if (t->key == NIL.key) {\n\n    return &NIL;\n  }\n\n  if (key < t->key) {\n\n    t->left = delete1(t->left, key);\n\n  }\n\n  else if (key > t->key) {\n\n    t->right = delete1(t->right, key);\n\n  }\n\n  else\n    return _delete(t, key);\n\n  return t;\n}\n\nint H;\n\nint left(int i) { return i * 2 + 1; }\n\nint right(int i) { return i * 2 + 2; }\n\nstruct edge {\n\n  int from, to;\n\n  ll val;\n\n  edge(int from, int to, ll val) : from(from), to(to), val(val) {}\n};\n\nll k;\n\nint _rank[1010];\n\nint temp[1010];\n\nbool compare_sa(int i, int j) {\n\n  if (_rank[i] != _rank[j])\n    return _rank[i] < _rank[j];\n\n  else {\n\n    int ri = i + k <= n ? _rank[i + k] : -1;\n\n    int rj = j + k <= n ? _rank[j + k] : -1;\n\n    return ri < rj;\n  }\n}\n\nvoid construct_sa(string S, int *sa) {\n\n  n = S.length();\n\n  for (size_t i = 0; i <= n; i++)\n\n  {\n\n    sa[i] = i;\n\n    _rank[i] = i < n ? S[i] : -1;\n  }\n\n  for (k = 1; k <= n; k *= 2)\n\n  {\n\n    sort(sa, sa + n + 1, compare_sa);\n\n    temp[sa[0]] = 0;\n\n    for (size_t i = 1; i <= n; i++)\n\n    {\n\n      temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\n    }\n\n    for (size_t i = 0; i <= n; i++)\n\n    {\n\n      _rank[i] = temp[i];\n    }\n  }\n}\n\nbool contain(string S, int *sa, string T) {\n\n  int a = 0, b = S.length();\n\n  while (b - a > 1) {\n\n    int c = (a + b) / 2;\n\n    if (S.compare(sa[c], T.length(), T) < 0)\n      a = c;\n\n    else\n      b = c;\n  }\n\n  return S.compare(sa[b], T.length(), T) == 0;\n}\n\n#define bit(x, v) ((ll)x << v)\n\nclass BIT {\n\n  static const int MAX_N = 500010;\n\npublic:\n  BIT() { memset(bit, 0, sizeof(bit)); }\n\n  ll bit[MAX_N + 1], n;\n\n  ll sum(int i) {\n\n    ll s = 0;\n\n    while (i > 0)\n\n    {\n\n      s += bit[i];\n\n      i -= i & -i;\n    }\n\n    return s;\n  }\n\n  void add(int i, int x) {\n\n    while (i <= n)\n\n    {\n\n      bit[i] += x;\n\n      i += i & -i;\n    }\n  }\n};\n\nstruct UnionFind {\n\n  vector<int> A;\n\n  UnionFind(int n) : A(n, -1) {}\n\n  int find(int x) {\n\n    if (A[x] < 0)\n      return x;\n\n    return A[x] = find(A[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x), y = find(y);\n\n    if (x == y)\n      return;\n\n    if (A[x] > A[y])\n      swap(x, y);\n\n    A[x] += A[y];\n\n    A[y] = x;\n  }\n\n  int ngroups() {\n\n    int ans = 0;\n\n    for (auto a : A)\n      if (a < 0)\n        ans++;\n\n    return ans;\n  }\n};\n\nvoid yes() {\n  cout << \"Yes\\n\";\n  exit(0);\n}\n\nvoid no() {\n  cout << \"No\\n\";\n  exit(0);\n}\n\nvector<ll> getp(ll n) {\n\n  vector<ll> res;\n\n  ll a = 2;\n\n  if (n % 2 == 0) {\n\n    res.push_back(2);\n\n    while (n % 2 == 0)\n      n /= 2;\n  }\n\n  for (ll i = 3; i * i <= n; i += 2)\n\n  {\n\n    if (n % i == 0) {\n\n      res.push_back(i);\n\n      while (n % i == 0)\n        n /= i;\n    }\n  }\n\n  if (n != 1)\n    res.push_back(n);\n\n  return res;\n}\n\nvector<ll> getp2(ll n) {\n\n  vector<ll> res;\n\n  ll a = 2;\n\n  if (n % 2 == 0) {\n\n    while (n % 2 == 0) {\n      n /= 2;\n      res.push_back(2);\n    }\n  }\n\n  for (ll i = 3; i * i <= n; i += 2)\n\n  {\n\n    if (n % i == 0) {\n\n      while (n % i == 0) {\n        n /= i;\n        res.push_back(i);\n      }\n    }\n  }\n\n  if (n != 1)\n    res.push_back(n);\n\n  return res;\n}\n\nvector<pll> getp3(ll n) {\n\n  vector<pll> res;\n\n  ll a = 2;\n\n  int si = 0;\n\n  if (n % 2 == 0) {\n\n    res.push_back(make_pair(2, 0));\n\n    while (n % 2 == 0) {\n      n /= 2;\n      res[si].second++;\n    }\n\n    si++;\n  }\n\n  for (ll i = 3; i * i <= n; i += 2)\n\n  {\n\n    if (n % i == 0) {\n\n      res.push_back(make_pair(i, 0));\n\n      while (n % i == 0) {\n        n /= i;\n        res[si].second++;\n      }\n\n      si++;\n    }\n  }\n\n  if (n != 1) {\n    res.push_back(make_pair(n, 1));\n  }\n\n  return res;\n}\n\nvector<ll> getDivisors(ll n) {\n\n  vector<ll> res;\n\n  ll a = 2;\n\n  res.push_back(1);\n\n  for (ll i = 2; i * i <= n; i++)\n\n  {\n\n    if (n % i == 0) {\n\n      res.push_back(i);\n\n      if (n / i != i)\n\n        res.push_back(n / i);\n    }\n  }\n\n  return res;\n}\n\nstruct ve {\n\npublic:\n  vector<ve> child;\n\n  int _t = INF;\n\n  ve(int t) : _t(t) {}\n\n  ve(ve _left, ve _right) {\n\n    _t = _left._t + _right._t;\n\n    child.push_back(_left);\n\n    child.push_back(_right);\n  }\n\n  bool operator<(const ve &t) const { return _t > t._t; }\n};\n\nvector<bool> elas(ll n) {\n\n  vector<bool> r(n);\n\n  fill(r.begin(), r.end(), 1);\n\n  r[0] = 0;\n\n  r[1] = 0;\n\n  for (ll i = 2; i * i < n; i++)\n\n  {\n\n    if (!r[i])\n      continue;\n\n    ll ti = i * 2;\n\n    while (ti < n)\n\n    {\n\n      r[ti] = false;\n\n      ti += i;\n    }\n  }\n\n  return r;\n}\n\nbool isPrime(ll v) {\n\n  for (ll i = 2; i * i <= v; i++)\n\n  {\n\n    if (v % i == 0)\n      return false;\n  }\n\n  return true;\n}\n\nll getpow(ll b, ll x, ll md) {\n\n  ll t = b;\n\n  ll res = 1;\n\n  while (x > 0)\n\n  {\n\n    if (x & 1) {\n\n      res *= t;\n\n      res %= md;\n    }\n\n    x >>= 1;\n\n    t *= t;\n\n    t %= md;\n  }\n\n  return res;\n}\n\nll getpow(ll b, ll x) { return getpow(b, x, INF); }\n\nclass SegTree {\n\npublic:\n  const static int MAX_N = 100010;\n\n  const static int DAT_SIZE = (1 << 18) - 1;\n\n  int N, Q;\n\n  int A[MAX_N];\n\n  ll data[DAT_SIZE], datb[DAT_SIZE];\n\n  void init(int _n) {\n\n    N = 1;\n\n    while (N < _n)\n      N <<= 1;\n\n    memset(data, 0, sizeof(data));\n\n    memset(datb, 0, sizeof(datb));\n  }\n\n  void init(int _n, ll iv) {\n\n    N = 1;\n\n    while (N < _n)\n      N <<= 1;\n\n    rep(i, DAT_SIZE) {\n\n      data[i] = iv;\n\n      datb[i] = iv;\n    }\n  }\n\n  void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }\n\n  void add(int a, int b, int x, int k, int l, int r) {\n\n    if (a <= l && r <= b) {\n\n      data[k] += x;\n\n    }\n\n    else if (l < b && a < r) {\n\n      datb[k] += (min(b, r) - max(a, l)) * x;\n\n      add(a, b, x, k * 2 + 1, l, (l + r) / 2);\n\n      add(a, b, x, k * 2 + 2, (l + r) / 2, r);\n    }\n  }\n\n  void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }\n\n  void change(int a, int b, int x, int k, int l, int r) {\n\n    if (a <= l && r <= b) {\n\n      data[k] = x;\n\n    }\n\n    else if (l < b && a < r) {\n\n      datb[k] = x;\n\n      change(a, b, x, k * 2 + 1, l, (l + r) / 2);\n\n      change(a, b, x, k * 2 + 2, (l + r) / 2, r);\n    }\n  }\n\n  ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }\n\n  ll sum(int a, int b, int k, int l, int r) {\n\n    if (b <= l || r <= a) {\n\n      return 0;\n    }\n\n    if (a <= l && r <= b) {\n\n      return data[k] * (r - l) + datb[k];\n    }\n\n    ll res = (min(b, r) - max(a, l)) * data[k];\n\n    res += sum(a, b, k * 2 + 1, l, (l + r) / 2);\n\n    res += sum(a, b, k * 2 + 2, (l + r) / 2, r);\n\n    return res;\n  }\n};\n\nclass Segment;\n\nclass Circle;\n\nclass Point {\n\npublic:\n  double x, y;\n\n  Point(double x = 0, double y = 0) : x(x), y(y) {}\n\n  Point operator+(Point p) { return Point(x + p.x, y + p.y); }\n\n  Point operator-(Point p) { return Point(x - p.x, y - p.y); }\n\n  Point operator*(double a) { return Point(a * x, a * y); }\n\n  Point operator/(double a) { return Point(x / a, y / a); }\n\n  double abs() { return sqrt(norm()); }\n\n  double norm() { return x * x + y * y; }\n\n  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const Point &p) const { return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS; }\n\n  static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }\n\n  static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }\n\n  static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }\n\n  static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {\n\n    return isOrthogonal(a1 - a2, b1 - b2);\n  }\n\n  static bool isOrthogonal(Segment s1, Segment s2);\n\n  static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }\n\n  static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {\n\n    return isPalallel(a1 - a2, b1 - b2);\n  }\n\n  static bool isPalallel(Segment s1, Segment s2);\n\n  static const int COUNTER_CLOCKWISE = 1;\n\n  static const int CLOCKWISE = -1;\n\n  static const int ONLINE_BACK = 2;\n\n  static const int ONLINE_FRONT = -2;\n\n  static const int ON_SEGMENT = 0;\n\n  static int ccw(Point p0, Point p1, Point p2) {\n\n    Point a = p1 - p0;\n\n    Point b = p2 - p0;\n\n    if (cross(a, b) > EPS)\n      return COUNTER_CLOCKWISE;\n\n    if (cross(a, b) < -EPS)\n      return CLOCKWISE;\n\n    if (dot(a, b) < -EPS)\n      return ONLINE_BACK;\n\n    if (a.norm() < b.norm())\n      return ONLINE_FRONT;\n\n    return ON_SEGMENT;\n  }\n\n  static bool intersect(Point p1, Point p2, Point p3, Point p4) {\n\n    return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0\n\n            && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);\n  }\n\n  static bool intersect(Segment s1, Segment s2);\n\n  static Point project(Segment s, Point p);\n\n  static Point reflect(Segment s, Point p);\n\n  static Point getDistance(Point a, Point b) { return (a - b).abs(); }\n\n  static double getDistanceLP(Segment s, Point p);\n\n  static double getDistanceSP(Segment s, Point p);\n\n  static double getDistance(Segment s1, Segment s2);\n\n  static Point getIntersection(Segment s1, Segment s2);\n\n  static pair<Point, Point> crossPoints(Circle c, Segment s);\n};\n\nclass Segment {\n\npublic:\n  Point p1, p2;\n\n  Segment() {}\n\n  Segment(Point p1, Point p2) : p1(p1), p2(p2) {}\n\n  Point p1tp2() { return p2 - p1; }\n\n  Point p2tp1() { return p1 - p2; }\n\n  double abs() { return std::abs(norm()); }\n\n  double norm() { return (p2 - p1).norm(); }\n};\n\nbool Point::isOrthogonal(Segment s1, Segment s2) {\n\n  return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\n}\n\nbool Point::isPalallel(Segment s1, Segment s2) {\n\n  return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\n}\n\nbool Point::intersect(Segment s1, Segment s2) { return intersect(s1.p1, s1.p2, s2.p1, s2.p2); }\n\nPoint Point::project(Segment s, Point p) {\n\n  Point base = s.p2 - s.p1;\n\n  double r = Point::dot(p - s.p1, base) / base.norm();\n\n  return s.p1 + base * r;\n}\n\nPoint Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }\n\ndouble Point::getDistanceLP(Segment s, Point p) {\n\n  return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());\n}\n\ndouble Point::getDistanceSP(Segment s, Point p) {\n\n  if (dot(s.p2 - s.p1, p - s.p1) < 0.0)\n    return (p - s.p1).abs();\n\n  if (dot(s.p1 - s.p2, p - s.p2) < 0.0)\n    return (p - s.p2).abs();\n\n  return getDistanceLP(s, p);\n}\n\ndouble Point::getDistance(Segment s1, Segment s2) {\n\n  if (intersect(s1, s2))\n    return 0.0;\n\n  return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)\n\n                                            ,\n              getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});\n}\n\nPoint Point::getIntersection(Segment s1, Segment s2) {\n\n  auto bs = s1.p2 - s1.p1;\n\n  auto n1 = s2.p1 - s1.p1;\n\n  auto n2 = s2.p2 - s1.p1;\n\n  auto c1 = std::abs(cross(n1, bs)) / bs.norm();\n\n  auto c2 = std::abs(cross(n2, bs)) / bs.norm();\n\n  return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));\n}\n\ndouble arg(Point p) { return atan2(p.y, p.x); }\n\nPoint polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }\n\nclass Circle {\n\npublic:\n  Point c;\n\n  double r;\n\n  Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}\n\n  static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {\n\n    double d = (c1.c - c2.c).abs();\n\n    double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n\n    double t = arg(c2.c - c1.c);\n\n    return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));\n  }\n};\n\npair<Point, Point> Point::crossPoints(Circle c, Segment s) {\n\n  auto pp = project(s, c.c);\n\n  auto f = (pp - c.c).norm();\n\n  auto mu = sqrt(c.r * c.r - f);\n\n  auto e = s.p1tp2() / s.p1tp2().abs();\n\n  return make_pair(pp + e * mu, pp - e * mu);\n}\n\nll divRm(string s, ll x) {\n\n  ll r = 0;\n\n  for (size_t i = 0; i < s.size(); i++)\n\n  {\n\n    r *= 10;\n\n    r += s[i] - '0';\n\n    r %= x;\n  }\n\n  return r;\n}\n\nll cmbi(ll x, ll b) {\n\n  ll res = 1;\n\n  for (size_t i = 0; i < b; i++)\n\n  {\n\n    res *= x - i;\n\n    res %= INF;\n\n    res *= inv[b - i];\n\n    res %= INF;\n  }\n\n  return res;\n}\n\nvoid dfs(string s, char a) {\n\n  if (s.size() == n) {\n\n    cout << s << endl;\n\n    return;\n  }\n\n  for (char b = 'a'; b <= a; b++)\n\n  {\n\n    dfs(s + b, (b == a) ? (char)(a + 1) : a);\n  }\n}\n\nbool match(char a, char b) { return a == '?' || b == '?' || a == b; }\n\nbool between(ll x, ll y1, ll y2) {\n\n  if (y1 > y2)\n    swap(y1, y2);\n\n  y1++;\n  y2--;\n\n  if (!(y1 <= y2))\n    return false;\n\n  while (x > 0)\n\n  {\n\n    if (x % 3 == 1) {\n\n      if (y2 - y1 > 3)\n        return true;\n\n      for (ll y = y1; y <= y2; y++)\n        if (y % 3 == 1)\n          return true;\n    }\n\n    x /= 3;\n\n    y1 /= 3;\n\n    y2 /= 3;\n  }\n\n  return false;\n}\n\nll get_extra(ll x1, ll y1, ll x2, ll y2) {\n\n  ll ans = 0;\n\n  int i;\n\n  ll three = 1;\n\n  rep(i, 36) {\n\n    if (x1 / three == x2 / three && between(x1 / three, y1 / three, y2 / three)) {\n\n      ll tmp = min(min(x1 % three, x2 % three) + 1, three - max(x1 % three, x2 % three));\n\n      ans = max(ans, tmp);\n    }\n\n    three *= 3;\n  }\n\n  return ans;\n}\n\nll get_dist(ll x1, ll y1, ll x2, ll y2)\n\n{\n\n  return abs(x1 - x2) + abs(y1 - y2) +\n         2 * max(get_extra(x1, y1, x2, y2), get_extra(y1, x1, y2, x2));\n}\n\nll memo[62][2];\n\nll ar[100010];\n\nll m = 60;\n\nll bdp(int i, bool tite) {\n\n  if (~memo[i][tite])\n    return memo[i][tite];\n\n  if (i > m)\n    return 0;\n\n  ll res = 0;\n\n  ll cn = 0;\n\n  ll base = (1LL << (m - i));\n\n  rep(j, n) { cn += (ar[j] & base) > 0; }\n\n  if (tite) {\n\n    ll p = (k & base);\n\n    if (p == 0) {\n\n      res = bdp(i + 1, tite) + cn * base;\n\n    }\n\n    else {\n\n      res = bdp(i + 1, true) + (n - cn) * base;\n\n      res = max(res, bdp(i + 1, false) + cn * base);\n    }\n\n  }\n\n  else {\n\n    res = bdp(i + 1, false) + max(cn, (n - cn)) * base;\n  }\n\n  return memo[i][tite] = res;\n}\n\ndouble digsum(ll x) {\n\n  ll res = 0;\n\n  while (x > 0)\n\n  {\n\n    res += x % 10;\n\n    x /= 10;\n  }\n\n  return res;\n}\n\nmap<pair<string, string>, ll> getPattern(string s) {\n\n  map<pair<string, string>, ll> mp;\n\n  for (ll i = 0; i < (1 << n); i++)\n\n  {\n\n    string s1 = \"\";\n\n    string s2 = \"\";\n\n    for (int j = 0; j < n; j++)\n\n    {\n\n      if (i & (1 << j)) {\n\n        s1 += s[j];\n\n      }\n\n      else {\n\n        s2 += s[j];\n      }\n    }\n\n    mp[make_pair(s1, s2)]++;\n  }\n\n  return mp;\n}\n\nvoid solv() {\n\n  cin >> n;\n\n  if (n == 0) {\n\n    cout << 0 << endl;\n\n    return;\n  }\n\n  vector<int> res;\n\n  while (n != 0)\n\n  {\n\n    auto v = abs(n) % 2;\n\n    res.push_back(v);\n\n    n -= v;\n\n    n /= -2;\n  }\n\n  reverse(all(res));\n\n  rep(i, res.size()) { cout << res[i]; }\n\n  cout << endl;\n}\n\nint main() {\n\n  solv();\n\n  return 0;\n}"}
{"fast_code_id":"cee9210fba3cd8d5103f0a8b03eef2a4e3fe7d4d55b7d09203797cb0038c2280","fast_id":"370691dc67835c538e21802f571381c363c04a496db8207f3dfa0d53aecae903","fast_time":0.0193482372,"language":"cpp","measured_fast_code_id":"370691dc67835c538e21802f571381c363c04a496db8207f3dfa0d53aecae903","measured_slow_code_id":"05479d6c68941e42eb7a7c5ee15510cb926f7414774d1caf35b328fb81bcd61b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11501","problem_id":"p03147","slow_code_id":"e2306bc7a85786a184fc53392ec5d0d825e4609ae1d0f374879f0381923cf7e8","slow_id":"05479d6c68941e42eb7a7c5ee15510cb926f7414774d1caf35b328fb81bcd61b","slow_time":0.0888477704,"speedup":4.592034379235334,"stratum":"4-8","sampling_key":"e0f2fb6b7c3c91ecb8a2b5362b85b36e22fca4826dd1b74728af52865ef3f31a","slow_code":"#include <cstdio>\n\n#include <vector>\n\n#include <algorithm>\n\nint main() {\n\n  int N;\n\n  scanf(\"%d\", &N);\n\n  char *map[101];\n\n  for (int i = 0; i < 101; i++) {\n\n    map[i] = new char[N + 1];\n\n    map[i][0] = 0;\n  }\n\n  int tmp;\n\n  for (int i = 1; i < N + 1; i++) {\n\n    scanf(\"%d\", &tmp);\n\n    for (int j = 0; j < 101; j++) {\n\n      if (j < tmp)\n\n        map[j][i] = 1;\n\n      else\n\n        map[j][i] = 0;\n    }\n  }\n\n  int count = 0;\n\n  for (int i = 0; i < 101; i++) {\n\n    for (int j = 0; j < N; j++) {\n\n      if (map[i][j] == 0 && map[i][j + 1] == 1)\n        count++;\n    }\n  }\n\n  printf(\"%d\\n\", count);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nint main() {\n\n  int N;\n\n  scanf(\"%d\", &N);\n\n  char map[100][100 + 1];\n\n  memset(map, 0, sizeof(map));\n\n  int tmp;\n\n  for (int i = 1; i < N + 1; i++) {\n\n    scanf(\"%d\", &tmp);\n\n    for (int j = 0; j < 100; j++) {\n\n      map[j][i] = (j < tmp) ? 1 : 0;\n    }\n  }\n\n  int count = 0;\n\n  for (int i = 0; i < 100; i++) {\n\n    for (int j = 0; j < N; j++) {\n\n      if (map[i][j] == 0 && map[i][j + 1] == 1)\n        count++;\n    }\n  }\n\n  printf(\"%d\\n\", count);\n\n  return 0;\n}\n"}
{"fast_code_id":"8af1e73fc92464604de159b143e92a83b1b6411c1b3ae484ca7476af33881a98","fast_id":"db36ac389e19ba6e72fc3e6a0da0474dabc0e189305d8627e39f7192949ba6f2","fast_time":0.1066023172,"language":"cpp","measured_fast_code_id":"db36ac389e19ba6e72fc3e6a0da0474dabc0e189305d8627e39f7192949ba6f2","measured_slow_code_id":"d949aa518cd2ef6f0937a3f161e3ca3bc1ea06e038ba1ba0cc980fd2ca5d930a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11589","problem_id":"p02678","slow_code_id":"580ec58d04c34aaa2cc4a320cbe0854f4e7f0500a0890f96f4b6f654d0289c7e","slow_id":"d949aa518cd2ef6f0937a3f161e3ca3bc1ea06e038ba1ba0cc980fd2ca5d930a","slow_time":1.1784988638,"speedup":11.055096125058714,"stratum":"8+","sampling_key":"2da10ddc206743ca958ea0ee2258b6c569ad8898d6ba526e03bf7aa6075558cd","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst ll inf = 1e9;\n\n#define sz 300005\n\n#define Fast                                                                                       \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0);\n\nint par[sz];\n\nbool vis[sz];\n\nvector<int> V[sz];\n\nvoid bfs(int src) {\n\n  memset(vis, 0, sizeof(vis));\n\n  memset(par, 0, sizeof(par));\n\n  queue<int> q;\n\n  q.push(1);\n\n  vis[1] = 0;\n\n  while (!q.empty()) {\n\n    int u = q.front();\n\n    q.pop();\n\n    for (int i = 0; i < V[u].size(); i++) {\n\n      int v = V[u][i];\n\n      if (vis[v] == 0) {\n\n        par[v] = u;\n\n        vis[v] = 1;\n\n        q.push(v);\n      }\n    }\n  }\n}\n\nint main() {\n\n  Fast;\n\n  int a, b, c, i, j, n, m, t, cs = 1;\n\n  cin >> n >> m;\n\n  for (i = 0; i < m; i++) {\n\n    cin >> a >> b;\n\n    V[a].push_back(b);\n\n    V[b].push_back(a);\n  }\n\n  bfs(1);\n\n  bool flag = true;\n\n  vector<int> pp;\n\n  for (i = 2; i <= n; i++) {\n\n    if (par[i] == 0) {\n\n      flag = false;\n      break;\n    }\n\n    pp.push_back(par[i]);\n  }\n\n  if (!flag) {\n\n    cout << \"No\" << endl;\n\n  }\n\n  else {\n\n    cout << \"Yes\" << endl;\n\n    for (i = 0; i < n - 1; i++) {\n\n      cout << pp[i] << endl;\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nll n;\n\nint visited[200005], high[200005];\n\ntypedef struct ANode {\n\n  long long adjvex;\n\n  struct ANode *nextarc;\n\n} ArcNode;\n\ntypedef struct Vnode {\n\n  int count;\n\n  ArcNode *firstarc;\n\n} VNode;\n\ntypedef struct node {\n\n  VNode adjlist[100005];\n\n} AdjGraph;\n\nvoid add(AdjGraph *G, ll u, ll v) {\n\n  ArcNode *p;\n\n  p = (ArcNode *)malloc(sizeof(ArcNode));\n\n  p->adjvex = v;\n\n  p->nextarc = G->adjlist[u].firstarc;\n\n  G->adjlist[u].firstarc = p;\n\n  p = (ArcNode *)malloc(sizeof(ArcNode));\n\n  p->adjvex = u;\n\n  p->nextarc = G->adjlist[v].firstarc;\n\n  G->adjlist[v].firstarc = p;\n}\n\nvoid BFS(AdjGraph *G) {\n\n  ll w, i;\n\n  ArcNode *p;\n\n  queue<long long> qu;\n\n  for (i = 1; i <= n; i++)\n    visited[i] = 0;\n\n  visited[1] = 1;\n\n  qu.push(1);\n\n  while (qu.size()) {\n\n    w = qu.front();\n\n    qu.pop();\n\n    p = G->adjlist[w].firstarc;\n\n    while (p != NULL) {\n\n      if (visited[p->adjvex] == 0) {\n\n        visited[p->adjvex] = 1;\n\n        high[p->adjvex] = w;\n\n        qu.push(p->adjvex);\n      }\n\n      p = p->nextarc;\n    }\n  }\n}\n\nint main() {\n\n  ll a, b, m;\n\n  AdjGraph *G;\n\n  G = (AdjGraph *)malloc(sizeof(AdjGraph));\n\n  cin >> n >> m;\n\n  for (ll i = 1; i <= m; i++) {\n\n    cin >> a >> b;\n\n    add(G, a, b);\n  }\n\n  for (ll i = 1; i <= n; i++)\n\n    high[i] = 0;\n\n  BFS(G);\n\n  for (ll i = 1; i <= n; i++)\n\n    if (!visited[i]) {\n\n      cout << \"No\" << endl;\n\n      return 0;\n    }\n\n  cout << \"Yes\" << endl;\n\n  for (ll i = 2; i <= n; i++) {\n\n    cout << high[i] << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"e5894ae56b56ac1bfdaa77342d3fdd4baa5157a012a691de5dbc8d0e017c4eb2","fast_id":"42aba6d1bd026837fb9f0af46d094595f8b83c534cbed0649338d8eb591b76e3","fast_time":0.0201037728,"language":"cpp","measured_fast_code_id":"42aba6d1bd026837fb9f0af46d094595f8b83c534cbed0649338d8eb591b76e3","measured_slow_code_id":"787a7be6a9f4be732c74f38c2a5f3da095bbb14884fc7f72cba67bbcda3fa335","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11638","problem_id":"p03684","slow_code_id":"165df3ae9ad4ac9893f454b369461a0c10af082d155b77c1cb6a0adcefb33097","slow_id":"787a7be6a9f4be732c74f38c2a5f3da095bbb14884fc7f72cba67bbcda3fa335","slow_time":0.3750119141,"speedup":18.653807811636234,"stratum":"8+","sampling_key":"60289534e07c5747333de43ca928c4cba4718ce37552927ec4ef63b45c9685a6","slow_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\n#define fi first\n\n#define se second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define fbo find_by_order\n\n#define ook order_of_key\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> ii;\n\ntypedef vector<int> vi;\n\ntypedef long double ld;\n\ntypedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;\n\nbool marked[100001];\n\nvector<ii> v[100001];\n\nll prim(int k) {\n\n  priority_queue<ii, vector<ii>, greater<ii> > q;\n\n  ll u;\n\n  long long minimumCost = 0;\n\n  ii p;\n\n  q.push(mp(0, k));\n\n  while (!q.empty())\n\n  {\n\n    p = q.top();\n\n    q.pop();\n\n    k = p.second;\n\n    if (marked[k] == true)\n\n      continue;\n\n    minimumCost += p.fi;\n\n    marked[k] = true;\n\n    for (ll i = 0; i < v[k].size(); ++i)\n\n    {\n\n      u = v[k][i].se;\n\n      if (marked[u] == false)\n\n        q.push(v[k][i]);\n    }\n  }\n\n  return minimumCost;\n}\n\nint main() {\n\n  std::ios::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  long long n;\n\n  cin >> n;\n\n  vector<ii> x;\n\n  vector<ii> y;\n\n  for (ll i = 0; i < n; i++) {\n\n    ll a, b;\n\n    cin >> a >> b;\n\n    x.pb(mp(a, i));\n\n    y.pb(mp(b, i));\n  }\n\n  sort(x.begin(), x.end());\n\n  sort(y.begin(), y.end());\n\n  for (ll i = 0; i < n - 1; i++) {\n\n    v[x[i].se].pb(mp(x[i + 1].fi - x[i].fi, x[i + 1].se));\n\n    v[x[i + 1].se].pb(mp(x[i + 1].fi - x[i].fi, x[i].se));\n\n    v[y[i].se].pb(mp(y[i + 1].fi - y[i].fi, y[i + 1].se));\n\n    v[y[i + 1].se].pb(mp(y[i + 1].fi - y[i].fi, y[i].se));\n  }\n\n  ll ans = prim(0);\n\n  cout << ans;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <algorithm>\n\nconst int N = 100010, M = N + N;\n\nint x[N], y[N], id[N], n;\n\ntypedef struct ufset *UFset;\n\nstruct ufset\n\n{\n\n  int *parent;\n\n  int *root;\n};\n\nUFset UFinit(int size)\n\n{\n\n  int e;\n\n  UFset U = (UFset)malloc(sizeof *U);\n\n  U->parent = (int *)malloc((size + 1) * sizeof(int));\n\n  U->root = (int *)malloc((size + 1) * sizeof(int));\n\n  for (e = 1; e <= size; e++)\n\n  {\n\n    U->parent[e] = 1;\n\n    U->root[e] = 1;\n  }\n\n  return U;\n}\n\nint UFfind(int e, UFset U)\n\n{\n\n  int i, j = e;\n\n  while (!U->root[j])\n    j = U->parent[j];\n\n  while (j != e) {\n\n    i = U->parent[e];\n\n    U->parent[e] = j;\n\n    e = i;\n  }\n\n  return j;\n}\n\nint UFunion(int i, int j, UFset U)\n\n{\n\n  if (U->parent[i] < U->parent[j])\n\n  {\n\n    U->parent[j] += U->parent[i];\n\n    U->root[i] = 0;\n\n    U->parent[i] = j;\n\n    return j;\n\n  }\n\n  else\n\n  {\n\n    U->parent[i] += U->parent[j];\n\n    U->root[j] = 0;\n\n    U->parent[j] = i;\n\n    return i;\n  }\n}\n\nstruct Edge\n\n{\n\n  int u, v, cost;\n\n  bool operator<(const Edge &b) const\n\n  {\n\n    return cost < b.cost;\n  }\n\n} edge[M];\n\nint tot;\n\nbool cmpX(int a, int b)\n\n{\n\n  return x[a] < x[b];\n}\n\nbool cmpY(int a, int b)\n\n{\n\n  return y[a] < y[b];\n}\n\nvoid add(int c, int a, int b)\n\n{\n\n  edge[tot].cost = c;\n\n  edge[tot].u = a;\n\n  edge[tot++].v = b;\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  int i;\n\n  for (i = 1; i <= n; ++i)\n\n  {\n\n    scanf(\"%d%d\", x + i, y + i);\n\n    id[i] = i;\n  }\n\n  std::sort(id + 1, id + n + 1, cmpX);\n\n  for (i = 2; i <= n; ++i)\n\n    add(x[id[i]] - x[id[i - 1]], id[i], id[i - 1]);\n\n  std::sort(id + 1, id + n + 1, cmpY);\n\n  for (i = 2; i <= n; ++i)\n\n    add(y[id[i]] - y[id[i - 1]], id[i], id[i - 1]);\n\n  UFset UFS = UFinit(n);\n\n  std::sort(edge, edge + tot);\n\n  long long totcost = 0;\n\n  for (i = 0; i < tot; ++i)\n\n  {\n\n    int u = edge[i].u, v = edge[i].v;\n\n    u = UFfind(u, UFS), v = UFfind(v, UFS);\n\n    if (u != v)\n\n    {\n\n      UFunion(u, v, UFS);\n\n      totcost += edge[i].cost;\n    }\n  }\n\n  printf(\"%lld\\n\", totcost);\n\n  return 0;\n}"}
{"fast_code_id":"18baba4fbfb4c76846cfde8f64e8f203657bf68a2ad9aa0f3e72736bc7c471dc","fast_id":"29e08bc06e1c44efbccbf7f2cb420e2030c4f5311f22fca38fb6b472b0eed876","fast_time":0.019856237,"language":"cpp","measured_fast_code_id":"29e08bc06e1c44efbccbf7f2cb420e2030c4f5311f22fca38fb6b472b0eed876","measured_slow_code_id":"5659ec34740aa665ebe04d6bb292e8de64889d9086d26d46b89c63bfb1c8d9dc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11806","problem_id":"p02728","slow_code_id":"af1b94471e06bff5532e6101b158df333b97232b4938b0561e67c539b055ed24","slow_id":"5659ec34740aa665ebe04d6bb292e8de64889d9086d26d46b89c63bfb1c8d9dc","slow_time":0.6252231437,"speedup":31.487494015104676,"stratum":"8+","sampling_key":"377310889c332ee7fed3b84af057d3d14f2a7b4fb262956dd13f878ce0e7756f","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <array>\n\n#include <bitset>\n\n#include <cassert>\n\n#include <cstring>\n\n#include <complex>\n\n#include <deque>\n\n#include <functional>\n\n#include <initializer_list>\n\n#include <math.h>\n\n#include <map>\n\n#include <random>\n\n#include <set>\n\n#include <stack>\n\n#include <tuple>\n\n#include <type_traits>\n\n#include <queue>\n\n#include <vector>\n\nusing lli = long long int;\n\nusing pii = std::pair<int, int>;\n\n#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))\n\nconstexpr std::array<std::pair<int, int>, 4> dxdy = {\n\n    {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}\n\n};\n\ntemplate <typename T> inline bool chmin(T &a, const T b) {\n  if (b < a) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <typename T> inline bool chmax(T &a, const T b) {\n  if (a < b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <typename T> inline bool bitUP(const T state, const unsigned int k) {\n  return (state >> k) & 0b01;\n}\n\ninline bool isIn(int x, int y, int H, int W) { return 0 <= x and x < H and 0 <= y and y < W; }\n\ninline auto isInTheGrid(const int H, const int W) {\n\n  return std::bind(isIn, std::placeholders::_1, std::placeholders::_2, H, W);\n}\n\ntemplate <class element_t>\n\nstd::vector<element_t> make_vector(const unsigned int n, const element_t &init_value) {\n  return std::vector<element_t>(n, init_value);\n}\n\ntemplate <class element_t, class... Tp>\n\nauto make_vector(const unsigned int n, const unsigned int m, Tp... args) {\n\n  return std::vector<decltype(make_vector<element_t>(m, args...))>(\n      n, make_vector<element_t>(m, args...));\n}\n\nnamespace MyInputAndOutput {\n\nclass user_input {\n\nprivate:\n  static constexpr unsigned int sizeOfAscii = 128;\n\n  bool isBlankChar[sizeOfAscii];\n\n#if defined(__APPLE__)\n\n#define DAGGER_GETCHAR_UNLOCKED_DAGGER getchar_unlocked\n\n#elif defined(_WIN32) || defined(_WIN64)\n\n#define DAGGER_GETCHAR_UNLOCKED_DAGGER _getchar_nolock\n\n#elif defined(__linux)\n\n#if _POSIX_C_SOURCE >= 1 || _XOPEN_SOURCE || _POSIX_SOURCE || _BSD_SOURCE || _SVID_SOURCE\n\n#define DAGGER_GETCHAR_UNLOCKED_DAGGER getchar_unlocked\n\n#else\n\n#define DAGGER_GETCHAR_UNLOCKED_DAGGER getchar\n\n#endif\n\n#else\n\n#define DAGGER_GETCHAR_UNLOCKED_DAGGER getchar\n\n#endif\n\n  template <typename Tp>\n\n  inline void charToInteger(Tp &val) const {\n\n    val = 0;\n    int c;\n    while (true) {\n\n      c = DAGGER_GETCHAR_UNLOCKED_DAGGER();\n\n      if (c == EOF)\n        return;\n\n      if ('-' or (not isBlankChar[c]))\n        break;\n    }\n\n    if (c == '-') {\n\n      while (true) {\n\n        c = DAGGER_GETCHAR_UNLOCKED_DAGGER();\n\n        if (c < '0' or c > '9')\n          break;\n\n        val = 10 * val + c - '0';\n      }\n      val = -val;\n\n    }\n\n    else {\n\n      if (c < '0' or c > '9')\n        return;\n\n      do {\n\n        val = 10 * val + c - '0';\n\n        c = DAGGER_GETCHAR_UNLOCKED_DAGGER();\n\n      } while ('0' <= c and c <= '9');\n    }\n  }\n\n  template <typename Tp>\n\n  inline void charToUnsignedInteger(Tp &val) const {\n\n    val = 0;\n    int c;\n    while (true) {\n\n      c = DAGGER_GETCHAR_UNLOCKED_DAGGER();\n\n      if (c == EOF)\n        return;\n\n      if (not isBlankChar[c])\n        break;\n    }\n\n    if (c < '0' or c > '9')\n      return;\n\n    do {\n\n      val = 10 * val + c - '0';\n\n      c = DAGGER_GETCHAR_UNLOCKED_DAGGER();\n\n    } while (not(c == EOF or isBlankChar[c]));\n  }\n\npublic:\n  constexpr user_input(void) : isBlankChar() {\n\n    for (unsigned int i = 0; i < sizeOfAscii; ++i)\n      isBlankChar[i] = false;\n\n    isBlankChar[int('\\n')] = true;\n    isBlankChar[int('\\t')] = true;\n\n    isBlankChar[int(' ')] = true;\n    isBlankChar[int('\\v')] = true;\n  }\n\n  inline const user_input &operator>>(int &int_arg) const {\n\n    charToInteger<int>(int_arg);\n    return *this;\n  }\n\n  inline const user_input &operator>>(long long int &llint_arg) const {\n\n    charToInteger<long long int>(llint_arg);\n    return *this;\n  }\n\n  inline const user_input &operator>>(unsigned int &uint_arg) const {\n\n    charToUnsignedInteger<unsigned int>(uint_arg);\n    return *this;\n  }\n\n  inline const user_input &operator>>(unsigned long long int &ullint_arg) const {\n\n    charToUnsignedInteger<unsigned long long int>(ullint_arg);\n    return *this;\n  }\n\n  inline const user_input &operator>>(unsigned long &ulint_arg) const {\n\n    charToUnsignedInteger<unsigned long>(ulint_arg);\n    return *this;\n  }\n\n  inline const user_input &operator>>(float &float_arg) const {\n\n    scanf(\"%f\", &float_arg);\n    return *this;\n  }\n\n  inline const user_input &operator>>(double &double_arg) const {\n\n    scanf(\"%lf\", &double_arg);\n    return *this;\n  }\n\n  inline const user_input &operator>>(long double &ldouble_arg) const {\n\n    scanf(\"%Lf\", &ldouble_arg);\n    return *this;\n  }\n\n  inline const user_input &operator>>(char *str_arg) const {\n\n    scanf(\"%s\", str_arg);\n\n    return *this;\n  }\n\n  inline const user_input &operator>>(char &char_arg) const {\n\n    do {\n\n      if ((char_arg = DAGGER_GETCHAR_UNLOCKED_DAGGER()) == EOF)\n        return *this;\n\n    } while (isBlankChar[int(char_arg)]);\n\n    return *this;\n  }\n\n  inline const user_input &operator>>(std::string &str_arg) const {\n\n    str_arg.erase();\n\n    int c;\n    while (true) {\n\n      c = DAGGER_GETCHAR_UNLOCKED_DAGGER();\n\n      if (c == EOF)\n        return *this;\n\n      if (not isBlankChar[c])\n        break;\n    }\n\n    constexpr unsigned int buffer_size = 128;\n\n    char buffer_input[buffer_size];\n    unsigned int buffer_length = 0;\n\n    do {\n\n      buffer_input[buffer_length++] = c;\n\n      if (buffer_length == buffer_size) {\n\n        buffer_length = 0;\n        str_arg.append(buffer_input, buffer_size);\n      }\n\n      c = DAGGER_GETCHAR_UNLOCKED_DAGGER();\n\n    } while (c != EOF and (not isBlankChar[c]));\n\n    str_arg.append(buffer_input, buffer_length);\n\n    return *this;\n  }\n\n  template <typename S, typename T>\n\n  inline const user_input &operator>>(std::pair<S, T> &pair_arg) const {\n\n    (*this) >> pair_arg.first >> pair_arg.second;\n    return *this;\n  }\n\n  template <typename T>\n\n  inline const user_input &operator>>(std::vector<T> &vec) const {\n\n    for (T &ele : vec)\n      (*this) >> ele;\n\n    return *this;\n  }\n\n#undef DAGGER_GETCHAR_UNLOCKED_DAGGER\n};\nconstexpr user_input cin;\n\nvoid ends(void) { putchar('\\0'); }\n\nvoid endl(void) {\n  putchar('\\n');\n  fflush(stdout);\n}\n\nvoid flush(void) { fflush(stdout); }\n\nconstexpr char eol = '\\n';\n\nclass user_output {\n\npublic:\n  constexpr user_output(void) {}\n\n  inline const user_output &operator<<(const int int_arg) const {\n\n    printf(\"%d\", int_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const unsigned int uint_arg) const {\n\n    printf(\"%u\", uint_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const long long int llint_arg) const {\n\n    printf(\"%lld\", llint_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const unsigned long long int ullint_arg) const {\n\n    printf(\"%llu\", ullint_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const unsigned long ulint_arg) const {\n\n    printf(\"%lu\", ulint_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const float flt_arg) const {\n\n    printf(\"%.16f\", flt_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const double ld_arg) const {\n\n    printf(\"%.16lf\", ld_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const long double ld_arg) const {\n\n    printf(\"%.16Lf\", ld_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const char char_arg) const {\n\n    putchar(char_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const unsigned char uchar_arg) const {\n\n    putchar(uchar_arg);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const char *str_arg) const {\n\n    fputs(str_arg, stdout);\n    return *this;\n  }\n\n  inline const user_output &operator<<(const std::string &str_arg) const {\n\n    fputs(str_arg.c_str(), stdout);\n    return *this;\n  }\n\n  inline const user_output &operator<<(void (*const func_arg)(void)) const {\n\n    func_arg();\n    return *this;\n  }\n\n  template <typename S, typename T>\n\n  inline const user_output &operator<<(const std::pair<S, T> &pair_arg) const {\n\n    (*this) << pair_arg.first << ' ' << pair_arg.second;\n    return *this;\n  }\n\n  template <typename Tp_name>\n\n  inline const user_output &operator<<(const std::vector<Tp_name> &vec) const {\n\n    const size_t size_of_vec = vec.size();\n\n    if (size_of_vec <= 0)\n      return *this;\n\n    (*this) << vec[0];\n\n    for (size_t index = 1; index < size_of_vec; ++index)\n      (*this) << ' ' << vec[index];\n\n    return *this;\n  }\n};\nconstexpr user_output cout;\n\nvoid binary_output(int64_t value, size_t length = 64) {\n\n  char out[length + 1];\n\n  for (size_t i = 0; i < length; ++i)\n    out[length - 1 - i] = ((value >> i) & 1) ? '1' : '0';\n\n  out[length] = '\\0';\n  puts(out);\n}\n\ntemplate <typename InputType>\n\nvoid print(InputType first, InputType last, const char separate_c = ' ', const char end_c = '\\n') {\n\n  InputType it = first;\n\n  while (true) {\n\n    MyInputAndOutput::cout << *it;\n\n    if (++it == last) {\n      MyInputAndOutput::cout << end_c;\n      return;\n    }\n\n    MyInputAndOutput::cout << separate_c;\n  }\n}\n\n};                              \nnamespace MIO = MyInputAndOutput;\n\ntemplate <class T> std::vector<unsigned int> z_algorithm(const T &str) {\n\n  const size_t n = str.size();\n\n  std::vector<unsigned int> resOfCP(n);\n  resOfCP[0] = n;\n\n  int i = 1, j = 0;\n\n  while (i < n) {\n\n    while (i + j < n and str[j] == str[i + j])\n      ++j;\n\n    resOfCP[i] = j;\n\n    if (j == 0) {\n      ++i;\n      continue;\n    }\n\n    int k = 1;\n\n    while (i + k < n and k + resOfCP[k] < j)\n      resOfCP[i + k] = resOfCP[k], ++k;\n\n    i += k;\n    j -= k;\n  }\n\n  return resOfCP;\n}\n\nusing MIO::cin;\nusing MIO::cout;\nusing MIO::eol;\n\ntemplate <class reroot_structure_type>\n\nclass ReRooting {\n\nprivate:\n  const unsigned int n;\n\n  const unsigned int theRoot;\n\n  using element_t = typename reroot_structure_type::element_t;\n\n  using weight_t = typename reroot_structure_type::weight_t;\n\n  struct edge_t {\n\n    unsigned int to;\n\n    weight_t weight;\n\n    edge_t(const unsigned int to = 0,\n\n           const weight_t &weight = reroot_structure_type::id_weight())\n\n        : to(to), weight(weight) {}\n  };\n\n  std::vector<element_t> dp;\n\n  std::vector<std::vector<edge_t>> edge;\n\n  std::vector<unsigned int> order;\n\n  std::vector<unsigned int> parent;\n\n  std::vector<std::vector<element_t>> SL;\n\n  std::vector<std::vector<element_t>> SR;\n\n  void make_order(void) {\n\n    std::vector<bool> yet(n, true);\n\n    order.resize(n);\n    parent.resize(n);\n\n    std::vector<unsigned int> stk;\n    stk.reserve(n);\n\n    unsigned int idx = 0;\n\n    yet[theRoot] = false;\n\n    stk.emplace_back(theRoot);\n    order[idx++] = theRoot;\n\n    while (not stk.empty()) {\n\n      unsigned int v = stk.back();\n      stk.pop_back();\n\n      for (const edge_t &x : edge[v])\n        if (yet[x.to]) {\n\n          yet[x.to] = false;\n\n          parent[x.to] = v;\n          order[idx++] = x.to;\n\n          stk.emplace_back(x.to);\n        }\n    }\n  }\n\n  void dfs(void) {\n\n    dp.assign(n, reroot_structure_type::id_merge());\n\n    SL.assign(n, std::vector<element_t>(0));\n    SR.assign(n, std::vector<element_t>(0));\n\n    for (unsigned int i = 0; i < n; ++i) {\n\n      SL[i].reserve(edge[i].size());\n      SR[i].reserve(edge[i].size());\n    }\n\n    for (unsigned int i = n - 1; i > 0; --i) {\n\n      const unsigned int v = order[i];\n      const unsigned int nv = parent[v];\n\n      dp[v] = reroot_structure_type::update(dp[v]);\n\n      SL[nv].push_back(dp[v]);\n      SR[nv].push_back(dp[v]);\n\n      dp[nv] = reroot_structure_type::merge(dp[v], dp[nv]);\n    }\n\n    {\n\n      const unsigned int v = order[0];\n\n      const unsigned int sz = SL[v].size();\n\n      dp[v] = reroot_structure_type::update(dp[v]);\n\n      element_t vl = reroot_structure_type::id_merge(), vr = reroot_structure_type::id_merge();\n\n      for (unsigned int j1 = 0, j2 = sz - 1; j1 < sz; ++j1, --j2) {\n\n        SR[v][j1] = reroot_structure_type::merge(SR[v][j1], vr);\n        std::swap(SR[v][j1], vr);\n\n        SL[v][j2] = reroot_structure_type::merge(vl, SL[v][j2]);\n        std::swap(SL[v][j2], vl);\n      }\n\n      unsigned int idx = sz - 1;\n\n      for (const edge_t &x : edge[v]) {\n\n        const element_t tmp =\n            reroot_structure_type::update(reroot_structure_type::merge(SL[v][idx], SR[v][idx]));\n\n        dp[x.to] = reroot_structure_type::merge(tmp, dp[x.to]);\n\n        SL[x.to].push_back(tmp);\n        SR[x.to].push_back(tmp);\n\n        --idx;\n      }\n    }\n\n    for (unsigned int i = 1; i < n; ++i) {\n\n      const unsigned int v = order[i];\n\n      const unsigned int sz = SL[v].size();\n\n      element_t vl = reroot_structure_type::id_merge(), vr = reroot_structure_type::id_merge();\n\n      for (unsigned int j1 = 0, j2 = sz - 1; j1 < sz; ++j1, --j2) {\n\n        SR[v][j1] = reroot_structure_type::merge(SR[v][j1], vr);\n        std::swap(SR[v][j1], vr);\n\n        SL[v][j2] = reroot_structure_type::merge(vl, SL[v][j2]);\n        std::swap(SL[v][j2], vl);\n      }\n\n      dp[v] = reroot_structure_type::update(vl);\n\n      unsigned int idx = sz - 2;\n\n      for (const edge_t &x : edge[v])\n        if (x.to != parent[v]) {\n\n          const element_t tmp =\n              reroot_structure_type::update(reroot_structure_type::merge(SL[v][idx], SR[v][idx]));\n\n          dp[x.to] = reroot_structure_type::merge(tmp, dp[x.to]);\n\n          SL[x.to].push_back(tmp);\n          SR[x.to].push_back(tmp);\n\n          --idx;\n        }\n    }\n  }\n\npublic:\n  ReRooting(const unsigned int n, const unsigned int theRoot = 0) : n(n), theRoot(theRoot) {\n    edge.assign(n, std::vector<edge_t>(0));\n  }\n\n  inline void add(const unsigned int u, const unsigned int v,\n                  const weight_t &weight = reroot_structure_type::id_weight()) {\n\n    edge[u].emplace_back(v, weight);\n  }\n\n  inline void build(void) {\n    make_order();\n    dfs();\n  }\n\n  inline const element_t &operator[](const unsigned int idx) const { return dp[idx]; }\n};\n\ntemplate <unsigned int modulus> struct modint {\n\n  static_assert(modulus > 0, \"modulus must be a positive integer.\");\n\n  int val;\n\n  constexpr modint() : val(0) {}\n\n  template <class T> constexpr modint(T v) : val() {\n\n    val = v % (int)(modulus);\n\n    if (val < 0)\n      val += modulus;\n  }\n\n  constexpr modint &operator+=(const modint<modulus> other) noexcept {\n\n    val += other.val;\n    if (val >= modulus)\n      val -= modulus;\n\n    return *this;\n  }\n\n  constexpr modint &operator-=(const modint<modulus> other) noexcept {\n\n    val -= other.val;\n    if (val < 0)\n      val += modulus;\n\n    return *this;\n  }\n\n  constexpr modint &operator*=(const modint<modulus> other) noexcept {\n\n    val = (unsigned long long int)(val)*other.val % modulus;\n\n    return *this;\n  }\n\n  constexpr modint &operator/=(const modint<modulus> other) noexcept {\n\n    val = (unsigned long long int)(val)*other.inverse() % modulus;\n\n    return *this;\n  }\n\n  constexpr modint operator+(const modint<modulus> v) const noexcept {\n\n    return modint<modulus>(*this) += v;\n  }\n\n  constexpr modint operator-(const modint<modulus> v) const noexcept {\n\n    return modint<modulus>(*this) -= v;\n  }\n\n  constexpr modint operator*(const modint<modulus> v) const noexcept {\n\n    return modint<modulus>(*this) *= v;\n  }\n\n  constexpr modint operator/(const modint<modulus> v) const noexcept {\n\n    return modint<modulus>(*this) /= v;\n  }\n\n  constexpr modint &operator++(void) noexcept {\n\n    if (++val == modulus)\n      val = 0;\n\n    return *this;\n  }\n\n  constexpr modint &operator--(void) noexcept {\n\n    if (val-- == 0)\n      val = modulus - 1;\n\n    return *this;\n  }\n\n  constexpr modint operator-() const noexcept {\n\n    return modint<modulus>((val == 0 ? 0 : modulus - val));\n  }\n\n  constexpr unsigned int inverse(unsigned int a) const noexcept {\n\n    unsigned int b = modulus;\n\n    int u = 1, v = 0;\n\n    while (b != 0) {\n\n      unsigned int t = a / b;\n\n      a -= t * b;\n      std::swap(a, b);\n\n      u -= t * v;\n      std::swap(u, v);\n    }\n\n    if (u < 0)\n      u += modulus;\n\n    return u;\n  }\n\n  constexpr unsigned int inverse(void) const noexcept { return inverse(val); }\n\n  constexpr unsigned int power(unsigned long long int a, long long int n) const noexcept {\n\n    if (n == 0)\n      return 1;\n\n    unsigned long long res = 1, waiting = a;\n\n    if (n < 0)\n      waiting = inverse(), n = -n;\n\n    while (n != 0) {\n\n      if ((n & 1UL) != 0) {\n        res *= waiting;\n        res %= modulus;\n      }\n\n      waiting *= waiting;\n      waiting %= modulus;\n\n      n /= 2;\n    }\n\n    return res;\n  }\n\n  constexpr unsigned int power(long long int n) const noexcept { return power(val, n); }\n};\n\ntemplate <std::size_t N, unsigned int modulus>\n\nstruct combinationMod {\n\npublic:\n  modint<modulus> Power[N + 1];\n\n  modint<modulus> powInverse[N + 1];\n\n  modint<modulus> inverse[N + 1];\n\n  constexpr combinationMod(void) : Power(), powInverse(), inverse() {\n\n    Power[0] = 1;\n\n    int x = 0;\n    modint<modulus> mx;\n\n    for (x = 1, mx = 1; x <= N; ++x, ++mx)\n      Power[x] = Power[x - 1] * mx;\n\n    powInverse[N] = Power[N].inverse();\n\n    for (x = N, mx = N; x > 0; --x, --mx) {\n\n      powInverse[x - 1] = powInverse[x] * mx;\n\n      inverse[x] = powInverse[x] * Power[x - 1];\n    }\n\n    inverse[0] = 1;\n  }\n\n  constexpr modint<modulus> combination(int n, int k) const {\n\n    if (k < 0 or n < k)\n      return modint<modulus>();\n\n    return Power[n] * powInverse[k] * powInverse[n - k];\n  }\n};\n\nconstexpr unsigned int mod = 1000'000'007;\n\nconstexpr unsigned int N = 200'000;\n\nusing mint = modint<mod>;\n\nconst combinationMod<N, mod> Cmb;\n\nclass reroot_structure {\n\npublic:\n  using element_t = std::pair<mint, mint>;\n\n  using weight_t = char;\n\n  static element_t add_weight(const element_t &child_dp, const weight_t &weight) {\n    return child_dp;\n  }\n\n  static constexpr weight_t id_weight(void) { return EOF; }\n\n  static element_t merge(const element_t &child_dp1, const element_t &child_dp2) {\n\n    const mint count = child_dp1.second + child_dp2.second;\n\n    return element_t(child_dp1.first * child_dp2.first *\n                         Cmb.combination(count.val, child_dp2.second.val),\n                     count);\n  }\n\n  static constexpr element_t id_merge(void) { return element_t(mint(1), mint(0)); }\n\n  static constexpr element_t update(const element_t &dp_value) {\n\n    return element_t(dp_value.first, dp_value.second + mint(1));\n  }\n};\n\nint main(void) {\n\n  unsigned int n;\n  cin >> n;\n\n  ReRooting<reroot_structure> RRT(n);\n\n  for (unsigned int i = 1; i < n; ++i) {\n\n    unsigned int u, v;\n    cin >> u >> v;\n    --u;\n    --v;\n\n    RRT.add(u, v);\n    RRT.add(v, u);\n  }\n\n  RRT.build();\n\n  for (unsigned int i = 0; i < n; ++i)\n    cout << RRT[i].first.val << eol;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <utility>\n\nconstexpr unsigned int MAX_INPUT_SIZE = 3'000'000;\n\nchar Input[MAX_INPUT_SIZE];\n\nchar *input = Input;\n\ninline unsigned int get(void) {\n\n  unsigned int res = 0;\n  char c;\n\n  while ((c = *(input++) - '0') >= 0)\n    res = 10 * res + c;\n\n  return res;\n}\n\nconstexpr unsigned int MAX_OUTPUT_SIZE = 3'000'000;\n\nchar Output[MAX_INPUT_SIZE];\n\nchar *output = Output;\n\nstruct NoName {\n\n  char S[1000][5];\n\n  constexpr NoName(void) : S() {\n\n    for (unsigned int i = 1; i < 1000; ++i) {\n\n      unsigned int t = i;\n\n      char *ptr = S[i];\n\n      while (t) {\n        *(ptr++) = '0' ^ (t % 10);\n        t /= 10;\n      }\n    }\n  }\n};\n\nconstexpr NoName Da;\n\ninline void writeBuffer(unsigned long long int n) {\n\n  if (!n)\n    *(output++) = '0';\n\n  else {\n\n    char *ptr = output;\n\n    while (n) {\n\n      const char *ttt = Da.S[n % 1000];\n      n /= 1000;\n\n      while (*ttt)\n        *(ptr++) = *(ttt++);\n    }\n\n    char *ptr2 = output;\n    output = (ptr--);\n\n    while (ptr2 < ptr)\n      std::swap(*(ptr2++), *(ptr--));\n  }\n\n  *(output++) = '\\n';\n}\n\ninline void out(void) { fwrite_unlocked(Output, sizeof(char), output - Output, stdout); }\n\nconstexpr unsigned int MAX_N = 200'000;\n\nconstexpr unsigned int mod = 1'000'000'007;\n\ntemplate <const unsigned int M> struct shuumai {\n\npublic:\n  unsigned long long int P[M + 1];\n\n  unsigned long long int Inv[M + 1];\n\n  unsigned long long int inv[M + 1];\n\n  constexpr shuumai(void) : P(), Inv(), inv() {\n\n    P[0] = 1;\n    P[1] = 1;\n\n    for (unsigned int x = 1, y = 2; x < M; ++x, ++y)\n      P[y] = (P[x] * y) % mod;\n\n    Inv[M] = inverse(P[M]);\n\n    for (unsigned int x = M, y = M - 1; x; --x, --y) {\n\n      Inv[y] = (Inv[x] * x) % mod;\n\n      inv[x] = (P[y] * Inv[x]) % mod;\n    }\n\n    inv[0] = 1;\n  }\n\n  constexpr unsigned int inverse(unsigned int a) const noexcept {\n\n    unsigned int b = mod;\n\n    int u = 1, v = 0;\n\n    while (b) {\n\n      unsigned int t = a / b;\n\n      a -= t * b;\n      {\n        const unsigned int tmp = a;\n        a = b;\n        b = tmp;\n      }\n\n      u -= t * v;\n      {\n        const unsigned int tmp = u;\n        u = v;\n        v = tmp;\n      }\n    }\n\n    if (u < 0)\n      u += mod;\n\n    return u;\n  }\n};\n\nconstexpr shuumai<MAX_N> karashi;\n\nstruct Node {\n\n  unsigned int vertex;\n\n  unsigned int next;\n};\n\nNode node[2 * MAX_N];\n\nunsigned int begin[MAX_N];\n\nunsigned int end = 1;\n\ninline void append(const unsigned int u, const unsigned v) {\n\n  node[end] = {v, begin[u]};\n  begin[u] = end++;\n\n  node[end] = {u, begin[v]};\n  begin[v] = end++;\n}\n\nunsigned int Stack[MAX_N];\n\nunsigned int index_stack = 0;\n\ninline void push(const unsigned int value) { Stack[index_stack++] = value; }\n\ninline unsigned int top(void) { return Stack[--index_stack]; }\n\ninline bool exist(void) { return index_stack; }\n\nbool visited[MAX_N];\n\nunsigned int parent[MAX_N];\n\nunsigned int order[MAX_N];\n\nunsigned int index_order = 0;\n\nunsigned int subTree[MAX_N];\n\nunsigned long long int dp[MAX_N];\n\nint main(void) {\n\n  fread_unlocked(Input, sizeof(char), MAX_INPUT_SIZE, stdin);\n\n  const unsigned int n = get();\n\n  for (unsigned int _ = 1; _ < n; ++_)\n    append(get() - 1, get() - 1);\n\n  push(0);\n  visited[0] = true;\n  order[index_order++] = 0;\n\n  while (exist()) {\n\n    const unsigned int v = top();\n\n    for (unsigned int idx = begin[v]; idx; idx = node[idx].next) {\n\n      const unsigned int nv = node[idx].vertex;\n\n      if (not visited[nv]) {\n\n        visited[nv] = true;\n        parent[nv] = v;\n\n        order[index_order++] = nv;\n        push(nv);\n      }\n    }\n  }\n\n  for (unsigned int i = 0; i < n; ++i)\n    dp[i] = 1;\n\n  for (unsigned int i = n - 1; i; --i) {\n\n    const unsigned int v = order[i];\n\n    const unsigned int nv = parent[v];\n\n    dp[v] = dp[v] * karashi.P[subTree[v]++] % mod;\n\n    dp[nv] = dp[nv] * (dp[v] * karashi.Inv[subTree[v]] % mod) % mod;\n\n    subTree[nv] += subTree[v];\n  }\n\n  { dp[0] = dp[0] * karashi.P[subTree[0]++] % mod; }\n\n  for (unsigned int i = 1; i < n; ++i) {\n\n    const unsigned int v = order[i];\n\n    const unsigned int nv = parent[v];\n\n    dp[v] = dp[nv] * (subTree[v] * karashi.inv[n - subTree[v]] % mod) % mod;\n  }\n\n  for (unsigned int i = 0; i < n; ++i)\n    printf(\"%llu\\n\", dp[i]);\n\n  return 0;\n}"}
{"fast_code_id":"17ff174c265cf330c3320dee3f95d22e178472c73a3c6dbae4218c6ded9ca94a","fast_id":"ab228e43742f4d1b68b9f5d6647a84297eba4aa536046d8140135bcbfaeaf881","fast_time":0.0435017085,"language":"cpp","measured_fast_code_id":"ab228e43742f4d1b68b9f5d6647a84297eba4aa536046d8140135bcbfaeaf881","measured_slow_code_id":"60f733f2491efee3931b5c3953e7e977e66ba6b65c61d67343d248e35a6d084a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_11858","problem_id":"p00215","slow_code_id":"a3b09beb4d88ff20c105e5540dc58e68eb0ab5403e8ac235012e282be09c271d","slow_id":"60f733f2491efee3931b5c3953e7e977e66ba6b65c61d67343d248e35a6d084a","slow_time":0.119783547,"speedup":2.7535366110965507,"stratum":"2-4","sampling_key":"854e2bcc28da81410c1724704dffe449b5d9db96031605cc7d0078f2932cc737","slow_code":"#include <vector>\n\n#include <map>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cstdio>\n\n#define INF 1 << 28\n\nusing namespace std;\n\nint sx, sy, gx, gy;\n\ntypedef pair<int, int> P;\n\nvector<P> p[5];\n\nint memo[5][5][1111];\n\nint a, b;\n\nint solve(int k, int t, int q) {\n\n  if (k == 4)\n    return abs(p[t][q].first - gx) + abs(p[t][q].second - gy);\n\n  if (memo[k][t][q])\n    return memo[k][t][q];\n\n  int ans = INF, d = (t + 1) % 5, s;\n\n  for (int i = 0; i < p[d].size(); i++) {\n\n    if (!k)\n      s = abs(sx - p[d][i].first) + abs(sy - p[d][i].second);\n\n    else\n      s = abs(p[t][q].first - p[d][i].first) +\n          abs(p[t][q].second - p[d][i].second);\n\n    ans = min(ans, solve(k + 1, d, i) + s);\n  }\n\n  return memo[k][t][q] = ans;\n}\n\nint main() {\n\n  int w, h;\n\n  char c;\n\n  while (true) {\n\n    scanf(\"%d %d\", &w, &h);\n\n    if (!w && !h)\n      break;\n\n    for (int i = 0; i < 5; i++)\n      p[i].clear();\n\n    for (int i = 0; i < h; i++) {\n\n      for (int j = 0; j < w; j++) {\n\n        scanf(\" %c\", &c);\n\n        if (c == 'S')\n          sx = j, sy = i;\n\n        if (c == 'G')\n          gx = j, gy = i;\n\n        else if (c != '.')\n          p[c - '1'].push_back(P(j, i));\n      }\n    }\n\n    b = INF;\n\n    for (int i = 0; i < 5; i++) {\n\n      memset(memo, 0, sizeof(memo));\n\n      if (b > solve(0, i, 0))\n        a = i, b = solve(0, i, 0);\n    }\n\n    if (b == INF)\n      printf(\"NA\\n\");\n\n    else\n      printf(\"%d %d\\n\", a + 1, b);\n  }\n}","fast_code":"#include <algorithm>\n\n#include <cstring>\n\n#include <cstdio>\n\n#define INF 1 << 28\n\nusing namespace std;\n\nint sx, sy, gx, gy;\n\nint dx[5][1111], dy[5][1111], dn[5];\n\nint memo[5][5][1111];\n\nint a, b;\n\nint solve(int k, int t, int q) {\n\n  if (k == 4)\n    return abs(dx[t][q] - gx) + abs(dy[t][q] - gy);\n\n  if (memo[k][t][q])\n    return memo[k][t][q];\n\n  int ans = INF, d = (t + 1) % 5, s;\n\n  for (int i = 0; i < dn[d]; i++) {\n\n    if (!k)\n      s = abs(sx - dx[d][i]) + abs(sy - dy[d][i]);\n\n    else\n      s = abs(dx[t][q] - dx[d][i]) + abs(dy[t][q] - dy[d][i]);\n\n    ans = min(ans, solve(k + 1, d, i) + s);\n  }\n\n  return memo[k][t][q] = ans;\n}\n\nint main() {\n\n  int w, h;\n\n  char c;\n\n  while (true) {\n\n    scanf(\"%d %d\", &w, &h);\n\n    if (!w && !h)\n      break;\n\n    memset(dn, 0, sizeof(dn));\n\n    for (int i = 0; i < h; i++) {\n\n      for (int j = 0; j < w; j++) {\n\n        scanf(\" %c\", &c);\n\n        if (c == 'S')\n          sx = j, sy = i;\n\n        else if (c == 'G')\n          gx = j, gy = i;\n\n        else if (c != '.')\n          dx[c - '1'][dn[c - '1']] = j, dy[c - '1'][dn[c - '1']] = i,\n                             dn[c - '1']++;\n      }\n    }\n\n    b = INF;\n\n    for (int i = 0; i < 5; i++) {\n\n      memset(memo, 0, sizeof(memo));\n\n      if (b > solve(0, i, 0))\n        a = i, b = solve(0, i, 0);\n    }\n\n    if (b == INF)\n      printf(\"NA\\n\");\n\n    else\n      printf(\"%d %d\\n\", a + 1, b);\n  }\n}"}
{"fast_code_id":"06d4bac8c5900d4d488fcb6644300e03b4b774b878188b4eadfc6283070b7cc9","fast_id":"f3551a99f3a82f4060322f1989e05b4f0d5d727b51e317dcee60427fba4f695d","fast_time":0.0200554846,"language":"cpp","measured_fast_code_id":"f3551a99f3a82f4060322f1989e05b4f0d5d727b51e317dcee60427fba4f695d","measured_slow_code_id":"68e171a1ecd6188b822777a650ed13b5507758f7699531e097bf107a8bba6227","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12024","problem_id":"p02777","slow_code_id":"1729b561b2a964e425e1d26e7622c3734d40f26c8234a80a90b4d2763a5c20fe","slow_id":"68e171a1ecd6188b822777a650ed13b5507758f7699531e097bf107a8bba6227","slow_time":0.1054971698,"speedup":5.260265304185171,"stratum":"4-8","sampling_key":"0108237aa7a7eb74d4f49a02628086fd08971ab92a12ec85264ca7de5db60122","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  string s, t, u;\n\n  int A, B;\n\n  cin >> s >> t;\n\n  cin >> A >> B;\n\n  cin >> u;\n\n  if (s == u) {\n\n    A--;\n\n  } else\n    B--;\n\n  cout << A << \" \" << B;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\nint main()\n\n{\n\n  int A, B;\n\n  char S[11];\n\n  char T[11];\n\n  char U[11];\n\n  scanf(\"%s %s\", &S, &T);\n\n  scanf(\"%d %d\", &A, &B);\n\n  scanf(\"%s\", &U);\n\n  if (strcmp(S, U) == 0) {\n\n    A--;\n\n    printf(\"%d %d\", A, B);\n\n  } else if (strcmp(T, U) == 0) {\n\n    B--;\n\n    printf(\"%d %d\", A, B);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"86c7af143f1749d632b608358550df392f55b090fb8ea47371f6a40c2f492107","fast_id":"b13268f0bb2f1c374d786a1f53169261de2f32c0deca0b3225989d3ee5350787","fast_time":0.0201624718,"language":"cpp","measured_fast_code_id":"b13268f0bb2f1c374d786a1f53169261de2f32c0deca0b3225989d3ee5350787","measured_slow_code_id":"be2040d0a0f4a290387e74ae9bc85dba32827034a6d1fdefcea7c87ecde282ea","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12224","problem_id":"p03221","slow_code_id":"9c9a1b3c093266ecbec6c9c84212fc03ad0b2b68c8f9ae0bb2a8057050117450","slow_id":"be2040d0a0f4a290387e74ae9bc85dba32827034a6d1fdefcea7c87ecde282ea","slow_time":0.6834655079,"speedup":33.89790273135063,"stratum":"8+","sampling_key":"320b2d4f758f659972261fdb9340bfec0743ba291a2f4627ca15e45a0ac077aa","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <queue>\n\n#include <stack>\n\n#include <cstdlib>\n\n#include <iomanip>\n\n#include <cmath>\n\n#include <cassert>\n\n#include <ctime>\n\n#include <cstdlib>\n\n#include <map>\n\n#include <set>\n\nusing namespace std;\n\n#pragma comment(linker, \"/stck:1024000000,1024000000\")\n\n#define lowbit(x) (x & (-x))\n\n#define max(x, y) (x >= y ? x : y)\n\n#define min(x, y) (x <= y ? x : y)\n\n#define MOD 1000000007\n\n#define pi acos(-1.0)\n\n#define ei exp(1)\n\n#define PI 3.1415926535897932384626433832\n\n#define ios() ios::sync_with_stdio(true)\n\n#define INF (1 << 31) - 1;\n\n#define mem(a) (memset(a, 0, sizeof(a)))\n\nstruct P {\n\n  int x, y;\n\n} H[200000];\n\nvector<int> G[200000];\n\nint POS(int k, int value) {\n\n  int mid;\n\n  int left = 0;\n\n  int len = G[k].size();\n\n  int right = len - 1;\n\n  while (left <= right) {\n\n    mid = left + (right - left) / 2;\n\n    if (G[k][mid] == value)\n      return mid;\n\n    else if (G[k][mid] > value)\n      right = mid;\n\n    else\n      left = mid + 1;\n  }\n\n  return -1;\n}\n\nset<int>::iterator it;\n\nint main()\n\n{\n\n  set<int> s;\n\n  int N, M;\n\n  int x, y;\n\n  cin >> N >> M;\n\n  for (int i = 1; i <= M; i++) {\n\n    cin >> x >> y;\n\n    H[i].x = x;\n\n    H[i].y = y;\n\n    G[x].push_back(y);\n\n    s.insert(x);\n  }\n\n  for (int i = 1; i <= N; i++) {\n\n    sort(G[i].begin(), G[i].end());\n  }\n\n  for (int i = 1; i <= M; i++) {\n\n    cout << setw(6) << setfill('0') << H[i].x;\n\n    cout << setw(6) << setfill('0') << POS(H[i].x, H[i].y) + 1 << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int maxn = 1e5 + 5;\n\ntypedef struct Node {\n\n  int id, p, y, s;\n\n} Node;\n\nNode node[maxn] = {0};\n\nbool cmp(Node &a, Node &b) {\n\n  if (a.p == b.p)\n    return a.y < b.y;\n\n  return a.p < b.p;\n}\n\nbool cov(Node &a, Node &b) { return a.id < b.id; }\n\nint main() {\n\n  int n, m;\n\n  scanf(\"%d%d\", &m, &n);\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%d%d\", &node[i].p, &node[i].y);\n\n    node[i].id = i;\n  }\n\n  sort(node + 1, node + n + 1, cmp);\n\n  int cnt = 1;\n\n  for (int i = 1; i <= n; i++)\n\n    if (node[i].p == node[i - 1].p)\n      node[i].s = ++cnt;\n\n    else\n      node[i].s = cnt = 1;\n\n  sort(node + 1, node + n + 1, cov);\n\n  for (int i = 1; i <= n; i++)\n\n    printf(\"%06d%06d\\n\", node[i].p, node[i].s);\n\n  return 0;\n}\n"}
{"fast_code_id":"c9d1899eeee077dc5842e718ed548f0e803f1b82853610f5ca6c4ea0294a4f4c","fast_id":"394bca5dd8d97abfcced30ba8bb5b9e5630ca38aaaddec6510d7a872e5261022","fast_time":0.0001860896,"language":"cpp","measured_fast_code_id":"394bca5dd8d97abfcced30ba8bb5b9e5630ca38aaaddec6510d7a872e5261022","measured_slow_code_id":"132560ef44709a479f92288fade9934d1469682c360919ae1dd99e034984eaec","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12263","problem_id":"p03731","slow_code_id":"d0cc07ad0dadd4537098223052b06b3206cd5f76528ae44ce2b49e760de6012b","slow_id":"132560ef44709a479f92288fade9934d1469682c360919ae1dd99e034984eaec","slow_time":0.0010482235,"speedup":5.632896733616494,"stratum":"4-8","sampling_key":"5a8d235ff783f0f34ae1a46f60f454f9ecdb37bb5776a9016bf6d149b39f9444","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, T;\n\n  cin >> N >> T;\n\n  int t[200000];\n\n  rep(i, N) cin >> t[i];\n\n  ll kotae = T;\n\n  rep(i, N - 1) { kotae += min(T, t[i + 1] - t[i]); }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  int N = getint(), T = getint();\n\n  int kotae = T;\n\n  int mae = getint();\n\n  rep(i, N - 1) {\n\n    int t = getint();\n\n    kotae += min(t - mae, T);\n\n    mae = t;\n  }\n\n  printf(\"%d\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"72d0dc9b055126bb6b95a4cb1fceb5f5b55108941688eafe4109b6899687c6c0","fast_id":"417c7fc2f5915fc848258ba47c92ecca4a55a97bf1f17d0b9338041b19e6b330","fast_time":0.0154336888,"language":"cpp","measured_fast_code_id":"417c7fc2f5915fc848258ba47c92ecca4a55a97bf1f17d0b9338041b19e6b330","measured_slow_code_id":"b6812212bda411fed5a435434f3ab179efd73a7dcf68939942c015ef7c8854b6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12266","problem_id":"p03143","slow_code_id":"5ef919e5155cd74dd3fb4610c9198b46f3fb3331b5ef173ba9c56ecce8105c6b","slow_id":"b6812212bda411fed5a435434f3ab179efd73a7dcf68939942c015ef7c8854b6","slow_time":0.1071188307,"speedup":6.940585111447887,"stratum":"4-8","sampling_key":"87ea39d025bca370493917d0e150641897ad5da274e12a05d31c89be5052d936","slow_code":"#include <stdio.h>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <map>\n\nusing namespace std;\n\nstruct node {\n\n  node *l = nullptr;\n\n  node *r = nullptr;\n\n  node *p = nullptr;\n\n  long long val = 0;\n\n  long long sum = 0;\n\n  node() {}\n};\n\nvoid fix(node *x) {\n\n  x->sum = x->val;\n\n  if (x->l)\n    x->sum += x->l->sum;\n\n  if (x->r)\n    x->sum += x->r->sum;\n}\n\nvoid rot(node *x) {\n\n  node *y = x->p, *z = y->p;\n\n  if (z) {\n\n    if (y == z->l)\n      z->l = x;\n\n    if (y == z->r)\n      z->r = x;\n  }\n\n  x->p = z;\n  y->p = x;\n\n  if (x == y->l) {\n\n    y->l = x->r;\n    x->r = y;\n\n    if (y->l)\n      y->l->p = y;\n\n  } else {\n\n    y->r = x->l;\n    x->l = y;\n\n    if (y->r)\n      y->r->p = y;\n  }\n\n  fix(y);\n}\n\nnode *splay(node *x) {\n  while (x->p) {\n    node *y = x->p, *z = y->p;\n\n    if (z)\n      rot((x == y->l) == (y == z->l) ? y : x);\n\n    rot(x);\n  }\n\n  fix(x);\n\n  return x;\n}\n\nvoid join(node *x, node *y) {\n\n  if (!x || !y)\n    return;\n\n  splay(x);\n\n  while (x->r)\n    x = x->r;\n\n  splay(x);\n\n  splay(y);\n\n  x->r = y;\n\n  y->p = x;\n}\n\nnode *split_left(node *x) {\n\n  splay(x);\n\n  node *y = x->l;\n\n  if (y)\n    y->p = x->l = nullptr;\n\n  return y;\n}\n\nnode *split_right(node *x) {\n\n  splay(x);\n\n  node *y = x->r;\n\n  if (y)\n    y->p = x->r = nullptr;\n\n  return y;\n}\n\nvoid rotate(node *x) { join(x, split_left(x)); }\n\npair<node *, node *> link(node *u, node *v) {\n\n  node *uv = new node();\n\n  node *vu = new node();\n\n  rotate(u);\n\n  rotate(v);\n\n  join(u, uv);\n\n  join(uv, v);\n\n  join(v, vu);\n\n  return {uv, vu};\n}\n\nvoid cut(pair<node *, node *> e) {\n\n  rotate(e.first);\n\n  split_right(e.first);\n\n  split_left(e.second);\n\n  split_right(e.second);\n\n  delete e.first;\n\n  delete e.second;\n}\n\nint par[100000];\n\nint find(int x) {\n\n  if (par[x] == x)\n    return x;\n\n  return par[x] = find(par[x]);\n}\n\nvoid unite(int x, int y) { par[find(x)] = find(y); }\n\nint N, M;\n\nint X[100000];\n\nint A[100000], B[100000], Y[100000], P[100000];\n\nnode *V[100000];\n\npair<node *, node *> E[100000];\n\nint used[100000];\n\nint main() {\n\n  for (int i = 0; i < 100000; i++) {\n\n    par[i] = i;\n  }\n\n  scanf(\"%d %d\", &N, &M);\n\n  for (int i = 0; i < N; i++) {\n\n    scanf(\"%d\", &X[i]);\n\n    V[i] = new node();\n\n    V[i]->val = X[i];\n\n    V[i]->sum = X[i];\n  }\n\n  for (int i = 0; i < M; i++) {\n\n    scanf(\"%d %d %d\", &A[i], &B[i], &Y[i]);\n\n    A[i]--;\n\n    B[i]--;\n\n    P[i] = i;\n  }\n\n  sort(P, P + M, [&](int i, int j) { return Y[i] < Y[j]; });\n\n  for (int i = 0; i < M; i++) {\n\n    int j = P[i];\n\n    if (find(A[j]) != find(B[j])) {\n\n      unite(A[j], B[j]);\n\n      used[j] = 1;\n\n      E[j] = link(V[A[j]], V[B[j]]);\n    }\n  }\n\n  int ans = 0;\n\n  for (int i = M - 1; i >= 0; i--) {\n\n    int j = P[i];\n\n    splay(V[A[j]]);\n\n    if (used[j]) {\n\n      if (V[A[j]]->sum < Y[j]) {\n\n        ans++;\n\n        cut(E[j]);\n      }\n\n    } else {\n\n      if (V[A[j]]->sum < Y[j]) {\n\n        ans++;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <map>\n\nusing namespace std;\n\nstruct union_find {\n\n  int uf[100000];\n\n  long long sum[100000];\n\n  int id_[200000];\n\n  int uf_[200000];\n\n  long long sum_[200000];\n\n  int k;\n\n  int find(int x) {\n\n    while (uf[x] >= 0)\n      x = uf[x];\n\n    return x;\n  }\n\n  void store(int x) {\n\n    id_[k] = x;\n\n    uf_[k] = uf[x];\n\n    sum_[k] = sum[x];\n\n    k++;\n  }\n\n  void restore() {\n\n    k--;\n\n    int x = id_[k];\n\n    uf[x] = uf_[k];\n\n    sum[x] = sum_[k];\n  }\n\n  void skip() { k--; }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (-uf[x] < -uf[y])\n      swap(x, y);\n\n    store(x);\n\n    store(y);\n\n    uf[x] += uf[y];\n\n    sum[x] += sum[y];\n\n    uf[y] = x;\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n\n} uf;\n\nint N, M;\n\nint X[100000];\n\nint A[100000], B[100000], Y[100000], P[100000];\n\nint used[100000];\n\nint main() {\n\n  scanf(\"%d %d\", &N, &M);\n\n  for (int i = 0; i < N; i++) {\n\n    scanf(\"%d\", &X[i]);\n\n    uf.uf[i] = -1;\n\n    uf.sum[i] = X[i];\n  }\n\n  for (int i = 0; i < M; i++) {\n\n    scanf(\"%d %d %d\", &A[i], &B[i], &Y[i]);\n\n    A[i]--;\n\n    B[i]--;\n\n    P[i] = i;\n  }\n\n  sort(P, P + M, [&](int i, int j) { return Y[i] < Y[j]; });\n\n  for (int i = 0; i < M; i++) {\n\n    int j = P[i];\n\n    if (!uf.same(A[j], B[j])) {\n\n      uf.unite(A[j], B[j]);\n\n      used[j] = 1;\n    }\n  }\n\n  int ans = 0;\n\n  for (int i = M - 1; i >= 0; i--) {\n\n    int j = P[i];\n\n    long long sum = uf.sum[uf.find(A[j])];\n\n    if (used[j]) {\n\n      if (sum < Y[j]) {\n\n        ans++;\n\n        uf.restore();\n\n        uf.restore();\n\n      } else {\n\n        uf.skip();\n\n        uf.skip();\n      }\n\n    } else {\n\n      if (sum < Y[j]) {\n\n        ans++;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"1d3fade5fe5ceba2c306ee1cbf17fd343fb74f4e68205ac7db65f05d6ce118bd","fast_id":"33825d124c73e58ebb30e892fcdad4b9de2d23dec644f40bf087fb2f49a91606","fast_time":0.0221339029,"language":"cpp","measured_fast_code_id":"33825d124c73e58ebb30e892fcdad4b9de2d23dec644f40bf087fb2f49a91606","measured_slow_code_id":"8939fe20001a184692358cd7134cfa2c8299c04ee6781e5d76fbf8741bc80732","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12274","problem_id":"p01159","slow_code_id":"a40e0e10dfbfc665028e6e7f1b19029684a4142220e28ab1276aa9e8ebd392ec","slow_id":"8939fe20001a184692358cd7134cfa2c8299c04ee6781e5d76fbf8741bc80732","slow_time":0.1021316988,"speedup":4.614265241038896,"stratum":"4-8","sampling_key":"8d24618caf357409654f253577e1b10372e59651141490dd1f8f91cbe433b90a","slow_code":"#include <cstdio>\n\n#include <vector>\n\n#include <complex>\n\n#include <algorithm>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nusing namespace std;\n\ntypedef complex<double> Point;\n\nconst double EPS = 1e-9;\n\nnamespace std {\n\nbool operator<(const Point &a, const Point &b) {\n\n  return abs(a.real() - b.real()) < EPS ? (a.imag() + EPS < b.imag()) : (a.real() + EPS < b.real());\n}\n\n}                 \n\nclass Line : public vector<Point> {\n\npublic:\n  Line() {}\n\n  Line(const Point &a, const Point &b) { push_back(a), push_back(b); }\n};\n\nclass Segment : public Line {\n\npublic:\n  Segment() {}\n\n  Segment(const Point &a, const Point &b) : Line(a, b) {}\n};\n\ninline double dot(const Point &a, const Point &b) {\n\n  return a.real() * b.real() + a.imag() * b.imag();\n}\n\ninline double cross(const Point &a, const Point &b) {\n\n  return a.real() * b.imag() - a.imag() * b.real();\n}\n\nenum { CCW = 1, CW = -1, ON = 0 };\n\nint ccw(const Point &a, Point b, Point c) {\n\n  b -= a, c -= a;\n\n  double rotdir = cross(b, c);\n\n  if (rotdir > EPS)\n    return CCW;\n\n  if (rotdir < -EPS)\n    return CW;\n\n  return ON;\n}\n\ninline void calc_abc(const Line &l, double &a, double &b, double &c) {\n\n  a = l[0].imag() - l[1].imag();\n\n  b = l[1].real() - l[0].real();\n\n  c = cross(l[0], l[1]);\n}\n\nbool cover(const Segment &s, const Point &p) { return dot(s[0] - p, s[1] - p) < EPS; }\n\nbool intersect(const Segment &s, const Segment &t, Point *p) {\n\n  bool flg;\n\n  if (abs(cross(s[1] - s[0], t[1] - t[0])) < EPS && abs(cross(s[1] - s[0], t[0] - s[0])) < EPS) {\n\n    flg = (cover(s, t[0]) || cover(s, t[1]) || cover(t, s[0]) || cover(t, s[1]));\n\n    if (!flg)\n      return false;\n  }\n\n  if (flg || (ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0\n\n              && ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0)) {\n\n    double a1, b1, c1, a2, b2, c2;\n\n    calc_abc(s, a1, b1, c1);\n\n    calc_abc(t, a2, b2, c2);\n\n    double det = a1 * b2 - a2 * b1;\n\n    if (abs(det) < EPS) {\n\n      Point q[3] = {s[0], s[1], t[0]};\n\n      rep(i, 3) {\n\n        if (cover(s, q[i]) && cover(t, q[i])) {\n\n          *p = q[i];\n\n          break;\n        }\n      }\n\n    }\n\n    else\n      *p = Point(b1 * c2 - b2 * c1, a2 * c1 - a1 * c2) / det;\n\n    return true;\n  }\n\n  return false;\n}\n\nint n;\n\nPoint _f[100], _g[100];\n\ndouble f(double x) {\n\n  if (x < _f[0].real())\n    return 0;\n\n  rep(i, n - 1) {\n\n    double x1 = _f[i].real(), x2 = _f[i + 1].real();\n\n    double y1 = _f[i].imag(), y2 = _f[i + 1].imag();\n\n    if (x < x2)\n      return (y2 - y1) / (x2 - x1) * (x - x1) + y1;\n  }\n\n  return 0;\n}\n\ndouble g(double x) {\n\n  if (x < _g[0].real())\n    return 0;\n\n  rep(i, n - 1) {\n\n    double x1 = _g[i].real(), x2 = _g[i + 1].real();\n\n    double y1 = _g[i].imag(), y2 = _g[i + 1].imag();\n\n    if (x < x2)\n      return (y2 - y1) / (x2 - x1) * (x - x1) + y1;\n  }\n\n  return 0;\n}\n\nint main() {\n\n  for (double r; scanf(\"%d%lf\", &n, &r), n;) {\n\n    vector<double> ev;\n\n    rep(i, n) {\n\n      int x, y;\n      scanf(\"%d%d\", &x, &y);\n\n      _f[i] = Point(x, y);\n\n      _g[i] = Point(x + r, y);\n\n      ev.push_back(x);\n\n      ev.push_back(x + r);\n    }\n\n    rep(i, n - 1) rep(j, n - 1) {\n\n      Point p;\n\n      if (intersect(Segment(_f[i], _f[i + 1]), Segment(_g[i], _g[i + 1]), &p)) {\n\n        ev.push_back(p.real());\n      }\n    }\n\n    sort(_f, _f + n);\n\n    sort(_g, _g + n);\n\n    sort(ev.begin(), ev.end());\n\n    double ans = 0;\n\n    rep(i, ev.size() - 1) {\n\n      double x1 = ev[i], x2 = ev[i + 1];\n\n      if (x2 - x1 < EPS)\n        continue;\n\n      double f1 = f(x1), f2 = f(x2), g1 = g(x1), g2 = g(x2);\n\n      double af = (f2 - f1) / (x2 - x1), bf = f1 - af * x1;\n\n      double ag = (g2 - g1) / (x2 - x1), bg = g1 - ag * x1;\n\n      ans += af * ag * (x2 * x2 * x2 - x1 * x1 * x1) / 3 +\n             (af * bg + bf * ag) * (x2 * x2 - x1 * x1) / 2 + bf * bg * (x2 - x1);\n    }\n\n    printf(\"%.15f\\n\", ans);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nusing namespace std;\n\nconst double EPS = 1e-9;\n\nstruct Point {\n  double x, y;\n};\n\nint n;\n\nPoint _f[100], _g[100];\n\ndouble f(double x) {\n\n  if (x < _f[0].x)\n    return 0;\n\n  rep(i, n - 1) {\n\n    double x1 = _f[i].x, x2 = _f[i + 1].x;\n\n    double y1 = _f[i].y, y2 = _f[i + 1].y;\n\n    if (x < x2)\n      return (y2 - y1) / (x2 - x1) * (x - x1) + y1;\n  }\n\n  return 0;\n}\n\ndouble g(double x) {\n\n  if (x < _g[0].x)\n    return 0;\n\n  rep(i, n - 1) {\n\n    double x1 = _g[i].x, x2 = _g[i + 1].x;\n\n    double y1 = _g[i].y, y2 = _g[i + 1].y;\n\n    if (x < x2)\n      return (y2 - y1) / (x2 - x1) * (x - x1) + y1;\n  }\n\n  return 0;\n}\n\nint main() {\n\n  for (double r; scanf(\"%d%lf\", &n, &r), n;) {\n\n    double ev[200];\n\n    rep(i, n) {\n\n      int x, y;\n      scanf(\"%d%d\", &x, &y);\n\n      _f[i] = (Point){x, y};\n\n      _g[i] = (Point){x + r, y};\n\n      ev[2 * i + 0] = x;\n\n      ev[2 * i + 1] = x + r;\n    }\n\n    sort(ev, ev + 2 * n);\n\n    double ans = 0;\n\n    rep(i, 2 * n - 1) {\n\n      double x1 = ev[i], x2 = ev[i + 1];\n\n      if (x2 - x1 < EPS)\n        continue;\n\n      double f1 = f(x1), f2 = f(x2), g1 = g(x1), g2 = g(x2);\n\n      double af = (f2 - f1) / (x2 - x1), bf = f1 - af * x1;\n\n      double ag = (g2 - g1) / (x2 - x1), bg = g1 - ag * x1;\n\n      ans += af * ag * (x2 * x2 * x2 - x1 * x1 * x1) / 3 +\n             (af * bg + bf * ag) * (x2 * x2 - x1 * x1) / 2 +\n             bf * bg * (x2 - x1);\n    }\n\n    printf(\"%.15f\\n\", ans);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"4fbd8c267eddace97751fedd4b403bd14192708b34abf2fec5278136973a2d72","fast_id":"7a64d925443a662e55742078e36307e61cba60b7f325363b6e272ea67e7bf752","fast_time":0.1115239042,"language":"cpp","measured_fast_code_id":"7a64d925443a662e55742078e36307e61cba60b7f325363b6e272ea67e7bf752","measured_slow_code_id":"e3e316deaaaf5d25bea0ebbc24257796299369b81ac12f8dc5d60fe0bca76246","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12283","problem_id":"p02549","slow_code_id":"dab18090588a70f47a577bc6f8e2a3a6ed8438e0f2db554fcdd78c695b2e77a5","slow_id":"e3e316deaaaf5d25bea0ebbc24257796299369b81ac12f8dc5d60fe0bca76246","slow_time":0.8145875824,"speedup":7.304152309258915,"stratum":"4-8","sampling_key":"17c926d768945da509dfbae9354556650f8f7e59486e347c8b0f49713555aa1d","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <deque>\n\n#include <algorithm>\n\n#include <numeric>\n\n#include <string>\n\n#include <cstring>\n\n#include <list>\n\n#include <unordered_set>\n\n#include <tuple>\n\n#include <cmath>\n\n#include <limits>\n\n#include <type_traits>\n\n#include <iomanip>\n\n#include <map>\n\n#include <unordered_map>\n\n#include <queue>\n\n#include <stack>\n\n#include <set>\n\n#include <bitset>\n\n#include <complex>\n\n#include <regex>\n\n#include <random>\n\nusing namespace std;\n\n#define rep(i, n) for (lint i = 0; i < n; i++)\n\n#define repr(i, n) for (lint i = n - 1; i >= 0; i--)\n\n#define repi(i, ini, n) for (lint i = ini; i < n; i++)\n\n#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)\n\n#define repb(i, start, end) for (lint i = start; i <= end; i++)\n\n#define repbr(i, start, end) for (lint i = end; i >= start; i--)\n\n#define bit(n) (1LL << (n))\n\n#define all(v) v.begin(), v.end()\n\n#define rall(v) v.rbegin(), v.rend()\n\n#define rg(v, ini, end) v.begin() + ini, v.begin() + end\n\n#define ret return 0;\n\n#define chmax(a, b) a = max(a, b)\n\n#define chmin(a, b) a = min(a, b)\n\nusing lint = long long;\n\nusing ulint = unsigned long long;\n\nusing ld = long double;\n\nstruct xy {\n\n  lint x, y;\n\n  xy() : x(0), y(0) {}\n\n  xy(lint _x, lint _y) : x(_x), y(_y) {}\n\n  xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }\n\n  bool operator<(xy p) const { return y == p.y ? x < p.x : y < p.y; }\n\n  bool operator==(xy p) const { return y == p.y && x == p.x; }\n};\n\nstruct xyd {\n\n  ld x, y;\n\n  xyd() : x(0), y(0) {}\n\n  xyd(long double _x, long double _y) : x(_x), y(_y) {}\n};\n\nusing vec = vector<lint>;\n\nusing vecd = vector<ld>;\n\nusing vecs = vector<string>;\n\nusing vecp = vector<xy>;\n\ntemplate <class T> using vect = vector<T>;\n\nclass vec2 : public vector<vector<lint>>\n\n{\n\npublic:\n  vec2() {}\n\n  vec2(lint n) : vector(n) {}\n\n  vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}\n\n  vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}\n};\n\ntemplate <class T> using priq = priority_queue<T>;\n\ntemplate <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class Key, class Val> using hashmap = unordered_map<Key, Val>;\n\ntemplate <class Key> using hashset = unordered_set<Key>;\n\ntemplate <class It>\n\nconstexpr typename It::value_type rmax(It begin, It end) {\n\n  return *max_element(begin, end);\n}\n\ntemplate <class T1, class T2>\n\nconstexpr auto mmax(T1 arg1, T2 arg2) {\n\n  using T = decltype(arg1 + arg2);\n\n  return max(T(arg1), T(arg2));\n}\n\ntemplate <class T, class... Types>\n\nconstexpr auto mmax(T arg0, Types... args) {\n\n  return mmax(arg0, mmax(args...));\n}\n\ntemplate <class It>\n\nconstexpr typename It::value_type rmin(It begin, It end) {\n\n  return *min_element(begin, end);\n}\n\ntemplate <class T1, class T2>\n\nconstexpr auto mmin(T1 arg1, T2 arg2) {\n\n  using T = decltype(arg1 + arg2);\n\n  return min(T(arg1), T(arg2));\n}\n\ntemplate <class T, class... Types>\n\nconstexpr auto mmin(T arg0, Types... args) {\n\n  return mmin(arg0, mmin(args...));\n}\n\nmt19937 mtrand((random_device())());\n\nconst double pi = 3.141592653589793238462;\n\nconst lint intmax = 9223372036854775807;\n\nconst lint inf = 1100100100100100100LL;\n\nconstexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }\n\n#if (__cplusplus < 201703L)\n\nlint gcd(lint a, lint b) {\n\n  while (1) {\n\n    if (a < b)\n      swap(a, b);\n\n    if (!b)\n      break;\n\n    a %= b;\n  }\n\n  return a;\n}\n\nlint lcm(lint a, lint b) { return a / gcd(a, b) * b; }\n\n#endif\n\ntemplate <class T>\n\nstruct nval {\n\n  lint n;\n\n  T val;\n\n  nval() : n(0){};\n\n  nval(lint _n, T _val) : n(_n), val(_val){};\n};\n\ntemplate <class It, class It2>\n\nauto spacel(It i, It2 end) {\n\n  return i + 1 == end ? '\\n' : ' ';\n}\n\nostream &setp(ostream &ost) {\n\n  cout << setprecision(60) << fixed;\n\n  return ost;\n}\n\nconst ulint mod = 998244353;\n\nconst ld eps = 0.0000001;\n\nstruct mint\n\n{\n\n  lint n;\n\n  mint() : n(0) {}\n\n  mint(lint a) { n = (a < 0) ? (mod - ((-a) % mod)) : (a % mod); }\n\n  mint &operator+=(mint a) {\n    (n += a.n) %= mod;\n    return *this;\n  }\n\n  mint &operator-=(mint a) {\n    ((n += mod) -= a.n) %= mod;\n    return *this;\n  }\n\n  mint &operator*=(mint a) {\n    (n *= a.n) %= mod;\n    return *this;\n  }\n\n  mint &operator%=(mint a) {\n    n %= a.n;\n    return *this;\n  }\n\n  mint &operator++() {\n    (n += 1) %= mod;\n    return *this;\n  }\n\n  mint &operator--() {\n    (n += (mod - 1)) %= mod;\n    return *this;\n  }\n};\n\nmint operator+(mint a, mint b) { return a += b; }\n\nmint operator-(mint a, mint b) { return a -= b; }\n\nmint operator*(mint a, mint b) { return a *= b; }\n\nmint operator-(mint a) {\n  a = mod - a;\n  return a;\n}\n\nvector<mint> invtbl, finvtbl, facttbl;\n\nmint factMod(lint n) {\n\n  if (n == 0) {\n    return 1;\n  }\n\n  mint ans = 1;\n\n  while (n > 1) {\n    ans *= n;\n    n--;\n  }\n\n  return ans;\n}\n\nmint powMod(mint x, lint y) {\n\n  if (x.n <= 1) {\n    return x;\n  }\n\n  mint tmp = y > 1 ? powMod(x, y / 2) : 1;\n\n  return tmp * tmp * ((y % 2 == 0) ? 1 : (x));\n}\n\nmint modinv(mint n) { return powMod(n, mod - 2); }\n\nvoid preCalcInv(lint up) {\n\n  invtbl.resize(up + 1);\n  invtbl[1] = 1;\n\n  repb(a, 2, up)\n\n      invtbl[a] = invtbl[a] = mod - invtbl[mod % a] * (mod / a);\n}\n\nmint &operator/=(mint &a, mint b) {\n  a *= (b.n < invtbl.size()) ? invtbl[b.n] : modinv(b);\n  return a;\n}\n\nmint operator/(mint a, mint b) { return a /= b; }\n\nmint dpd[400010], dp[400010];\n\nlint solve() {\n\n  lint n, k;\n\n  cin >> n >> k;\n\n  vec l(k), r(k);\n\n  rep(i, k)\n\n          cin >>\n      l[i] >> r[i];\n\n  dp[1] = 1;\n\n  repb(i, 1, n) {\n\n    dpd[i] += dpd[i - 1];\n\n    dp[i] += dpd[i];\n\n    rep(j, k) {\n\n      dpd[i + l[j]] += dp[i];\n\n      dpd[i + r[j] + 1] -= dp[i];\n    }\n  }\n\n  cout << dp[n].n << endl;\n\n  ret;\n}\n\nint main()\n\n{\n\n  lint _ = 1;\n\n  rep(i, _)\n\n      solve();\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <deque>\n\n#include <algorithm>\n\n#include <numeric>\n\n#include <string>\n\n#include <cstring>\n\n#include <list>\n\n#include <unordered_set>\n\n#include <tuple>\n\n#include <cmath>\n\n#include <limits>\n\n#include <type_traits>\n\n#include <iomanip>\n\n#include <map>\n\n#include <unordered_map>\n\n#include <queue>\n\n#include <stack>\n\n#include <set>\n\n#include <bitset>\n\n#include <complex>\n\n#include <regex>\n\n#include <random>\n\nusing namespace std;\n\n#define rep(i, n) for (lint i = 0; i < n; i++)\n\n#define repr(i, n) for (lint i = n - 1; i >= 0; i--)\n\n#define repi(i, ini, n) for (lint i = ini; i < n; i++)\n\n#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)\n\n#define repb(i, start, end) for (lint i = start; i <= end; i++)\n\n#define repbr(i, start, end) for (lint i = end; i >= start; i--)\n\n#define bit(n) (1LL << (n))\n\n#define all(v) v.begin(), v.end()\n\n#define rall(v) v.rbegin(), v.rend()\n\n#define rg(v, ini, end) v.begin() + ini, v.begin() + end\n\n#define ret return 0;\n\n#define chmax(a, b) a = max(a, b)\n\n#define chmin(a, b) a = min(a, b)\n\nusing lint = long long;\n\nusing ulint = unsigned long long;\n\nusing ld = long double;\n\nstruct xy {\n\n  lint x, y;\n\n  xy() : x(0), y(0) {}\n\n  xy(lint _x, lint _y) : x(_x), y(_y) {}\n\n  xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }\n\n  bool operator<(xy p) const { return y == p.y ? x < p.x : y < p.y; }\n\n  bool operator==(xy p) const { return y == p.y && x == p.x; }\n};\n\nstruct xyd {\n\n  ld x, y;\n\n  xyd() : x(0), y(0) {}\n\n  xyd(long double _x, long double _y) : x(_x), y(_y) {}\n};\n\nusing vec = vector<lint>;\n\nusing vecd = vector<ld>;\n\nusing vecs = vector<string>;\n\nusing vecp = vector<xy>;\n\ntemplate <class T> using vect = vector<T>;\n\nclass vec2 : public vector<vector<lint>>\n\n{\n\npublic:\n  vec2() {}\n\n  vec2(lint n) : vector(n) {}\n\n  vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}\n\n  vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}\n};\n\ntemplate <class T> using priq = priority_queue<T>;\n\ntemplate <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class Key, class Val> using hashmap = unordered_map<Key, Val>;\n\ntemplate <class Key> using hashset = unordered_set<Key>;\n\ntemplate <class It>\n\nconstexpr typename It::value_type rmax(It begin, It end) {\n\n  return *max_element(begin, end);\n}\n\ntemplate <class T1, class T2>\n\nconstexpr auto mmax(T1 arg1, T2 arg2) {\n\n  using T = decltype(arg1 + arg2);\n\n  return max(T(arg1), T(arg2));\n}\n\ntemplate <class T, class... Types>\n\nconstexpr auto mmax(T arg0, Types... args) {\n\n  return mmax(arg0, mmax(args...));\n}\n\ntemplate <class It>\n\nconstexpr typename It::value_type rmin(It begin, It end) {\n\n  return *min_element(begin, end);\n}\n\ntemplate <class T1, class T2>\n\nconstexpr auto mmin(T1 arg1, T2 arg2) {\n\n  using T = decltype(arg1 + arg2);\n\n  return min(T(arg1), T(arg2));\n}\n\ntemplate <class T, class... Types>\n\nconstexpr auto mmin(T arg0, Types... args) {\n\n  return mmin(arg0, mmin(args...));\n}\n\nmt19937 mtrand((random_device())());\n\nconst double pi = 3.141592653589793238462;\n\nconst lint intmax = 9223372036854775807;\n\nconst lint inf = 1100100100100100100LL;\n\nconstexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }\n\n#if (__cplusplus < 201703L)\n\nlint gcd(lint a, lint b) {\n\n  while (1) {\n\n    if (a < b)\n      swap(a, b);\n\n    if (!b)\n      break;\n\n    a %= b;\n  }\n\n  return a;\n}\n\nlint lcm(lint a, lint b) { return a / gcd(a, b) * b; }\n\n#endif\n\ntemplate <class T>\n\nstruct nval {\n\n  lint n;\n\n  T val;\n\n  nval() : n(0){};\n\n  nval(lint _n, T _val) : n(_n), val(_val){};\n};\n\ntemplate <class It, class It2>\n\nauto spacel(It i, It2 end) {\n\n  return i + 1 == end ? '\\n' : ' ';\n}\n\nostream &setp(ostream &ost) {\n\n  cout << setprecision(60) << fixed;\n\n  return ost;\n}\n\nconst ulint mod = 998244353;\n\nconst ld eps = 0.0000001;\n\nstruct mint\n\n{\n\n  lint n;\n\n  mint() : n(0) {}\n\n  mint(lint a) { n = (a < 0) ? (mod - ((-a) % mod)) : (a % mod); }\n\n  mint &operator+=(mint a) {\n    (n += a.n) %= mod;\n    return *this;\n  }\n\n  mint &operator-=(mint a) {\n    ((n += mod) -= a.n) %= mod;\n    return *this;\n  }\n\n  mint &operator*=(mint a) {\n    (n *= a.n) %= mod;\n    return *this;\n  }\n\n  mint &operator%=(mint a) {\n    n %= a.n;\n    return *this;\n  }\n\n  mint &operator++() {\n    (n += 1) %= mod;\n    return *this;\n  }\n\n  mint &operator--() {\n    (n += (mod - 1)) %= mod;\n    return *this;\n  }\n};\n\nmint operator+(mint a, mint b) { return a += b; }\n\nmint operator-(mint a, mint b) { return a -= b; }\n\nmint operator*(mint a, mint b) { return a *= b; }\n\nmint operator-(mint a) {\n  a = mod - a;\n  return a;\n}\n\nvector<mint> invtbl, finvtbl, facttbl;\n\nmint factMod(lint n) {\n\n  if (n == 0) {\n    return 1;\n  }\n\n  mint ans = 1;\n\n  while (n > 1) {\n    ans *= n;\n    n--;\n  }\n\n  return ans;\n}\n\nmint powMod(mint x, lint y) {\n\n  if (x.n <= 1) {\n    return x;\n  }\n\n  mint tmp = y > 1 ? powMod(x, y / 2) : 1;\n\n  return tmp * tmp * ((y % 2 == 0) ? 1 : (x));\n}\n\nmint modinv(mint n) { return powMod(n, mod - 2); }\n\nvoid preCalcInv(lint up) {\n\n  invtbl.resize(up + 1);\n  invtbl[1] = 1;\n\n  repb(a, 2, up)\n\n      invtbl[a] = invtbl[a] = mod - invtbl[mod % a] * (mod / a);\n}\n\nmint &operator/=(mint &a, mint b) {\n  a *= (b.n < invtbl.size()) ? invtbl[b.n] : modinv(b);\n  return a;\n}\n\nmint operator/(mint a, mint b) { return a /= b; }\n\ntemplate <typename T>\n\nstruct BIT {\n\n  lint n;\n\n  vector<T> bit[2];\n\n  BIT(lint n_) { init(n_); }\n\n  void init(lint n_) {\n\n    n = n_ + 1;\n\n    for (int p = 0; p < 2; p++)\n      bit[p].assign(n, 0);\n  }\n\n  void add_impl(lint p, lint i, T x) {\n\n    for (int idx = i; idx < n; idx += (idx & -idx))\n\n      bit[p][idx] += x;\n  }\n\n  void add(lint l, lint r, T x) {\n\n    l++;\n    r++;\n\n    add_impl(0, l, -x * (l - 1));\n\n    add_impl(0, r, x * (r - 1));\n\n    add_impl(1, l, x);\n\n    add_impl(1, r, -x);\n  }\n\n  void add(lint i, T x) { add(i, i + 1, x); }\n\n  T sum_impl(lint p, lint i) {\n\n    T s(0);\n\n    for (int idx = i; idx > 0; idx -= (idx & -idx))\n\n      s += bit[p][idx];\n\n    return s;\n  }\n\n  T sum_impl(lint i) { return sum_impl(0, i) + sum_impl(1, i) * i; }\n\n  T query(lint l, lint r) { return sum_impl(r) - sum_impl(l); }\n};\n\nlint solve() {\n\n  lint n, k;\n\n  cin >> n >> k;\n\n  vec l(k), r(k);\n\n  rep(i, k)\n\n          cin >>\n      l[i] >> r[i];\n\n  BIT<mint> t(n * 2 + 10);\n\n  t.add(1, 2, 1);\n\n  repb(i, 1, n) {\n\n    rep(j, k) { t.add(i + l[j], i + r[j] + 1, t.query(i, i + 1)); }\n  }\n\n  cout << t.query(n, n + 1).n << endl;\n\n  ret;\n}\n\nint main()\n\n{\n\n  lint _ = 1;\n\n  rep(i, _)\n\n      solve();\n\n  return 0;\n}\n"}
{"fast_code_id":"b29ce1a232f0ca1962639f594e4df8a9f399e39ff07483defa54d48db8cf648a","fast_id":"9d5515731ea0bf45dc04c1bf1ed4444dffb412430f5835a5b3bffbfae8af88e0","fast_time":0.0088948997,"language":"cpp","measured_fast_code_id":"9d5515731ea0bf45dc04c1bf1ed4444dffb412430f5835a5b3bffbfae8af88e0","measured_slow_code_id":"553e4fb16f8674b02781c37eae409f1b23febf51e151f97bcc5e1238f188ad5f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12301","problem_id":"p03283","slow_code_id":"388bdb7178e0036cbca4ab1e2f764d71d35a23695febf7390764ec310a4789f2","slow_id":"553e4fb16f8674b02781c37eae409f1b23febf51e151f97bcc5e1238f188ad5f","slow_time":0.2373392702,"speedup":26.682624673103398,"stratum":"8+","sampling_key":"3792685de681d1cc871cf3165e51202431c3bd11b8749cd4748283289a738d2b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint dp[1010][1010];\n\nint main()\n\n{\n\n  int n, m, q, i, x, y, j, k;\n\n  scanf(\"%d%d%d\", &n, &m, &q);\n\n  memset(dp, 0, sizeof(dp));\n\n  for (i = 1; i <= m; i++)\n\n  {\n\n    scanf(\"%d%d\", &x, &y);\n\n    dp[x][y]++;\n  }\n\n  for (j = 1; j < n; j++)\n\n    for (i = 1; i + j <= n; i++)\n\n    {\n\n      k = i + j;\n\n      dp[i][k] = dp[i][k] + dp[i + 1][k] + dp[i][k - 1];\n\n      if (j > 1)\n        dp[i][k] -= dp[i + 1][k - 1];\n    }\n\n  while (q--)\n\n  {\n\n    scanf(\"%d%d\", &x, &y);\n\n    printf(\"%d\\n\", dp[x][y]);\n  }\n\n  return 0;\n}","fast_code":"\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int NN = 700;\n\nint x, y, ans, n, m, q, a[NN][NN], b[NN][NN], c[NN][NN];\n\nint main() {\n\n  scanf(\"%d%d%d\", &n, &m, &q);\n\n  for (int i = 1; i <= m; i++) {\n\n    scanf(\"%d%d\", &x, &y);\n\n    a[x][y]++;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = i; j <= n; j++)\n\n      for (int k = i; k <= j; k++)\n        b[i][j] += a[i][k];\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = i; j <= n; j++)\n\n      for (int k = i; k <= j; k++)\n        c[i][j] += b[k][j];\n\n  while (q--) {\n\n    scanf(\"%d%d\", &x, &y);\n\n    printf(\"%d\\n\", c[x][y]);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"f3f924cc2b5d9bd07e413313819933defd69ad827bdc27831b8ba2efac4f30b1","fast_id":"34837532483cef5eaad128889a3b73ec34f1b526f7c0df7c7508474382d6840c","fast_time":0.0132415741,"language":"cpp","measured_fast_code_id":"34837532483cef5eaad128889a3b73ec34f1b526f7c0df7c7508474382d6840c","measured_slow_code_id":"b4bec7267fee1290e5947827bd39bc131c854e64df5e96be4eba81a11205cef2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12533","problem_id":"p03656","slow_code_id":"24ed2b54e0df3d528dd5a029d1a30e04d51ddbadb71a6fd8c77b55c33d7aa03e","slow_id":"b4bec7267fee1290e5947827bd39bc131c854e64df5e96be4eba81a11205cef2","slow_time":0.7297946665,"speedup":55.11389061365446,"stratum":"8+","sampling_key":"65ac99f6599a81614f69a554cd6877df89469656e1a5e6c92f5cc58d08fd1e01","slow_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\n#define fi first\n\n#define se second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define fbo find_by_order\n\n#define ook order_of_key\n\ntypedef long long ll;\n\ntypedef pair<int, int> ii;\n\ntypedef vector<int> vi;\n\ntypedef long double ld;\n\ntypedef tree<int, null_type, less<int>, rb_tree_tag,\n             tree_order_statistics_node_update>\n    pbds;\n\ntypedef set<int>::iterator sit;\n\ntypedef map<int, int>::iterator mit;\n\ntypedef vector<int>::iterator vit;\n\nvi R[111111];\n\nvi B[111111];\n\nint ans[111111];\n\nvi adj[111111];\n\nvoid add_pair(int x, int y)\n\n{\n\n  adj[x].pb(y);\n  adj[y].pb(x);\n}\n\nvoid calcred(int u, int p)\n\n{\n\n  ans[u] = 1;\n\n  for (int i = 0; i < R[u].size(); i++)\n\n  {\n\n    int v = R[u][i];\n\n    if (v == p)\n      continue;\n\n    calcred(v, u);\n\n    ans[u] ^= 1;\n  }\n}\n\nvoid calcblue(int u, int p)\n\n{\n\n  int cur = 1;\n\n  for (int i = 0; i < B[u].size(); i++)\n\n  {\n\n    int v = B[u][i];\n\n    if (v == p)\n      continue;\n\n    calcblue(v, u);\n\n    cur ^= 1;\n  }\n\n  if (cur != ans[u])\n\n  {\n\n    cout << \"IMPOSSIBLE\\n\";\n    exit(0);\n  }\n}\n\nint matchred(int u, int p)\n\n{\n\n  int cur = -1;\n  if (ans[u])\n    cur = u;\n\n  for (int i = 0; i < R[u].size(); i++)\n\n  {\n\n    int v = R[u][i];\n\n    if (v == p)\n      continue;\n\n    int tmp = matchred(v, u);\n\n    if (tmp != -1)\n\n    {\n\n      if (cur == -1)\n        cur = tmp;\n\n      else\n\n      {\n\n        add_pair(cur, tmp);\n        cur = -1;\n      }\n    }\n  }\n\n  return cur;\n}\n\nint matchblue(int u, int p)\n\n{\n\n  int cur = -1;\n  if (ans[u])\n    cur = u;\n\n  for (int i = 0; i < B[u].size(); i++)\n\n  {\n\n    int v = B[u][i];\n\n    if (v == p)\n      continue;\n\n    int tmp = matchblue(v, u);\n\n    if (tmp != -1)\n\n    {\n\n      if (cur == -1)\n        cur = tmp;\n\n      else\n\n      {\n\n        add_pair(cur, tmp);\n        cur = -1;\n      }\n    }\n  }\n\n  return cur;\n}\n\nbool vis[111111];\n\nvoid coloring(int u, int col)\n\n{\n\n  vis[u] = 1;\n  ans[u] = col;\n\n  for (int i = 0; i < adj[u].size(); i++)\n\n  {\n\n    int v = adj[u][i];\n\n    if (!vis[v])\n\n    {\n\n      coloring(v, col * -1);\n    }\n  }\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(0);\n  cin.tie(0);\n\n  int n;\n  cin >> n;\n\n  int rt1 = 0;\n  int rt2 = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    int p;\n    cin >> p;\n\n    if (p == -1)\n      rt1 = i;\n\n    else\n\n    {\n\n      p--;\n      R[p].pb(i);\n    }\n  }\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    int p;\n    cin >> p;\n\n    if (p == -1)\n      rt2 = i;\n\n    else\n\n    {\n\n      p--;\n      B[p].pb(i);\n    }\n  }\n\n  calcred(rt1, -1);\n  calcblue(rt2, -1);\n\n  matchred(rt1, -1);\n  matchblue(rt2, -1);\n\n  for (int i = 0; i < n; i++) {\n    if (!vis[i] && ans[i] != 0)\n      coloring(i, 1);\n  }\n\n  cout << \"POSSIBLE\\n\";\n\n  for (int i = 0; i < n; i++)\n    cout << ans[i] << (i < n - 1 ? ' ' : '\\n');\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#define maxn 100005\n\nint n, r1, r2, s1[maxn], s2[maxn], ans[maxn], st[maxn], tp;\n\nbool vis[maxn];\n\nstruct node {\n  int v;\n  node *nxt;\n} edge[maxn * 16], *head[3][maxn], *ncnt;\n\nvoid addedge(int u, int v, int d)\n\n{\n\n  ncnt++;\n\n  ncnt->v = v, ncnt->nxt = head[d][u];\n\n  head[d][u] = ncnt;\n}\n\nvoid dfs(int d, int u)\n\n{\n\n  for (node *p = head[d][u]; p; p = p->nxt)\n    dfs(d, p->v);\n\n  if (!s1[u])\n    st[++tp] = u;\n\n  while (tp > 1) {\n    addedge(st[tp], st[tp - 1], 2);\n    addedge(st[tp - 1], st[tp], 2);\n    tp -= 2;\n  }\n}\n\nvoid dfs2(int u, int c)\n\n{\n\n  ans[u] = c, vis[u] = true;\n\n  for (node *p = head[2][u]; p; p = p->nxt)\n\n  {\n\n    int v = p->v;\n\n    if (!vis[v])\n      dfs2(v, -c);\n  }\n}\n\nint main()\n\n{\n\n  ncnt = &edge[0];\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int fa;\n\n    scanf(\"%d\", &fa);\n\n    if (fa > 0) {\n      addedge(fa, i, 0);\n      s1[fa] ^= 1;\n    }\n\n    else\n      r1 = i;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int fa;\n\n    scanf(\"%d\", &fa);\n\n    if (fa > 0) {\n      addedge(fa, i, 1);\n      s2[fa] ^= 1;\n    }\n\n    else\n      r2 = i;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    if (s1[i] != s2[i]) {\n      printf(\"IMPOSSIBLE\\n\");\n      return 0;\n    }\n\n  printf(\"POSSIBLE\\n\");\n\n  dfs(0, r1);\n\n  tp = 0;\n\n  dfs(1, r2);\n\n  for (int i = 1; i <= n; i++)\n\n    if (!vis[i])\n      dfs2(i, 1);\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%d \", s1[i] ? 0 : ans[i]);\n}"}
{"fast_code_id":"dafe019d94645af16cb3871a19180c77f0ca5daffea54de014673443328cb26b","fast_id":"c39f92089bbf86c9dc3d9886340519c696bc2f544cea038d5843924087ceaa9a","fast_time":0.1031847371,"language":"cpp","measured_fast_code_id":"c39f92089bbf86c9dc3d9886340519c696bc2f544cea038d5843924087ceaa9a","measured_slow_code_id":"7a400349a3899ab06bc08ce55194858b8cc3e341ff3d3a98841f50b7dbbbd7b3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12542","problem_id":"p00526","slow_code_id":"5a2b9f245cb036d50c7d3b6f1c2f67a2c0ffd6e52240ddd1be488737ac721def","slow_id":"7a400349a3899ab06bc08ce55194858b8cc3e341ff3d3a98841f50b7dbbbd7b3","slow_time":0.2266696266,"speedup":2.196735999630705,"stratum":"2-4","sampling_key":"a55523e6e101f89a1a78a927075cd20c3e01598427f761cf372c783a8327654a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n;\n\nint a[100010];\n\nint dp[100010][3];\n\nint main()\n\n{\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i + 1];\n  }\n\n  a[0] = a[1] ^ 1;\n\n  a[n + 1] = a[n] ^ 1;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (a[i - 1] ^ a[i]) {\n\n      dp[i][0] = dp[i - 1][0] + 1;\n\n      dp[i][1] = dp[i - 1][1] + 1;\n\n      dp[i][2] = dp[i - 1][2] + 1;\n\n    }\n\n    else {\n\n      dp[i][0] = 1;\n\n      dp[i][1] = dp[i - 1][0] + 1;\n\n      dp[i][2] = dp[i - 1][1] + 1;\n    }\n  }\n\n  cout << *max_element(dp[0], dp[100010]) << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n;\n\nvector<pair<int, int>> v(3, make_pair(-1, 0));\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    int a;\n\n    scanf(\"%d\", &a), a ^= i & 1;\n\n    if (v.empty() || v.back().first != a) {\n\n      v.emplace_back(a, 1);\n\n    }\n\n    else\n      v.back().second++;\n  }\n\n  int res = 0;\n\n  for (int i = 0; i + 2 < v.size(); i++) {\n\n    res = max(res, v[i].second + v[i + 1].second + v[i + 2].second);\n  }\n\n  printf(\"%d\\n\", res);\n}"}
{"fast_code_id":"8b3909b8fa9f43ab49232dc7c191a36a40eab76b955474e52ac2b62882cef08c","fast_id":"4ef8982752c9b0dded52edf83e9e851fa02020c9c4b657fb4e96385b9d913842","fast_time":0.0012482258,"language":"cpp","measured_fast_code_id":"4ef8982752c9b0dded52edf83e9e851fa02020c9c4b657fb4e96385b9d913842","measured_slow_code_id":"1635e3965821a7926470aea51d1f2354e481773ba2e36305ae8c0af9559c3184","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12545","problem_id":"p00283","slow_code_id":"95474f3351d176d5b3469af342ba7d4c45f4a928c83604762b173e670d772b80","slow_id":"1635e3965821a7926470aea51d1f2354e481773ba2e36305ae8c0af9559c3184","slow_time":0.0144233263,"speedup":11.555061832562666,"stratum":"8+","sampling_key":"9323097e17df508b9f1893055dfe624cbd8656182e979276cadd5d5ba67a49a6","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, n) for (int i = 0; i < (int)(n); ++i)\n\n#define REPR(i, n) for (int i = (int)(n) - 1; i >= 0; --i)\n\n#define FOR(i, c)                                                              \\\n  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n\n#define ALL(c) (c).begin(), (c).end()\n\n#define valid(y, x, h, w) (0 <= y && y < h && 0 <= x && x < w)\n\n#define tpl(...) make_tuple(__VA_ARGS__)\n\nconst int INF = 0x3f3f3f3f;\n\nconst double EPS = 1e-8;\n\nconst double PI = acos(-1);\n\nconst int dy[] = {-1, 0, 1, 0};\n\nconst int dx[] = {0, 1, 0, -1};\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename Ch, typename Tr, typename C, typename = decltype(begin(C()))>\nbasic_ostream<Ch, Tr> &operator<<(basic_ostream<Ch, Tr> &os,\n\n                                  const C &c) {\n  os << '[';\n  for (auto i = begin(c); i != end(c); ++i)\n    os << (i == begin(c) ? \"\" : \" \") << *i;\n  return os << ']';\n}\n\ntemplate <class S, class T>\nostream &operator<<(ostream &o, const pair<S, T> &t) {\n  return o << '(' << t.first << ',' << t.second << ')';\n}\n\ntemplate <int N, class Tp> void output(ostream &, const Tp &) {}\n\ntemplate <int N, class Tp, class, class... Ts>\nvoid output(ostream &o, const Tp &t) {\n  if (N)\n    o << ',';\n  o << get<N>(t);\n  output<N + 1, Tp, Ts...>(o, t);\n}\n\ntemplate <class... Ts> ostream &operator<<(ostream &o, const tuple<Ts...> &t) {\n  o << '(';\n  output<0, tuple<Ts...>, Ts...>(o, t);\n  return o << ')';\n}\n\ntemplate <class T> void output(T t, char z = 10) {\n  if (t < 0)\n    t = -t, putchar(45);\n  int c[20];\n\n  int k = 0;\n  while (t)\n    c[k++] = t % 10, t /= 10;\n  for (k || (c[k++] = 0); k;)\n    putchar(c[--k] ^ 48);\n  putchar(z);\n}\n\ntemplate <class T> void outputs(T t) { output(t); }\n\ntemplate <class S, class... T> void outputs(S a, T... t) {\n  output(a, 32);\n  outputs(t...);\n}\n\ntemplate <class T> void output(T *a, int n) {\n  REP(i, n) cout << a[i] << (i != n - 1 ? ',' : '\\n');\n}\n\ntemplate <class T> void output(T *a, int n, int m) {\n  REP(i, n) output(a[i], m);\n}\n\ntemplate <class T> bool input(T &t) {\n  int n = 1, c;\n  for (t = 0; !isdigit(c = getchar()) && ~c && c - 45;)\n    ;\n\n  if (!~c)\n    return 0;\n  for (c - 45 && (n = 0, t = c ^ 48); isdigit(c = getchar());)\n    t = 10 * t + c - 48;\n  t = n ? -t : t;\n  return 1;\n}\n\ntemplate <class S, class... T> bool input(S &a, T &...t) {\n  input(a);\n  return input(t...);\n}\n\ntemplate <class T> bool inputs(T *a, int n) {\n  REP(i, n) if (!input(a[i])) return 0;\n  return 1;\n}\n\nint dp[101][101][101];\n\nstruct P {\n\n  int a, e, r;\n\n  void in() { cin >> a >> e >> r; }\n\n  bool operator<(const P &rhs) const { return r < rhs.r; }\n\n} p[100];\n\nint main() {\n\n  int d, n;\n\n  while (cin >> d >> n, d || n) {\n\n    REP(i, n) { p[i].in(); }\n\n    sort(p, p + n);\n\n    memset(dp, 0x3f, sizeof(dp));\n\n    dp[0][0][0] = 0;\n\n    REP(i, n) {\n\n      for (int j = 0; j <= 100; ++j) {\n\n        REP(k, d + 1) {\n\n          chmin(dp[i + 1][j][k], dp[i][j][k]);\n\n          if (j >= p[i].r) {\n\n            chmin(dp[i + 1][min(100, j + p[i].e)][min(d, k + p[i].a)],\n                  dp[i + 1][j][k] + 1);\n          }\n        }\n      }\n    }\n\n    int ans = INF;\n\n    REP(i, 101) chmin(ans, dp[n][i][d]);\n\n    if (ans == INF)\n      puts(\"NA\");\n\n    else\n      cout << ans << endl;\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, n) for (int i = 0; i < (int)(n); ++i)\n\n#define FOR(i, c)                                                              \\\n  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n\n#define ALL(c) (c).begin(), (c).end()\n\nconst int INF = 0x3f3f3f3f;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename Ch, typename Tr, typename C, typename = decltype(begin(C()))>\nbasic_ostream<Ch, Tr> &operator<<(basic_ostream<Ch, Tr> &os,\n\n                                  const C &c) {\n  os << '[';\n  for (auto i = begin(c); i != end(c); ++i)\n    os << (i == begin(c) ? \"\" : \" \") << *i;\n  return os << ']';\n}\n\nint a[100];\n\nint e[100];\n\nint r[100];\n\nint dp[101][101];\n\nint main() {\n\n  int d, n;\n\n  while (cin >> d >> n, d || n) {\n\n    REP(i, n) { cin >> a[i] >> e[i] >> r[i]; }\n\n    memset(dp, 0x3f, sizeof(dp));\n\n    dp[0][0] = 0;\n\n    REP(i, d) {\n\n      REP(j, 101) {\n\n        REP(k, n) {\n\n          if (j >= r[k]) {\n\n            chmin(dp[min(d, i + a[k])][min(100, j + e[k])], dp[i][j] + 1);\n          }\n        }\n      }\n    }\n\n    int ans = INF;\n\n    REP(j, 101)\n\n    chmin(ans, dp[d][j]);\n\n    if (ans == INF)\n      puts(\"NA\");\n\n    else\n      cout << ans << endl;\n  }\n}"}
{"fast_code_id":"3f893bdc898ba19c082198017b5e83dc24e38bbd5f494aca55feaba1a14a1fa6","fast_id":"661b87534a5703d285d1c3276f8bf79aa3a50e9efbe08db7cdedb71c9a737f52","fast_time":0.0001894964,"language":"cpp","measured_fast_code_id":"661b87534a5703d285d1c3276f8bf79aa3a50e9efbe08db7cdedb71c9a737f52","measured_slow_code_id":"f9b51a36ac70c6d2fd19bdcf3fb4022fb7d518109095afde990c52d20527fa55","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12570","problem_id":"p03645","slow_code_id":"76d970f6b3089dc94f6acdabdb28955912426abe0c2d4329ff5f35da3dae2c95","slow_id":"f9b51a36ac70c6d2fd19bdcf3fb4022fb7d518109095afde990c52d20527fa55","slow_time":0.0074915032,"speedup":39.53374945381548,"stratum":"8+","sampling_key":"1bbe2727c1378f0b1ff0c0457f795f6a221e2f3a1aa3e8105024ac9a2da3cbe9","slow_code":"#include <stdio.h>\n\n#include <vector>\n\n#include <queue>\n\n#include <string.h>\n\nusing namespace std;\n\nint d[200005];\n\nconst int inf = 200005;\n\nvector<int> v[200005];\n\nvoid bfs(void)\n\n{\n\n  d[1] = 0;\n\n  queue<int> q;\n\n  q.push(1);\n\n  while (!q.empty())\n\n  {\n\n    int t = q.front();\n    q.pop();\n\n    for (int i = 0; i < v[t].size(); i++)\n\n    {\n\n      int tt = v[t][i];\n\n      if (d[t] + 1 < d[tt])\n\n      {\n\n        d[tt] = d[t] + 1;\n\n        q.push(tt);\n      }\n    }\n  }\n}\n\nint main()\n\n{\n\n  memset(d, inf, sizeof(d));\n\n  int n, m;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int a, b;\n\n    scanf(\"%d%d\", &a, &b);\n\n    v[a].push_back(b);\n  }\n\n  bfs();\n\n  if (d[n] == 2)\n    printf(\"POSSIBLE\\n\");\n\n  else\n    printf(\"IMPOSSIBLE\\n\");\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\nbool from[200005];\n\nbool to[200005];\n\nint main()\n\n{\n\n  int n, m;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 0; i < m; i++)\n\n  {\n\n    int a, b;\n\n    scanf(\"%d%d\", &a, &b);\n\n    if (a == 1)\n      from[b] = 1;\n\n    if (b == n)\n      to[a] = 1;\n  }\n\n  bool ans = 0;\n\n  for (int i = 2; i < n; i++)\n\n  {\n\n    if (from[i] && to[i])\n\n    {\n\n      ans = 1;\n\n      break;\n    }\n  }\n\n  if (ans)\n    printf(\"POSSIBLE\\n\");\n\n  else\n    printf(\"IMPOSSIBLE\\n\");\n\n  return 0;\n}\n"}
{"fast_code_id":"3c9b3c4edb796a62735c4ec28a941cd56ca50542e3347a0dbb3fa0a1c767cdf9","fast_id":"f0cab77c12eeaa66374fef6dcb9b8c84ed1504f646763f520b275389b83b1339","fast_time":0.1048295766,"language":"cpp","measured_fast_code_id":"f0cab77c12eeaa66374fef6dcb9b8c84ed1504f646763f520b275389b83b1339","measured_slow_code_id":"17164f130155b02022ce0872d7c9a7bc5db89a69fc5f303fc07d7f1ef12b9533","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12715","problem_id":"p03380","slow_code_id":"a23919aa080eb4c4f1ea67c54bfb07cfccfa028d792d989f389aa3c68a90ab0b","slow_id":"17164f130155b02022ce0872d7c9a7bc5db89a69fc5f303fc07d7f1ef12b9533","slow_time":0.6814695113,"speedup":6.500737038176686,"stratum":"4-8","sampling_key":"b85bb7186138f92dc20db2b39a50b6e98ca708dba626fab6d37a8bb7081d6e47","slow_code":"#include <stdio.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <string>\n\n#include <queue>\n\n#include <vector>\n\n#include <utility>\n\n#include <math.h>\n\n#include <set>\n\n#include <map>\n\n#include <string.h>\n\n#include <stack>\n\n#define n 200000\n\n#define loop(i, a, b) for (int i = a; i <= b; i++)\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\ntypedef long long lli;\n\ntypedef double llf;\n\nstruct edge {\n\n  int from, to, weight;\n\n  bool operator<(const edge &thing) const\n\n  {\n\n    return thing.weight < weight;\n  }\n};\n\nvector<edge> V[n + 50];\n\nbool visit[n + 50];\n\nint arr[n + 50], a, b, c, d, e;\n\nstring str1, str2;\n\nvoid addedge(int a, int b, int c)\n\n{\n\n  edge temp;\n\n  temp.from = a;\n\n  temp.to = b;\n\n  temp.weight = c;\n\n  V[a].push_back(temp);\n}\n\nvoid solve()\n\n{\n\n  cin >> a;\n\n  loop(i, 0, a - 1)\n\n          cin >>\n      arr[i];\n\n  int max = 0;\n\n  loop(i, 1, a - 1)\n\n      if (arr[i] > arr[max]) max = i;\n\n  int ans2 = -1;\n\n  int temp = arr[max] / 2;\n\n  loop(i, 0, a - 1)\n\n  {\n\n    if (i == max)\n      continue;\n\n    else if (ans2 == -1)\n      ans2 = i;\n\n    else\n\n    {\n\n      int t1 = abs(temp - arr[ans2]), t2 = abs(temp - arr[i]);\n\n      if (t2 < t1)\n        ans2 = i;\n    }\n  }\n\n  cout << arr[max] << ' ' << arr[ans2] << '\\n';\n}\n\nint main()\n\n{\n\n  int times = 1;\n\n  loop(i, 1, times)\n\n  {\n\n    solve();\n\n    printf(\"\\n\");\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int a;\n  cin >> a;\n\n  int arr[a + 50], n = 0, m = 0, now = 999999999;\n\n  for (int i = 0; i < a; i++)\n\n  {\n\n    cin >> arr[i];\n\n    n = max(n, arr[i]);\n  }\n\n  for (int i = 0; i < a; i++)\n\n  {\n\n    if (arr[i] == n)\n      continue;\n\n    int tmp = abs(arr[i] - n / 2);\n\n    if (m % 2)\n      tmp = min(abs(arr[i] - n / 2), abs(arr[i] - (n + 1) / 2));\n\n    if (tmp < now)\n\n    {\n\n      now = tmp;\n\n      m = arr[i];\n    }\n  }\n\n  cout << n << ' ' << m << '\\n';\n\n  return 0;\n}"}
{"fast_code_id":"079f2d1380bea53b5730bd3ebe74b79a57471cdf9015761712be8c6b8901ff63","fast_id":"be03826539ab3400773dd11f1ef271be8409aa81af09d561838c84286ee47a96","fast_time":0.0002280289,"language":"cpp","measured_fast_code_id":"be03826539ab3400773dd11f1ef271be8409aa81af09d561838c84286ee47a96","measured_slow_code_id":"1e8bba5edec2e7f8d18185171d149f176ae628707981cf9cf267c60e5f0b3ee1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12718","problem_id":"p00523","slow_code_id":"eba063c839876ae06aac1a98611f488c54d359bbe140c6eb769878fb19b13758","slow_id":"1e8bba5edec2e7f8d18185171d149f176ae628707981cf9cf267c60e5f0b3ee1","slow_time":0.0095416904,"speedup":41.84421536042142,"stratum":"8+","sampling_key":"52ba60360c4fcdba7bb39a56c654e481217ebd3dccc990d39ecb4c9c429586d7","slow_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long lint;\n\nint main()\n\n{\n\n  int n;\n\n  static int a[100000];\n\n  static int s[200000], t[200000], next[2][200000];\n\n  static pair<int, int> p[400000];\n\n  static vector<int> bucket[300000];\n\n  lint sum = 0;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d\", a + i);\n\n    sum += a[i];\n  }\n\n  lint left = 0, right = sum / 3;\n\n  while (left != right) {\n\n    lint mid = (left + right + 1) >> 1;\n\n    lint sum2 = 0;\n\n    int head = 0, tail = 0;\n\n    bool ng = false;\n\n    for (; head < n; head++) {\n\n      while (sum2 < mid) {\n\n        sum2 += a[tail++];\n\n        if (tail >= n)\n          tail -= n;\n      }\n\n      int i = head;\n\n      s[i] = head, t[i] = tail;\n\n      if (s[i] == t[i])\n        ng = true;\n\n      if (t[i] < s[i])\n        t[i] += n;\n\n      s[n + i] = s[i] + n, t[n + i] = t[i] + n;\n\n      sum2 -= a[head];\n    }\n\n    if (ng) {\n\n      right = mid - 1;\n\n      continue;\n    }\n\n    for (int i = 0; i < n * 3; i++)\n      bucket[i].clear();\n\n    for (int i = 0; i < n * 2; i++) {\n\n      bucket[t[i]].push_back(i);\n\n      bucket[s[i]].push_back(n * 2 + i);\n    }\n\n    int ctr = 0;\n\n    for (int i = 0; i < n * 3; i++) {\n\n      for (int j = 0; j < bucket[i].size(); j++) {\n\n        p[ctr++] = make_pair(i, bucket[i][j]);\n      }\n    }\n\n    int last = -1;\n\n    for (int i = n * 4 - 1; i >= 0; i--) {\n\n      int id = p[i].second;\n\n      if (id < n * 2)\n        next[0][id] = last;\n\n      else {\n\n        id -= n * 2;\n\n        if (last < 0 || t[last] > t[id])\n          last = id;\n      }\n    }\n\n    for (int k = 0; k + 1 < 2; k++) {\n\n      for (int i = 0; i < n * 2; i++) {\n\n        if (next[k][i] < 0)\n          next[k + 1][i] = -1;\n\n        else\n          next[k + 1][i] = next[k][next[k][i]];\n      }\n    }\n\n    int res = 0;\n\n    for (int i = 0; i < n; i++) {\n\n      int tmp = 0, j = i;\n\n      for (int k = 1; k >= 0; k--) {\n\n        int j2 = next[k][j];\n\n        if (j2 >= 0 && t[j2] <= s[i] + n) {\n\n          j = j2;\n\n          tmp |= 1 << k;\n        }\n      }\n\n      if (res >= 3)\n        break;\n\n      res = max(res, tmp + 1);\n    }\n\n    if (res >= 3)\n      left = mid;\n\n    else\n      right = mid - 1;\n  }\n\n  printf(\"%lld\\n\", left);\n\n  return (0);\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long lint;\n\nint main()\n\n{\n\n  int n;\n\n  int a[100000];\n\n  int t[300000];\n\n  lint sum = 0;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d\", a + i);\n\n    sum += a[i];\n  }\n\n  lint left = 0, right = sum / 3;\n\n  while (left != right) {\n\n    lint mid = (left + right + 1) >> 1;\n\n    lint sum2 = 0;\n\n    int head = 0, tail = 0;\n\n    for (; head < n; head++) {\n\n      while (sum2 < mid) {\n\n        sum2 += a[tail % n];\n\n        tail++;\n      }\n\n      t[head] = tail - 1;\n\n      t[head + n] = tail - 1 + n;\n\n      t[head + n + n] = tail - 1 + n + n;\n\n      sum2 -= a[head];\n    }\n\n    bool ok = false;\n\n    for (head = 0; head < n; head++) {\n\n      if (t[t[t[head] + 1] + 1] - head + 1 <= n) {\n\n        ok = true;\n\n        break;\n      }\n    }\n\n    if (ok)\n      left = mid;\n\n    else\n      right = mid - 1;\n  }\n\n  printf(\"%lld\\n\", left);\n\n  return (0);\n}"}
{"fast_code_id":"e2d6e1427361cfa21546810c9b7f1891b184ab26a33c7c11406050e82bc0dfbb","fast_id":"71d63d53aae1142a33f7f30e2b8df3a63d82d272e2829af7c199b672f5277990","fast_time":0.013487079,"language":"cpp","measured_fast_code_id":"71d63d53aae1142a33f7f30e2b8df3a63d82d272e2829af7c199b672f5277990","measured_slow_code_id":"a912548e661e5d48ce97c0a5c57ab2cf2e42a9df1500bc1d6b23c730bec1216d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1273","problem_id":"p03703","slow_code_id":"2b0815541de7e8a0c9b642aa0e0c8d99b817dce38fa3f646f4ccc8e0746e3eee","slow_id":"a912548e661e5d48ce97c0a5c57ab2cf2e42a9df1500bc1d6b23c730bec1216d","slow_time":0.4214875093,"speedup":31.251207863466952,"stratum":"8+","sampling_key":"11edb975a1df8cbbe995e56968376c450453a55bdf5cb768a6d38bcaaf81f683","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define N 200040\n\nusing namespace std;\n\nint n, k;\n\nlong long ans = 0, aux[N], sum[N];\n\nlong long tree[N];\n\nint lowbit(int x)\n\n{\n\n  return x & -x;\n}\n\nlong long getsum(int x)\n\n{\n\n  long long ans = 0;\n\n  for (int i = x; i; i -= lowbit(i))\n\n    ans += tree[i];\n\n  return ans;\n}\n\nvoid add(int x, int k)\n\n{\n\n  for (int i = x; i <= n + 16; i += lowbit(i))\n\n    tree[i] += k;\n}\n\nint main()\n\n{\n\n  memset(sum, 0, sizeof(sum));\n\n  memset(aux, 0, sizeof(aux));\n\n  memset(tree, 0, sizeof(tree));\n\n  scanf(\"%d%d\", &n, &k);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int x;\n\n    scanf(\"%d\", &x);\n\n    sum[i] = sum[i - 1] + x - k;\n\n    aux[i] = sum[i];\n  }\n\n  sort(aux, aux + 1 + n);\n\n  int m = unique(aux, aux + 1 + n) - aux;\n\n  for (int i = 0; i <= n; i++)\n\n    sum[i] = lower_bound(aux, aux + 1 + m, sum[i]) - aux + 1;\n\n  for (int i = 0; i <= n; i++)\n\n  {\n\n    ans += getsum(sum[i]);\n\n    add(sum[i], 1);\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nint n, k;\n\nlong long ans;\n\nlong long c[200010], val[200010], sum[200010];\n\ninline void add(long long x, long long y) {\n\n  for (; x <= n; x += x & -x)\n    c[x] += y;\n}\n\ninline long long ask(long long x) {\n\n  long long ans = 0;\n\n  for (; x; x -= x & -x)\n    ans += c[x];\n\n  return ans;\n}\n\nint main() {\n\n  scanf(\"%d %d\", &n, &k);\n\n  for (int i = 1; i <= n; ++i) {\n\n    scanf(\"%lld\", &val[i]);\n\n    val[i] -= k;\n  }\n\n  for (int i = 1; i <= n; ++i) {\n\n    sum[i] = (val[i] += val[i - 1]);\n\n    if (sum[i] >= 0)\n      ++ans;\n  }\n\n  std::sort(sum + 1, sum + 1 + n);\n  int t = std::unique(sum + 1, sum + 1 + n) - (sum + 1);\n\n  for (int i = 1; i <= n; ++i)\n    val[i] = std::lower_bound(sum + 1, sum + 1 + t, val[i]) - sum;\n\n  for (int i = 1; i <= n; ++i) {\n\n    ans += ask(val[i]);\n    add(val[i], 1);\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"ac6fd49f30dde6fd1e7f8ddd624e36c14cf4db0b68088b2a0d56718f3042652e","fast_id":"973a375f4b93cac82b737b555381ad81ace086630bc2c4ecec3b9a6add3fbce5","fast_time":0.1048369848,"language":"cpp","measured_fast_code_id":"973a375f4b93cac82b737b555381ad81ace086630bc2c4ecec3b9a6add3fbce5","measured_slow_code_id":"30eb8588fe1a268e3f47ee960b3b91bd9e0c293945f0fb92a6f8cf2cba99d0fc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12752","problem_id":"p03948","slow_code_id":"410c6adeb5e56e8508d3422699f90e0d39bc67bce6f8bc30b4df2570b0da16d4","slow_id":"30eb8588fe1a268e3f47ee960b3b91bd9e0c293945f0fb92a6f8cf2cba99d0fc","slow_time":0.3850119856,"speedup":3.6724824386593764,"stratum":"2-4","sampling_key":"5608b9bb5064422e30bd1c966ebed2f9a82a8ab54fea5faf568e02ea698e2811","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define maxn 100010\n\n#define inf 0x3f3f3f3f\n\nint v[maxn];\n\nint pre[maxn];\n\nvector<int> g[maxn];\n\nint ty[maxn];\n\nbool used[maxn];\n\nint a, b;\n\nvoid dfs(int u) {\n\n  a++;\n  b += ty[u];\n\n  used[u] = true;\n\n  for (int i = 0; i < g[u].size(); i++) {\n\n    int to = g[u][i];\n\n    if (used[to])\n      continue;\n\n    dfs(to);\n  }\n}\n\nint main() {\n\n  int n, T;\n\n  scanf(\"%d%d\", &n, &T);\n\n  scanf(\"%d\", &v[0]);\n\n  int minx = v[0], dis = 0, pos = 0;\n\n  for (int i = 1; i < n; i++) {\n\n    scanf(\"%d\", &v[i]);\n\n    if (v[i] <= minx) {\n\n      pre[i] = i;\n\n      minx = v[i];\n\n      pos = i;\n\n    }\n\n    else {\n\n      pre[i] = pos;\n\n      dis = max(dis, v[i] - v[pos]);\n    }\n  }\n\n  memset(used, 1, sizeof(used));\n\n  for (int i = 1; i < n; i++) {\n\n    if (v[i] - v[pre[i]] == dis) {\n\n      g[pre[i]].push_back(i);\n\n      g[i].push_back(pre[i]);\n\n      used[i] = used[pre[i]] = false;\n\n      ty[pre[i]] = 1;\n    }\n  }\n\n  int res = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    if (!used[i]) {\n\n      a = b = 0;\n\n      dfs(i);\n\n      res += min(b, a - b);\n    }\n  }\n\n  printf(\"%d\\n\", res);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define maxn 100010\n\nint q[maxn], top = 0;\n\nint Max = 0, cnt = 0;\n\nint n, a[maxn];\n\nint main()\n\n{\n\n  int t, T;\n\n  t = 1;\n\n  while (t--)\n\n  {\n\n    scanf(\"%d %d\", &n, &T);\n\n    for (int i = 0; i < n; i++)\n      scanf(\"%d\", &a[i]);\n\n    q[0] = a[0], top = 0;\n\n    Max = -1;\n\n    for (int i = 1; i < n; i++)\n\n    {\n\n      if (a[i] > q[top])\n        q[++top] = a[i];\n\n      else if (a[i] < q[top])\n\n      {\n\n        if (q[top] - q[0] > Max)\n          Max = q[top] - q[0], cnt = 1;\n\n        else if (q[top] - q[0] == Max)\n          cnt++;\n\n        while (top >= 0 && a[i] < q[top])\n          top--;\n\n        q[++top] = a[i];\n      }\n    }\n\n    if (q[top] - q[0] > Max)\n      Max = q[top] - q[0], cnt = 1;\n\n    else if (q[top] - q[0] == Max)\n      cnt++;\n\n    printf(\"%d\\n\", cnt);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"82ea6469bc4bce7647b1cbc0eaef4915cd5adc0b9cae12d90d0d571a6dd206b8","fast_id":"a281e6f1814ef4d9dcdf6e28943dc9561bc48a21f463f4ba7f9037de1f763491","fast_time":0.0557864725,"language":"cpp","measured_fast_code_id":"a281e6f1814ef4d9dcdf6e28943dc9561bc48a21f463f4ba7f9037de1f763491","measured_slow_code_id":"601715fa1a6f325aca8e315fc60da52c67394b27ce4b30d9eb772d969488a933","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12754","problem_id":"p02982","slow_code_id":"6c82c7a378f82bfb4ec0fba9f6cca92c75ba583668c1cc99fe3ae9b359eca4e4","slow_id":"601715fa1a6f325aca8e315fc60da52c67394b27ce4b30d9eb772d969488a933","slow_time":0.1551835216,"speedup":2.781741068141564,"stratum":"2-4","sampling_key":"1cffc6474ff7fc1559b6e9d41d54a57d70ce221a694cdbcb68198a762b3cbc00","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define lli long long int\n\n#define REP(i, s, l) for (lli i = s; i < l; i++)\n\n#define DEBUG 0\n\n#define INF (1LL << 50)\n\n#define MOD 1000000007\n\nvector<vector<lli>> v;\n\nlli n, d;\n\nlli distance(lli a, lli b) {\n\n  lli sum = 0;\n\n  REP(i, 0, d) {\n\n    lli d = v[a].at(i) - v[b].at(i);\n\n    sum += d * d;\n  }\n\n  return sum;\n}\n\nsigned main() {\n\n  cin >> n >> d;\n\n  v.resize(n);\n\n  set<lli> s;\n\n  REP(i, 0, 10000) { s.insert(i * i); }\n\n  REP(i, 0, n) REP(j, 0, d) {\n\n    lli tmp;\n\n    cin >> tmp;\n\n    v[i].push_back(tmp);\n  }\n\n  lli ans = 0;\n\n  for (lli i = 0; i < n; i++) {\n\n    for (lli j = i + 1; j < n; j++) {\n\n      lli d = distance(i, j);\n\n      if (s.find(d) != s.end())\n        ans++;\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define lli long long int\n\n#define REP(i, s, n) for (int i = s; i < n; i++)\n\n#define NUM 2520\n\n#define INF (1LL << 50)\n\n#define DEBUG 0\n\n#define mp(a, b) make_pair(a, b)\n\n#define SORT(V) sort(V.begin(), V.end())\n\n#define PI (3.141592653589794)\n\n#define TO_STRING(VariableName) #VariableName\n\n#define LOG(x)                                                                 \\\n  if (DEBUG)                                                                   \\\n    cout << TO_STRING(x) << \"=\" << x << \" \" << endl;\n\n#define LOG2(x, y)                                                             \\\n  if (DEBUG)                                                                   \\\n    cout << TO_STRING(x) << \"=\" << x << \" \" << TO_STRING(y) << \"=\" << y << endl;\n\n#define LOG3(x, y, z)                                                          \\\n  if (DEBUG)                                                                   \\\n    cout << TO_STRING(x) << \"=\" << x << \" \" << TO_STRING(y) << \"=\" << y << \" \" \\\n         << TO_STRING(z) << \"=\" << z << endl;\n\n#define LOG4(w, x, y, z)                                                       \\\n  if (DEBUG)                                                                   \\\n    cout << TO_STRING(w) << \"=\" << w << \" \" << TO_STRING(x) << \"=\" << x << \" \" \\\n         << TO_STRING(y) << \"=\" << y << \" \" << TO_STRING(z) << \"=\" << z        \\\n         << endl;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nlli x[30][30];\n\nlli d;\n\nlli distance(lli i, lli j) {\n\n  lli ans = 0;\n\n  REP(k, 0, d) {\n\n    lli diff = x[i][k] - x[j][k];\n\n    ans += (diff)*diff;\n  }\n\n  return ans;\n}\n\nbool judge(lli num) {\n\n  for (lli i = 1; i * i <= num; i++) {\n\n    if (i * i == num) {\n\n      return true;\n    }\n  }\n\n  return false;\n}\n\nint main() {\n\n  lli n;\n\n  cin >> n >> d;\n\n  REP(i, 0, n) REP(j, 0, d) cin >> x[i][j];\n\n  lli cnt = 0;\n\n  REP(i, 0, n) REP(j, i + 1, n) {\n\n    if (judge(distance(i, j)))\n      cnt++;\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}"}
{"fast_code_id":"c43dbc3587bb2c4a10768457f8204c341caf10a6ef273aa8f807d8a306736ca8","fast_id":"952398ba928324aadf4029a18402fef172611800e1eb59a714db8c455e57deda","fast_time":0.0553131682,"language":"cpp","measured_fast_code_id":"952398ba928324aadf4029a18402fef172611800e1eb59a714db8c455e57deda","measured_slow_code_id":"aa55f912a54dc86710a5d2a9b4fc3f6b6c1c41a9c9e7a58c280f54dfa6a0e132","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12758","problem_id":"p02724","slow_code_id":"f649cee9a04432b9dd4f2119d221e9654bb175c4b8c03f58c576a15eab0da048","slow_id":"aa55f912a54dc86710a5d2a9b4fc3f6b6c1c41a9c9e7a58c280f54dfa6a0e132","slow_time":0.5453036091,"speedup":9.858477227851143,"stratum":"8+","sampling_key":"0475703cc7c1198d9cab59ffc6a43d4da3d2f14e852fcda7031da4616efd9862","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\n#include <map>\n\n#include <iomanip>\n\n#include <limits>\n\n#include <unordered_set>\n\n#include <cmath>\n\n#include <numeric>\n\n#include <array>\n\n#include <utility>\n\n#include <complex>\n\n#define M_PI 3.141592653589793238\n\nusing namespace std;\n\nlong long p = 1000000007;\n\n#define int long long\n\n#define ll long long\n\n#define vel vector<ll>\n\n#define vvel vector<vel>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define sor(v) sort(v.begin(), v.end())\n\n#define mmax(a, b) a = max(a, b)\n\n#define mmin(a, b) a = min(a, b)\n\n#define mkp(a, b) make_pair(a, b)\n\n#define pin pair<ll, ll>\n\n#define qin pair<pin, int>\n\n#define V vector\n\n#define Endl endl\n\n#define veb vector<bool>\n\n#define fcout cout << fixed << setprecision(15)\n\n#define rev(s) reverse(s.begin(), s.end())\n\n#define lower(h, val) (lower_bound(h.begin(), h.end(), val) - h.begin())\n\n#define upper(h, val) (upper_bound(h.begin(), h.end(), val) - h.begin())\n\nvel kai;\n\nvel inv_kai;\n\nint rui(int a, int n, int mod) {\n\n  if (n == 0) {\n    return 1 % mod;\n  }\n\n  int x = rui(a, n / 2, mod);\n\n  x *= x;\n  x %= mod;\n\n  if (n % 2 == 1) {\n    x *= a;\n    x %= mod;\n  }\n\n  return x;\n}\n\nint root(int x, vel &pa) {\n\n  if (pa[x] == -1) {\n    return x;\n  }\n\n  int ans = root(pa[x], pa);\n  pa[x] = ans;\n\n  return ans;\n}\n\nbool mar(int x, int y, vel &pa) {\n\n  x = root(x, pa);\n\n  y = root(y, pa);\n\n  if (x != y) {\n    pa[x] = y;\n  }\n\n  return (x != y);\n}\n\nint gcd(int x, int y) {\n\n  if (x < y) {\n    return gcd(y, x);\n  }\n\n  if (y == 0) {\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint lcm(ll x, ll y) {\n\n  x = abs(x);\n  y = abs(y);\n\n  return x * y / gcd(x, y);\n}\n\nlong long modinv(long long a, long long m) {\n\n  long long b = m, u = 1, v = 0;\n\n  while (b) {\n\n    long long t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvoid make_kai(int max_kai) {\n\n  kai = vel(max_kai, 1);\n\n  inv_kai = kai;\n\n  rep(i, max_kai - 1) {\n\n    kai[i + 1] = kai[i] * (i + 1);\n    kai[i + 1] %= p;\n\n    inv_kai[i + 1] = modinv(kai[i + 1], p);\n  }\n}\n\nint com(int n, int r) {\n\n  if ((n < 0) || (r < 0) || (r > n)) {\n    return 0;\n  }\n\n  int ans = (kai[n] * inv_kai[r]) % p;\n\n  return (ans * inv_kai[n - r]) % p;\n}\n\nvel uni(vel x) {\n\n  if (x.size() == 0) {\n    return x;\n  }\n\n  sor(x);\n\n  int n = x.size();\n\n  vel ans(1, x[0]);\n\n  for (int j = 1; j < n; j++) {\n\n    if (x[j - 1] != x[j]) {\n      ans.push_back(x[j]);\n    }\n  }\n\n  x = ans;\n\n  return x;\n}\n\nvoid pr(vel &v) {\n\n  int n = v.size();\n\n  if (n != 0) {\n\n    cout << v[0];\n\n    rep(i, n - 1) { cout << \" \" << v[i + 1]; }\n\n    cout << endl;\n  }\n}\n\nvel dijk(V<V<pin>> &way, int st, int inf) {\n\n  int n = way.size();\n\n  vel dist(n, inf);\n  dist[st] = 0;\n\n  priority_queue<pin, vector<pin>, greater<pin>> pq;\n\n  pq.push(mkp(0, st));\n\n  veb is_checked(n, false);\n\n  while (!pq.empty()) {\n\n    pin x = pq.top();\n    pq.pop();\n\n    int pot = x.second;\n\n    if (!is_checked[pot]) {\n\n      is_checked[pot] = true;\n\n      for (auto y : way[pot]) {\n\n        int nex_dist = x.first + y.second;\n\n        int nex_pot = y.first;\n\n        if (dist[nex_pot] > nex_dist) {\n\n          dist[nex_pot] = nex_dist;\n\n          pq.push(mkp(nex_dist, y.first));\n        }\n      }\n    }\n  }\n\n  return dist;\n}\n\nvel mul(vel &a, vel &b) {\n\n  int n = a.size();\n\n  int m = b.size();\n\n  vel ans(n + m - 1, 0);\n\n  rep(i, n) {\n\n    rep(j, m) {\n\n      ans[i + j] += a[i] * b[j];\n\n      ans[i + j] %= p;\n    }\n  }\n\n  return ans;\n}\n\nvel rui_p(vel &a, int n) {\n\n  if (n == 0) {\n    return {1};\n  }\n\n  vel qans = rui_p(a, n / 2);\n\n  qans = mul(qans, qans);\n\n  if (n % 2 == 1) {\n\n    qans = mul(qans, a);\n  }\n\n  return qans;\n}\n\nbool is_prime(int n) {\n\n  if (n == 0 || n == 1) {\n    return false;\n  }\n\n  for (int i = 2; i * i <= n; i++) {\n\n    if (n % i == 0) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n#define bs bitset<50>\n\nvoid per(int &ans) {\n\n  ans %= p;\n\n  if (ans < 0) {\n    ans += p;\n  }\n}\n\n#define upperbound(v, val) upper_bound(v.begin(), v.end(), val) - v.begin()\n\n#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val) - v.begin()\n\n#define mat V<V<pin>>\n\nvvel disj_min(vel &v) {\n\n  int n = v.size();\n\n  vvel ret(22, vel(n));\n\n  ret[0] = v;\n\n  rep(i, 21) {\n\n    rep(j, n) {\n\n      int nex = j + (1 << i);\n\n      if (nex < n) {\n\n        ret[i + 1][j] = min(ret[i][j], ret[i][nex]);\n\n      }\n\n      else {\n\n        ret[i + 1][j] = ret[i][j];\n      }\n    }\n  }\n\n  return ret;\n}\n\nvvel disj_max(vel &v) {\n\n  int n = v.size();\n\n  vvel ret(22, vel(n));\n\n  ret[0] = v;\n\n  rep(i, 21) {\n\n    rep(j, n) {\n\n      int nex = j + (1 << i);\n\n      if (nex < n) {\n\n        ret[i + 1][j] = max(ret[i][j], ret[i][nex]);\n\n      }\n\n      else {\n\n        ret[i + 1][j] = ret[i][j];\n      }\n    }\n  }\n\n  return ret;\n}\n\nint find_min(vvel &dv, int l, int r) {\n\n  int i = 21;\n\n  while (l + (1 << i) > r) {\n\n    i--;\n  }\n\n  return min(dv[i][l], dv[i][r - (1 << i)]);\n}\n\nint find_max(vvel &dv, int l, int r) {\n\n  int i = 21;\n\n  while (l + (1 << i) > r) {\n\n    i--;\n  }\n\n  return max(dv[i][l], dv[i][r - (1 << i)]);\n}\n\nvoid pri(vel &v) {\n\n  if (v.size() == 0) {\n    return;\n  }\n\n  cout << v[0];\n\n  rep(i, v.size() - 1) { cout << \" \" << v[i + 1]; }\n\n  cout << endl;\n\n  return;\n}\n\nvvel dbl(vel &v) {\n\n  vvel ans(20, vel(v));\n\n  int n = v.size();\n\n  rep(i, 19) {\n\n    rep(j, n) { ans[i + 1][j] = ans[i][ans[i][j]]; }\n  }\n\n  return ans;\n}\n\nint lca(int s, int t, int diff, vvel &pa) {\n\n  if (diff < 0) {\n    return lca(t, s, -diff, pa);\n  }\n\n  rep(i, 19) {\n\n    if ((diff & (1 << i)) != 0) {\n\n      s = pa[i][s];\n    }\n  }\n\n  for (int i = 19; i >= 0; i--) {\n\n    if (pa[i][s] != pa[i][t]) {\n\n      s = pa[i][s];\n\n      t = pa[i][t];\n    }\n  }\n\n  if (s != t) {\n\n    s = pa[0][s];\n  }\n\n  return s;\n}\n\nint sz = 1024 * 1024;\n\nvel bit(sz + 1, 0);\n\nvoid add(int a, int w) {\n\n  while (a <= sz) {\n\n    bit[a] += w;\n\n    a += (a & (-a));\n  }\n}\n\nint sum(int a) {\n\n  int ans = 0;\n\n  while (a != 0) {\n\n    ans += bit[a];\n\n    a -= (a & (-a));\n  }\n\n  return ans;\n}\n\n#define vveb V<veb>\n\n#define omajinai                                                               \\\n  cin.tie(0);                                                                  \\\n  ios::sync_with_stdio(false);\n\n#define endl \"\\n\"\n\nint modpow(int a, int n, int p) {\n\n  if (n == 0) {\n    return 1;\n  }\n\n  int m = n / 2;\n\n  int x = modpow(a, n / 2, p);\n\n  x *= x;\n  x %= p;\n\n  if (n % 2 == 1) {\n    x *= a;\n    x %= p;\n  }\n\n  return x;\n}\n\nsigned main() {\n\n  int x;\n  cin >> x;\n  x /= 5;\n\n  cout << (x / 100) * 1000 + (x % 100) * 5 << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\n#include <map>\n\n#include <iomanip>\n\n#include <limits>\n\n#include <unordered_set>\n\n#include <cmath>\n\n#include <numeric>\n\n#include <array>\n\n#include <utility>\n\n#include <complex>\n\n#define M_PI 3.141592653589793238\n\nusing namespace std;\n\nlong long p = 1000000007;\n\n#define int long long\n\n#define ll long long\n\n#define vel vector<ll>\n\n#define vvel vector<vel>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define sor(v) sort(v.begin(), v.end())\n\n#define mmax(a, b) a = max(a, b)\n\n#define mmin(a, b) a = min(a, b)\n\n#define mkp(a, b) make_pair(a, b)\n\n#define pin pair<ll, ll>\n\n#define qin pair<pin, int>\n\n#define V vector\n\n#define Endl endl\n\n#define veb vector<bool>\n\n#define fcout cout << fixed << setprecision(15)\n\n#define rev(s) reverse(s.begin(), s.end())\n\n#define lower(h, val) (lower_bound(h.begin(), h.end(), val) - h.begin())\n\n#define upper(h, val) (upper_bound(h.begin(), h.end(), val) - h.begin())\n\n#define vveb V<veb>\n\n#define omajinai                                                               \\\n  cin.tie(0);                                                                  \\\n  ios::sync_with_stdio(false);\n\n#define endl \"\\n\"\n\n#define pb push_back\n\nvel kai;\n\nvel inv_kai;\n\nint root(int x, vel &pa) {\n\n  if (pa[x] == -1) {\n    return x;\n  }\n\n  int ans = root(pa[x], pa);\n  pa[x] = ans;\n\n  return ans;\n}\n\nbool mar(int x, int y, vel &pa) {\n\n  x = root(x, pa);\n\n  y = root(y, pa);\n\n  if (x != y) {\n    pa[x] = y;\n  }\n\n  return (x != y);\n}\n\nint gcd(int x, int y) {\n\n  if (x < y) {\n    return gcd(y, x);\n  }\n\n  if (y == 0) {\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint lcm(ll x, ll y) {\n\n  x = abs(x);\n  y = abs(y);\n\n  return x * (y / gcd(x, y));\n}\n\nlong long modinv(long long a, long long m) {\n\n  long long b = m, u = 1, v = 0;\n\n  while (b) {\n\n    long long t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvoid make_kai(int max_kai, int p) {\n\n  kai = vel(max_kai, 1);\n\n  inv_kai = kai;\n\n  rep(i, max_kai - 1) {\n\n    kai[i + 1] = kai[i] * (i + 1);\n    kai[i + 1] %= p;\n\n    inv_kai[i + 1] = modinv(kai[i + 1], p);\n  }\n}\n\nint com(int n, int r) {\n\n  if ((n < 0) || (r < 0) || (r > n)) {\n    return 0;\n  }\n\n  int ans = (kai[n] * inv_kai[r]) % p;\n\n  return (ans * inv_kai[n - r]) % p;\n}\n\nvel uni(vel x) {\n\n  if (x.size() == 0) {\n    return x;\n  }\n\n  sor(x);\n\n  int n = x.size();\n\n  vel ans(1, x[0]);\n\n  for (int j = 1; j < n; j++) {\n\n    if (x[j - 1] != x[j]) {\n      ans.push_back(x[j]);\n    }\n  }\n\n  x = ans;\n\n  return x;\n}\n\nvel dijk(V<V<pin>> &way, int st, int inf) {\n\n  int n = way.size();\n\n  vel dist(n, inf);\n  dist[st] = 0;\n\n  priority_queue<pin, vector<pin>, greater<pin>> pq;\n\n  pq.push(mkp(0, st));\n\n  veb is_checked(n, false);\n\n  while (!pq.empty()) {\n\n    pin x = pq.top();\n    pq.pop();\n\n    int pot = x.second;\n\n    if (!is_checked[pot]) {\n\n      is_checked[pot] = true;\n\n      for (auto y : way[pot]) {\n\n        int nex_dist = x.first + y.second;\n\n        int nex_pot = y.first;\n\n        if (dist[nex_pot] > nex_dist) {\n\n          dist[nex_pot] = nex_dist;\n\n          pq.push(mkp(nex_dist, y.first));\n        }\n      }\n    }\n  }\n\n  return dist;\n}\n\nvoid make_tree(vvel &chi, vel &par, int n) {\n\n  V<V<pin>> way(n);\n\n  rep(i, n - 1) {\n\n    int a, b;\n    cin >> a >> b;\n    a--;\n    b--;\n\n    way[a].push_back(mkp(b, 1));\n\n    way[b].push_back(mkp(a, 1));\n  }\n\n  vel dist = dijk(way, 0, n + 1);\n\n  par = vel(n, -1);\n\n  chi = vvel(n);\n\n  rep(i, n) {\n\n    for (auto nex : way[i]) {\n\n      int pot = nex.first;\n\n      if (dist[pot] > dist[i]) {\n        chi[i].push_back(pot);\n      }\n\n      else {\n        par[i] = pot;\n      }\n    }\n  }\n}\n\n#define bs bitset<50>\n\n#define upperbound(v, val) upper_bound(v.begin(), v.end(), val) - v.begin()\n\n#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val) - v.begin()\n\nvoid pri(vel &v) {\n\n  if (v.size() == 0) {\n    return;\n  }\n\n  cout << v[0];\n\n  rep(i, v.size() - 1) { cout << \" \" << v[i + 1]; }\n\n  cout << endl;\n\n  return;\n}\n\nint modpow(int a, int n, int p) {\n\n  if (n == 0) {\n    return 1;\n  }\n\n  int m = n / 2;\n\n  int x = modpow(a, n / 2, p);\n\n  x *= x;\n  x %= p;\n\n  if (n % 2 == 1) {\n    x *= a;\n    x %= p;\n  }\n\n  return x;\n}\n\nsigned main() {\n\n  int x;\n  cin >> x;\n  x /= 5;\n\n  cout << (x / 100) * 1000 + (x % 100) * 5 << endl;\n\n  return 0;\n}"}
{"fast_code_id":"fa773e83067e8dbce750f72294a1ae681f9c928fe36a448da848f50055529fff","fast_id":"2e984cd849dc001ef9344039ffb54ad5f3461b6bd3acefc98e7fa03495df14d3","fast_time":0.0932774617,"language":"cpp","measured_fast_code_id":"2e984cd849dc001ef9344039ffb54ad5f3461b6bd3acefc98e7fa03495df14d3","measured_slow_code_id":"d483adea002838879bb1a25693b6265f89551b737c7b88129663d6ccf6c26b53","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12769","problem_id":"p03333","slow_code_id":"28959ce799036fb183f43d36f329ea99992a77e811b430c8687b714791d58117","slow_id":"d483adea002838879bb1a25693b6265f89551b737c7b88129663d6ccf6c26b53","slow_time":0.2150008303,"speedup":2.3049601305778245,"stratum":"2-4","sampling_key":"2859cdc2ebc2b3b19e3a912ecf8ab024b5bc9d3093c786742e85fcbf0b8bc9f4","slow_code":"#include <algorithm>\n\n#include <cstdio>\n\n#include <cstring>\n\nconst int Maxv = 100010;\n\nint l[Maxv << 1], r[Maxv << 1], n;\n\nlong long ans;\n\ninline int read() {\n\n  int x = 0, f = 1;\n\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9') {\n\n    if (ch == '-') {\n\n      f = -1;\n    }\n\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n\n    x = (x << 3) + (x << 1) + ch - '0';\n\n    ch = getchar();\n  }\n\n  return x * f;\n}\n\nint main() {\n\n  n = read();\n\n  for (int i = 1; i <= n; i++) {\n\n    int L = read();\n\n    int R = read();\n\n    l[Maxv + R]++;\n\n    r[Maxv + L]++;\n  }\n\n  l[Maxv]++;\n\n  r[Maxv]++;\n\n  for (int i = 1; i < 2 * Maxv; i++) {\n\n    l[i] += l[i - 1];\n  }\n\n  for (int i = 2 * Maxv - 2; i >= 0; i--) {\n\n    r[i] += r[i + 1];\n  }\n\n  for (int i = 0; i < 2 * Maxv - 1; i++) {\n\n    ans += std::min(l[i], r[i + 1]) * 2;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define up(l, r, i) for (int i = l; i <= r; i++)\n\n#define dn(l, r, i) for (int i = l; i >= r; i--)\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int INF = 2147483647;\n\nint qread() {\n\n  int w = 1, c, ret;\n\n  while ((c = getchar()) > '9' || c < '0')\n\n    w = (c == '-' ? -1 : 1);\n  ret = c - '0';\n\n  while ((c = getchar()) >= '0' && c <= '9')\n\n    ret = ret * 10 + c - '0';\n\n  return ret * w;\n}\n\nconst int MAXN = 1e5 + 3;\n\nstruct Node {\n\n  int l, r, ID;\n\n  Node(int _l, int _r, int _ID) { l = _l, r = _r, ID = _ID; }\n\n  Node() {}\n\n} P[MAXN];\n\nbool vis[MAXN];\n\nstruct cmp1 {\n\n  bool operator()(Node a, Node b) { return a.l < b.l; }\n};\n\nstruct cmp2 {\n\n  bool operator()(Node a, Node b) { return a.r > b.r; }\n};\n\npriority_queue<Node, vector<Node>, cmp1> pq1;\n\npriority_queue<Node, vector<Node>, cmp2> pq2;\n\nint n, L[MAXN], R[MAXN];\n\nLL calc(bool type) {\n\n  LL ret = 0, pos = 0, _pos;\n\n  memset(vis, 0, sizeof(vis));\n\n  up(1, n, i) pq1.push(Node(L[i], R[i], i)),\n\n      pq2.push(Node(L[i], R[i], i));\n\n  up(1, n, i) {\n\n    Node t = (type ? pq1.top() : pq2.top());\n\n    type ? pq1.pop() : pq2.pop();\n\n    if (vis[t.ID])\n      continue;\n    else\n      vis[t.ID] = true;\n\n    if (pos < t.l)\n      _pos = t.l;\n    else\n\n        if (pos > t.r)\n      _pos = t.r;\n    else\n      _pos = pos;\n\n    ret += (LL)abs(pos - _pos), type = !type, pos = _pos;\n  }\n\n  return (ret += (LL)abs(pos));\n}\n\nint main() {\n\n  n = qread();\n\n  up(1, n, i) L[i] = qread(), R[i] = qread();\n\n  printf(\"%lld\\n\", max(calc(true), calc(false)));\n\n  return 0;\n}\n"}
{"fast_code_id":"fee2291484ee24d43fa1c9617f48276a218a677f5459aced907f685268ce7f99","fast_id":"1ef01d2d70f180ab8cf36b1e0a3eaa4b2281ed94651bbdcb2c9ee9404aed8893","fast_time":0.1070302645,"language":"cpp","measured_fast_code_id":"1ef01d2d70f180ab8cf36b1e0a3eaa4b2281ed94651bbdcb2c9ee9404aed8893","measured_slow_code_id":"2e7706bacc329459222c8e15ea44c17d15bc86183b786af4ea628693ba0382bb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_12957","problem_id":"p04043","slow_code_id":"dbb24647bde68762ec490b5c1b13cfccab654a0fef00ffd7ba88bed00180f217","slow_id":"2e7706bacc329459222c8e15ea44c17d15bc86183b786af4ea628693ba0382bb","slow_time":0.3703996613,"speedup":3.4607002330635184,"stratum":"2-4","sampling_key":"1baec7d811f1e4d3d7eb94fd1f76bae7113dde231d789811b0df240951f1d16f","slow_code":"#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 100005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nbool check[maxii];\n\nbool dfs(int node, int c)\n\n{\n\n  check[node] = true;\n\n  arr2[node] = c;\n\n  for (int child = 0; child < vi[node].size(); child++)\n\n  {\n\n    if (check[vi[node][child]] == false)\n\n    {\n\n      if (dfs(vi[node][child], c ^ 1) == false)\n\n      {\n\n        return false;\n      }\n\n    }\n\n    else if (arr2[node] == arr2[vi[node][child]])\n\n    {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main()\n\n{\n\n  int arrrr[4];\n\n  cin >> arrrr[0] >> arrrr[1] >> arrrr[2];\n\n  sort(arrrr, arrrr + 3);\n\n  if (arrrr[0] == 5 && arrrr[1] == 5 && arrrr[2] == 7)\n\n  {\n\n    printf(\"YES\\n\");\n\n  }\n\n  else\n    printf(\"NO\\n\");\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<long long, long long> pll;\n\n#define ff first\n\n#define ss second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define all(x) (x).begin(), (x).end()\n\n#define FastIO                                                                                     \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0);\n\n#define reset(x) memset(x, -1, sizeof(x))\n\n#define CheckBit(a, b) (a & (1ll << b))\n\n#define SetBit(a, b) a = (a | (1ll << b))\n\n#define UnSetBit(a, b) a = (a & (~(1ll << b)))\n\n#define maxx 10000006\n\n#define PI 2 * acos(0.0)\n\nconst long long INF = 2000000000000000000LL;\n\nconst int inf = 0x3f3f3f3f;\n\nconst long double EPS = 1e-9;\n\ninline ll mulmod(ll a, ll b, ll c) {\n\n  ll ret = 0, cur = a % c;\n\n  while (b) {\n    if (b % 2)\n      ret = (ret + cur) % c;\n    cur = (cur << 1) % c;\n    b = b >> 1;\n  }\n\n  return ret % c;\n}\n\ninline ll bigmod(ll b, ll p, ll m) {\n\n  ll ret = 1, cur = b % m;\n\n  while (p) {\n    if (p & 1)\n      ret = (ret * cur) % m;\n    cur = (cur * cur) % m;\n    p = p >> 1;\n  }\n\n  return ret;\n}\n\ninline ll modulo(ll a, ll b, ll c) {\n\n  ll ret = 1, cur = a % c;\n\n  while (b) {\n    if (b % 2)\n      ret = mulmod(ret, cur, c);\n    cur = mulmod(cur, cur, c);\n    b = b >> 1;\n  }\n\n  return ret % c;\n}\n\ninline ll power(ll b, ll p) {\n\n  ll ret = 1, cur = b;\n\n  while (p) {\n    if (p & 1)\n      ret = (ret * cur);\n    cur = (cur * cur);\n    p = p >> 1;\n  }\n\n  return ret;\n}\n\nll lcm(ll a, ll b)\n\n{\n\n  return (a / __gcd(a, b)) * b;\n}\n\nll gcd(ll a, ll b)\n\n{\n\n  return __gcd(a, b);\n}\n\nvoid Dufaux()\n\n{\n\n  ll a, b, c;\n\n  map<ll, ll> maps;\n\n  cin >> a >> b >> c;\n\n  maps[a]++;\n\n  maps[b]++;\n\n  maps[c]++;\n\n  if (maps[5] == 2 && maps[7] == 1) {\n\n    cout << \"YES\" << endl;\n\n  }\n\n  else\n    cout << \"NO\" << endl;\n}\n\nint main()\n\n{\n\n  FastIO;\n\n  int test = 1;\n\n  while (test--) {\n\n    Dufaux();\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"132304f9d60457cb95de288200ace2e0c6bbab8501fae8cdce8cff66f9b71156","fast_id":"b2a50d8e726016898955255c4b689d8e8627238e5cdc2f988a0a6d4600d25c57","fast_time":0.055408039,"language":"cpp","measured_fast_code_id":"b2a50d8e726016898955255c4b689d8e8627238e5cdc2f988a0a6d4600d25c57","measured_slow_code_id":"40a7de315d7d28479d5952e440640e3f24f39977e768dfa49f9dd53cd9a2bb50","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_13033","problem_id":"p03111","slow_code_id":"7e541296424782c14ca86054afacf7b5744ed184bc88b2d167545a54ae6a92da","slow_id":"40a7de315d7d28479d5952e440640e3f24f39977e768dfa49f9dd53cd9a2bb50","slow_time":0.1143510088,"speedup":2.0637981575200666,"stratum":"2-4","sampling_key":"85a262ea98ead1ab85da6f6c8420381ca2c2beaf8a036f788525aec013d61c10","slow_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <sstream>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <typeinfo>\n\n#include <numeric>\n\n#include <functional>\n\n#include <unordered_map>\n\n#include <bitset>\n\n#include <stack>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\nconst ll INF = 1e16;\n\nconst ll MOD = 1e9 + 7;\n\n#define REP(i, n) for (ll i = 0; i < n; i++)\n\nint main() {\n\n  ll n, a, b, c;\n\n  cin >> n >> a >> b >> c;\n\n  vector<ll> l(n);\n\n  REP(i, n) { cin >> l[i]; }\n\n  ll m = round(pow(2, n * 3));\n\n  ll ans = INF;\n\n  REP(i, m) {\n\n    bool use[3][8] = {}, ok = true, flag[8] = {};\n\n    for (ll j = n * 3 - 1; j >= 0; j--) {\n\n      if (i & (1 << j)) {\n\n        if (flag[j % n]) {\n\n          ok = false;\n\n          break;\n        }\n\n        use[j / n][j % n] = true;\n\n        flag[j % n] = true;\n      }\n    }\n\n    if (!ok)\n      continue;\n\n    REP(j, 3) {\n\n      bool f = false;\n\n      REP(k, n) {\n\n        if (use[j][k])\n          f = true;\n      }\n\n      if (!f)\n        ok = false;\n    }\n\n    if (!ok)\n      continue;\n\n    ll sum = 0;\n\n    REP(j, 3) {\n\n      ll d = 0, cnt = 0;\n\n      REP(k, n) {\n\n        if (use[j][k]) {\n\n          d += l[k];\n\n          cnt++;\n        }\n      }\n\n      sum += 10 * (cnt - 1);\n\n      if (j == 0)\n        sum += abs(a - d);\n\n      else if (j == 1)\n        sum += abs(b - d);\n\n      else\n        sum += abs(c - d);\n    }\n\n    ans = min(ans, sum);\n  }\n\n  cout << ans << endl;\n}\n","fast_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <sstream>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <typeinfo>\n\n#include <numeric>\n\n#include <functional>\n\n#include <unordered_map>\n\n#include <bitset>\n\n#include <stack>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\nconst ll INF = 1e16;\n\nconst ll MOD = 1e9 + 7;\n\n#define REP(i, n) for (ll i = 0; i < n; i++)\n\nint main() {\n\n  ll n, a, b, c;\n\n  cin >> n >> a >> b >> c;\n\n  vector<ll> l(n);\n\n  REP(i, n) { cin >> l[i]; }\n\n  ll m = round(pow(4, n));\n\n  ll ans = INF;\n\n  REP(i, m) {\n\n    ll aa = 0, bb = 0, cc = 0, idx = 0, cnt[4] = {};\n\n    for (ll j = i; j > 0; j /= 4) {\n\n      ll t = j % 4;\n\n      if (t == 1) {\n\n        aa += l[idx];\n\n        cnt[1]++;\n\n      }\n\n      else if (t == 2) {\n\n        bb += l[idx];\n\n        cnt[2]++;\n\n      }\n\n      else if (t == 3) {\n\n        cc += l[idx];\n\n        cnt[3]++;\n      }\n\n      idx++;\n    }\n\n    if (aa == 0 || bb == 0 || cc == 0)\n      continue;\n\n    ll sum = 0;\n\n    sum += 10 * ((cnt[1] - 1) + (cnt[2] - 1) + (cnt[3] - 1));\n\n    sum += abs(aa - a);\n\n    sum += abs(bb - b);\n\n    sum += abs(cc - c);\n\n    ans = min(ans, sum);\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"4ed7c7cdcb29b3194751ad5f4cc10aeb36f8c565035fa01a9ea5f2066c2ccfb4","fast_id":"a8dd7ee64de52d76fd3369ef516970f4a7ec272d8ec11eb6558f87ebf077398a","fast_time":0.1067119499,"language":"cpp","measured_fast_code_id":"a8dd7ee64de52d76fd3369ef516970f4a7ec272d8ec11eb6558f87ebf077398a","measured_slow_code_id":"94ba79969b24be69d3e124165d7c80287a84c6b1b1a590e0b75e0fc6578f395c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_13079","problem_id":"p03435","slow_code_id":"99757d65f15a2963c6bbac8d0d93c2c221dc234a5065601874a88866fe098956","slow_id":"94ba79969b24be69d3e124165d7c80287a84c6b1b1a590e0b75e0fc6578f395c","slow_time":0.2179942616,"speedup":2.0428289596833613,"stratum":"2-4","sampling_key":"90955040b7cbe4bf651b21a3191ab48e459cb2a7227e6379dd548c203b7d0935","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  int c[4][4];\n\n  for (int i = 1; i <= 3; i++)\n    for (int j = 1; j <= 3; j++)\n      cin >> c[i][j];\n\n  int a1, a2, a3;\n\n  int correct = 0;\n\n  for (a1 = 0; a1 <= 100; a1++) {\n\n    for (a2 = 0; a2 <= 100; a2++) {\n\n      for (a3 = 0; a3 <= 100; a3++) {\n\n        int b1_1 = c[1][1] - a1;\n        int b1_2 = c[2][1] - a2;\n        int b1_3 = c[3][1] - a3;\n\n        int b2_1 = c[1][2] - a1;\n        int b2_2 = c[2][2] - a2;\n        int b2_3 = c[3][2] - a3;\n\n        int b3_1 = c[1][3] - a1;\n        int b3_2 = c[2][3] - a2;\n        int b3_3 = c[3][3] - a3;\n\n        if (b1_1 == b1_2 && b1_2 == b1_3 &&\n\n            b2_1 == b2_2 && b2_2 == b2_3 &&\n\n            b3_1 == b3_2 && b3_2 == b3_3)\n          correct = 1;\n      }\n    }\n  }\n\n  if (correct)\n    cout << \"Yes\" << endl;\n\n  else\n    cout << \"No\" << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  int c[4][4];\n\n  for (int i = 1; i <= 3; i++)\n    for (int j = 1; j <= 3; j++)\n      cin >> c[i][j];\n\n  int a[4] = {0, 1}, b[4];\n\n  for (int i = 1; i <= 3; i++)\n    b[i] = c[1][i] - a[1];\n\n  for (int i = 2; i <= 3; i++)\n    a[i] = c[i][1] - b[1];\n\n  int f = 1;\n\n  for (int i = 1; i <= 3; i++) {\n\n    for (int j = 1; j <= 3; j++)\n      if (c[i][j] != a[i] + b[j])\n        f = 0;\n  }\n\n  if (f)\n    cout << \"Yes\" << endl;\n\n  else\n    cout << \"No\" << endl;\n\n  return 0;\n}"}
{"fast_code_id":"e1e44fb9ee0d78bc4f09f659cdaa8f205f4ede658bfa344668809315460417e8","fast_id":"87a11e18e55449d4955a9666800114d6b3f7668811cc9fbd81439ae8e1e4353d","fast_time":0.0448364851,"language":"cpp","measured_fast_code_id":"87a11e18e55449d4955a9666800114d6b3f7668811cc9fbd81439ae8e1e4353d","measured_slow_code_id":"0339da7357bee893ea2adc3ccf3cef9bcd932ab9b97e03b1bab9d6a86f46ee95","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_13235","problem_id":"p00899","slow_code_id":"68d9384e679a161d49b127144a9f2c19e6b04d3c7a5e94708a9f6c098730b34d","slow_id":"0339da7357bee893ea2adc3ccf3cef9bcd932ab9b97e03b1bab9d6a86f46ee95","slow_time":0.1108222667,"speedup":2.4716983602267257,"stratum":"2-4","sampling_key":"2922ba22a13aadb0df7c6a88297b9ef8e24cb0585cdbff418333ebf181380659","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <map>\n\nusing namespace std;\n\nconst int N = 14;\n\nconst int INF = 1e9;\n\nstring str[20], s[20];\n\nint dp[20][1 << 15], ok[20][20];\n\nint n;\n\nint check(int x, int y)\n\n{\n\n  int i, j, r = 0, l1 = s[x].size(), l2 = s[y].size();\n\n  for (i = 0; i < l1; i++)\n\n  {\n\n    for (j = 0; i + j < l1 && j < l2; j++)\n      if (s[x][i + j] != s[y][j])\n        break;\n\n    if (i + j == l1 && r < j)\n      r = j;\n  }\n\n  return r;\n}\n\nbool ck(int x, int y)\n\n{\n\n  int l1 = str[x].size(), l2 = str[y].size();\n\n  int i, j;\n\n  for (i = 0; i < l2; i++)\n\n  {\n\n    for (j = 0; j < l1 && i + j < l2; j++)\n      if (str[x][j] != str[y][i + j])\n        break;\n\n    if (j == l1)\n      return true;\n  }\n\n  return false;\n}\n\nint dfs(int x, int zt)\n\n{\n\n  if (dp[x][zt] != -1)\n    return dp[x][zt];\n\n  dp[x][zt] = INF;\n\n  int i;\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    if ((zt & (1 << i)) && i != x)\n\n    {\n\n      int t = dfs(i, zt - (1 << x)) + s[x].size() - ok[i][x];\n\n      if (dp[x][zt] > t)\n        dp[x][zt] = t;\n    }\n  }\n\n  return dp[x][zt];\n}\n\nint main()\n\n{\n\n  int i, j, k;\n\n  while (~scanf(\"%d\", &n))\n\n  {\n\n    memset(dp, -1, sizeof(dp));\n\n    if (!n)\n      break;\n\n    for (i = 0; i < n; i++)\n      cin >> str[i];\n\n    k = 0;\n\n    for (i = 0; i < n; i++)\n\n    {\n\n      for (j = 0; j < n; j++)\n\n      {\n\n        if (i != j && ck(i, j))\n          break;\n      }\n\n      if (j == n)\n        s[k++] = str[i];\n    }\n\n    n = k;\n\n    for (i = 0; i < n; i++)\n\n    {\n\n      for (j = 0; j < n; j++)\n\n      {\n\n        ok[i][j] = check(i, j);\n      }\n    }\n\n    for (i = 0; i < n; i++)\n      dp[i][1 << i] = s[i].size();\n\n    int L = (1 << n);\n\n    for (i = 0; i < n; i++)\n      dfs(i, L - 1);\n\n    int r = INF;\n\n    for (i = 0; i < n; i++)\n      if (r > dp[i][L - 1])\n        r = dp[i][L - 1];\n\n    printf(\"%d\\n\", r);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <queue>\n\n#include <vector>\n\n#include <map>\n\n#include <cstdlib>\n\n#include <string>\n\n#include <algorithm>\n\n#define mod 998244353;\n\nusing namespace std;\n\nchar c[25][25], s[25][25];\n\nint n, d[25][25];\n\nbool issub(int x)\n\n{\n\n  for (int i = 0; i < n; i++)\n\n    if (i != x && strstr(c[i], c[x]) != NULL)\n      return true;\n\n  return false;\n}\n\nint gdis(char a[], char b[])\n\n{\n\n  int n = strlen(a);\n\n  int m = strlen(b);\n\n  int ed = min(n, m);\n\n  for (int i = ed; i >= 0; i--)\n\n  {\n\n    bool flag = true;\n\n    for (int j = 0; j < i; j++)\n\n    {\n\n      if (a[n - i + j] != b[j])\n\n      {\n\n        flag = false;\n\n        break;\n      }\n    }\n\n    if (flag)\n      return i;\n  }\n\n  return -1;\n}\n\nint len[25];\n\nint dp[14][1 << 14];\n\ninline void Min(int &a, const int &b)\n\n{\n\n  if (a == -1 || b < a)\n\n    a = b;\n}\n\nint main()\n\n{\n\n  while (scanf(\"%d\", &n), n)\n\n  {\n\n    for (int i = 0; i < n; i++)\n\n      scanf(\"%s\", c[i]);\n\n    int m = 0;\n\n    for (int i = 0; i < n; i++)\n\n      if (!issub(i))\n\n      {\n\n        strcpy(s[m], c[i]);\n\n        m++;\n      }\n\n    n = m;\n\n    for (int i = 0; i < n; i++)\n\n      for (int j = 0; j < n; j++)\n\n        if (i != j)\n\n        {\n\n          d[i][j] = gdis(s[i], s[j]);\n        }\n\n    memset(dp, -1, sizeof(dp));\n\n    for (int i = 0; i < n; i++)\n      dp[i][1 << i] = len[i] = strlen(s[i]);\n\n    int ed = (1 << n) - 1;\n\n    for (int j = 1; j < ed; j++)\n\n    {\n\n      for (int i = 0; i < n; i++)\n\n        if (dp[i][j] != -1)\n\n        {\n\n          for (int k = 0; k < n; k++)\n\n            if (!(j >> k & 1))\n\n            {\n\n              Min(dp[k][j | (1 << k)], dp[i][j] + len[k] - d[i][k]);\n            }\n        }\n    }\n\n    int ans = -1;\n\n    for (int i = 0; i < n; i++)\n\n      if (dp[i][ed] != -1)\n\n        Min(ans, dp[i][ed]);\n\n    printf(\"%d\\n\", ans);\n  }\n}"}
{"fast_code_id":"8b8958d4ba68fe25b074d475be5ca1a3ddffd257bb7a0e66f6f5b2fabebe4082","fast_id":"6ef4cea30df42523fdb0391c05f4e0642a2c78a8f9ea166d461627bd9b9174b6","fast_time":0.0196531238,"language":"cpp","measured_fast_code_id":"6ef4cea30df42523fdb0391c05f4e0642a2c78a8f9ea166d461627bd9b9174b6","measured_slow_code_id":"b240b52f0f68daa722604ee02bd50ad092052fda2f282eb9d091ff555e68cbf0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_13328","problem_id":"p03965","slow_code_id":"c36bb20ad453af18ce3b5cb915758c128a8280bbc7910bd5b5936eb5c197ef36","slow_id":"b240b52f0f68daa722604ee02bd50ad092052fda2f282eb9d091ff555e68cbf0","slow_time":0.405557047,"speedup":20.63575496328986,"stratum":"8+","sampling_key":"11bfee49746fd0a268f3a836477b78784d0ae9c01ca877d991171de73742b085","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nchar a[1000010];\n\nint main()\n\n{\n\n  cin >> a;\n\n  int x = 0, y = 0;\n\n  int ans = 0;\n\n  for (int i = 0; i < sizeof(a); i++)\n\n  {\n\n    if (x == y) {\n      x++;\n      if (a[i] == 'p')\n        ans--;\n    }\n\n    else {\n      y++;\n      if (a[i] == 'g') {\n        ans++;\n      }\n    }\n  }\n\n  cout << ans;\n}","fast_code":"#include <cstdio>\n\n#define sacnf scanf\n\n#define pritnf printf\n\n#define srnad srand\n\n#define rnad rand\n\n#define sl(sl_a) strlen(sl_a)\n\n#define gt(gt_a) goto gt_a\n\n#define mst(mst_a, mst_b) memset(mst_a, mst_b, sizeof(mst_a))\n\n#define fora(fora_x, fora_a, fora_b)                                                               \\\n  for (re nti(fora_x) = (fora_a); (fora_x) <= (fora_b); ++(fora_x))\n\n#define forb(forb_x, forb_a, forb_b)                                                               \\\n  for (re nit(forb_x) = (forb_a); (forb_x) >= (forb_b); --(forb_x))\n\n#define foral(foral_x, foral_a, foral_b)                                                           \\\n  for (re ll(foral_x) = (foral_a); (foral_x) <= (foral_b); ++(foral_x))\n\n#define forbl(forbl_x, forbl_a, forbl_b)                                                           \\\n  for (re ll(forbl_x) = (forbl_a); (forbl_x) >= (forbl_b); --(forbl_x))\n\n#define re register\n\n#define inl inline\n\n#define br break\n\n#define con continue\n\n#define stt struct\n\n#define nms namespace\n\n#define gc getchar\n\n#define rt return\n\n#define infa (0x3f3f3f3f)\n\n#define infb (0x7fffffff)\n\n#define infd (0x7f)\n\n#define in(in_a)                                                                                   \\\n  freopen(\"F:/\"                                                                                    \\\n          \"/in\" in_a \".in\",                                                                        \\\n          \"r\", stdin)\n\n#define out(out_a)                                                                                 \\\n  freopen(\"F:/\"                                                                                    \\\n          \"/out\" out_a \".out\",                                                                     \\\n          \"w\", stdout)\n\n#define fin(filein_a) freopen(filein_a \".in\", \"r\", stdin)\n\n#define fout(fileout_a) freopen(fileout_a \".out\", \"w\", stdout)\n\ntypedef long long ll;\n\ntypedef int itn, nti, tin, tni, nit;\n\nusing namespace std;\n\nconst nit maxa = 100004;\n\nconst nit maxb = 54;\n\nconst nit maxc = 4;\n\nconst tni maxd = 24;\n\n#include <cstring>\n\ntni s, clo = 0, ans = 0;\n\nchar x[maxa];\n\ntni main()\n\n{\n\n  scanf(\"%s\", x + 1);\n\n  s = sl(x + 1);\n\n  fora(i, 1, s)\n\n  {\n\n    if (clo)\n\n    {\n\n      --clo;\n\n      if (x[i] == 'g')\n\n      {\n\n        ++ans;\n      }\n\n    }\n\n    else\n\n    {\n\n      ++clo;\n\n      if (x[i] == 'p')\n\n      {\n\n        --ans;\n      }\n    }\n  }\n\n  pritnf(\"%d\\n\", ans);\n\n  rt 0;\n}"}
{"fast_code_id":"9fa060536e3eb513059ebeff58d1e9d8e5817abaecee8c43cebbbe9df510a557","fast_id":"015bb4f64eb254ebd707456cc8104b211a7ff577b28cf4404d196c2e566fb787","fast_time":0.0144696503,"language":"cpp","measured_fast_code_id":"015bb4f64eb254ebd707456cc8104b211a7ff577b28cf4404d196c2e566fb787","measured_slow_code_id":"f728cbb137086f045c4f5c9f4892b320a4e036fa5a963e0c58dae5d575d4f8dc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_13489","problem_id":"p03568","slow_code_id":"0d72e0356c5c2795b1dfff4f6e2c1f139d8b81dab7256b08a97675660fafd80e","slow_id":"f728cbb137086f045c4f5c9f4892b320a4e036fa5a963e0c58dae5d575d4f8dc","slow_time":0.0703135971,"speedup":4.859384687410172,"stratum":"4-8","sampling_key":"04652da8394c1c4d3685ac567587e4d6ae7e3833ae1fb18aec97790a935cbea5","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <cmath>\n\nusing namespace std;\n\nint n, a[100];\n\nint main() {\n\n  cin >> n;\n\n  int odd = 0, even = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n\n    if (a[i] % 2 == 0)\n      even++;\n\n    else\n      odd++;\n  }\n\n  int ans = pow(3, n);\n\n  ans -= pow(2, even);\n\n  cout << ans << endl;\n}","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <math.h>\n\nint main()\n\n{\n\n  int n, m;\n\n  int ans;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%d\", &m);\n\n    if (m % 2 == 0)\n\n    {\n\n      ans++;\n    }\n  }\n\n  printf(\"%d\", int(pow(3, n) - pow(2, ans)));\n\n  return 0;\n}\n"}
{"fast_code_id":"5e88cdf028f1804b5f2f34aa46be227ea54c99e65cb1d2700e6e240146098dd2","fast_id":"14c976e624bdcc2737a48e358f8a16d3bfc784c8b86da8847896a0fca5f7c7dc","fast_time":0.0293374753,"language":"cpp","measured_fast_code_id":"14c976e624bdcc2737a48e358f8a16d3bfc784c8b86da8847896a0fca5f7c7dc","measured_slow_code_id":"1a9c494459b6faa094dab50e4c95ac477d43c2614ff85ff87d90d475a08c6d73","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_13565","problem_id":"p03861","slow_code_id":"b2091ef572f2521c4924b264db9db2c1182ec35033e76f2318a20b1845ed22f9","slow_id":"1a9c494459b6faa094dab50e4c95ac477d43c2614ff85ff87d90d475a08c6d73","slow_time":0.1916329609,"speedup":6.5320195054412205,"stratum":"4-8","sampling_key":"f13e8660a24eb7792e66db5fd33ee91bdffeb29b80282fde677634119914320e","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 200005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nint main()\n\n{\n\n  lln a, b, x;\n\n  cin >> a >> b >> x;\n\n  lln res1 = a / x;\n\n  lln res2 = b / x;\n\n  lln res = res2 - res1;\n\n  if (a % x == 0)\n    res++;\n\n  cout << res;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nmain()\n\n{\n\n  unsigned long long int a, b, x, result;\n\n  cin >> a >> b >> x;\n\n  if (a % x != 0)\n\n  {\n\n    result = (b / x - a / x);\n\n  }\n\n  else\n\n  {\n\n    result = (b / x - a / x) + 1;\n  }\n\n  cout << result;\n}"}
{"fast_code_id":"0fb77c1805dcc304e42804467f39c4d1d6cf333a7e1e69c6fa625267526716fb","fast_id":"c0e72befa79305d6330f14956f0a28285d24011fa896215a89c183ce237de35b","fast_time":0.0201228433,"language":"cpp","measured_fast_code_id":"c0e72befa79305d6330f14956f0a28285d24011fa896215a89c183ce237de35b","measured_slow_code_id":"3fadd7de55a8e1d42b95c6492823259c80c01f67e5ab0f3502659a6ecf0631f4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_13867","problem_id":"p03637","slow_code_id":"7fdebae06bc52366b32e463ec4b938b8a4eb0f5309bcaf65e09f2cab8c733597","slow_id":"3fadd7de55a8e1d42b95c6492823259c80c01f67e5ab0f3502659a6ecf0631f4","slow_time":0.151214591,"speedup":7.514573797829058,"stratum":"4-8","sampling_key":"1d5fcca073e56822a1ae1cfae9ca70c64a4551d57f85874918ada4a352693751","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  int N;\n\n  int num[100000] = {0};\n\n  cin >> N;\n\n  int jishu = 0, oushu = 0, numfour = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    cin >> num[i];\n\n    if (num[i] % 4 == 0) {\n\n      numfour++;\n\n    } else if (num[i] % 2 == 0) {\n\n      oushu++;\n\n    } else {\n\n      jishu++;\n    }\n  }\n\n  if (oushu) {\n\n    jishu++;\n  }\n\n  if (jishu - 1 > numfour) {\n\n    cout << \"No\" << endl;\n\n  } else {\n\n    cout << \"Yes\" << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nconst int maxn = 100005;\n\nint main() {\n\n  int a = 0, b = 0, c = 0, n, x;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d\", &x);\n\n    if (x % 4 == 0) {\n\n      c++;\n\n    } else if (x % 2 == 0) {\n\n      b++;\n\n    } else {\n\n      a++;\n    }\n  }\n\n  if (b == 0) {\n\n    if (a - 1 > c) {\n\n      printf(\"No\\n\");\n\n    } else {\n\n      printf(\"Yes\\n\");\n    }\n\n  } else {\n\n    if (a > c) {\n\n      printf(\"No\\n\");\n\n    } else {\n\n      printf(\"Yes\\n\");\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"8d00313c20efe4fd048637aa9972e1324fb12e912a7c9dea5407fe049fd3e683","fast_id":"80292233f11ca68390e39b007dc7706968f680c74feb7c9cbc75e33c77f7dd97","fast_time":0.0001915757,"language":"cpp","measured_fast_code_id":"80292233f11ca68390e39b007dc7706968f680c74feb7c9cbc75e33c77f7dd97","measured_slow_code_id":"be432cbe4adfe65f54a838d111337190ddb6914c7cb8cef9a0ce4f2f6fa6daa7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_13903","problem_id":"p03246","slow_code_id":"7e951ca54315f3b83f333c979cde8e7267b88a8dfed3485a10db7747dd079df4","slow_id":"be432cbe4adfe65f54a838d111337190ddb6914c7cb8cef9a0ce4f2f6fa6daa7","slow_time":0.0021378789,"speedup":11.159447153266306,"stratum":"8+","sampling_key":"052739b484500b71d0845a039db53967e3d5aa9dd6b14e36c7f5a521ae5023ca","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n  cout.tie(0);\n\n  int n;\n  cin >> n;\n\n  vector<int> v(n);\n\n  for (int i = 0; i < n; i++)\n    cin >> v[i];\n\n  vector<int> cnt(110000, 0);\n\n  for (int i = 0; i < n; i += 2) {\n\n    cnt[v[i]]++;\n  }\n\n  int i1 = max_element(cnt.begin(), cnt.end()) - cnt.begin(), i2 = 0;\n\n  for (int i = 0; i < cnt.size(); i++) {\n\n    if (i != i1) {\n\n      if (cnt[i2] < cnt[i])\n        i2 = i;\n    }\n  }\n\n  int ci1 = cnt[i1], ci2 = cnt[i2];\n\n  for (auto &val : cnt)\n    val = 0;\n\n  for (int i = 1; i < n; i += 2) {\n\n    cnt[v[i]]++;\n  }\n\n  int j1 = max_element(cnt.begin(), cnt.end()) - cnt.begin(), j2 = 0;\n\n  for (int i = 0; i < cnt.size(); i++) {\n\n    if (i != j1) {\n\n      if (cnt[j2] < cnt[i])\n        j2 = i;\n    }\n  }\n\n  int cj1 = cnt[j1], cj2 = cnt[j2];\n\n  int ans;\n\n  if (i1 == j1) {\n\n    ans = n - ci1 - max(ci2, cj2);\n\n  } else {\n\n    ans = n - ci1 - cj1;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#define maxn 100010\n\nint cnt[2][maxn], M[2], Q[2], m[2], q[2];\n\nint n;\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1, x, p; i <= n; i++) {\n\n    scanf(\"%d\", &x);\n    p = i % 2;\n\n    cnt[p][x]++;\n\n    if (M[p] < cnt[p][x])\n      M[p] = cnt[p][x], Q[p] = x;\n  }\n\n  if (Q[0] != Q[1]) {\n\n    printf(\"%d\\n\", n - M[0] - M[1]);\n\n    return 0;\n  }\n\n  for (int i = 1; i <= 100000; i++) {\n\n    if (m[0] < cnt[0][i] && i != Q[0])\n      m[0] = cnt[0][i], q[0] = i;\n\n    if (m[1] < cnt[1][i] && i != Q[1])\n      m[1] = cnt[1][i], q[1] = i;\n  }\n\n  if (M[0] - m[0] > M[1] - m[1])\n    printf(\"%d\\n\", n - M[0] - m[1]);\n\n  else\n    printf(\"%d\\n\", n - m[0] - M[1]);\n\n  return 0;\n}"}
{"fast_code_id":"9da13a76107969a76de881f365b99a509cd6a74659f3de75989037f2d1c23ba7","fast_id":"842654c789c91e2a389b2a131cd009e2708082ca39c7df7bb51535a923d14e7b","fast_time":0.0268655487,"language":"cpp","measured_fast_code_id":"842654c789c91e2a389b2a131cd009e2708082ca39c7df7bb51535a923d14e7b","measured_slow_code_id":"7423951117dc1a32d1797d562ada248154a567cfdccd73c54803797c42480058","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_13988","problem_id":"p02844","slow_code_id":"213442857fa2e3ab42c9bf4f834172410be776732870b742d02fdf2f7edd483d","slow_id":"7423951117dc1a32d1797d562ada248154a567cfdccd73c54803797c42480058","slow_time":0.1141864572,"speedup":4.250293134716434,"stratum":"4-8","sampling_key":"ae29136b7c89e262dae507e4cf1ae79d05243c60307df930384359744932ae21","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <iomanip>\n\n#include <math.h>\n\n#include <complex>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <bitset>\n\n#include <functional>\n\n#include <assert.h>\n\n#include <numeric>\n\nusing namespace std;\n\n#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)\n\n#define rep(i, n) REP(i, 0, n)\n\nusing ll = long long;\n\nconst int inf = 1e9 + 7;\n\nconst ll longinf = 1LL << 60;\n\nconst ll mod = 1e9 + 7;\n\nint main() {\n\n  int n;\n  cin >> n;\n\n  string s;\n\n  cin >> s;\n\n  int ans = 0;\n\n  rep(i, 10) rep(j, 10) rep(k, 10) {\n\n    vector<char> v = {char('0' + i), char('0' + j), char('0' + k), '-'};\n\n    int c = 0;\n\n    rep(l, n) {\n\n      if (s[l] == v[c])\n        c++;\n    }\n\n    ans += c == 3;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int n;\n\n  char str[50010];\n\n  int x = 0;\n\n  int ctr = 0;\n\n  scanf(\"%d\", &n);\n\n  scanf(\"%s\", str);\n\n  for (int i = 0; i < 10; i++) {\n\n    for (int j = 0; j < 10; j++) {\n\n      for (int k = 0; k < 10; k++) {\n\n        char test[] = {i, j, k};\n\n        x = 0;\n\n        for (int a = 0; a < n; a++) {\n\n          if (str[a] - '0' == test[x]) {\n\n            x++;\n          }\n\n          if (x == 3) {\n\n            ctr++;\n\n            break;\n          }\n        }\n      }\n    }\n  }\n\n  printf(\"%d\", ctr);\n\n  return 0;\n}"}
{"fast_code_id":"f60324083b3000dbebbfaece221766bde8805f6995591426d5ae8f8bdbaeab81","fast_id":"56a425b603142509cc153edd1f281182e452baa45e899a60ecf6e5fad97022a4","fast_time":0.0587241741,"language":"cpp","measured_fast_code_id":"56a425b603142509cc153edd1f281182e452baa45e899a60ecf6e5fad97022a4","measured_slow_code_id":"ed40cc46ac3e02de55d05c39bca92df0fa29b854a71c2c5319615d3df0f4cfe0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14013","problem_id":"p02768","slow_code_id":"c227dabec9919c890f413006aefda8612de79565decbb2e768c96c78ff6a7c21","slow_id":"ed40cc46ac3e02de55d05c39bca92df0fa29b854a71c2c5319615d3df0f4cfe0","slow_time":0.1652358213,"speedup":2.813761518699673,"stratum":"2-4","sampling_key":"6d6e64ca747cb0a1588c8bbe5badda7d35ab90a4938822edfc5b1421b866895b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int maxx = 2e5 + 7;\n\nconst int Mod = 1e9 + 7;\n\ntypedef long long ll;\n\nll n;\n\nint a, b;\n\nll fac[maxx], inv[maxx];\n\nll qwe(ll x, int y) {\n\n  ll res = 1ll;\n\n  while (y) {\n\n    if (y & 1)\n      res = res * x % Mod;\n\n    x = x * x % Mod;\n\n    y >>= 1;\n  }\n\n  return res;\n}\n\nll Com(ll n, ll m) {\n\n  ll res = 1ll;\n\n  for (ll i = n; i >= n - m + 1; i--)\n    res = res * i % Mod;\n\n  return res * inv[m] % Mod;\n}\n\nint main() {\n\n  fac[0] = inv[0] = 1;\n\n  for (int i = 1; i <= maxx; i++)\n    fac[i] = fac[i - 1] * i % Mod;\n\n  inv[maxx] = qwe(fac[maxx], Mod - 2);\n\n  for (int i = maxx - 1; i >= 1; i--)\n    inv[i] = inv[i + 1] * (i + 1) % Mod;\n\n  scanf(\"%lld %d %d\", &n, &a, &b);\n\n  ll ans = qwe(2, n) - 1;\n\n  ans = (ans - Com(n, a) + Mod) % Mod;\n\n  ans = (ans - Com(n, b) + Mod) % Mod;\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst LL Mod = 1e9 + 7;\n\nLL n, a, b, ans;\n\nLL qwe(LL a, LL n) {\n\n  LL res = 1LL;\n\n  while (n) {\n\n    if (n & 1)\n      res = res * a % Mod;\n\n    a = a * a % Mod;\n\n    n >>= 1LL;\n  }\n\n  return res % Mod;\n}\n\nLL C(LL n, LL m) {\n\n  if (m < n - m)\n    m = n - m;\n\n  LL x = 1LL;\n\n  for (LL i = m + 1; i <= n; i++)\n    x = x * i % Mod;\n\n  LL y = 1LL;\n\n  for (LL i = 1; i <= n - m; i++)\n    y = y * i % Mod;\n\n  return x * qwe(y, Mod - 2) % Mod;\n}\n\nint main() {\n\n  cin >> n >> a >> b;\n\n  ans = ((qwe(2LL, n) - C(n, a) - C(n, b) - 1) % Mod + Mod) % Mod;\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"5160a013c6dcba5b26fd594253feadc21085f63655665b14c36ed765a84ca27d","fast_id":"1e87d8d2af6e67e3c7554eb963c0a97c4e5b7938c89c89c6e01f71fbbf8e9f45","fast_time":0.0098550117,"language":"cpp","measured_fast_code_id":"1e87d8d2af6e67e3c7554eb963c0a97c4e5b7938c89c89c6e01f71fbbf8e9f45","measured_slow_code_id":"757a8318d9061049bd8d8c35fe0f150307ae31c7fef1f91b7f8cd95a83b64743","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14021","problem_id":"p03334","slow_code_id":"2be6ec508a1638b68e5eb511031eb7b60bcfed484e8ee900abbc8002501bd9e1","slow_id":"757a8318d9061049bd8d8c35fe0f150307ae31c7fef1f91b7f8cd95a83b64743","slow_time":0.1262561969,"speedup":12.811369559307577,"stratum":"8+","sampling_key":"2fd51b49ac025f511db2baecf305f6d86397dbbe2d22e95ef89c29dbf43d340f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, d1, d2;\n\nint col[603][603], col1[605][605], col2[605][605];\n\nint dx[4803], dy[4803], cnt;\n\nvector<pair<int, int> > typ[2][2];\n\nvoid Col(int x, int y, int tar)\n\n{\n\n  col[x][y] = tar;\n\n  for (int i = 1; i <= cnt; ++i)\n\n  {\n\n    int nx = x + dx[i], ny = y + dy[i];\n\n    if (nx >= 1 && nx <= n && ny >= 1 && ny <= n && !col[nx][ny])\n\n      Col(nx, ny, tar ^ 1);\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d%d\", &n, &d1, &d2);\n\n  n *= 2;\n\n  for (int i = 0; i <= n; ++i)\n\n    for (int j = i; j <= n; ++j)\n\n      if (i * i + j * j == d1)\n\n      {\n\n        dx[++cnt] = i;\n        dy[cnt] = j;\n\n        dx[++cnt] = j;\n        dy[cnt] = i;\n\n        dx[++cnt] = -i;\n        dy[cnt] = -j;\n\n        dx[++cnt] = -j;\n        dy[cnt] = -i;\n\n        dx[++cnt] = i;\n        dy[cnt] = -j;\n\n        dx[++cnt] = j;\n        dy[cnt] = -i;\n\n        dx[++cnt] = -i;\n        dy[cnt] = j;\n\n        dx[++cnt] = -j;\n        dy[cnt] = i;\n      }\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 1; j <= n; ++j)\n\n    {\n\n      if (!col[i][j])\n\n        Col(i, j, 2);\n\n      col1[i][j] = col[i][j] - 2;\n    }\n\n  cnt = 0;\n\n  for (int i = 0; i <= n; ++i)\n\n    for (int j = i; j <= n; ++j)\n\n      if (i * i + j * j == d2)\n\n      {\n\n        dx[++cnt] = i;\n        dy[cnt] = j;\n\n        dx[++cnt] = j;\n        dy[cnt] = i;\n\n        dx[++cnt] = -i;\n        dy[cnt] = -j;\n\n        dx[++cnt] = -j;\n        dy[cnt] = -i;\n\n        dx[++cnt] = i;\n        dy[cnt] = -j;\n\n        dx[++cnt] = j;\n        dy[cnt] = -i;\n\n        dx[++cnt] = -i;\n        dy[cnt] = j;\n\n        dx[++cnt] = -j;\n        dy[cnt] = i;\n      }\n\n  memset(col, 0, sizeof(col));\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 1; j <= n; ++j)\n\n    {\n\n      if (!col[i][j])\n\n        Col(i, j, 2);\n\n      col2[i][j] = col[i][j] - 2;\n\n      typ[col1[i][j]][col2[i][j]].push_back(make_pair(i, j));\n    }\n\n  for (int i = 0; i < 2; ++i)\n\n    for (int j = 0; j < 2; ++j)\n\n      if (typ[i][j].size() >= n * n / 4)\n\n      {\n\n        for (int k = 0; k < n * n / 4; ++k)\n\n          printf(\"%d %d\\n\", typ[i][j][k].first - 1, typ[i][j][k].second - 1);\n\n        return 0;\n      }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nint n, m, d1, d2, cnt, vis[605][605];\n\nvoid solve(int d) {\n\n  int tim = 0;\n  while (d % 4 == 0)\n    d /= 4, ++tim;\n\n  if (d & 1) {\n\n    for (int i = 0; i < m; ++i)\n      for (int j = 0; j < m; ++j) {\n\n        if (((i >> tim) + (j >> tim)) & 1)\n          vis[i][j] = 1;\n      }\n\n  }\n\n  else {\n\n    for (int i = 0; i < m; ++i)\n      for (int j = 0; j < m; ++j) {\n\n        if ((i >> tim) & 1)\n          vis[i][j] = 1;\n      }\n  }\n}\n\nint main() {\n\n  scanf(\"%d%d%d\", &n, &d1, &d2);\n  m = n << 1;\n  solve(d1);\n  solve(d2);\n\n  for (int i = 0; i < m; ++i)\n    for (int j = 0; j < m; ++j) {\n\n      if (!vis[i][j])\n        printf(\"%d %d\\n\", i, j), ++cnt;\n\n      if (cnt == n * n)\n        return 0;\n    }\n}"}
{"fast_code_id":"a3b038eeed380ebcbaea18c1c7fed153b1dbccc19fbc2301b08eadd98eaedcf7","fast_id":"653030cf7bb644ba86f0356b10393f8f8d2a0df8364b4b05ca15e1a843d4e1d9","fast_time":0.0105530351,"language":"cpp","measured_fast_code_id":"653030cf7bb644ba86f0356b10393f8f8d2a0df8364b4b05ca15e1a843d4e1d9","measured_slow_code_id":"c7180f6301bf30f01915f763e3cea9980f51e6845a966abdbe2c9c995d467213","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14024","problem_id":"p02249","slow_code_id":"e84a022eb1f954728e17fde764a2536529113b8c07e00acfbd27157173be7615","slow_id":"c7180f6301bf30f01915f763e3cea9980f51e6845a966abdbe2c9c995d467213","slow_time":0.058987798,"speedup":5.589652402463818,"stratum":"4-8","sampling_key":"e3bf39460d68e99f49a4c76bb7b919846febbff28506a7a868ce099a8c03eff8","slow_code":"#include <string>\n\n#include <iostream>\n\n#pragma warning(disable : 4996)\n\nusing namespace std;\n\nint H, W, R, C;\nstring s[1000], t[1000];\nunsigned long long power[1001], h1[1000][1000], h2[1000];\n\nint main() {\n\n  scanf(\"%d%d\", &H, &W);\n\n  for (int i = 0; i < H; i++)\n    cin >> s[i];\n\n  scanf(\"%d%d\", &R, &C);\n\n  for (int i = 0; i < R; i++)\n    cin >> t[i];\n\n  power[0] = 1;\n\n  for (int i = 1; i <= 1000; i++)\n    power[i] = power[i - 1] * 257;\n\n  for (int i = 0; i < H; i++) {\n\n    unsigned long long val = 0;\n\n    for (int j = 0; j < C; j++)\n      val = val * 257 + s[i][j];\n    h1[i][0] = val;\n\n    for (int j = C; j < W; j++)\n      val = val * 257 + s[i][j] - power[C] * s[i][j - C], h1[i][j - C + 1] = val;\n  }\n\n  for (int i = 0; i < R; i++) {\n\n    for (int j = 0; j < C; j++)\n      h2[i] = h2[i] * 257 + t[i][j];\n  }\n\n  for (int i = 0; i <= H - R; i++) {\n\n    for (int j = 0; j <= W - C; j++) {\n\n      bool flag = true;\n\n      for (int k = i; k < i + R; k++) {\n\n        if (h1[k][j] != h2[k - i]) {\n\n          flag = false;\n          break;\n        }\n      }\n\n      if (flag) {\n\n        printf(\"%d %d\\n\", i, j);\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint H, W, R, C;\nchar s[1001][1007], t[1001][1007];\n\nunsigned long long pw1, pw2, h1[1001][1007], h2[1001][1007], h3[1001];\n\nint main() {\n\n  scanf(\"%d%d\", &H, &W);\n\n  for (int i = 0; i < H; i++)\n    scanf(\"%s\", s[i]);\n\n  scanf(\"%d%d\", &R, &C);\n  pw1 = 1, pw2 = 1;\n\n  for (int i = 0; i < R; i++)\n    scanf(\"%s\", t[i]), pw2 *= 1000000007;\n\n  for (int i = 0; i < C; i++)\n    pw1 *= 257;\n\n  for (int i = 0; i < H; i++) {\n\n    unsigned long long w = 0;\n\n    for (int j = 0; j < C; j++)\n      w = w * 257 + s[i][j];\n    h1[i][0] = w;\n\n    for (int j = C; j < W; j++)\n      w = w * 257 + s[i][j] - pw1 * s[i][j - C], h1[i][j - C + 1] = w;\n  }\n\n  for (int i = 0; i <= W - C; i++) {\n\n    unsigned long long w = 0;\n\n    for (int j = 0; j < R; j++)\n      w = w * 1000000007 + h1[j][i];\n    h2[0][i] = w;\n\n    for (int j = R; j < H; j++)\n      w = w * 1000000007 + h1[j][i] - pw2 * h1[j - R][i], h2[j - R + 1][i] = w;\n  }\n\n  for (int i = 0; i < R; i++) {\n\n    for (int j = 0; j < C; j++)\n      h3[i] = h3[i] * 257 + t[i][j];\n  }\n\n  unsigned long long h4 = 0;\n\n  for (int i = 0; i < R; i++)\n    h4 = h4 * 1000000007 + h3[i];\n\n  for (int i = 0; i <= H - R; i++) {\n\n    for (int j = 0; j <= W - C; j++) {\n\n      if (h2[i][j] == h4)\n        printf(\"%d %d\\n\", i, j);\n    }\n  }\n}"}
{"fast_code_id":"0d37e3790747ccfb1033e2d249f4a5be4c82a392deae3deb03e5a50fc02b4ab2","fast_id":"8340917856feb1c50c980e2f7e84d56a7aae015feb01dd150c7e20077342eebf","fast_time":0.0001911544,"language":"cpp","measured_fast_code_id":"8340917856feb1c50c980e2f7e84d56a7aae015feb01dd150c7e20077342eebf","measured_slow_code_id":"7ebfd57deb06b4a3e8ffc2c9173f2edf759a94b284e271f539cbe106c06d6e07","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14142","problem_id":"p03487","slow_code_id":"9b29372b6e159663bd8f1b8a536fec418b3762a8082bc7585f27725a4ac93b1f","slow_id":"7ebfd57deb06b4a3e8ffc2c9173f2edf759a94b284e271f539cbe106c06d6e07","slow_time":0.0014875226,"speedup":7.781785823397212,"stratum":"4-8","sampling_key":"427ecadbd49f7d72ba630faebb6d227abebc3ee7a98145642f34ea7b1de22cdb","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint n, a[100010], b, ans;\n\nint main()\n\n{\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> b;\n\n    if (b > 100000)\n\n      ans++;\n\n    else\n      a[b]++;\n  }\n\n  for (int i = 0; i < 100001; i++)\n\n  {\n\n    if (a[i] >= i)\n\n      ans += a[i] - i;\n\n    else\n      ans += a[i];\n  }\n\n  cout << ans;\n}","fast_code":"#include <cstdio>\n\n#define tin int\n\n#define itn int\n\n#define tni int\n\n#define nit int\n\n#define nti int\n\n#define pritnf printf\n\n#define scnaf scanf\n\n#define retrun return\n\n#define sizoef sizeof\n\n#define ll long long\n\n#define inl inline\n\n#define br break\n\n#define con continue\n\n#define mst(a, b) memset(a, b, sizeof(a))\n\n#define re register itn\n\n#define fora(x, a, b) for (re x = a; x <= b; ++x)\n\n#define forb(x, a, b) for (re x = a; x >= b; --a)\n\n#define infa 0x3f3f3f3f\n\n#define infb 0x7fffffff\n\n#define infc 1061109567\n\n#define infd 0x7f\n\nusing namespace std;\n\n#define maxa 100004\n\n#define maxb 10004\n\n#include <cstring>\n\ntni num, x, n[maxa] = {0}, sum = 0;\n\ntin main()\n\n{\n\n  scanf(\"%d\", &num);\n\n  fora(i, 1, num)\n\n  {\n\n    scanf(\"%d\", &x);\n\n    if (x > num)\n\n    {\n\n      ++sum;\n\n    }\n\n    else\n\n    {\n\n      ++n[x];\n    }\n  }\n\n  fora(i, 1, num)\n\n  {\n\n    if (n[i] < i)\n\n    {\n\n      sum += n[i];\n\n    }\n\n    else if (n[i] > i)\n\n    {\n\n      sum += n[i] - i;\n    }\n  }\n\n  printf(\"%d\\n\", sum);\n\n  return 0;\n}"}
{"fast_code_id":"2819cdaf86fb830473d901f6354fa338d9b40ed2fb373431468275105e8d82fa","fast_id":"7e0143370b0959392c8076d99c5eed93b05c3297d683959f64772798833b2992","fast_time":0.0604680042,"language":"cpp","measured_fast_code_id":"7e0143370b0959392c8076d99c5eed93b05c3297d683959f64772798833b2992","measured_slow_code_id":"66a1c741e7798b81c1564c34cea0a66d6a4c50b0154933b730243e67b842b288","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14239","problem_id":"p03893","slow_code_id":"81a90e24fd8dafbf8989d2ed7cc867e690c55a6f73f634f99f5fd142f4dc9a20","slow_id":"66a1c741e7798b81c1564c34cea0a66d6a4c50b0154933b730243e67b842b288","slow_time":0.1888342307,"speedup":3.122878507374318,"stratum":"2-4","sampling_key":"0b5de3e8fd9242cca9ecfd788246dae893f07da356e248f0890c34607350ff42","slow_code":"#include <bits/stdc++.h>\n\n#define pb push_back\n\nusing namespace std;\n\nvoid debug_out() { cerr << '\\n'; }\n\ntemplate <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {\n  cerr << \" \" << H;\n  debug_out(T...);\n}\n\n#define dbg(...) cerr << #__VA_ARGS__ << \" ->\", debug_out(__VA_ARGS__)\n\n#define dbg_v(x, n)                                                                                \\\n  do {                                                                                             \\\n    cerr << #x \"[]: \";                                                                             \\\n    for (int _ = 0; _ < n; ++_)                                                                    \\\n      cerr << x[_] << \" \";                                                                         \\\n    cerr << '\\n';                                                                                  \\\n  } while (0)\n\n#define dbg_ok cerr << \"OK!\\n\"\n\ntypedef pair<int, int> pii;\n\ntypedef unsigned long long int ll;\n\ntypedef long double ld;\n\nconst int DMAX = 1e5 + 10;\n\nvector<int> vec;\n\nvector<int> arb[DMAX];\n\nint V[DMAX];\n\nll n;\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int t, i, j;\n\n  cin >> n;\n\n  n += 2;\n\n  n = (1LL << n) - 2;\n\n  cout << n << '\\n';\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\nusing namespace std;\n\nmap<ll, ll> nb;\n\nll f(ll x) {\n\n  if (x <= 2)\n    return 0;\n\n  if (nb[x] != 0) {\n\n    return nb[x];\n  }\n\n  int aux;\n\n  if (x % 2 == 1) {\n\n    aux = f((x - 1) / 2);\n\n  }\n\n  else {\n\n    aux = f((x - 2) / 2);\n  }\n\n  nb[x] = 1 + aux;\n\n  return nb[x];\n}\n\nvoid cautare(ll stanga, ll dreapta, ll nb, ll &maxim) {\n\n  if (stanga > dreapta)\n\n    return;\n\n  ll m = (stanga + dreapta) / 2;\n\n  ll miscari = f(m);\n\n  if (miscari == nb) {\n\n    maxim = m;\n\n    cautare(m + 1, dreapta, nb, maxim);\n\n    return;\n  }\n\n  if (miscari > nb) {\n\n    cautare(stanga, m - 1, nb, maxim);\n\n  }\n\n  else {\n\n    cautare(m + 1, dreapta, nb, maxim);\n  }\n}\n\nint main()\n\n{\n\n  ll x;\n\n  cin >> x;\n\n  ll maxim;\n\n  cautare(2, LONG_MAX, x, maxim);\n\n  cout << maxim << \"\\n\";\n}"}
{"fast_code_id":"3c18bf9e7dba9575664c25429d0ec32c449a498f42503b9435e8a8eceac15fd3","fast_id":"a274a527247ca234737cd17e866d75cf63174d46a5f59247a2db83fb8d5fed88","fast_time":0.0036301794,"language":"cpp","measured_fast_code_id":"a274a527247ca234737cd17e866d75cf63174d46a5f59247a2db83fb8d5fed88","measured_slow_code_id":"29e9134996cafa415a94356ef3f292361c319d6943485d1b11538a6190884d6b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14273","problem_id":"p00498","slow_code_id":"a0b97ad76b48d827af6a34697fdcb4d0e54031cf5ff7e92ed1eae772f74d48af","slow_id":"29e9134996cafa415a94356ef3f292361c319d6943485d1b11538a6190884d6b","slow_time":0.0114248998,"speedup":3.1471997775096185,"stratum":"2-4","sampling_key":"17d4edc983e1f583beb4e9332d028833483a41f9a411d19c50684fa126042453","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct edge {\n\n  int to, cost;\n};\n\nstruct edge2 {\n\n  int u, v, cost;\n\n  bool operator<(const edge2 &e) const { return (cost < e.cost); }\n};\n\ntypedef pair<int, int> Pi;\n\nconst int INF = 1 << 30;\n\nstruct UnionFind {\n\n  vector<int> data;\n\n  UnionFind(int sz) { data.assign(sz, -1); }\n\n  inline void Unite(int a, int b) {\n\n    if ((a = Root(a)) == (b = Root(b)))\n      return;\n\n    if (data[a] < data[b])\n      swap(a, b);\n\n    data[b] += data[a];\n\n    data[a] = b;\n  }\n\n  inline int Root(int x) { return (data[x] < 0 ? x : data[x] = Root(data[x])); }\n};\n\nstruct SegmentTree {\n\n  vector<int> data;\n\n  int sz;\n\n  SegmentTree(int n)\n\n  {\n\n    sz = 1;\n\n    while (sz < n)\n      sz <<= 1;\n\n    data.assign(2 * sz + 1, INF);\n  }\n\n  inline void Set(int k, int x)\n\n  {\n\n    data[k + sz - 1] = x;\n  }\n\n  inline void Build()\n\n  {\n\n    for (int i = sz - 2; i >= 0; i--) {\n\n      data[i] = min(data[2 * i + 1], data[2 * i + 2]);\n    }\n  }\n\n  inline int Query(int a, int b, int k, int l, int r)\n\n  {\n\n    if (a >= r || b <= l)\n      return (INF);\n\n    if (a <= l && r <= b)\n      return (data[k]);\n\n    return (min(Query(a, b, 2 * k + 1, l, (l + r) >> 1), Query(a, b, 2 * k + 2, (l + r) >> 1, r)));\n  }\n\n  inline int Query(int a, int b)\n\n  {\n\n    return (Query(a, b, 0, 0, sz));\n  }\n};\n\nstruct Centroid {\n\n  int parIdx, parDepth, Deep;\n\n  vector<int> Idxes;\n};\n\nint N, M, K, Q;\n\nvector<edge> graph[100000], MST[100000];\n\nint F[100000];\n\nint min_cost[100000];\n\nvector<edge2> edges;\n\nint subtree[100000], ptr;\n\nCentroid Centroids[100000];\n\nint nowtreeidx[100000], nowtreedepth[100000];\n\nvector<SegmentTree> RMQs;\n\ninline int sizedfs(int idx, int prev)\n\n{\n\n  subtree[idx] = 1;\n\n  for (int i = 0; i < MST[idx].size(); i++) {\n\n    const edge &e = MST[idx][i];\n\n    if (e.to == prev)\n      continue;\n\n    subtree[idx] += sizedfs(e.to, idx);\n  }\n\n  return (subtree[idx]);\n}\n\ninline void makedfs(int idx, int prev, int paridx, int pardepth, int deep)\n\n{\n\n  Centroids[paridx].Idxes.push_back(idx);\n\n  nowtreeidx[idx] = paridx;\n\n  nowtreedepth[idx] = pardepth;\n\n  pair<int, int> ret = make_pair(0, 0);\n\n  for (int i = 0; i < MST[idx].size(); i++) {\n\n    const edge &e = MST[idx][i];\n\n    if (e.to == prev)\n      continue;\n\n    ret = max(ret, make_pair(subtree[e.to], i));\n  }\n\n  for (int i = 0; i < MST[idx].size(); i++) {\n\n    const edge &e = MST[idx][i];\n\n    if (e.to == prev)\n      continue;\n\n    if (ret.second == i) {\n\n      makedfs(e.to, idx, paridx, pardepth + 1, deep);\n\n    } else {\n\n      Centroids[ptr++] = (Centroid){paridx, pardepth, deep + 1};\n\n      makedfs(e.to, idx, ptr - 1, 0, deep + 1);\n    }\n  }\n}\n\nvoid CDP()\n\n{\n\n  sizedfs(0, -1);\n\n  Centroids[ptr++] = (Centroid){-1, 0, 0};\n\n  makedfs(0, -1, 0, 0, 0);\n\n  for (int i = 0; i < ptr; i++) {\n\n    RMQs.push_back(SegmentTree(Centroids[i].Idxes.size()));\n\n    for (vector<int>::iterator it = Centroids[i].Idxes.begin(); it != Centroids[i].Idxes.end();\n         it++) {\n\n      RMQs[i].Set(it - Centroids[i].Idxes.begin(), min_cost[*it]);\n    }\n\n    RMQs[i].Build();\n  }\n}\n\nint getCost(int a, int b)\n\n{\n\n  int nowTreeIdxA = nowtreeidx[a], nowTreeDepthA = nowtreedepth[a];\n\n  int nowTreeIdxB = nowtreeidx[b], nowTreeDepthB = nowtreedepth[b];\n\n  int ret = INF;\n\n  while (nowTreeIdxA != nowTreeIdxB) {\n\n    if (Centroids[nowTreeIdxA].Deep > Centroids[nowTreeIdxB].Deep) {\n\n      ret = min(ret, RMQs[nowTreeIdxA].Query(0, nowTreeDepthA + 1));\n\n      nowTreeDepthA = Centroids[nowTreeIdxA].parDepth;\n\n      nowTreeIdxA = Centroids[nowTreeIdxA].parIdx;\n\n    } else {\n\n      ret = min(ret, RMQs[nowTreeIdxB].Query(0, nowTreeDepthB + 1));\n\n      nowTreeDepthB = Centroids[nowTreeIdxB].parDepth;\n\n      nowTreeIdxB = Centroids[nowTreeIdxB].parIdx;\n    }\n  }\n\n  if (nowTreeDepthA > nowTreeDepthB)\n    swap(nowTreeDepthA, nowTreeDepthB);\n\n  return (min(ret, RMQs[nowTreeIdxA].Query(nowTreeDepthA, nowTreeDepthB + 1)));\n}\n\nvoid MakeTree()\n\n{\n\n  UnionFind unionfind(N);\n\n  for (int i = 0; i < edges.size(); i++) {\n\n    edge2 &e = edges[i];\n\n    e.cost = min(min_cost[e.u], min_cost[e.v]);\n  }\n\n  sort(edges.rbegin(), edges.rend());\n\n  for (int i = 0; i < edges.size(); i++) {\n\n    const edge2 &e = edges[i];\n\n    if (unionfind.Root(e.u) == unionfind.Root(e.v))\n      continue;\n\n    unionfind.Unite(e.u, e.v);\n\n    MST[e.u].push_back((edge){e.v, e.cost});\n\n    MST[e.v].push_back((edge){e.u, e.cost});\n  }\n}\n\nvoid Dijkstra()\n\n{\n\n  priority_queue<Pi, vector<Pi>, greater<Pi> > Que;\n\n  fill_n(min_cost, N, INF);\n\n  for (int i = 0; i < K; i++) {\n\n    Que.push(make_pair(0, F[i]));\n\n    min_cost[F[i]] = 0;\n  }\n\n  while (!Que.empty()) {\n\n    Pi p = Que.top();\n    Que.pop();\n\n    if (min_cost[p.second] < p.first)\n      continue;\n\n    for (int i = 0; i < graph[p.second].size(); i++) {\n\n      const edge &e = graph[p.second][i];\n\n      if (min_cost[e.to] <= e.cost + p.first)\n        continue;\n\n      min_cost[e.to] = e.cost + p.first;\n\n      Que.push(make_pair(min_cost[e.to], e.to));\n    }\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d %d %d %d\", &N, &M, &K, &Q);\n\n  for (int i = 0; i < M; i++) {\n\n    int a, b, l;\n\n    scanf(\"%d %d %d\", &a, &b, &l);\n\n    --a, --b;\n\n    graph[a].push_back((edge){b, l});\n\n    graph[b].push_back((edge){a, l});\n\n    edges.push_back((edge2){a, b, l});\n  }\n\n  for (int i = 0; i < K; i++) {\n\n    scanf(\"%d\", &F[i]);\n\n    --F[i];\n  }\n\n  Dijkstra();\n\n  MakeTree();\n\n  CDP();\n\n  while (Q--) {\n\n    int a, b;\n\n    scanf(\"%d %d\", &a, &b);\n\n    --a, --b;\n\n    printf(\"%d\\n\", getCost(a, b));\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int INF = 1 << 30;\n\ntypedef pair<int, int> Pi;\n\nstruct UnionFind\n\n{\n\n  vector<int> data;\n\n  UnionFind(int sz)\n\n  {\n\n    data.assign(sz, -1);\n  }\n\n  int find(int k)\n\n  {\n\n    if (data[k] < 0)\n      return (k);\n\n    return (data[k] = find(data[k]));\n  }\n\n  void unite(int a, int b)\n\n  {\n\n    a = find(a);\n\n    b = find(b);\n\n    if (a == b)\n      return;\n\n    if (data[a] > data[b])\n      swap(a, b);\n\n    data[a] += data[b];\n\n    data[b] = a;\n  }\n};\n\nstruct edge\n\n{\n\n  int to, cost;\n};\n\nstruct edgee\n\n{\n\n  int u, v, cost;\n\n  bool operator<(const edgee &e) const\n\n  {\n\n    return (cost < e.cost);\n  }\n};\n\nint N, M, K, Q;\n\nint A[200000], B[200000], L[200000];\n\nvector<edge> graph[100000];\n\nint min_cost[100000];\n\nvector<edgee> es;\n\nint S[100000], T[100000];\n\nint l[100000], r[100000];\n\nint main()\n\n{\n\n  scanf(\"%d %d %d %d\", &N, &M, &K, &Q);\n\n  for (int i = 0; i < M; i++) {\n\n    scanf(\"%d %d %d\", &A[i], &B[i], &L[i]);\n\n    --A[i], --B[i];\n\n    graph[A[i]].push_back((edge){B[i], L[i]});\n\n    graph[B[i]].push_back((edge){A[i], L[i]});\n  }\n\n  priority_queue<Pi, vector<Pi>, greater<Pi> > que;\n\n  fill_n(min_cost, N, INF);\n\n  while (K--) {\n\n    int F;\n\n    cin >> F;\n\n    min_cost[--F] = 0;\n\n    que.emplace(0, F);\n  }\n\n  while (!que.empty()) {\n\n    auto p = que.top();\n\n    que.pop();\n\n    if (min_cost[p.second] > p.first)\n      continue;\n\n    for (auto &e : graph[p.second]) {\n\n      if (min_cost[e.to] > p.first + e.cost) {\n\n        min_cost[e.to] = p.first + e.cost;\n\n        que.emplace(min_cost[e.to], e.to);\n      }\n    }\n  }\n\n  for (int i = 0; i < M; i++) {\n\n    es.emplace_back((edgee){A[i], B[i], min(min_cost[A[i]], min_cost[B[i]])});\n  }\n\n  sort(begin(es), end(es));\n\n  reverse(begin(es), end(es));\n\n  UnionFind uf(M);\n\n  for (int i = 0; i < Q; i++) {\n\n    scanf(\"%d %d\", &S[i], &T[i]);\n\n    --S[i], --T[i];\n\n    l[0] = -1, r[i] = M - 1;\n  }\n\n  for (int i = 0; i < 19; i++) {\n\n    UnionFind tree(N);\n\n    vector<Pi> querys;\n\n    for (int j = 0; j < Q; j++) {\n\n      if (r[j] - l[j] > 1)\n        querys.emplace_back((l[j] + r[j]) >> 1, j);\n    }\n\n    sort(begin(querys), end(querys));\n\n    int tail = 0;\n\n    for (int j = 0; j < M; j++) {\n\n      tree.unite(es[j].u, es[j].v);\n\n      while (tail < querys.size() && querys[tail].first <= j) {\n\n        int idx = querys[tail].second;\n\n        int u = S[idx], v = T[idx];\n\n        if (tree.find(S[idx]) == tree.find(T[idx])) {\n\n          r[idx] = querys[tail].first;\n\n        } else {\n\n          l[idx] = querys[tail].first;\n        }\n\n        ++tail;\n      }\n    }\n  }\n\n  for (int i = 0; i < Q; i++) {\n\n    printf(\"%d\\n\", es[r[i]].cost);\n  }\n}"}
{"fast_code_id":"037be2938b2ee0e549eb48a839343484630f64bd18b46d22adcbc5bfb75df944","fast_id":"429e2a29f8ca534b74305d7da50245ff76f821f77dd2927b80a9c7be98cafe86","fast_time":0.0210029517,"language":"cpp","measured_fast_code_id":"429e2a29f8ca534b74305d7da50245ff76f821f77dd2927b80a9c7be98cafe86","measured_slow_code_id":"ae256bf808b2b9a3e97576e12cdaf9dcdcc861b5241e07c19c9ba4a249224a78","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14277","problem_id":"p00255","slow_code_id":"ea5400e21c5b0168f00b4dc285edf80f971a2a4bd2c46b115814fd444b31c63a","slow_id":"ae256bf808b2b9a3e97576e12cdaf9dcdcc861b5241e07c19c9ba4a249224a78","slow_time":0.106309169,"speedup":5.061629932710838,"stratum":"4-8","sampling_key":"7ff4ca4388e39453e25f2ffe7755a1bba7dce2441e129caf51480746c872e75b","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n\n  ll i, n, num, len, p, l[100000];\n\n  while (cin >> n, n) {\n\n    num = n;\n    len = 0;\n\n    for (i = 0; i < n; i++) {\n\n      cin >> p;\n      len += p;\n    }\n\n    for (i = 0; i < n - 1; i++)\n      cin >> l[i];\n\n    sort(l, l + n - 1);\n\n    for (i = n - 2; i >= 0; i--) {\n\n      if ((num - 1) * (len + l[i]) < num * len)\n        break;\n\n      num--;\n      len += l[i];\n    }\n\n    cout << num * len << endl;\n  }\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  int n, p, l[100000];\n\n  while (scanf(\"%d\", &n), n) {\n\n    long long num = n, len = 0;\n\n    for (int i = 0; i < n; i++) {\n      scanf(\"%d\", &p);\n      len += p;\n    }\n\n    for (int i = 0; i < n - 1; i++)\n      scanf(\"%d\", &l[i]);\n\n    sort(l, l + n - 1);\n\n    for (int i = n - 2; i >= 0; i--) {\n\n      if ((num - 1) * (len + l[i]) < num * len)\n        break;\n\n      num--;\n      len += l[i];\n    }\n\n    printf(\"%lld\\n\", num * len);\n  }\n}\n"}
{"fast_code_id":"96c1e22258140163c255af033babff7a4b4740bd99d537c587befdd85ee596f2","fast_id":"bbe9ce5e2cb4de2dbe7a048526d247175d4b170dc2eeeb094c1773c9a3eca7fc","fast_time":0.1123622008,"language":"cpp","measured_fast_code_id":"bbe9ce5e2cb4de2dbe7a048526d247175d4b170dc2eeeb094c1773c9a3eca7fc","measured_slow_code_id":"8d15acbd9cfda8a88426761c5cc519b9a4c81ae51a3b7168f597addaa204e925","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14279","problem_id":"p00040","slow_code_id":"d4d70832ee954ea606c763a4e7c4653deff92c94b230be6aae4914bc8ca92c44","slow_id":"8d15acbd9cfda8a88426761c5cc519b9a4c81ae51a3b7168f597addaa204e925","slow_time":0.2594028368,"speedup":2.3086307935684363,"stratum":"2-4","sampling_key":"840c87e4d602e108e2eecc3d3832cfac749d29447a297d5f741ad4df6f61a406","slow_code":"#include <iostream>\n\n#include <map>\n\n#include <sstream>\n\n#include <string.h>\n\nusing namespace std;\n\nmap<int, char> AlphabetTable;\n\nmap<int, int> table;\n\nchar decode(char a) {\n\n  int z = a - 'a';\n\n  for (int i = 0; i < 26; i++) {\n\n    if (table[i] == z)\n      return AlphabetTable[i];\n  }\n}\n\nvoid makeTable(int a, int b) {\n\n  for (int i = 0; i < 26; i++) {\n\n    table[i] = (a * i + b) % 26;\n  }\n}\n\nvoid makeAlphabetTable() {\n\n  char c = 'a';\n\n  for (int i = 0; i < 26; i++) {\n\n    AlphabetTable[i] = c;\n\n    c++;\n  }\n}\n\nint main() {\n\n  string code, tmp;\n\n  int n;\n\n  getline(cin, code);\n\n  stringstream ssn(code);\n\n  ssn >> n;\n\n  makeAlphabetTable();\n\n  for (int i = 0; i < n; i++) {\n\n    getline(cin, code);\n\n    tmp = code;\n\n    for (int b = 0; b < 26; b++) {\n\n      for (int a = 1; a < 26; a += 2) {\n\n        if (a % 13 != 0) {\n\n          makeTable(a, b);\n\n          code = tmp;\n\n          for (int j = 0; j < code.length(); j++) {\n\n            if ('a' <= code[j] && code[j] <= 'z') {\n\n              code[j] = decode(code[j]);\n            }\n          }\n\n          if (code.find(\"this\") != -1 || code.find(\"that\") != -1) {\n\n            cout << code << endl;\n\n            break;\n          }\n        }\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\nusing namespace std;\n\nvoid solve()\n\n{\n\n  int N;\n\n  scanf(\"%d\\n\", &N);\n\n  while (N--)\n\n  {\n\n    string s;\n\n    getline(cin, s);\n\n    string sbuf = s;\n\n    sbuf += ' ';\n\n    int n = sbuf.size();\n\n    int start = 0;\n\n    int end = 0;\n\n    vector<string> Vec;\n\n    string temp;\n\n    for (int i = 0; i < n; ++i)\n\n    {\n\n      if (sbuf[i] == ' ')\n\n      {\n\n        if (end - start == 4)\n\n        {\n\n          Vec.push_back(temp);\n        }\n\n        start = end = i + 1;\n\n        temp.clear();\n\n        continue;\n      }\n\n      temp += sbuf[i];\n\n      ++end;\n    }\n\n    int a = 0;\n\n    int b = 0;\n\n    for (int i = 0; i < Vec.size(); ++i)\n\n    {\n\n      for (int j = 0; j < 4; ++j)\n\n      {\n\n        Vec[i][j] %= 26;\n      }\n    }\n\n    for (int i = 0; i < 26; ++i)\n\n    {\n\n      for (int j = 0; j < 27; ++j)\n\n      {\n\n        for (int k = 0; k < Vec.size(); ++k)\n\n        {\n\n          string check = \"asdf\";\n\n          for (int l = 0; l < 4; ++l)\n\n          {\n\n            check[l] = (i * Vec[k][l] + j) % 26 + 'a';\n          }\n\n          if (check == \"this\" || check == \"that\")\n\n          {\n\n            a = i;\n\n            b = j;\n\n            goto END;\n          }\n        }\n      }\n    }\n\n  END:\n\n    n = s.size();\n\n    for (int i = 0; i < n; ++i)\n\n    {\n\n      if (s[i] == ' ')\n\n      {\n\n        cout << s[i];\n\n        continue;\n      }\n\n      s[i] = (a * (s[i] % 26) + b) % 26 + 'a';\n\n      cout << s[i];\n    }\n\n    cout << endl;\n  }\n}\n\nint main()\n\n{\n\n  solve();\n\n  return (0);\n}"}
{"fast_code_id":"f70251e74a65a50a941ae37e34c8e9cdc48f439854429965f1e238200c640bfe","fast_id":"70f5b93a33703eebf74dfe839f19dc299ac7a71ca3c8659468770ebc6725cad0","fast_time":0.3401575317,"language":"cpp","measured_fast_code_id":"70f5b93a33703eebf74dfe839f19dc299ac7a71ca3c8659468770ebc6725cad0","measured_slow_code_id":"457ea11669b4db51c61768c294678aca84b1342f109cdf3200daf6686adbb1a0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14285","problem_id":"p03941","slow_code_id":"04fffc85e4369271d1e75f17c05f82f3b768bc8b1eed353d2f34a6bcea48efc1","slow_id":"457ea11669b4db51c61768c294678aca84b1342f109cdf3200daf6686adbb1a0","slow_time":0.7442471471,"speedup":2.1879484584112765,"stratum":"2-4","sampling_key":"b5f14d13c60386dc2dfce336b1f9f028c4213f5da3d4e8776789a6064c1c91fd","slow_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\n#define fi first\n\n#define se second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define fbo find_by_order\n\n#define ook order_of_key\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> ii;\n\ntypedef vector<int> vi;\n\ntypedef long double ld;\n\ntypedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;\n\ntypedef set<int>::iterator sit;\n\ntypedef map<int, int>::iterator mit;\n\ntypedef vector<int>::iterator vit;\n\nll v[150001];\n\nint par[150001];\n\nvi adj[150001];\n\nvector<ii> S[150001];\n\nbool cmp2(const ii &a, const ii &b)\n\n{\n\n  if (a.se != b.se)\n    return a.se < b.se;\n\n  return a.fi < b.fi;\n}\n\nvoid calc(ll mid, int u)\n\n{\n\n  for (int i = 0; i < adj[u].size(); i++)\n\n  {\n\n    calc(mid, adj[u][i]);\n  }\n\n  if (adj[u].empty())\n\n  {\n\n    S[u].pb(mp(0, 0));\n    return;\n  }\n\n  int u1 = adj[u][0];\n  int u2 = adj[u][1];\n\n  if (S[u1].size() > S[u2].size())\n    swap(u1, u2);\n\n  sort(S[u1].begin(), S[u1].end(), cmp2);\n  sort(S[u2].begin(), S[u2].end());\n\n  int ptr2 = 0;\n\n  ll mind = ll(1e18);\n\n  for (int i = int(S[u1].size()) - 1; i >= 0; i--)\n\n  {\n\n    ll a = S[u1][i].fi;\n    ll b = S[u1][i].se;\n    ll cap = mid - v[u1] - v[u2] - b;\n\n    while (ptr2 < S[u2].size() && S[u2][ptr2].fi <= cap)\n\n    {\n\n      mind = min(mind, S[u2][ptr2].se);\n\n      ptr2++;\n    }\n\n    if (mind < ll(1e18))\n\n    {\n\n      S[u].pb(mp(a + v[u1], mind + v[u2]));\n    }\n  }\n\n  sort(S[u1].begin(), S[u1].end());\n  sort(S[u2].begin(), S[u2].end(), cmp2);\n\n  ptr2 = 0;\n\n  mind = ll(1e18);\n\n  for (int i = int(S[u1].size()) - 1; i >= 0; i--)\n\n  {\n\n    ll a = S[u1][i].fi;\n    ll b = S[u1][i].se;\n    ll cap = mid - v[u1] - v[u2] - a;\n\n    while (ptr2 < S[u2].size() && S[u2][ptr2].se <= cap)\n\n    {\n\n      mind = min(mind, S[u2][ptr2].fi);\n\n      ptr2++;\n    }\n\n    if (mind < ll(1e18))\n\n    {\n\n      S[u].pb(mp(mind + v[u2], b + v[u1]));\n    }\n  }\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(0);\n  cin.tie(0);\n\n  int n;\n  cin >> n;\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    cin >> par[i] >> v[i];\n\n    par[i]--;\n\n    adj[par[i]].pb(i);\n  }\n\n  ll lo = 0;\n  ll hi = ll(1e11);\n\n  ll ans = 0;\n\n  while (lo <= hi)\n\n  {\n\n    ll mid = (lo + hi) >> 1;\n\n    calc(mid, 0);\n\n    if (S[0].empty())\n\n    {\n\n      lo = mid + 1;\n\n    }\n\n    else\n\n    {\n\n      hi = mid - 1;\n\n      ans = mid;\n    }\n\n    for (int i = 0; i <= n; i++)\n      S[i].clear();\n  }\n\n  cout << ans << '\\n';\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\n#define MAXN 131100\n\n#define LL long long\n\n#define INF 40000000000\n\nstruct node\n\n{\n\n  LL in, out;\n\n  node(LL _in = 0, LL _out = 0) { in = _in, out = _out; }\n};\n\nvector<node> dp[MAXN], tmp1, tmp2;\n\nLL lim;\n\nvoid vector_merge(vector<node> &G, vector<node> &l, vector<node> &r)\n\n{\n\n  G.clear();\n\n  int s1 = l.size(), s2 = r.size(), p1 = 0, p2 = 0;\n\n  if (s2 == 0)\n    return;\n\n  while (p1 < s1)\n\n  {\n\n    while (p2 < s2 && l[p1].out + r[p2].in <= lim)\n      p2++;\n\n    if (p2)\n      p2--;\n\n    if (l[p1].out + r[p2].in <= lim)\n      G.push_back(node(l[p1].in, r[p2].out));\n\n    p1++;\n  }\n}\n\nvoid Insert(vector<node> &G, node &x)\n\n{\n\n  int k = G.size();\n\n  if (k == 0)\n    G.push_back(x);\n\n  else if (G[k - 1].out > x.out)\n    G.push_back(x);\n}\n\nvoid merge_sort(vector<node> &G, vector<node> &l, vector<node> &r)\n\n{\n\n  G.clear();\n\n  int s1 = l.size(), s2 = r.size(), p1 = 0, p2 = 0;\n\n  while (p1 != s1 || p2 != s2)\n\n  {\n\n    if (p1 == s1)\n      Insert(G, r[p2++]);\n\n    else if (p2 == s2)\n      Insert(G, l[p1++]);\n\n    else if (l[p1].in < r[p2].in)\n      Insert(G, l[p1++]);\n\n    else\n      Insert(G, r[p2++]);\n  }\n}\n\nint d[MAXN], ch[MAXN][2], fa[MAXN], n;\n\nLL dep[MAXN];\n\nvoid dfs(int u)\n\n{\n\n  if (!d[u])\n\n  {\n\n    dp[u].clear();\n\n    dp[u].push_back(node(dep[u], dep[u]));\n\n    return;\n  }\n\n  int ls = ch[u][0], rs = ch[u][1];\n\n  dfs(ls);\n\n  dfs(rs);\n\n  lim += 2 * dep[u];\n\n  vector_merge(tmp1, dp[ls], dp[rs]);\n\n  vector_merge(tmp2, dp[rs], dp[ls]);\n\n  merge_sort(dp[u], tmp1, tmp2);\n\n  lim -= 2 * dep[u];\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 2; i <= n; i++)\n\n  {\n\n    scanf(\"%d%lld\", &fa[i], &dep[i]);\n\n    ch[fa[i]][d[fa[i]]++] = i;\n\n    dep[i] += dep[fa[i]];\n  }\n\n  LL l = 0, r = INF, ans;\n\n  while (l < r)\n\n  {\n\n    lim = (l + r) / 2;\n\n    dfs(1);\n\n    if (dp[1].size())\n      r = lim, ans = lim;\n\n    else\n      l = lim + 1;\n  }\n\n  printf(\"%lld\\n\", ans);\n}"}
{"fast_code_id":"9cf0165951e249cd186d4f1c1e5d5153be2179368e1c19e0e2f47bb9f6f12e1b","fast_id":"71ec0adf943333e9dda6cc5699ffc55bd1c09f185e4054a0dbf2f2ec863b34c5","fast_time":0.0958320469,"language":"cpp","measured_fast_code_id":"71ec0adf943333e9dda6cc5699ffc55bd1c09f185e4054a0dbf2f2ec863b34c5","measured_slow_code_id":"9c904e7967b37f15f89f13d7c2a05a0a163063194bc6618ff8ea3f750d163147","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14294","problem_id":"p00929","slow_code_id":"3863a5abfc97652acb2f75cf08017dfe3be398c8d0cfe02f16104bd52a0bc9b9","slow_id":"9c904e7967b37f15f89f13d7c2a05a0a163063194bc6618ff8ea3f750d163147","slow_time":0.340189024,"speedup":3.549846163204514,"stratum":"2-4","sampling_key":"12c46190b31e44b437ea8269cb577b7ddbebe7c44713dc81d21007f443ee4ae2","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\nusing namespace std;\n\nint n, m;\n\nconst int maxn = 5e4 + 1000;\n\nconst int maxv = 600;\n\nstruct Edge\n\n{\n\n  int u, v, w, next;\n\n  Edge(int _u = 0, int _v = 0, int _w = 0, int _next = 0)\n\n  {\n\n    u = _u, v = _v;\n    w = _w;\n    next = _next;\n  }\n\n} edge[maxn * 2], tedge[maxn];\n\nint head[maxv], ednum, idx[maxn];\n\nvoid addedge(int u, int v, int w)\n\n{\n\n  edge[ednum] = Edge(u, v, w, head[u]);\n\n  head[u] = ednum++;\n\n  edge[ednum] = Edge(v, u, w, head[v]);\n\n  head[v] = ednum++;\n}\n\nbool cmp(int a, int b)\n\n{\n\n  return tedge[a].w < tedge[b].w;\n}\n\nint dfn[maxv], low[maxv], idxn, stnum, sccnum, stk[maxv], scc[maxv];\n\nbool inst[maxv];\n\nvoid tarjan(int u, int pre)\n\n{\n\n  int i, v;\n\n  dfn[u] = low[u] = ++idxn;\n\n  inst[u] = true;\n\n  stk[stnum++] = u;\n\n  for (i = head[u]; i != -1; i = edge[i].next)\n\n  {\n\n    v = edge[i].v;\n\n    if (v == pre)\n      continue;\n\n    if (!dfn[v])\n\n    {\n\n      tarjan(v, u);\n\n      low[u] = min(low[u], low[v]);\n\n    }\n\n    else if (inst[v])\n      low[u] = min(low[u], dfn[v]);\n  }\n\n  if (low[u] == dfn[u])\n\n  {\n\n    ++sccnum;\n\n    while (stk[stnum - 1] != u)\n\n    {\n\n      scc[stk[stnum - 1]] = sccnum;\n\n      inst[stk[stnum - 1]] = false;\n\n      stnum--;\n    }\n\n    scc[stk[stnum - 1]] = sccnum;\n\n    inst[stk[stnum - 1]] = false;\n\n    stnum--;\n  }\n}\n\nbool isaim[maxn];\n\nint main()\n\n{\n\n  int i, j, u, v, w;\n\n  int num, ans;\n\n  scanf(\"%d %d\", &n, &m);\n\n  for (i = 0; i < m; i++)\n\n  {\n\n    idx[i] = i;\n\n    scanf(\"%d %d %d\", &u, &v, &w);\n\n    tedge[i] = Edge(u, v, w);\n  }\n\n  num = ans = ednum = 0;\n\n  memset(head, -1, sizeof(head));\n\n  memset(isaim, false, sizeof(isaim));\n\n  sort(idx, idx + m, cmp);\n\n  for (i = 0; i < m; i++)\n\n  {\n\n    if (i == 0 || tedge[idx[i]].w == tedge[idx[i - 1]].w)\n\n      addedge(tedge[idx[i]].u, tedge[idx[i]].v, tedge[idx[i]].w);\n\n    else\n\n    {\n\n      memset(dfn, 0, sizeof(dfn));\n\n      memset(scc, 0, sizeof(scc));\n\n      memset(inst, false, sizeof(inst));\n\n      idxn = 0;\n      sccnum = 0;\n\n      for (j = 1; j <= n; j++)\n\n        if (!dfn[j])\n\n        {\n\n          stnum = 0;\n\n          tarjan(j, -1);\n        }\n\n      for (j = 0; j < i; j++)\n\n        if (scc[tedge[idx[j]].u] != scc[tedge[idx[j]].v])\n          isaim[idx[j]] = true;\n\n      addedge(tedge[idx[i]].u, tedge[idx[i]].v, tedge[idx[i]].w);\n    }\n  }\n\n  memset(dfn, 0, sizeof(dfn));\n\n  memset(scc, 0, sizeof(scc));\n\n  memset(inst, false, sizeof(inst));\n\n  idxn = 0;\n  sccnum = 0;\n\n  for (j = 1; j <= n; j++)\n\n    if (!dfn[j])\n\n    {\n\n      stnum = 0;\n\n      tarjan(j, -1);\n    }\n\n  for (j = 0; j < m; j++)\n\n    if (scc[tedge[idx[j]].u] != scc[tedge[idx[j]].v])\n      isaim[idx[j]] = true;\n\n  for (j = 0; j < m; j++)\n\n    if (isaim[j])\n      num++, ans += tedge[j].w;\n\n  printf(\"%d %d\\n\", num, ans);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define maxn 50018\n\n#define N 558\n\n#define inf 200000000\n\n#define PII pair<int, int>\n\nusing namespace std;\n\nint n, m;\n\nint cnt = 0;\n\nint sum1, sum2;\n\nint ans;\n\nint father[N];\n\nstruct nod {\n\n  int from, to, cost;\n\n} edg[maxn];\n\nbool cmp(nod i, nod j)\n\n{\n\n  return i.cost < j.cost;\n}\n\nint v[N], num[N];\n\nvoid init()\n\n{\n\n  for (int i = 0; i <= n; i++)\n\n  {\n\n    father[i] = i;\n    num[i] = 1;\n  }\n}\n\nint find(int x) {\n\n  if (x != father[x])\n    return father[x] = find(father[x]);\n\n  return father[x];\n}\n\nbool Union(int x, int y)\n\n{\n\n  int fx = find(x), fy = find(y);\n\n  if (fx != fy)\n\n  {\n\n    father[fy] = fx;\n    num[fx] += num[fy];\n    return true;\n\n  }\n\n  else\n\n  {\n\n    return false;\n  }\n}\n\nvoid krus2()\n\n{\n\n  sum1 = 0, sum2 = 0;\n\n  for (int i = 0; i < cnt; i++) {\n\n    int tmp = 0;\n    init();\n\n    for (int j = 0; j < m; j++) {\n\n      if (j != v[i]) {\n\n        if (Union(edg[j].from, edg[j].to))\n\n        {\n\n          tmp += edg[j].cost;\n        }\n      }\n    }\n\n    if (tmp != ans)\n      sum1++, sum2 += edg[v[i]].cost;\n  }\n\n  printf(\"%d %d\\n\", sum1, sum2);\n}\n\nint main() {\n\n  while (~scanf(\"%d%d\", &n, &m)) {\n\n    cnt = 0;\n\n    init();\n\n    for (int i = 0; i < m; i++) {\n\n      scanf(\"%d%d%d\", &edg[i].from, &edg[i].to, &edg[i].cost);\n    }\n\n    sort(edg, edg + m, cmp);\n\n    ans = 0;\n\n    memset(v, 0, sizeof(v));\n\n    for (int i = 0; i < m; i++) {\n\n      if (Union(edg[i].from, edg[i].to)) {\n\n        ans += edg[i].cost;\n\n        v[cnt++] = i;\n      }\n    }\n\n    krus2();\n  }\n\n  return 0;\n}"}
{"fast_code_id":"47c15a8d067f792524f4fd0f632d64bd2f359330c8643edadaadab24ba89e4c0","fast_id":"46d50ac11b7475602324cfc068e506f6eb8deab25dd3f979336f13eb7ee05ba6","fast_time":0.0182993734,"language":"cpp","measured_fast_code_id":"46d50ac11b7475602324cfc068e506f6eb8deab25dd3f979336f13eb7ee05ba6","measured_slow_code_id":"fb0fc549f0246b3e283433721ef82196c9bb8fcb7baefae907f774d5bff5f3eb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14304","problem_id":"p02834","slow_code_id":"d19eeb97e7f3d5a8be3d15c78e5ac68a1b203ba0a1ad4f6236bb983cd23d46f1","slow_id":"fb0fc549f0246b3e283433721ef82196c9bb8fcb7baefae907f774d5bff5f3eb","slow_time":0.404470739,"speedup":22.102982990663495,"stratum":"8+","sampling_key":"707b2b07c70505b3e1368903e37b000b6e0bcdada330ff67ae4716cd6897c746","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint DT[100001], DA[100001];\n\nvector<int> E[100001];\n\nvoid dfsT(int A, int d) {\n\n  if (DT[A])\n    return;\n\n  DT[A] = d;\n\n  for (int to : E[A]) {\n\n    dfsT(to, d + 1);\n  }\n}\n\nvoid dfsA(int A, int d) {\n\n  if (DA[A])\n    return;\n\n  DA[A] = d;\n\n  for (int to : E[A]) {\n\n    dfsA(to, d + 1);\n  }\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int u, v;\n\n  cin >> u >> v;\n\n  rep(i, N - 1) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    E[a].pb(b);\n\n    E[b].pb(a);\n  }\n\n  dfsT(u, 1);\n\n  dfsA(v, 1);\n\n  int saidai = -1;\n\n  rep1(i, N) {\n\n    if (DT[i] < DA[i])\n      chmax(saidai, DA[i]);\n  }\n\n  if (saidai - 2 <= 0)\n    co(0);\n\n  else\n    co(saidai - 2);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint D[100001];\n\nint to[200001], ne[200001], he[100001];\n\nvoid dfsT(int A, int d) {\n\n  D[A] = d;\n\n  for (int t = he[A]; t; t = ne[t]) {\n\n    if (!D[to[t]])\n      dfsT(to[t], d + 1);\n  }\n}\n\nint saidai = -1;\n\nvoid dfsA(int A, int d) {\n\n  if (D[A] < d)\n    chmax(saidai, d);\n\n  D[A] = 0;\n\n  for (int t = he[A]; t; t = ne[t]) {\n\n    if (D[to[t]])\n      dfsA(to[t], d + 1);\n  }\n}\n\nint main() {\n\n  int N = getint();\n\n  int u = getint(), v = getint();\n\n  int k = 1;\n\n  rep(i, N - 1) {\n\n    int a = getint(), b = getint();\n\n    to[k] = b;\n\n    ne[k] = he[a];\n\n    he[a] = k++;\n\n    to[k] = a;\n\n    ne[k] = he[b];\n\n    he[b] = k++;\n  }\n\n  dfsT(u, 1);\n\n  dfsA(v, 1);\n\n  if (saidai - 2 <= 0)\n    printf(\"0\");\n\n  else\n    printf(\"%d\", saidai - 2);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"f80aa5939164d045d4c8fd4454b8c2c1bf78d62b5c91fbe5087b808170998a3d","fast_id":"d33fced47591f89bee1b56a88211090683a470c813235fe41c7c6f29b10952d2","fast_time":0.109943069,"language":"cpp","measured_fast_code_id":"d33fced47591f89bee1b56a88211090683a470c813235fe41c7c6f29b10952d2","measured_slow_code_id":"b9b69f53af1cf30927b512047b5285305fa55ff0f4b7f4936c27963c5b99e5e2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14326","problem_id":"p03168","slow_code_id":"25528ca5743ed4fea2fd96baad04babb90ebe83ae87a56c3beab56578d7c0676","slow_id":"b9b69f53af1cf30927b512047b5285305fa55ff0f4b7f4936c27963c5b99e5e2","slow_time":0.3817717163,"speedup":3.472449148204149,"stratum":"2-4","sampling_key":"678525bfce82c1a1b38e511c86b8ba1125732cba0c28e5ba64b1f996f8b40e4b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define ull unsigned long long\n\nll mod = 1e9 + 7;\n\n#define PI 3.1415926535897932385\n\n#define inf 9e18\n\n#define fastio                                                                 \\\n  ios_base::sync_with_stdio(false);                                            \\\n  cin.tie(NULL);\n\nstring char_to_str(char c) {\n  string tem(1, c);\n  return tem;\n}\n\ntypedef pair<long long, long long> ii;\n\n#define S second\n\n#define F first\n\nll max(ll a, ll b) {\n  if (a > b) {\n    return a;\n  }\n  return b;\n}\n\nll min(ll a, ll b) {\n  if (a < b) {\n    return a;\n  }\n  return b;\n}\n\n#define MAXN 200005\n\nll n;\n\nvector<ll> adj[100005];\n\nll given[100005];\n\nll goal[100005];\n\nll vis_bfs[100005];\n\nll vis_dfs[100005];\n\nll par[100005];\n\nll tu[100005];\n\nvoid dfs(ll u) {\n\n  for (auto i = adj[u].begin(); i != adj[u].end(); ++i)\n\n  {\n\n    if (!vis_dfs[*i]) {\n\n      par[*i] = u;\n\n      vis_dfs[*i] = true;\n\n      dfs(*i);\n    }\n  }\n}\n\nint main()\n\n{\n\n  fastio;\n\n  ll n;\n\n  cin >> n;\n\n  long double p[n + 1];\n\n  for (int i = 1; i < n + 1; ++i)\n\n  {\n\n    cin >> p[i];\n  }\n\n  long double dp[n + 1][n + 1];\n\n  for (int i = 0; i < n + 1; ++i)\n\n  {\n\n    for (int j = 0; j < n + 1; ++j)\n\n    {\n\n      dp[i][j] = 0;\n    }\n  }\n\n  dp[0][0] = 1;\n\n  for (int i = 1; i < n + 1; ++i)\n\n  {\n\n    for (int j = 0; j <= i; ++j)\n\n    {\n\n      if (j > 0) {\n\n        dp[i][j] = dp[i][j] + (dp[i - 1][j - 1] * p[i]);\n      }\n\n      dp[i][j] = dp[i][j] + (dp[i - 1][j] * (1.0 - p[i]));\n    }\n  }\n\n  long double ans = 0;\n\n  for (int i = (n / 2) + 1; i <= n; ++i)\n\n  {\n\n    ans = ans + dp[n][i];\n  }\n\n  cout << fixed << setprecision(13) << ans;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define ull unsigned long long\n\nll mod = 1e9 + 7;\n\n#define PI 3.1415926535897932385\n\n#define inf 9e18\n\n#define fastio                                                                 \\\n  ios_base::sync_with_stdio(false);                                            \\\n  cin.tie(NULL);\n\nstring char_to_str(char c) {\n  string tem(1, c);\n  return tem;\n}\n\ntypedef pair<long long, long long> ii;\n\n#define S second\n\n#define F first\n\nll max(ll a, ll b) {\n  if (a > b) {\n    return a;\n  }\n  return b;\n}\n\nll min(ll a, ll b) {\n  if (a < b) {\n    return a;\n  }\n  return b;\n}\n\n#define MAXN 200005\n\nint main()\n\n{\n\n  fastio;\n\n  ll n;\n\n  cin >> n;\n\n  long double p[n + 1];\n\n  for (int i = 1; i < n + 1; ++i)\n\n  {\n\n    cin >> p[i];\n  }\n\n  cout << setprecision(20);\n\n  long double dp[n + 1][n + 1];\n\n  for (int i = 0; i < n + 1; ++i)\n\n  {\n\n    for (int j = 0; j < n + 1; ++j)\n\n    {\n\n      dp[i][j] = 0.0;\n    }\n  }\n\n  dp[0][0] = 1.0;\n\n  for (int i = 1; i < n + 1; ++i)\n\n  {\n\n    dp[0][i] = dp[0][i - 1] * (1 - p[i]);\n  }\n\n  for (int i = 1; i < n + 1; ++i)\n\n  {\n\n    for (int j = i; j < n + 1; ++j)\n\n    {\n\n      dp[i][j] = (dp[i][j - 1] * (1 - p[j])) + (dp[i - 1][j - 1] * p[j]);\n    }\n  }\n\n  long double ans = 0.0;\n\n  for (int i = (n / 2) + 1; i <= n; ++i)\n\n  {\n\n    ans += dp[i][n];\n  }\n\n  cout << ans;\n\n  return 0;\n}\n"}
{"fast_code_id":"47b736351ddbdcb7608eb2fcb3411acc965b31aa76c886eee1ba640acadb7fb6","fast_id":"8189ed9f6f2400781dc8045b644a7d02e068923b2701ecca00357bb9fd413baa","fast_time":0.3912561381,"language":"cpp","measured_fast_code_id":"8189ed9f6f2400781dc8045b644a7d02e068923b2701ecca00357bb9fd413baa","measured_slow_code_id":"ec6ed5b6f588ea22cc6008392954c3fbd21436a058a396e6fcad31265ec616b0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14331","problem_id":"p02998","slow_code_id":"6e4d05a9e500b8e91dacf4d05562b741a08871795032f747e3d49da9ccf520b7","slow_id":"ec6ed5b6f588ea22cc6008392954c3fbd21436a058a396e6fcad31265ec616b0","slow_time":0.8256011023,"speedup":2.110129457161352,"stratum":"2-4","sampling_key":"3bf89fe56c71a17d8cf2b722cc27d8f30b5822d2e9f49ce5b44759646f04e15b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define reg register\n\n#define MaxN 100003\n\n#define hhhhhhh 1000000\n\nint N;\n\nint fa[MaxN];\n\nlong long ans, cnty[MaxN], cntx[MaxN];\n\nmap<int, bool> bk[MaxN];\n\nstruct Nd {\n\n  int x, y;\n\n} a[MaxN];\n\ninline int Rd() {\n\n  int x = 0, f = 1;\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      f = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9')\n    x = x * 10 + ch - '0', ch = getchar();\n\n  return x * f;\n}\n\ninline int Find(int d) {\n\n  if (fa[d] == d)\n    return d;\n\n  else\n    return fa[d] = Find(fa[d]);\n}\n\ninline bool cmp(Nd aa, Nd bb) { return aa.x < bb.x; }\n\nint main() {\n\n  N = Rd();\n\n  for (reg int i = 1; i <= 100000; ++i)\n\n    fa[i] = i;\n\n  for (reg int i = 1; i <= N; ++i)\n\n    a[i].x = Rd(), a[i].y = Rd();\n\n  sort(a + 1, a + 1 + N, cmp);\n\n  for (reg int i = 1; i < N; ++i)\n\n    if (a[i].x == a[i + 1].x)\n\n      fa[Find(a[i].y)] = Find(a[i + 1].y);\n\n  for (reg int i = 1; i <= 100000; ++i)\n\n    ++cnty[Find(i)];\n\n  for (reg int i = 1; i <= N; ++i)\n\n    if (!bk[Find(a[i].y)][a[i].x]) {\n\n      ++cntx[Find(a[i].y)];\n\n      bk[Find(a[i].y)][a[i].x] = true;\n    }\n\n  for (reg int i = 1; i <= 100000; ++i)\n\n    ans += cnty[i] * cntx[i];\n\n  cout << ans - N << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define N 100000\n\nint n, f[N * 2 + 5], cx[N * 2 + 5], cy[N * 2 + 5];\n\nint find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }\n\nint main() {\n\n#ifdef whyqx\n\n  freopen(\"work.in\", \"r\", stdin);\n\n  freopen(\"work.out\", \"w\", stdout);\n\n#endif\n\n  cin >> n;\n\n  for (int i = 1; i <= N << 1; ++i)\n\n    f[i] = i;\n\n  for (int i = 1; i <= n; ++i) {\n\n    int x, y;\n\n    scanf(\"%d%d\", &x, &y);\n\n    f[find(x)] = find(y + N);\n  }\n\n  for (int i = N + 1; i <= N << 1; ++i)\n\n    cy[find(i)]++;\n\n  for (int i = 1; i <= N; ++i)\n\n    cx[find(i)]++;\n\n  long long ans = 0;\n\n  for (int i = 1; i <= N << 1; ++i)\n\n    ans += 1ll * cx[i] * cy[i];\n\n  cout << ans - n;\n\n  return 0;\n}\n"}
{"fast_code_id":"03b25cdb53c8553bd70db891867b9f5d59b80d8e2b38a07394bb8f10e698f778","fast_id":"28bee9e510e842aaabff40745ba23d38cd5298a330045eaf044e7cd36ac75f15","fast_time":0.0157708986,"language":"cpp","measured_fast_code_id":"28bee9e510e842aaabff40745ba23d38cd5298a330045eaf044e7cd36ac75f15","measured_slow_code_id":"5f8e82476091b3ae97e825ed8a26399f0896100686f906ab8a8f867df56e792b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14355","problem_id":"p00664","slow_code_id":"711d8efc18b0cc72f0003f2d4ad5ac2b53d6521c0277db75673c37fbff0f2e69","slow_id":"5f8e82476091b3ae97e825ed8a26399f0896100686f906ab8a8f867df56e792b","slow_time":0.0765688864,"speedup":4.855074421694652,"stratum":"4-8","sampling_key":"701e61c9b2a927d4fffdda219041d3b1ee2f4272063dbcaa1ec1eb628259872e","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  int r, c, q, a[50000], b[50000], o[50000];\n\n  int nr, nc;\n\n  bool row[50000], col[50000];\n\n  int ans;\n\n  while (1) {\n\n    cin >> r >> c >> q;\n\n    if (!r && !c && !q)\n      break;\n\n    for (int i = 0; i < r; i++)\n      row[i] = false;\n\n    for (int i = 0; i < c; i++)\n      col[i] = false;\n\n    ans = nr = nc = 0;\n\n    for (int i = 0; i < q; i++)\n      cin >> a[i] >> b[i] >> o[i];\n\n    for (int i = q - 1; i >= 0; i--) {\n\n      if (a[i]) {\n\n        if (!col[b[i]]) {\n\n          if (o[i])\n            ans += r - nr;\n\n          col[b[i]] = true;\n\n          nc++;\n        }\n\n      } else {\n\n        if (!row[b[i]]) {\n\n          if (o[i])\n            ans += c - nc;\n\n          row[b[i]] = true;\n\n          nr++;\n        }\n      }\n    }\n\n    cout << ans << endl;\n  }\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nint main() {\n\n  int r, c, q, a[50000], b[50000], o[50000];\n\n  int nr, nc;\n\n  bool row[50000], col[50000];\n\n  long long int ans;\n\n  while (1) {\n\n    scanf(\"%d %d %d\", &r, &c, &q);\n\n    if (!r && !c && !q)\n      break;\n\n    for (int i = 0; i < r; i++)\n      row[i] = false;\n\n    for (int i = 0; i < c; i++)\n      col[i] = false;\n\n    ans = nr = nc = 0;\n\n    for (int i = 0; i < q; i++)\n      scanf(\"%d %d %d\", &a[i], &b[i], &o[i]);\n\n    for (int i = q - 1; i >= 0; i--) {\n\n      if (a[i]) {\n\n        if (!col[b[i]]) {\n\n          if (o[i])\n            ans += r - nr;\n\n          col[b[i]] = true;\n\n          nc++;\n        }\n\n      } else {\n\n        if (!row[b[i]]) {\n\n          if (o[i])\n            ans += c - nc;\n\n          row[b[i]] = true;\n\n          nr++;\n        }\n      }\n    }\n\n    printf(\"%lld\\n\", ans);\n  }\n}"}
{"fast_code_id":"e9e5a665347b3e40e03c16604b9f1e97a030eda18a9d7e7d98ef4290d0ee8239","fast_id":"bb9f7d7cc69e6f929d6a3588fb367e809868a5ed85953f98d16d7c4d7f976882","fast_time":0.1099624663,"language":"cpp","measured_fast_code_id":"bb9f7d7cc69e6f929d6a3588fb367e809868a5ed85953f98d16d7c4d7f976882","measured_slow_code_id":"3641bd9d7de768a64da26e807f0f21e8c0d7a7b7245de2ef02e11d6eed796784","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14379","problem_id":"p02610","slow_code_id":"fde7256fc7f4ea036faa2b948b74ea7df5abc88cda9850cb57b29fe43dfb0354","slow_id":"3641bd9d7de768a64da26e807f0f21e8c0d7a7b7245de2ef02e11d6eed796784","slow_time":0.2674188177,"speedup":2.4319099661736123,"stratum":"2-4","sampling_key":"63ad7f5de39218426684a51710db4c7a164f887e1cad50188baf587c11842b62","slow_code":"#pragma GCC optimize(\"O2\")\n\n#pragma GCC target(\"avx2\")\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <queue>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn;\n\ninline void putint(ll X) {\n\n  int keta = 0;\n\n  char C[20];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nint main() {\n\n  pair<int, int> LR[200000];\n\n  int T = getint();\n\n  rep(t, T) {\n\n    int N = getint();\n\n    if (N <= 2) {\n\n      int k = getint(), l = getint(), r = getint();\n\n      if (N == 1)\n        putint(l);\n\n      else if (k == 2) {\n\n        int k2 = getint(), l2 = getint(), r2 = getint();\n\n        if (k2 == 2)\n          putint(l + l2);\n\n        else\n          putint(l + max(l2, r2));\n\n      }\n\n      else {\n\n        int k2 = getint(), l2 = getint(), r2 = getint();\n\n        if (k2 == 2)\n          putint(l2 + max(l, r));\n\n        else\n          putint(max(l + r2, l2 + r));\n      }\n\n      continue;\n    }\n\n    ll saishou = 0;\n\n    int k1 = 0, k2 = N;\n\n    rep(i, N) {\n\n      int k = getint(), l = getint(), r = getint();\n\n      if (l < r) {\n\n        LR[--k2] = mp(k + 1, r - l);\n\n        saishou += l;\n\n      }\n\n      else {\n\n        LR[k1++] = mp(k, l - r);\n\n        saishou += r;\n      }\n    }\n\n    sort(LR, LR + k1);\n\n    sort(LR + k1, LR + N);\n\n    priority_queue<int> PQ;\n\n    int i = k1;\n\n    while (i < N && LR[i].first < k1) {\n\n      PQ.push(LR[i++].second);\n    }\n\n    for (int j = k1; j <= N; j++) {\n\n      while (i < N && LR[i].first <= j) {\n\n        PQ.push(LR[i++].second);\n      }\n\n      if (PQ.size()) {\n\n        auto q = PQ.top();\n\n        PQ.pop();\n\n        saishou += q;\n      }\n    }\n\n    PQ = priority_queue<int>();\n\n    i = k1 - 1;\n\n    while (i >= 0 && LR[i].first > k1) {\n\n      PQ.push(LR[i--].second);\n    }\n\n    for (int j = k1 - 1; j >= 0; j--) {\n\n      while (i >= 0 && LR[i].first > j) {\n\n        PQ.push(LR[i--].second);\n      }\n\n      if (PQ.size()) {\n\n        auto q = PQ.top();\n\n        PQ.pop();\n\n        saishou += q;\n      }\n    }\n\n    putint(saishou);\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O2\")\n\n#pragma GCC target(\"avx2\")\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <queue>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn;\n\ninline void putint2(int X) {\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\ninline void putint(ll X) {\n\n  int keta = 0;\n\n  char C[20];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nvoid pakuri_sort(int N, ll A[]) {\n\n  const int b = 8;\n\n  ll tmp[200001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n  }\n}\n\nint main() {\n\n  ll LR[200000];\n\n  int T = getint();\n\n  rep(t, T) {\n\n    int N = getint();\n\n    if (N <= 2) {\n\n      int k = getint(), l = getint(), r = getint();\n\n      if (N == 1)\n        putint2(l);\n\n      else if (k == 2) {\n\n        int k2 = getint(), l2 = getint(), r2 = getint();\n\n        if (k2 == 2)\n          putint2(l + l2);\n\n        else\n          putint2(l + max(l2, r2));\n\n      }\n\n      else {\n\n        int k2 = getint(), l2 = getint(), r2 = getint();\n\n        if (k2 == 2)\n          putint2(l2 + max(l, r));\n\n        else\n          putint2(max(l + r2, l2 + r));\n      }\n\n      continue;\n    }\n\n    ll saishou = 0;\n\n    int k1 = 0, k2 = N;\n\n    rep(i, N) {\n\n      ll k = getint(), l = getint(), r = getint();\n\n      if (l < r) {\n\n        LR[--k2] = (r - l << 32) + k + 1;\n\n        saishou += l;\n\n      }\n\n      else {\n\n        LR[k1++] = (l - r << 32) + k;\n\n        saishou += r;\n      }\n    }\n\n    pakuri_sort(k1, LR);\n\n    pakuri_sort(N - k1, LR + k1);\n\n    priority_queue<int> PQ;\n\n    int i = k1;\n\n    const ll ma = (1ll << 32) - 1;\n\n    while (i < N && (LR[i] & ma) < k1) {\n\n      PQ.push(LR[i++] >> 32);\n    }\n\n    for (int j = k1; j <= N; j++) {\n\n      while (i < N && (LR[i] & ma) <= j) {\n\n        PQ.push(LR[i++] >> 32);\n      }\n\n      if (PQ.size()) {\n\n        auto q = PQ.top();\n\n        PQ.pop();\n\n        saishou += q;\n      }\n    }\n\n    PQ = priority_queue<int>();\n\n    i = k1 - 1;\n\n    while (i >= 0 && (LR[i] & ma) > k1) {\n\n      PQ.push(LR[i--] >> 32);\n    }\n\n    for (int j = k1 - 1; j >= 0; j--) {\n\n      while (i >= 0 && (LR[i] & ma) > j) {\n\n        PQ.push(LR[i--] >> 32);\n      }\n\n      if (PQ.size()) {\n\n        auto q = PQ.top();\n\n        PQ.pop();\n\n        saishou += q;\n      }\n    }\n\n    putint(saishou);\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"ee57edc43630acdcb1c74b5ec9d049a050966a5cb03ef98fa75c79997a734f0e","fast_id":"7c7fb156ccaa605bdf0bbe577bd468846a6b9207d8efe09aee4fdb9942c4240d","fast_time":0.0121783568,"language":"cpp","measured_fast_code_id":"7c7fb156ccaa605bdf0bbe577bd468846a6b9207d8efe09aee4fdb9942c4240d","measured_slow_code_id":"cdc6cbc3e94d1918d65056898c82e672a42043dedf8d1a57264c84b14cd8bfba","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14387","problem_id":"p03189","slow_code_id":"8a4a0f4d41c4636bd55a64b1e3ec20a49849a8d8bd1a102295398537dda28f28","slow_id":"cdc6cbc3e94d1918d65056898c82e672a42043dedf8d1a57264c84b14cd8bfba","slow_time":0.0623582025,"speedup":5.1204118522787905,"stratum":"4-8","sampling_key":"205b1ca5838c2bcebae2b7a8f9f20943ba58185aa90f5124ed579b4feb9c69c6","slow_code":"#include <cmath>\n\n#include <cstdio>\n\n#include <iostream>\n\n#include <cstdlib>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <vector>\n\n#include <bitset>\n\n#define int long long\n\n#define lowbit(x) ((x) & (-x))\n\nusing namespace std;\n\nconst int maxn = 3005, mod = 1e9 + 7, niyuan = 5e8 + 4;\n\nint n, q, dp[maxn][maxn], a[maxn], ans;\n\ninline int read()\n\n{\n\n  int x = 0, f = 1;\n\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9')\n\n  {\n\n    if (ch == '-')\n\n      f = -1;\n\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9')\n\n  {\n\n    x = (x << 1) + (x << 3) + (ch ^ 48);\n\n    ch = getchar();\n  }\n\n  return x * f;\n}\n\ninline void write(int a)\n\n{\n\n  if (a < 0)\n\n  {\n\n    putchar('-');\n\n    putchar('1');\n\n  }\n\n  else\n\n  {\n\n    if (a >= 10)\n\n      write(a / 10);\n\n    putchar(a % 10 + '0');\n  }\n}\n\nsigned main()\n\n{\n\n  n = read(), q = read();\n\n  int tmp = 1;\n\n  for (int i = 1; i <= q; ++i)\n\n    tmp = tmp * 2 % mod;\n\n  for (int i = 1; i <= n; ++i)\n\n    a[i] = read();\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 1; j <= n; ++j)\n\n      dp[i][j] = tmp * (a[i] > a[j]);\n\n  while (q--)\n\n  {\n\n    int x = read(), y = read();\n\n    if (x > y)\n\n      swap(x, y);\n\n    int xi[maxn], yi[maxn], ix[maxn], iy[maxn];\n\n    for (int i = 1; i <= n; ++i)\n\n      xi[i] = dp[x][i], yi[i] = dp[y][i], ix[i] = dp[i][x], iy[i] = dp[i][y];\n\n    for (int i = 1; i <= n; ++i)\n\n      if (i != x && i != y)\n\n      {\n\n        dp[i][x] = ix[i] * niyuan % mod + iy[i] * niyuan % mod;\n\n        dp[i][y] = ix[i] * niyuan % mod + iy[i] * niyuan % mod;\n\n        dp[x][i] = xi[i] * niyuan % mod + yi[i] * niyuan % mod;\n\n        dp[y][i] = xi[i] * niyuan % mod + yi[i] * niyuan % mod;\n      }\n\n    dp[y][x] = dp[x][y] = xi[y] * niyuan % mod + yi[x] * niyuan % mod;\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = i + 1; j <= n; ++j)\n\n      ans = (ans + dp[i][j]) % mod;\n\n  write(ans);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\nconst int _ = 3e3 + 5, p = 1e9 + 7;\n\nint n, m, a[_], dp[_][_];\n\ninline int power(int x, int k) {\n\n  int res = 1;\n\n  for (; k; k >>= 1, x = 1ll * x * x % p)\n\n    if (k & 1)\n      res = 1ll * res * x % p;\n\n  return res % p;\n}\n\nint main() {\n\n  scanf(\"%d %d\", &n, &m);\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%d\", a + i);\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 1; j <= n; ++j)\n      dp[i][j] = a[i] < a[j];\n\n  int inv2 = power(2, p - 2);\n\n  for (int x, y, i = 1; i <= m; ++i) {\n\n    scanf(\"%d %d\", &x, &y);\n\n    dp[x][y] = dp[y][x] = 1ll * inv2 * ((dp[x][y] + dp[y][x]) % p) % p;\n\n    for (int j = 1; j <= n; ++j) {\n\n      if (j == x | j == y)\n        continue;\n\n      dp[x][j] = dp[y][j] = 1ll * inv2 * ((dp[x][j] + dp[y][j]) % p) % p;\n\n      dp[j][x] = dp[j][y] = 1ll * inv2 * ((dp[j][x] + dp[j][y]) % p) % p;\n    }\n  }\n\n  int ans = 0;\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 1; j < i; ++j)\n      ans = (ans + dp[i][j]) % p;\n\n  ans = 1ll * ans * power(2, m) % p;\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"eedcaf026fc61c84578933faaa078eb19384e53961981dfef5f87b4691ad4847","fast_id":"7a382e8975658c15ee2c0b5550fa8e7e51f143d3efe40806969b07b8e0dc6191","fast_time":0.016983244,"language":"cpp","measured_fast_code_id":"7a382e8975658c15ee2c0b5550fa8e7e51f143d3efe40806969b07b8e0dc6191","measured_slow_code_id":"deeb0bf967b2a771bff89c306f2b8acf33468653476fc8305412db4b9cfb58fd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14439","problem_id":"p03252","slow_code_id":"708a3fd2415428e4854cd732f560782f6c87c5a429d5a96e49ffc3583f913dcd","slow_id":"deeb0bf967b2a771bff89c306f2b8acf33468653476fc8305412db4b9cfb58fd","slow_time":0.132544559,"speedup":7.8044311793435925,"stratum":"4-8","sampling_key":"b5b4623e1065db00402fa03442a50526c48f6286a2b0e24085732f4165ee9f20","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 1e5 + 7;\n\nint num[maxn];\n\nint main()\n\n{\n\n  string stra;\n\n  string strb;\n\n  cin >> stra >> strb;\n\n  int len = stra.size();\n\n  memset(num, -1, sizeof(num));\n\n  for (int i = 0; i < len; i++)\n\n  {\n\n    if (num[stra[i]] == -1)\n\n    {\n\n      num[stra[i]] = strb[i];\n\n    }\n\n    else\n\n    {\n\n      if (num[stra[i]] != strb[i])\n\n      {\n\n        cout << \"No\" << endl;\n\n        return 0;\n      }\n    }\n  }\n\n  memset(num, -1, sizeof(num));\n\n  for (int i = 0; i < len; i++)\n\n  {\n\n    if (num[strb[i]] == -1)\n\n    {\n\n      num[strb[i]] = stra[i];\n\n    }\n\n    else\n\n    {\n\n      if (num[strb[i]] != stra[i])\n\n      {\n\n        cout << \"No\" << endl;\n\n        return 0;\n      }\n    }\n  }\n\n  cout << \"Yes\" << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 200000;\n\nint len;\n\nchar s[N + 5], t[N + 5];\n\nchar s1[255], t1[255];\n\nint main()\n\n{\n\n  scanf(\"%s %s\", s + 1, t + 1);\n\n  len = strlen(s + 1);\n\n  for (int i = 1; i <= len; i++)\n\n  {\n\n    if ((!s1[s[i]] || s1[s[i]] == t[i]) && (!t1[t[i]] || t1[t[i]] == s[i]))\n\n    {\n\n      s1[s[i]] = t[i];\n\n      t1[t[i]] = s[i];\n\n    }\n\n    else\n\n    {\n\n      puts(\"No\");\n\n      return 0;\n    }\n  }\n\n  puts(\"Yes\");\n\n  return 0;\n}"}
{"fast_code_id":"fc0ba0a44dfd22cd20f42ca44b179d577bae338ce2e4201bdedf79bc08d00eaa","fast_id":"84e5e7ac7b626e499a8efae136578424ccf4017396c1ca79d3363ced7dd664c4","fast_time":0.1045039315,"language":"cpp","measured_fast_code_id":"84e5e7ac7b626e499a8efae136578424ccf4017396c1ca79d3363ced7dd664c4","measured_slow_code_id":"70eb8ee7d8b1485ca8579b657fa3f1a4565d1c9edcf7b2e874f768a46fd483dd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14472","problem_id":"p03821","slow_code_id":"5608e8c361f1e75f0f3f851f2d857efbcc3067d021c619b1f23f6277eb99e0c7","slow_id":"70eb8ee7d8b1485ca8579b657fa3f1a4565d1c9edcf7b2e874f768a46fd483dd","slow_time":0.2760936112,"speedup":2.6419447310458364,"stratum":"2-4","sampling_key":"971b2308cb61cf0a683c41e9a95dc798c9163dadd826b1e3c6c149f98b1c886a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int mod, n, i, a[100001] = {0}, b[100001] = {0};\n\n  long long tim[100001] = {0};\n\n  long long mul, done = 0;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n\n    cin >> a[i] >> b[i];\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    mod = a[i] % b[i];\n\n    if (mod)\n\n      tim[i] = b[i] - mod;\n  }\n\n  for (i = n - 2; i >= 0; i--)\n\n  {\n\n    if (tim[i] >= tim[i + 1])\n\n      continue;\n\n    mul = (tim[i + 1] - tim[i]) / b[i];\n\n    tim[i] += mul * b[i];\n\n    if (tim[i] < tim[i + 1])\n\n      tim[i] += b[i];\n  }\n\n  done = tim[n - 1];\n\n  for (i = n - 2; i >= 0; i--)\n\n  {\n\n    done += (long long)(tim[i] - tim[i + 1]);\n  }\n\n  cout << done;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntemplate <class T1, class T2>\n\nostream &operator<<(ostream &os, pair<T1, T2> &p);\n\ntemplate <class T>\n\nostream &operator<<(ostream &os, vector<T> &v);\n\ntemplate <class T>\n\nostream &operator<<(ostream &os, set<T> &v);\n\n#define debug(a) cerr << #a << \" --> \" << (a) << endl;\n\n#define fastInput                                                                                  \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(0)\n\n#define INPUT freopen(\"input.txt\", \"r\", stdin)\n\n#define OUTPUT freopen(\"output.txt\", \"w\", stdout)\n\n#define ERROR 1e-9\n\n#define pi (2 * acos(0))\n\nconst ll mod = 998244353;\n\nconst int N = 2e5 + 5;\n\nvoid SOLVE(int cas)\n\n{\n\n  ll n;\n\n  scanf(\"%lld\", &n);\n\n  vector<pair<ll, ll> > pii(n);\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%lld %lld\", &pii[i].first, &pii[i].second);\n  }\n\n  ll now = 0;\n\n  for (ll i = n - 1; i >= 0; i--)\n\n  {\n\n    ll ff = pii[i].first + now;\n\n    ll ss = pii[i].second;\n\n    if (ff % ss == 0)\n\n      continue;\n\n    ll d = ff / ss;\n\n    d++;\n\n    now += ss * d - ff;\n  }\n\n  printf(\"%lld\\n\", now);\n}\n\nint main()\n\n{\n\n  int t = 1, cas = 0;\n\n  while (t--)\n\n  {\n\n    SOLVE(++cas);\n  }\n\n  return 0;\n}\n\ntemplate <class T1, class T2>\n\nostream &operator<<(ostream &os, pair<T1, T2> &p)\n\n{\n\n  os << \"{\" << p.first << \", \" << p.second << \"} \";\n\n  return os;\n}\n\ntemplate <class T>\n\nostream &operator<<(ostream &os, vector<T> &v)\n\n{\n\n  os << \"[ \";\n\n  for (int i = 0; i < v.size(); i++)\n\n  {\n\n    os << v[i] << \" \";\n  }\n\n  os << \" ]\";\n\n  return os;\n}\n\ntemplate <class T>\n\nostream &operator<<(ostream &os, set<T> &v)\n\n{\n\n  os << \"[ \";\n\n  for (T i : v)\n\n  {\n\n    os << i << \" \";\n  }\n\n  os << \" ]\";\n\n  return os;\n}\n"}
{"fast_code_id":"890488c4dbfebddc2ad4e788386b37bd531311ebbbbdc357942cbefdb947469b","fast_id":"26c75ba0fb0136c9c4bd65e82e42f64c71f829387d2c6d7f668555eed76b28f8","fast_time":0.0001923359,"language":"cpp","measured_fast_code_id":"26c75ba0fb0136c9c4bd65e82e42f64c71f829387d2c6d7f668555eed76b28f8","measured_slow_code_id":"3f836dc3dfeb22a09e6148a4abad11a964f40178d98efe702ed1e56c252ac80a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14515","problem_id":"p03311","slow_code_id":"506d8ba0e39e704432ab5802cf017ee402479852d4c001a780b54c9f631a6a80","slow_id":"3f836dc3dfeb22a09e6148a4abad11a964f40178d98efe702ed1e56c252ac80a","slow_time":0.0051998346,"speedup":27.035174400618917,"stratum":"8+","sampling_key":"b514fd5fb034bcdc7ebf1d3f45329880e0b3a2e80c1573f9c8665f5992924892","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#pragma warning(disable : 4996)\n\n#ifndef constexpr\n\n#define constexpr const\n\n#endif\n\nusing ll = long long;\n\nusing LL = ll;\n\nusing ull = unsigned long long;\n\nusing uLL = ull;\n\nusing pii = pair<int, int>;\n\n#define clean_0(A) memset((A), 0, sizeof(A))\n\n#define clean_1(A) memset((A), -1, sizeof(A))\n\nconstexpr int INF = 0x7F7F7F7F;\n\n#define clean_INF(A) memset((A), INF, sizeof(A))\n\n#define For(i, a, b) for (int(i) = (a); (i) <= b; ++(i))\n\nconstexpr double eps = 1e-9;\n\nconstexpr ll mod1 = 197;\n\nconstexpr ll mod2 = 19260817;\n\nconstexpr ll mod3 = ll(1e8) + 7;\n\nconstexpr ll mod4 = ll(1e9) + 7;\n;\n\nconstexpr ll mod5 = 998244353;\n\nconstexpr ll mod = mod4;\n\nconstexpr int maxn = int(1e6) + 1;\n\nconstexpr int MAXN = maxn;\n\n#ifdef Enable_IO\n\nnamespace io\n\n{\n\n#define in(a) (a = read())\n\n#define out(a) write(a)\n\n#define outn(a) (out(a), putchar('\\n'))\n\n#define I_int int\n\ninline I_int read() {\n\n  I_int x = 0, f = 1;\n  char c = getchar();\n\n  while (c < '0' || c > '9') {\n    if (c == '-')\n      f = -1;\n    c = getchar();\n  }\n\n  while (c >= '0' && c <= '9') {\n    x = x * 10 + c - '0';\n    c = getchar();\n  }\n\n  return x * f;\n}\n\ntemplate <typename T>\n\nbool scan_d(T &ret)\n\n{\n\n#define p(x) ((x) >= '0' && (x) <= '9')\n\n  int c;\n  int sgn;\n\n  if (c = getchar(), c == EOF)\n    return false;\n\n  while (c != '-' && !p(c))\n    c = getchar();\n\n  sgn = (c == '-') ? -1 : 1;\n\n  ret = (c == '-') ? 0 : c - '0';\n\n  while (c = getchar(), p(c))\n    ret = ret * 10 + c - '0';\n\n  ret *= sgn;\n\n  return true;\n\n#undef p\n}\n\nchar F[200];\n\ntemplate <typename T>\n\ninline void write(T x) {\n\n  if (x == 0) {\n    putchar('0');\n    return;\n  }\n\n  auto tmp = x > 0 ? x : -x;\n\n  if (x < 0)\n    putchar('-');\n\n  int sum = 0;\n\n  while (tmp > 0) {\n\n    F[sum++] = tmp % 10 + '0';\n\n    tmp /= 10;\n  }\n\n  while (sum > 0)\n    putchar(F[--sum]);\n}\n\nvoid read(char *s, int Arr[], size_t n)\n\n{\n\n  for (size_t i = 0; i < n; ++i)\n    Arr[i] = strtoll(s, &s, 10);\n}\n\n#undef I_int\n\n}                \n\nusing namespace io;\n\n#endif\n\n#ifdef Enable_MATH\n\ntemplate <typename T> constexpr T ModUp(const T &x, ll Mod = mod) { return (x % Mod + Mod) % Mod; }\n\ntemplate <typename T>\n\nconstexpr T exgcd(T a, T b, T &x, T &y)\n\n{\n\n  if (a == 0 && b == 0)\n    return -1;\n\n  if (b == 0) {\n    x = 1, y = 0;\n    return a;\n  }\n\n  T d = exgcd(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\ntemplate <typename T>\n\nconstexpr T inv1(T a, T Mod = mod)\n\n{\n\n  T x = -1, y = -1;\n\n  return exgcd(a, Mod, x, y) == 1 ? (x % Mod + Mod) % Mod : -1;\n}\n\ntemplate <typename T>\n\nconstexpr T _gcd(T a, T b)\n\n{\n\n  return b ? _gcd(b, a % b) : a;\n}\n\ntemplate <typename T>\n\nconstexpr T combinator(T n, T m, T Mod = mod - 1)\n\n{\n\n  m = min(m, n - m);\n\n  T ret = 1;\n\n  for (T i = 1; i <= m; ++i)\n\n  {\n\n    ret = ret * (n - m + i) / i % Mod;\n  }\n\n  return ret;\n}\n\ntemplate <typename T>\n\nconstexpr T poww(T a, T b, T Mod = mod)\n\n{\n\n  T ret = 1;\n\n  a %= Mod;\n\n  b %= Mod - 1;\n\n  if (b < 0)\n    b += Mod - 1;\n\n  while (b)\n\n  {\n\n    if (b & 1)\n      ret = ret * a % Mod;\n\n    a = a * a % Mod;\n\n    b >>= 1;\n  }\n\n  return ret;\n}\n\nconstexpr ll inv2(ll a, ll Mod = mod)\n\n{\n\n  return poww(a, Mod - 2, Mod);\n}\n\nstruct Combinator1\n\n{\n\n  static constexpr int Mod = ::mod;\n\n  static constexpr int Maxn = 1;\n\n  int dp[Maxn][Maxn];\n\n  constexpr Combinator1()\n      : dp()\n\n  {\n\n    for (int i = 0; i < Maxn; ++i)\n\n    {\n\n      for (int k = 0; k <= i; ++k)\n\n      {\n\n        if (k == 0)\n          dp[i][k] = 1;\n\n        else if (i == k)\n          dp[i][k] = 1;\n\n        else\n          dp[i][k] = (dp[i - 1][k] + dp[i - 1][k - 1]) % (Mod - 1);\n      }\n    }\n  }\n};\n\nstruct Combinator2\n\n{\n\n  static constexpr int Mod = ::mod;\n\n  static constexpr int Maxn = ::maxn;\n\n  ll Fact[Maxn], Inv_Fact[Maxn];\n\n  constexpr Combinator2(const int n = Maxn - 1)\n      : Fact(), Inv_Fact()\n\n  {\n\n    Fact[0] = 1;\n\n    for (int i = 1; i <= n; ++i)\n\n      Fact[i] = Fact[i - 1] * i % Mod;\n\n    Inv_Fact[0] = 1;\n\n    Inv_Fact[n] = inv2(Fact[n], Mod);\n\n    for (int i = n; i > 1; --i)\n\n      Inv_Fact[i - 1] = Inv_Fact[i] * i % Mod;\n  }\n\n  constexpr ll Comb(int a, int b) const\n\n  {\n\n    if (a < 0 || b < 0)\n      return 1;\n\n    return Fact[a] * Inv_Fact[b] % Mod * Inv_Fact[a - b] % Mod;\n  }\n};\n\n#endif\n\nint num[maxn];\n\nint main()\n\n{\n\n  int n;\n\n  while (cin >> n)\n\n  {\n\n    clean_0(num);\n\n    for (int i = 0; i < n; ++i)\n\n    {\n\n      cin >> num[i];\n\n      num[i] -= i + 1;\n    }\n\n    sort(num, num + n);\n\n    int b = num[n >> 1];\n\n    auto add = [&b](ll s, int x) { return s + abs(x - b); };\n\n    ll sum = accumulate(num, num + n, 0LL, add);\n\n    cout << sum << endl;\n  }\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cmath>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 2e5 + 7;\n\nint a[maxn];\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; ++i) {\n\n    scanf(\"%d\", &a[i]);\n\n    a[i] -= i;\n  }\n\n  sort(a + 1, a + 1 + n);\n\n  ll sum = 0;\n\n  for (int i = 1; i <= n; ++i) {\n\n    sum += abs(a[i] - a[(n + 1) / 2]);\n  }\n\n  printf(\"%lld\\n\", sum);\n}\n"}
{"fast_code_id":"202c76c4bced76ebacbf578c34394097b3de096655c17ccd9d410fb6b7ec687f","fast_id":"88cfe2fbf6d296a451b501bca4f2c3faf65192dcb4ab5465e62f5c24d8d18600","fast_time":0.0118638883,"language":"cpp","measured_fast_code_id":"88cfe2fbf6d296a451b501bca4f2c3faf65192dcb4ab5465e62f5c24d8d18600","measured_slow_code_id":"e08f50ccca0f518adf5bd7150c8214341bda9f429c7986225b25046407906d65","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14529","problem_id":"p03108","slow_code_id":"908526033da19b2659bcd2e22dfa4f55719df19601e9131e47c23d955f55bfdb","slow_id":"e08f50ccca0f518adf5bd7150c8214341bda9f429c7986225b25046407906d65","slow_time":0.1641891852,"speedup":13.839407540612129,"stratum":"8+","sampling_key":"3ed85a59aec7c34f71958a9c539fc2c7e878fea578dc2485672a3e661c82af9f","slow_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\n#define error(args...)                                                                             \\\n  {                                                                                                \\\n    string _s = #args;                                                                             \\\n    replace(_s.begin(), _s.end(), ',', ' ');                                                       \\\n    stringstream _ss(_s);                                                                          \\\n    istream_iterator<string> _it(_ss);                                                             \\\n    err(_it, args);                                                                                \\\n  }\n\n#define X real()\n\n#define Y imag()\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\ntemplate <class T>\nusing ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n\nusing ll = long long;\n\nusing point = complex<double>;\n\nvoid err(istream_iterator<string> it) { cerr << endl; }\n\ntemplate <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) {\n  cerr << *it << \" = \" << a << endl;\n  err(++it, args...);\n}\n\nconst double EPS = 1e-8;\n\nconst long long mod = 1e9 + 7;\n\nconst int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};\n\nconst int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};\n\nconst int N = 1e5 + 5;\n\nint n, m, u, v;\n\nvector<pair<int, int> > edgs;\n\nint par[N], rnk[N];\n\nvoid init() {\n\n  for (int i = 1; i < N; ++i)\n\n    par[i] = i, rnk[i] = 1;\n}\n\nint findpar(int u) { return par[u] = (u == par[u] ? u : findpar(par[u])); }\n\nlong long join(int u, int v) {\n\n  u = findpar(u);\n\n  v = findpar(v);\n\n  if (u == v)\n\n    return 0;\n\n  ll ret = rnk[u] * rnk[v];\n\n  if (rnk[u] < rnk[v])\n\n    swap(u, v);\n\n  par[v] = u;\n\n  rnk[u] += rnk[v];\n\n  return ret;\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(0);\n  cin.tie(0);\n  cout.tie(0);\n\n  cin >> n >> m;\n\n  for (int i = 0; i < m; ++i) {\n\n    cin >> u >> v;\n\n    edgs.push_back({u, v});\n  }\n\n  reverse(edgs.begin(), edgs.end());\n\n  init();\n\n  long long ans[N];\n\n  memset(ans, 0, sizeof ans);\n\n  ans[0] = (1ll * n * (n - 1) / 2);\n\n  for (int i = 0; i < m - 1; ++i) {\n\n    ll ret = join(edgs[i].first, edgs[i].second);\n\n    ans[i + 1] = ans[i] - ret;\n  }\n\n  for (int i = 0; i < m; ++i)\n\n    cout << ans[m - i - 1] << '\\n';\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#define N 100100\n\nusing namespace std;\n\nlong long f[N], k[N], ans[N], sum;\n\nint x[N], y[N];\n\nint get(int x)\n\n{\n\n  if (k[x] == x)\n    return x;\n\n  return k[x] = get(k[x]);\n}\n\nvoid ju(int x, int y)\n\n{\n\n  int tx = get(x);\n\n  int ty = get(y);\n\n  k[tx] = ty;\n\n  f[ty] += f[tx];\n}\n\nint main()\n\n{\n\n  int n, m, i;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (i = 1; i <= n; i++)\n    k[i] = i, f[i] = 1;\n\n  for (i = 1; i <= m; i++)\n\n  {\n\n    scanf(\"%d%d\", &x[i], &y[i]);\n  }\n\n  for (i = m; i >= 1; i = i - 1)\n\n  {\n\n    int tx = get(x[i]);\n\n    int ty = get(y[i]);\n\n    if (tx != ty)\n\n      sum = f[tx] * f[ty],\n\n      ju(x[i], y[i]),\n\n      ans[i] = ans[i + 1] + sum;\n\n    else\n      ans[i] = ans[i + 1];\n  }\n\n  for (i = 2; i <= m; i++)\n\n  {\n\n    printf(\"%lld\\n\", 1ll * (n - 1) * n / 2 - ans[i]);\n  }\n\n  printf(\"%lld\\n\", 1ll * (n - 1) * n / 2);\n}\n"}
{"fast_code_id":"4ac27c16abc3d1ddaddc0ade55134aaa9e64b22f865f554dfdc429864afd7624","fast_id":"c4121a35f4ce5f028f68ef1a97a345b7ad7dc3cface007d07fe51b9de68b42e9","fast_time":0.0196457867,"language":"cpp","measured_fast_code_id":"c4121a35f4ce5f028f68ef1a97a345b7ad7dc3cface007d07fe51b9de68b42e9","measured_slow_code_id":"f85a5f113f8be1827cda541745b36d732038d352223c0162013416763c00fbbd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1455","problem_id":"p02612","slow_code_id":"c4ed54fa5317da85c024ea7f4c30e4dc3d6876dbc146c16487c0754c02580980","slow_id":"f85a5f113f8be1827cda541745b36d732038d352223c0162013416763c00fbbd","slow_time":0.1035238253,"speedup":5.269517931801631,"stratum":"4-8","sampling_key":"1df0370651c5e8dc7715df74ebe3925893330211764423b625a0b2adfd1ba8b4","slow_code":"#include <cstdlib>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <stack>\n\nusing namespace std;\n\nint main(void)\n\n{\n\n  int N;\n\n  scanf(\"%d\", &N);\n\n  if (N % 1000 != 0)\n\n    printf(\"%d\", 1000 - (N % 1000));\n\n  else\n\n    printf(\"0\");\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  if (n % 1000 == 0)\n    printf(\"0\\n\");\n\n  else\n\n  {\n\n    int x = n / 1000 + 1;\n\n    x *= 1000;\n\n    printf(\"%d\\n\", x - n);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"787dc0c62b8f703599887d64df38da0ee312958aa837c1414b6a9b5eb0b21f8f","fast_id":"85d27d2519e27837b0edd46592ceb68713b483e5f83ffd4206fd6cf9c5b0b6c6","fast_time":0.0204144237,"language":"cpp","measured_fast_code_id":"85d27d2519e27837b0edd46592ceb68713b483e5f83ffd4206fd6cf9c5b0b6c6","measured_slow_code_id":"e2f387055fda0f53699600fdbb3262db9144fd7223561d907415216f7561c5c6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14581","problem_id":"p02960","slow_code_id":"6ca6cba84459a75de9fe360c3a8183eb0aecdcafcd7e27e7588994429f6c9522","slow_id":"e2f387055fda0f53699600fdbb3262db9144fd7223561d907415216f7561c5c6","slow_time":1.2919252918,"speedup":63.284925932050676,"stratum":"8+","sampling_key":"fa643fa1b836fdb1315b814608786ec90bacccbc10b33d33ef4b24ade9cdecb0","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define fix(f, n) std::fixed << std::setprecision(n) << f\n\n#define fast                                                                   \\\n  ios::sync_with_stdio(0);                                                     \\\n  cin.tie(0);                                                                  \\\n  cout.tie(0);\n\ntypedef long long int ll;\n\ntypedef unsigned long long int ull;\n\n#define vi vector<int>\n\n#define pii pair<int, int>\n\n#define vii vector<pii>\n\n#define max(a, b) ((a > b) ? a : b)\n\n#define min(a, b) ((a > b) ? b : a)\n\n#define max3(a, b, c) ((a > b) ? (a > c) ? a : c : (b > c) ? b : c)\n\n#define min3(a, b, c) ((a < b) ? (a < c) ? a : c : (b < c) ? b : c)\n\n#define REP(i, a, n) for (ll i = a; i < n; i++)\n\n#define pb push_back\n\n#define mp make_pair\n\nll dp[100000][13];\n\nstring a;\n\nll gs(int ind, int n, int sum) {\n\n  if (ind == n) {\n\n    return (sum % 13 == 5 ? 1 : 0);\n  }\n\n  if (dp[ind][sum % 13] != -1) {\n\n    return dp[ind][sum % 13] % 1000000007;\n  }\n\n  if (a[ind] != '?') {\n\n    return dp[ind][sum % 13] =\n               gs(ind + 1, n, ((sum * 10) + a[ind] - '0') % 13) % 1000000007;\n  }\n\n  ll res = 0;\n\n  for (int i = 0; i <= 9; i++) {\n\n    res += gs(ind + 1, n, ((sum * 10) + i) % 13);\n\n    res %= 1000000007;\n  }\n\n  return dp[ind][sum % 13] = res % 1000000007;\n}\n\nint main() {\n\n  fast;\n\n  int test = 1;\n\n  while (test--) {\n\n    cin >> a;\n\n    memset(dp, -1, sizeof dp);\n\n    cout << gs(0, a.length(), 0) << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#define N 13\n\n#define M 1000000007\n\n#define L 10\n\nchar s[111111];\n\nint g[N][L];\n\nint main()\n\n{\n\n  long long d[2][N] = {1};\n\n  int i, j, x, p0, p1;\n\n  for (i = x = 0; i < N; i++, x += L) {\n\n    for (j = 0; j < L; j++) {\n\n      g[i][j] = (x + j) % N;\n    }\n  }\n\n  scanf(\"%s\", s);\n\n  for (i = 0, p0 = 0, p1 = 1; s[i]; i++, p0 = !p0, p1 = !p1) {\n\n    if (s[i] != '?') {\n\n      x = s[i] - 48;\n\n      for (j = 0; j < N; j++) {\n\n        d[p1][g[j][x]] = d[p0][j];\n      }\n\n    }\n\n    else {\n\n      for (j = 0; j < N; j++)\n        d[p1][j] = 0;\n\n      for (x = 0; x < L; x++) {\n\n        for (j = 0; j < N; j++)\n          d[p1][g[j][x]] += d[p0][j];\n      }\n\n      for (j = 0; j < N; j++)\n        d[p1][j] %= M;\n    }\n  }\n\n  printf(\"%lld\\n\", d[p0][5]);\n\n  return 0;\n}"}
{"fast_code_id":"0b86d2acc4f0a495047085b6020766d1d3a2497376b5669003ceca3703e54e6e","fast_id":"ae383fa91706bfbc99669154fc146b40d5b4977031a7f9f36f1b068ca52292d4","fast_time":0.0696186969,"language":"cpp","measured_fast_code_id":"ae383fa91706bfbc99669154fc146b40d5b4977031a7f9f36f1b068ca52292d4","measured_slow_code_id":"e849a5d4d64a65e30bb4a75ba9e8a96ceef468b74cdca446fc1ea9d869740128","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14624","problem_id":"p03058","slow_code_id":"52353c947b68263e5bc9d6a556913a1b65702a34cf82f4fdca340e5034fd0a03","slow_id":"e849a5d4d64a65e30bb4a75ba9e8a96ceef468b74cdca446fc1ea9d869740128","slow_time":0.1426733277,"speedup":2.0493536083408075,"stratum":"2-4","sampling_key":"40eb089a9764f1dcac47c37bc56771a171a6cc8c001252b4d458797d4eeb3c32","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ri register int\n\nnamespace io {\n\nconst int SIZE = (1 << 21) + 1;\n\nchar ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55];\nint f, qr;\n\n#define gc()                                                                                       \\\n  (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)\n\ninline void flush() {\n\n  fwrite(obuf, 1, oS - obuf, stdout);\n\n  oS = obuf;\n}\n\ninline void putc(char x) {\n\n  *oS++ = x;\n\n  if (oS == oT)\n    flush();\n}\n\ntemplate <class I>\n\ninline void gi(I &x) {\n\n  for (f = 1, c = gc(); c < '0' || c > '9'; c = gc())\n    if (c == '-')\n      f = -1;\n\n  for (x = 0; c <= '9' && c >= '0'; c = gc())\n    x = (x << 1) + (x << 3) + (c & 15);\n  x *= f;\n}\n\ntemplate <class I>\n\ninline void print(I x) {\n\n  if (!x)\n    putc('0');\n  if (x < 0)\n    putc('-'), x = -x;\n\n  while (x)\n    qu[++qr] = x % 10 + '0', x /= 10;\n\n  while (qr)\n    putc(qu[qr--]);\n}\n\nstruct Flusher_ {\n  ~Flusher_() { flush(); }\n} io_flusher_;\n\n}                \n\nusing io ::gi;\n\nusing io ::putc;\n\nusing io ::print;\n\nconst int N = 2e3 + 5;\n\n#define bit bitset<N>\n\nstruct node {\n\n  int tot, head[N], nxt[N << 1], adj[N << 1], top[N], sz[N], f[N], dep[N], son[N];\n\n  bit p[N], q[N];\n\n  inline void addedge(ri x, ri y) {\n\n    nxt[++tot] = head[x];\n\n    adj[head[x] = tot] = y;\n  }\n\n  inline void dfs(ri x) {\n\n    sz[x] = 1;\n\n    p[x][x] = q[x][x] = 1;\n\n    for (ri y, i = head[x]; i; i = nxt[i])\n\n      if ((y = adj[i]) != f[x])\n\n        p[y] = p[x],\n\n        f[y] = x,\n\n        dep[y] = dep[x] + 1,\n\n        dfs(y),\n\n        q[x] |= q[y],\n\n        sz[x] += sz[y],\n\n        son[x] = sz[y] > sz[son[x]] ? y : son[x];\n  }\n\n  inline void dfs2(ri x, ri tp) {\n\n    top[x] = tp;\n\n    if (son[x])\n\n      dfs2(son[x], tp);\n\n    for (ri y, i = head[x]; i; i = nxt[i])\n\n      if ((y = adj[i]) != f[x] && y != son[x])\n\n        dfs2(y, y);\n  }\n\n  inline int lca(ri x, ri y) {\n\n    while (top[x] ^ top[y])\n\n      if (dep[top[x]] > dep[top[y]])\n\n        x = f[top[x]];\n\n      else\n\n        y = f[top[y]];\n\n    return dep[x] < dep[y] ? x : y;\n  }\n\n  inline int sec(ri x, ri y) {\n\n    while (top[x] ^ top[y]) {\n\n      if (f[top[y]] == x)\n        return top[y];\n\n      y = f[top[y]];\n    }\n\n    return son[x];\n  }\n\n  inline bit S(ri a, ri b) {\n\n    ri x = lca(a, b);\n\n    bit ans = p[a] ^ p[b];\n\n    ans[x] = 1;\n\n    if (x != b)\n\n      ans |= q[b];\n\n    else\n\n      ans |= ~q[sec(b, a)];\n\n    if (x != a)\n\n      ans |= q[a];\n\n    else\n\n      ans |= ~q[sec(a, b)];\n\n    return ans;\n  }\n\n} t;\n\n#define pii pair<int, int>\n\n#define fi first\n\n#define se second\n\n#define mp make_pair\n\npii qu[N * N];\n\nbit nG[N];\n\nint main() {\n\n  ri n, m, i, x, y, l, r;\n\n  l = 1;\n  r = 0;\n\n  gi(n);\n  gi(m);\n\n  for (i = 1; i ^ n; ++i)\n\n    gi(x), gi(y),\n\n        t.addedge(x, y),\n\n        t.addedge(y, x);\n\n  t.dfs(1);\n\n  t.dfs2(1, 1);\n\n  while (m--)\n\n    gi(x), gi(y),\n\n        nG[x][y] = nG[y][x] = 1,\n\n        qu[++r] = mp(x, y);\n\n  while (l <= r) {\n\n    x = qu[l].fi;\n\n    y = qu[l].se;\n\n    ++l;\n\n    bit now = (nG[x] ^ nG[y]) & t.S(x, y);\n\n    now[x] = now[y] = 0;\n\n    for (i = now._Find_first(); i != now.size(); i = now._Find_next(i))\n\n      if (!nG[x][i])\n\n        nG[x][i] = nG[i][x] = 1,\n\n        qu[++r] = mp(x, i);\n\n      else\n\n        nG[y][i] = nG[i][y] = 1,\n\n        qu[++r] = mp(y, i);\n  }\n\n  printf(\"%d\\n\", r);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ri register int\n\nnamespace io {\n\nconst int SIZE = (1 << 21) + 1;\n\nchar ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55];\nint f, qr;\n\n#define gc()                                                                                       \\\n  (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)\n\ninline void flush() {\n\n  fwrite(obuf, 1, oS - obuf, stdout);\n\n  oS = obuf;\n}\n\ninline void putc(char x) {\n\n  *oS++ = x;\n\n  if (oS == oT)\n    flush();\n}\n\ntemplate <class I>\n\ninline void gi(I &x) {\n\n  for (f = 1, c = gc(); c < '0' || c > '9'; c = gc())\n    if (c == '-')\n      f = -1;\n\n  for (x = 0; c <= '9' && c >= '0'; c = gc())\n    x = (x << 1) + (x << 3) + (c & 15);\n  x *= f;\n}\n\ntemplate <class I>\n\ninline void print(I x) {\n\n  if (!x)\n    putc('0');\n  if (x < 0)\n    putc('-'), x = -x;\n\n  while (x)\n    qu[++qr] = x % 10 + '0', x /= 10;\n\n  while (qr)\n    putc(qu[qr--]);\n}\n\nstruct Flusher_ {\n  ~Flusher_() { flush(); }\n} io_flusher_;\n\n}                \n\nusing io ::gi;\n\nusing io ::putc;\n\nusing io ::print;\n\nconst int N = 2005;\n\nint tot, head[N], nxt[N << 1], adj[N << 1], mark[N][N], fa[N][N];\n\ninline void addedge(ri x, ri y) {\n\n  nxt[++tot] = head[x];\n\n  adj[head[x] = tot] = y;\n}\n\ninline void predfs(ri u, ri x) {\n\n  for (ri y, i = head[x]; i; i = nxt[i])\n\n    if ((y = adj[i]) != fa[u][x])\n\n      fa[u][y] = x,\n\n      predfs(u, y);\n}\n\n#define pii pair<int, int>\n\n#define mp make_pair\n\n#define fi first\n\n#define se second\n\npii q[N * N];\n\nint r, ans;\n\ninline void dfs(ri u, ri v, ri x) {\n\n  mark[u][x] = v;\n\n  for (ri y, i = head[x]; i; i = nxt[i])\n\n    if ((y = adj[i]) != fa[u][x]) {\n\n      if (!mark[u][y])\n\n        dfs(u, v, y);\n\n      else\n\n        q[++r] = mp(v, mark[u][y]);\n    }\n}\n\ninline void calc(ri x, ri lst, ri u) {\n\n  if (mark[u][x] == x)\n\n    ++ans, u = x;\n\n  for (ri y, i = head[x]; i; i = nxt[i])\n\n    if ((y = adj[i]) != lst)\n\n      calc(y, x, u);\n}\n\nint main() {\n\n  ri n, m, i, x, y, l;\n\n  gi(n);\n  gi(m);\n\n  for (i = 1; i ^ n; ++i)\n\n    gi(x), gi(y),\n\n        addedge(x, y),\n\n        addedge(y, x);\n\n  for (i = 1; i <= n; ++i)\n\n    predfs(i, i);\n\n  l = 1;\n  r = 0;\n\n  while (m--)\n    gi(x), gi(y), q[++r] = mp(x, y);\n\n  while (l <= r) {\n\n    x = q[l].fi;\n\n    y = q[l].se;\n\n    ++l;\n\n    while (mark[x][y])\n      x = mark[x][y];\n\n    while (mark[y][x])\n      y = mark[y][x];\n\n    if (x == y)\n      continue;\n\n    dfs(x, y, y);\n\n    dfs(y, x, x);\n  }\n\n  for (x = 1; x <= n; ++x)\n\n    for (i = head[x]; i; i = nxt[i])\n\n      calc(adj[i], x, x);\n\n  ans >>= 1;\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"b1ca78506db33fe0b86d7e471fd8b41425d84eefd662d95c293b6f01ffd1a6e4","fast_id":"f0da23982d35cb94da52d7c3abf9ff7e74931435717114dc873bb52e97c44d84","fast_time":0.0639924454,"language":"cpp","measured_fast_code_id":"f0da23982d35cb94da52d7c3abf9ff7e74931435717114dc873bb52e97c44d84","measured_slow_code_id":"8ade31d02f557c270a52ce2e15d5cbf98fa1b906096ae85e407e676c6ff33f1c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14626","problem_id":"p02903","slow_code_id":"6570c0ca69927d9020751023047a89d062a9a1e96baf9aa716df50c4fbc0dc4f","slow_id":"8ade31d02f557c270a52ce2e15d5cbf98fa1b906096ae85e407e676c6ff33f1c","slow_time":0.3324339112,"speedup":5.1948930709249,"stratum":"4-8","sampling_key":"0ca39a1f494166022f462b239945abcebc07402d50b5b6b9361d6d2cc76ea8ad","slow_code":"#include <iostream>\n\n#include <cstring>\n\nusing namespace std;\n\nint arr[1005][1005];\n\nint main() {\n\n  int h, w, a, b;\n\n  cin >> h >> w >> a >> b;\n\n  memset(arr, 0, sizeof(arr));\n\n  if (b == 0) {\n\n    if (a == 0) {\n\n      for (int i = 1; i <= h; i++) {\n\n        for (int j = 1; j <= w; j++) {\n\n          if (j == w)\n\n            cout << \"1\" << endl;\n\n          else\n\n            cout << \"1\";\n        }\n      }\n\n    }\n\n    else {\n\n      for (int i = 1; i <= h; i++) {\n\n        for (int j = 1; j <= w; j++) {\n\n          if (j <= a)\n\n            arr[i][j] = 1;\n\n          if (j == w)\n\n            cout << arr[i][j] << endl;\n\n          else\n\n            cout << arr[i][j];\n        }\n      }\n    }\n\n  }\n\n  else if (a == 0) {\n\n    for (int i = 1; i <= h; i++) {\n\n      for (int j = 1; j <= w; j++) {\n\n        if (i <= b)\n\n          arr[i][j] = 1;\n\n        if (j == w)\n\n          cout << arr[i][j] << endl;\n\n        else\n\n          cout << arr[i][j];\n      }\n    }\n\n  }\n\n  else {\n\n    for (int i = 1; i <= h; i++) {\n\n      for (int j = 1; j <= w; j++) {\n\n        if (i <= b && j <= a)\n\n          arr[i][j] = 1;\n\n        else if ((i >= b + 1) && (j >= a + 1)) {\n\n          arr[i][j] = 1;\n        }\n\n        if (j == w)\n\n          cout << arr[i][j] << endl;\n\n        else\n\n          cout << arr[i][j];\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint h, w, a, b;\n\nstring s1, s2;\n\nint main() {\n\n  cin >> h >> w >> a >> b;\n\n  for (int i = 0; i < a; i++)\n    s1 += '1', s2 += '0';\n\n  for (int i = a; i < w; i++)\n    s1 += '0', s2 += '1';\n\n  for (int i = 0; i < b; i++)\n    cout << s1 << \"\\n\";\n\n  for (int i = b; i < h; i++)\n    cout << s2 << \"\\n\";\n}"}
{"fast_code_id":"a3c8f4eef24ca79b6e929c93ef590e5a7dbdfcdd67c8d6d091d19d7c47b80367","fast_id":"1609f5551611b85cc134dde786a5bb73f9d6303dc34ca6bc7d15984111184f0c","fast_time":0.0260724596,"language":"cpp","measured_fast_code_id":"1609f5551611b85cc134dde786a5bb73f9d6303dc34ca6bc7d15984111184f0c","measured_slow_code_id":"9b04314472a290ffb28fdbd62f95dc4dfd53d861f3f4a07b9039348cdd18fcc9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14644","problem_id":"p00887","slow_code_id":"0a4ea05763d18e8643d28b06f9b2ca6d0c843ec7ba0980fe3a204390318c2e53","slow_id":"9b04314472a290ffb28fdbd62f95dc4dfd53d861f3f4a07b9039348cdd18fcc9","slow_time":0.1974828707,"speedup":7.57438591255886,"stratum":"4-8","sampling_key":"35f5f0fbbe2c4183cfe517d53fea06c471193a989d54dc99411dc89ada581106","slow_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nint M, N, D, S[32][32], a[768][768];\n\nbool solve(int n) {\n\n  int h = 0;\n\n  rep(k, n) {\n\n    int ix = -1;\n\n    for (int i = h; i < n; i++)\n      if (a[i][k]) {\n        ix = i;\n        break;\n      }\n\n    if (ix == -1)\n      continue;\n\n    if (h != ix)\n      rep(i, n + 1) swap(a[h][i], a[ix][i]);\n\n    rep(i, n) if (i != h) if (a[i][k]) {\n\n      for (int j = k; j <= n; j++)\n        a[i][j] ^= a[h][j];\n    }\n\n    h++;\n  }\n\n  for (int i = h; i < n; i++)\n    if (a[i][n] == 1)\n      return false;\n\n  return true;\n}\n\nint main() {\n\n  for (;;) {\n\n    scanf(\"%d%d%d\", &M, &N, &D);\n\n    if (M == 0 && N == 0 && D == 0)\n      return 0;\n\n    rep(i, N) rep(j, M) scanf(\"%d\", S[i] + j);\n\n    memset(a, 0, sizeof(a));\n\n    const int n = N * M;\n\n    rep(i, N) rep(j, M) {\n\n      const int ix = i * M + j;\n\n      a[ix][ix] = 1;\n\n      a[ix][n] = S[i][j];\n\n      rep(x, N) rep(y, M) if (abs(i - x) + abs(j - y) == D) a[ix][x * M + y] =\n          1;\n    }\n\n    printf(\"%d\\n\", (int)solve(n));\n  }\n}","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <bitset>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nint M, N, D, S[32][32];\n\nbitset<640> bits[640];\n\nbool solve(int n) {\n\n  int h = 0;\n\n  rep(k, n) {\n\n    int ix = -1;\n\n    for (int i = h; i < n; i++)\n      if (bits[i][k]) {\n        ix = i;\n        break;\n      }\n\n    if (ix == -1)\n      continue;\n\n    if (h != ix)\n      swap(bits[h], bits[ix]);\n\n    rep(i, n) if (i != h) if (bits[i][k]) bits[i] ^= bits[h];\n\n    h++;\n  }\n\n  for (int i = h; i < n; i++)\n    if (bits[i][n])\n      return false;\n\n  return true;\n}\n\nint main() {\n\n  for (;;) {\n\n    scanf(\"%d%d%d\", &M, &N, &D);\n\n    if (M == 0 && N == 0 && D == 0)\n      return 0;\n\n    rep(i, N) rep(j, M) scanf(\"%d\", S[i] + j);\n\n    const int n = N * M;\n\n    rep(i, N) rep(j, M) {\n\n      const int ix = i * M + j;\n\n      bits[ix].reset();\n\n      bits[ix].set(ix);\n\n      if (S[i][j])\n        bits[ix].set(n);\n\n      rep(x, N) rep(y, M) if (abs(i - x) + abs(j - y) == D) bits[ix].set(x * M +\n                                                                         y);\n    }\n\n    printf(\"%d\\n\", (int)solve(n));\n  }\n}"}
{"fast_code_id":"7813eb30b462e24941d32b7faba0f8892e9b082f0eab2cd86525c106a95bfa43","fast_id":"6b6ddc02e7751f3bfb00dbc12a3a6821aec22c862ca9581495ea23e86b1bd02a","fast_time":0.0604636387,"language":"cpp","measured_fast_code_id":"6b6ddc02e7751f3bfb00dbc12a3a6821aec22c862ca9581495ea23e86b1bd02a","measured_slow_code_id":"9be82eb50c7935ff31cb68f8370a7732cef14fc06ededdf878930393189f46e0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14659","problem_id":"p02803","slow_code_id":"f8bb3c4fb3fccd0b3c89f769bed83693aa73192f6bcd2dcefbf53fbfef366f4a","slow_id":"9be82eb50c7935ff31cb68f8370a7732cef14fc06ededdf878930393189f46e0","slow_time":0.1381057043,"speedup":2.284111695381641,"stratum":"2-4","sampling_key":"b19290608ce4555d6aab4018b58e02a5cdb797bdd053aee84cf7a89abcf51db5","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nusing pll = pair<ll, ll>;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define rrep(i, m, n) for (ll i = m; i > n; i--)\n\n#define Rep(i, m, n) for (ll i = m; i < n; i++)\n\n#define all(vec) vec.begin(), vec.end()\n\n#define lmax(x, y) max<ll>(x, y)\n\n#define lmin(x, y) min<ll>(x, y)\n\n#define tmax(x, y, z) lmax((x), lmax((y), (z)))\n\n#define tmin(x, y, z) lmin((x), lmin((y), (z)))\n\n#define MINUS(a) memset(a, 0xff, sizeof(a))\n\n#define ZERO(a) memset(a, 0, sizeof(a))\n\nconst ll INF = 1LL << 60;\n\nconst ll MM = 1000000000;\nconst ll MOD = MM + 7;\nconst ll MMM = 9223372036854775807;\n\n#define ADD(a, b) a = (a + ll(b)) % MOD\n\n#define MUL(a, b) a = (a * ll(b)) % MOD\n\nll GCD(ll x, ll y) {\n  if (y == 0)\n    return x;\n  else\n    return GCD(y, x % y);\n}\n\nll LCM(ll x, ll y) { return x / GCD(x, y) * y; }\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <typename A, size_t N, typename T> void FILL(A (&array)[N], const T &val) {\n  fill((T *)array, (T *)(array + N), val);\n}\n\nll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nll ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nconst ll MAX_V = 400;\n\nll d[MAX_V][MAX_V];\n\nvoid warshall_floyd(ll V) { rep(k, V) rep(i, V) rep(j, V) chmin(d[i][j], d[i][k] + d[k][j]); }\n\nint main() {\n\n  ll h, w;\n  cin >> h >> w;\n\n  ll V = h * w;\n\n  vector<string> maze(h);\n\n  rep(i, h) cin >> maze[i];\n\n  FILL(d, INF);\n\n  rep(i, V) d[i][i] = 0;\n\n  rep(hi, h) {\n\n    rep(wi, w) {\n\n      if (maze[hi][wi] == '#')\n        continue;\n\n      rep(i, 4) {\n\n        ll nh = hi + dy[i], nw = wi + dx[i];\n\n        if (0 <= nh && nh < h && 0 <= nw && nw < w && maze[nh][nw] == '.')\n          d[hi * w + wi][nh * w + nw] = d[nh * w + nw][hi * w + wi] = 1;\n      }\n    }\n  }\n\n  warshall_floyd(V);\n\n  ll ans = -1;\n\n  rep(hi, h) {\n\n    rep(wi, w) {\n\n      if (maze[hi][wi] == '#')\n        continue;\n\n      ll cnt = -1;\n\n      rep(i, h) {\n\n        rep(j, w) {\n\n          if ((hi == i && wi == j) || maze[i][j] == '#')\n            continue;\n\n          chmax(cnt, d[hi * w + wi][i * w + j]);\n        }\n      }\n\n      chmax(ans, cnt);\n    }\n  }\n\n  cout << ans << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nusing pll = pair<ll, ll>;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define rrep(i, m, n) for (ll i = m; i > n; i--)\n\n#define Rep(i, m, n) for (ll i = m; i < n; i++)\n\n#define all(vec) vec.begin(), vec.end()\n\n#define lmax(x, y) max<ll>(x, y)\n\n#define lmin(x, y) min<ll>(x, y)\n\n#define tmax(x, y, z) lmax((x), lmax((y), (z)))\n\n#define tmin(x, y, z) lmin((x), lmin((y), (z)))\n\n#define MINUS(a) memset(a, 0xff, sizeof(a))\n\n#define ZERO(a) memset(a, 0, sizeof(a))\n\nconst ll INF = 1LL << 60;\n\nconst ll MM = 1000000000;\nconst ll MOD = MM + 7;\nconst ll MMM = 9223372036854775807;\n\n#define ADD(a, b) a = (a + ll(b)) % MOD\n\n#define MUL(a, b) a = (a * ll(b)) % MOD\n\nll GCD(ll x, ll y) {\n  if (y == 0)\n    return x;\n  else\n    return GCD(y, x % y);\n}\n\nll LCM(ll x, ll y) { return x / GCD(x, y) * y; }\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <typename A, size_t N, typename T> void FILL(A (&array)[N], const T &val) {\n  fill((T *)array, (T *)(array + N), val);\n}\n\nll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nll ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nint main() {\n\n  ll h, w;\n  cin >> h >> w;\n\n  vector<string> maze(h);\n\n  rep(i, h) cin >> maze[i];\n\n  ll ans = -1;\n\n  rep(sh, h) {\n\n    rep(sw, w) {\n\n      if (maze[sh][sw] == '#')\n        continue;\n\n      vector<vector<ll>> seen(h, vector<ll>(w, -1));\n\n      seen[sh][sw] = 0;\n\n      queue<pll> q;\n\n      q.push(pll(sh, sw));\n\n      while (!q.empty()) {\n\n        pll now = q.front();\n        q.pop();\n\n        rep(i, 4) {\n\n          ll nh = now.first + dy[i], nw = now.second + dx[i];\n\n          if (0 <= nh && nh < h && 0 <= nw && nw < w && maze[nh][nw] == '.' && seen[nh][nw] == -1)\n            seen[nh][nw] = seen[now.first][now.second] + 1, q.push(pll(nh, nw));\n        }\n      }\n\n      ll cnt = -1;\n\n      rep(hi, h) rep(wi, w) chmax(cnt, seen[hi][wi]);\n\n      chmax(ans, cnt);\n    }\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"dfbd59ccf18f1be401e590909313bca19b929e17ae35a426b10292d8fe4d866f","fast_id":"7add8e7d267c02fa091b0242d554e6db5bd70d150b193cc4ffcc08610c6f581d","fast_time":0.0167849373,"language":"cpp","measured_fast_code_id":"7add8e7d267c02fa091b0242d554e6db5bd70d150b193cc4ffcc08610c6f581d","measured_slow_code_id":"98aafb5dd1f8dd5202b49b4d6436a71ce5b7c2d770eab10bf81cfd62b8d8ace7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14669","problem_id":"p00462","slow_code_id":"89a38f82c5a6ef2cc7d4759e3bc1958a055b2ced565a8f8d3e26bb63c239deea","slow_id":"98aafb5dd1f8dd5202b49b4d6436a71ce5b7c2d770eab10bf81cfd62b8d8ace7","slow_time":0.0845951601,"speedup":5.039944957077677,"stratum":"4-8","sampling_key":"3623235a56fc0c36d7485b4c4b4af12a0d8cc055420b61d2dcd79e2131ffa6ce","slow_code":"#include <vector>\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <string>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n\n  int i, j;\n\n  int d, m, n, p;\n\n  int sm;\n\n  vector<int> a;\n\n  while (cin >> d && d) {\n\n    cin >> m >> n;\n\n    a.clear();\n\n    a.push_back(0);\n\n    for (i = 0; i < m - 1; i++) {\n\n      int c;\n\n      cin >> c;\n\n      a.push_back(c);\n    }\n\n    a.push_back(d);\n\n    sort(a.begin(), a.end());\n\n    sm = 0;\n\n    for (i = 0; i < n; i++) {\n\n      cin >> p;\n\n      for (j = 0;; j++) {\n\n        if (a[j] <= p && p < a[j + 1])\n\n          break;\n      }\n\n      sm += min(p - a[j], a[j + 1] - p);\n    }\n\n    cout << sm << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <algorithm>\n\n#include <cstdio>\n\nusing namespace std;\n\nint main() {\n\n  int i;\n\n  int d;\n\n  while (scanf(\"%d\", &d), d) {\n\n    int m, n;\n\n    scanf(\"%d%d\", &m, &n);\n\n    int a[100001];\n\n    a[0] = 0;\n\n    a[m] = d;\n\n    for (i = 1; i < m; ++i)\n\n      scanf(\"%d\", a + i);\n\n    sort(a, a + m + 1);\n\n    int sm = 0;\n\n    for (i = 0; i < n; ++i) {\n\n      int p, q;\n\n      scanf(\"%d\", &p);\n\n      q = upper_bound(a, a + m + 1, p) - a;\n\n      sm += min(p - a[q - 1], a[q] - p);\n    }\n\n    printf(\"%d\\n\", sm);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"4ba86ff8c41e67ed68230a739e7b095db5e7ccbf8c773dcd3e720b74782e8c3f","fast_id":"bd7ee31491712de8f8433ec9a4317511bae5b577090d6e3810f027ed0bcaf434","fast_time":0.0581399333,"language":"cpp","measured_fast_code_id":"bd7ee31491712de8f8433ec9a4317511bae5b577090d6e3810f027ed0bcaf434","measured_slow_code_id":"114b077a08e0d42ad1d77452febecf4ad406d0e5ef2ec27fb42d52d546b86146","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14693","problem_id":"p02351","slow_code_id":"d4ab0c2021ed952061d6e1e6145ef5ffc04ef4a61450fd57ec28bc0c93054fed","slow_id":"114b077a08e0d42ad1d77452febecf4ad406d0e5ef2ec27fb42d52d546b86146","slow_time":0.1793239148,"speedup":3.0843501982483357,"stratum":"2-4","sampling_key":"418256cba7ba58e0a5193f4366c7263648b7350bedd9266de5e0b0fa8af38fca","slow_code":"#include <bits/stdc++.h>\n\n#include <unordered_map>\n\nusing namespace std;\n\nusing ll = long long;\n\ntemplate <typename T>\n\nclass FenwickTree {\n\n  const ll n;\n\n  unordered_map<ll, T> data;\n\npublic:\n  FenwickTree(ll n_, int pmax = 1e5) : n(n_), data(pmax) {}\n\n  T find(ll p) {\n\n    T res = 0;\n\n    while (p >= 0) {\n\n      res += data[p];\n\n      p = (p & (p + 1)) - 1;\n    }\n\n    return res;\n  }\n\n  void add(ll p, T val) {\n\n    while (p < n) {\n\n      data[p] += val;\n\n      p |= p + 1;\n    }\n  }\n};\n\ntemplate <typename T>\n\nclass RARS {\n\n  const ll n;\n\n  FenwickTree<T> bit0, bit1;\n\npublic:\n  RARS(ll n_) : n(n_), bit0(n), bit1(n) {}\n\n  T find(ll p) { return bit1.find(p) * (p + 1) + bit0.find(p); }\n\n  T find(ll l, ll r) { return find(r) - find(l - 1); }\n\n  void add(ll l, ll r, T val) {\n\n    bit0.add(l, -val * l);\n\n    bit1.add(l, val);\n\n    bit0.add(r + 1, val * (r + 1));\n\n    bit1.add(r + 1, -val);\n  }\n};\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  int n, q;\n\n  cin >> n >> q;\n\n  RARS<ll> rars(n);\n\n  for (int i = 0, type, s, t, x; i < q; i++) {\n\n    cin >> type >> s >> t;\n    s--;\n    t--;\n\n    if (type) {\n\n      printf(\"%lld\\n\", rars.find(s, t));\n\n    }\n\n    else {\n\n      cin >> x;\n\n      rars.add(s, t, x);\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nstruct RS {\n\n  using type = ll;\n\n  static type id() { return 0; }\n\n  static type op(const type &l, const type &r) { return l + r; }\n};\n\nclass seg_node {\n\npublic:\n  using M = RS;\n\n  using T = typename M::type;\n\n  using U = ll;\n\n  T get() const { return val + lazy * size; }\n\n  void update(U v) { lazy += v; }\n\n  bool is_updated() const { return lazy; }\n\n  void push(seg_node &l, seg_node &r) {\n\n    if (lazy == 0)\n      return;\n\n    l.update(lazy);\n\n    r.update(lazy);\n\n    val = get();\n\n    lazy = 0;\n  }\n\n  void init(const seg_node &l, const seg_node &r) { size = l.size + r.size; }\n\n  void init(const T &v) { val = v; }\n\n  seg_node() : val(M::id()), size(1), lazy(0) {}\n\npublic:\n  T val;\n\nprivate:\n  int size;\n\n  U lazy;\n};\n\nclass segment_tree {\n\n  using M = typename seg_node::M;\n\n  using T = typename seg_node::T;\n\n  using U = typename seg_node::U;\n\n  const int h, n;\n\n  vector<seg_node> data;\n\n  void push(int node) { data[node].push(data[node << 1], data[(node << 1) | 1]); }\n\n  void update(int node) {\n\n    data[node].val = M::op(data[node << 1].get(), data[(node << 1) | 1].get());\n  }\n\npublic:\n  segment_tree(int n_)\n\n      : h(ceil(log2(n_))), n(1 << h), data(n * 2) {\n\n    init();\n  }\n\n  segment_tree(int n_, T v1)\n\n      : h(ceil(log2(n_))), n(1 << h), data(n * 2) {\n\n    for (int i = 0; i < n_; i++) {\n\n      data[i + n].init(v1);\n    }\n\n    init();\n  }\n\n  segment_tree(const vector<T> &data_)\n\n      : h(ceil(log2(data_.size()))), n(1 << h), data(n * 2) {\n\n    for (int i = 0; i < (int)data_.size(); i++) {\n\n      data[i + n].init(data_[i]);\n    }\n\n    init();\n  }\n\n  void init() {\n\n    for (int i = n - 1; i >= 1; i--) {\n\n      data[i].init(data[i << 1], data[(i << 1) | 1]);\n    }\n  }\n\n  void update(int l, int r, U val) {\n\n    l += n, r += n;\n\n    for (int i = h; i > 0; i--)\n      push(l >> i), push(r >> i);\n\n    int tl = l, tr = r;\n\n    r++;\n\n    while (l < r) {\n\n      if (l & 1)\n        data[l++].update(val);\n\n      if (r & 1)\n        data[--r].update(val);\n\n      l >>= 1;\n      r >>= 1;\n    }\n\n    while (tl >>= 1, tr >>= 1, tl) {\n\n      if (!data[tl].is_updated())\n        update(tl);\n\n      if (!data[tr].is_updated())\n        update(tr);\n    }\n  }\n\n  T find(int l, int r) {\n\n    l += n, r += n;\n\n    for (int i = h; i > 0; i--)\n      push(l >> i), push(r >> i);\n\n    r++;\n\n    T res1 = M::id(), res2 = M::id();\n\n    while (l < r) {\n\n      if (l & 1)\n        res1 = M::op(res1, data[l++].get());\n\n      if (r & 1)\n        res2 = M::op(data[--r].get(), res2);\n\n      l >>= 1;\n      r >>= 1;\n    }\n\n    return M::op(res1, res2);\n  }\n};\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  int n, q;\n\n  cin >> n >> q;\n\n  segment_tree st(n);\n\n  while (q--) {\n\n    int type, s, t;\n\n    cin >> type >> s >> t;\n    s--;\n    t--;\n\n    if (type) {\n\n      printf(\"%lld\\n\", st.find(s, t));\n\n    }\n\n    else {\n\n      int x;\n\n      cin >> x;\n\n      st.update(s, t, x);\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"c0e1095710b04e6c5266f36d4da8680c0e4923b18345cb0beb1994401939ad0e","fast_id":"91420a6ac9f6c40b2c51bc67346abf4ce2d0e38da7c736dafd1695c381369b75","fast_time":0.0077338272,"language":"cpp","measured_fast_code_id":"91420a6ac9f6c40b2c51bc67346abf4ce2d0e38da7c736dafd1695c381369b75","measured_slow_code_id":"7963c09cffd639596ce6e5a0da34b1fb2159a41e7cde2a71dedc1d57c6fb2a1c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14746","problem_id":"p00002","slow_code_id":"68246a9b84006cfbb86f04d780d8e4a00caab3ffa4b4d64106f3610465880083","slow_id":"7963c09cffd639596ce6e5a0da34b1fb2159a41e7cde2a71dedc1d57c6fb2a1c","slow_time":0.0406762854,"speedup":5.259528607000684,"stratum":"4-8","sampling_key":"438a08edb30c6f5e3708164b122fd0350b071be413f49d64752064af0020ddb1","slow_code":"#include <iostream>\n\n#include <cstdio>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int a, b, n, i, count;\n\n  while (2 == scanf(\"%d %d\", &a, &b))\n\n  {\n\n    n = a + b;\n\n    count = 0;\n\n    while (n != 0)\n\n    {\n\n      i = n % 10;\n\n      n /= 10;\n\n      count++;\n    }\n\n    cout << count << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\nint array[100];\n\nint counter(long long int a, long long int b);\n\nint main()\n\n{\n\n  long long int a, b;\n\n  int count;\n\n  while (scanf(\"%lld %lld\", &a, &b) == 2)\n\n  {\n\n    count = counter(a, b);\n\n    printf(\"%d\\n\", count);\n  }\n\n  return (0);\n}\n\nint counter(long long int a, long long int b)\n\n{\n\n  long long int number;\n\n  int x, count = 0;\n\n  number = a + b;\n\n  if (number == 0)\n\n  {\n\n    count = 1;\n\n    return (count);\n\n  }\n\n  else\n\n  {\n\n    while (number != 0)\n\n    {\n\n      count++;\n\n      number = number / 10;\n    }\n\n    return (count);\n  }\n}"}
{"fast_code_id":"f22d075a08bd335e51e51cfc175ce38c7ccb63267292d64810ce8ceec7b18819","fast_id":"55594b357c25b5668b183b18d51e154d1929457ad2f1805cbc0f1138957a9feb","fast_time":0.1051696097,"language":"cpp","measured_fast_code_id":"55594b357c25b5668b183b18d51e154d1929457ad2f1805cbc0f1138957a9feb","measured_slow_code_id":"0cf0312c551fb0628182169701fe96c027909cfa7a9cee95a5b58aff3a07f2b9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14761","problem_id":"p02376","slow_code_id":"fb0582174a1de8eca9eda28773a1bc8ba9e0e000c1961e4e93257635ea354a7b","slow_id":"0cf0312c551fb0628182169701fe96c027909cfa7a9cee95a5b58aff3a07f2b9","slow_time":0.381331427,"speedup":3.6258708964287427,"stratum":"2-4","sampling_key":"35848da8617d015fcdb0929c396539312075487721a34858ea105377f1f6cc14","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <set>\n\n#include <string>\n\n#include <cmath>\n\n#include <map>\n\n#include <cstring>\n\n#define REP(i, n) for (int i = 0; i < (n); i++)\n\n#define FOR(i, init, n) for (int i = init; i < (n); i++)\n\n#define ALL(obj) (obj).begin(), (obj).end()\n\n#define RALL(obj) (obj).rbegin(), (obj).rend()\n\n#define Cout(obj) cout << obj << endl\n\n#define Size(obj) (int)(obj).size()\n\n#define fcout cout << fixed << setprecision(10)\n\n#define fi first\n\n#define se second\n\nusing namespace std;\n\nusing ll = long long int;\n\nusing P = pair<int, int>;\n\nusing T = tuple<int, int, int>;\n\nusing edge = struct\n\n{\n\n  int to, cap, rev;\n};\n\nconst int MOD = 1e9 + 7;\n\nconst int iINF = 1e9;\n\nconst long long int llINF = 1e18;\n\nconst double PI = acos(-1.0);\n\nconst int dx[4] = {1, 0, -1, 0};\n\nconst int dy[4] = {0, 1, 0, -1};\n\nconst int MaxV = 100000;\n\nvector<edge> graph[MaxV];\n\nbool used[MaxV];\n\nvoid addEdge(int from, int to, int cap)\n\n{\n\n  graph[from].push_back({to, cap, Size(graph[to])});\n\n  graph[to].push_back({from, 0, Size(graph[from]) - 1});\n}\n\nint dfs(int v, int t, int f)\n\n{\n\n  if (v == t)\n    return f;\n\n  used[v] = true;\n\n  for (auto &e : graph[v])\n\n  {\n\n    if (!used[e.to] && e.cap > 0)\n\n    {\n\n      int d = dfs(e.to, t, min(f, e.cap));\n\n      if (d > 0)\n\n      {\n\n        e.cap -= d;\n\n        graph[e.to][e.rev].cap += d;\n\n        return d;\n      }\n    }\n  }\n\n  return 0;\n}\n\nint maxFlow(int s, int t)\n\n{\n\n  int flow = 0;\n\n  for (;;)\n\n  {\n\n    memset(used, false, sizeof(used));\n\n    int f = dfs(s, t, iINF);\n\n    if (f == 0)\n      return flow;\n\n    flow += f;\n  }\n}\n\nint main()\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int V, E;\n\n  cin >> V >> E;\n\n  REP(i, E)\n\n  {\n\n    int s, t, c;\n\n    cin >> s >> t >> c;\n\n    addEdge(s, t, c);\n  }\n\n  cout << maxFlow(0, V - 1) << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate <typename T>\n\nstruct Edge {\n\n  int rev, from, to;\n\n  T cap, icap;\n\n  Edge(int rev, int from, int to, T cap)\n\n      : rev(rev), from(from), to(to), cap(cap), icap(cap) {}\n};\n\ntemplate <typename T>\n\nstruct Graph {\n\n  vector<vector<Edge<T>>> list;\n\n  Graph(int n = 0) : list(n) {}\n\n  void init(int n = 0) {\n\n    list.clear();\n\n    list.resize(n);\n  }\n\n  inline vector<Edge<T>> &operator[](int i) { return list[i]; }\n\n  inline const size_t size() const { return list.size(); }\n\n  inline Edge<T> &redge(Edge<T> e) {\n\n    if (e.from != e.to)\n      return list[e.to][e.rev];\n\n    else\n      return list[e.to][e.rev + 1];\n  }\n\n  void addEdge(int from, int to, T cap) {\n\n    list[from].push_back(Edge<T>((int)list[to].size(), from, to, cap));\n\n    list[to].push_back(Edge<T>((int)list[from].size() - 1, to, from, 0));\n  }\n};\n\ntemplate <typename T>\n\nstruct Dinic {\n\n  const T INF = 1 << 30;\n\n  vector<int> level, iter;\n\n  Dinic() {}\n\n  void bfs(Graph<T> &graph, int s) {\n\n    level.assign((int)graph.size(), -1);\n\n    level[s] = 0;\n\n    queue<int> que;\n\n    que.push(s);\n\n    while (!que.empty()) {\n\n      int v = que.front();\n\n      que.pop();\n\n      for (int i = 0; i < graph[v].size(); i++) {\n\n        Edge<T> &e = graph[v][i];\n\n        if (level[e.to] < 0 && e.cap > 0) {\n\n          level[e.to] = level[v] + 1;\n\n          que.push(e.to);\n        }\n      }\n    }\n  }\n\n  T dfs(Graph<T> &graph, int v, int t, T f) {\n\n    if (v == t)\n      return f;\n\n    for (int &i = iter[v]; i < graph[v].size(); i++) {\n\n      Edge<T> &e = graph[v][i], &re = graph.redge(e);\n\n      if (level[v] < level[e.to] && e.cap > 0) {\n\n        T d = dfs(graph, e.to, t, min(f, e.cap));\n\n        if (d > 0) {\n\n          e.cap -= d;\n\n          re.cap += d;\n\n          return d;\n        }\n      }\n    }\n\n    return 0;\n  }\n\n  T solve(Graph<T> &graph, int s, int t) {\n\n    level.assign((int)graph.size(), -1);\n\n    iter.assign((int)graph.size(), 0);\n\n    T res = 0;\n\n    for (;;) {\n\n      bfs(graph, s);\n\n      if (level[t] < 0)\n        return res;\n\n      for (int i = 0; i < (int)iter.size(); i++)\n        iter[i] = 0;\n\n      T flow = 0;\n\n      while ((flow = dfs(graph, s, t, INF)) > 0) {\n\n        res += flow;\n      }\n    }\n  }\n};\n\nint main() {\n\n  int V, E;\n\n  cin >> V >> E;\n\n  Graph<int> graph(V);\n\n  for (int i = 0; i < E; i++) {\n\n    int u, v, c;\n\n    cin >> u >> v >> c;\n\n    graph.addEdge(u, v, c);\n  }\n\n  Dinic<int> dinic;\n\n  int s = 0, t = V - 1;\n\n  cout << dinic.solve(graph, s, t) << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"f1f7025382b20f5e3eb65a71dca7ca4b89318666b07be0b54ab1b80b9bde0bc2","fast_id":"cebf9e54ae8d4efa6b7d7bf81798b403f3e95caf25c64f1f4d5cba42cb560e95","fast_time":0.0309284175,"language":"cpp","measured_fast_code_id":"cebf9e54ae8d4efa6b7d7bf81798b403f3e95caf25c64f1f4d5cba42cb560e95","measured_slow_code_id":"da98281a146aac1aa533b82fdff6730beb5dec48ce09e4bae276ad7b00b58b11","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14797","problem_id":"p03806","slow_code_id":"6f15d8afb4be9c0785b63ec1b40c67af2915e65fab08270c98fe26256105108d","slow_id":"da98281a146aac1aa533b82fdff6730beb5dec48ce09e4bae276ad7b00b58b11","slow_time":0.0916109969,"speedup":2.962033117277986,"stratum":"2-4","sampling_key":"dc3f6d7f22cac2c3cbe5543db13727ace3a040885c9373b84358f66ec07d3c6a","slow_code":"#include <bits/stdc++.h>\n\n#define INF 1e9\n\nusing namespace std;\n\nsigned main()\n\n{\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int n, m1, m2;\n\n  cin >> n >> m1 >> m2;\n\n  vector<int> a(n), b(n), c(n);\n\n  for (int i = 0; i < n; i++)\n\n    cin >> a[i] >> b[i] >> c[i];\n\n  int dp[500][500], nxt[500][500];\n\n  for (int i = 0; i < 500; i++)\n\n  {\n\n    for (int j = 0; j < 500; j++)\n\n    {\n\n      dp[i][j] = INF;\n    }\n  }\n\n  dp[0][0] = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    for (int j = 0; j < 500; j++)\n\n    {\n\n      for (int k = 0; k < 500; k++)\n\n      {\n\n        nxt[j][k] = INF;\n      }\n    }\n\n    for (int j = 0; j < 500; j++)\n\n    {\n\n      for (int k = 0; k < 500; k++)\n\n      {\n\n        if (j - a[i] < 0 || k - b[i] < 0)\n\n          nxt[j][k] = dp[j][k];\n\n        else\n\n          nxt[j][k] = min(dp[j][k], dp[j - a[i]][k - b[i]] + c[i]);\n      }\n    }\n\n    for (int j = 0; j < 500; j++)\n\n    {\n\n      for (int k = 0; k < 500; k++)\n\n      {\n\n        dp[j][k] = nxt[j][k];\n      }\n    }\n  }\n\n  int ans = INF;\n\n  for (int i = 1; m1 * i < 500 && m2 * i < 500; i++)\n\n    ans = min(ans, dp[m1 * i][m2 * i]);\n\n  if (ans == INF)\n\n    ans = -1;\n\n  cout << ans << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define INF 1e18\n\n#define int long long\n\n#define Rep(i, a, n) for (int i = (a); i < (n); i++)\n\n#define rep(i, n) Rep(i, 0, n)\n\n#define all(a) (a).begin(), (a).end()\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\ntypedef pair<int, P> PP;\n\nconst int mod = 1000000007;\n\n#define MAX_N 41\n\n#define MAX_M 401\n\nint n, ma, mb;\n\nvector<int> a, b, c;\n\nint dp[MAX_N][MAX_M][MAX_M];\n\nbool vis[MAX_N][MAX_M][MAX_M];\n\nint solve(int N, int A, int B)\n\n{\n\n  if (vis[N][A][B])\n\n    return dp[N][A][B];\n\n  vis[N][A][B] = true;\n\n  if (N == n)\n\n  {\n\n    if (A != 0 && B != 0 && ma * B == A * mb)\n\n      return dp[N][A][B] = 0;\n\n    else\n\n      return dp[N][A][B] = INF;\n  }\n\n  return dp[N][A][B] = min(solve(N + 1, A, B), solve(N + 1, A + a[N], B + b[N]) + c[N]);\n}\n\nsigned main()\n\n{\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cin >> n >> ma >> mb;\n\n  a.resize(n), b.resize(n), c.resize(n);\n\n  rep(i, n) cin >> a[i] >> b[i] >> c[i];\n\n  int ans = solve(0, 0, 0);\n\n  if (ans >= INF)\n\n    ans = -1;\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"23e9f85964a733d53cc032118c88069199cb2eef81199465174debdb7d67f83b","fast_id":"c5e53082d2e50da24c8d3f888a2bccd2ceacdf306d51ce69f7f45ceca24ab982","fast_time":0.0121762229,"language":"cpp","measured_fast_code_id":"c5e53082d2e50da24c8d3f888a2bccd2ceacdf306d51ce69f7f45ceca24ab982","measured_slow_code_id":"436c4b47012904d5827d836df50cf62338e476d9c97f19d3ca7fd7ef53738eed","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14798","problem_id":"p00440","slow_code_id":"d3b1cabf709a37ef36daeea7b7618d5a61c7bc8c2a1fa384ea3e7adc04a1324d","slow_id":"436c4b47012904d5827d836df50cf62338e476d9c97f19d3ca7fd7ef53738eed","slow_time":0.112602796,"speedup":9.247760732106835,"stratum":"8+","sampling_key":"11c37946e22472760e2f1522a38dc22a1847702cbf0ce12053751816ddc1679d","slow_code":"#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\n#define rep1(i, x) for (int i = 1; i <= (x); ++i)\n\nint a[100001];\n\nint memo[100001];\n\nint start[100001];\n\nint main()\n\n{\n\n  int n, k;\n\n  while (scanf(\"%d %d\", &n, &k), n || k) {\n\n    memset(a, 0, sizeof(a));\n\n    memset(memo, 0, sizeof(memo));\n\n    memset(start, 0, sizeof(start));\n\n    bool f = false;\n\n    rep1(i, k) {\n\n      int tmp;\n      scanf(\"%d\", &tmp);\n\n      if (tmp == 0)\n        f = true;\n\n      else\n        a[tmp] = true;\n    }\n\n    rep1(i, n) {\n\n      if (a[i]) {\n\n        if (i - 1 >= 0 && a[i - 1]) {\n\n          start[i] = start[i - 1];\n\n          memo[start[i]]++;\n\n        } else {\n\n          start[i] = i;\n\n          memo[start[i]]++;\n        }\n      }\n    }\n\n    int ma = 0;\n\n    int now = -1;\n\n    rep1(i, n) {\n\n      if (a[i]) {\n\n        if (now == start[i])\n          continue;\n\n        if (ma < memo[start[i]]) {\n\n          ma = memo[start[i]];\n\n          now = start[i];\n        }\n\n      } else if (f) {\n\n        int v;\n\n        if (i + 1 <= n && a[i - 1] && a[i + 1]) {\n\n          v = memo[start[i - 1]] + memo[start[i + 1]] + 1;\n\n          if (ma < v) {\n\n            ma = v;\n\n            now = start[i + 1];\n          }\n\n        } else if (a[i - 1]) {\n\n          v = memo[start[i - 1]] + 1;\n\n          if (ma < v) {\n\n            ma = v;\n\n            now = start[i - 1];\n          }\n\n        } else if (i + 1 <= n && a[i + 1]) {\n\n          v = memo[start[i + 1]] + 1;\n\n          if (ma < v) {\n\n            ma = v;\n\n            now = start[i + 1];\n          }\n        }\n      }\n    }\n\n    printf(\"%d\\n\", ma);\n  }\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define rep1(i, x) for (int i = 1; i <= (x); ++i)\n\nint a[100001];\n\nint memo[100001];\n\nint start[100001];\n\nint main()\n\n{\n\n  int n, k;\n\n  while (scanf(\"%d %d\", &n, &k), n || k) {\n\n    fill(a, a + n, 0);\n\n    fill(memo, memo + n, 0);\n\n    fill(start, start + n, 0);\n\n    bool f = false;\n\n    rep1(i, k) {\n\n      int tmp;\n      scanf(\"%d\", &tmp);\n\n      if (tmp == 0)\n        f = true;\n\n      else\n        a[tmp] = true;\n    }\n\n    rep1(i, n) {\n\n      if (a[i]) {\n\n        if (a[i - 1]) {\n\n          start[i] = start[i - 1];\n\n          memo[start[i]]++;\n\n        } else {\n\n          start[i] = i;\n\n          memo[start[i]]++;\n        }\n      }\n    }\n\n    int ma = 0;\n\n    int now = -1;\n\n    rep1(i, n) {\n\n      int v, nnow;\n\n      if (a[i]) {\n\n        if (now == start[i])\n          continue;\n\n        v = memo[start[i]];\n\n        nnow = start[i];\n\n      } else if (f) {\n\n        if (i + 1 <= n) {\n\n          v = memo[start[i - 1]] + memo[start[i + 1]];\n\n          nnow = start[i + 1];\n\n        } else {\n\n          v = memo[start[i - 1]];\n\n          nnow = start[i - 1];\n        }\n\n        v++;\n      }\n\n      if (ma < v) {\n\n        ma = v;\n\n        now = nnow;\n      }\n    }\n\n    printf(\"%d\\n\", ma);\n  }\n}"}
{"fast_code_id":"850d7766569a13eb56dbeb816e9417b5556b91934e1fee9f6f3ed42ac3308e91","fast_id":"3094a04aa7068560e26b026294c6a5f9f8393942c71430f8df8eecaf5c088c39","fast_time":0.1114270497,"language":"cpp","measured_fast_code_id":"3094a04aa7068560e26b026294c6a5f9f8393942c71430f8df8eecaf5c088c39","measured_slow_code_id":"ba8118be99f75a3d1f93858c5f62bf8b87e2c2d861e69717ad41368ac134cae6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14812","problem_id":"p00694","slow_code_id":"a64f74ef34d4392e311d2010a85015d23c3709972282fac5a1df581e49506def","slow_id":"ba8118be99f75a3d1f93858c5f62bf8b87e2c2d861e69717ad41368ac134cae6","slow_time":0.2702541876,"speedup":2.425391216294583,"stratum":"2-4","sampling_key":"dd0266698b8ed5fa3819f033c7efea0560dafc6093a03f6aed46dbeb0ce8259e","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <set>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#define INF 1001\n\nusing namespace std;\n\nstruct point {\n\n  int x, y, z;\n\n  point() : x(0), y(0), z(0) {}\n\n  point(int x, int y, int z) : x(x), y(y), z(z) {}\n\n  bool operator==(const point &t) const {\n\n    if (x == t.x && y == t.y && z == t.z)\n\n      return true;\n\n    return false;\n  }\n\n  bool operator<(const point &t) const {\n\n    if (x < t.x) {\n\n      return true;\n\n    } else if (x == t.x) {\n\n      if (y < t.y) {\n\n        return true;\n\n      } else if (y == t.y) {\n\n        if (z < t.z) {\n\n          return true;\n        }\n      }\n    }\n\n    return false;\n  }\n\n  void rot90arndX() {\n\n    int tz = z;\n    z = -y;\n    y = tz;\n  }\n\n  void rot90arndY() {\n\n    int tz = z;\n    z = x;\n    x = -tz;\n  }\n\n  void rot90arndZ() {\n\n    int tx = x;\n    x = y;\n    y = -tx;\n  }\n\n  void set(int x, int y, int z) {\n\n    this->x = x;\n    this->y = y;\n    this->z = z;\n  }\n};\n\nostream &operator<<(ostream &os, const point &t) {\n\n  os << '(' << t.x << ',' << t.y << ',' << t.z << ')';\n\n  return os;\n}\n\nstruct strange_key {\n\n  vector<point> vp;\n\n  vector<point> vcube;\n\n  void rot90arndX() {\n\n    for (unsigned int i = 0; i < vp.size(); ++i) {\n\n      vp[i].rot90arndX();\n    }\n\n    for (unsigned int i = 0; i < vcube.size(); ++i) {\n\n      vcube[i].rot90arndX();\n    }\n  }\n\n  void rot90arndY() {\n\n    for (unsigned int i = 0; i < vp.size(); ++i) {\n\n      vp[i].rot90arndY();\n    }\n\n    for (unsigned int i = 0; i < vcube.size(); ++i) {\n\n      vcube[i].rot90arndY();\n    }\n  }\n\n  void rot90arndZ() {\n\n    for (unsigned int i = 0; i < vp.size(); ++i) {\n\n      vp[i].rot90arndZ();\n    }\n\n    for (unsigned int i = 0; i < vcube.size(); ++i) {\n\n      vcube[i].rot90arndZ();\n    }\n  }\n\n  void MoveToOrigin(int base) {\n\n    int dx = vcube[base].x;\n\n    int dy = vcube[base].y;\n\n    int dz = vcube[base].z;\n\n    for (unsigned int i = 0; i < vcube.size(); ++i) {\n\n      vcube[i].x -= dx;\n\n      vcube[i].y -= dy;\n\n      vcube[i].z -= dz;\n    }\n\n    for (unsigned int i = 0; i < vp.size(); ++i) {\n\n      vp[i].x -= dx;\n\n      vp[i].y -= dy;\n\n      vp[i].z -= dz;\n    }\n  }\n\n  bool Same(strange_key &t) {\n\n    if (vp.size() != t.vp.size())\n\n      return false;\n\n    for (int a = 0; a < 4; ++a) {\n\n      for (int b = 0; b < 4; ++b) {\n\n        for (int c = 0; c < 4; ++c) {\n\n          for (unsigned int l = 0; l < vcube.size(); ++l) {\n\n            this->MoveToOrigin(l);\n\n            for (unsigned int m = 0; m < vcube.size(); ++m) {\n\n              bool bSame = true;\n\n              t.MoveToOrigin(m);\n\n              sort(vp.begin(), vp.end());\n\n              sort(t.vp.begin(), t.vp.end());\n\n              for (unsigned int n = 0; n < vp.size(); ++n) {\n\n                if (!(vp[n] == t.vp[n])) {\n\n                  bSame = false;\n\n                  break;\n                }\n              }\n\n              if (bSame)\n\n                return true;\n            }\n          }\n\n          rot90arndX();\n        }\n\n        rot90arndY();\n      }\n\n      rot90arndZ();\n    }\n\n    return false;\n  }\n};\n\nvoid input_strange_key(istream &is, int n, strange_key &in) {\n\n  if (is) {\n\n    point now;\n\n    bool val[51] = {\n        false,\n    };\n\n    vector<point> pos_mem(51);\n\n    int minx = INF, maxx = -INF, miny = INF, maxy = -INF, minz = INF, maxz = -INF;\n\n    val[0] = true;\n\n    for (int i = 0; i < n; ++i) {\n\n      string s;\n\n      cin >> s;\n\n      if (s[0] != '+' && s[0] != '-') {\n\n        int mem = atoi(s.c_str());\n\n        if (val[mem]) {\n\n          now = pos_mem[mem];\n\n        } else {\n\n          pos_mem[mem] = now;\n\n          val[mem] = true;\n        }\n\n      } else {\n\n        int progress = (s[0] == '+' ? 2 : -2);\n\n        point next = now;\n\n        switch (s[1]) {\n\n        case 'x':\n\n          now.x += progress / 2;\n\n          in.vp.push_back(now);\n\n          now.x += progress / 2;\n\n          break;\n\n        case 'y':\n\n          now.y += progress / 2;\n\n          in.vp.push_back(now);\n\n          now.y += progress / 2;\n\n          break;\n\n        case 'z':\n\n          now.z += progress / 2;\n\n          in.vp.push_back(now);\n\n          now.z += progress / 2;\n\n          break;\n        }\n      }\n\n      minx = std::min(minx, now.x);\n      maxx = std::max(maxx, now.x);\n\n      miny = std::min(miny, now.y);\n      maxy = std::max(maxy, now.y);\n\n      minz = std::min(minz, now.z);\n      maxz = std::max(maxz, now.z);\n    }\n\n    in.vcube.push_back(point(minx, miny, minz));\n\n    in.vcube.push_back(point(minx, miny, maxz));\n\n    in.vcube.push_back(point(minx, maxy, minz));\n\n    in.vcube.push_back(point(minx, maxy, maxz));\n\n    in.vcube.push_back(point(maxx, miny, minz));\n\n    in.vcube.push_back(point(maxx, miny, maxz));\n\n    in.vcube.push_back(point(maxx, maxy, minz));\n\n    in.vcube.push_back(point(maxx, maxy, maxz));\n  }\n}\n\nostream &operator<<(ostream &os, const strange_key &t) {\n\n  os << \"Key Expression:\\n\";\n\n  for (unsigned int i = 0; i < t.vp.size(); ++i) {\n\n    if (i != 0)\n\n      os << ' ';\n\n    os << t.vp[i];\n  }\n\n  return os;\n}\n\nint main() {\n\n  while (true) {\n\n    int n1, n2;\n\n    strange_key a, b;\n\n    cin >> n1;\n\n    if (n1 == 0)\n\n      break;\n\n    input_strange_key(cin, n1, a);\n\n    cin >> n2;\n\n    input_strange_key(cin, n2, b);\n\n    if (a.Same(b))\n\n      cout << \"SAME\\n\";\n\n    else\n\n      cout << \"DIFFERENT\\n\";\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <set>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#define INF 1001\n\nusing namespace std;\n\nstruct point {\n\n  int x, y, z;\n\n  point() : x(0), y(0), z(0) {}\n\n  bool operator<(const point &t) const {\n\n    if (x < t.x) {\n\n      return true;\n\n    } else if (x == t.x) {\n\n      if (y < t.y) {\n\n        return true;\n\n      } else if (y == t.y) {\n\n        if (z < t.z) {\n\n          return true;\n        }\n      }\n    }\n\n    return false;\n  }\n\n  void rot90arndX() {\n    int tz = z;\n    z = -y;\n    y = tz;\n  }\n\n  void rot90arndY() {\n    int tz = z;\n    z = x;\n    x = -tz;\n  }\n\n  void rot90arndZ() {\n    int tx = x;\n    x = y;\n    y = -tx;\n  }\n};\n\nstruct strange_key {\n\n  vector<point> vp;\n\n  void rot90arndX() {\n\n    for (unsigned int i = 0; i < vp.size(); ++i) {\n\n      vp[i].rot90arndX();\n    }\n  }\n\n  void rot90arndY() {\n\n    for (unsigned int i = 0; i < vp.size(); ++i) {\n\n      vp[i].rot90arndY();\n    }\n  }\n\n  void rot90arndZ() {\n\n    for (unsigned int i = 0; i < vp.size(); ++i) {\n\n      vp[i].rot90arndZ();\n    }\n  }\n\n  bool Same(strange_key &t) {\n\n    if (vp.size() != t.vp.size())\n\n      return false;\n\n    for (int a = 0; a < 4; ++a) {\n\n      for (int b = 0; b < 4; ++b) {\n\n        for (int c = 0; c < 4; ++c) {\n\n          bool bSame = true;\n\n          sort(vp.begin(), vp.end());\n\n          sort(t.vp.begin(), t.vp.end());\n\n          int dx = vp[0].x - t.vp[0].x;\n\n          int dy = vp[0].y - t.vp[0].y;\n\n          int dz = vp[0].z - t.vp[0].z;\n\n          for (unsigned int l = 1; l < vp.size() && bSame; ++l) {\n\n            if (dx != vp[l].x - t.vp[l].x)\n\n              bSame = false;\n\n            if (dy != vp[l].y - t.vp[l].y)\n\n              bSame = false;\n\n            if (dz != vp[l].z - t.vp[l].z)\n\n              bSame = false;\n          }\n\n          if (bSame)\n\n            return true;\n\n          rot90arndX();\n        }\n\n        rot90arndY();\n      }\n\n      rot90arndZ();\n    }\n\n    return false;\n  }\n};\n\nvoid input_strange_key(istream &is, int n, strange_key &in) {\n\n  if (is) {\n\n    point now;\n\n    bool val[51] = {\n        false,\n    };\n\n    vector<point> pos_mem(51);\n\n    val[0] = true;\n\n    for (int i = 0; i < n; ++i) {\n\n      string s;\n\n      cin >> s;\n\n      if (s[0] != '+' && s[0] != '-') {\n\n        int mem = atoi(s.c_str());\n\n        if (val[mem]) {\n\n          now = pos_mem[mem];\n\n        } else {\n\n          pos_mem[mem] = now;\n\n          val[mem] = true;\n        }\n\n      } else {\n\n        int progress = (s[0] == '+' ? 2 : -2);\n\n        point next = now;\n\n        switch (s[1]) {\n\n        case 'x':\n\n          now.x += progress / 2;\n\n          in.vp.push_back(now);\n\n          now.x += progress / 2;\n\n          break;\n\n        case 'y':\n\n          now.y += progress / 2;\n\n          in.vp.push_back(now);\n\n          now.y += progress / 2;\n\n          break;\n\n        case 'z':\n\n          now.z += progress / 2;\n\n          in.vp.push_back(now);\n\n          now.z += progress / 2;\n\n          break;\n        }\n      }\n    }\n  }\n}\n\nint main() {\n\n  while (true) {\n\n    int n1, n2;\n\n    strange_key a, b;\n\n    cin >> n1;\n\n    if (n1 == 0)\n\n      break;\n\n    input_strange_key(cin, n1, a);\n\n    cin >> n2;\n\n    input_strange_key(cin, n2, b);\n\n    if (a.Same(b))\n\n      cout << \"SAME\\n\";\n\n    else\n\n      cout << \"DIFFERENT\\n\";\n  }\n\n  return 0;\n}"}
{"fast_code_id":"1032d7bcef404ad31ccfc8199884f0c0e61e9a6ac80d90b12f9d5f7c92fbc077","fast_id":"c2eb02163dea91ce5e0397b55909c059a9958d8cc0e4552d9b26fe4ce006bf80","fast_time":0.0023968756,"language":"cpp","measured_fast_code_id":"c2eb02163dea91ce5e0397b55909c059a9958d8cc0e4552d9b26fe4ce006bf80","measured_slow_code_id":"557c1e0a377d007bd5598a30b87a1025262f5184a7e13bc2b0bbf4414915a543","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14817","problem_id":"p03681","slow_code_id":"e96509a828be67397020c1c6d04e5ff281b49fe1a3572a78bcd7794134fa6a58","slow_id":"557c1e0a377d007bd5598a30b87a1025262f5184a7e13bc2b0bbf4414915a543","slow_time":0.0051975958,"speedup":2.1684879265323573,"stratum":"2-4","sampling_key":"fe05d31a1341b5a0f7ca40474c907914cca93fec0d5786914e424510fc5ad2e2","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <numeric>\n\n#include <cmath>\n\n#include <string>\n\n#include <vector>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <iomanip>\n\n#include <functional>\n\nusing namespace std;\n\n#define All(v) (v).begin(), (v).end()\n\nconst long long mod = 1000000007;\n\nconst long long inf = mod * mod;\n\nconst int MAXS = 500000;\n\nconst double EPS = 1e-10;\n\nconst double INF = 1e+10;\n\nconst double PI = acos(-1.0);\n\nlong long fact[MAXS];\n\nvoid makef() {\n\n  fact[0] = 1;\n\n  for (long long i = 1; i < MAXS - 1; i++) {\n\n    fact[i] = fact[i - 1] * i;\n\n    fact[i] %= mod;\n  }\n}\n\nsigned main() {\n\n  makef();\n\n  long long n, m;\n\n  cin >> n >> m;\n\n  if (abs(n - m) > 1) {\n\n    cout << 0 << endl;\n\n    return 0;\n  }\n\n  long long res = fact[n];\n\n  res *= fact[m];\n\n  res %= mod;\n\n  if (n == m) {\n\n    res *= 2;\n\n    res %= mod;\n  }\n\n  cout << res << endl;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <numeric>\n\n#include <cmath>\n\n#include <string>\n\n#include <vector>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <iomanip>\n\n#include <functional>\n\nusing namespace std;\n\n#define int long long\n\n#define All(v) (v).begin(), (v).end()\n\nint dy[8] = {-1, 0, 1, 0, -1, 1, 1, -1};\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod = 1000000007;\n\nconst int inf = mod * mod;\n\nconst int d5 = 100100;\n\ntemplate <int mod>\n\nstruct ModInt\n\n{\n\n  int x;\n\n  ModInt() : x(0) {}\n\n  ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n  ModInt &operator+=(const ModInt &p)\n\n  {\n\n    if ((x += p.x) >= mod)\n\n      x -= mod;\n\n    return *this;\n  }\n\n  ModInt &operator-=(const ModInt &p)\n\n  {\n\n    if ((x += mod - p.x) >= mod)\n\n      x -= mod;\n\n    return *this;\n  }\n\n  ModInt &operator*=(const ModInt &p)\n\n  {\n\n    x = (int)(1LL * x * p.x % mod);\n\n    return *this;\n  }\n\n  ModInt &operator/=(const ModInt &p)\n\n  {\n\n    *this *= p.inverse();\n\n    return *this;\n  }\n\n  ModInt operator-() const { return ModInt(-x); }\n\n  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\n  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\n  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\n  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\n  bool operator==(const ModInt &p) const { return x == p.x; }\n\n  bool operator!=(const ModInt &p) const { return x != p.x; }\n\n  ModInt inverse() const\n\n  {\n\n    int a = x, b = mod, u = 1, v = 0, t;\n\n    while (b > 0)\n\n    {\n\n      t = a / b;\n\n      a -= t * b;\n\n      swap(a, b);\n\n      u -= t * v;\n\n      swap(u, v);\n    }\n\n    return ModInt(u);\n  }\n\n  ModInt pow(int e)\n\n  {\n\n    long long a = 1, p = x;\n\n    while (e > 0)\n\n    {\n\n      if (e % 2 == 0)\n\n      {\n\n        p = (p * p) % mod;\n\n        e /= 2;\n\n      }\n\n      else\n\n      {\n\n        a = (a * p) % mod;\n\n        e--;\n      }\n    }\n\n    return ModInt(a);\n  }\n\n  friend ostream &operator<<(ostream &os, const ModInt<mod> &p)\n\n  {\n\n    return os << p.x;\n  }\n\n  friend istream &operator>>(istream &is, ModInt<mod> &a)\n\n  {\n\n    long long x;\n\n    is >> x;\n\n    a = ModInt<mod>(x);\n\n    return (is);\n  }\n};\n\nusing modint = ModInt<mod>;\n\nmodint f[d5];\n\nvoid makef()\n\n{\n\n  f[0] = 1;\n\n  for (int i = 1; i < d5; i++)\n\n    f[i] = f[i - 1] * i;\n}\n\nmodint nCr(int n, int r)\n\n{\n\n  if (n < r || r < 0)\n\n    return 0;\n\n  return f[n] / (f[r] * f[n - r]);\n}\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  makef();\n\n  int a, b;\n\n  cin >> a >> b;\n\n  if (abs(a - b) > 1) {\n\n    cout << 0 << endl;\n\n  }\n\n  else {\n\n    modint res = 1;\n\n    res *= f[min(a, b)];\n\n    res *= f[max(a, b)];\n\n    if (a == b)\n\n      res *= 2;\n\n    cout << res << endl;\n  }\n}"}
{"fast_code_id":"f205a93704715a34876e71bed9bf700a0d211ac94e21d6eb681324c831bace72","fast_id":"79e97b7c0ecf2ceb1b99b0c504660cd37384cc4231d2d1af9e404acd35a4fa82","fast_time":0.1016659956,"language":"cpp","measured_fast_code_id":"79e97b7c0ecf2ceb1b99b0c504660cd37384cc4231d2d1af9e404acd35a4fa82","measured_slow_code_id":"081c6d912148777e4029cc78a61299282c4fe5fee747b1c35a5d3cb2b1573d24","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_14822","problem_id":"p00472","slow_code_id":"18bfc3d8b7f7730f5f0f6f46f5f66c989d50a8c6fabd27f5b223ec9bf4a05193","slow_id":"081c6d912148777e4029cc78a61299282c4fe5fee747b1c35a5d3cb2b1573d24","slow_time":0.294794381,"speedup":2.8996360017940943,"stratum":"2-4","sampling_key":"99bd6f94f599375c5bd3c99e78b9b115d0c665a760baee66e9e1efce3b3eb73b","slow_code":"#include <iostream>\n\n#define MAX 100500\n\nusing namespace std;\n\nint main(void) {\n\n  int n, m;\n\n  long long int N, M[MAX], d[MAX];\n\n  while (cin >> n) {\n\n    cin >> m;\n\n    for (int i = 0; i < MAX; i++) {\n\n      M[i] = 0;\n\n      d[i] = 0;\n    }\n\n    d[0] = 0;\n\n    for (int i = 1; i < n; i++) {\n\n      cin >> N;\n\n      d[i] += d[i - 1] + N;\n    }\n\n    for (int i = 0; i < m; i++)\n      cin >> M[i];\n\n    long long int sum = 0, now = 0;\n\n    for (int i = 0; i < m; i++) {\n\n      if (M[i] >= 0) {\n\n        sum += d[now + M[i]] - d[now];\n\n      }\n\n      else {\n\n        sum += d[now] - d[now + M[i]];\n      }\n\n      now = now + M[i];\n    }\n\n    cout << sum % 100000 << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\nusing namespace std;\n\nint shu[100000];\n\nlong long co[100001];\n\nint main() {\n\n  int n, m;\n\n  cin >> n >> m;\n\n  for (int i = 0; i < n - 1; i++)\n    cin >> shu[i];\n\n  for (int i = 0; i <= n; i++)\n    co[i] = 0;\n\n  int ima = 0;\n\n  for (int i = 0; i < m; i++) {\n\n    int s, e;\n\n    int a;\n\n    cin >> a;\n\n    s = min(ima + a, ima);\n\n    e = max(ima + a, ima);\n\n    co[s]++;\n\n    co[e]--;\n\n    ima += a;\n  }\n\n  for (int i = 1; i < n; i++)\n    co[i] += co[i - 1];\n\n  long long sumco = 0;\n\n  for (int i = 0; i < n - 1; i++)\n    sumco += co[i] * shu[i], sumco %= 100000;\n\n  cout << sumco << endl;\n\n  return 0;\n}"}
{"fast_code_id":"03d9e508a8fb38a4ef86375c6f8f2533541433cad92560e78e2baa62e5295d28","fast_id":"e2447b7718137f49de1068eaed1c170b265dcbda90ba8195141305b4d6ac9d1b","fast_time":0.1094146084,"language":"cpp","measured_fast_code_id":"e2447b7718137f49de1068eaed1c170b265dcbda90ba8195141305b4d6ac9d1b","measured_slow_code_id":"fe5b6eef7848a02057718a87bbc40dde248d156a8ce09dbc182d74543a8bb9df","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1499","problem_id":"p02303","slow_code_id":"7b928ac10fadc78423ea2c8e7b8af85a743ae2106678fa1636b32eb05900828a","slow_id":"fe5b6eef7848a02057718a87bbc40dde248d156a8ce09dbc182d74543a8bb9df","slow_time":0.2802474578,"speedup":2.561334924998918,"stratum":"2-4","sampling_key":"987edb2949b8162951ddedfe334ddbf46570286195915520b98f4393506e69b5","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define INF 1000000005\n\n#define MOD 1000000007\n\n#define EPS 1e-10\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\nusing namespace std;\n\ntypedef complex<double> C;\n\nnamespace std\n\n{\n\nbool operator<(const C &a, const C &b) {\n\n  return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\n\n}                 \n\nstruct L : public vector<C>\n\n{\n\n  L(const C &a, const C &b) {\n\n    push_back(a);\n    push_back(b);\n  }\n};\n\ndouble cross(const C &a, const C &b)\n\n{\n\n  return imag(conj(a) * b);\n}\n\ndouble dot(const C &a, const C &b)\n\n{\n\n  return real(conj(a) * b);\n}\n\nint ccw(C a, C b, C c)\n\n{\n\n  b -= a;\n  c -= a;\n\n  if (cross(b, c) > 0)\n    return +1;\n\n  if (cross(b, c) < 0)\n    return -1;\n\n  if (dot(b, c) < 0)\n    return +2;\n\n  if (norm(b) < norm(c))\n    return -2;\n\n  return 0;\n}\n\nbool intersectLL(const L &l, const L &m)\n\n{\n\n  return abs(cross(l[1] - l[0], m[1] - m[0])) > EPS || abs(cross(l[1] - l[0], m[0] - l[0])) < EPS;\n}\n\nbool intersectLS(const L &l, const L &s)\n\n{\n\n  return cross(l[1] - l[0], s[0] - l[0]) * cross(l[1] - l[0], s[1] - l[0]) < EPS;\n}\n\nbool intersectLP(const L &l, const C &p)\n\n{\n\n  return abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\n\nbool intersectSS(const L &s, const L &t)\n\n{\n\n  return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n         ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\n\nbool intersectSP(const L &s, const C &p)\n\n{\n\n  return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS;\n}\n\nC projection(const L &l, const C &p)\n\n{\n\n  double t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\n  return l[0] + t * (l[0] - l[1]);\n}\n\nC reflection(const L &l, const C &p)\n\n{\n\n  return p + (projection(l, p) - p) * 2.0;\n}\n\ndouble distanceLP(const L &l, const C &p)\n\n{\n\n  return abs(p - projection(l, p));\n}\n\ndouble distanceLL(const L &l, const L &m)\n\n{\n\n  return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\n\ndouble distanceLS(const L &l, const L &s)\n\n{\n\n  if (intersectLS(l, s))\n    return 0;\n\n  return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\n\ndouble distanceSP(const L &s, const C &p)\n\n{\n\n  const C r = projection(s, p);\n\n  if (intersectSP(s, r))\n    return abs(r - p);\n\n  return min(abs(s[0] - p), abs(s[1] - p));\n}\n\ndouble distanceSS(const L &s, const L &t)\n\n{\n\n  if (intersectSS(s, t))\n    return 0;\n\n  return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n             min(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\n\nC crosspoint(const L &l, const L &m)\n\n{\n\n  double A = cross(l[1] - l[0], m[1] - m[0]);\n\n  double B = cross(l[1] - l[0], l[1] - m[0]);\n\n  if (abs(A) < EPS && abs(B) < EPS) {\n\n    return m[0];\n  }\n\n  return m[0] + B / A * (m[1] - m[0]);\n}\n\nL crosspointSS(C &p1, int r1, C &p2, int r2)\n\n{\n\n  double d = norm(p2 - p1);\n\n  double t = r2 * r2 - r1 * r1 - d;\n\n  double aa = d, bb = t * (real(p2) - real(p1)),\n         cc = t * t / 4.0 - (imag(p2) - imag(p1)) * (imag(p2) - imag(p1)) * r1 * r1;\n\n  double x1 = (-bb - sqrt(bb * bb - 4 * aa * cc)) / (2 * aa),\n         x2 = (-bb + sqrt(bb * bb - 4 * aa * cc)) / (2 * aa);\n\n  double y1, y2;\n\n  if (imag(p1) == imag(p2)) {\n\n    y1 = -sqrt(r1 * r1 - x1 * x1);\n\n    y2 = -y1;\n\n  } else {\n\n    y1 = (t + 2 * (real(p2) - real(p1)) * x1) / (-2 * (imag(p2) - imag(p1)));\n\n    y2 = (t + 2 * (real(p2) - real(p1)) * x2) / (-2 * (imag(p2) - imag(p1)));\n  }\n\n  L ln = L(C(x1 + real(p1), y1 + imag(p1)), C(x2 + real(p1), y2 + imag(p1)));\n\n  return ln;\n}\n\nvector<C> convex_hull(vector<C> ps)\n\n{\n\n  int n = ps.size(), k = 0;\n\n  sort(ps.begin(), ps.end());\n\n  vector<C> ch(2 * n);\n\n  for (int i = 0; i < n; ch[k++] = ps[i++]) {\n\n    while (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0)\n      k--;\n  }\n\n  for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) {\n\n    while (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0)\n      k--;\n  }\n\n  ch.resize(k - 1);\n\n  return ch;\n}\n\nbool isconvex(const vector<C> &ps)\n\n{\n\n  rep(i, ps.size()) {\n\n    if (ccw(ps[(i + ps.size() - 1) % ps.size()], ps[i], ps[(i + 1) % ps.size()]))\n      return false;\n  }\n\n  return true;\n}\n\ndouble area(const vector<C> &ps)\n\n{\n\n  double A = 0;\n\n  rep(i, ps.size()) { A += cross(ps[i], ps[(i + 1) % ps.size()]); }\n\n  return A / 2.0;\n}\n\nvector<C> convex_cut(const vector<C> &ps, const L &l)\n\n{\n\n  vector<C> Q;\n\n  rep(i, ps.size()) {\n\n    C A = ps[i], B = ps[(i + 1) % ps.size()];\n\n    if (ccw(l[0], l[1], A) != -1)\n      Q.push_back(A);\n\n    if (ccw(l[0], l[1], A) * ccw(l[0], l[1], B) < 0)\n\n      Q.push_back(crosspoint(L(A, B), l));\n  }\n\n  return Q;\n}\n\nint contains(const vector<C> &ps, const C &p)\n\n{\n\n  bool flag = false;\n\n  rep(i, ps.size()) {\n\n    C a = ps[i] - p, b = ps[(i + 1) % ps.size()] - p;\n\n    if (imag(a) > imag(b))\n      swap(a, b);\n\n    if (imag(a) <= 0 && 0 < imag(b)) {\n\n      if (cross(a, b) < 0)\n        flag = !flag;\n    }\n\n    if (cross(a, b) == 0 && dot(a, b) <= 0)\n      return 1;\n  }\n\n  return flag ? 2 : 0;\n}\n\ndouble convex_diameter(const vector<C> &ps)\n\n{\n\n  const int n = ps.size();\n\n  int is = 0, js = 0;\n\n  for (int i = 1; i < n; ++i) {\n\n    if (imag(ps[i]) > imag(ps[is]))\n      is = i;\n\n    if (imag(ps[i]) < imag(ps[js]))\n      js = i;\n  }\n\n  double maxd = abs(ps[is] - ps[js]);\n\n  int i, maxi, j, maxj;\n\n  i = maxi = is;\n\n  j = maxj = js;\n\n  do {\n\n    if (cross(ps[(i + 1) % ps.size()] - ps[i], ps[(j + 1) % ps.size()] - ps[j]) >= 0)\n      j = (j + 1) % n;\n\n    else\n      i = (i + 1) % n;\n\n    if (abs(ps[i] - ps[j]) > maxd) {\n\n      maxd = abs(ps[i] - ps[j]);\n\n      maxi = i;\n      maxj = j;\n    }\n\n  } while (i != is || j != js);\n\n  return maxd;\n}\n\ndouble closest_pair(C *a, int n) {\n\n  if (n <= 1)\n    return INF;\n\n  int m = n / 2;\n\n  double x = a[m].real();\n\n  double d = min(closest_pair(a, m), closest_pair(a + m, n - m));\n\n  inplace_merge(a, a + m, a + n, [](C c1, C c2) {\n    return c1.imag() != c2.imag() ? c1.imag() < c2.imag() : c1.real() < c2.real();\n  });\n\n  vector<C> b;\n\n  rep(i, n) {\n\n    if (abs(x - a[i].real()) >= d)\n      continue;\n\n    rep(j, b.size()) {\n\n      C dp = a[i] - b[b.size() - 1 - j];\n\n      if (dp.imag() >= d)\n        break;\n\n      d = min(d, abs(dp));\n    }\n\n    b.push_back(a[i]);\n  }\n\n  return d;\n}\n\ndouble compute_shortest(C *a, int n) {\n\n  sort(a, a + n);\n\n  return closest_pair(a, n);\n}\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  C p[100005];\n\n  rep(i, n) {\n\n    double x, y;\n\n    cin >> x >> y;\n\n    p[i] = C(x, y);\n  }\n\n  printf(\"%.10f\\n\", compute_shortest(p, n));\n}","fast_code":"#include <bits/stdc++.h>\n\n#define EPS 1e-12\n\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nusing namespace std;\n\ntypedef complex<double> C;\n\nconst double PI = 4 * atan(1.0);\n\nnamespace std\n\n{\n\nbool operator<(const C a, const C b) {\n\n  return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n}\n\n}                 \n\nstruct L : public vector<C>\n\n{\n\n  L() {}\n\n  L(const C a, const C b) {\n\n    push_back(a);\n    push_back(b);\n  }\n};\n\nbool eq(double a, double b)\n\n{\n\n  return (-EPS < a - b && a - b < EPS);\n}\n\nbool eq(C c1, C c2)\n\n{\n\n  return (eq(c1.real(), c2.real()) && eq(c1.imag(), c2.imag()));\n}\n\ndouble Sqrt(double x)\n\n{\n\n  if (x < 0)\n    return 0;\n\n  else\n    return sqrt(x);\n}\n\nC normalize(C c)\n\n{\n\n  return c / abs(c);\n}\n\ndouble getarg(C a, C b) { return arg(b * conj(a)); }\n\ndouble cross(const C a, const C b)\n\n{\n\n  return imag(conj(a) * b);\n}\n\ndouble dot(const C a, const C b)\n\n{\n\n  return real(conj(a) * b);\n}\n\nint ccw(C a, C b, C c)\n\n{\n\n  b -= a;\n  c -= a;\n\n  if (cross(b, c) > 0)\n    return +1;\n\n  if (cross(b, c) < 0)\n    return -1;\n\n  if (dot(b, c) < 0)\n    return +2;\n\n  if (norm(b) < norm(c))\n    return -2;\n\n  return 0;\n}\n\nbool intersectLL(const L &l, const L &m)\n\n{\n\n  return abs(cross(l[1] - l[0], m[1] - m[0])) > EPS || abs(cross(l[1] - l[0], m[0] - l[0])) < EPS;\n}\n\nbool intersectLS(const L &l, const L &s)\n\n{\n\n  return cross(l[1] - l[0], s[0] - l[0]) * cross(l[1] - l[0], s[1] - l[0]) < EPS;\n}\n\nbool intersectLP(const L &l, const C p)\n\n{\n\n  return abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\n\nbool intersectSS(const L &s, const L &t)\n\n{\n\n  return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n         ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\n\nbool intersectSP(const L &s, const C p)\n\n{\n\n  return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS;\n}\n\nC crosspointLL(const L &l, const L &m)\n\n{\n\n  double A = cross(l[1] - l[0], m[1] - m[0]);\n\n  double B = cross(l[1] - l[0], l[1] - m[0]);\n\n  if (abs(A) < EPS && abs(B) < EPS) {\n\n    return m[0];\n  }\n\n  return m[0] + B / A * (m[1] - m[0]);\n}\n\nC projection(const L &l, const C p)\n\n{\n\n  double t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\n  return l[0] + t * (l[0] - l[1]);\n}\n\ndouble gettime(C c1, C c2)\n\n{\n\n  return (dot(c1, c2) < 0 ? -1.0 : 1.0) * abs(c2) / abs(c1);\n}\n\nvector<C> crosspointCL(C c1, double r1, const L &l)\n\n{\n\n  C a = l[0], b = l[1];\n\n  vector<C> res;\n\n  C base = b - a, target = projection(L(a, b), c1);\n\n  double length = abs(base), h = abs(c1 - target);\n\n  base /= length;\n\n  if (r1 + EPS < h)\n    return res;\n\n  double w = Sqrt(r1 * r1 - h * h);\n\n  double LL = gettime(normalize(b - a), target - a) - w, RR = LL + w * 2.0;\n\n  res.push_back(a + base * LL);\n\n  if (eq(LL, RR))\n    return res;\n\n  res.push_back(a + base * RR);\n\n  return res;\n}\n\nvector<C> crosspointCS(C c1, double r1, const L &s)\n\n{\n\n  vector<C> tmp = crosspointCL(c1, r1, s);\n\n  vector<C> res;\n\n  rep(i, tmp.size()) {\n\n    if (eq(abs(s[1] - s[0]), abs(s[0] - tmp[i]) + abs(s[1] - tmp[i]))) {\n\n      res.push_back(tmp[i]);\n    }\n  }\n\n  return res;\n}\n\nL crosspointCC(const C c1, const double r1, const C c2, const double r2)\n\n{\n\n  C a = conj(c2 - c1), b = (r2 * r2 - r1 * r1 - (c2 - c1) * conj(c2 - c1)), c = r1 * r1 * (c2 - c1);\n\n  C d = b * b - 4.0 * a * c;\n\n  C z1 = (-b + sqrt(d)) / (2.0 * a) + c1, z2 = (-b - sqrt(d)) / (2.0 * a) + c1;\n\n  return L(z1, z2);\n}\n\nC reflection(const L &l, const C p)\n\n{\n\n  return p + (projection(l, p) - p) * 2.0;\n}\n\ndouble distanceLP(const L &l, const C p)\n\n{\n\n  return abs(p - projection(l, p));\n}\n\ndouble distanceLL(const L &l, const L &m)\n\n{\n\n  return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\n\ndouble distanceLS(const L &l, const L &s)\n\n{\n\n  if (intersectLS(l, s))\n    return 0;\n\n  return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\n\ndouble distanceSP(const L &s, const C p)\n\n{\n\n  const C r = projection(s, p);\n\n  if (intersectSP(s, r))\n    return abs(r - p);\n\n  return min(abs(s[0] - p), abs(s[1] - p));\n}\n\ndouble distanceSS(const L &s, const L &t)\n\n{\n\n  if (intersectSS(s, t))\n    return 0;\n\n  return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n             min(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\n\ndouble getarea(C c1, double r1, C a, C b)\n\n{\n\n  C va = c1 - a, vb = c1 - b;\n\n  double A = abs(va), B = abs(vb);\n\n  double f = cross(va, vb), d = distanceSP(L(a, b), c1), res = 0;\n\n  if (eq(f, 0.0))\n    return 0;\n\n  if (A < r1 + EPS && B < r1 + EPS)\n    return f * 0.5;\n\n  if (d > r1 - EPS)\n    return r1 * r1 * M_PI * getarg(va, vb) / (2.0 * M_PI);\n\n  vector<C> u = crosspointCS(c1, r1, L(a, b));\n\n  u.insert(u.begin(), a), u.push_back(b);\n\n  for (int i = 0; i + 1 < (int)u.size(); i++) {\n\n    res += getarea(c1, r1, u[i], u[i + 1]);\n  }\n\n  return res;\n}\n\ndouble getcrossarea(const vector<C> &t, C c1, double r1)\n\n{\n\n  int n = (int)t.size();\n\n  if (n < 3)\n    return 0;\n\n  double res = 0;\n\n  rep(i, n) {\n\n    C a = t[i], b = t[(i + 1) % n];\n\n    res += getarea(c1, r1, a, b);\n  }\n\n  return res;\n}\n\nvector<C> convex_hull(vector<C> ps)\n\n{\n\n  int n = (int)ps.size(), k = 0;\n\n  sort(ps.begin(), ps.end());\n\n  vector<C> ch(2 * n);\n\n  for (int i = 0; i < n; ch[k++] = ps[i++]) {\n\n    while (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0)\n      k--;\n  }\n\n  for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) {\n\n    while (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0)\n      k--;\n  }\n\n  ch.resize(k - 1);\n\n  return ch;\n}\n\nbool isconvex(const vector<C> &ps)\n\n{\n\n  rep(i, ps.size()) {\n\n    if (ccw(ps[(i + ps.size() - 1) % ps.size()], ps[i], ps[(i + 1) % ps.size()]))\n      return false;\n  }\n\n  return true;\n}\n\ndouble area(const vector<C> &ps)\n\n{\n\n  double A = 0;\n\n  rep(i, ps.size()) { A += cross(ps[i], ps[(i + 1) % ps.size()]); }\n\n  return A / 2.0;\n}\n\nvector<C> convex_cut(const vector<C> &ps, const L &l)\n\n{\n\n  vector<C> Q;\n\n  rep(i, ps.size()) {\n\n    C A = ps[i], B = ps[(i + 1) % ps.size()];\n\n    if (ccw(l[0], l[1], A) != -1)\n      Q.push_back(A);\n\n    if (ccw(l[0], l[1], A) * ccw(l[0], l[1], B) < 0)\n\n      Q.push_back(crosspointLL(L(A, B), l));\n  }\n\n  return Q;\n}\n\nint contains(const vector<C> &ps, const C p)\n\n{\n\n  bool flag = false;\n\n  rep(i, ps.size()) {\n\n    C a = ps[i] - p, b = ps[(i + 1) % ps.size()] - p;\n\n    if (imag(a) > imag(b))\n      swap(a, b);\n\n    if (imag(a) <= 0 && 0 < imag(b)) {\n\n      if (cross(a, b) < 0)\n        flag = !flag;\n    }\n\n    if (cross(a, b) == 0 && dot(a, b) <= 0)\n      return 1;\n  }\n\n  return flag ? 2 : 0;\n}\n\nvector<C> convex_intersection(const vector<C> &ps, const vector<C> &qs)\n\n{\n\n  vector<C> rs;\n\n  int a = ps.size(), b = qs.size();\n\n  rep(i, a) {\n\n    if (contains(qs, ps[i])) {\n\n      rs.push_back(ps[i]);\n    }\n  }\n\n  rep(i, b) {\n\n    if (contains(ps, qs[i])) {\n\n      rs.push_back(qs[i]);\n    }\n  }\n\n  rep(i, a) {\n\n    rep(j, b) {\n\n      L l1(ps[i], ps[(i + 1) % a]), l2(qs[j], qs[(j + 1) % b]);\n\n      if (intersectSS(l1, l2)) {\n\n        rs.push_back(crosspointLL(l1, l2));\n      }\n    }\n  }\n\n  sort(rs.begin(), rs.end());\n\n  rs.erase(unique(rs.begin(), rs.end()), rs.end());\n\n  if (rs.size() <= 1) {\n\n    return rs;\n  }\n\n  return convex_hull(rs);\n}\n\ndouble convex_diameter(const vector<C> &ps)\n\n{\n\n  const int n = (int)ps.size();\n\n  int is = 0, js = 0;\n\n  for (int i = 1; i < n; ++i) {\n\n    if (imag(ps[i]) > imag(ps[is]))\n      is = i;\n\n    if (imag(ps[i]) < imag(ps[js]))\n      js = i;\n  }\n\n  double maxd = abs(ps[is] - ps[js]);\n\n  int i, maxi, j, maxj;\n\n  i = maxi = is;\n\n  j = maxj = js;\n\n  do {\n\n    if (cross(ps[(i + 1) % ps.size()] - ps[i], ps[(j + 1) % ps.size()] - ps[j]) >= 0)\n      j = (j + 1) % n;\n\n    else\n      i = (i + 1) % n;\n\n    if (abs(ps[i] - ps[j]) > maxd) {\n\n      maxd = abs(ps[i] - ps[j]);\n\n      maxi = i;\n      maxj = j;\n    }\n\n  } while (i != is || j != js);\n\n  return maxd;\n}\n\nbool compyx(C c1, C c2)\n\n{\n\n  return c1.imag() != c2.imag() ? c1.imag() < c2.imag() : c1.real() < c2.real();\n}\n\ndouble closest_pair(C *a, int n)\n\n{\n\n  if (n <= 1)\n    return 1e100;\n\n  int m = n / 2;\n\n  double x = a[m].real();\n\n  double d = min(closest_pair(a, m), closest_pair(a + m, n - m));\n\n  inplace_merge(a, a + m, a + n, compyx);\n\n  vector<C> b;\n\n  rep(i, n) {\n\n    if (abs(x - a[i].real()) >= d)\n      continue;\n\n    rep(j, b.size()) {\n\n      C dp = a[i] - b[b.size() - 1 - j];\n\n      if (dp.imag() >= d)\n        break;\n\n      d = min(d, abs(dp));\n    }\n\n    b.push_back(a[i]);\n  }\n\n  return d;\n}\n\ndouble compute_shortest(C *a, int n)\n\n{\n\n  sort(a, a + n);\n\n  return closest_pair(a, n);\n}\n\nint getstateCC(C c1, double r1, C c2, double r2)\n\n{\n\n  double d = abs(c1 - c2);\n\n  if (d > r1 + r2 + EPS)\n    return 4;\n\n  if (d > r1 + r2 - EPS)\n    return 3;\n\n  if (d > abs(r1 - r2) + EPS)\n    return 2;\n\n  if (d > abs(r1 - r2) - EPS)\n    return 1;\n\n  return 0;\n}\n\nC gettangentCP_(C c1, double r1, C p, int flg) {\n\n  C base = c1 - p;\n\n  double w = Sqrt(norm(base) - r1 * r1);\n\n  C s = p + base * C(w, r1 * flg) / norm(base) * w;\n\n  return s;\n}\n\nvector<L> gettangentCP(C c1, double r1, C p) {\n\n  vector<L> res;\n\n  C s = gettangentCP_(c1, r1, p, 1);\n\n  C t = gettangentCP_(c1, r1, p, -1);\n\n  if (eq(s, t)) {\n\n    res.push_back(L(s, s + (c1 - p) * C(0, 1)));\n\n  } else {\n\n    res.push_back(L(p, s));\n\n    res.push_back(L(p, t));\n  }\n\n  return res;\n}\n\nL getintangent(C c1, double r1, C c2, double r2, double flg)\n\n{\n\n  C base = c2 - c1;\n\n  double w = r1 + r2;\n\n  double h = Sqrt(norm(base) - w * w);\n\n  C k = base * C(w, h * flg) / norm(base);\n\n  return L(c1 + k * r1, c2 - k * r2);\n}\n\nL getouttangent(C c1, double r1, C c2, double r2, double flg)\n\n{\n\n  C base = c2 - c1;\n\n  double h = r2 - r1;\n\n  double w = Sqrt(norm(base) - h * h);\n\n  C k = base * C(w, h * flg) / norm(base) * C(0, flg);\n\n  return L(c1 + k * r1, c2 + k * r2);\n}\n\nvector<L> gettangentCC(C c1, double r1, C c2, double r2)\n\n{\n\n  vector<L> res;\n\n  double d = abs(c1 - c2);\n\n  if (d > r1 + r2 + EPS)\n    res.push_back(getintangent(c1, r1, c2, r2, 1));\n\n  if (d > r1 + r2 - EPS)\n    res.push_back(getintangent(c1, r1, c2, r2, -1));\n\n  if (d > abs(r1 - r2) + EPS)\n    res.push_back(getouttangent(c1, r1, c2, r2, 1));\n\n  if (d > abs(r1 - r2) - EPS)\n    res.push_back(getouttangent(c1, r1, c2, r2, -1));\n\n  return res;\n}\n\nC vec[100005];\n\nint main()\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n;\n\n  cin >> n;\n\n  rep(i, n) {\n\n    double a, b;\n\n    cin >> a >> b;\n\n    vec[i] = C(a, b);\n  }\n\n  printf(\"%.12lf\\n\", compute_shortest(vec, n));\n\n  return 0;\n}"}
{"fast_code_id":"e374cce82b86d11b4ef77f180cbc65bb75ce99d2014afad92044290abb4b107b","fast_id":"b185754c619add72d3c373019809ccb2566e1dee647156f9f4b43f73ec0403f8","fast_time":0.1066821973,"language":"cpp","measured_fast_code_id":"b185754c619add72d3c373019809ccb2566e1dee647156f9f4b43f73ec0403f8","measured_slow_code_id":"c6ff4cf23193c166c889ecada8424e4822bba523682c72ff5528b24a50db9647","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1516","problem_id":"p01096","slow_code_id":"0e98e6d0dc5bd284de8141f435b728bfedc4d669e363d2c36e803a5a3966d135","slow_id":"c6ff4cf23193c166c889ecada8424e4822bba523682c72ff5528b24a50db9647","slow_time":0.2340612637,"speedup":2.194004900759576,"stratum":"2-4","sampling_key":"3c2c3e76cfd5b314a6332b0604f9e23788f47b104744c9b4ab42c8ef1d75c8be","slow_code":"\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <string>\n\n#include <cstring>\n\n#include <deque>\n\n#include <list>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <utility>\n\n#include <algorithm>\n\n#include <map>\n\n#include <set>\n\n#include <complex>\n\n#include <cmath>\n\n#include <limits>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <ctime>\n\n#include <cassert>\n\n#include <numeric>\n\n#include <functional>\n\nusing namespace std;\n\n#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)\n\n#define repq(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)\n\n#define repr(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)\n\n#define int long long int\n\ntemplate <typename T> void chmax(T &a, T b) { a = max(a, b); }\n\ntemplate <typename T> void chmin(T &a, T b) { a = min(a, b); }\n\ntemplate <typename T> void chadd(T &a, T b) { a = a + b; }\n\ntypedef pair<int, int> pii;\n\ntypedef long long ll;\n\nint dx[] = {0, 0, 1, -1};\n\nint dy[] = {1, -1, 0, 0};\n\nconstexpr ll INF = 1001001001001001LL;\n\nconstexpr ll MOD = 1000000007LL;\n\nint N, w[310];\n\nbool dp[310][310];\n\nint rec[310][310];\n\nsigned main() {\n\n  while (cin >> N, N) {\n\n    memset(dp, false, sizeof(dp));\n\n    memset(rec, 0, sizeof(rec));\n\n    rep(i, 0, N) cin >> w[i];\n\n    repq(x, 2, N) rep(l, 0, N - x + 1) {\n\n      int r = l + x;\n\n      if (x == 2) {\n\n        if (abs(w[l] - w[l + 1]) <= 1)\n          dp[l][r] = true;\n\n      }\n\n      else {\n\n        rep(k, l, r) if (dp[l][k] && dp[k][r]) dp[l][r] = true;\n      }\n\n      if (dp[l][r]) {\n\n        int c = 1;\n\n        while (1) {\n\n          int nl = l - c, nr = r + c;\n\n          if (nl < 0 || nr > N)\n            break;\n\n          if (abs(w[nl] - w[nr - 1]) > 1)\n            break;\n\n          dp[nl][nr] = true;\n          c++;\n        }\n\n        rec[l][r] = r - l;\n      }\n    }\n\n    repq(x, 2, N) rep(l, 0, N - x + 1) {\n\n      int r = l + x;\n\n      rep(k, l, r) chmax(rec[l][r], rec[l][k] + rec[k][r]);\n    }\n\n    cout << rec[0][N] << endl;\n  }\n\n  return 0;\n}","fast_code":"\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <string>\n\n#include <cstring>\n\n#include <deque>\n\n#include <list>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <utility>\n\n#include <algorithm>\n\n#include <map>\n\n#include <set>\n\n#include <complex>\n\n#include <cmath>\n\n#include <limits>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <ctime>\n\n#include <cassert>\n\n#include <numeric>\n\n#include <fstream>\n\n#include <functional>\n\n#include <bitset>\n\nusing namespace std;\n\nusing ll = long long int;\n\nusing int64 = long long int;\n\ntemplate <typename T> void chmax(T &a, T b) { a = max(a, b); }\n\ntemplate <typename T> void chmin(T &a, T b) { a = min(a, b); }\n\ntemplate <typename T> void chadd(T &a, T b) { a = a + b; }\n\nint dx[] = {0, 0, 1, -1};\n\nint dy[] = {1, -1, 0, 0};\n\nconst int INF = 1LL << 29;\n\nconst ll LONGINF = 1LL << 60;\n\nconst ll MOD = 1000000007LL;\n\nint dp1[310][310], dp2[310];\n\nint solve_testcase() {\n\n  int N;\n  scanf(\"%d\", &N);\n\n  if (N == 0)\n    return 1;\n\n  vector<int> A(N);\n\n  for (int i = 0; i < N; i++)\n    scanf(\"%d\", &A[i]);\n\n  fill(dp1[0], dp1[N + 1], false);\n\n  for (int i = 0; i < N; i++) {\n\n    dp1[i][i] = true;\n  }\n\n  for (int d = 2; d <= N; d++) {\n\n    for (int l = 0; l < N - d + 1; l++) {\n\n      int r = l + d;\n\n      if (abs(A[l] - A[r - 1]) <= 1 and dp1[l + 1][r - 1])\n        dp1[l][r] = true;\n\n      if (r - l >= 4) {\n\n        for (int k = l + 2; k <= r - 2; k++) {\n\n          if (dp1[l][k] and dp1[k][r])\n            dp1[l][r] = true;\n        }\n      }\n    }\n  }\n\n  fill(dp2, dp2 + N + 1, -1);\n\n  dp2[0] = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    chmax(dp2[i + 1], dp2[i]);\n\n    for (int j = i + 1; j <= N; j++) {\n\n      if (!dp1[i][j])\n        continue;\n\n      chmax(dp2[j], dp2[i] + (j - i));\n    }\n  }\n\n  printf(\"%d\\n\", dp2[N]);\n\n  return 0;\n}\n\nint main() {\n\n  while (!solve_testcase())\n    ;\n\n  return 0;\n}\n"}
{"fast_code_id":"29b9444e7dbe8c6f96e24e14123d20d0c89509ae82c5c613a9c557bfd359e234","fast_id":"fab5d4ad34a7d60c02578dba5ebc76664980f368f1f25386f2453913a2eb77a0","fast_time":0.053382941,"language":"cpp","measured_fast_code_id":"fab5d4ad34a7d60c02578dba5ebc76664980f368f1f25386f2453913a2eb77a0","measured_slow_code_id":"1c8753758898cba97cb5a55718e080e5683be6c649068cfef17c6b9daabd6340","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15267","problem_id":"p03942","slow_code_id":"50fdc3ee6920d529c6a95d542c054ee3459366741d906d46a7ff9958ea963c1f","slow_id":"1c8753758898cba97cb5a55718e080e5683be6c649068cfef17c6b9daabd6340","slow_time":0.2571975495,"speedup":4.81797264598067,"stratum":"4-8","sampling_key":"3eba0f628df95cf04c333918bda7275902c21db500093359f26c7059ded21406","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define RFOR(i, b, a) for (int i = (b) - 1; i >= (a); i--)\n\n#define ITER(it, a)                                                            \\\n  for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int)a.size()\n\n#define ALL(a) a.begin(), a.end()\n\n#define PB push_back\n\n#define MP make_pair\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\n\nconst int INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = INF * (LL)INF;\n\nconst int MAX = 1001000;\n\nchar S[MAX];\n\nchar T[MAX];\n\nint A[MAX];\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  scanf(\"%s\", S);\n\n  scanf(\"%s\", T);\n\n  if ((string)(S) == (string(T)))\n\n  {\n\n    cout << 0 << endl;\n\n    return 0;\n  }\n\n  FILL(A, -1);\n\n  int ind = n - 1;\n\n  RFOR(i, n, 0)\n\n  {\n\n    while (ind > i)\n      ind--;\n\n    while (ind >= 0 && S[ind] != T[i])\n\n    {\n\n      ind--;\n    }\n\n    if (ind == -1)\n\n    {\n\n      cout << -1 << endl;\n\n      return 0;\n    }\n\n    if (A[ind] == -1)\n      A[ind] = i;\n  }\n\n  vector<PII> a;\n\n  FOR(i, 0, n)\n\n  {\n\n    if (A[i] != -1)\n      a.PB(MP(i, A[i]));\n  }\n\n  int res = 0;\n\n  ind = 0;\n\n  int ind2 = 0;\n\n  FOR(i, 0, SZ(a))\n\n  {\n\n    while (true)\n\n    {\n\n      if (ind2 == SZ(a))\n        break;\n\n      if (a[ind2].first <= a[i].second)\n\n      {\n\n        ind2++;\n\n        continue;\n      }\n\n      break;\n    }\n\n    while (true)\n\n    {\n\n      if (ind == SZ(a))\n        break;\n\n      if (a[ind].first - (ind - i - 1) <= a[i].second)\n\n      {\n\n        ind++;\n\n        continue;\n      }\n\n      break;\n    }\n\n    res = max(res, ind - i);\n  }\n\n  cout << res << endl;\n}\n","fast_code":"                                                                    \n\n\n\n#include <bits/stdc++.h>\n\n\n\nusing namespace std;\n\n\n\ntypedef long long ll;\n\ntypedef pair <int, int> pii;\n\n\n\n#define ALL(a) a.begin(), a.end()\n\n#define FastIO ios::sync_with_stdio(false); cin.tie(0);cout.tie(0)\n\n#define IN freopen(\"input.txt\",\"r+\",stdin)\n\n#define OUT freopen(\"output.txt\",\"w+\",stdout)\n\n\n\n#define DBG(a) cerr<< \"line \"<<__LINE__ <<\" : \"<< #a <<\" --> \"<<(a)<<endl\n\n#define NL cout<<endl\n\n\n\ntemplate < class T1,class T2>\n\nostream &operator <<(ostream &os,const pair < T1,T2 > &p)\n\n{\n\n  os<<\"{\"<<p.first<<\",\"<<p.second<<\"}\";\n\n  return os;\n\n}\n\n\n\nconst int N=2e6+5;\n\nconst int oo=1e9+7;\n\n\n\nint n;\n\nstring s,t;\n\n\n\nint h[N];\n\n\n\n\n\nint Tree [N+10];\n\n\n\nvoid update(int idx, ll x,int n)\n\n{\n\n                                                           \n\n                                                         \n\n                                                             \n\n  assert(idx>=1);\n\n  while(idx<=n)\n\n  {\n\n    Tree[idx]+=x;\n\n    idx+=(idx&-idx);\n\n  }\n\n}\n\n\n\nint query(int idx)\n\n{\n\n  ll sum=0;\n\n  while(idx>0)\n\n  {\n\n    sum+=Tree[idx];\n\n    idx-=(idx&-idx);\n\n  }\n\n  return sum;\n\n}\n\n\n\nint val(int idx)\n\n{\n\n  return query(N ) - query(idx-1);\n\n}\n\n\n\nint now  = 1 ;\n\n\n\n\n\nint solve()\n\n{\n\n  if(s==t)\n\n    return 0;\n\n  s=\"#\"+s;\n\n  t=\"#\"+t;\n\n\n\n  vector<int > x;\n\n  for(int i=1; i<=n; i++)\n\n  {\n\n    if(i>1 and t[i]==t[i-1])\n\n      continue ;\n\n    x.push_back(i);\n\n  }\n\n  reverse(ALL(x));\n\n\n\n\n\n\n\n  int ss = n;\n\n  int ret =1;\n\n\n\n  for(int tt: x)\n\n  {\n\n    while(ss >=1 )\n\n    {\n\n      if(ss<=tt and s[ss] == t[tt])\n\n        break;\n\n      else\n\n      {\n\n        ss--;\n\n        now++;\n\n      }\n\n    }\n\n    if(ss>=1)\n\n    {\n\n      if(ss!=tt)\n\n      {\n\n                                           \n\n                                       \n\n                          \n\n                                             \n\n\n\n        int old = val(now-(tt-ss));\n\n        now--;\n\n        update(now , 1 , N);\n\n                                                         \n\n        ret =max(ret, old + 2);\n\n\n\n                                           \n\n\n\n      }\n\n      ss--;\n\n      now++;\n\n    }\n\n    else\n\n      return -1;\n\n  }\n\n  return ret;\n\n}\n\n\n\nint32_t main()\n\n{\n\n  FastIO;\n\n  cin>>n>>s>>t;\n\n  cout<<solve()<<\"\\n\";\n\n}\n"}
{"fast_code_id":"4dfaefb64b70c9ac4d11e7b85e17acb0b500ef7304b4f6bc693bcb657ffb534b","fast_id":"f5372617a3ce7b2580cd704dd532df6c4e364f9e166f72990ba2e87944f22eac","fast_time":0.1875467279,"language":"cpp","measured_fast_code_id":"f5372617a3ce7b2580cd704dd532df6c4e364f9e166f72990ba2e87944f22eac","measured_slow_code_id":"fc14437cb028fc7583723e52206f180098374dd5a84a632fbb5f1bc59d4a03ca","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15277","problem_id":"p01481","slow_code_id":"cab4c175faea74d64e2144390c0bc56899fa4e80246bac08f8f9d32ae69a25d1","slow_id":"fc14437cb028fc7583723e52206f180098374dd5a84a632fbb5f1bc59d4a03ca","slow_time":0.5039721781,"speedup":2.687181929234821,"stratum":"2-4","sampling_key":"0266f5ccdb7db52bcf37945f13bcd2233d7730a0cf1891866a82f667f7759121","slow_code":"#include <bits/stdc++.h>\n\n#define N 1000021\n\nusing namespace std;\n\nint w, h;\n\nint par[N], Rank[N];\n\nchar mp[1001][1001];\n\nvoid init() {\n\n  for (int i = 0; i < N; i++)\n    par[i] = i, Rank[i] = 0;\n}\n\nint find(int x) {\n\n  if (par[x] == x)\n    return x;\n\n  return par[x] = find(par[x]);\n}\n\nvoid unite(int x, int y) {\n\n  x = find(x), y = find(y);\n\n  if (x == y)\n    return;\n\n  if (Rank[x] < Rank[y])\n    par[x] = y;\n\n  else\n    par[y] = x, Rank[x] += (Rank[x] == Rank[y]);\n}\n\nbool same(int x, int y) { return find(x) == find(y); }\n\nint Pos(int x, int y) { return w * y + x; }\n\nint dx[] = {0, 0, -1, 1};\n\nint dy[] = {1, -1, 0, 0};\n\nvoid umeru() {\n\n  for (int i = 0; i < h; i++)\n\n    for (int j = 0; j < w; j++)\n\n      for (int k = 0; k < 4; k++) {\n\n        int ni = i + dy[k], nj = j + dx[k];\n\n        if (mp[i][j] == '#')\n          continue;\n\n        if (ni < 0 || nj < 0 || ni >= h || nj >= w || mp[ni][nj] == '#')\n          continue;\n\n        unite(Pos(j, i), Pos(nj, ni));\n      }\n}\n\nvoid umeru2(int x, int y) {\n\n  for (int i = 0; i < 4; i++) {\n\n    int ny = y + dy[i], nx = x + dx[i];\n\n    if (ny < 0 || nx < 0 || ny >= h || nx >= w || mp[ny][nx] == '#')\n      continue;\n\n    unite(Pos(x, y), Pos(nx, ny));\n  }\n}\n\nint main() {\n\n  init();\n\n  cin >> w >> h;\n\n  int t;\n\n  for (int i = 0; i < h; i++)\n\n    for (int j = 0; j < w; j++) {\n\n      cin >> mp[i][j];\n\n      if (mp[i][j] == 't')\n        t = Pos(j, i);\n    }\n\n  umeru();\n\n  int n, ans = -1;\n\n  if (same(0, t))\n    ans = 0;\n\n  cin >> n;\n\n  for (int i = 1, a, b; i <= n; i++) {\n\n    cin >> a >> b;\n\n    umeru2(a, b);\n\n    mp[b][a] = '.';\n\n    if (same(0, t) && ans == -1)\n      ans = i;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define lp(i, n) for (int i = 0; i < n; i++)\n\n#define lps(i, j, n) for (int i = j; i < n; i++)\n\n#define fordebug                                                                                   \\\n  int hoge;                                                                                        \\\n  cin >> hoge;\n\n#define DEKAI 1000000007;\n\n#define INF (1 << 28)\n\n#define int long long\n\n#define double long double\n\n#define floot10 cout << fixed << setprecision(10)\n\nbool dp[1100][1100];\n\nsigned main() {\n\n  int w, h;\n\n  cin >> w >> h;\n\n  char a[1100][1100];\n\n  lp(i, 1100) lp(j, 1100) {\n\n    dp[i][j] = false;\n\n    a[i][j] = '#';\n  }\n\n  int gx, gy;\n\n  lp(i, h) {\n\n    lp(j, w) {\n\n      cin >> a[i + 1][j + 1];\n\n      if (a[i + 1][j + 1] == 't') {\n\n        gx = i + 1;\n\n        gy = j + 1;\n      }\n    }\n  }\n\n  queue<pair<int, int>> q;\n\n  q.push({1, 1});\n\n  dp[1][1] = true;\n\n  int ax[4] = {0, 0, -1, 1};\n\n  int ay[4] = {-1, 1, 0, 0};\n\n  int n;\n\n  cin >> n;\n\n  int hox[1010], hoy[1010];\n\n  lp(i, n) { cin >> hox[i] >> hoy[i]; }\n\n  lp(z, n + 1) {\n\n    while (!q.empty()) {\n\n      int x, y;\n\n      x = q.front().first;\n\n      y = q.front().second;\n\n      q.pop();\n\n      lp(i, 4) {\n\n        int nex = x + ax[i];\n\n        int ney = y + ay[i];\n\n        if (nex == gx && ney == gy) {\n\n          cout << z << endl;\n\n          return 0;\n        }\n\n        if (dp[nex][ney] == false) {\n\n          dp[nex][ney] = true;\n\n          if (a[nex][ney] == '.') {\n\n            q.push({nex, ney});\n          }\n        }\n      }\n    }\n\n    if (z == n)\n      break;\n\n    int bx, by;\n\n    bx = hoy[z];\n\n    by = hox[z];\n\n    bx++;\n\n    by++;\n\n    if (a[bx][by] == '#') {\n\n      a[bx][by] = '.';\n\n      if (dp[bx][by] == true) {\n\n        q.push({bx, by});\n      }\n    }\n  }\n\n  cout << -1 << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"a5312fb7a5805f90ea88f51c817227e28155137205159fa515d466703666d9fa","fast_id":"afcbb647e1e8eb5c87d8f338eb1f2a73d744db33a51edafa6d0fc2190b507af0","fast_time":0.0194639311,"language":"cpp","measured_fast_code_id":"afcbb647e1e8eb5c87d8f338eb1f2a73d744db33a51edafa6d0fc2190b507af0","measured_slow_code_id":"7a0e41249de25c907e0d5e895b2651d420dbfd31f504f677afdb1d8d86c489a3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15280","problem_id":"p00952","slow_code_id":"fe04ac3adf676c2e7ab6cc08dd3918ef1ace8da3b4ad40478bdf4b9f17533f22","slow_id":"7a0e41249de25c907e0d5e895b2651d420dbfd31f504f677afdb1d8d86c489a3","slow_time":0.102557912,"speedup":5.269126337998596,"stratum":"4-8","sampling_key":"814ae2b7e822d5ca8b7bcd72385b6f490a94ca40543515739cd702f3318b63df","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 500010;\n\nint f[N], cur, s[N];\n\nvoid pn() { puts(\"No\"); }\n\nvoid py() { puts(\"Yes\"); }\n\nvoid add(int x, int val) {\n\n  if (!x)\n    return;\n\n  while (x < N) {\n\n    s[x] += val;\n\n    x += x & -x;\n  }\n}\n\nint query(int x) {\n\n  int ret = 0;\n\n  while (x) {\n\n    ret += s[x];\n\n    x -= x & -x;\n  }\n\n  return ret;\n}\n\nvoid Add(int t) {\n\n  while (t) {\n\n    if (!f[t])\n      break;\n\n    f[t]--;\n\n    add(t, -1);\n\n    t--;\n  }\n\n  f[t]++;\n\n  add(t, 1);\n}\n\nint main() {\n\n  int n, x;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d\", &x);\n\n    if (f[0])\n      pn();\n\n    else {\n\n      if (x >= N) {\n\n        cur = 1;\n\n        py();\n\n      } else {\n\n        if (query(x) == x) {\n\n          if (query(N - 1) > x || cur)\n            pn();\n\n          else {\n\n            py();\n\n            Add(x);\n          }\n\n        } else {\n\n          py();\n\n          Add(x);\n        }\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint d[1000005];\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  int top = 0, down = 0;\n\n  while (n--) {\n\n    int x;\n\n    scanf(\"%d\", &x);\n\n    if (d[0] || x < top) {\n      printf(\"No\\n\");\n      continue;\n    }\n\n    if (x == top && top != down) {\n      printf(\"No\\n\");\n      continue;\n    }\n\n    if (x >= 1000000) {\n      printf(\"Yes\\n\");\n      down = max(down, x);\n      continue;\n    }\n\n    d[x]++;\n    down = max(down, x);\n\n    while (d[x] >= 2) {\n\n      d[x - 1]++;\n\n      d[x] = 0;\n\n      if (x == down)\n        down--;\n\n      x--;\n    }\n\n    for (int i = top + 1; d[i] == 1; i++)\n\n      top = i;\n\n    printf(\"Yes\\n\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"5d12185a5f8bd95e2fa45551c8471ea6596217302323de2d19f837a3c19f7dec","fast_id":"c730b38976fdb247881e29c11c4287940252c98714d8770b1a39323fab669fb0","fast_time":0.0094593748,"language":"cpp","measured_fast_code_id":"c730b38976fdb247881e29c11c4287940252c98714d8770b1a39323fab669fb0","measured_slow_code_id":"08608facf7b62bceb22cd333c969d85e6c0f59b8164dd703f1a1bd31cacf8748","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15298","problem_id":"p02265","slow_code_id":"1c648d3befa91d93858bbb897484247e16734f7920d778667e567a46834d7807","slow_id":"08608facf7b62bceb22cd333c969d85e6c0f59b8164dd703f1a1bd31cacf8748","slow_time":0.0454740306,"speedup":4.80729768736936,"stratum":"4-8","sampling_key":"0e2fd7f7a8cb8e3fd75e4bc5fbe71cd5bfe81ac80509ac760165637bdf7f5b6c","slow_code":"#include <cstdio>\n\n#include <list>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  int q, x;\n\n  char com[20];\n\n  list<int> v;\n\n  scanf(\"%d\", &q);\n\n  for (int i = 0; i < q; i++) {\n\n    scanf(\"%s\", com);\n\n    if (com[0] == 'i') {\n\n      scanf(\"%d\", &x);\n\n      v.push_front(x);\n\n    } else if (com[6] == 'L') {\n\n      v.pop_back();\n\n    } else if (com[6] == 'F') {\n\n      v.pop_front();\n\n    } else if (com[0] == 'd') {\n\n      scanf(\"%d\", &x);\n\n      for (list<int>::iterator it = v.begin(); it != v.end(); it++) {\n\n        if (*it == x) {\n\n          v.erase(it);\n\n          break;\n        }\n      }\n    }\n  }\n\n  int i = 0;\n\n  for (list<int>::iterator it = v.begin(); it != v.end(); it++) {\n\n    if (i++)\n      printf(\" \");\n\n    printf(\"%d\", *it);\n  }\n\n  printf(\"\\n\");\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\nstruct Node {\n\n  int v;\n\n  Node *prev;\n\n  Node *next;\n};\n\nNode *nil;\n\nvoid init() {\n\n  nil = (Node *)malloc(sizeof(Node));\n\n  nil->prev = nil;\n\n  nil->next = nil;\n}\n\nvoid insertNode(int x) {\n\n  Node *node = (Node *)malloc(sizeof(Node));\n\n  node->v = x;\n\n  nil->next->prev = node;\n\n  node->next = nil->next;\n\n  nil->next = node;\n\n  node->prev = nil;\n}\n\nNode *search(int x) {\n\n  Node *node = nil->next;\n\n  while (node != nil) {\n\n    if (node->v == x)\n      return node;\n\n    node = node->next;\n  }\n\n  return nil;\n}\n\nvoid deleteNode(Node *node) {\n\n  if (node != nil) {\n\n    node->prev->next = node->next;\n\n    node->next->prev = node->prev;\n\n    free(node);\n  }\n}\n\nvoid deleteAt(int x) { deleteNode(search(x)); }\n\nvoid deleteFirst() { deleteNode(nil->next); }\n\nvoid deleteLast() { deleteNode(nil->prev); }\n\nint main() {\n\n  int n, v;\n\n  char com[12];\n\n  scanf(\"%d\", &n);\n\n  init();\n\n  while (scanf(\"%s %d\", com, &v) != EOF) {\n\n    if (com[0] == 'i') {\n\n      insertNode(v);\n\n    } else if (com[0] == 'd') {\n\n      if (com[6] == 'F') {\n\n        deleteFirst();\n\n      } else if (com[6] == 'L') {\n\n        deleteLast();\n\n      } else {\n\n        deleteAt(v);\n      }\n    }\n  }\n\n  Node *node = nil->next;\n\n  int i = 0;\n\n  while (node != nil) {\n\n    if (i)\n      printf(\" \");\n\n    printf(\"%d\", node->v);\n\n    node = node->next;\n\n    i++;\n  }\n\n  printf(\"\\n\");\n\n  return 0;\n}\n"}
{"fast_code_id":"70229be967cade854af52a69503d8262f2168c082a5e028773121c7e3800e601","fast_id":"a7cdea25a2ec404b1a971244b9859f9f327e2a8b3b01353721e298679099cb62","fast_time":0.026535809,"language":"cpp","measured_fast_code_id":"a7cdea25a2ec404b1a971244b9859f9f327e2a8b3b01353721e298679099cb62","measured_slow_code_id":"dfcfb5ef03132e2f1c95632c20d6557e2cc22c2418e785d78007fa9008473cac","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15355","problem_id":"p02926","slow_code_id":"5f2cc3e1d62c05057a27fd59756e2412f4dc3009ae7c1292dfefa0dbc91e7487","slow_id":"dfcfb5ef03132e2f1c95632c20d6557e2cc22c2418e785d78007fa9008473cac","slow_time":0.1099725175,"speedup":4.1443061901749445,"stratum":"4-8","sampling_key":"8a1dd38b45ac37a1a49caf4eb806566f75a690423d24d7fcf6c05b5215860460","slow_code":"#pragma GCC optimize(\"O3\")\n\n#include <bits/stdc++.h>\n\ntypedef long double ld;\n\nusing namespace std;\n\nconst int N = 105;\n\nstruct Pt {\n\n  ld x, y, ang;\n\n  Pt(ld _x = 0, ld _y = 0) : x(_x), y(_y), ang(atan2(_y, _x)) {\n\n    if (ang < 0)\n      ang += 2 * M_PI;\n  };\n\n  Pt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }\n\n  Pt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }\n\n  Pt operator*(const ld &a) const { return Pt(x * a, y * a); }\n\n  Pt operator/(const ld &a) const { return Pt(x / a, y / a); }\n\n  ld operator*(const Pt &a) const { return x * a.x + y * a.y; }\n\n  ld operator^(const Pt &a) const { return x * a.y - y * a.x; }\n\n  bool operator<(const Pt &ret) const { return ang < ret.ang; }\n};\n\nld norm2(const Pt &a) { return a * a; }\n\nld norm(const Pt &a) { return sqrt(norm2(a)); }\n\nint n;\n\nPt dp[N];\n\nvector<Pt> v;\n\nvoid init() {\n\n  cin >> n;\n\n  for (int i = 0; i < n; ++i) {\n\n    ld x, y;\n    cin >> x >> y;\n\n    v.push_back(Pt(x, y));\n  }\n}\n\nvoid solve() {\n\n  sort(v.begin(), v.end());\n\n  dp[0] = {0, 0};\n\n  Pt ans = {0, 0};\n\n  for (int i = 1; i <= n; ++i) {\n\n    dp[i] = {0, 0};\n\n    for (int j = 0; j < i; ++j) {\n\n      Pt x = dp[j] + v[i - 1];\n\n      if (norm(x) > norm(dp[i]))\n        dp[i] = x;\n    }\n\n    if (norm(dp[i]) > norm(ans))\n      ans = dp[i];\n  }\n\n  reverse(v.begin(), v.end());\n\n  for (int i = 1; i <= n; ++i) {\n\n    dp[i] = {0, 0};\n\n    for (int j = 0; j < i; ++j) {\n\n      Pt x = dp[j] + v[i - 1];\n\n      if (norm(x) > norm(dp[i]))\n        dp[i] = x;\n    }\n\n    if (norm(dp[i]) > norm(ans))\n      ans = dp[i];\n  }\n\n  int cnt = 5000;\n\n  while (cnt--) {\n\n    random_shuffle(v.begin(), v.end());\n\n    for (int i = 1; i <= n; ++i) {\n\n      dp[i] = {0, 0};\n\n      for (int j = 0; j < i; ++j) {\n\n        Pt x = dp[j] + v[i - 1];\n\n        if (norm(x) > norm(dp[i]))\n          dp[i] = x;\n      }\n\n      if (norm(dp[i]) > norm(ans))\n        ans = dp[i];\n    }\n  }\n\n  cout << fixed << setprecision(15) << norm(ans) << '\\n';\n}\n\nint32_t main() {\n\n  ios_base::sync_with_stdio(0), cin.tie(0);\n\n  init();\n\n  solve();\n}\n","fast_code":"#pragma GCC optimize(\"O3\")\n\n#include <bits/stdc++.h>\n\ntypedef long double ld;\n\nusing namespace std;\n\nconst int N = 105;\n\nstruct Pt {\n\n  ld x, y, ang;\n\n  Pt(ld _x = 0, ld _y = 0) : x(_x), y(_y), ang(atan2(_y, _x)) {\n\n    if (ang < 0)\n      ang += 2 * M_PI;\n  };\n\n  Pt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }\n\n  Pt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }\n\n  Pt operator*(const ld &a) const { return Pt(x * a, y * a); }\n\n  Pt operator/(const ld &a) const { return Pt(x / a, y / a); }\n\n  ld operator*(const Pt &a) const { return x * a.x + y * a.y; }\n\n  ld operator^(const Pt &a) const { return x * a.y - y * a.x; }\n\n  bool operator<(const Pt &ret) const { return ang < ret.ang; }\n};\n\nld norm2(const Pt &a) { return a * a; }\n\nld norm(const Pt &a) { return sqrt(norm2(a)); }\n\nint n;\n\nvector<Pt> v;\n\nvoid init() {\n\n  cin >> n;\n\n  for (int i = 0; i < n; ++i) {\n\n    ld x, y;\n    cin >> x >> y;\n\n    v.push_back(Pt(x, y));\n  }\n}\n\nvoid solve() {\n\n  sort(v.begin(), v.end());\n\n  ld ans = 0;\n\n  v.insert(v.end(), v.begin(), v.end());\n\n  for (int i = 0; i < (int)v.size(); ++i) {\n\n    for (int j = 1; j <= n; ++j) {\n\n      Pt now = {0, 0};\n\n      for (int k = i; k < i + j; ++k) {\n\n        now = now + v[k];\n      }\n\n      ans = max(ans, norm(now));\n    }\n  }\n\n  cout << fixed << setprecision(15) << ans << '\\n';\n}\n\nint32_t main() {\n\n  ios_base::sync_with_stdio(0), cin.tie(0);\n\n  init();\n\n  solve();\n}\n"}
{"fast_code_id":"f4bcb30de86cdaf01e88c463bc21bce9c74fd07974615dbeb78e09b8f56e1c8e","fast_id":"0dd4d2c6a93fb77d3a723bae0b893e932a11cd68473b3496814b1aa47fc5bb35","fast_time":0.0272468499,"language":"cpp","measured_fast_code_id":"0dd4d2c6a93fb77d3a723bae0b893e932a11cd68473b3496814b1aa47fc5bb35","measured_slow_code_id":"c060d1c820e31694040512e6f97113193c26f7d9fea6bd9974798daff059feef","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15366","problem_id":"p02599","slow_code_id":"6da8b31eb2a645147353bc45a7902e3ef0958002fb92169f20282dfba8dfea69","slow_id":"c060d1c820e31694040512e6f97113193c26f7d9fea6bd9974798daff059feef","slow_time":0.1944613136,"speedup":7.137020034011344,"stratum":"4-8","sampling_key":"92c2c33d22a3105260cb113bc3a48024981a64908f7224d17631fb790f3b8ac3","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\nusing P = pair<int, int>;\n\n#define rep(i, n) for (ll i = 0; i < (ll)n; i++)\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define MOD 1000000007\n\nclass Mo {\n\npublic:\n  vector<int> l, r, ord;\n\n  vector<bool> is;\n\n  int wid, nl, nr, ptr;\n\n  Mo(int n) : wid((int)sqrt(n)), nl(0), nr(0), ptr(0), is(n) {}\n\n  void insert(int a, int b) {\n\n    l.push_back(a);\n\n    r.push_back(b);\n  }\n\n  void build() {\n\n    ord.resize(l.size());\n\n    iota(ALL(ord), 0);\n\n    sort(ALL(ord), [&](int a, int b) {\n      if (l[a] / wid != l[b] / wid)\n        return l[a] < l[b];\n\n      if (r[a] == r[b])\n        return l[a] < l[b];\n\n      return bool((r[a] < r[b]) ^ ((l[a] / wid) & 1));\n    });\n  }\n\n  inline int process() {\n\n    if (ptr == ord.size())\n      return -1;\n\n    const int idx = ord[ptr++];\n\n    while (nl < l[idx])\n      distribute(nl++);\n\n    while (nl > l[idx])\n      distribute(--nl);\n\n    while (nr > r[idx])\n      distribute(--nr);\n\n    while (nr < r[idx])\n      distribute(nr++);\n\n    return idx;\n  }\n\n  inline void distribute(int idx) {\n\n    is[idx].flip();\n\n    if (is[idx])\n      add(idx);\n\n    else\n      del(idx);\n  }\n\n  void add(int idx);\n\n  void del(int idx);\n};\n\nvector<int> v(500010);\n\nvector<int> cnt(500010);\n\nvector<int> res(500010);\n\nint sum = 0;\n\ninline void Mo::add(int idx) {\n\n  cnt[v[idx]]++;\n\n  if (cnt[v[idx]] == 1)\n    sum++;\n}\n\ninline void Mo::del(int idx) {\n\n  cnt[v[idx]]--;\n\n  if (cnt[v[idx]] == 0)\n    sum--;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(0);\n\n  int n, Q;\n\n  cin >> n >> Q;\n\n  rep(i, n) cin >> v[i];\n\n  Mo mo(n);\n\n  rep(_, Q) {\n\n    int l, r;\n    cin >> l >> r;\n\n    mo.insert(--l, r);\n  }\n\n  mo.build();\n\n  rep(_, Q) {\n\n    int idx = mo.process();\n\n    res[idx] = sum;\n  }\n\n  rep(i, Q) cout << res[i] << \"\\n\";\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\nusing P = pair<int, int>;\n\n#define rep(i, n) for (ll i = 0; i < (ll)n; i++)\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define MOD 1000000007\n\nstruct Mo {\n\n  using F = function<void(int)>;\n\n  vector<int> l, r, ord;\n\n  int n, wid, nl, nr, ptr;\n\n  F expandL, expandR;\n\n  F shrinkL, shrinkR;\n\n  Mo(int n, int wid, F expandL, F expandR, F shrinkL, F shrinkR)\n      :\n\n        n(n), wid(wid), nl(0), nr(0), ptr(0),\n\n        expandL(expandL), expandR(expandR), shrinkL(shrinkL), shrinkR(shrinkR) {}\n\n  Mo(int n, int wid, F expand, F shrink) { *this = Mo(n, wid, expand, expand, shrink, shrink); }\n\n  inline void add(int a, int b) {\n\n    l.emplace_back(a);\n\n    r.emplace_back(b);\n  }\n\n  void build() {\n\n    ord.resize(l.size());\n\n    iota(ALL(ord), 0);\n\n    sort(ALL(ord), [&](int a, int b) {\n      if (l[a] / wid != l[b] / wid)\n        return l[a] < l[b];\n\n      if (r[a] == r[b])\n        return l[a] < l[b];\n\n      return bool((r[a] < r[b]) ^ ((l[a] / wid) & 1));\n    });\n  }\n\n  inline int process() {\n\n    if (ptr == (int)ord.size())\n      return -1;\n\n    const int idx = ord[ptr++];\n\n    while (nl > l[idx])\n      expandL(--nl);\n\n    while (nr < r[idx])\n      expandR(nr++);\n\n    while (nl < l[idx])\n      shrinkL(nl++);\n\n    while (nr > r[idx])\n      shrinkR(--nr);\n\n    return idx;\n  }\n};\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(0);\n\n  int n, Q;\n\n  cin >> n >> Q;\n\n  vector<int> v(n);\n\n  rep(i, n) cin >> v[i];\n\n  int sum = 0;\n\n  vector<int> cnt(n + 1);\n\n  auto expand = [&](int k) {\n    sum += cnt[v[k]]++ == 0;\n  };\n\n  auto shrink = [&](int k) {\n    sum -= --cnt[v[k]] == 0;\n  };\n\n  Mo mo(n, 1000, expand, shrink);\n\n  rep(_, Q) {\n\n    int a, b;\n    cin >> a >> b;\n\n    mo.add(--a, b);\n  }\n\n  vector<int> res(Q);\n\n  mo.build();\n\n  rep(_, Q) {\n\n    int idx = mo.process();\n\n    res[idx] = sum;\n  }\n\n  rep(i, Q) cout << res[i] << \"\\n\";\n\n  return 0;\n}"}
{"fast_code_id":"8169f553a548d85f7dbbf5270283a7e64aaefdfb1f7fdc519dfc00c409ed285e","fast_id":"b59753b4ff5afa1657b9256ab0654119aba3c98a4c0d787634982ea61fd8842f","fast_time":0.1754950921,"language":"cpp","measured_fast_code_id":"b59753b4ff5afa1657b9256ab0654119aba3c98a4c0d787634982ea61fd8842f","measured_slow_code_id":"912a623de9bd994e64075e46ca730c90a4a8b2e3595a59e5cd6b63b25551bfbb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1541","problem_id":"p01317","slow_code_id":"117fc838ea6191ecda423eb1415444d0fea6cefd9ed62062b1f98bd375bddaeb","slow_id":"912a623de9bd994e64075e46ca730c90a4a8b2e3595a59e5cd6b63b25551bfbb","slow_time":0.3672909795,"speedup":2.0928846220423734,"stratum":"2-4","sampling_key":"c34805c4b9026b57afa17928168f53fa8e38575f5e1397c2e0bfb95c410293c7","slow_code":"\n\n#include <vector>\n\n#include <list>\n\n#include <map>\n\n#include <set>\n\n#include <deque>\n\n#include <stack>\n\n#include <bitset>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <cctype>\n\n#include <string>\n\n#include <cstring>\n\n#include <ctime>\n\n#include <climits>\n\n#include <queue>\n\nusing namespace std;\n\ntypedef vector<int> VI;\n\ntypedef vector<VI> VVI;\n\ntypedef vector<string> VS;\n\ntypedef pair<int, int> PII;\n\ntypedef long long LL;\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define RALL(a) (a).rbegin(), (a).rend()\n\n#define PB push_back\n\n#define MP make_pair\n\n#define SZ(a) int((a).size())\n\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n\n#define EXIST(s, e) ((s).find(e) != (s).end())\n\n#define SORT(c) sort((c).begin(), (c).end())\n\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\nconst double EPS = 1e-10;\n\nconst double PI = acos(-1.0);\n\nconst LL INF = 1e14;\n\nLL dist_L[201][201];\n\nLL dist_S[201][201];\n\nLL dp[1001][201];\n\nint main() {\n\n  cin.tie(0);\n\n  ios_base::sync_with_stdio(false);\n\n  int N, M, R;\n\n  while (cin >> N >> M, N) {\n\n    fill((LL *)dist_L, (LL *)dist_L + 201 * 201, INF);\n\n    fill((LL *)dist_S, (LL *)dist_S + 201 * 201, INF);\n\n    REP(i, N) dist_L[i][i] = dist_S[i][i] = 0;\n\n    REP(i, M) {\n\n      LL x, y, t;\n      char c;\n\n      cin >> x >> y >> t >> c;\n\n      --x, --y;\n\n      if (c == 'L')\n\n        dist_L[x][y] = dist_L[y][x] = min(dist_L[x][y], t);\n\n      else\n\n        dist_S[x][y] = dist_S[y][x] = min(dist_S[x][y], t);\n    }\n\n    REP(k, N) REP(i, N) REP(j, N) {\n\n      dist_L[i][j] = dist_L[j][i] = min(dist_L[i][j], dist_L[i][k] + dist_L[k][j]);\n\n      dist_S[i][j] = dist_S[j][i] = min(dist_S[i][j], dist_S[i][k] + dist_S[k][j]);\n    }\n\n    cin >> R;\n\n    VI RS(R);\n\n    REP(i, R) {\n\n      cin >> RS[i];\n\n      --RS[i];\n    }\n\n    fill((LL *)dp, (LL *)dp + 1001 * 201, INF);\n\n    dp[0][RS[0]] = 0;\n\n    REP(i, R - 1) {\n\n      REP(u, N) {\n\n        REP(v, N) {\n\n          dp[i + 1][v] = min(dp[i + 1][v],\n\n                             dp[i][u] + dist_L[RS[i]][u] + dist_S[u][v] + dist_L[v][RS[i + 1]]\n\n          );\n        }\n\n        dp[i + 1][u] = min(dp[i + 1][u], dp[i][u] + dist_L[RS[i]][RS[i + 1]]);\n      }\n    }\n\n    LL ans = INF;\n\n    REP(u, N) ans = min(ans, dp[R - 1][u]);\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <cstdlib>\n\n#include <sstream>\n\n#include <string>\n\n#include <set>\n\n#include <map>\n\n#include <stack>\n\n#include <queue>\n\n#include <deque>\n\n#include <complex>\n\n#include <vector>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <utility>\n\n#define rep(i, a, b) for (int i = (a); i < (b); i++)\n\n#define all(c) (c).begin(), (c).end()\n\n#define rall(c) (c).rbegin(), (c).rend()\n\n#define ll long long\n\n#define pb(a) push_back(a)\n\n#define fi first\n\n#define se second\n\nusing namespace std;\n\ntemplate <class T> inline string toString(T x) {\n\n  ostringstream sout;\n  sout << x;\n  return sout.str();\n}\n\nconst ll MOD = 1e9 + 7;\n\nconst int inf = (ll)1e9;\n\nconst double PI = acos(-1.0);\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.precision(10);\n\n  cout << fixed;\n\n  int n, m;\n\n  while (cin >> n >> m, n) {\n\n    int ldp[201][201];\n\n    int sdp[201][201];\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = 0; j < n; j++) {\n\n        ldp[i][j] = inf;\n\n        sdp[i][j] = inf;\n      }\n    }\n\n    for (int i = 0; i < n; i++) {\n\n      ldp[i][i] = 0;\n\n      sdp[i][i] = 0;\n    }\n\n    for (int i = 0; i < m; i++) {\n\n      int a, b, c;\n\n      char d;\n\n      cin >> a >> b >> c >> d;\n\n      a--;\n      b--;\n\n      if (d == 'L') {\n\n        ldp[a][b] = c;\n\n        ldp[b][a] = c;\n\n      } else {\n\n        sdp[a][b] = c;\n\n        sdp[b][a] = c;\n      }\n    }\n\n    for (int k = 0; k < n; k++) {\n\n      for (int i = 0; i < n; i++) {\n\n        for (int j = 0; j < n; j++) {\n\n          ldp[i][j] = min(ldp[i][k] + ldp[k][j], ldp[i][j]);\n\n          sdp[i][j] = min(sdp[i][k] + sdp[k][j], sdp[i][j]);\n        }\n      }\n    }\n\n    int r;\n    cin >> r;\n\n    int a[1002];\n\n    for (int i = 0; i < r; i++) {\n\n      cin >> a[i];\n\n      a[i]--;\n    }\n\n    int dp[1001][201];\n\n    for (int i = 0; i < 1001; i++)\n      for (int j = 0; j < 201; j++)\n        dp[i][j] = inf;\n\n    dp[0][a[0]] = 0;\n\n    for (int i = 0; i < r - 1; i++) {\n\n      for (int j = 0; j < n; j++) {\n\n        if (dp[i][j] == inf)\n          continue;\n\n        for (int k = 0; k < n; k++) {\n\n          dp[i + 1][k] = min(dp[i + 1][k], dp[i][j] + ldp[a[i]][j] + sdp[j][k] + ldp[k][a[i + 1]]);\n\n          if (j == k)\n            dp[i + 1][k] = min(dp[i + 1][k], dp[i][j] + ldp[a[i]][a[i + 1]]);\n        }\n      }\n    }\n\n    int ans = inf;\n\n    for (int i = 0; i < 201; i++) {\n\n      ans = min(ans, dp[r - 1][i]);\n    }\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"b16e8e28712cf1a196afc6f5f3ebaf9b2f3e8bd85802bae5368989c94ecb49dd","fast_id":"5914af713e344d5daad54082a5721533075501d6363fd3be2e108b21c9aad569","fast_time":0.0455391139,"language":"cpp","measured_fast_code_id":"5914af713e344d5daad54082a5721533075501d6363fd3be2e108b21c9aad569","measured_slow_code_id":"77cc56601c27e8bba731131f864c47542e2f81f9ad8771bcc3d7189f19a977df","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15421","problem_id":"p03963","slow_code_id":"fdfcb703e3314764a0bf11e786d5135cedae60bb41feb6a8b6ee8268893f37b5","slow_id":"77cc56601c27e8bba731131f864c47542e2f81f9ad8771bcc3d7189f19a977df","slow_time":0.4346256969,"speedup":9.544008648354488,"stratum":"8+","sampling_key":"b12824074a64778124d52a1eff8a7e3670b1dd35b8c2e542bd63f49410431777","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<long long, long long> pll;\n\n#define ff first\n\n#define ss second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define all(x) (x).begin(), (x).end()\n\n#define FastIO                                                                                     \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0);\n\n#define reset(x) memset(x, -1, sizeof(x))\n\n#define CheckBit(a, b) (a & (1ll << b))\n\n#define SetBit(a, b) a = (a | (1ll << b))\n\n#define UnSetBit(a, b) a = (a & (~(1ll << b)))\n\n#define maxx 10000006\n\n#define PI 2 * acos(0.0)\n\nconst long long INF = 2000000000000000000LL;\n\nconst int inf = 0x3f3f3f3f;\n\nconst long double EPS = 1e-9;\n\ninline ll mulmod(ll a, ll b, ll c) {\n\n  ll ret = 0, cur = a % c;\n\n  while (b) {\n    if (b % 2)\n      ret = (ret + cur) % c;\n    cur = (cur << 1) % c;\n    b = b >> 1;\n  }\n\n  return ret % c;\n}\n\ninline ll bigmod(ll b, ll p, ll m) {\n\n  ll ret = 1, cur = b % m;\n\n  while (p) {\n    if (p & 1)\n      ret = (ret * cur) % m;\n    cur = (cur * cur) % m;\n    p = p >> 1;\n  }\n\n  return ret;\n}\n\ninline ll modulo(ll a, ll b, ll c) {\n\n  ll ret = 1, cur = a % c;\n\n  while (b) {\n    if (b % 2)\n      ret = mulmod(ret, cur, c);\n    cur = mulmod(cur, cur, c);\n    b = b >> 1;\n  }\n\n  return ret % c;\n}\n\ninline ll power(ll b, ll p) {\n\n  ll ret = 1, cur = b;\n\n  while (p) {\n    if (p & 1)\n      ret = (ret * cur);\n    cur = (cur * cur);\n    p = p >> 1;\n  }\n\n  return ret;\n}\n\nll lcm(ll a, ll b)\n\n{\n\n  return (a / __gcd(a, b)) * b;\n}\n\nll gcd(ll a, ll b)\n\n{\n\n  return __gcd(a, b);\n}\n\nll n, k;\n\nll dp[1002][1002];\n\nll f(ll pos, ll colour)\n\n{\n\n  if (pos == n - 1) {\n\n    return 1;\n  }\n\n  if (dp[pos][colour] != -1) {\n\n    return dp[pos][colour];\n  }\n\n  ll ans = 0;\n\n  for (int i = 0; i < k; i++) {\n\n    if (i != colour)\n\n      ans += f(pos + 1, i);\n  }\n\n  return dp[pos][colour] = ans;\n}\n\nvoid Dufaux()\n\n{\n\n  reset(dp);\n\n  cin >> n >> k;\n\n  ll ans = 0;\n\n  ans = f(0, 0);\n\n  cout << ans * k << endl;\n}\n\nint main()\n\n{\n\n  FastIO;\n\n  int test = 1;\n\n  while (test--) {\n\n    Dufaux();\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  int n, k;\n  cin >> n >> k;\n\n  n -= 1;\n\n  unsigned long long ans = k;\n\n  while (n--) {\n\n    ans *= k - 1;\n  }\n\n  cout << ans;\n}"}
{"fast_code_id":"7d1971fcfb64065eae684a230bf52875edfe9222afd2f120f7f7f0458356f221","fast_id":"009c50122c1c30322cc0487378c4b120038a665b28a18ac2a51c944574cd419f","fast_time":0.0199582672,"language":"cpp","measured_fast_code_id":"009c50122c1c30322cc0487378c4b120038a665b28a18ac2a51c944574cd419f","measured_slow_code_id":"ba95cbb603a144ed8fee94fe847635d54ed34a404b2c997602ef59491df440eb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15433","problem_id":"p03265","slow_code_id":"e9a41d41fbe5c9d0eea47d7a58403b13d401e555172f1727971e1151eb804488","slow_id":"ba95cbb603a144ed8fee94fe847635d54ed34a404b2c997602ef59491df440eb","slow_time":0.3588650637,"speedup":17.980772584305313,"stratum":"8+","sampling_key":"32b20b08b66041b91b56894d27b2a7bbfe1e86923900ccde6cc6da81c1a42fe8","slow_code":"#include <iostream>\n\nusing namespace std;\n\nstruct node {\n\n  int x, y;\n\n  int len;\n\n  node(){};\n\n  node(int xx, int yy) {\n    x = xx;\n    y = yy;\n    len = x * x + y * y;\n  }\n\n  bool judge(node t)\n\n  {\n\n    if (t.len == len && (x * t.y - y * t.x) > 0 && (t.x * x + t.y * y) == 0)\n      return 1;\n\n    else\n      return 0;\n  };\n};\n\nint main()\n\n{\n\n  node p1, p2, p3, p4, tt, t;\n\n  int x, y;\n\n  cin >> x >> y;\n\n  p1 = node(x, y);\n\n  cin >> x >> y;\n\n  p2 = node(x, y);\n\n  tt = node(p2.x - p1.x, p2.y - p1.y);\n\n  for (int i = -400; i <= 400; ++i)\n\n  {\n\n    for (int j = -400; j <= 400; ++j)\n\n    {\n\n      t = node(i, j);\n\n      t = node(t.x - p2.x, t.y - p2.y);\n\n      if (tt.judge(t))\n        p3 = node(i, j);\n\n      t = node(i, j);\n\n      t = node(p1.x - t.x, p1.y - t.y);\n\n      if (t.judge(tt))\n        p4 = node(i, j);\n    }\n  }\n\n  cout << p3.x << \" \" << p3.y << \" \" << p4.x << \" \" << p4.y << endl;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int x1, y1, x2, y2, x3, y3, x4, y4, d1, d2;\n\n  scanf(\"%d %d %d %d\", &x1, &y1, &x2, &y2);\n\n  d1 = x2 - x1;\n\n  d2 = y1 - y2;\n\n  x3 = x2 + d2;\n\n  y3 = y2 + d1;\n\n  x4 = x1 + d2;\n\n  y4 = y1 + d1;\n\n  printf(\"%d %d %d %d\\n\", x3, y3, x4, y4);\n\n  return 0;\n}"}
{"fast_code_id":"5d9c089b52675b6cf17c3057365aa376e3ad175f93a04ef09c8c9b67163446ab","fast_id":"6eb2f4198ca2d47d3a3eb619a04b310c5b6850ee0785e932d587a332fefb1e3b","fast_time":0.0103423217,"language":"cpp","measured_fast_code_id":"6eb2f4198ca2d47d3a3eb619a04b310c5b6850ee0785e932d587a332fefb1e3b","measured_slow_code_id":"74b2814bcb9be109d10f857baf669e8893312701374cb50c07829ea9d6b3c327","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15438","problem_id":"p02763","slow_code_id":"be4a8645a21f9c319c3f207c7914e70edbd3bed1f1d6a433f68c59f5373c7172","slow_id":"74b2814bcb9be109d10f857baf669e8893312701374cb50c07829ea9d6b3c327","slow_time":0.0438378941,"speedup":4.238689858196927,"stratum":"4-8","sampling_key":"1be0c6d6969b181a4072f778ea02145ee41a82efc51bce3109e6cc37903461f6","slow_code":"#include <vector>\n\n#include <bitset>\n\n#include <iostream>\n\nusing B = std::bitset<32>;\n\nint main()\n\n{\n\n  int N;\n\n  std::cin >> N;\n\n  int S[500000];\n\n  for (int i = 0; i < N; ++i) {\n\n    char c;\n\n    std::cin >> c;\n\n    S[i] = 1 << (c - 'a');\n  }\n\n  int Q;\n\n  std::cin >> Q;\n\n  while (Q--) {\n\n    int q;\n\n    std::cin >> q;\n\n    if (q == 1) {\n\n      int i;\n\n      char c;\n\n      std::cin >> i >> c;\n\n      S[i - 1] = 1 << (c - 'a');\n\n    } else {\n\n      int r, l;\n\n      std::cin >> r >> l;\n\n      --r;\n\n      int res{};\n\n      for (int i = r; i < l; ++i) {\n\n        res |= S[i];\n      }\n\n      B ans(res);\n\n      std::cout << ans.count() << '\\n';\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <vector>\n\n#include <bitset>\n\n#include <cstdio>\n\nusing B = std::bitset<32>;\n\nint main()\n\n{\n\n  int N;\n\n  scanf(\"%d\\n\", &N);\n\n  int S[500000];\n\n  for (int i = 0; i < N; ++i) {\n\n    char c;\n\n    scanf(\"%c\", &c);\n\n    S[i] = 1 << (c - 'a');\n  }\n\n  int Q;\n\n  scanf(\"\\n%d\\n\", &Q);\n\n  while (Q--) {\n\n    int q;\n\n    scanf(\"%d \", &q);\n\n    if (q == 1) {\n\n      int i;\n\n      char c;\n\n      scanf(\"%d %c\\n\", &i, &c);\n\n      S[i - 1] = 1 << (c - 'a');\n\n    } else {\n\n      int r, l;\n\n      scanf(\"%d %d\\n\", &r, &l);\n\n      --r;\n\n      int res{};\n\n      for (int i = r; i < l; ++i) {\n\n        res |= S[i];\n      }\n\n      B ans(res);\n\n      printf(\"%d\\n\", ans.count());\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"a34a9fbff0ac624c33c17ae03375450aff57d807f83e48abf0f92e5b084db7ae","fast_id":"b9cf4c049466fc15bae4d5957080b0bde9ac5117f5c3d4cf431de574e57f99e6","fast_time":0.0382254516,"language":"cpp","measured_fast_code_id":"b9cf4c049466fc15bae4d5957080b0bde9ac5117f5c3d4cf431de574e57f99e6","measured_slow_code_id":"e3e6f29bfd49755cf1543466c48dbeacb3ddb9fab231d8ecb15b01657265b8b3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15454","problem_id":"p03699","slow_code_id":"17db6b4591c28201b77c182050b30aef2ae34ccb87d77bb4dae137a356f21e79","slow_id":"e3e6f29bfd49755cf1543466c48dbeacb3ddb9fab231d8ecb15b01657265b8b3","slow_time":0.3547388768,"speedup":9.280174908384861,"stratum":"8+","sampling_key":"5661a4cad28ffad97af4cbc2479a7731f899416db59f7435cd79ba9c3dd7969f","slow_code":"\n\n#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\ntemplate <class T>\nusing oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n\n#define MOD 1000000007\n\n#define ll long long int\n\n#define u64 unsigned long long int\n\n#define ff first\n\n#define ss second\n\n#define all(x) x.begin(), x.end()\n\n#define ub upper_bound\n\n#define lb lower_bound\n\n#define MAX_INT 10005\n\n#define PI 3.141592653589793\n\n#define trace1(x) cerr << #x << \": \" << x << endl\n\n#define trace2(x, y) cerr << #x << \": \" << x << \" | \" << #y << \": \" << y << endl\n\n#define trace3(x, y, z)                                                                            \\\n  cerr << #x << \":\" << x << \" | \" << #y << \": \" << y << \" | \" << #z << \": \" << z << endl\n\n#define trace4(a, b, c, d)                                                                         \\\n  cerr << #a << \": \" << a << \" | \" << #b << \": \" << b << \" | \" << #c << \": \" << c << \" | \" << #d   \\\n       << \": \" << d << endl\n\n#define trace5(a, b, c, d, e)                                                                      \\\n  cerr << #a << \": \" << a << \" | \" << #b << \": \" << b << \" | \" << #c << \": \" << c << \" | \" << #d   \\\n       << \": \" << d << \" | \" << #e << \": \" << e << endl\n\n#define trace6(a, b, c, d, e, f)                                                                   \\\n  cerr << #a << \": \" << a << \" | \" << #b << \": \" << b << \" | \" << #c << \": \" << c << \" | \" << #d   \\\n       << \": \" << d << \" | \" << #e << \": \" << e << \" | \" << #f << \": \" << f << endl\n\n#define go                                                                                         \\\n  ios::sync_with_stdio(0);                                                                         \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0);\n\n#define fi(a, b, c, d) for (int a = b; a < c; a += d)\n\n#define fl(a, b, c, d) for (ll a = b; a < c; a += d)\n\n#define fei(a, b, c, d) for (int a = b; a <= c; a += d)\n\n#define fel(a, b, c, d) for (ll a = b; a <= c; a += d)\n\n#define quit exit(0)\n\n#define mem(x, a) memset(x, a, sizeof x)\n\n#define pii pair<int, int>\n\n#define pll pair<ll, ll>\n\n#define pcl pair<char, ll>\n\n#define psl pair<string, ll>\n\nll N, M, A, B, C;\n\nll arr[MAX_INT], arr1[MAX_INT], data[MAX_INT];\n\nvector<ll> V, V1;\n\nunordered_map<ll, ll> mp;\n\nset<ll> s;\n\nstring S = \"\";\n\nll cases;\n\nll cache[105][MAX_INT];\n\nll rec(ll ind, ll val) {\n\n  if (ind >= V.size()) {\n\n    if (val % 10 == 0) {\n\n      return -val;\n\n    }\n\n    else {\n\n      return 0;\n    }\n  }\n\n  ll &ans = cache[ind][val];\n\n  if (ans != -1) {\n\n    return ans;\n  }\n\n  ans = -1e15;\n\n  ans = max({ans, V[ind] + rec(ind + 1, (val + V[ind])), rec(ind + 1, val)});\n\n  return ans;\n}\n\nint main() {\n\n  go;\n\n  cin >> N;\n\n  ll maxVal = -1e15;\n\n  ll sum = 0;\n\n  fi(i, 0, N, 1) {\n\n    cin >> arr[i];\n\n    if (arr[i] % 10) {\n\n      V.push_back(arr[i]);\n\n    }\n\n    else {\n\n      V1.push_back(arr[i]);\n\n      sum += arr[i];\n    }\n  }\n\n  if (!V.size()) {\n\n    cout << 0 << \"\\n\";\n\n  }\n\n  else {\n\n    mem(cache, -1);\n\n    sort(all(V1));\n\n    reverse(all(V1));\n\n    sum += rec(0, 0);\n\n    cout << sum << \"\\n\";\n  }\n\n  return 0;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\ntemplate <class T>\nusing oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n\n#define MOD 1000000007\n\n#define ll long long int\n\n#define u64 unsigned long long int\n\n#define ff first\n\n#define ss second\n\n#define all(x) x.begin(), x.end()\n\n#define ub upper_bound\n\n#define lb lower_bound\n\n#define MAX_INT 105\n\n#define PI 3.141592653589793\n\n#define trace1(x) cerr << #x << \": \" << x << endl\n\n#define trace2(x, y) cerr << #x << \": \" << x << \" | \" << #y << \": \" << y << endl\n\n#define trace3(x, y, z)                                                                            \\\n  cerr << #x << \":\" << x << \" | \" << #y << \": \" << y << \" | \" << #z << \": \" << z << endl\n\n#define trace4(a, b, c, d)                                                                         \\\n  cerr << #a << \": \" << a << \" | \" << #b << \": \" << b << \" | \" << #c << \": \" << c << \" | \" << #d   \\\n       << \": \" << d << endl\n\n#define trace5(a, b, c, d, e)                                                                      \\\n  cerr << #a << \": \" << a << \" | \" << #b << \": \" << b << \" | \" << #c << \": \" << c << \" | \" << #d   \\\n       << \": \" << d << \" | \" << #e << \": \" << e << endl\n\n#define trace6(a, b, c, d, e, f)                                                                   \\\n  cerr << #a << \": \" << a << \" | \" << #b << \": \" << b << \" | \" << #c << \": \" << c << \" | \" << #d   \\\n       << \": \" << d << \" | \" << #e << \": \" << e << \" | \" << #f << \": \" << f << endl\n\n#define go                                                                                         \\\n  ios::sync_with_stdio(0);                                                                         \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0);\n\n#define fi(a, b, c, d) for (int a = b; a < c; a += d)\n\n#define fl(a, b, c, d) for (ll a = b; a < c; a += d)\n\n#define fei(a, b, c, d) for (int a = b; a <= c; a += d)\n\n#define fel(a, b, c, d) for (ll a = b; a <= c; a += d)\n\n#define quit exit(0)\n\n#define mem(x, a) memset(x, a, sizeof x)\n\n#define pii pair<int, int>\n\n#define pll pair<ll, ll>\n\n#define pcl pair<char, ll>\n\n#define psl pair<string, ll>\n\nll N, M, A, B, C;\n\nll arr[MAX_INT], arr1[MAX_INT], data[MAX_INT];\n\nvector<ll> V;\n\nunordered_map<ll, ll> mp;\n\nset<ll> s;\n\nstring S = \"\";\n\nll cases;\n\nint main() {\n\n  go;\n\n  cin >> N;\n\n  ll sum = 0;\n\n  ll minVal = 100005;\n\n  fi(i, 0, N, 1) {\n\n    cin >> arr[i];\n\n    sum += arr[i];\n\n    if (arr[i] % 10) {\n\n      minVal = min(minVal, arr[i]);\n    }\n  }\n\n  if (sum % 10) {\n\n    cout << sum << \"\\n\";\n\n    quit;\n\n  }\n\n  else {\n\n    if (minVal == 100005) {\n\n      minVal = sum;\n    }\n\n    cout << sum - minVal << \"\\n\";\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"c9c6a4e606ad0d94c244edb488998b962e5c0371c9fda2fe8b3a4a56a3416097","fast_id":"d4fd84ba1022941fbaaa6407b17e58771dc0756d7fe44a24db6d4a49ef16b96e","fast_time":0.0851487937,"language":"cpp","measured_fast_code_id":"d4fd84ba1022941fbaaa6407b17e58771dc0756d7fe44a24db6d4a49ef16b96e","measured_slow_code_id":"ffc2490ff923af0ff17ddcb08e512e16b97630835df80f81b30d7e85aae4af24","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15514","problem_id":"p03044","slow_code_id":"aa6a27922fc2c8c9892c56ddc1455676a7e95e61651b60defed0d9da40562812","slow_id":"ffc2490ff923af0ff17ddcb08e512e16b97630835df80f81b30d7e85aae4af24","slow_time":0.6253033395,"speedup":7.343654705233951,"stratum":"4-8","sampling_key":"9ebc35cace667d8384873a6d85079253edaf3e7c4860b44e827ffd6af9d94db9","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define F first\n\n#define S second\n\n#define pii pair<int, int>\n\n#define eb emplace_back\n\n#define all(v) v.begin(), v.end()\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\n#define rep3(i, l, n) for (int i = l; i < (n); ++i)\n\n#define sz(v) (int)v.size()\n\n#define inf (int)(1e9 + 7)\n\n#define INF (ll)(1e18)\n\n#define abs(x) (x >= 0 ? x : -(x))\n\n#define ceil(a, b) a / b + !!(a % b)\n\ntemplate <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename T> T gcd(T a, T b) {\n  if (b == 0)\n    return a;\n  return gcd(b, a % b);\n}\n\nconst int maxn = 200005;\n\nvector<int> col(maxn, -1);\n\nvector<vector<pii> > g(maxn);\n\nvoid dfs(int now) {\n\n  for (pii nxt : g[now]) {\n\n    if (col[nxt.F] == -1) {\n\n      col[nxt.F] = col[now] ^ (nxt.S % 2);\n\n      dfs(nxt.F);\n    }\n  }\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int n;\n\n  cin >> n;\n\n  rep(i, n - 1) {\n\n    int u, v, w;\n\n    cin >> u >> v >> w;\n\n    u--;\n    v--;\n\n    g[u].eb(pii(v, w));\n\n    g[v].eb(pii(u, w));\n  }\n\n  col[0] = 0;\n\n  dfs(0);\n\n  rep(i, n) cout << col[i] << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define F first\n\n#define S second\n\n#define pii pair<int, int>\n\n#define eb emplace_back\n\n#define all(v) v.begin(), v.end()\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\n#define rep3(i, l, n) for (int i = l; i < (n); ++i)\n\n#define sz(v) (int)v.size()\n\nconst int inf = 1e9 + 7;\n\nconst ll INF = 1e18;\n\nint mod = 1000000007;\n\n#define abs(x) (x >= 0 ? x : -(x))\n\n#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())\n\n#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())\n\ntemplate <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename T> T gcd(T a, T b) {\n  if (b == 0)\n    return a;\n  return gcd(b, a % b);\n}\n\ntemplate <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }\n\ntemplate <typename T> T pow(T a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }\n\nll modpow(ll a, ll b, ll _mod) {\n  return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;\n}\n\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n  for (auto &vi : vec)\n    os << vi << \" \";\n  return os;\n}\n\ntemplate <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) {\n  os << p.F << \" \" << p.S;\n  return os;\n}\n\ntemplate <typename T> inline istream &operator>>(istream &is, vector<T> &v) {\n  rep(j, sz(v)) is >> v[j];\n  return is;\n}\n\ntemplate <class T> inline void add(T &a, int b) {\n  a += b;\n  if (a >= mod)\n    a -= mod;\n}\n\nvoid solve();\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  cout << fixed << setprecision(10);\n\n  int T;\n\n  T = 1;\n\n  while (T--) {\n\n    solve();\n  }\n}\n\nint n;\n\nvector<vector<pii> > G;\n\nvector<int> d;\n\nvoid dfs(int v, int p) {\n\n  for (pii P : G[v]) {\n\n    int nv = P.F;\n\n    int cost = P.S;\n\n    if (nv == p)\n      continue;\n\n    d[nv] = d[v] + cost;\n\n    d[nv] %= 2;\n\n    dfs(nv, v);\n  }\n}\n\nvoid solve() {\n\n  cin >> n;\n\n  G.resize(n);\n\n  d.resize(n);\n\n  rep(i, n - 1) {\n\n    int a, b, c;\n\n    cin >> a >> b >> c;\n\n    a--;\n    b--;\n\n    c %= 2;\n\n    G[a].eb(b, c);\n\n    G[b].eb(a, c);\n  }\n\n  dfs(0, -1);\n\n  rep(i, n) cout << d[i] << endl;\n}\n"}
{"fast_code_id":"da87c3cf55aee6b5ce7778ad14237f2112a296f3b345baa991afda0759ca96bd","fast_id":"6b5d14ff891fd9cff1817d0d673fa7cf159c49d2980a9a19c5611053bc50c9e6","fast_time":0.0991759154,"language":"cpp","measured_fast_code_id":"6b5d14ff891fd9cff1817d0d673fa7cf159c49d2980a9a19c5611053bc50c9e6","measured_slow_code_id":"fcb9d70a127083a708f773f0261e94425187f9b33d3ae86ea5b7256d95c2bd4c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1557","problem_id":"p02120","slow_code_id":"fff629f8af342db60cb62b8fd3bf2254745dadc03a802e276f6752815da4b523","slow_id":"fcb9d70a127083a708f773f0261e94425187f9b33d3ae86ea5b7256d95c2bd4c","slow_time":0.6155572251,"speedup":6.20672088195316,"stratum":"4-8","sampling_key":"bc3114b843fcca3044b06da6ea53b9ab052fbb3ef26d4899137e2d29aed5c31e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long int64;\n\nint N, M, W[100000];\n\nvector<int> g[100000];\n\nbool v[100000];\n\nint order[100000], low[100000], ptr;\n\nint64 sum[100000], ans[100000];\n\nvector<int> tree[100000];\n\nvoid dfs(int idx, int par)\n\n{\n\n  v[idx] = true;\n\n  order[idx] = ptr++;\n\n  low[idx] = order[idx];\n\n  sum[idx] = W[idx];\n\n  for (auto &to : g[idx]) {\n\n    if (!v[to]) {\n\n      dfs(to, idx);\n\n      low[idx] = min(low[idx], low[to]);\n\n      sum[idx] += sum[to];\n\n      tree[idx].emplace_back(to);\n\n    } else if (to != par) {\n\n      low[idx] = min(low[idx], order[to]);\n    }\n  }\n}\n\nvoid dfs2(int idx, int64 parcost)\n\n{\n\n  bool art = false;\n\n  int64 all = parcost;\n\n  if (idx == 0) {\n\n    if (tree[idx].size() > 1)\n      art = true;\n\n    else\n      art = false;\n\n  } else {\n\n    for (auto &to : tree[idx])\n      art |= order[idx] <= low[to];\n  }\n\n  for (auto &to : tree[idx])\n    all += sum[to];\n\n  if (art) {\n\n    int64 latte = parcost, malta = 0;\n\n    for (auto &to : tree[idx]) {\n\n      if (order[idx] <= low[to])\n        malta = max(malta, sum[to]);\n\n      else\n        latte += sum[to];\n    }\n\n    ans[idx] = max(latte, malta);\n\n  } else {\n\n    ans[idx] = sum[0] - W[idx];\n  }\n\n  for (auto &to : tree[idx])\n    dfs2(to, all + W[idx] - sum[to]);\n}\n\nint main()\n\n{\n\n  cin >> N >> M;\n\n  for (int i = 0; i < N; i++) {\n\n    cin >> W[i];\n  }\n\n  for (int i = 0; i < M; i++) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    --a, --b;\n\n    g[a].emplace_back(b);\n\n    g[b].emplace_back(a);\n  }\n\n  dfs(0, -1);\n\n  dfs2(0, 0);\n\n  for (int i = 0; i < N; i++) {\n\n    cout << ans[i] << endl;\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\n#include <utility>\n\nusing namespace std;\n\nusing int64 = long long;\n\nconst int mod = 1e9 + 7;\n\nconst int64 infll = (1LL << 62) - 1;\n\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n\n  IoSetup() {\n\n    cin.tie(nullptr);\n\n    ios::sync_with_stdio(false);\n\n    cout << fixed << setprecision(10);\n\n    cerr << fixed << setprecision(10);\n  }\n\n} iosetup;\n\ntemplate <typename T1, typename T2>\n\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n\n  os << p.first << \" \" << p.second;\n\n  return os;\n}\n\ntemplate <typename T1, typename T2>\n\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n\n  is >> p.first >> p.second;\n\n  return is;\n}\n\ntemplate <typename T>\n\nostream &operator<<(ostream &os, const vector<T> &v) {\n\n  for (int i = 0; i < (int)v.size(); i++) {\n\n    os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n  }\n\n  return os;\n}\n\ntemplate <typename T>\n\nistream &operator>>(istream &is, vector<T> &v) {\n\n  for (T &in : v)\n    is >> in;\n\n  return is;\n}\n\ntemplate <typename T1, typename T2>\n\ninline bool chmax(T1 &a, T2 b) {\n  return a < b && (a = b, true);\n}\n\ntemplate <typename T1, typename T2>\n\ninline bool chmin(T1 &a, T2 b) {\n  return a > b && (a = b, true);\n}\n\ntemplate <typename T = int64>\n\nvector<T> make_v(size_t a) {\n\n  return vector<T>(a);\n}\n\ntemplate <typename T, typename... Ts>\n\nauto make_v(size_t a, Ts... ts) {\n\n  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\n}\n\ntemplate <typename T, typename V>\n\ntypename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {\n\n  t = v;\n}\n\ntemplate <typename T, typename V>\n\ntypename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {\n\n  for (auto &e : t)\n    fill_v(e, v);\n}\n\ntemplate <typename F>\n\nstruct FixPoint : F {\n\n  FixPoint(F &&f) : F(forward<F>(f)) {}\n\n  template <typename... Args>\n\n  decltype(auto) operator()(Args &&... args) const {\n\n    return F::operator()(*this, forward<Args>(args)...);\n  }\n};\n\ntemplate <typename F>\n\ninline decltype(auto) MFP(F &&f) {\n\n  return FixPoint<F>{forward<F>(f)};\n}\n\ntemplate <typename T>\n\nstruct Edge {\n\n  int from, to;\n\n  T cost;\n\n  int idx;\n\n  Edge() = default;\n\n  Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n  operator int() const { return to; }\n};\n\ntemplate <typename T = int>\n\nstruct Graph {\n\n  vector<vector<Edge<T > > > g;\n\n  int es;\n\n  Graph() = default;\n\n  explicit Graph(int n) : g(n), es(0) {}\n\n  size_t size() const { return g.size(); }\n\n  void add_directed_edge(int from, int to, T cost = 1) {\n\n    g[from].emplace_back((Edge<T>){from, to, cost, es++});\n  }\n\n  void add_edge(int from, int to, T cost = 1) {\n\n    g[from].emplace_back((Edge<T>){from, to, cost, es});\n\n    g[to].emplace_back((Edge<T>){to, from, cost, es++});\n  }\n\n  void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n\n    for (int i = 0; i < M; i++) {\n\n      int a, b;\n\n      cin >> a >> b;\n\n      a += padding;\n\n      b += padding;\n\n      T c = T(1);\n\n      if (weighted)\n        cin >> c;\n\n      if (directed)\n        add_directed_edge(a, b, c);\n\n      else\n        add_edge(a, b, c);\n    }\n  }\n};\n\ntemplate <typename T = int>\n\nstruct LowLink : Graph<T> {\n\npublic:\n  using Graph<T>::Graph;\n\n  vector<int> ord, low, articulation;\n\n  vector<Edge<T > >  bridge;\n\n  using Graph<T>::g;\n\n  virtual void build() {\n\n    used.assign(g.size(), 0);\n\n    ord.assign(g.size(), 0);\n\n    low.assign(g.size(), 0);\n\n    int k = 0;\n\n    for (int i = 0; i < (int)g.size(); i++) {\n\n      if (!used[i])\n        k = dfs(i, k, -1);\n    }\n  }\n\n  explicit LowLink(const Graph<T> &g) : Graph<T>(g) {}\n\nprivate:\n  vector<int> used;\n\n  int dfs(int idx, int k, int par) {\n\n    used[idx] = true;\n\n    ord[idx] = k++;\n\n    low[idx] = ord[idx];\n\n    bool is_articulation = false, beet = false;\n\n    int cnt = 0;\n\n    for (auto &to : g[idx]) {\n\n      if (to == par && !exchange(beet, true)) {\n\n        continue;\n      }\n\n      if (!used[to]) {\n\n        ++cnt;\n\n        k = dfs(to, k, idx);\n\n        low[idx] = min(low[idx], low[to]);\n\n        is_articulation |= par >= 0 && low[to] >= ord[idx];\n\n        if (ord[idx] < low[to])\n          bridge.emplace_back(to);\n\n      } else {\n\n        low[idx] = min(low[idx], ord[to]);\n      }\n    }\n\n    is_articulation |= par == -1 && cnt > 1;\n\n    if (is_articulation)\n      articulation.push_back(idx);\n\n    return k;\n  }\n};\n\ntemplate <typename T = int>\n\nstruct BiConnectedComponents : LowLink<T> {\n\npublic:\n  using LowLink<T>::LowLink;\n\n  using LowLink<T>::g;\n\n  using LowLink<T>::ord;\n\n  using LowLink<T>::low;\n\n  vector<vector<Edge<T > > > bc;\n\n  void build() override {\n\n    LowLink<T>::build();\n\n    used.assign(g.size(), 0);\n\n    for (int i = 0; i < used.size(); i++) {\n\n      if (!used[i])\n        dfs(i, -1);\n    }\n  }\n\n  explicit BiConnectedComponents(const Graph<T> &g) : Graph<T>(g) {}\n\nprivate:\n  vector<int> used;\n\n  vector<Edge<T > >  tmp;\n\n  void dfs(int idx, int par) {\n\n    used[idx] = true;\n\n    bool beet = false;\n\n    for (auto &to : g[idx]) {\n\n      if (to == par && !exchange(beet, true))\n        continue;\n\n      if (!used[to] || ord[to] < ord[idx]) {\n\n        tmp.emplace_back(to);\n      }\n\n      if (!used[to]) {\n\n        dfs(to, idx);\n\n        if (low[to] >= ord[idx]) {\n\n          bc.emplace_back();\n\n          for (;;) {\n\n            auto e = tmp.back();\n\n            bc.back().emplace_back(e);\n\n            tmp.pop_back();\n\n            if (e.idx == to.idx)\n              break;\n          }\n        }\n      }\n    }\n  }\n};\n\ntemplate <typename T = int>\n\nstruct BlockCutTree : BiConnectedComponents<T> {\n\npublic:\n  using BiConnectedComponents<T>::BiConnectedComponents;\n\n  using BiConnectedComponents<T>::g;\n\n  using BiConnectedComponents<T>::articulation;\n\n  using BiConnectedComponents<T>::bc;\n\n  vector<int> rev;\n\n  vector<vector<int > >  group;\n\n  Graph<T> tree;\n\n  explicit BlockCutTree(const Graph<T> &g) : Graph<T>(g) {}\n\n  int operator[](const int &k) const { return rev[k]; }\n\n  void build() override {\n\n    BiConnectedComponents<T>::build();\n\n    rev.assign(g.size(), -1);\n\n    int ptr = (int)bc.size();\n\n    for (auto &idx : articulation) {\n\n      rev[idx] = ptr++;\n    }\n\n    vector<int> last(ptr, -1);\n\n    tree = Graph<T>(ptr);\n\n    for (int i = 0; i < (int)bc.size(); i++) {\n\n      for (auto &e : bc[i]) {\n\n        for (auto &ver : {e.from, e.to}) {\n\n          if (rev[ver] >= (int)bc.size()) {\n\n            if (exchange(last[rev[ver]], i) != i) {\n\n              tree.add_edge(rev[ver], i, e.cost);\n            }\n\n          } else {\n\n            rev[ver] = i;\n          }\n        }\n      }\n    }\n\n    group.resize(ptr);\n\n    for (int i = 0; i < (int)g.size(); i++) {\n\n      group[rev[i]].emplace_back(i);\n    }\n  }\n};\n\nint main() {\n\n  int N, M;\n\n  cin >> N >> M;\n\n  vector<int> A(N);\n\n  cin >> A;\n\n  BlockCutTree<> bct(N);\n\n  bct.read(M);\n\n  bct.build();\n\n  vector<int64> weight(bct.tree.size());\n\n  int64 all = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    weight[bct[i]] += A[i];\n\n    all += A[i];\n  }\n\n  vector<int64> ans(N, all);\n\n  for (int i = 0; i < N; i++) {\n\n    ans[i] -= A[i];\n  }\n\n  MFP([&](auto rec, int idx, int par) -> int64 {\n    int64 mx = 0, sum = 0;\n\n    for (auto &to : bct.tree.g[idx]) {\n\n      if (to == par)\n        continue;\n\n      auto res = rec(to, idx);\n\n      sum += res;\n\n      chmax(mx, res);\n    }\n\n    if (idx >= bct.bc.size()) {\n\n      ans[bct.group[idx][0]] = max(all - sum - weight[idx], mx);\n    }\n\n    return sum + weight[idx];\n  })\n  (0, -1);\n\n  for (auto &p : ans)\n    cout << p << \"\\n\";\n}\n"}
{"fast_code_id":"c4cc7e1e17564980fa61fb14a4993c0750403c3a47104226e12743bcee834cd1","fast_id":"1c3a089ab8cdb5844c4c278fe1d1f5e44233fc30d9ac97d1a5396eb8565606e3","fast_time":0.0201999884,"language":"cpp","measured_fast_code_id":"1c3a089ab8cdb5844c4c278fe1d1f5e44233fc30d9ac97d1a5396eb8565606e3","measured_slow_code_id":"280a446d08d7d1cb06098aa73861ae19c6e8a78ad2b7563f01ced6587ded47fe","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15587","problem_id":"p03620","slow_code_id":"e42e0d01de10da5f6a41fc2be0fe1a7f1d4dd0699a5355e2543af5c8ae27e3f8","slow_id":"280a446d08d7d1cb06098aa73861ae19c6e8a78ad2b7563f01ced6587ded47fe","slow_time":0.0987929934,"speedup":4.8907450560714185,"stratum":"4-8","sampling_key":"cd133595b89795b4a03bf158d79e92cf26d1de114129cb1772fbdd033a259e0b","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <vector>\n\n#define MAXN 2000\n\n#define INF 0x3FFFFFFF\n\nusing namespace std;\n\ntypedef pair<int, int> PII;\n\nchar A[MAXN + 5], B[MAXN + 5];\n\nvector<PII> need;\n\nint n;\n\nint seq1[MAXN + 5], seq2[MAXN + 5];\n\nint psm1[MAXN + 5], psm2[MAXN + 5];\n\nint sm1[MAXN + 5], sm2[MAXN + 5];\n\nint maxr[MAXN + 5];\n\nvoid prepare()\n\n{\n\n  for (int i = 0; i < n; i++)\n\n    seq2[i] = B[i] - '0';\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    int len = -1;\n\n    for (int j = 0; j < n; j++)\n\n      if (seq2[(i + j) % n] == 1)\n\n      {\n\n        len = j;\n\n        break;\n      }\n\n    psm1[i] = len;\n\n    len = -1;\n\n    for (int j = 0; j < n; j++)\n\n      if (seq2[(i - j + n) % n] == 1)\n\n      {\n\n        len = j;\n\n        break;\n      }\n\n    psm2[i] = len;\n  }\n}\n\nint solve()\n\n{\n\n  int ret = INF;\n\n  sort(need.begin(), need.end());\n\n  maxr[need.size()] = 0;\n\n  for (int i = need.size() - 1; i >= 0; i--)\n\n    maxr[i] = max(maxr[i + 1], need[i].second);\n\n  ret = 2 * maxr[0];\n\n  for (int i = 0; i < (int)need.size(); i++)\n\n    ret = min(ret, need[i].first * 2 + maxr[i + 1] * 2);\n\n  return ret;\n}\n\nint main()\n\n{\n\n  scanf(\"%s %s\", A, B);\n\n  n = strlen(A);\n\n  prepare();\n\n  int ans = INF;\n\n  for (int mv = 0; mv < n; mv++)\n\n  {\n\n    int cnt = 0;\n    need.clear();\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      seq1[(mv + i) % n] = A[i] - '0';\n\n      if (psm1[i] - mv <= 0 && psm1[i] >= 0)\n\n        sm1[(mv + i) % n] = sm2[(mv + i) % n] = 0;\n\n      else\n\n        sm1[(mv + i) % n] = psm1[i] - mv, sm2[(mv + i) % n] = psm2[i];\n    }\n\n    bool legal = true;\n\n    for (int i = 0; i < n; i++)\n\n      if (seq1[i] != seq2[i] && sm1[i] < 0)\n\n      {\n\n        legal = false;\n\n        break;\n      }\n\n    if (legal == false)\n      continue;\n\n    for (int i = 0; i < n; i++)\n\n      if (seq1[i] != seq2[i])\n\n        cnt++, need.push_back(PII(sm2[i], sm1[i]));\n\n    ans = min(ans, solve() + mv + cnt);\n  }\n\n  for (int mv = 0; mv < n; mv++)\n\n  {\n\n    int cnt = 0;\n    need.clear();\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      seq1[(i - mv + n) % n] = A[i] - '0';\n\n      if (psm2[i] - mv <= 0 && psm2[i] >= 0)\n\n        sm1[(i - mv + n) % n] = sm2[(i - mv + n) % n] = 0;\n\n      else\n\n        sm1[(i - mv + n) % n] = psm1[i], sm2[(i - mv + n) % n] = psm2[i] - mv;\n    }\n\n    bool legal = true;\n\n    for (int i = 0; i < n; i++)\n\n      if (seq1[i] != seq2[i] && sm1[i] < 0)\n\n      {\n\n        legal = false;\n\n        break;\n      }\n\n    if (legal == false)\n      continue;\n\n    for (int i = 0; i < n; i++)\n\n      if (seq1[i] != seq2[i])\n\n        cnt++, need.push_back(PII(sm2[i], sm1[i]));\n\n    ans = min(ans, solve() + mv + cnt);\n  }\n\n  if (ans != INF)\n\n    printf(\"%d\\n\", ans);\n\n  else\n\n    printf(\"-1\\n\");\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\n#define MAXN 2010\n\n#define INF 1000000000\n\nint n, ans = INF;\n\nchar a[MAXN], b[MAXN];\n\nint st[MAXN], L[MAXN], R[MAXN];\n\nbool cmpL(int x, int y)\n\n{\n\n  return L[x] < L[y];\n}\n\nbool cmpR(int x, int y)\n\n{\n\n  return R[x] < R[y];\n}\n\nint main()\n\n{\n\n  scanf(\"%s%s\", a, b);\n\n  n = strlen(a);\n\n  bool f1 = 0, f2 = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    if (a[i] == '1')\n      f1 = 1;\n\n    if (b[i] == '1')\n      f2 = 1;\n  }\n\n  if (!f2)\n\n  {\n\n    if (!f1)\n      printf(\"0\\n\");\n\n    else\n      printf(\"-1\\n\");\n\n    return 0;\n  }\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    for (int j = i; b[j] == '0'; j = (j - 1 + n) % n)\n\n      L[i]++;\n\n    for (int j = i; b[j] == '0'; j = (j + 1) % n)\n\n      R[i]++;\n  }\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    int tmp = 0, mx = 0, r = 0;\n\n    for (int j = 0, k = i; j < n; k = (k + 1) % n, j++)\n\n    {\n\n      if (b[j] == a[k])\n        continue;\n\n      tmp++;\n\n      if (L[k] > i)\n        st[++r] = k;\n    }\n\n    sort(st + 1, st + 1 + r, cmpL);\n\n    for (int j = r; j; j--)\n\n    {\n\n      ans = min(ans, mx * 2 + i + tmp + (L[st[j]] - i) * 2);\n\n      mx = max(mx, R[st[j]]);\n    }\n\n    ans = min(ans, mx * 2 + i + tmp);\n\n    tmp = 0, mx = 0, r = 0;\n\n    for (int j = 0, k = (n - i) % n; j < n; k = (k + 1) % n, j++)\n\n    {\n\n      if (b[j] == a[k])\n        continue;\n\n      tmp++;\n\n      if (R[k] > i)\n        st[++r] = k;\n    }\n\n    sort(st + 1, st + 1 + r, cmpR);\n\n    for (int j = r; j; j--)\n\n    {\n\n      ans = min(ans, mx * 2 + i + tmp + (R[st[j]] - i) * 2);\n\n      mx = max(mx, L[st[j]]);\n    }\n\n    ans = min(ans, mx * 2 + i + tmp);\n  }\n\n  printf(\"%d\\n\", ans);\n}"}
{"fast_code_id":"87a0b11b9ef8124318adbf8cf6df9a5fd89f1a65aaf7df23e6fb89e4df8ee8f5","fast_id":"4da00a67430eb24455129221b90d533e949a38663e733e081fc337b1854e48a8","fast_time":0.0010193094,"language":"cpp","measured_fast_code_id":"4da00a67430eb24455129221b90d533e949a38663e733e081fc337b1854e48a8","measured_slow_code_id":"2844e2694b63036e8f8779d6ac705327e5cdfacbc264a8016ee7e4c700ddf6cf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_15598","problem_id":"p02859","slow_code_id":"7d7a841fb341ce94eff47004cb1c2fe7aa6fbb61cff6fbf239b8178dede48809","slow_id":"2844e2694b63036e8f8779d6ac705327e5cdfacbc264a8016ee7e4c700ddf6cf","slow_time":0.009656681,"speedup":9.47374859880621,"stratum":"8+","sampling_key":"cb889ace61190594a7831739a3678c82a3840f21f696a5de2c2465e936d9404a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define mod 1000000007\n\n#define first f\n\n#define second s\n\n#define N 1000000\n\nvector<ll> v(N);\n\nll l, m, n, sum, ans, maximum, minimum, mahakal, a, b, c, t, i, j, k;\n\nll cnt, cnt1, cnt2, cnt3;\n\nstring str, str1;\n\nll arr[N];\n\nint main() {\n\n  cin >> n;\n\n  cout << n * n << endl;\n\n  return 0;\n}","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define mod 1000000007\n\n#define fast                                                                   \\\n  ios_base::sync_with_stdio(false);                                            \\\n  cin.tie(NULL);                                                               \\\n  cout.tie(NULL);\n\n#define _it iterator\n\n#define all(_x) _x.begin(), _x.end()\n\n#define f first\n\n#define s second\n\n#define pb push_back\n\nvoid mahakal() {\n\n#ifndef ONLINE_JUDGE\n\n  freopen(\"input.txt\", \"r\", stdin);\n\n  freopen(\"output.txt\", \"w\", stdout);\n\n  freopen(\"error.txt\", \"w\", stderr);\n\n#endif\n}\n\nint main() {\n\n  ll r;\n\n  cin >> r;\n\n  ll ans = r * r;\n\n  cout << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"2020bd3c28260433d4bde7626389b31ecd95af7909eb3a815b38e96abb5a10e1","fast_id":"06cb88dd5485f9e5959c7ad28b899768e4baf03f6e6f1bf09c0809ff95e07121","fast_time":0.164755857,"language":"cpp","measured_fast_code_id":"06cb88dd5485f9e5959c7ad28b899768e4baf03f6e6f1bf09c0809ff95e07121","measured_slow_code_id":"833ab4de27d005381a24a1e9d64932c519098a3fa8e52094e8d9c4ccea04472d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1566","problem_id":"p02804","slow_code_id":"d7dac62165fdd7ac72a23c43b387f0809de0fb7412029b63005d97fb3db6e9e0","slow_id":"833ab4de27d005381a24a1e9d64932c519098a3fa8e52094e8d9c4ccea04472d","slow_time":0.5199750931,"speedup":3.156034040720021,"stratum":"2-4","sampling_key":"8bd185fc668746df6163a174af35c3480f449004fa35e273886d0424a2764b43","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ms(x, y) memset(x, y, sizeof(x))\n\n#define lowbit(x) ((x) & (-x))\n\n#define sqr(x) ((x) * (x))\n\ntypedef long long LL;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<LL, LL> pll;\n\nconst int maxn = 1e5 + 5;\n\nconst LL MOD = 1e9 + 7;\n\nLL F[maxn], invF[maxn], inv[maxn];\n\nvoid init() {\n\n  inv[1] = 1;\n\n  for (int i = 2; i < maxn; ++i)\n\n    inv[i] = (MOD - MOD / i) * 1LL * inv[MOD % i] % MOD;\n\n  F[0] = invF[0] = 1;\n\n  for (int i = 1; i < maxn; ++i) {\n\n    F[i] = F[i - 1] * 1LL * i % MOD;\n\n    invF[i] = invF[i - 1] * inv[i] % MOD;\n  }\n}\n\nLL comb(int n, int m) {\n\n  if (m < 0 || m > n)\n    return 0;\n\n  return F[n] * invF[n - m] % MOD * invF[m] % MOD;\n}\n\nvoid run_case() {\n\n  init();\n\n  int n, k;\n\n  cin >> n >> k;\n\n  vector<LL> a(n);\n\n  LL ans = 0;\n\n  for (auto &x : a)\n    cin >> x;\n\n  sort(a.begin(), a.end(), greater<LL>());\n\n  for (int i = 0; i <= n - k; ++i) {\n\n    (ans += comb(n - i - 1, k - 1) * a[i] % MOD) %= MOD;\n  }\n\n  sort(a.begin(), a.end());\n\n  for (int i = 0; i <= n - k; ++i) {\n\n    (ans -= comb(n - i - 1, k - 1) * a[i] % MOD) %= MOD;\n  }\n\n  cout << (ans + MOD) % MOD;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  cout.flags(ios::fixed);\n  cout.precision(9);\n\n  run_case();\n\n  cout.flush();\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define endl '\\n'\n\n#define pb push_back\n\n#define mp make_pair\n\n#define SZ(x) ((int)(x).size())\n\n#define all(x) x.begin(),x.end()\n\n#define mem0(s) memset(s,0,sizeof(s))\n\n#define meminf(s) memset(s,0x3f,sizeof(s))\n\n#define mp_insert(a,b,c) mp.insert(map<pair<int,int>,int>::value_type(make_pair(a,b),c))\n\ndouble pi=acos(-1);\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ninline ll lowbit(ll x){return x&(-x);}\n\ninline ll min(ll a,ll b){return a<b?a:b;}\n\ninline ll max(ll a,ll b){return a>b?a:b;}\n\nconst int INF=0x3f3f3f3f,max_n=100005,mod=1e9+7;\n\ninline ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}\n\ninline ll pow(ll a,ll b,ll mod){ll res=1;a%=mod;assert(b>=0);for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\n\nint a[max_n];\n\nint jiecheng[100005]={1};\n\nll min1,max1;\n\nlong long inv(int i,int p)\n\n{\n\n  if(i==1)return 1;\n\n  return (p-p/i)*inv(p%i,p)%p;\n\n}\n\nll g(int n,int m,int p)\n\n{\n\n  int fenzi=jiecheng[n+m]%p;\n\n  int fenmu=((ll)jiecheng[m]%p*jiecheng[n]%p)%p;\n\n  ll niyuan=inv(fenmu,p);\n\n  return (ll)fenzi*niyuan%p;\n\n}\n\nll lucas(int n,int m,int p)\n\n{\n\n  if(n<0)\n\n  {\n\n    return 0;\n\n  }\n\n  if(n+m<=p)\n\n  {\n\n    return g(n,m,p);\n\n  }\n\n  if(m==0)return 1;\n\n  if(m==1)return (n+m)%p;\n\n  else if(n==0)return 1;\n\n  else\n\n  {\n\n    int a1=lucas((n+m)/p-m/p,m/p,p)%p;\n\n    int a2=lucas((n+m)%p-m%p,m%p,p)%p;\n\n    return (ll)a1*a2%p;\n\n  }\n\n}\n\nint main()\n\n{\n\n  for(int i=1;i<=100000;i++)\n\n  {\n\n    jiecheng[i]=(ll)jiecheng[i-1]*i%mod;\n\n  }\n\n  int n,k;cin>>n>>k;\n\n  for(int i=1;i<=n;i++)cin>>a[i];\n\n  sort(a+1,a+1+n);\n\n  for(int i=1;i+k-1<=n;i++)\n\n  {\n\n    min1=(min1+a[i]*lucas(k-1,n-i-k+1,mod))%mod;\n\n  }\n\n  for(int i=k;i<=n;i++)\n\n  {\n\n    max1=(max1+a[i]*lucas(k-1,i-k,mod))%mod;\n\n  }\n\n  cout<<((max1-min1)%mod+mod)%mod<<endl;\n\n}"}
{"fast_code_id":"bf2f6ba276e2ed8814ac79627b34b9cd030ad2ae04dce755d752072d825ee4ec","fast_id":"6738b819d167b2ba463cf54bfd7c3888886fd9d1b2d9af2c4720d53d671b969f","fast_time":0.0083868545,"language":"cpp","measured_fast_code_id":"6738b819d167b2ba463cf54bfd7c3888886fd9d1b2d9af2c4720d53d671b969f","measured_slow_code_id":"beea56877e53c99423c3787dd8440f60b56bca273a1691324fc3252a7b87279c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1588","problem_id":"p03544","slow_code_id":"bf7d3b52abe729df6a15ab26c666328ccfd463b82808032076dea29857a92674","slow_id":"beea56877e53c99423c3787dd8440f60b56bca273a1691324fc3252a7b87279c","slow_time":0.2668221244,"speedup":31.81432614575584,"stratum":"8+","sampling_key":"37a90710917573cb6287cb91d39b88f7e18156f01e8084851362c913718b1a0f","slow_code":"#include <stdio.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <string.h>\n\n#define ll long long\n\nusing namespace std;\n\nstruct node\n\n{\n\n  int a[1000] = {0};\n\n  int num;\n\n} s[1005];\n\nint main()\n\n{\n\n  s[0].a[0] = 2;\n  s[0].num = 0;\n\n  s[1].a[0] = 1;\n  s[1].num = 0;\n\n  for (int i = 2; i <= 1000; i++)\n\n  {\n\n    for (int k = 0; k <= s[i - 1].num; k++)\n\n    {\n\n      s[i].a[k] += s[i - 1].a[k] + s[i - 2].a[k];\n\n      if (s[i].a[k] >= 10)\n\n      {\n\n        s[i].a[k + 1]++;\n\n        s[i].a[k] -= 10;\n      }\n    }\n\n    if (s[i].a[s[i - 1].num + 1] != 0)\n\n      s[i].num = s[i - 1].num + 1;\n\n    else\n\n      s[i].num = s[i - 1].num;\n  }\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = s[n].num; i >= 0; i--)\n\n    printf(\"%d\", s[n].a[i]);\n\n  puts(\"\");\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nlong long f[100] = {2, 1}, x;\n\nint main() {\n\n  scanf(\"%lld\", &x);\n\n  for (int i = 2; i <= x; ++i)\n\n    f[i] = f[i - 1] + f[i - 2];\n\n  printf(\"%lld\\n\", f[x]);\n\n  return 0;\n}"}
{"fast_code_id":"ec337903b0ba18d454fc6782d0fd6178ca8b05e259abba18a9e19443daddaf46","fast_id":"d3f195e6b0a8dac97453ff4b6dffca4102e1cade69662217f78a8b640bc95f2d","fast_time":0.1113159771,"language":"cpp","measured_fast_code_id":"d3f195e6b0a8dac97453ff4b6dffca4102e1cade69662217f78a8b640bc95f2d","measured_slow_code_id":"ef93aacc0decf9564843d83f22b7e8aa114931c305682f1425b194b2fe3ee8e9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1604","problem_id":"p02895","slow_code_id":"3e3f57007272633932e5fa47406aef04dfb4685b3c0f59e976ff3fb0c8540386","slow_id":"ef93aacc0decf9564843d83f22b7e8aa114931c305682f1425b194b2fe3ee8e9","slow_time":0.2427945328,"speedup":2.181129242407737,"stratum":"2-4","sampling_key":"60bdc73dd0dd0c6e5f918d063fe87c4957e9d27bcbf0af94151d1e4b51e7a6b5","slow_code":"#include <bits/stdc++.h>\n\n#define fo(i, a, b) for (int i = a, _e = b; i <= _e; ++i)\n\n#define ll long long\n\nusing namespace std;\n\nconst int N = 50;\n\nint n;\n\nchar a[N][N];\n\nll f[N][N][N], ans;\n\nll calc(int l, int i, int r) {\n\n  if (l == r)\n    return 1;\n\n  if (l == i || i == r)\n    return 0;\n\n  if (f[l][i][r] != -1)\n    return f[l][i][r];\n\n  ll tot = 0;\n\n  fo(j, l, i - 1)\n\n      fo(p, j, i - 1)\n\n          fo(q, i + 1, r)\n\n              fo(k, q, r)\n\n                  if (a[j][k] == '1')\n\n                      tot += calc(l, j, p) * calc(q, k, r) * calc(p + 1, i, q - 1);\n\n  return f[l][i][r] = tot;\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n  n *= 2;\n\n  fo(i, 1, n) scanf(\"\\n%s\", a[i] + 1);\n\n  memset(f, 255, sizeof f);\n\n  fo(i, 2, n) if (a[1][i] == '1') ans += calc(2, i, n);\n\n  cout << ans;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define fo(i, a, b) for (int i = a, _e = b; i <= _e; ++i)\n\n#define ll long long\n\nusing namespace std;\n\nconst int N = 50;\n\nint n;\n\nchar a[N][N];\n\nll f[N][N][N], s[N][N], ss, ans;\n\nint main() {\n\n  scanf(\"%d\", &n);\n  n *= 2;\n\n  fo(i, 1, n) scanf(\"\\n%s\", a[i] + 1), f[i][i][i] = 1;\n\n  for (int len = 2; len <= n - 2; len += 2)\n\n    fo(l, 2, n - len) {\n\n      int r = l + len;\n\n      fo(j, l, r) fo(k, j, r) s[j][k] = 0;\n\n      fo(j, l, r) {\n\n        fo(q, j + 1, r) {\n\n          ss = 0;\n\n          fo(k, q, r) if (a[j][k] == '1') ss += f[q][r][k];\n\n          fo(p, j, q) s[p][q] += ss * f[l][p][j];\n        }\n      }\n\n      fo(p, l, r) fo(q, p, r)\n\n          fo(i, p + 1, q - 1) f[l][r][i] += s[p][q] * f[p + 1][q - 1][i];\n    }\n\n  fo(i, 2, n) if (a[1][i] == '1') ans += f[2][n][i];\n\n  cout << ans;\n}"}
{"fast_code_id":"095f5974689ff705ee3ceffc0179f4baa009b96eb188de8e08ebf6712dda2e09","fast_id":"0f514f2905f180ea8b9338adb7440a373018047fdbb929db990c18d0ffe349c1","fast_time":0.010960984,"language":"cpp","measured_fast_code_id":"0f514f2905f180ea8b9338adb7440a373018047fdbb929db990c18d0ffe349c1","measured_slow_code_id":"67f8431a9e7b7ce392a0773c142cd2e86f4a01a272f34246258c88474a0da4b2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16054","problem_id":"p02343","slow_code_id":"2f543b977fe7674d08095d5926e6b1bbed287c9e8c0c79f0edee7e131b7f4953","slow_id":"67f8431a9e7b7ce392a0773c142cd2e86f4a01a272f34246258c88474a0da4b2","slow_time":0.0661548505,"speedup":6.0354846334964085,"stratum":"4-8","sampling_key":"bf7b506e03ead165c72cbe7a439152bbe1c84307590965acded7081ca9b5c1c8","slow_code":"#include <cstdio>\n\n#include <vector>\n\nusing namespace std;\n\nvector<int> l[10000];\n\nint s[10000];\n\nint n;\n\nvoid unite(int x, int y) {\n\n  if (s[x] == s[y])\n    return;\n\n  int i, j, tmp;\n\n  int sx = s[x];\n\n  int sy = s[y];\n\n  for (i = 0; i < l[sy].size(); i++) {\n\n    tmp = l[sy][i];\n\n    s[tmp] = sx;\n\n    l[sx].push_back(tmp);\n  }\n\n  l[sy].clear();\n\n  return;\n}\n\nbool same(int x, int y) { return s[x] == s[y]; }\n\nint main() {\n\n  int i, q, com, x, y;\n\n  scanf(\"%d %d\", &n, &q);\n\n  for (i = 0; i < n; i++) {\n\n    s[i] = i;\n\n    l[i].push_back(i);\n  }\n\n  for (i = 0; i < q; i++) {\n\n    scanf(\"%d %d %d\", &com, &x, &y);\n\n    if (com == 0)\n      unite(x, y);\n\n    else {\n\n      if (same(x, y))\n        printf(\"1\\n\");\n\n      else\n        printf(\"0\\n\");\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\ntypedef struct node_ {\n\n  int key;\n\n  int height;\n\n  struct node_ *parent;\n\n} node;\n\nnode *nd;\n\nnode *top(node *nd) {\n\n  while (true) {\n\n    if (nd->parent == NULL)\n      break;\n\n    nd = nd->parent;\n  }\n\n  return nd;\n}\n\nvoid unite(int x, int y) {\n\n  node *a = top(nd + x);\n\n  node *b = top(nd + y);\n\n  if (a == b)\n    return;\n\n  if (a->height < b->height) {\n\n    a->parent = b;\n\n  } else {\n\n    b->parent = a;\n\n    if (a->height == b->height) {\n\n      a->height++;\n    }\n  }\n\n  return;\n}\n\nint same(int x, int y) {\n\n  node *a = top(nd + x);\n\n  node *b = top(nd + y);\n\n  if (a == b)\n    return 1;\n\n  else\n    return 0;\n}\n\nint main() {\n\n  int i, n, q, x, y, com;\n\n  scanf(\"%d %d\", &n, &q);\n\n  nd = (node *)malloc(sizeof(node) * n);\n\n  for (i = 0; i < n; i++) {\n\n    nd[i].key = i;\n\n    nd[i].height = 1;\n\n    nd[i].parent = NULL;\n  }\n\n  for (i = 0; i < q; i++) {\n\n    scanf(\"%d %d %d\", &com, &x, &y);\n\n    switch (com) {\n\n    case 0:\n\n      unite(x, y);\n\n      break;\n\n    case 1:\n\n      printf(\"%d\\n\", same(x, y));\n\n      break;\n\n    default:\n\n      perror(\"error\\n\");\n\n      return -1;\n\n      break;\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"df29e7f9b8f4e64144f22c76088772cd32e09506d559ef3d9ac3747ec80f616c","fast_id":"07b7709949d7edf42a3d4c43a3ffb19bb38be4b77c931e2a4cfc429922b88c74","fast_time":0.0061162484,"language":"cpp","measured_fast_code_id":"07b7709949d7edf42a3d4c43a3ffb19bb38be4b77c931e2a4cfc429922b88c74","measured_slow_code_id":"15d9b4783a4b8ffc83d4c4ba44515be1b54d25a4b40d7a638ef20a70f356e5c3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16104","problem_id":"p03416","slow_code_id":"dbb718fec2f6d71eb2171e9272fce82eaad02c801ee532f799c619ba140c3c1c","slow_id":"15d9b4783a4b8ffc83d4c4ba44515be1b54d25a4b40d7a638ef20a70f356e5c3","slow_time":0.0805722712,"speedup":13.17347921971253,"stratum":"8+","sampling_key":"0a0a6cdb3135d4db274f86b50e5ae49b0fb48b48687fc938c8584f95484f1924","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <set>\n\n#include <map>\n\n#include <vector>\n\n#include <queue>\n\n#include <sstream>\n\nusing namespace std;\n\n#define sf scanf\n\n#define pf printf\n\n#define pfn printf(\"\\n\");\n\n#define pfk printf(\" \");\n\n#define pf0 printf(\"0\");\n\n#define pf1 printf(\"1\");\n\n#define ll long long\n\n#define sfd(n) scanf(\"%d\", &n);\n\n#define sfdd(n, m) scanf(\"%d%d\", &n, &m);\n\n#define sfld(n) scanf(\"%lld\", &n);\n\n#define sfldd(n, m) scanf(\"%lld%lld\", &n, &m);\n\n#define sflf(n) scanf(\"%lf\", &n);\n\n#define sflff(n, m) scanf(\"%lf%lf\", &n, &m);\n\n#define sfc(n) scanf(\"%c\", n);\n\n#define sfcc(n, m) scanf(\"%c%c\", n, m);\n\n#define sfs(n) scanf(\"%s\", n);\n\n#define sfss(n, m) scanf(\"%s%s\", n, m);\n\n#define pfd(n) printf(\"%d\", n);\n\n#define pfld(n) printf(\"%lld\", n);\n\n#define pflf(n) printf(\"%lf\", n);\n\n#define pfc(n) printf(\"%c\", n);\n\n#define pfs(n) printf(\"%s\", n);\n\n#define csh(a, n) memset(a, n, sizeof(a));\n\nint fff(int i) {\n\n  int a = i;\n\n  int j = i % 10;\n\n  i /= 10;\n\n  while (i) {\n\n    j *= 10;\n\n    j += i % 10;\n\n    i /= 10;\n  }\n\n  if (a == j) {\n\n    return 1;\n\n  }\n\n  else {\n\n    return 0;\n  }\n}\n\nint arr[1000000];\n\nint main() {\n\n  for (int i = 10000; i < 100000; i++) {\n\n    arr[i] = arr[i - 1] + fff(i);\n  }\n\n  int a, b;\n\n  cin >> a >> b;\n\n  cout << arr[b] - arr[a - 1];\n}","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\n#include <string.h>\n\nint main() {\n\n  int a, b;\n\n  scanf(\"%d %d\", &a, &b);\n\n  int i, j;\n\n  int cnt = 0;\n\n  for (i = a; i <= b; i++) {\n\n    int c, d, e, f, g;\n\n    c = i / 10000;\n\n    d = i % 10000 / 1000;\n\n    e = i % 1000 / 100;\n\n    f = i % 100 / 10;\n\n    g = i % 10;\n\n    if (c == g && d == f) {\n\n      cnt++;\n    }\n  }\n\n  printf(\"%d\", cnt);\n\n  return 0;\n}"}
{"fast_code_id":"a4e8a523326d23f37f9b25f209bc516fe3625a37dd6e64ce03a034cfeb399ce3","fast_id":"35e1a6bfe6faf43a4d026354b8a94b61ebbfb6adfe51a706e8b95dba7e77dbb3","fast_time":0.021498493,"language":"cpp","measured_fast_code_id":"35e1a6bfe6faf43a4d026354b8a94b61ebbfb6adfe51a706e8b95dba7e77dbb3","measured_slow_code_id":"1a1f42446bf7936d521302babb98837d408b1bc9266da4e90dba93f5869d85d6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16117","problem_id":"p03056","slow_code_id":"d37de98f41330f099eb53e1f8a063711b7746368848093ae9e9a3d5d0bcfd55f","slow_id":"1a1f42446bf7936d521302babb98837d408b1bc9266da4e90dba93f5869d85d6","slow_time":0.1056952837,"speedup":4.916404312618564,"stratum":"4-8","sampling_key":"d8d1e044579dbd0f83cef4de4a6224db9419cd91ea95c32d3692e442d469aa8e","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint read() {\n\n  int X = 0, w = 1;\n  char c = getchar();\n\n  while (c < '0' || c > '9') {\n    if (c == '-')\n      w = -1;\n    c = getchar();\n  }\n\n  while (c >= '0' && c <= '9')\n    X = X * 10 + c - '0', c = getchar();\n\n  return X * w;\n}\n\nconst int N = 185 + 10;\n\nint n, m;\n\nchar a[N][N];\nint s[N][N];\n\nint dp[2][N][N][N];\n\nint same(int lx, int ly, int rx, int ry) {\n\n  int o = s[rx][ry] - s[lx - 1][ry] - s[rx][ly - 1] + s[lx - 1][ly - 1];\n\n  return o == (rx - lx + 1) * (ry - ly + 1) || o == 0;\n}\n\nint f(int o, int i, int j, int k) {\n\n  int L = i, R = j - 1, res = 0;\n\n  while (L <= R) {\n\n    int mid = (L + R) >> 1;\n\n    res = max(res, min(dp[o][i][mid][k], dp[o][mid + 1][j][k]));\n\n    if (dp[o][i][mid][k] < dp[o][mid + 1][j][k])\n      R = mid - 1;\n\n    else\n      L = mid + 1;\n  }\n\n  return res;\n}\n\nint main() {\n\n  n = read(), m = read();\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%s\", a[i] + 1);\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 1; j <= m; ++j)\n\n      s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (a[i][j] == '#');\n\n  if (same(1, 1, n, m)) {\n    puts(\"0\");\n    return 0;\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = i; j <= n; ++j)\n\n      for (int k = 1, t; k <= m; k = t) {\n\n        t = k;\n\n        while (t <= m && same(i, k, j, t))\n          ++t;\n\n        for (int p = k; p < t; ++p)\n          dp[0][i][j][p] = t - 1;\n\n        if (k == t)\n          dp[0][i][j][k] = k - 1, ++t;\n      }\n\n  for (int w = 1;; ++w) {\n\n    int o = w & 1, p = o ^ 1;\n\n    for (int i = 1; i <= n; ++i)\n\n      for (int j = i; j <= n; ++j)\n\n        for (int k = 1; k <= m; ++k) {\n\n          int t = dp[p][i][j][k];\n\n          if (t == m)\n            dp[o][i][j][k] = m;\n\n          else\n            dp[o][i][j][k] = max(dp[p][i][j][t + 1], f(p, i, j, k));\n        }\n\n    if (dp[o][1][n][1] == m) {\n      printf(\"%d\\n\", w);\n      break;\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <cstring>\n\n#include <cstdio>\n\ninline int min(int a, int b) { return a < b ? a : b; }\n\ninline int max(int a, int b) { return a > b ? a : b; }\n\nconst int _ = 200;\n\nint n, m, s[_][_], dp[2][_][_][_];\nchar a[_][_];\n\ninline int chk(int x1, int y1, int x2, int y2) {\n\n  int res = s[x2][y2] - s[x2][y1 - 1] - s[x1 - 1][y2] + s[x1 - 1][y1 - 1];\n\n  return res == (y2 - y1 + 1) * (x2 - x1 + 1) || res == 0;\n}\n\ninline int bs(int c, int i, int j, int k) {\n\n  int l = i, r = j - 1, res = 0;\n\n  while (l <= r) {\n\n    int mid = (l + r) >> 1;\n\n    res = max(res, min(dp[c][i][mid][k], dp[c][mid + 1][j][k]));\n\n    if (dp[c][i][mid][k] < dp[c][mid + 1][j][k])\n      r = mid - 1;\n    else\n      l = mid + 1;\n  }\n\n  return res;\n}\n\nint main() {\n\n  scanf(\"%d %d\", &n, &m);\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%s\", a[i] + 1);\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 1; j <= m; ++j)\n\n      s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (a[i][j] == '#');\n\n  if (chk(1, 1, n, m)) {\n    puts(\"0\");\n    return 0;\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = i; j <= n; ++j)\n\n      for (int l, k = 1; k <= m; k = l) {\n\n        l = k;\n\n        while (l <= m && chk(i, k, j, l))\n          ++l;\n\n        for (int x = k; x < l; ++x)\n          dp[0][i][j][x] = l - 1;\n\n        if (k == l)\n          dp[0][i][j][k] = k - 1, ++l;\n      }\n\n  for (int x = 1;; ++x) {\n\n    int c = x & 1, c_1 = c ^ 1;\n\n    for (int i = 1; i <= n; ++i)\n\n      for (int j = i; j <= n; ++j)\n\n        for (int k = 1; k <= m; ++k) {\n\n          int x = dp[c_1][i][j][k];\n\n          if (x == m)\n            dp[c][i][j][k] = m;\n\n          else\n            dp[c][i][j][k] = max(dp[c_1][i][j][x + 1], bs(c_1, i, j, k));\n        }\n\n    if (dp[c][1][n][1] == m) {\n      printf(\"%d\\n\", x);\n      return 0;\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"48f14556ca94ee760f1c12805fe2144235de8d1f2d803c8bc3e0e50113b92a99","fast_id":"6e31ccd0c52817d58c74e7a566acfc356033df091ae2e9d8fafdd529a1ec2ee3","fast_time":0.0885084011,"language":"cpp","measured_fast_code_id":"6e31ccd0c52817d58c74e7a566acfc356033df091ae2e9d8fafdd529a1ec2ee3","measured_slow_code_id":"dbf836a426bf016361f02a7feffb0dd5336abb667c09341e1801a8e2026bdf30","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16119","problem_id":"p03296","slow_code_id":"2825a37b8c105493cb2d41ef435dff76ef5ff02d51991f9b4157ac62fcd87340","slow_id":"dbf836a426bf016361f02a7feffb0dd5336abb667c09341e1801a8e2026bdf30","slow_time":0.5627303182,"speedup":6.357931125252245,"stratum":"4-8","sampling_key":"e5b9b447ece07b9b698f4e97174fa434d977e1fcda9502a1e651fa77dca65447","slow_code":"\n\n#include <iostream>\n\n#include <climits>\n\n#include <bitset>\n\n#include <stack>\n\n#include <queue>\n\n#include <iomanip>\n\n#include <limits>\n\n#include <string>\n\n#include <cmath>\n\n#include <set>\n\n#include <map>\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string.h>\n\n#include <complex>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef complex<double> xy_t;\n\ndouble dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); }\n\ndouble cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); }\n\ntypedef pair<ll, ll> P;\n\nlong long int INF = 1e18;\n\ndouble Pi = 3.141592653589;\n\nconst int mod = 1000000007;\n\nvector<int> G[100005];\n\nstd::vector<P> tree[100010];\n\nint dx[9] = {1, 0, -1, 0, 1, 1, -1, -1, 0};\n\nint dy[9] = {0, 1, 0, -1, 1, -1, -1, 1, 0};\n\n#define p(x) cout << x << endl;\n\n#define el cout << endl;\n\n#define pe(x) cout << x << \" \";\n\n#define ps(x) cout << fixed << setprecision(25) << x << endl;\n\n#define re(i, a, b) for (i = a; i <= b; i++)\n\n#define pb push_back\n\n#define lb lower_bound\n\n#define ub upper_bound\n\nll i, j, k, ii, jj;\n\nll n, m, sum, num;\n\nll ans = 0;\n\nll a, b, c, d, e, h, w;\n\nll x[500005], y[500005], z[500005];\n\nchar s[100005], t[100005];\n\nbool ok = false;\n\nbool check[100005];\n\nint main() {\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n    cin >> x[i];\n\n  for (i = 0; i < n - 1; i++) {\n\n    if (x[i] == x[i + 1]) {\n\n      ans++;\n\n      i++;\n    }\n  }\n\n  p(ans);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#include <unistd.h>\n\n#include <sys/time.h>\n\n#include <stdlib.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<P, ll> T;\n\nlong long int INF = 2e18;\n\nconst ll fact_table = 1200008;\n\ndouble Pi = 3.1415926535897932384626;\n\npriority_queue<ll> pql;\n\npriority_queue<P> pqp;\n\npriority_queue<P> bag;\n\npriority_queue<ll, vector<ll>, greater<ll> > pqls;\n\npriority_queue<P, vector<P>, greater<P> > pqps;\n\nll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\n\nll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};\n\nchar dir[] = \"DRUL\";\n\n#define endl \"\\n\"\n\n#ifdef ENJAPMA\n\n#undef endl\n\n#endif\n\n#define p(x) cout << x << endl;\n\n#define el cout << endl;\n\n#define pe(x) cout << x << \" \";\n\n#define ps(x) cout << fixed << setprecision(25) << x << endl;\n\n#define pu(x) cout << (x);\n\n#define pb push_back\n\n#define lb lower_bound\n\n#define ub upper_bound\n\n#define CLEAR(a) a = decltype(a)();\n\n#define pc(x) cout << x << \",\";\n\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\nconst ll mod = 998244353ll;\n\nll mypow(ll number1, ll number2, ll mod) {\n\n  if (number2 == 0) {\n\n    return 1ll;\n\n  } else {\n\n    ll number3 = mypow(number1, number2 / 2, mod);\n\n    number3 *= number3;\n\n    number3 %= mod;\n\n    if (number2 % 2 == 1) {\n\n      number3 *= number1;\n\n      number3 %= mod;\n    }\n\n    return number3;\n  }\n}\n\nvoid YES(bool condition) {\n\n  if (condition) {\n    p(\"YES\");\n  } else {\n    p(\"NO\");\n  }\n\n  return;\n}\n\nvoid Yes(bool condition) {\n\n  if (condition) {\n\n    p(\"Yes\");\n\n  } else {\n\n    p(\"No\");\n  }\n\n  return;\n}\n\nll mygcd(ll a, ll b) {\n\n  if (b > a)\n    swap(a, b);\n\n  if (a == b || b == 0)\n    return a;\n\n  return mygcd(b, a % b);\n}\n\nbool multicase = false;\n\nll n, m, num, a, b, c, d, e, q, w, ans;\n\nll x[500005], y[500005];\n\nll r, k;\n\nstring s;\n\nvoid solve() {\n\n  cin >> n;\n\n  ll cnt = 0;\n\n  for (ll i = 0; i < n; i++) {\n\n    cin >> x[i];\n\n    if (i == 0 || x[i] == x[i - 1]) {\n\n      cnt++;\n\n    } else {\n\n      ans += cnt / 2;\n\n      cnt = 1;\n    }\n  }\n\n  ans += cnt / 2;\n\n  p(ans);\n\n  return;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  ll q, testcase = 1;\n\n  if (multicase) {\n\n    cin >> q;\n\n  } else {\n\n    q = 1;\n  }\n\n  while (q--) {\n\n    solve();\n\n    testcase++;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"f681c4ff0f29f847a499271745ee9fd3d6f2f6b1a202152ad1e58f1056be9c73","fast_id":"e56eefd401725da5d66dc6c1b8c0dbc95dee060474f1af467a5315ed8023ccf6","fast_time":0.0556150684,"language":"cpp","measured_fast_code_id":"e56eefd401725da5d66dc6c1b8c0dbc95dee060474f1af467a5315ed8023ccf6","measured_slow_code_id":"f8442c2d43ffd0d36d95126575684d964008de30238e129c72cb85d863b97cbd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1614","problem_id":"p03290","slow_code_id":"f0f07009409750c9746d3828ba0c6afb04dc8b30fea127b538174ae11cbb4950","slow_id":"f8442c2d43ffd0d36d95126575684d964008de30238e129c72cb85d863b97cbd","slow_time":0.5335385856,"speedup":9.593417772367605,"stratum":"8+","sampling_key":"f67d407337b07aa7936675b8a320f299497f0e841619dc54c3e8124b7d5f8160","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <iomanip>\n\n#include <string>\n\n#include <vector>\n\n#include <math.h>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <set>\n\n#include <map>\n\nconst int MOD = 1e9 + 7;\n\nconst int MOOD = 998244353;\n\n#define PI 3.14159265359\n\ntypedef long long ll;\n\nusing namespace std;\n\nint dp[200000][11];\n\nint main() {\n\n  int d, g;\n\n  cin >> d >> g;\n\n  vector<int> p(d + 1), c(d + 1);\n\n  g /= 100;\n\n  for (int i = 0; i < 200000; i++) {\n\n    for (int j = 0; j <= 10; j++) {\n\n      dp[i][j] = MOD;\n    }\n  }\n\n  for (int i = 1; i <= d; i++) {\n\n    cin >> p[i] >> c[i];\n\n    c[i] /= 100;\n  }\n\n  dp[0][0] = 0;\n\n  for (int i = 0; i <= g; i++) {\n\n    for (int j = 1; j <= d; j++) {\n\n      if (dp[i][j - 1] != MOD) {\n\n        for (int k = 0; k < p[j]; k++) {\n\n          dp[i + j * k][j] = min(dp[i][j - 1] + k, dp[i + j * k][j]);\n        }\n\n        dp[i + j * p[j] + c[j]][j] = min(dp[i][j - 1] + p[j], dp[i + j * p[j] + c[j]][j]);\n      }\n    }\n  }\n\n  int ans = MOD;\n\n  for (int i = g; i <= g + 20000; i++) {\n\n    for (int j = 1; j <= d; j++) {\n\n      ans = min(ans, dp[i][j]);\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <iomanip>\n\n#include <string>\n\n#include <vector>\n\n#include <math.h>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <set>\n\n#include <map>\n\nconst int MOD = 1e9 + 7;\n\nconst int MOOD = 998244353;\n\n#define PI 3.14159265359\n\ntypedef long long ll;\n\nusing namespace std;\n\nint dp[11][2001];\n\nint main() {\n\n  int d, g;\n\n  cin >> d >> g;\n\n  vector<int> p(d + 1), c(d + 1);\n\n  for (int i = 1; i <= d; i++) {\n\n    cin >> p[i] >> c[i];\n  }\n\n  for (int i = 0; i <= 10; i++) {\n\n    for (int j = 0; j <= 2000; j++) {\n\n      dp[i][j] = -1;\n    }\n  }\n\n  dp[0][0] = 0;\n\n  for (int i = 1; i <= d; i++) {\n\n    for (int j = 0; j <= 1000; j++) {\n\n      if (dp[i - 1][j] != -1) {\n\n        for (int k = 0; k < p[i]; k++) {\n\n          dp[i][j + k] = max(dp[i][j + k], dp[i - 1][j] + 100 * i * k);\n        }\n\n        dp[i][j + p[i]] = max(dp[i][j + p[i]], dp[i - 1][j] + 100 * i * p[i] + c[i]);\n      }\n    }\n  }\n\n  int ans = MOD;\n\n  for (int i = 1; i <= 10; i++) {\n\n    for (int j = 0; j <= 1000; j++) {\n\n      if (dp[i][j] >= g) {\n\n        ans = min(ans, j);\n      }\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"a973ada27c14dc8ba3ed90b6361523e5f339ca7269da5c183f867a4d23609686","fast_id":"f51131d56a7d70f5fa2deb4196b7e62d5fd505191db6e99ec5772bd8d1454bfe","fast_time":0.0001833632,"language":"cpp","measured_fast_code_id":"f51131d56a7d70f5fa2deb4196b7e62d5fd505191db6e99ec5772bd8d1454bfe","measured_slow_code_id":"0785c0f1d1dd94be6841d0ef28c380ce3803a4239ce237ca796c6f0275f6dcc0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16140","problem_id":"p03401","slow_code_id":"1a93721970ac7379494c96bec455b9141f4acaf5dbfc386f88ff47691487951e","slow_id":"0785c0f1d1dd94be6841d0ef28c380ce3803a4239ce237ca796c6f0275f6dcc0","slow_time":0.0018509314,"speedup":10.094344993979162,"stratum":"8+","sampling_key":"4c47079a7bb9e219b9a034a47319753f49ca62f74339675ea28adc0fb3f4a30c","slow_code":"#include <iostream>\n\n#include <stdio.h>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\n#define ll long long\n\nusing namespace std;\n\nint pos(int n)\n\n{\n\n  if (n < 0)\n\n    return 0;\n\n  else\n\n    return n;\n}\n\nint main()\n\n{\n\n  int a[100002][2] = {0};\n\n  int n;\n\n  cin >> n;\n\n  ll sum = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i][0]);\n\n    sum += abs(a[i - 1][0] - a[i][0]);\n  }\n\n  sum += abs(a[n][0]);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cout << sum - abs(a[i][0] - a[i + 1][0]) - abs(a[i][0] - a[i - 1][0]) +\n                abs(a[i - 1][0] - a[i + 1][0])\n         << endl;\n  }\n}","fast_code":"#include <cstdio>\n\n#include <cctype>\n\nint n, a[100010], tot;\n\nint read() {\n\n  int ret, fl = 1;\n\n  char ch;\n\n  while (!isdigit(ch = getchar()))\n\n    (ch == '-') && (fl = -1);\n\n  ret = ch - '0';\n\n  while (isdigit(ch = getchar()))\n\n    ret *= 10, ret += ch - '0';\n\n  return ret * fl;\n}\n\nvoid print(int x) {\n\n  if (x < 0)\n    putchar('-'), x = -x;\n\n  if (x > 9)\n    print(x / 10);\n\n  putchar(x % 10 + '0');\n}\n\nint abs(int x) { return x > 0 ? x : -x; }\n\nint main() {\n\n  n = read();\n\n  for (int i = 1; i <= n; ++i)\n\n    a[i] = read(), tot += abs(a[i] - a[i - 1]);\n\n  tot += abs(a[n]);\n\n  for (int i = 1; i <= n; ++i) {\n\n    int ans;\n\n    if (a[i] > a[i - 1]) {\n\n      if (a[i + 1] > a[i])\n        ans = tot;\n\n      else {\n\n        if (a[i + 1] > a[i - 1])\n          ans = tot + a[i + 1] * 2 - a[i] * 2;\n\n        else\n          ans = tot + a[i - 1] * 2 - a[i] * 2;\n      }\n\n    }\n\n    else {\n\n      if (a[i + 1] < a[i])\n        ans = tot;\n\n      else {\n\n        if (a[i + 1] > a[i - 1])\n          ans = tot + a[i] * 2 - a[i - 1] * 2;\n\n        else\n          ans = tot + a[i] * 2 - a[i + 1] * 2;\n      }\n    }\n\n    print(ans), putchar('\\n');\n  }\n\n  return 0;\n}"}
{"fast_code_id":"aa84ff77e8138d5650424c3736148cd1982a7d53192caf39cfdb655fce144e00","fast_id":"47c79289b9e82b27925bfec59b43b9d0c0f5adca8b1d8c99825a546272ac1947","fast_time":0.1049787333,"language":"cpp","measured_fast_code_id":"47c79289b9e82b27925bfec59b43b9d0c0f5adca8b1d8c99825a546272ac1947","measured_slow_code_id":"9d6ebd7d5376a126ee4f51e4bf9ac1f6c2d40efb0b30e873dbb6c6b660c75548","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16161","problem_id":"p03828","slow_code_id":"91ee55cd492ef916c2b12a8e816cf45c6ed8c61be23cc40ec448ffbfa85c879b","slow_id":"9d6ebd7d5376a126ee4f51e4bf9ac1f6c2d40efb0b30e873dbb6c6b660c75548","slow_time":0.2742452015,"speedup":2.6123881750057274,"stratum":"2-4","sampling_key":"d619c04d787f58701301c316c3956c11a67f73336b9469c51c05a4a31ab98f7a","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <string>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <cmath>\n\n#include <vector>\n\n#include <queue>\n\n#include <set>\n\n#include <map>\n\n#include <numeric>\n\n#include <functional>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<ll> vl;\n\ntypedef vector<vector<ll>> vvl;\n\ntypedef pair<ll, ll> P;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define exrep(i, a, b) for (ll i = a; i <= b; i++)\n\n#define out(x) cout << x << endl\n\n#define exout(x) printf(\"%.10f\\n\", x)\n\n#define chmax(x, y) x = max(x, y)\n\n#define chmin(x, y) x = min(x, y)\n\n#define all(a) a.begin(), a.end()\n\n#define rall(a) a.rbegin(), a.rend()\n\n#define pb push_back\n\n#define re0 return 0\n\nconst ll mod = 1000000007;\n\nconst ll INF = 1e16;\n\nconst ll MAX_N = 100010;\n\nstruct Eratosthenes {\n\n  ll n;\n\n  vector<ll> f;\n\n  vector<ll> primes;\n\n  Eratosthenes(ll n = 1) : n(n), f(n + 1) {\n\n    f[0] = f[1] = -1;\n\n    for (ll i = 2; i <= n; ++i) {\n\n      if (f[i]) {\n\n        continue;\n      }\n\n      primes.pb(i);\n\n      f[i] = i;\n\n      for (ll j = i * i; j <= n; j += i) {\n\n        if (!f[j]) {\n\n          f[j] = i;\n        }\n      }\n    }\n  }\n\n  bool isPrime(ll x) { return f[x] == x; }\n\n  vector<ll> factorList(ll x) {\n\n    vector<ll> res;\n\n    while (x != 1) {\n\n      res.pb(f[x]);\n\n      x /= f[x];\n    }\n\n    return res;\n  }\n\n  vector<P> factor(ll x) {\n\n    vector<ll> fL = factorList(x);\n\n    if (fL.size() == 0) {\n\n      return {};\n    }\n\n    vector<P> res(1, make_pair(fL[0], 0));\n\n    for (auto p : fL) {\n\n      if (res.back().first == p) {\n\n        res.back().second++;\n\n      }\n\n      else {\n\n        res.emplace_back(p, 1);\n      }\n    }\n\n    return res;\n  }\n};\n\nint main() {\n\n  ll n;\n\n  cin >> n;\n\n  Eratosthenes era(MAX_N);\n\n  map<ll, ll> mp;\n\n  exrep(x, 1, n) {\n\n    auto f = era.factor(x);\n\n    for (auto p : f) {\n\n      mp[p.first] += p.second;\n    }\n  }\n\n  ll ans = 1;\n\n  for (auto p : mp) {\n\n    ans *= (p.second + 1);\n\n    ans %= mod;\n  }\n\n  out(ans);\n\n  re0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <string>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <cmath>\n\n#include <vector>\n\n#include <queue>\n\n#include <set>\n\n#include <map>\n\n#include <numeric>\n\n#include <functional>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<ll> vl;\n\ntypedef vector<vector<ll>> vvl;\n\ntypedef pair<ll, ll> P;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define exrep(i, a, b) for (ll i = a; i <= b; i++)\n\n#define out(x) cout << x << endl\n\n#define exout(x) printf(\"%.10f\\n\", x)\n\n#define chmax(x, y) x = max(x, y)\n\n#define chmin(x, y) x = min(x, y)\n\n#define all(a) a.begin(), a.end()\n\n#define rall(a) a.rbegin(), a.rend()\n\n#define pb push_back\n\n#define re0 return 0\n\nconst ll mod = 1000000007;\n\nconst ll INF = 1e16;\n\nconst ll MAX_N = 100010;\n\nmap<ll, ll> primefactor(ll n) {\n\n  map<ll, ll> res;\n\n  for (ll i = 2; i * i <= n; i++) {\n\n    while (n % i == 0) {\n\n      res[i]++;\n\n      n /= i;\n    }\n  }\n\n  if (n != 1) {\n\n    res[n] = 1;\n  }\n\n  return res;\n}\n\nint main() {\n\n  ll n;\n\n  cin >> n;\n\n  map<ll, ll> mp;\n\n  exrep(x, 1, n) {\n\n    map<ll, ll> mp2 = primefactor(x);\n\n    for (auto p : mp2) {\n\n      mp[p.first] += p.second;\n    }\n  }\n\n  ll ans = 1;\n\n  for (auto p : mp) {\n\n    ans *= (p.second + 1);\n\n    ans %= mod;\n  }\n\n  out(ans);\n\n  re0;\n}"}
{"fast_code_id":"ce2f51a2def06675f9c3857dc0094459c9d8dcd3dcb80591ebcbcdb1956930f1","fast_id":"897a5bd9f25aeed4059bd0e6683d3c28efbfdbb767fbc5f78f42c3aabe89d230","fast_time":0.1059850989,"language":"cpp","measured_fast_code_id":"897a5bd9f25aeed4059bd0e6683d3c28efbfdbb767fbc5f78f42c3aabe89d230","measured_slow_code_id":"5aec671dd021af08824d7464c44f1495f604e52e17f6d348ab9ca0e82a90147e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16175","problem_id":"p03559","slow_code_id":"cf9dfe68d5fa2897127e3b189e90ccbfef6f42cf0e8f0f36423961b9c76b60da","slow_id":"5aec671dd021af08824d7464c44f1495f604e52e17f6d348ab9ca0e82a90147e","slow_time":0.2836816271,"speedup":2.676618034462201,"stratum":"2-4","sampling_key":"732183abde459892dabeab76043c881a8e001851b6b92e2867f4b45a2770dad7","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <fstream>\n\n#include <utility>\n\n#include <iomanip>\n\n#include <cstring>\n\n#include <string>\n\n#include <sstream>\n\n#include <vector>\n\n#include <queue>\n\n#include <cmath>\n\n#include <map>\n\n#include <set>\n\n#define IO                                                                                         \\\n  ios::sync_with_stdio(0);                                                                         \\\n  cin.tie(NULL);                                                                                   \\\n  cout.tie(NULL);\n\ntypedef long long ll;\n\ntypedef long double ld;\n\nusing namespace std;\n\nconst ll INF = 1e18;\n\nconst int mod = 1e4, N = 1e5 + 5, inf = 1e9;\n\nint main()\n\n{\n\n  IO\n\n      int n,\n      a[N], b[N], c[N];\n\n  ll ans[N][2] = {};\n\n  ll A = 0;\n\n  cin >> n;\n\n  for (int i = 0; i<n; cin>> a[i++])\n    ;\n\n  for (int i = 0; i<n; cin>> b[i++])\n    ;\n\n  for (int i = 0; i<n; cin>> c[i++])\n    ;\n\n  sort(a, a + n);\n\n  sort(b, b + n);\n\n  sort(c, c + n);\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    int s = 0, e = n - 1, m, loc = -1;\n\n    while (s <= e)\n\n    {\n\n      m = (s + e) / 2;\n\n      if (a[m] < b[i])\n\n      {\n\n        loc = m;\n\n        s = m + 1;\n\n      }\n\n      else\n        e = m - 1;\n    }\n\n    ans[i][0] = loc + 1;\n  }\n\n  for (int i = 1; i < n; i++)\n\n    ans[i][0] += ans[i - 1][0];\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    int s = 0, e = n - 1, m, loc = -1;\n\n    while (s <= e)\n\n    {\n\n      m = (s + e) / 2;\n\n      if (b[m] < c[i])\n\n      {\n\n        loc = m;\n\n        s = m + 1;\n\n      }\n\n      else\n        e = m - 1;\n    }\n\n    if (loc != -1)\n\n      ans[i][1] = ans[loc][0];\n  }\n\n  for (int i = 0; i < n; i++)\n\n    A += ans[i][1];\n\n  cout << A << '\\n';\n\n  return 0;\n}","fast_code":"#include <math.h>\n\n#include <algorithm>\n\n#include <iostream>\n\nusing namespace std;\n\ntypedef long long int LL;\n\nconst int N = 1e5 + 5;\n\nint a[N];\n\nint b[N];\n\nint c[N];\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n\n    cin >> a[i];\n\n  for (int i = 0; i < n; i++)\n\n    cin >> b[i];\n\n  for (int i = 0; i < n; i++)\n\n    cin >> c[i];\n\n  sort(a, a + n);\n\n  sort(b, b + n);\n\n  sort(c, c + n);\n\n  LL j = 0;\n\n  LL k = 0;\n\n  LL sum = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    while (a[j] < b[i] && j < n) {\n\n      j++;\n    }\n\n    while (c[k] <= b[i] && k < n) {\n\n      k++;\n    }\n\n    sum += (j * (n - k));\n  }\n\n  cout << sum << endl;\n\n  return 0;\n}"}
{"fast_code_id":"01c8b89be8b19a4efcba39c4360e0184b7b662f32a8c6303ffd4e878a87a6d10","fast_id":"b2f4bbcd736b8faec483e5880445268755db6a73519328bc92f526db3881847a","fast_time":0.0010155331,"language":"cpp","measured_fast_code_id":"b2f4bbcd736b8faec483e5880445268755db6a73519328bc92f526db3881847a","measured_slow_code_id":"41b5f345d9d2857ea9c49ffb7bc11ec5222c2c205801625d9a17f1d54973642e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16182","problem_id":"p03182","slow_code_id":"edbb65aced682fb10fcbaf2b958d4ad3e062bded8551762e5c38dca0eb9bf652","slow_id":"41b5f345d9d2857ea9c49ffb7bc11ec5222c2c205801625d9a17f1d54973642e","slow_time":0.0125438262,"speedup":12.351961939989943,"stratum":"8+","sampling_key":"11a897168ad4ca8c32ed09c2ccf5b5cd60e4363d2658b8d649f361cc34ce73bf","slow_code":"#include <bits/stdc++.h>\n\n#define ull unsigned long long\n\n#define ll long long\n\n#define endl '\\n'\n\n#define pb push_back\n\n#define mod 1000000007\n\n#define mp make_pair\n\n#define pi acos(-1)\n\n#define line cout << \"----------------------------\" << endl\n\n#define fast                                                                                       \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(NULL)\n\n#define filein freopen(\"input.text\", \"r\", stdin)\n\n#define fileout freopen(\"output.txt\", \"w\", stdout)\n\nusing namespace std;\n\nconst ll mx = 200009;\n\nll tree[mx * 4];\n\nll lazy[mx * 4];\n\nvector<pair<ll, ll> > l[mx], r[mx];\n\nvoid pushdown(ll node, ll b, ll e)\n\n{\n\n  if (lazy[node])\n\n  {\n\n    tree[node] += lazy[node];\n\n    if (b != e)\n\n    {\n\n      lazy[node * 2] += lazy[node];\n\n      lazy[node * 2 + 1] += lazy[node];\n    }\n\n    lazy[node] = 0;\n  }\n}\n\nvoid update(ll node, ll b, ll e, ll i, ll j, ll val)\n\n{\n\n  pushdown(node, b, e);\n\n  if (b > j or e < i)\n    return;\n\n  if (b >= i and e <= j)\n\n  {\n\n    lazy[node] += val;\n\n    pushdown(node, b, e);\n\n    return;\n  }\n\n  ll mid = (b + e) >> 1;\n\n  update(node * 2, b, mid, i, j, val);\n\n  update(node * 2 + 1, mid + 1, e, i, j, val);\n\n  tree[node] = max(tree[node * 2], tree[node * 2 + 1]);\n}\n\nll query(ll node, ll b, ll e, ll i, ll j)\n\n{\n\n  pushdown(node, b, e);\n\n  if (b > j or e < i)\n    return LLONG_MIN;\n\n  if (b >= i and e <= j)\n    return tree[node];\n\n  ll mid = (b + e) >> 1;\n\n  return max(query(node * 2, b, mid, i, j), query(node * 2 + 1, mid + 1, e, i, j));\n}\n\nint main()\n\n{\n\n  ll n, m;\n\n  cin >> n >> m;\n\n  for (ll i = 0; i < m; i++)\n\n  {\n\n    ll a, b, c;\n\n    cin >> a >> b >> c;\n\n    l[a].pb(mp(a, c));\n\n    r[b].pb(mp(a, c));\n  }\n\n  ll ans = 0;\n\n  for (ll i = 1; i <= n; i++)\n\n  {\n\n    for (auto x : l[i])\n\n    {\n\n      update(1, 0, n, 0, x.first - 1, x.second);\n      ;\n    }\n\n    ll curval = query(1, 0, n, 0, i - 1);\n\n    ans = max(ans, curval);\n\n    update(1, 0, n, i, i, curval);\n\n    for (auto x : r[i])\n\n    {\n\n      update(1, 0, n, 0, x.first - 1, -x.second);\n    }\n  }\n\n  cout << ans << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define eps 1e-3\n\n#define pi acos(-1.0)\n\n#define inf 0x3f\n\n#define INF 0x3f3f3f3f\n\n#define pb push_back\n\n#define debug1 cout << \"&&\";\n\n#define debug2 cout << \"**\";\n\n#define ms(a, x) memset(a, x, sizeof(a))\n\n#define for0(i, n) for (int i = 0; i < n; ++i)\n\n#define for1(i, n) for (int i = 1; i <= n; ++i)\n\nusing namespace std;\n\ntypedef double db;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<long long, int> pli;\n\ntypedef pair<long long, long long> pll;\n\nconst int mod = 1e9 + 7;\n\nconst int N = 2e5 + 10;\n\nconst int M = 1e6 + 10;\n\nint n, m;\n\nll sum[N << 2], tag[N << 2];\n\nstruct node {\n\n  int l, r, a;\n\n} b[N];\n\nbool cmp(node x, node y) { return x.r < y.r; }\n\nvoid add(int rt, int L, int R, int x, int y, ll val) {\n\n  if (x <= L && y >= R) {\n\n    sum[rt] += val, tag[rt] += val;\n\n    return;\n  }\n\n  int mid = (L + R) >> 1;\n\n  if (x <= mid)\n    add(rt << 1, L, mid, x, y, val);\n\n  if (y > mid)\n    add(rt << 1 | 1, mid + 1, R, x, y, val);\n\n  sum[rt] = max(sum[rt << 1], sum[rt << 1 | 1]) + tag[rt];\n}\n\nint main() {\n\n  scanf(\"%d %d\", &n, &m);\n\n  for1(i, m) { scanf(\"%d %d %d\", &b[i].l, &b[i].r, &b[i].a); }\n\n  sort(b + 1, b + 1 + m, cmp);\n\n  int idx = 1;\n\n  for1(i, n) {\n\n    add(1, 1, n, i, i, sum[1]);\n\n    while (b[idx].r == i) {\n\n      add(1, 1, n, b[idx].l, i, b[idx].a);\n\n      idx++;\n    }\n  }\n\n  cout << max(sum[1], (ll)0) << endl;\n\n  return 0;\n}"}
{"fast_code_id":"1c8e3f2ddc7146dad33be2ac66dff9059a5116f88fd2a295d8bad4a54f2b8e1c","fast_id":"97339af4f3758653ba85ed652f9ea028be156d9ce727ecffbe15c6f377fd5369","fast_time":0.0987629406,"language":"cpp","measured_fast_code_id":"97339af4f3758653ba85ed652f9ea028be156d9ce727ecffbe15c6f377fd5369","measured_slow_code_id":"54612b92871154ec3cfab96f6145f9e409a00dabf2557aa3aec486e56772e662","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16201","problem_id":"p02718","slow_code_id":"d3d9fcd377c6e06c3f68cc9c213072d84ea507e88aaf243d2b25811b4ae42613","slow_id":"54612b92871154ec3cfab96f6145f9e409a00dabf2557aa3aec486e56772e662","slow_time":0.2592697776,"speedup":2.625172721922781,"stratum":"2-4","sampling_key":"926b28ddacd9ae82ee34991047f2834d2534203cd74d3c963fd86a556533c9ae","slow_code":"#include \"bits/stdc++.h\"\n\n                          \n\n#define _ ios_base::sync_with_stdio(0);cin.tie(0);\n\n#include <iostream>\n\n#include <stdio.h>\n\n#include <algorithm>\n\n#include <math.h>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair <ll, ll > pll;\n\n\n\nbool comp(const pll& a, const pll& b) {\n\nreturn a.first < b.first;\n\n}\n\nstd::vector<int> enum_div(int n)                     \n\n{\n\n  std::vector<int> ret;\n\n  for (int i = 1; i * i <= n; ++i)\n\n  {\n\n    if (n % i == 0)\n\n    {\n\n      ret.push_back(i);\n\n      if (i != 1 && i * i != n)\n\n      {\n\n        ret.push_back(n / i);\n\n      }\n\n    }\n\n  }\n\n  return ret;\n\n}\n\nconst int mod = 1000000007;\n\nstruct mint {\n\n  ll x;                         \n\n  mint(ll x = 0) :x((x% mod + mod) % mod) {}\n\n  mint& operator+=(const mint a) {\n\n    if ((x += a.x) >= mod) x -= mod;\n\n    return *this;\n\n  }\n\n  mint& operator-=(const mint a) {\n\n    if ((x += mod - a.x) >= mod) x -= mod;\n\n    return *this;\n\n  }\n\n  mint& operator*=(const mint a) {\n\n    (x *= a.x) %= mod;\n\n    return *this;\n\n  }\n\n  mint operator+(const mint a) const {\n\n    mint res(*this);\n\n    return res += a;\n\n  }\n\n  mint operator-(const mint a) const {\n\n    mint res(*this);\n\n    return res -= a;\n\n  }\n\n  mint operator*(const mint a) const {\n\n    mint res(*this);\n\n    return res *= a;\n\n  }\n\n  mint pow(ll t) const {\n\n    if (!t) return 1;\n\n    mint a = pow(t >> 1);\n\n    a *= a;\n\n    if (t & 1) a *= *this;\n\n    return a;\n\n  }\n\n\n\n\t                \n\n  mint inv() const {\n\n  return pow(mod - 2);\n\n  }\n\n  mint& operator/=(const mint a) {\n\n  return (*this) *= a.inv();\n\n  }\n\n  mint operator/(const mint a) const {\n\n    mint res(*this);\n\n    return res /= a;\n\n  }\n\n};\n\n\n\nmint choose(int n, int a)\n\n{\n\n  mint x = 1, y = 1;\n\n  for (int i = 0; i < a; i++)\n\n  {\n\n    x *= n - i;\n\n    y *= i + 1;\n\n  }\n\n  return x / y;\n\n}\n\n\n\nstruct combination {\n\n  vector<mint> fact, ifact;\n\n  combination(int n) :fact(n + 1), ifact(n + 1) {\n\n    assert(n < mod);\n\n    fact[0] = 1;\n\n    for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;\n\n    ifact[n] = fact[n].inv();\n\n    for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;\n\n  }\n\n  mint operator()(int n, int k) {\n\n    if (k < 0 || k > n) return 0;\n\n    return fact[n] * ifact[k] * ifact[n - k];\n\n  }\n\n};\n\n\n\ntemplate<int N>\n\nint factorial() {\n\n  return factorial<N - 1>() * N;\n\n}\n\nll nCr(ll n, ll r);                          \n\nint permutation(int n, int r);                                 \n\nint factorial(int k);        \n\n\n\ntemplate<>                                                                 \n\nint factorial<1>() {\n\n  return 1;\n\n}\n\n\n\n#define MAX_N 100005\n\nint par[MAX_N] = {};\n\nint rank1[MAX_N] = {};\n\nvoid init(int n)\n\n{\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    par[i] = i;\n\n    rank1[i] = 0;\n\n  }\n\n}\n\nint root(int x)\n\n{\n\n  return par[x] == x ? x : par[x] = root(par[x]);\n\n}\n\nbool same(int x, int y)\n\n{\n\n  return root(x) == root(y);\n\n}\n\nvoid unite(int x, int y)\n\n{\n\n  x = root(x); y = root(y);\n\n  if (x == y) return;\n\n  if (rank1[x] < rank1[y])\n\n  {\n\n    par[x] = y;\n\n  }\n\n  else\n\n  {\n\n    par[y] = x;\n\n    if (rank1[x] == rank1[y]) rank1[x]++;\n\n  }\n\n}\n\n\n\nint main()\n\n{\n\n\t                        \n\n  long double h = 0, w = 0, k = 0, a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, ans = 0;\n\n  ll x[200005] = {};\n\n  ll y[200005] = {};\n\n  ll z[100005] = {};\n\n\t                           \n\n\t                                                  \n\n  string s;\n\n  cin >> a;\n\n  cin >> b;\n\n  for (int i = 0; i < a; i++)\n\n  {\n\n    cin >> x[i];\n\n    c += x[i];\n\n  }\n\n  for (int i = 0; i < a; i++)\n\n  {\n\n    if (x[i] >= c / 4 / b)\n\n    {\n\n      ans++;\n\n    }\n\n  }\n\n  if (b <= ans)\n\n  {\n\n    cout << \"Yes\" << endl;\n\n  }\n\n  else\n\n  {\n\n    cout << \"No\" << endl;\n\n  }\n\n\n\n\n\n\n\n\n\n\t                                                                            \n\n\n\n                   \n\n\n\n\n\n\n\n                                      \n\n                          \n\n                           \n\n\n\n           \n\n\n\n                    \n\n                    \n\n                                                  \n\n                            \n\n  return 0;\n\n}\n\n                                                   \n\n                                 \n\n                              \n\n   \n\n            \n\n                                  \n\n   \n\n                                         \n\n                             \n\n   \n\n                                   \n\n   \n\n\n\nint permutation(int n, int r) {\n\n  int n_sum, r_sum;\n\n  int i;\n\n  r = n - r;\n\n  n_sum = factorial(n);\n\n  r_sum = factorial(r);\n\n  return n_sum / r_sum;\n\n}\n\n\n\nll nCr(ll n, ll r) {\n\n  ll ans = 1;\n\n  for (ll i = n; i > n - r; --i) {\n\n    ans = ans * i;\n\n  }\n\n  for (ll i = 1; i < r + 1; ++i) {\n\n    ans = ans / i;\n\n  }\n\n  return ans;\n\n}\n\nint factorial(int k) {\n\n  int sum = 1;\n\n  for (int i = 1; i <= k; ++i)\n\n  {\n\n    sum *= i;\n\n  }\n\n  return sum;\n\n}\n","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, x, y) for (int i = x; i < y; i++)\n\n#define rel(i, x, y) for (int i = x - 1; i >= y; i--)\n\n#define all(x) x.begin(), x.end()\n\nint main()\n\n{\n\n  cin.tie(nullptr);\n\n  ios::sync_with_stdio(false);\n\n  cout << fixed << setprecision(15);\n\n  int n, m;\n  cin >> n >> m;\n\n  int a[1000];\n\n  int sum = 0;\n\n  rep(i, 0, n) {\n    cin >> a[i];\n    sum += a[i];\n  }\n\n  int cnt = 0;\n\n  rep(i, 0, n) {\n\n    if (a[i] >= (sum + 4 * m - 1) / (4 * m))\n      cnt++;\n  }\n\n  if (cnt >= m)\n    cout << \"Yes\" << endl;\n\n  else\n    cout << \"No\" << endl;\n}"}
{"fast_code_id":"a61e7be6cf59264dc368837fc1cb6347d6fe0f3fe0ff6f5c8c4462ad1c69c627","fast_id":"647ecdbc0c91735e24e82130bc0552838fff7ad2f2e1b9e55b9fa5ed7daecb9e","fast_time":0.1081909228,"language":"cpp","measured_fast_code_id":"647ecdbc0c91735e24e82130bc0552838fff7ad2f2e1b9e55b9fa5ed7daecb9e","measured_slow_code_id":"e293376412d2cb1470cb274261f36b1c4fd3667048a042c9674a778da1dfdc59","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16368","problem_id":"p03173","slow_code_id":"7e79c687a8067defde8470b58d0a4d41d49b4647fa2d183d4941f5b834ecb519","slow_id":"e293376412d2cb1470cb274261f36b1c4fd3667048a042c9674a778da1dfdc59","slow_time":0.4186431724,"speedup":3.8694851801374965,"stratum":"2-4","sampling_key":"313c4115f65bfb952f27d86ca3fb9d81ec22e4e7ff52123aae2d6a13da065dfa","slow_code":"\n\n#include <cstring>\n\n#include <vector>\n\n#include <list>\n\n#include <map>\n\n#include <set>\n\n#include <deque>\n\n#include <stack>\n\n#include <bitset>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <queue>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <cassert>\n\n#include <iterator>\n\n#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);\n\n#define S second\n\n#define F first\n\n#define pb push_back\n\n#define nl '\\n'\n\n#define NL cout << '\\n';\n\n#define EX exit(0)\n\n#define all(s) s.begin(), s.end()\n\n#define FOR(i, start, finish, k) for (int i = start; i <= finish; i += k)\n\nconst int MXN = 1e6 + 200;\n\nconst long long MNN = 4e2 + 200;\n\nconst long long MOD = 1e9 + 7;\n\nconst long long INF = 1e18;\n\nconst int OO = 1e9 + 500;\n\ntypedef long long llong;\n\ntypedef unsigned long long ullong;\n\nusing namespace std;\n\nint n;\n\nllong a[MXN], pr[MXN], dp[MNN][MNN];\n\nllong get(llong l, llong r) {\n\n  if (dp[l][r] != -1)\n    return dp[l][r];\n\n  if (r - l == 1)\n    return dp[l][r] = a[l] + a[r];\n\n  if (r - l == 0)\n    return dp[l][r] = 0;\n\n  llong mn = INF;\n\n  for (int i = l; i < r; i++) {\n\n    mn = min(get(l, i) + get(i + 1, r), mn);\n  }\n\n  return dp[l][r] = (mn + pr[r] - pr[l - 1]);\n}\n\nint main() {\n\n  ios;\n\n  memset(dp, -1, sizeof(dp));\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++) {\n\n    cin >> a[i];\n\n    pr[i] = pr[i - 1] + a[i];\n  }\n\n  cout << get(1, n);\n}\n","fast_code":"\n\n#include <cstring>\n\n#include <vector>\n\n#include <list>\n\n#include <map>\n\n#include <set>\n\n#include <deque>\n\n#include <stack>\n\n#include <bitset>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <queue>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <cassert>\n\n#include <iterator>\n\n#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);\n\n#define S second\n\n#define F first\n\n#define pb push_back\n\n#define nl '\\n'\n\n#define NL cout << '\\n';\n\n#define EX exit(0)\n\n#define all(s) s.begin(), s.end()\n\n#define FOR(i, start, finish, k) for (int i = start; i <= finish; i += k)\n\nconst int MXN = 1e6 + 200;\n\nconst long long MNN = 4e2 + 200;\n\nconst long long MOD = 1e9 + 7;\n\nconst long long INF = 1e18;\n\nconst int OO = 1e9 + 500;\n\ntypedef long long llong;\n\ntypedef unsigned long long ullong;\n\nusing namespace std;\n\nint n;\n\nllong a[MXN], pr[MXN], dp[MNN][MNN];\n\nint main() {\n\n  ios;\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = 1; j <= n; j++) {\n\n      dp[i][j] = INF;\n    }\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    cin >> a[i];\n\n    pr[i] = pr[i - 1] + a[i];\n\n    dp[i][i] = 0;\n  }\n\n  for (int sz = 1; sz <= n - 1; sz++) {\n\n    for (int l = 1; l + sz <= n; l++) {\n\n      int r = l + sz;\n\n      for (int i = l; i < r; i++) {\n\n        dp[l][r] = min(dp[l][r], dp[l][i] + dp[i + 1][r] + pr[r] - pr[l - 1]);\n      }\n    }\n  }\n\n  cout << dp[1][n];\n}\n"}
{"fast_code_id":"32c529ffebea102242b38c1c25772aff754a535a320738a4c83e2e32dc232f8d","fast_id":"d2474df4040b1a644fe8b9e43571d184966aa8e5c762a88c4df36e0f374e2538","fast_time":0.1067920505,"language":"cpp","measured_fast_code_id":"d2474df4040b1a644fe8b9e43571d184966aa8e5c762a88c4df36e0f374e2538","measured_slow_code_id":"ceb2eedffcf8c834ea4345edeb21f34505e744cf5680ee86bf2aca54d4bff43a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16504","problem_id":"p02888","slow_code_id":"d5a2e9c16b550d3d76db295a88b7d4830129eddf57b4e97124bc7921df982353","slow_id":"ceb2eedffcf8c834ea4345edeb21f34505e744cf5680ee86bf2aca54d4bff43a","slow_time":0.3332400457,"speedup":3.120457413634922,"stratum":"2-4","sampling_key":"f17244af255845ec68c34a0156c6a5041e3bb70995060ed74d3d377ded2f5703","slow_code":"#define DEBUG 0\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <cassert>\n\n#include <cctype>\n\n#include <chrono>\n\n#include <cmath>\n\n#include <complex>\n\n#include <cstdint>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <iostream>\n\n#include <map>\n\n#include <queue>\n\n#include <random>\n\n#include <set>\n\n#include <stack>\n\n#include <string>\n\n#include <tuple>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <vector>\n\n#include <boost/rational.hpp>\n\n#include <boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n\nusing boost::rational;\n\nusing boost::multiprecision::cpp_int;\n\nusing ll = long long;\n\nusing ld = long double;\n\ntemplate <typename T>\n\nusing max_heap = priority_queue<T>;\n\ntemplate <typename T>\n\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\nconstexpr ll MOD{1'000'000'007LL};\n\nconstexpr ll MAX_SIZE{3'000'010LL};\n\ntemplate <typename T>\n\nvoid ch_max(T &left, T right)\n\n{\n\n  if (left < right)\n\n  {\n\n    left = right;\n  }\n}\n\ntemplate <typename T>\n\nvoid ch_min(T &left, T right)\n\n{\n\n  if (left > right)\n\n  {\n\n    left = right;\n  }\n}\n\ntemplate <ll MOD = MOD>\n\nclass Mint\n\n{\n\npublic:\n  ll x;\n\n  Mint() : x{0LL} {}\n\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n\n  Mint operator-() const { return x ? MOD - x : 0; }\n\n  Mint &operator+=(Mint const &a)\n\n  {\n\n    if ((x += a.x) >= MOD)\n\n    {\n\n      x -= MOD;\n    }\n\n    return *this;\n  }\n\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n\n  Mint &operator++() { return *this += 1; }\n\n  Mint operator++(int)\n\n  {\n\n    Mint tmp{*this};\n\n    ++*this;\n\n    return tmp;\n  }\n\n  Mint &operator--() { return *this -= 1; }\n\n  Mint operator--(int)\n\n  {\n\n    Mint tmp{*this};\n\n    --*this;\n\n    return tmp;\n  }\n\n  Mint &operator*=(Mint const &a)\n\n  {\n\n    (x *= a.x) %= MOD;\n\n    return *this;\n  }\n\n  Mint &operator/=(Mint const &a)\n\n  {\n\n    Mint b{a};\n\n    return *this *= b.power(MOD - 2);\n  }\n\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n\n  Mint operator/(Mint const &a) const { return Mint(*this) /= a; }\n\n  bool operator<(Mint const &a) const { return x < a.x; }\n\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n\n  bool operator>(Mint const &a) const { return x > a.x; }\n\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n\n  bool operator==(Mint const &a) const { return x == a.x; }\n\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n\n  Mint power(ll N) const\n\n  {\n\n    if (N == 0)\n\n    {\n\n      return 1;\n\n    }\n\n    else if (N % 2 == 1)\n\n    {\n\n      return *this * power(N - 1);\n\n    }\n\n    else\n\n    {\n\n      Mint half = power(N / 2);\n\n      return half * half;\n    }\n  }\n};\n\ntemplate <ll MOD>\n\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs)\n\n{\n\n  return rhs + lhs;\n}\n\ntemplate <ll MOD>\n\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs)\n\n{\n\n  return -rhs + lhs;\n}\n\ntemplate <ll MOD>\n\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs)\n\n{\n\n  return rhs * lhs;\n}\n\ntemplate <ll MOD>\n\nMint<MOD> operator/(ll lhs, Mint<MOD> const &rhs)\n\n{\n\n  return Mint<MOD>{lhs} / rhs;\n}\n\ntemplate <ll MOD>\n\nistream &operator>>(istream &stream, Mint<MOD> &a)\n\n{\n\n  return stream >> a.x;\n}\n\ntemplate <ll MOD>\n\nostream &operator<<(ostream &stream, Mint<MOD> const &a)\n\n{\n\n  return stream << a.x;\n}\n\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\n\nclass Combination\n\n{\n\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n\n  Combination()\n      : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n\n  {\n\n    inv[1] = 1;\n\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n\n    {\n\n      inv[i] = (-inv[MOD % i]) * (MOD / i);\n    }\n\n    fact[0] = factinv[0] = 1;\n\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n\n    {\n\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n\n  Mint<MOD> operator()(int n, int k)\n\n  {\n\n    if (n >= 0 && k >= 0 && n - k >= 0)\n\n    {\n\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n\n    return 0;\n  }\n\n  Mint<MOD> catalan(int x, int y)\n\n  {\n\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\nusing mint = Mint<MOD>;\n\nusing combination = Combination<MOD, MAX_SIZE>;\n\ntemplate <typename T>\n\nT gcd(T x, T y) {\n  return y ? gcd(y, x % y) : x;\n}\n\ntemplate <typename T>\n\nT lcm(T x, T y) {\n  return x / gcd(x, y) * y;\n}\n\ntemplate <typename T>\n\nint popcount(T x)\n\n{\n\n  int ans{0};\n\n  while (x != 0)\n\n  {\n\n    ans += x & 1;\n\n    x >>= 1;\n  }\n\n  return ans;\n}\n\nvoid Yes()\n\n{\n\n  cout << \"Yes\" << endl;\n\n  exit(0);\n}\n\nvoid No()\n\n{\n\n  cout << \"No\" << endl;\n\n  exit(0);\n}\n\ntemplate <typename T>\n\nclass SegTree\n\n{\n\nprivate:\n  int N;\n\n  vector<T> dat;\n\n  T unit;\n\n  T(*func)\n\n  (T, T);\n\n  T(*_update)\n\n  (T, T);\n\npublic:\n  SegTree() {}\n\n  SegTree(int n, T unit, T (*func)(T, T), T (*_update)(T, T))\n      : N{1}, unit{unit}, func{func}, _update{_update}\n\n  {\n\n    while (N < n)\n\n    {\n\n      N *= 2;\n    }\n\n    dat = vector<T>(2 * N - 1, unit);\n  }\n\n  void update(int k, T a)\n\n  {\n\n    k += N - 1;\n\n    dat[k] = _update(dat[k], a);\n\n    while (k > 0)\n\n    {\n\n      k = (k - 1) / 2;\n\n      dat[k] = func(dat[k * 2 + 1], dat[k * 2 + 2]);\n    }\n  }\n\nprivate:\n  T find(int a, int b, int k, int l, int r)\n\n  {\n\n    if (r <= a || b <= l)\n\n    {\n\n      return unit;\n    }\n\n    if (a <= l && r <= b)\n\n    {\n\n      return dat[k];\n    }\n\n    T vl = find(a, b, k * 2 + 1, l, (l + r) / 2);\n\n    T vr = find(a, b, k * 2 + 2, (l + r) / 2, r);\n\n    return func(vl, vr);\n  }\n\npublic:\n  T find(int a, int b)\n\n  {\n\n    return find(a, b, 0, 0, N);\n  }\n};\n\nauto func2 = [](auto x, auto y) {\n  return x + y;\n};\n\nauto _update2 = [](auto x, auto y) {\n  return y;\n};\n\nconstexpr ll unit2{0LL};\n\nint main()\n\n{\n\n  int N;\n\n  cin >> N;\n\n  vector<int> L(N);\n\n  for (auto i{0}; i < N; ++i)\n\n  {\n\n    cin >> L[i];\n  }\n\n  SegTree<ll> tree{100010, unit2, func2, _update2};\n\n  for (auto i{0}; i < N; ++i)\n\n  {\n\n    tree.update(L[i], tree.find(L[i], L[i] + 1) + 1);\n  }\n\n  ll ans{0};\n\n  for (auto i{0}; i < N; ++i)\n\n  {\n\n    for (auto j{i + 1}; j < N; ++j)\n\n    {\n\n      int b{L[i]};\n\n      int c{L[j]};\n\n      ll t{tree.find(abs(b - c) + 1, b + c)};\n\n      if (abs(b - c) < b && b < b + c)\n\n      {\n\n        --t;\n      }\n\n      if (abs(b - c) < c && c < b + c)\n\n      {\n\n        --t;\n      }\n\n      ans += t;\n    }\n  }\n\n  cout << ans / 3 << endl;\n}\n","fast_code":"#define DEBUG 0\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <cassert>\n\n#include <cctype>\n\n#include <chrono>\n\n#include <cmath>\n\n#include <complex>\n\n#include <cstdint>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <iostream>\n\n#include <map>\n\n#include <queue>\n\n#include <random>\n\n#include <set>\n\n#include <stack>\n\n#include <string>\n\n#include <tuple>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <vector>\n\n#include <boost/rational.hpp>\n\n#include <boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n\nusing boost::rational;\n\nusing boost::multiprecision::cpp_int;\n\nusing ll = long long;\n\nusing ld = long double;\n\ntemplate <typename T>\n\nusing max_heap = priority_queue<T>;\n\ntemplate <typename T>\n\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\nconstexpr ll MOD{1'000'000'007LL};\n\nconstexpr ll MAX_SIZE{3'000'010LL};\n\ntemplate <typename T>\n\nvoid ch_max(T &left, T right)\n\n{\n\n  if (left < right)\n\n  {\n\n    left = right;\n  }\n}\n\ntemplate <typename T>\n\nvoid ch_min(T &left, T right)\n\n{\n\n  if (left > right)\n\n  {\n\n    left = right;\n  }\n}\n\ntemplate <ll MOD = MOD>\n\nclass Mint\n\n{\n\npublic:\n  ll x;\n\n  Mint() : x{0LL} {}\n\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n\n  Mint operator-() const { return x ? MOD - x : 0; }\n\n  Mint &operator+=(Mint const &a)\n\n  {\n\n    if ((x += a.x) >= MOD)\n\n    {\n\n      x -= MOD;\n    }\n\n    return *this;\n  }\n\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n\n  Mint &operator++() { return *this += 1; }\n\n  Mint operator++(int)\n\n  {\n\n    Mint tmp{*this};\n\n    ++*this;\n\n    return tmp;\n  }\n\n  Mint &operator--() { return *this -= 1; }\n\n  Mint operator--(int)\n\n  {\n\n    Mint tmp{*this};\n\n    --*this;\n\n    return tmp;\n  }\n\n  Mint &operator*=(Mint const &a)\n\n  {\n\n    (x *= a.x) %= MOD;\n\n    return *this;\n  }\n\n  Mint &operator/=(Mint const &a)\n\n  {\n\n    Mint b{a};\n\n    return *this *= b.power(MOD - 2);\n  }\n\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n\n  Mint operator/(Mint const &a) const { return Mint(*this) /= a; }\n\n  bool operator<(Mint const &a) const { return x < a.x; }\n\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n\n  bool operator>(Mint const &a) const { return x > a.x; }\n\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n\n  bool operator==(Mint const &a) const { return x == a.x; }\n\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n\n  Mint power(ll N) const\n\n  {\n\n    if (N == 0)\n\n    {\n\n      return 1;\n\n    }\n\n    else if (N % 2 == 1)\n\n    {\n\n      return *this * power(N - 1);\n\n    }\n\n    else\n\n    {\n\n      Mint half = power(N / 2);\n\n      return half * half;\n    }\n  }\n};\n\ntemplate <ll MOD>\n\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs)\n\n{\n\n  return rhs + lhs;\n}\n\ntemplate <ll MOD>\n\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs)\n\n{\n\n  return -rhs + lhs;\n}\n\ntemplate <ll MOD>\n\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs)\n\n{\n\n  return rhs * lhs;\n}\n\ntemplate <ll MOD>\n\nMint<MOD> operator/(ll lhs, Mint<MOD> const &rhs)\n\n{\n\n  return Mint<MOD>{lhs} / rhs;\n}\n\ntemplate <ll MOD>\n\nistream &operator>>(istream &stream, Mint<MOD> &a)\n\n{\n\n  return stream >> a.x;\n}\n\ntemplate <ll MOD>\n\nostream &operator<<(ostream &stream, Mint<MOD> const &a)\n\n{\n\n  return stream << a.x;\n}\n\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\n\nclass Combination\n\n{\n\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n\n  Combination()\n      : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n\n  {\n\n    inv[1] = 1;\n\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n\n    {\n\n      inv[i] = (-inv[MOD % i]) * (MOD / i);\n    }\n\n    fact[0] = factinv[0] = 1;\n\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n\n    {\n\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n\n  Mint<MOD> operator()(int n, int k)\n\n  {\n\n    if (n >= 0 && k >= 0 && n - k >= 0)\n\n    {\n\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n\n    return 0;\n  }\n\n  Mint<MOD> catalan(int x, int y)\n\n  {\n\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\nusing mint = Mint<MOD>;\n\nusing combination = Combination<MOD, MAX_SIZE>;\n\ntemplate <typename T>\n\nT gcd(T x, T y) {\n  return y ? gcd(y, x % y) : x;\n}\n\ntemplate <typename T>\n\nT lcm(T x, T y) {\n  return x / gcd(x, y) * y;\n}\n\ntemplate <typename T>\n\nint popcount(T x)\n\n{\n\n  int ans{0};\n\n  while (x != 0)\n\n  {\n\n    ans += x & 1;\n\n    x >>= 1;\n  }\n\n  return ans;\n}\n\nvoid Yes()\n\n{\n\n  cout << \"Yes\" << endl;\n\n  exit(0);\n}\n\nvoid No()\n\n{\n\n  cout << \"No\" << endl;\n\n  exit(0);\n}\n\nint main()\n\n{\n\n  int N;\n\n  cin >> N;\n\n  vector<int> L(N);\n\n  for (auto i{0}; i < N; ++i)\n\n  {\n\n    cin >> L[i];\n  }\n\n  sort(L.begin(), L.end());\n\n  ll ans{0};\n\n  for (auto i{1}; i < N - 1; ++i)\n\n  {\n\n    int k{i + 1};\n\n    for (auto j{0}; j < i; ++j)\n\n    {\n\n      while (k < N && L[k] < L[i] + L[j])\n\n      {\n\n        ++k;\n      }\n\n      ans += k - i - 1;\n    }\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"b6aaa7d57edf4fd23ffd1f9bc3934ae47ede6b950053981ddfdccd9578ed769e","fast_id":"468e1a0c3fff4ddad772e8ca0f210a33f718b69200dafa73490cb212f945d879","fast_time":0.0547927583,"language":"cpp","measured_fast_code_id":"468e1a0c3fff4ddad772e8ca0f210a33f718b69200dafa73490cb212f945d879","measured_slow_code_id":"3814fb1edd0b8f951c63c335e40acc19d979fc527c629e6cca2c09efd510d66b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16593","problem_id":"p01884","slow_code_id":"d2c1c87753998da32d237c26af3aa0b5d363aa277c15a44a9947974649d02673","slow_id":"3814fb1edd0b8f951c63c335e40acc19d979fc527c629e6cca2c09efd510d66b","slow_time":0.383137564,"speedup":6.992485428498678,"stratum":"4-8","sampling_key":"a5b4aa5c128669ef60062d7611443a788c2dba669ee2387b71726825a5b945e7","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ull unsigned long long\n\n#define ll long long\n\nll ans;\n\nmap<ull, ll> m;\n\nconst int maxn = 200005;\n\nvector<int> g[maxn];\n\null dp[maxn];\n\nconst ull b = 1000000007;\n\nvoid dfs(int u, int p)\n\n{\n\n  dp[u] = 1;\n\n  for (int i = 0; i < g[u].size(); i++)\n\n  {\n\n    int v = g[u][i];\n\n    if (v == p)\n\n      continue;\n\n    dfs(v, u);\n\n    dp[u] += dp[v] * b;\n  }\n\n  ans += m[dp[u]];\n\n  m[dp[u]]++;\n}\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    g[u].push_back(v);\n\n    g[v].push_back(u);\n  }\n\n  dfs(1, -1);\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <vector>\n\n#include <map>\n\nusing namespace std;\n\nconst int N = 100005;\n\nint fa[N];\n\nunsigned long long value[N];\n\nint sons[N];\n\nint rsons[N];\n\nvector<int> now;\n\nbool vis[N];\n\nmap<unsigned long long, int> times;\n\nint main(int argc, char const *argv[])\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n - 1; i++) {\n\n    int start, end;\n\n    scanf(\"%d%d\", &start, &end);\n\n    fa[end] = start;\n\n    sons[start]++;\n\n    rsons[start]++;\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    if (sons[i] == 0) {\n\n      now.push_back(i);\n    }\n  }\n\n  int now_size = now.size();\n\n  while (now_size > 0) {\n\n    int new_index = 0;\n\n    for (int i = 0; i < now_size; i++) {\n\n      int f = fa[now[i]];\n\n      if (rsons[now[i]] == 0) {\n\n        value[now[i]]++;\n\n        times[value[now[i]]]++;\n\n        value[f] += value[now[i]] * 13131;\n\n        rsons[f]--;\n\n        if (rsons[f] == 0 && !vis[f]) {\n\n          vis[f] = true;\n\n          now[new_index++] = f;\n        }\n      }\n    }\n\n    now_size = new_index;\n  }\n\n  long long result = 0;\n\n  for (auto it = times.begin(); it != times.end(); it++) {\n\n    long long n = (*it).second;\n\n    result += n * (n - 1) / 2;\n  }\n\n  printf(\"%lld\\n\", result);\n\n  return 0;\n}"}
{"fast_code_id":"438702921e01978657a4c0684d79c86c68431a4d5325cdd611e8ed464a983116","fast_id":"4e2f8b3e8608275580a624ef16c061169e7591f882e70c87e48efbc2614f3c37","fast_time":0.0196059178,"language":"cpp","measured_fast_code_id":"4e2f8b3e8608275580a624ef16c061169e7591f882e70c87e48efbc2614f3c37","measured_slow_code_id":"eb22564b95802da12c7b51886ab9b26d41eb1a5794bf53282aa0b0e047ad9cc7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16716","problem_id":"p03045","slow_code_id":"795a66d4e6dadf5ce7362383e93979a83a4384edafa40508bc5b6589da096d1c","slow_id":"eb22564b95802da12c7b51886ab9b26d41eb1a5794bf53282aa0b0e047ad9cc7","slow_time":0.9853117291,"speedup":50.25583291489674,"stratum":"8+","sampling_key":"eda3e1d19e236c0b7a977bb4fb8394af76f4ffc01af67f415760f16d19d23e7c","slow_code":"\n\n#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace __gnu_pbds;\n\nusing namespace std;\n\ntemplate <typename T>\nusing ordered_set =\n    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n\n#define F first\n\n#define S second\n\n#define lb lower_bound\n\n#define ub upper_bound\n\n#define pb push_back\n\n#define pf push_front\n\n#define ppb pop_back\n\n#define mp make_pair\n\n#define bpp __builtin_popcountll\n\n#define sqr(x) ((x) * (x))\n\n#define al 0x3F3F3F3F\n\n#define sz(x) (int)x.size()\n\n#define all(x) x.begin(), x.end()\n\n#define in insert\n\n#define ppf pop_front\n\n#define endl '\\n'\n\ntypedef unsigned long long ull;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\ntypedef pair<int, int> pii;\n\nconst int mod = (int)1e9 + 7;\n\nconst int N = (int)3e5 + 123;\n\nconst ll inf = (ll)1e18 + 1;\n\nconst double pi = acos(-1.0);\n\nconst double eps = 1e-7;\n\nconst int dx[] = {0, 0, 1, 0, -1};\n\nconst int dy[] = {0, 1, 0, -1, 0};\n\nint n, m, x[N], y[N], z[N], ans;\n\nvector<int> g[N];\n\nbool used[N];\n\nvoid dfs(int v) {\n\n  used[v] = 1;\n\n  for (auto to : g[v])\n\n    if (!used[to])\n\n      dfs(to);\n}\n\ninline void boost() {\n\n  ios_base ::sync_with_stdio(NULL);\n\n  cin.tie(NULL), cout.tie(NULL);\n}\n\ninline void Solve() {\n\n  cin >> n >> m;\n\n  for (int i = 1; i <= m; i++) {\n\n    cin >> x[i] >> y[i] >> z[i];\n\n    g[x[i]].pb(y[i]);\n\n    g[y[i]].pb(x[i]);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    if (!used[i])\n\n      dfs(i), ans++;\n\n  cout << ans;\n}\n\nmain() {\n\n  boost();\n\n  int tt = 1;\n\n  while (tt--) {\n\n    Solve();\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nconst int maxn = 1e5 + 7;\n\nint pre[maxn];\n\nbool you[maxn];\n\nint Find(int x)\n\n{\n\n  if (pre[x] == x)\n    return x;\n\n  else\n    return pre[x] = Find(pre[x]);\n}\n\nvoid join(int x, int y)\n\n{\n\n  int fx = Find(x);\n\n  int fy = Find(y);\n\n  if (fx != fy)\n    pre[fx] = fy;\n}\n\nint main()\n\n{\n\n  int n, m, sum = 0, jian = 0;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++)\n    pre[i] = i;\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int a, b, c;\n\n    scanf(\"%d%d%d\", &a, &b, &c);\n\n    if (a == b && you[a] == false)\n\n    {\n\n      jian++;\n\n      you[a] = true;\n    }\n\n    join(a, b);\n  }\n\n  for (int i = 1; i <= n; i++)\n    if (pre[i] == i)\n      sum++;\n\n  printf(\"%d\\n\", sum - jian);\n\n  printf(\"\\n\");\n}"}
{"fast_code_id":"53457ab5e909730a3c519f7978888311008d58bb7e975fdebd28da79d476cf6f","fast_id":"89dbe2bdf560b814119e224ed0a2c554ec2c48fd077153ab70d594f81070836d","fast_time":0.0397698956,"language":"cpp","measured_fast_code_id":"89dbe2bdf560b814119e224ed0a2c554ec2c48fd077153ab70d594f81070836d","measured_slow_code_id":"a84fad162e1457572a529812c268fa5731ff42db4cfc64d49327046f7e0bf7d7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16753","problem_id":"p02904","slow_code_id":"7f3147bad48003b65b2f9d77f9033fe067e673e065bbd9127e9673bf803a4ae8","slow_id":"a84fad162e1457572a529812c268fa5731ff42db4cfc64d49327046f7e0bf7d7","slow_time":0.1378626246,"speedup":3.4665070782836054,"stratum":"2-4","sampling_key":"7a8d0ea1d2336264d3357a52e909f3e50ac23a9218a269767324b3d515b34cb1","slow_code":"#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\n#define intt long long\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nvector<int> v[100004];\n\nbool went[100004];\n\nvoid dfs(int x) {\n\n  went[x] = true;\n\n  for (int i = 0; i < (int)v[x].size(); i++) {\n\n    if (!went[v[x][i]]) {\n\n      dfs(v[x][i]);\n    }\n  }\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\nint lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\nint fukugen(vector<int> l) {\n\n  int ans = 0;\n\n  for (int i = 0; i < (int)l.size(); i++) {\n\n    ans *= 10;\n\n    ans += l[i];\n  }\n\n  return ans;\n}\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nint n, k, ans, kan;\n\nbool nonok[200004];\n\nvector<int> p;\n\nvector<vector<int>> vec;\n\nsigned main() {\n\n  cin >> n >> k;\n\n  SegTree<int> seg1(n, inf, R_MIN, NORMAL_UPDATE);\n\n  SegTree<int> seg2(n, 0 - inf, R_MAX, NORMAL_UPDATE);\n\n  rep(i, n) {\n\n    intt l;\n\n    cin >> l;\n\n    p.push_back(l);\n\n    seg1.change(i, p[i]);\n\n    seg2.change(i, p[i]);\n  }\n\n  ans = n - k + 1;\n\n  rep(i, n - k + 1) {\n\n    if (nonok[i]) {\n\n      continue;\n    }\n\n    bool zen = 1;\n\n    for (int j = i + 1; j <= min(i + k - 1, n - k); j++) {\n\n      if (seg1.query(j - 1, i + k) == seg1[j - 1] && seg2.query(j, j + k) == seg2[j + k - 1]) {\n\n        nonok[j] = 1;\n\n      } else {\n\n        break;\n      }\n    }\n\n    for (int j = i + 1; j < i + k; j++) {\n\n      if (seg1[j - 1] > seg1[j]) {\n\n        zen = 0;\n\n        break;\n      }\n    }\n\n    if (zen) {\n\n      kan++;\n    }\n  }\n\n  rep(i, n - k + 1) if (nonok[i]) ans--;\n\n  if (kan > 1)\n    ans -= kan - 1;\n\n  cout << ans << endl;\n}\n","fast_code":"  \n\n                           \n\n                                                                        \n\n                                                           \n\n   \n\n\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <cassert>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <cmath>\n\n#include <complex>\n\n#include <ctime>\n\n#include <deque>\n\n#include <fstream>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <iostream>\n\n#include <iterator>\n\n#include <list>\n\n#include <map>\n\n#include <memory>\n\n#include <queue>\n\n#include <random>\n\n#include <set>\n\n#include <stack>\n\n#include <string>\n\n#include <string.h>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <utility>\n\n#include <vector>\n\n\n\n                            \n\n                            \n\n                                      \n\n\n\n\n\n\n\n\n\n         \n\n                             \n\n\n\n#define int long long\n\n\n\n                             \n\n\n\n\n\n#define mod 1000000007ll\n\n                                  \n\n\n\nconstexpr double PI=3.141592653589793238462643383279;\n\n                                     \n\n\n\ntypedef long long ll;\n\n\n\n#ifdef int\n\n#define inf (int)(3e18)\n\n#else\n\n#define inf (int)(5e8)\n\n#endif\n\n\n\n#define intt long long\n\n#define itn long long\n\n#define innt long long\n\n#define P pair<long long,long long>\n\n\n\n#define rep(i,n) for(int i=0;i<n;i++)\n\n#define REP(i,n) for(int i=1;i<=n;i++)\n\n#define rev_rep(i,n) for(int i=n-1;i>=0;i--)\n\n#define REV_REP(i,n) for(int i=n;i>=1;i--)\n\n\n\n#define ALL(v) v.begin(),v.end()\n\n\n\n#define smallpriority_queue(T) priority_queue<T,vector<T>,greater<T>>\n\n\n\n\n\nusing namespace std;\n\n\n\n         \n\n                 \n\ninline int modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y & 1) {\n\n      res *= x;\n\n      res %= m;\n\n    }\n\n    x = x * x % m;\n\n    y /= 2;\n\n  }\n\n  return res;\n\n}\n\n\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n    }\n\n    x = x * x;\n\n    y /= 2;\n\n  }\n\n  return res;\n\n}\n\n                                   \n\n                     \n\n                         \n\n                       \n\n       \n\n                                        \n\n                         \n\n                           \n\n           \n\n       \n\n                  \n\n   \n\nbool prime(int x) {\n\n  if (!x || x == 1) {\n\n    return false;\n\n  }\n\n  if(x == 2){\n\n    return true;\n\n  }\n\n  if(!(x & 1)){\n\n    return false;\n\n  }\n\n  for (int i = 3; i * i <= x; i+=2) {\n\n    if (!(x % i)) {\n\n      return false;\n\n    }\n\n  }\n\n  return true;\n\n}\n\n\n\n\n\n                   \n\ninline int gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n\n  }\n\n  return gcd(y, x % y);\n\n}\n\n\n\n\n\n                \n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n\n  }\n\n  return ans;\n\n}\n\n\n\n                         \n\nint bitketa(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x >>= 1;\n\n    ans++;\n\n  }\n\n  return ans;\n\n}\n\n\n\n             \n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n\n  }\n\n  return ans;\n\n}\n\n\n\ninline int lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x >>= 1;\n\n    }\n\n    else {\n\n      break;\n\n    }\n\n  }\n\n  return ans;\n\n}\n\n\n\n\n\ntemplate <class T, class U>\n\ninline bool chmax(T& lhs, const U& rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return 1;\n\n  }\n\n  return 0;\n\n}\n\ntemplate <class T, class U>\n\ninline bool chmin(T& lhs, const U& rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return 1;\n\n  }\n\n  return 0;\n\n}\n\nvoid Yes(){\n\ncout<<\"Yes\"<<endl;\n\n}\n\nvoid No(){\n\ncout<<\"No\"<<endl;\n\n}\n\nvoid YES(){\n\ncout<<\"YES\"<<endl;\n\n}\n\nvoid NO(){\n\ncout<<\"NO\"<<endl;\n\n}\n\n\n\n\n\n#define fin(i) scanf(\"%lld\",&i)\n\n#define fout(i) printf(\"%lld\",i)\n\n#define fendl printf(\"\\n\")\n\n\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i; res %= mod;\n\n  }\n\n  return res;\n\n}\n\n\n\nint comb(int x, int y) {\n\n  if (y > x)return 0;\n\n                                                                 \n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n\n}\n\n             \n\n\n\n                                            \n\n                                                                  \n\n                                                                                                                        \n\n\n\n\n\n\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n,ookisa;\n\n  vector<T> node;\n\n  T def;\n\n  function<T(T,T)> operation;\n\n  function<T(T,T)> update;\n\n    \n\npublic:\n\n  SegTree(unsigned int _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    ookisa=n;\n\n    n=1;\n\n    while\n\n        (n < _n) {\n\n      n *= 2;\n\n    }\n\n    node = vector<T>(n * 2, def);\n\n  }\n\n  SegTree(vector<int>& initvec,T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      :  def(_def), operation(_operation), update(_update) {\n\n    ookisa=initvec.size();\n\n    n=1;\n\n    while (n < initvec.size()) {\n\n      n *= 2;\n\n    }\n\n    node = vector<T>(n * 2, def);\n\n    for(int i=n;i<n+initvec.size();i++){\n\n      node[i]=initvec[i-n];\n\n    }\n\n    for(int i=n-1;i>=1;i--){\n\n      node[i]=operation(node[i*2],node[i*2+1]);\n\n    }\n\n        \n\n        \n\n  }\n\n  void change(int i,T x){\n\n    i+=n;\n\n    node[i]=update(node[i],x);\n\n    while (i>=1) {\n\n      i>>=1;\n\n      node[i]=operation(node[i*2],node[i*2+1]);\n\n    }\n\n  }\n\n  T query(int l, int r){\n\n    l+=n;\n\n    r+=n;\n\n    T rx=def,lx=def;\n\n    while(l<r){\n\n      if (l&1) {\n\n        lx=operation(lx,node[l]);\n\n        l++;\n\n      }\n\n      if (r&1) {\n\n        r--;\n\n        rx=operation(node[r],rx);\n\n      }\n\n      l>>=1; r>>=1;\n\n    }\n\n    return operation(lx,rx);\n\n  }\n\n  T operator [] (const int& x){\n\n  return node[x+n];\n\n  }\n\n  void fill(T x) {\n\n  std::fill(ALL(node), x);\n\n  }\n\n  void print() {\n\n    rep(i, ookisa)std::cout << operator[](i) << \" \";\n\n    std::cout << std::endl;\n\n  }\n\n  T queryForALL(){\n\n  return node[1];\n\n  }\n\n};\n\n\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\n\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> ookisa;\n\n    \n\npublic:\n\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    ookisa=vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n\n      ookisa[i]=1;\n\n    }\n\n  }\n\n    \n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n\n    }\n\n    return par[x] = find(par[x]);\n\n  }\n\n    \n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n\n    }\n\n    if (ookisa[x] < ookisa[y]) {\n\n      par[x] = y;\n\n      ookisa[y]+=ookisa[x];\n\n      ookisa[x]=0;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      ookisa[x]+=ookisa[y];\n\n      ookisa[y]=0;\n\n    }\n\n  }\n\n  int size(int i){\n\n    i=find(i);\n\n    return ookisa[i];\n\n  }\n\n  bool same(int x, int y){\n\n  return find(x) == find(y);\n\n  }\n\n    \n\n};\n\n\n\nclass BIT {\n\n  vector<int> data;\n\n  int size=0;\n\npublic:\n\n  BIT(int _size){\n\n    data=vector<int>(_size+1);\n\n    size=_size;\n\n  }\n\n  void add(int i,int x){\n\n    while (i<=size) {\n\n      data[i]+=x;\n\n      i += i & -i;\n\n    }\n\n  }\n\n  int sum(int i){\n\n    assert(i<=size);\n\n    int s=0;\n\n    while(i>0){\n\n      s+=data[i];\n\n      i -= i & -i;\n\n    }\n\n    return s;\n\n  }\n\n  int lower_bound(int x){\n\n    if(x<=0){\n\n      return 0;\n\n    }else{\n\n      int i=0;int r=1;\n\n      while(r<size) r=r<<1;\n\n      for(int len=r;len>0;len=len>>1) {\n\n        if(i+len<size && data[i+len]<x){\n\n          x-=data[i+len];\n\n          i+=len;\n\n        }\n\n      }\n\n      return i+1;\n\n    }\n\n  }\n\n};\n\n\n\n                \n\n\n\nint perm[2000005];\n\nvoid init_perm() {\n\n  perm[0] = 1;\n\n  REP(i, 2000004) {\n\n  perm[i] = perm[i - 1] * i % mod;\n\n  }\n\n}\n\n\n\nint nCk(int x, int y) {\n\n  if (y>x) {\n\n    return 0;\n\n  }\n\n  if (x<0) {\n\n    return 0;\n\n  }\n\n  return perm[x] * modpow(perm[x - y], mod - 2) % mod * modpow(perm[y], mod - 2) % mod;\n\n}\n\n\n\nstruct Dot {\n\n  double x;\n\n  double y;\n\n  Dot(double _x=0.0, double _y=0.0){\n\n    x=_x;\n\n    y=_y;\n\n  }\n\n};\n\n\n\nstruct Dot_i {\n\n  int x;\n\n  int y;\n\n  Dot_i(int _x=0, int _y=0){\n\n    x=_x;\n\n    y=_y;\n\n  }\n\n};\n\n\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n\n}\n\n\n\ndouble kyori(Dot f, Dot s) {\n\n  double ans = 0;\n\n  double t = fabs(f.x - s.x);\n\n  double y = fabs(f.y - s.y);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n\n}\n\n\n\ninline string stringmax(string& x,string& y){\n\n  if (x.size()>y.size()) {\n\n    return x;\n\n  }\n\n  if (x.size()<y.size()) {\n\n    return y;\n\n  }\n\n  rep(i,x.size()){\n\n    if (x[i]>y[i]) {\n\n      return x;\n\n    }\n\n    if (x[i]<y[i]) {\n\n      return y;\n\n    }\n\n  }\n\n  return x;\n\n}\n\n\n\nvector<int>  RollingHash(string &s, string& t){\n\n  vector<int> ans;\n\n  if(s.size()<t.size())return ans;\n\n  __int128 h=0,hamod=0,ki=0,kim=0,hikaku=0,one=0;\n\n  one=1;\n\n  ki=1000000007ll;\n\n  hamod=(one<<61)-1;\n\n  kim=1;\n\n  rep(i,t.size()){\n\n    hikaku*=ki;\n\n    h*=ki;\n\n    kim*=ki;\n\n    hikaku+=t[i];\n\n    h+=s[i];\n\n    hikaku%=hamod;\n\n    h%=hamod;\n\n    kim%=hamod;\n\n  }\n\n  rep(i,(int)s.size()-(int)t.size()){\n\n    if (h==hikaku) {\n\n      ans.emplace_back(i);\n\n    }\n\n    h*=ki;\n\n    h%=hamod;\n\n    h+=s[i+(int)t.size()];\n\n    h%=hamod;\n\n    h+=hamod;\n\n    h-=s[i]*kim%hamod;\n\n    h%=hamod;\n\n  }\n\n  if(h==hikaku)ans.emplace_back((int)s.size()-(int)t.size());\n\n  return ans;\n\n}\n\n\n\nint myhash(string &t){\n\n  __int128 hamod=0,ki=0,ans=0,one=0;\n\n  one=1;\n\n  ki=1000000007ll;\n\n  hamod=(one<<61)-1;\n\n  rep(i,t.size()){\n\n    ans*=ki;\n\n    ans+=t[i];\n\n    ans%=hamod;\n\n  }\n\n  int ta=ans;\n\n  return ta;\n\n}\n\nstruct edge {\n\n  int to;\n\n  int length;\n\n  edge(int _to, int _length){\n\n    to=_to;\n\n    length=_length;\n\n  }\n\n};\n\nvector<int> djkstra(vector<vector<edge>> &road,int start){\n\n  vector<int> kyo(road.size(),inf);\n\n  smallpriority_queue(P) q;\n\n  q.push({0,start});\n\n  kyo[start]=0;\n\n  while (q.size()) {\n\n    int x=q.top().second;\n\n    itn now=q.top().first;\n\n    q.pop();\n\n    if (kyo[x]<now) {\n\n      continue;\n\n    }\n\n    for(auto&i:road[x]){\n\n      if (kyo[i.to]>now+i.length) {\n\n        kyo[i.to]=now+i.length;\n\n        q.push({kyo[i.to],i.to});\n\n      }\n\n    }\n\n  }\n\n  return kyo;\n\n}\n\n\n\ntemplate <class T>\n\nvoid change_to_unique(vector<T> &v){\n\n  std::sort(ALL(v));\n\n  auto k=unique(ALL(v));\n\n  if(k!=v.end())v.erase(k,v.end());\n\n}\n\n\n\ndouble kodo_dosuu(double r){\n\nreturn 180.0*r/(double)PI;\n\n}\n\n\n\ndouble dosuu_kodo(double r){\n\nreturn r*(double)PI/180.0;\n\n}\n\n\n\ndouble kakudo(Dot a,Dot b1,Dot b2){\n\n  double size1=kyori(a,b1),size2=kyori(a,b2);\n\n  double nai=(b1.x-a.x)*(b2.x-a.x)+(b1.y-a.y)*(b2.y-a.y);\n\n  nai/=size1*size2;\n\n  return kodo_dosuu(acos(nai));\n\n}\n\n\n\nstruct fraction {\n\n  int shi;\n\n  int bo;\n\n  fraction(int bunshi,int bunbo):bo(bunbo),shi(bunshi){\n\n    if(bunbo&&bunshi){\n\n      int g=gcd(bo, shi);\n\n      bo/=g;\n\n      shi/=g;\n\n    }\n\n  };\n\n  explicit inline operator double()const { return (double)shi/(double)bo; }\n\n  explicit inline operator long double()const { return (long double)shi/(long double)bo; }\n\n};\n\nbool operator < (const fraction& b1, const fraction& b2){\n\nreturn b1.shi*b2.bo < b2.shi*b1.bo;\n\n}\n\nbool operator > (const fraction& b1, const fraction& b2){\n\nreturn b1.shi*b2.bo > b2.shi*b1.bo;\n\n}\n\n\n\ntemplate <class T>\n\nvoid vecout(vector<T> &v){\n\n  if (v.size()) {\n\n    cout<<v[0];\n\n  }\n\n  REP(i,(int)v.size()-1){\n\n  cout<<' '<<v[i];\n\n  }\n\n  cout<<endl;\n\n}\n\n\n\n#define endl \"\\n\"                                       \n\n#define Endl \"\\n\"                                       \n\n#define cinn cin\n\n#define printd cout<<fixed<<setprecision(10)\n\n#define rrep(i,f,s) for(int i=f;i<s;i++)\n\n#define RREP(i,f,s) for(int i=f;i<=s;i++)\n\n#define REV_RREP(i,f,s) for(int i=s;i>=f;i--)\n\n#define hen_rep(i,l,step) for(int i=0;i<l;i+=step)\n\n#define HEN_REP(i,l,step) for(int i=1;i<=l;i+=step)\n\n\n\n\n\nint n,ans,k,rui[200004];\n\nvector<int> a;\n\nbool did,f;\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  std::cin.tie(nullptr);\n\n  cin>>n>>k;\n\n    \n\n  rep(i,n){\n\n    int k;\n\n    cin>>k;\n\n    a.emplace_back(k);\n\n    if(i)if(a[i-1]>a[i])rui[i]++;\n\n  }\n\n  rep(i,n){\n\n  rui[i+1]+=rui[i];\n\n  }\n\n  SegTree<int> small(a,inf, R_MIN, NORMAL_UPDATE);\n\n  SegTree<int> big(a, -inf, R_MAX, NORMAL_UPDATE);\n\n  ans=1;\n\n  f=!(rui[k-1]-rui[0]);\n\n  rep(i,n-k){\n\n    if (!(rui[i+k]-rui[i+1])) {\n\n      did=1;\n\n      continue;\n\n    }\n\n    if(a[i]==small.query(i, i+k+1)&&a[i+k]==big.query(i, i+k+1)){\n\n      continue;\n\n    }\n\n    ans++;\n\n  }\n\n  if(!f&&did)ans++;\n\n  cout<<ans<<endl;\n\n}\n\n \n\n\n\n\n\n\n\n\n"}
{"fast_code_id":"850b2d7c00ff0a6a650ea632babde15f0bd0d6fb8d2be867133798d981365c67","fast_id":"30676776f3dd3437ca105fdcffd2e67c71e28094a3ac506a81971b6fa005dc2b","fast_time":0.0191975555,"language":"cpp","measured_fast_code_id":"30676776f3dd3437ca105fdcffd2e67c71e28094a3ac506a81971b6fa005dc2b","measured_slow_code_id":"325e6ad59d5da2580c4a009c9ce28504fa45df5ba50a5a34ac40b88a721a9fff","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1676","problem_id":"p02807","slow_code_id":"6c309fabf42f75b3e6cb12360ec053e1cfa2748b48bc08bc42af86d13d3f54bd","slow_id":"325e6ad59d5da2580c4a009c9ce28504fa45df5ba50a5a34ac40b88a721a9fff","slow_time":0.469302693,"speedup":24.445960997482203,"stratum":"8+","sampling_key":"1fa06831ca754a6efcdf2dc50051ab7df805240532b11cfe25d1c599980b8557","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define SIZE 300005\n\n#define MOD 1000000007LL\n\n#define EPS 1e-10\n\n#define INF 2147483647\n\n#define LLINF 9223372036854775807LL\n\n#define REP(i, n) for (int i = 0; i < n; i++)\n\n#define FOR(i, a, b) for (int i = a; i <= b; i++)\n\n#define DOWN(i, b, a) for (int i = b; i >= a; i--)\n\n#define SET(a, c) memset(a, c, sizeof a)\n\n#define BIT(i, j) ((i) >> (j)) & 1\n\n#define ALL(o) (o).begin(), (o).end()\n\n#define ERASE(o) (o).erase(unique((o).begin(), (o).end()), (o).end())\n\n#define SQ(x) ((x) * (x))\n\nusing namespace std;\n\ntypedef int_fast64_t ll;\n\ntypedef pair<ll, ll> Pll;\n\ntypedef pair<int, int> Pii;\n\ntypedef pair<double, double> Pdd;\n\ntypedef complex<double> dcomplex;\n\ntemplate <typename T> inline void priv(vector<T> a) {\n  REP(i, a.size()) { cerr << a[i] << ((i == a.size() - 1) ? \"\\n\" : \" \"); }\n}\n\ninline void fastio() {\n  cin.tie(nullptr);\n  cout.tie(nullptr);\n  ios::sync_with_stdio(false);\n  cout << fixed << setprecision(15);\n}\n\nll gcd(ll a, ll b) {\n  ll c = max(a, b);\n  ll d = min(a, b);\n  return c == 0 || d == 0 ? c : gcd(c % d, d);\n}\n\nll lcm(ll a, ll b) { return a == 0 || b == 0 ? 0 : a * b / gcd(a, b); }\n\ntemplate <int N, typename T, T M>\n\nstruct ModFact {\n\n  T inv[N + 1];\n\n  T fact[N + 1];\n\n  T ifact[N + 1];\n\n  constexpr ModFact() : fact(), ifact() {\n\n    fact[0] = 1;\n\n    for (int i = 0; i < N; i++)\n\n      fact[i + 1] = (fact[i] * (i + 1)) % M;\n\n    ifact[N] = power(fact[N], M - 2);\n\n    for (int i = N - 1; i >= 0; i--)\n\n      ifact[i] = (ifact[i + 1] * (i + 1)) % M;\n\n    inv[0] = 0;\n\n    for (int i = 0; i < N; i++)\n\n      inv[i + 1] = (fact[i] * ifact[i + 1]) % M;\n  }\n\n  constexpr T power(T a, T b) {\n\n    T r = 1;\n\n    while (b > 0) {\n\n      if ((b & 1) != 0)\n        r = (r * a) % M;\n\n      a = (a * a) % M;\n\n      b >>= 1;\n    }\n\n    return r;\n  }\n\n  constexpr T comb(T n, T r) { return (((fact[n] * ifact[r]) % M) * ifact[n - r]) % M; }\n};\n\nModFact<100000, ll, MOD> fact;\n\nll N;\n\nint main() {\n\n  fastio();\n\n  ll N, ans = 0, prev, now;\n\n  cin >> N;\n\n  cin >> prev;\n\n  ll a = 0;\n\n  REP(i, N - 1) {\n\n    cin >> now;\n\n    a = (a + fact.inv[i + 1]) % MOD;\n\n    ans = (ans + a * (now - prev)) % MOD;\n\n    prev = now;\n  }\n\n  cout << (ans * fact.fact[N - 1]) % MOD << \"\\n\";\n\n  return 0;\n}\n","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int mod = 1e9 + 7;\n\nll modpow(ll A, ll B) {\n\n  ll kotae = 1;\n\n  while (B > 0) {\n\n    if (B & 1)\n      kotae = kotae * A % mod;\n\n    A = A * A % mod;\n\n    B >>= 1;\n  }\n\n  return kotae;\n}\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int n = 100000;\n\nclass nanika {\n\n  int fac[100001], inv[100001];\n\npublic:\n  constexpr nanika() : fac(), inv() {\n\n    fac[0] = 1;\n\n    rep1(i, n) fac[i] = ll(fac[i - 1]) * i % mod;\n\n    ll ifac = 1;\n\n    ll A = fac[n];\n\n    ll B = mod - 2;\n\n    while (B > 0) {\n\n      if (B & 1)\n        ifac = ifac * A % mod;\n\n      A = A * A % mod;\n\n      B >>= 1;\n    }\n\n    for (int i = n; i > 0; i--) {\n\n      inv[i] = fac[i - 1] * ifac % mod;\n\n      ifac = ifac * i % mod;\n    }\n  }\n\n  int operator[](int n) { return inv[n]; }\n\n  int getfac(int n) { return fac[n]; }\n\n} test;\n\nint main() {\n\n  int N = getint();\n\n  int kei = 0;\n\n  ll kotae = 0;\n\n  int mae = getint();\n\n  rep1(i, N - 1) {\n\n    int tugi = getint();\n\n    ll X = tugi - mae;\n\n    kei = (kei + test[i]) % mod;\n\n    kotae += kei * X % mod;\n\n    mae = tugi;\n  }\n\n  printf(\"%lld\\n\", kotae % mod * test.getfac(N - 1) % mod);\n\n  Would you please return 0;\n}\n"}
{"fast_code_id":"64939e5a3b29fe968f5e03e2aa45910664457f43af81f6b3dab5cf69f3589ff5","fast_id":"adb06a42b3aa164ae6cec8c9f6faa4c2e4660b1123792af912a29f1e034cedfe","fast_time":0.02275128,"language":"cpp","measured_fast_code_id":"adb06a42b3aa164ae6cec8c9f6faa4c2e4660b1123792af912a29f1e034cedfe","measured_slow_code_id":"8cdd26ae93c1bae547848a8656fc61103d50b8258622676ede6c99387b098add","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16831","problem_id":"p03574","slow_code_id":"c7b9f0133a215f4e9d7efe8c2f36e7a85dc7e66ea4f1fcea14420d9b9f560799","slow_id":"8cdd26ae93c1bae547848a8656fc61103d50b8258622676ede6c99387b098add","slow_time":0.1043209971,"speedup":4.58528034906168,"stratum":"4-8","sampling_key":"1ceb927ccf2117c6f278fb3f7703c915bf8dcbea9709a850519e0df3453bcf4e","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#define re register\n\n#define maxn 51\n\nusing namespace std;\n\nconst int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};\n\nconst int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};\n\nint n, m;\n\nchar map[maxn][maxn];\n\ninline int work(int x, int y)\n\n{\n\n  int tot = 0;\n\n  for (re int i = 0; i < 8; i++)\n\n  {\n\n    int xx = dx[i] + x;\n\n    int yy = dy[i] + y;\n\n    if (map[xx][yy] == '#')\n      tot++;\n  }\n\n  return tot;\n}\n\nint main()\n\n{\n\n  cin >> n >> m;\n\n  for (re int i = 1; i <= n; i++)\n\n    for (re int j = 1; j <= m; j++)\n\n      cin >> map[i][j];\n\n  for (re int i = 1; i <= n; i++)\n\n  {\n\n    for (re int j = 1; j <= m; j++)\n\n    {\n\n      if (map[i][j] == '#')\n        cout << \"#\";\n\n      if (map[i][j] == '.')\n        cout << work(i, j);\n    }\n\n    putchar(char(10));\n  }\n}","fast_code":"\n\n#include <cstdio>\n\nint main() {\n\n  char a[128][128] = {0};\n\n  int n, l, N, L;\n\n  const int K = 127;\n\n  scanf(\"%d%d\", &n, &l);\n\n  for (N = 0; N < n; ++N) {\n\n    for (L = 0; L < l; ++L) {\n\n      scanf(\"%c\", &a[N][L]);\n\n      if (a[N][L] == '\\n')\n\n        scanf(\"%c\", &a[N][L]);\n    }\n  }\n\n  for (N = 0; N < n; ++N) {\n\n    for (L = 0; L < l; ++L) {\n\n      if (a[N][L] != '#') {\n\n        a[N][L] =\n\n            (a[(N + 1) % 128][(L + 1) % 128] == '#') +\n\n            (a[(N + 1) % 128][(L + 0) % 128] == '#') +\n\n            (a[(N + 1) % 128][(L + K) % 128] == '#') +\n\n            (a[(N + 0) % 128][(L + K) % 128] == '#') +\n\n            (a[(N + K) % 128][(L + K) % 128] == '#') +\n\n            (a[(N + K) % 128][(L + 0) % 128] == '#') +\n\n            (a[(N + K) % 128][(L + 1) % 128] == '#') +\n\n            (a[(N + 0) % 128][(L + 1) % 128] == '#') +\n\n            48;\n      }\n    }\n  }\n\n  for (N = 0; N < n; ++N) {\n\n    for (L = 0; L < l; ++L) {\n\n      printf(\"%c\", a[N][L]);\n    }\n\n    printf(\"\\n\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"09ca49af45c6dd66094e67ed676b857713bd560f0105794e13dc6ae388e64390","fast_id":"d536c7b2289946eef5399ccb50beec8f657b45c690b7b4dab4c8e75f508b6221","fast_time":0.0042703181,"language":"cpp","measured_fast_code_id":"d536c7b2289946eef5399ccb50beec8f657b45c690b7b4dab4c8e75f508b6221","measured_slow_code_id":"eca7513ab26705f9123a987b850ae55e430b66cc62c7e940014e685c98100de9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16878","problem_id":"p02710","slow_code_id":"cbf9e9062239e4d46ee07183e142a4d2f08f8871d58942349cacdfa6a328931c","slow_id":"eca7513ab26705f9123a987b850ae55e430b66cc62c7e940014e685c98100de9","slow_time":0.2029364426,"speedup":47.52255870587252,"stratum":"8+","sampling_key":"067e5061f1d4862aba9fc68c9233133efb88c2c412a1720ee70fc169fa9eb8d3","slow_code":"#pragma GCC optimize(\"Ofast\")\n\n#pragma GCC target(\"avx2\")\n\n#include <bits/stdc++.h>\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint K[200001];\n\nint zentai, N;\n\nll kotae[200001];\n\nint C[200001];\n\nvector<int> E[200001];\n\nvoid dfs(int p, int mae) {\n\n  int k = K[C[p]] + zentai;\n\n  int k0 = k;\n\n  for (int to : E[p]) {\n\n    if (mae != to) {\n\n      dfs(to, p);\n\n      int sa = K[C[p]] + zentai - k;\n\n      kotae[C[p]] -= ll(sa) * (sa + 1) / 2;\n\n      k += sa;\n    }\n  }\n\n  zentai++;\n\n  K[C[p]] = k0 - zentai;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> N;\n\n  rep1(i, N) cin >> C[i];\n\n  rep(i, N - 1) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    E[a].pb(b);\n\n    E[b].pb(a);\n  }\n\n  dfs(1, -1);\n\n  ll n = ll(N) * (N + 1) / 2;\n\n  rep1(i, N) {\n\n    int sa = K[i] + zentai;\n\n    co(n + kotae[i] - ll(sa) * (sa + 1) / 2);\n  }\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"Ofast\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint K[200001];\n\nint zentai, N;\n\nll kotae[200001];\n\nint C[200001];\n\nint E[400001], ne[400001], he[200001];\n\nconst int CM = 1 << 17, CL = 12;\n\nchar cn[CM + CL], *ci = cn + CM + CL, *owa = cn + CM, ct;\n\nconst ll ma0 = 1157442765409226768;\n\nconst ll ma1 = 1085102592571150095;\n\nconst ll ma2 = 71777214294589695;\n\nconst ll ma3 = 281470681808895;\n\nconst ll ma4 = 4294967295;\n\ninline int getint() {\n\n  if (ci - owa > 0) {\n\n    memcpy(cn, owa, CL);\n\n    ci -= CM;\n\n    fread(cn + CL, 1, CM, stdin);\n  }\n\n  ll tmp = *(ll *)ci;\n\n  int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);\n\n  tmp = tmp << dig & ma1;\n\n  tmp = tmp * 10 + (tmp >> 8) & ma2;\n\n  tmp = tmp * 100 + (tmp >> 16) & ma3;\n\n  tmp = tmp * 10000 + (tmp >> 32) & ma4;\n\n  ci += 72 - dig >> 3;\n\n  return tmp;\n}\n\nchar dn[2400000], *di = dn;\n\ninline void putint(ll X) {\n\n  if (X == 0) {\n\n    *di++ = '0';\n\n    *di++ = '\\n';\n\n    return;\n  }\n\n  int keta = 0;\n\n  char C[15];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nvoid dfs(int p, int mae) {\n\n  int k = K[C[p]] + zentai;\n\n  int k0 = k;\n\n  for (int to = he[p]; to; to = ne[to]) {\n\n    if (mae != E[to]) {\n\n      dfs(E[to], p);\n\n      int sa = K[C[p]] + zentai - k;\n\n      kotae[C[p]] -= ll(sa) * (sa + 1) >> 1;\n\n      k += sa;\n    }\n  }\n\n  zentai++;\n\n  K[C[p]] = k0 - zentai;\n}\n\nint main() {\n\n  N = getint();\n\n  rep1(i, N) C[i] = getint();\n\n  int k = 1;\n\n  rep(i, N - 1) {\n\n    int a = getint(), b = getint();\n\n    E[k] = b;\n\n    ne[k] = he[a];\n\n    he[a] = k++;\n\n    E[k] = a;\n\n    ne[k] = he[b];\n\n    he[b] = k++;\n  }\n\n  dfs(1, -1);\n\n  ll n = ll(N) * (N + 1) / 2;\n\n  rep1(i, N) {\n\n    int sa = K[i] + zentai;\n\n    putint(n + kotae[i] - (ll(sa) * (sa + 1) >> 1));\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"e090f95f14c56c75564365fbc4f367f264d3bede3923fab01f02224714180ce4","fast_id":"fda1c86aa9b1a6b7837489540bcb4601ebf0fb8627b2d9984ddff0a9c7c38fa7","fast_time":0.0557908897,"language":"cpp","measured_fast_code_id":"fda1c86aa9b1a6b7837489540bcb4601ebf0fb8627b2d9984ddff0a9c7c38fa7","measured_slow_code_id":"c08eba432192329ac9f6a622a19fe3a68765c667fa366def386cab5999a6c235","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16906","problem_id":"p03583","slow_code_id":"3e45a876b2d78c5d3efc045323871b8d7b9276e8cb1ec3b244b19f2b0e5efdd4","slow_id":"c08eba432192329ac9f6a622a19fe3a68765c667fa366def386cab5999a6c235","slow_time":0.1260255954,"speedup":2.2588920176334812,"stratum":"2-4","sampling_key":"786f5e7769f3e1fa423f4ff0eeabae2fe4b93cbe24595f91a03f116fe2ef4374","slow_code":"\n\n#ifndef _GLIBCXX_NO_ASSERT\n\n#include <cassert>\n\n#endif\n\n#include <cctype>\n\n#include <cerrno>\n\n#include <cfloat>\n\n#include <ciso646>\n\n#include <climits>\n\n#include <clocale>\n\n#include <cmath>\n\n#include <csetjmp>\n\n#include <csignal>\n\n#include <cstdarg>\n\n#include <cstddef>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <ctime>\n\n#if __cplusplus >= 201103L\n\n#include <ccomplex>\n\n#include <cfenv>\n\n#include <cinttypes>\n\n#include <cstdbool>\n\n#include <cstdint>\n\n#include <ctgmath>\n\n#include <cwchar>\n\n#include <cwctype>\n\n#endif\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <complex>\n\n#include <deque>\n\n#include <exception>\n\n#include <fstream>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <ios>\n\n#include <iosfwd>\n\n#include <iostream>\n\n#include <istream>\n\n#include <iterator>\n\n#include <limits>\n\n#include <list>\n\n#include <locale>\n\n#include <map>\n\n#include <memory>\n\n#include <new>\n\n#include <numeric>\n\n#include <ostream>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <stdexcept>\n\n#include <streambuf>\n\n#include <string>\n\n#include <typeinfo>\n\n#include <utility>\n\n#include <valarray>\n\n#include <vector>\n\n#if __cplusplus >= 201103L\n\n#include <array>\n\n#include <atomic>\n\n#include <chrono>\n\n#include <condition_variable>\n\n#include <forward_list>\n\n#include <future>\n\n#include <initializer_list>\n\n#include <mutex>\n\n#include <random>\n\n#include <ratio>\n\n#include <regex>\n\n#include <scoped_allocator>\n\n#include <system_error>\n\n#include <thread>\n\n#include <tuple>\n\n#include <typeindex>\n\n#include <type_traits>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#endif\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\n#define intt long long\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    } else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nvector<int> v[100004];\n\nbool went[100004];\n\nvoid dfs(int x) {\n\n  went[x] = true;\n\n  for (int i = 0; i < (int)v[x].size(); i++) {\n\n    if (!went[v[x][i]]) {\n\n      dfs(v[x][i]);\n    }\n  }\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\nint lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    } else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\nint fukugen(vector<int> l) {\n\n  int ans = 0;\n\n  for (int i = 0; i < l.size(); i++) {\n\n    ans *= 10;\n\n    ans += l[i];\n  }\n\n  return ans;\n}\n\nint n, a, ans, big, h, k, w;\n\nsigned main() {\n\n  cin >> n;\n\n  for (int i = 2; i <= 3500; i++) {\n\n    for (int j = 2; j <= 3500; j++) {\n\n      int lc = lcm(i, lcm(j, n));\n\n      int bunshi = (lc / j) + (lc / i);\n\n      lc = lcm(lc, n);\n\n      int kari = (lc / n) * 4;\n\n      if (kari <= bunshi) {\n\n        continue;\n      }\n\n      if (!(lc % (kari - bunshi))) {\n\n        h = i;\n        k = j;\n        w = lc / (kari - bunshi);\n\n        cout << h << ' ' << k << ' ' << w << endl;\n\n        return 0;\n      }\n    }\n  }\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)((1e9) + 7)\n\n#define intt long long\n\n#define itn long long\n\n#define P pair<int, int>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, n) for (int i = 1; i <= n; i++)\n\n#define ALL(v) v.begin(), v.end()\n\nusing namespace std;\n\ninline int modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % m;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ninline int gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\ninline int lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\ntemplate <class T, class U>\n\ninline bool chmax(T &lhs, const U &rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\ntemplate <class T, class U>\n\ninline bool chmin(T &lhs, const U &rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\nvoid Yes() { cout << \"Yes\" << endl; }\n\nvoid No() { cout << \"No\" << endl; }\n\nvoid YES() { cout << \"YES\" << endl; }\n\nvoid NO() { cout << \"NO\" << endl; }\n\n#define fin(i) scanf(\"%lld\", &i)\n\n#define fout(i) printf(\"%lld\", i)\n\n#define fendl printf(\"\\n\")\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\n#define vecin(v)                                                                                   \\\n  for (int i = 0; i < v.size(); i++)                                                               \\\n    scanf(\"%lld\", &v[i]);\n\n#define vecout(v)                                                                                  \\\n  {                                                                                                \\\n    for (int i = 0; i < v.size(); i++)                                                             \\\n      printf(\"%lld\\n\", v[i]);                                                                      \\\n  }\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\n  vector<int> ookisa;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    ookisa = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n\n      ookisa[i] = 1;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n      ookisa[y] += ookisa[x];\n\n      ookisa[x] = 0;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      ookisa[x] += ookisa[y];\n\n      ookisa[y] = 0;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  int size(int i) {\n\n    i = find(i);\n\n    return ookisa[i];\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\n#define endl \"\\n\"\n\nint n, ans, bunshi, bunbo;\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  std::cin.tie(nullptr);\n\n  cin >> n;\n\n  REP(i, 3500) {\n\n    REP(j, 3500) {\n\n      int l = lcm(n, i);\n\n      l = lcm(l, j);\n\n      if (4 * l / n > l / i + l / j) {\n\n        if (!(l % (4 * l / n - (l / i + l / j)))) {\n\n          cout << i << ' ' << j << ' ' << (l / (4 * l / n - (l / i + l / j))) << endl;\n\n          return 0;\n        }\n      }\n    }\n  }\n}\n"}
{"fast_code_id":"b759deab05d7aa803cb48a8f2bc955128cea5048614b7b430f3b748c3c03d878","fast_id":"e767cd096e377943a21b32c9191bed86ff40e7e33cdf84a3cea3cce382619aa0","fast_time":0.1055852895,"language":"cpp","measured_fast_code_id":"e767cd096e377943a21b32c9191bed86ff40e7e33cdf84a3cea3cce382619aa0","measured_slow_code_id":"a4c8113858fee2ae9d6484e54afff6e7d648402536f8e0b4340482bf00b79844","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16913","problem_id":"p02851","slow_code_id":"86197ecac74db2933a4855d780eaa36b9dba22d283290743652934469d14c9ed","slow_id":"a4c8113858fee2ae9d6484e54afff6e7d648402536f8e0b4340482bf00b79844","slow_time":0.6809593079,"speedup":6.449376718335371,"stratum":"4-8","sampling_key":"0f39e8f665dfacf43e2c5aa4d62a7b1303ef5bbdf36c578d4bde232c8ac12865","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <vector>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <iomanip>\n\n#include <cctype>\n\n#include <queue>\n\n#include <map>\n\n#include <stack>\n\n#include <string>\n\n#include <cstring>\n\n#include <set>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<int> vi;\n\ntypedef pair<int, int> pii;\n\ntypedef vector<pii> vpi;\n\n#define mp make_pair\n\n#define pb push_back\n\nint a[200200], n, s[200200];\n\nint k;\n\nmap<int, int> m;\n\nvi b[200200];\n\nint main() {\n\n  scanf(\"%d%d\", &n, &k);\n\n  s[0] = 0;\n\n  int cnt = 1;\n\n  m.clear();\n\n  m[0] = 1;\n\n  b[1].pb(0);\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%d\", &a[i]);\n\n    a[i]--;\n\n    a[i] %= k;\n\n    s[i] = (s[i - 1] + a[i]) % k;\n\n    if (m.find(s[i]) == m.end())\n      m[s[i]] = ++cnt;\n\n    b[m[s[i]]].pb(i);\n  }\n\n  ll ans = 0;\n\n  for (map<int, int>::iterator it = m.begin(); it != m.end(); it++) {\n\n    int p = it->second;\n\n    int sz = b[p].size();\n\n    if (sz == 1)\n      continue;\n\n    int i = 0, j = 1;\n\n    while (j < sz) {\n\n      if (b[p][j] - b[p][i] >= k)\n        i++;\n\n      else {\n\n        ans += (ll)j - i;\n\n        j++;\n      }\n    }\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <queue>\n\n#include <map>\n\n#include <set>\n\n#include <sstream>\n\n#define INF 0x3f3f3f3f\n\n#define DOF 0x7f7f7f7f\n\n#define mem(a, b) memset(a, b, sizeof(a))\n\n#define IO                                                                                         \\\n  ios::sync_with_stdio(false);                                                                     \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0);\n\ntypedef long long ll;\n\nusing namespace std;\n\nconst int maxn = 2e5 + 10;\n\nll a[maxn], sum[maxn];\n\nmap<unsigned int, ll> num;\n\nll ans;\n\nint main()\n\n{\n\n  int n, k;\n  cin >> n >> k;\n\n  for (int i = 1; i <= n; ++i) {\n\n    cin >> a[i];\n\n    sum[i] = sum[i - 1] + a[i];\n  }\n\n  for (int i = 0; i <= n; ++i) {\n\n    if (i >= k) {\n\n      num[((sum[i - k] - (i - k)) % k)]--;\n    }\n\n    if (num[(sum[i] - i) % k]) {\n\n      ans += num[(sum[i] - i) % k];\n    }\n\n    num[(sum[i] - i) % k]++;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"04c6b18c039c727d0a8c7e329abd9159f1d0b6491dd392e30aa383c4e9ecee49","fast_id":"667533be4738568d75263a4acb7f1be20508a487a8130c26eef95ed68fba98b3","fast_time":0.0943327339,"language":"cpp","measured_fast_code_id":"667533be4738568d75263a4acb7f1be20508a487a8130c26eef95ed68fba98b3","measured_slow_code_id":"1fd6eecfcfed2d2af14b4fe674ca2bf2d70b24a3faabf120b1477a5eea714216","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_16997","problem_id":"p03564","slow_code_id":"b5e1d84bc7760552f711d084297cc2e918a93777a49b0e00cbf0c0f89992ecc6","slow_id":"1fd6eecfcfed2d2af14b4fe674ca2bf2d70b24a3faabf120b1477a5eea714216","slow_time":0.4141423912,"speedup":4.390229924206618,"stratum":"4-8","sampling_key":"5da750e7d3decedc56471554be708d7ec511b45185681efbd8bc3043529b24dd","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint d[11][1 << 20];\n\nmain()\n\n{\n\n  int n, k;\n  cin >> n >> k;\n\n  d[0][1] = 1;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    for (int j = 0; j < 1e5; j++)\n\n    {\n\n      if (d[i][j])\n\n      {\n\n        d[i + 1][j + k] = d[i + 1][2 * j] = 1;\n      }\n    }\n  }\n\n  for (int i = 0; i < 1e5; i++)\n\n  {\n\n    if (d[n][i])\n\n    {\n\n      cout << i << endl;\n\n      return 0;\n    }\n  }\n}\n","fast_code":"#include <iostream>\n\nusing namespace std;\n\nlong n, k, ans = 1;\n\nmain()\n\n{\n\n  cin >> n >> k;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    ans += ans < k ? ans : k;\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"c2892edc0373d0233075045988b3f1c6cda67d33c5d307fa1b2bdc59c5354fdf","fast_id":"3997f6378c7ab5be08abe57e3f0b5c893f119f5cccac5dc4a8814e03e9d44134","fast_time":0.0166113865,"language":"cpp","measured_fast_code_id":"3997f6378c7ab5be08abe57e3f0b5c893f119f5cccac5dc4a8814e03e9d44134","measured_slow_code_id":"5cb35351e33cce3bfc380b81b9201d9423632cbd26310cedc5a83e50c944e444","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17106","problem_id":"p03812","slow_code_id":"7102566ab37d11b363a87ac9f8bf0cc8d18525ba524edfa18bca4bf4c591b8de","slow_id":"5cb35351e33cce3bfc380b81b9201d9423632cbd26310cedc5a83e50c944e444","slow_time":0.3203517303,"speedup":19.285068726803754,"stratum":"8+","sampling_key":"1dcc07d52a1a873180ad7b9c071fa63d978eada68543c18a608a6bccdf6bcb7e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define fi first\n\n#define se second\n\n#define pb push_back\n\n#define mp make_pair\n\ntypedef pair<long long, long long> ii;\n\nvector<ii> vec;\n\nlong long a[100005], n, dp[100005];\n\nvector<int> graph[100005];\n\nint main() {\n\n  cin.tie(0), ios::sync_with_stdio(0);\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++) {\n\n    cin >> a[i];\n\n    vec.pb(mp(a[i], i));\n  }\n\n  for (int i = 1; i <= n - 1; i++) {\n\n    int u, v;\n\n    cin >> u >> v;\n\n    graph[u].pb(v);\n\n    graph[v].pb(u);\n  }\n\n  sort(vec.begin(), vec.end());\n\n  for (int i = 0; i < vec.size(); i++) {\n\n    if (dp[vec[i].se] == 0) {\n\n      for (int j = 0; j < graph[vec[i].se].size(); j++) {\n\n        int v = graph[vec[i].se][j];\n\n        if (a[v] > a[vec[i].se])\n\n          dp[v] = 1;\n      }\n    }\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    if (dp[i])\n\n      cout << i << \" \";\n  }\n}\n","fast_code":"#include <cstdio>\n\ntypedef long long ll;\n\ninline int rd() {\n\n  int x = 0, p = 1;\n\n  char a = getchar();\n\n  while ((a < 48 || a > 57) && a != '-')\n    a = getchar();\n\n  if (a == '-')\n    p = -p, a = getchar();\n\n  while (a > 47 && a < 58)\n    x = (x << 1) + (x << 3) + (a & 15), a = getchar();\n\n  return x * p;\n}\n\nconst int N = 3002;\n\nstruct Edge {\n\n  int to, next;\n\n} edge[N << 1];\n\nint head[N], cnt;\n\nint n, a[N], f[N];\n\ninline void add(int f, int t) {\n\n  edge[++cnt].next = head[f];\n\n  edge[cnt].to = t;\n\n  head[f] = cnt;\n}\n\ninline void dp(int u, int ft) {\n\n  f[u] = 0;\n\n  for (int i = head[u]; i; i = edge[i].next) {\n\n    int v = edge[i].to;\n\n    if (v == ft)\n      continue;\n\n    dp(v, u);\n\n    if (f[v] == 0 && a[u] > a[v])\n      f[u] = 1;\n  }\n}\n\nint main() {\n\n  n = rd();\n\n  for (int i = 1; i <= n; i++)\n    a[i] = rd();\n\n  for (int i = 1; i < n; i++) {\n\n    int u = rd(), v = rd();\n\n    add(u, v), add(v, u);\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    dp(i, 0);\n\n    if (f[i])\n      printf(\"%d \", i);\n  }\n\n  puts(\"\");\n\n  return 0;\n}"}
{"fast_code_id":"5c8a36f34fdca5d11f3e320c2178d2d05d78215cef5bb089c13d6652cca71fd0","fast_id":"1a3dbd2666e42775d27a5c52b993b96a9a62df17c37a15cb5fa2849de6015763","fast_time":0.0432542104,"language":"cpp","measured_fast_code_id":"1a3dbd2666e42775d27a5c52b993b96a9a62df17c37a15cb5fa2849de6015763","measured_slow_code_id":"434dbf19f7a97e03ae8ce9e9b736d616bc56f3b84e1082d32a95954cfebc15e9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17113","problem_id":"p02931","slow_code_id":"79f526956bb860dab7e8a00160b07e4de6e5fd8da3a316b6afc5adb438c4a17d","slow_id":"434dbf19f7a97e03ae8ce9e9b736d616bc56f3b84e1082d32a95954cfebc15e9","slow_time":0.1277276892,"speedup":2.9529538978707146,"stratum":"2-4","sampling_key":"158281e54c4fa199c42f17edf2214a70432b3a1f79eeed56a80af2c7047578e9","slow_code":"                                                      \n\n#ifndef Union_find_hpp\n\n#define Union_find_hpp\n\n\n\n#include <cassert>\n\n#include <cstddef>\n\n#include <vector>\n\n\n\nclass union_find\n\n{\n\n  std::vector<int> link;\n\n\n\npublic:\n\n  explicit union_find(const size_t n) : link(n, -1) {}\n\n\n\n  size_t find(size_t x)\n\n  {\n\n    assert(x < size());\n\n    while(link[x] >= 0)\n\n    {\n\n      if(link[link[x]] >= 0) link[x] = link[link[x]];\n\n      x = link[x];\n\n    }\n\n    return x;\n\n  }\n\n\n\n  size_t size() const { return link.size(); }\n\n\n\n  size_t size(const size_t x)\n\n  {\n\n    assert(x < size());\n\n    return -link[find(x)];\n\n  }\n\n\n\n  bool same(const size_t x, const size_t y)\n\n  {\n\n    assert(x < size() && y < size());\n\n    return find(x) == find(y);\n\n  }\n\n\n\n  bool unite(size_t x, size_t y)\n\n  {\n\n    assert(x < size() && y < size());\n\n    x = find(x), y = find(y);\n\n    if(x == y) return false;\n\n    if(link[x] > link[y]) std::swap(x, y);\n\n    link[x] += link[y];\n\n    link[y] = x;\n\n    return true;\n\n  }\n\n};                    \n\n\n\n#endif\n\n\n\n#include <iostream>\n\n#include <tuple>\n\n#include <vector>\n\n\n\nusing namespace std;\n\n\n\nint main(int argc, char *argv[])\n\n{\n\n  std::ios::sync_with_stdio(false), std::cin.tie(nullptr);\n\n\n\n  int n,h,w; cin>>n>>h>>w;\n\n  vector<vector<pair<int,int>>> cards(100000);\n\n  for(int i=n,r,c,a; i--; )\n\n  {\n\n    cin>>r>>c>>a; --r,--c;\n\n    cards[a].emplace_back(r,c+h);\n\n  }\n\n  union_find uf(h+w);\n\n  long long ans{};\n\n  vector<bool> ext(h+w);\n\n  for(int i=100000; i; --i)\n\n  {\n\n    for(auto&& e:cards[i])\n\n    {\n\n      int r,c; tie(r,c)=e;\n\n      int fr=uf.find(r),fc=uf.find(c);\n\n      if(fr!=fc)\n\n      {\n\n        if(ext[fr] and ext[fc]) continue;\n\n        bool extor=ext[fr]||ext[fc];\n\n        uf.unite(fr,fc);\n\n        ext[uf.find(fr)]=extor;\n\n        ans+=i;\n\n      }\n\n      else if(!ext[fr])\n\n      {\n\n        ext[fr]=true;\n\n        ans+=i;\n\n      }\n\n    }\n\n  }\n\n  cout << ans << \"\\n\";\n\n}\n","fast_code":"                                                      \n\n#ifndef Union_find_hpp\n\n#define Union_find_hpp\n\n\n\n#include <cassert>\n\n#include <cstddef>\n\n#include <vector>\n\n\n\nclass union_find\n\n{\n\n  std::vector<int> link;\n\n\n\npublic:\n\n  explicit union_find(const size_t n) : link(n, -1) {}\n\n\n\n  size_t find(size_t x)\n\n  {\n\n    assert(x < size());\n\n    return link[x] < 0 ? x : (link[x] = find(link[x]));\n\n  }\n\n\n\n  size_t size() const { return link.size(); }\n\n\n\n  size_t size(const size_t x)\n\n  {\n\n    assert(x < size());\n\n    return -link[find(x)];\n\n  }\n\n\n\n  bool same(const size_t x, const size_t y)\n\n  {\n\n    assert(x < size() && y < size());\n\n    return find(x) == find(y);\n\n  }\n\n\n\n  size_t unite(size_t x, size_t y)\n\n  {\n\n    assert(x < size() && y < size());\n\n    if((x = find(x)) != (y = find(y)))\n\n    {\n\n      if(link[x] > link[y]) std::swap(x, y);\n\n      link[x] += link[y];\n\n      link[y] = x;\n\n    }\n\n    return x;\n\n  }\n\n};                    \n\n\n\n#endif                  \n\n\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <tuple>\n\n\n\nusing namespace std;\n\n\n\nint main(int argc, char *argv[])\n\n{\n\n  std::ios::sync_with_stdio(false), std::cin.tie(nullptr);\n\n\n\n  int n,h,w; cin>>n>>h>>w;\n\n  vector<tuple<int,int,int>> cards(n);\n\n  for(auto &e : cards)\n\n  {\n\n    int r,c,a; cin>>r>>c>>a;\n\n    --r,--c; c+=h;\n\n    e=tie(a,r,c);\n\n  }\n\n  sort(cards.rbegin(),cards.rend());\n\n  union_find uf(h+w);\n\n  long long ans{};\n\n  bool ext[2<<17]={};\n\n  for(auto &e : cards)\n\n  {\n\n    int a,r,c; tie(a,r,c)=e;\n\n    r=uf.find(r),c=uf.find(c);\n\n    if(r!=c)\n\n    {\n\n      if(ext[r] and ext[c]) continue;\n\n      ext[uf.unite(r,c)]=ext[r]||ext[c];\n\n      ans+=a;\n\n    }\n\n    else if(!ext[r])\n\n    {\n\n      ext[r]=true;\n\n      ans+=a;\n\n    }\n\n  }\n\n  cout << ans << \"\\n\";\n\n}\n"}
{"fast_code_id":"030982c20e819e2d253f8c392cf6c5688ce1b2060b3273ba9bf8e6d1fd50d993","fast_id":"b21c8512f6ecf6035025cc1324a5549fd93b216f49c8982fb5a44b6ab764cc10","fast_time":0.075192816,"language":"cpp","measured_fast_code_id":"b21c8512f6ecf6035025cc1324a5549fd93b216f49c8982fb5a44b6ab764cc10","measured_slow_code_id":"d25def7eb538e0e2aa51cd31d1b6077b7b91d9d2f86369387f2ecda8561414d5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17121","problem_id":"p02980","slow_code_id":"3f22c7b0040c89a737f39a0d870ee2878a283d128acb3d2b046c4a36112ef400","slow_id":"d25def7eb538e0e2aa51cd31d1b6077b7b91d9d2f86369387f2ecda8561414d5","slow_time":0.2877039866,"speedup":3.8262164114188786,"stratum":"2-4","sampling_key":"15bc4f8c39c7a220c69df5dae7cd78c54eca0044c3ac4b75c7ff994a8d9b5faa","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cmath>\n\nusing namespace std;\n\nconst int maxn = 5e5 + 1000;\n\ntypedef long long ll;\n\nint n, m;\n\nconst int mod = 998244353;\n\nint fr[maxn], ans;\n\ninline int ksm(int num, int t) {\n\n  int res = 1;\n\n  for (; t; t >>= 1, num = 1ll * num * num % mod) {\n\n    if (t & 1)\n      res = 1ll * res * num % mod;\n  }\n\n  return res;\n}\n\ninline int c(int m, int n) {\n\n  return 1ll * fr[n] * ksm((1ll * fr[m] * fr[n - m]) % mod, mod - 2) % mod;\n}\n\nint main() {\n\n  ios::sync_with_stdio(0);\n\n  cin >> n >> m;\n\n  fr[0] = fr[1] = 1;\n\n  for (int i = 2; i < maxn; i++)\n    fr[i] = 1ll * fr[i - 1] * i % mod;\n\n  for (int i = 0; i <= min(n, m); i++) {\n\n    ans = (ans + 1ll * ksm(-1, i) *\n                     (1ll * c(i, n) * c(i, m) % mod * fr[i] % mod * ksm(m + 1, n - i) % mod *\n                      ksm(n + 1, m - i) % mod) %\n                     mod) %\n          mod;\n  }\n\n  ans = (ans % mod + mod) % mod;\n\n  cout << ans;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define re register int\n\n#define F(x, y, z) for (re x = y; x <= z; x++)\n\n#define FOR(x, y, z) for (re x = y; x >= z; x--)\n\ntypedef long long ll;\n\n#define I inline void\n\n#define IN inline int\n\nconst int Mod = 998244353;\n\nint n, m, ans, fac[505000], inv[505000], sum;\n\nI add(int &x, int y) { (x += y) >= Mod ? x -= Mod : 0; }\n\nIN Plus(int x, int y) {\n  (x += y) >= Mod ? x -= Mod : 0;\n  return x;\n}\n\nIN C(int x, int y) { return (ll)fac[x] * inv[y] % Mod * inv[x - y] % Mod; }\n\nIN A(int x, int y) { return (ll)fac[x] * inv[x - y] % Mod; }\n\nIN Pow(int x, int y = Mod - 2) {\n\n  re res = 1;\n\n  while (y) {\n\n    if (y & 1)\n      res = (ll)res * x % Mod;\n\n    x = (ll)x * x % Mod;\n\n    y >>= 1;\n  }\n\n  return res;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n  cin.tie(0);\n\n  cin >> n >> m;\n  if (n >= m)\n    swap(n, m);\n\n  fac[0] = 1;\n  F(i, 1, m) fac[i] = (ll)fac[i - 1] * i % Mod;\n\n  inv[m] = Pow(fac[m]);\n  FOR(i, m - 1, 0) inv[i] = (ll)inv[i + 1] * (i + 1) % Mod;\n\n  sum = Pow(n + 1, m - n);\n\n  FOR(k, n, 0) {\n\n    if (k & 1)\n      add(ans, Mod - (ll)C(n, k) * A(m, k) % Mod * sum % Mod);\n\n    else\n      add(ans, (ll)C(n, k) * A(m, k) % Mod * sum % Mod);\n\n    sum = (ll)sum * (n + 1) % Mod * (m + 1) % Mod;\n  }\n\n  cout << ans;\n\n  return 0;\n}\n"}
{"fast_code_id":"3b6e70db5f48edd0d5c5a3bab2e458f597eedf9dd480b7cf23b427e0c6bcd075","fast_id":"12cd8983e9c47b4766726e04a758beed617f96a5906e38847126d99f538b578d","fast_time":0.0631174064,"language":"cpp","measured_fast_code_id":"12cd8983e9c47b4766726e04a758beed617f96a5906e38847126d99f538b578d","measured_slow_code_id":"6fad6827854907beaa7ce416da6cb55a7b85ab53e1f4b28ffa5c8bdbc2aef02f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17142","problem_id":"p03244","slow_code_id":"8f05fe114220e34d0b370a1378e7304e1268847ad7717e357894e1252e37e808","slow_id":"6fad6827854907beaa7ce416da6cb55a7b85ab53e1f4b28ffa5c8bdbc2aef02f","slow_time":0.1462085934,"speedup":2.31645439410831,"stratum":"2-4","sampling_key":"dff7565ea4c3b1874bc158804cdff12c152327cdff31a1002e41365ad2fa03cc","slow_code":"#include <bits/stdc++.h>\n\n#define reg register\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int MN = 1e5 + 5;\n\nint n, a[MN], c[MN][2];\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (reg int i = 1; i <= n; i++)\n    scanf(\"%d\", a + i);\n\n  for (reg int i = 1; i <= n; i++)\n    c[a[i]][i & 1]++;\n\n  reg int mx1 = 0, smx1 = 0, mx2 = 0, smx2 = 0;\n\n  for (reg int i = 1; i <= MN - 5; i++) {\n\n    if (c[mx1][1] < c[i][1])\n      smx1 = mx1, mx1 = i;\n\n    else if (c[smx1][1] < c[i][1])\n      smx1 = i;\n\n    if (c[mx2][0] < c[i][0])\n      smx2 = mx2, mx2 = i;\n\n    else if (c[smx2][0] < c[i][0])\n      smx2 = i;\n  }\n\n  reg int ans;\n\n  if (mx1 != mx2)\n    ans = n - c[mx1][1] - c[mx2][0];\n\n  else\n    ans = min(n - c[mx1][1] - c[smx2][0], n - c[smx1][1] - c[mx2][0]);\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nint Min(int a, int b) { return a < b ? a : b; }\n\nint Max(int a, int b) { return a > b ? a : b; }\n\ninline int read()\n\n{\n\n  int x = 0, f = 1;\n  char c = getchar();\n\n  while (c < '0' || c > '9') {\n    if (c == '-')\n      f = -1;\n    c = getchar();\n  }\n\n  while (c >= '0' && c <= '9') {\n    x = (x << 3) + (x << 1) + c - '0';\n    c = getchar();\n  }\n\n  return x * f;\n}\n\nint n, v[100005], num[100005], ans, m1, m2, M1, M2, b1, b2, B1, B2;\n\nint main()\n\n{\n\n  n = read();\n\n  for (int i = 1; i <= n; i++)\n    v[i] = read();\n\n  for (int i = 1; i <= n; i += 2)\n    num[v[i]]++;\n\n  for (int i = 1; i <= 100000; i++)\n\n  {\n\n    if (num[i] >= m2)\n\n    {\n\n      if (num[i] >= m1)\n\n      {\n\n        m2 = m1;\n        b2 = b1;\n\n        m1 = num[i];\n        b1 = i;\n\n      }\n\n      else {\n        m2 = num[i];\n        b2 = i;\n      }\n    }\n  }\n\n  memset(num, 0, sizeof num);\n\n  for (int i = 2; i <= n; i += 2)\n    num[v[i]]++;\n\n  for (int i = 1; i <= 100000; i++)\n\n  {\n\n    if (num[i] >= M2)\n\n    {\n\n      if (num[i] >= M1)\n\n      {\n\n        M2 = M1;\n        B2 = B1;\n\n        M1 = num[i];\n        B1 = i;\n\n      }\n\n      else {\n        M2 = num[i];\n        B2 = i;\n      }\n    }\n  }\n\n  if (b1 != B1)\n    printf(\"%d\", n - M1 - m1);\n\n  else\n\n  {\n\n    if (M2 > 0 && m2 > 0)\n      return 0 * printf(\"%d\", n - Max(m1 + M2, m2 + M1));\n\n    if (M2 > 0)\n      return 0 * printf(\"%d\", n - m1 - M2);\n\n    if (m2 > 0)\n      return 0 * printf(\"%d\", n - m2 - M1);\n\n    printf(\"%d\", n >> 1);\n  }\n}\n"}
{"fast_code_id":"420c19e672a55af214f32e812a05b0a3a569239bbdf221f7f2b7d579f3984d97","fast_id":"6c61bf5a9f832166921eba41b95dccd7b35595386eda7d7019b4461ed46aad29","fast_time":0.0044807254,"language":"cpp","measured_fast_code_id":"6c61bf5a9f832166921eba41b95dccd7b35595386eda7d7019b4461ed46aad29","measured_slow_code_id":"38aad8204754565b518de226a68b6ad894f3b35682b99bc5fbb5488bd916b178","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17162","problem_id":"p03384","slow_code_id":"fbf0b7ec58518150225efb85084e8e5875edc476e0058d0c2830866ce0fc8add","slow_id":"38aad8204754565b518de226a68b6ad894f3b35682b99bc5fbb5488bd916b178","slow_time":0.0829121402,"speedup":18.50417796189876,"stratum":"8+","sampling_key":"146590772246dcdcd108bd09a2619d9e23f33c1c685dbd36b0e24e14f0a2d10f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define pb push_back\n\n#define eb emplace_back\n\n#define ll long long\n\n#define pii pair<int, int>\n\n#define fr first\n\n#define sc second\n\n#define mk make_pair\n\n#define sz(s) (int)s.size()\n\n#define all(s) s.begin(), s.end()\n\n#define ok puts(\"ok\");\n\n#define whatis(x) cerr << #x << \" = \" << x << endl;\n\n#define pause system(\"pause\");\n\n#define random rand() ^ (rand() << 5)\n\nconst int N = (int)1e5 + 7;\n\nconst int inf = (int)1e9 + 7;\n\nint n, u, v;\n\nvector<int> gr[N];\n\nint h[N], p[N], is[N], v1;\n\nint cnt = 1;\n\nvector<int> ans, vec[2];\n\nvoid dfs(int v, int pr = 0) {\n\n  p[v] = pr;\n\n  for (int to : gr[v]) {\n\n    if (to == pr)\n      continue;\n\n    h[to] = h[v] + 1;\n\n    dfs(to, v);\n\n    is[v] = is[to];\n  }\n}\n\nvoid no() {\n\n  puts(\"-1\");\n\n  exit(0);\n}\n\nvoid dfs1(int v, int pr = 0) {\n\n  if (is[v]) {\n\n    h[v] = 0;\n\n    int c = 1;\n\n    for (int to : gr[v]) {\n\n      if (to == pr || is[to])\n        continue;\n\n      ans.pb(cnt + c);\n\n      c++;\n    }\n\n    ans.pb(cnt);\n\n    cnt += c;\n\n  } else if (h[v] > 1) {\n\n    no();\n  }\n\n  for (int to : gr[v]) {\n\n    if (to == pr)\n      continue;\n\n    h[to] = h[v] + 1;\n\n    dfs1(to, v);\n  }\n}\n\nmain() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++) {\n\n    scanf(\"%d %d\", &u, &v);\n\n    gr[u].pb(v);\n\n    gr[v].pb(u);\n  }\n\n  dfs(1);\n\n  int mx = 0;\n\n  int v = -1;\n\n  int v2;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (h[i] > mx) {\n\n      mx = h[i];\n\n      v = i;\n    }\n  }\n\n  h[v] = 0;\n\n  dfs(v);\n\n  v2 = v;\n\n  v = -1;\n\n  mx = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (h[i] > mx) {\n\n      mx = h[i];\n\n      v = i;\n    }\n  }\n\n  int v1 = v;\n\n  while (v != 0) {\n\n    is[v] = 1;\n\n    v = p[v];\n  }\n\n  dfs1(v1);\n\n  vec[0] = ans;\n\n  cnt = 1;\n\n  ans.clear();\n\n  dfs1(v2);\n\n  vec[1] = ans;\n\n  int fl = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (vec[0][i - 1] == vec[1][i - 1])\n      continue;\n\n    if (vec[0][i - 1] > vec[1][i - 1]) {\n\n      fl = 1;\n    }\n\n    break;\n  }\n\n  for (int to : vec[fl]) {\n\n    printf(\"%d \", to);\n  }\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\n#define N 205000\n\nint head[N], cnt, dep[N], l, r, in[N], st[N], n, a, b, ct, st2[N], fg, as1[N],\n    as2[N], is[N];\n\nstruct edge {\n  int t, next;\n} ed[N * 2];\n\nvoid adde(int f, int t) {\n  ed[++cnt] = (edge){t, head[f]};\n  head[f] = cnt;\n  ed[++cnt] = (edge){f, head[t]};\n  head[t] = cnt;\n  in[f]++, in[t]++;\n}\n\nvoid dfs(int u, int fa) {\n  dep[u] = dep[fa] + 1;\n  for (int i = head[u]; i; i = ed[i].next)\n    if (ed[i].t != fa)\n      dfs(ed[i].t, u);\n}\n\nvoid dfs2(int u, int t, int fa) {\n  if (!fg)\n    st[++ct] = u;\n  if (u == t)\n    fg = 1;\n  for (int i = head[u]; i; i = ed[i].next)\n    if (ed[i].t != fa)\n      dfs2(ed[i].t, t, u);\n  if (!fg)\n    ct--;\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n    scanf(\"%d%d\", &a, &b), adde(a, b);\n\n  dfs(1, 0);\n  int mx = 0, vl;\n  for (int i = 1; i <= n; i++)\n    if (dep[i] > mx)\n      mx = dep[i], vl = i;\n\n  dfs(vl, 0);\n  mx = 0;\n  int vl2 = 0;\n  for (int i = 1; i <= n; i++)\n    if (dep[i] > mx)\n      mx = dep[i], vl2 = i;\n\n  dfs2(vl, vl2, 0);\n\n  for (int i = 1; i <= ct; i++)\n    is[st[i]] = 1;\n\n  for (int i = 1; i <= n; i++)\n    if (!is[i] && in[i] > 1) {\n      printf(\"-1\\n\");\n      return 0;\n    }\n\n  for (int i = 1; i <= ct; i++)\n    st2[i] = in[st[i]] - 2 + (in[st[i]] == 1);\n\n  int lb = 0;\n\n  for (int i = 1; i <= ct; i++)\n\n  {\n\n    for (int j = 1; j <= st2[i]; j++)\n      as1[lb + j] = lb + j + 1;\n\n    as1[lb + st2[i] + 1] = lb + 1;\n\n    lb += st2[i] + 1;\n  }\n\n  lb = 0;\n\n  for (int i = ct; i >= 1; i--)\n\n  {\n\n    for (int j = 1; j <= st2[i]; j++)\n      as2[lb + j] = lb + j + 1;\n\n    as2[lb + st2[i] + 1] = lb + 1;\n\n    lb += st2[i] + 1;\n  }\n\n  int fg2 = 0;\n\n  for (int i = 1; i <= n; i++)\n    if (as1[i] < as2[i]) {\n      fg2 = 1;\n      break;\n    } else if (as2[i] < as1[i])\n      break;\n\n  if (!fg2)\n    for (int i = 1; i <= n; i++)\n      as1[i] = as2[i];\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%d \", as1[i]);\n}"}
{"fast_code_id":"9cac21487a4b11067170d57b7e85dc87dcf65ea756a465130c4560f2c72a8ef1","fast_id":"bbafb48d180d743ae646b0750737683abdc65ef5d93186c924a3d3735f895817","fast_time":0.0263058304,"language":"cpp","measured_fast_code_id":"bbafb48d180d743ae646b0750737683abdc65ef5d93186c924a3d3735f895817","measured_slow_code_id":"bc3975992d48e461245cf9c8abbc63f2a66096e4d21a52623e0c1eb318ab3f98","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17184","problem_id":"p03004","slow_code_id":"0bc78d1e4c1ef10cb4c27ced4e9e3c4825e0d8951ad675860e7d0b60115b1a53","slow_id":"bc3975992d48e461245cf9c8abbc63f2a66096e4d21a52623e0c1eb318ab3f98","slow_time":0.5247002318,"speedup":19.946157327920734,"stratum":"8+","sampling_key":"89d35721774062a6a29c3e7066914fde3418e491cb725649733938e1d87f6d70","slow_code":"#include <bits/stdc++.h>\n\n#include <math.h>\n\nusing namespace std;\n\n#pragma GCC optimize(\"Ofast,unroll-loops,no-stack-protector\")\n\ntypedef long double ld;\n\ntypedef long long ll;\n\nstruct Point {\n\n  ll x, y, x1 = 0, y1 = 0;\n\n  Point() {}\n\n  Point(ll _x, ll _y, char c) {\n\n    x = _x;\n\n    y = _y;\n\n    if (c == 'U') {\n\n      y1 = 1;\n\n    } else if (c == 'D') {\n\n      y1 = -1;\n\n    } else if (c == 'R') {\n\n      x1 = 1;\n\n    } else {\n\n      x1 = -1;\n    }\n  }\n};\n\nvector<Point> vc;\n\nld dist(ld t) {\n\n  ld max_x = -1e9, max_y = -1e9, min_x = 1e9, min_y = 1e9;\n\n  for (auto p : vc) {\n\n    ld xx = p.x + p.x1 * t;\n\n    ld yy = p.y + p.y1 * t;\n\n    max_x = max(max_x, xx);\n\n    max_y = max(max_y, yy);\n\n    min_x = min(min_x, xx);\n\n    min_y = min(min_y, yy);\n  }\n\n  return (max_x - min_x) * (max_y - min_y);\n}\n\nint main() {\n\n#ifdef LOCAL\n\n  freopen(\"in\", \"r\", stdin);\n\n  freopen(\"out\", \"w\", stdout);\n\n#endif\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  cout.precision(20);\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 0; i < n; ++i) {\n\n    ll x, y;\n\n    char c;\n\n    cin >> x >> y >> c;\n\n    vc.push_back(Point(x, y, c));\n  }\n\n  ld l = 0, r = 1e11;\n\n  for (int i = 0; i < 700; ++i) {\n\n    ld m1 = (r - l) / 3 + l;\n\n    ld m2 = r - (r - l) / 3;\n\n    ld a1 = dist(m1);\n\n    ld a2 = dist(m2);\n\n    if (a1 > a2) {\n\n      l = m1;\n\n    } else {\n\n      r = m2;\n    }\n  }\n\n  cout << fixed << min(dist(l), dist(r));\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\n#define N 100000000\n\n#define M 100005\n\nint main()\n\n{\n\n  int n;\n\n  double x[M], y[M];\n\n  char c[M];\n\n  double minS = -1, S1, S2, l = 0, r = N;\n\n  double minl1 = N, maxr1 = -N, maxu1 = -N, mind1 = N, xx1, yy1, move1 = 0;\n\n  double minl2 = N, maxr2 = -N, maxu2 = -N, mind2 = N, xx2, yy2, move2 = N;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%lf%lf %c\", &x[i], &y[i], &c[i]);\n\n  for (int k = 0; k <= 10000 && (move2 - move1 > 0.00000000001); k++)\n\n  {\n\n    minl1 = N, maxr1 = -N, maxu1 = -N, mind1 = N;\n\n    minl2 = N, maxr2 = -N, maxu2 = -N, mind2 = N;\n\n    move1 = (r / 3 + 2 * l / 3), move2 = (2 * r / 3 + l / 3);\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      xx1 = xx2 = x[i];\n\n      yy1 = yy2 = y[i];\n\n      if (c[i] == 'U')\n\n      {\n\n        yy1 += move1;\n\n        yy2 += move2;\n      }\n\n      if (c[i] == 'D')\n\n      {\n\n        yy1 -= move1;\n\n        yy2 -= move2;\n      }\n\n      if (c[i] == 'L')\n\n      {\n\n        xx1 -= move1;\n\n        xx2 -= move2;\n      }\n\n      if (c[i] == 'R')\n\n      {\n\n        xx1 += move1;\n\n        xx2 += move2;\n      }\n\n      if (xx1 < minl1)\n        minl1 = xx1;\n\n      if (xx1 > maxr1)\n        maxr1 = xx1;\n\n      if (yy1 < mind1)\n        mind1 = yy1;\n\n      if (yy1 > maxu1)\n        maxu1 = yy1;\n\n      if (xx2 < minl2)\n        minl2 = xx2;\n\n      if (xx2 > maxr2)\n        maxr2 = xx2;\n\n      if (yy2 < mind2)\n        mind2 = yy2;\n\n      if (yy2 > maxu2)\n        maxu2 = yy2;\n    }\n\n    S1 = (maxr1 - minl1) * (maxu1 - mind1);\n\n    S2 = (maxr2 - minl2) * (maxu2 - mind2);\n\n    if (S1 < minS || minS == -1)\n      minS = S1;\n\n    if (S2 < minS || minS == -1)\n      minS = S2;\n\n    if (S1 > S2)\n      l = move1;\n\n    else\n      r = move2;\n  }\n\n  printf(\"%.10f\\n\", minS);\n}"}
{"fast_code_id":"ab72b93bd11f5501f136f3b40e610086f97195295ad930f1cc1d0e1647ca695e","fast_id":"d80f136a75389096191181f6246b8bcd10cc72ca79902a10e17a4bf5020e0869","fast_time":0.1065689762,"language":"cpp","measured_fast_code_id":"d80f136a75389096191181f6246b8bcd10cc72ca79902a10e17a4bf5020e0869","measured_slow_code_id":"41d08ffdcb46c738cf08a7206f83f29c4bc6a603d0c7778895f00b27b72042a4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17219","problem_id":"p01629","slow_code_id":"2e0592cd780e1d31a13cf406d6127d667589d8e11965a61a49c7a6a36011ee2b","slow_id":"41d08ffdcb46c738cf08a7206f83f29c4bc6a603d0c7778895f00b27b72042a4","slow_time":0.2502894697,"speedup":2.3486147528552497,"stratum":"2-4","sampling_key":"5ff0da89ed670c49f2407fc3db4d66a505ca6a6a350dfc72d04e68fa01b68863","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)\n\n#define all(x) (x).begin(), (x).end()\n\nconst int N = 55;\n\nconst int INF = 19191919;\n\nint n, d;\n\nint p[N][N];\n\nint dp[N][N][N];\n\nint par[N][N][N];\n\nint ok[N][N][N] = {};\n\nint main() {\n\n  cin >> n >> d;\n\n  rep(i, n) rep(j, d) cin >> p[i][j];\n\n  rep(i, N) rep(j, N) rep(k, N)\n\n  {\n\n    dp[i][j][k] = INF;\n\n    par[i][j][k] = INF;\n  }\n\n  rep(i, n) dp[0][0][i] = 0;\n\n  rep(i, d) rep(j, N - 1) rep(k, n)\n\n  {\n\n    rep(l, n)\n\n    {\n\n      int nj = j + (k != l);\n\n      if (dp[i + 1][nj][l] > dp[i][j][k] + p[l][i])\n\n      {\n\n        dp[i + 1][nj][l] = dp[i][j][k] + p[l][i];\n\n        par[i + 1][nj][l] = k;\n\n      }\n\n      else if (dp[i + 1][nj][l] == dp[i][j][k] + p[l][i])\n\n      {\n\n        par[i + 1][nj][l] = min(par[i + 1][nj][l], k);\n      }\n    }\n  }\n\n  int P = INF;\n\n  int M = INF;\n\n  rep(i, N) rep(j, n) P = min(P, dp[d][i][j]);\n\n  rep(i, N) rep(j, n) if (dp[d][i][j] == P) M = min(M, i);\n\n  rep(i, n) if (dp[d][M][i] == P) ok[d][M][i] = 1;\n\n  for (int i = d; i >= 1; --i)\n    rep(j, N) rep(k, n)\n\n    {\n\n      if (!ok[i][j][k])\n        continue;\n\n      rep(l, n)\n\n      {\n\n        int bj = j - (k != l);\n\n        if (bj < 0)\n          continue;\n\n        if (dp[i][j][k] - p[k][i - 1] == dp[i - 1][bj][l])\n          ok[i - 1][bj][l] = 1;\n      }\n    }\n\n  vector<int> ans(d, INF);\n\n  rep(i, n)\n\n  {\n\n    if (!ok[0][0][i])\n      continue;\n\n    vector<int> t(d);\n\n    int now = i;\n\n    int ct = 0;\n\n    rep(j, d)\n\n    {\n\n      rep(k, n)\n\n      {\n\n        int nct = ct + (now != k);\n\n        if (ok[j + 1][nct][k])\n\n        {\n\n          t[j] = k;\n\n          ct = nct;\n\n          now = k;\n\n          break;\n        }\n      }\n    }\n\n    ans = min(ans, t);\n  }\n\n  cout << P << \" \" << M << endl;\n\n  rep(i, d) cout << ans[i] + 1 << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n\n#define _repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n\n#define _rep(i, n) _repl(i, 0, n)\n\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n\n#define mp(a, b) make_pair((a), (b))\n\n#define pb(a) push_back((a))\n\n#define all(x) (x).begin(), (x).end()\n\n#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))\n\n#define fi first\n\n#define se second\n\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\n\nvoid _dbg(string) { cout << endl; }\n\ntemplate <class H, class... T> void _dbg(string s, H h, T... t) {\n  int l = s.find(',');\n  cout << s.substr(0, l) << \" = \" << h << \", \";\n  _dbg(s.substr(l + 1), t...);\n}\n\ntemplate <class T, class U> ostream &operator<<(ostream &o, const pair<T, U> &p) {\n  o << \"(\" << p.fi << \",\" << p.se << \")\";\n  return o;\n}\n\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &v) {\n  o << \"[\";\n  for (T t : v) {\n    o << t << \",\";\n  }\n  o << \"]\";\n  return o;\n}\n\n#define INF 1120000000\n\n#define long long long\n\nint dp[55][55];\n\nint pr[55][55];\n\nint main() {\n\n  int n, d;\n\n  cin >> n >> d;\n\n  vector<vector<int>> p(n, vector<int>(d));\n\n  rep(i, n) rep(j, d) cin >> p[i][j];\n\n  fill(dp[0], dp[d + 1], INF);\n\n  rep(i, n) dp[d][i] = 0;\n\n  int tot = 0;\n\n  for (int i = d; i > 0; i--) {\n\n    int mn = INF;\n\n    rep(j, n) mn = min(mn, p[j][i - 1]);\n\n    tot += mn;\n\n    rep(j, n) if (dp[i][j] < INF) {\n\n      rep(k, n) if (p[k][i - 1] == mn) {\n\n        int nv = dp[i][j] + (j != k);\n\n        if (dp[i - 1][k] > nv) {\n\n          dp[i - 1][k] = nv;\n\n          pr[i - 1][k] = j;\n        }\n      }\n    }\n  }\n\n  int av = INF, ai = -1;\n\n  rep(i, n) if (dp[0][i] < av) {\n    av = dp[0][i];\n    ai = i;\n  }\n\n  vector<int> ans;\n\n  rep(i, d) {\n\n    ans.pb(ai + 1);\n\n    ai = pr[i][ai];\n  }\n\n  cout << tot << \" \" << av << \"\\n\";\n\n  rep(i, d) cout << ans[i] << \"\\n\";\n\n  return 0;\n}"}
{"fast_code_id":"c92af574cb27666481173032e6a771cb4ef49a65976491d78b0d32b3e8027349","fast_id":"194089507c6c78f733979cbfd4151d495efc7fed2b0bca71941b804afc55fff3","fast_time":0.0146152338,"language":"cpp","measured_fast_code_id":"194089507c6c78f733979cbfd4151d495efc7fed2b0bca71941b804afc55fff3","measured_slow_code_id":"b9f2bb4da440f8d8d8e9ba6e59f31e38b3680d57f0529b5bd61cabb4528b3ead","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17221","problem_id":"p02798","slow_code_id":"990d56c3b5970649ca3b094d79a54587a06d8775b0b2861cdd07dc3e75f45eba","slow_id":"b9f2bb4da440f8d8d8e9ba6e59f31e38b3680d57f0529b5bd61cabb4528b3ead","slow_time":0.0773256024,"speedup":5.290753706587985,"stratum":"4-8","sampling_key":"2bdb1b26dfe22d14fbc6b95b7ecf0814977ba606dce3aec5cccb36a4e767b758","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint N;\n\nint A[18], B[18];\n\nunsigned char dp[1 << 18][36];\n\nint keisan(int b, bool n, int k) {\n\n  if (dp[b][k] != 255)\n    return dp[b][k];\n\n  if (b == (1 << N) - 1)\n    return 0;\n\n  int saishou = 254;\n\n  int num2 = 0;\n\n  rep(i, N) {\n\n    if (!(b >> i & 1)) {\n\n      if ((n + i) & 1) {\n\n        if (B[i] >= k) {\n\n          chmin(saishou, keisan(b + (1 << i), !n, B[i]) + num2);\n        }\n\n      }\n\n      else {\n\n        if (A[i] >= k) {\n\n          chmin(saishou, keisan(b + (1 << i), !n, A[i]) + num2);\n        }\n      }\n\n      num2++;\n    }\n  }\n\n  return dp[b][k] = saishou;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> N;\n\n  rep(i, N) cin >> A[i];\n\n  rep(i, N) cin >> B[i];\n\n  pair<int, int> kari[36];\n\n  rep(i, N) kari[i] = mp(A[i], i);\n\n  rep(i, N) kari[i + N] = mp(B[i], i + N);\n\n  sort(kari, kari + N * 2);\n\n  int k = 0;\n\n  int mae = kari[0].first;\n\n  rep(i, N * 2) {\n\n    if (mae != kari[i].first)\n      k++;\n\n    mae = kari[i].first;\n\n    if (kari[i].second < N)\n      A[kari[i].second] = k;\n\n    else\n      B[kari[i].second - N] = k;\n  }\n\n  rep(i, 1 << N) rep(j, k + 1) dp[i][j] = 255;\n\n  int kotae = keisan(0, 0, 0);\n\n  if (kotae == 254)\n    co(-1);\n\n  else\n    co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint N;\n\nint A[18], B[18];\n\nunsigned char dp[36][1 << 18];\n\nint keisan(int b, bool n, int k) {\n\n  if (dp[k][b] != 255)\n    return dp[k][b];\n\n  if (b == (1 << N) - 1)\n    return 0;\n\n  int saishou = 254;\n\n  int num2 = 0;\n\n  rep(i, N) {\n\n    if (!(b >> i & 1)) {\n\n      if (A[i] < k && B[i] < k)\n        return dp[k][b] = 254;\n\n      if ((n + i) & 1) {\n\n        if (B[i] >= k) {\n\n          chmin(saishou, keisan(b + (1 << i), !n, B[i]) + num2);\n        }\n\n      }\n\n      else {\n\n        if (A[i] >= k) {\n\n          chmin(saishou, keisan(b + (1 << i), !n, A[i]) + num2);\n        }\n      }\n\n      num2++;\n    }\n  }\n\n  return dp[k][b] = saishou;\n}\n\nint main() {\n\n  scanf(\"%d\", &N);\n\n  rep(i, N) scanf(\"%d\", A + i);\n\n  rep(i, N) scanf(\"%d\", B + i);\n\n  pair<int, int> kari[36];\n\n  rep(i, N) kari[i] = mp(A[i], i);\n\n  rep(i, N) kari[i + N] = mp(B[i], i + N);\n\n  sort(kari, kari + N * 2);\n\n  int k = 0;\n\n  int mae = kari[0].first;\n\n  rep(i, N * 2) {\n\n    if (mae != kari[i].first)\n      k++;\n\n    mae = kari[i].first;\n\n    if (kari[i].second < N)\n      A[kari[i].second] = k;\n\n    else\n      B[kari[i].second - N] = k;\n  }\n\n  if (k == 0) {\n\n    printf(\"0\\n\");\n\n    return 0;\n  }\n\n  rep(i, k + 1) rep(j, 1 << N) dp[i][j] = 255;\n\n  int kotae = keisan(0, 0, 0);\n\n  if (kotae == 254)\n    printf(\"-1\\n\");\n\n  else\n    printf(\"%d\\n\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"a551c26aca80256f55508c594764177596f4e61e279c56d5a4d8328e432148fc","fast_id":"433c1eeb0bb70e478b7a74f61adf7cf6a2838636adb6c6ed2e5a7e3cddfe4b77","fast_time":0.001011274,"language":"cpp","measured_fast_code_id":"433c1eeb0bb70e478b7a74f61adf7cf6a2838636adb6c6ed2e5a7e3cddfe4b77","measured_slow_code_id":"2febc73c29384b3653cb2813f493b00f140d17c82c99a17b1510ab231732bd3b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17234","problem_id":"p03920","slow_code_id":"b942d1b7521d0c0607122393725c0823b04085feca03f900d9ac242a1bc31856","slow_id":"2febc73c29384b3653cb2813f493b00f140d17c82c99a17b1510ab231732bd3b","slow_time":0.0065999002,"speedup":6.526322440802394,"stratum":"4-8","sampling_key":"1eb95141c2c15e89a8f8d322d8989467b26226023e3bd01beea55b42f556f837","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <numeric>\n\n#include <climits>\n\n#include <iterator>\n\n#include <iomanip>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\nusing namespace std;\n\nconst constexpr int INF = 1e9;\n\ntypedef long long ll;\n\ntypedef vector<int> VI;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\nVI g[200010];\n\nint h[100010];\n\nll N;\n\nint a[200010];\n\nint b[200010];\n\nint c[200010];\n\nll sum[200010];\n\nsigned main(void) {\n\n  cin >> N;\n\n  vector<int> ans;\n\n  int maxn = 1;\n\n  while (maxn * (maxn + 1) / 2 < N)\n    maxn++;\n\n  for (int i = 1; i <= maxn; ++i) {\n\n    if (i != (maxn + 1) * maxn / 2 - N)\n      printf(\"%d\\n\", i);\n  }\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <set>\n\n#include <cmath>\n\n#include <stack>\n\n#include <algorithm>\n\n#include <iomanip>\n\n#include <map>\n\n#include <queue>\n\n#include <functional>\n\n#include <numeric>\n\n#include <chrono>\n\nusing ll = long long;\n\nusing namespace std;\n\nconst ll MOD = 1e9 + 7;\n\n#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))\n\nvector<vector<string>> v(27);\n\nvector<pair<int, int>> vp;\n\nint main(void)\n\n{\n\n  int N;\n\n  cin >> N;\n\n  vector<int> ans;\n\n  int maxn = 1;\n\n  while (maxn * (maxn + 1) / 2 < N)\n\n    maxn++;\n\n  for (int i = 1; i <= maxn; ++i)\n\n  {\n\n    if (i != (maxn + 1) * maxn / 2 - N)\n\n      printf(\"%d\\n\", i);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"7f060e2ec7165af7ff12ae44707bd95a0a5483e86cf9ddf5c9c23370c73e2bc9","fast_id":"c10328acdaeece9f9dc1b5e48061ed08a44bacad83bb038f44c42b2ed0e948a3","fast_time":0.1067850921,"language":"cpp","measured_fast_code_id":"c10328acdaeece9f9dc1b5e48061ed08a44bacad83bb038f44c42b2ed0e948a3","measured_slow_code_id":"6511017f95b41aade4f3c26fb2607fe65c95688789842e36af14fa9dcb82d652","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17238","problem_id":"p00775","slow_code_id":"18db545003bd62873bbbe5543cd30aeebd0477d25ab4ed56a2b186a7fefb0052","slow_id":"6511017f95b41aade4f3c26fb2607fe65c95688789842e36af14fa9dcb82d652","slow_time":0.2793227989,"speedup":2.6157471366735843,"stratum":"2-4","sampling_key":"53d8aa0cce8da528c46a4bee5f386c4966af8fb81d650e3a6babda6fc245fdf1","slow_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef long double ld;\n\ntypedef complex<ld> Point;\n\nconst ld eps = 1e-9, pi = acos(-1.0);\n\n\n\n                   \n\nclass Line {\n\npublic:\n\n  Point a, b;\n\n  Line() : a(Point(0, 0)), b(Point(0, 0)) {}\n\n  Line(Point a, Point b) : a(a), b(b) {}\n\n  Point operator[](const int _num) {\n\n    if (_num == 0)return a;\n\n    else if (_num == 1)return b;\n\n    else assert(false);\n\n  }\n\n};\n\n                           \n\nbool eq(ld a, ld b) {\n\nreturn (abs(a - b) < eps);\n\n}\n\n         \n\nld dot(Point a, Point b) {\n\nreturn real(conj(a) * b);\n\n}\n\n\n\n         \n\nld cross(Point a, Point b) {\n\nreturn imag(conj(a) * b);\n\n}\n\n               \n\nclass Circle {\n\npublic:\n\n  Point p;\n\n  ld r;\n\n  Circle() : p(Point(0, 0)), r(0) {}\n\n  Circle(Point p, ld r) : p(p), r(r) {}\n\n};\n\n                \n\nPoint proj(Line l, Point p) {\n\n  ld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\n  return l.a + t * (l.a - l.b);\n\n}\n\n                           \n\nld dist_lp(Line l, Point p) {\n\nreturn abs(p - proj(l, p));\n\n}\n\n                        \n\nbool isis_sp(Line s, Point p) {\n\nreturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n\n}\n\n                          \n\nvector<Point> is_lc(Circle c, Line l) {\n\n  vector<Point> res;\n\n  ld d = dist_lp(l, c.p);\n\n  if (d < c.r + eps) {\n\n    ld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d);          \n\n    Point nor = (l.a - l.b) / abs(l.a - l.b);\n\n    res.push_back(proj(l, c.p) + len * nor);\n\n    res.push_back(proj(l, c.p) - len * nor);\n\n  }\n\n  return res;\n\n}\n\n                          \n\nvector<Point> is_sc(Circle c, Line l) {\n\n  vector<Point> v = is_lc(c, l), res;\n\n  for (Point p : v)\n\n    if (isis_sp(l, p)) res.push_back(p);\n\n  return res;\n\n}\n\n\n\n\n\nint dx[3] = { 0,1,0 };\n\nint dy[3] = { -1,0,1 };\n\n                                 \n\nvoid kado_mituketu(int x,int y,vector<pair<int, int>>& kado, bool grid[80][80],int dir) {\n\n  if (x >= 61) {\n\n    kado.push_back({ x,y + 1 });\n\n    return;\n\n  }\n\n  for (int i = 2; i >= 0;i--) {\n\n    if (i == 2 && dir == 0)continue;\n\n    if (grid[x + dx[i]][y + dy[i]] == true) {\n\n      if (dir != i) {\n\n        if (i != 0) {\n\n          if (dir != 0) { kado.push_back({ x,y + 1 }); }\n\n          else { kado.push_back({ x + 1,y + 1 }); }\n\n        }\n\n        else {\n\n          if (dir == 2) { kado.push_back({ x,y + 1 }); }\n\n          kado.push_back({ x + 1,y + 1 });\n\n        }\n\n        dir = i;\n\n      }\n\n      kado_mituketu(x + dx[i], y + dy[i], kado, grid, dir);\n\n      return;\n\n    }\n\n  }\n\n  return;\n\n}\n\n\n\nint main() {\n\n  cin.tie(0);ios::sync_with_stdio(false);\n\n  int r, n;\n\n  while (cin >> r >> n, r | n) {\n\n    bool grid[80][80] = { false };\n\n    for (int i = 0; i < n;i++) {\n\n      int xl, xr, h; cin >> xl >> xr >> h;\n\n      for (int x = xl; x < xr;x++) {\n\n        for (int hh = 0;hh < h;hh++) {\n\n          grid[40 + x][40+hh] = true;\n\n        }\n\n      }\n\n    }\n\n    for (int i = 0; i <= 42;i++) grid[19 + i][39] = true;\n\n    vector<pair<int, int>> kado;\n\n    kado.push_back({ 20,40 });\n\n    kado_mituketu(20,39,kado, grid, 1);\n\n    double maxh = -1;\n\n    for (int h = -1; h <= 22;h++) {\n\n      if (grid[40][40 + h]) maxh = max(maxh, (double)(h + 1));\n\n      if (grid[39][40 + h])maxh = max(maxh, (double)(h + 1));\n\n    }\n\n    for (int i = 0; i < kado.size();i++) {\n\n      kado[i].first -= 40;kado[i].second -= 40;\n\n    }\n\n    double low = -r, up = maxh;\n\n    for(int i = 0; i < 100;i++){\n\n      double mid = (low + up) / 2;\n\n      Circle cir(Point(0, mid), r);\n\n      bool f = false;\n\n      for (int i = 0; i < kado.size() - 1;i++) {\n\n        Line line(Point(kado[i].first, kado[i].second), Point(kado[i + 1].first, kado[i + 1].second));\n\n        auto pp = is_sc(cir, line);\n\n        if (pp.size() == 0) continue;\n\n        bool ff = false;\n\n        for (auto p : pp) {\n\n          if ((p.imag() - mid) > eps) {\n\n            up = mid;\n\n            f = true;\n\n            ff = true;\n\n            break;\n\n          }\n\n        }\n\n        if (ff) break;\n\n      }\n\n      if (f) continue;\n\n      low = mid;\n\n    }\n\n    cout << fixed << setprecision(6) << low + r << endl;\n\n  }\n\n}","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\nconst int INF = 1e9;\n\nconst ll LINF = 1e18;\n\ntemplate <class S, class T> ostream &operator<<(ostream &out, const pair<S, T> &o) {\n  out << \"(\" << o.first << \",\" << o.second << \")\";\n  return out;\n}\n\ntemplate <class T> ostream &operator<<(ostream &out, const vector<T> V) {\n  for (int i = 0; i < V.size(); i++) {\n    out << V[i];\n    if (i != V.size() - 1)\n      out << \" \";\n  }\n  return out;\n}\n\ntemplate <class T> ostream &operator<<(ostream &out, const vector<vector<T> > Mat) {\n  for (int i = 0; i < Mat.size(); i++) {\n    if (i != 0)\n      out << endl;\n    out << Mat[i];\n  }\n  return out;\n}\n\ntemplate <class S, class T> ostream &operator<<(ostream &out, const map<S, T> mp) {\n  out << \"{ \";\n  for (auto it = mp.begin(); it != mp.end(); it++) {\n    out << it->first << \":\" << it->second;\n    if (mp.size() - 1 != distance(mp.begin(), it))\n      out << \", \";\n  }\n  out << \" }\";\n  return out;\n}\n\ndouble R;\n\nint n;\n\nint base = 50;\n\nbool building[55][100];\n\ndouble solve() {\n\n  fill(*building, *building + 100 * 55, 0);\n\n  double res = 0;\n\n  vector<int> xl(n), xr(n), h(n);\n\n  for (int i = 0; i < n; i++)\n    cin >> xl[i] >> xr[i] >> h[i];\n\n  for (int i = 0; i < n; i++) {\n\n    xl[i] += base;\n    xr[i] += base;\n\n    for (int j = xl[i]; j < xr[i]; j++) {\n\n      for (int k = 0; k < h[i]; k++) {\n\n        building[k][j] = true;\n      }\n    }\n  }\n\n  double l = 0, r = 50;\n\n  for (int i = 0; i < 50; i++) {\n\n    double m = (l + r) / 2;\n\n    bool ok = true;\n\n    for (int x = -R; x < 0; x++) {\n\n      double from = R - sqrt(R * R - (abs(x) - 1) * (abs(x) - 1));\n\n      double H = m - from;\n\n      if (H < 0)\n        continue;\n\n      if (building[(int)H][x + base] == 0)\n        ok = false;\n    }\n\n    for (int x = 0; x < R; x++) {\n\n      double from = R - sqrt(R * R - x * x);\n\n      double H = m - from;\n\n      if (H < 0)\n        continue;\n\n      if (building[(int)H][x + base] == 0)\n        ok = false;\n    }\n\n    if (ok) {\n\n      l = m;\n\n    } else {\n\n      r = m;\n    }\n  }\n\n  res = l;\n\n  return res;\n}\n\nint main(void) {\n\n  cin.tie(0);\n  ios_base::sync_with_stdio(false);\n\n  while (cin >> R >> n) {\n\n    if (n == 0 && R < 1e-9)\n      break;\n\n    cout << fixed << setprecision(4) << solve() << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"d50f46b9f1062a03305e224608abc6c72538038282ab7818743368f7c7aaba35","fast_id":"4acdb9931487bffbd0aaadbc623f608e4d60a4985917a416b35ac8c24ff224a1","fast_time":0.1012277212,"language":"cpp","measured_fast_code_id":"4acdb9931487bffbd0aaadbc623f608e4d60a4985917a416b35ac8c24ff224a1","measured_slow_code_id":"f831ca77b9567b2d6d5c281effdba1d0cf5fc291d62b679932513b0d78c652d7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17248","problem_id":"p00894","slow_code_id":"75bb87c3693137464d3c61171f1b6c3781c64fc9b65eb4d85a5e7e3a1a73f9c3","slow_id":"f831ca77b9567b2d6d5c281effdba1d0cf5fc291d62b679932513b0d78c652d7","slow_time":0.3965091636,"speedup":3.9170017748063266,"stratum":"2-4","sampling_key":"8dba2c40c86cf165836f7b92aec136d265619e79a056297772eb6d998ddfc303","slow_code":"#include <iostream>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <map>\n\n#include <vector>\n\n#include <stack>\n\n#include <queue>\n\nusing namespace std;\n\nint n;\n\nstruct Point\n\n{\n\n  int when;\n\n  Point() {}\n\n  Point(int _when) { when = _when; }\n};\n\nvector<Point> time_stamp[100010];\n\nmap<string, int> dict;\n\nvector<string> ID;\n\nvoid Init() {\n\n  dict.clear();\n\n  ID.clear();\n\n  for (int i = 1; i <= n; i++) {\n\n    time_stamp[i].clear();\n  }\n}\n\nint tranTime(int hh, int mm) { return hh * 60 + mm; }\n\nint godness;\n\nint Cut(int l, int r, int a, int b) {\n\n  int ret = 0;\n\n  if (r <= a || l >= b) {\n\n    return 0;\n  }\n\n  return min(b, r) - max(l, a);\n}\n\nint sum[100010];\n\nint tot;\n\nint ans = 0;\n\nvoid Solve() {\n\n  if (godness == -1) {\n\n    return;\n  }\n\n  for (int i = 1; i <= tot; i++) {\n\n    if (i == godness) {\n\n      continue;\n    }\n\n    int st = 0, ed;\n\n    for (int j = 0; j < (int)time_stamp[i].size(); j += 2) {\n\n      int l, r;\n\n      l = time_stamp[i][j].when;\n\n      r = time_stamp[i][j + 1].when;\n\n      while (st < (int)time_stamp[godness].size() &&\n             time_stamp[godness][st + 1].when <= l) {\n\n        st += 2;\n      }\n\n      for (int k = st; k < (int)time_stamp[godness].size(); k += 2) {\n\n        sum[i] += Cut(l, r, time_stamp[godness][k].when,\n                      time_stamp[godness][k + 1].when);\n\n        if (time_stamp[godness][k].when >= r) {\n\n          break;\n        }\n      }\n    }\n\n    ans = max(ans, sum[i]);\n  }\n}\n\nvoid Input() {\n\n  memset(sum, 0, sizeof(sum));\n\n  int month, day, hh, mm;\n\n  char IO[10];\n\n  string id;\n\n  Init();\n\n  int lastMonth;\n\n  int lastDay;\n\n  lastMonth = -1;\n\n  lastDay = -1;\n\n  godness = -1;\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%d/%d %d:%d %s\", &month, &day, &hh, &mm, IO);\n\n    cin >> id;\n\n    if (!dict[id]) {\n\n      dict[id] = (int)dict.size();\n\n      tot = (int)dict.size();\n\n      if (id == \"000\") {\n\n        godness = dict[id];\n      }\n    }\n\n    if (lastMonth == month && lastDay == day) {\n\n      time_stamp[dict[id]].push_back(Point(tranTime(hh, mm)));\n\n    } else {\n\n      Solve();\n\n      for (int i = 1; i <= tot; i++) {\n\n        time_stamp[i].clear();\n      }\n\n      time_stamp[dict[id]].push_back(Point(tranTime(hh, mm)));\n    }\n\n    lastDay = day;\n\n    lastMonth = month;\n  }\n\n  Solve();\n}\n\nint main() {\n\n  while (scanf(\"%d\", &n) != EOF) {\n\n    if (n == 0) {\n\n      break;\n    }\n\n    ans = 0;\n\n    Input();\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <cstring>\n\n#include <string>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <cctype>\n\n#include <ctime>\n\n#include <stack>\n\n#include <queue>\n\n#include <deque>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <limits>\n\nusing namespace std;\n\n#define INT (0x3f3f3f3f) * 2\n\n#define LL (0x3f3f3f3f3f3f3f3f) * 2\n\n#define clr(a) memset(a, 0, sizeof(a))\n\n#define clr_minus1(a) memset(a, -1, sizeof(a))\n\n#define clr_NULL(a) memset(a, NULL, sizeof(a))\n\n#define clr_1(a, n)                                                            \\\n  for (int i = 0; i <= n; i++)                                                 \\\n  a[i] = 1\n\n#define clr_INT(a) memset(a, INT, sizeof(a))\n\n#define clr_true(a) memset(a, true, sizeof(a))\n\n#define clr_false(a) memset(a, false, sizeof(a))\n\n#define clr_queue(q)                                                           \\\n  while (!q.empty())                                                           \\\n  q.pop()\n\n#define clr_stack(s)                                                           \\\n  while (!s.empty())                                                           \\\n  s.pop()\n\n#define clr_vector(v, n)                                                       \\\n  for (int i = 0; i <= n; i++)                                                 \\\n  v[i].clear()\n\n#define rep(i, a, b) for (int i = a; i < b; i++)\n\n#define dep(i, a, b) for (int i = a; i > b; i--)\n\n#define repin(i, a, b) for (int i = a; i <= b; i++)\n\n#define depin(i, a, b) for (int i = a; i >= b; i--)\n\n#define Max(a, b) ((a) > (b) ? (a) : (b))\n\n#define Min(a, b) ((a) < (b) ? (a) : (b))\n\nint month[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n\nint month_sum[12];\n\nstruct Per\n\n{\n\n  int month;\n\n  int day;\n\n  int h;\n\n  int m;\n\n  char flag;\n\n  int num;\n\n  int time;\n\n  int days;\n\n  int times;\n};\n\nPer per[1010];\n\nstruct Tem\n\n{\n\n  int days;\n\n  int times;\n\n  int num;\n};\n\nTem temp[1010];\n\nTem fina[1010];\n\nint fina_sum[1010];\n\nvoid check(int mx, int pos)\n\n{\n\n  for (int i = 1; i <= mx; i++)\n\n  {\n\n    if (temp[i].days != -1)\n\n    {\n\n      if (temp[i].days * 3600 + temp[i].times <=\n          temp[0].days * 3600 + temp[0].times)\n\n      {\n\n        fina_sum[i] += (per[pos].days - temp[0].days) * 3600 -\n                       (per[pos].days - temp[0].days) * 2 + per[pos].times -\n                       temp[0].times;\n\n      }\n\n      else\n\n      {\n\n        fina_sum[i] += (per[pos].days - temp[i].days) * 3600 -\n                       (per[pos].days - temp[i].days) * 2 + per[pos].times -\n                       temp[i].times;\n      }\n    }\n  }\n}\n\nint main()\n\n{\n\n  int n;\n\n  while (scanf(\"%d\", &n) == 1 && n)\n\n  {\n\n    char a, b, c, d, e;\n\n    int num_maxs = -1;\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      scanf(\"%d%c%d%c%d%c%d%c%c%c%d\", &per[i].month, &a, &per[i].day, &b,\n            &per[i].h, &c, &per[i].m, &d, &per[i].flag, &e, &per[i].num);\n\n      if (num_maxs < per[i].num)\n        num_maxs = per[i].num;\n    }\n\n    int sum = 0;\n\n    for (int i = 1; i <= 12; i++)\n\n    {\n\n      sum += month[i - 1];\n\n      month_sum[i] = sum;\n    }\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      per[i].days = month_sum[per[i].month] + per[i].day;\n\n      per[i].times = per[i].h * 60 + per[i].m;\n    }\n\n    for (int i = 0; i <= num_maxs; i++)\n\n    {\n\n      temp[i].days = -1;\n\n      temp[i].times = -1;\n    }\n\n    memset(fina, 0, sizeof(fina));\n\n    int tot = 0;\n\n    memset(fina_sum, 0, sizeof(fina_sum));\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      if (per[i].num == 0)\n\n      {\n\n        if (per[i].flag == 'I')\n\n        {\n\n          temp[0].days = per[i].days;\n\n          temp[0].times = per[i].times;\n\n        }\n\n        else\n\n        {\n\n          check(num_maxs, i);\n\n          temp[0].days = -1;\n\n          temp[0].times = -1;\n        }\n\n      }\n\n      else\n\n      {\n\n        if (per[i].flag == 'I')\n\n        {\n\n          temp[per[i].num].days = per[i].days;\n\n          temp[per[i].num].times = per[i].times;\n\n        }\n\n        else\n\n        {\n\n          if (temp[0].days == -1)\n            ;\n\n          else\n\n          {\n\n            if (temp[0].days * 3600 + temp[0].times <=\n                temp[per[i].num].days * 3600 + temp[per[i].num].times)\n\n            {\n\n              fina_sum[per[i].num] +=\n                  (per[i].days - temp[per[i].num].days) * 3600 + per[i].times -\n                  temp[per[i].num].times;\n\n            }\n\n            else\n\n            {\n\n              fina_sum[per[i].num] += (per[i].days - temp[0].days) * 3600 +\n                                      per[i].times - temp[0].times;\n            }\n          }\n\n          temp[per[i].num].days = -1;\n\n          temp[per[i].num].times = -1;\n        }\n      }\n    }\n\n    int maxs = -1;\n\n    for (int i = 1; i <= num_maxs; i++)\n\n    {\n\n      if (maxs < fina_sum[i])\n        maxs = fina_sum[i];\n    }\n\n    printf(\"%d\\n\", maxs);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"9eab5a829775fff1804c55d4c46fb1ccd48e39eee4b7add7bc86f1eba89d2131","fast_id":"c2c4a864b1dec2730a0dd78ad824a6382acb474f8e3aa5a5d1b6d79ec22fb092","fast_time":0.0978991268,"language":"cpp","measured_fast_code_id":"c2c4a864b1dec2730a0dd78ad824a6382acb474f8e3aa5a5d1b6d79ec22fb092","measured_slow_code_id":"333f430e2ec6045fcf2785f20764d159fe7fd2956a6f4348d2f8e851414da103","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17380","problem_id":"p03805","slow_code_id":"bfcb0e572f9c18c719ccd4e2eae0c6216f153de94b398a4df228cac5b1ae330e","slow_id":"333f430e2ec6045fcf2785f20764d159fe7fd2956a6f4348d2f8e851414da103","slow_time":0.3882173444,"speedup":3.9654832181812676,"stratum":"2-4","sampling_key":"8897602256df13c49e698d4a6d05044a04f7fd710b1eb9fd00e5687036af3ae5","slow_code":"#pragma GCC target(\"avx2\")\n\n#pragma GCC optimize(\"O3\")\n\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\nstruct edge {\n\n  int to, from;\n};\n\nconst int MAX_N = 100000;\n\nvector<edge> G[MAX_N + 1];\n\nint N, M;\n\nvoid tracePath(int s, int p, int &ans);\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  cin >> N >> M;\n\n  for (int i = 0; i < M; i++) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    edge et = {a, b};\n\n    G[b].push_back(et);\n\n    edge es = {b, a};\n\n    G[a].push_back(es);\n  }\n\n  int ans = 0;\n\n  tracePath(1, 0, ans);\n\n  cout << ans << \"\\n\";\n\n  return 0;\n}\n\nvoid tracePath(int s, int p, int &ans)\n\n{\n\n  if (p == (1 << (N - 1)) - 1) {\n\n    ans++;\n\n    return;\n  }\n\n  vector<edge> v = G[s];\n\n  for (int i = 0; i < v.size(); i++) {\n\n    edge e = v[i];\n\n    if (e.to != 1 && !(p & (1 << (e.to - 2)))) {\n\n      int np = p | (1 << (e.to - 2));\n\n      tracePath(e.to, np, ans);\n    }\n  }\n\n  return;\n}","fast_code":"#pragma GCC target(\"avx2\")\n\n#pragma GCC optimize(\"O3\")\n\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int MAX_N = 8;\n\nint dp[1 << (MAX_N - 1)][MAX_N + 1];\n\nint d[MAX_N + 1][MAX_N + 1];\n\nint N, M;\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  cin >> N >> M;\n\n  for (int i = 0; i < M; i++) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    d[a][b] = 1;\n\n    d[b][a] = 1;\n  }\n\n  for (int i = 2; i <= N; i++) {\n\n    dp[0][i] = d[1][i];\n  }\n\n  dp[0][1] = 1;\n\n  for (int i = 1; i < (1 << (N - 1)); i++) {\n\n    for (int j = 2; j <= N; j++) {\n\n      int smv = i & (~(1 << (j - 2)));\n\n      dp[i][j] += dp[smv][1] * d[1][j];\n\n      for (int k = 0; k < N - 1; k++) {\n\n        if (((i >> k) & 1) && (i & (1 << (j - 2)))) {\n\n          dp[i][j] += dp[smv][k + 2] * d[k + 2][j];\n        }\n      }\n    }\n  }\n\n  ll ans = 0;\n\n  for (int j = 2; j <= N; j++) {\n\n    ans += dp[(1 << (N - 1)) - 1][j];\n  }\n\n  cout << ans << \"\\n\";\n\n  return 0;\n}\n"}
{"fast_code_id":"4825ba5bfd2d23d44ed850b36a0362cd56231342616f00286bddb8b1b1d8e84d","fast_id":"e1bede1ec7bb71fd6a5dfaa8efb435411b5d0b399b0d3e164c4a0ce12f1e2255","fast_time":0.0678986116,"language":"cpp","measured_fast_code_id":"e1bede1ec7bb71fd6a5dfaa8efb435411b5d0b399b0d3e164c4a0ce12f1e2255","measured_slow_code_id":"93459541d81dadfa2d39de8e0f0612161cea5d1b907832805cdc1d1150e1ec47","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17422","problem_id":"p03566","slow_code_id":"6b3c07f307cc3cbe1ee0097f90f86e7b7ba04a6a78763db1ae06029b1b2177d8","slow_id":"93459541d81dadfa2d39de8e0f0612161cea5d1b907832805cdc1d1150e1ec47","slow_time":0.214068134,"speedup":3.1527615801793503,"stratum":"2-4","sampling_key":"e6d4ab98fdcf62c7b82ec06c5257319ea10f3bf0e6c6f76be84ad8e4c43ac8b0","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MXN 20005\n\nint mx[MXN], t[MXN], v[MXN], en;\n\ndouble memo[MXN][105];\n\nbool visited[MXN][105];\n\nconst int inf = 0x3f3f3f3f;\n\ndouble dfs(int cur, int speed) {\n\n  if (cur == en + 1) {\n\n    if (speed)\n      return -inf;\n\n    else\n      return 0;\n  }\n\n  if (visited[cur][speed])\n    return memo[cur][speed];\n\n  visited[cur][speed] = 1;\n\n  double res = -inf;\n\n  if (speed < mx[cur]) {\n\n    res = max(res, dfs(cur + 1, speed) + speed);\n\n    res = max(res, dfs(cur + 1, speed) + speed + 0.25);\n\n    res = max(res, dfs(cur + 1, speed + 1) + speed + 0.5);\n\n    if (speed)\n\n      res = max(res, dfs(cur + 1, speed - 1) + speed - 0.5);\n\n  } else if (speed == mx[cur]) {\n\n    res = max(res, dfs(cur + 1, speed) + speed);\n\n    res = max(res, dfs(cur + 1, speed - 1) + speed - 0.5);\n  }\n\n  return memo[cur][speed] = res;\n}\n\nint main() {\n\n  int n;\n\n  while (cin >> n) {\n\n    en = 0;\n\n    for (int i = 0; i < n; ++i) {\n\n      cin >> t[i];\n\n      en += t[i];\n    }\n\n    for (int i = 0; i < n; ++i)\n      cin >> v[i];\n\n    int cur = 1, tmp;\n\n    for (int i = 0; i < n; ++i) {\n\n      tmp = t[i];\n\n      while (tmp--) {\n\n        mx[cur++] = v[i];\n      }\n    }\n\n#ifdef debug\n\n    for (int i = 1; i <= en; ++i) {\n\n      cout << mx[i] << \" \";\n    }\n\n    cout << \"\\n\";\n\n#endif\n\n    memset(visited, 0, sizeof(visited));\n\n    printf(\"%.9lf\\n\", dfs(1, 0));\n  }\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cstdlib>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(x, n) for (int x = 1; x <= n; ++x)\n\n#define FOR(x, l, r) for (int x = l; x <= r; ++x)\n\nconst int maxN = 505;\n\nstruct T\n\n{\n\n  double l, r, bg;\n\n  int a;\n\n  double ed()\n\n  {\n\n    return bg + a * (r - l);\n  }\n\n  double dis()\n\n  {\n\n    return (bg + ed()) * (r - l) * 0.5;\n  }\n\n  void print()\n\n  {\n\n    cout << l << \" \" << r << \" \" << bg << \" \" << a << endl;\n  }\n\n} st[maxN];\n\nint v[maxN], t[maxN], n, top;\n\nvoid add(double l, double r, double bg, int a)\n\n{\n\n  ++top;\n\n  st[top].l = l;\n  st[top].r = r;\n\n  st[top].bg = bg;\n  st[top].a = a;\n}\n\nvoid make(double v)\n\n{\n\n  if (st[top].ed() <= v)\n    return;\n\n  double l = st[top].l, r = st[top].r;\n\n  double bg = st[top].bg;\n\n  if (bg > v + (r - l))\n\n  {\n\n    top--;\n\n    make(v + (r - l));\n\n    add(l, r, v + (r - l), -1);\n\n  }\n\n  else\n\n  {\n\n    double a = st[top].a;\n\n    double x = (v + r + l * a - bg) / (1 + a);\n\n    st[top].r = x;\n\n    add(x, r, v + r - x, -1);\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  rep(i, n) scanf(\"%d\", t + i);\n\n  rep(i, n) scanf(\"%d\", v + i);\n\n  add(-1, 0, 0, 0);\n\n  double ti = 0;\n\n  rep(i, n)\n\n  {\n\n    make(v[i]);\n\n    double last = st[top].ed();\n\n    if (t[i] > (v[i] - last))\n\n    {\n\n      add(ti, ti + v[i] - last, last, 1);\n\n      add(ti + v[i] - last, ti + t[i], v[i], 0);\n\n    }\n\n    else\n\n    {\n\n      add(ti, ti + t[i], last, 1);\n    }\n\n    ti += t[i];\n  }\n\n  make(0.0);\n\n  double ans = 0;\n\n  rep(i, top) ans += st[i].dis();\n\n  printf(\"%.10lf\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"eb01a73775a500568bc0e242c4dbf42b7d694a29f1708d5cfb0163d5ecd550a9","fast_id":"c969cc208611ffd53d40baf398eee3bc1510301505cf6cf1d252e9d780e1dc1a","fast_time":0.0564437408,"language":"cpp","measured_fast_code_id":"c969cc208611ffd53d40baf398eee3bc1510301505cf6cf1d252e9d780e1dc1a","measured_slow_code_id":"9dcea8e5176c031925a312532c7707acfa89d7e53192095fdf888f1b072300ea","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17442","problem_id":"p02367","slow_code_id":"f1c25a053563c2a8b4abdf44079205c66b2cb161c3387c17e2138b101cb159c9","slow_id":"9dcea8e5176c031925a312532c7707acfa89d7e53192095fdf888f1b072300ea","slow_time":0.2176961029,"speedup":3.8568688009424066,"stratum":"2-4","sampling_key":"7a314fc66a83bbbfdd9a630a45e778f8c725af4cdf07fd09e142fc405b0a7bf7","slow_code":"#include <bits/stdc++.h>\n\n#define N 100001\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\nvector<int> G[N];\n\nvector<P> ans;\n\nint cnt[N], dep[N];\n\nvoid dfs(int pos, int pre) {\n\n  for (int i = 0; i < G[pos].size(); i++) {\n\n    int nx = G[pos][i];\n\n    if (nx == pre || dep[nx] > dep[pos])\n      continue;\n\n    if (dep[nx] != -1 && dep[nx] < dep[pos])\n      cnt[nx]--, cnt[pos]++;\n\n    else {\n\n      dep[nx] = dep[pos] + 1;\n\n      dfs(nx, pos);\n\n      if (cnt[nx] == 0)\n        ans.push_back(P(min(pos, nx), max(pos, nx)));\n\n      cnt[pos] += cnt[nx];\n    }\n  }\n}\n\nint main() {\n\n  int n, m;\n\n  cin >> n >> m;\n\n  for (int i = 0, a, b; i < m; i++) {\n\n    cin >> a >> b;\n\n    G[a].push_back(b);\n\n    G[b].push_back(a);\n  }\n\n  memset(dep, -1, sizeof(dep));\n\n  dep[0] = 0;\n\n  dfs(0, -1);\n\n  sort(ans.begin(), ans.end());\n\n  for (int i = 0; i < ans.size(); i++)\n    cout << ans[i].first << \" \" << ans[i].second << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n\n\n                            \n\nclass Lowlink{\n\npublic:\n\n  int V;\n\n  vector<vector<int> > G;\n\n  vector<int> ord;                                                   \n\n  vector<int> low;                                                                                          \n\n  vector<int> articulation;\n\n  int ok;\n\n  \n\n  Lowlink():V(-1),ok(false){};\n\n  Lowlink(int V):V(V),G(V),ok(false){};\n\n  \n\n  void add_edge(int a,int b){\n\n    ok = false;\n\n    assert(a < V && b < V);\n\n    assert(a >=0 && b >= 0);\n\n    G[a].push_back(b);\n\n    G[b].push_back(a);\n\n  }\n\n  \n\n  void build(int root = 0){\n\n    ok = true;\n\n    ord.clear(); ord.resize(V,-1);\n\n    low.clear(); low.resize(V,-1);\n\n    articulation.clear(); articulation.resize(V,0);                 \n\n    \n\n    int cnt = 0;\n\n    function<int(int,int)> dfs=[&](int pos,int pre){\n\n      ord[pos] = low[pos] = cnt++;\n\n      for(int to:G[pos]) {\n\n        if(to == pre) continue; \n\n        if(ord[to] != -1) low[pos] = min(low[pos], ord[to]);\n\n        else {\n\n          low[pos] = min(low[pos], dfs(to, pos));\n\n\t  \n\n\t                  \n\n          if(pos == root) articulation[pos]++;\n\n          else articulation[pos] |= ord[pos] <= low[to];\n\n\t  \n\n        }\n\n      }\n\n      return low[pos];\n\n    };\n\n    \n\n    dfs(root , -1);\n\n    articulation[root] = articulation[root] >= 2;                 \n\n  }\n\n\n\n  int isBridge(int a,int b){\n\n    assert(ok);\n\n    assert(a < V && b < V);\n\n    assert(a >= 0 && b >= 0);\n\n    if(ord[a] > ord[b]) swap(a, b);\n\n    return ord[a] < low[b];\n\n  }\n\n  \n\n  int isArticulation(int a){\n\n    assert(ok);\n\n    assert(a >= 0 && a < V);\n\n    return articulation[a];\n\n  }\n\n};\n\n\n\n\n\nsigned main(){\n\n  cin.tie(0);\n\n  ios_base::sync_with_stdio(0);\n\n  cout << fixed << setprecision(12);\n\n\n\n  auto verifyBridge=[&]{\n\n    int V, E;\n\n    cin>>V>>E;\n\n  \n\n    Lowlink A(V);\n\n    for(int i=0;i<E;i++){\n\n      int a,b;\n\n      cin>>a>>b;\n\n      A.add_edge(a,b);\n\n    }\n\n    \n\n    A.build();\n\n    \n\n    typedef pair<int,int> P;\n\n    vector<P> ans;\n\n    for(int i=0;i<V;i++)\n\n      for(int to:A.G[i]) if(i < to && A.isBridge(i, to)) ans.push_back(P(i, to));\n\n    \n\n    sort(ans.begin(),ans.end());\n\n    for(auto a:ans) cout<<a.first<<\" \"<<a.second<<endl;\n\n  };\n\n\n\n  verifyBridge();\n\n\n\n  return 0;\n\n}\n\n\n"}
{"fast_code_id":"e46c21a902aee7f9b19a4c05e09c5efbd18ce838774e53db45b0b859bab4ca68","fast_id":"1481efb1258173b7f135360647a8f9a1cf9fdfcc28c4a3ff1fdff3f5924ca6b1","fast_time":0.0622806276,"language":"cpp","measured_fast_code_id":"1481efb1258173b7f135360647a8f9a1cf9fdfcc28c4a3ff1fdff3f5924ca6b1","measured_slow_code_id":"dde12643a2ab195ad19b04927dcc5992cfe34a8a969dbba253f2b33b43f8721f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17506","problem_id":"p03240","slow_code_id":"8729e3e59fdf6deaaa8ac3a741885bdbfb2906d9959a41991666e1a50a8f061a","slow_id":"dde12643a2ab195ad19b04927dcc5992cfe34a8a969dbba253f2b33b43f8721f","slow_time":0.4562537036,"speedup":7.325772414021082,"stratum":"4-8","sampling_key":"9271ee94a4821e0bcb30c155dbc01310a1349896a2f6e0059d18d68f629539c3","slow_code":"#include <bits/stdc++.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  int N;\n\n  cin >> N;\n\n  int X[110], Y[110], H[110];\n\n  for (int i = 0; i < N; i++) {\n\n    cin >> X[i] >> Y[i] >> H[i];\n  }\n\n  int minheight = H[0];\n\n  for (int i = 0; i < N; i++) {\n\n    minheight = min(minheight, H[i]);\n  }\n\n  int A[110][110][110] = {}, M[110][110] = {}, m[110][110] = {};\n\n  for (int x = 0; x <= 100; x++) {\n\n    for (int y = 0; y <= 100; y++) {\n\n      for (int i = 0; i < N; i++) {\n\n        A[x][y][i] = H[i] + abs(x - X[i]) + abs(y - Y[i]);\n      }\n    }\n  }\n\n  int ansx = 0, ansy = 0, ansh = 0;\n\n  if (minheight > 0) {\n\n    for (int x = 0; x <= 100; x++) {\n\n      for (int y = 0; y <= 100; y++) {\n\n        M[x][y] = A[x][y][0], m[x][y] = A[x][y][0];\n      }\n    }\n\n    for (int x = 0; x <= 100; x++) {\n\n      for (int y = 0; y <= 100; y++) {\n\n        for (int i = 1; i < N; i++) {\n\n          M[x][y] = max(M[x][y], A[x][y][i]);\n\n          m[x][y] = min(m[x][y], A[x][y][i]);\n        }\n      }\n    }\n\n    for (int x = 0; x <= 100; x++) {\n\n      for (int y = 0; y <= 100; y++) {\n\n        if (M[x][y] == m[x][y]) {\n\n          ansx = x, ansy = y, ansh = M[x][y];\n        }\n      }\n    }\n\n    cout << ansx << \" \" << ansy << \" \" << ansh << endl;\n\n  }\n\n  else if (minheight == 0) {\n\n    int ansx = 0, ansy = 0, ansh = 0;\n\n    for (int x = 0; x <= 100; x++) {\n\n      for (int y = 0; y <= 100; y++) {\n\n        for (int h = 1; h <= 200; h++) {\n\n          for (int i = 0; i < N; i++) {\n\n            if (max(h - abs(x - X[i]) - abs(y - Y[i]), 0) != H[i]) {\n\n              break;\n            }\n\n            if (i == N - 1 &&\n                max(h - abs(x - X[i]) - abs(y - Y[i]), 0) == H[i]) {\n\n              ansx = x, ansy = y, ansh = h;\n            }\n          }\n        }\n      }\n    }\n\n    cout << ansx << \" \" << ansy << \" \" << ansh << endl;\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  int N;\n  cin >> N;\n\n  int X[110], Y[110], H[110];\n\n  int pos = -1;\n\n  for (int i = 0; i < N; i++) {\n\n    cin >> X[i] >> Y[i] >> H[i];\n\n    if (H[i])\n      pos = i;\n  }\n\n  for (int i = 0; i <= 100; i++) {\n\n    for (int j = 0; j <= 100; j++) {\n\n      int height = H[pos] + abs(i - X[pos]) + abs(j - Y[pos]);\n\n      bool ok = true;\n\n      for (int k = 0; k < N; k++) {\n\n        if (H[k] != max(0, height - abs(i - X[k]) - abs(j - Y[k]))) {\n\n          ok = false;\n          break;\n        }\n      }\n\n      if (ok) {\n\n        cout << i << \" \" << j << \" \" << height << endl;\n\n        return 0;\n      }\n    }\n  }\n}"}
{"fast_code_id":"006f6fb6fb3a7697c05fb0749feab54c08e250a397dc963ae71865502ff5e579","fast_id":"8f57cb1a762a1001d971541c618e3d939c11f75ef2c828b79d9cb32b0afc8fca","fast_time":0.0002016517,"language":"cpp","measured_fast_code_id":"8f57cb1a762a1001d971541c618e3d939c11f75ef2c828b79d9cb32b0afc8fca","measured_slow_code_id":"b492a2bff98aa6b3ffe7956079526077a6b238e30bc13dfac93b0239d673f30c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17632","problem_id":"p02852","slow_code_id":"09eb8b232586413d1501f3a7402827621d762c53aa97f02c35fda74b0b973eb6","slow_id":"b492a2bff98aa6b3ffe7956079526077a6b238e30bc13dfac93b0239d673f30c","slow_time":0.001438532,"speedup":7.1337459589976175,"stratum":"4-8","sampling_key":"c68bdb173aadec64c1304bf5c7b801c5fc283fb979377784d7b7119173200ca1","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  int N, M;\n\n  cin >> N >> M;\n\n  string S;\n\n  cin >> S;\n\n  int dp[100002] = {};\n\n  int mae = 0;\n\n  int kazu = 0;\n\n  while (mae <= N) {\n\n    int tugi = mae + M;\n\n    chmin(tugi, N);\n\n    kazu++;\n\n    int saigo = mae;\n\n    for (int i = mae + 1; i <= tugi; i++) {\n\n      if (S[i] == '0') {\n\n        dp[i] = kazu;\n\n        saigo = i;\n      }\n    }\n\n    if (mae == saigo)\n      break;\n\n    mae = saigo;\n  }\n\n  if (dp[N] == 0) {\n\n    co(-1);\n\n    return 0;\n  }\n\n  vector<int> kotae;\n\n  for (int i = N; i > 0;) {\n\n    int k = dp[i];\n\n    for (int j = max(0, i - M); j <= i; j++) {\n\n      if (dp[j] == k - 1) {\n\n        kotae.pb(i - j);\n\n        i = j;\n\n        break;\n      }\n    }\n  }\n\n  for (auto itr = kotae.rbegin(); itr != kotae.rend(); itr++) {\n\n    cosp(*itr);\n  }\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int dm = 1 << 18;\n\nchar dn[dm], *di = dn;\n\ninline void putint(int X) {\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = ' ';\n}\n\nint main() {\n\n  int N, M;\n\n  scanf(\"%d\", &N);\n\n  scanf(\"%d\", &M);\n\n  char S[100001];\n\n  scanf(\"%s\", S);\n\n  if (M == 1) {\n\n    int OK = 1;\n\n    rep(i, N + 1) if (S[i] == '1') OK = 0;\n\n    if (OK) {\n\n      rep(i, N) {\n\n        *di++ = '1';\n\n        *di++ = ' ';\n      }\n\n    }\n\n    else {\n\n      *di++ = '-';\n\n      *di++ = '1';\n\n      *di++ = '\\n';\n    }\n\n  }\n\n  else {\n\n    int kotae[100001];\n\n    int k = 0;\n\n    for (int i = N; i > 0;) {\n\n      int atta = 0;\n\n      for (int j = max(0, i - M); j < i; j++) {\n\n        if (S[j] == '0') {\n\n          kotae[k++] = i - j;\n\n          i = j;\n\n          atta = 1;\n\n          break;\n        }\n      }\n\n      if (atta == 0) {\n\n        printf(\"-1\\n\");\n\n        return 0;\n      }\n    }\n\n    for (int i = k - 1; i >= 0; i--) {\n\n      putint(kotae[i]);\n    }\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"d28e317cd8fbe82e88d4c19076f807007ce9157bf43b8a54f8734cba6ad167ee","fast_id":"2081bdf69cd983bbdbf57b476a39061576960abaa1cb1d2ff589d1412ebd94fd","fast_time":0.0010365478,"language":"cpp","measured_fast_code_id":"2081bdf69cd983bbdbf57b476a39061576960abaa1cb1d2ff589d1412ebd94fd","measured_slow_code_id":"cecde279b64e60afb42962333bdcecccc77883cfbe210471d8a808be27bf5523","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17645","problem_id":"p02281","slow_code_id":"e7468be83b1eec47b357af3a6c60591f5e86babd308f25b83abb761d5d01f0b0","slow_id":"cecde279b64e60afb42962333bdcecccc77883cfbe210471d8a808be27bf5523","slow_time":0.005097388,"speedup":4.917658404175861,"stratum":"4-8","sampling_key":"3db1b6c0d2e1b4bcf24d7b3e688fcb3a51ee300a0947ab67788b88171bc99bb0","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\nstruct fun {\n\n  int a;\n\n  int b;\n\n  int c;\n\n} ff[30];\n\nbool cmp(const fun &x, const fun &y) { return x.a < y.a; }\n\nint f[30];\n\nvoid qian(int x) {\n\n  if (x != -1)\n\n    printf(\" %d\", ff[x].a);\n\n  else\n\n    return;\n\n  qian(ff[x].b);\n\n  qian(ff[x].c);\n}\n\nvoid zhong(int x) {\n\n  if (x != -1)\n\n    zhong(ff[x].b);\n\n  else\n\n    return;\n\n  printf(\" %d\", ff[x].a);\n\n  zhong(ff[x].c);\n}\n\nvoid hou(int x) {\n\n  if (x != -1)\n\n    hou(ff[x].b);\n\n  else\n\n    return;\n\n  if (x != -1)\n\n    hou(ff[x].c);\n\n  else\n\n    return;\n\n  printf(\" %d\", ff[x].a);\n}\n\nint main() {\n\n  int n;\n\n  int q;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d%d%d\", &ff[i].a, &ff[i].b, &ff[i].c);\n\n    if (ff[i].b == -1 && ff[i].c == -1) {\n\n      f[ff[i].a] = 1;\n\n      continue;\n    }\n\n    if (ff[i].b >= 0)\n\n      f[ff[i].b] = 1;\n\n    if (ff[i].c >= 0)\n\n      f[ff[i].c] = 1;\n  }\n\n  sort(ff, ff + n, cmp);\n\n  if (n == 1) {\n\n    printf(\"Preorder\\n 0\\n\");\n\n    printf(\"Inorder\\n 0\\n\");\n\n    printf(\"Postorder\\n 0\\n\");\n\n    return 0;\n  }\n\n  for (int i = 0; i < n; i++)\n\n    if (!f[i]) {\n\n      q = i;\n\n      break;\n    }\n\n  printf(\"Preorder\\n\");\n\n  qian(q);\n\n  printf(\"\\n\");\n\n  printf(\"Inorder\\n\");\n\n  zhong(q);\n\n  printf(\"\\n\");\n\n  printf(\"Postorder\\n\");\n\n  hou(q);\n\n  printf(\"\\n\");\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nstruct tree {\n\n  int left;\n\n  int key;\n\n  int right;\n\n} tr[30];\n\nbool cmp(tree t1, tree t2);\n\nvoid preorder(tree t);\n\nvoid inorder(tree t);\n\nvoid postorder(tree t);\n\nint pre[30], ino[30], pos[30];\n\nint j, k, l;\n\nint main() {\n\n  int n;\n\n  while (~scanf(\"%d\", &n)) {\n\n    int i;\n\n    memset(tr, 0, sizeof(tr));\n\n    for (i = 0; i < n; i++)\n\n      scanf(\"%d %d %d\", &tr[i].key, &tr[i].left, &tr[i].right);\n\n    sort(tr, tr + n, cmp);\n\n    for (i = 0; i < n; i++) {\n\n      for (j = 0; j < n; j++) {\n\n        if (tr[i].key == tr[j].left || tr[i].key == tr[j].right)\n\n          break;\n      }\n\n      if (j == n)\n        break;\n    }\n\n    j = 0;\n    k = 0;\n    l = 0;\n\n    preorder(tr[i]);\n\n    inorder(tr[i]);\n\n    postorder(tr[i]);\n\n    printf(\"Preorder\\n\");\n\n    for (i = 0; i < j; i++)\n\n      printf(\" %d\", pre[i]);\n\n    printf(\"\\nInorder\\n\");\n\n    for (i = 0; i < k; i++)\n\n      printf(\" %d\", ino[i]);\n\n    printf(\"\\nPostorder\\n\");\n\n    for (i = 0; i < l; i++)\n\n      printf(\" %d\", pos[i]);\n\n    printf(\"\\n\");\n  }\n}\n\nvoid preorder(tree t) {\n\n  if (t.key != -1) {\n\n    pre[j++] = t.key;\n\n    if (t.left != -1)\n\n      preorder(tr[t.left]);\n\n    if (t.right != -1)\n\n      preorder(tr[t.right]);\n\n  }\n\n  else\n    return;\n}\n\nvoid inorder(tree t) {\n\n  if (t.key != -1) {\n\n    if (t.left != -1)\n\n      inorder(tr[t.left]);\n\n    ino[k++] = t.key;\n\n    if (t.right != -1)\n\n      inorder(tr[t.right]);\n\n  }\n\n  else\n    return;\n}\n\nvoid postorder(tree t) {\n\n  if (t.key != -1) {\n\n    if (t.left != -1)\n\n      postorder(tr[t.left]);\n\n    if (t.right != -1)\n\n      postorder(tr[t.right]);\n\n    pos[l++] = t.key;\n\n  }\n\n  else\n    return;\n}\n\nbool cmp(tree t1, tree t2) { return t1.key < t2.key; }\n"}
{"fast_code_id":"20e1c6f1d2ead199501fc9608495f9284074e0e8893bf201a1dd3c4bf2efa2ca","fast_id":"982fac41f2ca804787c91df562b2e68b94daaac168bab36e06cd5fa91b0f16f5","fast_time":0.0002019884,"language":"cpp","measured_fast_code_id":"982fac41f2ca804787c91df562b2e68b94daaac168bab36e06cd5fa91b0f16f5","measured_slow_code_id":"6a0da20dc8d25b686ede89e2f336bd92be116a639fbd7ee97a5380b26e8093ab","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17740","problem_id":"p03660","slow_code_id":"4fbd339cf8ca23272c954dac953dd34203a187773ec60dcf4891539ee09bdda2","slow_id":"6a0da20dc8d25b686ede89e2f336bd92be116a639fbd7ee97a5380b26e8093ab","slow_time":0.0051922308,"speedup":25.705589033825706,"stratum":"8+","sampling_key":"0028e5fe6a205b7e671d992f2da137602bb6303492e8d0da2d727a9c679ce9dd","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cstdio>\n\nusing namespace std;\n\nconst int MAXN = 1e5 + 10;\n\nint num1[MAXN], num2[MAXN];\n\nint T, n;\n\nint head[MAXN], net[2 * MAXN], u[2 * MAXN], v[2 * MAXN], tot;\n\nint read()\n\n{\n\n  int f = 0, w = 1;\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      w = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    f = (f << 3) + (f << 1) + ch - '0';\n    ch = getchar();\n  }\n\n  return f * w;\n}\n\nvoid add(int l, int r)\n\n{\n\n  u[++tot] = l;\n  v[tot] = r;\n  net[tot] = head[l];\n  head[l] = tot;\n}\n\nint vt[MAXN];\n\nvoid dfs(int now, int step, int flag)\n\n{\n\n  vt[now] = 1;\n\n  if (flag == 1)\n    num1[now] = step;\n\n  if (flag == 2)\n    num2[now] = step;\n\n  for (int i = head[now]; i; i = net[i])\n\n    if (vt[v[i]] == 0)\n\n      dfs(v[i], step + 1, flag);\n}\n\nint main()\n\n{\n\n  T = 1;\n\n  while (T--)\n\n  {\n\n    n = read();\n    tot = 0;\n\n    memset(head, 0, sizeof(head));\n\n    memset(net, 0, sizeof(net));\n\n    memset(u, 0, sizeof(u));\n\n    memset(v, 0, sizeof(v));\n\n    memset(num1, 0, sizeof(num1));\n\n    memset(num2, 0, sizeof(num2));\n\n    for (int i = 1; i < n; i++)\n\n    {\n\n      int l = read(), r = read();\n\n      add(l, r);\n\n      add(r, l);\n    }\n\n    memset(vt, 0, sizeof(vt));\n\n    dfs(1, 0, 1);\n\n    memset(vt, 0, sizeof(vt));\n\n    dfs(n, 0, 2);\n\n    int p1 = 0, p2 = 0;\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      if (num1[i] < num2[i])\n\n        p1++;\n\n      if (num2[i] < num1[i])\n\n        p2++;\n\n      if (num1[i] == num2[i])\n\n        p1++;\n    }\n\n    if (p1 > p2)\n      printf(\"Fennec\\n\");\n\n    else\n      printf(\"Snuke\\n\");\n  }\n}","fast_code":"#include <stdio.h>\n\nint d[2][100010], w = 0;\n\nint ta[100010], to[200010], nt[200010];\n\nvoid f(int s) {\n\n  int i, j, t, r, q[100010];\n\n  d[w][q[t = 0] = s] = 1;\n\n  for (r = 1; r - t; t++) {\n\n    for (i = ta[q[t]]; i + 1; i = nt[i]) {\n\n      if (d[w][to[i]])\n        continue;\n\n      d[w][to[i]] = d[w][q[t]] + 1;\n\n      q[r++] = to[i];\n    }\n  }\n}\n\nint main() {\n\n  int n, a, b, i;\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++)\n    ta[i + 1] = -1;\n\n  for (i = 0; i < n - 1; i++) {\n\n    scanf(\"%d %d\", &a, &b);\n\n    nt[i] = ta[to[i + n] = a];\n\n    nt[i + n] = ta[to[i] = b];\n\n    ta[a] = i;\n\n    ta[b] = i + n;\n  }\n\n  f(1);\n\n  w++;\n\n  f(n);\n\n  for (i = a = b = 0; i < n; i++) {\n\n    if (d[0][i + 1] > d[1][i + 1])\n      b++;\n\n    else\n      a++;\n  }\n\n  printf(\"%s\\n\", b < a ? \"Fennec\" : \"Snuke\");\n\n  return 0;\n}"}
{"fast_code_id":"01e89ed5420f4f37cc454b46ff34219dfbea725fa6997f94c7623318eee64c14","fast_id":"5a847d8775f533ded143bdadd8d397098069c600c2e8a41e2370dcc0346b78b8","fast_time":0.1069928585,"language":"cpp","measured_fast_code_id":"5a847d8775f533ded143bdadd8d397098069c600c2e8a41e2370dcc0346b78b8","measured_slow_code_id":"edd127ee4fe0c289fd03c5b9d2ac3175b1d3bc768ba36a0a6a4976964adb6baa","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17831","problem_id":"p03986","slow_code_id":"03a918d0387267bc2de9f3a19be9468fe89c74e5ae2cd7be6b81bba7e281dc20","slow_id":"edd127ee4fe0c289fd03c5b9d2ac3175b1d3bc768ba36a0a6a4976964adb6baa","slow_time":0.6808421214,"speedup":6.363435195069585,"stratum":"4-8","sampling_key":"cfc08c2350119cc3559790228fc6c084f91d8bda324ecc8a679a15e4ff62a9ba","slow_code":"#include <iostream>\n\n#include <climits>\n\n#include <stack>\n\n#include <queue>\n\n#include <string>\n\n#include <random>\n\n#include <utility>\n\n#include <cmath>\n\n#include <set>\n\n#include <map>\n\n#include <math.h>\n\n#include <string.h>\n\n#include <iomanip>\n\n#include <stdlib.h>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\nlong long int INF = 1e18;\n\ndouble Pi = 3.141592653589;\n\nconst int mod = 1000000007;\n\nvector<int> G[100005];\n\nstd::vector<P> tree[100010];\n\nint dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\n\nint dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};\n\nll i, j, k;\n\nll n, m;\n\nll a[100005], b[100005];\n\nll ans = 0;\n\nll c = 0;\n\nchar s[200005];\n\nbool flag = false;\n\nint main() {\n\n  cin >> s;\n\n  n = strlen(s);\n\n  for (i - 0; i < n; i++) {\n\n    if (s[i] == 'S') {\n\n      c++;\n\n    } else {\n\n      if (c > 0)\n        ans++;\n\n      c = max(0ll, c - 1);\n    }\n  }\n\n  cout << n - 2 * ans << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#include <unistd.h>\n\n#include <sys/time.h>\n\n#include <stdlib.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<P, ll> T;\n\nlong long int INF = 2e18;\n\nconst ll fact_table = 1200008;\n\ndouble Pi = 3.1415926535897932384626;\n\npriority_queue<ll> pql;\n\npriority_queue<P> pqp;\n\npriority_queue<P> bag;\n\npriority_queue<ll, vector<ll>, greater<ll> > pqls;\n\npriority_queue<P, vector<P>, greater<P> > pqps;\n\nll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\n\nll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};\n\nchar dir[] = \"DRUL\";\n\n#define endl \"\\n\"\n\n#ifdef ENJAPMA\n\n#undef endl\n\n#endif\n\n#define p(x) cout << x << endl;\n\n#define el cout << endl;\n\n#define pe(x) cout << x << \" \";\n\n#define ps(x) cout << fixed << setprecision(25) << x << endl;\n\n#define pu(x) cout << (x);\n\n#define pb push_back\n\n#define lb lower_bound\n\n#define ub upper_bound\n\n#define CLEAR(a) a = decltype(a)();\n\n#define pc(x) cout << x << \",\";\n\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\nconst ll mod = 998244353ll;\n\nll mypow(ll number1, ll number2, ll mod) {\n\n  if (number2 == 0) {\n\n    return 1ll;\n\n  } else {\n\n    ll number3 = mypow(number1, number2 / 2, mod);\n\n    number3 *= number3;\n\n    number3 %= mod;\n\n    if (number2 % 2 == 1) {\n\n      number3 *= number1;\n\n      number3 %= mod;\n    }\n\n    return number3;\n  }\n}\n\nvoid YES(bool condition) {\n\n  if (condition) {\n    p(\"YES\");\n  } else {\n    p(\"NO\");\n  }\n\n  return;\n}\n\nvoid Yes(bool condition) {\n\n  if (condition) {\n\n    p(\"Yes\");\n\n  } else {\n\n    p(\"No\");\n  }\n\n  return;\n}\n\nll mygcd(ll a, ll b) {\n\n  if (b > a)\n    swap(a, b);\n\n  if (a == b || b == 0)\n    return a;\n\n  return mygcd(b, a % b);\n}\n\nbool multicase = false;\n\nll n, m, num, a, b, c, d, e, q, w, ans;\n\nll x[500005], y[500005];\n\nll r, k;\n\nstring s;\n\nvoid solve() {\n\n  cin >> s;\n\n  ll n = s.size();\n\n  ll cnt = 0;\n\n  for (ll i = 0; i < n; i++) {\n\n    if (s[i] == 'S')\n      cnt++;\n\n    if (s[i] == 'T') {\n\n      if (cnt >= 1) {\n\n        cnt--;\n\n        ans += 2;\n      }\n    }\n  }\n\n  p(n - ans);\n\n  return;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  ll q, testcase = 1;\n\n  if (multicase) {\n\n    cin >> q;\n\n  } else {\n\n    q = 1;\n  }\n\n  while (q--) {\n\n    solve();\n\n    testcase++;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"4b7c2db38539e3d872b78b52a6af496874ce0c2c6208dfa98dce6c62ca5f5886","fast_id":"6d3409f16a551262a5719bf898495b87d596db92f8be26b33399643b72afccb0","fast_time":0.0130282592,"language":"cpp","measured_fast_code_id":"6d3409f16a551262a5719bf898495b87d596db92f8be26b33399643b72afccb0","measured_slow_code_id":"a50251f3055103ccf272d40167e67762cb8abca0cc00323232595e88f8246271","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17865","problem_id":"p03956","slow_code_id":"5e61373b1dc09350c060c8897941ccac9e6295d3c649c21326da0bbc2371cd64","slow_id":"a50251f3055103ccf272d40167e67762cb8abca0cc00323232595e88f8246271","slow_time":0.2396084102,"speedup":18.391437146107748,"stratum":"8+","sampling_key":"001570b1c717514f1690722a6439321fe5e8ec1120144096f9da1246cd8431c3","slow_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int MAXN = 1e5 + 5;\n\nint n, m, flag;\n\nint cnt[3], ncnt, ecnt, c[MAXN];\n\nbool vis[MAXN], evis[MAXN];\n\nstruct node {\n\n  int v, w, id;\n\n  node(int _v, int _w, int _id) : v(_v), w(_w), id(_id) {}\n};\n\nvector<node> E[MAXN];\n\nvoid dfs(int u) {\n\n  vis[u] = 1;\n\n  ncnt++;\n\n  cnt[c[u]]++;\n\n  for (int i = 0; i < (int)E[u].size(); i++) {\n\n    int v = E[u][i].v, w = E[u][i].w, id = E[u][i].id;\n\n    if (evis[id])\n      continue;\n    evis[id] = 1;\n    ecnt++;\n\n    if (!vis[v]) {\n\n      c[v] = (c[u] + w + 3) % 3;\n\n      dfs(v);\n\n    }\n\n    else if (c[v] != (c[u] + w + 3) % 3)\n      flag = 1;\n  }\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++) {\n\n    int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    E[u].push_back(node(v, 1, i));\n\n    E[v].push_back(node(u, -1, i));\n  }\n\n  ll ans = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (vis[i])\n      continue;\n\n    flag = ncnt = ecnt = cnt[0] = cnt[1] = cnt[2] = 0;\n\n    dfs(i);\n\n    if (flag)\n      ans += 1ll * ncnt * ncnt;\n\n    else if (!cnt[0] || !cnt[1] || !cnt[2])\n      ans += ecnt;\n\n    else\n      ans += 1ll * cnt[0] * cnt[1] + 1ll * cnt[1] * cnt[2] + 1ll * cnt[2] * cnt[0];\n  }\n\n  printf(\"%lld\", ans);\n\n  fclose(stdin);\n\n  fclose(stdout);\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 200005;\n\ntypedef long long ll;\n\nint n, m, V, E, cnt[3], col[N];\n\nbool vis[N], vise[N * 2], colored;\n\nll ans;\n\nstruct node {\n\n  int u, v, w, nxt;\n\n} edge[N * 2];\n\nint head[N], mcnt = 1;\n\nvoid add_edge(int u, int v, int w) {\n\n  mcnt++;\n\n  edge[mcnt].u = u;\n\n  edge[mcnt].v = v;\n\n  edge[mcnt].w = w;\n\n  edge[mcnt].nxt = head[u];\n\n  head[u] = mcnt;\n}\n\nvoid dfs(int u)\n\n{\n\n  V++;\n  vis[u] = true;\n\n  cnt[col[u]]++;\n\n  for (int i = head[u]; i; i = edge[i].nxt) {\n\n    if (vise[i | 1])\n\n      continue;\n\n    vise[i | 1] = 1, E++;\n\n    int v = edge[i].v, w = edge[i].w;\n\n    if (!vis[v]) {\n\n      col[v] = (col[u] + w + 3) % 3;\n\n      dfs(v);\n\n    }\n\n    else if ((col[u] + w + 3) % 3 != col[v])\n\n      colored = true;\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int x, y;\n\n    scanf(\"%d%d\", &x, &y);\n\n    add_edge(x, y, 1);\n\n    add_edge(y, x, -1);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    if (!vis[i])\n\n    {\n\n      V = E = cnt[0] = cnt[1] = cnt[2] = colored = 0;\n\n      dfs(i);\n\n      if (colored)\n\n        ans += 1ll * V * V;\n\n      else\n\n          if (!cnt[0] || !cnt[1] || !cnt[2])\n\n        ans += 1ll * E;\n\n      else\n\n        ans += 1ll * cnt[0] * cnt[1] + 1ll * cnt[1] * cnt[2] + 1ll * cnt[0] * cnt[2];\n    }\n\n  printf(\"%lld\\n\", ans);\n}\n"}
{"fast_code_id":"4fc7caa545c672923c974e0d3630280bcf2f0e28bca6c465076e61c1dd236b1d","fast_id":"951f2e734b19096fa26bedf37512ea75bb34410e3b351daeb1125ee396a6019f","fast_time":0.1087755392,"language":"cpp","measured_fast_code_id":"951f2e734b19096fa26bedf37512ea75bb34410e3b351daeb1125ee396a6019f","measured_slow_code_id":"9a91402a1b75763b305a6a2e2f2241b3eafb3d346c82e9e01f20e631b817ce1c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_17987","problem_id":"p02791","slow_code_id":"34f52e52749a4f07f6e442eb53342d2f8ca27bda306fa85976754b8450d067da","slow_id":"9a91402a1b75763b305a6a2e2f2241b3eafb3d346c82e9e01f20e631b817ce1c","slow_time":0.2847317359,"speedup":2.617608131332527,"stratum":"2-4","sampling_key":"ac7d171a11c2a55ee6a9f2e003adabbe7f30275580dabfc687c9803925778f7a","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\nll n, ans = 1, dp;\n\nvector<ll> p(201001);\n\nint main() {\n\n  cin >> n;\n\n  rep(i, n) cin >> p.at(i);\n\n  for (ll i = 1; i < n; i++) {\n\n    if (i == 1)\n      dp = p.at(0);\n\n    else\n      dp = min(p.at(i - 1), dp);\n\n    if (dp > p.at(i))\n      ans++;\n  }\n\n  cout << ans << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int inf = 1001001001;\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  vector<int> p(n);\n\n  rep(i, n) cin >> p.at(i);\n\n  int mn = 0, ans = 0;\n\n  rep(i, n) {\n\n    if (i == 0 || p.at(i) < mn) {\n\n      ans++;\n\n      mn = p.at(i);\n    }\n  }\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"9f3d32de5f9c11f088d56354bffa5226218b3797f547697339228a8c14a88680","fast_id":"63d5811728b96fba2ec3c1fcc4d83e15e89d2d9eaa3fbb2f80fa372a2f3e5aa5","fast_time":0.0252213427,"language":"cpp","measured_fast_code_id":"63d5811728b96fba2ec3c1fcc4d83e15e89d2d9eaa3fbb2f80fa372a2f3e5aa5","measured_slow_code_id":"8d474b1960d4386300fca61c4718cc4c07cb2e7cf461ca0eb8c94093add12ba3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1808","problem_id":"p04021","slow_code_id":"993fa17e7fbc9483e76c4a7ab1cc988a2ed8036555d90b3edb4a9c7a72d27cd7","slow_id":"8d474b1960d4386300fca61c4718cc4c07cb2e7cf461ca0eb8c94093add12ba3","slow_time":0.1926702498,"speedup":7.639174967477048,"stratum":"4-8","sampling_key":"99d8114ca90597e7de27ee904610c27f0604f3104391409979440055ab9233dd","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int A[100000], a[50000], b[50000];\n\n  pair<int, int> B[100000];\n\n  rep(i, N) {\n\n    cin >> A[i];\n\n    B[i] = mp(A[i], i);\n  }\n\n  sort(B, B + N);\n\n  rep(i, N) { A[B[i].second] = i; }\n\n  int kotae = 0;\n\n  rep(i, N) {\n\n    if ((i + A[i]) % 2)\n      kotae++;\n  }\n\n  co(kotae / 2);\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nvoid pakuripair_sort(int N, int A[], int B[]) {\n\n  const int b = 8;\n\n  int tmp[200001], tmp2[200001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n      tmp2[kazu[A[i] >> k * b & ((1 << b) - 1)]] = B[i];\n    }\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n\n      B[kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp2[i];\n    }\n  }\n}\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  int N = getint();\n\n  int A[100000], B[100000];\n\n  rep(i, N) {\n\n    A[i] = getint();\n\n    B[i] = i;\n  }\n\n  pakuripair_sort(N, A, B);\n\n  int kotae = 0;\n\n  rep(i, N) {\n\n    if ((i + B[i]) & 1)\n      kotae++;\n  }\n\n  printf(\"%d\", kotae / 2);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"62a640957289f8e94c9f96d4d3ee5ef8272784bd432be1fdd6b33a09b394caf0","fast_id":"220283ea341ffd4b850997457b74f5950b145255fc796349bc825a78c5202ed2","fast_time":0.0303231008,"language":"cpp","measured_fast_code_id":"220283ea341ffd4b850997457b74f5950b145255fc796349bc825a78c5202ed2","measured_slow_code_id":"55e46ff6d07933021a8c07ccf70e275a5a20ef59eedf9ae408015d63bf3a39c1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18116","problem_id":"p03945","slow_code_id":"4dee1d900c0e90e24061def76f2a70e8fe1316c721f4973d403efa8b436cce43","slow_id":"55e46ff6d07933021a8c07ccf70e275a5a20ef59eedf9ae408015d63bf3a39c1","slow_time":0.1043515936,"speedup":3.441323309521169,"stratum":"2-4","sampling_key":"29c71fb786fb9856689c48fb2b330275c5c7203ae35a79c5971279b7d3f60419","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 100000 + 10;\n\nint n;\n\nchar ss[N];\n\nint main() {\n\n  scanf(\"%s\", ss + 1);\n\n  n = (int)strlen(ss + 1);\n\n  int tot = 0;\n\n  for (int i = 1, j; i <= n; i = j + 1) {\n\n    for (j = i; j + 1 <= n && ss[j + 1] == ss[i]; j++)\n      ;\n\n    tot++;\n  }\n\n  printf(\"%d\\n\", tot - 1);\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nint main() {\n\n  char a[100050] = {0};\n\n  while (~scanf(\"%s\", a))\n\n  {\n\n    int k = strlen(a);\n\n    int sum = 0;\n\n    for (int i = 1; i < k; i++)\n\n    {\n\n      if (a[i - 1] != a[i])\n\n      {\n\n        sum++;\n      }\n    }\n\n    printf(\"%d\\n\", sum);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"4a00bdc398ae42f7b51b0b36c004e0220065abbd0582a9b5269d63e993918055","fast_id":"5b270e8dab4fec0159689983c732995475a4bb113d5e3ad93ea8ec6fec39dcba","fast_time":0.0610140909,"language":"cpp","measured_fast_code_id":"5b270e8dab4fec0159689983c732995475a4bb113d5e3ad93ea8ec6fec39dcba","measured_slow_code_id":"d84e7c3a8e3a0236864ff585579f11966b47577a297bbd751db6d707f2f23a03","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18386","problem_id":"p02948","slow_code_id":"1e0f5632a436c6d72331967b447ce74f9eb26fd7bfaf7e2e2a58c49f5edba115","slow_id":"d84e7c3a8e3a0236864ff585579f11966b47577a297bbd751db6d707f2f23a03","slow_time":0.2121297907,"speedup":3.4767344325046725,"stratum":"2-4","sampling_key":"23cf6431239e3a7f98ac2b0df6a92144e557c9837456142408cc8fed167aff69","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = (int)1e5;\n\nvector<int> dat[N + 5];\n\npriority_queue<int> pq;\n\nint main() {\n\n  int n, m;\n  scanf(\"%d %d\", &n, &m);\n\n  for (int i = 1; i <= n; i++) {\n\n    int a, b;\n    scanf(\"%d %d\", &a, &b);\n\n    dat[a].push_back(b);\n  }\n\n  while (!pq.empty()) {\n\n    pq.pop();\n  }\n\n  int res = 0;\n\n  for (int i = 0; i <= m; i++) {\n\n    for (int x : dat[i]) {\n\n      pq.push(x);\n    }\n\n    if (!pq.empty()) {\n\n      res += pq.top();\n\n      pq.pop();\n    }\n  }\n\n  printf(\"%d\\n\", res);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n\n#ifdef LOCAL\n\n  freopen(\"input.in\", \"r\", stdin);\n\n#endif\n\n  int n, m;\n\n  cin >> n >> m;\n\n  vector<int> adj[m + 1];\n\n  for (int i = 1; i <= n; i++) {\n\n    int time, reward;\n\n    cin >> time >> reward;\n\n    if (time <= m)\n\n      adj[time].push_back(reward);\n  }\n\n  int ans = 0;\n\n  priority_queue<int> pq;\n\n  for (int i = 1; i <= m; i++) {\n\n    for (int x : adj[i])\n\n      pq.push(x);\n\n    if (pq.size()) {\n\n      ans += pq.top();\n\n      pq.pop();\n    }\n  }\n\n  cout << ans;\n}\n"}
{"fast_code_id":"f4b816ea4a3897c9fc6d246c9b6499ecd7259a80ad0d2b342367e7633f910a26","fast_id":"92f87362e87ff32f9da4f10d5ea9e07e29b06bf543a2fbdccbad3f0902ee6f17","fast_time":0.1007696856,"language":"cpp","measured_fast_code_id":"92f87362e87ff32f9da4f10d5ea9e07e29b06bf543a2fbdccbad3f0902ee6f17","measured_slow_code_id":"bcc2417b17c739e1d1f62616abe3e0575a248378a6ad45e3d4a421757da9fcba","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18397","problem_id":"p03537","slow_code_id":"e813bab82e39b5de450e32c398df55f68a29b0b12284acdb11115e342e06f1f1","slow_id":"bcc2417b17c739e1d1f62616abe3e0575a248378a6ad45e3d4a421757da9fcba","slow_time":0.3330308596,"speedup":3.304871476149569,"stratum":"2-4","sampling_key":"29896aa9d1c54f66bdd91516681efeb41340ddb17a7cf66ab8a43ec74d76df7a","slow_code":"#include <bits/stdc++.h>\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <queue>\n\n#include <map>\n\n#include <cstring>\n\n#include <string>\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <functional>\n\n#define int long long\n\n#define inf 10000000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<double, pa>\n\n#define ppa pair<pa, int>\n\n#define ppap pair<int, pa>\n\n#define ssa pair<string, int>\n\n#define mp make_pair\n\n#define pb push_back\n\n#define EPS (1e-10)\n\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nusing namespace std;\n\nclass Point {\n\npublic:\n  double x, y;\n\n  Point(double x = 0, double y = 0) : x(x), y(y) {}\n\n  Point operator+(Point p) { return Point(x + p.x, y + p.y); }\n\n  Point operator-(Point p) { return Point(x - p.x, y - p.y); }\n\n  Point operator*(double a) { return Point(x * a, y * a); }\n\n  Point operator/(double a) { return Point(x / a, y / a); }\n\n  double absv() { return sqrt(norm()); }\n\n  double norm() { return x * x + y * y; }\n\n  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const Point &p) const {\n\n    return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;\n  }\n};\n\ntypedef Point Vector;\n\nstruct Segment {\n\n  Point p1, p2;\n};\n\ndouble dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }\n\ndouble cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }\n\nbool parareru(Point a, Point b, Point c, Point d) {\n\n  return abs(cross(a - b, d - c)) < EPS;\n}\n\ndouble distance_ls_p(Point a, Point b, Point c) {\n\n  if (dot(b - a, c - a) < EPS)\n    return (c - a).absv();\n\n  if (dot(a - b, c - b) < EPS)\n    return (c - b).absv();\n\n  return abs(cross(b - a, c - a)) / (b - a).absv();\n}\n\nbool is_intersected_ls(Segment a, Segment b) {\n\n  if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)\n    return false;\n\n  if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&\n      parareru((a.p2), (a.p1), (a.p1), (b.p1))) {\n\n    if (dot(a.p1 - b.p1, a.p1 - b.p2) < EPS)\n      return true;\n\n    if (dot(a.p2 - b.p1, a.p2 - b.p2) < EPS)\n      return true;\n\n    if (dot(a.p1 - b.p1, a.p2 - b.p1) < EPS)\n      return true;\n\n    if (dot(a.p1 - b.p2, a.p2 - b.p2) < EPS)\n      return true;\n\n    return false;\n\n  }\n\n  else\n    return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <\n            EPS) &&\n           (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <\n            EPS);\n}\n\ndouble segment_dis(Segment a, Segment b) {\n\n  if (is_intersected_ls(a, b))\n    return 0;\n\n  double r = distance_ls_p(a.p1, a.p2, b.p1);\n\n  r = min(r, distance_ls_p(a.p1, a.p2, b.p2));\n\n  r = min(r, distance_ls_p(b.p1, b.p2, a.p2));\n\n  r = min(r, distance_ls_p(b.p1, b.p2, a.p1));\n\n  return r;\n}\n\nPoint intersection_ls(Segment a, Segment b) {\n\n  Point ba = b.p2 - b.p1;\n\n  double d1 = abs(cross(ba, a.p1 - b.p1));\n\n  double d2 = abs(cross(ba, a.p2 - b.p1));\n\n  double t = d1 / (d1 + d2);\n\n  return a.p1 + (a.p2 - a.p1) * t;\n}\n\nstring itos(int i) {\n\n  ostringstream s;\n\n  s << i;\n\n  return s.str();\n}\n\nint gcd(int v, int b) {\n\n  if (v > b)\n    return gcd(b, v);\n\n  if (v == b)\n    return b;\n\n  if (b % v == 0)\n    return v;\n\n  return gcd(v, b % v);\n}\n\ndouble distans(double x1, double y1, double x2, double y2) {\n\n  double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n\n  return sqrt(rr);\n}\n\nint beki(int wa, int rr, int warukazu) {\n\n  if (rr == 0)\n    return 1ll;\n\n  if (rr == 1)\n    return wa % warukazu;\n\n  if (rr % 2 == 1)\n    return (beki(wa, rr - 1, warukazu) * wa) % warukazu;\n\n  int zx = beki(wa, rr / 2, warukazu);\n\n  return (zx * zx) % warukazu;\n}\n\nint par[200100], ranks[200100], kosuu[200100];\n\nvoid shoki(int n) {\n\n  for (int i = 0; i < n; i++) {\n\n    par[i] = i;\n\n    ranks[i] = 0;\n\n    kosuu[i] = 1;\n  }\n}\n\nint root(int x) { return par[x] == x ? x : par[x] = root(par[x]); }\n\nbool same(int x, int y) { return root(x) == root(y); }\n\nvoid unite(int x, int y) {\n\n  x = root(x);\n\n  y = root(y);\n\n  int xx = kosuu[x], yy = kosuu[y];\n\n  if (x == y)\n    return;\n\n  if (ranks[x] < ranks[y]) {\n\n    par[x] = y;\n\n    kosuu[y] = yy + xx;\n\n  }\n\n  else {\n\n    par[y] = x;\n\n    if (ranks[x] == ranks[y])\n      ranks[x] = ranks[x] + 1;\n\n    kosuu[x] = yy + xx;\n  }\n\n  return;\n}\n\nint a[2000][2000] = {0};\n\nint k;\n\nvoid nu(int e, int h, int zure) {\n\n  for (int i = zure; i < zure + k; i++) {\n\n    a[e + (i % k)][h + i - zure] = 1;\n  }\n}\n\nint l[200020], r[200020];\n\nint kasa[100030] = {0};\n\nint imo[100030] = {0};\n\nint sumi[100030] = {0};\n\nint rootari[100030] = {0};\n\nint ans[100040] = {0};\n\nsigned main() {\n\n  string s;\n\n  cin >> s;\n\n  int len = s.length();\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> l[i] >> r[i];\n\n    l[i]--;\n\n    r[i]--;\n  }\n\n  for (int i = 0; i < len / 2; i++) {\n\n    l[n] = i;\n\n    r[n] = len - 1 - i;\n\n    n++;\n  }\n\n  if (len % 2 == 1) {\n\n    l[n] = len / 2;\n\n    r[n] = len / 2;\n\n    n++;\n  }\n\n  for (int i = 0; i < len / 2; i++) {\n\n    if (s[i] <= s[len - 1 - i])\n      kasa[i] = s[len - i - 1] - s[i];\n\n    else\n      kasa[len - i - 1] = -s[len - i - 1] + s[i];\n  }\n\n  imo[0] = kasa[0];\n\n  for (int i = 1; i <= len; i++)\n    imo[i] = kasa[i] - kasa[i - 1];\n\n  shoki(100020);\n\n  for (int i = 0; i < n; i++) {\n\n    unite(l[i], r[i] + 1);\n\n    sumi[l[i]] = 1;\n\n    sumi[r[i] + 1] = 1;\n  }\n\n  for (int i = 0; i <= len; i++) {\n\n    ans[root(i)] += imo[i];\n  }\n\n  for (int i = 0; i <= len; i++)\n    rootari[root(i)] = 1;\n\n  bool b = true;\n\n  for (int i = 0; i <= len; i++) {\n\n    if (rootari[i] == 0)\n      continue;\n\n    if (sumi[i] == 0 && (ans[i] % 26) != 0)\n      b = false;\n\n    if (sumi[i] == 1 && (ans[i] % 26) != 0)\n      b = false;\n  }\n\n  cout << (b ? \"YES\" : \"NO\") << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define int long long\n\n#define inf 1000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<double, double>\n\n#define ppap pair<pa, int>\n\n#define PI 3.14159265358979323846\n\n#define paa pair<int, char>\n\n#define mp make_pair\n\n#define pb push_back\n\n#define EPS (1e-8)\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};\n\nusing namespace std;\n\nclass pa3 {\n\npublic:\n  int x;\n\n  int y, z;\n\n  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n\n  bool operator<(const pa3 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    return z < p.z;\n  }\n\n  bool operator>(const pa3 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    return z > p.z;\n  }\n\n  bool operator==(const pa3 &p) const {\n\n    return x == p.x && y == p.y && z == p.z;\n  }\n\n  bool operator!=(const pa3 &p) const {\n\n    return !(x == p.x && y == p.y && z == p.z);\n  }\n};\n\nclass pa4 {\n\npublic:\n  int x;\n\n  int y, z, w;\n\n  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n\n  bool operator<(const pa4 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    if (z != p.z)\n      return z < p.z;\n\n    return w < p.w;\n  }\n\n  bool operator>(const pa4 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    if (z != p.z)\n      return z > p.z;\n\n    return w > p.w;\n  }\n\n  bool operator==(const pa4 &p) const {\n\n    return x == p.x && y == p.y && z == p.z && w == p.w;\n  }\n};\n\nclass pa2 {\n\npublic:\n  int x, y;\n\n  pa2(int x = 0, int y = 0) : x(x), y(y) {}\n\n  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n\n  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n\n  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }\n\n  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const pa2 &p) const {\n\n    return abs(x - p.x) == 0 && abs(y - p.y) == 0;\n  }\n\n  bool operator!=(const pa2 &p) const {\n\n    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);\n  }\n};\n\nstring itos(int i) {\n\n  ostringstream s;\n\n  s << i;\n\n  return s.str();\n}\n\nint gcd(int v, int b) {\n\n  if (v == 0)\n    return b;\n\n  if (b == 0)\n    return v;\n\n  if (v > b)\n    return gcd(b, v);\n\n  if (v == b)\n    return b;\n\n  if (b % v == 0)\n    return v;\n\n  return gcd(v, b % v);\n}\n\nint mod;\n\nint extgcd(int a, int b, int &x, int &y) {\n\n  if (b == 0) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n  }\n\n  int d = extgcd(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\npa operator+(const pa &l, const pa &r) {\n\n  return {l.first + r.first, l.second + r.second};\n}\n\npa operator-(const pa &l, const pa &r) {\n\n  return {l.first - r.first, l.second - r.second};\n}\n\nint pr[1000010];\n\nint inv[1000010];\n\nint beki(int wa, int rr, int warukazu) {\n\n  if (rr == 0)\n    return 1 % warukazu;\n\n  if (rr == 1)\n    return wa % warukazu;\n\n  wa %= warukazu;\n\n  if (rr % 2 == 1)\n    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;\n\n  ll zx = beki(wa, rr / 2, warukazu);\n\n  return (zx * zx) % warukazu;\n}\n\nint comb(int nn, int rr) {\n\n  if (rr < 0 || rr > nn || nn < 0)\n    return 0;\n\n  int r = pr[nn] * inv[rr];\n\n  r %= mod;\n\n  r *= inv[nn - rr];\n\n  r %= mod;\n\n  return r;\n}\n\nvoid gya(int ert) {\n\n  pr[0] = 1;\n\n  for (int i = 1; i <= ert; i++) {\n\n    pr[i] = (pr[i - 1] * i) % mod;\n  }\n\n  inv[ert] = beki(pr[ert], mod - 2, mod);\n\n  for (int i = ert - 1; i >= 0; i--) {\n\n    inv[i] = inv[i + 1] * (i + 1) % mod;\n  }\n}\n\nstruct unionfind {\n\nprivate:\npublic:\n  vector<int> par, ranks, kosuu;\n\n  void shoki(int N) {\n\n    par.resize(N + 1, 0);\n\n    ranks.resize(N + 1, 0);\n\n    kosuu.resize(N + 1, 1);\n\n    for (int i = 0; i <= N; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int root(int x) { return par[x] == x ? x : par[x] = root(par[x]); }\n\n  bool same(int x, int y) { return root(x) == root(y); }\n\n  bool is_root(int x) { return x == root(x); }\n\n  void unite(int x, int y) {\n\n    x = root(x);\n\n    y = root(y);\n\n    int xx = kosuu[x], yy = kosuu[y];\n\n    if (x == y)\n      return;\n\n    if (ranks[x] < ranks[y]) {\n\n      par[x] = y;\n\n      kosuu[y] = yy + xx;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      if (ranks[x] == ranks[y])\n        ranks[x] = ranks[x] + 1;\n\n      kosuu[x] = yy + xx;\n    }\n\n    return;\n  }\n};\n\nint l;\n\nint g(int x) { return min(x, l + 2 - x); }\n\nint sa[100020];\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  string s;\n\n  cin >> s;\n\n  l = s.length();\n\n  s = \" \" + s;\n\n  s[0] = 'a';\n\n  unionfind uf;\n\n  for (int i = 1; i <= l; i++) {\n\n    sa[i] = s[i] - s[i - 1] + 26;\n  }\n\n  sa[l + 1] = ('a' - s.back() + 26);\n\n  uf.shoki(l + 100);\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    y++;\n\n    x = g(x), y = g(y);\n\n    if (x == y)\n      continue;\n\n    uf.unite(x, y);\n  }\n\n  int h = (l + 2) / 2;\n\n  map<int, int> ma;\n\n  for (int i = 1; i <= l + 1; i++) {\n\n    int r = uf.root(g(i));\n\n    ma[r] += sa[i];\n  }\n\n  for (auto it = ma.begin(); it != ma.end(); it++) {\n\n    int y = (*it).second;\n\n    y = abs(y);\n\n    if (y % 26) {\n\n      cout << \"NO\" << endl;\n\n      return 0;\n    }\n  }\n\n  cout << \"YES\" << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"c16c28753293b56bc67d4fef71841edb2a295086ce43a9f9edbbd9ead359cdc0","fast_id":"bce5f1fb4174ea45ca1fba5f888bb774b4df500469e1bf120fb23e7d810d54e6","fast_time":0.0199777947,"language":"cpp","measured_fast_code_id":"bce5f1fb4174ea45ca1fba5f888bb774b4df500469e1bf120fb23e7d810d54e6","measured_slow_code_id":"64583d459b94302353e95f541745fe4f8d0c7f64fb061fc226ad238382a30f19","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18430","problem_id":"p02269","slow_code_id":"e261be9e9a775755782d700ef178e3347347402808b68f2d25e35c91ad5e97e8","slow_id":"64583d459b94302353e95f541745fe4f8d0c7f64fb061fc226ad238382a30f19","slow_time":0.9777148309,"speedup":48.94007800070145,"stratum":"8+","sampling_key":"deb385b17f166c469b28ceadb4410ad8359d191bf1563b5a7768ff57a9300ac2","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <cstring>\n\nusing namespace std;\n\nconst int MAXT = 1000003;\n\nconst int MAXN = 1000010;\n\nint n;\n\nstring s;\n\nint head[1000003], nex[MAXN], to[MAXN], top, top1, ans[MAXN];\n\nvoid input()\n\n{\n\n  cin >> n;\n\n  memset(head, -1, sizeof(head));\n\n  memset(nex, -1, sizeof(nex));\n}\n\nint jisuan(char c)\n\n{\n\n  if (c == 'A')\n    return 1;\n\n  if (c == 'C')\n    return 2;\n\n  if (c == 'G')\n    return 3;\n\n  if (c == 'T')\n    return 4;\n}\n\nvoid insert(int k)\n\n{\n\n  nex[top] = head[k % MAXT];\n\n  head[k % MAXT] = top;\n\n  to[top++] = k;\n}\n\nint k(string ss)\n\n{\n\n  int s(1);\n\n  int sum(0);\n\n  for (int i = 0; i < ss.size(); i++)\n\n  {\n\n    sum += s * jisuan(ss[i]);\n\n    s *= 5;\n  }\n\n  return sum;\n}\n\nbool ff(int k)\n\n{\n\n  int u = head[k % MAXT];\n\n  while (u != -1)\n\n  {\n\n    if (to[u] == k)\n      return true;\n\n    u = nex[u];\n  }\n\n  return false;\n}\n\nvoid xxj()\n\n{\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> s;\n\n    if (s == \"insert\") {\n\n      cin >> s;\n\n      int tmp = k(s);\n\n      insert(tmp);\n\n    }\n\n    else {\n\n      cin >> s;\n\n      int tmp = k(s);\n\n      ans[top1++] = ff(tmp);\n    }\n  }\n}\n\nvoid output()\n\n{\n\n  for (int i = 0; i < top1; i++)\n\n    if (ans[i])\n      cout << \"yes\" << '\\n';\n\n    else\n      cout << \"no\" << '\\n';\n}\n\nint main()\n\n{\n\n  input();\n\n  xxj();\n\n  output();\n\n  return 0;\n}","fast_code":"#define INF 48828125 + 100\n\n#include <cstdio>\n\n#include <cstring>\n\nint pow[] = {1, 5, 25, 125, 625, 3125, 15615, 78125, 390625, 1953125, 9765625};\n\nbool hash[INF];\n\nint HASH(char s[])\n\n{\n\n  int h(0);\n\n  for (int i = strlen(s) - 1; i >= 0; --i)\n\n  {\n\n    if (s[i] == 'A')\n\n      h += 1 * pow[i];\n\n    if (s[i] == 'C')\n\n      h += 2 * pow[i];\n\n    if (s[i] == 'G')\n\n      h += 3 * pow[i];\n\n    if (s[i] == 'T')\n\n      h += 4 * pow[i];\n  }\n\n  return h;\n}\n\nint main()\n\n{\n\n  int N;\n\n  scanf(\"%d\", &N);\n\n  for (int i = 0; i < N; ++i)\n\n  {\n\n    char oper[7], data[13];\n\n    scanf(\"%s%s\", oper, data);\n\n    if (oper[0] == 'i')\n\n      hash[HASH(data)] = true;\n\n    else\n\n      hash[HASH(data)] ? printf(\"yes\\n\") : printf(\"no\\n\");\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"221f94e697f583172c5960c247d1ed11d65323d35b7622df07709c6e80582fc9","fast_id":"21141f1c509a0418be8e8ebc5e37c4dbaa39efd7e8cdfff6c0dddb18a77b044a","fast_time":0.0904598563,"language":"cpp","measured_fast_code_id":"21141f1c509a0418be8e8ebc5e37c4dbaa39efd7e8cdfff6c0dddb18a77b044a","measured_slow_code_id":"4da9c02790e19d1dbf6c0c7c626905eacd2b4ffa80e6b6630322a739bd704e48","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18617","problem_id":"p03055","slow_code_id":"ec429beef614c107e8200c687b5c8ea7326d02d97f260b0d068ee296f381f84f","slow_id":"4da9c02790e19d1dbf6c0c7c626905eacd2b4ffa80e6b6630322a739bd704e48","slow_time":0.6442234035,"speedup":7.121649644937585,"stratum":"4-8","sampling_key":"a6fddd2d3840d863366019f327a6292573f26953344b7e3ec509d73f2b0bfede","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing uint = unsigned int;\n\nusing ll = long long;\n\nusing ld = long double;\n\nusing ull = unsigned long long;\n\nusing pii = pair<int, int>;\n\nusing pll = pair<ll, ll>;\n\n#define dbg(x) cerr << #x \": \" << (x) << endl\n\n#define dbg_p(x) cerr << #x \": \" << (x).first << ' ' << (x).second << endl\n\n#define dbg_v(x, n)                                                            \\\n  {                                                                            \\\n    cerr << #x \"[]: \";                                                         \\\n    for (long long _ = 0; _ < n; ++_)                                          \\\n      cerr << (x)[_] << ' ';                                                   \\\n    cerr << endl;                                                              \\\n  }\n\n#define all(v) v.begin(), v.end()\n\n#define fi first\n\n#define se second\n\ntemplate <typename T1, typename T2>\n\nostream &operator<<(ostream &out, const pair<T1, T2> &item) {\n\n  out << '(' << item.first << \", \" << item.second << ')';\n\n  return out;\n}\n\ntemplate <typename T>\n\nostream &operator<<(ostream &out, const vector<T> &v) {\n\n  for (const auto &item : v)\n    out << item << ' ';\n\n  return out;\n}\n\nconst int N = 200010;\n\nint node, dst;\n\nbool win[N];\n\nvector<int> adj[N];\n\nvoid dfs(int v, int p = -1, int depth = 0) {\n\n  if (depth >= dst)\n    node = v, dst = depth;\n\n  for (auto u : adj[v])\n    if (u != p)\n      dfs(u, v, depth + 1);\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  int n, a, b;\n\n  win[0] = true;\n\n  for (int i = 1; i < N; ++i) {\n\n    if (!win[i - 1])\n      win[i] = true;\n\n    else if (i > 1 && !win[i - 2])\n      win[i] = true;\n\n    else\n      win[i] = false;\n  }\n\n  cin >> n;\n\n  for (int i = 1; i < n; ++i) {\n\n    cin >> a >> b;\n\n    adj[a].push_back(b);\n\n    adj[b].push_back(a);\n  }\n\n  dfs(1);\n\n  dst = 0;\n\n  dfs(node);\n\n  cout << (win[dst] ? \"First\" : \"Second\") << '\\n';\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nconst int maxn = 202020;\n\nstruct Edge {\n\n  int to;\n\n  int last;\n\n} a[maxn << 1];\n\nint n, m;\n\nint tot;\n\nint d[maxn];\n\nint head[maxn];\n\ninline void HA(int x, int y)\n\n{\n\n  a[++tot] = {y, head[x]};\n\n  head[x] = tot;\n\n  a[++tot] = {x, head[y]};\n\n  head[y] = tot;\n}\n\n#define y a[i].to\n\ninline void Dfs(int x, int prt) {\n\n  for (int i = head[x]; i; i = a[i].last)\n\n    if (y != prt)\n      d[y] = d[x] + 1, Dfs(y, x);\n\n  if (d[x] > d[m])\n    m = x;\n}\n\n#undef y\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1, x, y; i < n; ++i)\n\n  {\n\n    scanf(\"%d%d\", &x, &y);\n\n    HA(x, y);\n  }\n\n  m = 0, Dfs(1, 0);\n\n  int temp = m;\n  d[m] = 0;\n\n  m = 0, Dfs(temp, 0);\n\n  puts(d[m] % 3 == 1 ? \"Second\" : \"First\");\n\n  return 0;\n}"}
{"fast_code_id":"eb809820424168045078782e3c75384cbf4023a5050f038c9403a742a9ffef71","fast_id":"d6a32974d9dec63742d1f172bbd8f2ec4704d8d50717571ab2b2b0a244a7a610","fast_time":0.0235559218,"language":"cpp","measured_fast_code_id":"d6a32974d9dec63742d1f172bbd8f2ec4704d8d50717571ab2b2b0a244a7a610","measured_slow_code_id":"fec3847be79b27c899c268ddaaf812c336f15682172722b8ab2129b0f2188e45","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18702","problem_id":"p03802","slow_code_id":"17ee2314e9cfa0b46c196b8752fe30c4ecb530f6170a8fa79009c05012b21569","slow_id":"fec3847be79b27c899c268ddaaf812c336f15682172722b8ab2129b0f2188e45","slow_time":0.2701586279,"speedup":11.46882003573301,"stratum":"8+","sampling_key":"b0e83c57ef072bdc6dc33a3e456ce77f82190265ce03198a1abbbd8ffd626ccf","slow_code":"#include <cmath>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define fo(i, a, b) for (int i = a; i <= b; i++)\n\n#define fd(i, b, a) for (int i = b; i >= a; i--)\n\n#define efo(i, v, u) for (int i = last[v], u = to[last[v]]; i; i = nxt[i], u = to[i])\n\n#define max(x, y) ((x) > (y) ? (x) : (y))\n\n#define min(x, y) ((x) < (y) ? (x) : (y))\n\n#define mset(a, x) memset(a, x, sizeof(a))\n\nusing namespace std;\n\ntypedef long long ll;\n\nvoid read(int &n)\n\n{\n\n  int t = 0, p = 1;\n  char ch;\n\n  for (ch = getchar(); !('0' <= ch && ch <= '9'); ch = getchar())\n\n    if (ch == '-')\n      p = -1;\n\n  for (; '0' <= ch && ch <= '9'; ch = getchar())\n    t = t * 10 + ch - '0';\n\n  n = t * p;\n}\n\nconst int N = 4e5 + 5, M = 7000005;\n\nint n, nn, rtn, tot, ext, b[N][2];\n\nstruct node\n\n{\n\n  int x, id;\n\n} a[N];\n\nbool cmp(node a, node b) { return a.x < b.x; }\n\nint m, co[N], to[M], nxt[M], last[N], list[N], L[N], R[N];\n\nvoid link(int u, int v)\n\n{\n\n  to[++m] = v, nxt[m] = last[u], last[u] = m;\n}\n\nbool dfs(int v)\n\n{\n\n  if (v <= tot && co[v ^ 1])\n    return 0;\n\n  if (v <= tot && co[v])\n    return 1;\n\n  co[v] = 1;\n\n  list[++list[0]] = v;\n\n  efo(i, v, u) if (!co[u])\n\n      if (!dfs(u)) return 0;\n\n  return 1;\n}\n\nbool check(int lim)\n\n{\n\n  m = 0;\n  mset(last, 0);\n\n  fo(i, 1, n)\n\n  {\n\n    link(b[i + i - 1][0], b[i + i][1]), link(b[i + i][1], b[i + i - 1][0]);\n\n    link(b[i + i - 1][1], b[i + i][0]), link(b[i + i][0], b[i + i - 1][1]);\n  }\n\n  fo(i, 1, rtn)\n\n      fo(j, L[i], R[i]) link(tot + i, b[a[j].id][0]);\n\n  int l = 1, r = 1;\n\n  fo(i, 1, nn)\n\n  {\n\n    while (l < nn && a[i].x - a[l].x >= lim)\n      ++l;\n\n    while (r < nn && a[r + 1].x - a[i].x < lim)\n      ++r;\n\n    int ql = min(rtn, (l - 1) / rtn + 1), qr = min(rtn, (r - 1) / rtn + 1),\n        qi = min(rtn, (i - 1) / rtn + 1);\n\n    if (ql == qr)\n\n    {\n\n      fo(j, l, r)\n\n          if (j != i) link(b[a[i].id][1], b[a[j].id][0]);\n\n    }\n\n    else\n\n    {\n\n      if (ql == qi)\n\n        fo(j, l, i - 1) link(b[a[i].id][1], b[a[j].id][0]);\n\n      else\n\n      {\n\n        fo(j, l, R[ql]) link(b[a[i].id][1], b[a[j].id][0]);\n\n        fo(j, ql + 1, qi - 1) link(b[a[i].id][1], tot + j);\n\n        fo(j, L[qi], i - 1) link(b[a[i].id][1], b[a[j].id][0]);\n      }\n\n      if (qi == qr)\n\n        fo(j, i + 1, r) link(b[a[i].id][1], b[a[j].id][0]);\n\n      else\n\n      {\n\n        fo(j, i + 1, R[qi]) link(b[a[i].id][1], b[a[j].id][0]);\n\n        fo(j, qi + 1, qr - 1) link(b[a[i].id][1], tot + j);\n\n        fo(j, L[qr], r) link(b[a[i].id][1], b[a[j].id][0]);\n      }\n    }\n  }\n\n  mset(co, 0);\n\n  fo(i, 1, tot)\n\n  {\n\n    int x = i + i - 1;\n\n    if (!co[b[x][0]] && !co[b[x][1]])\n\n    {\n\n      list[0] = 0;\n\n      if (!dfs(b[x][0]))\n\n      {\n\n        fo(j, 1, list[0]) co[list[j]] = 0;\n\n        list[0] = 0;\n\n        if (!dfs(b[x][1]))\n          return 0;\n      }\n    }\n  }\n\n  return 1;\n}\n\nnamespace Prog2 {\n\nconst int N = 10010;\n\nint m = 0, n;\n\nint v[N << 1], f[N << 1];\n\ninline bool ok(int x) {\n\n  v[0] = -1e9;\n\n  memset(f, 0, sizeof f);\n  f[0] = 0;\n\n  int j = 1;\n\n  for (int i = 1; i <= m; ++i) {\n\n    while (v[j] <= v[i] - x)\n      ++j;\n\n    if (v[j] > v[i] - x)\n      --j;\n\n    f[i] = max(f[i - 1], f[j] + 1);\n  }\n\n  return f[m] >= n;\n}\n\n}                   \n\nint main()\n\n{\n\n  int x, y;\n\n  read(n);\n  nn = n + n;\n  Prog2::n = n;\n\n  fo(i, 1, n) read(a[i + i - 1].x), read(a[i + i].x), Prog2::m += 2;\n\n  tot = 1;\n\n  fo(i, 1, nn) a[i].id = i, b[i][0] = ++tot, b[i][1] = ++tot;\n\n  rtn = sqrt(nn);\n\n  fo(i, 1, rtn - 1) L[i] = 1 + rtn * (i - 1), R[i] = rtn * i;\n\n  L[rtn] = 1 + rtn * (rtn - 1), R[rtn] = nn;\n\n  sort(a + 1, a + nn + 1, cmp);\n\n  fo(i, 1, n + n) Prog2::v[i] = a[i].x;\n\n  int l = 0, r = a[nn].x;\n\n  while (l < r - 1) {\n\n    int M = (l + r) >> 1;\n\n    if (Prog2::ok(M))\n      l = M;\n\n    else\n      r = M;\n  }\n\n  l = 0;\n\n  while (l < r - 1)\n\n  {\n\n    int mid = (l + r) >> 1;\n\n    if (check(mid))\n      l = mid;\n\n    else\n      r = mid;\n  }\n\n  printf(\"%d\\n\", l);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define fo(i, a, b) for (int i = a; i <= b; i++)\n\n#define fd(i, a, b) for (int i = a; i >= b; i--)\n\n#define rep(i, a) for (int i = last[a]; i; i = next_[i])\n\nusing namespace std;\n\nint read() {\n\n  char ch;\n\n  for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())\n    ;\n\n  int x = ch - '0';\n\n  for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())\n    x = x * 10 + ch - '0';\n\n  return x;\n}\n\nconst int N = 1e6 + 5, inf = 1e9;\n\nstruct pty {\n  int x, y, id;\n} a[N], b[N];\n\nbool cmpx(pty a, pty b) { return a.x < b.x; }\n\nbool cmpy(pty a, pty b) { return a.y < b.y; }\n\nint last[N], now[N], next_[N], t[N], l, cnt;\n\nvoid add(int x, int y) {\n\n  t[++l] = y;\n  next_[l] = last[x];\n  last[x] = l;\n}\n\nnamespace Prog2 {\n\nconst int N = 10010;\n\nint m = 0, n;\n\nint v[N << 1], f[N << 1];\n\ninline bool ok(int x) {\n\n  v[0] = -1e9;\n\n  memset(f, 0, sizeof f);\n  f[0] = 0;\n\n  int j = 1;\n\n  for (int i = 1; i <= m; ++i) {\n\n    while (v[j] <= v[i] - x)\n      ++j;\n\n    if (v[j] > v[i] - x)\n      --j;\n\n    f[i] = max(f[i - 1], f[j] + 1);\n  }\n\n  return f[m] >= n;\n}\n\n}                   \n\nint n, tot;\n\nvoid init() {\n\n  Prog2::n = n = read();\n  Prog2::m = tot = 2 * n;\n\n  fo(i, 1, n) {\n\n    a[i].x = read();\n    a[i].y = read();\n    a[i].id = i;\n\n    b[i].x = a[i].x;\n    b[i].y = a[i].y;\n    b[i].id = i;\n\n    Prog2::v[i + i - 1] = a[i].x;\n\n    Prog2::v[i + i] = a[i].y;\n  }\n}\n\nint rootx, rooty, le[N], ri[N];\n\nvoid build(int &v, int l, int r, int flag) {\n\n  if (l == r) {\n\n    v = (flag == 1) ? (a[l].id + n) : b[l].id;\n\n    return;\n  }\n\n  v = ++tot;\n\n  int mid = l + r >> 1;\n\n  build(le[v], l, mid, flag);\n\n  build(ri[v], mid + 1, r, flag);\n\n  add(v, le[v]);\n  add(v, ri[v]);\n}\n\nvoid link(int v, int l, int r, int x, int y, int z) {\n\n  if (x > y)\n    return;\n\n  if (l == x && r == y) {\n    add(z, v);\n    return;\n  }\n\n  int mid = l + r >> 1;\n\n  if (y <= mid)\n    link(le[v], l, mid, x, y, z);\n\n  else if (x > mid)\n    link(ri[v], mid + 1, r, x, y, z);\n\n  else\n    link(le[v], l, mid, x, mid, z), link(ri[v], mid + 1, r, mid + 1, y, z);\n}\n\nvoid prepare() {\n\n  sort(Prog2::v + 1, Prog2::v + Prog2::m + 1);\n\n  sort(a + 1, a + n + 1, cmpx);\n\n  build(rootx, 1, n, 1);\n\n  sort(b + 1, b + n + 1, cmpy);\n\n  build(rooty, 1, n, 2);\n\n  fo(i, 1, tot) now[i] = last[i];\n  cnt = l;\n}\n\nint dfn[N], low[N], stack[N], cl[N], tmp, top, id;\n\nbool vis[N], in[N];\n\nvoid tarjan(int x) {\n\n  vis[x] = in[x] = 1;\n  dfn[x] = low[x] = ++tmp;\n  stack[++top] = x;\n\n  rep(i, x)\n\n      if (!vis[t[i]]) {\n\n    tarjan(t[i]);\n\n    low[x] = min(low[x], low[t[i]]);\n  }\n  else if (in[t[i]]) low[x] = min(low[x], dfn[t[i]]);\n\n  if (low[x] == dfn[x]) {\n\n    stack[top + 1] = 0;\n    ++id;\n\n    for (; stack[top + 1] != x; top--) {\n\n      in[stack[top]] = 0;\n\n      cl[stack[top]] = id;\n    }\n  }\n}\n\nbool check(int mid) {\n\n  int lx, rx;\n\n  fo(i, 1, tot) last[i] = now[i];\n  l = cnt;\n\n  lx = 1, rx = 1;\n\n  fo(i, 1, n) {\n\n    while (lx < i && a[i].x - a[lx].x >= mid)\n      lx++;\n\n    while (rx <= n && a[rx].x - a[i].x < mid)\n      rx++;\n\n    link(rootx, 1, n, lx, i - 1, a[i].id);\n\n    link(rootx, 1, n, i + 1, rx - 1, a[i].id);\n  }\n\n  lx = 1, rx = 1;\n\n  fo(i, 1, n) {\n\n    while (lx <= n && b[i].y - a[lx].x >= mid)\n      lx++;\n\n    while (rx <= n && a[rx].x - b[i].y < mid)\n      rx++;\n\n    link(rootx, 1, n, lx, rx - 1, b[i].id + n);\n  }\n\n  lx = 1, rx = 1;\n\n  fo(i, 1, n) {\n\n    while (lx <= n && a[i].x - b[lx].y >= mid)\n      lx++;\n\n    while (rx <= n && b[rx].y - a[i].x < mid)\n      rx++;\n\n    link(rooty, 1, n, lx, rx - 1, a[i].id);\n  }\n\n  lx = 1, rx = 1;\n\n  fo(i, 1, n) {\n\n    while (lx < i && b[i].y - b[lx].y >= mid)\n      lx++;\n\n    while (rx <= n && b[rx].y - b[i].y < mid)\n      rx++;\n\n    link(rooty, 1, n, lx, i - 1, b[i].id + n);\n\n    link(rooty, 1, n, i + 1, rx - 1, b[i].id + n);\n  }\n\n  tmp = top = id = 0;\n\n  fo(i, 1, tot) vis[i] = cl[i] = dfn[i] = low[i] = 0;\n\n  fo(i, 1, tot) if (!vis[i]) tarjan(i);\n\n  fo(i, 1, n) if (cl[i] == cl[i + n]) return 0;\n\n  return 1;\n}\n\nvoid solve() {\n\n  int l = 0, r = inf;\n\n  while (l < r - 1) {\n\n    int mid = l + r >> 1;\n\n    if (Prog2::ok(mid))\n      l = mid;\n\n    else\n      r = mid;\n  }\n\n  l = 0;\n\n  while (l < r) {\n\n    int mid = l + r >> 1;\n\n    if (check(mid))\n      l = mid + 1;\n\n    else\n      r = mid;\n  }\n\n  printf(\"%d\\n\", l - 1);\n}\n\nint main() {\n\n  init();\n\n  prepare();\n\n  solve();\n\n  return 0;\n}"}
{"fast_code_id":"4ae8f9ef36b3c44f42346427542bb78801e1972ca909b0b3e0bc71cc681ca9b5","fast_id":"23c7c926f3a778d8de5da371b9b9084fd727e8d083d844070079dc8e9d399f8a","fast_time":0.1077517856,"language":"cpp","measured_fast_code_id":"23c7c926f3a778d8de5da371b9b9084fd727e8d083d844070079dc8e9d399f8a","measured_slow_code_id":"c56b32b1fcd38cb2b3294a337e23ce5bb0cd98a43827a7977ae9ad8e873ca315","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18719","problem_id":"p01080","slow_code_id":"fe53c5387e214f8e2740cf3d849e3ad8041a20e6b10cc3fb2f87d2e054ba4e36","slow_id":"c56b32b1fcd38cb2b3294a337e23ce5bb0cd98a43827a7977ae9ad8e873ca315","slow_time":0.3734058614,"speedup":3.465426204500875,"stratum":"2-4","sampling_key":"767f9359cbbf89926e7652a1c00e6021c5642d0b6182c09e3d9678cf7b4b7293","slow_code":"#define __USE_MINGW_ANSI_STDIO 0\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\n#define int ll\n\nusing VI = vector<int>;\n\nusing VVI = vector<VI>;\n\nusing PII = pair<int, int>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define ALL(x) x.begin(), x.end()\n\n#define PB push_back\n\nconst ll LLINF = (1LL << 60);\n\nconst int INF = (1LL << 30);\n\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\n\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\n\ntemplate <typename T> bool IN(T a, T b, T x) { return a <= x && x < b; }\n\ntemplate <typename T> T ceil(T a, T b) { return a / b + !!(a % b); }\n\ntemplate <class S, class T>\n\nostream &operator<<(ostream &out, const pair<S, T> &a) {\n\n  out << '(' << a.first << ',' << a.second << ')';\n\n  return out;\n}\n\ntemplate <class T>\n\nostream &operator<<(ostream &out, const vector<T> &a) {\n\n  out << '[';\n\n  REP(i, a.size()) {\n    out << a[i];\n    if (i != a.size() - 1)\n      out << ',';\n  }\n\n  out << ']';\n\n  return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nVI g[100010];\n\nsigned main(void)\n\n{\n\n  int n;\n\n  cin >> n;\n\n  REP(i, n - 1) {\n\n    int u, v;\n\n    cin >> u >> v;\n\n    u--, v--;\n\n    g[u].PB(v);\n\n    g[v].PB(u);\n  }\n\n  VI dist(n);\n\n  function<void(int, int)> dfs1 = [&](int v, int p) {\n    for (int &i : g[v])\n      if (i != p) {\n\n        dfs1(i, v);\n\n        chmax(dist[v], dist[i] + 1);\n      }\n  };\n\n  dfs1(0, -1);\n\n  VI ans(n);\n\n  function<void(int, int, int)> dfs2 = [&](int v, int pval, int p) {\n    vector<PII> d_child;\n\n    d_child.PB({0, -1});\n\n    for (int &i : g[v]) {\n\n      if (i == p)\n        d_child.PB({pval + 1, i});\n\n      else\n        d_child.PB({dist[i] + 1, i});\n    }\n\n    sort(ALL(d_child), greater<>());\n\n    ans[v] = d_child[0].first;\n\n    for (int &i : g[v])\n      if (i != p) {\n\n        dfs2(i, d_child[d_child[0].second == i].first, v);\n      }\n  };\n\n  dfs2(0, 0, -1);\n\n  REP(i, n) cout << 2 * (n - 1) - ans[i] << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define ALL(x) x.begin(), x.end()\n\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\n\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\n\nstruct FastIO {\n  FastIO() {\n    cin.tie(0);\n    ios::sync_with_stdio(0);\n  }\n} fastiofastio;\n\n#ifdef DEBUG_\n\n#include \"../program_contest_library/memo/dump.hpp\"\n\n#else\n\n#define dump(...)\n\n#endif\n\nconst ll INF = 1LL << 60;\n\ntemplate <class T, class W>\n\nclass rerooting {\n\nprivate:\n  struct edge {\n\n    ll to, rev;\n\n    W w;\n  };\n\n  const ll n;\n\n  vector<vector<edge>> g;\n\n  vector<vector<T>> ldp, rdp;\n\n  vector<ll> lptr, rptr;\n\n  const function<T(T, T)> merge;\n\n  const function<T(T, W)> add;\n\n  const T id;\n\n  T dfs(ll v, ll p) {\n\n    while (lptr[v] != p && lptr[v] < (ll)g[v].size()) {\n\n      edge &e = g[v][lptr[v]];\n\n      ldp[v][lptr[v] + 1] = merge(ldp[v][lptr[v]], add(dfs(e.to, e.rev), e.w));\n\n      lptr[v]++;\n    }\n\n    while (rptr[v] != p && rptr[v] >= 0) {\n\n      edge &e = g[v][rptr[v]];\n\n      rdp[v][rptr[v]] = merge(add(dfs(e.to, e.rev), e.w), rdp[v][rptr[v] + 1]);\n\n      rptr[v]--;\n    }\n\n    if (p < 0)\n      return rdp[v][0];\n\n    return merge(ldp[v][p], rdp[v][p + 1]);\n  }\n\npublic:\n  rerooting(ll n, function<T(T, T)> merge, function<T(T, W)> add, T id)\n      : n(n), g(n), ldp(n), rdp(n), lptr(n), rptr(n), merge(merge), add(add), id(id) {}\n\n  void add_edge(ll u, ll v, W w) {\n\n    g[u].push_back({v, (ll)g[v].size(), w});\n\n    g[v].push_back({u, (ll)g[u].size() - 1, w});\n  }\n\n  vector<T> build() {\n\n    REP(i, n) {\n\n      ldp[i].assign(g[i].size() + 1, id);\n\n      rdp[i].assign(g[i].size() + 1, id);\n\n      lptr[i] = 0;\n\n      rptr[i] = (ll)g[i].size() - 1;\n    }\n\n    vector<T> ans;\n\n    REP(i, n) ans.emplace_back(dfs(i, -1));\n\n    return ans;\n  }\n};\n\nint main(void) {\n\n  ll n;\n\n  cin >> n;\n\n  auto merge = [&](ll l, ll r) { return max(l, r); };\n\n  auto add = [&](ll v, ll w) { return v + w; };\n\n  rerooting<ll, ll> graph(n, merge, add, 0);\n\n  REP(i, n - 1) {\n\n    ll u, v;\n\n    cin >> u >> v;\n\n    u--, v--;\n\n    graph.add_edge(u, v, 1);\n  }\n\n  auto ans = graph.build();\n\n  REP(i, n) cout << 2 * (n - 1) - ans[i] << \"\\n\";\n\n  return 0;\n}\n"}
{"fast_code_id":"f93e13ba29f3146ab39c2db3a55deec468b86884fb65bdaf480059d83b96903c","fast_id":"7875117de66474293c1e79dae08f5962379cef11f1e56a10fec11405dbc1955f","fast_time":0.104951372,"language":"cpp","measured_fast_code_id":"7875117de66474293c1e79dae08f5962379cef11f1e56a10fec11405dbc1955f","measured_slow_code_id":"dc43f279e36f6fcad33fca9053ec6a5308b27e5bcb4a9535837c4c9c2637b4ea","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18727","problem_id":"p03483","slow_code_id":"863b9c25b79219a3259523945fb63a7ccc2c7a57716bda51e74f065424a9041f","slow_id":"dc43f279e36f6fcad33fca9053ec6a5308b27e5bcb4a9535837c4c9c2637b4ea","slow_time":0.2970794204,"speedup":2.8306387495344034,"stratum":"2-4","sampling_key":"c42a0dc985c84039b45e34e4af01157c619db0fbe7325c145138baa520061b0f","slow_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <cstring>\n\n#include <vector>\n\n#define ll long long\n\n#define debug cout << \"debug\" << endl;\n\nusing namespace std;\n\nconst int maxn = 2e5 + 50;\n\nchar s[maxn];\n\nint c[maxn], cnt[maxn], ok, n;\n\nbool vis[maxn];\n\nvector<int> loc[30];\n\nint lowbit(int x) { return x & (-x); }\n\nvoid add(int x, int d) {\n\n  for (int i = x; i <= n; i += lowbit(i)) {\n\n    c[i] += d;\n  }\n}\n\nint sum(int x) {\n\n  int ret = 0;\n\n  for (int i = x; i > 0; i -= lowbit(i)) {\n\n    ret += c[i];\n  }\n\n  return ret;\n}\n\nint main() {\n\n  scanf(\"%s\", s + 1);\n\n  n = strlen(s + 1);\n\n  memset(c, 0, sizeof(c));\n\n  memset(cnt, 0, sizeof(cnt));\n\n  memset(vis, 0, sizeof(vis));\n\n  ok = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    cnt[s[i] - 'a']++;\n\n    loc[s[i] - 'a'].push_back(i);\n  }\n\n  for (int i = 0; i < 26; i++) {\n\n    if (cnt[i] % 2)\n      ok++;\n  }\n\n  if (ok > 1) {\n\n    printf(\"-1\\n\");\n\n    return 0;\n  }\n\n  for (int i = 1; i <= n + 1; i++) {\n\n    add(i, 1);\n  }\n\n  ll ans = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (vis[i])\n      continue;\n\n    int c = s[i] - 'a';\n\n    int loc_right = loc[c].back();\n\n    if (loc_right == i) {\n\n      ans += (sum(n) - sum(loc_right)) >> 1;\n\n    }\n\n    else {\n\n      ans += sum(n) - sum(loc_right);\n    }\n\n    loc[c].pop_back();\n\n    add(i, -1);\n\n    add(loc_right, -1);\n\n    vis[i] = vis[loc_right] = true;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <stdlib.h>\n\n#include <math.h>\n\n#include <time.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <string>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <vector>\n\nusing namespace std;\n\n#define bll long long\n\n#define dou double\n\n#define For(i, a, b) for (int i = (a), _##i = (b); i <= _##i; ++i)\n\n#define Rof(i, a, b) for (int i = (a), _##i = (b); i >= _##i; --i)\n\n#define Mem(a, b) memset(a, b, sizeof(a))\n\n#define Cpy(a, b) memcpy(a, b, sizeof(b))\n\nconst int maxn = 2e5 + 100;\n\nint N;\n\nchar s[maxn];\n\nint match[maxn];\n\nvector<int> pos[30];\n\nint tr[maxn];\n\nvoid add(int x, int v, int len, int a[])\n\n{\n\n  for (int i = x; i <= len; i += (i & (-i)))\n    a[i] += v;\n}\n\nint que(int x, int a[])\n\n{\n\n  int ret = 0;\n\n  for (int i = x; i; i -= (i & (-i)))\n    ret += a[i];\n\n  return ret;\n}\n\nlong long solve()\n\n{\n\n  static int p[maxn];\n\n  static int num[maxn];\n\n  long long ans = 0;\n\n  int tot = 0;\n\n  int m = 0;\n\n  For(i, 1, N)\n\n  {\n\n    if (match[i] > i)\n\n    {\n\n      num[i] = num[match[i]] = ++tot;\n\n      ans += i - tot;\n\n    }\n\n    else if (match[i] < i)\n\n    {\n\n      p[++m] = num[i];\n\n    }\n\n    else\n\n    {\n\n      p[++m] = (N >> 1) + 1;\n    }\n  }\n\n  memset(tr, 0, sizeof(tr[0]) * (m + 2));\n\n  For(i, 1, m)\n\n  {\n\n    ans += que(p[i], tr);\n\n    add(p[i], 1, m, tr);\n  }\n\n  return ans;\n}\n\nint main()\n\n{\n\n  for (; scanf(\"%s\", s + 1) != EOF;)\n\n  {\n\n    N = strlen(s + 1);\n\n    For(i, 0, 25) pos[i].clear();\n\n    For(i, 1, N) pos[s[i] - 'a'].push_back(i);\n\n    int odd = 0;\n\n    For(i, 0, 25)\n\n    {\n\n      if (((int)pos[i].size()) & 1)\n        ++odd;\n\n      int j = 0, k = pos[i].size() - 1;\n\n      for (; j <= k; ++j, --k)\n        match[pos[i][j]] = pos[i][k], match[pos[i][k]] = pos[i][j];\n    }\n\n    if (odd > 1)\n\n    {\n\n      printf(\"-1\\n\");\n\n    }\n\n    else\n\n    {\n\n      printf(\"%lld\\n\", solve());\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"2f09cc72c73e787988a90cdbdb6542328df3b8300eead92cc841d2c192c9637a","fast_id":"b1822961e81575a25c2559bf2c07deb57e526a4a0b559bdcfc59f2a38751e1cb","fast_time":0.0213867417,"language":"cpp","measured_fast_code_id":"b1822961e81575a25c2559bf2c07deb57e526a4a0b559bdcfc59f2a38751e1cb","measured_slow_code_id":"dfbd4265615984d411a62dc8b98a32977956f9046d04ec33b21fde4f9e2142c1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18728","problem_id":"p01418","slow_code_id":"ef8f9ec2ae561a3c89da9ee065148bf318964db9ee220ec1431ed4e5b878eb3c","slow_id":"dfbd4265615984d411a62dc8b98a32977956f9046d04ec33b21fde4f9e2142c1","slow_time":0.1065268313,"speedup":4.980975260013544,"stratum":"4-8","sampling_key":"23f7e92f4e9f3c7cb06c26dc6c0917e05aff19396c5037ab9d1721396001411a","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <queue>\n\n#include <vector>\n\n#include <stack>\n\n#include <set>\n\n#include <map>\n\n#include <string>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <string>\n\n#include <numeric>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <ctime>\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef unsigned long long uLL;\n\nint day[33];\n\ndouble low, high;\n\nLL sum = 0;\n\ndouble P, E, T;\n\ndouble Tp;\n\nint K;\n\ndouble res;\n\nvoid gao(int u, int ntp, int tp, double R, double L)\n\n{\n\n  double H = (R + L) / 2;\n\n  if (R >= low && L <= high)\n\n  {\n\n    res += pow(1 - P, ntp) * pow(P, tp);\n\n    return;\n  }\n\n  if (R > high || L < low)\n    return;\n\n  if (u == K)\n\n  {\n\n    Tp = H;\n\n    if (low <= Tp && Tp <= high)\n\n    {\n\n      res += pow(1 - P, ntp) * pow(P, tp);\n    }\n\n    return;\n  }\n\n  if (H >= T)\n\n  {\n\n    gao(u + 1, ntp + 1, tp, R, H);\n\n    gao(u + 1, ntp, tp + 1, H, L);\n\n  }\n\n  else\n\n  {\n\n    gao(u + 1, ntp, tp + 1, R, H);\n\n    gao(u + 1, ntp + 1, tp, H, L);\n  }\n}\n\ndouble R, L;\n\nint main()\n\n{\n\n  while (~scanf(\"%d%lf%lf\", &K, &R, &L))\n\n  {\n\n    scanf(\"%lf%lf%lf\", &P, &E, &T);\n\n    low = max(0.0, T - E);\n\n    high = T + E;\n\n    res = 0;\n\n    gao(0, 0, 0, R, L);\n\n    printf(\"%lf\\n\", res);\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <cstring>\n\ndouble P, E, T;\n\ndouble fabs(double x) {\n\n  if (x < 0)\n    x = -x;\n\n  return x;\n}\n\ndouble dfs(int k, double pro, double L, double R) {\n\n  if (k == 0) {\n\n    double mid = (L + R) / 2;\n\n    if (fabs(mid - T) <= E)\n      return pro;\n\n    return 0;\n  }\n\n  if (T + E < L || T - E > R)\n    return 0;\n\n  double ans = 0;\n\n  double mid = (L + R) / 2;\n\n  if (fabs(R - T) <= E && fabs(T - L) <= E)\n    return pro;\n\n  if (mid >= T) {\n\n    ans += dfs(k - 1, pro * (1 - P), L, mid);\n\n    ans += dfs(k - 1, pro * P, mid, R);\n\n  }\n\n  else {\n\n    ans += dfs(k - 1, pro * P, L, mid);\n\n    ans += dfs(k - 1, pro * (1 - P), mid, R);\n  }\n\n  return ans;\n}\n\nint main() {\n\n  int K;\n\n  double L, R;\n\n  scanf(\"%d %lf %lf\", &K, &L, &R);\n\n  scanf(\"%lf %lf %lf\", &P, &E, &T);\n\n  double ans = dfs(K, 1.0, L, R);\n\n  printf(\"%lf\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"6139644457283c37dcea75084a5d89528dccefbdf7dc423ba5b720082e63f0e4","fast_id":"c760911d47ea6c6b3d602e99259d76fda01015c2161996c0221c69a9722ea5b7","fast_time":0.0425885123,"language":"cpp","measured_fast_code_id":"c760911d47ea6c6b3d602e99259d76fda01015c2161996c0221c69a9722ea5b7","measured_slow_code_id":"0aa57f823f76180417ce5693ddd77e1e606ae41bb31962d88242af871bb4a300","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18740","problem_id":"p02349","slow_code_id":"6ea55e41956da1006984f407aba365dd821adf928ec531f784b8fc7c91ea4028","slow_id":"0aa57f823f76180417ce5693ddd77e1e606ae41bb31962d88242af871bb4a300","slow_time":0.1804433231,"speedup":4.236901299320568,"stratum":"4-8","sampling_key":"d27f9d9febd0afbcdb7bdbf03fb6bcf5e75936eaae871cf0193602782012925a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef unsigned long long ull;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<double, double> pdd;\n\nconst ull mod = 1e9 + 7;\n\n#define REP(i, n) for (int i = 0; i < (int)n; ++i)\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n\n#define debug(x)                                                                                   \\\n  cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\"                                           \\\n       << \" \" << __FILE__ << endl;\n\ntemplate <typename T>\n\nvoid vprint(T &v) {\n\n  REP(i, v.size()) { cout << v[i] << \" \"; }\n\n  cout << endl;\n}\n\nconst ll N_MAX = 202020;\n\nstruct RAQSB {\n\n  ll N;\n\n  ll sN;\n\n  ll data[N_MAX];\n\n  ll bucket[N_MAX];\n\n  RAQSB(ll n) {\n\n    sN = (ll)sqrt(n) + 1;\n\n    N = sN * sN;\n\n    REP(i, N_MAX) {\n\n      data[i] = 0;\n\n      bucket[i] = 0;\n    }\n  }\n\n  void add(ll s, ll t, ll x) {\n\n    ll ss = s / sN;\n\n    ll tt = t / sN;\n\n    if (ss == tt) {\n\n      for (int i = s; i < t; i++) {\n\n        data[i] += x;\n      }\n\n    } else {\n\n      for (int i = s; i < (ss + 1) * sN; i++) {\n\n        data[i] += x;\n      }\n\n      for (int i = tt * sN; i < t; i++) {\n\n        data[i] += x;\n      }\n\n      for (int i = ss + 1; i < tt; i++) {\n\n        bucket[i] += x;\n      }\n    }\n  }\n\n  ll get_val(ll i) { return data[i] + bucket[i / sN]; }\n};\n\nint main() {\n\n  ll n, q;\n\n  cin >> n >> q;\n\n  RAQSB raqsb(n);\n\n  REP(i, q) {\n\n    ll a, b, c, d;\n\n    cin >> a;\n\n    if (a == 0) {\n\n      cin >> b >> c >> d;\n\n      b--;\n      c--;\n\n      raqsb.add(b, c + 1, d);\n\n    } else {\n\n      cin >> b;\n\n      b--;\n\n      cout << raqsb.get_val(b) << endl;\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef unsigned long long ull;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<double, double> pdd;\n\nconst ull mod = 1e9 + 7;\n\n#define REP(i, n) for (int i = 0; i < (int)n; ++i)\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n\n#define debug(x)                                                                                   \\\n  cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\"                                           \\\n       << \" \" << __FILE__ << endl;\n\ntemplate <class S, class T> ostream &operator<<(ostream &os, const pair<S, T> v) {\n\n  os << \"(\" << v.first << \", \" << v.second << \")\";\n  return os;\n}\n\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> v) {\n\n  for (int i = 0; i < (int)v.size(); i++) {\n    if (i > 0) {\n      os << \" \";\n    }\n    os << v[i];\n  }\n  return os;\n}\n\ntemplate <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {\n\n  for (int i = 0; i < (int)v.size(); i++) {\n    if (i > 0) {\n      os << endl;\n    }\n    os << v[i];\n  }\n  return os;\n}\n\ntemplate <typename Monoid, typename OperatorMonoid, typename F, typename G, typename H>\n\nstruct LazySegmentTree {\n\n  int sz, height;\n\n  vector<Monoid> data;\n\n  vector<OperatorMonoid> lazy;\n\n  const F f;\n\n  const G g;\n\n  const H h;\n\n  const Monoid M1;\n\n  const OperatorMonoid OM0;\n\n  LazySegmentTree(int n, const F f, const G g, const H h,\n\n                  const Monoid &M1, const OperatorMonoid OM0)\n\n      : f(f), g(g), h(h), M1(M1), OM0(OM0) {\n\n    sz = 1;\n\n    height = 0;\n\n    while (sz < n)\n      sz <<= 1, height++;\n\n    data.assign(2 * sz, M1);\n\n    lazy.assign(2 * sz, OM0);\n  }\n\n  void set(int k, const Monoid &x) { data[k + sz] = x; }\n\n  void build() {\n\n    for (int k = sz - 1; k > 0; k--) {\n\n      data[k] = f(data[2 * k + 0], data[2 * k + 1]);\n    }\n  }\n\n  inline void propagate(int k) {\n\n    if (lazy[k] != OM0) {\n\n      lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);\n\n      lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);\n\n      data[k] = reflect(k);\n\n      lazy[k] = OM0;\n    }\n  }\n\n  inline Monoid reflect(int k) { return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]); }\n\n  inline void recalc(int k) {\n\n    while (k >>= 1)\n      data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));\n  }\n\n  inline void thrust(int k) {\n\n    for (int i = height; i > 0; i--)\n      propagate(k >> i);\n  }\n\n  void update(int a, int b, const OperatorMonoid &x) {\n\n    thrust(a += sz);\n\n    thrust(b += sz - 1);\n\n    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n\n      if (l & 1)\n        lazy[l] = h(lazy[l], x), ++l;\n\n      if (r & 1)\n        --r, lazy[r] = h(lazy[r], x);\n    }\n\n    recalc(a);\n\n    recalc(b);\n  }\n\n  Monoid query(int a, int b) {\n\n    thrust(a += sz);\n\n    thrust(b += sz - 1);\n\n    Monoid L = M1, R = M1;\n\n    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n\n      if (l & 1)\n        L = f(L, reflect(l++));\n\n      if (r & 1)\n        R = f(reflect(--r), R);\n    }\n\n    return f(L, R);\n  }\n\n  Monoid operator[](const int &k) { return query(k, k + 1); }\n\n  template <typename C>\n\n  int find_subtree(int a, const C &check, Monoid &M, bool type) {\n\n    while (a < sz) {\n\n      propagate(a);\n\n      Monoid nxt = type ? f(reflect(2 * a + type), M) : f(M, reflect(2 * a + type));\n\n      if (check(nxt))\n        a = 2 * a + type;\n\n      else\n        M = nxt, a = 2 * a + 1 - type;\n    }\n\n    return a - sz;\n  }\n\n  template <typename C>\n\n  int find_first(int a, const C &check) {\n\n    Monoid L = M1;\n\n    if (a <= 0) {\n\n      if (check(f(L, reflect(1))))\n        return find_subtree(1, check, L, false);\n\n      return -1;\n    }\n\n    thrust(a + sz);\n\n    int b = sz;\n\n    for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n\n      if (a & 1) {\n\n        Monoid nxt = f(L, reflect(a));\n\n        if (check(nxt))\n          return find_subtree(a, check, L, false);\n\n        L = nxt;\n\n        ++a;\n      }\n    }\n\n    return -1;\n  }\n\n  template <typename C>\n\n  int find_last(int b, const C &check) {\n\n    Monoid R = M1;\n\n    if (b >= sz) {\n\n      if (check(f(reflect(1), R)))\n        return find_subtree(1, check, R, true);\n\n      return -1;\n    }\n\n    thrust(b + sz - 1);\n\n    int a = sz;\n\n    for (b += sz; a < b; a >>= 1, b >>= 1) {\n\n      if (b & 1) {\n\n        Monoid nxt = f(reflect(--b), R);\n\n        if (check(nxt))\n          return find_subtree(b, check, R, true);\n\n        R = nxt;\n      }\n    }\n\n    return -1;\n  }\n};\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  ll n, q;\n\n  cin >> n >> q;\n\n  auto f = [](ll x, ll y) { return min(x, y); };\n\n  auto g = [](ll x, ll a) { return x + a; };\n\n  auto h = [](ll a, ll b) { return a + b; };\n\n  ll M1 = (1ll << 60);\n\n  ll OM0 = 0;\n\n  LazySegmentTree<ll, ll, decltype(f), decltype(g), decltype(h)> seg(n, f, g, h, M1, OM0);\n\n  REP(i, n) seg.set(i, 0);\n\n  seg.build();\n\n  while (q--) {\n\n    ll Q;\n\n    cin >> Q;\n\n    if (Q) {\n\n      ll idx;\n\n      cin >> idx;\n\n      idx--;\n\n      cout << seg[idx] << endl;\n\n    } else {\n\n      ll s, t, x;\n\n      cin >> s >> t >> x;\n\n      s--, t--;\n\n      seg.update(s, t + 1, x);\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"11db758235111de19962b4c3846dbea7be3f6c6ccd0509906f40cf32f629d31f","fast_id":"3581f74465cd381ac58e9e338b9748601bff2b6265ed4c9e8148acbadf886a02","fast_time":0.0980842025,"language":"cpp","measured_fast_code_id":"3581f74465cd381ac58e9e338b9748601bff2b6265ed4c9e8148acbadf886a02","measured_slow_code_id":"7253c9402e6f6d307d0de83ea2005a6c16ebe4e62a9b992d2db9c1fccd7b3b72","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18743","problem_id":"p03714","slow_code_id":"1f60d803c5b6b2d5e26cf58f064bf152b072de1fc7c45e2615f26548dd48b6ac","slow_id":"7253c9402e6f6d307d0de83ea2005a6c16ebe4e62a9b992d2db9c1fccd7b3b72","slow_time":0.6275135103,"speedup":6.397702120277728,"stratum":"4-8","sampling_key":"f826f4a1c041ec4aab80424f68e35f3d619b25691f2478e5b620bd57207dcbcd","slow_code":"#include <cmath>\n\n#include <queue>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <algorithm>\n\n#define mod 1000000007\n\nusing namespace std;\n\nint n;\n\nlong long dp1[300010], dp2[300010], a[300010], sum1, sum2;\n\npriority_queue<long long, vector<long long>, greater<long long> > q;\n\npriority_queue<long long> q2;\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  memset(dp1, 0, sizeof(dp1));\n\n  memset(dp2, 0x3f, sizeof(dp2));\n\n  for (int i = 1; i <= 3 * n; i++)\n\n  {\n\n    scanf(\"%lld\", &a[i]);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    q.push(a[i]);\n\n    sum1 += a[i];\n  }\n\n  dp1[n] = sum1;\n\n  for (int i = n + 1; i <= 3 * n; i++)\n\n  {\n\n    if (q.top() < a[i])\n\n    {\n\n      sum1 -= q.top();\n\n      sum1 += a[i];\n\n      q.pop();\n\n      q.push(a[i]);\n    }\n\n    dp1[i] = sum1;\n  }\n\n  for (int i = 3 * n; i > 2 * n; i--)\n\n  {\n\n    q2.push(a[i]);\n\n    sum2 += a[i];\n  }\n\n  dp2[2 * n + 1] = sum2;\n\n  for (int i = 2 * n; i >= 1; i--)\n\n  {\n\n    if (q2.top() > a[i])\n\n    {\n\n      sum2 -= q2.top();\n\n      sum2 += a[i];\n\n      q2.pop();\n\n      q2.push(a[i]);\n    }\n\n    dp2[i] = sum2;\n  }\n\n  long long ans = -0x3f3f3f3f3f3f3f3f;\n\n  for (int i = n; i <= 2 * n; i++)\n\n  {\n\n    ans = max(ans, dp1[i] - dp2[i + 1]);\n  }\n\n  printf(\"%lld\\n\", ans);\n}","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <string>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <map>\n\n#include <vector>\n\n#include <queue>\n\n#define LL long long\n\nusing namespace std;\n\nconst int MaxN = 1e5;\n\nconst LL Inf = 1LL << 60;\n\npriority_queue<LL> q2;\n\npriority_queue<LL, vector<LL>, greater<LL> > q1;\n\nLL sum[3 * MaxN + 5], cas[3 * MaxN + 5], a[3 * MaxN + 5];\n\nLL sum2[3 * MaxN + 5], cas2[3 * MaxN + 5];\n\nint main()\n\n{\n\n  LL pp, ans;\n\n  int n;\n\n  while (~scanf(\"%d\", &n)) {\n\n    ans = -Inf;\n\n    sum[0] = 0;\n    cas[n] = 0;\n\n    for (int i = 1; i <= n; i++) {\n\n      scanf(\"%lld\", &a[i]);\n\n      sum[i] = sum[i - 1] + a[i];\n\n      q1.push(a[i]);\n    }\n\n    for (int i = n + 1; i <= 2 * n; i++) {\n\n      scanf(\"%lld\", &a[i]);\n\n      sum[i] = sum[i - 1] + a[i];\n\n      q1.push(a[i]);\n\n      pp = q1.top();\n\n      cas[i] = cas[i - 1] + pp;\n\n      q1.pop();\n    }\n\n    for (int i = 2 * n + 1; i <= 3 * n; i++) {\n\n      scanf(\"%lld\", &a[i]);\n    }\n\n    sum2[3 * n + 1] = 0;\n    cas2[2 * n + 1] = 0;\n\n    for (int i = 3 * n; i >= 2 * n + 1; i--) {\n\n      sum2[i] = sum2[i + 1] + a[i];\n\n      q2.push(a[i]);\n    }\n\n    for (int i = 2 * n; i >= n + 1; i--) {\n\n      sum2[i] = sum2[i + 1] + a[i];\n\n      q2.push(a[i]);\n\n      pp = q2.top();\n\n      cas2[i] = cas2[i + 1] + pp;\n\n      q2.pop();\n    }\n\n    for (int i = n; i <= 2 * n; i++) {\n\n      pp = sum[i] - cas[i] - sum2[i + 1] + cas2[i + 1];\n\n      ans = max(pp, ans);\n    }\n\n    printf(\"%lld\\n\", ans);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"847c07a1fa57ad6f93036aa39471ee11faa012a19d7949aa3324f7ac7091d712","fast_id":"b0323351199abcae9ea72d8201780e04c432234a2610622f6cad43a8880ac04c","fast_time":0.085216514,"language":"cpp","measured_fast_code_id":"b0323351199abcae9ea72d8201780e04c432234a2610622f6cad43a8880ac04c","measured_slow_code_id":"4721e7bc5c1f0d22ca1e7b11ee5488eb2f1df481e511b5ce29a285137f87bd01","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18750","problem_id":"p02604","slow_code_id":"0d3f8e694e37038791225351c37c3c117c4530a135a4f7597d061595a6209b6f","slow_id":"4721e7bc5c1f0d22ca1e7b11ee5488eb2f1df481e511b5ce29a285137f87bd01","slow_time":0.734852724,"speedup":8.623360537841293,"stratum":"8+","sampling_key":"eb183d8131de9899d42160986e5e841a447af6a12b92cda2442c116874329cbc","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define REP(i, n) for (int i = 0, _n = (int)(n); i < _n; ++i)\n\n#define ALL(v) (v).begin(), (v).end()\n\n#define CLR(t, v) memset(t, (v), sizeof(t))\n\ntemplate <class T1, class T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &a) {\n  return os << \"(\" << a.first << \",\" << a.second << \")\";\n}\n\ntemplate <class T> void pv(T a, T b) {\n  for (T i = a; i != b; ++i)\n    cout << (*i) << \" \";\n  cout << endl;\n}\n\ntemplate <class T> void chmin(T &a, const T &b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <class T> void chmax(T &a, const T &b) {\n  if (a < b)\n    a = b;\n}\n\nll nextLong() {\n  ll x;\n  scanf(\"%lld\", &x);\n  return x;\n}\n\nconst int MAX_N = 15;\n\nll X[MAX_N], Y[MAX_N], P[MAX_N];\n\nconst ll INF = 1LL << 61;\n\nll ans[MAX_N];\n\nint N;\n\nll cx[1 << MAX_N][MAX_N];\n\nll cy[1 << MAX_N][MAX_N];\n\nconst ll BIG = 1e9;\n\nvoid calcX(int s) {\n\n  if (cx[s][0] != -1)\n    return;\n\n  vector<ll> xs;\n\n  xs.push_back(0);\n  xs.push_back(-BIG);\n  xs.push_back(BIG);\n\n  REP(i, N) if (s >> i & 1) xs.push_back(X[i]);\n\n  sort(ALL(xs));\n  xs.erase(unique(ALL(xs)), xs.end());\n\n  REP(i, N) {\n\n    auto it = lower_bound(ALL(xs), X[i]);\n\n    ll xx = min(abs(X[i] - *it), abs(X[i] - *(prev(it))));\n\n    cx[s][i] = xx;\n  }\n}\n\nvoid calcY(int s) {\n\n  if (cy[s][0] != -1)\n    return;\n\n  vector<ll> xs;\n\n  xs.push_back(0);\n  xs.push_back(-BIG);\n  xs.push_back(BIG);\n\n  REP(i, N) if (s >> i & 1) xs.push_back(Y[i]);\n\n  sort(ALL(xs));\n  xs.erase(unique(ALL(xs)), xs.end());\n\n  REP(i, N) {\n\n    auto it = lower_bound(ALL(xs), Y[i]);\n\n    ll xx = min(abs(Y[i] - *it), abs(Y[i] - *(prev(it))));\n\n    cy[s][i] = xx;\n  }\n}\n\nint main2() {\n\n  CLR(cx, -1);\n\n  CLR(cy, -1);\n\n  N = nextLong();\n\n  REP(i, N) {\n\n    X[i] = nextLong();\n\n    Y[i] = nextLong();\n\n    P[i] = nextLong();\n  }\n\n  REP(i, N + 1) ans[i] = INF;\n\n  {\n\n    ll val = 0;\n\n    REP(i, N) val += P[i] * min(abs(X[i]), abs(Y[i]));\n\n    ans[0] = val;\n  }\n\n  const int L = pow(3, N);\n\n  for (int l = 0; l < L; l++) {\n\n    int s = 0;\n\n    int t = 0;\n\n    int k = 0;\n\n    int tmp = l;\n\n    REP(i, N) {\n\n      if (tmp % 3 == 1) {\n        s |= (1 << i);\n        k++;\n      }\n\n      if (tmp % 3 == 2) {\n        t |= (1 << i);\n        k++;\n      }\n\n      tmp /= 3;\n    }\n\n    calcX(s);\n\n    calcY(t);\n\n    ll val = 0;\n\n    REP(i, N) {\n\n      ll xx = cx[s][i];\n\n      ll yy = cy[t][i];\n\n      val += P[i] * min(xx, yy);\n    }\n\n    chmin(ans[k], val);\n  }\n\n  REP(i, N + 1)\n\n  cout << ans[i] << endl;\n\n  return 0;\n}\n\nint main() {\n\n#ifdef LOCAL\n\n  for (; !cin.eof(); cin >> ws)\n\n#endif\n\n    main2();\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define REP(i, n) for (int i = 0, _n = (int)(n); i < _n; ++i)\n\n#define ALL(v) (v).begin(), (v).end()\n\n#define CLR(t, v) memset(t, (v), sizeof(t))\n\ntemplate <class T1, class T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &a) {\n  return os << \"(\" << a.first << \",\" << a.second << \")\";\n}\n\ntemplate <class T> void pv(T a, T b) {\n  for (T i = a; i != b; ++i)\n    cout << (*i) << \" \";\n  cout << endl;\n}\n\ntemplate <class T> void chmin(T &a, const T &b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <class T> void chmax(T &a, const T &b) {\n  if (a < b)\n    a = b;\n}\n\nll nextLong() {\n  ll x;\n  scanf(\"%lld\", &x);\n  return x;\n}\n\nconst ll INF = 1LL << 61;\n\nconst int MAX_N = 15;\n\nint N;\n\nll X[MAX_N], Y[MAX_N], P[MAX_N];\n\nll ans[MAX_N];\n\nll dp1[MAX_N + 1][MAX_N + 1];\n\nll dp2[MAX_N + 1][MAX_N + 1];\n\nll rec(const vector<pair<ll, ll>> &at, ll dp[MAX_N + 1][MAX_N + 1], int R,\n       int K) {\n\n  if (dp[R][K] != -1)\n    return dp[R][K];\n\n  ll res = INF;\n\n  if (R <= K) {\n    chmin(res, 0LL);\n  }\n\n  else if (K == 0) {\n\n    ll val = 0;\n\n    for (int i = 0; i < R; i++) {\n\n      val += at[i].second * abs(at[i].first);\n    }\n\n    chmin(res, val);\n\n  } else if (K >= 1) {\n\n    for (int L = 0; L < R; L++) {\n\n      for (int z = L; z < R; z++) {\n\n        ll val = 0;\n\n        for (int i = L; i < R; i++) {\n\n          val += at[i].second * abs(at[i].first - at[z].first);\n        }\n\n        chmin(res, val + rec(at, dp, L, K - 1));\n      }\n    }\n\n    for (int L = 0; L < R; L++) {\n\n      ll val = 0;\n\n      for (int i = L; i < R; i++) {\n\n        val += at[i].second * abs(at[i].first);\n      }\n\n      chmin(res, val + rec(at, dp, L, K));\n    }\n  }\n\n  return dp[R][K] = res;\n}\n\nint main2() {\n\n  N = nextLong();\n\n  REP(i, N) {\n\n    X[i] = nextLong();\n\n    Y[i] = nextLong();\n\n    P[i] = nextLong();\n  }\n\n  REP(i, N + 1) ans[i] = INF;\n\n  REP(s, 1 << N) {\n\n    vector<pair<ll, ll>> x, y;\n\n    REP(i, N)\n\n    if (s >> i & 1)\n      x.push_back({X[i], P[i]});\n\n    else\n      y.push_back({Y[i], P[i]});\n\n    sort(ALL(x));\n\n    sort(ALL(y));\n\n    CLR(dp1, -1);\n\n    CLR(dp2, -1);\n\n    for (int a = 0; a <= N; a++) {\n\n      for (int b = 0; b + a <= N; b++) {\n\n        ll cost1 = rec(x, dp1, x.size(), a);\n\n        ll cost2 = rec(y, dp2, y.size(), b);\n\n        chmin(ans[a + b], cost1 + cost2);\n      }\n    }\n  }\n\n  REP(i, N + 1)\n\n  cout << ans[i] << endl;\n\n  return 0;\n}\n\nint main() {\n\n#ifdef LOCAL\n\n  for (; !cin.eof(); cin >> ws)\n\n#endif\n\n    main2();\n\n  return 0;\n}"}
{"fast_code_id":"0584776dfd2768ceb964d088e55c6701aaf19b27a58f83a3d4663cb7d7958cff","fast_id":"d2f7617a168c85bda88994e4c36ec183d98ea5b6d06651dd4224c71fe17eb2d4","fast_time":0.1063995146,"language":"cpp","measured_fast_code_id":"d2f7617a168c85bda88994e4c36ec183d98ea5b6d06651dd4224c71fe17eb2d4","measured_slow_code_id":"7ef4118352124e761bb739533b54f2698242c6ec27ab54af3d7fcf8de77f111d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1876","problem_id":"p02548","slow_code_id":"3b790c44c02fd5e08f8b90bf5e483383e121cf67ff34aa1e8ec440ad8d4a7b6f","slow_id":"7ef4118352124e761bb739533b54f2698242c6ec27ab54af3d7fcf8de77f111d","slow_time":0.3254501871,"speedup":3.058756314100704,"stratum":"2-4","sampling_key":"6cbdab09fa049aa59da4272dc75d1ae9fcec02aba6eb54a088fb5b7e3943062c","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define MODV 1000000007\n\n#define INFLL (1LL << 62)\n\n#define EPS 1e-9\n\n#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)\n\n#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)\n\n#define all(v) v.begin(), v.end()\n\n#define endl \"\\n\"\n\n#define vi vector<ll>\n\n#define vvi vector<vector<ll>>\n\n#define Yes() cout << \"Yes\" << endl\n\n#define YES() cout << \"YES\" << endl\n\n#define No() cout << \"No\" << endl\n\n#define NO() cout << \"NO\" << endl\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nusing namespace std;\n\nll primeFactorize(long long n) {\n\n  ll sum = 1;\n\n  vector<pair<long long, long long>> ret;\n\n  for (long long i = 2; i * i <= n; i++) {\n\n    if (n % i != 0)\n      continue;\n\n    long long ex = 0;\n\n    while (n % i == 0) {\n      ex++;\n      n /= i;\n    }\n\n    sum *= (ex + 1);\n  }\n\n  if (n != 1)\n    sum *= 2;\n\n  return sum;\n}\n\nint main() {\n\n  ll n;\n\n  cin >> n;\n\n  vector<bool> chkPrime(1000001, true);\n\n  for (long long i = 2; i <= 1000001; i++) {\n\n    if (chkPrime[i]) {\n\n      for (long long j = 2 * i; j <= n; j += i)\n        chkPrime[j] = false;\n    }\n  }\n\n  chkPrime[1] = false;\n\n  vi isOK(n + 1, 0);\n\n  ll ans = 0;\n\n  for (ll c = 1; c < n; c++) {\n\n    ll tn = n - c, p = 1;\n\n    if (chkPrime[tn]) {\n\n      ans += 2;\n\n      continue;\n    }\n\n    ans += primeFactorize(tn);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define MODV 1000000007\n\n#define INFLL (1LL << 62)\n\n#define EPS 1e-9\n\n#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)\n\n#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)\n\n#define all(v) v.begin(), v.end()\n\n#define endl \"\\n\"\n\n#define vi vector<ll>\n\n#define vvi vector<vector<ll>>\n\n#define Yes() cout << \"Yes\" << endl\n\n#define YES() cout << \"YES\" << endl\n\n#define No() cout << \"No\" << endl\n\n#define NO() cout << \"NO\" << endl\n\n#define Init()                                                                 \\\n  std::ios::sync_with_stdio(false);                                            \\\n  std::cin.tie(0);                                                             \\\n  std::cout << fixed << setprecision(15);\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nusing namespace std;\n\nint main() {\n\n  Init();\n\n  ll n;\n\n  cin >> n;\n\n  ll sum = 0;\n\n  for (ll i = 1; i <= n - 1; i++)\n    sum += (ll)floor((double)(n - 1) / i);\n\n  cout << sum << endl;\n}"}
{"fast_code_id":"867b7bb81b8f292950d2bbb2f537692a4458d8a5ba82c471bf815eec3bab8121","fast_id":"4fd6decf611a6ad0d76f0edab9b6e73a4f2b420215ace7de76f5f297bb95767b","fast_time":0.1333126795,"language":"cpp","measured_fast_code_id":"4fd6decf611a6ad0d76f0edab9b6e73a4f2b420215ace7de76f5f297bb95767b","measured_slow_code_id":"1eaa5c67b4284f0a89ca23ed2689ef020531c55976dde5b9d78f1f13fd9a7638","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18765","problem_id":"p03305","slow_code_id":"b572d96c724963ba3359d702a9797b32ffc8bce9b8df49ac0e60b88e30224e92","slow_id":"1eaa5c67b4284f0a89ca23ed2689ef020531c55976dde5b9d78f1f13fd9a7638","slow_time":0.398428793,"speedup":2.9886789050699414,"stratum":"2-4","sampling_key":"90a76a8220c3768170b1fd444a6effe67c2657e483ee8ec8473314655734e7ce","slow_code":"#include <cstdio>\n\n#include <queue>\n\n#include <vector>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int Maxn = 1e5;\n\nconst long long Tot = 1e15;\n\ntypedef long long ll;\n\nstruct Edge {\n\n  int v;\n\n  ll m[2];\n\n  Edge(int a, int b, int c) { v = a, m[0] = b, m[1] = c; }\n};\n\nvector<Edge> G[Maxn + 5];\n\nvoid AddEdge(int u, int v, int x, int y) {\n\n  G[u].push_back(Edge(v, x, y));\n\n  G[v].push_back(Edge(u, x, y));\n}\n\nll dist[2][Maxn + 5];\n\nbool vis[Maxn + 5];\n\nvoid SPFA(int s, int ty) {\n\n  queue<int> q;\n\n  memset(vis, 0, sizeof vis);\n\n  memset(dist[ty], 0x3f, sizeof dist[ty]);\n\n  q.push(s);\n\n  vis[s] = true;\n  dist[ty][s] = 0;\n\n  while (!q.empty()) {\n\n    int u = q.front();\n\n    q.pop();\n    vis[u] = false;\n\n    for (int i = 0; i < G[u].size(); i++) {\n\n      int v = G[u][i].v, w = G[u][i].m[ty];\n\n      if (dist[ty][v] > dist[ty][u] + w) {\n\n        dist[ty][v] = dist[ty][u] + w;\n\n        if (!vis[v]) {\n\n          vis[v] = true;\n\n          q.push(v);\n        }\n      }\n    }\n  }\n}\n\nint N, M, S, T;\n\nll ans[Maxn + 5];\n\nint main() {\n\n#ifdef LOACL\n\n  freopen(\"in.txt\", \"r\", stdin);\n\n  freopen(\"out.txt\", \"w\", stdout);\n\n#endif\n\n  scanf(\"%d %d %d %d\", &N, &M, &S, &T);\n\n  for (int i = 1; i <= M; i++) {\n\n    int u, v, x, y;\n\n    scanf(\"%d %d %d %d\", &u, &v, &x, &y);\n\n    AddEdge(u, v, x, y);\n  }\n\n  SPFA(S, 0);\n\n  SPFA(T, 1);\n\n  ans[N] = dist[0][N] + dist[1][N];\n\n  for (int i = N - 1; i >= 1; i--)\n\n    ans[i] = min(ans[i + 1], dist[0][i] + dist[1][i]);\n\n  for (int i = 1; i <= N; i++)\n\n    printf(\"%lld\\n\", Tot - ans[i]);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define LL long long\n\n#define INF 1e18\n\n#define MAXN 100005\n\nLL min(LL x, LL y) {\n  if (x < y)\n    return x;\n  return y;\n}\n\nint n, m, s, t, u, v;\n\nLL a, b, f = 1e15, ans[MAXN];\n\nstruct Graph\n\n{\n\n  int cnt, head[MAXN], vis[MAXN];\n\n  LL dis[MAXN];\n\n  struct Edge {\n    int next, to;\n    LL dis;\n  } edge[MAXN * 2];\n\n  std::queue<int> q;\n\n  void addedge(int from, int to, LL dis)\n\n  {\n\n    edge[++cnt].next = head[from];\n\n    edge[cnt].to = to;\n\n    edge[cnt].dis = dis;\n\n    head[from] = cnt;\n  }\n\n  void spfa(int s)\n\n  {\n\n    for (int i = 1; i <= n; i++)\n      dis[i] = INF;\n\n    memset(vis, 0, sizeof(vis));\n\n    q.push(s);\n    vis[s] = 1;\n    dis[s] = 0;\n\n    while (!q.empty())\n\n    {\n\n      int x = q.front();\n      q.pop();\n\n      vis[x] = 0;\n\n      for (int i = head[x]; i; i = edge[i].next)\n\n      {\n\n        int to = edge[i].to;\n\n        if (dis[to] > dis[x] + edge[i].dis)\n\n        {\n\n          dis[to] = dis[x] + edge[i].dis;\n\n          if (!vis[to])\n            q.push(to), vis[to] = 1;\n        }\n      }\n    }\n  }\n\n} g1, g2;\n\nint main()\n\n{\n\n  scanf(\"%d%d%d%d\", &n, &m, &s, &t);\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    scanf(\"%d%d%lld%lld\", &u, &v, &a, &b);\n\n    g1.addedge(u, v, a);\n    g1.addedge(v, u, a);\n\n    g2.addedge(v, u, b);\n    g2.addedge(u, v, b);\n  }\n\n  g1.spfa(s);\n  g2.spfa(t);\n\n  ans[n + 1] = INF;\n\n  for (int i = n; i >= 1; i--)\n    ans[i] = min(ans[i + 1], g1.dis[i] + g2.dis[i]);\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%lld\\n\", f - ans[i]);\n}"}
{"fast_code_id":"a273e29fec358291c7378c7bbde1c4c88920018e7b9a09265428035389a4916f","fast_id":"bcf7251a5f2dece3a721a42deeabd8cd893c478f3746e47f9fa2e12c5bca66d8","fast_time":0.1049534557,"language":"cpp","measured_fast_code_id":"bcf7251a5f2dece3a721a42deeabd8cd893c478f3746e47f9fa2e12c5bca66d8","measured_slow_code_id":"29917ecfe22627bfce14f8d7d86e7a7ae8cf74e333a51eecc48257bd53ead5c7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18799","problem_id":"p03565","slow_code_id":"6d18e0183a4c38b32570ae398a2c4374ff06f2d22cec5089deabd9ca6cf1181a","slow_id":"29917ecfe22627bfce14f8d7d86e7a7ae8cf74e333a51eecc48257bd53ead5c7","slow_time":0.4750995066,"speedup":4.526763825271548,"stratum":"4-8","sampling_key":"d74a1fd3576300248641c7ad8415fe98b223fbb151ca0f8b5b4ddf955802346f","slow_code":"#include <iostream>\n\n#include <cmath>\n\n#include <string>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\nint main(void) {\n\n  string s, t;\n\n  cin >> s;\n  cin >> t;\n\n  int count = 0;\n\n  int check = 0;\n\n  vector<string> ans(100000);\n\n  if (s.length() >= t.length()) {\n\n    for (int i = 0; i <= s.length() - t.length(); i++) {\n\n      count = 0;\n\n      for (int j = 0; j < t.length(); j++) {\n\n        if (s[i + j] == t[j] || s[i + j] == '?')\n          count++;\n      }\n\n      if (count == t.length()) {\n\n        ans[check].insert(0, s, 0, i);\n\n        ans[check] += t;\n\n        ans[check].insert(i + t.length(), s, i + t.length(), s.length() - t.length() - i);\n\n        check++;\n      }\n    }\n  }\n\n  if (check == 0)\n\n    cout << \"UNRESTORABLE\" << endl;\n\n  else {\n\n    for (int i = 0; i < check; i++) {\n\n      for (int j = 0; j < ans[i].length(); j++) {\n\n        if (ans[i][j] == '?')\n\n          ans[i][j] = 'a';\n      }\n    }\n\n    sort(&ans[0], &ans[check]);\n\n    cout << ans[0] << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <vector>\n\n#include <string>\n\n#include <queue>\n\n#include <utility>\n\n#include <map>\n\n#include <bitset>\n\n#include <numeric>\n\n#define ll long long\n\nusing namespace std;\n\nusing p = pair<ll, ll>;\n\nll dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nll dy[8] = {1, 0, -1, 0, 1, -1, 1, -1};\n\nint main(void) {\n\n  string s, t;\n\n  cin >> s >> t;\n\n  ll count = 0;\n\n  ll len = 0;\n\n  bool ok = false;\n\n  ll c = 0;\n\n  if (s.length() >= t.length()) {\n\n    for (ll i = 0; i <= s.length() - t.length(); i++) {\n\n      for (ll j = 0; j < t.length(); j++) {\n\n        if (s[i + j] != t[j] && s[i + j] != '?')\n          break;\n\n        if (j == t.length() - 1) {\n\n          ok = true;\n\n          c = i;\n        }\n      }\n    }\n  }\n\n  string ans;\n\n  if (ok == true) {\n\n    for (ll i = 0; i < c; i++) {\n\n      if (s[i] != '?')\n        ans += s[i];\n\n      else\n        ans += 'a';\n    }\n\n    ans += t;\n\n    for (ll i = c + t.length(); i < s.length(); i++) {\n\n      if (s[i] != '?')\n        ans += s[i];\n\n      else\n        ans += 'a';\n    }\n\n    cout << ans << endl;\n\n  }\n\n  else if (ok == false)\n\n    cout << \"UNRESTORABLE\" << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"8d0bf6ddce4274ea0fb2ba79ed0edf0cf6ff9ef035976f82c9e905a8a1f58ccb","fast_id":"ec2a5b46f5c35c034dd08ed2caed0dc75150fb88c49676688a7c00d0aaa73140","fast_time":0.108125637,"language":"cpp","measured_fast_code_id":"ec2a5b46f5c35c034dd08ed2caed0dc75150fb88c49676688a7c00d0aaa73140","measured_slow_code_id":"5cc0b3f321685560f95e5789845e329cfd58ff902bad57c400b8d525df7a478e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18801","problem_id":"p03211","slow_code_id":"dcd4686bf3b9737ddd81085c596266c26b4993626341dea55dc51ea1ae3800ba","slow_id":"5cc0b3f321685560f95e5789845e329cfd58ff902bad57c400b8d525df7a478e","slow_time":0.3748143456,"speedup":3.466470635451609,"stratum":"2-4","sampling_key":"81df30d531f810a9924ddfe08cc780deac0f2262cc03a92570e5e416c2765057","slow_code":"#include <iostream>\n\n#include <bits/stdc++.h>\n\n#define pb push_back\n\n#define ob pop_back\n\n#define xx first\n\n#define yy second\n\n#define dob double\n\n#define rin(i, n, k) for (int i = 0; i < n; i += k)\n\n#define int long long int\n\n#define ss size()\n\nusing namespace std;\n\nconst int M = 1e9 + 7, maxn = 100010;\n\nstd::vector<int> adj[maxn];\n\nstd::vector<int> v1;\n\nint ans, n, k, m, x, y, q, par[maxn], h[maxn], mach[maxn], sk[maxn], dp[maxn];\n\nbool mark[maxn], bpart[maxn];\n\nstring s, s1, s2;\n\nmap<string, int> mp;\n\nbool markchaild[maxn];\n\nint32_t main() {\n\n  cin >> s;\n\n  q = 753;\n\n  for (int i = 2; i < s.ss; i++) {\n\n    ans = (s[i - 2] - '0') * 100;\n\n    ans += (s[i - 1] - '0') * 10;\n\n    ans += (s[i] - '0');\n\n    ans = fabs(ans - 753);\n\n    if (ans < q)\n\n      q = ans;\n  }\n\n  cout << q;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <sstream>\n\nusing namespace std;\n\npair<int, long long> p[100006];\n\nint main() {\n\n  string s;\n\n  cin >> s;\n\n  int ans = 1000;\n\n  for (int i = 0; i < s.size() - 2; i++)\n\n  {\n\n    string g = \"\";\n\n    g = s.substr(i, 3);\n\n    stringstream a(g);\n\n    int b = 0;\n\n    a >> b;\n\n    ans = min(ans, abs(753 - b));\n  }\n\n  cout << ans;\n\n  return 0;\n}"}
{"fast_code_id":"a6502ac9730fb1d7c5542306bf89966f725f91b96f0cbd47f5cf7f3ef41fad04","fast_id":"f358d9fd12872de3f6c4063d8934065685a28ab9452f95092c5909675a67fbda","fast_time":0.0197425288,"language":"cpp","measured_fast_code_id":"f358d9fd12872de3f6c4063d8934065685a28ab9452f95092c5909675a67fbda","measured_slow_code_id":"991495577c12d6a10e2dfc1ce225654efbcc13185763c3988deff05d321d11a6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18814","problem_id":"p02912","slow_code_id":"1f948d8c860e85e3063f2e28fd2c64c220a4fe1685b34fbf19ba2629e08706a2","slow_id":"991495577c12d6a10e2dfc1ce225654efbcc13185763c3988deff05d321d11a6","slow_time":0.0961141693,"speedup":4.868381871120786,"stratum":"4-8","sampling_key":"d31282d98d54eb928d58c8a4b273ca87833fd345b513cc61f748f5846ce66c33","slow_code":"#include <queue>\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long LL;\n\nint n, m;\n\nLL ans;\n\npriority_queue<int> Q;\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1, x; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &x);\n\n    Q.push(x);\n  }\n\n  while (m--)\n\n  {\n\n    int t = Q.top();\n\n    Q.pop();\n\n    Q.push(t / 2);\n  }\n\n  while (!Q.empty())\n\n  {\n\n    ans += Q.top();\n\n    Q.pop();\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\ntypedef long long LL;\n\nconst int MAXN = 100005;\n\nvoid fix_down(int *h, int i, int n)\n\n{\n\n  int j = i, k, t = h[i];\n\n  while ((j << 1) + 1 < n)\n\n  {\n\n    k = (j << 1) + 1;\n\n    if (k + 1 < n && h[k + 1] > h[k])\n      k = k + 1;\n\n    if (t >= h[k])\n      break;\n\n    h[j] = h[k];\n\n    j = k;\n  }\n\n  h[j] = t;\n}\n\nint main()\n\n{\n\n  int N, M, t;\n\n  LL ans = 0LL;\n\n  static int h[MAXN];\n\n  scanf(\"%d%d\", &N, &M);\n\n  for (int i = 0; i < N; ++i)\n\n    scanf(\"%d\", &h[i]);\n\n  for (int i = N - 1; i >= 0; --i)\n\n    fix_down(h, i, N);\n\n  for (int i = 0; i < M; ++i)\n\n  {\n\n    if (h[0] == 0)\n      break;\n\n    h[0] = h[0] >> 1;\n\n    fix_down(h, 0, N);\n  }\n\n  for (int i = 0; i < N; ++i)\n\n    ans = ans + h[i];\n\n  printf(\"%lld\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"06ca9dd1e5ac955651a0bff00581910b19de8c9a7be42ad8a86dcb8ab492be3a","fast_id":"a645363763411841bfd26a084c4cc0fb7cca6000da9018d34cf0b6d97056acc0","fast_time":0.0316239718,"language":"cpp","measured_fast_code_id":"a645363763411841bfd26a084c4cc0fb7cca6000da9018d34cf0b6d97056acc0","measured_slow_code_id":"311d9034a51e84105f513ecce1f5e32123d5ff928709d2b9be3f4b931a9a7dd8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1886","problem_id":"p04026","slow_code_id":"8333395779d19e08e3f226ba8cf6e68123e1147f674584cdce007ed75dbb15a5","slow_id":"311d9034a51e84105f513ecce1f5e32123d5ff928709d2b9be3f4b931a9a7dd8","slow_time":0.0998172335,"speedup":3.1563787790880844,"stratum":"2-4","sampling_key":"b1a1da7cf6731c451211ebeaff718e272624fb51a9f7a3921e122cbc1f6139a0","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef vector<int> vi;\n\ntypedef vector<vi> vvi;\n\nint main(void) {\n\n  string s;\n\n  cin >> s;\n\n  int N = s.length();\n\n  int i, j;\n\n  for (i = 0; i < N - 1; i++) {\n\n    for (j = 0; j < 2; j++) {\n\n      if (s[i] == s[i + j + 1]) {\n\n        cout << i + 1 << \" \" << i + j + 2 << endl;\n\n        return 0;\n      }\n    }\n  }\n\n  cout << \"-1 -1\\n\";\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\nint main() {\n\n  char s[131072] = {};\n\n  scanf(\"%s\", s);\n\n  size_t ub = strlen(s);\n\n  s[ub] = '$';\n\n  for (size_t i = 0; i < ub; ++i)\n\n    for (size_t j = 1; j <= 2; ++j)\n\n      if (s[i] == s[i + j]) {\n\n        printf(\"%llu %llu\\n\", i + 1, i + j + 1);\n\n        return 0;\n      }\n\n  printf(\"-1 -1\\n\");\n\n  return 0;\n}\n"}
{"fast_code_id":"2357f5968296382ab4b6b3cd14e2f9df17edf4e1eb485076d863818541507b13","fast_id":"f1840f3d362232ffc976a3ff22420718161862e960278d83bc0c5d41bb7efe61","fast_time":0.0201500665,"language":"cpp","measured_fast_code_id":"f1840f3d362232ffc976a3ff22420718161862e960278d83bc0c5d41bb7efe61","measured_slow_code_id":"a5276052a9bfd2fae1e71c440dbec13bbdbf60c84c976e76bb1b86fc6f92abf1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18875","problem_id":"p03215","slow_code_id":"a16b554be8163543a010ddcf011721e00cacec4577e60dc45b0607691d84c0f4","slow_id":"a5276052a9bfd2fae1e71c440dbec13bbdbf60c84c976e76bb1b86fc6f92abf1","slow_time":0.0977394981,"speedup":4.850579431090215,"stratum":"4-8","sampling_key":"640517f99f22255c35974b032d2e7f7d8a9f4ee631755f6bba9b88c8fb1adbc6","slow_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\n#include <math.h>\n\n#include <vector>\n\nusing namespace std;\n\n#define N 100010\n\n#define LL long long\n\nint a[N];\n\nLL b[N];\n\nvector<LL> q;\n\nint main()\n\n{\n\n  int i, j, k, n, m;\n\n  int x, y, z;\n\n  LL d, t, s;\n\n  scanf(\"%d%d\", &n, &m);\n\n  b[0] = 0;\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n\n    b[i] = b[i - 1] + a[i];\n  }\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    for (j = i; j <= n; j++)\n\n    {\n\n      d = b[j] - b[i - 1];\n\n      q.push_back(d);\n    }\n  }\n\n  s = 0;\n\n  for (i = 40; i >= 0; i--)\n\n  {\n\n    d = s | (LL)pow(2, i);\n\n    k = 0;\n\n    for (j = 0; j < n * (n + 1) / 2; j++)\n\n      if ((q[j] & d) == d)\n\n        k++;\n\n    if (k >= m)\n\n      s = s + (LL)pow(2, i);\n  }\n\n  printf(\"%lld\\n\", s);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <math.h>\n\nusing namespace std;\n\n#define N 1000010\n\n#define LL long long\n\nint a[N], vis[N];\n\nLL s[N], b[N], c[N], p[N];\n\nint main()\n\n{\n\n  int i, j, k, n, m;\n\n  int x, y, z;\n\n  LL d, t, ans;\n\n  scanf(\"%d%d\", &n, &m);\n\n  p[0] = 1;\n\n  for (i = 1; i <= 50; i++)\n\n    p[i] = p[i - 1] * 2;\n\n  for (i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  s[0] = 0;\n\n  for (i = 1; i <= n; i++)\n\n    s[i] = s[i - 1] + a[i];\n\n  k = 0;\n\n  for (i = 1; i <= n; i++)\n\n    for (j = i; j <= n; j++)\n\n    {\n\n      d = s[j] - s[i - 1];\n\n      b[k++] = d;\n    }\n\n  ans = 0;\n\n  y = 40;\n\n  while (1)\n\n  {\n\n    for (i = y; i >= 0; i--)\n\n    {\n\n      z = 0;\n\n      d = ans + p[i];\n\n      for (j = 0; j < k; j++)\n\n        if ((b[j] & d) == d)\n\n          z++;\n\n      if (z >= m)\n\n        break;\n    }\n\n    if (i < 0)\n\n      break;\n\n    ans = ans + p[i];\n\n    y = i - 1;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"32ab4d41bd99af49a2ab889d56fed8489f0a817d0e4ff53a9ee280ff7725d42a","fast_id":"2e9cd44dce7834c689a53d23e41c9981b746b2a37722f525c4070364a8293b84","fast_time":0.0616379581,"language":"cpp","measured_fast_code_id":"2e9cd44dce7834c689a53d23e41c9981b746b2a37722f525c4070364a8293b84","measured_slow_code_id":"adb6989fe5c22e0a018cc387e924913990f0d94493f614448b57db128ba49adf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_18962","problem_id":"p01460","slow_code_id":"81ce1a123e9c66f834adb9bf7ff82dbc50936bcf2a5e88fae05aec0504f2f41a","slow_id":"adb6989fe5c22e0a018cc387e924913990f0d94493f614448b57db128ba49adf","slow_time":0.1479915311,"speedup":2.40098042929816,"stratum":"2-4","sampling_key":"2ce6ce8db3dd2b05fd843a3eecc22ba780985b47984cf89102e5a513b3449f1a","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <map>\n\nusing namespace std;\n\nint n;\n\nint A, B, C;\n\nstruct Coordinates\n\n{\n\n  int map[40000];\n\n  bool rever;\n\n  Coordinates()\n\n  {\n\n    for (int i = 0; i < 40000; ++i)\n\n      map[i] = i;\n\n    rever = false;\n  }\n\n  void reverse()\n\n  {\n\n    rever = !rever;\n  }\n\n  int &operator[](int a)\n\n  {\n\n    if (rever == true)\n\n      return map[n - 1 - a];\n\n    else\n\n      return map[a];\n  }\n\n} X, Y;\n\nCoordinates &x = X, &y = Y;\n\nmap<pair<int, int>, int> num;\n\nbool flag = false;\n\npair<int, int> getCoorddinates(int a, int b)\n\n{\n\n  if (flag == false)\n\n    return make_pair(x[a], y[b]);\n\n  else\n\n    return make_pair(y[b], x[a]);\n}\n\nint calc(pair<int, int> a)\n\n{\n\n  return ((long long)a.first * A + A + (long long)a.second * B + B) % C;\n}\n\nint &getNum(pair<int, int> a)\n\n{\n\n  if (num.find(a) != num.end())\n\n    return num[a];\n\n  else\n\n    return num[a] = calc(a);\n}\n\nint getNum2(pair<int, int> a)\n\n{\n\n  if (num.find(a) != num.end())\n\n    return num[a];\n\n  else\n\n    return calc(a);\n}\n\nvoid reflectHorizontal()\n\n{\n\n  x.reverse();\n}\n\nvoid reflectVertical()\n\n{\n\n  y.reverse();\n}\n\nvoid rotateLeft()\n\n{\n\n  flag = !flag;\n\n  swap(x, y);\n\n  x.reverse();\n}\n\nvoid rotateRight()\n\n{\n\n  flag = !flag;\n\n  swap(x, y);\n\n  y.reverse();\n}\n\nvoid swapColumn(int a, int b)\n\n{\n\n  swap(y[a], y[b]);\n}\n\nvoid swapRow(int a, int b)\n\n{\n\n  swap(x[a], x[b]);\n}\n\nchar s[3];\n\nint main()\n\n{\n\n  int q;\n\n  scanf(\"%d%d\", &n, &q);\n\n  scanf(\"%d%d%d\", &A, &B, &C);\n\n  int D, E, F, G;\n\n  scanf(\"%d%d%d%d\", &D, &E, &F, &G);\n\n  while (q--)\n\n  {\n\n    scanf(\"%s\", s);\n\n    if (strcmp(s, \"WR\") == 0)\n\n    {\n\n      int r, c, v;\n\n      scanf(\"%d%d%d\", &r, &c, &v);\n\n      --r;\n\n      --c;\n\n      getNum(getCoorddinates(r, c)) = v;\n\n    }\n\n    else if (strcmp(s, \"CP\") == 0)\n\n    {\n\n      int r1, c1, r2, c2;\n\n      scanf(\"%d%d%d%d\", &r1, &c1, &r2, &c2);\n\n      --r1;\n\n      --c1;\n\n      --r2;\n\n      --c2;\n\n      getNum(getCoorddinates(r2, c2)) = getNum(getCoorddinates(r1, c1));\n\n    }\n\n    else if (strcmp(s, \"SR\") == 0)\n\n    {\n\n      int r1, r2;\n\n      scanf(\"%d%d\", &r1, &r2);\n\n      --r1;\n\n      --r2;\n\n      swapRow(r1, r2);\n\n    }\n\n    else if (strcmp(s, \"SC\") == 0)\n\n    {\n\n      int c1, c2;\n\n      scanf(\"%d%d\", &c1, &c2);\n\n      --c1;\n\n      --c2;\n\n      swapColumn(c1, c2);\n\n    }\n\n    else if (strcmp(s, \"RL\") == 0)\n\n      rotateLeft();\n\n    else if (strcmp(s, \"RR\") == 0)\n\n      rotateRight();\n\n    else if (strcmp(s, \"RH\") == 0)\n\n      reflectHorizontal();\n\n    else\n\n      reflectVertical();\n  }\n\n  int h = 314159265;\n\n  for (int r = D - 1; r < E; ++r)\n\n    for (int c = F - 1; c < G; ++c)\n\n      h = ((long long)h * 31 + getNum2(getCoorddinates(r, c))) % 1000000007;\n\n  printf(\"%d\\n\", h);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <map>\n\nusing namespace std;\n\nconst int maxn = 4e4 + 5;\n\nbool RH, RV, R;\n\nint row[maxn], colum[maxn];\n\nint A, B, C, D, E, F, G, n, q;\n\nstruct HashMap\n\n{\n\n  int mod;\n\n  int begin[100007], next[maxn], val[maxn], key[maxn];\n\n  int s, i, num;\n\n  void ini()\n\n  {\n\n    mod = 100007;\n\n    memset(begin, -1, sizeof(begin));\n\n    num = 0;\n  }\n\n  int back(int x, int y)\n\n  {\n\n    s = x * n + y;\n\n    for (i = begin[s % mod]; i != -1; i = next[i])\n\n      if (key[i] == s)\n        return val[i];\n\n    return (A * (long long)x + B * (long long)y) % C;\n  }\n\n  void change(int x, int y, int k)\n\n  {\n\n    s = x * n + y;\n\n    for (i = begin[s % mod]; i != -1; i = next[i])\n\n      if (key[i] == s)\n\n      {\n\n        val[i] = k;\n\n        return;\n      }\n\n    key[num] = s;\n\n    val[num] = k;\n\n    s = s % mod;\n\n    next[num] = begin[s];\n\n    begin[s] = num++;\n  }\n\n} S;\n\nvoid change(int &r, int &c)\n\n{\n\n  if (R)\n    swap(r, c);\n\n  if (RH)\n    r = row[n + 1 - r];\n\n  else\n    r = row[r];\n\n  if (RV)\n    c = colum[n + 1 - c];\n\n  else\n    c = colum[c];\n}\n\nconst int mod = 1e9 + 7;\n\nint r1, r2, c1, c2, r, c, v;\n\nchar s[10];\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &q);\n\n  scanf(\"%d%d%d%d%d%d%d\", &A, &B, &C, &D, &E, &F, &G);\n\n  S.ini();\n\n  for (int i = 1; i <= n; i++)\n\n    row[i] = colum[i] = i;\n\n  RH = RV = R = false;\n\n  for (int i = 0; i < q; i++)\n\n  {\n\n    scanf(\"%s\", s);\n\n    if (s[0] == 'W')\n\n    {\n\n      scanf(\"%d%d%d\", &r, &c, &v);\n\n      change(r, c);\n\n      S.change(r, c, v);\n\n    }\n\n    else if (s[0] == 'C')\n\n    {\n\n      scanf(\"%d%d%d%d\", &r1, &c1, &r2, &c2);\n\n      change(r1, c1);\n\n      change(r2, c2);\n\n      S.change(r2, c2, S.back(r1, c1));\n\n    }\n\n    else if (s[0] == 'S')\n\n    {\n\n      if (s[1] == 'R')\n\n      {\n\n        scanf(\"%d%d\", &r1, &r2);\n\n        c1 = c2 = 0;\n\n        if (R)\n\n        {\n\n          swap(r1, c1);\n\n          swap(r2, c2);\n        }\n\n        if (r1 && RH)\n          r1 = n + 1 - r1, r2 = n + 1 - r2;\n\n        if (c1 && RV)\n          c1 = n + 1 - c1, c2 = n + 1 - c2;\n\n        if (r1)\n          swap(row[r1], row[r2]);\n\n        if (c1)\n          swap(colum[c1], colum[c2]);\n\n      }\n\n      else if (s[1] == 'C')\n\n      {\n\n        scanf(\"%d%d\", &c1, &c2);\n\n        r1 = r2 = 0;\n\n        if (R)\n\n        {\n\n          swap(r1, c1);\n\n          swap(r2, c2);\n        }\n\n        if (r1 && RH)\n          r1 = n + 1 - r1, r2 = n + 1 - r2;\n\n        if (c1 && RV)\n          c1 = n + 1 - c1, c2 = n + 1 - c2;\n\n        if (r1)\n          swap(row[r1], row[r2]);\n\n        if (c1)\n          swap(colum[c1], colum[c2]);\n      }\n\n    }\n\n    else if (s[0] == 'R')\n\n    {\n\n      if (s[1] == 'L')\n\n      {\n\n        if (R)\n          RH = !RH;\n\n        else\n          RV = !RV;\n\n        R = !R;\n\n      }\n\n      else if (s[1] == 'R')\n\n      {\n\n        if (R)\n          RV = !RV;\n\n        else\n          RH = !RH;\n\n        R = !R;\n\n      }\n\n      else if (s[1] == 'H')\n\n      {\n\n        if (!R)\n          RH = !RH;\n\n        else\n          RV = !RV;\n\n      }\n\n      else if (s[1] == 'V')\n\n      {\n\n        if (!R)\n          RV = !RV;\n\n        else\n          RH = !RH;\n      }\n    }\n  }\n\n  long long ans = 314159265LL;\n\n  for (int i = D; i <= E; i++)\n\n    for (int j = F; j <= G; j++)\n\n    {\n\n      r = i, c = j;\n\n      change(r, c);\n\n      ans = (ans * 31 + S.back(r, c)) % mod;\n    }\n\n  printf(\"%d\\n\", (int)ans);\n\n  return 0;\n}"}
{"fast_code_id":"0a9d8af03d1768233aeabb35ee1b02bb58de9a6211c8f4aa6ce75cf66aaea80f","fast_id":"469baebe0b628b6ee7fef334606ed200b26ab0b98b987299c7b2da050ee1fe34","fast_time":0.0053958116,"language":"cpp","measured_fast_code_id":"469baebe0b628b6ee7fef334606ed200b26ab0b98b987299c7b2da050ee1fe34","measured_slow_code_id":"7bf3f100e49001e0f39735498010f1c27656ea798ccd935473a630d1ea15c66e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_19060","problem_id":"p02597","slow_code_id":"8065ab9634f8b75a8af30a7814892193fef26fec0000a48ae867195029935a6e","slow_id":"7bf3f100e49001e0f39735498010f1c27656ea798ccd935473a630d1ea15c66e","slow_time":0.0110951172,"speedup":2.056246218826469,"stratum":"2-4","sampling_key":"46e44ce3ff4d5e8c57a9bcc7e58c183f92f3ec27b6be003cdf19068b9e6b035a","slow_code":"#include <stdio.h>\n\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\n\nint main(void)\n\n{\n\n  int N, total = 0, ope = 0;\n  char stones[200001] = {0};\n  if (!scanf(\"%d %s\", &N, stones))\n    return -1;\n\n  rep(i, N) {\n    if (stones[i] == 'R')\n      total++;\n  }\n\n  ope = total;\n  rep(i, total) {\n    if (stones[i] == 'R')\n      ope--;\n  }\n\n  return printf(\"%d\\n\", ope), 0;\n}","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n\nstatic inline int IN(void)\n\n{\n\n  int x = 0, f = 0, c = getchar();\n  while (c < 48 || c > 57) {\n    f ^= c == 45, c = getchar();\n  }\n\n  while (c > 47 && c < 58) {\n    x = x * 10 + c - 48, c = getchar();\n  }\n  return f ? -x : x;\n}\n\nint main(void)\n\n{\n\n  int i = 0, N = IN(), r = 0, w = 0;\n\n  char *stones = (char *)malloc(sizeof(char) * (N + 1));\n  if (!scanf(\"%s\", stones))\n    return -1;\n\n  while (N--) {\n    if (stones[N] == 'R')\n      r++;\n  }\n  while (r--) {\n    if (stones[i++] == 'W')\n      w++;\n  }\n\n  printf(\"%d\\n\", w);\n  return free(stones), 0;\n}"}
{"fast_code_id":"3dabab375c8877d6c42cf7c31fd0141314737e7f61e0185626c83576101549dd","fast_id":"976fcf515aed331a1db3e61bb157dc9cde2fb1f07218b36dee6cfa9eb109b431","fast_time":0.1450243609,"language":"cpp","measured_fast_code_id":"976fcf515aed331a1db3e61bb157dc9cde2fb1f07218b36dee6cfa9eb109b431","measured_slow_code_id":"237fe2696cb9c9caa253dddeaa56e31f326ba05c875cc74bb47da970eb8bdf11","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_1918","problem_id":"p02588","slow_code_id":"11cc2662ca26444658322c08f252efac9a7a68b463a7e23f01b8d4a0d776e9e8","slow_id":"237fe2696cb9c9caa253dddeaa56e31f326ba05c875cc74bb47da970eb8bdf11","slow_time":0.4624085443,"speedup":3.188488757546388,"stratum":"2-4","sampling_key":"d8dcfe3f89590577d1f936bf94a60e7634e92bd4920d491aa31764ee5b2eef00","slow_code":"#include <bits/stdc++.h>\n\n#define ft first\n\n#define sc second\n\n#define pt(sth) cout << sth << \"\\n\"\n\n#define moca(a, s, b) a = ((a)s(b) + MOD) % MOD\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> pll;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nstatic const ll INF = 1e18;\n\nstatic const ll MAX = 101010;\n\nstatic const ll MOD = 1e9 + 7;\n\nint main(void) {\n\n  ll i, j, k, l;\n\n  ll N;\n\n  cin >> N;\n\n  ll a[MAX * 2];\n\n  ll cnt[66][66] = {};\n\n  pll f[MAX * 2] = {};\n\n  map<double, ll> mp;\n\n  for (i = 0; i < N; i++) {\n\n    double tt;\n\n    cin >> tt;\n\n    a[i] = llround(tt * 1e9);\n\n    ll t = a[i];\n\n    ll c2 = 0, c5 = 0;\n\n    while (t % 2 == 0) {\n      c2++;\n      t /= 2;\n    }\n\n    while (t % 5 == 0) {\n      c5++;\n      t /= 5;\n    }\n\n    cnt[c2][c5]++;\n\n    f[i] = {c2, c5};\n  }\n\n  ll ans = 0;\n\n  for (i = 0; i < N; i++) {\n\n    ll n2 = max(18 - f[i].ft, 0LL);\n\n    ll n5 = max(18 - f[i].sc, 0LL);\n\n    for (j = n2; j < 66; j++) {\n\n      for (k = n5; k < 66; k++) {\n\n        ans += cnt[j][k];\n      }\n    }\n\n    if (n2 <= f[i].ft && n5 <= f[i].sc)\n      ans--;\n  }\n\n  ans /= 2;\n\n  pt(ans);\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define ft first\n\n#define sc second\n\n#define pt(sth) cout << sth << \"\\n\"\n\n#define moca(a, s, b) a = ((a)s(b) + MOD) % MOD\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> pll;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nstatic const ll INF = 1e18;\n\nstatic const ll MAX = 101010;\n\nstatic const ll MOD = 1e9 + 7;\n\nint main(void) {\n\n  ll i, j, k, l;\n\n  ll N;\n\n  cin >> N;\n\n  ll a[MAX * 2];\n\n  ll cnt[22][22] = {};\n\n  map<double, ll> mp;\n\n  for (i = 0; i < N; i++) {\n\n    double tt;\n\n    cin >> tt;\n\n    a[i] = llround(tt * 1e9);\n\n    ll t = a[i];\n\n    ll c2 = 0, c5 = 0;\n\n    while (t % 2 == 0) {\n      c2++;\n      t /= 2;\n    }\n\n    while (t % 5 == 0) {\n      c5++;\n      t /= 5;\n    }\n\n    cnt[min(18LL, c2)][min(18LL, c5)]++;\n  }\n\n  ll ans = 0;\n\n  for (i = 0; i < 22; i++) {\n\n    for (j = 0; j < 22; j++) {\n\n      for (k = 0; k < 22; k++) {\n\n        for (l = 0; l < 22; l++) {\n\n          if (i == k && j == l)\n            continue;\n\n          if (i + k >= 18 && j + l >= 18) {\n\n            ans += cnt[i][j] * cnt[k][l];\n          }\n        }\n      }\n    }\n  }\n\n  ans /= 2;\n\n  for (i = 9; i < 22; i++) {\n\n    for (j = 9; j < 22; j++) {\n\n      ans += cnt[i][j] * (cnt[i][j] - 1) / 2;\n    }\n  }\n\n  pt(ans);\n}\n"}
{"fast_code_id":"81af2a86b04449b12597f638303f35302311709a3e246b8a2a5762bc5bde1a14","fast_id":"6e53fc674b4e6ba8b1fb92a62bf54363cbb773dbee631a7d4a0669a7c4486306","fast_time":0.020115055,"language":"cpp","measured_fast_code_id":"6e53fc674b4e6ba8b1fb92a62bf54363cbb773dbee631a7d4a0669a7c4486306","measured_slow_code_id":"4239568514faa82d81ff3b7b6405c6d9da04f4de847d407cd1fc034599929b5b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_22633","problem_id":"p03162","slow_code_id":"611b3fc9c3de8f270b467c4dfbc4feef7a5066f4232c06b3d462fea8898e0015","slow_id":"4239568514faa82d81ff3b7b6405c6d9da04f4de847d407cd1fc034599929b5b","slow_time":1.4580968928,"speedup":72.48784021719055,"stratum":"8+","sampling_key":"341f5ea3244f4e530b03137583c88daa94ec5a32a4a1c3f8c3c580d754257fa2","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int rest = 1000001;\n\nint dp[3][rest];\n\nint ac[rest][3];\n\nint it;\n\nint va(int a, int i) {\n\n  if (i == it) {\n\n    return 0;\n  }\n\n  if (dp[a][i] != -1) {\n\n    return dp[a][i];\n  }\n\n  int &ans = dp[a][i];\n\n  if (a == 0) {\n\n    ans = max(ans, va(1, i + 1) + ac[i][0]);\n\n    ans = max(ans, va(2, i + 1) + ac[i][0]);\n  }\n\n  if (a == 1) {\n\n    ans = max(ans, va(0, i + 1) + ac[i][1]);\n\n    ans = max(ans, va(2, i + 1) + ac[i][1]);\n  }\n\n  if (a == 2) {\n\n    ans = max(ans, va(0, i + 1) + ac[i][2]);\n\n    ans = max(ans, va(1, i + 1) + ac[i][2]);\n  }\n\n  return ans;\n}\n\nint main() {\n\n  cin >> it;\n\n  for (int i = 0; i < it; i++) {\n\n    cin >> ac[i][0];\n\n    cin >> ac[i][1];\n\n    cin >> ac[i][2];\n  }\n\n  memset(dp, -1, sizeof dp);\n\n  cout << max(va(0, 0), max(va(1, 0), va(2, 0))) << \"\\n\";\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing std::max;\n\n#define MAXN 100003\n\nint d[MAXN][3], a[MAXN][3];\n\nint main(void)\n\n{\n\n  int i, N;\n\n  scanf(\"%d\", &N);\n\n  for (i = 0; i < N; i++)\n\n  {\n\n    scanf(\"%d%d%d\", &a[i][0], &a[i][1], &a[i][2]);\n  }\n\n  d[0][0] = a[0][0];\n\n  d[0][1] = a[0][1];\n\n  d[0][2] = a[0][2];\n\n  for (i = 1; i < N; i++)\n\n  {\n\n    d[i][0] = a[i][0] + max(d[i - 1][1], d[i - 1][2]);\n\n    d[i][1] = a[i][1] + max(d[i - 1][0], d[i - 1][2]);\n\n    d[i][2] = a[i][2] + max(d[i - 1][1], d[i - 1][0]);\n  }\n\n  printf(\"%d\\n\", max(d[N - 1][0], max(d[N - 1][1], d[N - 1][2])));\n\n  return 0;\n}"}
{"fast_code_id":"26d5674a3855b0ea08c2b778637809ae3d48a7210204bbdef11488aaa553e43b","fast_id":"8ed11f99244d10083708c78278cc62234aa34def894b7de512b2311fe092fbd6","fast_time":0.0329181189,"language":"cpp","measured_fast_code_id":"8ed11f99244d10083708c78278cc62234aa34def894b7de512b2311fe092fbd6","measured_slow_code_id":"41e97c72a470cf3d7e970b20ba3d11a6f2c08b811ed5525444693b4c3beb4b68","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_24956","problem_id":"p03575","slow_code_id":"75533aea334c0eece456a4580c168bbaaa5fde07fc5f3c0f4413b35939cf135e","slow_id":"41e97c72a470cf3d7e970b20ba3d11a6f2c08b811ed5525444693b4c3beb4b68","slow_time":0.1232448191,"speedup":3.7439812242734196,"stratum":"2-4","sampling_key":"c4402e1d74352de86c42f9494b640cc04770a9f5a814305ea51c1b9893f5b7a1","slow_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <vector>\n\nusing namespace std;\n\nint n, m, cnt, idx;\n\nint dfn[100001];\n\nvector<int> G[100001];\n\ninline int Tjcv(int u, int fa)\n\n{\n\n  int child = 0, lowu;\n\n  lowu = dfn[u] = ++idx;\n\n  for (int i = 0, v; i < G[u].size(); i++)\n\n  {\n\n    v = G[u][i];\n\n    if (v != fa)\n\n    {\n\n      if (!dfn[v])\n\n      {\n\n        ++child;\n\n        int lowv = Tjcv(v, u);\n\n        lowu = min(lowu, lowv);\n\n        if (lowv > dfn[u])\n\n        {\n\n          ++cnt;\n        }\n\n      }\n\n      else\n\n      {\n\n        lowu = min(lowu, dfn[v]);\n      }\n    }\n  }\n\n  return lowu;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 0, u, v; i < m; i++)\n\n  {\n\n    scanf(\"%d%d\", &u, &v);\n\n    G[u].push_back(v);\n\n    G[v].push_back(u);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (!dfn[i])\n\n    {\n\n      Tjcv(i, -1);\n    }\n  }\n\n  printf(\"%d\\n\", cnt);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <vector>\n\nusing namespace std;\n\nvector<int> e[60];\n\nint n, m, dfn[60], low[60], tot, u, v, sta[60], cnt, co[60], cntot;\n\nvoid dfs(int x, int las)\n\n{\n\n  dfn[x] = low[x] = ++tot;\n\n  sta[++cnt] = x;\n\n  for (int i = 0; i < e[x].size(); ++i)\n\n  {\n\n    int y = e[x][i];\n\n    if (!dfn[y])\n\n    {\n\n      dfs(y, x);\n\n      low[x] = min(low[x], low[y]);\n\n    }\n\n    else if (!co[y] && y ^ las)\n      low[x] = min(low[x], dfn[y]);\n  }\n\n  if (dfn[x] == low[x])\n\n  {\n\n    co[x] = ++cntot;\n\n    while (sta[cnt] ^ x)\n      co[sta[cnt--]] = cntot;\n\n    --cnt;\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d %d\", &n, &m);\n\n  for (int i = 1; i <= m; ++i)\n\n  {\n\n    scanf(\"%d %d\", &u, &v);\n\n    e[u].push_back(v);\n\n    e[v].push_back(u);\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    if (!dfn[i])\n      dfs(i, i);\n  }\n\n  printf(\"%d\\n\", cntot - 1);\n\n  return 0;\n}"}
{"fast_code_id":"bd2652fe6f6d73a792b863ef7cd363b2ec0b840fa71622c793456e314cb2f933","fast_id":"06d3c743cdc8820745c5abd823fa8cc9cdb7fbaa533bc429c51a0628dc160ded","fast_time":0.099643931,"language":"cpp","measured_fast_code_id":"06d3c743cdc8820745c5abd823fa8cc9cdb7fbaa533bc429c51a0628dc160ded","measured_slow_code_id":"02864a2ec7a325873e9292b48519131f35c6d154898967f8f30d573a12beb748","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_24973","problem_id":"p03995","slow_code_id":"6b163d309fd6c35ff609c9d8544cf14e147c4163d986035d5486d62a38faa51e","slow_id":"02864a2ec7a325873e9292b48519131f35c6d154898967f8f30d573a12beb748","slow_time":0.4357192726,"speedup":4.372762778698483,"stratum":"4-8","sampling_key":"7c9118a434b55d30c7b375234f66a879f69f98be69fc9e4fe74d5256529c6b04","slow_code":"#include <bits/stdc++.h>\n\n#define RG register\n\nusing namespace std;\n\nstruct node\n\n{\n\n  int a, b, c;\n\n  node(int aa = 0, int bb = 0, int cc = 0)\n\n  {\n\n    a = aa;\n    b = bb;\n    c = cc;\n  }\n\n} point[100005];\n\nint t, n, m, q, pd[100005], vis[100005], father2[100005], father1[100005];\n\nlong long size1[100005], size2[100005], mina1[100005], mina2[100005];\n\nbool flag;\n\nbool cmp1(const node &a, const node &b)\n\n{\n\n  return a.a < b.a;\n}\n\nbool cmp2(const node &a, const node &b)\n\n{\n\n  return a.b < b.b;\n}\n\nint find1(int x)\n\n{\n\n  if (x == father1[x])\n    return x;\n\n  int now = find1(father1[x]);\n\n  size1[x] += size1[father1[x]];\n\n  return father1[x] = now;\n}\n\nint find2(int x)\n\n{\n\n  if (x == father2[x])\n    return x;\n\n  int now = find2(father2[x]);\n\n  size2[x] += size2[father2[x]];\n\n  return father2[x] = now;\n}\n\nbool union1(int x, int y, int val)\n\n{\n\n  int r1 = find1(x), r2 = find1(y);\n\n  if (r1 != r2)\n\n  {\n\n    father1[r1] = r2;\n\n    size1[r1] = size1[y] + val - size1[x];\n\n  }\n\n  else\n\n  {\n\n    if (size1[x] - size1[y] != val)\n      return false;\n  }\n\n  return true;\n}\n\nbool union2(int x, int y, int val)\n\n{\n\n  int r1 = find2(x), r2 = find2(y);\n\n  if (r1 != r2)\n\n  {\n\n    father2[r1] = r2;\n\n    size2[r1] = size2[y] + val - size2[x];\n\n  }\n\n  else\n\n  {\n\n    if (size2[x] - size2[y] != val)\n      return false;\n  }\n\n  return true;\n}\n\nint main()\n\n{\n\n  t = 1;\n\n  while (t--)\n\n  {\n\n    flag = false;\n\n    scanf(\"%d%d\", &n, &m);\n\n    scanf(\"%d\", &q);\n\n    for (RG int i = 1; i <= q; i++)\n\n    {\n\n      scanf(\"%d%d%d\", &point[i].a, &point[i].b, &point[i].c);\n    }\n\n    for (int i = 1; i <= n; i++)\n\n      father1[i] = i, size1[i] = 0;\n\n    for (int i = 1; i <= m; i++)\n\n      father2[i] = i, size2[i] = 0;\n\n    for (RG int i = 1; i <= q; i++)\n\n    {\n\n      if (point[i].c < 0)\n\n      {\n\n        flag = true;\n\n        break;\n      }\n    }\n\n    sort(point + 1, point + q + 1, cmp1);\n\n    for (int i = 2; i <= q; i++)\n\n      if (point[i].a == point[i - 1].a)\n\n      {\n\n        if (!union2(point[i - 1].b, point[i].b, point[i].c - point[i - 1].c))\n\n        {\n\n          flag = true;\n\n          break;\n        }\n      }\n\n    sort(point + 1, point + q + 1, cmp2);\n\n    for (int i = 2; i <= q; i++)\n\n      if (point[i].b == point[i - 1].b)\n\n      {\n\n        if (!union1(point[i - 1].a, point[i].a, point[i].c - point[i - 1].c))\n\n        {\n\n          flag = true;\n\n          break;\n        }\n      }\n\n    memset(mina1, 127, sizeof(mina1));\n\n    memset(mina2, 127, sizeof(mina2));\n\n    for (int i = 1; i <= q; i++)\n\n    {\n\n      int pos = find1(point[i].a);\n\n      mina1[pos] = min(mina1[pos], point[i].c + size1[point[i].a]);\n    }\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      int pos = find1(i);\n\n      mina2[pos] = min(mina2[pos], -size1[i]);\n    }\n\n    for (int i = 1; i <= n; i++)\n\n      if (father1[i] == i && mina1[i] + mina2[i] < 0)\n\n      {\n\n        flag = true;\n\n        break;\n      }\n\n    memset(mina1, 127, sizeof(mina1));\n\n    memset(mina2, 127, sizeof(mina2));\n\n    for (int i = 1; i <= q; i++)\n\n    {\n\n      int pos = find2(point[i].b);\n\n      mina1[pos] = min(mina1[pos], point[i].c + size2[point[i].b]);\n    }\n\n    for (int i = 1; i <= m; i++)\n\n    {\n\n      int pos = find2(i);\n\n      mina2[pos] = min(mina2[pos], -size2[i]);\n    }\n\n    for (int i = 1; i <= m; i++)\n\n      if (father2[i] == i && mina1[i] + mina2[i] < 0)\n\n      {\n\n        flag = true;\n\n        break;\n      }\n\n    if (flag)\n\n    {\n\n      printf(\"No\\n\");\n\n    }\n\n    else\n\n    {\n\n      printf(\"Yes\\n\");\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 100010;\n\ntemplate <class T>\ninline void read(T &re)\n\n{\n\n  char ch;\n  int f = 1;\n\n  while ((ch = getchar()) < '0' || ch > '9')\n\n    if (ch == '-')\n      f = -1;\n\n  re = ch - 48;\n\n  while ((ch = getchar()) >= '0' && ch <= '9')\n\n    re = (re << 3) + (re << 1) + ch - 48;\n\n  re *= f;\n}\n\ninline int min(int x, int y) { return x < y ? x : y; }\n\nstruct node {\n\n  int x, y, w;\n\n} ch[maxn];\n\nint fa[maxn];\n\nlong long w[maxn], min1[maxn], min2[maxn];\n\ninline bool comp(const node &a, const node &b) {\n\n  if (a.y != b.y)\n    return a.y < b.y;\n\n  return a.x < b.x;\n}\n\ninline int getfa(int x) {\n\n  if (fa[x] == x)\n    return x;\n\n  int nf = getfa(fa[x]);\n\n  w[x] += w[fa[x]];\n\n  return fa[x] = nf;\n}\n\ninline bool unionn(int a, int b, long long W)\n\n{\n\n  int a1 = getfa(a), b1 = getfa(b);\n\n  if (a1 != b1) {\n\n    fa[a1] = b1;\n\n    w[a1] = W + w[b] - w[a];\n\n    return true;\n\n  }\n\n  else\n    return w[a] == W + w[b];\n}\n\nint main()\n\n{\n\n  int T, r, c, n;\n\n  bool fl = true;\n\n  read(r);\n  read(c);\n\n  read(n);\n\n  for (register int i = 1; i <= n; ++i) {\n\n    read(ch[i].x);\n    read(ch[i].y);\n    read(ch[i].w);\n\n    if (ch[i].w < 0)\n      fl = false;\n  }\n\n  if (fl == false) {\n\n    printf(\"No\\n\");\n\n    return 0;\n\n  }\n\n  else if (r == 1) {\n\n    printf(\"Yes\\n\");\n\n    return 0;\n  }\n\n  for (register int i = 1; i <= r; ++i) {\n\n    fa[i] = i;\n    w[i] = 0;\n  }\n\n  std::sort(ch + 1, ch + 1 + n, comp);\n\n  for (register int i = 1; i < n; ++i)\n\n    if (ch[i].y == ch[i + 1].y)\n\n      if (!unionn(ch[i].x, ch[i + 1].x, ch[i + 1].w - ch[i].w))\n\n        fl = false;\n\n  for (register int i = 1; i <= r; ++i)\n\n    min1[i] = min2[i] = 2e16;\n\n  for (register int i = 1; i <= n; ++i) {\n\n    int rt = getfa(ch[i].x);\n\n    min1[rt] = min(min1[rt], ch[i].w + w[ch[i].x]);\n  }\n\n  for (register int i = 1; i <= r; ++i) {\n\n    int rt = getfa(i);\n\n    min2[rt] = min(min2[rt], -w[i]);\n  }\n\n  for (register int i = 1; i <= r; ++i)\n\n    if (fa[i] == i && min2[i] + min1[i] < 0) {\n\n      fl = false;\n      break;\n    }\n\n  if (fl)\n    printf(\"Yes\\n\");\n\n  else\n    printf(\"No\\n\");\n\n  return 0;\n}"}
{"fast_code_id":"ff418fb36441013d54f26cc43d321f0725232c37ea1de4b13b799ad800cf4ce8","fast_id":"d5bb04a1d2df74332c5af3b9e2f503a886dd5d243d73186b3ffdcf030c6412bc","fast_time":0.0265229813,"language":"cpp","measured_fast_code_id":"d5bb04a1d2df74332c5af3b9e2f503a886dd5d243d73186b3ffdcf030c6412bc","measured_slow_code_id":"dc7998210666b4ee557f9867e4702d7c2b1ed857572d6afa7683fa3ba3641fd6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25034","problem_id":"p02925","slow_code_id":"e8c076abfa8cf5b2b1ce146dc33dd6ab8e5cbceb93c0cf14df10247cfc709f49","slow_id":"dc7998210666b4ee557f9867e4702d7c2b1ed857572d6afa7683fa3ba3641fd6","slow_time":0.1071827811,"speedup":4.041128705995053,"stratum":"4-8","sampling_key":"546a098b4d14edb6dc42713b7b668df48ea036affe1abcb4e24e5a80a530d040","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int A[1001][999];\n\n  rep1(i, N) rep(j, N - 1) { cin >> A[i][j]; }\n\n  int k[1001] = {};\n\n  vector<int> V;\n\n  rep1(i, N) { V.pb(i); }\n\n  set<pair<int, int>> ST;\n\n  int kotae = 0;\n\n  int OK = 1;\n\n  while (V.size()) {\n\n    vector<int> kari;\n\n    int hiita = 0;\n\n    pair<int, int> mae = mp(-1, -1);\n\n    for (auto v : V) {\n\n      int a = A[v][k[v]];\n\n      int b = v;\n\n      if (a > b)\n        swap(a, b);\n\n      k[v]++;\n\n      auto itr = ST.find(mp(a, b));\n\n      if (itr != ST.end()) {\n\n        hiita = 1;\n\n        ST.erase(itr);\n\n        if (k[a] < N - 1) {\n\n          kari.pb(a);\n        }\n\n        if (k[b] < N - 1) {\n\n          kari.pb(b);\n        }\n\n      }\n\n      else {\n\n        ST.insert(mp(a, b));\n      }\n    }\n\n    V = kari;\n\n    if (hiita == 0) {\n\n      OK = 0;\n\n      break;\n    }\n\n    kotae++;\n  }\n\n  if (OK)\n    co(kotae);\n\n  else\n    co(-1);\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  int N = getint();\n\n  int A[1001][1000];\n\n  rep1(i, N) {\n\n    rep(j, N - 1) A[i][j] = getint();\n\n    A[i][N - 1] = 0;\n  }\n\n  int *k[1001];\n\n  rep1(i, N) k[i] = A[i];\n\n  int k2[1001] = {};\n\n  k2[0] = 1e9;\n\n  int V[2][1001], kazu = N;\n\n  rep1(i, N) V[0][i] = i;\n\n  int kotae = 0;\n\n  while (kazu && kotae < 80000) {\n\n    kotae++;\n\n    int dotti = kotae & 1;\n\n    int kari = 0;\n\n    rep(i, kazu) {\n\n      int v = V[!dotti][i];\n\n      if (k2[v] < kotae) {\n\n        int a = *k[v];\n\n        if (k2[a] < kotae && *k[a] == v) {\n\n          V[dotti][kari++] = v;\n\n          k[v]++;\n\n          k2[v] = kotae;\n\n          V[dotti][kari++] = a;\n\n          k[a]++;\n\n          k2[a] = kotae;\n        }\n      }\n    }\n\n    kazu = kari;\n  }\n\n  int OK = 1;\n\n  rep1(i, N) if (k[i] - A[i] != N - 1) OK = 0;\n\n  if (kotae == 80000)\n    printf(\"%d\", N * (N - 1) / 2);\n\n  else if (!OK)\n    printf(\"-1\");\n\n  else\n    printf(\"%d\", kotae - 1);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"fc94e0c2de8303dba732f7bd9dcc990ec35719040af725da77017c487f35032c","fast_id":"665c3407def8958a7a98ea5e874e5ca4d6eb5ebf6d7ae9cea0585857f77def20","fast_time":0.0173165278,"language":"cpp","measured_fast_code_id":"665c3407def8958a7a98ea5e874e5ca4d6eb5ebf6d7ae9cea0585857f77def20","measured_slow_code_id":"46d0975399a856cfe84ced9c489b8690c19c20acbe43ab7bf7ca8902ac21ebd6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25077","problem_id":"p03612","slow_code_id":"4a1a40fa47b2cad5dc0819d0b13fca0028b7176104f843337baeae3471d32413","slow_id":"46d0975399a856cfe84ced9c489b8690c19c20acbe43ab7bf7ca8902ac21ebd6","slow_time":0.1339705765,"speedup":7.736572715229897,"stratum":"4-8","sampling_key":"4e50c6d20ae770746d2a57ad1b69c963dcfefa30ffe49ac31376e5184de04bd2","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int P[100001] = {};\n\n  rep1(i, N) {\n\n    int p;\n\n    cin >> p;\n\n    P[p] = i;\n  }\n\n  int kotae = 0;\n\n  rep1(i, N) {\n\n    if (P[i] == i) {\n\n      kotae++;\n\n      i++;\n    }\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  int N = getint();\n\n  int kotae = 0;\n\n  int mae = getint();\n\n  int i = 1;\n\n  for (; i < N; i++) {\n\n    int tugi = getint();\n\n    if (mae == i) {\n\n      kotae++;\n\n      mae = getint();\n\n      i++;\n\n    }\n\n    else\n      mae = tugi;\n  }\n\n  if (i == N && mae == N)\n    kotae++;\n\n  printf(\"%d\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"86fc69fa318912e92e0bd24a6469b99485da6ce6f12875e072a3e7d00b849826","fast_id":"f7c1f423a30a54ad26238677dff7c1e9c592821c397fbff8c6fff88e16fd8e7b","fast_time":0.0050497693,"language":"cpp","measured_fast_code_id":"f7c1f423a30a54ad26238677dff7c1e9c592821c397fbff8c6fff88e16fd8e7b","measured_slow_code_id":"a270409a6fb9c113e03c18a8920d2c2700a710bc3950c9b2270edc9491132733","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25091","problem_id":"p03318","slow_code_id":"ea48c740f7c24f56145318da8076df9a5a9783b465f5e06eb804d7f52a97e2be","slow_id":"a270409a6fb9c113e03c18a8920d2c2700a710bc3950c9b2270edc9491132733","slow_time":0.0267785192,"speedup":5.302919323462955,"stratum":"4-8","sampling_key":"07723d56c7d2712b0cde562af452a64b7adfb40d3540883b44eb7ee203395b2a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long pw[20];\n\nint main() {\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0), cout.tie(0);\n\n  pw[0] = 1;\n\n  for (int i = 1; i < 20; i++)\n    pw[i] = pw[i - 1] * 10;\n\n  int K;\n  cin >> K;\n\n  long long now = 0;\n\n  while (K--) {\n\n    now++;\n\n    auto nxt = now, nxt_sum = 0LL;\n\n    {\n\n      auto buf = now;\n\n      while (buf)\n        nxt_sum += buf % 10, buf /= 10;\n    }\n\n    for (int i = 1; i < 18; i++)\n      if (now >= pw[i]) {\n\n        auto cur = now / pw[i] * pw[i] + pw[i] - 1;\n\n        auto sum = 0LL, buf = cur;\n\n        while (buf)\n          sum += buf % 10, buf /= 10;\n\n        if ((long long)cur * nxt_sum < (long long)nxt * sum) {\n\n          nxt = cur, nxt_sum = sum;\n        }\n      }\n\n    now = nxt;\n\n    cout << now << \"\\n\";\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\ndouble cal(long long x)\n\n{\n\n  long long sum = 0, temp = x;\n\n  while (x)\n\n  {\n\n    sum += x % 10;\n\n    x /= 10;\n  }\n\n  return (double)temp / sum;\n}\n\nint main()\n\n{\n\n  long long num = 0, bot = 1, temp1, temp2;\n\n  int k;\n\n  scanf(\"%d\", &k);\n\n  while (1)\n\n  {\n\n    while (1)\n\n    {\n\n      temp1 = num + bot;\n\n      temp2 = num + bot * 10;\n\n      if (cal(temp1) <= cal(temp2))\n        break;\n\n      else\n        bot = temp2 - num;\n    }\n\n    num += bot;\n\n    printf(\"%lld\\n\", num);\n\n    k--;\n\n    if (!k)\n      break;\n  }\n}"}
{"fast_code_id":"c812bd5a81289993108c7f957db2954adf9a3d149c6dd288201de7656ba6f364","fast_id":"a3545087ef53124aa09f87efa9cc6555ec739b1d25d258c6a3fbfa81a2faac26","fast_time":0.000194629,"language":"cpp","measured_fast_code_id":"a3545087ef53124aa09f87efa9cc6555ec739b1d25d258c6a3fbfa81a2faac26","measured_slow_code_id":"55c53fb54a6226afc5401a69f622758e21eba7cd3704a0e575dfb1709781d9d0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25193","problem_id":"p03638","slow_code_id":"629cee4c18cc2e2df5c89ad3d45779493547d1fe3c5b6d51ccdd3a0ef5b897bf","slow_id":"55c53fb54a6226afc5401a69f622758e21eba7cd3704a0e575dfb1709781d9d0","slow_time":0.0012958497,"speedup":6.658050444692209,"stratum":"4-8","sampling_key":"0df0e46da5339e9cde5734086acda8e583b36e1a73a0d819ad6308101dc73cc3","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 1e2 + 3, maxxn = 1e4 + 2;\n\nvector<pair<int, int> > v[maxn][maxn];\n\nbool mark[maxn][maxn];\n\nint ans[maxn][maxn];\n\npair<int, int> p[maxxn];\n\nint c;\n\nvoid dfs(int u, int k) {\n\n  mark[u][k] = 1;\n\n  if (p[c].first <= 0)\n    c++;\n\n  ans[u][k] = p[c].second;\n\n  p[c].first--;\n\n  for (int i = 0; i < v[u][k].size(); i++) {\n\n    int x1 = v[u][k][i].first, y1 = v[u][k][i].second;\n\n    if (!mark[x1][y1])\n      dfs(x1, y1);\n  }\n}\n\nint main() {\n\n  int h, w, n;\n\n  cin >> h >> w >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    int x;\n\n    cin >> x;\n\n    p[i] = make_pair(x, i + 1);\n  }\n\n  for (int i = 1; i <= h; i++) {\n\n    for (int j = 1; j <= w; j++) {\n\n      if (j + 1 <= w)\n        v[i][j].push_back(make_pair(i, j + 1));\n\n      if (j - 1 > 0)\n        v[i][j].push_back(make_pair(i, j - 1));\n\n      if (i + 1 <= h)\n        v[i][j].push_back(make_pair(i + 1, j));\n\n      if (i - 1 > 0)\n        v[i][j].push_back(make_pair(i - 1, j));\n    }\n  }\n\n  dfs(1, 1);\n\n  for (int i = 1; i <= h; i++) {\n\n    for (int j = 1; j <= w; j++)\n      cout << ans[i][j] << \" \";\n\n    cout << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nconst int maxn = 110;\n\nint tag[maxn * maxn];\n\nint tmp[maxn * maxn];\n\nint ans[maxn][maxn];\n\nint main()\n\n{\n\n  int n, m;\n\n  while (~scanf(\"%d%d\", &n, &m)) {\n\n    int times, cnt = 1, change = 1;\n\n    scanf(\"%d\", &times);\n\n    for (int i = 1; i <= times; i++) {\n\n      scanf(\"%d\", &tag[i]);\n\n      for (int j = 1; j <= tag[i]; j++) {\n\n        tmp[cnt] = i;\n        cnt++;\n      }\n    }\n\n    cnt = 1;\n\n    for (int i = 1; i <= n; i++) {\n\n      if (change == 1) {\n\n        for (int j = 1; j <= m; j++) {\n\n          ans[i][j] = tmp[cnt];\n\n          cnt++;\n        }\n\n      } else {\n\n        for (int j = m; j >= 1; j--) {\n\n          ans[i][j] = tmp[cnt];\n\n          cnt++;\n        }\n      }\n\n      change = change * -1;\n    }\n\n    for (int i = 1; i <= n; i++) {\n\n      for (int j = 1; j <= m; j++) {\n\n        if (j == 1)\n          printf(\"%d \", ans[i][j]);\n\n        else\n          printf(\"%d \", ans[i][j]);\n      }\n\n      printf(\"\\n\");\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"7351661dce4882a89a1eb36aafabd532209fad586173ff0b0f2519e15243c02c","fast_id":"d89a2a565e3558116ff71a028f07ca026d8bf44fe0f6a006b54a03e08acc00f1","fast_time":0.0191692867,"language":"cpp","measured_fast_code_id":"d89a2a565e3558116ff71a028f07ca026d8bf44fe0f6a006b54a03e08acc00f1","measured_slow_code_id":"1574fb4d670ec6709824c7069a884081847d3eac751d586f132d7f44c639f3ba","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25261","problem_id":"p03739","slow_code_id":"8672a6efca1a79e98cc1c1a9f482dc68a03f7b8326f5583688f02ac9e19c7bca","slow_id":"1574fb4d670ec6709824c7069a884081847d3eac751d586f132d7f44c639f3ba","slow_time":0.1931388573,"speedup":10.075432660725973,"stratum":"8+","sampling_key":"d3deccdcca0f36aa550e2914ab83bc609c34c5fb70ac9cffd5aa2b027e4b1501","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(int argc, char **argv) {\n\n  cin.tie(NULL);\n\n  ios::sync_with_stdio(0);\n\n  long n;\n  cin >> n;\n\n  long arr[100010];\n\n  memset(arr, 0, sizeof arr);\n\n  for (int i = 0; i < n; i++) {\n\n    long aux;\n    cin >> aux;\n\n    arr[i] = aux;\n  }\n\n  long contA = 0, contB = 0, sumB = 0, sumA = 0;\n\n  if (arr[0] < 0) {\n\n    contB += abs(arr[0]) + 1;\n\n    sumB = 1;\n\n    sumA = arr[0];\n\n  } else if (arr[0] > 0) {\n\n    contA += abs(arr[0]) + 1;\n\n    sumA = -1;\n\n    sumB = arr[0];\n  }\n\n  if (arr[0] == 0) {\n\n    contB++;\n\n    contA++;\n\n    sumA = -1;\n\n    sumB = 1;\n  }\n\n  for (int i = 1; i < n; i++) {\n\n    if (sumA > 0) {\n\n      sumA += arr[i];\n\n      if (sumA >= 0) {\n\n        contA += sumA + 1;\n\n        sumA = -1;\n      }\n\n    } else if (sumA < 0) {\n\n      sumA += arr[i];\n\n      if (sumA <= 0) {\n\n        contA += abs(sumA) + 1;\n\n        sumA = 1;\n      }\n    }\n\n    if (sumB > 0) {\n\n      sumB += arr[i];\n\n      if (sumB >= 0) {\n\n        contB += sumB + 1;\n\n        sumB = -1;\n      }\n\n    } else if (sumB < 0) {\n\n      sumB += arr[i];\n\n      if (sumB <= 0) {\n\n        contB += abs(sumB) + 1;\n\n        sumB = 1;\n      }\n    }\n  }\n\n  cout << min(contA, contB) << '\\n';\n\n  return 0;\n}\n","fast_code":"#include <cstring>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <memory.h>\n\n#include <algorithm>\n\n#include <map>\n\n#define ll long long\n\n#define ld long double\n\n#define maxn 310\n\n#define For(i, j, k) for (ll i = j; i <= k; ++i)\n\n#define FOr(i, j, k) for (ll i = j; i >= k; --i)\n\nconst ll inf = 1e9;\n\nconst ld eps = 1e-7;\n\nusing namespace std;\n\ninline ll read() {\n  ll x = 0, f = 1;\n  char ch = getchar();\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      f = -1;\n    ch = getchar();\n  }\n  while (ch >= '0' && ch <= '9') {\n    x = x * 10 + ch - '0';\n    ch = getchar();\n  }\n  return x * f;\n}\n\ninline void wrote(ll x) {\n  if (x < 0)\n    putchar('-'), x = -x;\n  if (x >= 10)\n    wrote(x / 10);\n  putchar(x % 10 + '0');\n}\n\nvoid writeln(ll x) {\n  wrote(x);\n  puts(\"\");\n}\n\nconst ll N = 100010;\n\nll a[N], n;\n\nll dis(ll a, ll b) { return abs(a - b); }\n\nll work() {\n\n  ll sum = 0, ans = 0;\n\n  For(i, 1, n) {\n\n    sum += a[i];\n\n    if (i & 1) {\n\n      if (sum <= 0)\n        ans += dis(1, sum), sum = 1;\n\n    } else {\n\n      if (sum >= 0)\n        ans += dis(-1, sum), sum = -1;\n    }\n  }\n  return ans;\n}\n\nint main() {\n\n  n = read();\n\n  For(i, 1, n) a[i] = read();\n\n  ll ans1 = work();\n\n  For(i, 1, n) a[i] = -a[i];\n\n  ll ans2 = work();\n\n  writeln(min(ans1, ans2));\n}"}
{"fast_code_id":"a7cc3e24b2fc7237b528d521215e252ec63cf3563f96df5003fe7fe9777ad86e","fast_id":"ed1491380ad9d50d40667eec13eb8e977ed97344520dcd24cdfea03c38558201","fast_time":0.0216355462,"language":"cpp","measured_fast_code_id":"ed1491380ad9d50d40667eec13eb8e977ed97344520dcd24cdfea03c38558201","measured_slow_code_id":"645ad48b9a0210669a51febc9a88708ea1c2f8a141bb35d5035b049b6f4038ce","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25277","problem_id":"p02779","slow_code_id":"e2dbf659452deaab559af599cb6819b50d57b031fb20e0f9685b461359cf43ca","slow_id":"645ad48b9a0210669a51febc9a88708ea1c2f8a141bb35d5035b049b6f4038ce","slow_time":0.0978538936,"speedup":4.522829823450447,"stratum":"4-8","sampling_key":"72a7e209b5a3025a66608e35331e0dce8c878ffa5c8feb1f15752545fb178665","slow_code":"#include <cstdio>\n\n#include <set>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int N, t;\n\n  scanf(\"%d\", &N);\n\n  set<int> a;\n\n  for (int i = 0; i < N; i++)\n\n  {\n\n    scanf(\"%d\", &t);\n\n    a.insert(t);\n  }\n\n  if (N == a.size())\n    printf(\"YES\\n\");\n\n  else\n    printf(\"NO\\n\");\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int N, a[200000], flag = 1;\n\n  scanf(\"%d\", &N);\n\n  for (int i = 0; i < N; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  sort(a, a + N);\n\n  for (int i = N - 1; i > 0; i--)\n\n  {\n\n    if (a[i] == a[i - 1])\n\n    {\n\n      flag = 0;\n\n      break;\n    }\n  }\n\n  if (flag == 1)\n    printf(\"YES\\n\");\n\n  else\n    printf(\"NO\\n\");\n}\n"}
{"fast_code_id":"159890ccd91b32e25ea64e4639f53eebcda0ea1ff26983929b835971d37995d1","fast_id":"0c41276e8d23246217cee7369ded7e45b440aa5aefbca07a9bd650779ab12e51","fast_time":0.0073935599,"language":"cpp","measured_fast_code_id":"0c41276e8d23246217cee7369ded7e45b440aa5aefbca07a9bd650779ab12e51","measured_slow_code_id":"ef38872d27eb5c62d33ece80413ef6a2013a0e78f02e8cb0cb4f3bddc061a1d5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25323","problem_id":"p03668","slow_code_id":"e6ab8d813bc76914845766396d31fb9b90c8ac6f58a3a28dcfd168eda558758c","slow_id":"ef38872d27eb5c62d33ece80413ef6a2013a0e78f02e8cb0cb4f3bddc061a1d5","slow_time":0.2962474895,"speedup":40.06831533210409,"stratum":"8+","sampling_key":"d9285edda8c48620a19fa05c692ebcf72b0f29a0e2846e2de64355e4ac694657","slow_code":"#include <bits/stdc++.h>\n\n#define int long long\n\n#define rint register int\n\nusing namespace std;\n\ntemplate <typename tp> inline void read(tp &x) {\n\n  x = 0;\n  char c = getchar();\n  int f = 0;\n\n  for (; c < '0' || c > '9'; f |= c == '-', c = getchar())\n    ;\n\n  for (; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0', c = getchar())\n    ;\n\n  if (f)\n    x = -x;\n}\n\nint n;\n\nvector<int> g[233333];\n\ninline int dfs(int u, int fat) {\n\n  int now = 0;\n\n  for (int v : g[u])\n\n    if (v != fat)\n\n      now ^= 1 + dfs(v, u);\n\n  return now;\n}\n\nmain(void) {\n\n  read(n);\n\n  for (int i = 2; i <= n; i++) {\n\n    int x, y;\n    read(x);\n    read(y);\n\n    g[x].push_back(y);\n    g[y].push_back(x);\n  }\n\n  puts(dfs(1, 0) ? \"Alice\" : \"Bob\");\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 2e6 + 5;\n\nstruct node {\n\n  int u, v, nxt;\n\n} edge[N];\n\nint head[N], mcnt;\n\nvoid add_edge(int u, int v) {\n\n  mcnt++;\n\n  edge[mcnt].u = u;\n\n  edge[mcnt].v = v;\n\n  edge[mcnt].nxt = head[u];\n\n  head[u] = mcnt;\n}\n\nint g[N];\n\nint SG(int u, int fa = 0) {\n\n  g[u] = 0;\n\n  for (int i = head[u]; i; i = edge[i].nxt) {\n\n    int v = edge[i].v;\n\n    if (v == fa)\n\n      continue;\n\n    g[u] ^= SG(v, u) + 1;\n  }\n\n  return g[u];\n}\n\nint n;\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++) {\n\n    int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    add_edge(u, v);\n\n    add_edge(v, u);\n  }\n\n  puts(SG(1) ? \"Alice\" : \"Bob\");\n}\n"}
{"fast_code_id":"166b11d86e676b416de30a7fcfa044e433e64c66072ddcec982f31550cda2821","fast_id":"10bf7856d4ce7a48776d3b1448501b9033914f18d2e5be95579a236f6cacc815","fast_time":0.0282145346,"language":"cpp","measured_fast_code_id":"10bf7856d4ce7a48776d3b1448501b9033914f18d2e5be95579a236f6cacc815","measured_slow_code_id":"158ca9dc5d7b2e46137268fae207db98df814d788d6d8e10ebc8916f0571fd0e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25430","problem_id":"p03241","slow_code_id":"5b9d018865c462c65d357f21297b3a31ecabe06053dc731db8d7c267107e4728","slow_id":"158ca9dc5d7b2e46137268fae207db98df814d788d6d8e10ebc8916f0571fd0e","slow_time":0.0832673567,"speedup":2.951222052055397,"stratum":"2-4","sampling_key":"2591064c0685be81f767884d850bee16f4efeab840770cf3a3a5d8b0d47f34a3","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nint main()\n\n{\n\n  ll n, k;\n\n  cin >> n >> k;\n\n  vector<ll> v;\n\n  for (ll i = 1; i * i <= k; i++)\n\n  {\n\n    if (k % i == 0)\n\n    {\n\n      v.push_back(i);\n\n      if (k / i != i)\n        v.push_back(k / i);\n    }\n  }\n\n  ll counter;\n\n  sort(v.begin(), v.end());\n\n  for (int i = 0; i < v.size(); i++)\n\n  {\n\n    if (k / v[i] >= n)\n      counter = v[i];\n  }\n\n  cout << counter << endl;\n}\n","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\nint d[20002], e[20002], c = 0;\n\nint main()\n\n{\n\n  int n, m, i, k, j;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (i = 1, k = sqrt(m); i <= k; i++) {\n\n    if (m % i == 0) {\n\n      d[c] = i;\n\n      e[c++] = m / i;\n    }\n  }\n\n  for (i = c - 1; i >= 0; i--) {\n\n    d[c] = e[i], e[c] = d[i], c++;\n  }\n\n  for (i = c - 1; i >= 0 && e[i] < n; i--)\n    ;\n\n  printf(\"%d\\n\", d[i]);\n\n  return 0;\n}"}
{"fast_code_id":"007a824d9092294cccc979a5189d3eb9c95f741d51a5189901554de930ae0b92","fast_id":"50dc4b9e14c1c45c4b040ce2b30543f4b38422756cdf8c4b664595f0f1d799c9","fast_time":0.1051776592,"language":"cpp","measured_fast_code_id":"50dc4b9e14c1c45c4b040ce2b30543f4b38422756cdf8c4b664595f0f1d799c9","measured_slow_code_id":"92c578ffc5c8b1bcb763efef57d7df9f718d32b89c9c73adb4f1e0c2fac41014","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25451","problem_id":"p02775","slow_code_id":"8eb911cb02f41c9709d470575f3cf0978187460aa3b117f015280d5efa462a0a","slow_id":"92c578ffc5c8b1bcb763efef57d7df9f718d32b89c9c73adb4f1e0c2fac41014","slow_time":1.0011466188,"speedup":9.518624263126783,"stratum":"8+","sampling_key":"53129db5173623de3e2e34259f9cc841c0ca8425b430c5923459c898938a8e47","slow_code":"#include <bits/stdc++.h>\n\n#pragma GCC optimize(\"O3\")\n\nusing namespace std;\n\n#define ll long long\n\n#define ull unsigned long long\n\n#define rep(i, n, N) for (int i = n; i <= N; ++i)\n\n#define rap(i, n, N) for (int i = n; i >= N; --i)\n\n#define mp make_pair\n\n#define pb push_back\n\n#define pob pop_back\n\n#define pf push_front\n\n#define pof pop_front\n\n#define fi first\n\n#define se second\n\n#define ff fi.fi\n\n#define fs fi.se\n\n#define sf se.fi\n\n#define ss se.se\n\n#define lc (id << 1)\n\n#define rc ((id << 1) | 1)\n\n#define db(x) cout << \">>>>>> \" << #x << \" -> \" << x << endl\n\n#define all(x) x.begin(), x.end()\n\n#define pii pair<int, int>\n\n#define pll pair<ll, ll>\n\n#define plll pair<ll, pll>\n\n#define pllll pair<pll, pll>\n\n#define piii pair<int, pii>\n\n#define piiii pair<pii, pii>\n\n#define psi pair<string, int>\n\n#define endl '\\n'\n\nconst int MAX = 1e6 + 5;\n\nconst ll MAX2 = 11;\n\nconst ll MOD = 998244353;\n\nconst ll MOD2 = 1000000006;\n\nconst ll INF = 2e18;\n\nconst int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};\n\nconst int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0};\n\nconst double pi = acos(-1);\n\nconst double EPS = 1e-9;\n\nconst int block = 316;\n\nint n, dp[MAX][2], x[MAX];\n\nchar c;\n\nint f(int pos, bool st) {\n\n  if (pos > n)\n    return 0;\n\n  if (dp[pos][st] != -1)\n    return dp[pos][st];\n\n  if (st)\n    return dp[pos][st] =\n               min(f(pos + 1, 0) + x[pos], f(pos + 1, 1) + 9 - x[pos]);\n\n  return dp[pos][st] = min(f(pos + 1, 0) + x[pos], f(pos + 1, 1) + 11 - x[pos]);\n}\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n  cin.tie(0);\n  cout.tie(0);\n\n  while (cin >> c)\n    x[++n] = c - '0';\n\n  memset(dp, -1, sizeof dp);\n\n  cout << f(1, 0) << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define ull unsigned long long\n\n#define mp make_pair\n\ntypedef pair<int, int> pii;\n\nchar str[1000009];\n\nint f[1000009];\n\nint main()\n\n{\n\n  scanf(\"%s\", str + 1);\n\n  int len = strlen(str + 1);\n\n  int answer = 0;\n\n  for (int i = 1; i <= len; i++) {\n\n    f[i] = str[i] - '0';\n  }\n\n  for (int i = 1; i <= len + 10; i++)\n\n  {\n\n    if (f[i] >= 10) {\n\n      f[i] -= 10;\n\n      f[i + 1]++;\n    }\n\n    if (f[i] >= 6) {\n\n      answer += 10 - f[i];\n\n      f[i + 1]++;\n\n    }\n\n    else if (f[i] == 5) {\n\n      answer += 5;\n\n      if (f[i + 1] >= 5) {\n\n        f[i + 1]++;\n      }\n\n    }\n\n    else\n      answer += f[i];\n  }\n\n  cout << answer << endl;\n\n  return 0;\n}"}
{"fast_code_id":"717b9e6763d63554f126bd11d8ab30dc3a8679c08b010f70dc7b505306d5eba7","fast_id":"fb6646272a4a4794bec0a744000d17e64194313929552cdd0d846d5ccc3b71a1","fast_time":0.0097715292,"language":"cpp","measured_fast_code_id":"fb6646272a4a4794bec0a744000d17e64194313929552cdd0d846d5ccc3b71a1","measured_slow_code_id":"0ed0699fed075f6fd5fd88f2361078b02878e73c9aaa7d213f734afbf3dfdd55","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25459","problem_id":"p02602","slow_code_id":"2fff0372178c68676866f6f4e77abecc46b91cf1976fec5c34ee02d9e4425b72","slow_id":"0ed0699fed075f6fd5fd88f2361078b02878e73c9aaa7d213f734afbf3dfdd55","slow_time":0.1367462371,"speedup":13.994353831537442,"stratum":"8+","sampling_key":"b08bfc89e8aaf6aa3731c74d1849cede7cd575323299aed756a8deb85504a2b6","slow_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <queue>\n\n#include <cmath>\n\n#include <math.h>\n\nusing namespace std;\n\nint main() {\n\n  long int a[200005], n, k;\n\n  memset(a, 0, sizeof(a));\n\n  cin >> n >> k;\n\n  for (long int i = 0; i < n; i++) {\n\n    cin >> a[i];\n  }\n\n  for (long int i = k; i < n; i++) {\n\n    if (a[i] > a[i - k])\n      cout << \"Yes\" << endl;\n\n    else\n      cout << \"No\" << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int t, k;\n\n  scanf(\"%d %d\", &t, &k);\n\n  int nilai[t];\n\n  for (int i = 0; i < t; i++) {\n\n    scanf(\"%d\", &nilai[i]);\n  }\n\n  for (int i = 0; i < t - k; i++) {\n\n    (nilai[i] < nilai[i + k]) ? puts(\"Yes\") : puts(\"No\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"022c48880b15928734aa70c1fde280224c50942841a995630533270649caad44","fast_id":"b8e546d96a07b181dae83c400ce8aeb23c7217b237767f3507f611d097abf53c","fast_time":0.0223272135,"language":"cpp","measured_fast_code_id":"b8e546d96a07b181dae83c400ce8aeb23c7217b237767f3507f611d097abf53c","measured_slow_code_id":"18963ee85096dd38cef9aefabc9b465679023b3f773d8c09fcdd360a5312922b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25485","problem_id":"p03354","slow_code_id":"919514eea042e73d2c0f7c8b02629cf98ae337e82be82915070c166de533e6d2","slow_id":"18963ee85096dd38cef9aefabc9b465679023b3f773d8c09fcdd360a5312922b","slow_time":0.985846892,"speedup":44.154497470094064,"stratum":"8+","sampling_key":"738eebaddc69f3ff287aea53344285daae775c28ab2a5928f07292ebd425c5f6","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<double, int> pdi;\n\nconst int N = 100005;\n\nint a[N];\n\nint fa[N];\n\nvector<int> rec[N];\n\nset<int> big[N];\n\nmap<int, int> mp;\n\nint fat(int x)\n\n{\n\n  if (fa[x] == x)\n\n    return x;\n\n  return fa[x] = fat(fa[x]);\n}\n\nint main()\n\n{\n\n  int n, m, x, y, fax, fay;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++)\n\n    fa[i] = i;\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  for (int i = 0; i < m; i++)\n\n  {\n\n    scanf(\"%d%d\", &x, &y);\n\n    fax = fat(x);\n\n    fay = fat(y);\n\n    if (fax != fay)\n\n      fa[fax] = fay;\n  }\n\n  int cnt = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int f = fat(i);\n\n    if (!mp.count(f))\n\n    {\n\n      mp.insert(pii(f, ++cnt));\n    }\n\n    int id = mp[f];\n\n    big[id].insert(a[i]);\n  }\n\n  int ans = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int f = fat(i);\n\n    int id = mp[f];\n\n    if (big[id].count(i))\n\n      ans++;\n  }\n\n  printf(\"%d\\n\", ans);\n}\n","fast_code":"#include <cstdio>\n\n#define MAX 100001\n\nint Tree[MAX];\n\nint findRoot(int x) {\n\n  if (Tree[x] == x)\n    return x;\n\n  else {\n\n    int tmp = findRoot(Tree[x]);\n\n    Tree[x] = tmp;\n\n    return tmp;\n  }\n}\n\nusing namespace std;\n\nint main()\n\n{\n\n  int list[MAX];\n\n  int belong[MAX];\n\n  int n, m;\n\n  while (scanf(\"%d%d\", &n, &m) != EOF) {\n\n    for (int i = 1; i <= n; i++) {\n\n      scanf(\"%d\", &list[i]);\n\n      Tree[i] = i;\n    }\n\n    while (m--) {\n\n      int a, b;\n\n      scanf(\"%d%d\", &a, &b);\n\n      int na = findRoot(a);\n\n      int nb = findRoot(b);\n\n      if (na != nb)\n        Tree[na] = nb;\n    }\n\n    int ans = 0;\n\n    for (int i = 1; i <= n; i++) {\n\n      int t = findRoot(i);\n\n      belong[list[i]] = t;\n    }\n\n    for (int i = 1; i <= n; i++) {\n\n      if (belong[i] == Tree[i])\n\n        ans++;\n    }\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"5cbf7c3715f1dbbe599ff0081e098b194f67172c41620f311bb8ce22b80ed4e6","fast_id":"80609ce78f7499e2bbcec9c6050e061c19343019a7615a5830031216f6010e24","fast_time":0.0386457895,"language":"cpp","measured_fast_code_id":"80609ce78f7499e2bbcec9c6050e061c19343019a7615a5830031216f6010e24","measured_slow_code_id":"eb465cc3899d8c7f6cc57040e237335dd543e564df95748df247b4191cb5dea5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25532","problem_id":"p01754","slow_code_id":"cb78a006217918de9fa1b569038c87b5cae4a5cdd799cbf031dbba458588dc85","slow_id":"eb465cc3899d8c7f6cc57040e237335dd543e564df95748df247b4191cb5dea5","slow_time":0.1166475602,"speedup":3.018376948929973,"stratum":"2-4","sampling_key":"b76d6803f9294709731b96e18f49ae8f42f392690e6f751e0402c35739cab5d8","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, int> Pa;\n\nstruct BIT {\n\n  int d[500005];\n\n  int n;\n\n  void init(int _n) {\n\n    n = _n;\n\n    memset(d, 0, sizeof(d));\n  }\n\n  void add(int i, int x) {\n\n    while (i <= n) {\n\n      d[i] += x;\n\n      i += i & -i;\n    }\n  }\n\n  int sum(int i) {\n\n    int s = 0;\n\n    while (i > 0) {\n\n      s += d[i];\n\n      i -= i & -i;\n    }\n\n    return s;\n  }\n};\n\nll N, P, Q;\n\nBIT bit;\n\nPa C[500005];\n\nint main() {\n\n  cin >> N >> P >> Q;\n\n  ll sum = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    ll c;\n    cin >> c;\n    sum += c;\n\n    C[i] = Pa((ll)(Q - i) * P - c, i);\n  }\n\n  sort(C, C + N);\n\n  bit.init(N);\n\n  ll res = sum;\n\n  for (int i = N - 1; i > -1; i--) {\n\n    ll p = N - 1 - i;\n\n    res = max(res, sum + C[i].first + 2LL * p * P);\n\n    sum = sum + C[i].first + 2LL * p * P;\n\n    bit.add(C[i].second + 1, 1);\n  }\n\n  cout << res << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, int> Pa;\n\nll N, P, Q;\n\nPa C[500005];\n\nint main() {\n\n  cin >> N >> P >> Q;\n\n  ll sum = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    ll c;\n    cin >> c;\n    sum += c;\n\n    C[i] = Pa((ll)(Q - i) * P - c, i);\n  }\n\n  sort(C, C + N);\n\n  ll res = sum;\n\n  for (int i = N - 1; i > -1; i--) {\n\n    ll p = N - 1 - i;\n\n    res = max(res, sum + C[i].first + 2LL * p * P);\n\n    sum = sum + C[i].first + 2LL * p * P;\n  }\n\n  cout << res << endl;\n}"}
{"fast_code_id":"23063db6cccb0829fa8378ce99151e3367aca0c458c749f478807b79deaebd19","fast_id":"38486f1aa96f74459cee22a31e0d2ae60510803cb537846fa88242d9488f8917","fast_time":0.0508871752,"language":"cpp","measured_fast_code_id":"38486f1aa96f74459cee22a31e0d2ae60510803cb537846fa88242d9488f8917","measured_slow_code_id":"f782e240d89c2468584b313a48e094bf1da05a45aad2251d643df4a036e6a471","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25572","problem_id":"p02553","slow_code_id":"bddaeba9897fc8a37a693301ccdd7a057c29add9cf1b176e6a18a45c7298f453","slow_id":"f782e240d89c2468584b313a48e094bf1da05a45aad2251d643df4a036e6a471","slow_time":0.4831719041,"speedup":9.49496414766603,"stratum":"8+","sampling_key":"1602fcbd5ab52c9f1b8158ee95c7e3c45e78a79cd9a7b1d6fd5a88dfd10d57d5","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define Ff(i, a, n) for (i = a; i < n; i++)\n\n#define Fr(i, a, n) for (i = a; i > n; i--)\n\n#define ll long long\n\n#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n#define pb push_back\n\n#define ff first\n\n#define ss second\n\n#define all(x) x.begin(), x.end()\n\n#define clr(x) memset(x, 0, sizeof(x))\n\n#define sortall(x) sort(all(x))\n\n#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)\n\ntypedef pair<ll, ll> pa;\n\ntypedef vector<ll> vc;\n\ntypedef vector<pa> vp;\n\ntypedef vector<vc> vvc;\n\nint mpow(int base, int exp);\n\nvoid ipgraph(ll n, ll m);\n\nvoid dfs(int u, int par);\n\nconst int mod = 1000000007;\n\nconst int N = 3e5, M = N;\n\nvc g[N];\n\nint main() {\n\n  FAST;\n\n  ll t, i, l, j, k, p, q, r, x, y, u, v, n, m;\n\n  n = 4;\n\n  vc a(n);\n\n  Ff(i, 0, n)\n\n          cin >>\n      a[i];\n\n  ll maxi = -1e18;\n\n  Ff(i, 0, 2)\n\n  {\n\n    Ff(j, 2, n)\n\n    {\n\n      maxi = max(maxi, a[i] * a[j]);\n    }\n  }\n\n  cout << maxi << \"\\n\";\n\n  return 0;\n}\n\nint mpow(int base, int exp) {\n\n  base %= mod;\n\n  int result = 1;\n\n  while (exp > 0) {\n\n    if (exp & 1)\n      result = ((ll)result * base) % mod;\n\n    base = ((ll)base * base) % mod;\n\n    exp >>= 1;\n  }\n\n  return result;\n}\n\nvoid ipgraph(ll n, ll m) {\n\n  int i, u, v;\n\n  while (m--) {\n\n    cin >> u >> v;\n\n    g[u - 1].pb(v - 1);\n\n    g[v - 1].pb(u - 1);\n  }\n}\n\nvoid dfs(int u, int par) {\n\n  for (int v : g[u]) {\n\n    if (v == par)\n      continue;\n\n    dfs(v, u);\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <cstring>\n\n#define ios ios::sync_with_stdio(false)\n\n#define mem(arr) memset(arr, 0, sizeof(arr))\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst ll maxn = 1e6 + 10;\n\nint main()\n\n{\n\n  ll a, b, c, d;\n\n  ll sum;\n\n  cin >> a >> b >> c >> d;\n\n  sum = max(b * c, b * d);\n\n  sum = max(sum, a * c);\n\n  sum = max(sum, a * d);\n\n  cout << sum << endl;\n\n  return 0;\n}"}
{"fast_code_id":"02b26898a3b0c7200bd8137d7770e1147ad99280dc43315076bd0e276ff54d10","fast_id":"2a938801522e2ce42ad90b1b47ef0e6150b4808caa6ae3991ba1405edf5dc264","fast_time":0.0010142118,"language":"cpp","measured_fast_code_id":"2a938801522e2ce42ad90b1b47ef0e6150b4808caa6ae3991ba1405edf5dc264","measured_slow_code_id":"19ef6890d347e7bf472d345aa1b50c9edc0dddc2cda8cd731b911f01e7d53599","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25604","problem_id":"p03525","slow_code_id":"33aef8a36051fab7a8c8db3e3aea6d29d61988e7b356bcf1b26bc66776ae6a7f","slow_id":"19ef6890d347e7bf472d345aa1b50c9edc0dddc2cda8cd731b911f01e7d53599","slow_time":0.002223984,"speedup":2.1928200795928428,"stratum":"2-4","sampling_key":"22fddf3c1deb98df79eb67d114a9013678544c189653326e6434ff09f5348968","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define pb push_back\n\n#define sz(x) ((int)x.size())\n\n#define sqr(x) ((x) * (x))\n\n#define mem(a) memset(a, 0, sizeof(a))\n\n#define all(x) x.begin(), x.end()\n\ntypedef pair<int, int> pii;\n\ntypedef long long ll;\n\ntypedef pair<ll, int> pli;\n\nconst int mn = 3e5 + 5;\n\nconst int maxlog = 19;\n\nint n;\n\nint a[55];\n\nint cnt[15];\n\nint main() {\n\n#ifdef trote\n\n  freopen(\"../1.txt\", \"r\", stdin);\n\n  freopen(\"../out.txt\", \"w\", stdout);\n\n#endif\n\n  scanf(\"%d\", &n);\n\n  cnt[0]++;\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%d\", &a[i]);\n\n    cnt[a[i]]++;\n  }\n\n  for (int i = 0; i <= 12; i++) {\n\n    if (cnt[i] >= 3) {\n\n      puts(\"0\");\n\n      return 0;\n    }\n  }\n\n  sort(a + 1, a + n + 1);\n\n  int ans = 0;\n\n  for (int i = 0; i < (1 << 12); i++) {\n\n    vector<int> v;\n\n    for (int j = 0; j <= 12; j++) {\n\n      if (cnt[j] == 2) {\n\n        v.pb(j);\n\n        v.pb(24 - j);\n\n      }\n\n      else if (cnt[j] == 1) {\n\n        if ((1 << j) & i)\n          v.pb(24 - j);\n\n        else\n          v.pb(j);\n      }\n    }\n\n    sort(all(v));\n\n    v.pb(24);\n\n    int uans = 25;\n\n    for (int i = 1; i < sz(v); i++) {\n\n      uans = min(uans, v[i] - v[i - 1]);\n    }\n\n    ans = max(ans, uans);\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, a[55], b[55];\n\nint solve() {\n\n  sort(b + 1, b + 1 + n);\n\n  int ans = 0x3f3f3f3f;\n\n  for (int i = 2; i <= n; i++)\n    ans = min(ans, b[i] - b[i - 1]);\n\n  ans = min(ans, b[1]);\n\n  ans = min(ans, 24 - b[n]);\n\n  return ans;\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n    scanf(\"%d\", &a[i]);\n\n  sort(a + 1, a + 1 + n);\n\n  for (int i = 1; i <= n; i++) {\n\n    if (i & 1)\n      b[i] = 24 - a[i];\n\n    else\n      b[i] = a[i];\n  }\n\n  int ans = solve();\n\n  for (int i = 1; i <= n; i++) {\n\n    if (i & 1)\n      b[i] = a[i];\n\n    else\n      b[i] = 24 - a[i];\n  }\n\n  ans = max(ans, solve());\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"fddc5cc556dd3880f8d6c56312d34ad43d3cbb4d97a1960f382035f7a1ed636b","fast_id":"b47c1750d7a8aaa8c5441b1c6064d22c20260d3b2bf8bc4a32d515caad15ca1b","fast_time":0.0198599661,"language":"cpp","measured_fast_code_id":"b47c1750d7a8aaa8c5441b1c6064d22c20260d3b2bf8bc4a32d515caad15ca1b","measured_slow_code_id":"339bd0154d4a00bebbededc3cf951d17edfc1ac3b64890e50316b1c13b9ad987","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25651","problem_id":"p03785","slow_code_id":"5eed55566ebd7db4ccf5a63fe4a15e9ce7f09bb0bd6c9211f8302bf3944d8ed2","slow_id":"339bd0154d4a00bebbededc3cf951d17edfc1ac3b64890e50316b1c13b9ad987","slow_time":0.1901960695,"speedup":9.576857711756114,"stratum":"8+","sampling_key":"8763a502591f9cd91461c6ab516473c7ed463ee5c2b9fb92a62cf817caec327a","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <queue>\n\n#include <cmath>\n\n#include <iostream>\n\n#include <algorithm>\n\n#define mt(a) memset(a, 0, sizeof(a))\n\n#define ll long long\n\nusing namespace std;\n\nint main(void)\n\n{\n\n  int n, c, k;\n\n  int p[200005];\n\n  mt(p);\n\n  cin >> n >> c >> k;\n\n  for (int i = 1; i <= n; i++)\n\n    cin >> p[i];\n\n  sort(p + 1, p + 1 + n);\n\n  ll ans = 1;\n\n  int t = 1;\n\n  int sum = 1;\n\n  for (int i = 2; i <= n; i++)\n\n  {\n\n    if (p[i] <= p[t] + k && sum < c)\n\n    {\n\n      sum++;\n\n    }\n\n    else\n\n    {\n\n      sum = 1;\n\n      ans++;\n\n      t = i;\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define N 110000\n\nusing namespace std;\n\nint n, c, k, t[N], l;\n\nint main() {\n\n  scanf(\"%d%d%d\", &n, &c, &k);\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%d\", &t[i]);\n\n  sort(t + 1, t + n + 1);\n\n  int ans = 0;\n\n  l = 1;\n\n  t[n + 1] = 0x7FFFFFFF;\n\n  for (int i = 2; i <= n + 1; ++i) {\n\n    int sum = 0;\n\n    while (l < i and t[l] + k < t[i])\n      l += min(i - l, c), sum++;\n\n    ans += sum;\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"59387744a2f08e9922cf100b5d994c2d91764cb2d81d37a38cb08a16da92fe52","fast_id":"58e5f2b34a6fac75b0207357c442e98c5cb4552ddcb5d9d9db3caa1848cc944e","fast_time":0.0001925346,"language":"cpp","measured_fast_code_id":"58e5f2b34a6fac75b0207357c442e98c5cb4552ddcb5d9d9db3caa1848cc944e","measured_slow_code_id":"78a42cb25912fc28bd5d43c8b2baa1b41e9f02f5c9659842380f014169d51be2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25692","problem_id":"p04013","slow_code_id":"e12eef08b9f8012e025472e26c1c497edf899cbe7b788ca3cffc7d2e4b591982","slow_id":"78a42cb25912fc28bd5d43c8b2baa1b41e9f02f5c9659842380f014169d51be2","slow_time":0.0038575812,"speedup":20.03578162055028,"stratum":"8+","sampling_key":"2c623a6b566083443676e3eedc969b775accf193b07a40e950d378358d5c49d5","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, A, a[51];\n\nlong long f[2][51][2510];\n\nint main() {\n\n  cin >> n >> A;\n\n  for (int i = 1; i <= n; ++i)\n    cin >> a[i];\n\n  f[0][0][0] = 1;\n\n  for (int i = 1; i <= n; ++i) {\n\n    memset(f[i & 1], 0, sizeof(f[i & 1]));\n\n    for (int j = 0; j <= i; ++j) {\n\n      for (int k = 0; k <= 2500; ++k) {\n\n        f[i & 1][j][k] =\n            ((k - a[i] >= 0 && j > 0) ? f[i & 1 ^ 1][j - 1][k - a[i]] : 0) + f[(i & 1) ^ 1][j][k];\n      }\n    }\n  }\n\n  long long ans = 0;\n\n  for (int i = 1; i <= n; ++i) {\n\n    ans += f[n & 1][i][i * A];\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#define int long long\n\nusing namespace std;\n\nint n, m, a[55], f[55][8005], ans;\n\nsigned main() {\n\n  scanf(\"%lld %lld\", &n, &m);\n\n  f[0][0] = 1;\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%lld\", &a[i]);\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = i; j > 0; j--)\n\n      for (int k = m * n; k >= a[i]; k--)\n\n        f[j][k] += f[j - 1][k - a[i]];\n\n  for (int i = 1; i <= n; i++)\n\n    ans += f[i][i * m];\n\n  printf(\"%lld\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"d989b0ad46d05067ff898b3ec10f0279b68560d0adcabd6475c03f3b968fab81","fast_id":"26707f25d0faffea9ab4a6380124dde24b1318a192a3e2d31942b95c15e9d71b","fast_time":0.0051803995,"language":"cpp","measured_fast_code_id":"26707f25d0faffea9ab4a6380124dde24b1318a192a3e2d31942b95c15e9d71b","measured_slow_code_id":"950ea5c2e77f95219bc2db8784798f421447b0c1a07c51c43208cff065d82be6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25762","problem_id":"p03332","slow_code_id":"d0526bbfde086f22f07afd6cd238d36b3dd10775d922905fa8c977697f9c0cb0","slow_id":"950ea5c2e77f95219bc2db8784798f421447b0c1a07c51c43208cff065d82be6","slow_time":0.1634680416,"speedup":31.55510334675926,"stratum":"8+","sampling_key":"bbb1150ce6bd79019c8cb3785e2a8c11b9730d8ea9c0e764acc9d1c9a537ebb7","slow_code":"#include <bits/stdc++.h>\n\n#define int long long\n\nusing namespace std;\n\nconst int N = 3e5 + 5;\n\nconst int MOD = 998244353;\n\nint n, a, b, k;\n\nint fac[N], ifac[N];\n\nint fpow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y & 1)\n      res = res * x % MOD;\n\n    x = x * x % MOD;\n\n    y >>= 1;\n  }\n\n  return res;\n}\n\nvoid prec() {\n\n  fac[0] = 1;\n\n  for (int i = 1; i < N; ++i)\n    fac[i] = fac[i - 1] * i % MOD;\n\n  ifac[N - 1] = fpow(fac[N - 1], MOD - 2);\n\n  for (int i = N - 2; i >= 0; --i)\n    ifac[i] = ifac[i + 1] * (i + 1) % MOD;\n}\n\nint C(int k, int n) {\n\n  if (n < k || k < 0)\n    return 0;\n\n  return fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;\n}\n\nsigned main() {\n\n  ios_base::sync_with_stdio(false);\n\n  prec();\n\n  cin >> n >> a >> b >> k;\n\n  int res = 0;\n\n  for (int x = 0; x <= n; ++x) {\n\n    if ((k - x * a) % b)\n      continue;\n\n    int y = (k - x * a) / b;\n\n    res = (res + C(x, n) * C(y, n)) % MOD;\n  }\n\n  cout << res << '\\n'\n\n      ;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define N 300010\n\n#define Mod 998244353\n\n#define LL long long\n\nLL s1[N], s2[N];\n\nLL find(LL x, LL y)\n\n{\n\n  LL ans = 1;\n\n  x = x % Mod;\n\n  while (y)\n\n  {\n\n    if (y % 2)\n\n      ans = ans * x % Mod;\n\n    x = x * x % Mod;\n\n    y = y / 2;\n  }\n\n  return ans;\n}\n\nint main()\n\n{\n\n  LL n, m, x, y;\n\n  LL i, j, k;\n\n  LL ans;\n\n  scanf(\"%lld%lld%lld%lld\", &n, &x, &y, &m);\n\n  s1[0] = 1;\n\n  for (i = 1; i <= n; i++)\n\n    s1[i] = s1[i - 1] * i % Mod;\n\n  s2[n] = find(s1[n], Mod - 2);\n\n  for (i = n; i >= 1; i--)\n\n    s2[i - 1] = s2[i] * i % Mod;\n\n  ans = 0;\n\n  for (i = 0; i <= n; i++)\n\n  {\n\n    if ((m - i * x) % y != 0 || (m - i * x < 0) || (m - i * x) / y > n)\n\n      continue;\n\n    ans =\n        (ans + s1[n] * s2[i] % Mod * s2[n - i] % Mod * s1[n] % Mod *\n                   s2[(m - i * x) / y] % Mod * s2[n - (m - i * x) / y] % Mod) %\n        Mod;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"54a718d7499508dd649856a9d0170cd5ee18efff4abaf4a6445be0cf91989d2d","fast_id":"4bc3ecba81cfb3c2f1891e95e27d5926a54fd46103375f13617db06d2dd1acf9","fast_time":0.010783177,"language":"cpp","measured_fast_code_id":"4bc3ecba81cfb3c2f1891e95e27d5926a54fd46103375f13617db06d2dd1acf9","measured_slow_code_id":"4dd8ac547b8d6fe86363a6a5460d70cbc5a5ec1b1dfd284f0f690ca2acccf528","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25782","problem_id":"p01462","slow_code_id":"7ee3cff4554667b00b6552112daa4a099802787130fdbb934734d6ecef634940","slow_id":"4dd8ac547b8d6fe86363a6a5460d70cbc5a5ec1b1dfd284f0f690ca2acccf528","slow_time":0.0649773087,"speedup":6.02580377749526,"stratum":"4-8","sampling_key":"68652ae8b2ea9f870d4ba818f420ec24773585a11bff165238b6dc0408ca683b","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <algorithm>\n\n#include <iostream>\n\nusing namespace std;\n\nint n, m, p;\n\nint num[20000 + 10];\n\ndouble dp[20000 + 10];\n\nstruct E\n\n{\n\n  int u, v;\n\n} e[100 + 10];\n\ndouble qpow(double d, int c)\n\n{\n\n  if (c == 0)\n    return 1;\n\n  if (c == 1)\n    return d;\n\n  double ret = qpow(d, c / 2);\n\n  ret = ret * ret;\n\n  if (c & 1)\n    ret = ret * d;\n\n  return ret;\n}\n\nint main()\n\n{\n\n  while (scanf(\"%d%d%d\", &n, &m, &p) != EOF)\n\n  {\n\n    memset(num, 0, sizeof(num));\n\n    memset(dp, 0, sizeof(dp));\n\n    for (int i = 1; i <= m; i++)\n\n    {\n\n      scanf(\"%d%d\", &e[i].u, &e[i].v);\n    }\n\n    for (int i = 1; i < (1 << n); i++)\n\n    {\n\n      for (int j = 1; j <= m; j++)\n\n      {\n\n        if (i & (1 << (e[j].u - 1)) && i & (1 << (e[j].v - 1)))\n          num[i]++;\n      }\n    }\n\n    for (int i = 1; i < (1 << n); i++)\n\n    {\n\n      for (int j = i & (i - 1); j; j = i & (j - 1))\n\n      {\n\n        if (j & (i & (-i)))\n\n          dp[i] += (1 - dp[j]) * qpow(p * 1.0 / 100, num[i] - num[j] - num[i & (~j)]);\n      }\n    }\n\n    printf(\"%.12f\\n\", 1 - dp[(1 << n) - 1]);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <cmath>\n\n#define maxst 1 << 20\n\nusing namespace std;\n\nint n, m, p, u, v;\n\nint r[maxst];\n\ndouble f[maxst];\n\nint main() {\n\n  scanf(\"%d%d%d\", &n, &m, &p);\n\n  const int maxs = 1 << n;\n\n  for (int i = 0; i < m; i++) {\n\n    scanf(\"%d%d\", &u, &v);\n\n    u--;\n    v--;\n\n    for (int j = 0; j < maxs; j++)\n      if ((j & (1 << u)) && (j & (1 << v)))\n\n        r[j]++;\n  }\n\n  for (int i = 1; i < maxs; i++)\n    if (i & 1) {\n\n      f[i] = 1.0;\n\n      for (int j = i & (i - 1); j; j = i & (j - 1))\n        if (j & 1)\n\n          f[i] -= f[j] * pow(p * 0.01, r[i] - r[j] - r[(~j) & i]);\n    }\n\n  printf(\"%.9f\\n\", f[maxs - 1]);\n\n  return 0;\n}"}
{"fast_code_id":"6d23d2e4246a42aa250b3cb1c77143c15679eb4ab3637ae3759280e84d9b68c9","fast_id":"95b4008abca52da92f5c91998feb34de846d317a527dd9bb827de10cf547bb9c","fast_time":0.0734500535,"language":"cpp","measured_fast_code_id":"95b4008abca52da92f5c91998feb34de846d317a527dd9bb827de10cf547bb9c","measured_slow_code_id":"d447e13ba18dba1fab3e190b81430e629d1516e97061b69c2dce080986480949","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25793","problem_id":"p01777","slow_code_id":"fe3288648ca3f887afb2db842b027e09859144f51fe9e45a8dce9bda87d9c1e4","slow_id":"d447e13ba18dba1fab3e190b81430e629d1516e97061b69c2dce080986480949","slow_time":0.7590925102,"speedup":10.33481221630424,"stratum":"8+","sampling_key":"a5b67684ef3c44043b09639804a4efa39ecfeacc197b13ab62f90d71e8cbbe98","slow_code":"#include <vector>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint D, Q, x[131072], ls, rs, es, a, b;\nvector<int> seg[262144];\n\nint query(int k, int l, int r) {\n\n  if (r <= ls || rs <= l)\n    return 0;\n\n  if (ls <= l && r <= rs)\n    return lower_bound(seg[k].begin(), seg[k].end(), b) -\n           lower_bound(seg[k].begin(), seg[k].end(), a);\n\n  int lc = query(2 * k, l, (l + r) / 2);\n\n  int rc = query(2 * k + 1, (l + r) / 2, r);\n\n  return lc + rc;\n}\n\nint main() {\n\n  scanf(\"%d\", &D);\n\n  for (int i = 0; i < D; i++) {\n\n    scanf(\"%d\", &x[i]);\n\n    int t = i + 131072;\n\n    while (t > 0) {\n\n      seg[t].push_back(x[i]);\n\n      t >>= 1;\n    }\n  }\n\n  for (int i = 1; i < 262144; i++) {\n\n    if (seg[i].size() > 1) {\n\n      sort(seg[i].begin(), seg[i].end());\n    }\n  }\n\n  scanf(\"%d\", &Q);\n\n  for (int i = 0; i < Q; i++) {\n\n    scanf(\"%d%d%d\", &ls, &rs, &es);\n    ls--;\n\n    a = min(x[ls], x[rs - 1]) - es;\n\n    b = max(x[ls], x[rs - 1]) + es + 1;\n\n    printf(\"%d\\n\", rs - ls - query(1, 0, 131072));\n  }\n\n  return 0;\n}","fast_code":"#ifndef ___Class_RangeTree\n\n#define ___Class_RangeTree\n\n#include <limits>\n\n#include <vector>\n\n#include <algorithm>\n\ntemplate <typename Type> class RangeTree {\n\nprivate:\n  int size_;\n\n  std::vector<std::vector<Type> > dat;\n\n  std::vector<std::vector<int> > vl;\n\n  inline int query_(int a, int b, Type x, int k, int l, int r, int e) {\n\n    if (r <= a || b <= l || e == 0)\n      return 0;\n\n    if (a <= l && r <= b)\n      return e;\n\n    int lc = query_(a, b, x, k << 1, l, (l + r) >> 1, vl[k][e - 1]);\n\n    int rc = query_(a, b, x, k << 1 | 1, (l + r) >> 1, r, e - vl[k][e - 1]);\n\n    return lc + rc;\n  }\n\npublic:\n  RangeTree() : size_(0), dat(std::vector<Type>()){};\n\n  template <class T>\n\n  RangeTree(T begin_, T end_) {\n\n    int n = (end_ - begin_);\n\n    for (size_ = 1; size_ < n; size_ <<= 1)\n      ;\n\n    dat.resize(size_ << 1);\n\n    vl.resize(size_);\n\n    for (int i = 0; i < n; i++)\n      dat[i + size_].push_back(*(begin_ + i));\n\n    for (int i = size_ - 1; i > 0; i--) {\n\n      dat[i].resize(dat[i << 1].size() + dat[i << 1 | 1].size());\n\n      vl[i].resize(dat[i].size());\n\n      int cl = 0;\n\n      for (int j = 0; j < dat[i].size(); j++) {\n\n        if (j - cl == dat[i << 1 | 1].size() ||\n            (cl != dat[i << 1].size() && dat[i << 1][cl] < dat[i << 1 | 1][j - cl]))\n          dat[i][j] = dat[i << 1][cl++];\n\n        else\n          dat[i][j] = dat[i << 1 | 1][j - cl];\n\n        vl[i][j] = cl;\n      }\n    }\n  }\n\n  inline int size() { return size_; }\n\n  inline int query(int l, int r, Type x) {\n\n    int ptr = lower_bound(dat[1].begin(), dat[1].end(), x) - dat[1].begin();\n\n    return query_(l, r, x, 1, 0, size_, ptr);\n  }\n};\n\n#endif\n\n#include <cstdio>\n\n#include <vector>\n\n#include <algorithm>\n\n#pragma warning(disable : 4996)\n\nusing namespace std;\n\nint n, q, l, r, e;\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  vector<int> a(n);\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &a[i]);\n\n  RangeTree<int> seg(a.begin(), a.end());\n\n  scanf(\"%d\", &q);\n\n  while (q--) {\n\n    scanf(\"%d%d%d\", &l, &r, &e);\n    l--;\n\n    int x1 = seg.query(l, r, min(a[l], a[r - 1]) - e);\n\n    int x2 = seg.query(l, r, max(a[l], a[r - 1]) + e + 1);\n\n    printf(\"%d\\n\", (r - l) - (x2 - x1));\n  }\n\n  return 0;\n}"}
{"fast_code_id":"523733c62428260fb2e82a84ad989600108f49581aecf8ac0685c4bb743f8b8d","fast_id":"875f09d1ac3ee518ce8cdd733e34cfad73154a55606d88990264ac61bd2eb9a8","fast_time":0.0103341979,"language":"cpp","measured_fast_code_id":"875f09d1ac3ee518ce8cdd733e34cfad73154a55606d88990264ac61bd2eb9a8","measured_slow_code_id":"1eea9c4b5424492c8be9e7e0da2e64c6ac10e0cf51aacd99d6fa1c26adfb135b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25800","problem_id":"p03609","slow_code_id":"f2c4ae5353f7554fe2df0444b79c81bd04629346bf6e0ad6c69602cdbec95f7e","slow_id":"1eea9c4b5424492c8be9e7e0da2e64c6ac10e0cf51aacd99d6fa1c26adfb135b","slow_time":0.0548379314,"speedup":5.3064526081893595,"stratum":"4-8","sampling_key":"13ad983a5492eba90d5b7131935f5abe7889ddf4c87f6de7f73204b6f98ddbdb","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  long long int x, t;\n\n  cin >> x >> t;\n\n  if (x - t == 0)\n\n  {\n\n    cout << 0 << endl;\n  }\n\n  if (x - t > 0)\n\n  {\n\n    cout << x - t << endl;\n  }\n\n  if (x - t < 0)\n\n  {\n\n    cout << 0 << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int x, y;\n\n  while (~scanf(\"%d%d\", &x, &y))\n\n  {\n\n    int ans;\n\n    ans = x - y;\n\n    if (ans > 0)\n\n      printf(\"%d\\n\", ans);\n\n    else\n\n      printf(\"0\\n\");\n  }\n}"}
{"fast_code_id":"4703b9d31fa971a2a48919304374b8d5937ea2b48b024bffa2087b1079a50d72","fast_id":"cdf862c2c429f0d9c19d0e8c8f876d3b15fef0d6c59f29da432aa5bb0ca44109","fast_time":0.000191471,"language":"cpp","measured_fast_code_id":"cdf862c2c429f0d9c19d0e8c8f876d3b15fef0d6c59f29da432aa5bb0ca44109","measured_slow_code_id":"10df5a9dd5393bf53d91b155f02821f8840b26cc77db72f9994ceb72056970a6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_25803","problem_id":"p03310","slow_code_id":"a7b5a346893adc124c31d023174bca6e956a371b8f8be6e77fcc5722185a72f3","slow_id":"10df5a9dd5393bf53d91b155f02821f8840b26cc77db72f9994ceb72056970a6","slow_time":0.0010072245,"speedup":5.260454585811951,"stratum":"4-8","sampling_key":"b582c934bf0d520b07642258f2733abc70b27181d042bfab47c843d9a5f34878","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <limits>\n\nusing namespace std;\n\nusing uint = unsigned int;\n\nusing ll = long long;\n\n#define FOR(i, a, b) for (int i = a; i < b; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\nuint N;\n\nll A[200001];\n\nuint l, c, r;\n\nll getVal() {\n\n  ll prev_diff, curr_diff;\n\n  ll cval = A[c], eval = A[N];\n\n  prev_diff = numeric_limits<ll>::max();\n\n  while (1) {\n\n    curr_diff = abs((cval - A[l]) - (A[l] - 0));\n\n    if (curr_diff > prev_diff) {\n\n      --l;\n\n      break;\n    }\n\n    prev_diff = curr_diff;\n\n    ++l;\n\n    if (l >= c) {\n\n      --l;\n\n      break;\n    }\n  }\n\n  prev_diff = numeric_limits<ll>::max();\n\n  while (1) {\n\n    curr_diff = abs((eval - A[r]) - (A[r] - cval));\n\n    if (curr_diff > prev_diff) {\n\n      --r;\n\n      break;\n    }\n\n    prev_diff = curr_diff;\n\n    ++r;\n\n    if (r >= N) {\n\n      --r;\n\n      break;\n    }\n  }\n\n  ll sum[4];\n\n  sum[0] = A[l] - 0;\n\n  sum[1] = cval - A[l];\n\n  sum[2] = A[r] - cval;\n\n  sum[3] = eval - A[r];\n\n  ll maxval = *max_element(sum, sum + 4);\n\n  ll minval = *min_element(sum, sum + 4);\n\n  return maxval - minval;\n}\n\nint main() {\n\n  scanf(\"%u\", &N);\n\n  A[0] = 0;\n\n  REP(i, N) {\n\n    scanf(\"%llu\", &A[i + 1]);\n\n    A[i + 1] += A[i];\n  }\n\n  ll minval = numeric_limits<ll>::max();\n\n  for (l = 1, c = 2, r = 3; c <= N - 2; ++c) {\n\n    if (r <= c)\n      r = c + 1;\n\n    ll val = getVal();\n\n    if (val < minval)\n      minval = val;\n  }\n\n  printf(\"%llu\\n\", minval);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <limits>\n\nusing ull = long long;\n\nusing namespace std;\n\nconst int MAX_N = 2 * 10e5 + 5;\n\null arr[MAX_N];\n\nint n;\n\nint pre_l, pre_r;\n\null solve(int mid) {\n\n  ull pre_diff = numeric_limits<ull>::max();\n\n  ull curr_diff;\n\n  int l = mid - 1, r = n - 1;\n\n  for (int i = pre_l; i < mid; ++i) {\n\n    curr_diff = abs(arr[mid] - arr[i] - arr[i]);\n\n    if (curr_diff >= pre_diff) {\n\n      l = i - 1;\n\n      break;\n    }\n\n    pre_diff = curr_diff;\n  }\n\n  pre_diff = numeric_limits<ull>::max();\n\n  for (int j = pre_r; j < n; ++j) {\n\n    curr_diff = abs(arr[n] - arr[j] - (arr[j] - arr[mid]));\n\n    if (curr_diff >= pre_diff) {\n\n      r = j - 1;\n\n      break;\n    }\n\n    pre_diff = curr_diff;\n  }\n\n  ull sum[4];\n\n  sum[0] = arr[l];\n\n  sum[1] = arr[mid] - arr[l];\n\n  sum[2] = arr[r] - arr[mid];\n\n  sum[3] = arr[n] - arr[r];\n\n  ull mi, ma;\n\n  ma = *max_element(sum, sum + 4);\n\n  mi = *min_element(sum, sum + 4);\n\n  pre_l = l;\n\n  pre_r = r;\n\n  return ma - mi;\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; ++i) {\n\n    scanf(\"%lld\", arr + i);\n\n    arr[i] += arr[i - 1];\n  }\n\n  ull mi = numeric_limits<ull>::max();\n\n  pre_l = 1;\n\n  pre_r = 3;\n\n  for (int i = 2; i <= n - 2; ++i) {\n\n    ull ans = solve(i);\n\n    mi = mi < ans ? mi : ans;\n  }\n\n  printf(\"%lld\", mi);\n\n  return 0;\n}"}
{"fast_code_id":"b5b1ccf5b062da523ae87135528495f2792a06fd5be14c3adf04e80d5133166d","fast_id":"7eafc688fbf1f8ddb94498cac542ba8aa04ce0e21e2ced2c7f5b7d784aa2fc4e","fast_time":0.0303666289,"language":"cpp","measured_fast_code_id":"7eafc688fbf1f8ddb94498cac542ba8aa04ce0e21e2ced2c7f5b7d784aa2fc4e","measured_slow_code_id":"a02cb16c6639423350bc29fb50179b10511a1ef5ab17fb4a121ab79e5b9a35bc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26","problem_id":"p00232","slow_code_id":"a2addfd2023a6da446ac446329a9c84bc8878042de8c040bdeae58b5fa5512d1","slow_id":"a02cb16c6639423350bc29fb50179b10511a1ef5ab17fb4a121ab79e5b9a35bc","slow_time":0.1142257456,"speedup":3.761555027268766,"stratum":"2-4","sampling_key":"3e6b00178b350d7874ead065d17d631c009721853c09768b747ef1d46527903d","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  double pb[100][5001];\n\n  int x, y, z, n, m, l, ub;\n\n  int v[4], e[51], a[51];\n\n  while (cin >> x >> y >> z && (x || y || z)) {\n\n    for (int i = 0; i < x; i++)\n      cin >> v[i];\n\n    for (int i = 0; i <= y; i++)\n      e[i] = a[i] = 0;\n\n    ub = 0;\n\n    for (int i = 0; i < z; i++) {\n\n      cin >> n >> m >> l;\n\n      e[n] = m;\n      a[n] = l;\n\n      if (m == 2)\n        ub += a[n];\n    }\n\n    for (int i = 0; i <= y; i++)\n\n      for (int j = 0; j <= ub; j++)\n        pb[i][j] = 0.0;\n\n    pb[0][0] = 1.0;\n\n    for (int i = 0; i < y; i++)\n\n      for (int j = 0; j <= ub; j++) {\n\n        if (pb[i][j] == 0.0)\n          continue;\n\n        for (int k = 0; k < x; k++) {\n\n          int next = min(y, i + v[k]), value = j;\n\n          if (e[next] == 1)\n            next = min(y, next + a[next]);\n\n          else if (e[next] == 2)\n            value = j + a[next];\n\n          else if (e[next] == 3)\n            value = max(0, j - a[next]);\n\n          pb[next][value] += pb[i][j] / x;\n        }\n      }\n\n    double ans = 0.0;\n\n    for (int i = 0; i <= ub; i++)\n      ans += pb[y][i] * i;\n\n    cout << (int)(ans) << endl;\n  }\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  double pb[100][5001];\n\n  int x, y, z, n, m, l, ub, i, j, k;\n\n  int v[4], e[51], a[51];\n\n  while (scanf(\"%d %d %d\", &x, &y, &z) && (x || y || z)) {\n\n    for (i = 0; i < x; i++)\n      scanf(\"%d\", &v[i]);\n\n    for (i = 0; i <= y; i++)\n      e[i] = a[i] = 0;\n\n    ub = 0;\n\n    for (i = 0; i < z; i++) {\n\n      scanf(\"%d %d %d\", &n, &m, &l);\n\n      e[n] = m;\n      a[n] = l;\n\n      if (m == 2)\n        ub += a[n];\n    }\n\n    for (i = 0; i <= y; i++)\n\n      for (j = 0; j <= ub; j++)\n        pb[i][j] = 0.0;\n\n    pb[0][0] = 1.0;\n\n    for (i = 0; i < y; i++)\n\n      for (j = 0; j <= ub; j++) {\n\n        if (pb[i][j] == 0.0)\n          continue;\n\n        for (k = 0; k < x; k++) {\n\n          n = min(y, i + v[k]), m = j;\n\n          if (e[n] == 1)\n            n = min(y, n + a[n]);\n\n          else if (e[n] == 2)\n            m = j + a[n];\n\n          else if (e[n] == 3)\n            m = max(0, j - a[n]);\n\n          pb[n][m] += pb[i][j] / x;\n        }\n      }\n\n    double ans = 0.0;\n\n    for (i = 0; i <= ub; i++)\n      ans += pb[y][i] * i;\n\n    printf(\"%d\\n\", (int)ans);\n  }\n}"}
{"fast_code_id":"1d80c5b69c7416fd7bf9e3ac00c8e82e4f366414284c3852c8e18f4e293d79f8","fast_id":"460da7298aa886e7712e130e441cf90eec12a1e34ce57c946c5af92db32ca4ba","fast_time":0.0010302589,"language":"cpp","measured_fast_code_id":"460da7298aa886e7712e130e441cf90eec12a1e34ce57c946c5af92db32ca4ba","measured_slow_code_id":"3f565b44e1f4d4c7331d0731f46d66587022eef2ad75b256f94da59752b961d4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26306","problem_id":"p03864","slow_code_id":"65d8fa1f7ad8e656f298b1977697bc59f33986541d6497f8758e1e73f13780a9","slow_id":"3f565b44e1f4d4c7331d0731f46d66587022eef2ad75b256f94da59752b961d4","slow_time":0.0096346247,"speedup":9.351653938636202,"stratum":"8+","sampling_key":"a076eff87d95b1de467db80d38a6927fdffc30671acd72593e762763375c4dba","slow_code":"#include <bits/stdc++.h>\n\n#define FAST                                                                   \\\n  ios_base::sync_with_stdio(0);                                                \\\n  cin.tie(0);                                                                  \\\n  cout.tie(0);\n\n#define fr first\n\n#define sc second\n\n#define N 300009\n\n#define inf 2e16\n\n#define pi pair<ll, ll>\n\n#define pb push_back\n\nusing namespace std;\n\ntypedef long long ll;\n\nvoid slv()\n\n{}\n\nvector<int> adj[N];\n\nbool vis[N];\n\nint dis[N];\n\nvoid vfs(int s)\n\n{\n\n  queue<int> q;\n\n  q.push(s);\n\n  dis[s] = 0;\n\n  vis[s] = 1;\n\n  while (!q.empty())\n\n  {\n\n    int u = q.front();\n\n    q.pop();\n\n    for (auto v : adj[u])\n\n    {\n\n      if (!vis[v])\n\n      {\n\n        vis[v] = 1;\n\n        dis[v] = dis[u] + 1;\n\n        q.push(v);\n      }\n    }\n  }\n}\n\nint main()\n\n{\n\n  ll n, x;\n\n  cin >> n >> x;\n\n  vector<ll> a(n + 1, 0);\n\n  for (ll i = 1; i <= n; i++)\n    cin >> a[i];\n\n  ll ans = 0LL;\n\n  for (ll i = 1; i <= n; i++)\n\n  {\n\n    ll s = a[i] + a[i - 1];\n\n    if (s > x)\n\n    {\n\n      ans += s - x;\n\n      a[i] = min(a[i], a[i] - (s - x));\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define fast                                                                   \\\n  ios_base::sync_with_stdio(false);                                            \\\n  cin.tie(0);                                                                  \\\n  cout.tie(0);\n\n#define endl '\\n'\n\n#define Endl '\\n'\n\n#define cont continue\n\n#define gcd(a, b) __gcd(a, b)\n\n#define lcm(a, b) a *b / __gcd(a, b)\n\n#define pb push_back\n\n#define mp make_pair\n\n#define mem(x) memset(x, 0, sizeof(x))\n\nconst ll inf = 1e18;\n\nconst int mod = 1e9 + 7;\n\ninline int bigmod(int B, int P) {\n  int R = 1;\n  while (P > 0) {\n    if (P & 1) {\n      R = (R * B) % mod;\n    }\n    P >>= 1;\n    B = (B * B) % mod;\n  }\n  return R;\n}\n\nconst int mxn = 2e5 + 10;\n\nint main() {\n\n  fast;\n\n  int tt = 1;\n\n  for (int tc = 1; tc <= tt; tc++) {\n\n    ll n, x, ans = 0, s;\n\n    cin >> n >> x;\n\n    int ip[n];\n\n    for (int i = 0; i < n; i++)\n      cin >> ip[i];\n\n    for (int i = 1; i < n; i++) {\n\n      s = ip[i] + ip[i - 1];\n\n      if (s > x) {\n\n        if (ip[i] >= (s - x)) {\n\n          ans += (s - x);\n\n          ip[i] -= (s - x);\n\n        }\n\n        else {\n\n          ans += (s - x);\n\n          s -= ip[i];\n\n          ip[i] = 0;\n\n          ip[i - 1] -= (s - x);\n        }\n      }\n    }\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"cc5870ffe759c9997a1e3d9da629d5d2fb264a050e7e78d97cd01c686221ed26","fast_id":"f824c7a1b0f31c65e9a81f1bd1688e7fddad576a8fe2eeccaa939e298110a2ed","fast_time":0.0537784307,"language":"cpp","measured_fast_code_id":"f824c7a1b0f31c65e9a81f1bd1688e7fddad576a8fe2eeccaa939e298110a2ed","measured_slow_code_id":"20baf993893b84dab09bc1849ff7f34dee2890549b8e43099cf3ac95a95d62c6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26334","problem_id":"p04012","slow_code_id":"378ab97980da73eb7d3830a5b28eec42c72d7889c7df589cc5ee4bc86b1dde87","slow_id":"20baf993893b84dab09bc1849ff7f34dee2890549b8e43099cf3ac95a95d62c6","slow_time":0.1909153644,"speedup":3.550035988684958,"stratum":"2-4","sampling_key":"2127b0aa94af3c25cae7344a09614d56dbf2cd54fbe0b307245b078803cf8d90","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 100005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nbool check[maxii];\n\nbool dfs(int node, int c)\n\n{\n\n  check[node] = true;\n\n  arr2[node] = c;\n\n  for (int child = 0; child < vi[node].size(); child++)\n\n  {\n\n    if (check[vi[node][child]] == false)\n\n    {\n\n      if (dfs(vi[node][child], c ^ 1) == false)\n\n      {\n\n        return false;\n      }\n\n    }\n\n    else if (arr2[node] == arr2[vi[node][child]])\n\n    {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main()\n\n{\n\n  string a;\n\n  cin >> a;\n\n  int len = a.size();\n\n  for (int i = 0; i < len; i++)\n\n  {\n\n    arr[a[i] - 'a']++;\n  }\n\n  int c = 0;\n\n  for (int i = 0; i < 26; i++)\n\n  {\n\n    if (arr[i] % 2 != 0)\n\n    {\n\n      c = 1;\n\n      break;\n    }\n  }\n\n  if (c == 0)\n\n  {\n\n    printf(\"Yes\\n\");\n\n  }\n\n  else\n    cout << \"No\";\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\nint a[32 + 4];\n\nint main()\n\n{\n\n  string s;\n  cin >> s;\n\n  for (int i = 0; i < s.size(); ++i) {\n\n    ++a[s[i] - 96];\n  }\n\n  for (int i = 1; i <= 32; ++i) {\n\n    if (a[i] % 2 == 1) {\n\n      cout << \"No\\n\";\n\n      return 0;\n    }\n  }\n\n  cout << \"Yes\\n\";\n}\n"}
{"fast_code_id":"d22ad4a9ffdbda1c62a3db56d93ce9437035589e1b960381adad07689b843f44","fast_id":"eb830452232acb7253062ef2b17e857fed27d734f6e8be7ec7c1938affb37641","fast_time":0.0750326368,"language":"cpp","measured_fast_code_id":"eb830452232acb7253062ef2b17e857fed27d734f6e8be7ec7c1938affb37641","measured_slow_code_id":"5832883a3fafdb0ec6aaef52596f49497d3702923e2b23d6717fa4dbd126b5fe","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26340","problem_id":"p00768","slow_code_id":"026296f457fd7e4a684972ad72dcc3f09d7187419200e529fd2c9eac87c50872","slow_id":"5832883a3fafdb0ec6aaef52596f49497d3702923e2b23d6717fa4dbd126b5fe","slow_time":0.1736326149,"speedup":2.3140945367922883,"stratum":"2-4","sampling_key":"e6024baf0bf6016c8d5bdec3d627d5ae20a860b62fca3ba7f89495ee3f506df0","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\n#define pb(a) push_back(a)\n\n#define mp(a, b) make_pair(a, b)\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define F first\n\n#define S second\n\ntypedef pair<int, int> PI;\n\nint m, t, p, r;\n\nint app[400][400];\n\nint pena[400];\n\nvoid solve() {\n\n  memset(app, 0, sizeof(app));\n\n  memset(pena, 0, sizeof(pena));\n\n  vector<int> sol(10000);\n\n  rep(i, r) {\n\n    int mk, tk, pk, jk;\n\n    cin >> mk >> tk >> pk >> jk;\n\n    if (jk == 0) {\n\n      pena[tk] += app[tk][pk] * 20 + mk;\n\n      ++sol[tk];\n\n    } else {\n\n      ++app[tk][pk];\n    }\n  }\n\n  vector<pair<PI, int> > team;\n\n  rep(i, t) { team.pb(mp(mp(-sol[i + 1], pena[i + 1]), -i - 1)); }\n\n  sort(ALL(team));\n\n  rep(i, t) {\n\n    if (i) {\n\n      if (team[i - 1].F == team[i].F)\n        cout << \"=\";\n\n      else\n        cout << \",\";\n    }\n\n    cout << -team[i].S;\n  }\n\n  cout << endl;\n}\n\nint main() {\n\n  while (cin >> m >> t >> p >> r && m)\n    solve();\n}","fast_code":"#include <cstdio>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\nint a[50][2];\n\nint b[50][10];\n\nint main()\n\n{\n\n  while (1) {\n\n    int m, t, p, r, i, j;\n\n    vector<pair<int, pair<int, int > > > v;\n\n    scanf(\"%d %d %d %d\", &m, &t, &p, &r);\n\n    if (m == 0 && t == 0 && p == 0 && r == 0)\n      break;\n\n    for (i = 0; i < t; i++)\n      a[i][0] = a[i][1] = 0;\n\n    for (i = 0; i < t; i++) {\n\n      for (j = 0; j < p; j++) {\n\n        b[i][j] = 0;\n      }\n    }\n\n    for (i = 0; i < r; i++) {\n\n      int m, t, p, j;\n\n      scanf(\"%d %d %d %d\", &m, &t, &p, &j);\n\n      t--;\n\n      p--;\n\n      if (j == 0) {\n\n        a[t][0]++;\n\n        a[t][1] += b[t][p];\n\n        a[t][1] += m;\n\n      } else {\n\n        b[t][p] += 20;\n      }\n    }\n\n    for (i = 0; i < t; i++)\n      v.push_back(make_pair(a[i][0], make_pair(-a[i][1], i + 1)));\n\n    sort(v.begin(), v.end());\n\n    reverse(v.begin(), v.end());\n\n    printf(\"%d\", v[0].second.second);\n\n    for (i = 1; i < v.size(); i++) {\n\n      if (v[i].first == v[i - 1].first && v[i].second.first == v[i - 1].second.first) {\n\n        putchar('=');\n\n      } else {\n\n        putchar(',');\n      }\n\n      printf(\"%d\", v[i].second.second);\n    }\n\n    puts(\"\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"5a16221ec770bbe49ab3c2feb4488aa6660ca968b66da4f1b5449d6a0196408c","fast_id":"3681d1900137855b66c1a958e7ae5ca71fd11eb03d61ae60cd0c6270d25da3e1","fast_time":0.1452427685,"language":"cpp","measured_fast_code_id":"3681d1900137855b66c1a958e7ae5ca71fd11eb03d61ae60cd0c6270d25da3e1","measured_slow_code_id":"af2901123f6f2e3dae8e65035478c13bbf9de38bf7da22453be82aab70f7341b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26346","problem_id":"p03468","slow_code_id":"a74eed0c99f8f3e0560d03c9f423ac55d288e141e7e1cf649bb6d3685fdeb477","slow_id":"af2901123f6f2e3dae8e65035478c13bbf9de38bf7da22453be82aab70f7341b","slow_time":0.5143383417,"speedup":3.5412320145907987,"stratum":"2-4","sampling_key":"7b06fa43405764e095b3bf23b41f0ba3e0daefeeddd45f666ee02b2e409f53ed","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define inlien inline\n\n#define retrun return\n\n#define cpnst const\n\ntypedef long double ld;\n\nint a[111], n, c;\n\nld dp[555][555];\n\ninline int min(int x, int y)\n\n{\n  return (x < y) ? x : y;\n}\n\ninline int max(int x, int y)\n\n{\n  return (x > y) ? x : y;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &c);\n\n  register int i, ii, S;\n\n  for (i = 1; i <= n; i++)\n    scanf(\"%d\", &a[i]);\n\n  ld fac = 0, pwd = 1;\n\n  for (i = 1; i < n; i++)\n    pwd *= c;\n\n  std::sort(a + 1, a + n + 1);\n\n  ld ans = 0;\n\n  do\n\n  {\n\n    memset(dp, 0, sizeof(dp)),\n\n        fac++, dp[a[n] * n][0] = 1;\n\n    for (i = 1; i <= n * c; i++)\n\n    {\n\n      int v = i % n;\n\n      if (!v)\n        continue;\n\n      for (ii = i; ii <= n * c; ii++)\n\n        for (S = 0; S < (1 << (n - 1)); S++)\n\n        {\n\n          if (S & (1 << (v - 1)))\n            continue;\n\n          int to = min(n * c, max(ii, i + n * a[v]));\n\n          dp[to][S | (1 << (v - 1))] += dp[ii][S];\n        }\n    }\n    ans += dp[n * c][(1 << (n - 1)) - 1] / pwd;\n\n  } while (std::next_permutation(a + 1, a + n));\n\n  printf(\"%.15Lf\\n\", ans / fac);\n}\n","fast_code":"#include <cmath>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint n, c;\n\nconst int N = 505;\n\nint l[N];\n\ndouble f[N][2 << 7], ans, t;\n\nint main() {\n\n  cin >> n >> c;\n\n  for (int i = 0; i < n; i++)\n\n    cin >> l[i];\n\n  sort(l, l + n);\n\n  do {\n\n    memset(f, 0, sizeof(f));\n\n    f[l[n - 1] * n][0] = 1;\n\n    for (int i = 0; i <= n * c; i++)\n\n      for (int j = i; j <= n * c; j++)\n\n        for (int S = 0; S < (1 << n - 1); S++)\n\n          if (i % n && !((S >> (i % n - 1)) & 1))\n\n            f[min(n * c, max(j, i + l[i % n - 1] * n))]\n             [S | (1 << (i % n - 1))] += f[j][S];\n\n    ans += f[n * c][(1 << n - 1) - 1];\n\n    ++t;\n\n  } while (next_permutation(l, l + n - 1));\n\n  printf(\"%.15lf\", (double)ans / t / pow(c, n - 1));\n\n  return 0;\n}"}
{"fast_code_id":"0f006bcc135e8e2a014b4abef8b30ecd8431f85d940a497f33344941bf295b61","fast_id":"713d0b3a975ac55a8534b05c0f50c3680416982e9ebb606af5475aefd8f4ea1c","fast_time":0.081222588,"language":"cpp","measured_fast_code_id":"713d0b3a975ac55a8534b05c0f50c3680416982e9ebb606af5475aefd8f4ea1c","measured_slow_code_id":"b172ecb8fa50a407ea65b1d21020da594309578b3548594d7086b4ca98169d10","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26392","problem_id":"p00437","slow_code_id":"a6d803fa567c839a073813cd89603599f0e6bdc05659e905afff52980e7853c1","slow_id":"b172ecb8fa50a407ea65b1d21020da594309578b3548594d7086b4ca98169d10","slow_time":0.1850645537,"speedup":2.278486296201249,"stratum":"2-4","sampling_key":"d8c3501d4f5f7fab53cb41b0f399f1d6f4b9cbbce1c40d152374ddd4cd4f7560","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  int a, b, c, n;\n\n  while (cin >> a >> b >> c, a || b || c) {\n\n    cin >> n;\n\n    int f[300];\n\n    fill(f, f + 300, 2);\n\n    int m = a + b + c;\n\n    int x[1000], y[1000], z[1000];\n\n    bool r[1000];\n\n    for (int i = 0; i < n; i++) {\n\n      cin >> x[i] >> y[i] >> z[i] >> r[i];\n\n      x[i]--;\n      y[i]--;\n      z[i]--;\n    }\n\n    int cnt = 0;\n\n    while (cnt < 100000) {\n\n      for (int i = 0; i < n; i++) {\n\n        int a = x[i], b = y[i], c = z[i];\n\n        bool Flag = r[i];\n\n        if (Flag) {\n\n          f[a] = f[b] = f[c] = 1;\n\n        }\n\n        else {\n\n          if (f[b] == 1 && f[c] == 1) {\n\n            f[a] = 0;\n          }\n\n          if (f[a] == 1 && f[c] == 1) {\n\n            f[b] = 0;\n          }\n\n          if (f[a] == 1 && f[b] == 1) {\n\n            f[c] = 0;\n          }\n        }\n      }\n\n      cnt++;\n    }\n\n    for (int i = 0; i < m; i++)\n      cout << f[i] << endl;\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool solve() {\n\n  int A, B, C, N, t[1000][3], r[1000];\n\n  cin >> A >> B >> C;\n\n  if (A == 0 && B == 0 && C == 0)\n    return false;\n\n  cin >> N;\n\n  for (int i = 0; i < N; i++) {\n\n    for (int j = 0; j < 3; j++) {\n\n      cin >> t[i][j];\n\n      t[i][j]--;\n    }\n\n    cin >> r[i];\n  }\n\n  int S[1000] = {0};\n\n  for (int _ = 0; _ < N; _++) {\n\n    for (int i = 0; i < N; i++) {\n\n      if (r[i]) {\n\n        for (int j = 0; j < 3; j++) {\n\n          S[t[i][j]] = 1;\n        }\n\n      }\n\n      else {\n\n        int sum = 0;\n\n        for (int j = 0; j < 3; j++) {\n\n          if (S[t[i][j]] == 1)\n            sum++;\n        }\n\n        if (sum != 2)\n          continue;\n\n        for (int j = 0; j < 3; j++) {\n\n          if (S[t[i][j]] != 1)\n            S[t[i][j]] = -1;\n        }\n      }\n    }\n  }\n\n  for (int i = 0; i < A + B + C; i++) {\n\n    if (S[i] == -1)\n      cout << 0 << endl;\n\n    else if (S[i])\n      cout << 1 << endl;\n\n    else\n      cout << 2 << endl;\n  }\n\n  return true;\n}\n\nint main() {\n\n  while (solve())\n    ;\n}"}
{"fast_code_id":"8b2e3576fac28fa2ce8d5f6649b7b324923684cb77ad6036628ae121a8144bb7","fast_id":"b33cad688af920ee0d37bc65401699d282979b4fe06c1fcd618166a31ac67cb4","fast_time":0.0636776203,"language":"cpp","measured_fast_code_id":"b33cad688af920ee0d37bc65401699d282979b4fe06c1fcd618166a31ac67cb4","measured_slow_code_id":"2bbf86f715acdb9c892021505ad1772cf3a7ca021e57e8be6753ea00bb48a9fa","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26393","problem_id":"p02350","slow_code_id":"737ad60285803e153b3bb1f9f155876dac2a5ad496e36b25069d034ed9fc9dce","slow_id":"2bbf86f715acdb9c892021505ad1772cf3a7ca021e57e8be6753ea00bb48a9fa","slow_time":0.1754722109,"speedup":2.7556339271679726,"stratum":"2-4","sampling_key":"d8b322e41fc82c2298ffe84b6dd45e8d9631b0523c3b808a4be4151e94f3ba58","slow_code":"#include <cstdio>\n\n#include <climits>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int SIZE = 1 << 17;\n\ntemplate <typename T>\n\nstruct lazysegtree {\n\n  T node[2 * SIZE], lazy[2 * SIZE], I;\n\n  bool need_upd[2 * SIZE];\n\n  T (*upd_f)(T, T, int, int), (*qry_f)(T, T);\n\n  lazysegtree(T (*op1)(T, T, int, int), T (*op2)(T, T), T X) {\n\n    upd_f = op1;\n\n    qry_f = op2;\n\n    I = X;\n\n    fill(lazy, lazy + 2 * SIZE, I);\n\n    fill(node, node + 2 * SIZE, I);\n\n    fill(need_upd, need_upd + 2 * SIZE, false);\n  }\n\n  void lazy_eval(int k, int l, int r) {\n\n    if (!need_upd[k])\n      return;\n\n    node[k] = upd_f(node[k], lazy[k], l, r);\n\n    if (r - l > 1) {\n\n      lazy[2 * k + 1] = upd_f(lazy[2 * k + 1], lazy[k], 0, 1);\n\n      lazy[2 * k + 2] = upd_f(lazy[2 * k + 2], lazy[k], 0, 1);\n\n      need_upd[2 * k + 1] = need_upd[2 * k + 2] = true;\n    }\n\n    lazy[k] = I;\n\n    need_upd[k] = false;\n  }\n\n  void update(int a, int b, T val, int l = 0, int r = SIZE, int k = 0) {\n\n    lazy_eval(k, l, r);\n\n    if (b <= l || r <= a)\n      return;\n\n    if (a <= l && r <= b) {\n\n      lazy[k] = upd_f(lazy[k], val, 0, 1);\n\n      need_upd[k] = true;\n\n      lazy_eval(k, l, r);\n\n    }\n\n    else {\n\n      int mid = (l + r) / 2;\n\n      update(a, b, val, l, mid, 2 * k + 1);\n\n      update(a, b, val, mid, r, 2 * k + 2);\n\n      node[k] = qry_f(node[2 * k + 1], node[2 * k + 2]);\n    }\n  }\n\n  T query(int a, int b, int l = 0, int r = SIZE, int k = 0) {\n\n    lazy_eval(k, l, r);\n\n    if (b <= l || r <= a)\n      return I;\n\n    if (a <= l && r <= b)\n      return node[k];\n\n    int mid = (l + r) / 2;\n\n    T vl = query(a, b, l, mid, 2 * k + 1);\n\n    T vr = query(a, b, mid, r, 2 * k + 2);\n\n    return qry_f(vl, vr);\n  }\n};\n\nint upd(int a, int b, int l, int r) { return b; }\n\nint fnd(int a, int b) { return min(a, b); }\n\nlazysegtree<int> seg(upd, fnd, INT_MAX);\n\nint main() {\n\n  int N, Q;\n  scanf(\"%d%d\", &N, &Q);\n\n  while (Q--) {\n\n    int q;\n    scanf(\"%d\", &q);\n\n    if (q == 0) {\n\n      int s, t, x;\n      scanf(\"%d%d%d\", &s, &t, &x);\n      t++;\n\n      seg.update(s, t, x);\n\n    }\n\n    else {\n\n      int s, t;\n      scanf(\"%d%d\", &s, &t);\n      t++;\n\n      printf(\"%d\\n\", seg.query(s, t));\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <vector>\n\n#include <climits>\n\nusing namespace std;\n\nusing ll = long long int;\n\ntemplate <typename Type>\n\nstruct SqrtDecomp {\n\n  int SIZE;\n\n  vector<Type> node, bucket, lazy, need_upd;\n\n  Type (*op1)(Type x, Type y, int sz);\n\n  Type (*op2)(Type x, Type y);\n\n  Type I_op1, I_op2;\n\n  SqrtDecomp(vector<Type> vec,\n\n             Type (*g_op1)(Type x, Type y, int sz),\n\n             Type (*g_op2)(Type x, Type y),\n\n             Type X_op1, Type X_op2) {\n\n    int N = vec.size();\n\n    SIZE = 1;\n    while (SIZE * SIZE < N)\n      SIZE++;\n\n    op1 = g_op1, op2 = g_op2;\n\n    I_op1 = X_op1, I_op2 = X_op2;\n\n    node.resize(SIZE * SIZE, I_op2);\n\n    bucket.resize(SIZE, I_op2);\n\n    lazy.resize(SIZE, I_op1);\n\n    need_upd.resize(SIZE, 0);\n\n    for (int i = 0; i < SIZE; i++) {\n\n      Type rep_val = I_op2;\n\n      for (int j = 0; j < SIZE && i * SIZE + j < N; j++) {\n\n        int idx = (i * SIZE + j);\n\n        node[idx] = vec[idx];\n\n        rep_val = op2(rep_val, node[idx]);\n      }\n\n      bucket[i] = rep_val;\n    }\n  }\n\n  void lazy_eval(int k) {\n\n    int l = SIZE * k, r = SIZE * (k + 1);\n\n    if (need_upd[k]) {\n\n      Type seg_val = I_op2;\n\n      for (int i = l; i < r; i++) {\n\n        node[i] = op1(node[i], lazy[k], 1);\n\n        seg_val = op2(seg_val, node[i]);\n      }\n\n      bucket[k] = seg_val;\n    }\n\n    lazy[k] = I_op1;\n\n    need_upd[k] = false;\n  }\n\n  void update(int l, int r, Type val) {\n\n    int lidx = l / SIZE, ridx = r / SIZE;\n\n    lazy_eval(lidx);\n\n    bucket[lidx] = I_op2;\n\n    for (int k = SIZE * lidx; k < SIZE * (lidx + 1); k++) {\n\n      if (l <= k && k < r)\n        node[k] = op1(node[k], val, 1);\n\n      bucket[lidx] = op2(bucket[lidx], node[k]);\n    }\n\n    if (lidx != ridx) {\n\n      for (int k = lidx + 1; k < ridx; k++) {\n\n        lazy[k] = op1(lazy[k], val, 1);\n\n        need_upd[k] = true;\n      }\n\n      if (ridx != SIZE) {\n\n        lazy_eval(ridx);\n\n        bucket[ridx] = I_op2;\n\n        for (int k = SIZE * ridx; k < SIZE * (ridx + 1); k++) {\n\n          if (k < r)\n            node[k] = op1(node[k], val, 1);\n\n          bucket[ridx] = op2(bucket[ridx], node[k]);\n        }\n      }\n    }\n  }\n\n  Type query(int l, int r) {\n\n    int lidx = l / SIZE, ridx = r / SIZE;\n\n    Type ret = I_op2;\n\n    for (int k = l; k < min(r, SIZE * (lidx + 1)); k++) {\n\n      lazy_eval(lidx);\n\n      ret = op2(ret, node[k]);\n    }\n\n    if (lidx != ridx) {\n\n      for (int k = lidx + 1; k < ridx; k++) {\n\n        Type val = (need_upd[k] ? op1(bucket[k], lazy[k], SIZE) : bucket[k]);\n\n        ret = op2(ret, val);\n      }\n\n      for (int k = SIZE * ridx; k < r; k++) {\n\n        lazy_eval(ridx);\n\n        ret = op2(ret, node[k]);\n      }\n    }\n\n    return ret;\n  }\n};\n\nint upd_f(int a, int b, int sz) { return b; }\n\nint qry_f(int a, int b) { return min(a, b); }\n\nint main() {\n\n  int N, Q;\n  scanf(\"%d%d\", &N, &Q);\n\n  SqrtDecomp<int> sqr(vector<int>(N, INT_MAX), upd_f, qry_f, INT_MAX, INT_MAX);\n\n  while (Q--) {\n\n    int query;\n    scanf(\"%d\", &query);\n\n    if (query == 0) {\n\n      int l, r, x;\n      scanf(\"%d%d%d\", &l, &r, &x);\n\n      sqr.update(l, r + 1, x);\n    }\n\n    if (query == 1) {\n\n      int l, r;\n      scanf(\"%d%d\", &l, &r);\n\n      printf(\"%d\\n\", sqr.query(l, r + 1));\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"db6713c6a52a9fdaed4c8e88974c7901988a92e887adf06cf16b471fc0a8a53a","fast_id":"8afd845a87ce80aca27812ec83fad51e5d4aa95d330efc88bccd0f1c9915667c","fast_time":0.1057866693,"language":"cpp","measured_fast_code_id":"8afd845a87ce80aca27812ec83fad51e5d4aa95d330efc88bccd0f1c9915667c","measured_slow_code_id":"e550791473070d1bdc2811ec1db1282501e85c713b9ff4f5b96f2f3ee092a03c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26417","problem_id":"p03374","slow_code_id":"b3a730e1d9a91ac91c9812a37388c00d0f42aa77d61f543e799444a912f582b0","slow_id":"e550791473070d1bdc2811ec1db1282501e85c713b9ff4f5b96f2f3ee092a03c","slow_time":0.4514611075,"speedup":4.267655938951091,"stratum":"4-8","sampling_key":"02dfc850f37d88ed445fe4a504d2f92514a95b52626934b90fdd6744cb77099a","slow_code":"#include <iostream>\n\n#include <string.h>\n\n#include <stdio.h>\n\nusing namespace std;\n\nlong long c, x[100005], maxx, shun[100005], ni[100005];\n\nlong long v[100005], val[100005], rval[100005];\n\nint main()\n\n{\n\n  int i, j, n;\n\n  while (scanf(\"%d%lld\", &n, &c) != EOF)\n\n  {\n\n    memset(shun, 0, sizeof(shun));\n\n    memset(ni, 0, sizeof(ni));\n\n    memset(val, 0, sizeof(val));\n\n    memset(rval, 0, sizeof(rval));\n\n    for (i = 1; i <= n; i++)\n\n    {\n\n      scanf(\"%lld%d\", &x[i], &v[i]);\n\n      val[i] = val[i - 1] + v[i];\n\n      shun[i] = max(shun[i - 1], val[i] - x[i]);\n    }\n\n    for (i = n; i >= 1; i--)\n\n    {\n\n      rval[i] = rval[i + 1] + v[i];\n\n      ni[i] = max(ni[i + 1], rval[i] - c + x[i]);\n    }\n\n    maxx = 0;\n\n    for (i = n; i >= 1; i--)\n\n    {\n\n      maxx = max(maxx, rval[i] - 2 * (c - x[i]) + shun[i - 1]);\n\n      maxx = max(maxx, ni[i]);\n    }\n\n    for (i = 1; i <= n; i++)\n\n    {\n\n      maxx = max(maxx, val[i] - 2 * x[i] + ni[i + 1]);\n\n      maxx = max(maxx, shun[i]);\n    }\n\n    printf(\"%lld\\n\", maxx);\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define INF 0x3f3f3f3f\n\n#define Max int(1e5 + 10)\n\nll x[Max], v[Max], a[Max], b[Max];\n\nint main()\n\n{\n\n  ll n, c;\n\n  while (~scanf(\"%lld%lld\", &n, &c))\n\n  {\n\n    for (ll i = 1; i <= n; i++)\n\n    {\n\n      scanf(\"%lld%lld\", &x[i], &v[i]);\n\n      a[i] = a[i - 1] - x[i] + x[i - 1] + v[i];\n    }\n\n    x[n + 1] = c;\n\n    for (ll i = n; i > 0; i--)\n\n      b[i] = b[i + 1] - x[i + 1] + x[i] + v[i];\n\n    for (ll i = 2; i <= n; i++)\n\n      a[i] = max(a[i - 1], a[i]);\n\n    for (ll i = n - 1; i > 0; i--)\n\n      b[i] = max(b[i + 1], b[i]);\n\n    ll ma = 0;\n\n    for (ll i = 1; i <= n; i++)\n\n    {\n\n      ma = max(ma, a[i]);\n\n      ma = max(ma, b[i]);\n\n      ma = max(ma, a[i] - x[i] + b[i + 1]);\n\n      ma = max(ma, b[i] - (c - x[i]) + a[i - 1]);\n    }\n\n    printf(\"%lld\\n\", ma);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"2bc0f41a2ab1119f7432b257b8b46195515aa3d874c88269f2ffc6e3476f5d13","fast_id":"304a65a17ea58410b4067bafa51c431266f303f9be7ecb676b1be358a1fc9e45","fast_time":0.0398107046,"language":"cpp","measured_fast_code_id":"304a65a17ea58410b4067bafa51c431266f303f9be7ecb676b1be358a1fc9e45","measured_slow_code_id":"f2471edaef692221a36a025aa8711b89d56659b28e04ab0f0afad83553e0c202","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26461","problem_id":"p02257","slow_code_id":"4e6349e8e335434db4569989c68227d2b9bb28a9abd865224abb5e106143e20e","slow_id":"f2471edaef692221a36a025aa8711b89d56659b28e04ab0f0afad83553e0c202","slow_time":0.1053640917,"speedup":2.6466271511306028,"stratum":"2-4","sampling_key":"5b113bb0a74550fca7dfea47c3dbb999b5044f9557ac07442ce3f259c5c86c92","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, x, c;\nmain() {\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> x;\n    for (int j = 2; j <= (int)pow(x, 0.5); j++) {\n      if (x % j == 0) {\n        c++;\n        break;\n      }\n    }\n  }\n  cout << n - c << endl;\n}","fast_code":"#include <cstdio>\n\n#include <cmath>\n\nusing namespace std;\n\nint prime[10000];\n\nint p[10000];\n\nint c[10000];\n\nint main() {\n\n  for (int i = 2; i * i < 10000; i++) {\n\n    for (int j = i * i; j < 10000; j += i)\n      prime[j] = 1;\n  }\n\n  int cnt = 0;\n\n  for (int i = 2; i < 10000; i++) {\n\n    if (prime[i] == 0) {\n\n      p[cnt] = i;\n      cnt++;\n    }\n  }\n\n  for (int i = 2; i < 10000; i++)\n    c[i] = c[i - 1] + (1 - prime[i]);\n\n  int n, q, z = 0;\n\n  scanf(\"%d\", &q);\n\n  for (int i = 0; i < q; i++) {\n\n    scanf(\"%d\", &n);\n    bool OK = true;\n\n    int L = sqrt(n);\n\n    for (int j = 0; j < c[L]; j++) {\n\n      if (n % p[j] == 0) {\n        OK = false;\n        break;\n      }\n    }\n\n    if (OK == true)\n      z++;\n  }\n\n  printf(\"%d\\n\", z);\n\n  return 0;\n}"}
{"fast_code_id":"fb7c7bf5d25b14ef832200b2910fa65ac3c50c0f7c7211a646e69ec4ffe1930a","fast_id":"90c5ace49a770324398a1cab1c53a9fe109c2c641ee4e76b9916f329e487cb0f","fast_time":0.1058255856,"language":"cpp","measured_fast_code_id":"90c5ace49a770324398a1cab1c53a9fe109c2c641ee4e76b9916f329e487cb0f","measured_slow_code_id":"85d96470fc85c8a1c830dff9a6ce940462808d93fe2c77ed3488277adcc3f87a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26717","problem_id":"p02969","slow_code_id":"dbc64da6abd3317f8886e62e07ff65f561a79c040ea493d680b9f12b70a68194","slow_id":"85d96470fc85c8a1c830dff9a6ce940462808d93fe2c77ed3488277adcc3f87a","slow_time":0.37520625,"speedup":3.545515461810967,"stratum":"2-4","sampling_key":"4f8a9674a3b9479734d1957580b5833d94c3460df72c0c0f8be879186a806cf9","slow_code":"\n\n#ifndef _GLIBCXX_NO_ASSERT\n\n#include <cassert>\n\n#endif\n\n#include <cctype>\n\n#include <cerrno>\n\n#include <cfloat>\n\n#include <ciso646>\n\n#include <climits>\n\n#include <clocale>\n\n#include <cmath>\n\n#include <csetjmp>\n\n#include <csignal>\n\n#include <cstdarg>\n\n#include <cstddef>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <ctime>\n\n#if __cplusplus >= 201103L\n\n#include <ccomplex>\n\n#include <cfenv>\n\n#include <cinttypes>\n\n#include <cstdbool>\n\n#include <cstdint>\n\n#include <ctgmath>\n\n#include <cwchar>\n\n#include <cwctype>\n\n#endif\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <complex>\n\n#include <deque>\n\n#include <exception>\n\n#include <fstream>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <ios>\n\n#include <iosfwd>\n\n#include <iostream>\n\n#include <istream>\n\n#include <iterator>\n\n#include <limits>\n\n#include <list>\n\n#include <locale>\n\n#include <map>\n\n#include <memory>\n\n#include <new>\n\n#include <numeric>\n\n#include <ostream>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <stdexcept>\n\n#include <streambuf>\n\n#include <string>\n\n#include <typeinfo>\n\n#include <utility>\n\n#include <valarray>\n\n#include <vector>\n\n#if __cplusplus >= 201103L\n\n#include <array>\n\n#include <atomic>\n\n#include <chrono>\n\n#include <condition_variable>\n\n#include <forward_list>\n\n#include <future>\n\n#include <initializer_list>\n\n#include <mutex>\n\n#include <random>\n\n#include <ratio>\n\n#include <regex>\n\n#include <scoped_allocator>\n\n#include <system_error>\n\n#include <thread>\n\n#include <tuple>\n\n#include <typeindex>\n\n#include <type_traits>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#endif\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i <= sqrt(x); i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint gcd(int x, int y) {\n\n  if (y == 0) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    } else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\nvector<int> v[100004];\n\nbool went[100004];\n\nvoid dfs(int x) {\n\n  went[x] = true;\n\n  for (int i = 0; i < v[x].size(); i++) {\n\n    if (!went[v[x][i]]) {\n\n      dfs(v[x][i]);\n    }\n  }\n}\n\nint n, m, ans, a[100004];\n\nsigned main() {\n\n  cin >> n;\n\n  cout << 3 * (n * n) << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\n#define intt long long\n\n#define P pair<int, int>\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\ninline int gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\ninline int lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\nint fukugen(vector<int> l) {\n\n  int ans = 0;\n\n  for (int i = 0; i < (int)l.size(); i++) {\n\n    ans *= 10;\n\n    ans += l[i];\n  }\n\n  return ans;\n}\n\nint nanjyo(int n) {\n\n  int ans = 0;\n\n  while (n > 1) {\n\n    ans++;\n\n    n /= 2;\n  }\n\n  return ans;\n}\n\nbool intersect(pair<pair<int, int>, pair<int, int>> p1, pair<pair<int, int>, pair<int, int>> p2) {\n\n  int men11 = (p2.first.first - p1.first.first) * (p2.second.second - p1.first.second) -\n              (p2.second.first - p1.first.first) * (p2.first.second - p1.first.second);\n\n  int men12 = (p2.first.first - p1.second.first) * (p2.second.second - p1.second.second) -\n              (p2.second.first - p1.second.first) * (p2.first.second - p1.second.second);\n\n  int men21 = (p1.first.first - p2.first.first) * (p1.second.second - p2.first.second) -\n              (p1.second.first - p2.first.first) * (p1.first.second - p2.first.second);\n\n  int men22 = (p1.first.first - p2.second.first) * (p1.second.second - p2.second.second) -\n              (p1.second.first - p2.second.first) * (p1.first.second - p2.second.second);\n\n  return ((signbit(men11)) ^ (signbit(men12))) && ((signbit(men21)) ^ (signbit(men22)));\n}\n\ntemplate <class T, class U>\n\ninline bool chmax(T &lhs, const U &rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\ntemplate <class T, class U>\n\ninline bool chmin(T &lhs, const U &rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\nvoid Yes() { cout << \"Yes\" << endl; }\n\nvoid No() { cout << \"No\" << endl; }\n\nvoid YES() { cout << \"YES\" << endl; }\n\nvoid NO() { cout << \"NO\" << endl; }\n\nint yakusuu(int x) {\n\n  int ans = 0;\n\n  for (int i = 1; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      if (i * i == x) {\n\n        ans++;\n\n      }\n\n      else\n        ans += 2;\n    }\n  }\n\n  return ans;\n}\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, n) for (int i = 1; i <= n; i++)\n\nint n, m, a[100004], ans;\n\nsigned main() {\n\n  cin >> n;\n\n  cout << 3 * n * n << endl;\n}\n"}
{"fast_code_id":"3adb5703787887b1023fe8a29afb0fadbb08709230bc6565e4bf298898b00aea","fast_id":"107831dcd6497e6a2adc0dc74475e6fc1f2aaf47a6356545a9514d9a94e58482","fast_time":0.1075135373,"language":"cpp","measured_fast_code_id":"107831dcd6497e6a2adc0dc74475e6fc1f2aaf47a6356545a9514d9a94e58482","measured_slow_code_id":"a5a31e68224eef3813c0df853a68415534d75acc24e589026a742d3a36d9f03f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26776","problem_id":"p02580","slow_code_id":"d2a2b74a412e73c1ee80020c2940a02db53fb2c6f0dfbf766e91cd9c47456345","slow_id":"a5a31e68224eef3813c0df853a68415534d75acc24e589026a742d3a36d9f03f","slow_time":0.4576403108,"speedup":4.256583145646348,"stratum":"4-8","sampling_key":"bfee4bfc5ce16b6b8c3e5b9da50ae26fb1bee2968211b644b8b7c731be77f780","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <stdio.h>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <string>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <queue>\n\n#include <map>\n\n#include <vector>\n\n#include <bits/stdc++.h>\n\n#include <set>\n\n#define ll long long\n\n#define IO                                                                                         \\\n  ios::sync_with_stdio(false);                                                                     \\\n  cin.tie();                                                                                       \\\n  cout.tie(0)\n\n#define inf 0x3f3f3f\n\n#define pi 3.1415926535898\n\nusing namespace std;\n\nconst int N = 3e5 + 10;\n\nconst int mod = 1e9 + 7;\n\nint a[N], b[N];\n\nll maxs = -9999;\n\nll sum;\n\nstruct A\n\n{\n\n  int x, y;\n};\n\nmap<pair<int, int>, int> mp;\n\nint main()\n\n{\n\n  int h, w, m;\n\n  int q[N], t[N];\n\n  int cnt1, cnt2;\n\n  cin >> h >> w >> m;\n\n  int sum1 = 0, sum2 = 0;\n\n  for (int i = 0; i < m; i++)\n\n  {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    mp[make_pair(x, y)]++;\n\n    a[x]++;\n\n    b[y]++;\n  }\n\n  for (int i = 1; i <= h; i++)\n\n  {\n\n    if (sum1 < a[i])\n\n    {\n\n      cnt1 = 0;\n\n      memset(q, 0, sizeof(q));\n\n      sum1 = max(sum1, a[i]);\n\n      q[cnt1++] = i;\n\n      while (sum1 == a[i + 1])\n\n      {\n\n        q[cnt1++] = i;\n\n        i++;\n      }\n    }\n\n    if (sum1 == a[i])\n\n    {\n\n      q[cnt1++] = i;\n\n      while (sum1 == a[i + 1])\n\n      {\n\n        q[cnt1++] = i;\n\n        i++;\n      }\n    }\n  }\n\n  for (int i = 1; i <= w; i++)\n\n  {\n\n    if (sum2 < b[i])\n\n    {\n\n      cnt2 = 0;\n\n      memset(t, 0, sizeof(t));\n\n      sum2 = max(sum2, b[i]);\n\n      t[cnt2++] = i;\n\n      while (sum2 == b[i + 1])\n\n      {\n\n        t[cnt2++] = i;\n\n        i++;\n      }\n    }\n\n    if (sum2 == b[i])\n\n    {\n\n      t[cnt2++] = i;\n\n      while (sum2 == b[i + 1])\n\n      {\n\n        t[cnt2++] = i;\n\n        i++;\n      }\n    }\n  }\n\n  sum = sum1 + sum2;\n\n  int xx = 0;\n\n  for (int i = 0; i < cnt1; i++)\n\n  {\n\n    for (int j = 0; j < cnt2; j++)\n\n    {\n\n      int x1, y1;\n\n      x1 = q[i];\n\n      y1 = t[j];\n\n      if (mp[make_pair(x1, y1)] == 0)\n\n      {\n\n        xx = 1;\n\n        break;\n      }\n    }\n\n    if (xx == 1)\n\n    {\n\n      break;\n    }\n  }\n\n  if (xx == 0)\n\n  {\n\n    sum--;\n  }\n\n  cout << sum << endl;\n\n  return 0;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define f(i, a, b) for (register int i = a; i <= b; ++i)\n\n#define ff(i, a, b) for (register int i = a; i >= b; --i)\n\n#define debug(x) cerr << #x << \" : \" << x << \" \" << endl\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef long double ld;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<string, string> pss;\n\nconst ll mod = 1e9 + 7;\n\nconst int inf = 0x3f3f3f3f;\n\nconst double tiaohe = 0.57721566490153286060651209;\n\nll oula(ll x) {\n  ll res = x;\n  f(i, 2, x / i) {\n    if (x % i == 0) {\n      res = res / i * (i - 1);\n      while (x % i == 0)\n        x /= i;\n    }\n  }\n  if (x > 1)\n    res = res / x * (x - 1);\n  return res;\n}\n\nll quickmod(ll a, ll n, ll m) {\n  ll s = 1;\n  while (n) {\n    if (n & 1) {\n      s = s * a % m;\n    }\n    a = (a * a) % m;\n    n = n / 2;\n  }\n  return s;\n}\n\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\n\nvoid ex_gcd(ll a, ll b, ll &x, ll &y, ll &d) {\n  if (!b) {\n    d = a, x = 1, y = 0;\n  } else {\n    ex_gcd(b, a % b, y, x, d);\n    y -= x * (a / b);\n  }\n}\n\nll inv(ll t, ll p) {\n  ll d, x, y;\n  ex_gcd(t, p, x, y, d);\n  return d == 1 ? (x % p + p) % p : -1;\n}\n\nbool isPrime(ll x) {\n  if (x == 2)\n    return true;\n  if (x % 2 == 0)\n    return false;\n  for (ll i = 2; i * i <= x; i++)\n    if (x % i == 0)\n      return false;\n  return true;\n}\n\ndouble eqa = (1 + sqrt(5.0)) / 2.0;\n\nconst int N = 3e5 + 5;\n\ninline int in()\n\n{\n\n  char ch = getchar();\n\n  int x = 0, f = 1;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      f = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = x * 10 + ch - '0';\n    ch = getchar();\n  }\n\n  return x * f;\n}\n\nint r[N], c[N];\n\nint main()\n\n{\n\n  int h, w, m;\n\n  while (cin >> h >> w >> m)\n\n  {\n\n    int x, y;\n\n    map<pii, int> mp;\n\n    f(i, 1, m)\n\n    {\n\n      x = in();\n\n      y = in();\n\n      r[x]++;\n\n      c[y]++;\n\n      mp[{x, y}]++;\n    }\n\n    int mx = 0;\n\n    vector<int> v;\n\n    f(i, 1, h)\n\n    {\n\n      if (r[i] > mx)\n\n      {\n\n        v.clear();\n\n        mx = r[i];\n\n        v.emplace_back(i);\n\n      }\n\n      else if (r[i] == mx)\n\n      {\n\n        v.emplace_back(i);\n      }\n    }\n\n    int mx2 = 0;\n\n    vector<int> v2;\n\n    f(j, 1, w)\n\n    {\n\n      if (c[j] > mx2)\n\n      {\n\n        mx2 = c[j];\n\n        v2.clear();\n\n        v2.emplace_back(j);\n\n      }\n\n      else if (c[j] == mx2)\n\n      {\n\n        v2.emplace_back(j);\n      }\n    }\n\n    int ans = 0, fg = 1;\n\n    for (auto i : v)\n\n    {\n\n      for (auto j : v2)\n\n      {\n\n        if (mp[{i, j}] == 0) {\n          fg = 0;\n          break;\n        }\n      }\n    }\n\n    cout << mx + mx2 - fg << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"e9009d71516c455d9d007befaf26dd94fe7d9b7f9533e40fdf3c2ad14692c05f","fast_id":"2d5bb6096083c5269396d832da72a38c85851782de49a06c65bc1b4a7b3bb01d","fast_time":0.1060035597,"language":"cpp","measured_fast_code_id":"2d5bb6096083c5269396d832da72a38c85851782de49a06c65bc1b4a7b3bb01d","measured_slow_code_id":"2882697c80899e52663c79a626cd761bd345f36325bcb36da72d6d2acb79f4ff","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26782","problem_id":"p02664","slow_code_id":"c77a4c382e70be05e491c3dea853c1018ac6e4180eda799af72c8c3ecaa49591","slow_id":"2882697c80899e52663c79a626cd761bd345f36325bcb36da72d6d2acb79f4ff","slow_time":0.2746547175,"speedup":2.5909952295686915,"stratum":"2-4","sampling_key":"c9bef0c8640264c41beaeb5b7caf55cfdb5fc07189d6be3be461b86b7d69b999","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 5;\n\nint memo[N][2];\n\nstring s;\n\nint solve(int i, bool b) {\n\n  if (i == s.size())\n\n    return 0;\n\n  int &ret = memo[i][b];\n\n  if (~ret)\n\n    return ret;\n\n  ret = 0;\n\n  if (s[i] == 'P' || s[i] == '?')\n\n    ret = solve(i + 1, 0);\n\n  if (s[i] == 'D' || s[i] == '?')\n\n    ret = max(ret, solve(i + 1, 1) + 1 + !b);\n\n  return ret;\n}\n\nvoid print(int i, bool b) {\n\n  if (i == s.size())\n\n    return;\n\n  if ((s[i] == 'P' || s[i] == '?') && solve(i + 1, 0) == solve(i, b)) {\n\n    cout << 'P';\n\n    return print(i + 1, 0);\n  }\n\n  cout << 'D';\n\n  print(i + 1, 1);\n}\n\nint main() {\n\n  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n\n  cin >> s;\n\n  memset(memo, -1, sizeof memo);\n\n  print(0, 1);\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n\n  string s;\n\n  cin >> s;\n\n  for (char &c : s)\n\n    if (c == '?')\n\n      c = 'D';\n\n  cout << s;\n}\n"}
{"fast_code_id":"e52cf0b82ca314196f032c93e3bc846ae1b3bfc23f64d232e347859485394024","fast_id":"0bd895c91485db522b33fc2a6d03eeefda5f950a8312ab248669362a804487f6","fast_time":0.0153017316,"language":"cpp","measured_fast_code_id":"0bd895c91485db522b33fc2a6d03eeefda5f950a8312ab248669362a804487f6","measured_slow_code_id":"606ada351f2ca309016335cbc0722a4e624e8b9ff2aa581b9f56c9feda4fe0ef","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26815","problem_id":"p02690","slow_code_id":"a5812a1f0e71ca4aecd462f329af5571d67f91af5690ebbc9a5c3902bbfa6770","slow_id":"606ada351f2ca309016335cbc0722a4e624e8b9ff2aa581b9f56c9feda4fe0ef","slow_time":0.036146865,"speedup":2.362272842375565,"stratum":"2-4","sampling_key":"0ef2eff7409adc0e9aed12f71ec5dda5736714aa249cc499f0a1c03436552bfc","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define _GLIBCXX_DEBUG\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define big 1000000007\n\n#define all(a) sort((a).begin(), (a).end())\n\n#define Re(a) reverse((a).begin(), (a).end())\n\n#define YN(a)                                                                                      \\\n  if (a) {                                                                                         \\\n    cout << \"Yes\" << endl;                                                                         \\\n  } else                                                                                           \\\n    cout << \"No\" << endl;\n\nconst int MOD = 1000000007;\n\nint main() {\n\n  int64_t x;\n\n  cin >> x;\n\n  int A, B;\n\n  for (int64_t a = -300; a <= 300; a++) {\n\n    for (int64_t b = -300; b <= 300; b++) {\n\n      if (a * a * a * a * a - b * b * b * b * b == x) {\n\n        A = a, B = b;\n      }\n    }\n  }\n\n  cout << A << \" \" << B << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define _GLIBCXX_DEBUG\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define big 1000000007\n\n#define all(a) sort((a).begin(), (a).end())\n\n#define Re(a) reverse((a).begin(), (a).end())\n\n#define YN(a)                                                                                      \\\n  if (a) {                                                                                         \\\n    cout << \"Yes\" << endl;                                                                         \\\n  } else                                                                                           \\\n    cout << \"No\" << endl;\n\nconst int MOD = 1000000007;\n\nint64_t a, b;\n\nbool is_five_square(int64_t k) {\n\n  if (k == 1) {\n\n    a = 1;\n\n    return true;\n  }\n\n  int64_t fivejk = round(pow(k, 1.0 / 5.0));\n\n  if (pow(fivejk, 5) == k) {\n\n    a = fivejk;\n\n    return true;\n\n  }\n\n  else {\n\n    return false;\n  }\n}\n\nint main() {\n\n  int64_t x;\n\n  cin >> x;\n\n  b = 0;\n\n  while (1) {\n\n    if (is_five_square(x + b * b * b * b * b)) {\n\n      break;\n    }\n\n    if (is_five_square(x - b * b * b * b * b)) {\n\n      b *= -1;\n\n      break;\n    }\n\n    b++;\n  }\n\n  cout << a << \" \" << b << endl;\n}\n"}
{"fast_code_id":"30d1f42fd63352b0f19bef2cbffbda60fac1cf8fc10459724b491d4e210f0a51","fast_id":"52a241a2b94f62f10ccab7726ab854c53d7c12552be833e2fcb406f5f6a360e8","fast_time":0.0193037922,"language":"cpp","measured_fast_code_id":"52a241a2b94f62f10ccab7726ab854c53d7c12552be833e2fcb406f5f6a360e8","measured_slow_code_id":"ff0edab521dbf49cc633051307979f9e45fb87d60e1b33f1af9f6d5539ec52ef","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_26909","problem_id":"p03835","slow_code_id":"ad869fb08176c154addbd669b22eef5407833164dd944774e4f91e23cf6efa39","slow_id":"ff0edab521dbf49cc633051307979f9e45fb87d60e1b33f1af9f6d5539ec52ef","slow_time":0.1093362685,"speedup":5.6639787336707865,"stratum":"4-8","sampling_key":"1eb6f5d3934cb8ac92fe781e50ec913ddbe83e8485f28ad4620cc95911e1495e","slow_code":"#include <iostream>\n\nusing namespace std;\n\nconst int maxi = 8000;\n\nint main()\n\n{\n\n  long long k, s, i, j, a[maxi], count, sum;\n\n  while (cin >> k >> s)\n\n  {\n\n    for (i = 0; i <= 7500; i++)\n\n      a[i] = 0;\n\n    count = 0;\n\n    for (i = 0; i <= k; i++)\n\n    {\n\n      for (j = 0; j <= k; j++)\n\n      {\n\n        a[i + j]++;\n      }\n    }\n\n    for (i = 0; i <= k; i++)\n\n    {\n\n      sum = s - i;\n\n      if (sum < 0)\n        continue;\n\n      else\n        count += a[sum];\n    }\n\n    cout << count << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int k, s;\n\n  scanf(\"%d%d\", &k, &s);\n\n  long long res = 0;\n\n  for (int x = 0; x <= min(k, s); x++)\n\n  {\n\n    int a1 = max(0, s - x - k);\n\n    int a2 = min(k, s - x);\n\n    if (a1 > k)\n      continue;\n\n    res += a2 - a1 + 1;\n  }\n\n  printf(\"%lld\\n\", res);\n\n  return 0;\n}"}
{"fast_code_id":"8f732396e841d0093ebd31c599a5f94c10622b5afa4994c167d619a13c75e99a","fast_id":"a8f3d67d31297e23a2c8404f7a15bda2240aee245b81d82210037fbbcd486398","fast_time":0.019209095,"language":"cpp","measured_fast_code_id":"a8f3d67d31297e23a2c8404f7a15bda2240aee245b81d82210037fbbcd486398","measured_slow_code_id":"39d92437f19aa171d3ceb17f59b972836e262e8268141e3b7f43e092bd51b7c3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_27363","problem_id":"p03954","slow_code_id":"ba5407482fc9b2acddfd9a17b8e57fd86a39d988c99ec81dcdbe56640e76a530","slow_id":"39d92437f19aa171d3ceb17f59b972836e262e8268141e3b7f43e092bd51b7c3","slow_time":0.4546600876,"speedup":23.66900093939876,"stratum":"8+","sampling_key":"972fa95aadad9aa6e078fa38d4ff05f509635b765f42182066ecb7a357d46124","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define reg register\n\nusing namespace std;\n\nconst int N = 2e5 + 7;\n\nint m, n, ans = 0, sum = 0, p, q;\n\nint a[N], b[N];\n\ninline int read() {\n\n  reg int s = 0, t = 0;\n  reg char ch = getchar();\n\n  while (ch > '9' || ch < '0')\n    t |= ch == '-', ch = getchar();\n\n  while (ch >= '0' && ch <= '9')\n    s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();\n\n  return t ? -s : s;\n}\n\ninline void print(reg long long x) {\n\n  if (x < 0)\n    putchar('-'), x = -x;\n\n  if (x > 9)\n    print(x / 10);\n\n  putchar(x % 10 + 48);\n}\n\nint main()\n\n{\n\n  n = read();\n  n = n * 2 - 1;\n\n  for (int i = 1; i <= n; i++)\n    a[i] = read();\n\n  int l = 0, r = 1e9 + 7;\n\n  while (l <= r)\n\n  {\n\n    int mid = l + r >> 1;\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      if (a[i] > mid)\n        b[i] = 1;\n\n      else\n        b[i] = 0;\n    }\n\n    b[n + 1] = b[n];\n\n    b[0] = b[1];\n\n    p = 0;\n\n    for (int i = 1; i <= n + 1; i++)\n\n    {\n\n      if (b[i - 1] != b[i]) {\n        p++;\n      }\n\n      if (b[i - 1] == b[i] && p)\n\n      {\n\n        if (p % 2 == 0)\n          for (int j = i - p; j <= i - 1; j++)\n            b[j] = b[i];\n\n        else\n\n        {\n\n          q = p >> 1;\n\n          for (int j = i - p; j <= i - q - 2; j++)\n            b[j] = b[i - p - 1];\n\n          for (int j = i - q - 1; j <= i - 1; j++)\n            b[j] = b[i];\n        }\n\n        p = 0;\n      }\n    }\n\n    if (b[n / 2 + 1]) {\n      l = mid + 1;\n    }\n\n    else {\n      r = mid - 1;\n      ans = mid;\n    }\n\n    memset(b, 0, sizeof(b));\n  }\n\n  printf(\"%d\", ans);\n\n  return 0;\n}\n","fast_code":"#include <cstring>\n\n#include <algorithm>\n\n#include <cctype>\n\n#include <cstdio>\n\nusing namespace std;\n\ninline int read(int f = 1, int x = 0, char ch = ' ')\n\n{\n\n  while (!isdigit(ch = getchar()))\n    if (ch == '-')\n      f = -1;\n\n  while (isdigit(ch))\n    x = x * 10 + ch - '0', ch = getchar();\n\n  return f * x;\n}\n\nconst int N = 2e5 + 5;\n\nint n, p[N], ans = 2;\n\nbool valid(int mid)\n\n{\n\n  for (int i = 0; i < n - 1; ++i)\n\n    if (max(p[n - i], p[n - i - 1]) <= mid || max(p[n + i], p[n + i + 1]) <= mid)\n      return true;\n\n    else if (min(p[n - i], p[n - i - 1]) > mid || min(p[n + i], p[n + i + 1]) > mid)\n      return false;\n\n  return p[1] <= mid;\n}\n\nint main()\n\n{\n\n  n = read();\n\n  for (int i = 2 * n - 1; i; --i)\n    p[i] = read();\n\n  int l = 2, r = 2 * n - 2;\n\n  while (l <= r)\n\n  {\n\n    int mid = (l + r) >> 1;\n\n    if (valid(mid))\n      r = mid - 1, ans = mid;\n\n    else\n      l = mid + 1;\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"55e26b497b84e2154a346ff1f46c895869cc96df3ec015ee31633bcc8b6e94a0","fast_id":"54b3ff440238922cdf866499c64765636f8e25f27f6b792c99b67f8d82cd9134","fast_time":0.1065356441,"language":"cpp","measured_fast_code_id":"54b3ff440238922cdf866499c64765636f8e25f27f6b792c99b67f8d82cd9134","measured_slow_code_id":"173479b2882d8fdaf7335e9b7c362328d7350aadf5a34797db510c2ae079e0dc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_27472","problem_id":"p03762","slow_code_id":"c0a63ced5d9363ab120c1bcea8afe0edf5b948d8956a840a4adeca8f50db094d","slow_id":"173479b2882d8fdaf7335e9b7c362328d7350aadf5a34797db510c2ae079e0dc","slow_time":0.6366772821,"speedup":5.976190292728516,"stratum":"4-8","sampling_key":"ae6f1b7327af793ce91595682fb5db53f6564e5449ecff19dde393f0dfecbf48","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\nconst int inf = 1e9 + 7;\n\nconst ll longinf = 1LL << 60;\n\n#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)\n\n#define rep(i, n) REP(i, 0, n)\n\n#define F first\n\n#define S second\n\nconst int mx = 100010;\n\nconst ll mod = 1e9 + 7;\n\nvector<ll> inv, fact, invfact;\n\nstruct mint {\n\n  ll x;\n\n  mint(ll x = 0) : x((x % mod + mod) % mod) {}\n\n  mint &operator+=(const mint a) {\n\n    if ((x += a.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  mint &operator-=(const mint a) {\n\n    if ((x += mod - a.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  mint &operator*=(const mint a) {\n\n    (x *= a.x) %= mod;\n\n    return *this;\n  }\n\n  mint operator+(const mint a) const {\n\n    mint res(*this);\n\n    return res += a;\n  }\n\n  mint operator-(const mint a) const {\n\n    mint res(*this);\n\n    return res -= a;\n  }\n\n  mint operator*(const mint a) const {\n\n    mint res(*this);\n\n    return res *= a;\n  }\n\n  mint pow(ll t) const {\n\n    if (!t)\n      return 1;\n\n    mint a = pow(t >> 1);\n\n    a *= a;\n\n    if (t & 1)\n      a *= *this;\n\n    return a;\n  }\n\n  mint inv() const { return pow(mod - 2); }\n\n  mint &operator/=(const mint a) { return (*this) *= a.inv(); }\n\n  mint operator/(const mint a) const {\n\n    mint res(*this);\n\n    return res /= a;\n  }\n};\n\nvoid mod_build(int n = 101010) {\n\n  fact.resize(n + 1);\n\n  inv.resize(n + 1);\n\n  invfact.resize(n + 1);\n\n  fact[0] = inv[0] = invfact[0] = 1;\n\n  inv[1] = 1;\n\n  rep(i, n) {\n\n    fact[i + 1] = fact[i] * (i + 1) % mod;\n\n    if (i > 0)\n      inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;\n\n    invfact[i + 1] = invfact[i] * inv[i + 1] % mod;\n  }\n}\n\nll perm(int n, int k) {\n\n  if (n < 0 || k < 0 || k > n)\n    return 0;\n\n  return fact[n] * invfact[n - k] % mod;\n}\n\nll comb(int n, int k) {\n\n  if (n < 0 || k < 0 || k > n)\n    return 0;\n\n  return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;\n}\n\nll powmod(ll n, ll k) {\n\n  k %= mod - 1;\n\n  if (k < 0)\n    k += mod - 1;\n\n  ll ret = 1;\n\n  while (k) {\n\n    if (k & 1)\n      ret = ret * n % mod;\n\n    n = n * n % mod;\n\n    k >>= 1;\n  }\n\n  return ret;\n}\n\nint main() {\n\n  mod_build();\n\n  int n, m;\n\n  cin >> n >> m;\n\n  vector<ll> x(n), y(m);\n\n  mint xsum = 0, ysum = 0;\n\n  rep(i, n) {\n\n    cin >> x[i];\n\n    if (i != 0)\n      xsum += (x[i] - x[i - 1]) * (n - i) * i;\n  }\n\n  rep(i, m) {\n\n    cin >> y[i];\n\n    if (i != 0)\n      ysum += (y[i] - y[i - 1]) * (m - i) * i;\n  }\n\n  mint ans = xsum * ysum;\n\n  cout << ans.x << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <iomanip>\n\n#include <math.h>\n\n#include <complex>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <bitset>\n\n#include <functional>\n\n#include <assert.h>\n\n#include <numeric>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\nconst int inf = 1e9 + 7;\n\nconst ll longinf = 1LL << 60;\n\n#define REP(i, m, n) for (ll i = (int)(m); i < (int)(n); ++i)\n\n#define rep(i, n) REP(i, 0, n)\n\n#define F first\n\n#define S second\n\nconstexpr char ln = '\\n';\n\nconst int mx = 200010;\n\nconst ll mod = 1e9 + 7;\n\nstruct mint {\n\n  ll x;\n\n  mint(ll x = 0) : x((x % mod + mod) % mod) {}\n\n  mint &operator+=(const mint a) {\n    if ((x += a.x) >= mod)\n      x -= mod;\n    return *this;\n  }\n\n  mint &operator-=(const mint a) {\n    if ((x += mod - a.x) >= mod)\n      x -= mod;\n    return *this;\n  }\n\n  mint &operator*=(const mint a) {\n    (x *= a.x) %= mod;\n    return *this;\n  }\n\n  mint operator+(const mint a) const {\n    mint res(*this);\n    return res += a;\n  }\n\n  mint operator-(const mint a) const {\n    mint res(*this);\n    return res -= a;\n  }\n\n  mint operator*(const mint a) const {\n    mint res(*this);\n    return res *= a;\n  }\n\n  mint pow(ll t) const {\n    if (!t)\n      return 1;\n    mint a = pow(t >> 1);\n    a *= a;\n    if (t & 1)\n      a *= *this;\n    return a;\n  }\n\n  mint inv() const { return pow(mod - 2); }\n\n  mint &operator/=(const mint a) { return (*this) *= a.inv(); }\n\n  mint operator/(const mint a) const {\n    mint res(*this);\n    return res /= a;\n  }\n};\n\nint main() {\n\n  int n, m;\n\n  cin >> n >> m;\n\n  vector<ll> x(n);\n\n  vector<ll> y(m);\n\n  rep(i, n) { cin >> x[i]; }\n\n  rep(i, m) { cin >> y[i]; }\n\n  mint xe = 0, ye = 0;\n\n  REP(i, 1, n) { xe += (x[i] - x[i - 1]) * (n - i) * i; }\n\n  REP(i, 1, m) { ye += (y[i] - y[i - 1]) * (m - i) * i; }\n\n  mint ans = xe * ye;\n\n  cout << ans.x << ln;\n\n  return 0;\n}"}
{"fast_code_id":"c200ef49533f201ad63707bb7fb44d34f91b6a273033f4bd36b1117d9cad52fd","fast_id":"3b59347fc0c07a28faa9533236c0231d7be9ef234b194f9379234396c9687838","fast_time":0.0191324122,"language":"cpp","measured_fast_code_id":"3b59347fc0c07a28faa9533236c0231d7be9ef234b194f9379234396c9687838","measured_slow_code_id":"87a3c6e5f4d7ce8dfafcfcc3d30fab2be89288d8aa3e15e5940cda33bf6bb611","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_27530","problem_id":"p02627","slow_code_id":"ad837e28017abc8009bf6b0e31082d659a2424c16998269fd2503f2e60f89675","slow_id":"87a3c6e5f4d7ce8dfafcfcc3d30fab2be89288d8aa3e15e5940cda33bf6bb611","slow_time":0.103665697,"speedup":5.418328641278176,"stratum":"4-8","sampling_key":"04849479f0f666a81d82d73eabf800fb56dc15ee928ae7a356b53af75efca97b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  char c;\n\n  cin >> c;\n\n  if (c >= 'A' && c <= 'Z')\n    cout << 'A';\n\n  else\n    cout << 'a';\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main() {\n\n  char s;\n\n  scanf(\"%c\", &s);\n\n  if (s >= 'a' && s <= 'z') {\n\n    printf(\"a\");\n\n  }\n\n  else if (s >= 'A' && s <= 'Z') {\n\n    printf(\"A\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"02bc94e27dbb3fe0232208ca29dee94542b0a9dd8d1acab0f78135068e8b0148","fast_id":"5a7c23c6755b33aff11eaaccac529d63fc8a4e3d34b81447fcd7398cde6c3494","fast_time":0.0193103891,"language":"cpp","measured_fast_code_id":"5a7c23c6755b33aff11eaaccac529d63fc8a4e3d34b81447fcd7398cde6c3494","measured_slow_code_id":"400dff6b8176ae515891ce73dc95b847df84b3514414f42e4355f66caad3adb4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_2758","problem_id":"p03889","slow_code_id":"1bf5d5e5c787b5aab7e753f36fd67495f31d06c48ff555617c9e2cc37811267e","slow_id":"400dff6b8176ae515891ce73dc95b847df84b3514414f42e4355f66caad3adb4","slow_time":0.0399125967,"speedup":2.066897590375328,"stratum":"2-4","sampling_key":"15a8c3bf2352381ce60021594fb97e8d20e3582c2c4e14180d3af4221991890f","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nchar s[100001], ss[100001];\n\nint main() {\n\n  scanf(\"%s\", s);\n\n  memcpy(ss, s, sizeof(s));\n\n  int n = strlen(s);\n\n  reverse(s, s + n);\n\n  for (int i = 0; i < n; ++i)\n\n    switch (s[i]) {\n\n    case 'd':\n\n      s[i] = 'b';\n\n      break;\n\n    case 'b':\n\n      s[i] = 'd';\n\n      break;\n\n    case 'p':\n\n      s[i] = 'q';\n\n      break;\n\n    case 'q':\n\n      s[i] = 'p';\n\n      break;\n    }\n\n  puts(strcmp(ss, s) ? \"No\" : \"Yes\");\n\n  return 0;\n}","fast_code":"#include <algorithm>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <cstdio>\n\n#include <string>\n\n#include <queue>\n\n#include <cmath>\n\n#include <set>\n\n#include <map>\n\nconst int oo = 2139063143;\n\nconst int N = 1010000;\n\nconst int P = 1000000007;\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef double db;\n\ntypedef int DATA1;\n\ntypedef int DATA2;\n\ninline void sc(DATA1 &x)\n\n{\n\n  x = 0;\n  static int p;\n  p = 1;\n  static char c;\n  c = getchar();\n\n  while (!isdigit(c)) {\n    if (c == '-')\n      p = -1;\n    c = getchar();\n  }\n\n  while (isdigit(c)) {\n    x = (x << 1) + (x << 3) + (c - 48);\n    c = getchar();\n  }\n\n  x *= p;\n}\n\ninline void print(DATA2 x)\n\n{\n\n  if (x < 0)\n    putchar('-'), x = -x;\n\n  if (x >= 10)\n    print(x / 10);\n\n  putchar(x % 10 + '0');\n}\n\ninline void pr(DATA2 x) { print(x), putchar('\\n'); }\n\nchar change(char c)\n\n{\n\n  if (c == 'b')\n    return 'd';\n\n  if (c == 'd')\n    return 'b';\n\n  if (c == 'p')\n    return 'q';\n\n  return 'p';\n}\n\nchar s[N];\n\nint main()\n\n{\n\n  scanf(\"%s\", s + 1);\n\n  int n = strlen(s + 1);\n\n  if (n & 1) {\n    puts(\"No\");\n    return 0;\n  }\n\n  for (int i = 1; i <= n >> 1; i++)\n\n    if (s[i] != change(s[n - i + 1])) {\n      puts(\"No\");\n      return 0;\n    }\n\n  puts(\"Yes\");\n\n  return 0;\n}\n"}
{"fast_code_id":"2ca72348a15ed9407e591b5f98aea14ba6f1f5917010b7986d77f108b62fa6ac","fast_id":"377078e672b9d86638d335f48c6c4ed832364333639de10498b31114f84fc590","fast_time":0.0172532003,"language":"cpp","measured_fast_code_id":"377078e672b9d86638d335f48c6c4ed832364333639de10498b31114f84fc590","measured_slow_code_id":"16c52c2c5575d994df1a15ef77bca4dc9c3fa5a7f19541e59f1f47eea70af2d5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_27882","problem_id":"p02819","slow_code_id":"63b8770c5b19bb5434e29fae8f568d12f25ff934e033b180b877064a7d478f09","slow_id":"16c52c2c5575d994df1a15ef77bca4dc9c3fa5a7f19541e59f1f47eea70af2d5","slow_time":0.5886730267,"speedup":34.11964252800102,"stratum":"8+","sampling_key":"2ea9232f269537f497ab5669ab6e8e795916265b4f1866c1b59183b518ebdbd8","slow_code":"#include <bits/stdc++.h>\n\n#define n 200005\n\nusing namespace std;\n\nvector<long long> v(n, 0);\n\nvector<long long> prime;\n\nlong long i, j;\n\nvoid sieve()\n\n{\n\n  for (i = 3; i * i <= n; i += 2)\n\n  {\n\n    for (j = i * i; j <= n; j += (i + i))\n\n    {\n\n      v[j - 1] = 1;\n    }\n  }\n\n  prime.push_back(2);\n\n  for (i = 3; i < n; i += 2)\n\n  {\n\n    if (v[i - 1] == 0)\n\n    {\n\n      prime.push_back(i);\n    }\n  }\n}\n\nint main()\n\n{\n\n  sieve();\n\n  long long num, t;\n\n  cin >> num;\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    if (prime[i] >= num)\n\n    {\n\n      cout << prime[i] << endl;\n\n      break;\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint isPrime(int x)\n\n{\n\n  int i;\n\n  if (x == 2)\n\n    return 1;\n\n  if (x % 2 == 0)\n\n    return 0;\n\n  for (i = 3; i <= x / 2; i += 2)\n\n  {\n\n    if (x % i == 0)\n\n      return 0;\n  }\n\n  return 1;\n}\n\nint main()\n\n{\n\n  int n, i;\n\n  scanf(\"%d\", &n);\n\n  for (i = n; i <= 1000000; i++)\n\n  {\n\n    if (isPrime(i))\n\n    {\n\n      printf(\"%d\\n\", i);\n\n      break;\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"250e3d56f700e7176b0c84faa3c82a798b343c31941c4432261d34f46e0fb254","fast_id":"2d7bf6849d646e7b85eefe9e835bf3ca3e0520d25b104dfd972593efd7c98be3","fast_time":0.0003937316,"language":"cpp","measured_fast_code_id":"2d7bf6849d646e7b85eefe9e835bf3ca3e0520d25b104dfd972593efd7c98be3","measured_slow_code_id":"8d8083724ca5d08f55f231e228b180023bdd7f5e166ce31c7546d0961dc38eb1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_2843","problem_id":"p02279","slow_code_id":"6c12380634a0c6e32ef0170b8c9b7e5e09da18fdaa6d63ba700bcd9d8b7c1dc5","slow_id":"8d8083724ca5d08f55f231e228b180023bdd7f5e166ce31c7546d0961dc38eb1","slow_time":0.0189010662,"speedup":48.00495108850801,"stratum":"8+","sampling_key":"e5734a941f38e66f8fb3b721a4eef0150b6da688e7e5e47d7ab6a4d38c1e667c","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <string>\n\nusing namespace std;\n\ntypedef long long int llint;\n\nstruct Node {\n\n  llint parent;\n\n  llint depth;\n\n  string state;\n\n  vector<llint> children;\n\n  Node() : parent(-1), depth(0) {}\n};\n\nstruct faster_io {\n\n  faster_io() {\n\n    cin.tie(0);\n\n    ios::sync_with_stdio(false);\n  }\n};\n\nvoid set_depth(vector<Node> &Nodes, Node &node, int depth) {\n\n  node.depth = depth;\n\n  for (int i = 0; i < node.children.size(); i++) {\n\n    set_depth(Nodes, Nodes[node.children[i]], depth + 1);\n  }\n}\n\nint main() {\n\n  llint const N_MAX = 100000;\n\n  faster_io io;\n\n  llint n;\n\n  cin >> n;\n\n  vector<Node> Nodes;\n\n  Nodes.resize(N_MAX);\n\n  for (llint i = 0; i < n; i++) {\n\n    llint id, k;\n\n    cin >> id >> k;\n\n    Node &x = Nodes[id];\n\n    for (llint j = 0; j < k; j++) {\n\n      llint c;\n\n      cin >> c;\n\n      x.children.push_back(c);\n\n      Nodes[c].parent = id;\n    }\n  }\n\n  Node root;\n\n  for (llint i = 0; i < n; i++) {\n\n    Node &x = Nodes[i];\n\n    if (x.parent == -1) {\n\n      x.state = \"root\";\n\n      root = x;\n\n    }\n\n    else if (x.children.size() == 0) {\n\n      x.state = \"leaf\";\n\n    }\n\n    else {\n\n      x.state = \"internal node\";\n    }\n  }\n\n  set_depth(Nodes, root, 0);\n\n  for (llint i = 0; i < n; i++) {\n\n    Node x = Nodes[i];\n\n    cout << \"node \" << i\n\n         << \": parent = \" << x.parent\n\n         << \", depth = \" << x.depth\n\n         << \", \" << x.state\n\n         << \", [\";\n\n    for (llint j = 0; j < x.children.size(); j++) {\n\n      if (j != x.children.size() - 1)\n        cout << x.children[j] << \", \";\n\n      else\n        cout << x.children[j];\n    }\n\n    cout << \"]\\n\";\n  }\n}","fast_code":"#include <cstdio>\n\n#define NIL -1\n\nconst int MAX_N = 100000 + 5;\n\nstruct Node {\n\n  int p, lc, rs;\n};\n\nNode node[MAX_N];\n\nint n;\n\nint id, k, c;\n\nint d[MAX_N];\n\nvoid setDepth(int i, int num) {\n\n  d[i] = num;\n\n  if (node[i].rs != NIL)\n    setDepth(node[i].rs, num);\n\n  if (node[i].lc != NIL)\n    setDepth(node[i].lc, num + 1);\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    node[i].p = node[i].lc = node[i].rs = NIL;\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d %d\", &id, &k);\n\n    int ls;\n\n    for (int j = 0; j < k; j++) {\n\n      scanf(\"%d\", &c);\n\n      node[c].p = id;\n\n      if (j == 0)\n        node[id].lc = c;\n\n      else\n        node[ls].rs = c;\n\n      ls = c;\n    }\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    if (node[i].p == NIL) {\n\n      setDepth(i, 0);\n\n      break;\n    }\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    printf(\"node %d: parent = %d, depth = %d, \", i, node[i].p, d[i]);\n\n    if (node[i].p == NIL)\n      printf(\"root, \");\n\n    else if (node[i].lc == NIL)\n      printf(\"leaf, \");\n\n    else\n      printf(\"internal node, \");\n\n    printf(\"[\");\n\n    for (int j = 0, c = node[i].lc; c != NIL; j++, c = node[c].rs) {\n\n      if (j)\n        printf(\", \");\n\n      printf(\"%d\", c);\n    }\n\n    printf(\"]\\n\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"4265930d5a95c2bc7d16006989fb594c95d0b42c73e4531fd693697e05a4f699","fast_id":"4be52811e623a0285b683ce0fb076c1f8cbfc947c892f461e6de16c556b6a789","fast_time":0.0697887118,"language":"cpp","measured_fast_code_id":"4be52811e623a0285b683ce0fb076c1f8cbfc947c892f461e6de16c556b6a789","measured_slow_code_id":"b3c5c0c36f434b20904f2ac1b93fd5c973bc0fd49052032af090bf4bb84201fa","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_29608","problem_id":"p03164","slow_code_id":"1d82c8fffb41f682de51e32bf73c278a8c99999c40c917bb4d20b41bfa3690bb","slow_id":"b3c5c0c36f434b20904f2ac1b93fd5c973bc0fd49052032af090bf4bb84201fa","slow_time":0.7594121612,"speedup":10.881590182898318,"stratum":"8+","sampling_key":"024d0e835200e00169094f3799017c9173d3661010c2562774fe874888d529b5","slow_code":"#include <iostream>\n\n#include <cstring>\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 1000010;\n\nconst int inf = 0x3f3f3f3f;\n\nll dp[maxn];\n\nll n, W;\n\nll v[maxn];\n\nll w[maxn];\n\ninline ll max(ll x, ll y) { return x > y ? x : y; }\n\ninline ll min(ll x, ll y) { return x < y ? x : y; }\n\nint main() {\n\n  memset(dp, 0x3f, sizeof(dp));\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  cin >> n >> W;\n\n  for (int i = 1; i <= n; i++)\n\n    cin >> w[i] >> v[i];\n\n  ll ans = 0ll;\n\n  dp[0] = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = 1e5; j >= v[i]; --j) {\n\n      dp[j] = min(dp[j], dp[j - v[i]] + w[i]);\n\n      if (dp[j] <= W)\n        ans = max(ans, (ll)(j));\n    }\n  }\n\n  cout << ans;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  long long N, W, V = 0;\n\n  cin >> N >> W;\n\n  vector<int> w(N), v(N);\n\n  for (int i = 0; i < N; i++) {\n\n    cin >> w[i] >> v[i];\n\n    V += v[i];\n  }\n\n  vector<long long> ks(V + 1, INT_MAX);\n\n  ks[0] = 0;\n\n  for (int i = 0; i < N; i++)\n\n    for (int j = V; j >= v[i]; j--)\n      ks[j] = min(ks[j - v[i]] + w[i], ks[j]);\n\n  for (int i = V; i >= 0; i--) {\n\n    if (ks[i] <= W) {\n\n      cout << i;\n\n      break;\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"1690115bbc38b00d187bf1b172a8f1d0ec40f458eaa985dcc5fc2c48cfc5a3dc","fast_id":"fa56897d600b4316c3a708a1c28f71ea5fee09ffcb5e83bbc0cbdd36917e6cf0","fast_time":0.105642662,"language":"cpp","measured_fast_code_id":"fa56897d600b4316c3a708a1c28f71ea5fee09ffcb5e83bbc0cbdd36917e6cf0","measured_slow_code_id":"764c7c8925a459930a908e5fb9a14b962a07252562f3639f55e5474cc4961a98","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_29772","problem_id":"p02705","slow_code_id":"07b0fe942476bc7fdc3e046e35f48019c6f8711755f10f9c61bf4c4c8eeb291b","slow_id":"764c7c8925a459930a908e5fb9a14b962a07252562f3639f55e5474cc4961a98","slow_time":0.9932747419,"speedup":9.402212355269882,"stratum":"8+","sampling_key":"6ef7ec080e127b97b8102fd4904c2d137809249a6e7ce6c7e16a69fb79c857bf","slow_code":"#include <iostream>\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define gc getchar_unlocked\n\n#define fo(i, n) for (i = 0; i < n; i++)\n\n#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)\n\n#define ll long long\n\n#define si(x) scanf(\"%d\", &x)\n\n#define sll(x) scanf(\"%lld\", &x)\n\n#define ss(s) scanf(\"%s\", s)\n\n#define pi(x) printf(\"%d\\n\", x)\n\n#define pl(x) printf(\"%lld\\n\", x)\n\n#define ps(s) printf(\"%s\\n\", s)\n\n#define deb(x) cout << #x << \"=\" << x << endl\n\n#define deb2(x, y) cout << #x << \"=\" << x << \",\" << #y << \"=\" << y << endl\n\n#define pb push_back\n\n#define mp make_pair\n\n#define F first\n\n#define S second\n\n#define all(x) x.begin(), x.end()\n\n#define clr(x) memset(x, 0, sizeof(x))\n\n#define sortall(x) sort(all(x))\n\n#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)\n\n#define PI 3.1415926535897932384626\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pl;\n\ntypedef vector<int> vi;\n\ntypedef vector<ll> vl;\n\ntypedef vector<pii> vpii;\n\ntypedef vector<pl> vpl;\n\ntypedef vector<vi> vvi;\n\ntypedef vector<vl> vvl;\n\nint mpow(int base, int exp);\n\nvoid ipgraph(int m);\n\nvoid dfs(int u, int par);\n\nconst int mod = 1000000007;\n\nconst int N = 3e5, M = N;\n\nvi g[N];\n\nint a[N];\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  cout << (2 * n) * PI;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define PI 3.1415926535897932384626\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  cout << (2 * n) * PI;\n\n  return 0;\n}"}
{"fast_code_id":"d547a2e018ba642676cc6b1984e35610715767b2ba34dbf969c0e3d314c1ef37","fast_id":"a8135085a09486deb6aa2f5fda91aeb0e49f7a7666fc5f2ae38020728d8e2baa","fast_time":0.0922471244,"language":"cpp","measured_fast_code_id":"a8135085a09486deb6aa2f5fda91aeb0e49f7a7666fc5f2ae38020728d8e2baa","measured_slow_code_id":"860b57132d73bb1ea88894d628dc43e4729e3a025a6efb50598ca1948fba25a2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_29806","problem_id":"p02755","slow_code_id":"6b0b668fd8a13daca7bce4fb7dce2d36d5e76b2c09ff43fe9d4b06280d8297e6","slow_id":"860b57132d73bb1ea88894d628dc43e4729e3a025a6efb50598ca1948fba25a2","slow_time":0.2157877936,"speedup":2.3392359924880215,"stratum":"2-4","sampling_key":"2b8b9efd684ffc8dc78d46d267f97cfddf8d62fb9d25122e4aeefe9314433fad","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef vector<vector<int> > vvi;\n\ntypedef vector<vector<bool> > vvb;\n\ntypedef vector<vector<char> > vvc;\n\ntypedef vector<int> vi;\n\ntypedef vector<bool> vb;\n\ntypedef vector<char> vc;\n\ntypedef long long ll;\n\nint main() {\n\n  int a, b;\n\n  cin >> a >> b;\n\n  int m, n;\n\n  for (int i = 0; i < 1000010; i++) {\n\n    if (i * 8 / 100 == a && i / 10 == b) {\n\n      cout << i << endl;\n\n      return 0;\n    }\n  }\n\n  cout << \"-1\" << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef vector<vector<int> > vvi;\n\ntypedef vector<vector<bool> > vvb;\n\ntypedef vector<vector<char> > vvc;\n\ntypedef vector<int> vi;\n\ntypedef vector<bool> vb;\n\ntypedef vector<char> vc;\n\ntypedef long long ll;\n\nint main() {\n\n  int a, b;\n\n  cin >> a >> b;\n\n  int m, n;\n\n  m = a * 100 / 8;\n\n  if (m * 8 / 100 != a)\n    m++;\n\n  n = b * 10;\n\n  if (m > n) {\n\n    if (m / 10 == b) {\n\n      cout << m << endl;\n\n      return 0;\n    }\n\n  } else {\n\n    if (n * 8 / 100 == a) {\n\n      cout << n << endl;\n\n      return 0;\n    }\n  }\n\n  cout << \"-1\" << endl;\n\n  return 0;\n}"}
{"fast_code_id":"52e48b75f830c11cf87fd6aef942e870541a52abd1c933f639efe5b3ed795e6c","fast_id":"6faf358be2c009ddd9beb1b8cb4a33300574259a12dea9e8fb7531ad28e8cd28","fast_time":0.087201789,"language":"cpp","measured_fast_code_id":"6faf358be2c009ddd9beb1b8cb4a33300574259a12dea9e8fb7531ad28e8cd28","measured_slow_code_id":"a6d47fc055c9f2ad8fae78950804f559f327c4ee9dd9b885efb0323b75838483","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_29820","problem_id":"p02821","slow_code_id":"7b8ce0e87b7d03c44e204b4be4eb62e5e5cf8a3dc30647cc85fe1e3ccb216df5","slow_id":"a6d47fc055c9f2ad8fae78950804f559f327c4ee9dd9b885efb0323b75838483","slow_time":0.1857473275,"speedup":2.130086201557172,"stratum":"2-4","sampling_key":"37a064de5fba2246adb9a7e2863675e70b2972d56ab3babf6b0db37de15112a3","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <math.h>\n\n#include <complex>\n\ndouble PI = acos(-1);\n\ntemplate <typename T>\n\nclass FFT {\n\nprivate:\n  using Complex = std::complex<long double>;\n\n  std::vector<Complex> C;\n\n  void DFT(std::vector<Complex> &F, int n, int sig = 1) {\n\n    if (n == 1)\n      return;\n\n    std::vector<Complex> f0(n / 2), f1(n / 2);\n\n    for (int i = 0; i < n / 2; ++i) {\n\n      f0[i] = F[2 * i];\n\n      f1[i] = F[2 * i + 1];\n    }\n\n    DFT(f0, n / 2, sig);\n\n    DFT(f1, n / 2, sig);\n\n    Complex z(cos(2.0 * PI / n), sin(2.0 * PI / n) * sig), zi = 1;\n\n    for (int i = 0; i < n; ++i) {\n\n      if (i < n / 2)\n        F[i] = f0[i] + zi * f1[i];\n\n      else\n        F[i] = f0[i - n / 2] + zi * f1[i - n / 2];\n\n      zi *= z;\n    }\n\n    return;\n  }\n\n  void invDFT(std::vector<Complex> &f, int n) {\n\n    DFT(f, n, -1);\n\n    for (int i = 0; i < n; ++i) {\n\n      f[i] /= n;\n    }\n\n    return;\n  }\n\npublic:\n  FFT(const std::vector<T> &A, const std::vector<T> &B) {\n\n    int n = 1;\n\n    while (n <= A.size() + B.size()) {\n\n      n *= 2;\n    }\n\n    std::vector<Complex> h(n, Complex(0)), g(n, Complex(0));\n\n    for (int i = 0; i < n; ++i) {\n\n      if (i < A.size())\n        h[i] = Complex(A[i]);\n\n      if (i < B.size())\n        g[i] = Complex(B[i]);\n    }\n\n    DFT(h, n);\n\n    DFT(g, n);\n\n    C.resize(n);\n\n    for (int i = 0; i < n; ++i)\n      C[i] = h[i] * g[i];\n\n    invDFT(C, n);\n\n    for (int i = 0; i < n; ++i)\n      if (T(C[i].real()) != C[i].real()) {\n\n        C[i] = Complex(C[i].real() + 0.5);\n      }\n  }\n\n  T operator[](int k) const { return C[k].real(); }\n};\n\nint main() {\n\n  int N;\n\n  long long M;\n\n  std::cin >> N >> M;\n\n  std::vector<int> A(N);\n\n  int MAX_A = 0;\n\n  for (int i = 0; i < N; ++i) {\n\n    std::cin >> A[i];\n\n    MAX_A = std::max(MAX_A, A[i]);\n  }\n\n  std::vector<long long> cnt(MAX_A + 1);\n\n  for (int i = 0; i < N; ++i) {\n\n    cnt[A[i]]++;\n  }\n\n  FFT<long long> C(cnt, cnt);\n\n  long long ans = 0;\n\n  for (int i = 2 * MAX_A; i >= 0; --i) {\n\n    if (M >= C[i]) {\n\n      ans += i * C[i];\n\n      M -= C[i];\n\n    } else {\n\n      ans += i * M;\n\n      break;\n    }\n  }\n\n  std::cout << ans << std::endl;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define REP(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)\n\n#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)\n\n#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)\n\n#define rrep(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)\n\n#define All(x) (x).begin(), (x).end()\n\n#define rAll(x) (x).rbegin(), (x).rend()\n\n#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)\n\nusing namespace std;\n\nusing Graph = vector<vector<int>>;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef vector<int> vi;\n\ntypedef vector<vi> vvi;\n\ntypedef vector<ll> vl;\n\ntypedef vector<vl> vvl;\n\nconstexpr ll mod = 1e9 + 7;\n\nconstexpr double eps = 1e-9;\n\nconst double PI = acos(-1);\n\nvoid solve();\n\ntemplate <typename T>\n\nbool chmax(T &a, T b) {\n\n  if (a < b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <typename T>\n\nbool chmin(T &a, T b) {\n\n  if (b < a) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\nll bisearch(ll ok, ll ng, function<bool(ll)> check) {\n\n  while (abs(ok - ng) > 1) {\n\n    ll mid = (ok + ng) / 2;\n\n    if (check(mid))\n      ok = mid;\n\n    else\n      ng = mid;\n  }\n\n  return ok;\n}\n\nll SQRT(ll n) {\n  ll s = 1;\n  while (s * s > n || n >= (s + 1) * (s + 1)) {\n    s = (n / s + s) / 2;\n  }\n  return s;\n}\n\nll roundup(ll n, ll div) {\n\n  if (n > 0)\n    return (n - 1) / div + 1;\n\n  else\n    return n / div;\n}\n\nbool square(ll a) {\n  ll n = SQRT(a);\n  return a == n * n;\n}\n\ntemplate <typename T> T npow(T x, ll n) {\n\n  T ans = T(1);\n\n  while (n != 0) {\n\n    if (n & 1)\n      ans = ans * x;\n\n    x = x * x;\n\n    n = n >> 1;\n  }\n\n  return ans;\n}\n\nint digitsum(ll N, int a) {\n\n  if (N == 0)\n    return 0;\n\n  int ret = 0;\n\n  ret += digitsum(N / a, a) + N % a;\n\n  return ret;\n}\n\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; };\n\nll lcm(ll x, ll y) { return x / gcd(x, y) * y; }\n\nll manhattan(const P &a, const P &b) {\n  return llabs(a.first - b.first) + llabs(a.second - b.second);\n}\n\ntemplate <class V>\n\nvector<int> Zalgo(V s) {\n\n  vector<int> A(s.size(), 0);\n\n  A[0] = s.size();\n\n  int i = 1, j = 0;\n\n  while (i < s.size()) {\n\n    while (i + j < s.size() && s[j] == s[i + j])\n      ++j;\n\n    A[i] = j;\n\n    if (j == 0) {\n      ++i;\n      continue;\n    }\n\n    int k = 1;\n\n    while (i + k < s.size() && k + A[k] < j)\n      A[i + k] = A[k], ++k;\n\n    i += k;\n    j -= k;\n  }\n\n  return A;\n}\n\nclass mint {\n\nprivate:\n  ll _num, _mod = mod;\n\n  mint set(ll num) {\n\n    _num = num;\n\n    if (_num < 0) {\n\n      if (_num >= -_mod)\n        _num = _mod + _num;\n\n      else\n        _num = _mod - (-_num) % _mod;\n\n    }\n\n    else if (_num >= _mod)\n      _num %= _mod;\n\n    return *this;\n  }\n\n  ll imod() const {\n\n    ll n = _mod - 2;\n\n    ll ans = 1, x = _num;\n\n    while (n != 0) {\n\n      if (n & 1)\n        ans = ans * x % _mod;\n\n      x = x * x % _mod;\n\n      n = n >> 1;\n    }\n\n    return ans;\n  }\n\npublic:\n  explicit mint() { _num = 0; }\n\n  explicit mint(ll num) {\n\n    _num = num;\n\n    if (_num < 0) {\n\n      if (_num >= -_mod)\n        _num = _mod + _num;\n\n      else\n        _num = _mod - (-_num) % _mod;\n\n    }\n\n    else if (_num >= _mod)\n      _num %= _mod;\n  }\n\n  explicit mint(ll num, ll M) {\n\n    _mod = M;\n\n    _num = num;\n\n    if (_num < 0) {\n\n      if (_num >= -_mod)\n        _num = _mod + _num;\n\n      else\n        _num = _mod - (-_num) % _mod;\n\n    }\n\n    else if (_num >= _mod)\n      _num %= _mod;\n  }\n\n  mint(const mint &cp) {\n    _num = cp._num;\n    _mod = cp._mod;\n  }\n\n  mint operator+(const mint &x) const { return mint(_num + x._num, _mod); }\n\n  mint operator-(const mint &x) const { return mint(_num - x._num, _mod); }\n\n  mint operator*(const mint &x) const { return mint(_num * x._num, _mod); }\n\n  mint operator/(const mint &x) const { return mint(_num * x.imod(), _mod); }\n\n  mint operator+=(const mint &x) { return set(_num + x._num); }\n\n  mint operator-=(const mint &x) { return set(_num - x._num); }\n\n  mint operator*=(const mint &x) { return set(_num * x._num); }\n\n  mint operator/=(const mint &x) { return set(_num * x.imod()); }\n\n  mint operator=(const ll x) { return set(x); }\n\n  mint operator+(const ll x) const { return *this + mint(x, _mod); }\n\n  mint operator-(const ll x) const { return *this - mint(x, _mod); }\n\n  mint operator*(const ll x) const { return *this * mint(x, _mod); }\n\n  mint operator/(const ll x) const { return *this / mint(x); }\n\n  mint operator+=(const ll x) {\n    *this = *this + x;\n    return *this;\n  }\n\n  mint operator-=(const ll x) {\n    *this = *this - x;\n    return *this;\n  }\n\n  mint operator*=(const ll x) {\n    *this = *this * x;\n    return *this;\n  }\n\n  mint operator/=(const ll x) {\n    *this = *this / x;\n    return *this;\n  }\n\n  bool operator==(const mint &x) const { return _num == x._num; }\n\n  bool operator!=(const mint &x) const { return _num != x._num; }\n\n  friend mint operator+(ll x, const mint &m) { return mint(m._num + x, m._mod); }\n\n  friend mint operator-(ll x, const mint &m) { return mint(x - m._num, m._mod); }\n\n  friend mint operator*(ll x, const mint &m) { return mint(m._num * (x % m._mod), m._mod); }\n\n  friend mint operator/(ll x, const mint &m) { return mint(m.imod() * (x % m._mod), m._mod); }\n\n  explicit operator ll() { return _num; }\n\n  explicit operator int() { return (int)_num; }\n\n  friend std::ostream &operator<<(std::ostream &os, const mint &x) {\n    os << x._num;\n    return os;\n  }\n\n  friend std::istream &operator>>(std::istream &is, mint &x) {\n    ll val;\n    is >> val;\n    x.set(val);\n    return is;\n  }\n};\n\nll inv_mod(ll a, ll _mod) { return (ll)npow(mint(a, _mod), _mod - 2); }\n\ntemplate <typename T> class MAT {\n\nprivate:\n  int row, col;\n\n  vector<vector<T>> _A;\n\n  double eps = 1e-9;\n\n  MAT set(vector<vector<T>> A) {\n    _A = A;\n    return *this;\n  }\n\npublic:\n  MAT() {}\n\n  MAT(int n, int m = 0, T x = T(0)) {\n\n    if (n < 1 || m < 0) {\n      cout << \"err Matrix::Matrix\" << endl;\n      exit(1);\n    }\n\n    row = n;\n\n    col = m ? m : n;\n\n    REP(i, row) {\n\n      vector<T> a(col, x);\n\n      _A.push_back(a);\n    }\n\n    if (m == 0)\n      REP(i, n) _A[i][i] = 1.0;\n  }\n\n  MAT(vector<vector<T>> A) {\n    row = A.size();\n    col = A[0].size();\n    _A = A;\n  }\n\n  MAT(const MAT &cp) {\n    _A = cp._A;\n    row = cp.row;\n    col = cp.col;\n  }\n\n  T *operator[](int i) { return _A[i].data(); }\n\n  MAT operator=(vector<vector<T>> x) { return set(x); }\n\n  MAT operator+(MAT x) const {\n\n    if (row != x.row || col != x.col) {\n\n      cerr << \"err Matrix::operator+\" << endl;\n\n      cerr << \"  not equal matrix size\" << endl;\n\n      exit(0);\n    }\n\n    MAT r(row, col);\n\n    REP(i, row) REP(j, col) r[i][j] = _A[i][j] + x[i][j];\n\n    return r;\n  }\n\n  MAT operator-(MAT x) const {\n\n    if (row != x.row || col != x.col) {\n\n      cerr << \"err Matrix::operator-\" << endl;\n\n      cerr << \"  not equal matrix size\" << endl;\n\n      exit(0);\n    }\n\n    MAT r(row, col);\n\n    REP(i, row) REP(j, col) r[i][j] = _A[i][j] - x[i][j];\n\n    return r;\n  }\n\n  MAT operator*(MAT x) const {\n\n    if (x.col == 1 && x.row == 1)\n      return x[0][0] * MAT(_A);\n\n    if (row == 1 && col == 1)\n      return _A[0][0] * x;\n\n    if (col != x.row) {\n\n      cerr << \"err Matrix::operator*\" << endl;\n\n      cerr << \"  not equal matrix size\" << endl;\n\n      exit(0);\n    }\n\n    MAT r(row, x.col);\n\n    REP(i, row) REP(j, x.col) REP(k, col) r[i][j] += _A[i][k] * x[k][j];\n\n    return r;\n  }\n\n  MAT operator/(MAT x) const {\n    *this = *this * x.inverse();\n    return *this;\n  }\n\n  MAT operator/(T a) const {\n\n    MAT r(row, col);\n\n    REP(i, row) REP(j, col) r[i][j] = _A[i][j] / a;\n\n    return r;\n  }\n\n  MAT operator+=(MAT x) {\n    *this = *this + x;\n    return *this;\n  }\n\n  MAT operator-=(MAT x) {\n    *this = *this - x;\n    return *this;\n  }\n\n  MAT operator*=(T a) {\n    *this = a * (*this);\n    return this;\n  }\n\n  MAT operator/=(MAT x) {\n    *this = *this / x;\n    return *this;\n  }\n\n  MAT operator/=(T a) {\n    *this = *this / a;\n    return *this;\n  }\n\n  friend MAT operator*(T n, MAT x) {\n\n    MAT r(x.row, x.col);\n\n    REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];\n\n    return r;\n  }\n\n  friend MAT operator*(MAT x, T n) {\n\n    MAT r(x.row, x.col);\n\n    REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];\n\n    return r;\n  }\n\n  explicit operator vector<vector<T>>() { return _A; }\n\n  friend ostream &operator<<(ostream &os, const MAT &x) {\n    REP(i, x.row) REP(j, x.col) os << x._A[i][j] << \" \\n\"[j == x.col - 1];\n    return os;\n  }\n\n  friend istream &operator>>(istream &is, MAT &x) {\n    REP(i, x.row) REP(j, x.col) is >> x._A[i][j];\n    return is;\n  }\n\n  size_t size_row() const { return row; }\n\n  size_t size_col() const { return col; }\n\n  MAT transpose() const {\n\n    MAT r(col, row);\n\n    REP(i, col) REP(j, row) r[i][j] = _A[j][i];\n\n    return r;\n  }\n\n  MAT inverse() const {\n\n    T buf;\n\n    MAT<T> inv_a(row, 0);\n\n    vector<vector<T>> a = _A;\n\n    REP(i, row) {\n\n      buf = 1 / a[i][i];\n\n      REP(j, row) {\n\n        a[i][j] *= buf;\n\n        inv_a[i][j] *= buf;\n      }\n\n      REP(j, row) {\n\n        if (i != j) {\n\n          buf = a[j][i];\n\n          REP(k, row) {\n\n            a[j][k] -= a[i][k] * buf;\n\n            inv_a[j][k] -= inv_a[i][k] * buf;\n          }\n        }\n      }\n    }\n\n    return inv_a;\n  }\n\n  MAT Jacobi(MAT b) const {\n\n    size_t sz = row;\n\n    MAT D(sz, sz), inD(sz, sz), H(sz, sz), N(sz, sz);\n\n    MAT c(sz, 1), x(sz, 1), tmp(sz, 1);\n\n    REP(i, sz) {\n\n      REP(j, sz) {\n\n        H[i][j] = 0;\n\n        if (i == j) {\n\n          D[i][j] = _A[i][j];\n\n          inD[i][j] = 1 / _A[i][j];\n\n          N[i][j] = 0;\n\n        }\n\n        else if (i != j) {\n\n          D[i][j] = 0;\n\n          inD[i][j] = 0;\n\n          N[i][j] = _A[i][j];\n        }\n      }\n\n      c[i][0] = 0;\n\n      x[i][0] = 1;\n    }\n\n    c = inD * b;\n\n    H = inD * N;\n\n    while (1) {\n\n      tmp = x;\n\n      x = c - H * x;\n\n      T r = T(0);\n\n      for (int i = 0; i < row; ++i) {\n\n        r += (x[i][0] - tmp[i][0]) * (x[i][0] - tmp[i][0]);\n      }\n\n      if (r < eps)\n        break;\n    }\n\n    return x;\n  }\n\n  MAT Gauss(MAT b) const {\n\n    MAT<T> DL(row), U(row), inDL(row), H(row), c(row, 1), x(row, 1), tmp(row, 1);\n\n    for (int i = 0; i < row; i++) {\n\n      for (int j = 0; j < col; j++) {\n\n        H[i][j] = 0;\n\n        if (i >= j) {\n\n          DL[i][j] = _A[i][j];\n\n          U[i][j] = 0;\n\n        }\n\n        else {\n\n          DL[i][j] = 0;\n\n          U[i][j] = _A[i][j];\n        }\n      }\n\n      x[i][0] = 1;\n    }\n\n    inDL = DL.inverse();\n\n    c = inDL * b;\n\n    H = inDL * U;\n\n    int n = 0;\n\n    while (1) {\n\n      tmp = x;\n\n      x = c - H * x;\n\n      T r = T(0);\n\n      for (int i = 0; i < row; ++i) {\n\n        r += (x[i][0] - tmp[i][0]) * (x[i][0] - tmp[i][0]);\n      }\n\n      n++;\n\n      if (r < eps)\n        break;\n    }\n\n    return x;\n  }\n\n  int rank() const {\n\n    vector<vector<T>> A = _A;\n\n    const int n = row, m = col;\n\n    int r = 0;\n\n    for (int i = 0; r < n && i < m; ++i) {\n\n      int pivot = r;\n\n      for (int j = r + 1; j < n; ++j)\n        if (fabs(A[j][i]) > fabs(A[pivot][i]))\n          pivot = j;\n\n      swap(A[pivot], A[r]);\n\n      if (fabs(A[r][i]) < eps)\n        continue;\n\n      for (int k = m - 1; k >= i; --k)\n        A[r][k] /= A[r][i];\n\n      rep(j, r + 1, n) rep(k, i, m) A[j][k] -= A[r][k] * A[j][i];\n\n      ++r;\n    }\n\n    return r;\n  }\n};\n\nclass UnionFind {\n\nprivate:\n  vector<int> Parent, es;\n\n  vector<ll> diff_weight;\n\npublic:\n  UnionFind(int N) {\n\n    es.resize(N, 0);\n\n    Parent.resize(N, -1);\n\n    diff_weight.resize(N, 0LL);\n  }\n\n  int root(int A) {\n\n    if (Parent[A] < 0)\n      return A;\n\n    else {\n\n      int r = root(Parent[A]);\n\n      diff_weight[A] += diff_weight[Parent[A]];\n\n      return Parent[A] = r;\n    }\n  }\n\n  bool issame(int A, int B) { return root(A) == root(B); }\n\n  ll weight(int x) {\n\n    root(x);\n\n    return diff_weight[x];\n  }\n\n  ll diff(int x, int y) { return weight(y) - weight(x); }\n\n  int size(int A) { return -Parent[root(A)]; }\n\n  int eize(int A) { return es[root(A)]; }\n\n  bool connect(int A, int B) {\n\n    A = root(A);\n    B = root(B);\n\n    if (A == B)\n      return false;\n\n    if (size(A) < size(B))\n      swap(A, B);\n\n    Parent[A] += Parent[B];\n\n    es[A] += es[B] + 1;\n\n    Parent[B] = A;\n\n    return true;\n  }\n\n  void unite(int A, int B) {\n\n    A = root(A);\n    B = root(B);\n\n    if (A == B) {\n\n      es[A]++;\n\n      return;\n    }\n\n    if (size(A) < size(B))\n      swap(A, B);\n\n    Parent[A] += Parent[B];\n\n    es[A] += es[B] + 1;\n\n    Parent[B] = A;\n\n    return;\n  }\n\n  bool merge(int A, int B, ll w) {\n\n    w += weight(A);\n    w -= weight(B);\n\n    A = root(A);\n    B = root(B);\n\n    if (A == B)\n      return false;\n\n    if (size(A) < size(B))\n      swap(A, B), w = -w;\n\n    Parent[A] += Parent[B];\n\n    Parent[B] = A;\n\n    diff_weight[B] = w;\n\n    return true;\n  }\n};\n\nclass Factorial {\n\nprivate:\n  vector<ll> fac;\n\n  vector<ll> ifac;\n\npublic:\n  Factorial(ll N) {\n\n    fac.push_back(1);\n\n    REP(i, N) fac.push_back(fac[i] * (i + 1) % mod);\n\n    ifac.resize(N + 1);\n\n    ifac[N] = inv_mod(fac[N], mod);\n\n    REP(i, N) ifac[N - 1 - i] = (ifac[N - i] * (N - i)) % mod;\n  }\n\n  ll fact(ll a) { return fac[a]; }\n\n  ll ifact(ll a) { return ifac[a]; }\n\n  ll cmb(ll a, ll b) {\n\n    if (a == 0 && b == 0)\n      return 1;\n\n    if (a < b || a < 0 || b < 0)\n      return 0;\n\n    ll tmp = ifact(a - b) * ifact(b) % mod;\n\n    return tmp * fac[a] % mod;\n  }\n\n  ll per(ll a, ll b) {\n\n    if (a == 0 && b == 0)\n      return 1;\n\n    if (a < b || a < 0 || b < 0)\n      return 0;\n\n    return fac[a] * ifac[a - b] % mod;\n  }\n};\n\nclass SOSU {\n\nprivate:\n  vector<int> Prime_Number;\n\n  vector<bool> isp;\n\npublic:\n  SOSU(int N) {\n\n    isp.resize(N + 1, true);\n\n    isp[0] = isp[1] = false;\n\n    rep(i, 2, N + 1) if (isp[i]) {\n\n      Prime_Number.push_back(i);\n\n      for (int j = 2 * i; j <= N; j += i)\n        isp[j] = false;\n    }\n  }\n\n  int operator[](int i) { return Prime_Number[i]; }\n\n  int size() { return Prime_Number.size(); }\n\n  int back() { return Prime_Number.back(); }\n\n  bool isPrime(int q) { return isp[q]; }\n};\n\nclass Divisor {\n\nprivate:\n  vector<ll> F;\n\n  vector<P> pfactorize;\n\npublic:\n  Divisor(ll N) {\n\n    for (ll i = 1; i * i <= N; i++) {\n\n      if (N % i == 0) {\n\n        F.push_back(i);\n\n        if (i * i != N)\n          F.push_back(N / i);\n      }\n    }\n\n    sort(begin(F), end(F));\n\n    SOSU p(SQRT(N) + 1);\n\n    REP(i, p.size()) {\n\n      pfactorize.push_back(P(p[i], 0));\n\n      while (N % p[i] == 0) {\n\n        N /= p[i];\n\n        pfactorize.back().second++;\n      }\n\n      if (pfactorize.back().second == 0)\n        pfactorize.pop_back();\n    }\n\n    if (N > 1)\n      pfactorize.push_back(P(N, 1));\n  }\n\n  int size() { return F.size(); }\n\n  vector<P> pfac() { return pfactorize; }\n\n  ll operator[](int k) { return F[k]; }\n};\n\nstruct compress {\n\n  map<ll, int> zip;\n\n  vector<ll> unzip;\n\n  compress(vector<ll> x) {\n\n    unzip = x;\n\n    sort(All(x));\n\n    x.erase(unique(All(x)), x.end());\n\n    REP(i, x.size()) { zip[x[i]] = i; }\n  }\n\n  int operator[](int k) { return zip[unzip[k]]; }\n};\n\nstruct edge {\n\n  int from;\n  int to;\n  ll cost;\n\n  void push(int a, int b, int c) {\n\n    from = a;\n    to = b;\n    cost = c;\n  }\n\n  bool operator<(const edge &y) const {\n\n    if (cost != y.cost)\n      return cost < y.cost;\n\n    else if (to != y.to)\n      return to < y.to;\n\n    else\n      return from < y.from;\n  }\n\n  bool operator>(const edge &y) const {\n\n    if (cost != y.cost)\n      return cost > y.cost;\n\n    else if (to != y.to)\n      return to > y.to;\n\n    else\n      return from > y.from;\n  }\n\n  bool operator==(const edge &y) const { return *this == y; }\n};\n\nclass lca {\n\npublic:\n  const int n = 0;\n\n  const int log2_n = 0;\n\n  std::vector<std::vector<int>> parent;\n\n  std::vector<int> depth;\n\n  lca() {}\n\n  lca(const Graph &g, int root)\n\n      : n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)), depth(n) {\n\n    dfs(g, root, -1, 0);\n\n    for (int k = 0; k + 1 < log2_n; k++) {\n\n      for (int v = 0; v < (int)g.size(); v++) {\n\n        if (parent[k][v] < 0)\n\n          parent[k + 1][v] = -1;\n\n        else\n\n          parent[k + 1][v] = parent[k][parent[k][v]];\n      }\n    }\n  }\n\n  void dfs(const Graph &g, int v, int p, int d) {\n\n    parent[0][v] = p;\n\n    depth[v] = d;\n\n    REP(j, g[v].size()) {\n\n      if (g[v][j] != p)\n        dfs(g, g[v][j], v, d + 1);\n    }\n  }\n\n  int get(int u, int v) {\n\n    if (depth[u] > depth[v])\n      std::swap(u, v);\n\n    for (int k = 0; k < log2_n; k++) {\n\n      if ((depth[v] - depth[u]) >> k & 1) {\n\n        v = parent[k][v];\n      }\n    }\n\n    if (u == v)\n      return u;\n\n    for (int k = log2_n - 1; k >= 0; k--) {\n\n      if (parent[k][u] != parent[k][v]) {\n\n        u = parent[k][u];\n\n        v = parent[k][v];\n      }\n    }\n\n    return parent[0][u];\n  }\n};\n\ntemplate <typename T> class SegmentTree {\n\nprivate:\n  typedef function<T(T, T)> F;\n\n  int n;\n\n  T d0;\n\n  vector<T> vertex;\n\n  F f;\n\n  F g;\n\npublic:\n  SegmentTree(F f, F g, T d) : d0(d), f(f), g(g) {}\n\n  void init(int _n) {\n\n    n = 1;\n\n    while (n < _n)\n      n *= 2;\n\n    vertex.resize(2 * n - 1, d0);\n  }\n\n  void build(const vector<T> &v) {\n\n    int n_ = v.size();\n\n    init(n_);\n\n    for (int i = 0; i < n_; i++)\n      vertex[n + i - 1] = v[i];\n\n    for (int i = n - 2; i >= 0; i--)\n\n      vertex[i] = f(vertex[2 * i + 1], vertex[2 * i + 2]);\n  }\n\n  void update(int i, T x) {\n\n    int k = i + n - 1;\n\n    vertex[k] = g(vertex[k], x);\n\n    while (k > 0) {\n\n      k = (k - 1) / 2;\n\n      vertex[k] = f(vertex[2 * k + 1], vertex[2 * k + 2]);\n    }\n\n    return;\n  }\n\n  T query(int l, int r) {\n\n    T vl = d0, vr = d0;\n\n    l += n - 1;\n\n    r += n - 1;\n\n    for (; l <= r; l /= 2, r = r / 2 - 1) {\n\n      if (l % 2 == 0)\n        vl = f(vl, vertex[l]);\n\n      if (r & 1)\n        vr = f(vr, vertex[r]);\n    }\n\n    return f(vl, vr);\n  }\n};\n\ntemplate <typename T, typename E>\n\nstruct LazySegmentTree {\n\n  using F = function<T(T, T)>;\n\n  using G = function<T(T, E)>;\n\n  using H = function<E(E, E)>;\n\n  int n, height;\n\n  F f;\n\n  G g;\n\n  H h;\n\n  T ti;\n\n  E ei;\n\n  vector<T> dat;\n\n  vector<E> laz;\n\n  LazySegmentTree(F f, G g, H h, T ti, E ei)\n      :\n\n        f(f), g(g), h(h), ti(ti), ei(ei) {}\n\n  void init(int n_) {\n\n    n = 1;\n    height = 0;\n\n    while (n < n_)\n      n <<= 1, height++;\n\n    dat.assign(2 * n, ti);\n\n    laz.assign(2 * n, ei);\n  }\n\n  void build(const vector<T> &v) {\n\n    int n_ = v.size();\n\n    init(n_);\n\n    for (int i = 0; i < n_; i++)\n      dat[n + i] = v[i];\n\n    for (int i = n - 1; i; i--)\n\n      dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);\n  }\n\n  inline T reflect(int k) { return laz[k] == ei ? dat[k] : g(dat[k], laz[k]); }\n\n  inline void propagate(int k) {\n\n    if (laz[k] == ei)\n      return;\n\n    laz[(k << 1) | 0] = h(laz[(k << 1) | 0], laz[k]);\n\n    laz[(k << 1) | 1] = h(laz[(k << 1) | 1], laz[k]);\n\n    dat[k] = reflect(k);\n\n    laz[k] = ei;\n  }\n\n  inline void thrust(int k) {\n\n    for (int i = height; i; i--)\n      propagate(k >> i);\n  }\n\n  inline void recalc(int k) {\n\n    while (k >>= 1)\n\n      dat[k] = f(reflect((k << 1) | 0), reflect((k << 1) | 1));\n  }\n\n  void update(int a, int b, E x) {\n\n    thrust(a += n);\n\n    thrust(b += n - 1);\n\n    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n\n      if (l & 1)\n        laz[l] = h(laz[l], x), l++;\n\n      if (r & 1)\n        --r, laz[r] = h(laz[r], x);\n    }\n\n    recalc(a);\n\n    recalc(b);\n  }\n\n  void set_val(int a, T x) {\n\n    thrust(a += n);\n\n    dat[a] = x;\n    laz[a] = ei;\n\n    recalc(a);\n  }\n\n  T query(int a, int b) {\n\n    thrust(a += n);\n\n    thrust(b += n - 1);\n\n    T vl = ti, vr = ti;\n\n    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n\n      if (l & 1)\n        vl = f(vl, reflect(l++));\n\n      if (r & 1)\n        vr = f(reflect(--r), vr);\n    }\n\n    return f(vl, vr);\n  }\n\n  template <typename C>\n\n  int find(int st, C &check, T &acc, int k, int l, int r) {\n\n    if (l + 1 == r) {\n\n      acc = f(acc, reflect(k));\n\n      return check(acc) ? k - n : -1;\n    }\n\n    propagate(k);\n\n    int m = (l + r) >> 1;\n\n    if (m <= st)\n      return find(st, check, acc, (k << 1) | 1, m, r);\n\n    if (st <= l && !check(f(acc, dat[k]))) {\n\n      acc = f(acc, dat[k]);\n\n      return -1;\n    }\n\n    int vl = find(st, check, acc, (k << 1) | 0, l, m);\n\n    if (~vl)\n      return vl;\n\n    return find(st, check, acc, (k << 1) | 1, m, r);\n  }\n\n  template <typename C>\n\n  int find(int st, C &check) {\n\n    T acc = ti;\n\n    return find(st, check, acc, 1, 0, n);\n  }\n};\n\nstruct rational {\n\n  ll p, q;\n\n  void normalize() {\n\n    if (q < 0)\n      p *= -1, q *= -1;\n\n    ll d = gcd(p < 0 ? -p : p, q);\n\n    if (d == 0)\n      p = 0, q = 1;\n\n    else\n      p /= d, q /= d;\n  }\n\n  rational(ll p, ll q = 1) : p(p), q(q) { normalize(); }\n\n  rational &operator+=(const rational &a) {\n    p = a.q * p + a.p * q;\n    q = a.q * q;\n    normalize();\n    return *this;\n  }\n\n  rational &operator-=(const rational &a) {\n    p = a.q * p - a.p * q;\n    q = a.q * q;\n    normalize();\n    return *this;\n  }\n\n  rational &operator*=(const rational &a) {\n    p *= a.p;\n    q *= a.q;\n    normalize();\n    return *this;\n  }\n\n  rational &operator/=(const rational &a) {\n    p *= a.q;\n    q *= a.p;\n    normalize();\n    return *this;\n  }\n\n  rational &operator-() {\n    p *= -1;\n    return *this;\n  }\n\n  friend rational operator+(const rational &a, const rational &b) { return rational(a) += b; }\n\n  friend rational operator*(const rational &a, const rational &b) { return rational(a) *= b; }\n\n  friend rational operator-(const rational &a, const rational &b) { return rational(a) -= b; }\n\n  friend rational operator/(const rational &a, const rational &b) { return rational(a) /= b; }\n\n  friend bool operator<(const rational &a, const rational &b) {\n\n    return (long double)a.p * b.q < (long double)a.q * b.p;\n  }\n\n  friend bool operator<=(const rational &a, const rational &b) { return !(b < a); }\n\n  friend bool operator>(const rational &a, const rational &b) { return b < a; }\n\n  friend bool operator>=(const rational &a, const rational &b) { return !(a < b); }\n\n  friend bool operator==(const rational &a, const rational &b) { return !(a < b) && !(b < a); }\n\n  friend bool operator!=(const rational &a, const rational &b) { return (a < b) || (b < a); }\n\n  friend ostream &operator<<(ostream &os, const rational &x) {\n    printf(\"%.16f\", (double)x.p / (double)x.q);\n    return os;\n  }\n\n  friend istream &operator>>(istream &is, rational &x) {\n    is >> x.p >> x.q;\n    x.normalize();\n    return is;\n  }\n};\n\ntemplate <typename T>\n\nclass FFT {\n\nprivate:\n  using Complex = std::complex<double>;\n\n  std::vector<Complex> C;\n\n  void DFT(std::vector<Complex> &F, int n, int sig = 1) {\n\n    if (n == 1)\n      return;\n\n    std::vector<Complex> f0(n / 2), f1(n / 2);\n\n    for (int i = 0; i < n / 2; ++i) {\n\n      f0[i] = F[2 * i];\n\n      f1[i] = F[2 * i + 1];\n    }\n\n    DFT(f0, n / 2, sig);\n\n    DFT(f1, n / 2, sig);\n\n    Complex z(cos(2.0 * PI / n), sin(2.0 * PI / n) * sig), zi = 1;\n\n    for (int i = 0; i < n; ++i) {\n\n      if (i < n / 2)\n        F[i] = f0[i] + zi * f1[i];\n\n      else\n        F[i] = f0[i - n / 2] + zi * f1[i - n / 2];\n\n      zi *= z;\n    }\n\n    return;\n  }\n\n  void invDFT(std::vector<Complex> &f, int n) {\n\n    DFT(f, n, -1);\n\n    for (int i = 0; i < n; ++i) {\n\n      f[i] /= n;\n    }\n\n    return;\n  }\n\npublic:\n  FFT(const std::vector<T> &A, const std::vector<T> &B) {\n\n    int n = 1;\n\n    while (n <= A.size() + B.size()) {\n\n      n *= 2;\n    }\n\n    std::vector<Complex> g(n, Complex(0));\n\n    C.resize(n, Complex(0));\n\n    int i_len = std::max(A.size(), B.size());\n\n    for (int i = 0; i < i_len; ++i) {\n\n      if (i < A.size())\n        C[i] = Complex(A[i]);\n\n      if (i < B.size())\n        g[i] = Complex(B[i]);\n    }\n\n    DFT(C, n);\n\n    DFT(g, n);\n\n    for (int i = 0; i < n; ++i)\n      C[i] = C[i] * g[i];\n\n    invDFT(C, n);\n\n    for (int i = 0; i < n; ++i)\n      if (T(C[i].real()) != C[i].real()) {\n\n        C[i] = Complex(C[i].real() + 0.5);\n      }\n  }\n\n  T operator[](int k) const { return C[k].real(); }\n};\n\nint main() {\n\n  cin.tie(nullptr);\n\n  ios::sync_with_stdio(false);\n\n  solve();\n\n  return 0;\n}\n\nvoid solve() {\n\n  int N;\n\n  long long M;\n\n  std::cin >> N >> M;\n\n  std::vector<int> A(N);\n\n  int MAX_A = 0;\n\n  for (int i = 0; i < N; ++i) {\n\n    std::cin >> A[i];\n\n    MAX_A = std::max(MAX_A, A[i]);\n  }\n\n  std::vector<long long> cnt(MAX_A + 1);\n\n  for (int i = 0; i < N; ++i) {\n\n    cnt[A[i]]++;\n  }\n\n  FFT<long long> C(cnt, cnt);\n\n  long long ans = 0;\n\n  for (int i = 2 * MAX_A; i >= 0; --i) {\n\n    if (M >= C[i]) {\n\n      ans += i * C[i];\n\n      M -= C[i];\n\n    } else {\n\n      ans += i * M;\n\n      break;\n    }\n  }\n\n  std::cout << ans << std::endl;\n}"}
{"fast_code_id":"dd5fa00b040683d137c36e4301b53eacd066d3dc795a04fce10accf1fa765c33","fast_id":"01769fb19a3df392b159b49eb4299d1c872e76204f4ea2a7edb0bf7b719e1cea","fast_time":0.000114434,"language":"cpp","measured_fast_code_id":"01769fb19a3df392b159b49eb4299d1c872e76204f4ea2a7edb0bf7b719e1cea","measured_slow_code_id":"f18868b7d039d844b31d319640bf1726d9e6be167ab7673350b501f594d8b21f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_29855","problem_id":"p02920","slow_code_id":"60963c70c600bf7091d508239f689b3e43ce2d4f99396a23dfde4f013dc3f76b","slow_id":"f18868b7d039d844b31d319640bf1726d9e6be167ab7673350b501f594d8b21f","slow_time":0.0009698083,"speedup":8.474826537567505,"stratum":"8+","sampling_key":"101ae8735f68b181f2b60f3a36832ad470ec26270f4b97274a070b1a2156c180","slow_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <set>\n\nint n;\n\nint S[1 << 18];\n\nint main() {\n\n  std::multiset<int, std::greater<int> > S, T;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < (1 << n); i++) {\n\n    int x;\n\n    scanf(\"%d\", &x);\n\n    S.insert(x);\n  }\n\n  T.insert(*(S.begin()));\n\n  S.erase(S.begin());\n\n  for (int i = 0; i < n; i++) {\n\n    int tmp[1 << 18];\n\n    int t = 0;\n\n    auto itr = S.begin();\n\n    for (int x : T) {\n\n      while (itr != S.end() && *itr == x)\n        ++itr;\n\n      if (itr == S.end()) {\n\n        puts(\"No\");\n\n        return 0;\n      }\n\n      tmp[t++] = *itr;\n\n      itr = S.erase(itr);\n    }\n\n    if (i != n - 1)\n      T.insert(tmp, tmp + t);\n  }\n\n  puts(\"Yes\");\n\n  return 0;\n}\n","fast_code":"#include <unistd.h>\n\n#include <algorithm>\n\n#include <functional>\n\nchar ibuf[4000000];\n\nchar *ibufe = ibuf - 1;\n\nvoid readall() {\n\n  int k, t = 0;\n\n  while ((k = read(STDIN_FILENO, ibuf + t, sizeof(ibuf) - t)) > 0)\n    t += k;\n}\n\nint read_uint() {\n\n  int x = 0;\n\n  while (*(++ibufe) < '0')\n    ;\n\n  do {\n\n    x *= 10;\n\n    x += *ibufe - '0';\n\n  } while (*(++ibufe) >= '0');\n\n  return x;\n}\n\nint n;\n\nint S[1 << 18];\n\nint Q[19];\n\nint main() {\n\n  readall();\n\n  n = read_uint();\n\n  for (int i = 0; i < (1 << n); i++)\n    S[i] = read_uint();\n\n  std::sort(S, S + (1 << n), std::greater<int>());\n\n  int k = 0;\n\n  for (int i = 0; i < (1 << n);) {\n\n    int j = i;\n\n    for (i++; S[i] == S[j]; i++)\n      ;\n\n    S[k++] = i - j;\n  }\n\n  Q[n] = 1;\n\n  for (int i = 0; i < k; i++) {\n\n    int l;\n\n    int a = 0;\n\n    for (l = n; l >= 0 && a < S[i]; l--) {\n\n      int x = Q[l];\n\n      Q[l] = a;\n\n      a += x;\n    }\n\n    if (a < S[i]) {\n\n      write(STDOUT_FILENO, \"No\\n\", 3);\n\n      return 0;\n    }\n\n    l++;\n\n    Q[l] += a - S[i];\n\n    for (int t = 0; t < l; t++)\n      Q[t] += S[i];\n  }\n\n  write(STDOUT_FILENO, \"Yes\\n\", 4);\n\n  return 0;\n}\n"}
{"fast_code_id":"db7a97f9e1bdd2c1a8e63d2312db802a4aee6df62f04a146022f0c109162a1ce","fast_id":"3c9d00d8959ee04e4a72da4066eb725267f84c3ed7ca92ea40ee266f3d416106","fast_time":0.0101242679,"language":"cpp","measured_fast_code_id":"3c9d00d8959ee04e4a72da4066eb725267f84c3ed7ca92ea40ee266f3d416106","measured_slow_code_id":"89abc0af4d0565e46668ff70ea76a4cb9c3e3cb8206c016f020404b933a6d90e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_2994","problem_id":"p04008","slow_code_id":"f967b81185368efd4cb9e9e3da01ce7889d6d7f3571ecaa8ba15159570c8d5d0","slow_id":"89abc0af4d0565e46668ff70ea76a4cb9c3e3cb8206c016f020404b933a6d90e","slow_time":0.1966052946,"speedup":19.41921100290126,"stratum":"8+","sampling_key":"15b52c97fcf665ca8610bc15f3f9a0673c4ae250db7b95ea09c9f9f44cea1fa1","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint N, K;\n\nint kotae = 0;\n\nvector<int> E[100001];\n\nint dfs(int A, int D) {\n\n  int d = 1;\n\n  for (int to : E[A]) {\n\n    d = max(d, dfs(to, D + 1) + 1);\n  }\n\n  if (d >= K && D > 1) {\n\n    kotae++;\n\n    return 0;\n\n  }\n\n  else\n    return d;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> N >> K;\n\n  rep1(i, N) {\n\n    int a;\n\n    cin >> a;\n\n    if (i != 1)\n      E[a].pb(i);\n\n    else if (a != 1)\n      kotae++;\n  }\n\n  dfs(1, 0);\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint N, K;\n\nint kotae = 0;\n\nint E[100001], ne[100001], H[100001];\n\nint D;\n\nint dfs(int A) {\n\n  int d = 1;\n\n  D++;\n\n  for (int v = H[A]; v; v = ne[v]) {\n\n    d = max(d, dfs(E[v]) + 1);\n  }\n\n  D--;\n\n  if (d >= K && D > 1) {\n\n    kotae++;\n\n    return 0;\n\n  }\n\n  else\n    return d;\n}\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  N = getint();\n\n  K = getint();\n\n  if (getint() != 1)\n    kotae++;\n\n  rep1(i, N - 1) {\n\n    int a = getint();\n\n    E[i] = i + 1;\n\n    ne[i] = H[a];\n\n    H[a] = i;\n  }\n\n  dfs(1);\n\n  printf(\"%d\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"57700c41d7d9d457df65217c208440cd1d83b5b76b592d5de2ba51d5b72af469","fast_id":"4d6fd54984a7991b94e5822612491a95372cf67c9ed42d40d15d6931f66d4527","fast_time":0.0864677191,"language":"cpp","measured_fast_code_id":"4d6fd54984a7991b94e5822612491a95372cf67c9ed42d40d15d6931f66d4527","measured_slow_code_id":"0571e670d1bf175e834a9c194eb2f16b5be8b6f7352b6a45e5eea0c731f91bc4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30223","problem_id":"p03957","slow_code_id":"dc19b2d0ea7c15d8e362233ae697b3ba96d810b15cdd36fd87489f0098fa999f","slow_id":"0571e670d1bf175e834a9c194eb2f16b5be8b6f7352b6a45e5eea0c731f91bc4","slow_time":0.3046803874,"speedup":3.523631599992094,"stratum":"2-4","sampling_key":"3ae7ce2770786f0b7a15aa7a2007fe8e476ec42408e42ab0faa8943154f7b5a7","slow_code":"#include <bits/stdc++.h>\n\n#define pb push_back\n\nusing namespace std;\n\nvoid debug_out() { cerr << '\\n'; }\n\ntemplate <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {\n  cerr << \" \" << H;\n  debug_out(T...);\n}\n\n#define dbg(...) cerr << #__VA_ARGS__ << \" ->\", debug_out(__VA_ARGS__)\n\n#define dbg_v(x, n)                                                            \\\n  do {                                                                         \\\n    cerr << #x \"[]: \";                                                         \\\n    for (int _ = 0; _ < n; ++_)                                                \\\n      cerr << x[_] << \" \";                                                     \\\n    cerr << '\\n';                                                              \\\n  } while (0)\n\n#define dbg_ok cerr << \"OK!\\n\"\n\ntypedef pair<int, int> pii;\n\ntypedef long long int ll;\n\ntypedef long double ld;\n\ninline int two(int n) { return 1 << n; }\n\ninline int test(int n, int pos) { return (bool)(n & two(pos)); }\n\ninline void set_bit(int &n, int b) { n |= two(b); }\n\ninline void unset_bit(int &n, int b) { n &= ~two(b); }\n\ninline int last_bit(int n) { return n & (-n); }\n\nconst int DMAX = 1e5 + 10;\n\nvector<int> vec;\n\nvector<int> arb[DMAX];\n\nchar s[DMAX];\n\nint V[DMAX];\n\nint n;\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int t, i, j, lg;\n\n  cin >> s;\n\n  lg = strlen(s);\n\n  for (i = 0; i < lg && s[i] != 'C'; i++)\n    ;\n\n  if (i == lg) {\n\n    cout << \"No\\n\";\n\n    return 0;\n  }\n\n  for (; i < lg && s[i] != 'F'; i++)\n    ;\n\n  if (i == lg) {\n\n    cout << \"No\\n\";\n\n    return 0;\n  }\n\n  cout << \"Yes\\n\";\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define NMAX 100005\n\nusing namespace std;\n\nint i, ok1, ok2;\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  string sir;\n\n  cin >> sir;\n\n  for (i = 0; i < sir.size(); ++i) {\n\n    if (sir[i] == 'C')\n\n      ok1 = 1;\n\n    if (sir[i] == 'F' && ok1 == 1) {\n\n      ok2 = 1;\n\n      break;\n    }\n  }\n\n  if (ok2 == 1)\n\n    cout << \"Yes\\n\";\n\n  else\n\n    cout << \"No\\n\";\n\n  return 0;\n}\n"}
{"fast_code_id":"164470bb63c11db6a217be8ba0d265f662f30e1c76802f59d91b8ad09bc5536a","fast_id":"2266be32567a60fe14f014924359cccbc8372eef13d8d33470a3c48ed1ff7322","fast_time":0.0060625534,"language":"cpp","measured_fast_code_id":"2266be32567a60fe14f014924359cccbc8372eef13d8d33470a3c48ed1ff7322","measured_slow_code_id":"6c9e6b78dd4850840ed1e8395c90f97ec5ccab04febb61cc7351da07989d9ee5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30261","problem_id":"p03862","slow_code_id":"d51f9a54b5ca6f01d81ea79b9343f9ce2b09d60a7a0d8abdace601e631596f7e","slow_id":"6c9e6b78dd4850840ed1e8395c90f97ec5ccab04febb61cc7351da07989d9ee5","slow_time":0.0549236411,"speedup":9.059489867751102,"stratum":"8+","sampling_key":"3ada768e01121f79735252d007ce6e3254cce4499b0451d2b0ea5afed07c8784","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <climits>\n\n#include <cctype>\n\n#include <map>\n\n#include <list>\n\n#include <stack>\n\n#include <queue>\n\n#include <vector>\n\n#include <set>\n\n#define mem(a, b) memset((a), (b), sizeof(a))\n\nusing namespace std;\n\nconst int INF = 0x3f3f3f3f;\n\nconst double PI = acos(-1.0);\n\nconst double eps = 1e-12;\n\nconst int MAX = 100000 + 10;\n\nconst int EDGE = 100000 + 10;\n\ntypedef long long ll;\n\nint main()\n\n{\n\n  ll n, x, i, a[MAX], t, ans;\n\n  while (~scanf(\"%lld%lld\", &n, &x))\n\n  {\n\n    mem(a, 0);\n\n    t = 0;\n\n    for (i = 0; i < n; i++)\n\n    {\n\n      scanf(\"%lld\", &a[i]);\n    }\n\n    ans = 0;\n\n    if (a[0] > x)\n\n    {\n\n      t = a[0] - x;\n\n      ans += t;\n\n      a[0] -= t;\n    }\n\n    for (i = 1; i < n; i++)\n\n    {\n\n      if (a[i] + a[i - 1] > x)\n\n      {\n\n        t = a[i] + a[i - 1] - x;\n\n        ans += t;\n\n        a[i] -= t;\n      }\n    }\n\n    printf(\"%lld\\n\", ans);\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n  int a[100005];\n\n  int n, x;\n\n  while (~scanf(\"%d%d\", &n, &x))\n\n  {\n    int i, j;\n\n    for (i = 0; i < n; i++)\n\n      scanf(\"%d\", &a[i]);\n\n    long long sum = 0;\n\n    if (a[0] > x)\n\n    {\n      sum += a[0] - x;\n\n      a[0] = x;\n    }\n\n    for (i = 1; i < n; i++)\n\n    {\n      int temp = a[i] + a[i - 1] - x;\n\n      if (temp > 0)\n\n      {\n        a[i] = a[i] - temp;\n\n        sum += temp;\n      }\n    }\n\n    printf(\"%lld\\n\", sum);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"d4c6dcf97fb57f967ec4567b0f9c03561792f98a36d6113cc1d0a108959c2928","fast_id":"18019a8050900ebe033456ae88edd97389581934e5aa340bcf9dd7717b72f4c6","fast_time":0.0925412565,"language":"cpp","measured_fast_code_id":"18019a8050900ebe033456ae88edd97389581934e5aa340bcf9dd7717b72f4c6","measured_slow_code_id":"19950a3c9b186bfae842f08c84d781db43f8df6638aabc0df417ad962302f476","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30342","problem_id":"p02788","slow_code_id":"6cce5ef7d65ee740154e0702de8d37ccc8a9e631a64d80d3d19d72e7ad87d56e","slow_id":"19950a3c9b186bfae842f08c84d781db43f8df6638aabc0df417ad962302f476","slow_time":0.395945008,"speedup":4.278578257687694,"stratum":"4-8","sampling_key":"8186402649b9940d12771093decbc497dee0b8e2616ce809aea76fd108e5e4ef","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 5;\n\nint main()\n\n{\n\n  long long n, d, a;\n\n  long long ans = 0, cur = 0;\n\n  vector<pair<long long, long long>> monsters(N);\n\n  queue<pair<long long, long long>> q;\n\n  cin >> n >> d >> a;\n\n  d *= 2;\n\n  for (int i = 0; i < n; ++i)\n\n    cin >> monsters[i].first >> monsters[i].second;\n\n  sort(monsters.begin(), monsters.begin() + n);\n\n  for (int i = 0; i < n; ++i) {\n\n    while (!q.empty()) {\n\n      if (q.front().first < monsters[i].first) {\n\n        cur -= q.front().second;\n\n        q.pop();\n\n      }\n\n      else\n\n        break;\n    }\n\n    monsters[i].second -= (cur * a);\n\n    if (monsters[i].second > 0) {\n\n      long long contrib = ((monsters[i].second + a - 1) / a);\n\n      ans += contrib;\n\n      cur += contrib;\n\n      q.push({monsters[i].first + d, contrib});\n    }\n  }\n\n  cout << ans;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <cmath>\n\nusing namespace std;\n\n#define max(a, b) ((a > b) ? a : b)\n\n#define min(a, b) ((a < b) ? a : b)\n\n#define fori(i, n) for (ll i = 0; i < n; ++i)\n\ntypedef long long ll;\n\nll n, d, a, x, h;\n\nint main() {\n\n  scanf(\"%lli%lli%lli\", &n, &d, &a);\n\n  d = 2 * d;\n\n  vector<pair<ll, ll> > mons, bombs;\n\n  fori(i, n) {\n\n    scanf(\"%lli%lli\", &x, &h);\n\n    ll nh = h / a;\n\n    if (h % a != 0)\n      nh++;\n\n    mons.emplace_back(x, nh);\n  }\n\n  sort(mons.begin(), mons.end());\n\n  ll bi = 0;\n\n  ll bt = 0;\n\n  ll totB = 0;\n\n  fori(i, n) {\n\n    while (bi < bombs.size() && mons[i].first - bombs[bi].first > d) {\n\n      bt -= bombs[bi].second;\n\n      bi++;\n    }\n\n    mons[i].second -= bt;\n\n    if (mons[i].second > 0) {\n\n      bombs.push_back({mons[i].first, mons[i].second});\n\n      bt += mons[i].second;\n\n      totB += mons[i].second;\n    }\n  }\n\n  printf(\"%lli\\n\", totB);\n}\n"}
{"fast_code_id":"f6c428e9423fa3e30553dbf007a4e0802457fc0488e992fb22dd0ebf05a21c41","fast_id":"e87104af7e13c0a74a63347a5b88ce5277a0e152da7d7c480f659bef9e57e1ba","fast_time":0.0103573459,"language":"cpp","measured_fast_code_id":"e87104af7e13c0a74a63347a5b88ce5277a0e152da7d7c480f659bef9e57e1ba","measured_slow_code_id":"ec177f76bc1e2ad4992fbdfae00f3a02bf392baa81282a5dfb8dec50acb72653","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30356","problem_id":"p02761","slow_code_id":"ae777e4014bb534f95a6ba9d7d6b0670cf280333204d0b1f070f94bae2e86862","slow_id":"ec177f76bc1e2ad4992fbdfae00f3a02bf392baa81282a5dfb8dec50acb72653","slow_time":0.0552812749,"speedup":5.337397769055874,"stratum":"4-8","sampling_key":"cdd4e35fee53e443916665e751fcdcfd181f30b95b742ecb3502475ffa4e1d8c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n\n  int n, m, a[10], s, c;\n\n  map<int, int> q;\n\n  cin >> n >> m;\n\n  int flag = 1;\n\n  memset(a, -1, sizeof(a));\n\n  while (m--) {\n\n    cin >> s >> c;\n\n    if (q.count(s) == 0) {\n\n      q[s] = c;\n\n      a[s] = c;\n\n    }\n\n    else {\n\n      if (q[s] != c)\n        flag = 0;\n    }\n  }\n\n  if (a[1] == 0 && n > 1)\n    flag = 0;\n\n  if (flag == 0)\n    puts(\"-1\");\n\n  else {\n\n    if (n > 1) {\n\n      for (int i = 1; i <= n; i++) {\n\n        if (a[i] == -1 && i == 1)\n          cout << 1;\n\n        else if (a[i] == -1 && i > 1)\n          cout << 0;\n\n        else\n          cout << a[i];\n      }\n\n    }\n\n    else {\n\n      if (a[1] == -1)\n        cout << 0;\n\n      else\n        cout << a[1];\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint a[5];\n\nint main() {\n\n  int n, m, i, s, c;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (i = 1; i <= n; i++)\n    a[i] = -1;\n\n  for (i = 1; i <= m; i++) {\n\n    scanf(\"%d%d\", &s, &c);\n\n    if (a[s] != -1 && a[s] != c) {\n\n      printf(\"-1\\n\");\n\n      return 0;\n\n    } else {\n\n      a[s] = c;\n    }\n  }\n\n  if (n > 1 && a[1] == 0)\n    printf(\"-1\\n\");\n\n  else if (n == 1) {\n\n    if (a[1] == -1)\n      printf(\"0\\n\");\n\n    else\n      printf(\"%d\\n\", a[1]);\n\n  }\n\n  else {\n\n    for (i = 1; i <= n; i++)\n\n      if (i == 1 && a[i] == -1)\n        printf(\"1\");\n\n      else if (a[i] == -1)\n        printf(\"0\");\n\n      else\n        printf(\"%d\", a[i]);\n\n    printf(\"\\n\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"3a2592979d0e338cc8253e8027496e9c4991f67b5ed72df5e2c3490347cbc8ae","fast_id":"d7bef18df4990c0aeb2bc1ed29b070ed9b6a7298e13dd17365c3af45d7c92f80","fast_time":0.03449361,"language":"cpp","measured_fast_code_id":"d7bef18df4990c0aeb2bc1ed29b070ed9b6a7298e13dd17365c3af45d7c92f80","measured_slow_code_id":"42080ea394b3e22b71a8570a6a0c2a57d02163a4e083cc2671c033ccc4a10629","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30411","problem_id":"p02596","slow_code_id":"55d3a7466aaac6fd26992127f4b0f1f6ac71db3bca6c6911170816c0013c8a56","slow_id":"42080ea394b3e22b71a8570a6a0c2a57d02163a4e083cc2671c033ccc4a10629","slow_time":0.0695085265,"speedup":2.0151131325483185,"stratum":"2-4","sampling_key":"224c1932c69ea25102407ff28054684bcf71815918f2613be639d022fcc96d4b","slow_code":"#include <iostream>\n\n#include <cstring>\n\n#define MAXN 1000007\n\nusing namespace std;\n\nbool vis[MAXN];\n\nint main()\n\n{\n\n  int ans = -1;\n\n  int now = 7;\n\n  int k;\n\n  cin >> k;\n\n  vis[now % k] = 1;\n\n  memset(vis, 0, sizeof vis);\n\n  if (now % k == 0) {\n\n    cout << \"1\\n\";\n\n  } else {\n\n    int i = 2;\n\n    while (now) {\n\n      now = (now * 10 + 7) % k;\n\n      if (vis[now])\n        break;\n\n      else if (now == 0) {\n        ans = i;\n        break;\n      }\n\n      i++;\n\n      vis[now] = 1;\n    }\n\n    cout << ans << '\\n';\n  }\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nll p[1000005];\n\nint main()\n\n{\n\n  ll a, b, c, d;\n\n  cin >> a;\n\n  ll k = 7;\n\n  ll ans = 1;\n\n  while (1)\n\n  {\n\n    if (k < a)\n\n    {\n\n      ans++;\n\n      k *= 10;\n\n      k += 7;\n\n    }\n\n    else\n\n    {\n\n      k = k % a;\n\n      if (k == 0)\n\n      {\n\n        cout << ans << endl;\n\n        return 0;\n      }\n\n      if (p[k] == 1 && k != 0)\n\n      {\n\n        cout << \"-1\" << endl;\n\n        return 0;\n      }\n\n      p[k] = 1;\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"7cdc96cbcb0fba0deab76bb8a76f73ae2df235e1a121e6013ad66fef0f9a7516","fast_id":"362a21675eb739ea405857f6747e5fd903ad86099abcc6734222e5d7c5004ab4","fast_time":0.0089706437,"language":"cpp","measured_fast_code_id":"362a21675eb739ea405857f6747e5fd903ad86099abcc6734222e5d7c5004ab4","measured_slow_code_id":"add5eecdf7556124816cbaf34270fc76a9cf1a73c92624e2deac3030f97d7435","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3042","problem_id":"p02957","slow_code_id":"9ffa7165fb28c304e4fdc2e7e0c31e4ba8807d789e52fbef4ed4e3c4d599106f","slow_id":"add5eecdf7556124816cbaf34270fc76a9cf1a73c92624e2deac3030f97d7435","slow_time":0.0508117722,"speedup":5.664228108847976,"stratum":"4-8","sampling_key":"1938c1f3029a684bb15774412580ec04ba9f09d82f14563ae6604bafa7c8d747","slow_code":"#include <iostream>\n\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int a;\n\n  int b;\n\n  int i;\n\n  int res = 0;\n\n  cin >> a;\n\n  cin >> b;\n\n  for (i = 0; i < 1000000000; i++) {\n\n    if (abs(a - i) == abs(b - i)) {\n\n      res = i;\n\n      break;\n    }\n  }\n\n  if (res > 0) {\n\n    cout << i;\n\n  }\n\n  else\n\n    cout << \"IMPOSSIBLE\";\n}\n","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\nint main()\n\n{\n\n  int a, b, k;\n\n  int c = 0;\n\n  scanf(\"%d%d\", &a, &b);\n\n  if ((a + b) % 2 == 0)\n\n  {\n\n    k = (a + b) / 2;\n\n    printf(\"%d\", k);\n\n  }\n\n  else\n\n  {\n\n    printf(\"IMPOSSIBLE\");\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"df604355d95f93ffcb3002de7ef0bcf987ea6def2bb69cac71cfc321e8e2d99c","fast_id":"dd782fd70175475ca76eba9534e14419f7e41766712b89eba9938b34956c8960","fast_time":0.0097370671,"language":"cpp","measured_fast_code_id":"dd782fd70175475ca76eba9534e14419f7e41766712b89eba9938b34956c8960","measured_slow_code_id":"74172efd22dae94863f2eb2c9d34e3ac194b946865cc0505675dc89d69656559","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30451","problem_id":"p02924","slow_code_id":"5dd3d160068ff4ba1c04d99d77da5af998a8e0e223c2385a71d6253ce1f68f9f","slow_id":"74172efd22dae94863f2eb2c9d34e3ac194b946865cc0505675dc89d69656559","slow_time":0.3431958736,"speedup":35.2463293181989,"stratum":"8+","sampling_key":"5952024b38438debce63a4c97d520a06b3bca1c75c396725c6e7b8ab6378be44","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define el '\\n'\n\n#define sz(v) ((int)((v).size()))\n\n#define all(v) ((v).begin()), ((v).end())\n\n#define clr(v, d) memset(v, d, sizeof(v))\n\ndouble const EPS = 1e-8, PI = acos(-1);\n\nconst int N = 2e5 + 9, M = 50 + 9, OO = (int)1e9 + 1;\n\nconst long long MOD = 1e9 + 7;\n\ntypedef long long ll;\n\nvoid OUTPUT() {\n\n  cout << fixed << setprecision(12);\n\n  ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);\n}\n\nvoid INPUT() {\n\n#ifndef ONLINE_JUDGE\n\n  freopen(\"input.txt\", \"r\", stdin);\n\n#endif\n\n  cout << fixed << setprecision(12);\n}\n\nvector<vector<int>> edges(N);\n\nll n, q, x, y;\n\nll counter[N];\n\nbool vis[N];\n\nint main() {\n\n  OUTPUT();\n\n  cin >> n;\n\n  x = n;\n\n  x--;\n\n  ll ans = x + (x * x);\n\n  ans /= 2;\n\n  cout << ans;\n\n  return 0;\n}\n","fast_code":"\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define For(i, x, y) for (int i = x; i < y; ++i)\n\n#define mem(x, y) memset(x, y, sizeof(x))\n\n#define ALL(a) a.begin(), a.end()\n\n#define PII pair<int, int>\n\n#define INF 0x3f3f3f3f\n\n#define DOF 0x7f7f7f7f\n\n#define se second\n\n#define fi first\n\n#define endl '\\n'\n\ntemplate <typename T>\n\ninline void read(T &r) {\n\n  static char c;\n  r = 0;\n  int f = 1;\n\n  for (c = getchar(); c < '0' || c > '9'; c = getchar())\n    if (c == '-')\n      f = -1;\n\n  for (; c >= '0' && c <= '9';\n       r = (r << 1) + (r << 3) + (c ^ 48), c = getchar())\n    ;\n\n  r *= f;\n}\n\nconst int N = 1e3 + 105;\n\nint main() {\n\n  ll n;\n\n  scanf(\"%lld\", &n);\n\n  printf(\"%lld\\n\", (1 + n) * n / 2 - n);\n}"}
{"fast_code_id":"4290ee7bac6d8fdecc91837227f736fa4c18cbeb4ad1b0f37af8fbbf10006522","fast_id":"c1af82c3c250ba5dbf36fc4e166f511bccd6aae1b2184ba1e57462a20a03fd51","fast_time":0.0774457424,"language":"cpp","measured_fast_code_id":"c1af82c3c250ba5dbf36fc4e166f511bccd6aae1b2184ba1e57462a20a03fd51","measured_slow_code_id":"cf8aa91debeb153365192f52b6a608320eafc887ba368f89c487bd54ecc48da2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30466","problem_id":"p03734","slow_code_id":"90fa7d2c6dbb641ad8ff6fad900075e2361d49e2137340c17d7fd85ab97d22b8","slow_id":"cf8aa91debeb153365192f52b6a608320eafc887ba368f89c487bd54ecc48da2","slow_time":0.1889979517,"speedup":2.4403917612906763,"stratum":"2-4","sampling_key":"5f457e12ebab287309c59a9d1b51b37be7067fd1954dfbe5bd40a417c45b00f8","slow_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\n#define fi first\n\n#define se second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define fbo find_by_order\n\n#define ook order_of_key\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> ii;\n\ntypedef vector<ll> vi;\n\ntypedef long double ld;\n\ntypedef tree<int, null_type, less<int>, rb_tree_tag,\n             tree_order_statistics_node_update>\n    pbds;\n\ntypedef set<int>::iterator sit;\n\ntypedef map<int, int>::iterator mit;\n\ntypedef vector<int>::iterator vit;\n\nll a[101];\n\nll b[101];\n\nll dp[4][301][101];\n\nll sum[4][101];\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(0);\n  cin.tie(0);\n\n  ll n;\n  ll w;\n\n  cin >> n >> w;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> a[i] >> b[i];\n  }\n\n  ll ans = 0;\n\n  for (int i = 0; i <= n; i++)\n\n  {\n\n    vector<ll> vec[4];\n\n    memset(dp, 0, sizeof(dp));\n\n    memset(sum, 0, sizeof(sum));\n\n    ll ww = w - ll(i) * a[0];\n\n    ww = min(ww, 3LL * i);\n\n    if (ww < 0)\n      continue;\n\n    for (int j = 0; j < n; j++)\n\n    {\n\n      vec[a[j] - a[0]].pb(b[j]);\n    }\n\n    for (int j = 0; j < 4; j++)\n      sort(vec[j].rbegin(), vec[j].rend());\n\n    for (int j = 0; j < 4; j++)\n\n    {\n\n      for (int k = 0; k < vec[j].size(); k++)\n\n      {\n\n        sum[j][k] = vec[j][k];\n\n        if (k > 0)\n          sum[j][k] += sum[j][k - 1];\n      }\n    }\n\n    for (int j = 0; j < vec[0].size(); j++)\n\n    {\n\n      dp[0][0][j + 1] = sum[0][j];\n    }\n\n    for (int j = 0; j < 3; j++)\n\n    {\n\n      for (int k = 0; k <= ww; k++)\n\n      {\n\n        for (int l = 0; l <= i; l++)\n\n        {\n\n          ll val = dp[j][k][l];\n\n          dp[j + 1][k][l] = max(dp[j + 1][k][l], val);\n\n          for (int m = 0; m < vec[j + 1].size(); m++)\n\n          {\n\n            if (l + m + 1 <= i && k + (j + 1) * (m + 1) <= ww)\n\n            {\n\n              dp[j + 1][k + (j + 1) * (m + 1)][l + m + 1] =\n                  max(dp[j + 1][k + (j + 1) * (m + 1)][l + m + 1],\n                      val + sum[j + 1][m]);\n            }\n          }\n        }\n      }\n    }\n\n    ll an = 0;\n\n    for (int k = 0; k <= ww; k++)\n\n    {\n\n      an = max(an, dp[3][k][i]);\n    }\n\n    ans = max(ans, an);\n  }\n\n  cout << ans << '\\n';\n}\n","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\nint n, m, a, b, c, d;\n\nlong long sum, ans;\n\nstruct node\n\n{\n\n  int w, v;\n\n} g[110];\n\nbool cmp(node a, node b)\n\n{\n\n  return a.v > b.v;\n}\n\nnode A[110], B[110], C[110], D[110];\n\nlong long swa[110], swb[110], swc[110], swd[110];\n\nlong long sva[110], svb[110], svc[110], svd[110];\n\nint main()\n\n{\n\n  cin >> n >> m;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> g[i].w >> g[i].v;\n\n    if (g[i].w == g[1].w)\n      A[++a] = g[i];\n\n    if (g[i].w == g[1].w + 1)\n      B[++b] = g[i];\n\n    if (g[i].w == g[1].w + 2)\n      C[++c] = g[i];\n\n    if (g[i].w == g[1].w + 3)\n      D[++d] = g[i];\n  }\n\n  sort(A + 1, A + a + 1, cmp);\n\n  sort(B + 1, B + b + 1, cmp);\n\n  sort(C + 1, C + c + 1, cmp);\n\n  sort(D + 1, D + d + 1, cmp);\n\n  for (int i = 1; i <= a; i++)\n\n  {\n\n    swa[i] = swa[i - 1] + A[i].w;\n\n    sva[i] = sva[i - 1] + A[i].v;\n  }\n\n  for (int i = 1; i <= b; i++)\n\n  {\n\n    swb[i] = swb[i - 1] + B[i].w;\n\n    svb[i] = svb[i - 1] + B[i].v;\n  }\n\n  for (int i = 1; i <= c; i++)\n\n  {\n\n    swc[i] = swc[i - 1] + C[i].w;\n\n    svc[i] = svc[i - 1] + C[i].v;\n  }\n\n  for (int i = 1; i <= d; i++)\n\n  {\n\n    swd[i] = swd[i - 1] + D[i].w;\n\n    svd[i] = svd[i - 1] + D[i].v;\n  }\n\n  for (int i = 0; i <= a; i++)\n\n    for (int j = 0; j <= b; j++)\n\n      for (int k = 0; k <= c; k++)\n\n        for (int l = 0; l <= d; l++)\n\n        {\n\n          sum = swa[i] + swb[j] + swc[k] + swd[l];\n\n          if (sum <= m)\n\n            ans = max(ans, sva[i] + svb[j] + svc[k] + svd[l]);\n        }\n\n  cout << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"b4886c044b23db6d5494229ad20b0907cf6940c003cc693a12fc07be46a092a9","fast_id":"b03125fdeab91b3e28725123671c9a5a43879613af597aca3aeba04c1631079e","fast_time":0.0200138561,"language":"cpp","measured_fast_code_id":"b03125fdeab91b3e28725123671c9a5a43879613af597aca3aeba04c1631079e","measured_slow_code_id":"cc94ee110f2be33f1c30018bf8ac9a95c5fe85c0cffa34180d0a24044eda9522","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30546","problem_id":"p03745","slow_code_id":"1fa1643358035a492c098f36053c9d76d4a9bf69c952dee883ac5665313559f6","slow_id":"cc94ee110f2be33f1c30018bf8ac9a95c5fe85c0cffa34180d0a24044eda9522","slow_time":0.1485634908,"speedup":7.423031826435486,"stratum":"4-8","sampling_key":"867d829ef3714d83e934d8d561dc07fb578ffa5a6dfda242d6c6f6628e7fe129","slow_code":"#include <iostream>\n\n#include <cstring>\n\nusing namespace std;\n\nint pd[100010], arr[100010];\n\nint main()\n\n{\n\n  int n, m, ans = 0, T = 0;\n\n  memset(pd, 0, sizeof(pd));\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> arr[i];\n  }\n\n  T = arr[2] - arr[1];\n\n  for (int i = 3; i <= n; i++) {\n\n    if (T == 0)\n      T = arr[i] - arr[i - 1];\n\n    if (1LL * T * (arr[i] - arr[i - 1]) < 0) {\n\n      ans++;\n\n      T = 0;\n    }\n  }\n\n  cout << ans + 1 << endl;\n}","fast_code":"\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\ntypedef long long LL;\n\nusing namespace std;\n\n#define max_n 100005\n\nint a[max_n];\n\nint main()\n\n{\n\n  int n, k = 1, ans, i;\n\n  bool flag, res = false;\n\n  scanf(\"%d\", &n);\n\n  scanf(\"%d\", &a[0]);\n\n  if (n == 1)\n\n  {\n\n    printf(\"1\\n\");\n\n    return 0;\n  }\n\n  ans = a[0];\n\n  for (i = 1; i < n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n\n    if (!res)\n\n    {\n\n      if (a[i] > ans)\n\n      {\n\n        flag = true;\n\n        res = true;\n\n        ans = a[i];\n\n      }\n\n      else if (a[i] < ans)\n\n      {\n\n        flag = false;\n\n        res = true;\n\n        ans = a[i];\n      }\n\n    }\n\n    else\n\n    {\n\n      if (flag)\n\n      {\n\n        if (a[i] >= ans)\n\n          ans = a[i];\n\n        else\n\n        {\n\n          k++;\n\n          ans = a[i];\n\n          res = false;\n        }\n\n      }\n\n      else\n\n      {\n\n        if (a[i] <= ans)\n\n          ans = a[i];\n\n        else\n\n        {\n\n          k++;\n\n          ans = a[i];\n\n          res = false;\n        }\n      }\n    }\n  }\n\n  printf(\"%d\\n\", k);\n\n  return 0;\n}"}
{"fast_code_id":"b3bfa6157625820e20344669228384871394aba605467c3c6fe9a2a705c4882c","fast_id":"6ec202d116e3271f48522a5a93e3630ec6774d191c834b33bc93650dd968a9ca","fast_time":0.081388547,"language":"cpp","measured_fast_code_id":"6ec202d116e3271f48522a5a93e3630ec6774d191c834b33bc93650dd968a9ca","measured_slow_code_id":"c7e3a0254a0a6b6edcaa93541ccffb69067a66a038092b97564f832d6014ad7a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30587","problem_id":"p02708","slow_code_id":"3950a36391fdf2c9595494cc0c7c899859071e1d1852c86abcd61481312c2633","slow_id":"c7e3a0254a0a6b6edcaa93541ccffb69067a66a038092b97564f832d6014ad7a","slow_time":0.3420722497,"speedup":4.2029531464666645,"stratum":"4-8","sampling_key":"69574f0dcce2d8d22dc341c8eb2c13594d85e3fa54b5ccec01bcfe1a53d0a856","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#pragma GCC target(\"avx2\")\n\n#pragma GCC optimization(\"unroll-loops\")\n\n#pragma GCC optimize(\"O2\")\n\n#define pb push_back\n\n#define mp make_pair\n\n#define ff first\n\n#define ss second\n\n#define all(v) v.begin(), v.end()\n\n#define prec(n) fixed << setprecision(n)\n\n#define n_l '\\n'\n\n#define gcd __gcd\n\n#define append push_back\n\n#define str to_string\n\n#define max3(a, b, c) max(a, max(b, c))\n\n#define min3(a, b, c) min(a, min(b, c))\n\n#define sswap(a, b)                                                                                \\\n  {                                                                                                \\\n    a = a ^ b;                                                                                     \\\n    b = a ^ b;                                                                                     \\\n    a = a ^ b;                                                                                     \\\n  }\n\n#define swap(a, b)                                                                                 \\\n  {                                                                                                \\\n    auto temp = a;                                                                                 \\\n    a = b;                                                                                         \\\n    b = temp;                                                                                      \\\n  }\n\n#define init(dp) memset(dp, -1, sizeof(dp));\n\n#define set0(dp) memset(dp, 0, sizeof(dp));\n\n#define bits(x) __builtin_popcount(x)\n\n#define SORT(v) sort(all(v))\n\n#define endl \"\\n\"\n\n#define forr(i, n) for (ll i = 0; i < n; i++)\n\ntypedef long long int ll;\n\n#define int ll\n\nconstexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};\n\nconstexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};\n\nconstexpr ll INF = 1999999999999999997;\n\nconstexpr int inf = INT_MAX;\n\nconstexpr int MAXSIZE = int(1e6) + 5;\n\nconstexpr auto PI = 3.14159265358979323846L;\n\nconstexpr auto oo = numeric_limits<int>::max() / 2 - 2;\n\nconstexpr auto eps = 1e-6;\n\nconstexpr auto mod = 1000000007;\n\nconstexpr auto MOD = 1000000007;\n\nconstexpr auto MOD9 = 1000000009;\n\nconstexpr auto maxn = 100006;\n\nvoid fastio() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n}\n\nint fac[2 * maxn + 4];\n\nint ifac[2 * maxn + 4];\n\nll mod_pow(ll a, ll b, ll p) {\n\n  ll res = 1;\n\n  a %= p;\n\n  while (b > 0) {\n\n    if (b & 1 == 1)\n      res = ((res % p) * (a % p)) % p;\n\n    a = (a % p * a % p) % p;\n\n    b >>= 1;\n  }\n\n  return res;\n}\n\nvoid pre() {\n\n  fac[0] = 1;\n\n  for (int i = 1; i <= 2 * maxn; i++) {\n\n    fac[i] = i * fac[i - 1];\n\n    fac[i] %= mod;\n  }\n\n  ifac[2 * maxn] = mod_pow(fac[2 * maxn], mod - 2, mod);\n\n  for (int i = 2 * maxn - 1; i >= 0; i--) {\n\n    ifac[i] = (i + 1) * ifac[i + 1];\n\n    ifac[i] %= mod;\n  }\n}\n\nint nCr(int n, int r) {\n\n  if (r > n)\n    return 0;\n\n  if (r == n)\n    return 1;\n\n  int ans = fac[n];\n\n  ans %= mod;\n\n  ans = ans * ifac[r];\n\n  ans %= mod;\n\n  ans = ans * ifac[n - r];\n\n  ans %= mod;\n\n  return ans;\n}\n\nint32_t main() {\n\n  fastio();\n\n  int n, k;\n\n  cin >> n >> k;\n\n  pre();\n\n  int ans = 0;\n\n  int pre = 0, suff = 0;\n\n  for (int i = 1; i <= n + 1; i++) {\n\n    pre += i - 1;\n\n    suff += (n + 1 - i);\n\n    pre %= mod;\n\n    suff %= mod;\n\n    if (i >= k)\n      ans = (ans + suff - pre + 1 + mod) % mod;\n  }\n\n  cout << ans;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#pragma GCC target(\"avx2\")\n\n#pragma GCC optimization(\"unroll-loops\")\n\n#pragma GCC optimize(\"O2\")\n\n#define pb push_back\n\n#define mp make_pair\n\n#define ff first\n\n#define ss second\n\n#define all(v) v.begin(), v.end()\n\n#define prec(n) fixed << setprecision(n)\n\n#define n_l '\\n'\n\n#define gcd __gcd\n\n#define append push_back\n\n#define str to_string\n\n#define max3(a, b, c) max(a, max(b, c))\n\n#define min3(a, b, c) min(a, min(b, c))\n\n#define sswap(a, b)                                                                                \\\n  {                                                                                                \\\n    a = a ^ b;                                                                                     \\\n    b = a ^ b;                                                                                     \\\n    a = a ^ b;                                                                                     \\\n  }\n\n#define swap(a, b)                                                                                 \\\n  {                                                                                                \\\n    auto temp = a;                                                                                 \\\n    a = b;                                                                                         \\\n    b = temp;                                                                                      \\\n  }\n\n#define init(dp) memset(dp, -1, sizeof(dp));\n\n#define set0(dp) memset(dp, 0, sizeof(dp));\n\n#define bits(x) __builtin_popcount(x)\n\n#define SORT(v) sort(all(v))\n\n#define endl \"\\n\"\n\n#define forr(i, n) for (ll i = 0; i < n; i++)\n\ntypedef long long int ll;\n\n#define int ll\n\nconstexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};\n\nconstexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};\n\nconstexpr ll INF = 1999999999999999997;\n\nconstexpr int inf = INT_MAX;\n\nconstexpr int MAXSIZE = int(1e6) + 5;\n\nconstexpr auto PI = 3.14159265358979323846L;\n\nconstexpr auto oo = numeric_limits<int>::max() / 2 - 2;\n\nconstexpr auto eps = 1e-6;\n\nconstexpr auto mod = 1000000007;\n\nconstexpr auto MOD = 1000000007;\n\nconstexpr auto MOD9 = 1000000009;\n\nconstexpr auto maxn = 100006;\n\nvoid fastio() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n}\n\nll mod_pow(ll a, ll b, ll p) {\n\n  ll res = 1;\n\n  a %= p;\n\n  while (b > 0) {\n\n    if (b & 1 == 1)\n      res = ((res % p) * (a % p)) % p;\n\n    a = (a % p * a % p) % p;\n\n    b >>= 1;\n  }\n\n  return res;\n}\n\nint32_t main() {\n\n  fastio();\n\n  int n, k;\n\n  cin >> n >> k;\n\n  int mini = 0;\n\n  for (int i = 0; i < k; i++) {\n\n    mini += i;\n  }\n\n  int maxi = 0;\n\n  int j = 0;\n\n  int p = n;\n\n  for (p = n; j < k; p--, j++) {\n\n    maxi += p;\n  }\n\n  int ans = maxi - mini + 1;\n\n  ans %= mod;\n\n  for (int i = k; i <= n; i++) {\n\n    maxi += p;\n\n    p--;\n\n    mini += i;\n\n    ans += (maxi - mini + 1);\n\n    ans %= mod;\n  }\n\n  cout << ans;\n}"}
{"fast_code_id":"63e4dea025d5c06c2893d521aa05528ed9dd1efa50e46798a726e53b442e45be","fast_id":"9141cc761d499ea264291e3834ddd5e0a9545a36cb41c232f348e46ef4cb93d5","fast_time":0.020992795,"language":"cpp","measured_fast_code_id":"9141cc761d499ea264291e3834ddd5e0a9545a36cb41c232f348e46ef4cb93d5","measured_slow_code_id":"cb3c45272f44a417a13ce8f8050a750e06801633593ffb83962ed14bc70e9a26","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30645","problem_id":"p02971","slow_code_id":"73bc47aeac3f4d964d97cf5576ee8280a85259f5a03910187a50be3bc9996fbe","slow_id":"cb3c45272f44a417a13ce8f8050a750e06801633593ffb83962ed14bc70e9a26","slow_time":0.2796538857,"speedup":13.321422216527145,"stratum":"8+","sampling_key":"65b9b6dfcb7efc3e589f5d00408d0e892a1543b10881e4f28e11b4c030bef4ef","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int A[200001];\n\n  int mae[200002] = {};\n\n  int ato[200002] = {};\n\n  rep1(i, N) {\n\n    cin >> A[i];\n\n    mae[i] = max(mae[i - 1], A[i]);\n  }\n\n  for (int i = N; i >= 1; i--) {\n\n    ato[i] = max(ato[i + 1], A[i]);\n  }\n\n  rep1(i, N) { co(max(mae[i - 1], ato[i + 1])); }\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  char C = getcha();\n\n  int A = C - '0';\n\n  while ((C = getcha()) >= '0')\n    A = A * 10 + C - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn;\n\ninline void putint(int X) {\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nint n;\n\nchar c[6];\n\ninline void putsaidai() {\n\n  for (int i = n - 1; i >= 0; i--)\n    *di++ = c[i];\n\n  *di++ = '\\n';\n}\n\nint main() {\n\n  int N = getint();\n\n  int A[200000];\n\n  int saidai = 0;\n\n  int niban = 0;\n\n  rep(i, N) {\n\n    A[i] = getint();\n\n    if (niban < A[i]) {\n\n      niban = A[i];\n\n      if (niban > saidai)\n        swap(niban, saidai);\n    }\n  }\n\n  int kari = saidai;\n\n  while (kari) {\n\n    *(c + n) = '0' + kari % 10;\n\n    kari /= 10;\n\n    n++;\n  }\n\n  rep(i, N) {\n\n    if (A[i] == saidai)\n      putint(niban);\n\n    else\n      putsaidai();\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"0cd78f6469fd9a706480fe3becfbc57eb174683e182673135d6b68aa850e1f6a","fast_id":"f392a13a459c0125c117f8d4cd89d522e0c9b47c634a6c6cc6015a922b2bba2e","fast_time":0.1088476166,"language":"cpp","measured_fast_code_id":"f392a13a459c0125c117f8d4cd89d522e0c9b47c634a6c6cc6015a922b2bba2e","measured_slow_code_id":"21a008ed7d173c210d413fb5180c138c03a788b36dca4288eb7e9a3676dc7bc6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30699","problem_id":"p03408","slow_code_id":"7c23156e82f5851ca4d9c74e0bf0ae5eeb4c775430bc111c0063ac43c10d30c8","slow_id":"21a008ed7d173c210d413fb5180c138c03a788b36dca4288eb7e9a3676dc7bc6","slow_time":0.2533159795,"speedup":2.3272533419900348,"stratum":"2-4","sampling_key":"14ced82696774b8bc86d61788376515c3fe77103dac9418e267296d1d4268557","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long int\n\n#define sz 20010\n\nusing namespace std;\n\nstring ss[sz];\n\nstring sx[sz];\n\nmap<string, ll> mp;\n\nmap<string, ll> mp2;\n\nset<string> st;\n\nset<string>::iterator it;\n\nint main()\n\n{\n\n  ll n, m, i, j, a, b, p;\n\n  cin >> n;\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    cin >> ss[i];\n\n    mp2[ss[i]]++;\n\n    st.insert(ss[i]);\n  }\n\n  cin >> m;\n\n  for (i = 1; i <= m; i++)\n\n  {\n\n    cin >> sx[i];\n\n    mp[sx[i]]++;\n\n    st.insert(sx[i]);\n  }\n\n  ll c = 0;\n\n  for (it = st.begin(); it != st.end(); it++)\n\n  {\n\n    string s = *it;\n\n    a = mp[s];\n\n    b = mp2[s];\n\n    ll x = (b - a);\n\n    c = max(c, x);\n  }\n\n  cout << c << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define ll long long int\n\nusing namespace std;\n\nint main()\n\n{\n\n  ll n, m, i, j;\n\n  cin >> n;\n\n  string a;\n\n  map<string, ll> ma;\n\n  map<string, ll>::iterator it;\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    cin >> a;\n\n    ma[a]++;\n  }\n\n  cin >> m;\n\n  for (i = 0; i < m; i++)\n\n  {\n\n    cin >> a;\n\n    ma[a]--;\n  }\n\n  ll x = -999999999999;\n\n  for (it = ma.begin(); it != ma.end(); it++)\n\n  {\n\n    x = max(x, it->second);\n  }\n\n  if (x < 0)\n\n  {\n\n    cout << 0 << endl;\n\n  }\n\n  else {\n\n    cout << x << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"8488e9c86209c7d91259a1757d7f23ae0435604e01a5b53118552bba3c62b0d6","fast_id":"2e8be4eeea8a3fbf4dced460e603c04b417d18336c40718f1514f4ed67048452","fast_time":0.0210506127,"language":"cpp","measured_fast_code_id":"2e8be4eeea8a3fbf4dced460e603c04b417d18336c40718f1514f4ed67048452","measured_slow_code_id":"6cefc6c8361b0fd2314ac1d47fc4d4743919aafcd4ba1d91a54e1595911fa82c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30703","problem_id":"p03851","slow_code_id":"56e9223bdfa8b04848977fce7cb6a05b054f760ccf93e3521240fbb25b9dc2e6","slow_id":"6cefc6c8361b0fd2314ac1d47fc4d4743919aafcd4ba1d91a54e1595911fa82c","slow_time":0.274363939,"speedup":13.033536976337036,"stratum":"8+","sampling_key":"bdafa7ec914d51b705c1cdb35414c3f6474cb51c7d698ac4d7b8c852de3fd740","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define MAXN 300000\n\n#define INF 1000000000000000000LL\n\nusing namespace std;\n\ntypedef long long LL;\n\nint N;\n\nLL T[MAXN + 5], sum[MAXN + 5];\n\nLL L[MAXN + 5], R[MAXN + 5];\n\nint que[MAXN + 5];\n\nLL f[MAXN + 5], h[MAXN + 5], g[MAXN + 5], ans[MAXN + 5];\n\nLL GetY(int j)\n\n{\n\n  return 1LL * f[j] + (1LL * j * j - 1LL * j) / 2LL + sum[j];\n}\n\nvoid Rev(LL seq[])\n\n{\n\n  for (int i = 1; i <= N / 2; i++)\n\n    swap(seq[i], seq[N - i + 1]);\n}\n\nvoid DP()\n\n{\n\n  int s = 0, t = 0;\n\n  que[t++] = 0;\n\n  fill(f + 1, f + 1 + N, -INF);\n\n  for (int i = 1; i <= N; i++)\n\n  {\n\n    while (s < t - 1)\n\n    {\n\n      int j1 = que[t - 2], j2 = que[t - 1];\n\n      LL y1 = GetY(j1), y2 = GetY(j2);\n\n      if ((y1 - y2) > 1LL * i * (1LL * j1 - 1LL * j2))\n\n        t--;\n\n      else\n\n        break;\n    }\n\n    int j = que[t - 1];\n\n    f[i] = f[j] + ((1LL * i - 1LL * j) * (1LL * i - 1LL * j + 1LL)) / 2LL -\n           (1LL * sum[i] - 1LL * sum[j]);\n\n    f[i] = max(f[i], f[i - 1]);\n\n    while (s < t - 1)\n\n    {\n\n      int j1 = que[t - 2], j2 = que[t - 1];\n\n      LL y1 = GetY(que[t - 2]), y2 = GetY(que[t - 1]), y3 = GetY(i);\n\n      if ((1LL * y1 - 1LL * y2) * (1LL * j2 - 1LL * i) <\n          (1LL * y2 - 1LL * y3) * (1LL * j1 - 1LL * j2))\n\n        que[--t] = 0;\n\n      else\n\n        break;\n    }\n\n    que[t++] = i;\n  }\n}\n\nvoid MergeSort(int l, int r)\n\n{\n\n  if (l == r)\n\n  {\n\n    if (l != 0)\n\n      g[l] = max(g[l], L[l - 1] + R[l + 1] + 1LL - (sum[l] - sum[l - 1]));\n\n    else\n\n      g[l] = 0;\n\n    return;\n  }\n\n  int mid = (l + r) / 2;\n\n  MergeSort(l, mid);\n\n  int s = 0, t = 0;\n\n  for (int i = l; i <= mid; i++)\n\n  {\n\n    f[i] = L[i];\n\n    while (s < t - 1)\n\n    {\n\n      int j1 = que[t - 2], j2 = que[t - 1];\n\n      LL y1 = GetY(que[t - 2]), y2 = GetY(que[t - 1]), y3 = GetY(i);\n\n      if ((1LL * y1 - 1LL * y2) * (1LL * j2 - 1LL * i) <\n          (1LL * y2 - 1LL * y3) * (1LL * j1 - 1LL * j2))\n\n        que[--t] = 0;\n\n      else\n\n        break;\n    }\n\n    que[t++] = i;\n  }\n\n  for (int i = mid + 1; i <= r; i++)\n\n  {\n\n    while (s < t - 1)\n\n    {\n\n      int j1 = que[t - 2], j2 = que[t - 1];\n\n      LL y1 = GetY(j1), y2 = GetY(j2);\n\n      if ((y1 - y2) > 1LL * i * (1LL * j1 - 1LL * j2))\n\n        t--;\n\n      else\n\n        break;\n    }\n\n    int j = que[t - 1];\n\n    h[i] = f[j] + ((1LL * i - 1LL * j) * (1LL * i - 1LL * j + 1LL)) / 2LL -\n           (1LL * sum[i] - 1LL * sum[j]) + R[i + 1];\n  }\n\n  for (int i = r - 1; i >= mid + 1; i--)\n\n    h[i] = max(h[i], h[i + 1]);\n\n  for (int i = mid + 1; i <= r; i++)\n\n    g[i] = max(g[i], h[i]);\n\n  MergeSort(mid + 1, r);\n}\n\nint main()\n\n{\n\n  fill(ans + 1, ans + 1 + MAXN, -INF);\n\n  scanf(\"%d\", &N);\n\n  for (int i = 1; i <= N; i++)\n\n    scanf(\"%lld\", &T[i]);\n\n  for (int i = 1; i <= N; i++)\n\n    sum[i] = sum[i - 1] + T[i];\n\n  DP();\n\n  for (int i = 1; i <= N; i++)\n\n    L[i] = f[i];\n\n  Rev(T);\n\n  for (int i = 1; i <= N; i++)\n\n    sum[i] = sum[i - 1] + T[i];\n\n  DP();\n\n  for (int i = 1; i <= N; i++)\n\n    R[i] = f[N - i + 1];\n\n  Rev(T);\n\n  for (int i = 1; i <= N; i++)\n\n    sum[i] = sum[i - 1] + T[i];\n\n  fill(f + 1, f + 1 + N, -INF);\n\n  fill(h + 1, h + 1 + N, -INF);\n\n  fill(g + 1, g + 1 + N, -INF);\n\n  MergeSort(0, N);\n\n  for (int i = 1; i <= N; i++)\n\n    ans[i] = max(ans[i], g[i]);\n\n  Rev(T);\n\n  for (int i = 1; i <= N; i++)\n\n    sum[i] = sum[i - 1] + T[i];\n\n  for (int i = 1; i <= N; i++)\n\n    swap(L[i], R[N - i + 1]);\n\n  fill(f + 1, f + 1 + N, -INF);\n\n  fill(h + 1, h + 1 + N, -INF);\n\n  fill(g + 1, g + 1 + N, -INF);\n\n  MergeSort(0, N);\n\n  for (int i = 1; i <= N; i++)\n\n    ans[i] = max(ans[i], g[N - i + 1]);\n\n  Rev(T);\n\n  for (int i = 1; i <= N; i++)\n\n    sum[i] = sum[i - 1] + T[i];\n\n  for (int i = 1; i <= N; i++)\n\n    swap(L[i], R[N - i + 1]);\n\n  int M, P;\n\n  LL X;\n\n  scanf(\"%d\", &M);\n\n  for (int i = 1; i <= M; i++)\n\n  {\n\n    scanf(\"%d %lld\", &P, &X);\n\n    LL ansn = max(L[P - 1] + R[P + 1], ans[P] - X + T[P]);\n\n    printf(\"%lld\\n\", ansn);\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define MAXN 300010\n\n#define LL long long\n\n#define INF 1e16\n\nint n, m, a[MAXN], st[MAXN], r;\n\nLL f[MAXN], g[MAXN], h[MAXN], ans[MAXN], sum[MAXN], tmp[MAXN], t[MAXN];\n\ndouble K(int x, int y)\n\n{\n\n  return (t[x] - t[y] + 1LL * x * (x - 1) / 2 - 1LL * y * (y - 1) / 2 + sum[x] - sum[y]) * 1.0 /\n         (x - y);\n}\n\nvoid DP()\n\n{\n\n  for (int i = 1; i <= n; i++)\n    sum[i] = sum[i - 1] + a[i];\n\n  st[r = 1] = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    while (r > 1 && K(st[r], st[r - 1]) <= i)\n      r--;\n\n    int j = st[r];\n\n    t[i] = max(t[i - 1], t[j] + 1LL * (i - j) * (i - j + 1) / 2 + sum[j] - sum[i]);\n\n    while (r > 1 && K(st[r], st[r - 1]) < K(i, st[r]))\n      r--;\n\n    st[++r] = i;\n  }\n}\n\nvoid Solve(int L, int R)\n\n{\n\n  if (L == R)\n\n  {\n\n    h[L] = max(h[L], g[R + 1] + f[L - 1] + 1 - a[L]);\n\n    return;\n  }\n\n  int mid = (L + R) / 2;\n\n  st[r = 1] = L - 1;\n\n  for (int i = L; i < mid; i++)\n\n  {\n\n    while (r > 1 && K(st[r], st[r - 1]) < K(i, st[r]))\n      r--;\n\n    st[++r] = i;\n  }\n\n  for (int i = mid; i <= R; i++)\n\n  {\n\n    while (r > 1 && K(st[r], st[r - 1]) <= i)\n      r--;\n\n    int j = st[r];\n\n    tmp[i] = t[j] + 1LL * (i - j) * (i - j + 1) / 2 + sum[j] - sum[i] + g[i + 1];\n  }\n\n  for (int i = R - 1; i >= mid; i--)\n    tmp[i] = max(tmp[i], tmp[i + 1]);\n\n  for (int i = mid; i <= R; i++)\n    h[i] = max(h[i], tmp[i]);\n\n  Solve(L, mid);\n\n  Solve(mid + 1, R);\n}\n\nvoid Pre()\n\n{\n\n  DP();\n\n  for (int i = 1; i <= n; i++)\n\n    f[i] = t[i];\n\n  for (int i = 1; i <= n / 2; i++)\n\n    swap(a[i], a[n - i + 1]);\n\n  DP();\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    g[i] = t[n - i + 1];\n\n    ans[i] = -INF;\n  }\n\n  for (int i = 1; i <= n / 2; i++)\n\n    swap(a[i], a[n - i + 1]);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    t[i] = f[i];\n\n    sum[i] = sum[i - 1] + a[i];\n\n    h[i] = -INF;\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  Pre();\n\n  Solve(1, n);\n\n  for (int i = 1; i <= n; i++)\n\n    ans[i] = max(ans[i], h[i]);\n\n  for (int i = 1; i <= n; i++)\n    swap(g[i], f[i]);\n\n  for (int i = 1; i <= n / 2; i++)\n\n  {\n\n    swap(a[i], a[n - i + 1]);\n\n    swap(f[i], f[n - i + 1]);\n\n    swap(g[i], g[n - i + 1]);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    t[i] = f[i];\n\n    sum[i] = sum[i - 1] + a[i];\n\n    h[i] = -INF;\n  }\n\n  Solve(1, n);\n\n  for (int i = 1; i <= n; i++)\n\n    ans[i] = max(ans[i], h[n - i + 1]);\n\n  for (int i = 1; i <= n / 2; i++)\n\n  {\n\n    swap(f[i], f[n - i + 1]);\n\n    swap(g[i], g[n - i + 1]);\n\n    swap(a[i], a[n - i + 1]);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    swap(f[i], g[i]);\n\n  scanf(\"%d\", &m);\n\n  while (m--)\n\n  {\n\n    int x, y;\n\n    scanf(\"%d%d\", &x, &y);\n\n    printf(\"%lld\\n\", max(f[x - 1] + g[x + 1], ans[x] + a[x] - y));\n  }\n}"}
{"fast_code_id":"9644dc7f5f24e3544fb6209fbde6f3a86c152c798b17710529c9c53c8e2be8b6","fast_id":"16a35be4e1d6e0c8c75a4140bd473ccee30c6ce1fcfd91ab4c45459de7c508e2","fast_time":0.0200519405,"language":"cpp","measured_fast_code_id":"16a35be4e1d6e0c8c75a4140bd473ccee30c6ce1fcfd91ab4c45459de7c508e2","measured_slow_code_id":"bee095bd26f3ebf2d580ca87bcd396ddd4dba68c93a81528ae6dec241d7469c9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30737","problem_id":"p03759","slow_code_id":"43ca370773b4c51a3712603a5206d55f606b150d7a074c0cb9d6f68409d09dcc","slow_id":"bee095bd26f3ebf2d580ca87bcd396ddd4dba68c93a81528ae6dec241d7469c9","slow_time":0.1056964597,"speedup":5.271133718953534,"stratum":"4-8","sampling_key":"76fb0907fbfe1ad51520782ebb2c27b55c42608dbeea6ce62b38f9f49a69f0d6","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int a, b, c;\n\n  cin >> a >> b >> c;\n\n  if (b - a == c - b)\n\n    cout << \"YES\" << endl;\n\n  else\n\n    cout << \"NO\" << endl;\n}\n","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\nint main(void) {\n\n  int a, b, c;\n\n  scanf(\"%d%d%d\", &a, &b, &c);\n\n  if ((b - a) == (c - b)) {\n\n    printf(\"YES\\n\");\n\n  } else {\n\n    printf(\"NO\\n\");\n  }\n\n  system(\"pause\");\n}"}
{"fast_code_id":"6c5b1ff3ea576ffa58dd057f6e073723a8e9868f5a0215030b9bf929c5b3fd00","fast_id":"3bb696afb12e93d7aec9879e45191fc6c0896c4637d6e93169f35b0e9112cdb7","fast_time":0.0183771159,"language":"cpp","measured_fast_code_id":"3bb696afb12e93d7aec9879e45191fc6c0896c4637d6e93169f35b0e9112cdb7","measured_slow_code_id":"656f16906234043c10f638f2fa6ab3bea4fe386e7c553fc7dc976d7065ab5f4d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30747","problem_id":"p03662","slow_code_id":"9ee6c97b859746531a88ca9837b7b878d8f7436ea4b13a1fb626d6ba3bb377ce","slow_id":"656f16906234043c10f638f2fa6ab3bea4fe386e7c553fc7dc976d7065ab5f4d","slow_time":0.3731706398,"speedup":20.306267960142755,"stratum":"8+","sampling_key":"0a511f1d7e69bc51ef1fa89dcf7efb68621f56615ce8973831ae0fd4fcaeb66e","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <iomanip>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <set>\n\n#include <map>\n\n#include <utility>\n\n#include <queue>\n\n#include <vector>\n\n#include <stack>\n\n#include <sstream>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<ll, ll> pii;\n\ntypedef vector<pii> vii;\n\ntypedef vector<ll> vi;\n\ntypedef queue<ll> qi;\n\ntypedef queue<char> qc;\n\ntypedef queue<string> qs;\n\ntypedef vector<char> vc;\n\ntypedef vector<string> vs;\n\ntypedef map<char, ll> mpci;\n\ntypedef map<ll, ll> mpii;\n\ntypedef map<string, ll> mpsi;\n\ntypedef set<ll> sei;\n\ntypedef set<char> sec;\n\ntypedef set<string> ses;\n\ntypedef stack<ll> si;\n\ntypedef stack<char> sc;\n\ntypedef vector<ll> vll;\n\ntypedef vector<vi> vvi;\n\ntypedef vector<double> vd;\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<double, double> pdd;\n\ntypedef vector<pll> vpll;\n\ntypedef vector<pdd> vdd;\n\ntypedef unsigned int uint;\n\ntypedef long double ld;\n\ntypedef vector<bool> vb;\n\ntypedef vector<double> vd;\n\ntypedef vector<vi> vvi;\n\ntypedef vector<vvi> vvvi;\n\ntypedef vector<vii> vvii;\n\n#define mp make_pair\n\n#define pb push_back\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define sz(a) (int)(a.size())\n\n#define len(a) (int)(a.length())\n\n#define all(s) (s).begin(), (s).end()\n\n#define fi first\n\n#define se second\n\n#define be begin\n\n#define en end\n\n#define repd(i, n) for (int i = n - 1; i >= 0; i--)\n\n#define forn(i, p, n) for (int i = p; i < n; i++)\n\n#define ford(i, p, n) for (int i = n - 1; i >= p; i--)\n\n#define foreach(i, c) for (__typeof(c.begin()) i = (c.begin()); i != (c).end(); ++i)\n\n#define zero(a) memset(a, 0, sizeof(a))\n\n#define number(a, num) memeset(a, num, sizeof(a))\n\ninline void read(int &x)\n\n{\n\n  short negative = 1;\n\n  x = 0;\n\n  char c = getchar();\n\n  while (c < '0' || c > '9')\n\n  {\n\n    if (c == '-')\n\n      negative = -1;\n\n    c = getchar();\n  }\n\n  while (c >= '0' && c <= '9')\n\n    x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n\n  x *= negative;\n}\n\ninline void write(long long x) {\n\n  static long long sta[35];\n\n  long long top = 0;\n\n  do {\n\n    sta[top++] = x % 10, x /= 10;\n\n  } while (x);\n\n  while (top)\n    putchar(sta[--top] + 48);\n\n  puts(\"\");\n}\n\nbool prime(int n)\n\n{\n\n  if (n == 0 || n == 1)\n\n    return false;\n\n  for (int i = 2; i * i <= n; i++)\n\n    if (n % i == 0)\n\n      return false;\n\n  return true;\n}\n\nconst int dx[] = {-1, 0, 1, 0};\n\nconst int dy[] = {0, -1, 0, 1};\n\nvector<int> v[111111];\n\nint dist[2][111111];\n\nint n;\n\nvoid dfs(int m, int p, int c)\n\n{\n\n  dist[c][m] = dist[c][p] + 1;\n\n  rep(i, v[m].size())\n\n  {\n\n    if (v[m][i] != p)\n\n    {\n\n      dfs(v[m][i], m, c);\n    }\n  }\n}\n\nint main()\n\n{\n\n  read(n);\n\n  rep(i, n - 1)\n\n  {\n\n    int a, b;\n\n    read(a);\n\n    read(b);\n\n    v[a].pb(b);\n\n    v[b].pb(a);\n  }\n\n  dist[0][0] = -1;\n\n  dist[1][0] = -1;\n\n  dfs(1, 0, 0);\n\n  dfs(n, 0, 1);\n\n  int cnt1 = 0, cnt2 = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (dist[0][i] <= dist[1][i])\n\n      cnt1++;\n\n    else\n\n      cnt2++;\n  }\n\n  if (cnt1 > cnt2)\n\n    cout << \"Fennec\";\n\n  else\n\n    cout << \"Snuke\";\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#define N 100005\n\nint n;\n\nstruct edge {\n\n  int to, next;\n\n} e[N << 1];\n\nint head[N], cnt;\n\nvoid add(int u, int v) {\n\n  e[++cnt] = (edge){v, head[u]};\n\n  head[u] = cnt;\n}\n\nint son[N];\n\nint path[N], len;\n\nbool dfs(int x, int fa) {\n\n  bool p = x == n;\n\n  for (int i = head[x]; i; i = e[i].next) {\n\n    int v = e[i].to;\n\n    if (v == fa)\n      continue;\n\n    p |= dfs(v, x);\n  }\n\n  son[fa] += son[x] + 1;\n\n  if (p) {\n\n    path[++len] = x;\n\n    return true;\n  }\n\n  return false;\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1, u, v; i < n; ++i) {\n\n    scanf(\"%d%d\", &u, &v);\n\n    add(u, v);\n    add(v, u);\n  }\n\n  dfs(1, 0);\n\n  int ans = 0;\n\n  for (int i = len; i > len / 2; --i)\n\n    ans += son[path[i]] - son[path[i - 1]];\n\n  printf(\"%s\\n\", ans * 2 > n ? \"Fennec\" : \"Snuke\");\n\n  return 0;\n}\n"}
{"fast_code_id":"bbbd61e064f71b3bb0d2bc587b08d6afb238a00714f9d352d3edd74855e88c36","fast_id":"e5bc4135dc079dc3d3aedf773f0cc16895616de56d19857845e457de4b598d22","fast_time":0.1053311605,"language":"cpp","measured_fast_code_id":"e5bc4135dc079dc3d3aedf773f0cc16895616de56d19857845e457de4b598d22","measured_slow_code_id":"3da3ec7896b4aa0af687345df555012e1e236f58895ad402c60fee810f0e3cf7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30907","problem_id":"p02873","slow_code_id":"7111d470666d00343b033eb6789455c8f27b29b97cb5512d4e696268bbf8240f","slow_id":"3da3ec7896b4aa0af687345df555012e1e236f58895ad402c60fee810f0e3cf7","slow_time":0.3193203459,"speedup":3.0315848072328038,"stratum":"2-4","sampling_key":"0f77d59ee6e70bc03e04e6aea6b62cb22e3c614eae9ca997a632806d556cf64d","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <cstring>\n\nusing namespace std;\n\nint main() {\n\n  string a;\n\n  int seq[500005], n, x = -1;\n\n  long long final = 0;\n\n  cin >> a;\n\n  n = a.size();\n\n  seq[0] = 0;\n\n  memset(seq, 0, sizeof(seq));\n\n  for (int i = 0; i < n; i++) {\n\n    if (a[i] == '<') {\n\n      seq[i + 1] = seq[i] + 1;\n    }\n  }\n\n  for (int i = n - 1; i >= 0; i--) {\n\n    if (a[i] == '>') {\n\n      if (seq[i] <= seq[i + 1]) {\n\n        seq[i] = seq[i + 1] + 1;\n      }\n    }\n  }\n\n  for (int i = 0; i <= n; i++) {\n\n    final += seq[i];\n  }\n\n  cout << final << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n;\n\n  string s;\n\n  cin >> s;\n\n  n = s.size();\n\n  int pos = 0;\n\n  long long int ans = 0;\n\n  while (pos < n)\n\n  {\n\n    int coun1 = 0;\n\n    while (s[pos] == '<' && pos < n) {\n\n      ++pos;\n\n      coun1++;\n    }\n\n    int coun2 = 0;\n\n    while (s[pos] == '>' && pos < n)\n\n    {\n\n      coun2++;\n\n      ++pos;\n    }\n\n    int x = min(coun1, coun2);\n\n    int y = max(coun1, coun2);\n\n    ans += x * (long)(x - 1) / 2;\n\n    ans += y * (long)(y + 1) / 2;\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"1991bad4e94bfd6797b291c7be16f9d1841fff73cbcb2b6a6631f4ec1fbf1fec","fast_id":"66085265de3a601083d5cd9cc7501eea4d0f400474436aa43efd80f70b79b445","fast_time":0.0977400178,"language":"cpp","measured_fast_code_id":"66085265de3a601083d5cd9cc7501eea4d0f400474436aa43efd80f70b79b445","measured_slow_code_id":"357430c4ed740d8e841f200ea59aa87ab708a12fa5d08ba2b02516e079dcc2f2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30916","problem_id":"p02651","slow_code_id":"bedb3a7d0d322091cdb8f06096ccd1b1916451cf1f2746448ae3c11b4c706d45","slow_id":"357430c4ed740d8e841f200ea59aa87ab708a12fa5d08ba2b02516e079dcc2f2","slow_time":0.9790077918,"speedup":10.016447856632169,"stratum":"8+","sampling_key":"dc88b72b0e9812ec6684167fb0f33abf269c4dbf6f20ec26722ea1c0206f9a9e","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <queue>\n\n#include <ciso646>\n\n#include <random>\n\n#include <map>\n\n#include <set>\n\n#include <bitset>\n\n#include <stack>\n\n#include <unordered_map>\n\n#include <utility>\n\n#include <cassert>\n\n#include <complex>\n\n#include <numeric>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ul;\n\ntypedef unsigned int ui;\n\nconstexpr ll mod = 1000000007;\n\nconst ll INF = mod * mod;\n\ntypedef pair<int, int> P;\n\n#define stop                                                                                       \\\n  char nyaa;                                                                                       \\\n  cin >> nyaa;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define per(i, n) for (int i = n - 1; i >= 0; i--)\n\n#define Rep(i, sta, n) for (int i = sta; i < n; i++)\n\n#define rep1(i, n) for (int i = 1; i <= n; i++)\n\n#define per1(i, n) for (int i = n; i >= 1; i--)\n\n#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)\n\n#define all(v) (v).begin(), (v).end()\n\ntypedef pair<ll, ll> LP;\n\ntypedef long double ld;\n\ntypedef pair<ld, ld> LDP;\n\nconst ld eps = 1e-12;\n\nconst ld pi = acos(-1.0);\n\nstruct modint {\n\n  ll n;\n\n  modint() : n(0) { ; }\n\n  modint(ll m) : n(m) {\n\n    if (n >= mod)\n      n %= mod;\n\n    else if (n < 0)\n      n = (n % mod + mod) % mod;\n  }\n\n  operator int() { return n; }\n};\n\nbool operator==(modint a, modint b) { return a.n == b.n; }\n\nmodint operator+=(modint &a, modint b) {\n  a.n += b.n;\n  if (a.n >= mod)\n    a.n -= mod;\n  return a;\n}\n\nmodint operator-=(modint &a, modint b) {\n  a.n -= b.n;\n  if (a.n < 0)\n    a.n += mod;\n  return a;\n}\n\nmodint operator*=(modint &a, modint b) {\n  a.n = ((ll)a.n * b.n) % mod;\n  return a;\n}\n\nmodint operator+(modint a, modint b) { return a += b; }\n\nmodint operator-(modint a, modint b) { return a -= b; }\n\nmodint operator*(modint a, modint b) { return a *= b; }\n\nmodint operator^(modint a, int n) {\n\n  if (n == 0)\n    return modint(1);\n\n  modint res = (a * a) ^ (n / 2);\n\n  if (n % 2)\n    res = res * a;\n\n  return res;\n}\n\nll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }\n\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\nconst int max_n = 1 << 19;\n\nmodint fact[max_n], factinv[max_n];\n\nvoid init_f() {\n\n  fact[0] = modint(1);\n\n  for (int i = 0; i < max_n - 1; i++) {\n\n    fact[i + 1] = fact[i] * modint(i + 1);\n  }\n\n  factinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\n  for (int i = max_n - 2; i >= 0; i--) {\n\n    factinv[i] = factinv[i + 1] * modint(i + 1);\n  }\n}\n\nmodint comb(int a, int b) {\n\n  if (a < 0 || b < 0 || a < b)\n    return 0;\n\n  return fact[a] * factinv[b] * factinv[a - b];\n}\n\ntypedef vector<int> vec;\n\ntypedef vector<vec> mat;\n\nint Gaussian_elimination(mat &A) {\n\n  if (A.empty())\n    return 0;\n\n  int n = A.size();\n  int m = A[0].size();\n\n  int le = 0;\n\n  rep(j, m) {\n\n    Rep(i, le, n) {\n\n      if (A[i][j]) {\n\n        swap(A[le], A[i]);\n\n        Rep(i2, le + 1, n) {\n\n          if (A[i2][j]) {\n\n            rep(k, m) { A[i2][k] ^= A[le][k]; }\n          }\n        }\n\n        le++;\n        break;\n      }\n    }\n  }\n\n  return le;\n}\n\nbool can(mat &A, vec v) {\n\n  int n = A.size();\n\n  rep(j, 60) {\n\n    if (v[j] == 0)\n      continue;\n\n    per(i, n) {\n\n      if (A[i][j]) {\n\n        rep(k, 60) { v[k] ^= A[i][k]; }\n\n        break;\n      }\n    }\n  }\n\n  rep(j, 60) if (v[j]) return false;\n\n  return true;\n}\n\nvoid solve() {\n\n  int n;\n  cin >> n;\n\n  vector<ll> a(n);\n\n  rep(i, n) cin >> a[i];\n\n  string s;\n  cin >> s;\n\n  mat A;\n\n  per(i, n) {\n\n    vec c(60, 0);\n\n    rep(j, 60) {\n\n      if (a[i] & (1ll << j))\n        c[j] = 1;\n    }\n\n    if (s[i] == '0') {\n\n      A.push_back(c);\n\n    }\n\n    else {\n\n      Gaussian_elimination(A);\n\n      if (!can(A, c)) {\n\n        cout << 1 << \"\\n\";\n        return;\n      }\n    }\n  }\n\n  cout << 0 << \"\\n\";\n}\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int t;\n  cin >> t;\n  rep(i, t)\n\n      solve();\n\n  stop\n\n      return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 210;\n\nint _w;\n\nint n;\n\nll a[N];\n\nchar s[N];\n\nnamespace Basis {\n\nll b[62];\n\nvoid init() { memset(b, 0, sizeof b); }\n\nvoid insert(ll x) {\n\n  for (ll i = 61; i >= 0; --i)\n\n    if (x & (1LL << i)) {\n\n      if (b[i])\n        x ^= b[i];\n\n      else {\n\n        b[i] = x;\n\n        break;\n      }\n    }\n}\n\nbool check(ll x) {\n\n  for (ll i = 61; i >= 0; --i)\n\n    if (x & (1LL << i)) {\n\n      if (b[i])\n        x ^= b[i];\n\n      else\n        return false;\n    }\n\n  return x == 0;\n}\n\n}                   \n\nint main() {\n\n  int T;\n\n  _w = scanf(\"%d\", &T);\n\n  while (T--) {\n\n    _w = scanf(\"%d\", &n);\n\n    for (int i = 1; i <= n; ++i)\n\n      _w = scanf(\"%lld\", a + i);\n\n    _w = scanf(\"%s\", s + 1);\n\n    Basis::init();\n\n    bool flag = true;\n\n    for (int i = n; i >= 1; --i)\n\n      if (s[i] == '0') {\n\n        Basis::insert(a[i]);\n\n      } else {\n\n        if (Basis::check(a[i]) == false) {\n\n          flag = false;\n\n          break;\n        }\n      }\n\n    puts(flag ? \"0\" : \"1\");\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"ec482643859e32e0ccc702a77e758ebad551d1272e0edebb6087d2dbab70d0c7","fast_id":"cc1df10b666fd0bcba820b767c84eb30e2247a8386c0c106413150c762063af2","fast_time":0.040320705,"language":"cpp","measured_fast_code_id":"cc1df10b666fd0bcba820b767c84eb30e2247a8386c0c106413150c762063af2","measured_slow_code_id":"b94c073d7420c4d9c74eae06e33e9b22fee8e86adb3f053988d7d5be28521dd1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30918","problem_id":"p02579","slow_code_id":"7c030931ac78b24b18d02fd91f6fdeda0601aa9fff8d34ca2357d6a10346cd4a","slow_id":"b94c073d7420c4d9c74eae06e33e9b22fee8e86adb3f053988d7d5be28521dd1","slow_time":0.3766686701,"speedup":9.341817562465735,"stratum":"8+","sampling_key":"b12182e02fddf8869a70637bdadcd89bbb14bc078e49158a7bf0ef095ca5228c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, p, n) for (ll i = p; i < ll(n); ++i)\n\n#define rep(i, n) REP(i, 0, n)\n\nusing ll = long long;\n\nusing pll = pair<ll, ll>;\n\nconst ll MAXN = 1002;\n\nll C[MAXN][MAXN];\n\nint main()\n\n{\n\n  ll H, W;\n\n  cin >> H >> W;\n\n  ll CH, CW, DH, DW;\n\n  cin >> CH >> CW >> DH >> DW;\n\n  --CH;\n\n  --CW;\n\n  --DH;\n\n  --DW;\n\n  vector<string> S(H);\n\n  rep(i, H) { cin >> S[i]; }\n\n  rep(x, MAXN)\n\n      rep(y, MAXN)\n\n  {\n    C[x][y] = MAXN * MAXN;\n  }\n\n  using Node = tuple<ll, ll, ll>;\n\n  priority_queue<Node, vector<Node>, greater<Node> > Q;\n\n  C[CH][CW] = 0;\n\n  Q.emplace(0, CW, CH);\n\n  ll ans = -1;\n\n  while (!Q.empty())\n\n  {\n\n    const auto node = Q.top();\n\n    Q.pop();\n\n    const auto cost = get<0>(node);\n\n    const auto cx = get<1>(node);\n\n    const auto cy = get<2>(node);\n\n    if (cx == DW && cy == DH) {\n      ans = cost;\n      break;\n    }\n\n    const auto insert = [&](ll xx, ll yy, ll newCost)\n\n    {\n      if (xx < 0 || W <= xx) {\n        return;\n      }\n\n      if (yy < 0 || H <= yy) {\n        return;\n      }\n\n      if (S[yy][xx] == '#') {\n        return;\n      }\n\n      if (C[yy][xx] <= newCost) {\n        return;\n      }\n\n      C[yy][xx] = newCost;\n\n      Q.emplace(newCost, xx, yy);\n    };\n\n    insert(cx - 1, cy, cost);\n\n    insert(cx + 1, cy, cost);\n\n    insert(cx, cy - 1, cost);\n\n    insert(cx, cy + 1, cost);\n\n    for (ll dx = -2; dx <= 2; ++dx)\n\n      for (ll dy = -2; dy <= 2; ++dy)\n\n      {\n\n        insert(cx + dx, cy + dy, cost + 1);\n      }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int H, W, CH, CW, DH, DW;\n\n  cin >> H >> W >> CH >> CW >> DH >> DW;\n\n  --CH;\n\n  --CW;\n\n  --DH;\n\n  --DW;\n\n  vector<string> S(H);\n\n  for (int i = 0; i < H; ++i) {\n    cin >> S[i];\n  }\n\n  vector<int> Cost(H * W, 1000001);\n\n  deque<pair<int, int> > Q;\n\n  const auto insert = [&](int x, int y, int cost, int extraCost)\n\n  {\n    if (x < 0 || W <= x || y < 0 || H <= y) {\n      return;\n    }\n\n    if (S[y][x] == '#') {\n      return;\n    }\n\n    const auto newCost = cost + extraCost;\n\n    if (Cost[x + y * W] <= newCost) {\n      return;\n    }\n\n    Cost[x + y * W] = newCost;\n\n    if (extraCost == 0) {\n      Q.emplace_front(x, y);\n    }\n\n    else {\n      Q.emplace_back(x, y);\n    }\n  };\n\n  insert(CW, CH, 0, 0);\n\n  int ans = -1;\n\n  while (!Q.empty())\n\n  {\n\n    const auto x = Q.front().first;\n\n    const auto y = Q.front().second;\n\n    Q.pop_front();\n\n    const auto cost = Cost[x + y * W];\n\n    if (x == DW && y == DH) {\n      ans = cost;\n      break;\n    }\n\n    insert(x - 1, y, cost, 0);\n\n    insert(x + 1, y, cost, 0);\n\n    insert(x, y - 1, cost, 0);\n\n    insert(x, y + 1, cost, 0);\n\n    for (int dx = -2; dx <= 2; ++dx)\n\n      for (int dy = -2; dy <= 2; ++dy)\n\n      {\n\n        insert(x + dx, y + dy, cost, 1);\n      }\n  }\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"ca16a1e0cd337647a456eb99efc768c06dedf67d5082625c3c0834c96e0b1fac","fast_id":"29f747f67082b9bcdfdfcc66854a7200e1f28d270ec93a13e73426543ee16165","fast_time":0.1265713146,"language":"cpp","measured_fast_code_id":"29f747f67082b9bcdfdfcc66854a7200e1f28d270ec93a13e73426543ee16165","measured_slow_code_id":"b15937ae288d964e3190ea9f7a7e61d7f67057bda2bb29fb8689981428b18da0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30960","problem_id":"p02956","slow_code_id":"d43209e164453f84cc4e518ce528d68a677d625e9a7e749478eec179c46b8329","slow_id":"b15937ae288d964e3190ea9f7a7e61d7f67057bda2bb29fb8689981428b18da0","slow_time":0.8500300534,"speedup":6.715819110248855,"stratum":"4-8","sampling_key":"2f77b256ff3c2442306507f0afb492f8878e1c82a8ce118f00eeefd6cb660dc8","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\n#include <stack>\n\n#include <list>\n\n#include <set>\n\n#include <string>\n\nusing namespace std;\n\nint gcd(int a, int b) {\n\n  int c = a % b;\n\n  while (c != 0) {\n\n    a = b;\n\n    b = c;\n\n    c = a % b;\n  }\n\n  return b;\n}\n\nstruct UnionFind {\n\n  vector<int> par;\n\n  UnionFind(int N) : par(N) {\n\n    for (int i = 0; i < N; i++)\n      par[i] = i;\n  }\n\n  int root(int x) {\n\n    if (par[x] == x)\n      return x;\n\n    return par[x] = root(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    int rx = root(x);\n\n    int ry = root(y);\n\n    if (rx == ry)\n      return;\n\n    par[rx] = ry;\n  }\n\n  bool same(int x, int y) {\n\n    int rx = root(x);\n\n    int ry = root(y);\n\n    return rx == ry;\n  }\n};\n\ntypedef long long ll;\n\nll M = 998244353;\n\nvector<ll> fac(300001);\n\nvector<ll> ifac(300001);\n\nll mpow(ll x, ll n) {\n\n  ll ans = 1;\n\n  while (n != 0) {\n\n    if (n & 1)\n      ans = ans * x % M;\n\n    x = x * x % M;\n\n    n = n >> 1;\n  }\n\n  return ans;\n}\n\nvoid setcomb() {\n\n  fac[0] = 1;\n\n  ifac[0] = 1;\n\n  for (ll i = 0; i < 1000000; i++) {\n\n    fac[i + 1] = fac[i] * (i + 1) % M;\n  }\n\n  ifac[1000000] = mpow(fac[1000000], M - 2);\n\n  for (ll i = 1000000; i > 0; i--) {\n\n    ifac[i - 1] = ifac[i] * i % M;\n  }\n}\n\nll comb(ll a, ll b) {\n\n  if (a == 0 && b == 0)\n    return 1;\n\n  if (a < b || a < 0)\n    return 0;\n\n  ll tmp = ifac[a - b] * ifac[b] % M;\n\n  return tmp * fac[a] % M;\n}\n\nll perm(ll a, ll b) {\n\n  if (a == 0 && b == 0)\n    return 1;\n\n  if (a < b || a < 0)\n    return 0;\n\n  return fac[a] * ifac[a - b] % M;\n}\n\nlong long modinv(long long a) {\n\n  long long b = M, u = 1, v = 0;\n\n  while (b) {\n\n    long long t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= M;\n\n  if (u < 0)\n    u += M;\n\n  return u;\n}\n\nvector<vector<ll>> mul(vector<vector<ll>> a, vector<vector<ll>> b, int n) {\n\n  int i, j, k, t;\n\n  vector<vector<ll>> c(n);\n\n  for (i = 0; i < n; i++) {\n\n    for (j = 0; j < n; j++) {\n\n      t = 0;\n\n      for (k = 0; k < n; k++)\n\n        t = (t + a[i][k] * b[k][j] % M) % M;\n\n      c[i].push_back(t);\n    }\n  }\n\n  return c;\n}\n\ntemplate <typename Monoid>\n\nstruct SegmentTree {\n\n  int sz;\n\n  vector<Monoid> seg;\n\n  const Monoid M1;\n\n  SegmentTree(int n, const Monoid &M1) : M1(M1) {\n\n    sz = 1;\n\n    while (sz < n)\n      sz <<= 1;\n\n    seg.assign(2 * sz, M1);\n  }\n\n  void set(int k, const Monoid &x) { seg[k + sz] = x; }\n\n  void build() {\n\n    for (int k = sz - 1; k > 0; k--) {\n\n      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n    }\n  }\n\n  void update(int k, const Monoid &x) {\n\n    k += sz;\n\n    seg[k] = x;\n\n    while (k >>= 1) {\n\n      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n    }\n  }\n\n  Monoid query(int a, int b) {\n\n    Monoid L = M1, R = M1;\n\n    for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n\n      if (a & 1)\n        L = f(L, seg[a++]);\n\n      if (b & 1)\n        R = f(seg[--b], R);\n    }\n\n    return f(L, R);\n  }\n\n  Monoid value(const int &k) const { return seg[k + sz]; }\n\n  Monoid f(Monoid a, Monoid b) { return a + b; }\n};\n\nint main() {\n\n  ll n, i, x, y, u[222222], ru[222222], ans, l, r, c, q[222222], t;\n\n  q[0] = 1;\n\n  for (i = 1; i < 222222; i++)\n\n    q[i] = q[i - 1] * 2 % M;\n\n  cin >> n;\n\n  vector<pair<ll, ll>> p;\n\n  vector<ll> v;\n\n  SegmentTree<int> seg1(n, 0);\n\n  SegmentTree<int> seg2(n, 0);\n\n  for (i = 0; i < n; i++) {\n\n    cin >> x >> y;\n\n    p.push_back(make_pair(x, y));\n\n    v.push_back(y);\n  }\n\n  sort(p.begin(), p.end());\n\n  sort(v.begin(), v.end());\n\n  for (i = 1; i <= n; i++) {\n\n    l = 0;\n\n    r = n;\n\n    while (r - l > 1) {\n\n      c = (l + r) / 2;\n\n      if (p[i - 1].second < v[c])\n\n        r = c;\n\n      else\n\n        l = c;\n    }\n\n    seg1.update(r + 1, seg1.value(r + 1) + 1);\n\n    u[i] = seg1.query(1, r + 1);\n  }\n\n  for (i = n; i > 0; i--) {\n\n    l = 0;\n\n    r = n;\n\n    while (r - l > 1) {\n\n      c = (l + r) / 2;\n\n      if (p[i - 1].second < v[c])\n\n        r = c;\n\n      else\n\n        l = c;\n    }\n\n    seg2.update(r + 1, seg2.value(r + 1) + 1);\n\n    ru[i] = seg2.query(1, r + 1);\n  }\n\n  ans = (q[n] - 1) * n % M;\n\n  for (i = 1; i <= n; i++) {\n\n    t = q[i - 1] - 1;\n\n    t += q[n - i] - 1;\n\n    t %= M;\n\n    t += (q[u[i]] - 1) * (q[ru[i]] - 1) % M;\n\n    t %= M;\n\n    if (i > 0) {\n\n      t += (q[i - u[i] - 1] - 1) * (q[n - i - ru[i]] - 1) % M;\n\n      t %= M;\n    }\n\n    ans += M - t;\n\n    ans %= M;\n  }\n\n  cout << ans << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define rep2(i, x, n) for (int i = x; i <= n; i++)\n\n#define rep3(i, x, n) for (int i = x; i >= n; i--)\n\n#define elif else if\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\nconst ll MOD = 1e9 + 7;\n\nconst ll MOD2 = 998244353;\n\nconst ll INF = 1e18;\n\nll f(ll a, ll b) { return a + b; }\n\nint other = 0;\n\nstruct segment_tree {\n\n  int n;\n\n  int seg[1000000];\n\n  segment_tree(int N) {\n\n    n = 1;\n\n    while (n < N)\n      n *= 2;\n\n    fill_n(seg, 2 * n - 1, other);\n  }\n\n  void update(int i, ll x) {\n\n    i += n - 1;\n\n    seg[i] = x;\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      seg[i] = f(seg[2 * i + 1], seg[2 * i + 2]);\n    }\n  }\n\n  ll size() { return n; }\n\n  ll query(int a, int b, int i, int l, int r) {\n\n    if (a >= r || b <= l)\n      return other;\n\n    elif (a <= l && r <= b) return seg[i];\n\n    else {\n\n      int vl = query(a, b, 2 * i + 1, l, (l + r) / 2);\n\n      int vr = query(a, b, 2 * i + 2, (l + r) / 2, r);\n\n      return f(vl, vr);\n    }\n  }\n};\n\nint main() {\n\n  int N;\n\n  cin >> N;\n\n  ll e[N];\n\n  e[0] = 1;\n\n  rep2(i, 1, N - 1) e[i] = (2 * e[i - 1]) % MOD2;\n\n  int x[N], y[N];\n\n  vector<P> vecx, vecy, vec;\n\n  rep(i, N) {\n\n    cin >> x[i] >> y[i];\n\n    vecx.push_back(P(x[i], i));\n\n    vecy.push_back(P(y[i], i));\n  }\n\n  sort(vecx.begin(), vecx.end());\n\n  sort(vecy.begin(), vecy.end());\n\n  rep(i, N) {\n\n    int px = vecx[i].second, py = vecy[i].second;\n\n    x[px] = i, y[py] = i;\n  }\n\n  rep(i, N) vec.push_back(P(x[i], y[i]));\n\n  sort(vec.begin(), vec.end());\n\n  int X[N], Y[N];\n\n  rep(i, N) X[i] = vec[i].first, Y[i] = vec[i].second;\n\n  segment_tree segl(N), segr(N);\n\n  ll n = segl.size();\n\n  ll ul[N], ur[N], dl[N], dr[N];\n\n  rep(i, N) {\n\n    dl[i] = segl.query(0, Y[i], 0, 0, n);\n\n    ul[i] = i - dl[i];\n\n    segl.update(Y[i], 1);\n  }\n\n  rep3(i, N - 1, 0) {\n\n    dr[i] = segr.query(0, Y[i], 0, 0, n);\n\n    ur[i] = N - 1 - i - dr[i];\n\n    segr.update(Y[i], 1);\n  }\n\n  ll ans = (N * e[N - 1]) % MOD2;\n\n  rep(i, N) {\n\n    ll a = (e[ul[i]] - 1) * (e[dr[i]] - 1) % MOD2;\n\n    ll b = (e[ur[i]] - 1) * (e[dl[i]] - 1) % MOD2;\n\n    ans += a * e[ur[i] + dl[i]];\n\n    ans %= MOD2;\n\n    ans += b * e[ul[i] + dr[i]];\n\n    ans %= MOD2;\n\n    ans += MOD2 * MOD2 - a * b;\n\n    ans %= MOD2;\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"2b5a385037a0005ee9f60cfa992fbfd9e28637b886c140ae6eef59f42cdb75d1","fast_id":"edf21f40d89cff2d33382d3dd12a7cf0364fc589154637fbee44069f37557bd0","fast_time":0.0208036123,"language":"cpp","measured_fast_code_id":"edf21f40d89cff2d33382d3dd12a7cf0364fc589154637fbee44069f37557bd0","measured_slow_code_id":"9d17cd44e3cde19f9724a284285a671ac0d9596a0c32b04f42f21268517dabea","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_30972","problem_id":"p00650","slow_code_id":"85ebd76d2b53f5a83649672de50b4c68c211754d6f29aefe82ea3f3c9caeec8f","slow_id":"9d17cd44e3cde19f9724a284285a671ac0d9596a0c32b04f42f21268517dabea","slow_time":0.0872343632,"speedup":4.193231537967087,"stratum":"4-8","sampling_key":"1b7ba78f18ef5dfa764672df14951b74018b37e3051aaa369147fb8b4f19a47e","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\n#include <cmath>\n\n#include <string>\n\n#include <cctype>\n\n#include <map>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define eps 1e-8\n\n#define pi acos(-1.0)\n\n#define inf 1 << 30\n\n#define linf 1LL << 60\n\n#define pb push_back\n\n#define lc(x) (x << 1)\n\n#define rc(x) (x << 1 | 1)\n\n#define lowbit(x) (x & (-x))\n\n#define ll long long\n\n#define maxn 110\n\nint maz[maxn][maxn];\n\nint n, m;\n\nint stoer_wagner(int n) {\n\n  bool vis[maxn];\n\n  int node[maxn], dis[maxn];\n\n  int maxj, prev;\n\n  int ans = inf;\n\n  memset(dis, 0, sizeof(dis));\n\n  for (int i = 0; i < n; i++)\n    node[i] = i;\n\n  while (n > 1) {\n\n    prev = 0;\n\n    maxj = 1;\n\n    memset(vis, false, sizeof(vis));\n\n    vis[node[0]] = true;\n\n    for (int i = 1; i < n; i++) {\n\n      dis[node[i]] = maz[node[0]][node[i]];\n\n      if (dis[node[i]] > dis[node[maxj]])\n\n        maxj = i;\n    }\n\n    for (int i = 1; i < n; i++) {\n\n      if (i == n - 1) {\n\n        ans = (dis[node[maxj]] < ans ? dis[node[maxj]] : ans);\n\n        for (int k = 0; k < n; k++) {\n\n          maz[node[k]][node[prev]] += maz[node[k]][node[maxj]];\n\n          maz[node[prev]][node[k]] = maz[node[k]][node[prev]];\n        }\n\n        node[maxj] = node[--n];\n      }\n\n      prev = maxj;\n\n      vis[node[maxj]] = true;\n\n      maxj = -1;\n\n      for (int k = 1; k < n; k++) {\n\n        if (!vis[node[k]]) {\n\n          dis[node[k]] += maz[node[prev]][node[k]];\n\n          if (maxj == -1 || dis[node[k]] > dis[node[maxj]])\n\n            maxj = k;\n        }\n      }\n    }\n  }\n\n  return ans;\n}\n\nint main() {\n\n  while (~scanf(\"%d%d\", &n, &m)) {\n\n    if (n == 0 && m == 0)\n      break;\n\n    memset(maz, 0, sizeof(maz));\n\n    int a, b, c, res = 0;\n\n    for (int i = 0; i < m; i++) {\n\n      scanf(\"%d%d%d\", &a, &b, &c);\n\n      if (c < 0) {\n\n        res += c;\n\n        continue;\n      }\n\n      maz[a][b] += c;\n\n      maz[b][a] += c;\n    }\n\n    printf(\"%d\\n\", stoer_wagner(n) + res);\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int inf = 0x3f3f3f3f;\n\nconst int maxw = 1000;\n\nint g[105][105], w[105];\n\nint a[105], v[105], na[105];\n\nint n, m;\n\nint mincut(int n) {\n\n  int i, j, pv, zj;\n\n  int best = inf;\n\n  for (i = 0; i < n; i++) {\n\n    v[i] = i;\n  }\n\n  while (n > 1) {\n\n    for (a[v[0]] = 1, i = 1; i < n; i++) {\n\n      a[v[i]] = 0;\n      na[i - 1] = i;\n\n      w[i] = g[v[0]][v[i]];\n    }\n\n    for (pv = v[0], i = 1; i < n; i++) {\n\n      for (zj = -1, j = 1; j < n; j++)\n\n        if (!a[v[j]] && (zj < 0 || w[j] > w[zj]))\n\n          zj = j;\n\n      a[v[zj]] = 1;\n\n      if (i == n - 1) {\n\n        if (best > w[zj])\n          best = w[zj];\n\n        for (i = 0; i < n; i++) {\n\n          g[v[i]][pv] = g[pv][v[i]] += g[v[zj]][v[i]];\n        }\n\n        v[zj] = v[--n];\n\n        break;\n      }\n\n      pv = v[zj];\n\n      for (j = 1; j < n; j++)\n        if (!a[v[j]])\n\n          w[j] += g[v[zj]][v[j]];\n    }\n  }\n\n  return best;\n}\n\nint main() {\n\n  while (scanf(\"%d%d\", &n, &m) != EOF) {\n\n    if (n == 0 && m == 0)\n      break;\n\n    memset(g, 0, sizeof(g));\n\n    int ans = 0;\n\n    int i;\n\n    for (i = 1; i <= m; i++) {\n\n      int from, to, val;\n\n      scanf(\"%d%d%d\", &from, &to, &val);\n\n      if (val < 0) {\n\n        ans += val;\n\n        continue;\n      }\n\n      if (g[from][to] == inf) {\n\n        g[from][to] = val;\n\n      } else {\n\n        g[from][to] += val;\n      }\n\n      g[to][from] = g[from][to];\n    }\n\n    printf(\"%d\\n\", ans + mincut(n));\n  }\n\n  return 0;\n}"}
{"fast_code_id":"0a95c242d3858d13734da13936ff245469e2855b344cf5b7a6a16b2e11e2f5f8","fast_id":"a50a328b835e3896aa9fbb50433dc2d994f4df36a0c5b9c962471dcbfeeea997","fast_time":0.0196033541,"language":"cpp","measured_fast_code_id":"a50a328b835e3896aa9fbb50433dc2d994f4df36a0c5b9c962471dcbfeeea997","measured_slow_code_id":"ea77bfeb8da7ab9ea095f71bafe57a92220a40a839d795efbd4db244bbd0c006","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31053","problem_id":"p01366","slow_code_id":"eab5e49ed68db32b157d8f29db55d4c36d12cbb7ec974ee6fa9f606735a5bae6","slow_id":"ea77bfeb8da7ab9ea095f71bafe57a92220a40a839d795efbd4db244bbd0c006","slow_time":0.3143825502,"speedup":16.037181626995146,"stratum":"8+","sampling_key":"2885194982608697b326a1278eded659c4141bc2510c4a4e2d0367078fa66d75","slow_code":"#include <algorithm>\n\n#include <iostream>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <vector>\n\n#include <queue>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <string>\n\n#include <stack>\n\n#define PI acos(-1.0)\n\n#define inf 0x3f3f3f3f\n\n#define E exp(double(1))\n\n#define maxn 51000\n\nusing namespace std;\n\nstruct Edge {\n\n  int from, to, dis, next;\n\n  int w;\n\n} edge[maxn];\n\nint b[maxn];\n\nint head[maxn];\n\nint vis[maxn];\n\nint dis[maxn];\n\nint tt[maxn];\n\nint p[maxn];\n\nint cnt;\n\nint n;\n\nint ll;\n\nvoid add(int q, int h, int len, int w) {\n\n  edge[cnt].from = q;\n\n  edge[cnt].to = h;\n\n  edge[cnt].dis = len;\n\n  edge[cnt].w = w;\n\n  edge[cnt].next = head[q];\n\n  head[q] = cnt;\n\n  cnt++;\n}\n\nvector<int> vct[maxn];\n\nint Dijkstra() {\n\n  int i, j, k, tmp, v;\n\n  int flag;\n\n  int yy;\n\n  memset(dis, inf, sizeof(dis));\n\n  memset(vis, 0, sizeof(vis));\n\n  memset(tt, 0, sizeof(tt));\n\n  memset(p, 0, sizeof(p));\n\n  dis[1] = 0;\n\n  vis[1] = 1;\n\n  int next;\n\n  int s = 1;\n\n  yy = 0;\n\n  for (int i = 0; i < maxn; i++)\n    vct[i].clear();\n\n  while (1) {\n\n    tmp = inf;\n\n    next = -1;\n\n    for (int i = head[s]; i != -1; i = edge[i].next) {\n\n      v = edge[i].to;\n\n      if (vis[v])\n        continue;\n\n      if (edge[i].dis + dis[s] < dis[v]) {\n\n        dis[v] = edge[i].dis + dis[s];\n\n        tt[v] = edge[i].w;\n\n        p[v] = 1;\n\n        vct[v].clear();\n\n        vct[v].push_back(i);\n\n      } else if (edge[i].dis + dis[s] == dis[v]) {\n\n        tt[v] = max(tt[v], edge[i].w);\n\n        p[v]++;\n\n        vct[v].push_back(i);\n      }\n    }\n\n    for (int i = 1; i <= n; i++) {\n\n      if (vis[i])\n        continue;\n      ;\n\n      if (dis[i] < tmp) {\n\n        tmp = dis[i];\n\n        next = i;\n      }\n    }\n\n    if (next == -1)\n      break;\n\n    for (i = 0; i < vct[next].size(); i++) {\n\n      if (b[vct[next][i]])\n        continue;\n\n      ll += edge[vct[next][i]].w;\n\n      b[vct[next][i]] = 1;\n    }\n\n    vis[next] = 1;\n\n    s = next;\n\n    if (p[next] >= 2) {\n\n      yy += tt[next];\n    }\n  }\n\n  return yy;\n}\n\nint main() {\n\n  int m;\n\n  int q, h, len, w, i, j;\n\n  int ans;\n\n  int ff;\n\n  while (scanf(\"%d%d\", &n, &m) != EOF, n + m) {\n\n    ll = 0;\n\n    cnt = 0;\n\n    memset(b, 0, sizeof(b));\n\n    memset(head, -1, sizeof(head));\n\n    for (i = 0; i < m; i++) {\n\n      scanf(\"%d%d%d%d\", &q, &h, &len, &w);\n\n      add(q, h, len, w);\n\n      add(h, q, len, w);\n    }\n\n    ff = Dijkstra();\n\n    printf(\"%d\\n\", ll - ff);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconstexpr int maxN = 10005;\n\nconstexpr int maxM = 400005;\n\nint N, M;\n\nint adj[maxN], gto[maxM], gnxt[maxM], length[maxM], cost[maxM], e;\n\nvoid add_edge(int u, int v, int d, int c) {\n\n  gto[e] = v;\n  length[e] = d;\n  cost[e] = c;\n  gnxt[e] = adj[u];\n  adj[u] = e++;\n}\n\nvoid print_edge(int s) {\n\n  printf(\"%d:\", s);\n\n  for (int e = adj[s]; ~e; e = gnxt[e])\n\n    printf(\" %d\", gto[e]);\n\n  putchar('\\n');\n}\n\nint dis[maxN], pre[maxN];\n\nint qu[maxN], qh, qt;\nbool inq[maxN];\n\nvoid bellman_ford(int s) {\n\n  memset(dis, 0x3f, sizeof dis);\n  dis[s] = 0;\n\n  for (inq[qu[qh = qt = 0] = s] = 1; qh <= qt; inq[qu[qh++ % N]] = 0)\n\n    for (int u = qu[qh % N], e = adj[u], v = gto[e]; ~e; v = gto[e = gnxt[e]])\n\n      if (dis[v] > dis[u] + length[e]) {\n\n        dis[v] = dis[u] + length[e];\n\n        pre[v] = cost[e];\n\n        if (!inq[v])\n          inq[qu[++qt % N] = v] = 1;\n\n      } else if (dis[v] == dis[u] + length[e]) {\n\n        pre[v] = min(pre[v], cost[e]);\n      }\n}\n\nint main() {\n\n  while (~scanf(\"%d%d\", &N, &M) && (N || M)) {\n\n    memset(adj, -1, sizeof adj);\n\n    for (int i = 0; i != M; ++i) {\n\n      int u, v, d, c;\n      scanf(\"%d%d%d%d\", &u, &v, &d, &c);\n\n      add_edge(u, v, d, c);\n      add_edge(v, u, d, c);\n    }\n\n    bellman_ford(1);\n\n    long long ans = 0;\n\n    for (int i = 1; i <= N; ++i)\n      ans += pre[i];\n\n    printf(\"%lld\\n\", ans);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"681ec84f3636dd710b8ad054aa730bf71d0098d7a66f0779bc91da2adb6faf23","fast_id":"28a6d459cacd5babfe7dfadfd9a0944e24492f120c98a385abe8368a66b9968f","fast_time":0.0835132175,"language":"cpp","measured_fast_code_id":"28a6d459cacd5babfe7dfadfd9a0944e24492f120c98a385abe8368a66b9968f","measured_slow_code_id":"4818da498104359bc5f6386686ffc0f92680174e31cf5d7e2526201f5f28820a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3116","problem_id":"p02359","slow_code_id":"189af417f1b6a72153f6171f3298afd29fb2edcea523863ee304f060a370b70c","slow_id":"4818da498104359bc5f6386686ffc0f92680174e31cf5d7e2526201f5f28820a","slow_time":0.1860008882,"speedup":2.227202995741363,"stratum":"2-4","sampling_key":"ec8d87b689d6a45b962022b2023cb4b1391299016c8758247ebeacfc39726a6a","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <cctype>\n\n#include <utility>\n\n#include <string>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <queue>\n\n#include <map>\n\n#define REP(i, n) for (int i = 0; i < n; i++)\n\n#define REPR(i, n) for (int i = n; i >= 0; i--)\n\n#define FOR(i, m, n) for (int i = m; i < n; i++)\n\n#define FORR(i, m, n) for (int i = m; i >= n; i--)\n\n#define SORT(v, n) sort(v, v + n);\n\n#define VSORT(v) sort(v.begin(), v.end());\n\n#define llong long long\n\n#define pb(a) push_back(a)\n\n#define INF 1000000007\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<int, int> P;\n\ntypedef pair<llong, llong> LP;\n\ntypedef pair<int, P> PP;\n\ntypedef pair<llong, LP> LPP;\n\ntypedef pair<ll, int> LL_IP;\n\n#define ARRAY_MAX 100005\n\nint main() {\n\n  int n, t;\n\n  cin >> n >> t;\n\n  vector<int> l(ARRAY_MAX, 0), r(ARRAY_MAX, 0);\n\n  vector<int> imos(ARRAY_MAX, 0);\n\n  REP(i, n) {\n\n    cin >> l[i] >> r[i];\n\n    imos[l[i]]++;\n\n    imos[r[i]]--;\n  }\n\n  REP(i, t) { imos[i + 1] += imos[i]; }\n\n  int maxi = -1;\n\n  REP(i, t + 1) { maxi = max(maxi, imos[i]); }\n\n  cout << maxi << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <cctype>\n\n#include <utility>\n\n#include <string>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <queue>\n\n#include <map>\n\n#include <set>\n\n#include <climits>\n\n#define REP(i, n) for (int i = 0; i < n; i++)\n\n#define REPR(i, n) for (int i = n; i >= 0; i--)\n\n#define FOR(i, m, n) for (int i = m; i < n; i++)\n\n#define FORR(i, m, n) for (int i = m; i >= n; i--)\n\n#define SORT(v, n) sort(v, v + n);\n\n#define VSORT(v) sort(v.begin(), v.end());\n\n#define llong long long\n\n#define pb(a) push_back(a)\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntemplate <typename T>\n\nvector<T> make_v(size_t a) {\n  return vector<T>(a);\n}\n\ntemplate <typename T, typename... Ts>\n\nauto make_v(size_t a, Ts... ts) {\n\n  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\n}\n\ntemplate <typename T, typename V>\n\ntypename enable_if<is_class<T>::value == 0>::type\n\nfill_v(T &t, const V &v) {\n  t = v;\n}\n\ntemplate <typename T, typename V>\n\ntypename enable_if<is_class<T>::value != 0>::type\n\nfill_v(T &t, const V &v) {\n\n  for (auto &e : t)\n    fill_v(e, v);\n}\n\n#define ARRAY_MAX 100005\n\nconst int INF = INT32_MAX / 3;\n\nconst ll MOD = 1e9 + 7;\n\nint dx[4] = {1, 0, 0, -1};\n\nint dy[4] = {0, 1, -1, 0};\n\nvector<ll> Eratosthenes(ll n) {\n\n  vector<ll> arr(n);\n\n  for (ll i = 0; i < n; i++) {\n\n    arr[i] = 1;\n  }\n\n  arr[0] = arr[1] = 0;\n\n  for (ll i = 2; i < sqrt(n); i++) {\n\n    if (arr[i]) {\n\n      for (ll j = 0; i * (j + 2) < n; j++) {\n\n        arr[i * (j + 2)] = 0;\n      }\n    }\n  }\n\n  return arr;\n}\n\nint a[100005];\n\nint main() {\n\n  int n, t;\n\n  cin >> n >> t;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    int l, r;\n\n    cin >> l >> r;\n\n    a[l]++;\n\n    a[r]--;\n  }\n\n  int maxi = a[0];\n\n  for (int i = 0; i <= t; i++)\n\n  {\n\n    a[i + 1] += a[i];\n\n    maxi = max(maxi, a[i + 1]);\n  }\n\n  cout << maxi << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"6724c0293851c90ca1252a3632f27f63a90d974acbc21ebef6feaf4c3c35e8ec","fast_id":"f23fc98f6d9af2f620110621a3e2c7291e92e0837d860f900d2b4d78b7cf59d3","fast_time":0.0001931787,"language":"cpp","measured_fast_code_id":"f23fc98f6d9af2f620110621a3e2c7291e92e0837d860f900d2b4d78b7cf59d3","measured_slow_code_id":"4bdcf652581a666db42936102af2ae8421d4e8e35dec6f289ed6831fd06d8f18","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3121","problem_id":"p02997","slow_code_id":"b9b79ab37584648cd5101defd038919d27fe70179c5e661cd87e8ac1f8968b08","slow_id":"4bdcf652581a666db42936102af2ae8421d4e8e35dec6f289ed6831fd06d8f18","slow_time":0.0018590366,"speedup":9.623403615408945,"stratum":"8+","sampling_key":"a1edd875b278395b960822da0e63c9dc0a89dbf8f1065a29e2b7d3a3819e7740","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define pi acos(0.0)\n\n#define ll long long\n\n#define f first\n\n#define s second\n\n#define gap ' '\n\n#define pb push_back\n\nint main()\n\n{\n\n  int n, k;\n\n  cin >> n >> k;\n\n  if (((n - 2) * (n - 1)) / 2 < k)\n\n  {\n\n    cout << -1;\n\n    return 0;\n  }\n\n  pair<int, int> ara[100005];\n\n  int m = 0;\n\n  for (int i = 2; i <= n; i++)\n\n  {\n\n    ara[m].f = 1;\n\n    ara[m].s = i;\n\n    m++;\n  }\n\n  vector<pair<int, int> > p;\n\n  for (int i = 2; i <= n; i++)\n\n  {\n\n    for (int j = i + 1; j <= n; j++)\n\n    {\n\n      p.pb({i, j});\n    }\n  }\n\n  for (int i = 0; i < ((n - 2) * (n - 1)) / 2 - k; i++)\n\n  {\n\n    ara[m] = p[i];\n\n    m++;\n  }\n\n  cout << m << endl;\n\n  for (int i = 0; i < m; i++)\n\n  {\n\n    cout << ara[i].f << gap << ara[i].s << endl;\n  }\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n, k;\n\n  scanf(\"%d %d\", &n, &k);\n\n  int ans = (n - 1) * (n - 2) / 2;\n\n  if (ans < k)\n\n  {\n\n    printf(\"-1\");\n\n  }\n\n  else\n\n  {\n\n    printf(\"%d\\n\", n - 1 + ans - k);\n\n    for (int i = 2; i <= n; i++)\n\n      printf(\"%d %d\\n\", 1, i);\n\n    for (int i = 2; i <= n; i++)\n\n      for (int j = i + 1; j <= n; j++)\n\n      {\n\n        if (ans == k)\n          return 0;\n\n        printf(\"%d %d\\n\", i, j);\n\n        ans--;\n      }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"5ce5fa4688bc0f1e20b16c978539b80df5fbe6b63d74f9b5a8b44b1d59074b81","fast_id":"711b9317324e1a65d96df877932c202f67ca22b1c49b7418b4b6892a6a068b14","fast_time":0.0011884364,"language":"cpp","measured_fast_code_id":"711b9317324e1a65d96df877932c202f67ca22b1c49b7418b4b6892a6a068b14","measured_slow_code_id":"febbe5a28880831cbf3304743f02d3ab2bf6ceb7cb37e4c06e435c469d0f30d1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3128","problem_id":"p03224","slow_code_id":"70d355e9289cec5d12ea2b1a949c525f59b357e452745084f3e16211739a39e5","slow_id":"febbe5a28880831cbf3304743f02d3ab2bf6ceb7cb37e4c06e435c469d0f30d1","slow_time":0.0027539175,"speedup":2.317261150870168,"stratum":"2-4","sampling_key":"d36def673b21065e9744c2bd09dbfc99aba3f08633335ed3d431905592c4f647","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define P pair<ll, ll>\n\n#define FOR(I, A, B) for (ll I = (A); I < (B); ++I)\n\n#define FORR(I, A, B) for (ll I = ((B)-1); I >= (A); --I)\n\n#define TO(x, t, f) ((x) ? (t) : (f))\n\n#define SORT(x) (sort(x.begin(), x.end()))\n\n#define REV(x) (reverse(x.begin(), x.end()))\n\nll gcd(ll a, ll b) {\n  if (a < b)\n    swap(a, b);\n  if (a % b == 0)\n    return b;\n  return gcd(b, a % b);\n}\n\nll lcm(ll a, ll b) {\n  ll c = gcd(a, b);\n  return ((a / c) * (b / c) * c);\n}\n\n#define NEXTP(x) next_permutation(x.begin(), x.end())\n\nconst ll INF = 1e18 + 7;\n\nconst ll MOD = 1e9 + 7;\n\n#define pri(a) cout << (a) << endl\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  vector<ll> Yes(100001, 0);\n\n  FOR(i, 0, 100001) {\n\n    ll x = i * 8 + 1;\n\n    ll p = sqrt(x);\n\n    if (p * p == x) {\n\n      Yes[i] = (1 + p) / 2;\n    }\n  }\n\n  ll N;\n\n  cin >> N;\n\n  if (Yes[N] == 0) {\n\n    cout << \"No\" << endl;\n\n    return 0;\n  }\n\n  ll K = Yes[N];\n\n  bool same[K + 1][K + 1] = {false};\n\n  vector<vector<ll> > Si;\n\n  Si.resize(K + 1);\n\n  ll num = 1;\n\n  FOR(i, 1, K + 1) {\n\n    FOR(j, 1, K + 1) {\n\n      if (j == i)\n        continue;\n\n      if (not same[i][j]) {\n\n        same[i][j] = same[j][i] = true;\n\n        Si[i].push_back(num);\n\n        Si[j].push_back(num);\n\n        num++;\n      }\n    }\n  }\n\n  cout << \"Yes\" << endl;\n\n  cout << K << endl;\n\n  FOR(i, 1, K + 1) {\n\n    cout << Si[i].size() << \" \";\n\n    FOR(j, 0, Si[i].size()) { cout << Si[i][j] << \" \"; }\n\n    cout << endl;\n  }\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define P pair<ll, ll>\n\n#define FOR(I, A, B) for (ll I = (A); I < (B); ++I)\n\n#define FORR(I, A, B) for (ll I = ((B)-1); I >= (A); --I)\n\n#define TO(x, t, f) ((x) ? (t) : (f))\n\n#define SORT(x) (sort(x.begin(), x.end()))\n\n#define REV(x) (reverse(x.begin(), x.end()))\n\nll gcd(ll a, ll b) {\n  if (a < b)\n    swap(a, b);\n  if (a % b == 0)\n    return b;\n  return gcd(b, a % b);\n}\n\nll lcm(ll a, ll b) {\n  ll c = gcd(a, b);\n  return ((a / c) * (b / c) * c);\n}\n\n#define NEXTP(x) next_permutation(x.begin(), x.end())\n\nconst ll INF = 1e18 + 7;\n\nconst ll MOD = 1e9 + 7;\n\n#define pri(a) cout << (a) << endl\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  ll N, K;\n\n  cin >> N;\n\n  bool there = false;\n\n  FOR(i, 1, 100000) {\n\n    if ((i * (i - 1)) == (2 * N)) {\n\n      there = true;\n\n      K = i;\n    }\n  }\n\n  if (not there) {\n\n    cout << \"No\" << endl;\n\n    return 0;\n  }\n\n  vector<vector<ll> > S;\n\n  S.resize(K + 1);\n\n  bool same[K + 1][K + 1] = {};\n\n  FOR(i, 1, K + 1) {\n\n    FOR(j, 1, K + 1) {\n\n      if (j == i)\n        continue;\n\n      if (not same[i][j]) {\n\n        same[i][j] = same[j][i] = true;\n\n        S[i].push_back(N);\n\n        S[j].push_back(N);\n\n        N--;\n      }\n    }\n  }\n\n  cout << \"Yes\" << endl << K << endl;\n\n  FOR(i, 1, K + 1) {\n\n    cout << S[i].size() << \" \";\n\n    FOR(j, 0, S[i].size()) { cout << S[i][j] << \" \"; }\n\n    cout << endl;\n  }\n}"}
{"fast_code_id":"81ca609f37c126f40448411ca7a98c4e17baae6fa62de345719f9e52cf987344","fast_id":"543baf7d842531192716f75d8b58e571bfa7ab70e129394f7e763628321847e4","fast_time":0.0779733718,"language":"cpp","measured_fast_code_id":"543baf7d842531192716f75d8b58e571bfa7ab70e129394f7e763628321847e4","measured_slow_code_id":"8031612c0adac4d5b3bf403c372b7a84cc51db11564fd80210109501d3f54787","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3131","problem_id":"p01090","slow_code_id":"f786f48860db9c8fa60fc9c3c86060377717c1c1f7017c2652d9500b57a38df1","slow_id":"8031612c0adac4d5b3bf403c372b7a84cc51db11564fd80210109501d3f54787","slow_time":0.1883148959,"speedup":2.4151180275110278,"stratum":"2-4","sampling_key":"fc0dc3efde36de95e81ced1dcc66a6ad8903311630cd1fd669dacfab13d80187","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing Int = long long;\n\nstruct Kruskal {\n\n  struct UnionFind {\n\n    Int n;\n\n    vector<Int> r, p;\n\n    UnionFind() {}\n\n    UnionFind(Int sz) : n(sz), r(sz, 1), p(sz, 0) { iota(p.begin(), p.end(), 0); }\n\n    Int find(Int x) { return (x == p[x] ? x : p[x] = find(p[x])); }\n\n    bool same(Int x, Int y) { return find(x) == find(y); }\n\n    void unite(Int x, Int y) {\n\n      x = find(x);\n      y = find(y);\n\n      if (x == y)\n        return;\n\n      if (r[x] < r[y])\n        swap(x, y);\n\n      r[x] += r[y];\n\n      p[y] = x;\n    }\n  };\n\n  struct edge {\n\n    Int from, to;\n\n    double cost;\n\n    Int used;\n\n    char color;\n\n    edge() {}\n\n    edge(Int from, Int to, double cost, char color)\n        :\n\n          from(from), to(to), cost(cost), used(0), color(color) {}\n\n    bool operator<(const edge &e) const { return cost < e.cost; }\n  };\n\n  Int n;\n\n  vector<edge> edges;\n\n  Kruskal() {}\n\n  Kruskal(Int sz) : n(sz) {}\n\n  Int build(Int k = -1) {\n\n    sort(edges.begin(), edges.end());\n\n    UnionFind uf(n + 1);\n\n    double res = 0;\n\n    Int cnt = 0;\n\n    for (Int i = 0; i < (Int)edges.size(); i++) {\n\n      edge &e = edges[i];\n\n      if (!uf.same(e.from, e.to)) {\n\n        e.used = 1;\n\n        res += e.cost;\n\n        uf.unite(e.from, e.to);\n\n        cnt++;\n      }\n    }\n\n    if (cnt + 1 != n)\n      return -1;\n\n    return res;\n  }\n};\n\nsigned main() {\n\n  Int n, m, k;\n\n  while (cin >> n >> m >> k, n) {\n\n    Kruskal kr(n);\n\n    auto edges = kr.edges;\n\n    for (Int i = 0; i < m; i++) {\n\n      Int u, v, w;\n\n      char c;\n\n      cin >> u >> v >> w >> c;\n\n      u--;\n      v--;\n\n      edges.emplace_back(u, v, w, c);\n    }\n\n    double ub = 1e12, ans;\n\n    auto check = [&](double x) {\n      x -= ub;\n\n      kr = Kruskal(n);\n\n      for (auto e : edges) {\n\n        if (x > 0 && e.color == 'A')\n          e.cost += x;\n\n        if (x < 0 && e.color == 'B')\n          e.cost -= x;\n\n        kr.edges.emplace_back(e);\n      }\n\n      ans = kr.build();\n\n      if (ans < 0)\n        return Int(-1);\n\n      if (x > 0)\n        ans -= x * k;\n\n      if (x < 0)\n        ans += x * (n - 1 - k);\n\n      Int res = 0;\n\n      for (auto e : kr.edges)\n\n        res += (e.used && e.color == 'A');\n\n      return res;\n    };\n\n    double l = 0, r = 2 * ub;\n\n    if (check(l) < k || check(r) > k) {\n\n      cout << -1 << endl;\n\n      continue;\n    }\n\n    for (Int i = 0; i < 2000; i++) {\n\n      double m = (l + r) / 2;\n\n      if (check(m) >= k)\n        l = m;\n\n      else\n        r = m;\n    }\n\n    check(l);\n\n    cout << (Int)ceil(ans) << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing Int = long long;\n\nstruct UnionFind {\n\n  Int n;\n\n  vector<Int> r, p;\n\n  UnionFind() {}\n\n  UnionFind(Int sz) : n(sz), r(sz, 1), p(sz, 0) { iota(p.begin(), p.end(), 0); }\n\n  Int find(Int x) { return (x == p[x] ? x : p[x] = find(p[x])); }\n\n  bool same(Int x, Int y) { return find(x) == find(y); }\n\n  void unite(Int x, Int y) {\n\n    x = find(x);\n    y = find(y);\n\n    if (x == y)\n      return;\n\n    if (r[x] < r[y])\n      swap(x, y);\n\n    r[x] += r[y];\n\n    p[y] = x;\n  }\n};\n\nstruct Kruskal {\n\n  struct edge {\n\n    Int from, to, cost, used;\n\n    char color;\n\n    edge() {}\n\n    edge(Int from, Int to, Int cost, char color)\n        :\n\n          from(from), to(to), cost(cost), used(0), color(color) {}\n\n    bool operator<(const edge &e) const { return cost < e.cost; }\n  };\n\n  Int n;\n\n  vector<edge> edges;\n\n  Kruskal() {}\n\n  Kruskal(Int sz) : n(sz) {}\n\n  void add_edge(Int u, Int v, Int c, char d) { edges.emplace_back(u, v, c, d); }\n\n  void input(Int m, Int offset = 0) {\n\n    Int a, b, c;\n\n    char d;\n\n    for (Int i = 0; i < m; i++) {\n\n      cin >> a >> b >> c >> d;\n\n      add_edge(a + offset, b + offset, c, d);\n    }\n  }\n\n  Int build() {\n\n    sort(edges.begin(), edges.end());\n\n    UnionFind uf(n + 1);\n\n    Int res = 0, cnt = 0;\n\n    for (auto &e : edges) {\n\n      if (!uf.same(e.from, e.to)) {\n\n        res += e.cost;\n\n        uf.unite(e.from, e.to);\n\n        e.used = 1;\n\n        cnt++;\n      }\n    }\n\n    if (cnt + 1 != n)\n      return -1;\n\n    return res;\n  }\n\n  Int count(char c) {\n\n    Int res = 0;\n\n    for (auto &e : edges)\n\n      if (e.used && e.color == c)\n        res++;\n\n    return res;\n  }\n};\n\nsigned main() {\n\n  Int n, m, k;\n\n  while (cin >> n >> m >> k, n) {\n\n    Kruskal kr(n);\n\n    kr.input(m, -1);\n\n    Int ans = kr.build();\n\n    if (ans < 0) {\n\n      cout << -1 << endl;\n\n      continue;\n    }\n\n    auto es = kr.edges;\n\n    Int A = kr.count('A');\n\n    Int B = kr.count('B');\n\n    auto check = [&](char c, char d, Int i) {\n      Int res = -1;\n\n      UnionFind uf(n);\n\n      for (Int j = 0; j < m; j++)\n\n        if (i != j && es[j].used)\n\n          uf.unite(es[j].from, es[j].to);\n\n      for (Int j = 0; j < m; j++)\n\n        if (es[j].color == d && !es[j].used)\n\n          if (!uf.same(es[j].from, es[j].to))\n\n            if (res < 0 || es[j].cost < es[res].cost)\n\n              res = j;\n\n      return res;\n    };\n\n    while (A > k) {\n\n      Int res = -1, idx = -1, idy = -1;\n\n      for (Int i = 0; i < m; i++) {\n\n        if (es[i].color != 'A' || !es[i].used)\n          continue;\n\n        Int tmp = check('A', 'B', i);\n\n        if (tmp < 0)\n          continue;\n\n        if (res < 0 || es[tmp].cost - es[i].cost < res) {\n\n          res = es[tmp].cost;\n\n          idx = i;\n          idy = tmp;\n        }\n      }\n\n      if (idx < 0)\n        break;\n\n      es[idx].used = 0;\n      ans -= es[idx].cost;\n\n      es[idy].used = 1;\n      ans += es[idy].cost;\n\n      A--;\n      B++;\n    }\n\n    while (A < k) {\n\n      Int res = -1, idx = -1, idy = -1;\n\n      for (Int i = 0; i < m; i++) {\n\n        if (es[i].color != 'B' || !es[i].used)\n          continue;\n\n        Int tmp = check('B', 'A', i);\n\n        if (tmp < 0)\n          continue;\n\n        if (res < 0 || es[tmp].cost - es[i].cost < res) {\n\n          res = es[tmp].cost;\n\n          idx = i;\n          idy = tmp;\n        }\n      }\n\n      if (idx < 0)\n        break;\n\n      es[idx].used = 0;\n      ans -= es[idx].cost;\n\n      es[idy].used = 1;\n      ans += es[idy].cost;\n\n      A++;\n      B--;\n    }\n\n    if (A != k)\n      cout << -1 << endl;\n\n    else\n      cout << ans << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"19f5fa7c8a4ff8c4fc2dbb6b6f04b603f4d47978e3cc422d97d8dbdf253ce436","fast_id":"929716d7cdd427f91732da6b39681b7e351a721360deae43fc6dfa0c7711afa8","fast_time":0.0194310445,"language":"cpp","measured_fast_code_id":"929716d7cdd427f91732da6b39681b7e351a721360deae43fc6dfa0c7711afa8","measured_slow_code_id":"ccff975a9b347fd505ef7945770636a5f71ee7372d7a8a641fd75537e4c0d387","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31622","problem_id":"p03096","slow_code_id":"1ed342e1b4b7c3eee82b51533be15f02cdfa796eb318d12cb34b1b5d24f7edd5","slow_id":"ccff975a9b347fd505ef7945770636a5f71ee7372d7a8a641fd75537e4c0d387","slow_time":1.0558268461,"speedup":54.337112248391996,"stratum":"8+","sampling_key":"fa82f4627f071e082d65470feaef90109a89a47b88a6da7c5b7495ef0d431e4f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REPP(i, a, b, c) for (int i = a; i <= b; i += c)\n\n#define REP(i, a, b) REPP(i, a, b, 1)\n\n#define REVV(i, a, b, c) for (int i = a; i >= b; i -= c)\n\n#define REV(i, a, b) REVV(i, a, b, 1)\n\n#define FOR(i, a) REP(i, 0, (int)a - 1)\n\n#define FORD(i, a) REV(i, (int)a - 1, 0)\n\n#define PB push_back\n\n#define POB pop_back\n\n#define MP make_pair\n\n#define FI first\n\n#define SE second\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<int, int> pii;\n\ntypedef vector<int> vi;\n\ntypedef vector<pii> vii;\n\ntypedef vector<ll> vl;\n\nconst double EPS = 1e-9;\n\nconst double PI = acos(-1);\n\nconst int INF = 1e9;\n\nconst ll MOD = 1e9 + 7;\n\nll addMod(ll a, ll b) { return (a + b) % MOD; }\n\nll mulMod(ll a, ll b) { return (a * b) % MOD; }\n\nll fast(ll a, ll b) {\n\n  if (b == 0)\n    return 1;\n\n  ll tmp = fast(a, b / 2);\n\n  tmp = mulMod(tmp, tmp);\n\n  if (b & 1)\n    tmp = mulMod(tmp, a);\n\n  return tmp;\n}\n\nconst int N = 2e5;\n\nint n;\n\nint m;\n\nint arr[N + 5];\n\nvi lst[N + 5];\n\nll dp[N + 5];\n\nint nxt[N + 5];\n\nll solve(int idx) {\n\n  if (idx == m + 1) {\n\n    return 1;\n  }\n\n  ll &ret = dp[idx];\n\n  if (ret != -1)\n    return ret;\n\n  ret = solve(idx + 1);\n\n  if (nxt[idx] != -1)\n    ret = addMod(ret, solve(nxt[idx]));\n\n  return ret;\n}\n\nint main() {\n\n  ios_base ::sync_with_stdio(0);\n  cin.tie(0);\n  cout.tie(0);\n\n  memset(nxt, -1, sizeof nxt);\n\n  m = 0;\n\n  cin >> n;\n\n  int bef = -1;\n\n  int x;\n\n  REP(i, 1, n) {\n\n    cin >> x;\n\n    if (x != bef) {\n\n      arr[++m] = x;\n\n      bef = x;\n\n      lst[x].PB(m);\n    }\n  }\n\n  REP(i, 1, N) {\n\n    if (lst[i].size() > 1) {\n\n      FOR(j, lst[i].size() - 1) { nxt[lst[i][j]] = lst[i][j + 1]; }\n    }\n  }\n\n  memset(dp, -1, sizeof dp);\n\n  cout << solve(1) << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nint n, x, las, ans, c[200013];\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  ans = 1;\n  las = -1;\n\n  for (register int i = 0; i < n; ++i) {\n\n    scanf(\"%d\", &x);\n\n    if (x == las)\n      continue;\n\n    las = x;\n\n    ans = (1LL * ans + c[x]) % 1000000007;\n\n    c[x] = ans;\n  }\n\n  printf(\"%d\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"21e40535edc4e10f34b7ea433e328953ee356d159609cf553a9d0083fc1ce1e4","fast_id":"77d332166623ff226a04b2375a4d2a29bd59a75ab75093f0b21c7b7d83ee1a82","fast_time":0.0010056309,"language":"cpp","measured_fast_code_id":"77d332166623ff226a04b2375a4d2a29bd59a75ab75093f0b21c7b7d83ee1a82","measured_slow_code_id":"bc5ae2e2a26ddc7ba6d970bd78d50f17e81c25117a02cc873498acb611dd6883","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31634","problem_id":"p03551","slow_code_id":"ccd9cb5172d30ef38bab1e092268c300b4882e7675e3d5ddefdc9a03a1f4e162","slow_id":"bc5ae2e2a26ddc7ba6d970bd78d50f17e81c25117a02cc873498acb611dd6883","slow_time":0.0081555059,"speedup":8.10984020081324,"stratum":"8+","sampling_key":"c015124a6ab836b188c6171099caeec4446201514e3af4d34ecb8afc1ca23410","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\nint N, M;\n\ndouble t1 = 1900, t2 = 100;\n\nvoid Solve()\n\n{\n\n  t1 *= M;\n\n  double ans = 0;\n\n  int a = (N - M) * t2;\n\n  int p = 1 << M;\n\n  double pp = 1;\n\n  for (int i = 1; i <= 1000000; ++i) {\n\n    ans += (a + t1) * i / p * pp;\n\n    pp = pp * (p - 1) / p;\n  }\n\n  int ians = ans + 0.5;\n\n  printf(\"%d\\n\", ians);\n}\n\nint main()\n\n{\n\n#ifdef linjian\n\n  freopen(\"in\", \"r\", stdin);\n\n#endif\n\n  scanf(\"%d%d\", &N, &M);\n\n  Solve();\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\nint N, M;\n\nvoid Solve()\n\n{\n\n  int tot = 1900 * M + 100 * (N - M);\n\n  int p = 1 << M;\n\n  int ans = tot * p;\n\n  printf(\"%d\\n\", ans);\n}\n\nint main()\n\n{\n\n#ifdef linjian\n\n  freopen(\"in\", \"r\", stdin);\n\n#endif\n\n  scanf(\"%d%d\", &N, &M);\n\n  Solve();\n\n  return 0;\n}"}
{"fast_code_id":"c9e53f18c7b7a02d1cdfbfc4a5ec2c23ac30605583867f66621d96bc5ae88303","fast_id":"dd46a2e30806c5a5612c243c3c9e2900a1f19ce5c38b0882409b78a97ab78090","fast_time":0.1431692202,"language":"cpp","measured_fast_code_id":"dd46a2e30806c5a5612c243c3c9e2900a1f19ce5c38b0882409b78a97ab78090","measured_slow_code_id":"b7e00c116f6a7e638ca8cdf2c0d086a340522679a5b5239fcd767b4c4330933e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31635","problem_id":"p00854","slow_code_id":"174926cb49af0ad1f58daa36a2b4d3d8dfe24bf95dbd4931c11be67d0de2a17b","slow_id":"b7e00c116f6a7e638ca8cdf2c0d086a340522679a5b5239fcd767b4c4330933e","slow_time":0.307721162,"speedup":2.1493527838604516,"stratum":"2-4","sampling_key":"a3868b250c4c78219858c01c1f45fa37a26d3ec529232877aa17c102ead6f463","slow_code":"#define _USE_MATH_DEFINES\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <functional>\n\n#include <iostream>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <string>\n\n#include <time.h>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<int, int> i_i;\n\ntypedef pair<ll, int> ll_i;\n\ntypedef pair<double, int> d_i;\n\ntypedef pair<ll, ll> ll_ll;\n\ntypedef pair<double, double> d_d;\n\nstruct edge {\n  int u, v;\n  ll w;\n};\n\nll MOD = 1000000007;\n\nll _MOD = 1000000009;\n\ndouble EPS = 1e-10;\n\nstruct bit {\n\n  vector<ll> v;\n\n  bit(int n) : v(n + 1) {}\n\n  ll sum(int i) {\n\n    ll res = 0;\n\n    for (; i > 0; i -= i & -i)\n      res += v[i];\n\n    return res;\n  }\n\n  void add(int i, ll x) {\n\n    for (i++; i < v.size(); i += i & -i)\n      v[i] += x;\n  }\n\n  int lower_bound(ll x) {\n\n    if (x <= 0)\n      return 0;\n\n    int res = 0;\n\n    for (int i = 1 << 24; i > 0; i >>= 1)\n\n      if (res + i < v.size() && v[res + i] < x) {\n\n        res += i;\n        x -= v[res];\n      }\n\n    return res + 1;\n  }\n};\n\nint main() {\n\n  for (;;) {\n\n    int n, k, m;\n    cin >> n >> k >> m;\n\n    if (n == 0)\n      break;\n\n    bit b(n);\n\n    for (int i = 0; i < n; i++)\n      b.add(i, 1);\n\n    for (n--; n > 0; n--) {\n\n      b.add(m - 1, -1);\n\n      int x = (b.sum(m) + k) % n;\n\n      if (x == 0)\n        x = n;\n\n      m = b.lower_bound(x);\n    }\n\n    cout << m << endl;\n  }\n}","fast_code":"#define _USE_MATH_DEFINES\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <functional>\n\n#include <iostream>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <string>\n\n#include <time.h>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<int, int> i_i;\n\ntypedef pair<ll, int> ll_i;\n\ntypedef pair<double, int> d_i;\n\ntypedef pair<ll, ll> ll_ll;\n\ntypedef pair<double, double> d_d;\n\nstruct edge {\n  int u, v;\n  ll w;\n};\n\nll MOD = 1000000007;\n\nll _MOD = 1000000009;\n\ndouble EPS = 1e-10;\n\nint f(int n, int k) { return n == 1 ? 0 : 1 + (k - 1 + f(n - 1, k)) % (n - 1); }\n\nint main() {\n\n  for (;;) {\n\n    int n, k, m;\n    cin >> n >> k >> m;\n\n    if (n == 0)\n      break;\n\n    cout << 1 + (m - 1 + f(n, k)) % n << endl;\n  }\n}"}
{"fast_code_id":"27ab840120bad8aabf3a77fe132ad4c2f5e62887c3b73d2e22bab7363b691612","fast_id":"23d18d064d8c792529a8bed76b2d3d81ccd2e68eb2c2a22244349447bb658bec","fast_time":0.0199220035,"language":"cpp","measured_fast_code_id":"23d18d064d8c792529a8bed76b2d3d81ccd2e68eb2c2a22244349447bb658bec","measured_slow_code_id":"62848eda6bdc7e223e217c3f97ce20bf2b52fe655d8df575b8c5da17c3ea405c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31694","problem_id":"p03652","slow_code_id":"ab31ccb7fb28e5ab5623467902a08965c25dbfa140eee57685b73e8f07788705","slow_id":"62848eda6bdc7e223e217c3f97ce20bf2b52fe655d8df575b8c5da17c3ea405c","slow_time":0.1146673396,"speedup":5.755813645951824,"stratum":"4-8","sampling_key":"0c4ec9631d19ba460ceacd41a5020dcffa4d869227b2f5fd23366dd4ca7c553c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 305;\n\nint a[N][N];\n\nbool b[N];\n\nqueue<int> f[N];\n\nint n, m;\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= m; j++)\n\n      scanf(\"%d\", &a[i][j]);\n\n  for (int i = 1; i <= n; i++)\n\n    f[a[i][1]].push(i), a[i][0] = 1;\n\n  memset(b, true, sizeof(b));\n\n  int ret = 0;\n\n  for (int i = 1; i <= m; i++)\n\n    if (f[i].size() > ret)\n      ret = f[i].size();\n\n  int ans = ret;\n\n  while (1) {\n\n    int k = -1;\n\n    for (int i = 1; i <= m; i++)\n\n      if (k == -1 || f[i].size() > f[k].size())\n        k = i;\n\n    if (k == -1)\n      break;\n\n    b[k] = false;\n\n    while (!f[k].empty()) {\n\n      int i = f[k].front();\n\n      f[k].pop();\n\n      while (!b[a[i][a[i][0]]])\n        a[i][0]++;\n\n      f[a[i][a[i][0]]].push(i);\n    }\n\n    int ret = 0;\n\n    for (int i = 1; i <= m; i++)\n\n      if (f[i].size() > ret)\n        ret = f[i].size();\n\n    if (ret == 0)\n      break;\n\n    ans = min(ans, ret);\n  }\n\n  printf(\"%d\", ans);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define N 305\n\nint n, m, i, j, l, r, mid, Max, ans;\n\nint a[N][N], num[N], pos[N];\n\nbool vis[N];\n\nvoid get() {\n  Max = 0;\n\n  for (int i = 1; i <= m; i++)\n\n    if (num[i] > num[Max])\n      Max = i;\n}\n\nbool check1(int x) {\n\n  memset(num, 0, sizeof(num));\n\n  memset(vis, 0, sizeof(vis));\n\n  for (int i = 1; i <= n; i++)\n    num[a[i][1]]++, pos[i] = 1;\n\n  while (get(), num[Max] > x) {\n\n    num[Max] = 0;\n    vis[Max] = 1;\n\n    for (int i = 1; i <= n; i++)\n\n      if (a[i][pos[i]] == Max) {\n\n        while (vis[a[i][pos[i]]] && pos[i] <= m)\n          pos[i]++;\n\n        if (pos[i] > m)\n          return 0;\n\n        num[a[i][pos[i]]]++;\n      }\n  }\n  return 1;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (i = 1; i <= n; i++)\n\n    for (j = 1; j <= m; j++)\n\n      scanf(\"%d\", &a[i][j]);\n\n  l = 1, r = n;\n\n  while (l <= r) {\n\n    mid = (l + r) >> 1;\n\n    if (check1(mid))\n      ans = mid, r = mid - 1;\n\n    else\n      l = mid + 1;\n  }\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"b539379def2e81f66345ba90ff912180c25e053392465cea53d567b0b6209453","fast_id":"8498cf48c32569eef292700c1bd2397bf5a8811c288f876784acc8aebe9e3772","fast_time":0.0206682107,"language":"cpp","measured_fast_code_id":"8498cf48c32569eef292700c1bd2397bf5a8811c288f876784acc8aebe9e3772","measured_slow_code_id":"ab0c8191807627e5bb59371d9025dfb8368f68a0d76bc1e2ef53b63e17f91e39","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31715","problem_id":"p03839","slow_code_id":"9a369fcf2fd91fce04c80c8efb2a18e456a475ad6becd882407b56c041620b27","slow_id":"ab0c8191807627e5bb59371d9025dfb8368f68a0d76bc1e2ef53b63e17f91e39","slow_time":0.1556311397,"speedup":7.529976443485745,"stratum":"4-8","sampling_key":"78920567b6aa2c382e4d5bdc9b42d70e813c9997c381cb52fa6e26b5f86e02ac","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, K;\n\n  cin >> N >> K;\n\n  int a[100001] = {};\n\n  ll s[100002], sa[100002];\n\n  s[0] = 0;\n\n  sa[0] = 0;\n\n  rep1(i, N) {\n\n    cin >> a[i];\n\n    s[i] = s[i - 1] + a[i];\n\n    sa[i] = sa[i - 1] + max(a[i], 0);\n  }\n\n  ll kotae = 0;\n\n  for (int i = 1; i <= N - K + 1; i++) {\n\n    ll kari =\n        max(s[i + K - 1] - s[i - 1], 0ll) + sa[i - 1] + sa[N] - sa[i + K - 1];\n\n    kotae = max(kotae, kari);\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  int pn = 1;\n\n  if (ci - cn + 16 > cm) {\n\n    if ((ct = getcha()) == '-') {\n      pn = -1;\n      ct = getcha();\n    }\n\n    A = ct - '0';\n\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n    ;\n\n    return pn * A;\n\n  }\n\n  else {\n\n    if ((ct = *ci++) == '-') {\n      pn = -1;\n      ct = *ci++;\n    }\n\n    A = ct - '0';\n\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n    ;\n\n    return pn * A;\n  }\n}\n\nint main() {\n\n  int N = getint(), K = getint(), A[100000];\n\n  ll naka = 0;\n\n  ll m = 0;\n\n  ll mgoukei = 0;\n\n  rep(i, K) {\n\n    A[i] = getint();\n\n    naka += A[i];\n\n    mgoukei += max(A[i], 0);\n  }\n\n  ll kotae = max(naka, 0ll) - mgoukei;\n\n  int k = 0;\n\n  for (int i = K; i < N; i++, k++) {\n\n    if (k >= K)\n      k -= K;\n\n    naka -= A[k];\n\n    m += max(A[k], 0);\n\n    A[k] = getint();\n\n    mgoukei += max(A[k], 0);\n\n    naka += A[k];\n\n    chmax(kotae, max(naka, 0ll) + m - mgoukei);\n  }\n\n  printf(\"%lld\\n\", kotae + mgoukei);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"5b5a3d5a2c7f04d012a4958103af3da7bd8445f4c2613aecc85c1250924aaa27","fast_id":"faf18a3583c655e8efa1f472d2ba9634d3e03ddfe17894ff6c3cae4b025806ca","fast_time":0.0795379725,"language":"cpp","measured_fast_code_id":"faf18a3583c655e8efa1f472d2ba9634d3e03ddfe17894ff6c3cae4b025806ca","measured_slow_code_id":"2963007247cd323ac413396b650ed42b8f9ab006ed6259e0e58db278d844fdaa","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31724","problem_id":"p02304","slow_code_id":"8ca79db49fcd1e59c09d9eb3fe4aa754ffb3db8bf1b9831a20257331be3e9b0a","slow_id":"2963007247cd323ac413396b650ed42b8f9ab006ed6259e0e58db278d844fdaa","slow_time":0.3372963016,"speedup":4.240695242765963,"stratum":"4-8","sampling_key":"3ee4efbd48021a342b017cb7c52496a0c7c7cc35140bd1c3529b8e5007e61cf6","slow_code":"#include <cstdio>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\n#define clr(a, b) memset(a, b, sizeof(a))\n\n#define pb(a) push_back(a)\n\n#define il inline\n\n#define reg register\n\ntypedef long long ll;\n\ntypedef double db;\n\nconst int maxn = 10000;\n\nconst int minn = 200000 + 5;\n\nstruct Point\n\n{\n\n  db x, y;\n\n  Point() {}\n\n  Point(db x, db y) : x(x), y(y) {}\n};\n\nstruct Seg\n\n{\n\n  Point a, b;\n\n  int c;\n\n  Seg(Point a, Point b, int c) : a(a), b(b), c(c) {}\n\n  friend bool operator<(Seg p, Seg q) {\n\n    if (p.a.y != q.a.y)\n      return p.a.y < q.a.y;\n\n    return p.c != q.c ? p.c < q.c : p.a.x < q.a.x;\n  }\n};\n\ndb x[minn << 2];\n\nint q, lenx, ans, tree[minn << 2];\n\nvector<Seg> ve;\n\nvoid init()\n\n{\n\n  clr(tree, 0);\n\n  ve.clear();\n\n  lenx = 0;\n\n  ans = 0;\n\n  return;\n}\n\nvoid pushpu(int k, int c)\n\n{\n\n  while (k)\n\n  {\n\n    tree[k] += c;\n\n    k >>= 1;\n  }\n}\n\nvoid update(int l, int r, int nu, int c, int k)\n\n{\n\n  if (nu == l && r == nu)\n\n  {\n\n    pushpu(k, c);\n\n    return;\n  }\n\n  int mind = (l + r) / 2;\n\n  if (nu <= mind) {\n    update(l, mind, nu, c, k << 1);\n  }\n\n  if (nu > mind) {\n    update(mind + 1, r, nu, c, k << 1 | 1);\n  }\n\n  return;\n}\n\nvoid query(int l, int r, int L, int R, int k)\n\n{\n\n  if (L <= l && r <= R)\n\n  {\n\n    ans += tree[k];\n\n    return;\n  }\n\n  int mind = (l + r) / 2;\n\n  if (L <= mind) {\n    query(l, mind, L, R, k << 1);\n  }\n\n  if (R > mind) {\n    query(mind + 1, r, L, R, k << 1 | 1);\n  }\n\n  return;\n}\n\nint slove()\n\n{\n\n  sort(ve.begin(), ve.end());\n\n  sort(x, x + lenx);\n\n  int res = 0;\n\n  for (reg int i = 0; i < ve.size(); i++)\n\n  {\n\n    if (ve[i].a.x == ve[i].b.x) {\n\n      int nu = lower_bound(x, x + lenx, ve[i].a.x) - x + 1;\n\n      int c = ve[i].c > 2 ? -1 : ve[i].c;\n\n      update(1, lenx, nu, c, 1);\n\n    }\n\n    else\n\n    {\n\n      ans = 0;\n\n      int l = lower_bound(x, x + lenx, ve[i].a.x) - x + 1;\n\n      int r = lower_bound(x, x + lenx, ve[i].b.x) - x + 1;\n\n      query(1, lenx, l, r, 1);\n\n      res += ans;\n    }\n  }\n\n  return res;\n}\n\nint main()\n\n{\n\n  init();\n\n  scanf(\"%d\", &q);\n\n  Point a, b;\n\n  while (q--)\n\n  {\n\n    scanf(\"%lf%lf\", &a.x, &a.y);\n\n    scanf(\"%lf%lf\", &b.x, &b.y);\n\n    if (a.x > b.x || a.y > b.y) {\n      swap(a, b);\n    }\n\n    if (a.x != b.x)\n\n    {\n\n      x[lenx++] = a.x;\n      x[lenx++] = b.x;\n\n      ve.pb(Seg(a, b, 2));\n\n    }\n\n    else\n\n    {\n\n      x[lenx++] = a.x;\n\n      ve.pb(Seg(a, a, 1));\n\n      ve.pb(Seg(b, b, 3));\n    }\n  }\n\n  printf(\"%d\\n\", slove());\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 1e5 + 10;\n\nstruct point {\n\n  int x, y;\n\n  point() {}\n\n  point(int x, int y) : x(x), y(y) {}\n};\n\nstruct segment {\n\n  point a, b;\n\n  int c;\n\n  segment(point a, point b, int c) : a(a), b(b), c(c) {}\n\n  bool operator<(const segment &p) {\n\n    if (a.y != p.a.y)\n      return a.y < p.a.y;\n\n    return c != p.c ? c < p.c : a.x < p.a.x;\n  }\n};\n\nvector<segment> v;\n\nint x[maxn * 2];\n\nint tree[maxn << 2];\n\nvoid up(int p) { tree[p] = tree[p << 1] + tree[p << 1 | 1]; }\n\nvoid modify(int p, int l, int r, int x, int v) {\n\n  if (l == r) {\n\n    tree[p] += v;\n\n    return;\n  }\n\n  int mid = l + r >> 1;\n\n  if (x <= mid) {\n\n    modify(p << 1, l, mid, x, v);\n\n  } else {\n\n    modify(p << 1 | 1, mid + 1, r, x, v);\n  }\n\n  up(p);\n}\n\nint query(int p, int l, int r, int x, int y) {\n\n  if (x <= l && r <= y) {\n\n    return tree[p];\n  }\n\n  int mid = l + r >> 1;\n\n  int res = 0;\n\n  if (x <= mid) {\n\n    res += query(p << 1, l, mid, x, y);\n  }\n\n  if (y > mid) {\n\n    res += query(p << 1 | 1, mid + 1, r, x, y);\n  }\n\n  return res;\n}\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  int len = 1;\n\n  for (int i = 0; i < n; i++) {\n\n    point a, b;\n\n    scanf(\"%d%d%d%d\", &a.x, &a.y, &b.x, &b.y);\n\n    if (a.x != b.x) {\n\n      if (a.x > b.x)\n        swap(a, b);\n\n      x[len++] = a.x;\n\n      x[len++] = b.x;\n\n      v.push_back(segment(a, b, 2));\n\n    } else {\n\n      if (a.y > b.y)\n        swap(a, b);\n\n      x[len++] = a.x;\n\n      v.push_back(segment(a, a, 1));\n\n      v.push_back(segment(b, b, 3));\n    }\n  }\n\n  len--;\n\n  sort(x + 1, x + len + 1);\n\n  len = unique(x + 1, x + len + 1) - (x + 1);\n\n  sort(v.begin(), v.end());\n\n  int vsize = v.size();\n\n  int ans = 0;\n\n  for (int i = 0; i < vsize; i++) {\n\n    if (v[i].a.x == v[i].b.x) {\n\n      int id = lower_bound(x + 1, x + len + 1, v[i].a.x) - x;\n\n      int c = v[i].c == 3 ? -1 : 1;\n\n      modify(1, 1, len, id, c);\n\n    } else {\n\n      int id1 = lower_bound(x + 1, x + len + 1, v[i].a.x) - x;\n\n      int id2 = lower_bound(x + 1, x + len + 1, v[i].b.x) - x;\n\n      ans += query(1, 1, len, id1, id2);\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"4796e8aa8bf22a510fdcb2d4d0fc4898c92fc01130bc5aa05b40b7399f38b0de","fast_id":"2c0343b67979710779842a069f7a1c9789abccdd9bfbbf46b05ceece2397847f","fast_time":0.0665271824,"language":"cpp","measured_fast_code_id":"2c0343b67979710779842a069f7a1c9789abccdd9bfbbf46b05ceece2397847f","measured_slow_code_id":"dfaf95e12908bcedb1ba6f4cf88e818b9ff022ae475609b5adf06255958eab58","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31733","problem_id":"p03263","slow_code_id":"937b23957f9d4cb709b32fc61f459a707e50e80a50bfc8562fb9b962d1a81a97","slow_id":"dfaf95e12908bcedb1ba6f4cf88e818b9ff022ae475609b5adf06255958eab58","slow_time":0.1412158614,"speedup":2.122679126119131,"stratum":"2-4","sampling_key":"352762dc4393e6c54e5585549f50f4b6361cd25b383fa8a2f4a7d28a233f9de2","slow_code":"#include <iostream>\n\n#include <stdio.h>\n\n#include <vector>\n\n#include <map>\n\n#include <unordered_map>\n\n#include <set>\n\n#include <unordered_set>\n\n#include <stack>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <string.h>\n\n#include <string>\n\n#include <math.h>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define SORT(v) sort((v).begin(), (v).end())\n\n#define RSORT(v) sort((v).rbegin(), (v).rend())\n\n#define pb push_back\n\ntypedef pair<int, int> pii;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\nconst int mod = (int)1e9 + 7;\n\nconst int mod2 = 998244353;\n\nll exp(ll taban, ll us, ll md) {\n\n  ll carpan = taban % md;\n\n  if (carpan == 0)\n    return 0;\n\n  ll temp = us;\n\n  ll res = 1;\n\n  while (temp) {\n\n    if (temp % 2)\n      res = (res * carpan) % md;\n\n    temp /= 2;\n\n    carpan = (carpan * carpan) % md;\n  }\n\n  return res;\n}\n\nll ebob(ll a, ll b) {\n\n  if (!a)\n    return b;\n\n  return ebob(b % a, a);\n}\n\nll ekok(ll a, ll b) { return (a * b) / ebob(a, b); }\n\nll mul(ll a, ll b, ll md) { return a * b % md; }\n\nvector<ll> fact;\n\nvector<ll> inv_fact;\n\nvoid fact_init(int n) {\n\n  fact.resize(n + 5);\n\n  inv_fact.resize(n + 5);\n\n  fact[0] = inv_fact[0] = 1;\n\n  for (int i = 1; i <= n; i++) {\n\n    fact[i] = (fact[i - 1] * i) % mod;\n\n    inv_fact[i] = exp(fact[i], mod - 2, mod);\n  }\n}\n\nll komb(ll a, ll b) { return fact[a] * (inv_fact[a - b] * inv_fact[b] % mod) % mod; }\n\nconst int N = 500 + 5;\n\nint h, w;\n\nvector<vector<int>> ans;\n\nvector<vector<int>> vec(N, vector<int>(N));\n\nint main() {\n\n  ios::sync_with_stdio(false);\n  cin.tie(NULL);\n\n  cin >> h >> w;\n\n  for (int i = 1; i <= h; i++)\n    for (int j = 1; j <= w; j++) {\n\n      cin >> vec[i][j];\n    }\n\n  bool c1 = 0;\n\n  for (int i = 1; i <= h; i++) {\n\n    for (int j = (i % 2 ? 1 : w); (i % 2 ? j <= w : j >= 1); (i % 2 ? j++ : j--)) {\n\n      int x = vec[i][j];\n\n      if ((x & 1) && !c1) {\n\n        c1 = true;\n\n      }\n\n      else if (x & 1) {\n\n        c1 = false;\n      }\n\n      if (c1) {\n\n        if (i % 2) {\n\n          if (j == w && i != h) {\n\n            ans.pb({i, j, i + 1, j});\n\n          } else if (j != w) {\n\n            ans.pb({i, j, i, j + 1});\n          }\n\n        } else if (i % 2 == 0) {\n\n          if (j == 1 && i != h) {\n\n            ans.pb({i, j, i + 1, j});\n\n          }\n\n          else if (j != 1) {\n\n            ans.pb({i, j, i, j - 1});\n          }\n        }\n      }\n    }\n  }\n\n  cout << ans.size() << \"\\n\";\n\n  for (auto x : ans)\n    cout << x[0] << \" \" << x[1] << \" \" << x[2] << \" \" << x[3] << \"\\n\";\n}","fast_code":"\n\n#include <bits/stdc++.h>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#define ll long long\n\n#define pb push_back\n\n#define mp make_pair\n\n#define loop(i, a, n) for (int i = a; i <= n; ++i)\n\n#define clr(x) memset(x, 0, sizeof x)\n\n#define min3(a, b, c) min(a, min(b, c))\n\n#define max3(a, b, c) max(a, max(b, c))\n\n#define min4(a, b, c, d) min(a, min(b, min(c, d)))\n\n#define max4(a, b, c, d) max(a, max(b, max(c, d)))\n\n#define fast                                                                                       \\\n  ios::sync_with_stdio(false);                                                                     \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0);\n\n#define pii pair<int, int>\n\n#define pll pair<ll, ll>\n\n#define pli pair<ll, int>\n\n#define pil pair<int, ll>\n\n#define FF first\n\n#define SS second\n\n#define PI acos(-1.0)\n\n#define bug cout << \"ok\" << endl;\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\ntypedef tree<int, null_type, less<int>,\n\n             rb_tree_tag, tree_order_statistics_node_update>\n    anik;\n\nconst int MOD = 1e9 + 7;\n\nconst ll MX = 1e9;\n\nconst ll INF = 1e9;\n\nconst ll N = 520;\n\nll a[N][N], ans[N * N][4];\n\nmain()\n\n{\n\n  ll n, m;\n\n  cin >> n >> m;\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    for (int j = 1; j <= m; ++j)\n\n      cin >> a[i][j];\n  }\n\n  int cnt = 0, k = 0;\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    for (int j = 1; j < m; ++j)\n\n    {\n\n      if (a[i][j] % 2 == 1)\n\n      {\n\n        a[i][j + 1] += 1;\n\n        ans[k][0] = i;\n\n        ans[k][1] = j;\n\n        ans[k][2] = i;\n\n        ans[k++][3] = j + 1;\n      }\n    }\n  }\n\n  for (int i = 1; i < n; ++i)\n\n  {\n\n    if (a[i][m] % 2 == 1)\n\n    {\n\n      a[i + 1][m] += 1;\n\n      ans[k][0] = i;\n\n      ans[k][1] = m;\n\n      ans[k][2] = i + 1;\n\n      ans[k++][3] = m;\n    }\n  }\n\n  cout << k << endl;\n\n  for (int i = 0; i < k; ++i)\n\n    cout << ans[i][0] << \" \" << ans[i][1] << \" \" << ans[i][2] << \" \" << ans[i][3] << endl;\n}\n"}
{"fast_code_id":"ad3975bcbd775623efb8093e90a0eff2dbb78505f4036f41b997c712e03e2c66","fast_id":"e8b6529674a58de2d200dd86c096f52ac1e83d49dfc90e586a3adcfa6cd3718b","fast_time":0.0054736731,"language":"cpp","measured_fast_code_id":"e8b6529674a58de2d200dd86c096f52ac1e83d49dfc90e586a3adcfa6cd3718b","measured_slow_code_id":"e0999ec4323009c4bcfc3ddad964795f5f9f602ba4c2329c9e4caa9c1e1083a4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31742","problem_id":"p04024","slow_code_id":"b61378fcbce623c6715abd8b7e83ee06015a977c24b5b3bafcebf749a3fbf276","slow_id":"e0999ec4323009c4bcfc3ddad964795f5f9f602ba4c2329c9e4caa9c1e1083a4","slow_time":0.0303996779,"speedup":5.553798581796929,"stratum":"4-8","sampling_key":"4f9203b366391394bbe8e05786123e4a68e5784d3f14687a425793052faa340b","slow_code":"#define _CRT_SECURE_NO_WARNINGS\n\n#pragma comment(linker, \"/stack:16777216\")\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n#include <list>\n\n#include <iterator>\n\n#include <cassert>\n\n#include <set>\n\n#include <queue>\n\n#include <iostream>\n\n#include <sstream>\n\n#include <stack>\n\n#include <deque>\n\n#include <cmath>\n\n#include <memory.h>\n\n#include <cstdlib>\n\n#include <cstdio>\n\n#include <cctype>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <time.h>\n\n#include <complex>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); i--)\n\n#define ITER(it, a) for (typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int)a.size()\n\n#define ALL(a) a.begin(), a.end()\n\n#define PB push_back\n\n#define MP make_pair\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\n\nconst LL INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = INF * (LL)INF;\n\nconst int MOD = 1000 * 1000 * 1000 + 7;\n\ntypedef vector<VI> matr;\n\nmatr get(int n)\n\n{\n\n  return matr(n, VI(n, 0));\n}\n\nmatr mul(matr a, matr b)\n\n{\n\n  int n = SZ(a);\n\n  matr res = get(n);\n\n  FOR(i, 0, n)\n\n  {\n\n    FOR(j, 0, n)\n\n    {\n\n      FOR(k, 0, n)\n\n      {\n\n        res[i][j] = (res[i][j] + a[i][k] * (LL)b[k][j]) % MOD;\n      }\n    }\n  }\n\n  return res;\n}\n\nmatr bpow(matr a, LL b)\n\n{\n\n  matr res = get(SZ(a));\n\n  FOR(i, 0, SZ(a))\n\n  {\n\n    res[i][i] = 1;\n  }\n\n  while (b)\n\n  {\n\n    if (b & 1)\n      res = mul(res, a);\n\n    a = mul(a, a);\n\n    b /= 2;\n  }\n\n  return res;\n}\n\nconst int MAX = 1010;\n\nstring S[MAX];\n\nint main()\n\n{\n\n  int h, w;\n\n  LL n;\n\n  cin >> h >> w >> n;\n\n  int k = 0;\n\n  int hh = 0;\n\n  int v = 0;\n\n  int a = 0;\n\n  int b = 0;\n\n  FOR(i, 0, h)\n\n  {\n\n    cin >> S[i];\n  }\n\n  FOR(i, 0, h)\n\n  {\n\n    FOR(j, 0, w)\n\n    {\n\n      if (S[i][j] == '#')\n        k++;\n\n      if (j + 1 < w && S[i][j] == '#' && S[i][j + 1] == '#')\n        hh++;\n\n      if (i + 1 < h && S[i][j] == '#' && S[i + 1][j] == '#')\n        v++;\n    }\n  }\n\n  FOR(i, 0, h)\n\n  {\n\n    if (S[i][0] == '#' && S[i][w - 1] == '#')\n      a++;\n  }\n\n  FOR(j, 0, w)\n\n  {\n\n    if (S[0][j] == '#' && S[h - 1][j] == '#')\n      b++;\n  }\n\n  if (a > 0 && b > 0)\n\n  {\n\n    cout << 1 << endl;\n\n    return 0;\n  }\n\n  if (a == 0 && b == 0)\n\n  {\n\n    matr a = get(1);\n\n    a[0][0] = k;\n\n    a = bpow(a, n - 1);\n\n    cout << a[0][0] << endl;\n\n    return 0;\n  }\n\n  if (a == 0)\n\n  {\n\n    swap(a, b);\n\n    swap(hh, v);\n  }\n\n  matr A = get(2);\n\n  A[0][0] = k;\n\n  A[1][0] = hh;\n\n  A[1][1] = a;\n\n  A = bpow(A, n - 1);\n\n  int res = A[0][0] - A[1][0];\n\n  if (res < 0)\n    res += MOD;\n\n  res %= MOD;\n\n  cout << res << endl;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int MAXN = 1000;\n\nconst int MOD = int(1E9) + 7;\n\ninline int add(int x, int y) { return (x + y >= MOD ? x + y - MOD : x + y); }\n\ninline int sub(int x, int y) { return (x - y < 0 ? x - y + MOD : x - y); }\n\ninline int mul(int x, int y) { return 1LL * x * y % MOD; }\n\nint pow_mod(int b, ll p) {\n\n  int ret = 1;\n\n  for (ll i = p; i; i >>= 1, b = mul(b, b))\n\n    if (i & 1)\n      ret = mul(ret, b);\n\n  return ret;\n}\n\nstruct matrix {\n\n  int a[2][2];\n\n  friend matrix operator*(matrix A, matrix B) {\n\n    matrix C;\n\n    C.a[0][0] = add(mul(A.a[0][0], B.a[0][0]), mul(A.a[0][1], B.a[1][0]));\n\n    C.a[0][1] = add(mul(A.a[0][0], B.a[0][1]), mul(A.a[0][1], B.a[1][1]));\n\n    C.a[1][0] = add(mul(A.a[1][0], B.a[0][0]), mul(A.a[1][1], B.a[1][0]));\n\n    C.a[1][1] = add(mul(A.a[1][0], B.a[0][1]), mul(A.a[1][1], B.a[1][1]));\n\n    return C;\n  }\n};\n\nmatrix mpow(matrix A, ll p) {\n\n  matrix ret;\n  ret.a[0][0] = ret.a[1][1] = 1, ret.a[0][1] = ret.a[1][0] = 0;\n\n  for (ll i = p; i; i >>= 1, A = A * A)\n\n    if (i & 1)\n      ret = ret * A;\n\n  return ret;\n}\n\nint a, b[MAXN + 5], c[MAXN + 5], d[MAXN + 5];\n\nchar s[MAXN + 5][MAXN + 5], t[MAXN + 5][MAXN + 5];\n\nint main() {\n\n  int H, W;\n  ll K;\n  scanf(\"%d%d%lld\", &H, &W, &K);\n\n  for (int i = 0; i < H; i++)\n\n    scanf(\"%s\", s[i]);\n\n  if (K == 0) {\n\n    puts(\"1\");\n\n    return 0;\n  }\n\n  bool f1 = false, f2 = false;\n\n  for (int i = 0; i < H; i++)\n\n    if (s[i][0] == '#' && s[i][W - 1] == '#') {\n\n      f1 = true;\n\n      break;\n    }\n\n  for (int i = 0; i < W; i++)\n\n    if (s[0][i] == '#' && s[H - 1][i] == '#') {\n\n      f2 = true;\n\n      break;\n    }\n\n  if (f1 && f2)\n\n    puts(\"1\");\n\n  else if ((!f1) && (!f2)) {\n\n    int cnt = 0;\n\n    for (int i = 0; i < H; i++)\n\n      for (int j = 0; j < W; j++)\n\n        cnt += (s[i][j] == '#');\n\n    printf(\"%d\\n\", pow_mod(cnt, K - 1));\n\n  }\n\n  else {\n\n    if (f2) {\n\n      for (int i = 0; i < H; i++)\n\n        for (int j = 0; j < W; j++)\n\n          t[j][i] = s[i][j];\n\n      swap(H, W);\n\n      for (int i = 0; i < H; i++)\n\n        for (int j = 0; j < W; j++)\n\n          s[i][j] = t[i][j];\n    }\n\n    for (int i = 0; i < H; i++) {\n\n      bool flag = true;\n\n      for (int j = 0; j < W; j++)\n\n        if (s[i][j] == '.') {\n\n          flag = false;\n\n          break;\n        }\n\n      if (flag)\n        a++;\n\n      else {\n\n        int l, r;\n\n        for (int j = 0; j < W; j++)\n\n          if (s[i][j] == '.') {\n\n            l = j;\n\n            break;\n          }\n\n        for (int j = W - 1; j >= 0; j--)\n\n          if (s[i][j] == '.') {\n\n            r = j;\n\n            break;\n          }\n\n        int lst = l;\n\n        for (int j = l; j <= r; j++) {\n\n          if (s[i][j] == '.') {\n\n            if (lst != j)\n              b[j - lst]++;\n\n            lst = j + 1;\n          }\n        }\n\n        c[i] = l, d[i] = W - r - 1;\n      }\n    }\n\n    matrix A;\n\n    A.a[0][0] = mul(a, W), A.a[1][1] = a, A.a[0][1] = A.a[1][0] = 0;\n\n    for (int j = 1; j <= W; j++)\n\n      A.a[0][0] = add(A.a[0][0], mul(b[j], j)), A.a[0][1] = add(A.a[0][1], b[j]);\n\n    for (int j = 0; j < H; j++) {\n\n      if (c[j])\n        A.a[1][0] = add(A.a[1][0], c[j]), A.a[1][1] = add(A.a[1][1], 1);\n\n      if (d[j])\n        A.a[1][0] = add(A.a[1][0], d[j]), A.a[1][1] = add(A.a[1][1], 1);\n\n      if (c[j] + d[j]) {\n\n        A.a[0][0] = add(A.a[0][0], c[j] + d[j]), A.a[0][1] = add(A.a[0][1], 1);\n\n        A.a[1][0] = sub(A.a[1][0], c[j] + d[j]), A.a[1][1] = sub(A.a[1][1], 1);\n      }\n    }\n\n    A = mpow(A, K - 1);\n\n    printf(\"%d\\n\", add(A.a[0][1], A.a[1][1]));\n  }\n}"}
{"fast_code_id":"e07fb53d5a0d1ae17e3acbd9e3f3524cadd23eb54866c690f110ee7d9cfd611e","fast_id":"8817a9bf75c456bf89717e3166991d2418abd11e3c79f50568ab249d5f74ea99","fast_time":0.1039533023,"language":"cpp","measured_fast_code_id":"8817a9bf75c456bf89717e3166991d2418abd11e3c79f50568ab249d5f74ea99","measured_slow_code_id":"4e5606f6859d30981df5f9139496ddd3eb4df6c7bb57e3fea9126e9c4c56d534","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3176","problem_id":"p03103","slow_code_id":"2a7bca8a0ee02969b508d06504bd46919659286d5d4ad36e9fa67881b3d27daa","slow_id":"4e5606f6859d30981df5f9139496ddd3eb4df6c7bb57e3fea9126e9c4c56d534","slow_time":0.3613567772,"speedup":3.476145242189194,"stratum":"2-4","sampling_key":"184b01b30d4e548b089f6947bc4d379739cb219f7a1dd4896146ea5a50aa76c7","slow_code":"\n\n#ifndef _GLIBCXX_NO_ASSERT\n\n#include <cassert>\n\n#endif\n\n#include <cctype>\n\n#include <cerrno>\n\n#include <cfloat>\n\n#include <ciso646>\n\n#include <climits>\n\n#include <clocale>\n\n#include <cmath>\n\n#include <csetjmp>\n\n#include <csignal>\n\n#include <cstdarg>\n\n#include <cstddef>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <ctime>\n\n#if __cplusplus >= 201103L\n\n#include <ccomplex>\n\n#include <cfenv>\n\n#include <cinttypes>\n\n#include <cstdbool>\n\n#include <cstdint>\n\n#include <ctgmath>\n\n#include <cwchar>\n\n#include <cwctype>\n\n#endif\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <complex>\n\n#include <deque>\n\n#include <exception>\n\n#include <fstream>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <ios>\n\n#include <iosfwd>\n\n#include <iostream>\n\n#include <istream>\n\n#include <iterator>\n\n#include <limits>\n\n#include <list>\n\n#include <locale>\n\n#include <map>\n\n#include <memory>\n\n#include <new>\n\n#include <numeric>\n\n#include <ostream>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <stdexcept>\n\n#include <streambuf>\n\n#include <string>\n\n#include <typeinfo>\n\n#include <utility>\n\n#include <valarray>\n\n#include <vector>\n\n#if __cplusplus >= 201103L\n\n#include <array>\n\n#include <atomic>\n\n#include <chrono>\n\n#include <condition_variable>\n\n#include <forward_list>\n\n#include <future>\n\n#include <initializer_list>\n\n#include <mutex>\n\n#include <random>\n\n#include <ratio>\n\n#include <regex>\n\n#include <scoped_allocator>\n\n#include <system_error>\n\n#include <thread>\n\n#include <tuple>\n\n#include <typeindex>\n\n#include <type_traits>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#endif\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\n#define intt long long\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nvector<int> v[100004];\n\nbool went[100004];\n\nvoid dfs(int x) {\n\n  went[x] = true;\n\n  for (int i = 0; i < (int)v[x].size(); i++) {\n\n    if (!went[v[x][i]]) {\n\n      dfs(v[x][i]);\n    }\n  }\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\nint lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\nint fukugen(vector<int> l) {\n\n  int ans = 0;\n\n  for (int i = 0; i < (int)l.size(); i++) {\n\n    ans *= 10;\n\n    ans += l[i];\n  }\n\n  return ans;\n}\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define P pair<int, int>\n\nint n, m, ans;\n\npair<int, int> pa;\n\npriority_queue<P, vector<P>, greater<P>> q;\n\nsigned main() {\n\n  cin >> n >> m;\n\n  rep(i, n) {\n    cin >> pa.first >> pa.second;\n    q.push(pa);\n  }\n\n  while (m) {\n\n    ans += min(m, q.top().second) * q.top().first;\n\n    m -= min(m, q.top().second);\n\n    q.pop();\n  }\n\n  cout << ans << endl;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define int long long\n\n#define mod (int)((1e9) + 7)\n\n#ifdef int\n\n#define inf (int)(3e18)\n\n#else\n\n#define inf (int)(5e8)\n\n#endif\n\n#define intt long long\n\n#define itn long long\n\n#define P pair<long long, long long>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, n) for (int i = 1; i <= n; i++)\n\n#define ALL(v) v.begin(), v.end()\n\nusing namespace std;\n\ninline int modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y & 1) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % m;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ninline int gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\ninline int lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\ntemplate <class T, class U>\n\ninline bool chmax(T &lhs, const U &rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\ntemplate <class T, class U>\n\ninline bool chmin(T &lhs, const U &rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\nvoid Yes() { cout << \"Yes\" << endl; }\n\nvoid No() { cout << \"No\" << endl; }\n\nvoid YES() { cout << \"YES\" << endl; }\n\nvoid NO() { cout << \"NO\" << endl; }\n\n#define fin(i) scanf(\"%lld\", &i)\n\n#define fout(i) printf(\"%lld\", i)\n\n#define fendl printf(\"\\n\")\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\n#define vecin(v)                                                                                   \\\n  for (int i = 0; i < v.size(); i++)                                                               \\\n    scanf(\"%lld\", &v[i]);\n\n#define vecout(v)                                                                                  \\\n  {                                                                                                \\\n    for (int i = 0; i < (int)v.size(); i++)                                                        \\\n      printf(\"%lld \", v[i]);                                                                       \\\n    printf(\"\\n\");                                                                                  \\\n  }\n\ntemplate <typename T, typename U>\n\nclass SegTree {\n\nprotected:\n  unsigned int n = 1, rank = 0;\n\n  std::vector<T> node;\n\n  T nodee;\n\n  virtual T nodef(const T &, const T &) const = 0;\n\npublic:\n  SegTree(unsigned int m, T init, T nodee) : nodee(nodee) {\n\n    while (n < m) {\n\n      n *= 2;\n\n      rank++;\n    }\n\n    node.resize(2 * n);\n\n    for (unsigned int i = n; i < 2 * n; i++)\n      node[i] = init;\n  }\n\n  SegTree(const std::vector<T> &initvec, T nodee) : nodee(nodee) {\n\n    unsigned int m = initvec.size();\n\n    while (n < m) {\n\n      n *= 2;\n\n      rank++;\n    }\n\n    node.resize(2 * n);\n\n    for (unsigned int i = n; i < 2 * n; i++) {\n\n      if (i - n < m)\n        node[i] = initvec[i - n];\n    }\n  }\n\n  virtual void update(int i, U x) {\n\n    i += n;\n\n    node[i] = x;\n\n    while (i != 1) {\n\n      i >>= 1;\n\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n    }\n  }\n\n  virtual T query(int l, int r) {\n\n    l += n;\n    r += n;\n\n    int ls = nodee, rs = nodee;\n\n    while (l < r) {\n\n      if (l & 1) {\n\n        ls = nodef(ls, node[l]);\n\n        l++;\n      }\n\n      if (r & 1) {\n\n        r--;\n\n        rs = nodef(node[r], rs);\n      }\n\n      l >>= 1;\n      r >>= 1;\n    }\n\n    return nodef(ls, rs);\n  }\n\n  virtual T operator[](const int &x) { return node[n + x]; }\n\n  void fill(T x) { std::fill(all(node), x); }\n\n  void print() {\n\n    rep(i, n) std::cout << operator[](i) << \" \";\n\n    std::cout << std::endl;\n  }\n};\n\nclass RSQ : public SegTree<int, int> {\n\n  int nodef(const int &lhs, const int &rhs) { return lhs + rhs; }\n\npublic:\n  RSQ(int size, const int &def = 0) : SegTree<int, int>(size, def, 0) {}\n\n  RSQ(const std::vector<int> &initvec) : SegTree<int, int>(initvec, 0) {}\n};\n\nclass RMiQ : public SegTree<int, int> {\n\n  int nodef(const int &lhs, const int &rhs) { return std::min(lhs, rhs); }\n\npublic:\n  RMiQ(int size, const int &def = 0) : SegTree<int, int>(size, def, 0) {}\n\n  RMiQ(const std::vector<int> &initvec) : SegTree<int, int>(initvec, 0) {}\n};\n\nclass RMaQ : public SegTree<int, int> {\n\n  int nodef(const int &lhs, const int &rhs) { return std::max(lhs, rhs); }\n\npublic:\n  RMaQ(int size, const int &def = 0) : SegTree<int, int>(size, def, 0) {}\n\n  RMaQ(const std::vector<int> &initvec) : SegTree<int, int>(initvec, 0) {}\n};\n\ntemplate <typename T, typename U>\n\nclass IntervalSegTree : public SegTree<T, U> {\n\nprotected:\n  using SegTree<T, U>::n;\n\n  using SegTree<T, U>::rank;\n\n  using SegTree<T, U>::node;\n\n  using SegTree<T, U>::nodef;\n\n  using SegTree<T, U>::nodee;\n\n  std::vector<U> lazy;\n\n  std::vector<bool> lazyflag;\n\n  std::vector<int> width;\n\n  virtual void lazyf(U &, const U &) = 0;\n\n  virtual void updf(T &, const U &, const unsigned int &) = 0;\n\n  void eval(int k) {\n\n    for (int i = rank; i > 0; i--) {\n\n      int nk = k >> i;\n\n      if (lazyflag[nk]) {\n\n        updf(node[2 * nk], lazy[nk], width[2 * nk]);\n\n        updf(node[2 * nk + 1], lazy[nk], width[2 * nk + 1]);\n\n        if (lazyflag[2 * nk])\n          lazyf(lazy[2 * nk], lazy[nk]);\n\n        else\n          lazy[2 * nk] = lazy[nk];\n\n        if (lazyflag[2 * nk + 1])\n          lazyf(lazy[2 * nk + 1], lazy[nk]);\n\n        else\n          lazy[2 * nk + 1] = lazy[nk];\n\n        lazyflag[2 * nk] = lazyflag[2 * nk + 1] = true;\n\n        lazyflag[nk] = false;\n      }\n    }\n  }\n\npublic:\n  IntervalSegTree(unsigned int m, T init, T nodee) : SegTree<T, U>(m, init, nodee) {\n\n    lazy.resize(2 * n);\n    lazyflag.resize(2 * n);\n    width.resize(2 * n);\n\n    width[1] = n;\n\n    for (unsigned int i = 2; i < 2 * n; i++) {\n\n      width[i] = width[i >> 1] >> 1;\n    }\n  }\n\n  IntervalSegTree(T nodee, const std::vector<T> &initvec) : SegTree<T, U>(initvec, nodee) {\n\n    lazy.resize(2 * n);\n    lazyflag.resize(2 * n);\n    width.resize(2 * n);\n\n    width[1] = n;\n\n    for (unsigned int i = 2; i < 2 * n; i++) {\n\n      width[i] = width[i >> 1] >> 1;\n    }\n  }\n\n  void update(int i, U x) {\n\n    i += n;\n\n    eval(i);\n\n    updf(node[i], x, width[i]);\n\n    if (lazyflag[i])\n      lazyf(lazy[i], x);\n\n    else {\n\n      lazyflag[i] = true;\n\n      lazy[i] = x;\n    }\n\n    while (i /= 2)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n\n  void update(int l, int r, U x) {\n\n    l += n;\n    r += n;\n\n    int nl = l, nr = r;\n\n    while (!(nl & 1))\n      nl >>= 1;\n\n    while (!(nr & 1))\n      nr >>= 1;\n\n    nr--;\n\n    eval(nl);\n    eval(nr);\n\n    while (l < r) {\n\n      if (l & 1) {\n\n        updf(node[l], x, width[l]);\n\n        if (lazyflag[l])\n          lazyf(lazy[l], x);\n\n        else {\n\n          lazyflag[l] = true;\n\n          lazy[l] = x;\n        }\n\n        l++;\n      }\n\n      if (r & 1) {\n\n        r--;\n\n        updf(node[r], x, width[r]);\n\n        if (lazyflag[r])\n          lazyf(lazy[r], x);\n\n        else {\n\n          lazyflag[r] = true;\n\n          lazy[r] = x;\n        }\n      }\n\n      l >>= 1;\n      r >>= 1;\n    }\n\n    while (nl >>= 1)\n      node[nl] = nodef(node[2 * nl], node[2 * nl + 1]);\n\n    while (nr >>= 1)\n      node[nr] = nodef(node[2 * nr], node[2 * nr + 1]);\n  }\n\n  T query(int l, int r) {\n\n    l += n;\n    r += n;\n\n    eval(l);\n    eval(r - 1);\n\n    int ls = nodee, rs = nodee;\n\n    while (l < r) {\n\n      if (l & 1) {\n\n        ls = nodef(ls, node[l]);\n\n        l++;\n      }\n\n      if (r & 1) {\n\n        r--;\n\n        rs = nodef(node[r], rs);\n      }\n\n      l >>= 1;\n      r >>= 1;\n    }\n\n    return nodef(ls, rs);\n  }\n\n  T operator[](const int &x) {\n\n    eval(n + x);\n\n    return node[n + x];\n  }\n\n  T queryForAll() { return node[1]; }\n};\n\nclass RAQRSQ : public IntervalSegTree<int, int> {\n\n  int nodef(const int &a, const int &b) const { return a + b; }\n\n  void lazyf(int &a, const int &b) { a += b; }\n\n  void updf(int &a, const int &b, const unsigned int &width) { a += width * b; }\n\npublic:\n  RAQRSQ(int size, const int &def = 0) : IntervalSegTree<int, int>(size, def, 0) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n\n  RAQRSQ(const std::vector<int> &initvec) : IntervalSegTree<int, int>((int)0, initvec) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n};\n\nclass RAQRMiQ : public IntervalSegTree<int, int> {\n\n  int nodef(const int &a, const int &b) const { return std::min(a, b); }\n\n  void lazyf(int &a, const int &b) { a += b; }\n\n  void updf(int &a, const int &b, const unsigned int &width) { a += b; }\n\npublic:\n  RAQRMiQ(int size, const int &def = 0) : IntervalSegTree<int, int>(size, def, inf) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n\n  RAQRMiQ(const std::vector<int> &initvec) : IntervalSegTree<int, int>(inf, initvec) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n};\n\nclass RAQRMaQ : public IntervalSegTree<int, int> {\n\n  int nodef(const int &a, const int &b) const { return std::max(a, b); }\n\n  void lazyf(int &a, const int &b) { a += b; }\n\n  void updf(int &a, const int &b, const unsigned int &width) { a += b; }\n\npublic:\n  RAQRMaQ(unsigned int size, const int &def = 0) : IntervalSegTree<int, int>(size, def, -inf) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n\n  RAQRMaQ(const std::vector<int> &initvec) : IntervalSegTree<int, int>(-inf, initvec) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n};\n\nclass RUQRSQ : public IntervalSegTree<int, int> {\n\n  int nodef(const int &a, const int &b) const { return a + b; }\n\n  void lazyf(int &a, const int &b) { a = b; }\n\n  void updf(int &a, const int &b, const unsigned int &width) { a = width * b; }\n\npublic:\n  RUQRSQ(int size, const int &def = 0) : IntervalSegTree<int, int>(size, def, 0) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n\n  RUQRSQ(const std::vector<int> &initvec) : IntervalSegTree<int, int>((int)0, initvec) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n};\n\nclass RUQRMiQ : public IntervalSegTree<int, int> {\n\n  int nodef(const int &a, const int &b) const { return std::min(a, b); }\n\n  void lazyf(int &a, const int &b) { a = b; }\n\n  void updf(int &a, const int &b, const unsigned int &width) { a = b; }\n\npublic:\n  RUQRMiQ(int size, const int &def = 0) : IntervalSegTree<int, int>(size, def, inf) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n\n  RUQRMiQ(const std::vector<int> &initvec) : IntervalSegTree<int, int>(inf, initvec) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n};\n\nclass RUQRMaQ : public IntervalSegTree<int, int> {\n\n  int nodef(const int &a, const int &b) const { return std::max(a, b); }\n\n  void lazyf(int &a, const int &b) { a = b; }\n\n  void updf(int &a, const int &b, const unsigned int &width) { a = b; }\n\npublic:\n  RUQRMaQ(int size, const int &def = 0) : IntervalSegTree<int, int>(size, def, -inf) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n\n  RUQRMaQ(const std::vector<int> &initvec) : IntervalSegTree<int, int>(-inf, initvec) {\n\n    for (int i = n - 1; i > 0; i--)\n      node[i] = nodef(node[2 * i], node[2 * i + 1]);\n  }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\n  vector<int> ookisa;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    ookisa = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n\n      ookisa[i] = 1;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n      ookisa[y] += ookisa[x];\n\n      ookisa[x] = 0;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      ookisa[x] += ookisa[y];\n\n      ookisa[y] = 0;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  int size(int i) {\n\n    i = find(i);\n\n    return ookisa[i];\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\nint perm[1000005];\n\nvoid init_perm() {\n\n  perm[0] = 1;\n\n  REP(i, 1000000) { perm[i] = perm[i - 1] * i % mod; }\n}\n\nint nCk(int x, int y) {\n\n  return perm[x] * modpow(perm[x - y], mod - 2) % mod * modpow(perm[y], mod - 2) % mod;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\ninline string stringmax(string &x, string &y) {\n\n  if (x.size() > y.size()) {\n\n    return x;\n  }\n\n  if (x.size() < y.size()) {\n\n    return y;\n  }\n\n  rep(i, x.size()) {\n\n    if (x[i] > y[i]) {\n\n      return x;\n    }\n\n    if (x[i] < y[i]) {\n\n      return y;\n    }\n  }\n\n  return x;\n}\n\n#define endl \"\\n\"\n\n#define printd cout << fixed << setprecision(10)\n\nint n, m, a[100004], b[100004], ans;\n\nvector<P> v;\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  std::cin.tie(nullptr);\n\n  cin >> n >> m;\n\n  rep(i, n) {\n\n    cin >> a[i] >> b[i];\n\n    v.emplace_back(a[i], b[i]);\n  }\n\n  sort(ALL(v), greater<P>());\n\n  while (m) {\n\n    int s = min(m, v.back().second);\n\n    m -= s;\n\n    ans += s * v.back().first;\n\n    v.pop_back();\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"d5828b1082656028cb5e0df3eaea08f7a1b2871a55fd860f7c7f9b585f920d56","fast_id":"e715f67220adfb308fe4334b1233f2ba04c9bd1269377bf609e8297ea7da529e","fast_time":0.0010070589,"language":"cpp","measured_fast_code_id":"e715f67220adfb308fe4334b1233f2ba04c9bd1269377bf609e8297ea7da529e","measured_slow_code_id":"a391b9474c70a34073af587f0d32318bf53fe51d9adb59f64b9e999e1f4fdbd7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31760","problem_id":"p03764","slow_code_id":"ba502c6d70f6b77ffa0c3d1287a8f83e192b9fb4602a468d9263b2d11091631d","slow_id":"a391b9474c70a34073af587f0d32318bf53fe51d9adb59f64b9e999e1f4fdbd7","slow_time":0.0125369218,"speedup":12.449045234593527,"stratum":"8+","sampling_key":"4d4b8ea3596c0cd658a76e475eaa0c1a357595f80106e588a8ee82c0e0138891","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define pb push_back\n\n#define pii pair<int, int>\n\nmap<pii, int> m;\n\nvector<int> adjb[200005], adjr[200005];\n\n#define MOD 1000000007\n\nint main()\n\n{\n\n  ll n, m, i, ANS = 0, ans = 0, ans2 = 0;\n\n  cin >> n >> m;\n\n  ll ara[n], arb[m];\n\n  for (i = 0; i < n; i++)\n    cin >> ara[i];\n\n  for (i = 0; i < m; i++)\n    cin >> arb[i];\n\n  ll mul = -n + 1;\n\n  for (i = 0; i < n; i++) {\n\n    ara[i] = (ara[i] * mul) % MOD;\n\n    mul += 2;\n  }\n\n  mul = -m + 1;\n\n  for (i = 0; i < m; i++) {\n\n    arb[i] = (arb[i] * mul) % MOD;\n\n    mul += 2;\n  }\n\n  for (i = 0; i < n; i++)\n    ans = (ans + ara[i]) % MOD;\n\n  for (i = 0; i < m; i++)\n    ANS = (ANS + (arb[i] * ans) % MOD) % MOD;\n\n  cout << ANS;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\nusing namespace std;\n\nconst int MAXN = 1e5 + 7;\n\nconst int mod = 1e9 + 7;\n\nll x[MAXN], y[MAXN];\n\ninline ll add(ll x, ll y) { return (x + y) % mod; }\n\ninline ll mul(ll x, ll y) { return (x * y) % mod; }\n\nint main()\n\n{\n\n  int n, m;\n  scanf(\"%d%d\", &n, &m);\n\n  ll sum = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%lld\", &x[i]);\n\n    sum = add(sum, mul(x[i] - x[i - 1], mul(i - 1, n - i + 1)));\n  }\n\n  ll ans = 0;\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    scanf(\"%lld\", &y[i]);\n\n    ans = add(ans, mul(sum, mul(y[i] - y[i - 1], mul(i - 1, m - i + 1))));\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"a3f22598afa0ad2217fa9f461dc9043eda8e1fd9c1387c5d57e78c2075d0294f","fast_id":"984f3dad0926067fbc4fa6f0468886e82372f9f11491bcb17f72fd65b93993b7","fast_time":0.0087966247,"language":"cpp","measured_fast_code_id":"984f3dad0926067fbc4fa6f0468886e82372f9f11491bcb17f72fd65b93993b7","measured_slow_code_id":"d45844c77d775bf259f94740bc6b417939ccede37f5544728142d54833837161","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31766","problem_id":"p03281","slow_code_id":"c801cb29b647d62b8c519c3efbb4c9c647baae1ae7c0f939a696bbf6662cdf2c","slow_id":"d45844c77d775bf259f94740bc6b417939ccede37f5544728142d54833837161","slow_time":0.0485785432,"speedup":5.5224071569178115,"stratum":"4-8","sampling_key":"4708c4b3534df60a92f526b93cc7e9bd576f01199e7c773f62a906b9ce58a972","slow_code":"#include <iostream>\n\nusing namespace std;\n\ntypedef long long LL;\n\n#define F(i) for (int i = 0; i < n; i++)\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  int r = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    int c = 0;\n\n    for (int j = 1; j <= i; j++)\n      if (i % j == 0)\n        c++;\n\n    if (i % 2 == 1 && c == 8)\n      r++;\n  }\n\n  cout << r;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#define N 100005\n\n#define P pair<int, int>\n\n#define int long long\n\ninline int read() {\n\n  int x = 0;\n  char ch = getchar();\n\n  for (; ch < 48 || ch > 57; ch = getchar())\n    ;\n\n  for (; ch > 47 && ch < 58; ch = getchar())\n\n    x = (x << 1) + (x << 3) + (ch ^ 48);\n  return x;\n}\n\nusing namespace std;\n\nsigned main()\n\n{\n\n  int n = read();\n\n  if (n >= 195)\n    puts(\"5\");\n  else\n\n      if (n >= 189)\n    puts(\"4\");\n  else\n\n      if (n >= 165)\n    puts(\"3\");\n  else\n\n      if (n >= 135)\n    puts(\"2\");\n  else\n\n      if (n >= 105)\n    puts(\"1\");\n  else\n\n    puts(\"0\");\n\n  return 0;\n}"}
{"fast_code_id":"826da05ba75764d023ea152b8248d6af108b9c20ece786e3b760f6431235979d","fast_id":"e831fb10a60de2a109b957488b7854981940d5a82385f270e48bcc0c4cb380cf","fast_time":0.0215908035,"language":"cpp","measured_fast_code_id":"e831fb10a60de2a109b957488b7854981940d5a82385f270e48bcc0c4cb380cf","measured_slow_code_id":"f8b819874416f3d8b62fdfef3d0b656aa711cad741240ceb11da69d945707352","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3177","problem_id":"p02467","slow_code_id":"94ad6a9b606e1e6d5b96340bda18faa02aaee84ece061d367ea1c516e82f6576","slow_id":"f8b819874416f3d8b62fdfef3d0b656aa711cad741240ceb11da69d945707352","slow_time":0.1036570198,"speedup":4.800980185846257,"stratum":"4-8","sampling_key":"678da7bc98f65419ffc2bb981da173f9cb54420c8a38d4ded07ffa7e8c5b0b28","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nvoid p(int x)\n\n{\n\n  int i, j;\n\n  for (i = 2; i <= 1000000; i++)\n\n  {\n\n    if (x == 1) {\n      printf(\"\\n\");\n      return;\n    }\n\n    while (x % i == 0)\n\n    {\n\n      printf(\" %d\", i);\n\n      x = x / i;\n    }\n  }\n\n  printf(\" %d\\n\", x);\n}\n\nint main()\n\n{\n\n  int x;\n\n  scanf(\"%d\", &x);\n\n  printf(\"%d:\", x);\n\n  p(x);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\nint prime(int num)\n\n{\n\n  if (num == 1)\n\n  {\n\n    return 0;\n  }\n\n  int tmp = sqrt(num) + 1;\n\n  for (int i = 2; i < tmp; i++)\n\n  {\n\n    if (num % i == 0)\n\n    {\n\n      return 0;\n    }\n  }\n\n  return 1;\n}\n\nint main()\n\n{\n\n  int n, i, j, k;\n\n  scanf(\"%d\", &n);\n\n  printf(\"%d:\", n);\n\n  if (prime(n))\n\n  {\n\n    printf(\" %d\\n\", n);\n\n    return 0;\n  }\n\n  for (i = 2; n != 1;)\n\n  {\n\n    if (n % i != 0)\n\n    {\n\n      i++;\n\n    }\n\n    else\n\n    {\n\n      printf(\" %d\", i);\n\n      n /= i;\n    }\n  }\n\n  printf(\"\\n\");\n}\n"}
{"fast_code_id":"aee8f91b3b198b929684075a2051031fa8f05cf5448cf463a6d57ee32b4ad095","fast_id":"a7857426e5f05042c7ecc156694d629360969f2aa920bc15c7cb7baed32e8c0d","fast_time":0.050256891,"language":"cpp","measured_fast_code_id":"a7857426e5f05042c7ecc156694d629360969f2aa920bc15c7cb7baed32e8c0d","measured_slow_code_id":"c725cef419ac8160db1f0be395601a8803777436bb4f4d9abdc4cb637c5c852a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31777","problem_id":"p03239","slow_code_id":"0e1b6b9d270d70521d36806afd9ba87c9aad45b29900d949cff7c227d70b1513","slow_id":"c725cef419ac8160db1f0be395601a8803777436bb4f4d9abdc4cb637c5c852a","slow_time":0.4794044367,"speedup":9.53907866485414,"stratum":"8+","sampling_key":"f4cb9b1fd04dfbca91d7e054bf49a551f8e5585d14196f6c0785b66dc500c44d","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define LL long long\n\n#define ll long long\n\n#define SL(n) scanf(\"%lld\", &n)\n\n#define LF double\n\n#define SF(n) scanf(\"%lf\", &n)\n\n#define pb push_back\n\n#define mp make_pair\n\n#define ON(n, i) (n | (1LL << i))\n\n#define OFF(n, i) (n & (~(1LL << i)))\n\n#define CHK(n, i) (n & (1LL << i))\n\n#define ff first\n\n#define ss second\n\n#define SET(arr) memset(arr, -1, sizeof arr)\n\n#define RESET(arr) memset(arr, 0, sizeof arr)\n\n#define srt(v) sort(v.begin(), v.end())\n\n#define uniq(v) v.resize(distance(v.begin(), unique(v.begin(), v.end())))\n\n#define found(s, d) (s.find(d) != s.end())\n\n#define FOR(i, s, e) for (LL i = s; i <= e; i++)\n\n#define RFOR(i, e, s) for (LL i = e; i >= s; i--)\n\n#define FILEIN freopen(\"in.txt\", \"r\", stdin)\n\n#define FILEOUT freopen(\"WA.txt\", \"w\", stdout)\n\n#define DEBUG(x) cerr << #x << \" = \" << x << endl\n\n#define PRINTALL(v)                                                            \\\n  {                                                                            \\\n    cerr << endl << \"Printing: \" << #v << endl;                                \\\n    for (LL i = 0; i < v.size(); i++)                                          \\\n      DEBUG(v[i]);                                                             \\\n    cerr << endl;                                                              \\\n  }\n\nusing namespace std;\n\nconst LL inf = 1e9;\n\nconst LL lim = 1010;\n\nLL dp[lim][lim];\n\nLL c[lim], t[lim];\n\nLL N, T;\n\nLL F(LL pos, LL rem) {\n\n  if (rem < 0)\n    return inf;\n\n  if (pos == 0) {\n\n    if (rem == T)\n      return inf;\n\n    else\n      return 0;\n  }\n\n  LL &ret = dp[pos][rem];\n\n  if (ret != -1)\n    return ret;\n\n  ret = min(F(pos - 1, rem), c[pos] + F(pos - 1, rem - t[pos]));\n\n  return ret;\n}\n\nint main() {\n\n  SET(dp);\n\n  SL(N);\n  SL(T);\n\n  FOR(i, 1, N) SL(c[i]), SL(t[i]);\n\n  LL ans = F(N, T);\n\n  if (ans >= inf)\n    cout << \"TLE\" << endl;\n\n  else\n    cout << ans << endl;\n\n  return 0;\n}","fast_code":"\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <string>\n\n#include <stack>\n\n#include <map>\n\nusing namespace std;\n\nint main() {\n\n  int N;\n\n  int T;\n\n  cin >> N;\n\n  cin >> T;\n\n  vector<int> primero;\n\n  vector<int> segundo;\n\n  for (int i = 0; i < N; i++) {\n\n    int costo, tiempo;\n\n    cin >> costo;\n    cin >> tiempo;\n\n    primero.push_back(costo);\n\n    segundo.push_back(tiempo);\n  }\n\n  vector<int> elegido1;\n\n  vector<int> elegido2;\n\n  for (int i = 0; i < N; i++) {\n\n    if (segundo[i] <= T) {\n\n      elegido1.push_back(primero[i]);\n\n      elegido2.push_back(segundo[i]);\n    }\n  }\n\n  if (elegido1.empty()) {\n\n    cout << \"TLE\" << endl;\n\n    return 0;\n  }\n\n  int min =\n      std::min_element(elegido1.begin(), elegido1.end()) - elegido1.begin();\n\n  cout << elegido1[min];\n\n  return 0;\n}\n"}
{"fast_code_id":"2f48f214b28d367d1f968de071cbe5ce21b0ce5430a7ba0284993975e512258f","fast_id":"b1b01ec9afb73f537f49f8935b50019ddfec0080f14fff8e06b1f702365267ff","fast_time":0.0903183058,"language":"cpp","measured_fast_code_id":"b1b01ec9afb73f537f49f8935b50019ddfec0080f14fff8e06b1f702365267ff","measured_slow_code_id":"fd29335932f5bb5fc46858d14b178d02b60c6e03a2ab91a78cd5721cc9eaa69c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31781","problem_id":"p02623","slow_code_id":"265f7cb75b8a2965f791ba07da611042794903a742eacbcbc9c9dfa648ea360c","slow_id":"fd29335932f5bb5fc46858d14b178d02b60c6e03a2ab91a78cd5721cc9eaa69c","slow_time":0.3890694216,"speedup":4.307758190920362,"stratum":"4-8","sampling_key":"31e34315df25ba195eea23e19fc08cd673166846e75a6c1feb7c118025331578","slow_code":"\n\n#include <iostream>\n\nint main()\n\n{\n\n  using namespace std;\n\n  int n, m, k, f = 0, books = 0, ans = 0, f2 = 0;\n\n  long long int ab[2][200000], prefixs_sum[2][200001] = {{0}};\n\n  cin >> n >> m >> k;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> ab[0][i];\n\n    prefixs_sum[0][i + 1] += (ab[0][i] + prefixs_sum[0][i]);\n\n    if (prefixs_sum[0][i + 1] > k && f2 == 0) {\n\n      f = i;\n\n      f2 = 1;\n    }\n  }\n\n  if (prefixs_sum[0][n] <= k) {\n\n    f = n;\n  }\n\n  books = f;\n\n  ans = f;\n\n  for (int i = 0; i < m; i++) {\n\n    cin >> ab[1][i];\n\n    prefixs_sum[1][i + 1] += (ab[1][i] + prefixs_sum[1][i]);\n  }\n\n  for (int i = f, j = 1; j <= m;) {\n\n    if (prefixs_sum[1][j] > k) {\n\n      break;\n    }\n\n    if (k - prefixs_sum[0][i] >= prefixs_sum[1][j]) {\n\n      j++;\n\n      books++;\n\n    } else if (i > 0 && k - prefixs_sum[0][i] < prefixs_sum[1][j]) {\n\n      i--;\n\n      books--;\n    }\n\n    ans = max(ans, books);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <set>\n\n#include <string>\n\n#include <vector>\n\n#include <queue>\n\n#include <deque>\n\n#include <sstream>\n\n#include <map>\n\nusing namespace std;\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  cout.tie(NULL);\n\n  int n, m;\n  long long k;\n  cin >> n >> m >> k;\n\n  vector<long long> a(n);\n\n  vector<long long> b(m);\n\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n\n  for (int i = 0; i < m; i++)\n    cin >> b[i];\n\n  int out = 0;\n\n  long long sum_sofar = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    if (sum_sofar + a[i] <= k) {\n\n      sum_sofar += a[i];\n\n      out++;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  int low = out - 1;\n\n  int max_out = out;\n\n  for (int j = 0; j < m; j++) {\n\n    if (sum_sofar + b[j] <= k) {\n\n      sum_sofar += b[j];\n\n      out++;\n\n      max_out = max(out, max_out);\n\n    }\n\n    else {\n\n      while (low >= 0 && sum_sofar + b[j] > k) {\n\n        sum_sofar -= a[low];\n\n        low--;\n\n        out--;\n      }\n\n      if (sum_sofar + b[j] <= k) {\n\n        sum_sofar += b[j];\n\n        out++;\n\n        max_out = max(out, max_out);\n\n      } else {\n\n        break;\n      }\n    }\n  }\n\n  cout << max_out;\n}"}
{"fast_code_id":"abbc89e0b1d5abc3f36b2a145f53ffc3a1a3a9faedb16356363e52cb7a75999b","fast_id":"d080e174ac8c2b54b35d3d35d27ea529abcb2e552774db84d5c851dfbe7c4ba5","fast_time":0.0038918508,"language":"cpp","measured_fast_code_id":"d080e174ac8c2b54b35d3d35d27ea529abcb2e552774db84d5c851dfbe7c4ba5","measured_slow_code_id":"9e36bdd19e108114b3c289c9d925e143d9cee128d2e2b1b146ecd512302d9e3d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31799","problem_id":"p03843","slow_code_id":"3ea4a3e7c32b4a899b9b0052a058c28acd2a01808a7b058c59b8a5745da8bed9","slow_id":"9e36bdd19e108114b3c289c9d925e143d9cee128d2e2b1b146ecd512302d9e3d","slow_time":0.1320925171,"speedup":33.94079677977378,"stratum":"8+","sampling_key":"4700461a233a5f1238023ed4f2580f2c5ac8d6ef4145376976fc82ff7faca694","slow_code":"\n\n#include <iostream>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <vector>\n\n#include <list>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <algorithm>\n\n#include <iterator>\n\n#include <bitset>\n\n#include <ctime>\n\n#include <fstream>\n\n#include <complex>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define RFOR(i, b, a) for (int i = (b) - 1; i >= (a); i--)\n\n#define ITER(it, a)                                                            \\\n  for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int)a.size()\n\n#define ALL(a) a.begin(), a.end()\n\n#define PB push_back\n\n#define MP make_pair\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\n\nconst int INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = 2 * INF * (LL)INF;\n\nconst int MAX = 200 * 1000 + 47;\n\nconst int MOD = INF;\n\nVI G[MAX];\n\nchar A[MAX];\n\nint S[MAX];\n\nint D[MAX];\n\nLL ans = 0;\n\nvoid dfs(int v, int p = -1)\n\n{\n\n  S[v] = (A[v] == '1');\n\n  D[v] = 0;\n\n  FOR(i, 0, SZ(G[v]))\n\n  {\n\n    int to = G[v][i];\n\n    if (to == p)\n      continue;\n\n    dfs(to, v);\n\n    S[v] += S[to];\n\n    D[v] = max(D[v], D[to] + 1);\n  }\n}\n\nvoid DFS(int v, int p = -1, int x = 0)\n\n{\n\n  int mn = INF;\n\n  int mx = max(x, 0), mx2 = 0;\n\n  if (A[v] == '1')\n    mn = 0;\n\n  if (S[0] != S[v])\n    mn = min(x, mn);\n\n  FOR(i, 0, SZ(G[v]))\n\n  {\n\n    int to = G[v][i];\n\n    if (to == p)\n      continue;\n\n    if (D[to] + 1 > mx)\n\n      mx2 = mx, mx = D[to] + 1;\n\n    else\n      mx2 = max(mx2, D[to] + 1);\n\n    if (S[to] != 0)\n      mn = min(mn, D[to] + 1);\n  }\n\n  ans += max(0, min(mx - 1, mx2 + 1) - mn + 1);\n\n  FOR(i, 0, SZ(G[v]))\n\n  {\n\n    int to = G[v][i];\n\n    if (to == p)\n      continue;\n\n    if (D[to] + 1 == mx)\n\n      DFS(to, v, mx2 + 1);\n\n    else\n\n      DFS(to, v, mx + 1);\n  }\n}\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  FOR(i, 0, n - 1)\n\n  {\n\n    int x, y;\n\n    scanf(\"%d%d\", &x, &y);\n\n    --x, --y;\n\n    G[x].PB(y);\n\n    G[y].PB(x);\n  }\n\n  scanf(\"%s\", A);\n\n  dfs(0);\n\n  DFS(0);\n\n  ++ans;\n\n  printf(\"%lld\\n\", ans);\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define maxn 200005\n\n#define INF 2147483640\n\n#define LL long long\n\nusing namespace std;\n\nint n, sum, l[maxn], r[maxn], mx[maxn], sx[maxn], siz[maxn];\n\nLL ans;\n\nchar s[maxn];\n\nstruct node {\n  int v;\n  node *nxt;\n} edge[maxn * 2], *head[maxn], *ncnt;\n\nvoid addedge(int u, int v)\n\n{\n\n  ncnt++;\n\n  ncnt->v = v, ncnt->nxt = head[u];\n\n  head[u] = ncnt;\n}\n\nvoid dfs1(int u, int fa)\n\n{\n\n  siz[u] = s[u] - '0';\n\n  for (node *p = head[u]; p; p = p->nxt)\n\n  {\n\n    int v = p->v;\n\n    if (v == fa)\n      continue;\n\n    dfs1(v, u);\n\n    siz[u] += siz[v];\n\n    if (mx[v] + 1 > mx[u])\n      sx[u] = mx[u], mx[u] = mx[v] + 1;\n\n    else if (mx[v] + 1 > sx[u])\n      sx[u] = mx[v] + 1;\n  }\n}\n\nvoid dfs2(int u, int fa, int len)\n\n{\n\n  r[u] = len > mx[u] ? mx[u] : max(len, sx[u]);\n\n  l[u] = s[u] - '0' ? 0 : (sum - siz[u] ? len : INF);\n\n  if (fa)\n\n  {\n\n    if (len - 1 == mx[u])\n      ans++;\n\n    else if (len - 1 < mx[u])\n      ans += siz[u] < sum;\n\n    else\n      ans += siz[u] > 0;\n  }\n\n  for (node *p = head[u]; p; p = p->nxt)\n\n  {\n\n    int v = p->v;\n\n    if (v == fa)\n      continue;\n\n    if (siz[v])\n      l[u] = min(l[u], mx[v] + 1);\n\n    if (mx[u] == mx[v] + 1)\n      dfs2(v, u, max(len, sx[u]) + 1);\n\n    else\n      dfs2(v, u, max(len, mx[u]) + 1);\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  ncnt = &edge[0];\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    addedge(u, v);\n    addedge(v, u);\n  }\n\n  scanf(\"%s\", s + 1);\n\n  for (int i = 1; i <= n; i++)\n    sum += s[i] - '0';\n\n  dfs1(1, 0);\n  dfs2(1, 0, 0);\n\n  for (int i = 1; i <= n; i++)\n\n    if (l[i] <= r[i])\n      ans += 1ll * (r[i] - l[i] + 1);\n\n  printf(\"%lld\\n\", ans);\n}\n"}
{"fast_code_id":"6a6dfa7cae711a15df2fd0abdd500b5c66aac51ab55dfd1f5f66dd40f8bd24ef","fast_id":"a014c491a79058f4749998e9c5ab11821a423a3c0e30d16f4b72fad751e61d1f","fast_time":0.0382201128,"language":"cpp","measured_fast_code_id":"a014c491a79058f4749998e9c5ab11821a423a3c0e30d16f4b72fad751e61d1f","measured_slow_code_id":"5fabaee2d0ea65afee691c8a764b8683be397c0a5e0dcba9fc5bcd212c0c0683","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31809","problem_id":"p00265","slow_code_id":"25618e8feb7dca06c4328e0add01f84b4b204d4b35a5bbc70a7fb269422401e3","slow_id":"5fabaee2d0ea65afee691c8a764b8683be397c0a5e0dcba9fc5bcd212c0c0683","slow_time":0.0836609651,"speedup":2.188925122690899,"stratum":"2-4","sampling_key":"779781d852db67cbac9fb9547e4bcff0f99b805820a14bd637a479bdb8f91cbc","slow_code":"#include <iostream>\n\n#define C 300000\n\nusing namespace std;\n\nint main() {\n\n  int n, q;\n\n  int c[300000], query[100000];\n\n  bool has_c[C + 1];\n\n  cin >> n >> q;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> c[i];\n  }\n\n  for (int i = 0; i < q; i++) {\n\n    cin >> query[i];\n  }\n\n  for (int i = 0; i <= C; i++) {\n\n    has_c[i] = false;\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    has_c[c[i]] = true;\n  }\n\n  for (int i = 0; i < q; i++) {\n\n    int max_r = -1;\n\n    for (int r = query[i] - 1; r >= 0; r--) {\n\n      for (int k = 0; true; k++) {\n\n        int x = k * query[i] + r;\n\n        if (x > C) {\n\n          break;\n        }\n\n        if (has_c[x]) {\n\n          max_r = max(r, max_r);\n\n          break;\n        }\n      }\n\n      if (max_r >= 0) {\n\n        break;\n      }\n    }\n\n    cout << max_r << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define C 300000\n\nusing namespace std;\n\nint main() {\n\n  int n, q;\n\n  int c[300000], query[100000];\n\n  bool has_c[C + 1];\n\n  scanf(\"%d%d\", &n, &q);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d\", &c[i]);\n  }\n\n  for (int i = 0; i < q; i++) {\n\n    scanf(\"%d\", &query[i]);\n  }\n\n  for (int i = 0; i <= C; i++) {\n\n    has_c[i] = false;\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    has_c[c[i]] = true;\n  }\n\n  for (int i = 0; i < q; i++) {\n\n    int max_r = -1;\n\n    for (int r = query[i] - 1; r >= 0; r--) {\n\n      for (int k = 0; true; k++) {\n\n        int x = k * query[i] + r;\n\n        if (x > C) {\n\n          break;\n        }\n\n        if (has_c[x]) {\n\n          max_r = max(r, max_r);\n\n          break;\n        }\n      }\n\n      if (max_r >= 0) {\n\n        break;\n      }\n    }\n\n    printf(\"%d\\n\", max_r);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"f9f5fcea4e9c5ed7328e673eb236d38612fd130e417578a5c6c11dd86f58002b","fast_id":"115b1c1d1dedc0378fafb3856449cf96b5dfef7321c4480afb3a76cda619cb58","fast_time":0.000210107,"language":"cpp","measured_fast_code_id":"115b1c1d1dedc0378fafb3856449cf96b5dfef7321c4480afb3a76cda619cb58","measured_slow_code_id":"a2d763733c872895410edd875a17f0c39637760701ba9b36bc8103eece0e100f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31812","problem_id":"p03831","slow_code_id":"538a6b4176b9696840386b8a2c4393f243cad3ca7b2942c6c5c1bd65396cabda","slow_id":"a2d763733c872895410edd875a17f0c39637760701ba9b36bc8103eece0e100f","slow_time":0.0010116532,"speedup":4.814942862446277,"stratum":"4-8","sampling_key":"446adcfa70cbdde4338a87d1f014de73da42d913af99ef391351144ee3bae954","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long g[1000100];\n\nint main()\n\n{\n\n  long long n, a, b, ans;\n\n  cin >> n >> a >> b;\n\n  for (int j = 1; j <= n; j++)\n\n    cin >> g[j];\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    if ((g[i + 1] - g[i]) * a >= b)\n      ans += b;\n\n    else if ((g[i + 1] - g[i]) * a < b)\n      ans += (g[i + 1] - g[i]) * a;\n  }\n\n  cout << ans;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  long long int N, A, B, a[100005], i, sum = 0;\n\n  scanf(\"%lld%lld%lld\", &N, &A, &B);\n\n  for (i = 0; i < N; i++)\n\n    scanf(\"%lld\", &a[i]);\n\n  for (i = 0; i < N - 1; i++)\n\n  {\n\n    if ((a[i + 1] - a[i]) * A < B)\n\n      sum += (a[i + 1] - a[i]) * A;\n\n    else\n\n      sum += B;\n  }\n\n  printf(\"%lld\", sum);\n}\n"}
{"fast_code_id":"6513e31316604edf7d53323e2636955bee3773e2924c78a89eb676d3ccabb146","fast_id":"c8e3accce21769e024448666d4abd90d4a1ccd4914311dd1237fb3d500da1998","fast_time":0.1090536676,"language":"cpp","measured_fast_code_id":"c8e3accce21769e024448666d4abd90d4a1ccd4914311dd1237fb3d500da1998","measured_slow_code_id":"d8756965788fc8d0147e6aae8dcfb14f3cda2d2d6bed7200b099f021894cf61f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3183","problem_id":"p03414","slow_code_id":"60fbf102b1ef2015961517c23fd38d1333cef5881220e7b04f4d5245016e7f57","slow_id":"d8756965788fc8d0147e6aae8dcfb14f3cda2d2d6bed7200b099f021894cf61f","slow_time":0.9674509319,"speedup":8.871328706234177,"stratum":"8+","sampling_key":"2ade0cc0f0a17e5ae8b4d47d335ae225d5d627ca00334735138c8570031016bd","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nnamespace SCC {\n\nconst int N = 110000;\n\nvector<int> con[N], rcon[N];\n\nint n, vis[N], visT;\n\nint id[N], idn;\n\nvoid init(int nn = 0) {\n\n  n = nn, visT = idn = 0;\n\n  for (int i = 1; i <= n; i++)\n    con[i].clear(), rcon[i].clear();\n}\n\nvoid add_edge(int u, int v) {\n\n  con[u].push_back(v);\n\n  rcon[v].push_back(u);\n}\n\nvoid dfs(int u) {\n\n  vis[u] = 1;\n\n  for (int v : con[u])\n    if (!vis[v])\n      dfs(v);\n\n  id[idn++] = u;\n}\n\nvoid rdfs(int u) {\n\n  vis[u] = visT;\n\n  for (int v : rcon[u])\n    if (!vis[v])\n      rdfs(v);\n}\n\nvoid SCC() {\n\n  for (int i = 1; i <= n; i++)\n    vis[i] = 0;\n\n  for (int i = 1; i <= n; i++)\n    if (!vis[i])\n      dfs(i);\n\n  for (int i = 1; i <= n; i++)\n    vis[i] = 0;\n\n  for (int i = idn - 1; i >= 0; i--)\n    if (!vis[id[i]])\n      visT++, rdfs(id[i]);\n}\n\n};                 \n\nconst int N = 1100;\n\nconst int M = 220000;\n\nvector<int> con[N];\n\nstruct Edge {\n\n  int u, v;\n\n  Edge(int u = 0, int v = 0) : u(u), v(v) {}\n\n} E[M];\n\nint adj[N][N];\n\nint vis[N], visT;\n\nint son[2][N][N];\n\ninline bool Find(int u, int tar) {\n\n  if (adj[u][tar] > 1)\n    return true;\n\n  return son[0][u][tar] != tar || son[1][u][tar] != tar;\n}\n\nvoid dfs(int u, int id, int rt, int __rt) {\n\n  vis[u] = visT;\n\n  son[id][__rt][u] = rt;\n\n  for (int v : con[u])\n    if (vis[v] != visT)\n      dfs(v, id, rt, __rt);\n}\n\nvoid init(int n) {\n\n  for (int i = 1; i <= n; i++) {\n\n    visT++;\n\n    vis[i] = visT;\n\n    for (int v : con[i])\n      if (vis[v] != visT)\n        dfs(v, 0, v, i);\n\n    reverse(con[i].begin(), con[i].end());\n\n    visT++;\n\n    vis[i] = visT;\n\n    for (int v : con[i])\n      if (vis[v] != visT)\n        dfs(v, 1, v, i);\n  }\n}\n\nint main() {\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0), cout.tie(0);\n\n  int n, m;\n  cin >> n >> m;\n\n  SCC::init(n + 10);\n\n  for (int i = 0; i < m; i++) {\n\n    int u, v;\n    cin >> u >> v;\n\n    E[i] = Edge(u, v);\n\n    con[u].push_back(v);\n\n    adj[u][v]++;\n\n    SCC::add_edge(u, v);\n  }\n\n  SCC::SCC();\n\n  init(n);\n\n  for (int i = 0; i < m; i++) {\n\n    auto a = SCC::vis[E[i].u], b = SCC::vis[E[i].v];\n\n    if (a == b) {\n\n      if (Find(E[i].u, E[i].v))\n        cout << \"same\\n\";\n\n      else\n        cout << \"diff\\n\";\n\n    } else {\n\n      if (Find(E[i].u, E[i].v))\n        cout << \"diff\\n\";\n\n      else\n        cout << \"same\\n\";\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <vector>\n\nusing namespace std;\n\nconst int maxn = 1000 + 50;\n\nconst int maxm = 200000 + 50;\n\nint N, M;\n\nint p[maxn];\n\nint q[maxn];\n\nint c[maxn][maxn];\n\nbool an[maxm];\n\nstruct edge\n\n{\n\n  int to, id;\n\n  edge(int to = 0, int id = 0) : to(to), id(id) {}\n};\n\nvector<edge> adj[maxn];\n\nvoid dfs(int u, int root)\n\n{\n\n  if (c[root][u])\n    return;\n\n  c[root][u] = 1;\n\n  for (unsigned int i = 0; i < adj[u].size(); ++i)\n\n  {\n\n    int v = adj[u][i].to;\n\n    dfs(v, root);\n  }\n}\n\nvoid dfs(int u, int c, int *p)\n\n{\n\n  if (p[u] != -1)\n    return;\n\n  p[u] = c;\n\n  for (unsigned int i = 0; i < adj[u].size(); ++i)\n\n  {\n\n    int v = adj[u][i].to;\n\n    dfs(v, c, p);\n  }\n}\n\nvoid solve()\n\n{\n\n  for (int i = 1; i <= N; ++i)\n\n  {\n\n    dfs(i, i);\n  }\n\n  for (int u = 1; u <= N; ++u)\n\n  {\n\n    memset(p, -1, sizeof(p));\n\n    memset(q, -1, sizeof(q));\n\n    int l = p[u] = q[u] = adj[u].size();\n\n    for (int i = 0; i < l; ++i)\n\n    {\n\n      int v = adj[u][i].to;\n\n      dfs(v, i, p);\n    }\n\n    for (int i = l - 1; ~i; --i)\n\n    {\n\n      int v = adj[u][i].to;\n\n      dfs(v, i, q);\n    }\n\n    for (int i = 0; i < l; ++i)\n\n    {\n\n      int v = adj[u][i].to;\n\n      int d = adj[u][i].id;\n\n      an[d] = c[v][u] ^ (p[v] != i || q[v] != i);\n    }\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &N, &M);\n\n  for (int i = 1; i <= M; ++i)\n\n  {\n\n    int a, b;\n\n    scanf(\"%d%d\", &a, &b);\n\n    adj[a].push_back(edge(b, i));\n  }\n\n  solve();\n\n  for (int i = 1; i <= M; ++i)\n\n  {\n\n    puts(an[i] ? \"diff\" : \"same\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"8ca59a47c6ce0b9f890b7accc2f9e9fbd90ebde32c3ab13b8729f17847c32860","fast_id":"a7717dfeeabc648597c3f28cf72c02e590de75c561b0d41c4a442dc3d68891f2","fast_time":0.1067616644,"language":"cpp","measured_fast_code_id":"a7717dfeeabc648597c3f28cf72c02e590de75c561b0d41c4a442dc3d68891f2","measured_slow_code_id":"9f46c9981e86d9063094be22c1cb6ace097ddb508f38a15458db8c1b17262df3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_31880","problem_id":"p00452","slow_code_id":"bb3c97a98621ff6b4c24ec2b89b3f53b9f0c495e2179b04ec7eb0c21bae29a90","slow_id":"9f46c9981e86d9063094be22c1cb6ace097ddb508f38a15458db8c1b17262df3","slow_time":1.0656166856,"speedup":9.981267073614488,"stratum":"8+","sampling_key":"c4d901d020ff94d502681302ef22439d633115c1f090710ef62c5230c6105b50","slow_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\n#define ll long long int\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, s, t) for (int i = s; i <= t; i++)\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n\n#define INF 2000000000\n\n#define mod 1000000007\n\n#define INF2 1000000000000000000\n\nint kk[1100001];\n\nint n, m;\n\nint binary_search(int x) {\n\n  if (x <= 0)\n    return 0;\n\n  int l = 0, r = n * n;\n\n  int i = 0;\n\n  while (r - l >= 1) {\n\n    i = (l + r) / 2;\n\n    if (kk[i] == x)\n      return i;\n\n    else if (kk[i] < x)\n      l = i + 1;\n\n    else\n      r = i;\n  }\n\n  while (kk[i] > x)\n    i--;\n\n  return i;\n}\n\nint main(void)\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  while (true) {\n\n    cin >> n >> m;\n\n    if (n == 0 && m == 0)\n      return 0;\n\n    int k[n + 1];\n\n    k[0] = 0;\n\n    rep(i, n) cin >> k[i + 1];\n\n    rep(k, 1100001) kk[k] = 0;\n\n    rep(c, n + 1) {\n\n      rep(d, n + 1) { kk[c * n + d] = k[c] + k[d]; }\n    }\n\n    sort(kk, kk + (n + 1) * (n + 1));\n\n    int ans = 0;\n\n    rep(a, n + 1) {\n\n      rep(b, n + 1) {\n\n        int index = binary_search(m - k[a] - k[b]);\n\n        int tmp = kk[index] + k[a] + k[b];\n\n        if (tmp <= m)\n          ans = max(ans, tmp);\n\n        tmp = kk[index + 1] + k[a] + k[b];\n\n        if (tmp <= m)\n          ans = max(ans, tmp);\n      }\n    }\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\n#define ll long long int\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, s, t) for (int i = s; i <= t; i++)\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n\n#define INF 2000000000\n\n#define mod 1000000007\n\n#define INF2 1000000000000000000\n\nint main(void)\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  while (true) {\n\n    int N, M;\n\n    cin >> N >> M;\n\n    if (N == 0 && M == 0)\n      return 0;\n\n    vector<int> a(N);\n\n    rep(i, N) cin >> a[i];\n\n    a.push_back(0);\n\n    N++;\n\n    vector<int> aa(N * N);\n\n    rep(i, N) rep(j, N) aa[i * N + j] = a[i] + a[j];\n\n    sort(aa.begin(), aa.end());\n\n    int ans = 0;\n\n    rep(i, N * N) {\n\n      int tmp = aa[i];\n\n      int aim = M - tmp;\n\n      if (aim < 0)\n        continue;\n\n      tmp += *(upper_bound(aa.begin(), aa.end(), aim) - 1);\n\n      if (tmp <= M)\n        ans = max(ans, tmp);\n    }\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"e43b3545036606bc553459719b7c37c050f2bedfe815b749fbc8604e57e50c99","fast_id":"b15d648cf28abfe92231c6c72c4145a04ec3d4efd3097daa2be85726ce67f1f4","fast_time":0.0133028456,"language":"cpp","measured_fast_code_id":"b15d648cf28abfe92231c6c72c4145a04ec3d4efd3097daa2be85726ce67f1f4","measured_slow_code_id":"78ec467634da838698cbe95923c3ec9040cd40e4e157f573c2fd0b2a5436d20d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3243","problem_id":"p03770","slow_code_id":"fc83efb86cb2dc2f675e360cddf483ff6789ea9219e21b27c5075901cf1000a6","slow_id":"78ec467634da838698cbe95923c3ec9040cd40e4e157f573c2fd0b2a5436d20d","slow_time":0.4502858709,"speedup":33.848838394395855,"stratum":"8+","sampling_key":"05138647e030c723e77e3ec41694fc400093341f853031d029516973ce1770df","slow_code":"#include <iostream>\n\n#include <cstdlib>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef pair<int, int> pr;\n\nconst int N = 2e5 + 10;\n\nconst int INF = 2e9;\n\nconst LL mod = 1e9 + 7;\n\ninline LL power(LL a, LL n, LL mod)\n\n{\n\n  LL Ans = 1;\n\n  while (n)\n\n  {\n\n    if (n & 1)\n      Ans = Ans * a % mod;\n\n    a = a * a % mod;\n\n    n >>= 1;\n  }\n\n  return Ans;\n}\n\nnamespace ufs\n\n{\n\nint parent[N];\n\nvoid init(int n) {\n  for (int i = 1; i <= n; i++)\n    parent[i] = i;\n}\n\ninline int findrt(int x) { return parent[x] == x ? x : parent[x] = findrt(parent[x]); }\n\nvoid merge(int x, int y)\n\n{\n\n  x = findrt(x), y = findrt(y);\n\n  parent[x] = y;\n}\n\n}                 \n\nint col[N], w[N];\n\nint n, X, Y;\n\npr minv[N];\n\nvector<int> vec[N];\n\nint cnt[N];\n\nLL fac[N], ifac[N];\n\ninline LL calc(int n, int m) { return n < m ? 0 : fac[n] * ifac[m] % mod * ifac[n - m] % mod; }\n\nint main()\n\n{\n\n  cin >> n >> X >> Y;\n\n  fac[0] = 1;\n\n  for (int i = 1; i <= n; i++)\n    fac[i] = fac[i - 1] * i % mod;\n\n  ifac[n] = power(fac[n], mod - 2, mod);\n\n  for (int i = n - 1; i >= 0; i--)\n    ifac[i] = ifac[i + 1] * (i + 1) % mod;\n\n  int maxc = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d %d\", &col[i], &w[i]);\n\n    maxc = max(maxc, col[i]);\n  }\n\n  for (int i = 1; i <= maxc; i++)\n    minv[i] = make_pair(INF, INF);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    minv[col[i]] = min(minv[col[i]], make_pair(w[i], i));\n\n    vec[col[i]].push_back(i);\n  }\n\n  ufs::init(n);\n\n  for (int i = 1; i <= maxc; i++)\n\n  {\n\n    for (auto id : vec[i])\n\n      if (w[id] + minv[i].first <= X)\n\n        ufs::merge(id, minv[i].second);\n  }\n\n  pr mn = make_pair(INF, INF), mn2 = make_pair(INF, INF);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    pr tmp = make_pair(w[i], i);\n\n    mn = min(mn, tmp);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    pr tmp = make_pair(w[i], i);\n\n    if (col[i] != col[mn.second])\n\n      mn2 = min(mn2, tmp);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    if (col[mn.second] != col[i] && mn.first + w[i] <= Y)\n\n      ufs::merge(mn.second, i);\n\n    else if (mn2.first != INF && col[mn2.second] != col[i] && mn2.first + w[i] <= Y)\n\n      ufs::merge(mn2.second, i);\n\n  for (int i = 1; i <= n; i++)\n\n    if (ufs::findrt(i) == ufs::findrt(mn.second))\n\n      cnt[col[i]]++;\n\n  int all = 0;\n\n  for (int i = 1; i <= maxc; i++)\n\n    all += cnt[i];\n\n  LL Ans = 1;\n\n  for (int i = 1; i <= maxc; i++)\n\n    if (cnt[i])\n\n    {\n\n      Ans = Ans * calc(all, cnt[i]) % mod;\n\n      all -= cnt[i];\n    }\n\n  printf(\"%lld\\n\", Ans);\n\n  return 0;\n}","fast_code":"#include <algorithm>\n\n#include <cstdio>\n\n#include <cstring>\n\ntypedef long long LL;\n\nconst int MAXN = 200000;\n\nconst int MOD = 1000000007;\n\nconst int INF = 1000000001;\n\nint N, X, Y, C[MAXN + 5], W[MAXN + 5];\n\nint Min[MAXN + 5], Cnt[MAXN + 5];\n\nint Fac[MAXN + 5], Inv[MAXN + 5];\n\nint Pow(int x, int y) {\n\n  int ret = 1;\n\n  while (y) {\n\n    if (y & 1)\n\n      ret = (LL)ret * x % MOD;\n\n    y >>= 1;\n\n    x = (LL)x * x % MOD;\n  }\n\n  return ret;\n}\n\nint main() {\n\n  scanf(\"%d%d%d\", &N, &X, &Y);\n\n  Fac[0] = 1;\n\n  for (int i = 1; i <= N; i++)\n\n    Fac[i] = (LL)Fac[i - 1] * i % MOD;\n\n  Inv[N] = Pow(Fac[N], MOD - 2);\n\n  for (int i = N - 1; i >= 0; i--)\n\n    Inv[i] = (LL)Inv[i + 1] * (i + 1) % MOD;\n\n  for (int i = 0; i <= N; i++)\n\n    Min[i] = INF;\n\n  for (int i = 1; i <= N; i++) {\n\n    scanf(\"%d%d\", &C[i], &W[i]);\n\n    Cnt[C[i]]++;\n\n    Min[C[i]] = std::min(Min[C[i]], W[i]);\n  }\n\n  int fir = std::min_element(Min + 1, Min + N + 1) - Min, sec = 0;\n\n  for (int i = 1; i <= N; i++)\n\n    if (i != fir && Min[i] < Min[sec])\n\n      sec = i;\n\n  for (int i = 1; i <= N; i++) {\n\n    if (W[i] != Min[C[i]] && W[i] + Min[C[i]] <= X)\n\n      continue;\n\n    if (C[i] != fir && W[i] + Min[fir] <= Y)\n\n      continue;\n\n    if (C[i] == fir && W[i] + Min[sec] <= Y)\n\n      continue;\n\n    Cnt[C[i]]--;\n  }\n\n  int tot = 0, Ans = 1;\n\n  for (int i = 1; i <= N; i++)\n\n    if (Min[i] + Min[fir] <= Y)\n\n      Ans = (LL)Ans * Inv[Cnt[i]] % MOD, tot += Cnt[i];\n\n  printf(\"%d\", (LL)Ans * Fac[tot] % MOD);\n}"}
{"fast_code_id":"371849eadf7da39dc1c8a711bc53f93868378a5182c10fbde4e96e06cbf6ca41","fast_id":"1192795ef4a0061039a939d1273893b3626faa07ad0b9e74cb27cdc31c4e7898","fast_time":0.0060173559,"language":"cpp","measured_fast_code_id":"1192795ef4a0061039a939d1273893b3626faa07ad0b9e74cb27cdc31c4e7898","measured_slow_code_id":"f17b51b3b6d52e56abe2e5871dd4b27c1a02ddf01388e1a2e95ce9606e7debf8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_32444","problem_id":"p02727","slow_code_id":"850888a059178e5c146ea4748aecb4c46e7be471767cd18346f472c78ec2e8fc","slow_id":"f17b51b3b6d52e56abe2e5871dd4b27c1a02ddf01388e1a2e95ce9606e7debf8","slow_time":0.0275884672,"speedup":4.584815599821842,"stratum":"4-8","sampling_key":"1ec959e90f7b034bebe843f84c68ce2c4be702008f54c1c7d7326b08b1b341a8","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int X, Y, A, B, C;\n\n  cin >> X >> Y >> A >> B >> C;\n\n  int a[100000], b[100000], c[100000];\n\n  rep(i, A) cin >> a[i];\n\n  rep(i, B) cin >> b[i];\n\n  rep(i, C) cin >> c[i];\n\n  sort(a, a + A);\n\n  reverse(a, a + A);\n\n  sort(b, b + B);\n\n  reverse(b, b + B);\n\n  sort(c, c + C);\n\n  reverse(c, c + C);\n\n  ll kotae = 0;\n\n  ll ctmp = 0;\n\n  ll abtmp = 0;\n\n  rep(i, X) abtmp += a[i];\n\n  rep(i, Y) abtmp += b[i];\n\n  int aa = X - 1;\n\n  int bb = Y - 1;\n\n  chmax(kotae, ctmp + abtmp);\n\n  rep(i, min(C, X + Y)) {\n\n    ctmp += c[i];\n\n    if (aa == -1) {\n\n      abtmp -= b[bb--];\n\n    }\n\n    else if (bb == -1) {\n\n      abtmp -= a[aa--];\n\n    }\n\n    else {\n\n      if (a[aa] < b[bb]) {\n\n        abtmp -= a[aa--];\n\n      }\n\n      else\n        abtmp -= b[bb--];\n    }\n\n    chmax(kotae, ctmp + abtmp);\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nvoid pakuri_sort(int N, int A[]) {\n\n  const int b = 8;\n\n  int tmp[100001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n  }\n}\n\nint main() {\n\n  int X = getint(), Y = getint(), A = getint(), B = getint(), C = getint();\n\n  int a[100000], b[100000], c[100000];\n\n  rep(i, A) a[i] = getint();\n\n  rep(i, B) b[i] = getint();\n\n  rep(i, C) c[i] = getint();\n\n  pakuri_sort(A, a);\n\n  pakuri_sort(B, b);\n\n  pakuri_sort(C, c);\n\n  ll tmp = 0;\n\n  for (int i = A - X; i < A; i++)\n    tmp += a[i];\n\n  for (int i = B - Y; i < B; i++)\n    tmp += b[i];\n\n  int aa = A - X;\n\n  int bb = B - Y;\n\n  ll kotae = tmp;\n\n  int cm = C - min(C, X + Y);\n\n  for (int i = C - 1; i >= cm; i--) {\n\n    tmp += c[i];\n\n    if (aa == A)\n      tmp -= b[bb++];\n\n    else if (bb == B)\n      tmp -= a[aa++];\n\n    else if (a[aa] < b[bb])\n      tmp -= a[aa++];\n\n    else\n      tmp -= b[bb++];\n\n    chmax(kotae, tmp);\n  }\n\n  printf(\"%lld\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"a158de9c163f66486680951c2264efda349601403663b64c532062fa906e8eb3","fast_id":"d059019ce4022708aaae87c18607daa4e0dd798946940dae70f4d816c0ef81b5","fast_time":0.0049811402,"language":"cpp","measured_fast_code_id":"d059019ce4022708aaae87c18607daa4e0dd798946940dae70f4d816c0ef81b5","measured_slow_code_id":"8beab6b965cd1697c5fb5fe3c37a4326c6223c991999b6a707fd57dbfeb323ba","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_32498","problem_id":"p02583","slow_code_id":"d974adfcd0ea5350223d32ad1da4f3c864db5dd78f7abc4c704101e33f84102d","slow_id":"8beab6b965cd1697c5fb5fe3c37a4326c6223c991999b6a707fd57dbfeb323ba","slow_time":0.0261854584,"speedup":5.256920574128791,"stratum":"4-8","sampling_key":"d8269a6e5c3470d537ed1fdf783c9cd1ff76cd2ea00235764af9584d3e5a9133","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 105;\n\nint n, a[N], ans;\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  sort(a + 1, a + n + 1);\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = i + 1; j <= n; j++)\n\n      for (int k = j + 1; k <= n; k++)\n\n        if (a[i] + a[j] > a[k] && a[i] != a[j] && a[j] != a[k])\n\n          ans++;\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int n, ans = 0;\n\n  scanf(\"%d\", &n);\n\n  int arr[n];\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d\", &arr[i]);\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    for (int j = i + 1; j < n; j++) {\n\n      for (int k = j + 1; k < n; k++) {\n\n        if (arr[i] != arr[j] && arr[j] != arr[k] && arr[k] != arr[i] && arr[i] + arr[j] > arr[k] &&\n            arr[j] + arr[k] > arr[i] && arr[k] + arr[i] > arr[j]) {\n\n          ans++;\n        }\n      }\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n}"}
{"fast_code_id":"697bf9da1e45376e06d530bc394beb150cbeb49578ea61332bb31825eb867225","fast_id":"bd58253d4f48122b0c0ba7af3c41dee09b90b169c96fded00356c911892c133d","fast_time":0.042561922,"language":"cpp","measured_fast_code_id":"bd58253d4f48122b0c0ba7af3c41dee09b90b169c96fded00356c911892c133d","measured_slow_code_id":"bf242c608a0de55cab21c3bdb619f6324c256084c5745933a951f2431bdfb02a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_32501","problem_id":"p03444","slow_code_id":"84f6e7c7d5677b2a51b073847380099584b668eaf1255ab0351b0620961efb86","slow_id":"bf242c608a0de55cab21c3bdb619f6324c256084c5745933a951f2431bdfb02a","slow_time":0.1700935877,"speedup":3.9963793857805574,"stratum":"2-4","sampling_key":"02532398da6d1ebbd12352b536a65796be863b712ec57fc1031196e41d2c48ac","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint const N = 123456;\n\nint ac = 0;\n\nint ans[N], p[N], where[N], a[N], blocked[N];\n\nvector<int> edges[N];\n\nvoid shift(int start) {\n\n  int v = start;\n\n  int tmp = a[v];\n\n  while (v != 0) {\n\n    v = p[v];\n\n    int ntmp = a[v];\n\n    a[v] = tmp;\n\n    where[a[v]] = v;\n\n    tmp = ntmp;\n  }\n\n  a[start] = tmp;\n\n  where[a[start]] = start;\n\n  ans[ac++] = start;\n}\n\n#define pi pair<int, int>\n\n#define aa first\n\n#define bb second\n\npi getdown(int v, int value) {\n\n  pi mx = make_pair(-1, 0);\n\n  for (int to : edges[v]) {\n\n    if (blocked[to])\n      continue;\n\n    pi got = getdown(to, value);\n\n    if (got.aa < 0)\n      continue;\n\n    if (mx.aa < 0 || a[mx.bb] < a[got.bb]) {\n\n      mx = got;\n    }\n  }\n\n  if (mx.aa < 0 && a[v] > value) {\n\n    mx = make_pair(v, v);\n  }\n\n  if (a[v] > a[mx.bb])\n\n    mx.bb = v;\n\n  return mx;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 1; i < n; i++) {\n\n    cin >> p[i];\n\n    edges[p[i]].push_back(i);\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n\n    where[a[i]] = i;\n  }\n\n  for (int i = 0; i < n; i++)\n    blocked[i] = false;\n\n  int cur = n - 1;\n\n  while (cur >= 0) {\n\n    while (a[0] != cur) {\n\n      int v = where[cur];\n\n      int u = getdown(v, a[0]).aa;\n\n      shift(u);\n    }\n\n    shift(cur);\n\n    blocked[cur] = true;\n\n    --cur;\n  }\n\n  cout << ac << '\\n';\n\n  for (int i = 0; i < ac; i++) {\n\n    cout << ans[i] << '\\n';\n  }\n}\n","fast_code":"#include <bits/stdc++.h>\n\n\n\nusing namespace std;\n\n\n\n#define X first\n\n#define Y second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define Debug(...) fprintf(stderr, __VA_ARGS__)\n\n\n\ntypedef long long LL;\n\ntypedef long double LD;\n\ntypedef unsigned int uint;\n\ntypedef pair <int, int> pii;\n\ntypedef unsigned long long uLL;\n\n\n\ntemplate <typename T> inline void Read(T &x) {\n\n  char c = getchar();\n\n  bool f = false;\n\n  for (x = 0; !isdigit(c); c = getchar()) {\n\n    if (c == '-') {\n\n      f = true;\n\n    }\n\n  }\n\n  for (; isdigit(c); c = getchar()) {\n\n    x = x * 10 + c - '0';\n\n  }\n\n  if (f) {\n\n    x = -x;\n\n  }\n\n}\n\n\n\ntemplate <typename T> inline bool CheckMax(T &a, const T &b) {\n\nreturn a < b ? a = b, true : false;\n\n}\n\n\n\ntemplate <typename T> inline bool CheckMin(T &a, const T &b) {\n\nreturn a > b ? a = b, true : false;\n\n}\n\n\n\nconst int N = 2005;\n\n\n\nint n, cnt, a[N], d[N], e[N], p[N], r[N];\n\nvector <int> ans, seq, adj[N];\n\nbool v[N];\n\n\n\ninline void Rotate(int x) {\n\n  int t = a[x];\n\n  ans.pb(x), a[x] = a[0];\n\n  for (int i = p[x]; ~i; swap(a[i], t), i = p[i]);\n\n}\n\n\n\nint main() {\n\n#ifdef wxh010910\n\n  freopen(\"d.in\", \"r\", stdin);\n\n#endif\n\n  Read(n), p[0] = -1;\n\n  for (int i = 1; i < n; ++i) {\n\n    Read(p[i]), adj[p[i]].pb(i), d[i] = d[p[i]] + 1;\n\n  }\n\n  for (int i = 0; i < n; ++i) {\n\n    Read(a[i]);\n\n  }\n\n  while (cnt < n) {\n\n    seq.clear();\n\n    for (int i = n - 1; ~i; --i) {\n\n      if (!v[i]) {\n\n        int t = 0, son = -1;\n\n        seq.pb(i);\n\n        for (auto j : adj[i]) {\n\n          if (!v[j]) {\n\n            ++t, son = j;\n\n          }\n\n        }\n\n        if (!t) {\n\n          r[i] = e[i] = i;\n\n        } else if (t == 1 && ~r[son]) {\n\n          r[i] = r[son];\n\n        } else {\n\n          r[i] = -1;\n\n        }\n\n      }\n\n    }\n\n    sort(seq.begin(), seq.end(), [&](const int &x, const int &y) {\n\n      return mp(r[x], d[x]) > mp(r[y], d[y]);\n\n    });\n\n    for (int i = 0; i < seq.size(); ) {\n\n      if (~r[a[0]]) {\n\n        int x = a[0], y = r[x];\n\n        for (; v[y] && a[y] > x; y = p[y]);\n\n        Rotate(y), y = r[x], v[e[y]] = true, e[y] = p[e[y]], ++cnt;\n\n      } else {\n\n        Rotate(seq[i++]);\n\n      }\n\n      for (; i < seq.size() && v[seq[i]]; ++i);\n\n    }\n\n  }\n\n  for (int i = 0; i < n; ++i) {\n\n    assert(a[i] == i);\n\n  }\n\n  printf(\"%d\\n\", ans.size());\n\n  for (auto x : ans) {\n\n    printf(\"%d\\n\", x);\n\n  }\n\n#ifdef wxh010910\n\n  Debug(\"My Time: %.3lfms\\n\", (double)clock() / CLOCKS_PER_SEC);\n\n#endif\n\n  return 0;\n\n}\n"}
{"fast_code_id":"1ada081476e046ee58f0d0b58e6cd472e7dcd35bd250b28e7146cc528fb5fc0a","fast_id":"33177dd936a1baea4013c79349c1ff61a0f51541e691e378458d0284ce49911a","fast_time":0.1117557879,"language":"cpp","measured_fast_code_id":"33177dd936a1baea4013c79349c1ff61a0f51541e691e378458d0284ce49911a","measured_slow_code_id":"fd89676c20fc3192655e2b5b0239d7ac831f1cb56f792b8b5c91537c9a0a39a3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3251","problem_id":"p00763","slow_code_id":"658fa4dbeb4ca6c171a0d464d6d9f260be69e7431fcd23fbf148c857d40e98fc","slow_id":"fd89676c20fc3192655e2b5b0239d7ac831f1cb56f792b8b5c91537c9a0a39a3","slow_time":0.4689774218,"speedup":4.196448619016,"stratum":"4-8","sampling_key":"b032be756fd7e617933e4f7016edcef98406da9f6cac3ad7ee6703584d811432","slow_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\n#define reps(i, f, n) for (int i = f; i < int(n); i++)\n\n#define rep(i, n) reps(i, 0, n)\n\nclass L {\n\npublic:\n  int to, coop, dist;\n\n  L(int to, int coop, int dist) : to(to), coop(coop), dist(dist) {}\n};\n\nclass T {\n\npublic:\n  int now;\n\n  int coop;\n\n  int val;\n\n  T(int now, int val, int coop) : now(now), val(val), coop(coop) {}\n\n  bool operator<(const T &a) const { return val > a.val; }\n};\n\nusing namespace std;\n\nconst int DMAX = 22222;\n\nint cost[22][DMAX];\n\nvector<L> load[111];\n\nvector<L> load2[111];\n\nvoid init() {\n\n  rep(i, 22) rep(j, DMAX) cost[i][j] = 0;\n\n  rep(i, 111) load[i].clear();\n\n  rep(i, 111) load2[i].clear();\n}\n\nint main() {\n\n  int ldcont = 0;\n\n  while (1) {\n\n    init();\n\n    int n, m, c, s, g;\n\n    cin >> n >> m >> c >> s >> g;\n\n    ldcont++;\n\n    if (n == 0)\n      break;\n\n    rep(i, m) {\n\n      int st, en, dist, coop;\n\n      cin >> st >> en >> dist >> coop;\n\n      ldcont++;\n\n      load[st].push_back(L(en, coop, dist));\n\n      load[en].push_back(L(st, coop, dist));\n    }\n\n    int p[22] = {0};\n\n    reps(i, 1, c + 1) {\n      cin >> p[i];\n      ldcont++;\n    }\n\n    int q[22][55] = {0};\n\n    int r[22][55] = {0};\n\n    reps(i, 1, c + 1) {\n\n      rep(j, p[i] - 1) cin >> q[i][j];\n\n      rep(j, p[i]) cin >> r[i][j];\n\n      ldcont++;\n      ldcont++;\n\n      cost[i][0] = 0;\n\n      int cont = 0;\n\n      reps(j, 1, DMAX) {\n\n        cost[i][j] = cost[i][j - 1] + r[i][cont];\n\n        if (q[i][cont] == j)\n          cont++;\n      }\n    }\n\n    priority_queue<T> que;\n\n    reps(pst, 1, n + 1) {\n\n      reps(cst, 1, c + 1) {\n\n        int visit[111][22] = {0};\n\n        priority_queue<T> que;\n\n        que.push(T(pst, 0, cst));\n\n        while (1) {\n\n          if (que.empty())\n            break;\n\n          T u = que.top();\n\n          que.pop();\n\n          if (visit[u.now][u.coop] == 1)\n            continue;\n\n          visit[u.now][u.coop] = 1;\n\n          rep(i, load[u.now].size()) {\n\n            L ld = load[u.now][i];\n\n            if (u.coop != ld.coop)\n              continue;\n\n            if (visit[ld.to][ld.coop] == 1)\n              continue;\n\n            que.push(T(ld.to, u.val + ld.dist, ld.coop));\n          }\n\n          if (u.val != 0) {\n\n            load2[pst].push_back(L(u.now, u.coop, u.val));\n          }\n        }\n      }\n    }\n\n    priority_queue<T> que2;\n\n    que2.push(T(s, 0, -1));\n\n    int ans = -1;\n\n    int visit2[111][22] = {0};\n\n    while (1) {\n\n      if (que2.empty())\n        break;\n\n      T u = que2.top();\n\n      que2.pop();\n\n      if (visit2[u.now][u.coop] == 1)\n        continue;\n\n      visit2[u.now][u.coop] = 1;\n\n      if (u.now == g) {\n\n        ans = u.val;\n\n        break;\n      }\n\n      rep(i, load2[u.now].size()) {\n\n        L ld = load2[u.now][i];\n\n        que2.push(T(ld.to, u.val + cost[ld.coop][ld.dist], u.coop));\n      }\n    }\n\n    printf(\"%d\\n\", ans);\n  }\n}","fast_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <vector>\n\n#include <string>\n\n#include <queue>\n\n#include <complex>\n\n#include <set>\n\n#include <map>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define reps(i, f, n) for (int i = f; i < int(n); i++)\n\n#define rep(i, n) reps(i, 0, n)\n\nconst int R = 22;\n\nconst int N = 101;\n\nconst int INF = 1000000000;\n\nconst int M = N * 222;\n\nint n, m, r, s, g;\n\nint cost[R][M];\n\nint dplen[R][N][N];\n\nint dpcost[N][N];\n\nvoid init() {\n\n  reps(i, 1, r + 1) {\n\n    reps(j, 1, n + 1) reps(k, 1, n + 1) dplen[i][j][k] = INF;\n\n    reps(j, 1, n + 1) dplen[i][j][j] = 0;\n  }\n\n  reps(i, 1, n + 1) reps(j, 1, n + 1) dpcost[i][j] = INF;\n}\n\nvoid wf_length() {\n\n  reps(p, 1, r + 1) {\n\n    reps(k, 1, n + 1) {\n\n      reps(i, 1, n + 1) {\n\n        reps(j, 1, n + 1) { dplen[p][i][j] = min(dplen[p][i][j], dplen[p][i][k] + dplen[p][k][j]); }\n      }\n    }\n  }\n}\n\nvoid wf_cost() {\n\n  reps(k, 1, r + 1) {\n\n    reps(i, 1, n + 1) {\n\n      reps(j, 1, n + 1) {\n\n        if (dplen[k][i][j] == INF)\n          continue;\n\n        dpcost[i][j] = min(dpcost[i][j], cost[k][dplen[k][i][j]]);\n      }\n    }\n  }\n\n  reps(k, 1, n + 1) {\n\n    reps(i, 1, n + 1) {\n\n      reps(j, 1, n + 1) { dpcost[i][j] = min(dpcost[i][j], dpcost[i][k] + dpcost[k][j]); }\n    }\n  }\n}\n\nint solve() {\n\n  init();\n\n  rep(i, m) {\n\n    int a, b, c, d;\n\n    cin >> a >> b >> c >> d;\n\n    dplen[d][a][b] = min(dplen[d][a][b], c);\n\n    dplen[d][b][a] = min(dplen[d][b][a], c);\n  }\n\n  int p[R];\n\n  reps(i, 1, r + 1) cin >> p[i];\n\n  reps(i, 1, r + 1) {\n\n    int change[55];\n\n    int c[55];\n\n    rep(j, p[i] - 1) cin >> change[j];\n\n    rep(j, p[i]) cin >> c[j];\n\n    int pos = 0;\n\n    reps(j, 1, M) {\n\n      cost[i][j] = cost[i][j - 1] + c[pos];\n\n      if (pos != p[i] - 1 && j == change[pos])\n        pos++;\n    }\n  }\n\n  wf_length();\n\n  wf_cost();\n\n  int ans = dpcost[s][g];\n\n  if (ans == INF)\n    return -1;\n\n  return ans;\n}\n\nint main() {\n\n  while (1) {\n\n    cin >> n >> m >> r >> s >> g;\n\n    if (n == 0 && m == 0)\n      break;\n\n    printf(\"%d\\n\", solve());\n  }\n}"}
{"fast_code_id":"93ce874a8dd54168c8555b3959122c8bf55527d80b0a18110466d760b217510f","fast_id":"7fb8fb039d039e8f7dd6c28539a5df7cb5ab8faeaf5a60dac1f58d0c7d467749","fast_time":0.0080469595,"language":"cpp","measured_fast_code_id":"7fb8fb039d039e8f7dd6c28539a5df7cb5ab8faeaf5a60dac1f58d0c7d467749","measured_slow_code_id":"d6c7a0737b4f59e429ecb6c4d1d295a1c0de8eeaa78a25be0dc8c7c5fd677fff","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_32511","problem_id":"p02762","slow_code_id":"d3af05c78942d872d6f7c6ca8f165b36579c6dc6f38b29da40d121896b8e9742","slow_id":"d6c7a0737b4f59e429ecb6c4d1d295a1c0de8eeaa78a25be0dc8c7c5fd677fff","slow_time":0.291745718,"speedup":36.255397830696175,"stratum":"8+","sampling_key":"1c6ab925f92822f24c55ae4a76f1aec73597082be1f7a813d9ff9baa710cdd1c","slow_code":"#include <stdio.h>\n\n#include <vector>\n\n#include <queue>\n\nusing namespace std;\n\nqueue<int> Q;\n\nvector<int> v[111111], p[111111];\n\nint parent[111111], visit[111111], group[111111];\n\nvoid bfs(int start)\n\n{\n\n  int i;\n\n  Q.push(start);\n\n  visit[start] = 1;\n\n  parent[start] = start;\n\n  while (!Q.empty())\n\n  {\n\n    int t = Q.front();\n    Q.pop();\n\n    for (i = 0; i < p[t].size(); i++)\n\n    {\n\n      int next = p[t][i];\n\n      if (!visit[next])\n\n      {\n\n        parent[next] = start;\n\n        visit[next] = 1;\n\n        Q.push(next);\n      }\n    }\n  }\n}\n\nint main(void)\n\n{\n\n  int n, m, k, i, j;\n\n  scanf(\"%d %d %d\", &n, &m, &k);\n\n  while (m--)\n\n  {\n\n    int a, b;\n\n    scanf(\"%d %d\", &a, &b);\n\n    v[a].push_back(b);\n\n    v[b].push_back(a);\n\n    p[a].push_back(b);\n\n    p[b].push_back(a);\n  }\n\n  while (k--)\n\n  {\n\n    int c, d;\n\n    scanf(\"%d %d\", &c, &d);\n\n    v[c].push_back(d);\n\n    v[d].push_back(c);\n  }\n\n  for (i = 1; i <= n; i++)\n\n    if (!visit[i])\n\n      bfs(i);\n\n  for (i = 1; i <= n; i++)\n\n    group[parent[i]]++;\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    int cnt = group[parent[i]];\n\n    for (j = 0; j < v[i].size(); j++)\n\n      if (parent[v[i][j]] == parent[i])\n\n        --cnt;\n\n    printf(\"%d \", cnt - 1);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nint freind[111111], block[111111], group[111111];\n\nint Find(int x)\n\n{\n\n  if (freind[x] == x)\n\n    return x;\n\n  else\n\n    return freind[x] = Find(freind[x]);\n}\n\nint main(void)\n\n{\n\n  int n, m, k, i;\n\n  scanf(\"%d %d %d\", &n, &m, &k);\n\n  for (i = 1; i <= n; i++)\n\n    freind[i] = i, group[i] = 1;\n\n  while (m--)\n\n  {\n\n    int a, b;\n\n    scanf(\"%d %d\", &a, &b);\n\n    block[a]++;\n\n    block[b]++;\n\n    a = Find(a);\n\n    b = Find(b);\n\n    if (a != b)\n\n    {\n\n      if (a < b)\n\n      {\n\n        freind[b] = a;\n\n        group[a] += group[b];\n\n      }\n\n      else\n\n      {\n\n        freind[a] = b;\n\n        group[b] += group[a];\n      }\n    }\n  }\n\n  while (k--)\n\n  {\n\n    int c, d;\n\n    scanf(\"%d %d\", &c, &d);\n\n    if (Find(c) == Find(d))\n\n    {\n\n      block[c]++;\n\n      block[d]++;\n    }\n  }\n\n  for (i = 1; i <= n; i++)\n\n    printf(\"%d \", group[Find(i)] - block[i] - 1);\n\n  return 0;\n}"}
{"fast_code_id":"1ffdcdc6133a732cfdbcff2fab86b961c653fe6d566308e46d0042a2de43704d","fast_id":"950db0601e62d2d8ec7eecc0fc69b98157ea9bb3e1ca40a55ae6526930cd0671","fast_time":0.1094434899,"language":"cpp","measured_fast_code_id":"950db0601e62d2d8ec7eecc0fc69b98157ea9bb3e1ca40a55ae6526930cd0671","measured_slow_code_id":"34c32f5a926b53255c7b95209c7a435899f9031d509984627c687a7b6970ecb9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3253","problem_id":"p03515","slow_code_id":"ab0b0e84b0a70a74b7d192750378178efe60ae08e0349357764e70a9824dfdaf","slow_id":"34c32f5a926b53255c7b95209c7a435899f9031d509984627c687a7b6970ecb9","slow_time":0.3793155409,"speedup":3.4658575055180147,"stratum":"2-4","sampling_key":"98d7df86d41f111801a5528bf3cbd601bb08edec3f782c16249c7b7ce1bbe8a4","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\nconst int N = 1e5 + 5;\n\nint n, pset[N], lazy[N], ans[N];\n\nvector<int> child[N];\n\nvector<pair<int, pair<int, int > > > edge;\n\nvoid joinset(int u, int v, int w) {\n\n  if (child[pset[u]].size() > child[pset[v]].size())\n    swap(u, v);\n\n  int pau = pset[u];\n\n  lazy[pset[v]] += w * (child[pset[u]].size());\n\n  for (int cu : child[pset[u]]) {\n\n    ans[cu] += lazy[pset[u]] + w * child[pset[v]].size() - lazy[pset[v]];\n  }\n\n  for (int cu : child[pset[u]])\n    child[pset[v]].push_back(cu), pset[cu] = pset[v];\n\n  child[pau].clear();\n}\n\nsigned main() {\n\n  ios::sync_with_stdio(0);\n  cin.tie(0);\n  cout.tie(0);\n\n  cin >> n;\n\n  for (int i = 1; i < n; ++i) {\n\n    int u, v, w;\n    cin >> u >> v >> w;\n\n    edge.push_back(make_pair(w, make_pair(u, v)));\n  }\n\n  sort(edge.begin(), edge.end());\n\n  for (int i = 1; i <= n; ++i)\n    pset[i] = i, child[i].push_back(i);\n\n  for (int i = edge.size() - 1; i >= 0; --i) {\n\n    joinset(edge[i].second.first, edge[i].second.second, edge[i].first);\n  }\n\n  for (int i = 1; i <= n; ++i)\n    cout << ans[i] + lazy[pset[i]] << \"\\n\";\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 1e5 + 5;\n\nstruct edge {\n\n  int u, v;\n\n  long long w;\n\n  edge(int a, int b, long long c) : u(a), v(b), w(c) {}\n};\n\nlong long lazy[N], res[N];\n\nint n, p[N];\n\nvector<vector<int> > sets;\n\nvector<edge> E;\n\nbool cmp(edge &a, edge &b) { return a.w < b.w; }\n\nvoid dsu(int i, int j, long long w) {\n\n  for (int k = 0; k < sets[i].size(); k++) {\n\n    res[sets[i][k]] += lazy[i] - lazy[j] + w * sets[j].size();\n\n    p[sets[i][k]] = j;\n  }\n\n  for (int k = 0; k < sets[i].size(); k++) {\n\n    sets[j].push_back(sets[i][k]);\n  }\n\n  sets[i].clear();\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  sets.assign(n + 1, vector<int>());\n\n  for (int i = 1; i <= n; i++) {\n\n    p[i] = i;\n\n    sets[i].push_back(i);\n  }\n\n  for (int i = 1; i < n; i++) {\n\n    int u, v;\n\n    long long w;\n\n    cin >> u >> v >> w;\n\n    E.push_back(edge(u, v, w));\n  }\n\n  sort(E.begin(), E.end(), cmp);\n\n  reverse(E.begin(), E.end());\n\n  for (int i = 0; i < E.size(); i++) {\n\n    int u = p[E[i].u];\n\n    int v = p[E[i].v];\n\n    int w = E[i].w;\n\n    if (sets[u].size() > sets[v].size()) {\n\n      swap(u, v);\n    }\n\n    lazy[v] += w * sets[u].size();\n\n    dsu(u, v, w);\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    cout << res[i] + lazy[p[i]] << \"\\n\";\n  }\n}"}
{"fast_code_id":"80a2e2cf6beeb32f1adb0d17110943bea57c97ab667270584213d8ca963363ea","fast_id":"a7cd77cd4d195f8f2820aa76f42a06fbd43bca872015c2a0ede6486becc539d6","fast_time":0.032782798,"language":"cpp","measured_fast_code_id":"a7cd77cd4d195f8f2820aa76f42a06fbd43bca872015c2a0ede6486becc539d6","measured_slow_code_id":"fb00d511459b4410b132cf5b77d30daacb02b9a1ad4a4ef71de7739cb5403da9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_32611","problem_id":"p00092","slow_code_id":"26709ee313fa5fc437f1c417e0893c3d9cfa4e1d5bb048456dd6152142d9436b","slow_id":"fb00d511459b4410b132cf5b77d30daacb02b9a1ad4a4ef71de7739cb5403da9","slow_time":0.237435105,"speedup":7.242673581431335,"stratum":"4-8","sampling_key":"e8ae21d34282774b31931b85af0b350f1b87c9b25fa8c75346244fa6ae521c58","slow_code":"\n\n#include <stdio.h>\n\n#include <queue>\n\nusing namespace std;\n\nint ifield[1001][1001] = {0};\n\nint main()\n\n{\n\n  queue<int> x, y, longth;\n\n  int n, memlongth, ans;\n\n  int dx1[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1},\n      dy1[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1}, dx2[3] = {1, 0, 1},\n      dy2[3] = {0, 1, 1};\n\n  while (1)\n\n  {\n\n    memlongth = 0;\n\n    char cfield[1010][1010] = {0}, N;\n\n    scanf(\"%d\", &n);\n\n    if (n == 0)\n      return 0;\n\n    scanf(\"%c\", &N);\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      for (int j = 0; j < n + 1; j++)\n\n      {\n\n        ifield[j][i] = 0;\n      }\n    }\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      for (int j = 0; j < n + 1; j++)\n\n      {\n\n        scanf(\"%c\", &cfield[j][i]);\n\n        if (cfield[j][i] == '*')\n\n        {\n\n          x.push(j);\n\n          y.push(i);\n\n          longth.push(0);\n\n          ifield[j][i] = 9;\n        }\n      }\n    }\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      for (int j = 0; j < n; j++)\n\n      {\n\n        if (ifield[j][i] == 0 && (i == 0 || i == n - 1 || j == 0 || j == n - 1))\n\n        {\n\n          ifield[j][i] = 1;\n\n          x.push(j);\n\n          y.push(i);\n\n          longth.push(1);\n\n          memlongth = 1;\n        }\n      }\n    }\n\n    while (x.size())\n\n    {\n\n      for (int i = 0; i < 9; i++)\n\n      {\n\n        if (0 <= x.front() + dx1[i] && x.front() + dx1[i] < n &&\n\n            0 <= y.front() + dy1[i] && y.front() + dy1[i] < n &&\n\n            ifield[x.front() + dx1[i]][y.front() + dy1[i]] == 0)\n\n        {\n\n          ifield[x.front() + dx1[i]][y.front() + dy1[i]] = longth.front() + 1;\n\n          x.push(x.front() + dx1[i]);\n\n          y.push(y.front() + dy1[i]);\n\n          longth.push(longth.front() + 1);\n\n          memlongth = longth.front() + 1;\n        }\n      }\n\n      x.pop();\n\n      y.pop();\n\n      longth.pop();\n    }\n\n    if (memlongth == 0)\n      ans = 0;\n\n    else\n      ans = memlongth * 2 - 1;\n\n    for (int i = 0; i < n - 1; i++)\n\n    {\n\n      for (int j = 0; j < n - 1; j++)\n\n      {\n\n        if (ifield[j][i] == memlongth)\n\n        {\n\n          for (int k = 0; k < 3; k++)\n\n          {\n\n            if (ifield[j + dx2[k]][i + dy2[k]] == memlongth)\n              ;\n\n            else\n              break;\n\n            if (k == 2)\n              ans = memlongth * 2;\n          }\n        }\n      }\n    }\n\n    printf(\"%d\\n\", ans);\n  }\n}","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n, ans = 0;\n\n  int dp[1100][1100];\n\n  char field;\n\n  while (scanf(\"%d\", &n), n)\n\n  {\n\n    for (int i = 0; i < n; i++)\n\n      for (int j = 0; j < n; j++)\n\n      {\n\n        scanf(\" %c\", &field);\n\n        dp[j + 1][i + 1] = 0;\n\n        if (field == '*')\n          dp[j + 1][i + 1] = -1;\n      }\n\n    for (int i = 1; i < n + 1; i++)\n\n    {\n\n      for (int j = 1; j < n + 1; j++)\n\n      {\n\n        if (dp[j][i] == -1)\n          ;\n\n        else if (j == 1 || i == 1)\n          dp[j][i] = 1;\n\n        else\n          dp[j][i] = max(\n              1, min(dp[j - 1][i - 1], min(dp[j - 1][i], dp[j][i - 1])) + 1);\n\n        ans = max(ans, dp[j][i]);\n      }\n    }\n\n    printf(\"%d\\n\", ans);\n\n    ans = 0;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"d75d37ee901528a0c1c5e51ff8158989832bc417334bfff121d01eefd2330d48","fast_id":"a1956b96e051816579fd0b6f9f259e5a8c7135d9e62d7810735d5892c1f5306c","fast_time":0.0603945977,"language":"cpp","measured_fast_code_id":"a1956b96e051816579fd0b6f9f259e5a8c7135d9e62d7810735d5892c1f5306c","measured_slow_code_id":"8daff0fd24739d44e0a8e86fc795c3ec6d1a2c5a6ca765b37a81fc56cf6f5d97","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3262","problem_id":"p01812","slow_code_id":"aecc0224e68ff1401d180c2d97e27ae99da26cfc3765010e12c42df0ec8c1cd9","slow_id":"8daff0fd24739d44e0a8e86fc795c3ec6d1a2c5a6ca765b37a81fc56cf6f5d97","slow_time":0.1839723414,"speedup":3.046172147943623,"stratum":"2-4","sampling_key":"76176411c3ac76c4cfa0ab9ac2e8aba3b336c8f5d7b1f9d17dfe0c9bdf45a76b","slow_code":"#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <string>\n\n#include <cstring>\n\n#include <deque>\n\n#include <list>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <utility>\n\n#include <algorithm>\n\n#include <map>\n\n#include <set>\n\n#include <complex>\n\n#include <cmath>\n\n#include <limits>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <ctime>\n\n#include <cassert>\n\n#include <numeric>\n\n#include <functional>\n\nusing namespace std;\n\n#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)\n\n#define repq(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)\n\n#define repr(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)\n\n#define int long long int\n\ntemplate <typename T> void chmax(T &a, T b) { a = max(a, b); }\n\ntemplate <typename T> void chmin(T &a, T b) { a = min(a, b); }\n\ntemplate <typename T> void chadd(T &a, T b) { a = a + b; }\n\ntypedef pair<int, int> pii;\n\ntypedef long long ll;\n\nint dx[] = {0, 0, 1, -1};\n\nint dy[] = {1, -1, 0, 0};\n\nconstexpr ll INF = 1001001001001001LL;\n\nconstexpr ll MOD = 1000000007LL;\n\nint N, M, K;\n\nconst int EXPN = 1 << 16;\n\nint d[20], v[110][110];\n\nbool dp[EXPN - 1][30];\n\nint dark[110];\n\nint to[EXPN - 1][110];\n\nint dist[EXPN - 1];\n\nbool visited[EXPN - 1];\n\nsigned main() {\n\n  memset(dp, false, sizeof(dp));\n\n  memset(dark, -1, sizeof(dark));\n\n  memset(visited, false, sizeof(visited));\n\n  cin >> N >> M >> K;\n\n  rep(i, 0, M) {\n\n    cin >> d[i];\n\n    d[i]--;\n\n    dark[d[i]] = i;\n  }\n\n  rep(i, 0, N) rep(j, 0, K) {\n\n    cin >> v[i][j];\n\n    v[i][j]--;\n\n    if (dark[v[i][j]] == -1)\n      v[i][j] = -1;\n\n    else\n      v[i][j] = dark[v[i][j]];\n  }\n\n  rep(j, 0, K) {\n\n    rep(bit, 0, 1 << M) {\n\n      int nbit = 0;\n\n      rep(i, 0, M) {\n\n        if (bit >> i & 1) {\n\n          if (v[d[i]][j] < 0)\n            continue;\n\n          int val = 1 << v[d[i]][j];\n\n          nbit |= val;\n        }\n      }\n\n      to[bit][j] = nbit;\n    }\n  }\n\n  rep(i, 0, 1 << M) dist[i] = INF;\n\n  dist[(1 << M) - 1] = 0;\n\n  queue<int> q;\n\n  q.push((1 << M) - 1);\n\n  while (!q.empty()) {\n\n    int t = q.front();\n    q.pop();\n\n    rep(i, 0, K) {\n\n      int nx = to[t][i];\n\n      if (dist[nx] > dist[t] + 1) {\n\n        dist[nx] = dist[t] + 1;\n\n        q.push(nx);\n      }\n    }\n  }\n\n  cout << dist[0] << endl;\n\n  return 0;\n}","fast_code":"\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <string>\n\n#include <cstring>\n\n#include <deque>\n\n#include <list>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <utility>\n\n#include <algorithm>\n\n#include <map>\n\n#include <set>\n\n#include <complex>\n\n#include <cmath>\n\n#include <limits>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <ctime>\n\n#include <cassert>\n\n#include <numeric>\n\n#include <fstream>\n\n#include <functional>\n\n#include <bitset>\n\nusing namespace std;\n\nusing ll = long long int;\n\nusing int64 = long long int;\n\ntemplate <typename T> void chmax(T &a, T b) { a = max(a, b); }\n\ntemplate <typename T> void chmin(T &a, T b) { a = min(a, b); }\n\ntemplate <typename T> void chadd(T &a, T b) { a = a + b; }\n\nint dx[] = {0, 0, 1, -1};\n\nint dy[] = {1, -1, 0, 0};\n\nconst int INF = 1LL << 29;\n\nconst ll LONGINF = 1LL << 60;\n\nconst ll MOD = 1000000007LL;\n\nint main() {\n\n  int N, M, K;\n  cin >> N >> M >> K;\n\n  vector<int> D(M);\n\n  for (int i = 0; i < M; i++)\n    cin >> D[i], D[i]--;\n\n  vector<int> id(N, -1);\n\n  for (int i = 0; i < M; i++)\n    id[D[i]] = i;\n\n  vector<vector<int> > to(N, vector<int>(K));\n\n  for (int i = 0; i < N; i++) {\n\n    for (int j = 0; j < K; j++) {\n\n      cin >> to[i][j];\n      to[i][j]--;\n    }\n  }\n\n  vector<int> dp(1 << M, INF);\n\n  dp[(1 << M) - 1] = 0;\n\n  queue<pair<int, int> > que;\n\n  que.emplace((1 << M) - 1, 0);\n\n  while (que.size()) {\n\n    int bit, cost;\n    tie(bit, cost) = que.front();\n    que.pop();\n\n    if (dp[bit] < cost)\n      continue;\n\n    for (int i = 0; i < K; i++) {\n\n      int nbit = 0;\n\n      for (int x = 0; x < M; x++) {\n\n        if (!(bit >> x & 1))\n          continue;\n\n        int p = to[D[x]][i];\n\n        if (id[p] >= 0)\n          nbit |= (1 << id[p]);\n      }\n\n      if (dp[nbit] > dp[bit] + 1) {\n\n        dp[nbit] = dp[bit] + 1;\n\n        que.emplace(nbit, dp[nbit]);\n      }\n    }\n  }\n\n  printf(\"%d\\n\", dp[0]);\n\n  return 0;\n}\n"}
{"fast_code_id":"cfbcc6c9286769bfc7863046adb483990cb8c236ebc9052ea4039f153c298022","fast_id":"a7d8ed89ce84bd1b7cfc83a87f2c8d80981c6e957af803dff6d6918af6450168","fast_time":0.0044260911,"language":"cpp","measured_fast_code_id":"a7d8ed89ce84bd1b7cfc83a87f2c8d80981c6e957af803dff6d6918af6450168","measured_slow_code_id":"21189340bd659523439953775e0bd7f87ee76c36130c3def305e353362677a22","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_32629","problem_id":"p03167","slow_code_id":"af57337ee8a0c4ebb3e68fc7f7dc2f9dab570c3a8f32f83760407e12914c1907","slow_id":"21189340bd659523439953775e0bd7f87ee76c36130c3def305e353362677a22","slow_time":0.2415661217,"speedup":54.577756363848906,"stratum":"8+","sampling_key":"08f199ee1e35843e8dad643d707540f7e82bed291d504e8172bae10448f184a8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define N 1050\n\ntypedef long long ll;\n\nint ir, ic, grid[N][N];\n\nll memo[N][N];\n\nconst ll m = (ll)1e9 + 7;\n\nbool inside(int r, int c) { return r >= 1 && r <= ir && c >= 1 && c <= ic; }\n\nll add(ll a, ll b) { return ((a % m) + (b % m)) % m; }\n\nll dp(int r, int c) {\n\n  if (r == ir && c == ic)\n    return 1;\n\n  if (grid[r][c] == -1)\n    return 0;\n\n  if (!inside(r, c))\n    return 0;\n\n  ll &sol = memo[r][c];\n\n  if (sol != -1)\n    return sol;\n\n  return sol = add(dp(r + 1, c), dp(r, c + 1));\n}\n\nint main() {\n\n  scanf(\"%d%d\", &ir, &ic);\n\n  for (int r = 1; r <= ir; r++) {\n\n    char inp[N];\n    scanf(\"%s\", inp);\n\n    for (int c = 0; c < strlen(inp); c++) {\n\n      int keep = 0;\n\n      if (inp[c] == '#')\n        keep = -1;\n\n      grid[r][c + 1] = keep;\n    }\n  }\n\n  memset(memo, -1, sizeof memo);\n\n  printf(\"%lld\\n\", dp(1, 1));\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nconst int maxn = 1e3 + 5;\n\nconst int inf = 1e9 + 7;\n\nchar G[maxn][maxn];\n\nbool vis[maxn][maxn];\n\nlong long dp[maxn][maxn];\n\nlong long step;\n\nint n, m;\n\nlong long dfs(int x, int y) {\n\n  if (vis[x][y])\n    return dp[x][y];\n\n  if (x == n && y == m - 1)\n    return 1;\n\n  vis[x][y] = 1;\n\n  if (G[x + 1][y] == '.')\n    dp[x][y] += dfs(x + 1, y);\n\n  if (G[x][y + 1] == '.')\n    dp[x][y] += dfs(x, y + 1);\n\n  return dp[x][y] % inf;\n}\n\nint main() {\n\n  int ans;\n\n  scanf(\"%d%d \", &n, &m);\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%s\", G[i]);\n  }\n\n  ans = dfs(1, 0) % inf;\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"1bfb28d8372b8aef9eaffcfa8ad2cadbd32fb1459f68a26b96bebcf174b136d1","fast_id":"3806890704117c7ccc57c9ec317a496fc21b0f89ba2fc63747c59098c3580ab9","fast_time":0.0218062033,"language":"cpp","measured_fast_code_id":"3806890704117c7ccc57c9ec317a496fc21b0f89ba2fc63747c59098c3580ab9","measured_slow_code_id":"b4191b98591a575b13ce5190f8134378ba42f130b5af0e9f01b6cd5a1b58b2d8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3264","problem_id":"p02665","slow_code_id":"c79653db30d855549e002fd6b972a1d80aa12d128cb209c2af1bcde0729850a7","slow_id":"b4191b98591a575b13ce5190f8134378ba42f130b5af0e9f01b6cd5a1b58b2d8","slow_time":0.1075525437,"speedup":4.932199439780514,"stratum":"4-8","sampling_key":"0d1c63667f38ae5887a73a1d7e0dee0536f09ec52dac8346baeb11a76503039d","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx2\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int A[100100];\n\n  ll B[100100];\n\n  cin >> A[0];\n\n  B[0] = 1;\n\n  if (A[0] > 1) {\n\n    printf(\"-1\\n\");\n\n    return 0;\n  }\n\n  int OK = 1;\n\n  int i = 1;\n\n  for (; i <= N; i++) {\n\n    cin >> A[i];\n\n    B[i] = (B[i - 1] - A[i - 1]) * 2;\n\n    if (B[i] < A[i])\n      OK = 0;\n\n    if (B[i] > 2e8) {\n\n      i++;\n\n      break;\n    }\n  }\n\n  if (!OK) {\n\n    printf(\"-1\\n\");\n\n    return 0;\n  }\n\n  for (; i <= N; i++) {\n\n    cin >> A[i];\n\n    B[i] = (B[i - 1] - A[i - 1]) * 2;\n\n    if (B[i] > 1e13) {\n\n      B[i] = 1e13;\n\n      i++;\n\n      break;\n    }\n  }\n\n  for (; i <= N; i++) {\n\n    cin >> A[i];\n\n    B[i] = 1e13;\n  }\n\n  ll kotae = 0;\n\n  ll kari = 0;\n\n  for (int i = N; i >= 0; i--) {\n\n    kari += A[i];\n\n    kotae += min(kari, B[i]);\n  }\n\n  printf(\"%lld\\n\", kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int CM = 1 << 17, CL = 12;\n\nchar cn[CM + CL], *ci = cn + CM + CL, *owa = cn + CM, ct;\n\nconst ll ma0 = 1157442765409226768;\n\nconst ll ma1 = 1085102592571150095;\n\nconst ll ma2 = 71777214294589695;\n\nconst ll ma3 = 281470681808895;\n\nconst ll ma4 = 4294967295;\n\ninline int getint() {\n\n  if (ci - owa > 0) {\n\n    memcpy(cn, owa, CL);\n\n    ci -= CM;\n\n    fread(cn + CL, 1, CM, stdin);\n  }\n\n  ll tmp = *(ll *)ci;\n\n  int dig = ((tmp & ma0) ^ ma0) ? 68 - __builtin_ctzll((tmp & ma0) ^ ma0) : 0;\n\n  tmp = tmp << dig & ma1;\n\n  tmp = tmp * 10 + (tmp >> 8) & ma2;\n\n  tmp = tmp * 100 + (tmp >> 16) & ma3;\n\n  tmp = tmp * 10000 + (tmp >> 32) & ma4;\n\n  ci += (64 - dig >> 3);\n\n  while ((ct = *ci++) >= '0')\n    tmp = tmp * 10 + ct - '0';\n\n  return tmp;\n}\n\nint main() {\n\n  int N = getint();\n\n  int A[100100];\n\n  ll B[100100];\n\n  A[0] = getint();\n\n  B[0] = 1;\n\n  if (A[0] > 1) {\n\n    printf(\"-1\\n\");\n\n    return 0;\n  }\n\n  int OK = 1;\n\n  int i = 1;\n\n  for (; i <= N; i++) {\n\n    A[i] = getint();\n\n    B[i] = (B[i - 1] - A[i - 1]) * 2;\n\n    if (B[i] < A[i])\n      OK = 0;\n\n    if (B[i] > 2e8) {\n\n      i++;\n\n      break;\n    }\n  }\n\n  if (!OK) {\n\n    printf(\"-1\\n\");\n\n    return 0;\n  }\n\n  for (; i <= N; i++) {\n\n    A[i] = getint();\n\n    B[i] = (B[i - 1] - A[i - 1]) * 2;\n\n    if (B[i] > 1e13) {\n\n      B[i] = 1e13;\n\n      i++;\n\n      break;\n    }\n  }\n\n  for (; i <= N; i++) {\n\n    A[i] = getint();\n\n    B[i] = 1e13;\n  }\n\n  ll kotae = 0;\n\n  ll kari = 0;\n\n  for (int i = N; i >= 0; i--) {\n\n    kari += A[i];\n\n    kotae += min(kari, B[i]);\n  }\n\n  printf(\"%lld\\n\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"cba4c39a514518698a44bd5527a6064faea1d72e24909c49ed3b73c803f986b3","fast_id":"f590712aaa2716decd0cdbde0e98c8072ffdbf731c40a601edd7073bbca220c2","fast_time":0.0387980256,"language":"cpp","measured_fast_code_id":"f590712aaa2716decd0cdbde0e98c8072ffdbf731c40a601edd7073bbca220c2","measured_slow_code_id":"c58e096800a01c0eeeb763df8f7ae0dc59efadc2d5d2e692bacbad79f8bd891e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3329","problem_id":"p02289","slow_code_id":"8bfc0d0c8d087d2cb110aa45489cacae4ac11e37982db233925cbf83092d0bf1","slow_id":"c58e096800a01c0eeeb763df8f7ae0dc59efadc2d5d2e692bacbad79f8bd891e","slow_time":0.1229271123,"speedup":3.168385772187335,"stratum":"2-4","sampling_key":"7c7edd9d4e65bd7fef811edcdc1cbca8d94203602bb9df1f84c8c0143e5bd9fe","slow_code":"#include <iostream>\n\nusing namespace std;\n\n#include <stdio.h>\n\n#include <string>\n\nvoid max_heapify(int *A, int i, int H)\n\n{\n\n  int l = 2 * i, r = 2 * i + 1;\n\n  if (l > H && r > H)\n    return;\n\n  int maxid = i, x;\n\n  if (l <= H)\n    maxid = (A[l] > A[maxid] ? l : maxid);\n\n  if (r <= H)\n    maxid = (A[r] > A[maxid] ? r : maxid);\n\n  if (maxid == i)\n    return;\n\n  x = A[maxid];\n  A[maxid] = A[i];\n  A[i] = x;\n\n  max_heapify(A, maxid, H);\n}\n\nint main()\n\n{\n\n  int A[2000001];\n\n  int i, H, key, x;\n\n  char cmd[8];\n\n  scanf(\"%d\", &H);\n\n  for (i = 1; i <= H; i++)\n    scanf(\"%d\", &A[i]);\n\n  H = 0;\n\n  while (1) {\n\n    scanf(\"%s\", cmd);\n\n    if (cmd[2] == 'd')\n      break;\n\n    if (cmd[2] == 't') {\n\n      if (H == 0)\n        continue;\n\n      printf(\"%d\\n\", A[1]);\n\n      A[1] = A[H];\n      H--;\n\n      if (H > 0)\n        max_heapify(A, 1, H);\n\n    } else {\n\n      cin >> key;\n      H++;\n\n      A[H] = key;\n      i = H;\n\n      while (i > 1) {\n\n        if (A[i] <= A[i / 2])\n          break;\n\n        x = A[i];\n\n        A[i] = A[i / 2];\n\n        A[i / 2] = x;\n\n        i = i / 2;\n      };\n    }\n  };\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string>\n\nvoid max_heapify(int *A, int i, int H)\n\n{\n\n  int l = 2 * i, r = 2 * i + 1;\n\n  if (l > H && r > H)\n    return;\n\n  int maxid = i, x;\n\n  if (l <= H)\n    maxid = (A[l] > A[maxid] ? l : maxid);\n\n  if (r <= H)\n    maxid = (A[r] > A[maxid] ? r : maxid);\n\n  if (maxid == i)\n    return;\n\n  x = A[maxid];\n  A[maxid] = A[i];\n  A[i] = x;\n\n  max_heapify(A, maxid, H);\n}\n\nint main()\n\n{\n\n  int A[2000001];\n\n  int i, H, key;\n\n  char cmd[8];\n\n  scanf(\"%d\", &H);\n\n  for (i = 1; i <= H; i++)\n    scanf(\"%d\", &A[i]);\n\n  H = 0;\n\n  while (1) {\n\n    scanf(\"%s\", cmd);\n\n    if (cmd[2] == 'd')\n      break;\n\n    if (cmd[2] == 't') {\n\n      if (H == 0)\n        continue;\n\n      printf(\"%d\\n\", A[1]);\n\n      A[1] = A[H];\n      H--;\n\n      if (H > 0)\n        max_heapify(A, 1, H);\n\n    } else {\n\n      scanf(\"%d\", &key);\n\n      i = ++H;\n\n      while (i > 1) {\n\n        if (A[i / 2] > key)\n          break;\n\n        A[i] = A[i / 2];\n\n        i /= 2;\n      };\n\n      A[i] = key;\n    }\n  };\n\n  return 0;\n}"}
{"fast_code_id":"a6f57dacb55c180029c8558c4d9e6f8e969bf1cdae0e667a79dd2c4266f392a8","fast_id":"eecf30a952df3e23b43752c08084370de26e0a7b4dec7e7d33cf367ae0803b0f","fast_time":0.0001914229,"language":"cpp","measured_fast_code_id":"eecf30a952df3e23b43752c08084370de26e0a7b4dec7e7d33cf367ae0803b0f","measured_slow_code_id":"04b39af84d6cc3c2d97795aaa98c8197973e59fe6c20c20eb013954344346809","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3336","problem_id":"p03800","slow_code_id":"184379e92c24a6931c424ed532b9546a0936723e1f8d1e6ab7e1afbc313d7b7c","slow_id":"04b39af84d6cc3c2d97795aaa98c8197973e59fe6c20c20eb013954344346809","slow_time":0.0014280375,"speedup":7.46011840798567,"stratum":"4-8","sampling_key":"28b2d40da411d7de947e30d200f19fa435b059c3dc2498072bf37917379d09a6","slow_code":"#include <iostream>\n\n#include <cstring>\n\nusing namespace std;\n\nint an[4][2] = {{2, 2}, {2, 1}, {1, 1}, {1, 2}};\n\nint i, j, kind[100005], n;\n\nchar ans[100005];\n\nint main()\n\n{\n\n  while (cin >> n && (n >= 3))\n\n  {\n\n    int flag = 0;\n\n    memset(kind, 0, sizeof(kind));\n\n    for (i = 1; i <= n; i++)\n\n    {\n\n      cin >> ans[i];\n    }\n\n    for (j = 0; j < 4; j++)\n\n    {\n\n      kind[1] = an[j][0];\n\n      kind[2] = an[j][1];\n\n      for (i = 2; i <= n; i++)\n\n      {\n\n        if (kind[i] == 2)\n\n        {\n\n          if (ans[i] == 'o')\n            kind[i + 1] = kind[i - 1] % 2 + 1;\n\n          else\n            kind[i + 1] = kind[i - 1];\n\n        }\n\n        else if (kind[i] == 1)\n\n          if (ans[i] == 'x')\n            kind[i + 1] = kind[i - 1] % 2 + 1;\n\n          else\n            kind[i + 1] = kind[i - 1];\n      }\n\n      if (kind[n + 1] == kind[1])\n\n      {\n\n        if (kind[1] == 1)\n\n        {\n\n          if (ans[1] == 'o' && kind[2] == kind[n]) {\n            flag++;\n            break;\n          }\n\n          if (ans[1] == 'x' && kind[2] != kind[n]) {\n            flag++;\n            break;\n          }\n\n        }\n\n        else if (kind[1] == 2)\n\n        {\n\n          if (ans[1] == 'x' && kind[2] == kind[n]) {\n            flag++;\n            break;\n          }\n\n          if (ans[1] == 'o' && kind[2] != kind[n]) {\n            flag++;\n            break;\n          }\n        }\n      }\n    }\n\n    if (flag == 0)\n      cout << \"-1\" << endl;\n\n    else\n\n    {\n\n      for (i = 1; i <= n; i++)\n\n      {\n\n        if (kind[i] == 1)\n          cout << 'S';\n\n        else\n          cout << 'W';\n      }\n\n      cout << endl;\n    }\n  }\n}\n","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\nconst int MAXN = 100011;\n\nint N;\n\nchar str[MAXN];\n\nbool isWolf[MAXN];\n\nvoid Shift() {\n\n  for (int i = 2; i < N; ++i) {\n\n    if (isWolf[i - 1]) {\n\n      if (str[i - 1] == 'x')\n\n        isWolf[i] = isWolf[i - 2];\n\n      else\n        isWolf[i] = !isWolf[i - 2];\n\n    }\n\n    else {\n\n      if (str[i - 1] == 'o')\n\n        isWolf[i] = isWolf[i - 2];\n\n      else\n        isWolf[i] = !isWolf[i - 2];\n    }\n  }\n}\n\nbool Test(int a) {\n\n  int p = a - 1;\n  if (p < 0)\n    p += N;\n\n  int n = a + 1;\n  if (n >= N)\n    n -= N;\n\n  if (isWolf[a] ^ (str[a] == 'o'))\n\n    return isWolf[p] == isWolf[n];\n\n  return isWolf[p] != isWolf[n];\n}\n\nbool Test() {\n\n  bool ret = true;\n\n  for (int i = 0; i < N; ++i) {\n\n    ret &= Test(i);\n  }\n\n  return ret;\n}\n\nvoid Show() {\n\n  for (int i = 0; i < N; ++i) {\n\n    if (isWolf[i])\n\n      printf(\"W\");\n\n    else\n      printf(\"S\");\n  }\n\n  puts(\"\");\n\n  exit(0);\n}\n\nint main() {\n\n  scanf(\"%d\", &N);\n\n  scanf(\"%s\", str);\n\n  isWolf[0] = false;\n  isWolf[1] = false;\n\n  Shift();\n\n  if (Test())\n    Show();\n\n  isWolf[0] = false;\n  isWolf[1] = true;\n\n  Shift();\n\n  if (Test())\n    Show();\n\n  isWolf[0] = true;\n  isWolf[1] = false;\n\n  Shift();\n\n  if (Test())\n    Show();\n\n  isWolf[0] = true;\n  isWolf[1] = true;\n\n  Shift();\n\n  if (Test())\n    Show();\n\n  puts(\"-1\");\n\n  return 0;\n}"}
{"fast_code_id":"53a50eaf04a28600b1e7cb6e6f6f8d07d9a0594cffdb8b9298367c43302b0b81","fast_id":"d0cc97b8715d1e2d2a466d6d4e0d4ebb672e77353eb80059c76b0bd11c2c7223","fast_time":0.0201052992,"language":"cpp","measured_fast_code_id":"d0cc97b8715d1e2d2a466d6d4e0d4ebb672e77353eb80059c76b0bd11c2c7223","measured_slow_code_id":"e008a6fc20a199a10ba46038c5adba606ff8780b15293d8b98f532c6212da3e1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3349","problem_id":"p02584","slow_code_id":"7cdc42ed9871e52279e40ea99bb9f42950637c711f0d2fe2d7c8e2a8740868fd","slow_id":"e008a6fc20a199a10ba46038c5adba606ff8780b15293d8b98f532c6212da3e1","slow_time":0.1068251865,"speedup":5.313285091524527,"stratum":"4-8","sampling_key":"781e3f2d0c511bf52da3c87837724fe5819aeb36ce99c2e6fa5cbef7f0d68ce0","slow_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace __gnu_pbds;\n\nusing namespace std;\n\n#define PI 3.14159265358979323846\n\n#define lp(i, n) for (int i = 0; i < n; i++)\n\n#define rlp(i, n) for (int i = int(n); i >= 0; i--)\n\n#define range1(i, a, b, c) for (int i = int(a); i <= int(b); i += int(c))\n\n#define range(i, a, b) for (int i = int(a); i <= int(b); i++)\n\n#define all(x) (x).begin(), (x).end()\n\n#define pb push_back\n\n#define MP make_pair\n\n#define fr first\n\n#define sc second\n\n#define sz(v) ((int)((v).size()))\n\n#define sfi1(v) scanf(\"%d\", &v)\n\n#define sfi2(v1, v2) scanf(\"%d %d\", &v1, &v2)\n\n#define sfi3(v1, v2, v3) scanf(\"%d %d %d\", &v1, &v2, &v3)\n\n#define sfll1(v) scanf(\"%I64d\", &v);\n\n#define sfll2(v1, v2) scanf(\"%I64d %I64d\", &v1, &v2)\n\n#define sfll3(v1, v2, v3) scanf(\"%I64d %I64d %I64d\", &v1, &v2, &v3)\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef vector<int> vi;\n\ntypedef vector<pair<int, int> > vii;\n\ntypedef pair<int, int> pii;\n\ntemplate <class T>\nusing ordered_set = tree<T,\n\n                         null_type,\n\n                         less<T>,\n\n                         rb_tree_tag,\n\n                         tree_order_statistics_node_update>;\n\nconst ll MOD = 1e9 + 7;\n\nconst int OO = (int)1e6;\n\nconst int N = (int)1e7;\n\nint dx[] = {0, 0, -1, 1};\n\nint dy[] = {1, -1, 0, 0};\n\nvoid init() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n}\n\nvoid _run() {\n\n  ll x, k, d;\n\n  cin >> x >> k >> d;\n\n  ll ans = 0;\n\n  x = abs(x);\n\n  if (x / d > k) {\n\n    cout << x - (k * d) << endl;\n\n    return;\n  }\n\n  ll rem = x / d;\n\n  k -= rem;\n\n  x -= rem * d;\n\n  if (k & 1)\n    x = abs(x - d);\n\n  ans = x;\n\n  cout << x << endl;\n}\n\nint main() {\n\n#ifdef LOCAL_PROJECT\n\n  freopen(\"in.txt\", \"r\", stdin);\n\n#endif\n\n  int t = 1;\n\n  while (t--)\n    _run();\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\ntypedef long long LL;\n\nint main()\n\n{\n\n  LL x, k, d, y, z;\n\n  scanf(\"%lld%lld%lld\", &x, &k, &d);\n\n  if (x < 0)\n    x = -x;\n\n  y = x / d;\n\n  if (y >= k)\n    z = x - d * k;\n\n  else {\n\n    z = x % d;\n\n    if ((k - y) & 1)\n      z = d - z;\n  }\n\n  printf(\"%lld\\n\", z);\n\n  return 0;\n}"}
{"fast_code_id":"c4df9de4bf986561ae692f6c0b1c99471e6a462a094d99d5d902c9eeb8a4a4cc","fast_id":"e66fa3a7fa93cf228f7cec41fbb386adb469657492d73f5f78c15d017c66ee00","fast_time":0.106769806,"language":"cpp","measured_fast_code_id":"e66fa3a7fa93cf228f7cec41fbb386adb469657492d73f5f78c15d017c66ee00","measured_slow_code_id":"a2535703cd3621f9cd75c030d6067feb4d40eeea5a6a59f38b753a8f1dbaf876","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3366","problem_id":"p02780","slow_code_id":"1a3b65acb0c71bc99986e4f644fde508282d77872b5894c2b09015de8528f43f","slow_id":"a2535703cd3621f9cd75c030d6067feb4d40eeea5a6a59f38b753a8f1dbaf876","slow_time":0.2841140551,"speedup":2.6609962661166584,"stratum":"2-4","sampling_key":"6784ffd86e0bed9614ad6f975791c82fa2339bc98089dfec4524b8dd25ee5905","slow_code":"#include <iostream>\n\n#include <iomanip>\n\nint main()\n\n{\n\n  using namespace std;\n\n  int n, k;\n\n  double prefix_sum[200001] = {0}, p[200000], ans = 0;\n\n  cin >> n >> k;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> p[i];\n\n    prefix_sum[i + 1] += ((p[i] + 1) / 2 + prefix_sum[i]);\n  }\n\n  for (int i = 0; i <= n - k; i++) {\n\n    ans = max(ans, prefix_sum[i + k] - prefix_sum[i]);\n  }\n\n  cout << fixed << setprecision(12) << ans << endl;\n}\n","fast_code":"#include <iostream>\n\n#include <iomanip>\n\nusing namespace std;\n\nint main()\n\n{\n\n  double pos[1001];\n\n  double total = 0, sum = 0, maxi = 0;\n\n  for (int i = 1; i <= 1000; i++)\n\n  {\n\n    total += i;\n\n    pos[i] = total / i;\n  }\n\n  int n, k;\n\n  cin >> n >> k;\n\n  int a[n];\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> a[i];\n\n    if (i < k)\n\n    {\n\n      sum += pos[a[i]];\n    }\n  }\n\n  maxi = sum;\n\n  for (int i = k - 1; i < n; i++)\n\n  {\n\n    if (i != k - 1)\n\n    {\n\n      sum += pos[a[i]];\n    }\n\n    if (sum >= maxi)\n\n    {\n\n      maxi = sum;\n    }\n\n    sum -= pos[a[i - k + 1]];\n  }\n\n  cout << fixed << setprecision(1) << maxi << endl;\n\n  return 0;\n}"}
{"fast_code_id":"9b58fa0edd5d1a790621144f321b102cf12c20b0532dc532f10b73bb60c600c0","fast_id":"a7c9df05b3cd9b18472569d4d15be7c9725c8244df01de0a7887ade7e9f5683f","fast_time":0.0176655439,"language":"cpp","measured_fast_code_id":"a7c9df05b3cd9b18472569d4d15be7c9725c8244df01de0a7887ade7e9f5683f","measured_slow_code_id":"c147f39e4433d0cca558367442882416f6ff59599a524f6dc53d6f3ea1647589","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3372","problem_id":"p03743","slow_code_id":"c17f4a3b3cfe3287890eb5212dd52590497732120caa4317802ab8ca86c07677","slow_id":"c147f39e4433d0cca558367442882416f6ff59599a524f6dc53d6f3ea1647589","slow_time":0.0740504385,"speedup":4.191800655512226,"stratum":"4-8","sampling_key":"12b5ce6b1e9bc4ad552f2dc8391560f7ac19a813e7614355df914678e66ba960","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int M = 1e9;\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn;\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N = getint();\n\n  int A[500001];\n\n  *A = getint();\n\n  int d[500000];\n\n  rep(i, N) {\n\n    *(d + i) = getint();\n\n    int ab = *(d + i) - *(A + i);\n\n    if (*(A + i) >= *(d + i))\n      *(A + i + 1) = -ab;\n\n    else if (*(A + i) >= ab)\n      *(A + i + 1) = ab;\n\n    else\n      *(A + i + 1) = *(A + i);\n  }\n\n  int B[500000];\n\n  *(B + N - 1) = 1;\n\n  for (int i = N - 1; i >= 1; i--) {\n\n    if (*(B + i) >= M || *(B + i) * 2 <= *(d + i))\n      *(B + i - 1) = *(B + i);\n\n    else\n      *(B + i - 1) = *(B + i) + *(d + i);\n  }\n\n  int Q = getint();\n\n  char n[3] = {'N', 'O', '\\n'};\n\n  char y[4] = {'Y', 'E', 'S', '\\n'};\n\n  rep(i, Q) {\n\n    int q = getint() - 1;\n\n    if (*(A + q) < *(B + q)) {\n\n      memcpy(di, n, 3);\n\n      di += 3;\n\n    }\n\n    else {\n\n      memcpy(di, y, 4);\n\n      di += 4;\n    }\n  }\n\n  fwrite_unlocked(dn, di - dn, 1, stdout);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn;\n\nint main() {\n\n  int N = getint();\n\n  int A[500001];\n\n  A[0] = getint();\n\n  int d[500000];\n\n  rep(i, N) {\n\n    d[i] = getint();\n\n    A[i + 1] = min(A[i], abs(d[i] - A[i]));\n  }\n\n  int B = 1;\n\n  for (int i = N - 1; i >= 0; i--) {\n\n    A[i] = (A[i] >= B);\n\n    if (B <= 1e9 && B * 2 > d[i])\n      B = B + d[i];\n  }\n\n  int Q = getint();\n\n  rep(i, Q) {\n\n    int q = getint() - 1;\n\n    if (A[q]) {\n\n      *di++ = 'Y';\n\n      *di++ = 'E';\n\n      *di++ = 'S';\n\n      *di++ = '\\n';\n\n    }\n\n    else {\n\n      *di++ = 'N';\n\n      *di++ = 'O';\n\n      *di++ = '\\n';\n    }\n  }\n\n  fwrite_unlocked(dn, di - dn, 1, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"73dcf967683431f69e78a19d77c2927080b65dc7f03f799016b7cadd6f932100","fast_id":"8665933f203c9d07ba1a0aa333121e7f15627c21c9e69ca15a1aea86ad3ed254","fast_time":0.0873843147,"language":"cpp","measured_fast_code_id":"8665933f203c9d07ba1a0aa333121e7f15627c21c9e69ca15a1aea86ad3ed254","measured_slow_code_id":"fe7ce59389b12dc274dd0d9029823b98c7f3e6c8e6477effcd8b3b47bdd9b1c3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3406","problem_id":"p03235","slow_code_id":"91f072101362212a8018f610d6a5807918caa71c56322b561d6d6730f0893439","slow_id":"fe7ce59389b12dc274dd0d9029823b98c7f3e6c8e6477effcd8b3b47bdd9b1c3","slow_time":0.3667846871,"speedup":4.197374418500761,"stratum":"4-8","sampling_key":"4f9912cdca5964b7fc26421bdf70c3b15cfe4a0119c7f0c4e3a873ad299b8888","slow_code":"#include <algorithm>\n\n#include <iostream>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <cmath>\n\n#include <ctime>\n\n#include <queue>\n\n#include <map>\n\n#include <set>\n\n#define LL __int128\n\n#define db double\n\nusing namespace std;\n\nconst int N = 2e5 + 10;\n\nint rd()\n\n{\n\n  int x = 0, w = 1;\n  char ch = 0;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      w = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = x * 10 + (ch ^ 48);\n    ch = getchar();\n  }\n\n  return x * w;\n}\n\nint m0[N << 2], m1[N << 2];\n\n#define mid ((l + r) >> 1)\n\nvoid psup(int o) {\n  m0[o] = max(m0[o << 1], m0[o << 1 | 1]),\n  m1[o] = max(m1[o << 1], m1[o << 1 | 1]);\n}\n\nvoid modif(int o, int l, int r, int x, int y, bool oo)\n\n{\n\n  if (l == r) {\n    !oo ? m0[o] = y : m1[o] = y;\n    return;\n  }\n\n  if (x <= mid)\n    modif(o << 1, l, mid, x, y, oo);\n\n  else\n    modif(o << 1 | 1, mid + 1, r, x, y, oo);\n\n  psup(o);\n}\n\nint quer(int o, int l, int r, int ll, int rr, bool oo)\n\n{\n\n  if (ll <= l && r <= rr)\n    return !oo ? m0[o] : m1[o];\n\n  int an = -(1 << 20);\n\n  if (ll <= mid)\n    an = max(an, quer(o << 1, l, mid, ll, rr, oo));\n\n  if (rr > mid)\n    an = max(an, quer(o << 1 | 1, mid + 1, r, ll, rr, oo));\n\n  return an;\n}\n\nint n, a[N], f[N][2], sm;\n\nbool b[N], an[N];\n\nint main()\n\n{\n\n  memset(m1, -0x3f3f3f, sizeof(m1));\n\n  n = rd();\n\n  for (int i = 1, ma = 0; i <= n; ++i)\n\n  {\n\n    a[i] = rd();\n\n    if (ma < a[i])\n      ma = a[i], b[i] = 1, ++sm;\n  }\n\n  for (int i = n; i; --i)\n\n  {\n\n    f[i][1] = -(1 << 20);\n\n    int xx = b[i] + 1 + max(0, quer(1, 1, n, a[i], n, 0)),\n        yy = b[i] + 1 + max(0, quer(1, 1, n, a[i], n, 1));\n\n    f[i][xx & 1] = max(f[i][xx & 1], xx);\n\n    f[i][yy & 1] = max(f[i][yy & 1], yy);\n\n    modif(1, 1, n, a[i], f[i][0], 0);\n\n    modif(1, 1, n, a[i], f[i][1], 1);\n  }\n\n  int c0 = 0, c1 = 0, mi0 = 0, mi1 = 0;\n\n  for (int i = 1, j = sm; i <= n; ++i)\n\n  {\n\n    j -= b[i];\n\n    modif(1, 1, n, a[i], 0, 0);\n\n    modif(1, 1, n, a[i], -(1 << 20), 1);\n\n    int x = c0 + (a[i] >= mi0) - c1 + j;\n\n    bool o = 0;\n\n    if (quer(1, 1, n, max(mi1, 1), n, x & 1) < x)\n\n    {\n\n      x = c1 - (c0 + (a[i] >= mi0)) + j;\n\n      o = x < 0 || quer(1, 1, n, max(mi0, a[i]), n, x & 1) < x;\n    }\n\n    if (o)\n      an[i] = 1, c1 += a[i] >= mi1, mi1 = max(mi1, a[i]);\n\n    else\n      c0 += a[i] >= mi0, mi0 = max(mi0, a[i]);\n  }\n\n  c0 = c1 = 0;\n\n  for (int i = 1, mm0 = 0, mm1 = 0; i <= n; ++i)\n\n  {\n\n    if (!an[i])\n\n    {\n\n      if (mm0 < a[i])\n        mm0 = a[i], ++c0;\n\n    }\n\n    else\n\n    {\n\n      if (mm1 < a[i])\n        mm1 = a[i], ++c1;\n    }\n  }\n\n  if (c0 != c1)\n    puts(\"-1\");\n\n  else\n    for (int i = 1; i <= n; ++i)\n      printf(\"%d\", an[i]);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint gi() {\n\n  int res = 0, w = 1;\n\n  char ch = getchar();\n\n  while (ch != '-' && !isdigit(ch))\n    ch = getchar();\n\n  if (ch == '-')\n    w = -1, ch = getchar();\n\n  while (isdigit(ch))\n    res = res * 10 + ch - '0', ch = getchar();\n\n  return res * w;\n}\n\nconst int INF = 1e9;\n\nconst int MAX_N = 2e5 + 5;\n\nint N, a[MAX_N], val[MAX_N];\n\n#define lson (o << 1)\n\n#define rson (o << 1 | 1)\n\nstruct SGT {\n\n  int mx[MAX_N << 2];\n\n  void pushup(int o) { mx[o] = max(mx[lson], mx[rson]); }\n\n  void build(int o = 1, int l = 1, int r = N) {\n\n    if (l == r)\n      return (void)(mx[o] = -INF);\n\n    int mid = (l + r) >> 1;\n\n    build(lson, l, mid), build(rson, mid + 1, r);\n\n    pushup(o);\n  }\n\n  void mdf(int pos, int v, int o = 1, int l = 1, int r = N) {\n\n    if (l == r)\n      return (void)(mx[o] = v);\n\n    int mid = (l + r) >> 1;\n\n    if (pos <= mid)\n      mdf(pos, v, lson, l, mid);\n\n    else\n      mdf(pos, v, rson, mid + 1, r);\n\n    pushup(o);\n  }\n\n  int qry(int ql, int qr, int o = 1, int l = 1, int r = N) {\n\n    if (ql <= l && r <= qr)\n      return mx[o];\n\n    int mid = (l + r) >> 1, res = -INF;\n\n    if (ql <= mid)\n      res = max(res, qry(ql, qr, lson, l, mid));\n\n    if (qr > mid)\n      res = max(res, qry(ql, qr, rson, mid + 1, r));\n\n    return res;\n  }\n\n} t[2];\n\nint cnt[MAX_N];\n\nbool check(int mx, int v) {\n\n  if (v < 0)\n    return 0;\n\n  int len = t[v & 1].qry(mx, N);\n\n  return len >= v;\n}\n\nint main() {\n\n  N = gi();\n\n  for (int i = 1, mx = 0; i <= N; i++) {\n\n    a[i] = gi();\n\n    if (a[i] > mx)\n      mx = a[i], val[i] = 2;\n\n    else\n      val[i] = 1;\n  }\n\n  t[1].build();\n\n  for (int i = N; i; i--) {\n\n    int mx0 = t[0].qry(a[i], N), mx1 = t[1].qry(a[i], N);\n\n    if (val[i] & 1)\n      t[0].mdf(a[i], mx1 + 1), t[1].mdf(a[i], mx0 + 1);\n\n    else\n      t[0].mdf(a[i], mx0 + 2), t[1].mdf(a[i], mx1 + 2);\n  }\n\n  for (int i = N; i; i--)\n    cnt[i] = cnt[i + 1] + (val[i] == 2);\n\n  vector<int> ans;\n\n  int cntX = 0, cntY = 0, mxX = 0, mxY = 0;\n\n  for (int i = 1; i <= N; i++) {\n\n    t[1].mdf(a[i], -INF), t[0].mdf(a[i], 0);\n\n    int _1 = cntX, _2 = mxX;\n\n    if (a[i] > mxX)\n      mxX = a[i], ++cntX;\n\n    if (check(mxY, cntX + cnt[i + 1] - cntY) || check(mxX, cntY + cnt[i + 1] - cntX))\n      ans.push_back(0);\n\n    else {\n\n      cntX = _1, mxX = _2;\n\n      if (a[i] > mxY)\n        mxY = a[i], ++cntY;\n\n      ans.push_back(1);\n    }\n  }\n\n  if (cntX != cntY)\n    return puts(\"-1\") & 0;\n\n  for (int i = 0; i < (int)ans.size(); i++)\n    putchar(ans[i] + '0');\n\n  putchar('\\n');\n\n  return 0;\n}"}
{"fast_code_id":"f2c52986eff5b325ca5fb1534ad61edfdfed59716a83dcbe2acf7176ec8b10a2","fast_id":"712b907c82edb93e894a33ae8fc53bc7b5e1b9821f43f2e83c63f6c8565a06e6","fast_time":0.0098774768,"language":"cpp","measured_fast_code_id":"712b907c82edb93e894a33ae8fc53bc7b5e1b9821f43f2e83c63f6c8565a06e6","measured_slow_code_id":"20e0629e2abbf8ec7b43cd287d7a8920384c8357efdd9ba47791b183719eabf7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3410","problem_id":"p03760","slow_code_id":"c07d8592b98ed0b80c0e2a07598ef2263c2227b16cefd90d2f45446877a25041","slow_id":"20e0629e2abbf8ec7b43cd287d7a8920384c8357efdd9ba47791b183719eabf7","slow_time":0.0521783525,"speedup":5.282558851467006,"stratum":"4-8","sampling_key":"1385fd75cc76516ec4cc1fb68f9405ce620a24761dbf6f6c6450c598b1c713b4","slow_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  char o[110], e[110];\n\n  int i, j;\n\n  int lo, le;\n\n  scanf(\"%s\", &o);\n\n  scanf(\"%s\", &e);\n\n  lo = strlen(o);\n\n  le = strlen(e);\n\n  if (lo == le)\n\n  {\n\n    for (i = 0; i <= lo - 1; i++)\n\n    {\n\n      if (i != lo - 1)\n\n        printf(\"%c%c\", o[i], e[i]);\n\n      else if (i == lo - 1)\n\n        printf(\"%c%c\\n\", o[i], e[i]);\n    }\n\n  }\n\n  else if (lo > le)\n\n  {\n\n    for (i = 0; i <= lo - 2; i++)\n\n      printf(\"%c%c\", o[i], e[i]);\n\n    printf(\"%c\\n\", o[lo - 1]);\n  }\n}","fast_code":"#include <stdio.h>\n\nint main() {\n\n  char o[51], s[51];\n\n  scanf(\"%s%s\", o, s);\n\n  int i, j, so = 1, ss = 1;\n\n  while (o[so] != '\\0') {\n    so++;\n  }\n\n  while (s[ss] != '\\0') {\n    ss++;\n  }\n\n  if (so == ss) {\n\n    for (i = 0; i < so; i++) {\n\n      printf(\"%c\", o[i]);\n\n      printf(\"%c\", s[i]);\n    }\n\n  }\n\n  else if (so - ss == 1) {\n\n    for (j = 0; j < ss; j++) {\n\n      printf(\"%c\", o[j]);\n\n      printf(\"%c\", s[j]);\n    }\n\n    printf(\"%c\", o[so - 1]);\n  }\n\n  printf(\"\\n\");\n\n  return 0;\n}"}
{"fast_code_id":"fb87512b0ef6f54a4c9c0ea520f598754e77d9d4a3210d10af36dc877f62cba7","fast_id":"497a66d2de7d131a6abb520fd2635fdeace1c1b3c4234ef2a5ddaeb71ff259c6","fast_time":0.0807435718,"language":"cpp","measured_fast_code_id":"497a66d2de7d131a6abb520fd2635fdeace1c1b3c4234ef2a5ddaeb71ff259c6","measured_slow_code_id":"83d25177980b150f4e482f7bb3b3b2988380bf403e9c08e4a3bc4a7d59131683","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3415","problem_id":"p02370","slow_code_id":"cf90527c11beb374d6b9cb37add2f1cc38a01c9a626a0312bb8e84f54427fbd3","slow_id":"83d25177980b150f4e482f7bb3b3b2988380bf403e9c08e4a3bc4a7d59131683","slow_time":0.2418988043,"speedup":2.9958893185847395,"stratum":"2-4","sampling_key":"2b31258edb119ef7f1309a7378e9a9bf3571ecc9ffedc203eec7b19a9614cf55","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <list>\n\n#include <vector>\n\nusing namespace std;\n\nstatic const int MAX = 100000;\n\nvector<int> G[MAX];\n\nint N;\n\nlist<int> out;\n\nbool V[MAX];\n\nvoid dfs(int u)\n\n{\n\n  V[u] = true;\n\n  for (int i = 0; i < G[u].size(); i++)\n\n  {\n\n    int v = G[u][i];\n\n    if (!V[v])\n      dfs(v);\n  }\n\n  out.push_front(u);\n}\n\nint main()\n\n{\n\n  int s, t, M;\n\n  scanf(\"%d %d\", &N, &M);\n\n  for (int i = 0; i < N; i++)\n\n    V[i] = false;\n\n  for (int i = 0; i < M; i++)\n\n  {\n\n    scanf(\"%d %d\", &s, &t);\n\n    G[s].push_back(t);\n  }\n\n  for (int i = 0; i < N; i++)\n\n  {\n\n    if (!V[i])\n      dfs(i);\n  }\n\n  for (list<int>::iterator it = out.begin(); it != out.end(); it++)\n\n    cout << *it << endl;\n\n  return 0;\n}\n","fast_code":"#include <queue>\n\n#include <vector>\n\n#include <cstdio>\n\n#include <algorithm>\n\nint v, e, in[10005];\n\nstd::queue<int> q;\n\nstd::vector<int> g[10005];\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &v, &e);\n\n  while (e--)\n\n  {\n\n    int x, y;\n\n    scanf(\"%d%d\", &x, &y);\n\n    g[x].push_back(y);\n\n    in[y]++;\n  }\n\n  for (int i = 0; i < v; i++)\n\n    if (!in[i])\n\n      q.push(i);\n\n  while (!q.empty())\n\n  {\n\n    int now = q.front();\n\n    q.pop();\n\n    printf(\"%d\\n\", now);\n\n    for (std::vector<int>::iterator it = g[now].begin(); it != g[now].end(); it++)\n\n      if (!--in[*it])\n\n        q.push(*it);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"0c336733ff4b756f2036a3cdbf11dcf337116f000bba0d25aac901a8f013498d","fast_id":"5506927a605e2db5e2021f406155973aa5583bc9505e5e56e80696719d1cd3fa","fast_time":0.0290150017,"language":"cpp","measured_fast_code_id":"5506927a605e2db5e2021f406155973aa5583bc9505e5e56e80696719d1cd3fa","measured_slow_code_id":"ab5510abdc32641bff00664e3cff29b270554d04c842e63067e3183c16e29a66","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3451","problem_id":"p03503","slow_code_id":"7f525d50118d4dc6e0e57231692a33d4aa43cfc2ee07fe31742f53c3f7e72f5e","slow_id":"ab5510abdc32641bff00664e3cff29b270554d04c842e63067e3183c16e29a66","slow_time":0.1094729367,"speedup":3.7729770906751314,"stratum":"2-4","sampling_key":"be7f05158fd2f38db30ce9521ce0cd436612e35f130fa5e8ee1a16b69e54cb7d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\nconst int INF = 1 << 30;\n\nconst ll LINF = 1LL << 50;\n\nconst int NIL = -1;\n\nconst int MAX = 10000;\n\nconst int mod = 1000000007;\n\nconst double pi = 3.141592653589;\n\nint main() {\n\n  int N;\n  cin >> N;\n\n  vector<int> v(N);\n\n  vector<vector<int> > p(N, vector<int>(11));\n\n  int a;\n\n  for (int i = 0; i < N; i++) {\n\n    int tmp = 0;\n\n    for (int j = 0; j < 10; j++) {\n\n      cin >> a;\n      tmp += a * (1 << j);\n    }\n\n    v[i] = tmp;\n  }\n\n  for (int i = 0; i < N; i++)\n    for (int j = 0; j < 11; j++)\n      cin >> p[i][j];\n\n  int ans = -INF;\n\n  for (int b = 1; b < (1 << 10); b++) {\n\n    int tmp = 0;\n\n    for (int i = 0; i < N; i++) {\n\n      int cnt = 0, c = b & v[i];\n\n      for (int j = 0; j < 10; j++) {\n        if (c & (1 << j))\n          cnt++;\n      }\n\n      tmp += p[i][cnt];\n    }\n\n    ans = max(tmp, ans);\n  }\n\n  cout << ans << '\\n';\n}\n","fast_code":"#include <cstdio>\n\nint N;\n\nint F[100][14];\n\nint P[100][15];\n\nint main() {\n\n  scanf(\"%d\", &N);\n\n  for (int i = 0; i < N; i++) {\n\n    for (int j = 0; j < 10; j++)\n      scanf(\"%d\", &F[i][j]);\n  }\n\n  for (int i = 0; i < N; i++) {\n\n    for (int j = 0; j < 11; j++)\n      scanf(\"%d\", &P[i][j]);\n  }\n\n  int res = -(1 << 30);\n\n  for (int b = 1; b < (1 << 10); b++) {\n\n    int cc = 0;\n\n    for (int i = 0; i < N; i++) {\n\n      int c = 0;\n\n      for (int j = 0; j < 10; j++) {\n\n        if ((b >> j & 1) and F[i][j])\n          c++;\n      }\n\n      cc += P[i][c];\n    }\n\n    if (res < cc)\n      res = cc;\n  }\n\n  printf(\"%d\\n\", res);\n}\n"}
{"fast_code_id":"6648ac5852466b16b0048565d8ad29813bbfe419b7c1c34a0880c6aa8d911f05","fast_id":"9f11ae7eaf1bc38e74376b19446fc17567c0e7ad7181e8efadf942e9f9fc550e","fast_time":0.0010419063,"language":"cpp","measured_fast_code_id":"9f11ae7eaf1bc38e74376b19446fc17567c0e7ad7181e8efadf942e9f9fc550e","measured_slow_code_id":"3ad261f24361022cf164a5fd7577039b8f2039f38943a2f5c1fe61b2696cc479","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3459","problem_id":"p01718","slow_code_id":"792960d1db1b3883cb6be1c77bfc843b9ab3bcdc503797cd5f28fa784dacd795","slow_id":"3ad261f24361022cf164a5fd7577039b8f2039f38943a2f5c1fe61b2696cc479","slow_time":0.0026800957,"speedup":2.572300119502109,"stratum":"2-4","sampling_key":"d1fdbcbe96f340d2e4d54dbb69a8466cbf8598612e07cb070802e55f3fc452a0","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define MOD 1000000007\n\n#define MAX_N 100000\n\n#define MAX_P 200005\n\nint fact[MAX_P];\n\nint extgcd(int a, int b, int &x, int &y) {\n\n  int d = a;\n\n  if (b != 0) {\n\n    d = extgcd(b, a % b, y, x);\n\n    y -= (a / b) * x;\n\n  } else {\n\n    x = 1;\n    y = 0;\n  }\n\n  return d;\n}\n\nint mod_inverse(int a, int m) {\n\n  int x, y;\n\n  extgcd(a, m, x, y);\n\n  return (m + x % m) % m;\n}\n\nint euler_phi(int n) {\n\n  int res = n;\n\n  for (int i = 2; i * i <= n; i++) {\n\n    if (n % i == 0) {\n\n      res = res / i * (i - 1);\n\n      for (; n % i == 0; n /= i)\n        ;\n    }\n  }\n\n  if (n != 1)\n    res = res / n * (n - 1);\n\n  return res;\n}\n\nint euler[MAX_N];\n\nvoid euler_phi2() {\n\n  for (int i = 0; i < MAX_N; i++)\n    euler[i] = i;\n\n  for (int i = 2; i < MAX_N; i++) {\n\n    if (euler[i] == i) {\n\n      for (int j = i; j < MAX_N; j += i)\n        euler[j] = euler[j] / i * (i - 1);\n    }\n  }\n}\n\nint mod_pow(int x, int n, int mod) {\n\n  int res = 1;\n\n  while (n > 0) {\n\n    if (n & 1)\n      (res *= x) %= mod;\n\n    (x *= x) %= mod;\n\n    n >>= 1;\n  }\n\n  return res;\n}\n\nvoid init(int p) {\n\n  fact[0] = 1;\n\n  for (int i = 1; i < MAX_P; i++)\n    fact[i] = (fact[i - 1] * i) % p;\n}\n\nint mod_fact(int n, int p, int &e) {\n\n  e = 0;\n\n  if (n == 0)\n    return 1;\n\n  int res = mod_fact(n / p, p, e);\n\n  e += n / p;\n\n  if (n / p % 2 != 0)\n    return res * (p - fact[n % p]) % p;\n\n  return res * fact[n % p] % p;\n}\n\nint mod_comb(int n, int k, int p) {\n\n  if (n == k || k == 0)\n    return 1;\n\n  int e1, e2, e3;\n\n  int a1 = mod_fact(n, p, e1), a2 = mod_fact(k, p, e2), a3 = mod_fact(n - k, p, e3);\n\n  if (e1 > e2 + e3)\n    return 0;\n\n  return a1 * mod_inverse(a2 * a3 % p, p) % p;\n}\n\nint lcm(int x, int y) { return x / __gcd(x, y) * y; }\n\nstruct RLQ {\n\n  int n;\n\n  vector<int> dat;\n\n  const int def = 1;\n\n  RLQ() {}\n\n  RLQ(int n_) { init(n_); }\n\n  RLQ(int n_, int *a) {\n    init(n_);\n    construct(n_, a);\n  }\n\n  void init(int n_) {\n\n    n = 1;\n\n    while (n < n_)\n      n *= 2;\n\n    dat.clear();\n\n    dat.resize(2 * n - 1, def);\n  }\n\n  void construct(int n_, int *a) {\n\n    for (int i = 0; i < n_; i++)\n      dat[i + n - 1] = a[i];\n\n    for (int i = n - 2; i >= 0; i--)\n\n      dat[i] = lcm(dat[i * 2 + 1], dat[i * 2 + 2]);\n  }\n\n  void update(int k, int a) {\n\n    k += n - 1;\n\n    dat[k] = a;\n\n    while (k > 0) {\n\n      k = (k - 1) / 2;\n\n      dat[k] = lcm(dat[k * 2 + 1], dat[k * 2 + 2]);\n    }\n  }\n\n  int query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n      return dat[k];\n\n    int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\n    int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\n    return lcm(vl, vr);\n  }\n\n  int query(int a, int b) { return query(a, b, 0, 0, n); }\n};\n\nstruct RSQ {\n\n  int n;\n\n  vector<int> dat;\n\n  const int def = 0;\n\n  RSQ() {}\n\n  RSQ(int n_) { init(n_); }\n\n  RSQ(vector<int> v) { init(v); }\n\n  void init(int n_) {\n\n    n = 1;\n\n    while (n < n_)\n      n *= 2;\n\n    dat.clear();\n\n    dat.resize(2 * n - 1, def);\n  }\n\n  void init(vector<int> v) {\n\n    int n_ = v.size();\n\n    init(n_);\n\n    for (int i = 0; i < n_; i++)\n\n      dat[i + n - 1] = v[i];\n\n    for (int i = n - 2; i >= 0; i--)\n\n      dat[i] = (dat[i * 2 + 1] + dat[i * 2 + 2]) % MOD;\n  }\n\n  void update(int k, int a) {\n\n    k += n - 1;\n\n    dat[k] = a;\n\n    while (k > 0) {\n\n      k = (k - 1) / 2;\n\n      dat[k] = (dat[k * 2 + 1] + dat[k * 2 + 2]) % MOD;\n    }\n  }\n\n  int query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n      return dat[k] % MOD;\n\n    int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\n    int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\n    return (vl + vr) % MOD;\n  }\n\n  int query(int a, int b) { return query(a, b, 0, 0, n); }\n};\n\nsigned main() {\n\n  int n, q;\n\n  cin >> n >> q;\n\n  int p[n];\n\n  for (int i = 0; i < n; i++)\n    cin >> p[i];\n\n  for (int i = 0; i < n; i++)\n    p[i]--;\n\n  vector<int> a(n, 0);\n\n  int c[n];\n\n  int x = 1;\n\n  for (int i = 0; i < n; i++) {\n\n    int k = i;\n\n    a[i] = i + 1;\n\n    c[i] = 1;\n\n    while (p[k] != i) {\n\n      k = p[k];\n\n      (a[i] += k + 1) %= MOD;\n\n      c[i]++;\n    }\n\n    x = lcm(x, c[i]);\n  }\n\n  for (int i = 0; i < n; i++)\n\n    (a[i] *= (x / c[i]) % MOD) %= MOD;\n\n  RLQ rlq(n, c);\n\n  RSQ rsq(a);\n\n  init(MOD);\n\n  for (int i = 0; i < q; i++) {\n\n    int l, r;\n\n    cin >> l >> r;\n\n    l--;\n\n    int k = rlq.query(l, r);\n\n    int ans = rsq.query(l, r);\n\n    (ans *= mod_inverse((x / k) % MOD, MOD)) %= MOD;\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing Int = long long;\n\ntemplate <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\ntemplate <typename T>\n\nstruct SegmentTree {\n\n  using F = function<T(T, T)>;\n\n  int n;\n\n  F f;\n\n  T ti;\n\n  vector<T> dat;\n\n  SegmentTree(){};\n\n  SegmentTree(F f, T ti) : f(f), ti(ti) {}\n\n  void init(int n_) {\n\n    n = 1;\n\n    while (n < n_)\n      n <<= 1;\n\n    dat.assign(n << 1, ti);\n  }\n\n  void build(const vector<T> &v) {\n\n    int n_ = v.size();\n\n    init(n_);\n\n    for (int i = 0; i < n_; i++)\n      dat[n + i] = v[i];\n\n    for (int i = n - 1; i; i--)\n\n      dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);\n  }\n\n  void set_val(int k, T x) {\n\n    dat[k += n] = x;\n\n    while (k >>= 1)\n\n      dat[k] = f(dat[(k << 1) | 0], dat[(k << 1) | 1]);\n  }\n\n  T query(int a, int b) {\n\n    T vl = ti, vr = ti;\n\n    for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {\n\n      if (l & 1)\n        vl = f(vl, dat[l++]);\n\n      if (r & 1)\n        vr = f(dat[--r], vr);\n    }\n\n    return f(vl, vr);\n  }\n};\n\nstruct FastIO {\n\n  FastIO() {\n\n    cin.tie(0);\n\n    ios::sync_with_stdio(0);\n  }\n\n} fastio_beet;\n\ntemplate <typename T, T MOD = 1000000007>\n\nstruct Mint {\n\n  T v;\n\n  Mint() : v(0) {}\n\n  Mint(signed v) : v(v) {}\n\n  Mint(long long t) {\n    v = t % MOD;\n    if (v < 0)\n      v += MOD;\n  }\n\n  Mint pow(long long k) {\n\n    Mint res(1), tmp(v);\n\n    while (k) {\n\n      if (k & 1)\n        res *= tmp;\n\n      tmp *= tmp;\n\n      k >>= 1;\n    }\n\n    return res;\n  }\n\n  Mint inv() { return pow(MOD - 2); }\n\n  Mint &operator+=(Mint a) {\n    v += a.v;\n    if (v >= MOD)\n      v -= MOD;\n    return *this;\n  }\n\n  Mint &operator-=(Mint a) {\n    v += MOD - a.v;\n    if (v >= MOD)\n      v -= MOD;\n    return *this;\n  }\n\n  Mint &operator*=(Mint a) {\n    v = 1LL * v * a.v % MOD;\n    return *this;\n  }\n\n  Mint &operator/=(Mint a) { return (*this) *= a.inv(); }\n\n  Mint operator+(Mint a) const { return Mint(v) += a; };\n\n  Mint operator-(Mint a) const { return Mint(v) -= a; };\n\n  Mint operator*(Mint a) const { return Mint(v) *= a; };\n\n  Mint operator/(Mint a) const { return Mint(v) /= a; };\n\n  Mint operator-() { return v ? MOD - v : v; }\n\n  bool operator==(const Mint a) const { return v == a.v; }\n\n  bool operator!=(const Mint a) const { return v != a.v; }\n\n  bool operator<(const Mint a) const { return v < a.v; }\n};\n\nsigned main() {\n\n  int n, q;\n\n  cin >> n >> q;\n\n  vector<int> p(n);\n\n  for (int i = 0; i < n; i++)\n    cin >> p[i], p[i]--;\n\n  using ll = long long;\n\n  using M = Mint<int>;\n\n  using P = pair<M, ll>;\n\n  auto mlcm = [&](ll a, ll b) { return a / __gcd(a, b) * b; };\n\n  auto f = [&](P a, P b) {\n    P c;\n\n    c.second = mlcm(a.second, b.second);\n\n    c.first += a.first * M(c.second / a.second);\n\n    c.first += b.first * M(c.second / b.second);\n\n    return c;\n  };\n\n  P ti(M(0), 1);\n\n  SegmentTree<P> seg(f, ti);\n\n  vector<P> vp(n, ti);\n\n  for (int i = 0; i < n; i++) {\n\n    ll sum = i + 1, cnt = 1, pos = p[i];\n\n    while (pos != i) {\n\n      sum += pos + 1;\n\n      cnt++;\n\n      pos = p[pos];\n    }\n\n    vp[i].first = M(sum);\n\n    vp[i].second = cnt;\n  }\n\n  seg.build(vp);\n\n  for (int i = 0; i < q; i++) {\n\n    int l, r;\n\n    cin >> l >> r;\n\n    l--;\n\n    cout << seg.query(l, r).first.v << \"\\n\";\n  }\n\n  cout << flush;\n\n  return 0;\n}\n"}
{"fast_code_id":"a1faaf8d96dc27bedd8fc02d7819065186f7ece172ad75440961e9518b94a063","fast_id":"19a4f5b022e54a45ea76026da162c6d48ffc8618bc0a45d0a3f2dbff76cac016","fast_time":0.0362686215,"language":"cpp","measured_fast_code_id":"19a4f5b022e54a45ea76026da162c6d48ffc8618bc0a45d0a3f2dbff76cac016","measured_slow_code_id":"3d7ea2b584ee47c8b3b2ea3f28ecd68719a3a4632d276b231cfb69741e9e8166","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34691","problem_id":"p02867","slow_code_id":"b8d9d2aa943d32ac123b083d06d3a3b5643b6330da3dac208bd83c3a40265e05","slow_id":"3d7ea2b584ee47c8b3b2ea3f28ecd68719a3a4632d276b231cfb69741e9e8166","slow_time":0.2326045502,"speedup":6.413382714311323,"stratum":"4-8","sampling_key":"6c9371dfb3a720864aeb72c5e7e001b41e8cfebe3741ff4614d2d896c7a653ab","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\nusing namespace std;\n\n#define maxn 100010\n\n#define mod 1000000007\n\nstruct cv {\n\n  int x, y;\n\n} a[maxn];\n\nint b[maxn];\n\nint cnt;\n\nset<int> s[maxn];\n\nint dp[maxn], du[maxn];\n\nbool cmp(cv p, cv q) {\n\n  if (p.x != q.x)\n    return p.x < q.x;\n\n  return p.y < q.y;\n}\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &a[i].x);\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &a[i].y), b[i] = a[i].y;\n\n  sort(a, a + n, cmp);\n\n  sort(b, b + n);\n\n  cnt = 0;\n\n  int flag = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    if (a[i].x > b[i]) {\n\n      printf(\"No\\n\");\n\n      return 0;\n    }\n\n    if (i < n - 1 && a[i + 1].x < b[i])\n      flag = 1;\n\n    if (i != 0) {\n\n      if (b[i] == b[i - 1])\n        flag = 1;\n    }\n\n    if (i != 0 && a[i].x != a[i - 1].x) {\n\n      cnt++;\n\n      s[cnt].insert(a[i].y);\n\n    }\n\n    else {\n\n      s[cnt].insert(a[i].y);\n\n      if (i != 0)\n        flag = 1;\n    }\n  }\n\n  cnt = 0;\n\n  if (flag) {\n\n    printf(\"Yes\\n\");\n\n    return 0;\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    dp[lower_bound(b, b + n, a[i].y) - b] = i;\n  }\n\n  cnt = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    if (du[i])\n      continue;\n\n    cnt++;\n\n    du[i] = 1;\n\n    int x = dp[i];\n\n    while (du[x] == 0) {\n\n      du[x] = 1;\n\n      x = dp[x];\n    }\n  }\n\n  if (cnt >= 2)\n    printf(\"Yes\\n\");\n\n  else\n    printf(\"No\\n\");\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nnamespace TYC\n\n{\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\nconst int N = 1e5 + 5;\n\nint n, A[N], B[N], P[N];\n\nmap<int, int> idA, idB;\n\ninline int read()\n\n{\n\n  int x = 0, f = 0, ch = getchar();\n\n  while (!isdigit(ch))\n\n    f |= (ch == '-'), ch = getchar();\n\n  while (isdigit(ch))\n\n    x = x * 10 + ch - '0', ch = getchar();\n\n  return f ? -x : x;\n}\n\ninline void End(const int t)\n\n{\n\n  puts(t ? \"Yes\" : \"No\");\n\n  exit(0);\n}\n\nvoid work()\n\n{\n\n  n = read();\n\n  for (int i = 1; i <= n; i++)\n\n    A[i] = read(), idA[A[i]] = i;\n\n  for (int i = 1; i <= n; i++)\n\n    B[i] = read(), idB[B[i]] = i;\n\n  sort(A + 1, A + 1 + n);\n\n  sort(B + 1, B + 1 + n);\n\n  for (int i = 1; i <= n; i++)\n\n    if (A[i] > B[i])\n\n      End(0);\n\n  for (int i = 1; i < n; i++)\n\n    if (A[i] == A[i + 1] || B[i] == B[i + 1])\n\n      End(1);\n\n  for (int i = 1; i <= n; i++)\n\n    if (i < n && A[i + 1] <= B[i])\n\n      End(1);\n\n    else\n\n      P[idA[A[i]]] = idB[B[i]];\n\n  int c = 1, u = P[1];\n\n  while (u != 1)\n\n    c++, u = P[u];\n\n  End(c != n);\n}\n\n}                 \n\nint main()\n\n{\n\n  TYC::work();\n\n  return 0;\n}"}
{"fast_code_id":"d5069244a1f4293e2abd9125bb6e61b5d7db2216c1aeb3eb096cb0dedc726079","fast_id":"2c173dc8ce45a271c2c201eed0483c61ecfc3ebcdf2aedaeddfc0f110bca2887","fast_time":0.0200041771,"language":"cpp","measured_fast_code_id":"2c173dc8ce45a271c2c201eed0483c61ecfc3ebcdf2aedaeddfc0f110bca2887","measured_slow_code_id":"6fd8f78ff9b8f4e7f0c9b2b58f70ac76af99c271d4000fde5de3f1bb1b020cae","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3473","problem_id":"p03060","slow_code_id":"d62154045c3cd91e13b62a5f4755d960c8f20c4cb0bf42bd5d330ca77c0279cc","slow_id":"6fd8f78ff9b8f4e7f0c9b2b58f70ac76af99c271d4000fde5de3f1bb1b020cae","slow_time":0.1055116428,"speedup":5.274480538367159,"stratum":"4-8","sampling_key":"24dcc5530975aa8f1645214b5f3366405a5336dc229a7be4832bd1a04a77fbc5","slow_code":"#include <iostream>\n\n#include <cmath>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <set>\n\n#include <map>\n\n#include <list>\n\n#include <time.h>\n\n#include <math.h>\n\n#include <random>\n\n#include <deque>\n\n#include <queue>\n\n#include <cassert>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <iomanip>\n\n#include <bitset>\n\n#include <sstream>\n\n#include <chrono>\n\n#include <cstring>\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef double db;\n\n#define ft first\n\n#define sd second\n\n#define flag bool fl = true\n\n#define mod 1000003\n\n#define N 100001\n\n#define MX 1000000001\n\n#define MXX 1000000000000000001\n\n#define pb push_back\n\n#define For(i, a, b) for (int i = a; i <= b; i++)\n\n#define T                                                                                          \\\n  int t, qq = 0;                                                                                   \\\n  cin >> t;                                                                                        \\\n  while (qq++ < t)\n\n#define fast                                                                                       \\\n  ios_base::sync_with_stdio(0);                                                                    \\\n  cin.tie(0), cout.tie(0)\n\n#define scarr(array, size)                                                                         \\\n  for (int i = 0; i < size; i++)                                                                   \\\n  cin >> array[i]\n\n#define deg(rad) (rad * 180.0) / pi\n\n#define pi acos(-1)\n\n#define log(n) (int)log2(n)\n\n#define logg(a) (b) log(b) / log(a)\n\nint main()\n\n{\n\n  int n, ans = 0;\n\n  cin >> n;\n\n  int a[n], b[n];\n\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n\n  for (int i = 0; i < n; i++)\n    cin >> b[i];\n\n  for (int i = 0; i < n; i++)\n\n    ans += max(0, a[i] - b[i]);\n\n  cout << ans;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <math.h>\n\nint main()\n\n{\n\n  int n, p = 0;\n\n  scanf(\"%d\", &n);\n\n  int v[n], c[n];\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &v[i]);\n\n  for (int j = 0; j < n; j++) {\n\n    scanf(\"%d\", &c[j]);\n\n    if (c[j] <= v[j])\n      p = p + v[j] - c[j];\n  }\n\n  if (p > 0)\n    printf(\"%d\", p);\n\n  else\n    printf(\"0\");\n\n  return 0;\n}\n"}
{"fast_code_id":"71468ad140d7adb5f531c23c87a4269a358e56d908d6a2ff58736356861b00b2","fast_id":"892216ae8764703eb367dab867240bc6248320857dfecef6ad78853a7c42a0c3","fast_time":0.0001915479,"language":"cpp","measured_fast_code_id":"892216ae8764703eb367dab867240bc6248320857dfecef6ad78853a7c42a0c3","measured_slow_code_id":"e144d3c37f95e02f07e8b3245937f3b32d76416fff289c795177da9f81215933","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34753","problem_id":"p03339","slow_code_id":"6c1e5f6f087d0df5ed0b51a8fe8313c9de871b8c86312c586ddfb5b05252ac70","slow_id":"e144d3c37f95e02f07e8b3245937f3b32d76416fff289c795177da9f81215933","slow_time":0.0094844498,"speedup":49.514767846580405,"stratum":"8+","sampling_key":"a2733560e9551366b5850706fb7ede26871b6144dec3e4377c3e32913f2a7fba","slow_code":"\n\n#include <iostream>\n\n#include <cstring>\n\n#include <cstdio>\n\n#include <string>\n\nusing namespace std;\n\nconst int maxn = 1e6 + 10;\n\nint n;\n\nint l[maxn], r[maxn];\n\nchar str[maxn];\n\nint maxx = 0;\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  scanf(\"%s\", str);\n\n  memset(l, 0, sizeof(l));\n\n  memset(r, 0, sizeof(r));\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    l[i] = l[i - 1];\n\n    if (str[i] == 'E') {\n\n      l[i]++;\n    }\n  }\n\n  for (int i = n - 1; i >= 0; i--)\n\n  {\n\n    r[i] = r[i + 1];\n\n    if (str[i] == 'W') {\n\n      r[i]++;\n    }\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    r[i] = r[i] + l[i];\n\n    maxx = max(r[i], maxx);\n  }\n\n  cout << n - maxx << endl;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\nint n, ans = 400000;\n\nchar a[300010];\n\nint cnt[300010];\n\nint main()\n\n{\n\n  scanf(\"%d%s\", &n, a);\n\n  if (a[0] == 'E')\n    cnt[0] = 1;\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    if (a[i] == 'E')\n      cnt[i] = cnt[i - 1] + 1;\n\n    else\n      cnt[i] = cnt[i - 1];\n  }\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    int t;\n\n    if (i != 0)\n      t = cnt[n - 1] - cnt[i] + i - cnt[i - 1];\n\n    else\n      t = cnt[n - 1] - cnt[i];\n\n    if (ans > t)\n      ans = t;\n  }\n\n  printf(\"%d\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"68c97dd22080c532306f77a8de56afac41d09e6a43179c39e6c2df7245941db6","fast_id":"4316cc043a6ae565dbc83a760a8e59ab53fe3fa539e15f710337567c4605d28e","fast_time":0.085049097,"language":"cpp","measured_fast_code_id":"4316cc043a6ae565dbc83a760a8e59ab53fe3fa539e15f710337567c4605d28e","measured_slow_code_id":"cd89fa073e03a03c6caaa9fd9dcf1829cfc0084945222836b8b971c161958145","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34777","problem_id":"p02614","slow_code_id":"26e0110547fb04ffbb958e6fe53090f87e1c3d4a9b1a8c071640faa6b0c72ba3","slow_id":"cd89fa073e03a03c6caaa9fd9dcf1829cfc0084945222836b8b971c161958145","slow_time":0.2975737222,"speedup":3.498846345188121,"stratum":"2-4","sampling_key":"6bc9984ad217fcf9b09f14e763b35d784ec9ba7cc72f98d68d29edeac8cec936","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (long long i = 0; i < n; i++)\n\n#define Rep(i, n) for (long long i = 1; i < n; i++)\n\n#define ll long long\n\n#include <math.h>\n\n#include <cmath>\n\n#include <iomanip>\n\n#include <iostream>\n\n#include <numeric>\n\n#include <queue>\n\n#include <set>\n\n#include <vector>\n\nusing namespace std;\n\n#define PI acos(-1)\n\nusing P = pair<ll, ll>;\n\nll ketasu(ll a) {\n\n  ll num = 1;\n\n  while (a / 10) {\n\n    num++;\n\n    a /= 10;\n  }\n\n  return num;\n}\n\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\n\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\n\nll kosuu(ll a) {\n\n  ll sum = 0;\n\n  for (ll i = 1; i * i <= a; i++) {\n\n    if (a % i == 0) {\n\n      if (a != 1 && i * i != a) {\n\n        sum += 2;\n\n      } else {\n\n        sum++;\n      }\n    }\n  }\n\n  return sum;\n}\n\nll di[] = {1, 0, -1, 0};\n\nll dj[] = {0, -1, 0, 1};\n\nstruct UnionFind {\n\n  vector<int> d;\n\n  UnionFind(int n = 0) : d(n, -1) {}\n\n  int find(int x) {\n\n    if ((d[x]) < 0)\n      return x;\n\n    return d[x] = find(d[x]);\n  }\n\n  bool unite(int x, int y) {\n\n    x = find(x);\n    y = find(y);\n\n    if (x == y)\n      return false;\n\n    if (d[x] > d[y])\n      swap(x, y);\n\n    d[x] += d[y];\n\n    d[y] = x;\n\n    return true;\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); };\n\n  ll size(ll x) { return -d[find(x)]; };\n};\n\nint deg[100005];\n\nvector<int> to[100005];\n\nconst int mod = 1000000007;\n\nstruct mint {\n\n  ll x;\n\n  mint(ll x = 0) : x((x % mod + mod) % mod) {}\n\n  mint operator-() const { return mint(-x); }\n\n  mint &operator+=(const mint a) {\n\n    if ((x += a.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  mint &operator-=(const mint a) {\n\n    if ((x += mod - a.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  mint &operator*=(const mint a) {\n    (x *= a.x) %= mod;\n    return *this;\n  }\n\n  mint operator+(const mint a) const { return mint(*this) += a; }\n\n  mint operator-(const mint a) const { return mint(*this) -= a; }\n\n  mint operator*(const mint a) const { return mint(*this) *= a; }\n\n  mint pow(ll t) const {\n\n    if (!t)\n      return 1;\n\n    mint a = pow(t >> 1);\n\n    a *= a;\n\n    if (t & 1)\n      a *= *this;\n\n    return a;\n  }\n\n  mint inv() const { return pow(mod - 2); }\n\n  mint &operator/=(const mint a) { return *this *= a.inv(); }\n\n  mint operator/(const mint a) const { return mint(*this) /= a; }\n};\n\nistream &operator>>(istream &is, mint &a) { return is >> a.x; }\n\nostream &operator<<(ostream &os, const mint &a) { return os << a.x; }\n\nmint f(int n) {\n\n  if (n == 0)\n    return 1;\n\n  mint x = f(2 / n);\n\n  x *= x;\n\n  if (n % 2 == 1)\n    x *= 2;\n\n  return x;\n}\n\nmint choose(int n, int a) {\n\n  mint x = 1, y = 1;\n\n  rep(i, a) {\n\n    x *= n - i;\n\n    y *= a + i;\n  }\n\n  return x / y;\n}\n\nconst ll m = 1000005;\n\nint main()\n\n{\n\n  ll h, w, k;\n\n  cin >> h >> w >> k;\n\n  vector<string> s(h);\n\n  rep(i, h) cin >> s[i];\n\n  ll ans = 0;\n\n  rep(i, 1 << h) {\n\n    rep(j, 1 << w) {\n\n      ll cnt = 0;\n\n      for (ll is = 0; is < h; is++) {\n\n        for (ll js = 0; js < w; js++) {\n\n          if (i >> is & 1)\n            continue;\n\n          if (j >> js & 1)\n            continue;\n\n          if (s[is][js] == '#')\n            cnt++;\n        }\n      }\n\n      if (cnt == k)\n        ans++;\n    }\n  }\n\n  cout << ans << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (long long i = 0; i < n; i++)\n\n#define Rep(i, n) for (long long i = 1; i < n; i++)\n\n#define ll long long\n\n#include <math.h>\n\n#include <cmath>\n\n#include <iomanip>\n\n#include <iostream>\n\n#include <numeric>\n\n#include <queue>\n\n#include <set>\n\n#include <vector>\n\nusing namespace std;\n\n#define PI acos(-1)\n\nusing P = pair<ll, ll>;\n\nll m = 1000000007;\n\nll mod = 1e9 + 7;\n\nll dp[2000 + 4];\n\nint main()\n\n{\n\n  ll h, w, k;\n\n  cin >> h >> w >> k;\n\n  vector<string> s(h);\n\n  rep(i, h) cin >> s[i];\n\n  ll ans = 0;\n\n  rep(i, 1 << h) {\n\n    rep(j, 1 << w) {\n\n      ll cnt = 0;\n\n      for (ll ii = 0; ii < h; ii++) {\n\n        for (ll jj = 0; jj < w; jj++) {\n\n          if (i >> ii & 1)\n            continue;\n\n          if (j >> jj & 1)\n            continue;\n\n          if (s[ii][jj] == '#')\n            cnt++;\n        }\n      }\n\n      if (cnt == k)\n        ans++;\n    }\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"14e01b511d8e658c6fbdd6356ab5e652d4cd296dbddc6a8e55964d97cd463195","fast_id":"bf646a71b9e535d8945ab4503ffb0ad5e1cb8c75e2ddf73b79aa0dc496fa834c","fast_time":0.0111820523,"language":"cpp","measured_fast_code_id":"bf646a71b9e535d8945ab4503ffb0ad5e1cb8c75e2ddf73b79aa0dc496fa834c","measured_slow_code_id":"79aabef05205091719c7e16aceb92e2eb470b0a6efd29526ba2712aa6513c705","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34788","problem_id":"p02735","slow_code_id":"aefbcd93fcabc8e1fc8ac17422de1be078f4f26db07ed75e17cf8fc4d80c131b","slow_id":"79aabef05205091719c7e16aceb92e2eb470b0a6efd29526ba2712aa6513c705","slow_time":0.1813387333,"speedup":16.216945551220505,"stratum":"8+","sampling_key":"2343de308c6edf77235b5079343e791cc7478710c7340a10bfbd2eeb5feebb47","slow_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <vector>\n\n#include <map>\n\n#include <queue>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst LL INF = 0x3f3f3f3f3f3f3f3f;\n\nLL n, m;\n\nLL dp[505][505];\n\nchar ch[505][505];\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  memset(dp, INF, sizeof(dp));\n\n  cin >> n >> m;\n\n  for (LL i = 1; i <= n; i++) {\n\n    for (LL j = 1; j <= m; j++) {\n\n      cin >> ch[i][j];\n    }\n  }\n\n  if (ch[1][1] == '.')\n    dp[1][1] = 0;\n\n  else\n    dp[1][1] = 1;\n\n  for (LL i = 1; i <= n; i++) {\n\n    for (LL j = 1; j <= m; j++) {\n\n      if (i > 1) {\n\n        if (ch[i][j] == ch[i - 1][j])\n          dp[i][j] = min(dp[i][j], dp[i - 1][j]);\n\n        if (ch[i][j] != ch[i - 1][j])\n          dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1);\n      }\n\n      if (j > 1) {\n\n        if (ch[i][j] == ch[i][j - 1])\n          dp[i][j] = min(dp[i][j], dp[i][j - 1]);\n\n        if (ch[i][j] != ch[i][j - 1])\n          dp[i][j] = min(dp[i][j], dp[i][j - 1] + 1);\n      }\n    }\n  }\n\n  if (ch[n][m] == '#')\n    dp[n][m]++;\n\n  dp[n][m] >>= 1;\n\n  cout << dp[n][m] << endl;\n\n  return 0;\n}\n","fast_code":"\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nchar s[110][110];\n\nint H, W, f[110][110];\n\nint main() {\n\n  scanf(\"%d%d\", &H, &W);\n\n  for (int i = 1; i <= H; ++i)\n    scanf(\"%s\", s[i] + 1);\n\n  f[1][1] = s[1][1] == '#';\n\n  for (int i = 2; i <= W; ++i)\n\n    f[1][i] = f[1][i - 1] + (s[1][i - 1] == '.' && s[1][i] == '#');\n\n  for (int i = 2; i <= H; ++i)\n\n    f[i][1] = f[i - 1][1] + (s[i - 1][1] == '.' && s[i][1] == '#');\n\n  for (int i = 2; i <= H; ++i)\n\n    for (int j = 2; j <= W; ++j)\n\n      f[i][j] = min(f[i - 1][j] + (s[i - 1][j] == '.' && s[i][j] == '#'),\n\n                    f[i][j - 1] + (s[i][j - 1] == '.' && s[i][j] == '#'));\n\n  printf(\"%d\\n\", f[H][W]);\n\n  return 0;\n}"}
{"fast_code_id":"d7a18904cf89f72ccded96cd063095e0cfb51bbe04c860d3218433ad060685c0","fast_id":"ad28c5e67bb59cedd61c4357b6abbcf45188f710e79bf954d7fc516cd6869c6a","fast_time":0.0228940212,"language":"cpp","measured_fast_code_id":"ad28c5e67bb59cedd61c4357b6abbcf45188f710e79bf954d7fc516cd6869c6a","measured_slow_code_id":"8b557e4a7bb251582727378808b434ff61d9922231432517f4974b4f7e2499c9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34818","problem_id":"p03040","slow_code_id":"573ab6827fff3983731dad7422067f9ddab9a5498d8550a58b7d75d3b584abbb","slow_id":"8b557e4a7bb251582727378808b434ff61d9922231432517f4974b4f7e2499c9","slow_time":0.2405254926,"speedup":10.506039568094748,"stratum":"8+","sampling_key":"10bf5768e424a41c9392ce2a774a079dcee787821078d3947ffe833979f29917","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nll BIT[200200], BIT2[200200];\n\nvoid add(int A, int B) {\n\n  while (A < 200200) {\n\n    BIT[A] += B;\n\n    A += A & -A;\n  }\n}\n\nll query(int A) {\n\n  ll kotae = 0;\n\n  while (A > 0) {\n\n    kotae += BIT[A];\n\n    A -= A & -A;\n  }\n\n  return kotae;\n}\n\nvoid add2(int A) {\n\n  while (A < 200200) {\n\n    BIT2[A]++;\n\n    A += A & -A;\n  }\n}\n\nll query2(int A) {\n\n  ll kotae = 0;\n\n  while (A > 0) {\n\n    kotae += BIT2[A];\n\n    A -= A & -A;\n  }\n\n  return kotae;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int Q;\n\n  cin >> Q;\n\n  int QL[200000];\n\n  pair<int, int> Q1[200000];\n\n  vector<int> za;\n\n  rep(q, Q) {\n\n    cin >> QL[q];\n\n    if (QL[q] == 1) {\n\n      int a, b;\n\n      cin >> a >> b;\n\n      Q1[q] = mp(a, b);\n\n      za.pb(a);\n    }\n  }\n\n  sort(za.begin(), za.end());\n\n  ll B = 0;\n\n  int k = 0;\n\n  rep(q, Q) {\n\n    if (QL[q] == 1) {\n\n      k++;\n\n      B += Q1[q].second;\n\n      int QK = lower_bound(za.begin(), za.end(), Q1[q].first) - za.begin() + 1;\n\n      add(QK, Q1[q].first);\n\n      add2(QK);\n\n    }\n\n    else {\n\n      int s = (k + 1) / 2;\n\n      int L = 0;\n\n      int R = 200199;\n\n      while (L + 1 < R) {\n\n        int H = (L + R) / 2;\n\n        if (query2(H) >= s)\n          R = H;\n\n        else\n          L = H;\n      }\n\n      int kari = za[R - 1];\n\n      cosp(kari);\n\n      ll R1 = query(R);\n\n      ll R2 = query2(R);\n\n      co(B + (R2 + R2 - k) * kari + query(200199) - R1 - R1);\n    }\n  }\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  int pn = 1;\n\n  if (ci - cn + 16 > cm) {\n\n    if ((ct = getcha()) == '-') {\n      pn = -1;\n      ct = getcha();\n    }\n\n    A = ct - '0';\n\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n    ;\n\n    return pn * A;\n\n  }\n\n  else {\n\n    if ((ct = *ci++) == '-') {\n      pn = -1;\n      ct = *ci++;\n    }\n\n    A = ct - '0';\n\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n    ;\n\n    return pn * A;\n  }\n}\n\nconst int dm = 1 << 22;\n\nchar dn[dm], *di = dn;\n\ninline void putint(ll X, ll X2) {\n\n  if (X == 0) {\n\n    *di++ = '0';\n\n  }\n\n  else {\n\n    if (X < 0) {\n\n      *di++ = '-';\n\n      X = -X;\n    }\n\n    int keta = 0;\n\n    char C[20];\n\n    while (X) {\n\n      *(C + keta) = '0' + X % 10;\n\n      X /= 10;\n\n      keta++;\n    }\n\n    for (int i = keta - 1; i >= 0; i--)\n      *di++ = (*(C + i));\n  }\n\n  *di++ = ' ';\n\n  if (X2 == 0) {\n\n    *di++ = '0';\n\n  }\n\n  else {\n\n    if (X2 < 0) {\n\n      *di++ = '-';\n\n      X2 = -X2;\n    }\n\n    int keta = 0;\n\n    char C[20];\n\n    while (X2) {\n\n      *(C + keta) = '0' + X2 % 10;\n\n      X2 /= 10;\n\n      keta++;\n    }\n\n    for (int i = keta - 1; i >= 0; i--)\n      *di++ = (*(C + i));\n  }\n\n  *di++ = '\\n';\n}\n\nll tmp[200010];\n\nvoid pakuri_sort(int N, ll A[]) {\n\n  const int b = 8;\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n    }\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n    }\n  }\n}\n\nint kueri[200010], D[200010];\n\nint main() {\n\n  int Q = getint();\n\n  int k = 1;\n\n  int B[200010];\n\n  ll A[200010];\n\n  rep(i, Q) {\n\n    if (getcha() == '1') {\n\n      getcha();\n\n      A[k] = getint() + (1 << 30) + (ll(k) << 32);\n\n      B[k] = getint();\n\n      k++;\n\n    }\n\n    else {\n\n      getcha();\n\n      kueri[k]++;\n    }\n  }\n\n  pakuri_sort(k - 1, A + 1);\n\n  int T[200010];\n\n  rep1(i, k - 1) T[A[i] >> 32] = i;\n\n  if (k & 1) {\n\n    tmp[k] = k / 2 + ((ll)(k / 2 + 1) << 32);\n\n  }\n\n  else {\n\n    tmp[k] = k / 2;\n  }\n\n  for (int i = k - 1; i >= 1; i--) {\n\n    int j = T[i];\n\n    int mae = D[j - 1];\n\n    if (!mae)\n      mae = j;\n\n    int ato = D[j + 1];\n\n    if (!ato)\n      ato = j;\n\n    int t = tmp[i + 1] & (1 << 30) - 1;\n\n    if (i & 1) {\n\n      if (j == t) {\n\n        tmp[i] = mae - 1 + ((ll)(ato + 1) << 32);\n\n      }\n\n      else if (j < t) {\n\n        int ato2 = D[t + 1];\n\n        if (!ato2)\n          ato2 = t;\n\n        tmp[i] = t + ((ll)(ato2 + 1) << 32);\n\n      }\n\n      else {\n\n        int mae2 = D[t - 1];\n\n        if (!mae2)\n          mae2 = t;\n\n        tmp[i] = mae2 - 1 + ((ll)t << 32);\n      }\n\n    }\n\n    else {\n\n      if (j <= t)\n        tmp[i] = tmp[i + 1] >> 32;\n\n      else\n        tmp[i] = t;\n    }\n\n    D[mae] = ato;\n\n    D[ato] = mae;\n  }\n\n  rep1(i, k - 1) A[i] = (A[i] & (1ll << 31) - 1) - (1 << 30);\n\n  ll X = 0;\n\n  rep1(i, k - 1) {\n\n    int t = tmp[i] & (1 << 30) - 1;\n\n    int t2 = tmp[i] >> 32;\n\n    int ti = T[i];\n\n    if (i & 1) {\n\n      if (ti < t)\n        X += A[t] - A[ti];\n\n      else if (ti > t2)\n        X += A[ti] - A[t2];\n\n      X += B[i];\n\n    }\n\n    else {\n\n      X += abs(A[ti] - A[t]);\n\n      X += B[i];\n    }\n\n    rep(j, kueri[i + 1]) putint(A[tmp[i + 1] & (1 << 30) - 1], X);\n  }\n\n  fwrite_unlocked(dn, di - dn, 1, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"9f9c1d38b430d9b753210f0a648dfd0dc2ace38b5754e5ec88d147095e86565c","fast_id":"dc8604b11c1723c2bc55cd68b30afc702437a18a0ab37ee00199796b252dee7b","fast_time":0.1002606007,"language":"cpp","measured_fast_code_id":"dc8604b11c1723c2bc55cd68b30afc702437a18a0ab37ee00199796b252dee7b","measured_slow_code_id":"10eab2ed8750bdb91b54429755726faa514bce8b42027cc842818772f13c75ff","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34853","problem_id":"p03722","slow_code_id":"52ebcf789628e9956f885b90535b7030e298ed60f7c11fd656b1dc2bd47fa125","slow_id":"10eab2ed8750bdb91b54429755726faa514bce8b42027cc842818772f13c75ff","slow_time":0.3789367082,"speedup":3.77951763259284,"stratum":"2-4","sampling_key":"1bab386c867fd80132982f20250feeb8929b2667c7950a070b8b796c0b2c02b4","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <queue>\n\n#include <stack>\n\n#include <string>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <map>\n\n#include <functional>\n\n#include <set>\n\n#pragma region\n\nusing namespace std;\n\n#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); i++)\n\n#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; i--)\n\n#define ALL(x) x.begin(), x.end()\n\n#define RALL(x) x.rbegin(), x.rend()\n\n#define LOWER(a, x) lower_bound(ALL(a), x) - a.begin() - 1;\n\n#define COUNT(a, x) upper_bound(ALL(a), x) - lower_bound(ALL(a), x);\n\n#define MCOUNT(a, x, y) upper_bound(ALL(a), y) - lower_bound(ALL(a), x);\n\n#define INF 111111111111111111\n\n#define MOD 1000000007\n\n#define pb push_back\n\n#define F first\n\n#define S second\n\ntypedef long long int ll;\n\ntypedef long double ld;\n\ntypedef vector<ll> vll;\n\ntypedef pair<ll, ll> pll;\n\nll n = 0, m = 0, ans = 0, sum = 0, cnt = 0, tmp = 0, ma = 0, mi = 0;\n\nstring s;\n\nbool flag, ok;\n\nll dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};\n\nll ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1}, ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};\n\n#pragma endregion\n\n#define MAX 111111\n\nvector<pll> edge[MAX];\n\nll d[MAX], d2[MAX];\n\nbool Bellmanford(int start, ll x) {\n\n  FOR(i, 1, n + 1) d[i] = INF;\n\n  d[start] = 0;\n\n  while (true) {\n\n    bool flag = false;\n\n    FOR(i, 1, n + 1) {\n\n      FOR(j, 0, edge[i].size()) {\n\n        if (d[i] != INF && d[edge[i][j].F] > d[i] + edge[i][j].S) {\n\n          d[edge[i][j].F] = d[i] + edge[i][j].S;\n\n          flag = true;\n\n          if (cnt >= n * x)\n            return true;\n        }\n      }\n    }\n\n    if (!flag)\n      break;\n\n    cnt++;\n  }\n\n  return false;\n}\n\nint main(void) {\n\n  ll a, b, c;\n\n  cin >> n >> m;\n\n  FOR(i, 0, m) {\n\n    cin >> a >> b >> c;\n\n    c = -c;\n\n    edge[a].pb(pll(b, c));\n  }\n\n  Bellmanford(1, 1);\n\n  ans = -d[n];\n\n  FOR(i, 1, n + 1) d2[i] = d[i];\n\n  Bellmanford(1, 3);\n\n  if (d[n] != d2[n]) {\n\n    cout << \"inf\" << endl;\n\n  }\n\n  else {\n\n    cout << -d[n] << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <queue>\n\n#include <stack>\n\n#include <string>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <map>\n\n#include <functional>\n\n#include <set>\n\n#pragma region\n\nusing namespace std;\n\n#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); i++)\n\n#define rep(i, n) FOR(i, 0, n)\n\n#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; i--)\n\n#define ALL(x) x.begin(), x.end()\n\n#define RALL(x) x.rbegin(), x.rend()\n\n#define LOWER(a, x) lower_bound(ALL(a), x) - a.begin() - 1;\n\n#define COUNT(a, x) upper_bound(ALL(a), x) - lower_bound(ALL(a), x);\n\n#define MCOUNT(a, x, y) upper_bound(ALL(a), y) - lower_bound(ALL(a), x);\n\n#define scan(x) scanf(\"%lld\", &x);\n\n#define inf 5555555555555555555\n\n#define mod 1000000007\n\n#define pi 3.14159265358979323846\n\n#define pb push_back\n\ntypedef long long int ll;\n\ntypedef vector<ll> vll;\n\ntypedef vector<vll> vvll;\n\ntypedef pair<ll, ll> pll;\n\ntypedef vector<pll> vpll;\n\ntypedef map<ll, ll> MAP;\n\ntypedef set<ll> SET;\n\nll n = 0, m = 0, ans = 0, sum = 0, cnt = 0, tmp = 0, ma = 0, mi = 0;\n\nstring s;\n\nbool ok, flag;\n\nll dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};\n\nll ddx[9] = {1, -1, 0, 0, 1, 1, -1, -1, 0},\n   ddy[9] = {0, 0, 1, -1, 1, -1, 1, -1, 0};\n\n#pragma endregion\n\n#define MAX 111111\n\nstruct Weighted_Graph {\n\n  struct edge {\n    ll node, cost;\n  };\n\n  vector<vector<edge>> e;\n\n  void set(ll x) { e.resize(x + 1); }\n\n  void add_edge(ll a, ll b, ll c) { e[a].pb(edge{b, c}); }\n\n  vll dijkstra(ll start) {\n\n    priority_queue<pll, vector<pll>, greater<pll>> pq;\n\n    ll u;\n\n    pll p;\n\n    vll dist(e.size(), inf);\n\n    dist[start] = 0;\n\n    pq.push(pll(0, start));\n\n    while (!pq.empty()) {\n\n      p = pq.top();\n      pq.pop();\n\n      u = p.second;\n\n      if (dist[u] < p.first)\n        continue;\n\n      for (edge e1 : e[u]) {\n\n        if (dist[e1.node] > dist[u] + e1.cost) {\n\n          dist[e1.node] = dist[u] + e1.cost;\n\n          pq.push(pll(dist[e1.node], e1.node));\n        }\n      }\n    }\n\n    return dist;\n  }\n\n  void floyd(vvll &dist) {\n\n    ll x = e.size();\n\n    dist.resize(x);\n\n    rep(i, x) dist[i].resize(x, inf);\n\n    rep(i, x) dist[i][i] = 0;\n\n    rep(i, x) rep(j, e[i].size()) dist[i][e[i][j].node] = e[i][j].cost;\n\n    rep(k, x) {\n\n      rep(i, x) {\n\n        if (dist[i][k] == inf)\n          continue;\n\n        rep(j, x) {\n\n          if (dist[k][j] == inf)\n            continue;\n\n          dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n        }\n      }\n    }\n  }\n\n  bool bellmanford(ll start, vll &dist) {\n\n    ll x = e.size(), cou = 0;\n\n    if (dist.size() == 0) {\n\n      dist.resize(x, inf);\n\n      dist[start] = 0;\n    }\n\n    while (1) {\n\n      bool cycle = false;\n\n      rep(i, n) {\n\n        rep(j, e[i].size()) {\n\n          if (dist[i] != inf && dist[e[i][j].node] > dist[i] + e[i][j].cost) {\n\n            dist[e[i][j].node] = dist[i] + e[i][j].cost;\n\n            cycle = true;\n\n            if (cou == x)\n              return cycle;\n          }\n        }\n      }\n\n      cou++;\n\n      if (!cycle)\n        break;\n    }\n\n    return false;\n  }\n};\n\nint main(void) {\n\n  Weighted_Graph wg;\n\n  vll d;\n\n  ll a, b, c;\n\n  cin >> n >> m;\n\n  wg.set(n);\n\n  FOR(i, 0, m) {\n\n    cin >> a >> b >> c;\n\n    a--;\n    b--;\n\n    wg.add_edge(a, b, -c);\n  }\n\n  wg.bellmanford(0, d);\n\n  tmp = d[n - 1];\n\n  wg.bellmanford(0, d);\n\n  ans = d[n - 1];\n\n  if (tmp != ans) {\n\n    cout << \"inf\" << endl;\n\n  }\n\n  else {\n\n    cout << -ans << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"d8bf83783e10f7bb8a8d4f404e6b463961f617a96d74d243bea38b873d9c8334","fast_id":"8d9451993d9443ef75537f662029cd7faee7c96c66ab141ab4ec111d7ab03291","fast_time":0.0534730133,"language":"cpp","measured_fast_code_id":"8d9451993d9443ef75537f662029cd7faee7c96c66ab141ab4ec111d7ab03291","measured_slow_code_id":"36eefa877e88470fb88f31cb43fc42dcd3c2b3408671749750897d464a7d1539","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3487","problem_id":"p03604","slow_code_id":"3121ee4f96b1fc58565dc269fae8ab2fb99823e1125d26258f62b3197b3f6961","slow_id":"36eefa877e88470fb88f31cb43fc42dcd3c2b3408671749750897d464a7d1539","slow_time":0.349560108,"speedup":6.537131282257475,"stratum":"4-8","sampling_key":"7a0baacd0ac80dd305c9e61b3510f226ca3de4a70b7fd563279d2b45b89007a3","slow_code":"#include <bits/stdc++.h>\n\n#define il inline\n\n#define stt static\n\n#define rg register\n\n#define ll long long\n\n#define db double\n\n#define pii pair<int, int>\n\n#define mp make_pair\n\n#define fst first\n\n#define snd second\n\n#define pb push_back\n\n#define y1 substitute_of_y1\n\n#define DEBUG(x) cerr << #x \" = \" << x << endl;\n\nusing namespace std;\n\ntemplate <typename T> il T rd() {\n\n  T nmb = 0;\n  int sgn = 0;\n  char chr = getchar();\n\n  while (!isdigit(chr)) {\n    if (chr == '-')\n      sgn = 1;\n    chr = getchar();\n  }\n\n  while (isdigit(chr)) {\n    nmb = (nmb << 3) + (nmb << 1) + chr - '0';\n    chr = getchar();\n  }\n\n  return sgn ? -nmb : nmb;\n}\n\ntemplate <typename T> void wt(T nmb) {\n\n  if (nmb > 9)\n    wt(nmb / 10);\n\n  putchar(nmb % 10 + '0');\n}\n\ntemplate <typename T> il void cmax(T &x, T y) { x = x > y ? x : y; }\n\ntemplate <typename T> il void cmin(T &x, T y) { x = x < y ? x : y; }\n\ninline void proc_status() {\n\n  ifstream t(\"/proc/self/status\");\n\n  cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())\n       << endl;\n}\n\nconst int L = 2e5 + 10;\n\nconst int P = 1e9 + 7;\n\nil int pwr(int x, int y) {\n\n  int z = 1;\n\n  for (; y; y >>= 1, x = (ll)x * x % P)\n\n    if (y & 1)\n      z = (ll)z * x % P;\n\n  return z;\n}\n\nint fac[L], inv[L];\n\nil void getfac(int n) {\n\n  fac[0] = 1;\n\n  for (int i = 1; i <= n; ++i)\n\n    fac[i] = (ll)fac[i - 1] * i % P;\n\n  inv[n] = pwr(fac[n], P - 2);\n\n  for (int i = n; i; --i)\n\n    inv[i - 1] = (ll)inv[i] * i % P;\n}\n\nil int C(int n, int m) {\n\n  if (n < 0 || m < 0 || n < m)\n    return 0;\n\n  return (ll)fac[n] * inv[m] % P * inv[n - m] % P;\n}\n\nint F[L];\n\nint get(int x) { return x == F[x] ? x : F[x] = get(F[x]); }\n\nint To[L << 1], Fs[L], Nx[L << 1], W[L << 1], E;\n\nil void Add(int x, int y, int z) {\n\n  To[++E] = y;\n\n  Nx[E] = Fs[x];\n\n  Fs[x] = E;\n\n  W[E] = z;\n}\n\nvector<int> vec[L];\n\nint to[L << 1], fs[L], nx[L << 1], w[L << 1], e;\n\nil void add(int x, int y, int z) {\n\n  to[++e] = y;\n\n  nx[e] = fs[x];\n\n  fs[x] = e;\n\n  w[e] = z;\n}\n\nint st[L], top;\n\nint in[L];\n\nint stx[L], wgt[L], tp;\n\nint num[L], val[L], cnt;\n\nint vis[L];\n\nint Flg;\n\nvoid findcir(int x, int f) {\n\n  stx[++tp] = x, vis[x] = 1;\n\n  for (int i = fs[x]; i; i = nx[i]) {\n\n    int k = to[i];\n\n    if (k == f)\n      continue;\n\n    wgt[tp] = w[i];\n\n    if (!Flg && vis[k]) {\n\n      Flg = 1;\n\n      int lb = tp;\n\n      while (stx[lb] != k)\n        --lb;\n\n      for (int t = lb; t <= tp; ++t)\n\n        num[t - lb + 1] = stx[t], val[t - lb + 1] = wgt[t];\n\n      cnt = tp - lb + 1;\n\n    }\n\n    else if (!vis[k])\n      findcir(k, x);\n  }\n\n  --tp, vis[x] = 0;\n}\n\nint Fa[L];\n\nint Vis[L], Wgt[L];\n\nint res;\n\nint ans[L], siz[L];\n\nvoid dfs(int x, int f) {\n\n  siz[x] = ans[x] = 1;\n\n  for (int i = fs[x]; i; i = nx[i]) {\n\n    int k = to[i];\n\n    if (k == f || Vis[k])\n      continue;\n\n    Vis[k] = 1, Wgt[k] = w[i];\n\n    if (w[i] < Wgt[x])\n      Fa[k] = x;\n\n    else\n      Fa[k] = 0;\n\n    dfs(k, x);\n\n    if (Fa[k]) {\n\n      ans[x] = (ll)ans[x] * ans[k] % P * C(siz[x] + siz[k] - 1, siz[k]) % P;\n\n      siz[x] += siz[k];\n    }\n  }\n}\n\nil int Pre(int x) { return x == 1 ? cnt : x - 1; }\n\nil int Nxt(int x) { return x == cnt ? 1 : x + 1; }\n\nint main() {\n\n  int n = rd<int>();\n\n  int lim = n << 1;\n\n  for (int i = 1; i <= lim; ++i)\n    F[i] = i;\n\n  for (int i = 1; i <= lim; ++i) {\n\n    int x = rd<int>(), y = rd<int>();\n\n    Add(x, y + n, x + y), Add(y + n, x, x + y);\n\n    F[get(x)] = get(y + n);\n  }\n\n  for (int i = 1; i <= lim; ++i)\n\n    vec[get(i)].pb(i);\n\n  getfac(lim);\n\n  int Ans = 1, Sum = 0;\n\n  for (int T = 1; T <= lim; ++T) {\n\n    if (vec[T].empty())\n      continue;\n\n    top = 0;\n\n    int cnta = (int)vec[T].size(), cntb = 0;\n\n    for (int t = vec[T].size() - 1; ~t; --t) {\n\n      int x = vec[T][t];\n\n      st[++top] = x;\n\n      for (int i = Fs[x]; i; i = Nx[i]) {\n\n        int k = To[i];\n\n        if (get(k) == get(x)) {\n\n          ++cntb;\n\n          add(x, k, W[i]), ++in[k];\n        }\n      }\n    }\n\n    cntb >>= 1;\n\n    if (cnta ^ cntb)\n      return puts(\"0\"), 0;\n\n    tp = 0, Flg = 0;\n\n    findcir(st[1], 0);\n\n    int Res = 0, Siz = 0;\n\n    res = 1;\n\n    for (int i = 1; i <= cnt; ++i)\n\n      Vis[num[i]] = 1, Wgt[num[i]] = val[i];\n\n    for (int i = 1; i <= cnt; ++i)\n\n      dfs(num[i], 0);\n\n    for (int i = 1; i <= cnt; ++i) {\n\n      int nxt = Nxt(i);\n\n      if (Wgt[num[i]] < Wgt[num[nxt]])\n        Fa[num[i]] = num[nxt];\n\n      else\n        Fa[num[i]] = 0;\n    }\n\n    for (int i = 1; i <= cnt; ++i) {\n\n      if (Fa[num[i]])\n        continue;\n\n      for (int k = Nxt(i); Fa[num[k]]; k = Nxt(k)) {\n\n        int nxt = Nxt(k);\n\n        ans[num[nxt]] = (ll)ans[num[nxt]] * ans[num[k]] % P *\n                        C(siz[num[nxt]] + siz[num[k]] - 1, siz[num[k]]) % P;\n\n        siz[num[nxt]] += siz[num[k]];\n      }\n    }\n\n    Siz = 0;\n\n    for (int i = 1; i <= top; ++i) {\n\n      if (Fa[st[i]])\n        continue;\n\n      res = (ll)res * ans[st[i]] % P * C(Siz + siz[st[i]], siz[st[i]]) % P;\n\n      Siz += siz[st[i]];\n    }\n\n    for (int i = 1; i <= top; ++i)\n\n      Vis[st[i]] = Wgt[st[i]] = 0;\n\n    (Res += res) %= P;\n\n    res = 1;\n\n    for (int i = 1; i <= cnt; ++i)\n\n      Vis[num[i]] = 1, Wgt[num[i]] = i == 1 ? val[cnt] : val[i - 1];\n\n    for (int i = 1; i <= cnt; ++i)\n\n      dfs(num[i], 0);\n\n    for (int i = 1; i <= cnt; ++i) {\n\n      int nxt = Pre(i);\n\n      if (Wgt[num[i]] < Wgt[num[nxt]])\n        Fa[num[i]] = num[nxt];\n\n      else\n        Fa[num[i]] = 0;\n    }\n\n    for (int i = 1; i <= cnt; ++i) {\n\n      if (Fa[num[i]])\n        continue;\n\n      for (int k = Pre(i); Fa[num[k]]; k = Pre(k)) {\n\n        int nxt = Pre(k);\n\n        ans[num[nxt]] = (ll)ans[num[nxt]] * ans[num[k]] % P *\n                        C(siz[num[nxt]] + siz[num[k]] - 1, siz[num[k]]) % P;\n\n        siz[num[nxt]] += siz[num[k]];\n      }\n    }\n\n    Siz = 0;\n\n    for (int i = 1; i <= top; ++i) {\n\n      if (Fa[st[i]])\n        continue;\n\n      res = (ll)res * ans[st[i]] % P * C(Siz + siz[st[i]], siz[st[i]]) % P;\n\n      Siz += siz[st[i]];\n    }\n\n    for (int i = 1; i <= top; ++i)\n\n      Vis[st[i]] = Wgt[st[i]] = 0;\n\n    (Res += res) %= P;\n\n    Ans = (ll)Ans * Res % P * C(Sum + cnta, cnta) % P;\n\n    Sum += cnta;\n\n    for (int i = 1; i <= top; ++i)\n\n      fs[st[i]] = in[st[i]] = vis[st[i]] = 0;\n\n    e = 0;\n  }\n\n  printf(\"%d\\n\", Ans);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nchar buf[1 << 20], *p1, *p2;\n\n#define getchar()                                                              \\\n  ((p1 == p2) && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2)   \\\n       ? EOF                                                                   \\\n       : *p1++)\n\ntemplate <typename T>\n\nvoid read(T &x)\n\n{\n\n  x = 0;\n\n  int f = 1;\n  char c = getchar();\n\n  while (!isdigit(c)) {\n    if (c == '-')\n      f = -1;\n    c = getchar();\n  }\n\n  while (isdigit(c)) {\n    x = x * 10 + c - 48;\n    c = getchar();\n  }\n\n  x *= f;\n}\n\nconst int Mod = 1e9 + 7;\n\ninline int add(int a, int b) { return a + b >= Mod ? a + b - Mod : a + b; }\n\ninline int sub(int a, int b) { return a - b < 0 ? a - b + Mod : a - b; }\n\ninline int mul(int a, int b) { return 1LL * a * b % Mod; }\n\ninline void updateA(int &a, int b) { a = add(a, b); }\n\ninline void updateM(int &a, int b) { a = mul(a, b); }\n\nconst int MAXN = 2e5 + 9;\n\nint fac[MAXN], inv[MAXN], ifac[MAXN];\n\nvoid Call(int n)\n\n{\n\n  fac[0] = 1;\n  for (int i = 1; i <= n; ++i)\n    fac[i] = mul(fac[i - 1], i);\n\n  inv[1] = 1;\n  for (int i = 2; i <= n; ++i)\n    inv[i] = mul(sub(Mod, Mod / i), inv[Mod % i]);\n\n  ifac[0] = 1;\n  for (int i = 1; i <= n; ++i)\n    ifac[i] = mul(ifac[i - 1], inv[i]);\n}\n\nint n;\n\nstruct Edge {\n  int ver, nxt;\n} e[MAXN << 2];\n\nint head[MAXN], tot = 0, Head[MAXN];\n\ninline void Add(int x, int y) {\n  e[++tot].ver = y, e[tot].nxt = head[x], head[x] = tot;\n}\n\ninline void Add_(int x, int y) {\n  e[++tot].ver = y, e[tot].nxt = Head[x], Head[x] = tot;\n}\n\nint ans = 0;\n\nstd::vector<int> G;\n\nbool vis[MAXN];\n\nint edge = 0, s, t;\n\nvoid GetLoop(int x, int Fa)\n\n{\n\n  G.push_back(x);\n\n  vis[x] = true;\n\n  for (int i = head[x]; i; ++edge, i = e[i].nxt)\n\n  {\n\n    int y = e[i].ver;\n\n    if (!vis[y])\n      GetLoop(y, x);\n\n    else if (y != Fa)\n\n      s = x, t = y;\n  }\n}\n\nint pr[MAXN];\n\nvoid GetPr(int x)\n\n{\n\n  for (int i = head[x]; i; i = e[i].nxt)\n\n  {\n\n    int y = e[i].ver;\n\n    if (y == pr[x] || y == s)\n      continue;\n\n    pr[y] = x;\n\n    GetPr(y);\n  }\n}\n\nint deg[MAXN];\n\nvoid Build()\n\n{\n\n  for (auto x : G)\n\n    for (int i = head[x]; i; i = e[i].nxt)\n\n    {\n\n      int y = e[i].ver;\n\n      if (y < pr[x])\n        Add_(x, y), ++deg[y];\n    }\n}\n\nint sz[MAXN];\n\nvoid Dfs(int x)\n\n{\n\n  sz[x] = 1;\n\n  for (int i = Head[x]; i; i = e[i].nxt)\n\n  {\n\n    int y = e[i].ver;\n\n    if (y == pr[x])\n      continue;\n\n    Dfs(y);\n\n    sz[x] += sz[y];\n  }\n}\n\nint Calc()\n\n{\n\n  for (auto i : G)\n\n    Head[i] = deg[i] = 0;\n\n  int res = fac[G.size()];\n\n  pr[s] = t;\n\n  GetPr(s);\n\n  Build();\n\n  for (auto i : G)\n\n    if (!deg[i])\n\n      Dfs(i);\n\n  for (auto i : G)\n\n    updateM(res, inv[sz[i]]);\n\n  return res;\n}\n\nint main()\n\n{\n\n  read(n);\n\n  for (int i = 1; i <= n << 1; ++i)\n\n  {\n\n    int x, y;\n\n    read(x), read(y);\n\n    Add(x, y + n), Add(y + n, x);\n  }\n\n  n <<= 1;\n\n  Call(n);\n\n  ans = fac[n];\n\n  for (int i = 1; i <= n; ++i)\n\n    if (!vis[i])\n\n    {\n\n      GetLoop(i, 0);\n\n      if (G.size() << 1 != edge) {\n        ans = 0;\n        break;\n      }\n\n      updateM(ans, ifac[G.size()]);\n\n      int res = 0;\n\n      updateA(res, Calc());\n\n      std::swap(s, t);\n\n      updateA(res, Calc());\n\n      updateM(ans, res);\n\n      G.clear();\n\n      edge = 0;\n    }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"9917a36542a9ac34683963878e7ec16cd953e718353a71c25450f8bcee94c509","fast_id":"495246e269756d4e599dd2deb1dcbbfacbe52bf43b7e1b026786c8e15e45b922","fast_time":0.0170108662,"language":"cpp","measured_fast_code_id":"495246e269756d4e599dd2deb1dcbbfacbe52bf43b7e1b026786c8e15e45b922","measured_slow_code_id":"f7e274f09aac15fe14d1d5d3f465660e98028763cbaf3b4810edb1358e6cb287","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34871","problem_id":"p03153","slow_code_id":"11db828c14911e5cca4ee2a29dc23fbdc765905060b64aa0548051595feb5693","slow_id":"f7e274f09aac15fe14d1d5d3f465660e98028763cbaf3b4810edb1358e6cb287","slow_time":0.3307390492,"speedup":19.44281057245633,"stratum":"8+","sampling_key":"fbef9f110d2ebeb74320929c06ce99e77c15e5654653592a5d89e917b962c3e8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nll BIT1[200010];\n\nll BIT2[200010];\n\nvoid add1(int A, ll B) {\n\n  while (A > 0) {\n\n    BIT1[A] = min(BIT1[A], B);\n\n    A -= A & -A;\n  }\n}\n\nll query1(int A) {\n\n  ll kotae = 1e18;\n\n  while (A <= 200000) {\n\n    kotae = min(kotae, BIT1[A]);\n\n    A += A & -A;\n  }\n\n  return kotae;\n}\n\nvoid add2(int A, ll B) {\n\n  while (A <= 200000) {\n\n    BIT2[A] = min(BIT2[A], B);\n\n    A += A & -A;\n  }\n}\n\nll query2(int A) {\n\n  ll kotae = 1e18;\n\n  while (A > 0) {\n\n    kotae = min(kotae, BIT2[A]);\n\n    A -= A & -A;\n  }\n\n  return kotae;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  ll N, D;\n\n  cin >> N >> D;\n\n  int A[200001];\n\n  rep1(i, N) cin >> A[i];\n\n  rep1(i, 200000) BIT1[i] = 1e18;\n\n  rep1(i, 200000) BIT2[i] = 1e18;\n\n  rep1(i, N) { add1(i, A[i] + i * D); }\n\n  rep1(i, N) { add2(i, A[i] - i * D); }\n\n  ll setuyaku = 0;\n\n  for (int i = 2; i < N; i++) {\n\n    ll kari1 = query1(i + 1) - i * D;\n\n    ll kari2 = query2(i - 1) + i * D;\n\n    if (A[i] > min(kari1, kari2)) {\n\n      setuyaku += A[i] - min(kari1, kari2);\n    }\n  }\n\n  ll motomoto = 0;\n\n  rep1(i, N - 1) motomoto += A[i];\n\n  rep1(i, N - 1) motomoto += A[i + 1];\n\n  motomoto += (N - 1) * D;\n\n  co(motomoto - setuyaku);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  int N = getint();\n\n  int D = getint();\n\n  ll kotae = (N - 1) * (ll)D;\n\n  int A[200001];\n\n  int C[200001];\n\n  C[0] = 1e9;\n\n  rep1(i, N) {\n\n    A[i] = getint();\n\n    kotae += A[i];\n\n    C[i] = min(C[i - 1] + D, A[i]);\n  }\n\n  int mae = 1e9;\n\n  for (int i = N - 1; i > 1; i--) {\n\n    mae = min(mae + D, A[i + 1]);\n\n    kotae += min(A[i], min(mae, C[i - 1]) + D);\n  }\n\n  printf(\"%lld\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"1539d4356c4aa39acf6e6132db407e4d9729a587df749c3774ce31572877d3ff","fast_id":"14183585367adaede89e2017e67437c711d3d7d0b8cb246cbd45213c17457091","fast_time":0.0632654405,"language":"cpp","measured_fast_code_id":"14183585367adaede89e2017e67437c711d3d7d0b8cb246cbd45213c17457091","measured_slow_code_id":"d80cb7be0c616552edbe035a08c7da14ba8f606322baaeb38484d1a7f497b3ff","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34928","problem_id":"p04003","slow_code_id":"e0058c5a91f276d4ce2da2b317f8e57217352c2d4e3b951850929e2c61fa18b9","slow_id":"d80cb7be0c616552edbe035a08c7da14ba8f606322baaeb38484d1a7f497b3ff","slow_time":0.732458185,"speedup":11.57754026860842,"stratum":"8+","sampling_key":"072a41a0109538ceed26bdcf10d606a2297433cedfa6ef1f35a6a4ba293f6bbc","slow_code":"#include <queue>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAXM = 200000;\n\nconst int MAXN = 300000;\n\nstruct edge {\n\n  int u, v, c;\n\n} edges[MAXM + 5];\n\nbool operator<(edge a, edge b) { return a.c < b.c; }\n\nvector<int> G[MAXN + 5];\n\nvoid addedge(int u, int v) {\n\n  G[u].push_back(v);\n\n  G[v].push_back(u);\n}\n\nint vcnt, fa[MAXN + 5], con[MAXN + 5], vis[MAXN + 5];\n\nint Find(int x) {\n\n  if (fa[x] == x)\n    return x;\n\n  return fa[x] = Find(fa[x]);\n}\n\nvoid Union(int x, int y) {\n\n  int fx = Find(x), fy = Find(y);\n\n  if (fx != fy)\n    fa[fx] = fy;\n}\n\nint dis[MAXN + 5];\n\nvoid bfs(int s) {\n\n  memset(dis, -1, sizeof dis);\n\n  queue<int> que;\n  que.push(s);\n\n  dis[s] = 0;\n\n  while (!que.empty()) {\n\n    int f = que.front();\n    que.pop();\n\n    for (int i = 0; i < G[f].size(); i++) {\n\n      if (dis[G[f][i]] == -1) {\n\n        dis[G[f][i]] = dis[f] + 1;\n\n        que.push(G[f][i]);\n      }\n    }\n  }\n}\n\nint main() {\n\n  int N, M;\n\n  scanf(\"%d%d\", &N, &M);\n\n  for (int i = 1; i <= M; i++)\n\n    scanf(\"%d%d%d\", &edges[i].u, &edges[i].v, &edges[i].c);\n\n  sort(edges + 1, edges + M + 1);\n\n  vcnt = N;\n  int lst = 1;\n\n  for (int i = 2; i <= M + 1; i++) {\n\n    if (edges[i].c != edges[i - 1].c) {\n\n      for (int j = lst; j < i; j++) {\n\n        fa[edges[j].u] = edges[j].u;\n\n        fa[edges[j].v] = edges[j].v;\n\n        con[edges[j].u] = con[edges[j].v] = 0;\n\n        vis[edges[j].u] = vis[edges[j].v] = false;\n      }\n\n      for (int j = lst; j < i; j++)\n\n        Union(edges[j].u, edges[j].v);\n\n      for (int j = lst; j < i; j++) {\n\n        if (fa[edges[j].u] == edges[j].u)\n\n          if (con[edges[j].u] == 0)\n\n            con[edges[j].u] = (++vcnt);\n\n        if (fa[edges[j].v] == edges[j].v)\n\n          if (con[edges[j].v] == 0)\n\n            con[edges[j].v] = (++vcnt);\n      }\n\n      for (int j = lst; j < i; j++) {\n\n        if (!vis[edges[j].u]) {\n\n          addedge(edges[j].u, con[Find(edges[j].u)]);\n\n          vis[edges[j].u] = true;\n        }\n\n        if (!vis[edges[j].v]) {\n\n          addedge(edges[j].v, con[Find(edges[j].v)]);\n\n          vis[edges[j].v] = true;\n        }\n      }\n\n      lst = i;\n    }\n  }\n\n  bfs(1);\n\n  if (dis[N] == -1)\n    puts(\"-1\");\n\n  else\n    printf(\"%d\\n\", dis[N] / 2);\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <queue>\n\n#include <vector>\n\nusing namespace std;\n\n#define MAXN 100010\n\n#define MAXM 200010\n\n#define MAXK 2000100\n\n#define INF 1000000000\n\nstruct edge\n\n{\n\n  int u, v, c;\n\n} e[MAXM];\n\nbool cmp(edge a, edge b)\n\n{\n\n  return a.c < b.c;\n}\n\nint fa[MAXN], n, N, m, u, v, c, im[MAXN];\n\nvector<int> A;\n\nint Find(int x)\n\n{\n\n  return fa[x] == x ? x : fa[x] = Find(fa[x]);\n}\n\nvoid Union(int x, int y)\n\n{\n\n  x = Find(x), y = Find(y);\n\n  fa[x] = y;\n}\n\nint Adj[MAXK], V[MAXK], nxt[MAXK], p;\n\nvoid AddEdge(int u, int v)\n\n{\n\n  p++;\n  V[p] = v;\n  nxt[p] = Adj[u];\n\n  Adj[u] = p;\n}\n\nint dis[MAXK];\n\nbool vis[MAXK];\n\nvoid SPFA()\n\n{\n\n  for (int i = 1; i <= N; i++)\n\n    dis[i] = INF;\n\n  queue<int> Q;\n\n  Q.push(1);\n\n  dis[1] = 0;\n\n  vis[1] = 1;\n\n  while (!Q.empty())\n\n  {\n\n    int u = Q.front();\n    Q.pop();\n\n    vis[u] = 0;\n\n    for (int i = Adj[u]; i; i = nxt[i])\n\n      if (dis[V[i]] > dis[u] + 1)\n\n      {\n\n        dis[V[i]] = dis[u] + 1;\n\n        if (!vis[V[i]])\n\n        {\n\n          vis[V[i]] = 1;\n\n          Q.push(V[i]);\n        }\n      }\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  N = n;\n\n  for (int i = 0; i < m; i++)\n\n    scanf(\"%d%d%d\", &e[i].u, &e[i].v, &e[i].c);\n\n  sort(e, e + m, cmp);\n\n  for (int i = 1; i <= n; i++)\n\n    fa[i] = i;\n\n  int ls = 0, lc = e[0].c;\n\n  for (int i = 0; i <= m; i++)\n\n    if (e[i].c != lc)\n\n    {\n\n      for (int j = ls; j < i; j++)\n\n        Union(e[j].u, e[j].v);\n\n      for (int j = ls; j < i; j++)\n\n      {\n\n        int y = Find(e[j].v);\n\n        if (!im[y])\n\n          im[y] = ++N, A.push_back(y);\n\n        AddEdge(e[j].u, im[y]);\n\n        AddEdge(im[y], e[j].u);\n\n        AddEdge(e[j].v, im[y]);\n\n        AddEdge(im[y], e[j].v);\n      }\n\n      for (int j = ls; j < i; j++)\n\n        fa[e[j].v] = e[j].v, fa[e[j].u] = e[j].u;\n\n      for (int j = 0; j < A.size(); j++)\n\n        im[A[j]] = 0;\n\n      A.clear();\n\n      ls = i, lc = e[i].c;\n    }\n\n  SPFA();\n\n  if (dis[n] == INF)\n    printf(\"-1\\n\");\n\n  else\n    printf(\"%d\\n\", dis[n] / 2);\n}"}
{"fast_code_id":"278ac0198972287d693fa339b3b5e0a66ea93f4d28058fa32b2aeae990bda2df","fast_id":"673a6af3ada410d8ce9b392508f41f05692f9f6c7b70aac51e17de5516e00081","fast_time":0.019969209,"language":"cpp","measured_fast_code_id":"673a6af3ada410d8ce9b392508f41f05692f9f6c7b70aac51e17de5516e00081","measured_slow_code_id":"cb577ec5e82fb2c1e9971afa93cbeb9cfe00246acd7b4765e8099df9b152c58b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34940","problem_id":"p03072","slow_code_id":"2f43f1b338ebd62b92490396e2d1b38cc4c0f977e1c2dca22829ac4d07db2456","slow_id":"cb577ec5e82fb2c1e9971afa93cbeb9cfe00246acd7b4765e8099df9b152c58b","slow_time":0.1054844245,"speedup":5.2823536725966465,"stratum":"4-8","sampling_key":"19b29fe0b1247ed623b5367d0991702cc5744e0375a7925030ce4e8c0002cd09","slow_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <iostream>\n\ntypedef long long LL;\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n, ans, h[200];\n\n  cin >> n;\n  ans = n;\n\n  for (int i = 1; i <= n; i++)\n\n    cin >> h[i];\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j < i; j++)\n\n    {\n\n      if (h[j] > h[i])\n\n      {\n\n        ans--;\n        break;\n      }\n    }\n\n  cout << ans;\n}\n","fast_code":"#include <cstdio>\n\n#include <cmath>\n\nusing namespace std;\n\nconst int N = 205;\n\nint n;\n\nint a[N];\n\nint ans, chk;\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n\n    chk = 1;\n\n    for (int j = 1; j < i; j++)\n\n      chk &= (a[j] <= a[i]);\n\n    ans += chk;\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"fad4cee6c0b7ad2b03d554d69d10acfc21541dfb9b516ad840e97d3d66466050","fast_id":"07611fc93865dbbbb10a46aca804c3db806432b1347482741636bd49e05fcdd7","fast_time":0.0054137821,"language":"cpp","measured_fast_code_id":"07611fc93865dbbbb10a46aca804c3db806432b1347482741636bd49e05fcdd7","measured_slow_code_id":"2b8892751008aefc8c3830fe0d7b86f7f4d830ba9b92be733fa861e5ae81ed34","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34951","problem_id":"p03728","slow_code_id":"02d19f16c33fba7e9c9c44cebd751cccf0a1dcf674c58b786cac334e1b2726e9","slow_id":"2b8892751008aefc8c3830fe0d7b86f7f4d830ba9b92be733fa861e5ae81ed34","slow_time":0.1160959608,"speedup":21.444520421315072,"stratum":"8+","sampling_key":"309b0ecac8c1bb640ccc737c992686e01e51197cae4e32db4d5e7878931e5dba","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long int N, p[364364], id[364364], dp[364364], x, i;\n\nint main() {\n\n  iota(p, p + 364364, 1);\n\n  scanf(\"%lld\", &N);\n\n  for (; i < N; ++i) {\n\n    scanf(\"%lld\", p + i);\n\n    id[p[i]] = i;\n  }\n\n  dp[N] = 0;\n\n  x = N;\n\n  for (; --i;) {\n\n    if (dp[i + 1]) {\n\n      dp[i] = dp[i + 1];\n\n      if ((id[i] < id[i + 1]) ^ (id[i + 1] < id[x]) ^ (id[x] < id[i])) {\n\n        ++dp[i];\n\n        x = i + 1;\n      }\n\n    } else {\n\n      dp[i] = dp[i + 1] + ((id[i] > id[i + 1]) ? 1 : 0);\n\n      if (id[i] < id[i + 1])\n        --x;\n    }\n  }\n\n  cout << dp[1] << endl;\n\n  return 0;\n}\n","fast_code":"#import <cstdio>\n\ntemplate <typename...> static inline int gc(void) { return getchar(); }\n\nstatic inline void read(int &x) {\n  int k, m = 0;\n  x = 0;\n  for (;;) {\n    k = gc();\n    if (48 <= k && k <= 57) {\n      x = k - 48;\n      break;\n    }\n  }\n  for (;;) {\n    k = gc();\n    if (k < 48 || k > 57)\n      break;\n    x = x * 10 + k - 48;\n  }\n}\n\nint N, d[262144], p, x, i;\n\nmain() {\n\n  read(N);\n\n  for (; i < N; d[x] = ++i)\n    read(x);\n\n  x = N;\n\n  for (; --i;)\n\n    if (p) {\n\n      if ((d[i] < d[i + 1]) ^ (d[i + 1] < d[x]) ^ (d[x] < d[i])) {\n\n        ++p;\n\n        x = i + 1;\n      }\n\n    } else\n\n        if (d[i] < d[i + 1])\n      --x;\n\n    else\n      ++p;\n\n  printf(\"%d\", p);\n}\n"}
{"fast_code_id":"3e7b1d52562d1c2eba002ced013487bd7456ae5b96ceb9954a309459bd59c2f7","fast_id":"196c3d78d122ad4dead46d1470e44ae829406086e1976e34568da168f91d5ead","fast_time":0.1075374409,"language":"cpp","measured_fast_code_id":"196c3d78d122ad4dead46d1470e44ae829406086e1976e34568da168f91d5ead","measured_slow_code_id":"2caa451a1d63611350020add5d5ee3fb7626bf76a7e7a78151dea8f53a25c708","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_34978","problem_id":"p03176","slow_code_id":"63c78c10fdd24dc874d7cee05fd226e55b7f17e1ae7e8df337574521555edd47","slow_id":"2caa451a1d63611350020add5d5ee3fb7626bf76a7e7a78151dea8f53a25c708","slow_time":0.824626944,"speedup":7.668277551507179,"stratum":"4-8","sampling_key":"7ee0ac5dbc38528ac18902ed0fe6cfc55c14b7f559c68fad5b90b8a5ef2b6277","slow_code":"\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <string>\n\n#include <cmath>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <unordered_set>\n\n#include <unordered_map>\n\n#include <stack>\n\n#include <queue>\n\n#include <deque>\n\n#include <iterator>\n\n#include <bitset>\n\n#include <assert.h>\n\n#include <new>\n\n#include <sstream>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\ntypedef unsigned long long ull;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntypedef vector<int> vi;\n\ntypedef vector<ll> vll;\n\ntypedef vector<vector<int>> vvi;\n\nint Int() {\n  int x;\n  scanf(\"%d\", &x);\n  return x;\n}\n\nll Long() {\n  ll x;\n  scanf(\"%lld\", &x);\n  return x;\n}\n\n#define error(args...)                                                         \\\n  {                                                                            \\\n    string _s = #args;                                                         \\\n    replace(_s.begin(), _s.end(), ',', ' ');                                   \\\n    stringstream _ss(_s);                                                      \\\n    istream_iterator<string> _it(_ss);                                         \\\n    err(_it, args);                                                            \\\n  }\n\nvoid err(istream_iterator<string> it) { cout << endl; }\n\ntemplate <typename T, typename... Args>\n\nvoid err(istream_iterator<string> it, T a, Args... args) {\n\n  cerr << *it << \" = \" << a << ' ';\n\n  err(++it, args...);\n}\n\nconst int N = (int)2e5 + 5;\n\nconst int maxN = (int)1e6 + 6;\n\nconst ll Mod = (ll)1e9 + 7;\n\nconst int inf = (int)2e9;\n\nconst ll Inf = (ll)1e18;\n\n#define debug(x) cerr << #x << \" = \" << x << '\\n';\n\n#define rep(i, b, e)                                                           \\\n  for (__typeof(e) i = (b); i != (e + 1) - 2 * ((b) > (e));                    \\\n       i += 1 - 2 * ((b) > (e)))\n\n#define Int Int()\n\n#define Long Long()\n\n#define all(x) x.begin(), x.end()\n\n#define sz(x) (int)x.size()\n\n#define ff first\n\n#define ss second\n\n#define pb push_back\n\n#define eb emplace_back\n\n#define mem(a) memset(a, 0, sizeof a)\n\n#define memn(a) memset(a, -1, sizeof a)\n\nll dp[N];\n\nstruct segment {\n\n  ll tree[N << 2];\n\n  segment() { mem(tree); }\n\n  void upd(int i, int b, int e, int p, ll v) {\n\n    if (b > p or e < p)\n      return;\n\n    if (b == e) {\n\n      tree[i] = v;\n\n      return;\n    }\n\n    int mid = (b + e) >> 1;\n\n    upd(i << 1, b, mid, p, v);\n\n    upd(i << 1 | 1, mid + 1, e, p, v);\n\n    tree[i] = max(tree[i << 1], tree[i << 1 | 1]);\n  }\n\n  ll query(int i, int b, int e, int l, int r) {\n\n    if (b > r or e < l)\n      return 0;\n\n    if (l <= b and e <= r)\n      return tree[i];\n\n    int mid = (b + e) >> 1;\n\n    return max(query(i << 1, b, mid, l, r),\n               query(i << 1 | 1, mid + 1, e, l, r));\n  }\n\n} seg;\n\nint main() {\n\n  int test = 1, tc = 0;\n\n  while (test--) {\n\n    int n = Int;\n\n    ll res = 0;\n\n    vi a(n + 1);\n\n    for (int i = 1; i <= n; ++i)\n      a[i] = Int;\n\n    for (int i = 1; i <= n; ++i) {\n\n      int x = Int;\n\n      ll k = seg.query(1, 1, n, 1, a[i]) + x;\n\n      seg.upd(1, 1, n, a[i], k);\n\n      if (res < k)\n        res = k;\n    }\n\n    cout << res << '\\n';\n  }\n\n  return 0;\n}\n","fast_code":"\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <string>\n\n#include <cmath>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <unordered_set>\n\n#include <unordered_map>\n\n#include <stack>\n\n#include <queue>\n\n#include <deque>\n\n#include <iterator>\n\n#include <bitset>\n\n#include <assert.h>\n\n#include <new>\n\n#include <sstream>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\ntypedef unsigned long long ull;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntypedef vector<int> vi;\n\ntypedef vector<ll> vll;\n\ntypedef vector<vector<int>> vvi;\n\nint Int() {\n  int x;\n  scanf(\"%d\", &x);\n  return x;\n}\n\nll Long() {\n  ll x;\n  scanf(\"%lld\", &x);\n  return x;\n}\n\n#define error(args...)                                                         \\\n  {                                                                            \\\n    string _s = #args;                                                         \\\n    replace(_s.begin(), _s.end(), ',', ' ');                                   \\\n    stringstream _ss(_s);                                                      \\\n    istream_iterator<string> _it(_ss);                                         \\\n    err(_it, args);                                                            \\\n  }\n\nvoid err(istream_iterator<string> it) { cout << endl; }\n\ntemplate <typename T, typename... Args>\n\nvoid err(istream_iterator<string> it, T a, Args... args) {\n\n  cerr << *it << \" = \" << a << ' ';\n\n  err(++it, args...);\n}\n\nconst int N = (int)2e5 + 5;\n\nconst int maxN = (int)1e6 + 6;\n\nconst ll Mod = (ll)1e9 + 7;\n\nconst int inf = (int)2e9;\n\nconst ll Inf = (ll)1e18;\n\n#define debug(x) cerr << #x << \" = \" << x << '\\n';\n\n#define rep(i, b, e)                                                           \\\n  for (__typeof(e) i = (b); i != (e + 1) - 2 * ((b) > (e));                    \\\n       i += 1 - 2 * ((b) > (e)))\n\n#define Int Int()\n\n#define Long Long()\n\n#define all(x) x.begin(), x.end()\n\n#define sz(x) (int)x.size()\n\n#define ff first\n\n#define ss second\n\n#define pb push_back\n\n#define eb emplace_back\n\n#define mem(a) memset(a, 0, sizeof a)\n\n#define memn(a) memset(a, -1, sizeof a)\n\nll t[N];\n\nvoid upd(int i, ll v, int n) {\n\n  while (i <= n) {\n\n    t[i] = max(t[i], v);\n\n    i += (i & -i);\n  }\n}\n\nll query(int i) {\n\n  ll res = 0;\n\n  while (i) {\n\n    res = max(res, t[i]);\n\n    i -= (i & -i);\n  }\n\n  return res;\n}\n\nint main() {\n\n  int test = 1, tc = 0;\n\n  while (test--) {\n\n    int n = Int;\n\n    ll res = 0;\n\n    vi a(n + 1);\n\n    for (int i = 1; i <= n; ++i)\n      a[i] = Int;\n\n    for (int i = 1; i <= n; ++i) {\n\n      int x = Int;\n\n      ll k = query(a[i]) + x;\n\n      upd(a[i], k, n);\n\n      if (res < k)\n        res = k;\n    }\n\n    cout << res << '\\n';\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"539610ef135470e75567ccea8841d12f5d06e260cd57c134eb3a3a0a0958b2f3","fast_id":"576c160d2b22fcd6cbfafd6dd54de54eef5a285c5599bc541ce3146b44468626","fast_time":0.0075597662,"language":"cpp","measured_fast_code_id":"576c160d2b22fcd6cbfafd6dd54de54eef5a285c5599bc541ce3146b44468626","measured_slow_code_id":"f6cd3422bfe98aca8fbec0481fd683c12ab07a180a0399bf7a93d6cad1876221","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35097","problem_id":"p02574","slow_code_id":"b5ceca067ec89ce963763d37538335e812a6dc4be1ebff4e9cd01a4c25706f24","slow_id":"f6cd3422bfe98aca8fbec0481fd683c12ab07a180a0399bf7a93d6cad1876221","slow_time":0.2076723137,"speedup":27.4707323223832,"stratum":"8+","sampling_key":"0e279a04dbd9a831d0c8d1d341728376a31de3618cc0b2b0191b390e574be939","slow_code":"#include <stdio.h>\n\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\n\nconst int MOD = 1e9 + 7, MAX = 1e6;\n\nstatic inline int IN(void)\n\n{\n\n  int x = 0, f = 0, c = getchar();\n  while (c < 48 || c > 57) {\n    f ^= c == 45, c = getchar();\n  }\n\n  while (c > 47 && c < 58) {\n    x = x * 10 + c - 48, c = getchar();\n  }\n  return f ? -x : x;\n}\n\nstatic inline int GCD(int a, int b) { return !b ? a : GCD(b, a % b); }\n\ntypedef struct {\n  int SPF[1000001], Primes[168], sz;\n} Template;\n\nTemplate P;\n\nstatic inline void ready(void)\n\n{\n\n  *P.SPF = 1, *P.Primes = 2, P.sz = 1;\n\n  rep(i, MAX / 2) P.SPF[2 * (i + 1)] = 2,\n                                 P.SPF[2 * (i + 1) - 1] = 2 * (i + 1) - 1;\n\n  rep(i, MAX / 2 - 1)\n\n  {\n\n    int x = 2 * (i + 1) + 1;\n    if (P.SPF[x] == x) {\n      P.Primes[P.sz++] = x;\n    }\n    if (x * x > MAX)\n      break;\n\n    rep(j, P.sz) {\n      if (P.Primes[j] <= P.SPF[x] && x * P.Primes[j] <= MAX)\n        P.SPF[x * P.Primes[j]] = P.Primes[j];\n      else\n        break;\n    }\n  }\n}\n\nconst char common[] = \"not coprime\", disjoint[] = \"pairwise coprime\",\n           partial[] = \"setwise coprime\";\n\nint vol = 0, esc[100][2];\n\nstatic inline int Divise(int x)\n\n{\n\n  if (!x)\n    return 0;\n\n  rep(i, 168)\n\n  {\n\n    if (x % P.Primes[i])\n      continue;\n\n    rep(j, vol) {\n      if (esc[j][0] == P.Primes[i] && esc[j][1])\n        return 0;\n    }\n\n    esc[vol][0] = P.Primes[i], esc[vol++][1] = 1;\n\n    while (x % P.Primes[i] == 0) {\n      x /= P.Primes[i];\n    }\n  }\n\n  if (x != 1)\n\n  {\n\n    rep(j, vol) {\n      if (esc[j][0] == x && esc[j][1])\n        return 0;\n    }\n\n    esc[vol][0] = x, esc[vol++][1] = 1;\n\n    return 1;\n  }\n\n  return 1;\n}\n\nint main(void)\n\n{\n\n  int N = IN(), A = 0, g = 0, flag = 0;\n\n  ready();\n\n  rep(i, N) {\n    A = IN();\n    g = GCD(g, A);\n    if (!Divise(A)) {\n      flag = 1;\n    }\n  }\n\n  if (g > 1)\n    return puts(common), 0;\n\n  if (flag)\n    return puts(partial), 0;\n\n  return puts(disjoint), 0;\n}","fast_code":"#include <stdio.h>\n\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\n\n#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n\nstatic inline int IN(void)\n\n{\n\n  int x = 0, f = 0, c = getchar();\n  while (c < 48 || c > 57) {\n    f ^= c == 45, c = getchar();\n  }\n\n  while (c > 47 && c < 58) {\n    x = x * 10 + c - 48, c = getchar();\n  }\n  return f ? -x : x;\n}\n\nstatic inline int GCD(int a, int b) { return !b ? a : GCD(b, a % b); }\n\nconst int Primes[168] =\n\n    {2,   3,   5,   7,   11,  13,  17,  19,  23,  29,  31,  37,\n     41,  43,  47,  53,  59,  61,  67,  71,  73,  79,  83,  89,\n\n     97,  101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,\n     157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223,\n\n     227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,\n     283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359,\n\n     367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433,\n     439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503,\n\n     509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593,\n     599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659,\n\n     661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743,\n     751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827,\n\n     829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911,\n     919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};\n\nconst char common[] = \"not coprime\", disjoint[] = \"pairwise coprime\", several[] = \"setwise coprime\";\n\nchar esc[1000000];\n\nstatic inline int Divide(int x)\n\n{\n\n  if (!x) {\n    return 0;\n  }\n\n  rep(i, 168)\n\n  {\n\n    if (Primes[i] * Primes[i] > x)\n      break;\n\n    if (x % Primes[i])\n      continue;\n\n    if (esc[Primes[i] - 1])\n      return 0;\n\n    esc[Primes[i] - 1] = 1;\n\n    while (x % Primes[i] == 0 && x)\n      x /= Primes[i];\n  }\n\n  if (x > 1) {\n    if (esc[x - 1])\n      return 0;\n    esc[x - 1] = 1;\n  }\n\n  return 1;\n}\n\nint main(void)\n\n{\n\n  int N = IN(), A = 0, f = 0, g = 0, last = 0, penultimate = 0;\n\n  rep(i, N)\n\n  {\n\n    A = IN();\n    g = GCD(g, A);\n    if (i && g != 1) {\n      f = 1;\n    }\n    if (!f && penultimate && GCD(penultimate, A) > 1) {\n      f = 1;\n    }\n\n    penultimate = last;\n    last = A;\n    if (f)\n      continue;\n    else {\n      if (!Divide(A))\n        f = 1;\n    }\n  }\n\n  if (g > 1)\n    return puts(common), 0;\n  else {\n    if (f)\n      return puts(several), 0;\n    else\n      return puts(disjoint), 0;\n  }\n}"}
{"fast_code_id":"5d085f7b313f634593296e9b6cc08485393e663759f2ff367873fe7d506402f1","fast_id":"ca2c6ece49a0cb1db29a64e9dceb63b4d6266617ece5754afb823707db1f05db","fast_time":0.1068534996,"language":"cpp","measured_fast_code_id":"ca2c6ece49a0cb1db29a64e9dceb63b4d6266617ece5754afb823707db1f05db","measured_slow_code_id":"448a6f5e543336623d45d37c6376219b57e33448a68f1f55438499365763ed83","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35135","problem_id":"p02966","slow_code_id":"9bf6f00ca5a179c63e4732e50bd45d892b3713d2ef320616865ee51ea21c7d08","slow_id":"448a6f5e543336623d45d37c6376219b57e33448a68f1f55438499365763ed83","slow_time":0.3241504541,"speedup":3.03359698384647,"stratum":"2-4","sampling_key":"49e9ca25867bd5661046a715d51cbdca9c742e79e0d5b3d7639de55cb4edfc7f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 500 + 5;\n\nlong long n, a[N][N], g[2][N][N], f[N][N], cnt, sum = 0x3f3f3f3f3f3f3f3f;\n\nvoid init() {\n\n  scanf(\"%lld\", &n);\n\n  for (int i = 0; ++i <= n;)\n    for (int j = 0; ++j <= n; i == j ?: scanf(\"%lld\", &a[i][j]))\n      ;\n}\n\nlong long gg(int k, int lx, int ly, int rx, int ry) {\n\n  return g[k][rx][ry] - g[k][lx - 1][ry] - g[k][rx][ly - 1] +\n         g[k][lx - 1][ly - 1];\n}\n\nvoid work() {\n\n  for (int i = 0; ++i <= n;) {\n\n    for (int j = 0; ++j <= n;\n         i >= j ?: g[0][i][j] = a[i][j], g[0][i][j] += g[0][i][j - 1])\n      ;\n\n    for (int j = 0; ++j <= n; g[0][i][j] += g[0][i - 1][j])\n      ;\n  }\n\n  for (int i = 0; ++i <= n;) {\n\n    for (int j = 0; ++j <= n;\n         i <= j ?: g[1][i][j] = a[i][j], g[1][i][j] += g[1][i][j - 1])\n      ;\n\n    for (int j = 0; ++j <= n; g[1][i][j] += g[1][i - 1][j])\n      ;\n  }\n\n  memset(f, 0x3f, sizeof(f));\n\n  f[0][0] = 0;\n\n  for (int i = -1; ++i <= n;)\n    for (int j = -1; ++j < max(i, 1);)\n      for (int h = i; ++h <= n;\n\n           cnt =\n               f[i][j] + gg(1, h + 1, j + 1, n, i) + gg(0, i + 1, i + 1, h, h),\n               f[h][i] = min(f[h][i], cnt))\n        ;\n\n  for (int i = 0; ++i <= n; sum = min(sum, f[n][i]))\n    ;\n}\n\nvoid prin() { printf(\"%lld\", sum); }\n\nint main() {\n\n  init();\n\n  work();\n\n  prin();\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int N = 500;\n\nconst LL INF = (1LL << 50) - 1;\n\nint n, a[N + 9][N + 9];\n\nvoid into() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 1; j <= n; ++j)\n\n      if (i ^ j)\n        scanf(\"%d\", &a[i][j]);\n}\n\nLL sum[N + 9][N + 9][2];\n\nvoid Get_sum() {\n\n  for (int i = 1; i <= n; ++i) {\n\n    for (int j = 1; j <= n; ++j) {\n\n      if (i ^ j)\n        i < j ? sum[i][j][0] = a[i][j] : sum[i][j][1] = a[i][j];\n\n      for (int k = 0; k < 2; ++k)\n        sum[i][j][k] += sum[i][j - 1][k];\n    }\n\n    for (int j = 1; j <= n; ++j)\n\n      for (int k = 0; k < 2; ++k)\n        sum[i][j][k] += sum[i - 1][j][k];\n  }\n}\n\nLL Get_sum(int id, int x0, int y0, int x1, int y1) {\n  return sum[x1][y1][id] - sum[x1][y0 - 1][id] - sum[x0 - 1][y1][id] +\n         sum[x0 - 1][y0 - 1][id];\n}\n\nLL dp[N + 9][N + 9], ans;\n\nvoid Get_dp() {\n\n  for (int i = 0; i <= n; ++i)\n\n    for (int j = 0; j <= n; ++j)\n      dp[i][j] = INF;\n\n  dp[0][0] = 0;\n\n  for (int i = 0; i <= n; ++i)\n\n    for (int j = 0; j < max(i, 1); ++j)\n\n      for (int k = i + 1; k <= n; ++k) {\n\n        LL t = dp[i][j] + Get_sum(1, k + 1, j + 1, n, i) +\n               Get_sum(0, i + 1, i + 1, k, k);\n\n        dp[k][i] = min(dp[k][i], t);\n      }\n\n  ans = INF;\n\n  for (int i = 1; i <= n; ++i)\n    ans = min(ans, dp[n][i]);\n}\n\nvoid work() {\n\n  Get_sum();\n\n  Get_dp();\n}\n\nvoid outo() { printf(\"%lld\\n\", ans); }\n\nint main() {\n\n  into();\n\n  work();\n\n  outo();\n\n  return 0;\n}"}
{"fast_code_id":"317966d0f804f33fc4ab222e5e5322e033277ab6ae7c55fc95bc23948abf63c8","fast_id":"ad481210e7514870d2bc13416ae6ac11f1e4443b1b1d7d4d5a319861522808f1","fast_time":0.0261309514,"language":"cpp","measured_fast_code_id":"ad481210e7514870d2bc13416ae6ac11f1e4443b1b1d7d4d5a319861522808f1","measured_slow_code_id":"5cce4a9a4fd6884f39ec251fa2af02923f46554a67d6bdbbda1ad1671046654a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35193","problem_id":"p02758","slow_code_id":"839da65ad30c6b6211bf308233fab4311fb46aa3e2c677e92c8eb076557fe9af","slow_id":"5cce4a9a4fd6884f39ec251fa2af02923f46554a67d6bdbbda1ad1671046654a","slow_time":0.0665412139,"speedup":2.5464520170513194,"stratum":"2-4","sampling_key":"3f8b58083e424f8c669ded848d20dfe83bd5a9bb412b774bce224cad85457eaa","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst ll Maxn = 200005;\n\nconst ll Mod = 998244353;\n\nll N;\n\nstruct Robot {\n\n  ll X;\n\n  ll D;\n\n} a[Maxn];\n\nll Touch_Far_Robot[Maxn];\n\nll Touch_Far_Robot_Tree[4 * Maxn];\n\nll dp[Maxn];\n\nbool Have_Test_Poi[Maxn];\n\nbool cmp(Robot a, Robot b)\n\n{\n\n  return a.X < b.X;\n}\n\nvoid UpData_Tree(ll poi, ll Left, ll Right, ll Poi, ll Value)\n\n{\n\n  if (Left > Poi || Right < Poi)\n    return;\n\n  if (Left == Right && Left == Poi)\n\n  {\n\n    Touch_Far_Robot_Tree[poi] = Value;\n\n    return;\n  }\n\n  ll Mid = Left + (Right - Left) / 2;\n\n  UpData_Tree(poi * 2, Left, Mid, Poi, Value);\n\n  UpData_Tree(poi * 2 + 1, Mid + 1, Right, Poi, Value);\n\n  Touch_Far_Robot_Tree[poi] =\n      max(Touch_Far_Robot_Tree[poi * 2], Touch_Far_Robot_Tree[poi * 2 + 1]);\n}\n\nll Search(ll x)\n\n{\n\n  ll Left = 1;\n\n  ll Right = N;\n\n  ll ans;\n\n  while (Left <= Right)\n\n  {\n\n    ll Mid = Left + (Right - Left) / 2;\n\n    if (!Have_Test_Poi[Mid])\n\n    {\n\n      Left = Mid + 1;\n\n      continue;\n    }\n\n    if (a[Mid].X < x)\n\n    {\n\n      ans = Mid;\n\n      Left = Mid + 1;\n\n    }\n\n    else\n\n    {\n\n      Right = Mid - 1;\n    }\n  }\n\n  return ans;\n}\n\nll Search_Touch_Tree(ll poi, ll Left, ll Right, ll L, ll R)\n\n{\n\n  ll ans = -1;\n\n  if (Left > R || Right < L)\n    return 0;\n\n  if (L <= Left && Right <= R)\n    return Touch_Far_Robot_Tree[poi];\n\n  ll Mid = Left + (Right - Left) / 2;\n\n  ans = max(ans, Search_Touch_Tree(poi * 2, Left, Mid, L, R));\n\n  ans = max(ans, Search_Touch_Tree(poi * 2 + 1, Mid + 1, Right, L, R));\n\n  return ans;\n}\n\nint main()\n\n{\n\n  scanf(\"%lld\", &N);\n\n  for (int i = 1; i <= N; i++)\n    scanf(\"%lld %lld\", &a[i].X, &a[i].D);\n\n  sort(a + 1, a + N + 1, cmp);\n\n  Touch_Far_Robot[N] = N;\n\n  UpData_Tree(1, 1, N, N, N);\n\n  Have_Test_Poi[N] = true;\n\n  for (int i = N - 1; i >= 1; i--)\n\n  {\n\n    Have_Test_Poi[i] = true;\n\n    ll Dist = a[i].X + a[i].D;\n\n    ll x = Search(Dist);\n\n    Touch_Far_Robot[i] = max(x, Search_Touch_Tree(1, 1, N, i, x));\n\n    UpData_Tree(1, 1, N, i, Touch_Far_Robot[i]);\n  }\n\n  dp[N] = 2;\n\n  for (int i = N + 1; i < Maxn; i++)\n    dp[i] = 1;\n\n  for (int i = N - 1; i >= 1; i--)\n\n  {\n\n    dp[i] = dp[i + 1] + dp[Touch_Far_Robot[i] + 1];\n\n    dp[i] %= Mod;\n  }\n\n  cout << dp[1];\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ms(x, y) memset(x, y, sizeof(x))\n\n#define lowbit(x) ((x) & (-x))\n\n#define sqr(x) ((x) * (x))\n\ntypedef long long LL;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<LL, LL> pll;\n\nconst LL MOD = 998244353;\n\nvoid run_case() {\n\n  int n;\n\n  cin >> n;\n\n  vector<pll> a(n), sta;\n\n  for (auto &x : a)\n    cin >> x.first >> x.second;\n\n  sort(a.begin(), a.end());\n\n  vector<LL> dp(n + 1);\n\n  dp[n] = 1;\n\n  sta.emplace_back(n, 3e9);\n\n  for (int i = n - 1; i >= 0; --i) {\n\n    while (sta.back().second < a[i].first + a[i].second)\n\n      sta.pop_back();\n\n    dp[i] = dp[sta.back().first];\n\n    sta.emplace_back(i, a[i].first);\n\n    dp[i] = (dp[i] + dp[i + 1]) % MOD;\n  }\n\n  cout << dp[0];\n}\n\nint main() {\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  cout.flags(ios::fixed);\n  cout.precision(9);\n\n  run_case();\n\n  cout.flush();\n\n  return 0;\n}"}
{"fast_code_id":"18f54ef355b4114989702838e112db2955c0ff429a22639839eb9ddd49433ecd","fast_id":"cfc5d5cc70443604f22a20b15656d048224d9566782c7dc6d28bf69258976019","fast_time":0.0191982957,"language":"cpp","measured_fast_code_id":"cfc5d5cc70443604f22a20b15656d048224d9566782c7dc6d28bf69258976019","measured_slow_code_id":"1151c70023ed91c9ab675a2f12f64e7a6ddc6753f4a8a8a22c5f7810f88dd397","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35216","problem_id":"p02707","slow_code_id":"ed7b6b7c6cad86b67f92dab6c533824a69ef1f8aaf3a50155728e20b88f87e02","slow_id":"1151c70023ed91c9ab675a2f12f64e7a6ddc6753f4a8a8a22c5f7810f88dd397","slow_time":0.1933351005,"speedup":10.070430392422802,"stratum":"8+","sampling_key":"1419555e005cb449d6c4e546ad7b01b0b5063325b8f220cabfdab15145277bbc","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int kotae[200000] = {};\n\n  rep(i, N - 1) {\n\n    int a;\n\n    cin >> a;\n\n    a--;\n\n    kotae[a]++;\n  }\n\n  rep(i, N) co(kotae[i]);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"Ofast\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int CM = 1400000;\n\nchar cn[CM], *ci = cn, ct;\n\nconst ll ma0 = 1157442765409226768;\n\nconst ll ma1 = 1085102592571150095;\n\nconst ll ma2 = 71777214294589695;\n\nconst ll ma3 = 281470681808895;\n\nconst ll ma4 = 4294967295;\n\ninline int getint() {\n\n  ll tmp = *(ll *)ci;\n\n  int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);\n\n  tmp = tmp << dig & ma1;\n\n  tmp = tmp * 10 + (tmp >> 8) & ma2;\n\n  tmp = tmp * 100 + (tmp >> 16) & ma3;\n\n  tmp = tmp * 10000 + (tmp >> 32) & ma4;\n\n  ci += (72 - dig >> 3);\n\n  return tmp;\n}\n\nchar *di = cn;\n\ninline void putint(int X) {\n\n  if (X < 10) {\n\n    *di++ = '0' + X;\n\n    *di++ = '\\n';\n\n    return;\n  }\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nint A[200001];\n\nint main() {\n\n  fread(cn, 1, CM, stdin);\n\n  int N = getint();\n\n  rep(i, N - 1) A[getint()]++;\n\n  rep1(i, N) putint(A[i]);\n\n  fwrite(cn, 1, di - cn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"8ca58d87ae1e0799f038109b5fcd73916124a86d22f0c0fa62c0990017f9b31b","fast_id":"e9332d4356d5aff903cc40682fa6f1318307ba0d1ffabe993854aea31e32ebb3","fast_time":0.0553217373,"language":"cpp","measured_fast_code_id":"e9332d4356d5aff903cc40682fa6f1318307ba0d1ffabe993854aea31e32ebb3","measured_slow_code_id":"257b3586083f2dedd618f6363ed52ad445ad89f814d5cef15fc52990cc301435","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35265","problem_id":"p02648","slow_code_id":"02908457ba0c7727e01f9e816838862d002566331fc7ce9ea107fd54f69ce4d5","slow_id":"257b3586083f2dedd618f6363ed52ad445ad89f814d5cef15fc52990cc301435","slow_time":0.4445976878,"speedup":8.03658217364045,"stratum":"8+","sampling_key":"907d85608cceb08b0b00e3d15a9fbbbf5b3c7850a94474ab63b3a10568ea7613","slow_code":"#include <bits/stdc++.h>\n\n#define inf 1000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<double, double>\n\n#define ppap pair<pa, int>\n\n#define PI 3.14159265358979323846\n\n#define paa pair<int, char>\n\n#define mp make_pair\n\n#define pb push_back\n\n#define EPS (1e-8)\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};\n\nusing namespace std;\n\nclass pa3 {\n\npublic:\n  int x;\n\n  int y, z;\n\n  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n\n  bool operator<(const pa3 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    return z < p.z;\n  }\n\n  bool operator>(const pa3 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    return z > p.z;\n  }\n\n  bool operator==(const pa3 &p) const {\n\n    return x == p.x && y == p.y && z == p.z;\n  }\n\n  bool operator!=(const pa3 &p) const {\n\n    return !(x == p.x && y == p.y && z == p.z);\n  }\n};\n\nclass pa4 {\n\npublic:\n  int x;\n\n  int y, z, w;\n\n  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n\n  bool operator<(const pa4 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    if (z != p.z)\n      return z < p.z;\n\n    return w < p.w;\n  }\n\n  bool operator>(const pa4 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    if (z != p.z)\n      return z > p.z;\n\n    return w > p.w;\n  }\n\n  bool operator==(const pa4 &p) const {\n\n    return x == p.x && y == p.y && z == p.z && w == p.w;\n  }\n};\n\nclass pa2 {\n\npublic:\n  int x, y;\n\n  pa2(int x = 0, int y = 0) : x(x), y(y) {}\n\n  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n\n  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n\n  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }\n\n  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const pa2 &p) const {\n\n    return abs(x - p.x) == 0 && abs(y - p.y) == 0;\n  }\n\n  bool operator!=(const pa2 &p) const {\n\n    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);\n  }\n};\n\nstring itos(int i) {\n\n  ostringstream s;\n\n  s << i;\n\n  return s.str();\n}\n\nint gcd(int v, int b) {\n\n  if (v == 0)\n    return b;\n\n  if (b == 0)\n    return v;\n\n  if (v > b)\n    return gcd(b, v);\n\n  if (v == b)\n    return b;\n\n  if (b % v == 0)\n    return v;\n\n  return gcd(v, b % v);\n}\n\nint mod;\n\nint extgcd(int a, int b, int &x, int &y) {\n\n  if (b == 0) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n  }\n\n  int d = extgcd(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\npa operator+(const pa &l, const pa &r) {\n\n  return {l.first + r.first, l.second + r.second};\n}\n\npa operator-(const pa &l, const pa &r) {\n\n  return {l.first - r.first, l.second - r.second};\n}\n\nint beki(int wa, int rr, int warukazu) {\n\n  if (rr == 0)\n    return 1 % warukazu;\n\n  if (rr == 1)\n    return wa % warukazu;\n\n  wa %= warukazu;\n\n  if (rr % 2 == 1)\n    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;\n\n  ll zx = beki(wa, rr / 2, warukazu);\n\n  return (zx * zx) % warukazu;\n}\n\nint pr[1000100];\n\nint inv[1000010];\n\nint comb(int nn, int rr) {\n\n  if (rr < 0 || rr > nn || nn < 0)\n    return 0;\n\n  int r = pr[nn] * inv[rr];\n\n  r %= mod;\n\n  r *= inv[nn - rr];\n\n  r %= mod;\n\n  return r;\n}\n\nvoid gya(int ert) {\n\n  pr[0] = 1;\n\n  for (int i = 1; i <= ert; i++) {\n\n    pr[i] = ((ll)pr[i - 1] * i) % mod;\n  }\n\n  inv[ert] = beki(pr[ert], mod - 2, mod);\n\n  for (int i = ert - 1; i >= 0; i--) {\n\n    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;\n  }\n}\n\nbool hikaku(pa x, pa y) {\n\n  if (x.second != y.second)\n    return x.second < y.second;\n\n  return y.first < x.first;\n}\n\nvector<pa> ve[30];\n\nint v[(1 << 18) + 10] = {};\n\nint w[(1 << 18) + 10] = {};\n\nconst int D = 9;\n\nvector<pa> que[(1 << 18) + 10];\n\nint ans[200020];\n\nvoid dfs(int r, int dep, int n) {\n\n  if (r > n)\n    return;\n\n  if (dep == D + 1) {\n\n    ve[dep].clear();\n\n    ve[dep].pb(mp(0, 0));\n\n    ve[dep].pb(mp(v[r], w[r]));\n\n  }\n\n  else {\n\n    vector<pa> tmp;\n\n    for (auto vv : ve[dep - 1])\n      if (vv.second + w[r] <= 100000)\n        tmp.pb(vv + mp(v[r], w[r]));\n\n    ve[dep].clear();\n\n    int i = 0, j = 0;\n\n    while (1) {\n\n      if (i == (int)ve[dep - 1].size() && j == (int)tmp.size())\n        break;\n\n      else if (i == (int)ve[dep - 1].size()) {\n\n        ve[dep].pb(tmp[j]);\n\n        j++;\n\n      }\n\n      else if (j == (int)tmp.size()) {\n\n        ve[dep].pb(ve[dep - 1][i]);\n\n        i++;\n\n      }\n\n      else {\n\n        if (ve[dep - 1][i].second < tmp[j].second ||\n            (ve[dep - 1][i].second == tmp[j].second &&\n             ve[dep - 1][i].first >= tmp[j].first)) {\n\n          ve[dep].pb(ve[dep - 1][i]);\n\n          i++;\n\n        }\n\n        else {\n\n          ve[dep].pb(tmp[j]);\n\n          j++;\n        }\n      }\n    }\n  }\n\n  for (int i = 1; i < (int)ve[dep].size(); i++)\n    ve[dep][i].first = max(ve[dep][i].first, ve[dep][i - 1].first);\n\n  for (auto q : que[r]) {\n\n    if (dep <= D) {\n\n      int f = 0;\n\n      for (auto v : ve[dep])\n        if (v.second <= q.second)\n          f = max(f, v.first);\n\n      ans[q.first] = f;\n\n    }\n\n    else {\n\n      int e = ve[dep].size();\n\n      e--;\n\n      int f = 0;\n\n      for (auto vv : ve[D])\n        if (vv.second <= q.second) {\n\n          while (ve[dep][e].second + vv.second > q.second)\n            e--;\n\n          f = max(f, ve[dep][e].first + vv.first);\n        }\n\n      ans[q.first] = f;\n    }\n  }\n\n  dfs(2 * r, dep + 1, n);\n\n  dfs(2 * r + 1, dep + 1, n);\n}\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++)\n    cin >> v[i] >> w[i];\n\n  ve[0].pb(mp(0, 0));\n\n  int q;\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n\n    int t, W;\n\n    cin >> t >> W;\n\n    que[t].pb(mp(i, W));\n  }\n\n  dfs(1, 1, n);\n\n  for (int i = 0; i < q; i++)\n    cout << ans[i] << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define inf 1000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<double, double>\n\n#define PI 3.14159265358979323846\n\n#define mp make_pair\n\n#define pb push_back\n\n#define EPS (1e-8)\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};\n\nusing namespace std;\n\nclass pa3 {\n\npublic:\n  int x;\n\n  int y, z;\n\n  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n\n  bool operator<(const pa3 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    return z < p.z;\n  }\n\n  bool operator>(const pa3 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    return z > p.z;\n  }\n\n  bool operator==(const pa3 &p) const { return x == p.x && y == p.y && z == p.z; }\n\n  bool operator!=(const pa3 &p) const { return !(x == p.x && y == p.y && z == p.z); }\n};\n\nclass pa4 {\n\npublic:\n  int x;\n\n  int y, z, w;\n\n  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n\n  bool operator<(const pa4 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    if (z != p.z)\n      return z < p.z;\n\n    return w < p.w;\n  }\n\n  bool operator>(const pa4 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    if (z != p.z)\n      return z > p.z;\n\n    return w > p.w;\n  }\n\n  bool operator==(const pa4 &p) const { return x == p.x && y == p.y && z == p.z && w == p.w; }\n};\n\nclass pa2 {\n\npublic:\n  int x, y;\n\n  pa2(int x = 0, int y = 0) : x(x), y(y) {}\n\n  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n\n  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n\n  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }\n\n  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const pa2 &p) const { return abs(x - p.x) == 0 && abs(y - p.y) == 0; }\n\n  bool operator!=(const pa2 &p) const { return !(abs(x - p.x) == 0 && abs(y - p.y) == 0); }\n};\n\nstring itos(int i) {\n\n  ostringstream s;\n\n  s << i;\n\n  return s.str();\n}\n\nint Gcd(int v, int b) {\n\n  if (v == 0)\n    return b;\n\n  if (b == 0)\n    return v;\n\n  if (v > b)\n    return Gcd(b, v);\n\n  if (v == b)\n    return b;\n\n  if (b % v == 0)\n    return v;\n\n  return Gcd(v, b % v);\n}\n\nint mod;\n\nint extgcd(int a, int b, int &x, int &y) {\n\n  if (b == 0) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n  }\n\n  int d = extgcd(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\npa operator+(const pa &l, const pa &r) { return {l.first + r.first, l.second + r.second}; }\n\npa operator-(const pa &l, const pa &r) { return {l.first - r.first, l.second - r.second}; }\n\nint beki(int wa, int rr, int warukazu) {\n\n  if (rr == 0)\n    return 1 % warukazu;\n\n  if (rr == 1)\n    return wa % warukazu;\n\n  wa %= warukazu;\n\n  if (rr % 2 == 1)\n    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;\n\n  ll zx = beki(wa, rr / 2, warukazu);\n\n  return (zx * zx) % warukazu;\n}\n\nint pr[1000100];\n\nint inv[1000110];\n\nint comb(int nn, int rr) {\n\n  if (rr < 0 || rr > nn || nn < 0)\n    return 0;\n\n  int r = pr[nn] * inv[rr];\n\n  r %= mod;\n\n  r *= inv[nn - rr];\n\n  r %= mod;\n\n  return r;\n}\n\nvoid gya(int ert) {\n\n  pr[0] = 1;\n\n  for (int i = 1; i <= ert; i++) {\n\n    pr[i] = ((ll)pr[i - 1] * i) % mod;\n  }\n\n  inv[ert] = beki(pr[ert], mod - 2, mod);\n\n  for (int i = ert - 1; i >= 0; i--) {\n\n    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;\n  }\n}\n\nint v[(1 << 18) + 10];\n\nint w[(1 << 18) + 10];\n\nbool hikaku(pa x, pa y) {\n\n  if (x.second != y.second)\n    return x.second < y.second;\n\n  return y.first < x.first;\n}\n\nvector<pa> ch(vector<pa> ve, int L) {\n\n  vector<pa> Q(1);\n\n  Q[0] = mp(0, 0);\n\n  for (auto v : ve) {\n\n    vector<pa> R;\n\n    for (auto q : Q)\n      if (q.second + v.second <= L)\n        R.pb(v + q);\n\n    vector<pa> ima;\n\n    int i = 0;\n\n    int j = 0;\n\n    while (1) {\n\n      if (i == Q.size() && j == R.size())\n        break;\n\n      else if (i == Q.size()) {\n\n        ima.pb(R[j]);\n\n        j++;\n\n      }\n\n      else if (j == R.size()) {\n\n        ima.pb(Q[i]);\n\n        i++;\n\n      }\n\n      else {\n\n        if (Q[i].second < R[j].second || (Q[i].second == R[j].second && Q[i].first > R[j].first)) {\n\n          ima.pb(Q[i]);\n\n          i++;\n\n        }\n\n        else {\n\n          ima.pb(R[j]);\n\n          j++;\n        }\n      }\n    }\n\n    swap(ima, Q);\n  }\n\n  for (int i = 1; i < Q.size(); i++)\n    Q[i].first = max(Q[i].first, Q[i - 1].first);\n\n  return Q;\n}\n\nvoid solve() {\n\n  int t, W;\n\n  cin >> t >> W;\n\n  vector<pa> ve[2];\n\n  int cnt = 0;\n\n  while (t >= 1) {\n\n    ve[cnt].pb(mp(v[t], w[t]));\n\n    cnt ^= 1;\n\n    t /= 2;\n  }\n\n  vector<pa> s1 = ch(ve[0], W);\n\n  vector<pa> s2 = ch(ve[1], W);\n\n  t = s2.size();\n\n  t--;\n\n  int ans = 0;\n\n  for (int i = 0; i < s1.size(); i++) {\n\n    while (s1[i].second + s2[t].second > W)\n      t--;\n\n    ans = max(ans, s1[i].first + s2[t].first);\n  }\n\n  cout << ans << endl;\n}\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++)\n    cin >> v[i] >> w[i];\n\n  int q;\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++)\n    solve();\n\n  return 0;\n}"}
{"fast_code_id":"61ecd63e092f93be451a29082ea8cb5ec8e28944bcded98155b490b41f6a2d11","fast_id":"2300c2d10ede790c26232edc4087fab42a4cb1dd850d607cff4949fb95d4c031","fast_time":0.1086599997,"language":"cpp","measured_fast_code_id":"2300c2d10ede790c26232edc4087fab42a4cb1dd850d607cff4949fb95d4c031","measured_slow_code_id":"1348fae43f53eb6445af90bb8fe313716f69eb48b1f90816af4945527f7233ce","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35338","problem_id":"p02773","slow_code_id":"b2b9c90f5ae3d7e2093019feddb84c177a0e196153b8fadcadf32745d602fc26","slow_id":"1348fae43f53eb6445af90bb8fe313716f69eb48b1f90816af4945527f7233ce","slow_time":1.0900445456,"speedup":10.031700244887817,"stratum":"8+","sampling_key":"4490612a6ffa8e13165602eb42b5fe424520ad2c29c804393b9ea747b71b45ec","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 5;\n\nchar tmp[N];\n\npair<int, string> A[N];\n\nmap<string, int> idx;\n\nmap<string, int> mp;\n\nmap<int, vector<string> > rmp;\n\nint main()\n\n{\n\n  int n, mx = -1;\n\n  scanf(\"%d\", &n);\n\n  string s;\n\n  for (int i = 0; i < n; ++i) {\n\n    scanf(\"%s\", tmp);\n\n    string s(tmp);\n\n    mx = max(mx, ++mp[s]);\n\n    rmp[mp[s]].push_back(s);\n  }\n\n  sort(rmp[mx].begin(), rmp[mx].end());\n\n  for (auto x : rmp[mx]) {\n\n    printf(\"%s\\n\", x.c_str());\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 5;\n\nint n, mx = 0;\n\nmap<string, int> mp;\n\nint main() {\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    string s;\n\n    cin >> s;\n\n    mx = max(mx, ++mp[s]);\n  }\n\n  for (auto it : mp) {\n\n    if (it.second == mx) {\n\n      cout << it.first << endl;\n    }\n  }\n}\n"}
{"fast_code_id":"50e20ee2ababa7ab98490b434c86cecdbd78dcc315606cc92bba1fa3262cb03f","fast_id":"937801d716057d353488154b0d485e0925f45b3022fa9d2f098692e563fb17c3","fast_time":0.0171843869,"language":"cpp","measured_fast_code_id":"937801d716057d353488154b0d485e0925f45b3022fa9d2f098692e563fb17c3","measured_slow_code_id":"801b5c90bf09c0da86f6876db64800e13c862d1c50f759e06ba19ba1c3097697","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3571","problem_id":"p02989","slow_code_id":"63cd0c5211fb19a847172c3d4e35b37723028eee5289b348cc2cbd3a076600e0","slow_id":"801b5c90bf09c0da86f6876db64800e13c862d1c50f759e06ba19ba1c3097697","slow_time":0.1746762543,"speedup":10.164823180278837,"stratum":"8+","sampling_key":"14d0100fac57306dffcf858631f7cc9075ff11f421c1f3dab911975c21c4019b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <typename Arg1>\n\nvoid __f(const char *name, Arg1 &&arg1) {\n\n  cerr << name << \" : \" << arg1 << \"\\n\";\n}\n\ntemplate <typename Arg1, typename... Args>\n\nvoid __f(const char *na, Arg1 &&arg1, Args &&...args) {\n\n  const char *c = strchr(na + 1, ',');\n\n  cerr.write(na, c - na) << \" : \" << arg1 << \" , \";\n\n  __f(c + 1, args...);\n}\n\n#define endl \"\\n\"\n\n#define all(V) V.begin(), V.end()\n\n#define Unique(V) sort(all(V)), V.erase(unique(all(V)), V.end())\n\n#define IO                                                                     \\\n  ios_base::sync_with_stdio(0);                                                \\\n  cin.tie(0);                                                                  \\\n  cout.tie(0);\n\ntypedef long long int LL;\n\ntypedef pair<int, int> pii;\n\nconst int MOD = 1e9 + 7;\n\nconst int inf = 1e9;\n\nconst double EPS = 1e-9;\n\nconst double PI = acos(-1.0);\n\nconst long long INF = 1e18;\n\nconst int N = 1e5 + 5;\n\nint a[N];\n\nint main() {\n\n  IO;\n\n#ifdef LOCAL\n\n#endif\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++)\n    cin >> a[i];\n\n  sort(a + 1, a + n + 1);\n\n  int ans = 0;\n\n  for (int i = 1; i <= 1e5; i++) {\n\n    int lo = 1, hi = n, ret = 0, key = i;\n\n    while (lo <= hi) {\n\n      int mid = (lo + hi) >> 1;\n\n      if (a[mid] >= key)\n        ret = mid, hi = mid - 1;\n\n      else if (a[mid] < key)\n        lo = mid + 1;\n    }\n\n    int big = n - ret + 1;\n\n    int small = n - big;\n\n    if (big == small)\n      ans++;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nint a[100005] = {0};\n\nint main()\n\n{\n\n  int n;\n\n  while (~scanf(\"%d\", &n))\n\n  {\n\n    for (int i = 1; i <= n; i++)\n\n      scanf(\"%d\", &a[i]);\n\n    sort(a + 1, a + 1 + n);\n\n    if (a[n / 2] == a[n / 2 + 1])\n\n      printf(\"0\\n\");\n\n    else\n\n      printf(\"%d\\n\", a[n / 2 + 1] - a[n / 2]);\n  }\n}"}
{"fast_code_id":"4de05146c155ca50dc0c0968441291386657bbb60868286451ba296e4622b975","fast_id":"c73b905e603bd3172f410f66b307704f7150e84a483201e60403fbc829cd2c45","fast_time":0.1093193413,"language":"cpp","measured_fast_code_id":"c73b905e603bd3172f410f66b307704f7150e84a483201e60403fbc829cd2c45","measured_slow_code_id":"c7d9215f7a6abb6ddf3764eb6938b2a81afca6e2fa1317490ce47626d58d783b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35750","problem_id":"p01564","slow_code_id":"6a47999163c4e847cb82e9a1f27debe24596459b48c3fd63835bf24482ada91c","slow_id":"c7d9215f7a6abb6ddf3764eb6938b2a81afca6e2fa1317490ce47626d58d783b","slow_time":1.5187843265,"speedup":13.893098041380167,"stratum":"8+","sampling_key":"008c7a08ff9f1c347bc28295e5c5e8fcd5eec8bb18122b0fdaaeb0a8e18b6c28","slow_code":"#define NDEBUG\n\n#include <iostream>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <tuple>\n\n#include <cassert>\n\n#include <unistd.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nstruct LCNode {\n\n  typedef LCNode *NP;\n\n  typedef int D;\n\n  static const int INF = 1LL << 25;\n\n  static const int DF = 1LL << 25;\n\n  static LCNode last_d;\n\n  static NP last;\n\n  NP p, l, r;\n\n  int sz;\n\n  int v, sm, lz;\n\n  int lsm, rsm, ma, mv;\n\n  bool rev;\n\n  LCNode(D v)\n      : p(NULL), l(last), r(last), sz(1),\n\n        v(v), sm(v), lz(DF), rev(false),\n\n        lsm(max(v, 0)), rsm(max(v, 0)), ma(max(v, 0)), mv(v) {}\n\n  LCNode() : l(NULL), r(NULL), sz(0), v(-INF), mv(-INF) {}\n\n  inline int pos() {\n\n    if (p) {\n\n      if (p->l == this)\n        return -1;\n\n      if (p->r == this)\n        return 1;\n    }\n\n    return 0;\n  }\n\n  void rot() {\n\n    NP qq = p->p;\n\n    int pps = p->pos();\n\n    if (p->l == this) {\n\n      p->l = r;\n      r->p = p;\n\n      r = p;\n      p->p = this;\n\n    } else {\n\n      p->r = l;\n      l->p = p;\n\n      l = p;\n      p->p = this;\n    }\n\n    p->update();\n    update();\n\n    p = qq;\n\n    if (!pps)\n      return;\n\n    if (pps == -1) {\n\n      qq->l = this;\n\n    } else {\n\n      qq->r = this;\n    }\n\n    qq->update();\n  }\n\n  void splay() {\n\n    assert(this != last);\n\n    supush();\n\n    int ps;\n\n    while ((ps = pos())) {\n\n      int pps = p->pos();\n\n      if (!pps) {\n\n        rot();\n\n      } else if (ps == pps) {\n\n        p->rot();\n        rot();\n\n      } else {\n\n        rot();\n        rot();\n      }\n    }\n  }\n\n  void expose() {\n\n    assert(this != last);\n\n    NP u = this;\n\n    do {\n\n      u->splay();\n\n    } while ((u = u->p));\n\n    u = last;\n\n    u->p = this;\n\n    do {\n\n      u->p->r = u;\n\n      u->p->update();\n\n      u = u->p;\n\n    } while (u->p);\n\n    splay();\n  }\n\n  void push() {\n\n    int lsz = l->sz, rsz = r->sz;\n\n    if (rev) {\n\n      if (lsz) {\n\n        l->revdata();\n      }\n\n      if (rsz) {\n\n        r->revdata();\n      }\n\n      rev = false;\n    }\n\n    if (lz != DF) {\n\n      if (lsz) {\n\n        l->lzdata(lz);\n      }\n\n      if (rsz) {\n\n        r->lzdata(lz);\n      }\n\n      lz = DF;\n    }\n  }\n\n  void nopush() {\n\n    assert(rev == false);\n\n    assert(lz == DF);\n  }\n\n  void supush() {\n\n    if (pos()) {\n\n      p->supush();\n    }\n\n    push();\n  }\n\n  inline void revdata() {\n\n    assert(this != last);\n\n    swap(l, r);\n\n    swap(lsm, rsm);\n\n    rev ^= true;\n  }\n\n  inline void lzdata(D d) {\n\n    assert(this != last);\n\n    v = mv = d;\n\n    sm = sz * d;\n\n    lsm = rsm = ma = max(0, sm);\n\n    lz = d;\n  }\n\n  NP update() {\n\n    assert(this != last);\n\n    sz = 1 + l->sz + r->sz;\n\n    sm = v + l->sm + r->sm;\n\n    lsm = max(l->lsm, l->sm + v + r->lsm);\n\n    rsm = max(r->rsm, r->sm + v + l->rsm);\n\n    ma = l->rsm + v + r->lsm;\n\n    ma = max(ma, l->ma);\n\n    ma = max(ma, r->ma);\n\n    mv = max(l->mv, r->mv);\n\n    mv = max(mv, v);\n\n    return this;\n  }\n\n  void evert() {\n\n    expose();\n\n    revdata();\n  }\n};\n\nLCNode LCNode::last_d = LCNode();\n\nLCNode::NP LCNode::last = &last_d;\n\nconst int MSIN = 30000000;\n\nchar stdinb[MSIN];\n\nint cs = 0;\n\nchar getc() {\n\n  cs++;\n\n  return stdinb[cs - 1];\n}\n\nint getint() {\n\n  char c;\n\n  bool neg = false;\n\n  do {\n\n    c = getc();\n\n  } while (!isdigit(c) && c != '-');\n\n  if (c == '-') {\n    neg = true;\n    c = getc();\n  }\n\n  int res = c - '0';\n\n  while (isdigit(c = getc())) {\n\n    res *= 10;\n\n    res += c - '0';\n  }\n\n  if (neg)\n    res *= -1;\n\n  return res;\n}\n\nconst int MN = 201000;\n\nLCNode tr[MN];\n\nint main() {\n\n  read(0, stdinb, MSIN);\n\n  int n = getint(), q = getint();\n\n  for (int i = 0; i < n; i++) {\n\n    int w = getint();\n\n    tr[i] = LCNode(w);\n  }\n\n  for (int i = 0; i < n - 1; i++) {\n\n    int s = getint(), e = getint();\n    s--;\n    e--;\n\n    tr[s].evert();\n\n    tr[e].expose();\n\n    tr[s].p = &tr[e];\n  }\n\n  for (int i = 0; i < q; i++) {\n\n    int t = getint(), a = getint(), b = getint(), c = getint();\n\n    a--;\n    b--;\n\n    if (t == 1) {\n\n      tr[a].evert();\n\n      tr[b].expose();\n\n      tr[b].lzdata(c);\n\n    } else {\n\n      tr[a].evert();\n\n      tr[b].expose();\n\n      int d;\n\n      if (tr[b].mv < 0)\n        d = tr[b].mv;\n\n      else\n        d = tr[b].ma;\n\n      printf(\"%d\\n\", d);\n    }\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\n \n\nusing namespace std;\n\nusing ll = long long;\n\nconstexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }\n\ntemplate<class T> using V = vector<T>;\n\ntemplate<class T> using VV = V<V<T>>;\n\n\n\nusing P = pair<int, int>;\n\nstruct HL {\n\n  V<int> _ord, _rord, big, small;\n\n  HL(int n = 0) : _ord(n), _rord(n), big(n), small(n) {}\n\n  int ord(int i) { return i == -1 ? -1 : _ord[i]; }\n\n  int rord(int i) { return i == -1 ? -1 : _rord[i]; }\n\n  int par(int a) {\n\n    a = ord(a);\n\n    return rord(small[a] == a ? big[a] : a-1);\n\n  }\n\n  int lca(int a, int b) {\n\n    a = ord(a); b = ord(b);\n\n    while (a != b) {\n\n      if (a > b) swap(a, b);\n\n      if (small[b] <= a) break;\n\n      else b = big[b];\n\n    }\n\n    return rord(a);\n\n  }\n\n  void get_path(int a, int b, function<void(int, int)> f) {        \n\n    a = ord(a); b = ord(b);\n\n    while (a < b) {\n\n      if (small[b] <= a) f(a+1, b);\n\n      else f(small[b], b);\n\n      b = big[b];\n\n    }\n\n  }\n\n  V<P> get_path(int a, int b) {\n\n    a = ord(a); b = ord(b);\n\n    V<P> res;\n\n    while (a < b) {\n\n      if (small[b] <= a) res.push_back(P(a+1, b+1));\n\n      else res.push_back(P(small[b], b+1));\n\n      b = big[b];\n\n    }\n\n    return res;\n\n  }\n\n};\n\ntemplate<class E> struct HL_EXEC : HL {\n\n  const VV<E>& g;\n\n  V<int> tch;\n\n  int id = 0;\n\n  HL_EXEC(const VV<E>& _g, int r) : HL(_g.size()), g(_g), tch(g.size(), -1) {\n\n    assert(dfs_sz(r, -1) == int(g.size()));\n\n    dfs(r, -1);\n\n  }\n\n  int dfs_sz(int p, int b) {\n\n    int sz = 1, msz = -1;\n\n    for (auto e: g[p]) {\n\n      if (e.to == b) continue;\n\n      int u = dfs_sz(e.to, p);\n\n      sz += u;\n\n      if (msz < u) tie(tch[p], msz) = make_pair(e.to, u);\n\n    }\n\n    return sz;\n\n  }\n\n  void dfs(int p, int b) {\n\n    int q = id++, bq = ord(b);\n\n    _ord[p] = q; _rord[q] = p;\n\n    if (b == -1 || bq != q-1) {\n\n      small[q] = q; big[q] = bq;\n\n    } else {\n\n      small[q] = small[bq]; big[q] = big[bq];\n\n    }\n\n    if (tch[p] == -1) return;\n\n    dfs(tch[p], p);\n\n    for (auto e: g[p]) {\n\n      if (e.to == b || e.to == tch[p]) continue;\n\n      dfs(e.to, p);\n\n    }\n\n  }\n\n};\n\ntemplate<class E> HL get_hl(const VV<E>& g, int r) { return HL_EXEC<E>(g, r); }\n\n\n\nstruct D {\n\n  ll mx = -TEN(9), l = -TEN(9), r = -TEN(9), sm = 0;\n\n  D operator+(const D& ri) const {\n\n    return D{max({mx, ri.mx, r+ri.l}), max(l, sm+ri.l), max(r+ri.sm, ri.r), sm+ri.sm};\n\n  }\n\n};\n\nstruct Node {\n\n  using NP = Node*;\n\n  NP l, r;\n\n  int sz;\n\n  D d; int lz = -TEN(9);\n\n  Node(int _sz, V<ll> &fi, int off = 0) : sz(_sz) {\n\n    if (sz == 1) {\n\n      lzdata(fi[off]);\n\n      return;\n\n    }\n\n    l = new Node(sz/2, fi, off);\n\n    r = new Node(sz - sz/2, fi, off + sz/2);\n\n    d = l->d + r->d;\n\n  }\n\n  void lzdata(ll x) {\n\n    if (x >= 0) d = D{x*sz, x*sz, x*sz, x*sz};\n\n    else d = D{x, x, x, x*sz};\n\n    lz = x;\n\n  }\n\n  void push() {\n\n    if (lz == -TEN(9)) return;\n\n    l->lzdata(lz); r->lzdata(lz);\n\n    lz = -TEN(9);\n\n  }\n\n  D get(int a, int b) {\n\n    if (b <= 0 || sz <= a) return D();\n\n    if (a <= 0 && sz <= b) return d;\n\n    push();\n\n    return l->get(a, b) + r->get(a-sz/2, b-sz/2);\n\n  }\n\n  D get_multi(V<P> &q, int off = 0) {\n\n    while (q.size() && q.back().second <= off) q.pop_back();\n\n    if (!q.size() || off+sz <= q.back().first) return D();\n\n    if (q.back().first <= off && off+sz <= q.back().second) return d;\n\n    push();\n\n    D ld = l->get_multi(q, off);\n\n    D rd = r->get_multi(q, off + sz/2);\n\n    return ld + rd;\n\n  }\n\n  void fil(int a, int b, int x) {\n\n    if (b <= 0 || sz <= a) return;\n\n    if (a <= 0 && sz <= b) {\n\n      lzdata(x);\n\n      return;\n\n    }\n\n    push();\n\n    l->fil(a, b, x); r->fil(a-sz/2, b-sz/2, x); \n\n    d = l->d + r->d;       \n\n  }\n\n  void fil_multi(V<P> &q, int x, int off = 0) {\n\n    while (q.size() && q.back().second <= off) q.pop_back();\n\n    if (!q.size() || off+sz <= q.back().first) return;\n\n    if (q.back().first <= off && off+sz <= q.back().second) {\n\n      lzdata(x);\n\n      return;\n\n    }\n\n    push();\n\n    l->fil_multi(q, x, off);\n\n    r->fil_multi(q, x, off + sz/2);\n\n    d = l->d + r->d;\n\n  }\n\n};\n\n\n\nstruct E { int to; };\n\nint main() {\n\n  ios::sync_with_stdio(false); cin.tie(0);\n\n  int n, q;\n\n  scanf(\"%d %d\", &n, &q);\n\n                    \n\n  V<ll> w(n), w2(n);\n\n  for (int i = 0; i < n; i++) scanf(\"%lld\", &(w[i]));\n\n  VV<E> g(n);\n\n  for (int i = 0; i < n-1; i++) {\n\n    int a, b;\n\n    scanf(\"%d %d\", &a, &b); a--; b--;\n\n                                  \n\n    g[a].push_back(E{b});\n\n    g[b].push_back(E{a});\n\n  }\n\n  auto hl = get_hl(g, 0);    \n\n  for (int i = 0; i < n; i++) w2[i] = w[hl.rord(i)];\n\n  auto tr = new Node(n, w2);\n\n  for (int i = 0; i < q; i++) {\n\n    int t, a, b; ll x;\n\n    scanf(\"%d %d %d %lld\", &t, &a, &b, &x); a--; b--;\n\n                                            \n\n    int c = hl.lca(a, b);\n\n    int d = hl.par(c);\n\n    if (t == 1) {\n\n      V<P> lq = hl.get_path(c, a), rq = hl.get_path(d, b);\n\n      tr->fil_multi(lq, x);\n\n      tr->fil_multi(rq, x);\n\n                                                                          \n\n                                                                          \n\n    } else {\n\n      D ld, rd;\n\n      V<P> lq = hl.get_path(c, a), rq = hl.get_path(d, b);\n\n      ld = tr->get_multi(lq);\n\n      rd = tr->get_multi(rq);\n\n                                                                                 \n\n                                                                                 \n\n      swap(rd.l, rd.r);\n\n      printf(\"%lld\\n\", (rd + ld).mx);\n\n                                           \n\n    }\n\n  }\n\n  return 0;\n\n}\n\n\n"}
{"fast_code_id":"a4f456961e3f8ed2be7b6cb94e68bb1ad646cce033a8994124bc9af005b2b431","fast_id":"38759f770e1fa5ce3f4ad9c479a3cf41534eee04db163b15835ab8aaa765cfc3","fast_time":0.0605164786,"language":"cpp","measured_fast_code_id":"38759f770e1fa5ce3f4ad9c479a3cf41534eee04db163b15835ab8aaa765cfc3","measured_slow_code_id":"91ccfd9b4affcf0b72f1398df0ab98d4b7fdf581d4f20d843e3f897ba31eb839","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35858","problem_id":"p02913","slow_code_id":"51d183482d81edb2f5fef0920546d494b4d9a02c06643065c6ed6105d6745798","slow_id":"91ccfd9b4affcf0b72f1398df0ab98d4b7fdf581d4f20d843e3f897ba31eb839","slow_time":0.1954533524,"speedup":3.2297542243312223,"stratum":"2-4","sampling_key":"37c144073d5239ef10f427957412a7bafec15ce76dd2bd16f404d981c8e3c38d","slow_code":"#include <bits/stdc++.h>\n\n#define mp make_pair\n\n#define ff first\n\n#define ss second\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef pair<LL, LL> PLL;\n\ntypedef pair<int, int> PII;\n\nconst PLL M = mp(1e9 + 7, 1e9 + 9);\n\nconst LL base = 875329;\n\nconst int N = 1e5 + 7;\n\nostream &operator<<(ostream &os, PLL hash) {\n\n  return os << \"(\" << hash.ff << \", \" << hash.ss << \")\";\n}\n\nPLL operator+(PLL a, LL x) { return mp(a.ff + x, a.ss + x); }\n\nPLL operator-(PLL a, LL x) { return mp(a.ff - x, a.ss - x); }\n\nPLL operator*(PLL a, LL x) { return mp(a.ff * x, a.ss * x); }\n\nPLL operator+(PLL a, PLL x) { return mp(a.ff + x.ff, a.ss + x.ss); }\n\nPLL operator-(PLL a, PLL x) { return mp(a.ff - x.ff, a.ss - x.ss); }\n\nPLL operator*(PLL a, PLL x) { return mp(a.ff * x.ff, a.ss * x.ss); }\n\nPLL operator%(PLL a, PLL m) { return mp(a.ff % m.ff, a.ss % m.ss); }\n\nPLL pb[N];\n\nvoid pre() {\n\n  pb[0] = mp(1, 1);\n\n  for (int i = 1; i < N; i++)\n\n    pb[i] = (pb[i - 1] * base) % M;\n}\n\nvector<PLL> hashList(string &s) {\n\n  int n = s.size();\n\n  vector<PLL> ans(n + 1);\n\n  ans[0] = mp(0, 0);\n\n  for (int i = 1; i <= n; i++)\n\n    ans[i] = (ans[i - 1] * base + s[i - 1]) % M;\n\n  return ans;\n}\n\nPLL Hash(vector<PLL> &hashlist, int l, int r) {\n\n  int len = (r - l + 1);\n\n  return ((hashlist[r] - hashlist[l - 1] * pb[len]) % M + M) % M;\n}\n\nvector<PLL> hashVec;\n\nint n;\n\nbool ok(int len) {\n\n  for (int i = 1; i + len - 1 <= n; i++) {\n\n    PLL val1 = Hash(hashVec, i, i + len - 1);\n\n    for (int j = i + len; j + len - 1 <= n; j++) {\n\n      PLL val2 = Hash(hashVec, j, j + len - 1);\n\n      if (val1 == val2)\n        return true;\n    }\n  }\n\n  return false;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  pre();\n\n  string str;\n\n  cin >> n >> str;\n\n  hashVec = hashList(str);\n\n  int lo = 0, hi = n;\n\n  int ans = 0;\n\n  while (lo <= hi) {\n\n    int mid = (lo + hi) / 2;\n\n    if (ok(mid)) {\n\n      ans = mid;\n\n      lo = mid + 1;\n\n    }\n\n    else\n      hi = mid - 1;\n  }\n\n  cout << ans << '\\n';\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <vector>\n\nusing namespace std;\n\nchar s[5005];\n\nint Next[5005];\n\nvector<char> v[5005];\n\nint main()\n\n{\n\n  int n, i, j, k, t, max = 0;\n\n  scanf(\"%d%s\", &n, s);\n\n  for (i = 0; i < n; i++)\n\n    for (j = i; j < n; j++)\n\n      v[i].push_back(s[j]);\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    Next[0] = -1;\n\n    j = 0;\n\n    k = -1;\n\n    while (j < n - i)\n\n    {\n\n      if (k == -1 || v[i][j] == v[i][k])\n\n        Next[++j] = ++k;\n\n      else\n\n        k = Next[k];\n    }\n\n    for (j = 0; j <= n - i; j++)\n\n    {\n\n      if (Next[j] <= j / 2)\n\n      {\n\n        if (Next[j] > max)\n          max = Next[j];\n\n      }\n\n      else\n\n      {\n\n        t = j - Next[j];\n\n        t = t * (j / t / 2);\n\n        if (t > max)\n          max = t;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", max);\n\n  return 0;\n}"}
{"fast_code_id":"8984f4217be90a3334ceffc6f58efd1b211158d630e2949867a35adec322e253","fast_id":"8937969f5b0d24158e304258ea1aaf3aaa5e72ea0c3176b97c701c7be489e23c","fast_time":0.0967221038,"language":"cpp","measured_fast_code_id":"8937969f5b0d24158e304258ea1aaf3aaa5e72ea0c3176b97c701c7be489e23c","measured_slow_code_id":"44ec79ca57b1721e2c95706a0233be1373eb67c3870752093a9ac4461e2439c1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35898","problem_id":"p03256","slow_code_id":"eb6a7a421336e9b70d0283591625d9550abb667d7e2de6edf895cbe7b6bfe1f0","slow_id":"44ec79ca57b1721e2c95706a0233be1373eb67c3870752093a9ac4461e2439c1","slow_time":0.6478884012,"speedup":6.698452326261332,"stratum":"4-8","sampling_key":"0d8cda44fdaccb9737fd6d317a7f4fd8bdeca39b60488836fd912798bf5e7add","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nvector<int> g[212345];\n\nint main() {\n\n  std::ios::sync_with_stdio(false), std::cin.tie(0);\n\n  int n, m;\n  cin >> n >> m;\n\n  string s;\n\n  cin >> s;\n\n  for (int i = 0; i < m; i++) {\n\n    int a, b;\n\n    cin >> a >> b;\n    a--;\n    b--;\n\n    g[a].push_back(b);\n\n    g[b].push_back(a);\n  }\n\n  vector<int> ok(n, 1);\n\n  function<void(int)> check = [&](int i) {\n    if (!ok[i])\n      return;\n\n    int f[2] = {};\n\n    for (int j : g[i]) {\n\n      if (ok[j])\n        f[s[j] == 'A']++;\n    }\n\n    if (!(f[0] && f[1]))\n      ok[i] = 0;\n\n    if (!ok[i]) {\n\n      auto newg = g[i];\n\n      for (int j : g[i]) {\n\n        if (!ok[j])\n          continue;\n\n        check(j);\n\n        if (ok[j])\n          newg.push_back(j);\n      }\n\n      g[i] = newg;\n    }\n  };\n\n  for (int i = 0; i < n; i++)\n    check(i);\n\n  cout << (find((ok).begin(), (ok).end(), 1) != ok.end() ? \"Yes\" : \"No\") << endl;\n\n  return 0;\n}\n","fast_code":"\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <stack>\n\n#include <queue>\n\n#include <map>\n\n#include <set>\n\n#include <tuple>\n\n#include <cmath>\n\n#include <random>\n\n#include <cassert>\n\nusing namespace std;\n\nusing ll = long long;\n\nconst int N = 2e5;\n\nstd::vector<std::vector<int>> g;\n\nint n, m;\n\nstring s;\n\nbool ok[N];\n\nvoid check(int i) {\n\n  if (!ok[i])\n    return;\n\n  auto ng = g[i];\n\n  ng.clear();\n\n  int cntA = 0, cntB = 0;\n\n  for (int j : g[i]) {\n\n    if (ok[j]) {\n\n      ng.push_back(j);\n\n      if (s[j] == 'A')\n        cntA++;\n\n      else\n        cntB++;\n    }\n  }\n\n  g[i] = ng;\n\n  if (!cntA || !cntB) {\n\n    ok[i] = 0;\n\n    for (int j : g[i]) {\n\n      check(j);\n    }\n  }\n}\n\nint main() {\n\n  std::ios::sync_with_stdio(false), std::cin.tie(0);\n\n  cin >> n >> m;\n\n  cin >> s;\n\n  g.resize(n);\n\n  for (int i = 0; i < m; i++) {\n\n    int a, b;\n    std::cin >> a >> b;\n\n    a--;\n    b--;\n\n    g[a].emplace_back(b);\n\n    g[b].emplace_back(a);\n  }\n\n  for (int i = 0; i < n; i++)\n    ok[i] = 1;\n\n  for (int i = 0; i < n; i++) {\n\n    check(i);\n  }\n\n  bool ans = 0;\n\n  for (int i = 0; i < n; i++)\n    ans |= ok[i];\n\n  cout << (ans ? \"Yes\" : \"No\") << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"241f7112ff59c87836b97d3f2efc8c03cac93549f21bbbdf3eba487d37c01e87","fast_id":"e6eff9a0854643940c7a26c0bc22637cbadb54f46d97078310d5585fe2d590fa","fast_time":0.1049208211,"language":"cpp","measured_fast_code_id":"e6eff9a0854643940c7a26c0bc22637cbadb54f46d97078310d5585fe2d590fa","measured_slow_code_id":"9e785c0e10a4d5919f608e624e1f4fb4c5556dc128d8406ea3a11178aebde584","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35938","problem_id":"p01426","slow_code_id":"945b5779ddb0f7d7a5cabe2be484edc8f631ee1125d17bb255bea60a570ad38a","slow_id":"9e785c0e10a4d5919f608e624e1f4fb4c5556dc128d8406ea3a11178aebde584","slow_time":0.4200451793,"speedup":4.003449219098801,"stratum":"4-8","sampling_key":"dba1995c268cf3caaba2518e59ba7d9d12cd2ae771e05cba1cd9df47acf4e224","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <string>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define eps 1e-12\n\n#define INF 1000000\n\n#define maxn 200005\n\ndouble a[105][105];\n\ndouble sum[105];\n\nstruct Edge\n\n{\n\n  int u, v;\n\n  double w;\n\n} b[10005], e[10005];\n\nint pre[maxn], id[maxn], vis[maxn];\n\ndouble in[maxn];\n\nint dcmp(double x)\n\n{\n\n  if (fabs(x) < eps)\n    return 0;\n\n  return x < 0 ? -1 : 1;\n}\n\ndouble Directed_MST(int root, int NV, int NE)\n\n{\n\n  double ret = 0;\n\n  while (1)\n\n  {\n\n    for (int i = 0; i < NV; i++)\n\n      in[i] = INF;\n\n    memset(pre, -1, sizeof(pre));\n\n    memset(vis, -1, sizeof(vis));\n\n    memset(id, -1, sizeof(id));\n\n    for (int i = 0; i < NE; i++)\n\n    {\n\n      if (e[i].u == e[i].v)\n        continue;\n\n      int v = e[i].v;\n\n      if (dcmp(e[i].w - in[v]) < 0) {\n\n        pre[v] = e[i].u;\n\n        in[v] = e[i].w;\n      }\n    }\n\n    for (int i = 0; i < NV; i++)\n\n    {\n\n      if (dcmp(in[i] - INF) == 0 && i != root)\n\n      {\n\n        return -1;\n      }\n    }\n\n    int cnt = 0;\n\n    in[root] = 0;\n\n    for (int i = 0; i < NV; i++)\n\n    {\n\n      ret += in[i];\n\n      int v = i;\n\n      while (vis[v] != i && id[v] == -1 && v != root)\n\n      {\n\n        vis[v] = i;\n\n        v = pre[v];\n      }\n\n      if (v != root && id[v] == -1) {\n\n        for (int u = pre[v]; u != v; u = pre[u])\n\n        {\n\n          id[u] = cnt;\n        }\n\n        id[v] = cnt++;\n      }\n    }\n\n    if (cnt == 0)\n      break;\n\n    for (int i = 0; i < NV; i++)\n\n      if (id[i] == -1)\n        id[i] = cnt++;\n\n    for (int i = 0; i < NE; i++)\n\n    {\n\n      int v = e[i].v;\n\n      e[i].u = id[e[i].u];\n\n      e[i].v = id[e[i].v];\n\n      e[i].w -= in[v];\n    }\n\n    NV = cnt;\n\n    root = id[root];\n  }\n\n  return ret;\n}\n\nint main()\n\n{\n\n  int n, m;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++)\n    for (int j = 0; j < n; j++)\n      scanf(\"%lf\", a[i] + j);\n\n  int tot = 0;\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    for (int j = 1; j <= m; j++)\n\n    {\n\n      double x1 = 0, x2 = 0, x3 = 0;\n\n      for (int k = 0; k < n; k++)\n\n      {\n\n        x1 += a[i][k] * a[i][k];\n\n        x3 += a[j][k] * a[j][k];\n\n        x2 += a[i][k] * a[j][k];\n      }\n\n      sum[i] = x1;\n\n      if (i == j)\n        continue;\n\n      double x = x2 / x3;\n\n      double y = x * x * x3 - 2.0 * x * x2 + x1;\n\n      e[tot].u = j;\n\n      e[tot].v = i;\n\n      e[tot].w = y;\n\n      tot++;\n    }\n  }\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    e[tot].u = 0;\n\n    e[tot].v = i;\n\n    e[tot].w = sum[i];\n\n    tot++;\n  }\n\n  double temp = Directed_MST(0, m + 1, tot);\n\n  printf(\"%.7f\\n\", temp);\n}","fast_code":"#include <iostream>\n\n#include <cstring>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\nusing namespace std;\n\nconst int maxn = 110;\n\nconst int maxe = 50010;\n\nstruct Edge\n\n{\n\n  int u, v;\n\n  double w;\n\n} edge[maxe];\n\nint nv, ne;\n\nvoid add(int u, int v, double w)\n\n{\n\n  edge[ne].u = u;\n\n  edge[ne].v = v;\n\n  edge[ne++].w = w;\n}\n\nconst double inf = 1e12;\n\ndouble In[maxn];\n\nint pre[maxn], ID[maxn], vis[maxn];\n\ndouble Directed_MST(int root)\n\n{\n\n  double ret = 0;\n\n  int i, u, v, cnt;\n\n  while (1)\n\n  {\n\n    for (i = 0; i <= nv; ++i)\n      In[i] = inf;\n\n    for (i = 0; i < ne; ++i)\n\n    {\n\n      u = edge[i].u;\n\n      v = edge[i].v;\n\n      if (edge[i].w < In[v] && u != v)\n\n      {\n\n        In[v] = edge[i].w;\n\n        pre[v] = u;\n      }\n    }\n\n    for (i = 0; i <= nv; ++i)\n\n      if (i != root && In[i] == inf)\n        return -1;\n\n    cnt = 0;\n\n    memset(ID, -1, sizeof(ID));\n\n    memset(vis, -1, sizeof(vis));\n\n    In[root] = 0;\n\n    for (i = 0; i <= nv; ++i)\n\n    {\n\n      ret += In[i];\n\n      for (v = i; vis[v] != i && ID[v] == -1 && v != root; v = pre[v])\n\n        vis[v] = i;\n\n      if (v != root && ID[v] == -1)\n\n      {\n\n        for (u = pre[v]; u != v; u = pre[u])\n\n          ID[u] = cnt;\n\n        ID[v] = cnt++;\n      }\n    }\n\n    if (cnt == 0)\n      break;\n\n    for (i = 0; i <= nv; ++i)\n\n      if (ID[i] == -1)\n        ID[i] = cnt++;\n\n    for (i = 0; i < ne; ++i)\n\n    {\n\n      v = edge[i].v;\n\n      edge[i].u = ID[edge[i].u];\n\n      edge[i].v = ID[edge[i].v];\n\n      if (edge[i].u != edge[i].v)\n\n        edge[i].w -= In[v];\n    }\n\n    nv = cnt - 1;\n\n    root = ID[root];\n  }\n\n  return ret;\n}\n\nint n, m;\n\n#define sqr(v) ((v) * (v))\n\nstruct Point\n\n{\n\n  double v[101];\n\n  double length()\n\n  {\n\n    double res = 0;\n\n    for (int i = 0; i < m; ++i)\n\n      res += sqr(v[i]);\n\n    return res;\n  }\n\n  Point operator-(const Point &p)\n\n  {\n\n    Point res;\n\n    for (int i = 0; i < m; ++i)\n\n      res.v[i] = v[i] - p.v[i];\n\n    return res;\n  }\n\n} pt[101];\n\ndouble len(int a, int b)\n\n{\n\n  double lena = sqrt(pt[a].length()), lenb = sqrt(pt[b].length()), res = 0;\n\n  for (int i = 0; i < m; ++i)\n\n    res += pt[a].v[i] * pt[b].v[i];\n\n  double cosv = res / lena / lenb;\n\n  return sqr(lenb * sin(acos(cosv)));\n}\n\nint main()\n\n{\n\n  int i, j;\n\n  scanf(\"%d%d\", &m, &n);\n\n  for (i = 1; i <= n; ++i)\n\n  {\n\n    for (j = 0; j < m; ++j)\n\n    {\n\n      scanf(\"%lf\", &pt[i].v[j]);\n    }\n\n    add(0, i, pt[i].length());\n  }\n\n  for (i = 1; i <= n; ++i)\n\n    for (j = 1; j <= n; ++j)\n\n    {\n\n      if (i == j)\n        continue;\n\n      add(i, j, len(i, j));\n    }\n\n  nv = n;\n\n  printf(\"%.9f\\n\", Directed_MST(0));\n\n  return 0;\n}"}
{"fast_code_id":"a04747cdc024dc20c51fd43e472642d00594bf0893a914713ef2e6cd37920353","fast_id":"39b7958099abdd8d81d907b30b3eaa3eb7eacca53f13935178aaefa9655ba3c5","fast_time":0.1092426876,"language":"cpp","measured_fast_code_id":"39b7958099abdd8d81d907b30b3eaa3eb7eacca53f13935178aaefa9655ba3c5","measured_slow_code_id":"4ba5de1c27bec4534cca95eb38e84497e38331dafa499ca1f4f0c9d4a393e2f8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35963","problem_id":"p03546","slow_code_id":"9f794c329ae1e31af71aeeb63b5f6f219a2193d2fa8a0a9c56c819d78329cc04","slow_id":"4ba5de1c27bec4534cca95eb38e84497e38331dafa499ca1f4f0c9d4a393e2f8","slow_time":0.6930139233,"speedup":6.343801480219167,"stratum":"4-8","sampling_key":"e05448e150f3822d0d95c4e3903dbfbb26a755bcb3ac317ee3d6063c97bed00a","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)\n\n#define SIZE 200005\n\n#define INF 1000000005LL\n\n#define MOD 1000000007\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<int, int> P;\n\nint H, W;\n\nint c[11][11];\n\nint V;\n\nstruct edge {\n  int to, cost;\n};\n\nvector<edge> G[SIZE];\n\nint d[SIZE];\n\nvoid dijkstra(int s) {\n\n  priority_queue<P, vector<P>, greater<P>> que;\n\n  fill(d, d + V, INF);\n\n  d[s] = 0;\n\n  que.push(P(0, s));\n\n  while (!que.empty()) {\n\n    P p = que.top();\n    que.pop();\n\n    int v = p.second;\n\n    if (d[v] < p.first)\n      continue;\n\n    for (int i = 0; i < G[v].size(); i++) {\n\n      edge e = G[v][i];\n\n      if (d[e.to] > d[v] + e.cost) {\n\n        d[e.to] = d[v] + e.cost;\n\n        que.push(P(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nint main()\n\n{\n\n  cin >> H >> W;\n\n  V = 10;\n\n  int C;\n\n  rep(i, 0, 10) rep(j, 0, 10) {\n\n    cin >> C;\n\n    G[j].push_back((edge){i, C});\n  }\n\n  dijkstra(1);\n\n  int a, ans = 0;\n\n  rep(i, 0, H) rep(j, 0, W) {\n\n    cin >> a;\n\n    ans += d[a];\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)\n\n#define SIZE 15\n\n#define INF 1000000005LL\n\n#define MOD 1000000007\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<int, int> P;\n\nll d[SIZE][SIZE];\n\nint V;\n\nvoid warshall_floyd_init() {\n\n  fill(d[0], d[SIZE], INF);\n\n  rep(i, 0, SIZE) d[i][i] = 0;\n}\n\nbool warshall_floyd() {\n\n  rep(k, 0, V) rep(i, 0, V) {\n\n    if (d[i][k] == INF)\n      continue;\n\n    rep(j, 0, V) {\n\n      if (d[k][j] == INF)\n        continue;\n\n      d[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n    }\n  }\n\n  rep(i, 0, V) if (d[i][i] < 0) return true;\n\n  return false;\n}\n\nvoid add_edge(int a, int b, ll c) { d[a][b] = c; }\n\nint h, w;\n\nint main() {\n\n  V = 10;\n\n  cin >> h >> w;\n\n  warshall_floyd_init();\n\n  rep(i, 0, 10) {\n\n    rep(j, 0, 10) {\n\n      ll a;\n\n      cin >> a;\n\n      if (i != j)\n        add_edge(i, j, a);\n    }\n  }\n\n  warshall_floyd();\n\n  ll ans = 0;\n\n  rep(i, 0, h) rep(j, 0, w) {\n\n    int a;\n\n    cin >> a;\n\n    if (a != 1 && a != -1) {\n\n      ans += d[a][1];\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"45728fc2b826cf6aa98e9f66d90a84826ec4b8fd53ef2e9e00c1e6dd5c1965f2","fast_id":"a32e7ff4f8db1cd71390bd6dba533fd3ad95837b0d75214502fdf4a62cb56b83","fast_time":0.0133967208,"language":"cpp","measured_fast_code_id":"a32e7ff4f8db1cd71390bd6dba533fd3ad95837b0d75214502fdf4a62cb56b83","measured_slow_code_id":"503389e22901f568f554adca594cb607037857566291590667fb96bfec7f7acb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_35989","problem_id":"p03654","slow_code_id":"951266bbb6da850c204959d47e058018cc4a0e2096cfb509d59bdafae06d5191","slow_id":"503389e22901f568f554adca594cb607037857566291590667fb96bfec7f7acb","slow_time":0.4460329125,"speedup":33.294185880174496,"stratum":"8+","sampling_key":"1debea616fccef2e5f92aa7f6cd0f15ca2397ba6503c97a74ebaef62588987f6","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <vector>\n\n#define SF scanf\n\n#define PF printf\n\n#define MAXN 100010\n\n#define INF 0x3FFFFFFF\n\nusing namespace std;\n\ntypedef long long ll;\n\nint siz[MAXN];\n\nll ans;\n\nint siz1, d1, d2;\n\nll dep[MAXN];\n\nvector<int> a[MAXN], w[MAXN];\n\nint n;\n\nvoid dfs(int x, int fa) {\n\n  for (int i = 0; i < a[x].size(); i++) {\n\n    int u = a[x][i];\n\n    if (u == fa)\n\n      continue;\n\n    dfs(u, x);\n\n    siz[x] += siz[u];\n  }\n\n  siz[x]++;\n\n  int siz2 = n - siz[x];\n\n  for (int i = 0; i < a[x].size(); i++)\n\n    if (a[x][i] != fa)\n\n      siz2 = max(siz2, siz[a[x][i]]);\n\n  if (siz2 < siz1 || siz1 == -1) {\n\n    siz1 = siz2;\n\n    d1 = x;\n\n    d2 = 0;\n\n  }\n\n  else if (siz1 == siz2)\n\n    d2 = x;\n}\n\nvoid solve(int x, int fa) {\n\n  for (int i = 0; i < a[x].size(); i++) {\n\n    int u = a[x][i];\n\n    if (u == fa)\n\n      continue;\n\n    dep[u] = dep[x] + w[x][i];\n\n    solve(u, x);\n  }\n\n  ans += dep[x] * 2;\n}\n\nint main() {\n\n  SF(\"%d\", &n);\n\n  int u, v, val;\n\n  for (int i = 1; i < n; i++) {\n\n    SF(\"%d%d%d\", &u, &v, &val);\n\n    a[u].push_back(v);\n\n    a[v].push_back(u);\n\n    w[u].push_back(val);\n\n    w[v].push_back(val);\n  }\n\n  siz1 = -1;\n\n  dfs(1, 0);\n\n  solve(d1, 0);\n\n  ll add = -1;\n\n  if (d2 == 0) {\n\n    for (int i = 1; i <= n; i++)\n\n      if (i != d1) {\n\n        if (add == -1)\n\n          add = dep[i];\n\n        add = min(add, 1ll * dep[i]);\n      }\n\n  }\n\n  else\n\n    add = dep[d2];\n\n  ans -= add;\n\n  PF(\"%lld\", ans);\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define MAXN 100010\n\n#define LL long long\n\n#define INF 1000000000\n\nint Adj[MAXN], V[MAXN * 2], nxt[MAXN * 2], W[MAXN * 2], c;\n\nvoid AddEdge(int u, int v, int w)\n\n{\n\n  c++;\n  V[c] = v, W[c] = w, nxt[c] = Adj[u];\n  Adj[u] = c;\n}\n\nint siz[MAXN], mx[MAXN], rt, rt2, n, tmp = INF;\n\nLL ans;\n\nvoid dfs1(int u, int p)\n\n{\n\n  siz[u] = 1;\n\n  for (int i = Adj[u]; i; i = nxt[i])\n\n    if (V[i] != p)\n\n    {\n\n      dfs1(V[i], u);\n\n      siz[u] += siz[V[i]];\n\n      mx[u] = max(mx[u], siz[V[i]]);\n    }\n\n  mx[u] = max(mx[u], n - siz[u]);\n\n  if (mx[u] <= n / 2)\n\n  {\n\n    if (rt == 0)\n      rt = u;\n\n    else\n      rt2 = u;\n  }\n}\n\nvoid dfs2(int u, int p, LL dep)\n\n{\n\n  ans += dep * 2;\n\n  for (int i = Adj[u]; i; i = nxt[i])\n\n    if (V[i] != p)\n\n    {\n\n      dfs2(V[i], u, dep + W[i]);\n\n      if (V[i] == rt2 || (rt2 == 0 && u == rt))\n\n        tmp = min(tmp, W[i]);\n    }\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    int u, v, w;\n\n    scanf(\"%d%d%d\", &u, &v, &w);\n\n    AddEdge(u, v, w);\n\n    AddEdge(v, u, w);\n  }\n\n  dfs1(1, 0);\n\n  dfs2(rt, 0, 0);\n\n  ans -= tmp;\n\n  printf(\"%lld\\n\", ans);\n}\n"}
{"fast_code_id":"8de2031e90c9e4cb7a82c6ddcb7d3e513525542e16ff3fb99a5e059ba4ae46d4","fast_id":"aa796323451c4e58d7514d7288d7f7bc8212739f441c85c8f386ccd7a24bca02","fast_time":0.0966428989,"language":"cpp","measured_fast_code_id":"aa796323451c4e58d7514d7288d7f7bc8212739f441c85c8f386ccd7a24bca02","measured_slow_code_id":"09629c4c137dc3c66516aab2e5e1afab9baf3f2816765f95dd789d59e3fc7764","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36002","problem_id":"p03789","slow_code_id":"776a96a832e8b5cf2a7ed6aa899e720d129a8a00a548c0d2fb26f4e2652fa966","slow_id":"09629c4c137dc3c66516aab2e5e1afab9baf3f2816765f95dd789d59e3fc7764","slow_time":0.2873607237,"speedup":2.9734282287759477,"stratum":"2-4","sampling_key":"b22cb4c582ef36a3225c5c7af9b403f85c6a316ba03395355ed23d079fc8d56d","slow_code":"#include <bits/stdc++.h>\n\n#define INF 0x3f3f3f3f\n\n#define maxn 500100\n\n#define lson root << 1\n\n#define rson root << 1 | 1\n\n#define lent (t[root].r - t[root].l + 1)\n\n#define lenl (t[lson].r - t[lson].l + 1)\n\n#define lenr (t[rson].r - t[rson].l + 1)\n\n#define N 1111\n\n#define eps 1e-6\n\n#define pi acos(-1.0)\n\n#define e exp(1.0)\n\nusing namespace std;\n\nconst int mod = 1e9 + 7;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\nchar s[maxn];\n\nint a[maxn];\n\nint len;\n\nbool check(int x)\n\n{\n\n  int sum = x * 9, cnt = 0;\n\n  for (int i = 0; i < len; i++)\n\n  {\n\n    sum += a[i];\n\n    cnt += sum % 10;\n\n    sum /= 10;\n  }\n\n  while (sum > 0)\n\n  {\n\n    cnt += sum % 10;\n\n    sum /= 10;\n  }\n\n  return cnt <= x * 9;\n}\n\nint main()\n\n{\n\n  while (~scanf(\"%s\", s))\n\n  {\n\n    memset(a, 0, sizeof(a));\n\n    len = strlen(s);\n\n    reverse(s, s + len);\n\n    for (int i = 0; i < len; i++)\n\n      a[i] = (s[i] - '0') * 9;\n\n    for (int i = 0; i < len; i++)\n\n    {\n\n      a[i + 1] += a[i] / 10;\n\n      a[i] %= 10;\n    }\n\n    if (a[len])\n\n      len++;\n\n    int l = 0, r = len * 2, ans = -1;\n\n    while (l < r)\n\n    {\n\n      int mid = l + r >> 1;\n\n      if (check(mid))\n\n      {\n\n        ans = mid;\n\n        r = mid;\n\n      }\n\n      else\n\n        l = mid + 1;\n    }\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define pb push_back\n\nconst int maxn = 1e5 + 20;\n\nstring s;\n\nint mkay()\n\n{\n\n  int n = s.size();\n\n  s[n - 1]++;\n\n  for (int j = n - 1; j >= 0; j--)\n\n  {\n\n    if (s[j] <= '9')\n\n      return j;\n\n    s[j - 1]++;\n\n    s[j] = '0';\n  }\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  cin >> s;\n\n  int n = s.size(), res = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    res++;\n\n    int n = s.size();\n\n    int last = i, j = i + 1;\n\n    while (j < n && s[j] >= s[j - 1])\n\n    {\n\n      if (s[j] > s[j - 1])\n\n        last = j;\n\n      j++;\n    }\n\n    if (j == n)\n\n      break;\n\n    while (i < last + 1)\n\n      s[i] = '0', i++;\n\n    i--;\n\n    if (mkay() <= j)\n\n      continue;\n\n    i++;\n\n    while (i < j)\n\n    {\n\n      s[i] = '0';\n\n      res++;\n\n      i++;\n\n      if (mkay() <= j)\n\n        break;\n    }\n\n    i--;\n  }\n\n  cout << res << endl;\n}\n"}
{"fast_code_id":"da60e177556c2354347fe57940b667d19dae6efb4c2e577f4d955ad1b9f2120d","fast_id":"961b7c13d388566031effe809ec387a1fad2e8416b3ec8888ca4da94144978ef","fast_time":0.030864071,"language":"cpp","measured_fast_code_id":"961b7c13d388566031effe809ec387a1fad2e8416b3ec8888ca4da94144978ef","measured_slow_code_id":"128b7e5c17d85c362adebc5dd3373e0690a125f7dfcad9623914c9d2b6ae699e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36011","problem_id":"p03772","slow_code_id":"007d3d18dd474df3ec330703482988367bba0ddb3538271753c34612725ccf21","slow_id":"128b7e5c17d85c362adebc5dd3373e0690a125f7dfcad9623914c9d2b6ae699e","slow_time":0.1172409124,"speedup":3.798621134587203,"stratum":"2-4","sampling_key":"6aedd29c7c6a0cd6a25fa31e3541249d353aa5d04647f80327a6e142b1cc64ed","slow_code":"#include <iostream>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <vector>\n\n#include <list>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <algorithm>\n\n#include <iterator>\n\n#include <bitset>\n\n#include <ctime>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); i--)\n\n#define ITER(it, a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int)a.size()\n\n#define ALL(a) a.begin(), a.end()\n\n#define PB push_back\n\n#define MP make_pair\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\n\nconst int INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = INF * (LL)INF;\n\nconst int MAX = 111;\n\nconst double EPS = 1e-8;\n\nconst int MOD = 1000 * 1000 * 1000 + 7;\n\nint A[MAX];\n\nint DP[MAX][MAX][MAX];\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  int N = n + n - 1;\n\n  FOR(i, 0, N)\n\n  scanf(\"%d\", &A[i]);\n\n  sort(A, A + N);\n\n  DP[0][1][0] = 1;\n\n  FOR(i, 0, n)\n\n  {\n\n    FOR(j, 0, N + 1)\n\n    {\n\n      FOR(k, 0, j)\n\n      {\n\n        if (DP[i][j][k] == 0)\n          continue;\n\n        int l = n - i - 1;\n\n        int r = n + i;\n\n        int jj = j + (l > 0 && A[l] != A[l - 1]) + (r < N && A[r] != A[r - 1]);\n\n        int kk = k + (l > 0 && A[l] != A[l - 1]);\n\n        FOR(x, 0, jj)\n\n        {\n\n          int jjj = jj - max(0, abs(x - kk) - 1);\n\n          int kkk = min(x, kk + 1);\n\n          DP[i + 1][jjj][kkk] += DP[i][j][k];\n\n          if (DP[i + 1][jjj][kkk] >= MOD)\n\n            DP[i + 1][jjj][kkk] -= MOD;\n        }\n      }\n    }\n  }\n\n  int res = 0;\n\n  FOR(i, 0, N + 1)\n\n  FOR(j, 0, i)\n\n  {\n\n    res += DP[n - 1][i][j];\n\n    if (res >= MOD)\n      res -= MOD;\n  }\n\n  cout << res << endl;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define MAXN 100\n\n#define MO 1000000007\n\nusing namespace std;\n\ntypedef long long LL;\n\nint a[MAXN + 5], n;\n\nLL f[MAXN + 5][MAXN + 5][MAXN + 5];\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= 2 * n - 1; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  sort(a + 1, a + 2 * n);\n\n  f[n][1][0] = 1;\n\n  LL t;\n\n  for (int i = n - 1; i >= 1; i--)\n\n  {\n\n    int al = (a[i] != a[i + 1]), ar = (a[2 * n - i] != +a[2 * n - i - 1]);\n\n    for (int l = 0; l <= 2 * n - 1; l++)\n\n      for (int r = 0; l + r <= 2 * n - 1; r++)\n\n        if (f[i + 1][l][r])\n\n        {\n\n          t = f[i + 1][l][r];\n\n          for (int dl = 1; dl <= l + al; dl++)\n\n          {\n\n            f[i][l + al - dl + 1][r + ar + (dl > 1)] += t;\n\n            f[i][l + al - dl + 1][r + ar + (dl > 1)] %= MO;\n          }\n\n          for (int dr = 1; dr <= r + ar; dr++)\n\n          {\n\n            f[i][l + al + 1][r + ar - dr] += t;\n\n            f[i][l + al + 1][r + ar - dr] %= MO;\n          }\n        }\n  }\n\n  LL ans = 0;\n\n  for (int l = 0; l <= 2 * n - 1; l++)\n\n    for (int r = 0; l + r <= 2 * n - 1; r++)\n\n      ans = (1LL * ans + 1LL * f[1][l][r]) % MO;\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"3eff5f92a253657eebaf03199e735cc33b452909d24b29d4a6720f6ce04dde33","fast_id":"4f27900fbf2c7ab8ef993a735e6a0c04f949a08db855a13e1a6189217f6108f9","fast_time":0.1390588854,"language":"cpp","measured_fast_code_id":"4f27900fbf2c7ab8ef993a735e6a0c04f949a08db855a13e1a6189217f6108f9","measured_slow_code_id":"56cbd62e3e3f31909c7ac58688fac50672eeac1d8ab8b543c24bfedc7e48126e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36021","problem_id":"p00042","slow_code_id":"90ac5a4862e8794b9afd4bdbb2e5936b2c5043e667ca1696d936fc906537f89b","slow_id":"56cbd62e3e3f31909c7ac58688fac50672eeac1d8ab8b543c24bfedc7e48126e","slow_time":0.9749909707,"speedup":7.011353268764227,"stratum":"4-8","sampling_key":"213028582cfee24aa06aa5d386c8ecf41256815828530ad3993415f1dd102d47","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define INF (1 << 21)\n\nint dp[1001][1001];\n\npair<int, int> solve(vector<int> value, vector<int> weight, int W, int N) {\n\n  for (int i = 0; i < 1001; i++)\n\n    for (int j = 0; j < 1001; j++)\n\n      dp[i][j] = 0;\n\n  for (int num = 1; num <= N; num++) {\n\n    for (int w = 0; w <= W; w++) {\n\n      dp[num][w] = max(dp[num][w], dp[num - 1][w]);\n\n      if (w >= weight[num])\n        dp[num][w] = max(dp[num][w], dp[num - 1][w - weight[num]] + value[num]);\n    }\n  }\n\n  int ans1 = *max_element(dp[N], dp[N] + W + 1);\n\n  int ans2 = find(dp[N], dp[N] + W + 1, ans1) - dp[N];\n\n  return make_pair(ans1, ans2);\n}\n\nint main() {\n\n  int n, w, CaseNum = 0;\n\n  while (cin >> w && w) {\n\n    cout << \"Case \" << ++CaseNum << \":\" << endl;\n\n    cin >> n;\n\n    vector<int> value(1 + n), weight(1 + n);\n\n    for (int i = 1; i <= n; i++) {\n\n      scanf(\"%d,%d\\n\", &value[i], &weight[i]);\n    }\n\n    pair<int, int> ans = solve(value, weight, w, n);\n\n    cout << ans.first << endl << ans.second << endl;\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct Item {\n\n  int v, w;\n\n  int idx;\n};\n\nconst int INF = 1000000000;\n\nclass Knapsack {\n\npublic:\n  int maximumWeight;\n\n  vector<Item> items;\n\n  Knapsack(int maximumWeight_, vector<Item> items_)\n      : maximumWeight(maximumWeight_), items(items_) {\n\n    used.resize(items.size(), false);\n\n    totalWeight = totalValue = 0;\n\n    sort(items.begin(), items.end(),\n         [](Item a, Item b) { return a.v * b.w > b.v * a.w; });\n  }\n\n  int totalValue;\n\n  int totalWeight;\n\n  vector<bool> used;\n\n  bool operator<(const Knapsack &op) const {\n\n    if (totalValue == op.totalValue)\n\n      return totalWeight > op.totalWeight;\n\n    return totalValue < op.totalValue;\n  }\n\n  bool canPut(const Item &x) {\n\n    return !used[x.idx] && x.w <= maximumWeight - totalWeight;\n  }\n\n  bool putItem(const Item &x) {\n\n    if (canPut(x)) {\n\n      totalWeight += x.w;\n\n      totalValue += x.v;\n\n      used[x.idx] = true;\n\n      return true;\n\n    } else {\n\n      return false;\n    }\n  }\n\n  bool removeItem(const Item &x) {\n\n    if (used[x.idx]) {\n\n      totalWeight -= x.w;\n\n      totalValue -= x.v;\n\n      used[x.idx] = false;\n\n      return true;\n    }\n\n    return false;\n  }\n\n  int swapAtoB(Item x, Item y) {\n\n    if (used[x.idx] && !used[y.idx]) {\n\n      if (totalWeight - x.w + y.w > maximumWeight)\n        return -INF;\n\n      return y.v - x.v;\n\n    } else {\n\n      return -INF;\n    }\n  }\n\n  Knapsack knapSackDP(int scale) const {\n\n    Knapsack res = *this;\n\n    int maximumValue = -INF;\n\n    for (auto i : res.items) {\n\n      maximumValue = max(maximumValue, i.v);\n    }\n\n    double rate = min(1.0, 1. * scale / maximumValue);\n\n    for (auto &i : res.items) {\n\n      i.v = (int)(ceil(rate * i.v) + 1e-9);\n    }\n\n    vector<int> dp(scale + 1, INF), lastId(scale + 1, -1);\n\n    dp[0] = 0;\n\n    for (int i = 0; i < res.items.size(); i++) {\n\n      if (res.used[i])\n        continue;\n\n      for (int j = scale; j >= res.items[i].v; j--) {\n\n        if (dp[j - res.items[i].v] + res.items[i].w < dp[j]) {\n\n          dp[j] = dp[j - res.items[i].v] + res.items[i].w;\n\n          lastId[j] = i;\n        }\n      }\n    }\n\n    for (int i = scale; i >= 0; i--) {\n\n      if (dp[i] <= maximumWeight - totalWeight) {\n\n        int cur = i;\n\n        while (cur > 0) {\n\n          int p = lastId[cur];\n\n          res.putItem(res.items[p]);\n\n          cur -= res.items[p].v;\n\n          if (p == -1)\n            exit(0);\n        }\n\n        break;\n      }\n    }\n\n    return res;\n  }\n\n  Knapsack localImprovement() const {\n\n    Knapsack res = *this;\n\n    while (true) {\n\n      for (int i = 0; i < res.items.size(); i++) {\n\n        res.putItem(res.items[i]);\n      }\n\n      auto reflesh = [&]() {\n        for (int i = 0; i < res.items.size(); i++) {\n\n          if (res.used[i]) {\n\n            auto tmp = res;\n\n            tmp.removeItem(tmp.items[i]);\n\n            for (int j = 0; j < tmp.items.size(); j++) {\n\n              if (i != j && !tmp.used[j]) {\n\n                tmp.putItem(tmp.items[j]);\n              }\n            }\n\n            if (res < tmp) {\n\n              res = tmp;\n\n              return true;\n            }\n          }\n        }\n\n        return false;\n      };\n\n      if (reflesh())\n        continue;\n\n      auto reflesh2 = [&]() {\n        for (int i = 0; i < res.items.size(); i++) {\n\n          if (res.used[i]) {\n\n            for (int j = 0; j < res.items.size(); j++) {\n\n              if (!res.used[j]) {\n\n                if (res.swapAtoB(res.items[i], res.items[j]) >= 0) {\n\n                  res.removeItem(res.items[i]);\n\n                  res.putItem(res.items[j]);\n\n                  return true;\n                }\n              }\n            }\n          }\n        }\n\n        return false;\n      };\n\n      if (reflesh2())\n        continue;\n\n      break;\n    }\n\n    return res;\n  }\n};\n\nint main() {\n\n  int n, m;\n\n  int t = 1;\n\n  while (cin >> n >> m && n) {\n\n    vector<Item> items;\n\n    for (int i = 0; i < m; i++) {\n\n      int x, y;\n\n      scanf(\"%d,%d\", &x, &y);\n\n      items.push_back({x, y, i});\n    }\n\n    Knapsack knap(n, items);\n\n    knap = knap.knapSackDP(12000);\n\n    cout << \"Case \" << t++ << \":\" << endl;\n\n    cout << knap.totalValue << \"\\n\" << knap.totalWeight << endl;\n  }\n}"}
{"fast_code_id":"e1847f4f43038559cc14e1804cc02f9e166cdfb1489229af433e5480aab34271","fast_id":"30d64161671ad68df2aeecfa8b72a9cced4f1dee2dfc26a6813f05155f1bea19","fast_time":0.0220764038,"language":"cpp","measured_fast_code_id":"30d64161671ad68df2aeecfa8b72a9cced4f1dee2dfc26a6813f05155f1bea19","measured_slow_code_id":"e97e02f8646f4af372bc0440914bbc2fb7dc08b73cc936d41553fb8195c82be7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36027","problem_id":"p02595","slow_code_id":"288f83cae956b2e568e59cd8ffd10fd1559b868fcebb7869829faa9f2d7716e4","slow_id":"e97e02f8646f4af372bc0440914bbc2fb7dc08b73cc936d41553fb8195c82be7","slow_time":0.1096240754,"speedup":4.965667252381024,"stratum":"4-8","sampling_key":"b6e64ffe05d17e688848c9548d6e7afe5dd28b0252abe570023adc10de089398","slow_code":"#include <iostream>\n\n#include <cmath>\n\nusing namespace std;\n\nint main()\n\n{\n\n  double n, d, x, i, s = 0, a, b;\n\n  cin >> n >> d;\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    cin >> a >> b;\n\n    x = sqrt((a * a) + (b * b));\n\n    if (x <= d)\n\n      s++;\n  }\n\n  cout << s << endl;\n}\n","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\nint main()\n\n{\n\n  long long int a, b, i, p, q, count = 0;\n\n  scanf(\"%lld%lld\", &a, &b);\n\n  for (i = 0; i < a; i++) {\n\n    scanf(\"%lld%lld\", &p, &q);\n\n    if ((double)(sqrt(pow(p, 2) + pow(q, 2))) <= b)\n      count++;\n  }\n\n  printf(\"%lld\\n\", count);\n\n  return 0;\n}\n"}
{"fast_code_id":"c4d3f0c69b66206258c3e60bbb2e79da5d8fd346438a08b272a1220b67f190f6","fast_id":"aa67a8cbc5efc0824c727b4e57e29391e4bc6fd798c863438c21ff191d2ea322","fast_time":0.0668895187,"language":"cpp","measured_fast_code_id":"aa67a8cbc5efc0824c727b4e57e29391e4bc6fd798c863438c21ff191d2ea322","measured_slow_code_id":"cc9dd8fed3b921537ffb44ce5007dcb6bc8f5c14ae278f5e00e0e98064ace0bb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3637","problem_id":"p02756","slow_code_id":"9d63b13b269e637d63105d6895486f30a3be6e47087b8b60fd3dab7b6dfdb2e8","slow_id":"cc9dd8fed3b921537ffb44ce5007dcb6bc8f5c14ae278f5e00e0e98064ace0bb","slow_time":0.1883827551,"speedup":2.816326963644306,"stratum":"2-4","sampling_key":"8353c77fcea62891a0d2f2a3703f201e0b36cdd348725b2feda4f82a31a88636","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\ntypedef int64_t Int;\n\nusing namespace std;\n\nint main() {\n\n  string S;\n  int Q;\n\n  cin >> S >> Q;\n\n  vector<int> T(200010), F(200010);\n  vector<char> C(200010);\n\n  bool rev = false;\n\n  rep(q, Q) {\n\n    cin >> T[q];\n\n    if (T[q] == 1)\n      rev = !rev;\n\n    if (T[q] == 2)\n      cin >> F[q] >> C[q];\n  }\n\n  bool head = true;\n  string left, right;\n\n  rep(q, Q) {\n\n    if (!rev) {\n\n      if (T[q] == 1)\n        head = !head;\n\n      if (T[q] == 2) {\n\n        if ((F[q] == 1 && head) || (F[q] == 2 && !head))\n          left = C[q] + left;\n\n        if ((F[q] == 2 && head) || (F[q] == 1 && !head))\n          right = right + C[q];\n      }\n\n    } else {\n\n      if (T[q] == 1)\n        head = !head;\n\n      if (T[q] == 2) {\n\n        if ((F[q] == 1 && head) || (F[q] == 2 && !head))\n          left = left + C[q];\n\n        if ((F[q] == 2 && head) || (F[q] == 1 && !head))\n          right = C[q] + right;\n      }\n    }\n  }\n\n  if (rev) {\n\n    reverse(S.begin(), S.end());\n\n    cout << right + S + left << endl;\n    return 0;\n\n  } else {\n\n    cout << left + S + right << endl;\n    return 0;\n  }\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\ntypedef int64_t Int;\n\nusing namespace std;\n\nint main() {\n\n  string S;\n  int Q;\n\n  cin >> S >> Q;\n\n  deque<char> DQ;\n\n  rep(i, S.length()) DQ.push_back(S[i]);\n\n  bool head = true;\n\n  rep(q, Q) {\n\n    int T;\n    cin >> T;\n\n    if (T == 1)\n      head = !head;\n\n    if (T == 2) {\n\n      int F;\n      char C;\n      cin >> F >> C;\n\n      if ((F == 1 && head) || (F == 2 && !head))\n        DQ.push_front(C);\n\n      if ((F == 2 && head) || (F == 1 && !head))\n        DQ.push_back(C);\n    }\n  }\n\n  string ans;\n\n  while (!DQ.empty()) {\n    ans.push_back(DQ.front());\n    DQ.pop_front();\n  }\n\n  if (!head)\n    reverse(ans.begin(), ans.end());\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"2a502feb2a87628fc7ef0a97b1fc05f6c2cc350e859e27cd4f5be1267ab52047","fast_id":"14e61a1eef95dcf1a154ac89d726f8d1790216170a9e1fbe5862e37813f40c81","fast_time":0.0056360138,"language":"cpp","measured_fast_code_id":"14e61a1eef95dcf1a154ac89d726f8d1790216170a9e1fbe5862e37813f40c81","measured_slow_code_id":"baaf006be417d49959c32083a03aafa2f904dfafa33828a8716147d57168257d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36484","problem_id":"p03248","slow_code_id":"aae3e45152ac627bade197304afe2a1258ac467e9c45857b799af034e8a07051","slow_id":"baaf006be417d49959c32083a03aafa2f904dfafa33828a8716147d57168257d","slow_time":0.1091072039,"speedup":19.358931289344962,"stratum":"8+","sampling_key":"7be52a208d8cf73a50139000e1c6bf03bc8e5997a5907dac877f73134d72bf88","slow_code":"#include <bits/stdc++.h>\n\n#define fi first\n\n#define se second\n\n#define ll long long\n\n#define pb push_back\n\n#define mp make_pair\n\n#define mt make_tuple\n\nusing namespace std;\n\nint niz[100010];\n\nvector<int> graf[100010];\n\nvector<pair<int, int>> res;\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  string s;\n\n  cin >> s;\n\n  int n = s.size();\n\n  for (int i = 1; i <= n; i++)\n\n    niz[i] = s[i - 1] - '0';\n\n  bool ok = true;\n\n  if (niz[1] == 0 || niz[n] == 1)\n    ok = false;\n\n  for (int i = 1; i <= n / 2; i++)\n\n    if (niz[i] != niz[n - i]) {\n      ok = false;\n      break;\n    }\n\n  if (!ok) {\n    cout << -1;\n    return 0;\n  }\n\n  int tr = 1;\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    res.pb(mp(i + 1, tr));\n\n    if (niz[i] == 1)\n\n      tr = i + 1;\n  }\n\n  for (int i = 0; i < res.size(); i++)\n\n    cout << res[i].fi << \" \" << res[i].se << \"\\n\";\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nchar arr[100010];\n\nint prv[100010];\n\nint main() {\n\n  scanf(\"%s\", arr + 1);\n\n  int n = strlen(arr + 1);\n\n  if (arr[1] == '0' || arr[n] == '1') {\n\n    puts(\"-1\");\n\n    return 0;\n  }\n\n  for (int i = n - 1; i; --i)\n\n    if (arr[i] != arr[n - i]) {\n\n      puts(\"-1\");\n\n      return 0;\n    }\n\n  int pos = 1;\n\n  for (int i = 2; i < n; ++i)\n\n    if (arr[i] == '1') {\n\n      prv[i] = pos;\n\n      pos = i;\n    }\n\n  int ct = 1, pp = n, cur = 1;\n\n  for (int i = pos; i; i = prv[i]) {\n\n    int nx = ct;\n\n    for (int j = i; j < pp; ++j) {\n\n      printf(\"%d %d\\n\", cur, ++ct);\n    }\n\n    cur = nx + 1;\n\n    pp = i;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"2b7cfd6118f2b391d101a2172b0a909116649aa1e967ccf80ed19a6752e03c37","fast_id":"b9cde14c3a80a7812b3dc5e371428ef92cf189d9fbeb73faa6f348224bdcb5c4","fast_time":0.0198245691,"language":"cpp","measured_fast_code_id":"b9cde14c3a80a7812b3dc5e371428ef92cf189d9fbeb73faa6f348224bdcb5c4","measured_slow_code_id":"d13dbe884f28ac71b6f241c3ec789dff3d1f44266a414a8ce1f8940c7536d3b8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_365","problem_id":"p02759","slow_code_id":"844ec1530d8d3fc28a64cb603712db9249ca5fe03fcaf4fd3e7b86610b4a6455","slow_id":"d13dbe884f28ac71b6f241c3ec789dff3d1f44266a414a8ce1f8940c7536d3b8","slow_time":0.3746731185,"speedup":18.89943315337936,"stratum":"8+","sampling_key":"21b9616d98503659c3841bed7f28e7554121d1a39c338ac979c268a779a96023","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint gcd(long long a, long long b)\n\n{\n\n  if (b == 0)\n\n    return a;\n\n  return gcd(b, a % b);\n}\n\nconst int N = 1e5 + 5;\n\nvector<int> adj[N];\n\nbool visited[N];\n\nint nodesNum;\n\nvoid dfs(int node)\n\n{\n\n  if (visited[node])\n\n    return;\n\n  visited[node] = true;\n\n  for (int child : adj[node])\n\n    dfs(child);\n}\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  if (n % 2 == 0)\n\n    cout << n / 2;\n\n  else\n\n    cout << n / 2 + 1;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int N;\n\n  scanf(\"%d\", &N);\n\n  if (N % 2 == 0) {\n\n    printf(\"%d\", N / 2);\n\n  }\n\n  else {\n\n    printf(\"%d\", (N / 2) + 1);\n  }\n}"}
{"fast_code_id":"8560a5ba2c0882ee67884c851a811896338a40777c5e73d69fd41d3ed4edf428","fast_id":"b629616c0e22257fcbc0721553ce56028fbeb2ec0021113310613ea03fdf4afd","fast_time":0.0958950573,"language":"cpp","measured_fast_code_id":"b629616c0e22257fcbc0721553ce56028fbeb2ec0021113310613ea03fdf4afd","measured_slow_code_id":"a29ed20bb675bab149facdc46a36f4dd4b41753d6f404ad7756a2e73364c49bc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36523","problem_id":"p00731","slow_code_id":"c63df5bdea44cc994831ca10bb83a7659f67b7277508700c18616fe3314e6145","slow_id":"a29ed20bb675bab149facdc46a36f4dd4b41753d6f404ad7756a2e73364c49bc","slow_time":0.4222690595,"speedup":4.4034496812381585,"stratum":"4-8","sampling_key":"f5cf6462980a0f8f5a7a5fb01012526702aa13191c72c0d286fd1889b120d2b6","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <functional>\n\n#include <numeric>\n\n#include <stack>\n\n#include <queue>\n\n#include <map>\n\n#include <set>\n\n#include <utility>\n\n#include <sstream>\n\n#include <complex>\n\n#include <fstream>\n\n#include <bitset>\n\n#include <time.h>\n\n#include <tuple>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef vector<ll> V;\n\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n\n#define EPS 1e-10\n\nconst ll INF = 1e12;\n\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i, a, b) for (ll i = (a); i < (b); i++)\n\n#define rep(i, N) for (ll i = 0; i < (N); i++)\n\n#define ALL(s) (s).begin(), (s).end()\n\n#define EQ(a, b) (abs((a) - (b)) < EPS)\n\n#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))\n\n#define fi first\n\n#define se second\n\n#define N_SIZE (1LL << 20)\n\n#define NIL -1\n\n#define MAX_N 100100\n\nll sq(ll num) { return num * num; }\n\nll mod_pow(ll x, ll n) {\n\n  if (n == 0)\n    return 1;\n\n  if (n == 1)\n    return x % MOD;\n\n  ll res = sq(mod_pow(x, n / 2));\n\n  res %= MOD;\n\n  if (n % 2 == 1) {\n\n    res *= x;\n\n    res %= MOD;\n  }\n\n  return res;\n}\n\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\n\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\n\nll mod_mul(ll a, ll b) { return a * b % MOD; }\n\nint w, h;\n\nchar s[100][100];\n\nstruct edge {\n\n  int to;\n\n  ll cost;\n};\n\nll dx[2][10] = {{1, 1, 1, 1, 1, 2, 2, 2, 3}, {-1, -1, -1, -1, -1, -2, -2, -2, -3}};\n\nll dy[2][10] = {{2, 1, 0, -1, -2, 1, 0, -1, 0}, {2, 1, 0, -1, -2, 1, 0, -1, 0}};\n\nll d[2][100][100];\n\nvector<edge> G[100010];\n\nvoid dijkstra(P start, bool _t) {\n\n  rep(i, 100) rep(j, 100) {\n\n    d[0][i][j] = INF;\n\n    d[1][i][j] = INF;\n  }\n\n  d[_t][start.first][start.second] = 0;\n\n  typedef pair<P, P> PP;\n\n  priority_queue<PP, vector<PP>, greater<PP>> que;\n\n  que.push({{0, _t}, start});\n\n  while (que.size()) {\n\n    PP p = que.top();\n\n    que.pop();\n\n    int y = p.second.first;\n\n    int x = p.second.second;\n\n    int t = p.first.second;\n\n    for (int i = 0; i < 9; i++) {\n\n      int ny = y + dy[t][i];\n\n      int nx = x + dx[t][i];\n\n      if (ny < 0 || ny >= h || nx < 0 || nx >= w)\n        continue;\n\n      if (s[ny][nx] == 'X')\n        continue;\n\n      if (d[!t][ny][nx] > d[t][y][x] + s[ny][nx] - '0') {\n\n        d[!t][ny][nx] = d[t][y][x] + s[ny][nx] - '0';\n\n        que.push({{d[!t][ny][nx], !t}, P(ny, nx)});\n      }\n    }\n  }\n}\n\nvector<P> S, T;\n\nint main() {\n\n  while (cin >> w >> h && w + h) {\n\n    S.clear();\n\n    T.clear();\n\n    rep(i, h) {\n\n      rep(j, w) {\n\n        cin >> s[i][j];\n\n        if (s[i][j] == 'S') {\n\n          S.push_back(P(i, j));\n\n          s[i][j] = '0';\n        }\n\n        if (s[i][j] == 'T') {\n\n          T.push_back(P(i, j));\n\n          s[i][j] = '0';\n        }\n      }\n    }\n\n    ll ans = INF;\n\n    rep(i, S.size()) {\n\n      dijkstra(S[i], 0);\n\n      rep(j, T.size()) {\n\n        ans = min(ans, d[0][T[j].first][T[j].second]);\n\n        ans = min(ans, d[1][T[j].first][T[j].second]);\n      }\n\n      dijkstra(S[i], 1);\n\n      rep(j, T.size()) {\n\n        ans = min(ans, d[0][T[j].first][T[j].second]);\n\n        ans = min(ans, d[1][T[j].first][T[j].second]);\n      }\n    }\n\n    if (ans == INF)\n      cout << -1 << endl;\n\n    else\n      cout << ans << endl;\n  }\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<ll, ll> P;\n\ntypedef vector<ll> V;\n\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n\n#define EPS 1e-10\n\nconst ll INF = 1e16;\n\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rep(i, N) for (int i = 0; i < (N); i++)\n\n#define ALL(s) (s).begin(), (s).end()\n\n#define EQ(a, b) (abs((a) - (b)) < EPS)\n\n#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))\n\n#define fi first\n\n#define se second\n\n#define N_SIZE (1LL << 20)\n\n#define NIL -1\n\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\n\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\n\nll mod_mul(ll a, ll b) { return a * b % MOD; }\n\nll h, w;\n\nvector<vector<ll>> s;\n\nvector<P> sp;\n\nset<P> gp;\n\nll gy, gx;\n\nP table[2][9] = {\n    {P(1, 2), P(1, 1), P(1, 0), P(1, -1), P(1, -2), P(2, 1), P(2, 0), P(2, -1), P(3, 0)},\n\n    {P(-1, 2), P(-1, 1), P(-1, 0), P(-1, -1), P(-1, -2), P(-2, 1), P(-2, 0), P(-2, -1), P(-3, 0)}};\n\nvector<vector<ll>> d[2];\n\nbool in(ll y, ll x) { return y >= 0 && y < h && x >= 0 && x < w; }\n\nvoid dijkstra() {\n\n  typedef pair<P, P> PP;\n\n  priority_queue<PP, vector<PP>, greater<PP>> que;\n\n  rep(i, h) rep(j, w) {\n\n    d[0][i][j] = INF;\n\n    d[1][i][j] = INF;\n  }\n\n  rep(i, sp.size()) {\n\n    ll sy = sp[i].first;\n\n    ll sx = sp[i].second;\n\n    d[0][sy][sx] = 0;\n\n    d[1][sy][sx] = 0;\n\n    que.push(PP(P(0, 0), P(sy, sx)));\n\n    que.push(PP(P(0, 1), P(sy, sx)));\n  }\n\n  while (!que.empty()) {\n\n    PP p = que.top();\n\n    que.pop();\n\n    ll cy = p.second.first;\n\n    ll cx = p.second.second;\n\n    ll cost = p.first.first;\n\n    ll turn = p.first.second;\n\n    if (gp.find(P(cy, cx)) != gp.end())\n      continue;\n\n    if (cost > d[turn][cy][cx])\n      continue;\n\n    rep(i, 9) {\n\n      ll ny = cy + table[turn][i].second;\n\n      ll nx = cx + table[turn][i].first;\n\n      if (!in(ny, nx))\n        continue;\n\n      ll ncost = cost + s[ny][nx];\n\n      if (d[!turn][ny][nx] > ncost) {\n\n        d[!turn][ny][nx] = ncost;\n\n        que.push(PP(P(d[!turn][ny][nx], !turn), P(ny, nx)));\n      }\n    }\n  }\n}\n\nint main() {\n\n  while (cin >> w >> h && h) {\n\n    s.clear();\n\n    sp.clear();\n\n    gp.clear();\n\n    d[0].clear();\n\n    d[1].clear();\n\n    s.resize(h);\n\n    d[0].resize(h);\n\n    d[1].resize(h);\n\n    rep(i, h) {\n\n      s[i].resize(w);\n\n      d[0][i].resize(w);\n\n      d[1][i].resize(w);\n\n      rep(j, w) {\n\n        char c;\n\n        cin >> c;\n\n        if (c >= '0' && c <= '9')\n          s[i][j] = c - '0';\n\n        else {\n\n          s[i][j] = 0;\n\n          if (c == 'S')\n            sp.push_back(P(i, j));\n\n          else if (c == 'T')\n            gp.insert(P(i, j));\n\n          else\n            s[i][j] = INF;\n        }\n      }\n    }\n\n    dijkstra();\n\n    ll ans = INF;\n\n    rep(i, h) {\n\n      rep(j, w) {\n\n        if (gp.find(P(i, j)) != gp.end()) {\n\n          ans = min(ans, d[0][i][j]);\n\n          ans = min(ans, d[1][i][j]);\n        }\n      }\n    }\n\n    if (ans == INF)\n      cout << -1 << endl;\n\n    else\n      cout << ans << endl;\n  }\n}\n"}
{"fast_code_id":"53e8b881c2921aea644fee9ef40055d4842924713c467e083952b7c422466acb","fast_id":"2d0e8c8293f36aa5bed5932bd479222c48bde12ad54bc94ea46e37960ad3ab2e","fast_time":0.0001917667,"language":"cpp","measured_fast_code_id":"2d0e8c8293f36aa5bed5932bd479222c48bde12ad54bc94ea46e37960ad3ab2e","measured_slow_code_id":"b0ec4d924ecce7be8c354127f0598181421c934c174ad412eb27b8294d8ea8ac","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36530","problem_id":"p03870","slow_code_id":"25a1b38c9d05336c3de85dba22472a362c54514e9789815179c74845efe02631","slow_id":"b0ec4d924ecce7be8c354127f0598181421c934c174ad412eb27b8294d8ea8ac","slow_time":0.0009432609,"speedup":4.918794034626449,"stratum":"4-8","sampling_key":"aee94a4ca32778c6c13114a3904da1bcbac240d368a2f99e87cce81e8c61b1cc","slow_code":"#include <cstdio>\n\n#include <set>\n\nint a[100000];\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  int xor_sum = 0;\n\n  for (int i = 0; i < n; i++)\n\n    xor_sum ^= a[i];\n\n  std::set<int> s;\n\n  for (int i = 0; i < n; i++)\n\n    s.insert(a[i] ^ (a[i] - 1));\n\n  int ans = 0;\n\n  for (int bit = 29; bit >= 0; bit--) {\n\n    if (((1 << bit) & xor_sum) == 0) {\n\n      continue;\n    }\n\n    int x = (1 << (bit + 1)) - 1;\n\n    if (s.count(x)) {\n\n      xor_sum ^= x;\n\n      ans += 1;\n    }\n  }\n\n  if (xor_sum != 0) {\n\n    printf(\"-1\\n\");\n\n  } else {\n\n    printf(\"%d\\n\", ans);\n  }\n}","fast_code":"#include <cstdio>\n\nint check[30];\n\nint main() {\n\n  for (int bit = 29; bit >= 0; bit--) {\n\n    check[bit] = 0;\n  }\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  int xor_sum = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    int a;\n\n    scanf(\"%d\", &a);\n\n    xor_sum ^= a;\n\n    a = a ^ (a - 1);\n\n    switch (a) {\n\n    case 1073741823:\n\n      check[29] = 1;\n\n      break;\n\n    case 536870911:\n\n      check[28] = 1;\n\n      break;\n\n    case 268435455:\n\n      check[27] = 1;\n\n      break;\n\n    case 134217727:\n\n      check[26] = 1;\n\n      break;\n\n    case 67108863:\n\n      check[25] = 1;\n\n      break;\n\n    case 33554431:\n\n      check[24] = 1;\n\n      break;\n\n    case 16777215:\n\n      check[23] = 1;\n\n      break;\n\n    case 8388607:\n\n      check[22] = 1;\n\n      break;\n\n    case 4194303:\n\n      check[21] = 1;\n\n      break;\n\n    case 2097151:\n\n      check[20] = 1;\n\n      break;\n\n    case 1048575:\n\n      check[19] = 1;\n\n      break;\n\n    case 524287:\n\n      check[18] = 1;\n\n      break;\n\n    case 262143:\n\n      check[17] = 1;\n\n      break;\n\n    case 131071:\n\n      check[16] = 1;\n\n      break;\n\n    case 65535:\n\n      check[15] = 1;\n\n      break;\n\n    case 32767:\n\n      check[14] = 1;\n\n      break;\n\n    case 16383:\n\n      check[13] = 1;\n\n      break;\n\n    case 8191:\n\n      check[12] = 1;\n\n      break;\n\n    case 4095:\n\n      check[11] = 1;\n\n      break;\n\n    case 2047:\n\n      check[10] = 1;\n\n      break;\n\n    case 1023:\n\n      check[9] = 1;\n\n      break;\n\n    case 511:\n\n      check[8] = 1;\n\n      break;\n\n    case 255:\n\n      check[7] = 1;\n\n      break;\n\n    case 127:\n\n      check[6] = 1;\n\n      break;\n\n    case 63:\n\n      check[5] = 1;\n\n      break;\n\n    case 31:\n\n      check[4] = 1;\n\n      break;\n\n    case 15:\n\n      check[3] = 1;\n\n      break;\n\n    case 7:\n\n      check[2] = 1;\n\n      break;\n\n    case 3:\n\n      check[1] = 1;\n\n      break;\n\n    case 1:\n\n      check[0] = 1;\n\n      break;\n    }\n  }\n\n  int ans = 0;\n\n  for (int bit = 29; bit >= 0; bit--) {\n\n    if (((1 << bit) & xor_sum) == 0) {\n\n      continue;\n    }\n\n    int x = (1 << (bit + 1)) - 1;\n\n    if (check[bit] > 0) {\n\n      xor_sum ^= x;\n\n      ans += 1;\n    }\n  }\n\n  if (xor_sum != 0) {\n\n    printf(\"-1\\n\");\n\n  } else {\n\n    printf(\"%d\\n\", ans);\n  }\n}"}
{"fast_code_id":"f2bcce5dd1792364ebd849b456194a8db597deb4532e35befac9037f0484c1c6","fast_id":"91fa0550ede37f560fa4070ae1488b7b2d0f798c162ca9eaaa7c3b1921031c2f","fast_time":0.000191284,"language":"cpp","measured_fast_code_id":"91fa0550ede37f560fa4070ae1488b7b2d0f798c162ca9eaaa7c3b1921031c2f","measured_slow_code_id":"056747798fa71d5352e9350bc209524db4527e55d611a3d018fe099aa895062e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36556","problem_id":"p03387","slow_code_id":"18b7de0092a402a99aafbab3d1d6ebf55cd2baf0e59446cf34b2b8c440992b10","slow_id":"056747798fa71d5352e9350bc209524db4527e55d611a3d018fe099aa895062e","slow_time":0.0066713693,"speedup":34.87677641621881,"stratum":"8+","sampling_key":"db1368751a3abcd679901b6e9deffd55a9bf21db6cd30742303cdd3dbd10fb7b","slow_code":"#include <cstdio>\n\n#include <queue>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint vis[110][110][110];\n\nstruct node\n\n{\n\n  int a, b, c, s;\n\n  node(int aa, int bb, int cc, int ss) : a(aa), b(bb), c(cc), s(ss) {}\n};\n\nint bfs(int a, int b, int c)\n\n{\n\n  queue<node> q;\n\n  q.push(node(a, b, c, 0));\n\n  while (!q.empty())\n\n  {\n\n    node t = q.front();\n\n    q.pop();\n\n    if (t.a == t.b && t.b == t.c)\n\n      return t.s;\n\n    int x, y, z;\n\n    x = t.a + 2;\n    y = t.b;\n    z = t.c;\n\n    if (x < 110 && y < 110 && z < 110 && vis[x][y][z] == 0)\n\n    {\n\n      q.push(node(x, y, z, t.s + 1));\n\n      vis[x][y][z] = 1;\n    }\n\n    x = t.a;\n    y = t.b + 2;\n    z = t.c;\n\n    if (x < 110 && y < 110 && z < 110 && vis[x][y][z] == 0)\n\n    {\n\n      q.push(node(x, y, z, t.s + 1));\n\n      vis[x][y][z] = 1;\n    }\n\n    x = t.a;\n    y = t.b;\n    z = t.c + 2;\n\n    if (x < 110 && y < 110 && z < 110 && vis[x][y][z] == 0)\n\n    {\n\n      q.push(node(x, y, z, t.s + 1));\n\n      vis[x][y][z] = 1;\n    }\n    if (x < 110 && y < 110 && z < 110 && vis[x][y][z] == 0)\n\n    {\n\n      q.push(node(x, y, z, t.s + 1));\n\n      vis[x][y][z] = 1;\n    }\n\n    x = t.a + 1;\n    y = t.b + 1;\n    z = t.c;\n\n    if (x < 110 && y < 110 && z < 110 && vis[x][y][z] == 0)\n\n    {\n\n      q.push(node(x, y, z, t.s + 1));\n\n      vis[x][y][z] = 1;\n    }\n\n    x = t.a;\n    y = t.b + 1;\n    z = t.c + 1;\n\n    if (x < 110 && y < 110 && z < 110 && vis[x][y][z] == 0)\n\n    {\n\n      q.push(node(x, y, z, t.s + 1));\n\n      vis[x][y][z] = 1;\n    }\n\n    x = t.a + 1;\n    y = t.b;\n    z = t.c + 1;\n\n    if (x < 110 && y < 110 && z < 110 && vis[x][y][z] == 0)\n\n    {\n\n      q.push(node(x, y, z, t.s + 1));\n\n      vis[x][y][z] = 1;\n    }\n  }\n\n  return -1;\n}\n\nint main()\n\n{\n\n  int x, y, z, ans;\n\n  cin >> x >> y >> z;\n\n  memset(vis, 0, sizeof(vis));\n\n  vis[x][y][z] = 1;\n\n  ans = bfs(x, y, z);\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  long long max, sum, a, b, c;\n\n  while (scanf(\"%lld%lld%lld\", &a, &b, &c) != EOF)\n\n  {\n\n    max = a > b ? a : b;\n\n    max = max > c ? max : c;\n\n    sum = (max - a) + (max - b) + (max - c);\n\n    if (sum % 2 == 0)\n\n      printf(\"%lld\\n\", sum / 2);\n\n    else\n\n    {\n\n      printf(\"%lld\\n\", sum / 2 + 2);\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"ab786d85591fab6cbbb069676aecaf110b2888df92957bbab7ee5810acd65cc6","fast_id":"9ac748a61a15e134310ab80eac4249a677ba5056773066d415b8797a89718f97","fast_time":0.0186329398,"language":"cpp","measured_fast_code_id":"9ac748a61a15e134310ab80eac4249a677ba5056773066d415b8797a89718f97","measured_slow_code_id":"d566a2a61cd8f75e882de51bb91ecdc3850471e337a5dfc7a454c2c39914e2d5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36580","problem_id":"p03820","slow_code_id":"29a5374db7cc36d16fd870ea68fcb0ef180f544ff7460ccfd519367942b52e08","slow_id":"d566a2a61cd8f75e882de51bb91ecdc3850471e337a5dfc7a454c2c39914e2d5","slow_time":0.107874201,"speedup":5.789435384748036,"stratum":"4-8","sampling_key":"a82cad40eba86152aad22da9ced53a6db217ce7194cc5bd90142dce716589f52","slow_code":"#include <bits/stdc++.h>\n\n#define debug(x) cout << #x \" = \" << x;\n\n#define st first\n\n#define nd second\n\nusing namespace std;\n\nusing namespace placeholders;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<int, int> PII;\n\ntypedef pair<ll, ll> PLL;\n\nconst int MAXN = 2E3 + 10;\n\nconst int MOD = 1E9 + 7;\n\nll inv[MAXN], fac[MAXN], facinv[MAXN];\n\nll modExp(ll e, ll n, ll m = MOD) {\n\n  ll ret = 1;\n\n  for (; n; n >>= 1, e = e * e % m)\n\n    if (n & 1)\n\n      ret = ret * e % m;\n\n  return ret;\n}\n\nvoid getInv(int n = MAXN - 1, int m = MOD) {\n\n  inv[0] = 0, inv[1] = 1;\n\n  fac[0] = fac[1] = 1;\n\n  facinv[0] = facinv[1] = 1;\n\n  for (int i = 2; i <= n; ++i) {\n\n    inv[i] = inv[m % i] * (m - m / i) % m;\n\n    fac[i] = fac[i - 1] * i % m;\n\n    facinv[i] = facinv[i - 1] * inv[i] % m;\n  }\n}\n\nll C(int n, int m) { return m < 0 || n < m ? 0 : fac[n] * facinv[m] % MOD * facinv[n - m] % MOD; }\n\ninline void update(int &x, int y) {\n\n  if ((x += y) >= MOD)\n\n    x -= MOD;\n}\n\nint f[MAXN][MAXN];\n\nint main() {\n\n  getInv();\n\n  int n, k;\n\n  scanf(\"%d%d\", &n, &k);\n\n  f[0][0] = 1;\n\n  for (int i = 1; i <= k - 1; ++i) {\n\n    int s = f[i - 1][i - 1];\n\n    for (int j = i; j < n; ++j) {\n\n      update(f[i][j], s);\n\n      update(f[i][j], f[i - 1][j]);\n\n      update(s, f[i - 1][j]);\n    }\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i < n; ++i)\n\n    update(ans, f[k - 1][i]);\n\n  printf(\"%d\\n\", (int)(ans * modExp(2, max(0, n - k - 1)) % MOD));\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\ntypedef long long ll;\n\nconst int MAXN = 2E3 + 10;\n\nconst int MOD = 1E9 + 7;\n\nll modExp(ll e, ll n, ll m = MOD) {\n\n  ll ret = 1;\n\n  for (; n; n >>= 1, e = e * e % m)\n\n    if (n & 1)\n\n      ret = ret * e % m;\n\n  return ret;\n}\n\ninline void update(int &x, int y) {\n\n  if ((x += y) >= MOD)\n\n    x -= MOD;\n}\n\nint f[MAXN][MAXN];\n\nint main() {\n\n  int n, k;\n\n  scanf(\"%d%d\", &n, &k);\n\n  f[0][0] = 1;\n\n  for (int i = 1; i < k; ++i) {\n\n    int s = f[i - 1][i - 1];\n\n    for (int j = i; j < n; ++j) {\n\n      update(f[i][j], s);\n\n      update(f[i][j], f[i - 1][j]);\n\n      update(s, f[i - 1][j]);\n    }\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i < n; ++i)\n\n    update(ans, f[k - 1][i]);\n\n  printf(\"%d\\n\", (int)(ans * modExp(2, n == k ? 0 : n - k - 1) % MOD));\n\n  return 0;\n}\n"}
{"fast_code_id":"d46a5c818d36b19aeb310c8a81f9d0cfb3bab44cac77cc0d63229c25c49d82c9","fast_id":"b35c09d158beb6ef5d093ebcca843f3b41bdc1c8a0191081f535ccb400b13d25","fast_time":0.0123800574,"language":"cpp","measured_fast_code_id":"b35c09d158beb6ef5d093ebcca843f3b41bdc1c8a0191081f535ccb400b13d25","measured_slow_code_id":"689e9e9d30c94832cbb4f303f9cfe46e7f1b234fa4aecfd2ba0b56746582c7a9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_36917","problem_id":"p02712","slow_code_id":"5e0cd7cba7a0e5e6438f32a4c9821adc44d9103fc51789f8a29fe55a97b09a02","slow_id":"689e9e9d30c94832cbb4f303f9cfe46e7f1b234fa4aecfd2ba0b56746582c7a9","slow_time":0.0878775987,"speedup":7.098319164497574,"stratum":"4-8","sampling_key":"15f5cd2452cc1098bebe92dd84ab0f85023789ec6117e770ae2d8ab832b19970","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <iomanip>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <vector>\n\n#include <map>\n\nusing namespace std;\n\nstring s[10005];\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  long long ans = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (i % 3 == 0)\n\n      continue;\n\n    else if (i % 5 == 0)\n\n      continue;\n\n    else\n\n      ans += i;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main() {\n\n  long long int n;\n\n  scanf(\"%lld\", &n);\n\n  long long int total = 0;\n\n  for (int i = 0; i <= n; i++) {\n\n    if (i % 3 == 0 && i % 5 == 0) {\n\n      continue;\n\n    } else if (i % 3 == 0) {\n\n      continue;\n\n    } else if (i % 5 == 0) {\n\n      continue;\n\n    } else {\n\n      total += i;\n    }\n  }\n\n  printf(\"%lld\", total);\n\n  return 0;\n}"}
{"fast_code_id":"1d54a9bb0b9d3e11318f631cb7ba16f1bcb1e4aa8baca14178125698f98b3408","fast_id":"ea9900b562ae529aab7c69bbd19efd95a26e37997dd4de1ea0a398d2feacef90","fast_time":0.020279736,"language":"cpp","measured_fast_code_id":"ea9900b562ae529aab7c69bbd19efd95a26e37997dd4de1ea0a398d2feacef90","measured_slow_code_id":"bf854baf5679321f5e8c3088208b0c4abe8bcf50e7fe1c9a258cda9bcab54d96","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3699","problem_id":"p03853","slow_code_id":"f8053172570077d79be76127b37a33c0ad53bc9e18bf7ff9fbcd4355aed50130","slow_id":"bf854baf5679321f5e8c3088208b0c4abe8bcf50e7fe1c9a258cda9bcab54d96","slow_time":0.2140424586,"speedup":10.554499259753678,"stratum":"8+","sampling_key":"4260ae905d1ad2fc332eec5a7b20ee9e1078ff1dcf2dbe4d29445dba2b08f748","slow_code":"#include <iostream>\n\n#include <stdio.h>\n\n#include <math.h>\n\nusing namespace std;\n\nint main() {\n\n  int h, w;\n\n  cin >> h >> w;\n\n  char str[1001][1001] = {'\\0'};\n\n  int i, j;\n\n  fflush(stdin);\n\n  for (i = 1; i <= h; i++) {\n\n    for (j = 1; j <= w; j++) {\n\n      cin >> str[i][j];\n    }\n  }\n\n  for (i = 1; i <= h; i++) {\n\n    for (j = 1; j <= w; j++) {\n\n      printf(\"%c\", str[i][j]);\n    }\n\n    printf(\"\\n\");\n\n    for (j = 1; j <= w; j++) {\n\n      printf(\"%c\", str[i][j]);\n    }\n\n    printf(\"\\n\");\n  }\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\nint main()\n\n{\n\n  int h, w, i, j;\n\n  char c[310][300];\n\n  scanf(\"%d %d\", &h, &w);\n\n  getchar();\n\n  for (i = 1; i <= h; i++) {\n\n    scanf(\"%s\", &c[i]);\n  }\n\n  for (i = 1; i <= h; i++) {\n\n    puts(c[i]);\n\n    puts(c[i]);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"7956a311a0827e3e80893c0cfe4cf5d9a085375422a9400ff73865b39b531999","fast_id":"3dfb85f159adec9c44aad44111d600c5c79fb66b825416708a90f410e788128e","fast_time":0.010310608,"language":"cpp","measured_fast_code_id":"3dfb85f159adec9c44aad44111d600c5c79fb66b825416708a90f410e788128e","measured_slow_code_id":"703261bd1a818d9c6c11b35a046ebd83835aae03e8b96d30e5de8482c3a5cdc9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3724","problem_id":"p02764","slow_code_id":"8dd1d99abf04501382ed45a65859cbe726d14deeb457cf4d40db42295e1fad2a","slow_id":"703261bd1a818d9c6c11b35a046ebd83835aae03e8b96d30e5de8482c3a5cdc9","slow_time":0.0472413893,"speedup":4.581823816791405,"stratum":"4-8","sampling_key":"5257a7046b72a2a59a0ce76f8d8999f15a165f469715a3e745a844cd3e52c870","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 65;\n\nconst double eps = 1e-8;\n\nint n, k;\n\ndouble x[N], y[N], c[N], r[N];\n\ndouble dis(pair<double, double> a, pair<double, double> b) {\n\n  return sqrt((a.first - b.first) * (a.first - b.first) +\n              (a.second - b.second) * (a.second - b.second));\n}\n\nvector<pair<double, double> > cal(double x1, double y1, double r1, double x2, double y2, double r2) {\n\n  x1 -= x2, y1 -= y2;\n\n  double S = x1 * x1 + y1 * y1, a = (S + r2 * r2 - r1 * r1) / 2, D = S * r2 * r2 - a * a;\n\n  if (S == 0)\n    return {};\n\n  if (D < 0)\n    return {};\n\n  double A1 = a * x1, B1 = y1 * sqrt(D);\n\n  double A2 = a * y1, B2 = x1 * sqrt(D);\n\n  return {{(A1 + B1) / S + x2, (A2 - B2) / S + y2}, {(A1 - B1) / S + x2, (A2 + B2) / S + y2}};\n}\n\nbool check(double t) {\n\n  for (int i = 0; i < n; i++)\n    r[i] = t / c[i];\n\n  vector<pair<double, double> > vec;\n\n  for (int i = 0; i < n; i++) {\n\n    vec.push_back({x[i], y[i]});\n\n    for (int j = i + 1; j < n; j++) {\n\n      auto v = cal(x[i], y[i], r[i], x[j], y[j], r[j]);\n\n      for (auto it : v)\n        vec.push_back(it);\n    }\n  }\n\n  for (auto it : vec) {\n\n    int cnt = 0;\n\n    for (int i = 0; i < n; i++) {\n\n      if (r[i] + eps >= dis(it, {x[i], y[i]}))\n        cnt++;\n    }\n\n    if (cnt >= k)\n      return true;\n  }\n\n  return false;\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &k);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%lf%lf%lf\", &x[i], &y[i], &c[i]);\n  }\n\n  double L = 0, R = 1000010;\n\n  for (int i = 0; i < 100; i++) {\n\n    double mid = (L + R) / 2;\n\n    if (check(mid))\n      R = mid;\n\n    else\n      L = mid;\n  }\n\n  printf(\"%.6lf\\n\", R);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\n#define maxn 65\n\n#define eps 1e-8\n\ndouble x[maxn], y[maxn], c[maxn], X[65 * 65 * 2], Y[65 * 65 * 2], r[maxn];\n\nint tot, N, K;\n\ndouble dis(double x, double y, double c, double X, double Y) {\n\n  return sqrt((X - x) * (X - x) + (Y - y) * (Y - y));\n}\n\nvoid cal(double x1, double y1, double r1, double x2, double y2, double r2) {\n\n  double D;\n\n  double ad, h;\n\n  D = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);\n\n  if (D == 0)\n    return;\n\n  ad = (r1 * r1 + D - r2 * r2) / 2;\n\n  h = D * r1 * r1 - ad * ad;\n\n  if (h < 0)\n    return;\n\n  h = sqrt(h);\n\n  tot++, X[tot] = x1 + ad * (x2 - x1) / D - (y2 - y1) * h / D,\n         Y[tot] = y1 + ad * (y2 - y1) / D + (x2 - x1) * h / D;\n\n  tot++, X[tot] = x1 + ad * (x2 - x1) / D + (y2 - y1) * h / D,\n         Y[tot] = y1 + ad * (y2 - y1) / D - (x2 - x1) * h / D;\n}\n\nint judge(double t) {\n\n  int i, j, cnt;\n\n  for (i = 1; i <= N; i++)\n    r[i] = t / c[i];\n\n  tot = 0;\n\n  for (i = 1; i <= N; i++) {\n\n    tot++, X[tot] = x[i], Y[tot] = y[i];\n\n    for (j = i + 1; j <= N; j++)\n\n      cal(x[i], y[i], r[i], x[j], y[j], r[j]);\n  }\n\n  for (i = 1; i <= tot; i++) {\n\n    cnt = 0;\n\n    for (j = 1; j <= N; j++)\n\n      if (dis(x[j], y[j], c[j], X[i], Y[i]) < r[j] + eps)\n        cnt++;\n\n    if (cnt >= K)\n      return 1;\n  }\n\n  return 0;\n}\n\nint main() {\n\n  double l, r, mid;\n\n  int i;\n\n  scanf(\"%d%d\", &N, &K);\n\n  for (i = 1; i <= N; i++)\n    scanf(\"%lf%lf%lf\", &x[i], &y[i], &c[i]);\n\n  l = 0, r = 1000010;\n\n  for (i = 1; i <= 100; i++) {\n\n    mid = (l + r) / 2;\n\n    if (judge(mid))\n      r = mid;\n\n    else\n      l = mid;\n  }\n\n  printf(\"%.6lf\\n\", r);\n\n  return 0;\n}"}
{"fast_code_id":"2190801eada8f8208e74e6e4d82ab15de21ef860c04d03c070eec53cf8e29405","fast_id":"cb7cc22fc664fac113f21c389818e62a12dcd2981143622bbe85550cdc5bd143","fast_time":0.0941400634,"language":"cpp","measured_fast_code_id":"cb7cc22fc664fac113f21c389818e62a12dcd2981143622bbe85550cdc5bd143","measured_slow_code_id":"76198cb81c0d37494739786d836c4a52a1330d6e92d8ef9ce226f944903557b7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3745","problem_id":"p00323","slow_code_id":"66e837730a73d1b69ed8c6dcb03ae9d2af2854243e0adae3496ca88c2b95eb1a","slow_id":"76198cb81c0d37494739786d836c4a52a1330d6e92d8ef9ce226f944903557b7","slow_time":0.2318105781,"speedup":2.4624009133607614,"stratum":"2-4","sampling_key":"ff0086eafa7560884440684a2b4bc338b605ce4dd38106fd8a8c258cd7eddd51","slow_code":"#include <deque>\n\n#include <queue>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <set>\n\n#include <cmath>\n\n#include <tuple>\n\n#include <string>\n\n#include <chrono>\n\n#include <functional>\n\n#include <iterator>\n\n#include <random>\n\n#include <unordered_set>\n\n#include <unordered_map>\n\n#include <array>\n\n#include <map>\n\n#include <iomanip>\n\nusing namespace std;\n\ntypedef long long int llint;\n\ntypedef long double lldo;\n\n#define mp make_pair\n\n#define mt make_tuple\n\n#define pub push_back\n\n#define puf push_front\n\n#define pob pop_back\n\n#define pof pop_front\n\n#define fir first\n\n#define sec second\n\n#define res resize\n\n#define ins insert\n\n#define era erase\n\n#define dme                                                                                        \\\n  cout << -1 << endl;                                                                              \\\n  return 0\n\nconst int mod = 1000000007;\n\nconst llint big = 1e9 + 10;\n\nconst long double pai = 3.141592653589793238462643383279502884197;\n\nconst long double eps = 1e-7;\n\ntemplate <class T, class U> void mineq(T &a, U b) {\n  if (a > b) {\n    a = b;\n  }\n}\n\ntemplate <class T, class U> void maxeq(T &a, U b) {\n  if (a < b) {\n    a = b;\n  }\n}\n\nllint gcd(llint a, llint b) {\n  if (a % b == 0) {\n    return b;\n  } else\n    return gcd(b, a % b);\n}\n\nllint lcm(llint a, llint b) { return a / gcd(a, b) * b; }\n\nint main(void) {\n\n  int n, i;\n  cin >> n;\n\n  static int aizu[200300] = {0};\n\n  for (i = 0; i < n; i++) {\n\n    int a, b;\n    cin >> a >> b;\n\n    aizu[a + b]++;\n  }\n\n  for (i = 0; i < 200279; i++) {\n\n    aizu[i + 1] += aizu[i] / 2;\n\n    aizu[i] %= 2;\n\n    if (aizu[i] == 1) {\n      cout << i << \" 0\" << endl;\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define ALL(v) (v).begin(), (v).end()\n\n#define fi first\n\n#define se second\n\ntemplate <typename A, typename B> inline bool chmax(A &a, B b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename A, typename B> inline bool chmin(A &a, B b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\nconst ll INF = 1e9 + 100;\n\nconst ll MOD = 1e9 + 7;\n\nconst bool debug = 0;\n\nint main() {\n\n  int N;\n\n  priority_queue<int, vector<int>, greater<int> > pq;\n\n  cin >> N;\n\n  REP(i, N) {\n\n    int a, b;\n\n    scanf(\"%d %d\", &a, &b);\n\n    pq.push(a + b);\n  }\n\n  vector<int> ans;\n\n  while (pq.size() > 1) {\n\n    int a = pq.top();\n    pq.pop();\n\n    int b = pq.top();\n    pq.pop();\n\n    if (a == b)\n      pq.push(a + 1);\n\n    else {\n\n      pq.push(b);\n\n      ans.push_back(a);\n    }\n  }\n\n  if (pq.size() > 0)\n    ans.push_back(pq.top());\n\n  REP(i, ans.size()) printf(\"%d 0\\n\", ans[i], i == ans.size() - 1 ? '\\n' : ' ');\n\n  return 0;\n}"}
{"fast_code_id":"c7639c31266097ee861808d95e5430061f62d1e9b57f44d868f784d46670f521","fast_id":"c3fc913a8617e9e8b7b26ba77219db99b35c02699c128c29b00bf5c21cdaac6a","fast_time":0.0982127449,"language":"cpp","measured_fast_code_id":"c3fc913a8617e9e8b7b26ba77219db99b35c02699c128c29b00bf5c21cdaac6a","measured_slow_code_id":"884818199fda81b2239fe568036ee8682289a420635a2a35306258a0d492d8c4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37558","problem_id":"p00590","slow_code_id":"dbac3d6ead88e67520828e5b10008ff7d54c3b44ae886083678354ac7bf3253a","slow_id":"884818199fda81b2239fe568036ee8682289a420635a2a35306258a0d492d8c4","slow_time":0.3074242383,"speedup":3.130186806335763,"stratum":"2-4","sampling_key":"fa10dcb36534ef05ee3bbec394a2ce655f6bbd20f5c85840d50e3eced069ef4f","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long int\n\nusing namespace std;\n\nll i, j, k, l, n, counter;\n\nbool ara3[200000];\n\nvoid seive()\n\n{\n\n  for (i = 2; i <= 100001; i++)\n\n  {\n\n    ara3[i] = true;\n  }\n\n  ara3[1] = false;\n\n  for (i = 2; i <= 100001; i++)\n\n  {\n\n    for (j = 2; i * j <= 100001; j++)\n\n    {\n\n      if (ara3[i] == true)\n\n      {\n\n        ara3[i * j] = false;\n      }\n    }\n  }\n}\n\nint main(void)\n\n{\n\n  seive();\n\n  while (cin >> n)\n\n  {\n\n    counter = 0;\n\n    for (i = 1, j = n; i <= n; i++, j--)\n\n    {\n\n      if (ara3[i] == true && ara3[j] == true)\n\n      {\n\n        counter++;\n      }\n    }\n\n    cout << counter << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <math.h>\n\nusing namespace std;\n\nint IsPrime(int a, int b)\n\n{\n\n  int i, p = 0, q = 0;\n\n  if (a == 1 || b == 1)\n\n  {\n\n    return 0;\n  }\n\n  for (i = 2; i <= sqrt(a); i++)\n\n  {\n\n    if (a % i == 0)\n\n    {\n\n      p = 1;\n\n      break;\n    }\n  }\n\n  for (i = 2; i <= sqrt(b); i++)\n\n  {\n\n    if (b % i == 0)\n\n    {\n\n      q = 1;\n\n      break;\n    }\n  }\n\n  if (p != 1 && q != 1)\n\n    return 1;\n\n  else\n\n    return 0;\n}\n\nint main()\n\n{\n\n  int a, b, i, c = 0;\n\n  while (cin >> a)\n\n  {\n\n    c = 0;\n\n    for (i = 0; i < a; i++)\n\n    {\n\n      if ((b = IsPrime(i + 1, a - i)) == 1)\n\n        c++;\n    }\n\n    cout << c << endl;\n  }\n}"}
{"fast_code_id":"fca305f8215e8653f9748746484a7e861dc8b3b997d23b4ad88a5d5bacebf690","fast_id":"580e046ebfa72cb0296db754f790d20a3f333a10a77f2e24791a76411869cc46","fast_time":0.1059894759,"language":"cpp","measured_fast_code_id":"580e046ebfa72cb0296db754f790d20a3f333a10a77f2e24791a76411869cc46","measured_slow_code_id":"5c1f91d9bf6cc6e2b8cbb8b5c9e2e078ea353a9b9edf444ff9be5f7576b042ba","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37566","problem_id":"p03018","slow_code_id":"5c78143c9f42960145027baf6acbd5cf69224b1835d172323076976854884aab","slow_id":"5c1f91d9bf6cc6e2b8cbb8b5c9e2e078ea353a9b9edf444ff9be5f7576b042ba","slow_time":0.6355826268,"speedup":5.996657888936688,"stratum":"4-8","sampling_key":"67b1534b50ed8faf66ff5acbbf811db46a7e1aaba51c0b1b4b07f1e34442b49f","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\n#include <list>\n\n#include <set>\n\n#include <string>\n\nusing namespace std;\n\nint gcd(int a, int b) {\n\n  int c = a % b;\n\n  while (c != 0) {\n\n    a = b;\n\n    b = c;\n\n    c = a % b;\n  }\n\n  return b;\n}\n\nstruct UnionFind {\n\n  vector<int> par;\n\n  UnionFind(int N) : par(N) {\n\n    for (int i = 0; i < N; i++)\n      par[i] = i;\n  }\n\n  int root(int x) {\n\n    if (par[x] == x)\n      return x;\n\n    return par[x] = root(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    int rx = root(x);\n\n    int ry = root(y);\n\n    if (rx == ry)\n      return;\n\n    par[rx] = ry;\n  }\n\n  bool same(int x, int y) {\n\n    int rx = root(x);\n\n    int ry = root(y);\n\n    return rx == ry;\n  }\n};\n\ntypedef long long ll;\n\nconst ll M = 1000000007;\n\nvector<ll> fac(300001);\n\nvector<ll> ifac(300001);\n\nll mpow(ll x, ll n) {\n\n  ll ans = 1;\n\n  while (n != 0) {\n\n    if (n & 1)\n      ans = ans * x % M;\n\n    x = x * x % M;\n\n    n = n >> 1;\n  }\n\n  return ans;\n}\n\nll comb(ll a, ll b) {\n\n  if (a == 0 && b == 0)\n    return 1;\n\n  if (a < b || a < 0)\n    return 0;\n\n  ll tmp = ifac[a - b] * ifac[b] % M;\n\n  return tmp * fac[a] % M;\n}\n\nlong long modinv(long long a) {\n\n  long long b = M, u = 1, v = 0;\n\n  while (b) {\n\n    long long t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= M;\n\n  if (u < 0)\n    u += M;\n\n  return u;\n}\n\nint main() {\n\n  ll i, ans = 0, count = 0;\n\n  char s[222222];\n\n  cin >> s;\n\n  if (s[0] == 'A')\n\n    count++;\n\n  for (i = 1; s[i] != '\\0'; i++) {\n\n    if (s[i] == 'A')\n\n      count++;\n\n    if (s[i] == 'B') {\n\n      if (s[i - 1] != 'A' || s[i + 1] != 'C')\n\n        count = 0;\n    }\n\n    if (s[i] == 'C') {\n\n      if (s[i - 1] == 'B') {\n\n        ans += count;\n\n        s[i] = 'A';\n\n      }\n\n      else\n\n        count = 0;\n    }\n  }\n\n  cout << ans << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define ll long long\n\nint main() {\n\n  string s;\n\n  cin >> s;\n\n  int n = s.size();\n\n  rep(i, n - 1) {\n\n    if (s[i] == 'B' && s[i + 1] == 'C')\n      s[i] = 'K', s[i + 1] = 'D';\n  }\n\n  reverse(s.begin(), s.end());\n\n  ll k = 0, cnt = 0;\n\n  rep(i, n) {\n\n    if (s[i] == 'K')\n      k++;\n\n    else if (s[i] == 'A')\n      cnt += k;\n\n    else if (s[i] != 'D')\n      k = 0;\n  }\n\n  cout << cnt << endl;\n}\n"}
{"fast_code_id":"1b72a63a1d10fd851ed5af4ee959fe8ad42f262caa44840d761d676c258c3352","fast_id":"66a4990d3bd6c7bf57aa935232e26f218e6a773496e051f455df06ba15648086","fast_time":0.0322620358,"language":"cpp","measured_fast_code_id":"66a4990d3bd6c7bf57aa935232e26f218e6a773496e051f455df06ba15648086","measured_slow_code_id":"6d6c0c32711ed7a4c16e688301b5f8638913677f8c155602670663795e9c3e74","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37639","problem_id":"p03822","slow_code_id":"15d8b16c123bef17973498769c6bebb82d6f8fa7ef980ec042f04a0574c6e6f1","slow_id":"6d6c0c32711ed7a4c16e688301b5f8638913677f8c155602670663795e9c3e74","slow_time":0.1121660211,"speedup":3.4767186359640703,"stratum":"2-4","sampling_key":"2c520b5e89414c74fdab4da5c600ef006ccde6715d345ead92be0698ac2ae8d0","slow_code":"#define __USE_MINGW_ANSI_STDIO 0\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define int ll\n\ntypedef vector<int> VI;\n\ntypedef vector<VI> VVI;\n\ntypedef vector<ll> VL;\n\ntypedef vector<VL> VVL;\n\ntypedef pair<int, int> PII;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define ALL(x) x.begin(), x.end()\n\n#define IN(a, b, x) (a <= x && x < b)\n\n#define MP make_pair\n\n#define PB push_back\n\n#ifdef int\n\nconst ll INF = (1LL << 60);\n\n#else\n\nconst int INF = (1LL << 30);\n\n#endif\n\nconst double PI = 3.14159265359;\n\nconst double EPS = 1e-12;\n\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\n\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\n\ntemplate <class S, class T>\n\nostream &operator<<(ostream &out, const pair<S, T> &a) {\n\n  out << '(' << a.first << ',' << a.second << ')';\n\n  return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nint a[100010];\n\nVI g[100010];\n\nint dfs(int v, int p) {\n\n  if (g[v].size() == 0)\n    return 0;\n\n  VI vec;\n\n  for (int i : g[v])\n    if (i != p) {\n\n      vec.PB(dfs(i, v));\n    }\n\n  sort(ALL(vec));\n\n  reverse(ALL(vec));\n\n  int ret = 0;\n\n  REP(i, vec.size()) { chmax(ret, vec[i] + i + 1); }\n\n  return ret;\n}\n\nsigned main(void)\n\n{\n\n  int n;\n\n  cin >> n;\n\n  REP(i, n - 1) {\n\n    cin >> a[i];\n\n    g[a[i] - 1].PB(i + 1);\n  }\n\n  cout << dfs(0, -1) << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define ALL(x) x.begin(), x.end()\n\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\n\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\n\nstruct FastIO {\n  FastIO() {\n    cin.tie(0);\n    ios::sync_with_stdio(0);\n  }\n} fastiofastio;\n\n#ifdef DEBUG\n\n#include \"../program_contest_library/memo/dump.hpp\"\n\n#else\n\n#define dump(...)\n\n#endif\n\nconst ll INF = 1LL << 60;\n\nint main(void) {\n\n  ll n;\n\n  cin >> n;\n\n  vector<vector<ll>> g(n);\n\n  REP(i, n - 1) {\n\n    ll a;\n\n    cin >> a;\n\n    a--;\n\n    g[i + 1].push_back(a);\n\n    g[a].push_back(i + 1);\n  }\n\n  auto dfs = [&](auto &&self, ll v, ll p) -> ll {\n    vector<ll> ch;\n\n    for (auto to : g[v])\n      if (to != p) {\n\n        ll t = self(self, to, v);\n\n        ch.push_back(t);\n      }\n\n    sort(ALL(ch));\n\n    ll now = 0;\n\n    for (auto i : ch)\n      now = max(now + 1, i + 1);\n\n    return now;\n  };\n\n  cout << dfs(dfs, 0, -1) << endl;\n\n  return 0;\n}"}
{"fast_code_id":"f21772e707376f74a81264e25696143d84d68ca5ea6d4954eee656c47df70d88","fast_id":"c751a65e5d8ba721a9e581ea49cc415eecdce49a857b9ea168a95fed5cf1a0ed","fast_time":0.0330499618,"language":"cpp","measured_fast_code_id":"c751a65e5d8ba721a9e581ea49cc415eecdce49a857b9ea168a95fed5cf1a0ed","measured_slow_code_id":"fe896fe392f84ec6ee53cb32228f36bdc0884626b48612f9c3efee609579afc2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37670","problem_id":"p03361","slow_code_id":"00653fbf80eae4a5c4ab8106c911c022f9025f89d86fe1ddcd23f400bf6f5f51","slow_id":"fe896fe392f84ec6ee53cb32228f36bdc0884626b48612f9c3efee609579afc2","slow_time":0.0946329641,"speedup":2.863330513743589,"stratum":"2-4","sampling_key":"0f75f8c80710c6936bfcbbd653587b7c29beedb464c3b4924c0a7bdaf2d88888","slow_code":"#pragma region Macros\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long int;\n\nusing ld = long double;\n\nusing pii = pair<int, int>;\n\nusing pll = pair<ll, ll>;\n\nusing pld = pair<ld, ld>;\n\ntemplate <typename Q_type>\n\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\n\nconst int MOD_TYPE = 1;\n\nconst ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\n\nconst int INF = (int)1e9;\n\nconst ll LINF = (ll)4e18;\n\nconst ld PI = acos(-1.0);\n\nconst ld EPS = 1e-11;\n\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\n\n#define rep(i, n) REP(i, 0, n)\n\n#define MP make_pair\n\n#define MT make_tuple\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << \"\\n\"\n\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << \"\\n\"\n\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << \"\\n\"\n\n#define possible(n) cout << ((n) ? \"possible\" : \"impossible\") << \"\\n\"\n\n#define Yay(n) cout << ((n) ? \"Yay!\" : \":(\") << \"\\n\"\n\n#define all(v) v.begin(), v.end()\n\n#define NP(v) next_permutation(all(v))\n\n#define dbg(x) cerr << #x << \":\" << x << \"\\n\";\n\nvector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};\n\nvector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};\n\n#pragma endregion\n\nclass UnionFind\n\n{\n\nprivate:\n  vector<int> par, sizes;\n\npublic:\n  UnionFind(int n = 200010)\n      : par(n), sizes(n, 1)\n\n  {\n\n    rep(i, n) par[i] = i;\n  }\n\n  int root(int x)\n\n  {\n\n    if (x == par[x])\n\n      return x;\n\n    return par[x] = root(par[x]);\n  }\n\n  void unite(int x, int y)\n\n  {\n\n    x = root(x);\n\n    y = root(y);\n\n    if (x == y)\n\n      return;\n\n    if (sizes[x] < sizes[y])\n\n      swap(x, y);\n\n    par[y] = x;\n\n    sizes[x] += sizes[y];\n  }\n\n  bool same(int x, int y)\n\n  {\n\n    return root(x) == root(y);\n  }\n\n  int size(int x)\n\n  {\n\n    return sizes[root(x)];\n  }\n};\n\nint main()\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cout << setprecision(30) << setiosflags(ios::fixed);\n\n  int n, m;\n\n  cin >> n >> m;\n\n  string s[50];\n\n  rep(i, n) cin >> s[i];\n\n  UnionFind uf;\n\n  rep(i, n) rep(j, m - 1)\n\n  {\n\n    if (s[i][j] == '#' && s[i][j + 1] == '#')\n\n      uf.unite(i * m + j, i * m + j + 1);\n  }\n\n  rep(j, m) rep(i, n - 1)\n\n  {\n\n    if (s[i][j] == '#' && s[i + 1][j] == '#')\n\n      uf.unite(i * m + j, (i + 1) * m + j);\n  }\n\n  rep(i, n) rep(j, m)\n\n  {\n\n    if (s[i][j] == '.')\n\n      continue;\n\n    if (uf.size(i * m + j) == 1)\n\n    {\n\n      Yes(false);\n\n      return 0;\n    }\n  }\n\n  Yes(true);\n\n  return 0;\n}\n","fast_code":"#define MOD_TYPE 1\n\n#pragma region Macros\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long int;\n\nusing ld = long double;\n\nusing pii = pair<int, int>;\n\nusing pll = pair<ll, ll>;\n\nusing pld = pair<ld, ld>;\n\ntemplate <typename Q_type>\n\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\n\nconstexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\n\nconstexpr int INF = (int)1e9;\n\nconstexpr ll LINF = (ll)4e18;\n\nconstexpr ld PI = acos(-1.0);\n\nconstexpr ld EPS = 1e-11;\n\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\n\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\n\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\n\n#define rep(i, n) REP(i, 0, n)\n\n#define MP make_pair\n\n#define MT make_tuple\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << \"\\n\"\n\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << \"\\n\"\n\n#define possible(n) cout << ((n) ? \"possible\" : \"impossible\") << \"\\n\"\n\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << \"\\n\"\n\n#define Yay(n) cout << ((n) ? \"Yay!\" : \":(\") << \"\\n\"\n\n#define all(v) v.begin(), v.end()\n\n#define NP(v) next_permutation(all(v))\n\n#define dbg(x) cerr << #x << \":\" << x << \"\\n\";\n\ninline void init_main()\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cout << setprecision(30) << setiosflags(ios::fixed);\n}\n\ntemplate <typename T>\n\ninline bool chmin(T &a, T b)\n\n{\n\n  if (a > b)\n\n  {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <typename T>\n\ninline bool chmax(T &a, T b)\n\n{\n\n  if (a < b)\n\n  {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\ninline ll CEIL(ll a, ll b)\n\n{\n\n  return (a + b - 1) / b;\n}\n\n#pragma endregion\n\nint main()\n\n{\n\n  init_main();\n\n  int h, w;\n\n  cin >> h >> w;\n\n  string s[50];\n\n  rep(i, h) cin >> s[i];\n\n  rep(i, h) rep(j, w)\n\n  {\n\n    if (s[i][j] == '.')\n\n      continue;\n\n    bool black = false;\n\n    if (i + 1 != h && s[i + 1][j] == '#')\n\n      black = true;\n\n    if (i - 1 >= 0 && s[i - 1][j] == '#')\n\n      black = true;\n\n    if (j + 1 != w && s[i][j + 1] == '#')\n\n      black = true;\n\n    if (j - 1 >= 0 && s[i][j - 1] == '#')\n\n      black = true;\n\n    if (!black)\n\n    {\n\n      Yes(0);\n\n      return 0;\n    }\n  }\n\n  Yes(1);\n\n  return 0;\n}\n"}
{"fast_code_id":"ab730947ca9ad2ecac96adb2a3879154c2250cbe992099c9e9250c1a2ba5c7e2","fast_id":"086e837f0f3e3eab99289829ff33b4bf759633b454c0f15aa1d056efc5dd0f86","fast_time":0.0407091476,"language":"cpp","measured_fast_code_id":"086e837f0f3e3eab99289829ff33b4bf759633b454c0f15aa1d056efc5dd0f86","measured_slow_code_id":"6a14c06f596bb3fa7bd79e60b86ce906ee69d8ca43cd7d22393d0900a4a19e16","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37681","problem_id":"p03427","slow_code_id":"b4c86fc45921ebfc06feb4b8fb7a4572afd27187b14013c290c010d8a3598ea3","slow_id":"6a14c06f596bb3fa7bd79e60b86ce906ee69d8ca43cd7d22393d0900a4a19e16","slow_time":0.2623941583,"speedup":6.445582228304874,"stratum":"4-8","sampling_key":"0593c56753eaf6deafae55c22ace837d8134a8158e71c6e5a819dc4c07b50df3","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <iomanip>\n\n#include <vector>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <utility>\n\n#include <functional>\n\n#include <deque>\n\n#include <cctype>\n\n#include <stack>\n\n#include <bitset>\n\nusing ll = long long;\n\ntypedef unsigned long long ull;\n\ntypedef std::pair<ll, ll> p;\n\nstruct edge {\n  int to, cost;\n};\n\nstd::vector<int> G[100000];\n\nstd::vector<int> I[100000];\n\nll min(ll a, ll b) {\n\n  if (a >= b)\n    return b;\n\n  else\n    return a;\n}\n\nll max(ll a, ll b) {\n\n  if (a >= b)\n    return a;\n\n  else\n    return b;\n}\n\nll gcd(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  return gcd(b, a % b);\n}\n\nll lcm(ll a, ll b) {\n\n  ll g = gcd(a, b);\n\n  return a / g * b;\n}\n\nconst ll Z = 1000000007;\n\nconst ll INF = 1 << 30;\n\nconst ll INF2 = 9000000000000000000LL;\n\nbool flag = true;\n\nbool fl = false;\n\nbool f = false;\n\nint dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nint main() {\n\n  ll n, ans = 0;\n\n  std::cin >> n;\n\n  std::string s, t;\n\n  s = std::to_string(n);\n\n  t = s;\n\n  for (int i = 0; i < s.size() - 1; i++) {\n\n    if (flag) {\n\n      if (s[i + 1] - '0' != 9) {\n\n        int a = s[i] - '0' - 1;\n\n        s[i] = a + '0';\n\n        s[i + 1] = '9';\n\n      }\n\n      else\n        s[i + 1] = '9';\n\n    }\n\n    else\n      s[i + 1] = '9';\n\n    if (s < t)\n      flag = false;\n  }\n\n  for (int i = 0; i < s.size(); i++) {\n\n    ans += s[i] - '0';\n  }\n\n  std::cout << ans << std::endl;\n}","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <iomanip>\n\n#include <vector>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <utility>\n\n#include <functional>\n\n#include <deque>\n\n#include <cctype>\n\n#include <stack>\n\n#include <bitset>\n\n#include <set>\n\nusing namespace std;\n\nusing ll = long long;\n\ntypedef unsigned long long ull;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<ll, pair<ll, ll>> PP;\n\nconst ll MOD = 1e9 + 7;\n\nconst ll INF = 1 << 30;\n\nconst ll INF2 = 9e18;\n\nconst double INF3 = 9e14;\n\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nconst int tx[8] = {-1, 0, 1, -1, 1, -1, 0, 1}, ty[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define pb push_back\n\n#define fr first\n\n#define sc second\n\nint main() {\n\n  ll sum = 0;\n\n  string s;\n\n  cin >> s;\n\n  for (int i = 0; i < s.size(); i++) {\n\n    sum += s[i] - '0';\n  }\n\n  cout << max(sum, (ll)(s[0] - '0' - 1 + (s.size() - 1) * 9)) << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"3bc2227227126fc27eb00cdea74aac216299fb380072802a67fd565f974e42f1","fast_id":"3afbe6e17e7dda5cef143b7578c9686da290ea6f079805430a5ac29d846902da","fast_time":0.0473369705,"language":"cpp","measured_fast_code_id":"3afbe6e17e7dda5cef143b7578c9686da290ea6f079805430a5ac29d846902da","measured_slow_code_id":"b714daa995633270b137c83f58e63b009b65509200b4c660690d9246905a8ad6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37714","problem_id":"p03383","slow_code_id":"3f31307c562645398abe2fd458b91ac73459b210ee8ccbb6ad0a7cd4ae7fb679","slow_id":"b714daa995633270b137c83f58e63b009b65509200b4c660690d9246905a8ad6","slow_time":0.0995481876,"speedup":2.102969128537704,"stratum":"2-4","sampling_key":"1740b2e5a94bdae62152e5d5ed52447409990f5dd404c2849e6ba9df94be4973","slow_code":"\n\n#include <assert.h>\n\n#include <ctype.h>\n\n#include <errno.h>\n\n#include <float.h>\n\n#include <fstream>\n\n#include <iomanip>\n\n#include <iostream>\n\n#include <limits>\n\n#include <locale>\n\n#include <math.h>\n\n#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <time.h>\n\n#include <wchar.h>\n\n#include <wctype.h>\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <cctype>\n\n#include <cerrno>\n\n#include <clocale>\n\n#include <cmath>\n\n#include <complex>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <ctime>\n\n#include <deque>\n\n#include <exception>\n\n#include <fstream>\n\n#include <functional>\n\n#include <limits>\n\n#include <map>\n\n#include <iomanip>\n\n#include <ios>\n\n#include <iosfwd>\n\n#include <istream>\n\n#include <ostream>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <stdexcept>\n\n#include <streambuf>\n\n#include <string>\n\n#include <utility>\n\n#include <vector>\n\n#include <cwchar>\n\n#include <cwctype>\n\n#include <inttypes.h>\n\n#include <stdbool.h>\n\n#include <stdint.h>\n\n#include <tgmath.h>\n\n#include <numeric>\n\n#include <list>\n\n#define LL long long\n\n#define pb push_back\n\n#define pob pop_back\n\n#define mp make_pair\n\n#define FILL(a, v) memset((void *)a, v, sizeof(a))\n\n#define FILL0(a) FILL(a, 0)\n\n#define FILL1(a) FILL(a, -1)\n\n#define FILLBIG(a) FILL(a, 0x7f)\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define Inf ((int)0x7f7f7f7f)\n\n#define INF ((long long)0x7f7f7f7f7f7f7f7f)\n\n#define Mod 1000000007\n\n#define foreach(it, x) for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)\n\n#define FOR(i, x) for (int i = 0; i < x; i++)\n\n#define RFOR(i, x) for (int i = x - 1; i >= 0; i--)\n\n#define FFOR(i, a, b) for (int i = a; i < b; i++)\n\n#define FRFOR(i, a, b) for (int i = a - 1; i >= b; i--)\n\n#define SZ(a) ((int)(a).size())\n\n#define FI first\n\n#define SE second\n\n#define OVER(a) return puts(a), 0\n\n#define fastio ios::sync_with_stdio(0)\n\n#define filei(f) freopen(f, \"r\", stdin)\n\n#define fileo(f) freopen(f, \"w\", stdout)\n\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\n\n#define MASK(a) (1 << (a))\n\n#define MASKX(x, a) ((x) << (a))\n\n#define BIT(a, b) ((a >> b) & 1)\n\n#define cddx(a) priority_queue<a>\n\n#define cxdd(a) priority_queue<a, vector<a>, greater<a> >\n\n#define deval(a)                                                                                   \\\n  { cerr << #a << \" = \" << a << endl; }\n\n#define dearr(be, en)                                                                              \\\n  {                                                                                                \\\n    cerr << #be;                                                                                   \\\n    cerr << \" = {\";                                                                                \\\n    for (auto i = be; i != en; i++)                                                                \\\n      cerr << ' ' << *i;                                                                           \\\n    cerr << \" }\\n\";                                                                                \\\n  }\n\n#define reg register\n\n#define prtime eprintf(\"\\n\\nTime used: %dms\\n\", clock());\n\n#define PI 3.1415926535897932384626\n\n#define TODEG(a) (a * 180 / PI)\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef unsigned long long UINT;\n\ntypedef unsigned int uint;\n\ntypedef long long INT;\n\ntypedef long double ldouble;\n\ntypedef pair<INT, INT> PII;\n\ntypedef stringstream sst;\n\ntypedef istringstream iss;\n\ntypedef vector<int> vint;\n\ntypedef vector<INT> VINT;\n\ntypedef vector<pii> vpii;\n\ntypedef vector<PII> VPII;\n\ntypedef priority_queue<int> pqi;\n\ntypedef priority_queue<INT> PQI;\n\ntypedef priority_queue<pii> pqp;\n\ntypedef priority_queue<PII> PQP;\n\ntypedef priority_queue<int, vint, greater<int> > xqi;\n\ntypedef priority_queue<INT, VINT, greater<INT> > XQI;\n\ntypedef priority_queue<pii, vpii, greater<pii> > xqp;\n\ntypedef priority_queue<PII, VPII, greater<PII> > XQP;\n\nint n, m;\n\nchar s[17][17];\n\nstring t[17];\n\nint h[17];\n\nint l[17];\n\nvoid dfs1(int now, int ji)\n\n{\n\n  if (now == m)\n\n  {\n\n    puts(\"YES\");\n\n    exit(0);\n  }\n\n  if (l[now] != -1)\n\n  {\n\n    dfs1(now + 1, ji);\n\n    return;\n  }\n\n  for (int i = now + 1; i < m; i++)\n\n  {\n\n    if (l[i] != -1)\n\n      continue;\n\n    bool can = 1;\n\n    for (int j = 0; j < n; j++)\n\n      if (s[j][now] != s[h[j]][i])\n\n        can = 0;\n\n    if (!can)\n\n      continue;\n\n    l[now] = i;\n\n    l[i] = now;\n\n    dfs1(now + 1, ji);\n\n    l[now] = l[i] = -1;\n  }\n\n  if (ji)\n\n  {\n\n    bool can = 1;\n\n    for (int j = 0; j < n; j++)\n\n      if (s[j][now] != s[h[j]][now])\n\n        can = 0;\n\n    if (can)\n\n    {\n\n      l[now] = now;\n\n      dfs1(now + 1, 0);\n\n      l[now] = -1;\n    }\n  }\n}\n\nvoid dfs2(int now, int ji)\n\n{\n\n  if (now == n)\n\n  {\n\n    dfs1(0, m % 2);\n\n    return;\n  }\n\n  if (h[now] != -1)\n\n  {\n\n    dfs2(now + 1, ji);\n\n    return;\n  }\n\n  for (int i = now + 1; i < n; i++)\n\n  {\n\n    if (h[i] != -1)\n\n      continue;\n\n    h[now] = i;\n\n    h[i] = now;\n\n    dfs2(now + 1, ji);\n\n    h[now] = h[i] = -1;\n  }\n\n  if (ji)\n\n  {\n\n    h[now] = now;\n\n    dfs2(now + 1, 0);\n\n    h[now] = -1;\n  }\n}\n\nint main()\n\n{\n\n  cin >> n >> m;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> s[i];\n\n    t[i] = s[i];\n\n    sort(t[i].begin(), t[i].end());\n  }\n\n  FILL1(h);\n\n  FILL1(l);\n\n  dfs2(0, n % 2);\n\n  OVER(\"NO\");\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, m;\n\nchar s[15][15];\n\nint cnt[15][35];\n\nint tr[15], tc[15];\n\nvoid colstrs(int now, bool js = m & 1) {\n\n  if (now == m) {\n\n    puts(\"YES\");\n\n    exit(0);\n  }\n\n  if (~tc[now]) {\n\n    colstrs(now + 1, js);\n\n    return;\n  }\n\n  if (js) {\n\n    bool can = 1;\n\n    for (int j = 0; j < n; j++) {\n\n      can &= (s[j][now] == s[tr[j]][now]);\n    }\n\n    if (can) {\n\n      tc[now] = now;\n\n      colstrs(now + 1, 0);\n\n      tc[now] = -1;\n    }\n  }\n\n  for (int i = 0; i < m; i++) {\n\n    if (i != now && !~tc[i]) {\n\n      bool can = 1;\n\n      for (int j = 0; j < n; j++) {\n\n        can &= (s[j][now] == s[tr[j]][i]);\n      }\n\n      if (!can) {\n\n        continue;\n      }\n\n      tc[now] = i;\n\n      tc[i] = now;\n\n      colstrs(now + 1, js);\n\n      tc[now] = tc[i] = -1;\n    }\n  }\n}\n\nvoid rowstrs(int now, bool js = n & 1) {\n\n  if (now == n) {\n\n    memset(tc, -1, sizeof(tc));\n\n    colstrs(0);\n\n    return;\n  }\n\n  if (~tr[now]) {\n\n    rowstrs(now + 1, js);\n\n    return;\n  }\n\n  if (js) {\n\n    tr[now] = now;\n\n    rowstrs(now + 1, 0);\n\n    tr[now] = -1;\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    if (i != now && !~tr[i]) {\n\n      bool can = 1;\n\n      for (int j = 0; j < 26; j++) {\n\n        can &= (cnt[now][j] == cnt[i][j]);\n      }\n\n      if (!can) {\n\n        continue;\n      }\n\n      tr[now] = i;\n\n      tr[i] = now;\n\n      rowstrs(now + 1, js);\n\n      tr[now] = tr[i] = -1;\n    }\n  }\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%s\", s[i]);\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    for (int j = 0; j < m; j++) {\n\n      cnt[i][s[i][j] - 'a']++;\n    }\n  }\n\n  memset(tr, -1, sizeof(tr));\n\n  rowstrs(0);\n\n  puts(\"NO\");\n\n  return 0;\n}"}
{"fast_code_id":"1a4016dac03ce9a65c6e17821e0689d3f9ed0012092289c8a15d7316c73ab162","fast_id":"bc81fb6b1c97662310170776fe16216cae2a5ef7f9b0fd62bc07e4fdf9d4cbb4","fast_time":0.0424624509,"language":"cpp","measured_fast_code_id":"bc81fb6b1c97662310170776fe16216cae2a5ef7f9b0fd62bc07e4fdf9d4cbb4","measured_slow_code_id":"50b91d06c6505a991dd84e478de6799114e7be5143e58348abc26933b96da9b3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37761","problem_id":"p02323","slow_code_id":"1f77f230c6f2f35b94acdf859d6addd608c1e2d60592e50b0b6d130da4774fec","slow_id":"50b91d06c6505a991dd84e478de6799114e7be5143e58348abc26933b96da9b3","slow_time":0.11555716,"speedup":2.721396376109793,"stratum":"2-4","sampling_key":"29025d361dde8875114dcb8522bee336d316de4b37e0dd8b25e3cbc1032e5af1","slow_code":"#include <bits/stdc++.h>\n\n#define r(i, n) for (int i = 0; i < n; i++)\n\nusing namespace std;\n\n#define MAX 15\n\n#define INF 1 << 28\n\nint n;\n\nint d[MAX][MAX];\n\nint dp[1 << MAX][MAX];\n\nint rec(int s, int v) {\n\n  if (dp[s][v] >= 0)\n    return dp[s][v];\n\n  if (s == (1 << n) - 1 && v == 0)\n    return dp[s][v] = 0;\n\n  int res = INF;\n\n  for (int u = 0; u < n; u++)\n\n    if (!(s >> u & 1))\n\n      res = min(res, rec(s | 1 << u, u) + d[v][u]);\n\n  return dp[s][v] = res;\n}\n\nint main() {\n\n  memset(dp, -1, sizeof(dp));\n\n  r(i, MAX) r(j, MAX) d[i][j] = INF;\n\n  int m;\n\n  cin >> n >> m;\n\n  while (m--) {\n\n    int s, t, dd;\n\n    cin >> s >> t >> dd;\n\n    d[s][t] = dd;\n  }\n\n  int p = rec(0, 0);\n\n  if (p == INF)\n    p = -1;\n\n  cout << p << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct TSP {\n\n  int n, d[16][16], dp[(1 << 16)][16];\n\n  TSP(int sz) : n(sz) {\n\n    for (int i = 0; i < 16; i++)\n\n      for (int j = 0; j < 16; j++)\n        d[i][j] = 1e8;\n  }\n\n  void add(int a, int b, int c) { d[a][b] = c; }\n\n  int solve() {\n\n    for (int i = 0; i < (1 << n); i++)\n\n      for (int j = 0; j < n; j++)\n        dp[i][j] = 1e8;\n\n    dp[0][0] = 0;\n\n    for (int i = 0; i < (1 << n); i++) {\n\n      for (int j = 0; j < n; j++) {\n\n        if (!((1 << j) & i)) {\n\n          for (int k = 0; k < n; k++) {\n\n            dp[i | (1 << j)][j] = min(dp[i | (1 << j)][j], dp[i][k] + d[k][j]);\n          }\n        }\n      }\n    }\n\n    if (dp[(1 << n) - 1][0] == 1e8)\n      return -1;\n\n    return dp[(1 << n) - 1][0];\n  }\n};\n\nint main() {\n\n  int n, m;\n\n  cin >> n >> m;\n\n  TSP T(n);\n\n  for (int i = 0; i < m; i++) {\n\n    int x, y, z;\n\n    cin >> x >> y >> z;\n\n    T.add(x, y, z);\n  }\n\n  cout << T.solve() << endl;\n}\n"}
{"fast_code_id":"0626c329b0347233009b5fc9812cf3f7b92cdce78eaf18e4ce60997c82ac479b","fast_id":"d0b40895d4cd7faa61f152aeb8191440dd5c379faefc07ba656d4a01628067c2","fast_time":0.0463326323,"language":"cpp","measured_fast_code_id":"d0b40895d4cd7faa61f152aeb8191440dd5c379faefc07ba656d4a01628067c2","measured_slow_code_id":"683dd0771e8323bbc435aba81287ed6580a7886162920e652828a590c297a8d3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37768","problem_id":"p00453","slow_code_id":"7d97a9bdc23ef16b98834c05d1fd4d06ba8f9b109f82fb2e1e970a65c12d92e1","slow_id":"683dd0771e8323bbc435aba81287ed6580a7886162920e652828a590c297a8d3","slow_time":0.2361550391,"speedup":5.096948465412356,"stratum":"4-8","sampling_key":"10d2795e8b2bbfe530c061f36be3626294c4018290ed9db21b374d2e7de3d18a","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <vector>\n\n#include <string>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i, j) REP((i), 0, (j))\n\n#define REP(i, j, k) for (int i = (j); (i) < (k); ++i)\n\n#define BW(a, x, b) ((a) <= (x) && (x) <= (b))\n\n#define ALL(v) (v).begin(), (v).end()\n\n#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))\n\n#define AFILL(a, b) fill((int *)a, (int *)(a + LENGTHOF(a)), b)\n\n#define SQ(x) ((x) * (x))\n\n#define Mod(x, mod) (((x)+(mod)%(mod))\n\n#define MP make_pair\n\n#define PB push_back\n\n#define F first\n\n#define S second\n\n#define INF 1LL << 60\n\n#define EPS 1e-10\n\n#define MOD 1000000007\n\ntypedef pair<int, int> P;\n\ntypedef vector<int> vi;\n\ntypedef queue<int> qi;\n\ntypedef long long ll;\n\nvector<P> St[256];\n\nint N, M;\n\nll dp[256][16][128];\n\nll dfs(int n, int x, int m) {\n\n  if (n >= N - 1)\n    return 0;\n\n  if (n >= N - 2 && m)\n    return 0;\n\n  ll &res = dp[n][x][m];\n\n  if (res >= 0)\n    return res;\n\n  res = INF;\n\n  int pos = St[n][x].first, slip = St[n][x].second;\n\n  rep(i, St[n + 1].size()) {\n\n    P tar = St[n + 1][i];\n\n    res = min(res, dfs(n + 1, i, m) + (ll)(slip + tar.second) * (ll)(abs(pos - tar.first)));\n  }\n\n  if (m && n < N - 2) {\n\n    rep(i, St[n + 2].size()) {\n\n      P tar = St[n + 2][i];\n\n      res = min(res, dfs(n + 2, i, m - 1) + (ll)(slip + tar.second) * (ll)(abs(pos - tar.first)));\n    }\n  }\n\n  return res;\n}\n\nint main() {\n\n  while (scanf(\"%d%d\", &N, &M) && N) {\n\n    int k, x, d;\n\n    memset(dp, -1, sizeof(dp));\n\n    rep(i, N) St[i].clear();\n\n    rep(i, N) {\n\n      scanf(\"%d\", &k);\n\n      rep(j, k) {\n\n        scanf(\"%d%d\", &x, &d);\n\n        St[i].push_back(P(x, d));\n      }\n    }\n\n    ll res = INF;\n\n    rep(i, St[0].size()) res = min(res, dfs(0, i, M));\n\n    if (M)\n      rep(i, St[1].size()) res = min(res, dfs(1, i, M - 1));\n\n    printf(\"%lld\\n\", res);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\nconst int INF = 1 << 29;\n\nint N, M;\n\nint dp[256][128][16];\n\nvector<P> s[151];\n\nint main() {\n\n  while (scanf(\"%d%d\", &N, &M) && N || M) {\n\n    for (int i = 0; i < 151; i++)\n      s[i].clear();\n\n    for (int i = 0; i < 151; i++)\n      for (int j = 0; j < 76; j++)\n        for (int k = 0; k < 11; k++)\n          dp[i][j][k] = INF;\n\n    for (int i = 0; i < N; i++) {\n\n      int k;\n\n      scanf(\"%d\", &k);\n\n      for (int j = 0; j < k; j++) {\n\n        int x, d;\n        scanf(\"%d%d\", &x, &d);\n\n        s[i].push_back(P(x, d));\n      }\n    }\n\n    for (int i = 0; i < s[0].size(); i++)\n      dp[0][M][i] = min(dp[0][M][i], 0);\n\n    if (M)\n      for (int i = 0; i < s[1].size(); i++)\n        dp[1][M - 1][i] = min(dp[1][M - 1][i], 0);\n\n    for (int i = 0; i < N - 1; i++) {\n\n      for (int j = 0; j < s[i].size(); j++) {\n\n        for (int m = 0; m <= M; m++) {\n\n          if (dp[i][m][j] == INF)\n            continue;\n\n          for (int k = 0; k < s[i + 1].size(); k++) {\n\n            dp[i + 1][m][k] = min(dp[i + 1][m][k],\n\n                                  dp[i][m][j] + (s[i + 1][k].second + s[i][j].second) *\n                                                    abs(s[i + 1][k].first - s[i][j].first));\n          }\n\n          if (i + 2 < N && m)\n            for (int k = 0; k < s[i + 2].size(); k++) {\n\n              dp[i + 2][m - 1][k] = min(dp[i + 2][m - 1][k],\n\n                                        dp[i][m][j] + (s[i + 2][k].second + s[i][j].second) *\n                                                          abs(s[i + 2][k].first - s[i][j].first));\n            }\n        }\n      }\n    }\n\n    int res = INF;\n\n    for (int i = 0; i < s[N - 1].size(); i++)\n      for (int m = 0; m <= M; m++)\n        res = min(res, dp[N - 1][m][i]);\n\n    for (int i = 0; i < s[N - 2].size(); i++)\n      for (int m = 1; m <= M; m++)\n        res = min(res, dp[N - 2][m][i]);\n\n    printf(\"%d\\n\", res);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"a3929a431fc5a6a42121d4601c1c957bb02d3cb3adc5eff96e8b7dd003b1cac4","fast_id":"cbda78967fe21a1b68e1dbb9585734bfdce240a7024e31c90d3b48a85af3f580","fast_time":0.0066999172,"language":"cpp","measured_fast_code_id":"cbda78967fe21a1b68e1dbb9585734bfdce240a7024e31c90d3b48a85af3f580","measured_slow_code_id":"7d8f9280d692ade17b062f9cb3bb86efdb745f86984a5f71dcdd71573960c13c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37773","problem_id":"p03804","slow_code_id":"364f644b360a3e21dd55c7e3d2c6d8b93a185112a0c1f19d62c8f94f54698ba3","slow_id":"7d8f9280d692ade17b062f9cb3bb86efdb745f86984a5f71dcdd71573960c13c","slow_time":0.0352866222,"speedup":5.266725117140254,"stratum":"4-8","sampling_key":"4e556446cfb8e2bd55d1b189f80f935d2cf0dc448a4dc978ae7080f71f81ff6b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, m;\n\nstatic bool mp[55][55], mp1[55][55];\n\nbool is_cmp()\n\n{\n\n  for (int i = 1; i <= n - m + 1; i++)\n\n    for (int j = 1; j <= n - m + 1; j++)\n\n    {\n\n      int flag = 1;\n\n      for (int h = 1; h <= m; h++)\n\n        for (int k = 1; k <= m; k++)\n\n          if (mp[i + h - 1][j + k - 1] != mp1[h][k])\n            flag = 0;\n\n      if (flag)\n        return true;\n    }\n\n  return false;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  getchar();\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    for (int j = 1; j <= n; j++)\n\n    {\n\n      char c;\n\n      scanf(\"%c\", &c);\n\n      if (c == '#')\n        mp[i][j] = 1;\n    }\n\n    getchar();\n  }\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    for (int j = 1; j <= m; j++)\n\n    {\n\n      char c;\n\n      scanf(\"%c\", &c);\n\n      if (c == '#')\n        mp1[i][j] = 1;\n    }\n\n    getchar();\n  }\n\n  if (is_cmp())\n    printf(\"Yes\");\n\n  else\n    printf(\"No\");\n}","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <string>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int MaxN = 1e5;\n\nconst int Inf = 1 << 30;\n\nchar s[55][55], t[55][55];\n\nint main()\n\n{\n\n  int N, M, pos;\n\n  bool ok;\n\n  while (~scanf(\"%d%d\", &N, &M)) {\n\n    ok = false;\n\n    for (int i = 1; i <= N; i++)\n      scanf(\"%s\", s[i] + 1);\n\n    for (int i = 1; i <= M; i++)\n      scanf(\"%s\", t[i] + 1);\n\n    for (int i = 1; i <= N - M + 1; i++) {\n\n      for (int j = 1; j <= N - M + 1; j++) {\n\n        pos = 0;\n\n        for (int k = 0; k < M; k++) {\n\n          for (int l = 0; l < M; l++) {\n\n            if (s[i + k][j + l] == t[k + 1][l + 1])\n              pos++;\n\n            else {\n\n              pos = 0;\n\n              break;\n            }\n          }\n\n          if (!pos)\n            break;\n        }\n\n        if (pos == M * M) {\n\n          ok = true;\n\n          break;\n        }\n      }\n\n      if (ok)\n        break;\n    }\n\n    if (ok)\n      printf(\"Yes\\n\");\n\n    else\n      printf(\"No\\n\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"37b93470f2f9f84f2640266d1930e47282867358342477c3876f2cde6343401b","fast_id":"de1df215224bac802a1b19a26e3abd2fada15c78f550a7c9d98242f4137dd579","fast_time":0.0010248347,"language":"cpp","measured_fast_code_id":"de1df215224bac802a1b19a26e3abd2fada15c78f550a7c9d98242f4137dd579","measured_slow_code_id":"81051311fb71d49f593fecc1a988343cffe4cd67c3b4dac67db0454e9412a9d4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37789","problem_id":"p03701","slow_code_id":"b0e1fe5eed50b7130675a3546290a79336d8ff7eb976d296650a9864e242e350","slow_id":"81051311fb71d49f593fecc1a988343cffe4cd67c3b4dac67db0454e9412a9d4","slow_time":0.0058860087,"speedup":5.74337373627181,"stratum":"4-8","sampling_key":"7e0a3789b6efc02a6789ff39efb0b87069fb4af0274544c4dcd44e9056f9b226","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <map>\n\n#include <math.h>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <cstdio>\n\n#include <utility>\n\n#include <set>\n\n#include <list>\n\n#include <cmath>\n\n#include <stdio.h>\n\n#include <string.h>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)\n\n#define REP(i, n) FOR(i, 0, n - 1)\n\n#define NREP(i, n) FOR(i, 1, n)\n\nusing ll = long long;\n\nusing pii = pair<int, int>;\n\nusing piii = pair<pii, pii>;\n\nconst int dx[4] = {0, -1, 1, 0};\n\nconst int dy[4] = {-1, 0, 0, 1};\n\nconst int INF = 1e9 + 7;\n\nint gcd(int x, int y) {\n\n  if (x < y)\n    swap(x, y);\n\n  if (y == 0)\n    return x;\n\n  return gcd(y, x % y);\n}\n\ntemplate <class T1, class T2> void chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <class T1, class T2> void chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\ntemplate <class T>\n\nvoid Add(T &a, const T &b, const T &mod = 1000000007) {\n\n  int val = ((a % mod) + (b % mod)) % mod;\n\n  if (val < 0) {\n    val += mod;\n  }\n\n  a = val;\n}\n\nint main() {\n\n  int N;\n\n  int s[110];\n\n  int dp[110][10010];\n\n  cin >> N;\n\n  for (int i = 0; i < N; ++i)\n    cin >> s[i];\n\n  memset(dp, 0, sizeof(dp));\n\n  dp[0][0] = 1;\n\n  for (int i = 0; i < N; ++i) {\n\n    for (int j = 0; j <= 10000; ++j) {\n\n      if (dp[i][j] == 0)\n        continue;\n\n      dp[i + 1][j] = 1;\n\n      dp[i + 1][j + s[i]] = 1;\n    }\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i <= 10000; ++i) {\n\n    if (dp[N][i] == 1) {\n\n      if (i % 10 != 0) {\n\n        ans = max(ans, i);\n      }\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <map>\n\n#include <math.h>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <cstdio>\n\n#include <utility>\n\n#include <set>\n\n#include <list>\n\n#include <cmath>\n\n#include <stdio.h>\n\n#include <string.h>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)\n\n#define REP(i, n) FOR(i, 0, n - 1)\n\n#define NREP(i, n) FOR(i, 1, n)\n\nusing ll = long long;\n\nusing pii = pair<int, int>;\n\nusing piii = pair<pii, pii>;\n\nconst int dx[4] = {0, -1, 1, 0};\n\nconst int dy[4] = {-1, 0, 0, 1};\n\nconst int INF = 1e9 + 7;\n\nint gcd(int x, int y) {\n\n  if (x < y)\n    swap(x, y);\n\n  if (y == 0)\n    return x;\n\n  return gcd(y, x % y);\n}\n\ntemplate <class T1, class T2> void chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <class T1, class T2> void chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\ntemplate <class T>\n\nvoid Add(T &a, const T &b, const T &mod = 1000000007) {\n\n  int val = ((a % mod) + (b % mod)) % mod;\n\n  if (val < 0) {\n    val += mod;\n  }\n\n  a = val;\n}\n\nint main() {\n\n  int N;\n\n  cin >> N;\n\n  int sum = 0;\n\n  vector<int> V;\n\n  for (int i = 0; i < N; ++i) {\n\n    int s;\n\n    cin >> s;\n\n    sum += s;\n\n    V.push_back(s);\n  }\n\n  sort(V.begin(), V.end());\n\n  if (sum % 10 != 0) {\n\n    cout << sum << endl;\n\n  }\n\n  else {\n\n    for (int i = 0; i < N; ++i) {\n\n      if ((sum - V[i]) % 10 != 0) {\n\n        cout << sum - V[i] << endl;\n\n        return 0;\n      }\n    }\n\n    cout << 0 << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"6a0d212a18b28d5c64d7413bd944947ee3042b8e6af01d8ccc58b2031317effa","fast_id":"4b1f010422f6cf401ec573290d1c89dcb4f33ee9369b6665be13098dcaccaf52","fast_time":0.0194983798,"language":"cpp","measured_fast_code_id":"4b1f010422f6cf401ec573290d1c89dcb4f33ee9369b6665be13098dcaccaf52","measured_slow_code_id":"11109de0561af776a245431f402309b1d80927717a380bf97a156f333820ab01","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37820","problem_id":"p03623","slow_code_id":"3d542fef94a1ca88041838e561db2629a974abe0fa2afcd8478a1c66e4f7321c","slow_id":"11109de0561af776a245431f402309b1d80927717a380bf97a156f333820ab01","slow_time":0.1040037822,"speedup":5.333970476870084,"stratum":"4-8","sampling_key":"01640377ce6ec4af26cc171552ddc0b7bbf8f8a8a493cf859ba851fb54eab1c3","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cmath>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int x = 0, A = 0, B = 0;\n\n  cin >> x >> A >> B;\n\n  if (abs(x - A) > abs(x - B))\n\n  {\n\n    cout << \"B\";\n\n  } else\n\n  {\n\n    cout << \"A\";\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int n, a, b;\n\n  scanf(\"%d %d %d\", &n, &a, &b);\n\n  int a1 = a - n;\n\n  int b1 = b - n;\n\n  if (a1 < 0) {\n\n    a1 *= -1;\n  }\n\n  if (b1 < 0) {\n\n    b1 *= -1;\n  }\n\n  if (a1 < b1) {\n\n    printf(\"A\");\n\n  }\n\n  else {\n\n    printf(\"B\");\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"8a677b9369f7f2d617995e5340589793b095ab5b323aa78cb3f3cb42a4cda3c4","fast_id":"e72bd29b2b12a7ed7ce54116bda78f53d4b71966dc487b4016532e85996605c5","fast_time":0.0966856402,"language":"cpp","measured_fast_code_id":"e72bd29b2b12a7ed7ce54116bda78f53d4b71966dc487b4016532e85996605c5","measured_slow_code_id":"77a473d9372fdd2fc672d89cd18cba1226cd4406d80301d7dff840ef795d0d06","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37873","problem_id":"p03683","slow_code_id":"3ca6a1cc75f5c4712525dd4f132322019986576b788a810b8ef4165df0e5564a","slow_id":"77a473d9372fdd2fc672d89cd18cba1226cd4406d80301d7dff840ef795d0d06","slow_time":0.2262939605,"speedup":2.3405126141989387,"stratum":"2-4","sampling_key":"0b6c61ab9ba799098a5e6fb36e449ea068ccb5500f89b261b41a8e287bf9a870","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing VI = vector<int>;\n\nusing VVI = vector<VI>;\n\nusing PII = pair<int, int>;\n\nusing LL = long long;\n\nusing VL = vector<LL>;\n\nusing VVL = vector<VL>;\n\nusing PLL = pair<LL, LL>;\n\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)), end((a))\n\n#define RALL(a) (a).rbegin(), (a).rend()\n\n#define PB push_back\n\n#define EB emplace_back\n\n#define MP make_pair\n\n#define SZ(a) int((a).size())\n\n#define SORT(c) sort(ALL((c)))\n\n#define RSORT(c) sort(RALL((c)))\n\n#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))\n\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define FF first\n\n#define SS second\n\ntemplate <class S, class T>\n\nistream &operator>>(istream &is, pair<S, T> &p) {\n\n  return is >> p.FF >> p.SS;\n}\n\ntemplate <class S, class T>\n\nostream &operator<<(ostream &os, const pair<S, T> &p) {\n\n  return os << p.FF << \" \" << p.SS;\n}\n\ntemplate <class T>\n\nvoid maxi(T &x, T y) {\n\n  if (x < y)\n    x = y;\n}\n\ntemplate <class T>\n\nvoid mini(T &x, T y) {\n\n  if (x > y)\n    x = y;\n}\n\nconst double EPS = 1e-10;\n\nconst double PI = acos(-1.0);\n\nconst LL MOD = 1e9 + 7;\n\nint main() {\n\n  cin.tie(0);\n\n  ios_base::sync_with_stdio(false);\n\n  LL N, M;\n\n  cin >> N >> M;\n\n  VL fact(100010);\n\n  fact[0] = 1;\n\n  for (LL i = 1; i < 100010; ++i)\n\n    fact[i] = (fact[i - 1] * i) % MOD;\n\n  if (abs(N - M) > 1) {\n\n    cout << 0 << endl;\n\n  }\n\n  else if (N == M) {\n\n    cout << fact[N] * fact[M] * 2 % MOD << endl;\n\n  }\n\n  else {\n\n    if (N > M)\n      swap(N, M);\n\n    cout << fact[N] * fact[M] % MOD << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main()\n\n{\n\n  ll n, m;\n\n  cin >> n >> m;\n\n  if (abs(n - m) > 1)\n\n  {\n\n    cout << 0 << endl;\n\n    return 0;\n  }\n\n  if (n == m)\n\n  {\n\n    ll brojac = 1;\n\n    for (ll i = 1; i <= n; i++)\n\n    {\n\n      brojac *= i;\n\n      brojac %= 1000000007;\n    }\n\n    for (ll i = 1; i <= n; i++)\n\n    {\n\n      brojac *= i;\n\n      brojac %= 1000000007;\n    }\n\n    brojac *= 2;\n\n    brojac %= 1000000007;\n\n    cout << brojac << endl;\n\n  }\n\n  else\n\n  {\n\n    ll brojac = 1;\n\n    if (n < m)\n\n      swap(n, m);\n\n    for (ll i = 1; i <= n; i++)\n\n    {\n\n      brojac *= i;\n\n      brojac %= 1000000007;\n    }\n\n    for (ll i = 1; i <= m; i++)\n\n    {\n\n      brojac *= i;\n\n      brojac %= 1000000007;\n    }\n\n    cout << brojac << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"58f51cf3213d0542348c647eea01e4dfc6685f48cba16a3e49f7a6f44e2425f8","fast_id":"52b7ef8f1339e654419c5fd550c63cdd129071df8c338250477d6cf1fc3aefe8","fast_time":0.0219744268,"language":"cpp","measured_fast_code_id":"52b7ef8f1339e654419c5fd550c63cdd129071df8c338250477d6cf1fc3aefe8","measured_slow_code_id":"2e6d31c71b74ea8d63dd2b83b92a3eaa7e21dda9edb5856d51e9d75a66757f28","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37905","problem_id":"p03576","slow_code_id":"ee6149673117414a4bf5eb6353df45bd4ff09417cf97ece31ddfd4d25aafd4f0","slow_id":"2e6d31c71b74ea8d63dd2b83b92a3eaa7e21dda9edb5856d51e9d75a66757f28","slow_time":0.1064752835,"speedup":4.845418015636249,"stratum":"4-8","sampling_key":"3165407b7421f4e6c4fa9ba4688729517a78f37c8ecd7e1dea4a6866e342bf0e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll unsigned long long\n\nstruct ac {\n\n  int x, y;\n\n} a[55], d[55];\n\nint cmp1(ac b, ac c)\n\n{\n\n  return b.x < c.x;\n}\n\nint cmp2(ac b, ac c)\n\n{\n\n  return b.y < c.y;\n}\n\nint sl(int x1, int y1, int x2, int y2, int i)\n\n{\n\n  int xl = min(x1, x2), xr = max(x1, x2);\n\n  int yl = min(y1, y2), yr = max(y1, y2);\n\n  if (a[i].x >= xl && a[i].x <= xr && a[i].y >= yl && a[i].y <= yr)\n\n  {\n\n    return 1;\n  }\n\n  return 0;\n}\n\nint main()\n\n{\n\n  ll maxx = 1ll * 10e9 * 10e9 * 4 + 2;\n\n  int n, k1;\n\n  cin >> n >> k1;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> a[i].x >> a[i].y;\n\n    d[i].x = a[i].x, d[i].y = a[i].y;\n  }\n\n  sort(a + 1, a + 1 + n, cmp1);\n\n  sort(d + 1, d + n + 1, cmp2);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    for (int j = i + 1; j <= n; j++)\n\n    {\n\n      for (int k = 1; k <= n; k++)\n\n      {\n\n        for (int l = k + 1; l <= n; l++)\n\n        {\n\n          int flag = 0;\n\n          for (int u = 1; u <= n; u++)\n\n          {\n\n            if (sl(a[i].x, d[k].y, a[j].x, d[l].y, u))\n\n            {\n\n              flag++;\n            }\n          }\n\n          if (flag >= k1)\n\n          {\n\n            maxx =\n                min(maxx, (ll)abs(1ll * a[i].x - 1ll * a[j].x) * abs(1ll * d[k].y - 1ll * d[l].y));\n          }\n        }\n      }\n    }\n  }\n\n  cout << maxx << endl;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\nstruct node\n\n{\n\n  long long x, y;\n\n  int a, b;\n\n} point[55];\n\nint incx(const void *a, const void *b)\n\n{\n\n  struct node m = *(struct node *)a;\n\n  struct node n = *(struct node *)b;\n\n  if (m.x < n.x)\n    return -1;\n\n  else\n    return 1;\n}\n\nint incy(const void *a, const void *b)\n\n{\n\n  struct node m = *(struct node *)a;\n\n  struct node n = *(struct node *)b;\n\n  if (m.y < n.y)\n    return -1;\n\n  else\n    return 1;\n}\n\nint main()\n\n{\n\n  int n, k, mp[55][55], xmax, ymax, temp;\n\n  bool np[55][55];\n\n  long long x[55], y[55], S, min = -1, xx[55], yy[55], Smax = -1;\n\n  for (int i = 0; i < 55; i++)\n\n  {\n\n    for (int j = 0; j < 55; j++)\n\n    {\n\n      mp[i][j] = 0;\n\n      np[i][j] = false;\n    }\n  }\n\n  scanf(\"%d%d\", &n, &k);\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%lld%lld\", &point[i].x, &point[i].y);\n\n  qsort(point, n, sizeof(struct node), incx);\n\n  temp = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    point[i].a = temp;\n\n    xx[temp] = point[i].x;\n\n    temp++;\n  }\n\n  qsort(point, n, sizeof(struct node), incy);\n\n  temp = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    point[i].b = temp;\n\n    np[point[i].a][point[i].b] = true;\n\n    yy[temp] = point[i].y;\n\n    temp++;\n  }\n\n  if (np[0][0] == false)\n    mp[0][0] = 0;\n\n  else\n    mp[0][0] = 1;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    for (int j = 0; j < n; j++)\n\n    {\n\n      if (i == 0)\n        mp[i][j] = mp[i][j - 1] + np[i][j];\n\n      else if (j == 0)\n        mp[i][j] = mp[i - 1][j] + np[i][j];\n\n      else\n        mp[i][j] = mp[i - 1][j] + mp[i][j - 1] - mp[i - 1][j - 1] + np[i][j];\n    }\n  }\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    for (int j = 0; j < n; j++)\n\n    {\n\n      for (int p = i + 1; p < n; p++)\n\n      {\n\n        for (int q = j + 1; q < n; q++)\n\n        {\n\n          int sum;\n\n          if (i == 0)\n            sum = mp[p][q] - mp[p][j - 1];\n\n          else if (j == 0)\n            sum = mp[p][q] - mp[i - 1][q];\n\n          else\n            sum = mp[p][q] - mp[i - 1][q] - mp[p][j - 1] + mp[i - 1][j - 1];\n\n          if (sum >= k)\n\n          {\n\n            if ((xx[p] - xx[i]) * (yy[q] - yy[j]) <= Smax || Smax < 0)\n              Smax = (xx[p] - xx[i]) * (yy[q] - yy[j]);\n          }\n        }\n      }\n    }\n  }\n\n  printf(\"%lld\\n\", Smax);\n}"}
{"fast_code_id":"c9a21b82326959dd426008f4e25d8d4fae5ca13e2eb91c4d6eb9783638a231d5","fast_id":"239a2108e01c135c8868e0a05ebe3369172f468a3e1046978c38792b52e96e5a","fast_time":0.0200480643,"language":"cpp","measured_fast_code_id":"239a2108e01c135c8868e0a05ebe3369172f468a3e1046978c38792b52e96e5a","measured_slow_code_id":"ceb45f72a42d81ad31de27e0a06c0323707c65d8304573753dd1a8432ae36f06","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37914","problem_id":"p00225","slow_code_id":"96c308a5fac44fa58359bc45d3b34f00c61ec896134a31f92fe3c2fe44b9848e","slow_id":"ceb45f72a42d81ad31de27e0a06c0323707c65d8304573753dd1a8432ae36f06","slow_time":0.104437343,"speedup":5.209347966825904,"stratum":"4-8","sampling_key":"94eee9c9ee5585444f8a6feb19621f3d5ec72b13134151fcd57e763e0568d5d2","slow_code":"#include <iostream>\n\nusing namespace std;\n\nbool visit[26], g[26][26];\n\nbool dfs(int v) {\n\n  visit[v] = true;\n\n  bool f = false;\n\n  for (int i = 0; i < 26; i++)\n\n    if (g[v][i]) {\n\n      f = true;\n\n      if (!visit[i])\n        dfs(i);\n    }\n\n  return f;\n}\n\nint graph_num(void) {\n\n  int res = 0;\n\n  for (int i = 0; i < 26; i++)\n\n    if (!visit[i] && dfs(i))\n      res++;\n\n  return res;\n}\n\nint main() {\n\n  int i, n, pre[26], suf[26], h, t;\n\n  string s;\n\n  while (cin >> n && n) {\n\n    for (i = 0; i < 26; i++) {\n\n      visit[i] = false;\n\n      pre[i] = suf[i] = 0;\n\n      for (int j = 0; j < 26; j++)\n        g[i][j] = false;\n    }\n\n    for (i = 0; i < n; i++) {\n\n      cin >> s;\n\n      h = s[0] - 'a', t = s[(int)s.size() - 1] - 'a';\n\n      pre[h]++;\n\n      suf[t]++;\n\n      g[h][t] = g[t][h] = true;\n    }\n\n    if (graph_num() != 1)\n      printf(\"NG\\n\");\n\n    else {\n\n      for (i = 0; i < 26; i++)\n        if (pre[i] != suf[i])\n          break;\n\n      if (i == 26)\n        printf(\"OK\\n\");\n\n      else\n        printf(\"NG\\n\");\n    }\n  }\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\nbool visit[26], g[26][26];\n\nbool dfs(int v) {\n\n  visit[v] = true;\n\n  bool f = false;\n\n  for (int i = 0; i < 26; i++)\n\n    if (g[v][i]) {\n\n      f = true;\n\n      if (!visit[i])\n        dfs(i);\n    }\n\n  return f;\n}\n\nint graph_num(void) {\n\n  int res = 0;\n\n  for (int i = 0; i < 26; i++)\n\n    if (!visit[i] && dfs(i))\n      res++;\n\n  return res;\n}\n\nint main() {\n\n  int i, n, pre[26], suf[26], h, t;\n\n  while (scanf(\"%d\", &n) && n) {\n\n    for (i = 0; i < 26; i++) {\n\n      visit[i] = false;\n\n      pre[i] = suf[i] = 0;\n\n      for (int j = 0; j < 26; j++)\n        g[i][j] = false;\n    }\n\n    for (i = 0; i < n; i++) {\n\n      char s[40];\n\n      scanf(\"%s\", s);\n\n      int len = strlen(s);\n\n      h = s[0] - 'a';\n\n      t = s[len - 1] - 'a';\n\n      pre[h]++;\n\n      suf[t]++;\n\n      g[h][t] = g[t][h] = true;\n    }\n\n    if (graph_num() != 1)\n      printf(\"NG\\n\");\n\n    else {\n\n      for (i = 0; i < 26; i++)\n        if (pre[i] != suf[i])\n          break;\n\n      if (i == 26)\n        printf(\"OK\\n\");\n\n      else\n        printf(\"NG\\n\");\n    }\n  }\n}"}
{"fast_code_id":"2be76ef368632deb4a0de9fac6b429d1fc32225725a6e236577539ff67abc4d0","fast_id":"c7d2781632585ed40f61f744e98736e5a377d3e332f1d457095e49e56461e5f5","fast_time":0.1123591254,"language":"cpp","measured_fast_code_id":"c7d2781632585ed40f61f744e98736e5a377d3e332f1d457095e49e56461e5f5","measured_slow_code_id":"5b1be56676e07054aec95578c89a961d9558d04e5420b9aad8e20e33e6184ba3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37948","problem_id":"p03767","slow_code_id":"f93ae1df4f4627884f3a2cb1d9f4a9509d7c847c2d2b47dbbd2dbd39283b69fd","slow_id":"5b1be56676e07054aec95578c89a961d9558d04e5420b9aad8e20e33e6184ba3","slow_time":0.2624052171,"speedup":2.335415269261254,"stratum":"2-4","sampling_key":"affbe30f415813f2b2be0476c5e86af28f301074dd5a6be84f2e412229939d45","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <string>\n\n#include <vector>\n\n#include <math.h>\n\n#include <map>\n\n#include <functional>\n\n#include <queue>\n\n#include <stack>\n\nusing namespace std;\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  int a[364364] = {};\n\n  long long int ans = 0;\n\n  for (int i = 0; i < 3 * n; i++) {\n\n    cin >> a[i];\n  }\n\n  sort(a, a + (3 * n), greater<int>());\n\n  for (int i = 1; i <= 2 * n - 1; i += 2) {\n\n    ans += a[i];\n  }\n\n  cout << ans << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define all(vec) vec.begin(), vec.end()\n\ntypedef long long int ll;\n\ntypedef pair<int, int> P;\n\nconst ll MOD = 1000000007;\n\nconst ll INF = 1000000010;\n\nconst ll LINF = 4000000000000000010LL;\n\nconst int MAX = 310;\n\nconst double EPS = 1e-9;\n\nint dx[4] = {0, 1, 0, -1};\n\nint dy[4] = {1, 0, -1, 0};\n\nint main() {\n\n  int n;\n  cin >> n;\n\n  ll a[300010];\n\n  for (int i = 0; i < 3 * n; i++) {\n\n    cin >> a[i];\n  }\n\n  sort(a, a + 3 * n);\n\n  ll ans = 0;\n\n  for (int i = n; i < 3 * n - 1; i += 2) {\n\n    ans += a[i];\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"403bf776ed61a83e6a0d114133180ad10a0e4fbc03a756327eebaf6dcb706bc4","fast_id":"1becaa9846d0fba4c342a1cdf3f33124b496e9689dab2854d4e34e5b4fdd3b85","fast_time":0.0202520226,"language":"cpp","measured_fast_code_id":"1becaa9846d0fba4c342a1cdf3f33124b496e9689dab2854d4e34e5b4fdd3b85","measured_slow_code_id":"31964a716efa102cf0ae89f641554bec28614ab73b444a92fb97a2a8d6b324f0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_37998","problem_id":"p02996","slow_code_id":"4623b9b395a83710fec850913837c711da3fca77815b1a99d18ab9c7bf80f00b","slow_id":"31964a716efa102cf0ae89f641554bec28614ab73b444a92fb97a2a8d6b324f0","slow_time":0.4545739527,"speedup":22.44585450442861,"stratum":"8+","sampling_key":"4d6778363fb27c325ded3e523038a831183cdef91c3f94140e464197d21f862a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define sz(a) int(a.size())\n\n#define ll long long\n\n#define ull unsigned long long\n\n#define mod (ll)(1000000007)\n\n#define endl '\\n'\n\n#define ENGZ                                                                   \\\n  ios::sync_with_stdio(0);                                                     \\\n  ios_base::sync_with_stdio(0);                                                \\\n  cin.tie(0), cout.tie(0);\n\n#define pi double(acos(-1))\n\n#define S second\n\n#define F first\n\n#define mem(arr, a) memset(arr, a, sizeof arr)\n\nll fp(ll n, ll p)\n\n{\n\n  if (p == 0)\n\n    return 1;\n\n  if (p == 1)\n\n    return n % mod;\n\n  ll res;\n\n  res = fp(n, p / 2) % mod;\n\n  res = (res * res) % mod;\n\n  if (p % 2)\n\n    res = (res * n) % mod;\n\n  return res;\n}\n\nint main()\n\n{\n\n  ENGZ;\n\n  pair<ll, ll> arr[200005];\n\n  ll n, a = 0, b;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> arr[i].S >> arr[i].F;\n  }\n\n  sort(arr, arr + n);\n\n  bool f = 1;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    a += arr[i].S;\n\n    if (a > arr[i].F)\n\n      f = 0;\n  }\n\n  if (f)\n    cout << \"Yes\" << endl;\n\n  else\n    cout << \"No\" << endl;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nstruct node {\n\n  int x, y;\n\n} a[200008];\n\nbool cmp(node q, node p) {\n\n  if (q.y == p.y)\n\n    return q.x < p.x;\n\n  else\n\n    return q.y < p.y;\n}\n\nint main() {\n\n  int n;\n\n  while (~scanf(\"%d\", &n)) {\n\n    for (int i = 0; i < n; i++)\n\n      scanf(\"%d%d\", &a[i].x, &a[i].y);\n\n    sort(a, a + n, cmp);\n\n    int t = 0, i;\n\n    for (i = 0; i < n; i++) {\n\n      if (t + a[i].x <= a[i].y)\n\n        t += a[i].x;\n\n      else\n\n        break;\n    }\n\n    if (i == n) {\n\n      printf(\"Yes\\n\");\n\n    }\n\n    else\n\n      printf(\"No\\n\");\n  }\n}\n"}
{"fast_code_id":"f2a8cb6566d83bf4b6acb2264313baf0aa6f92f4d02855d646515567cf9b5a4c","fast_id":"0c4034805e6c06331cbe11a71afd7e18d2644a401bf7b9938a556933db9a48c6","fast_time":0.1085450987,"language":"cpp","measured_fast_code_id":"0c4034805e6c06331cbe11a71afd7e18d2644a401bf7b9938a556933db9a48c6","measured_slow_code_id":"8843c237474cd93f3d4827b80b9e47a9d0d5c7c0dfc1c0a9c3d7eb0b4432a081","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38089","problem_id":"p02815","slow_code_id":"26ff0c6f561becc957be8a2d1c4c2e48a8633e50d4923af81473f3dbac4f32b4","slow_id":"8843c237474cd93f3d4827b80b9e47a9d0d5c7c0dfc1c0a9c3d7eb0b4432a081","slow_time":0.2770818633,"speedup":2.5526888511641292,"stratum":"2-4","sampling_key":"20706f0c9a098a3fbb1ec10b82863864ed5738bfd3aea6c6fd540c4e25dd3408","slow_code":"#include <bits/stdc++.h>\n\n#define debug1 cout << \"?\" << endl;\n\n#define debug2 cout << \"?\" << i << endl;\n\n#define PII pair<int, int>\n\ntypedef long long ll;\n\nconst int maxn = 2e5 + 9;\n\nconst double pi = acos(-1);\n\nconst int mod = 1e9 + 7;\n\nconst int INF = 1e9;\n\nconst double ep = 1e-7;\n\nusing namespace std;\n\nll kpow(ll a, ll b)\n\n{\n\n  ll ans = 1;\n\n  while (b)\n\n  {\n\n    if (b & 1)\n      ans = (ans * a) % mod;\n\n    a = (a * a) % mod;\n\n    b >>= 1;\n  }\n\n  return ans;\n}\n\nint main()\n\n{\n\n  ll n, i, a[maxn] = {0}, ans = 0;\n\n  scanf(\"%lld\", &n);\n\n  for (i = 1; i <= n; i++)\n    scanf(\"%lld\", &a[i]);\n\n  sort(a + 1, a + 1 + n);\n\n  for (ll i = 1; i <= n; i++)\n    ans = (ans + (((a[i] * kpow(2, n - 1)) % mod * kpow(2, i - 1)) % mod * (n - i + 2)) % mod *\n                     kpow(2, n - i)) %\n          mod;\n\n  printf(\"%lld\\n\", ans);\n}","fast_code":"#include <bits/stdc++.h>\n\ntypedef long long ll;\n\nconst int maxn = 2e5 + 9;\n\nconst int mod = 1e9 + 7;\n\nusing namespace std;\n\nll kpow(ll a, ll b)\n\n{\n\n  ll ans = 1;\n\n  while (b)\n\n  {\n\n    if (b & 1)\n      ans = (ans * a) % mod;\n\n    a = (a * a) % mod;\n\n    b >>= 1;\n  }\n\n  return ans;\n}\n\nint main()\n\n{\n\n  ll n, i, a[maxn], ans = 0;\n\n  scanf(\"%lld\", &n);\n\n  for (i = 1; i <= n; i++)\n    scanf(\"%lld\", &a[i]);\n\n  sort(a + 1, a + 1 + n);\n\n  for (ll i = 1; i <= n; i++)\n    ans = (ans + (((a[i] * kpow(2, n - 1)) % mod * kpow(2, i - 1)) % mod * (n - i + 2)) % mod *\n                     kpow(2, n - i)) %\n          mod;\n\n  printf(\"%lld\\n\", ans);\n}"}
{"fast_code_id":"0fbc4883edb18160a59beb3db99d862b55fb781ce770280dc200f20af076573b","fast_id":"17eed0afa77d938e3dbf15ec6dfa158eb32486e118eeb18e4f7972eb0c812896","fast_time":0.1092938913,"language":"cpp","measured_fast_code_id":"17eed0afa77d938e3dbf15ec6dfa158eb32486e118eeb18e4f7972eb0c812896","measured_slow_code_id":"2787feb951cae19bf0e8916c175dfd8a3f2e5c1b97b607f589b612d9994f349a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38136","problem_id":"p04035","slow_code_id":"ea41eea09dc357cdc004c775fac809457f556bdfa167253304e23bf40d93c63a","slow_id":"2787feb951cae19bf0e8916c175dfd8a3f2e5c1b97b607f589b612d9994f349a","slow_time":0.3759293672,"speedup":3.4396192022124477,"stratum":"2-4","sampling_key":"057f1ce54a14e04a26c26844dcc354f3e1db10bd2d23927d3c3809fd06ce5a98","slow_code":"#include <bits/stdc++.h>\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <queue>\n\n#include <map>\n\n#include <cstring>\n\n#include <string>\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <functional>\n\n#define inf 1000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<ll, ll>\n\n#define ppa pair<int, pa>\n\n#define EPS (1e-10)\n\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nusing namespace std;\n\nclass Point {\n\npublic:\n  double x, y;\n\n  Point(double x = 0, double y = 0) : x(x), y(y) {}\n\n  Point operator+(Point p) { return Point(x + p.x, y + p.y); }\n\n  Point operator-(Point p) { return Point(x - p.x, y - p.y); }\n\n  Point operator*(double a) { return Point(x * a, y * a); }\n\n  Point operator/(double a) { return Point(x / a, y / a); }\n\n  double absv() { return sqrt(norm()); }\n\n  double norm() { return x * x + y * y; }\n\n  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const Point &p) const { return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS; }\n};\n\ntypedef Point Vector;\n\nstruct Segment {\n\n  Point p1, p2;\n};\n\ndouble hen(Vector a) {\n\n  if (fabs(a.x) < EPS && a.y > 0)\n    return acos(0);\n\n  else if (fabs(a.x) < EPS && a.y < 0)\n    return 3 * acos(0);\n\n  else if (fabs(a.y) < EPS && a.x < 0)\n    return 2 * acos(0);\n\n  else if (fabs(a.y) < EPS && a.x > 0)\n    return 0.0;\n\n  else if (a.y > 0)\n    return acos(a.x / a.absv());\n\n  else\n    return 2 * acos(0) + acos(-a.x / a.absv());\n}\n\ndouble dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }\n\ndouble cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }\n\nint dx[4] = {1, 0, -1, 0};\n\nint dy[4] = {0, 1, 0, -1};\n\nint n, k;\n\nvector<int> G[100050];\n\nint x[100050], y[100050], kosuu[100050];\n\nint visit[100050] = {0};\n\nint a[100005];\n\nsigned main() {\n\n  int n, l;\n\n  cin >> n >> l;\n\n  for (int i = 1; i <= n; i++) {\n\n    cin >> a[i];\n  }\n\n  int w = 0;\n\n  for (int i = 1; i <= n - 1; i++) {\n\n    if (a[i] + a[i + 1] >= l)\n      w = i;\n  }\n\n  if (w == 0) {\n\n    cout << \"Impossible\" << endl;\n\n    return 0;\n\n  }\n\n  else {\n\n    cout << \"Possible\" << endl;\n\n    for (int i = 1; i < w; i++)\n      cout << i << endl;\n\n    for (int i = n - 1; i >= w; i--)\n      cout << i << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define int long long\n\n#define inf 1000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<double, double>\n\n#define ppap pair<pa, int>\n\n#define PI 3.14159265358979323846\n\n#define paa pair<int, char>\n\n#define mp make_pair\n\n#define pb push_back\n\n#define EPS (1e-8)\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};\n\nusing namespace std;\n\nclass pa3 {\n\npublic:\n  int x;\n\n  int y, z;\n\n  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n\n  bool operator<(const pa3 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    return z < p.z;\n  }\n\n  bool operator>(const pa3 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    return z > p.z;\n  }\n\n  bool operator==(const pa3 &p) const { return x == p.x && y == p.y && z == p.z; }\n\n  bool operator!=(const pa3 &p) const { return !(x == p.x && y == p.y && z == p.z); }\n};\n\nclass pa4 {\n\npublic:\n  int x;\n\n  int y, z, w;\n\n  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n\n  bool operator<(const pa4 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    if (z != p.z)\n      return z < p.z;\n\n    return w < p.w;\n  }\n\n  bool operator>(const pa4 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    if (z != p.z)\n      return z > p.z;\n\n    return w > p.w;\n  }\n\n  bool operator==(const pa4 &p) const { return x == p.x && y == p.y && z == p.z && w == p.w; }\n};\n\nclass pa2 {\n\npublic:\n  int x, y;\n\n  pa2(int x = 0, int y = 0) : x(x), y(y) {}\n\n  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n\n  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n\n  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }\n\n  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const pa2 &p) const { return abs(x - p.x) == 0 && abs(y - p.y) == 0; }\n\n  bool operator!=(const pa2 &p) const { return !(abs(x - p.x) == 0 && abs(y - p.y) == 0); }\n};\n\nstring itos(int i) {\n\n  ostringstream s;\n\n  s << i;\n\n  return s.str();\n}\n\nint gcd(int v, int b) {\n\n  if (v > b)\n    return gcd(b, v);\n\n  if (v == b)\n    return b;\n\n  if (b % v == 0)\n    return v;\n\n  return gcd(v, b % v);\n}\n\nint mod;\n\nint extgcd(int a, int b, int &x, int &y) {\n\n  if (b == 0) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n  }\n\n  int d = extgcd(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\npa operator+(const pa &l, const pa &r) { return {l.first + r.first, l.second + r.second}; }\n\npa operator-(const pa &l, const pa &r) { return {l.first - r.first, l.second - r.second}; }\n\nint pr[1000010];\n\nint inv[1000010];\n\nint beki(int wa, int rr, int warukazu) {\n\n  if (rr == 0)\n    return 1 % warukazu;\n\n  if (rr == 1)\n    return wa % warukazu;\n\n  wa %= warukazu;\n\n  if (rr % 2 == 1)\n    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;\n\n  ll zx = beki(wa, rr / 2, warukazu);\n\n  return (zx * zx) % warukazu;\n}\n\nint comb(int nn, int rr) {\n\n  if (rr < 0 || rr > nn || nn < 0)\n    return 0;\n\n  int r = pr[nn] * inv[rr];\n\n  r %= mod;\n\n  r *= inv[nn - rr];\n\n  r %= mod;\n\n  return r;\n}\n\nvoid gya(int ert) {\n\n  pr[0] = 1;\n\n  for (int i = 1; i <= ert; i++) {\n\n    pr[i] = (pr[i - 1] * i) % mod;\n  }\n\n  inv[ert] = beki(pr[ert], mod - 2, mod);\n\n  for (int i = ert - 1; i >= 0; i--) {\n\n    inv[i] = inv[i + 1] * (i + 1) % mod;\n  }\n}\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n;\n\n  cin >> n;\n\n  vector<int> ve(n);\n\n  int l;\n\n  cin >> l;\n\n  for (int i = 0; i < n; i++)\n    cin >> ve[i];\n\n  int it = -1;\n\n  for (int i = 0; i < n - 1; i++)\n    if (ve[i] + ve[i + 1] >= l) {\n\n      it = i;\n    }\n\n  if (it == -1) {\n\n    cout << \"Impossible\" << endl;\n\n    return 0;\n  }\n\n  cout << \"Possible\" << endl;\n\n  it++;\n\n  for (int i = 1; i < it; i++)\n    cout << i << endl;\n\n  for (int i = n - 1; i > it; i--)\n    cout << i << endl;\n\n  cout << it << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"01df1c270f6fde1fc663cc5afc3815abd8b4f254c8fdb3a6924a71327d374966","fast_id":"752ace1e4772f43ffea9e5c1b3b157eba22e4b75708d8c0c1c1f535a115e331c","fast_time":0.006880912,"language":"cpp","measured_fast_code_id":"752ace1e4772f43ffea9e5c1b3b157eba22e4b75708d8c0c1c1f535a115e331c","measured_slow_code_id":"47600a581139b36e7cc1cc944f3f69a14e9ae0cee6d56bb394b75354275f2c0e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38353","problem_id":"p03478","slow_code_id":"14b340dc57967dacb9ad842e9e13e72628b017d285f3718bd7e4451d0fcf02a9","slow_id":"47600a581139b36e7cc1cc944f3f69a14e9ae0cee6d56bb394b75354275f2c0e","slow_time":0.1298004013,"speedup":18.8638368431394,"stratum":"8+","sampling_key":"0601ca95ed4ff1668e51fbee0a22b451ad623336a93d46748196ffd4575522c1","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define pb push_back\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define rep1(i, n) for (int i = 1; i <= n; i++)\n\n#define mp make_pair\n\n#define F first\n\n#define S second\n\n#define IOS                                                                                        \\\n  ios_base::sync_with_stdio(0);                                                                    \\\n  cin.tie(0)\n\ntypedef long long ll;\n\nvector<int> g[100005];\n\nll q, n;\n\nint main()\n\n{\n\n  while (cin >> n)\n\n  {\n\n    ll sum = 0;\n\n    ll A, B;\n\n    cin >> A >> B;\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      ll a = i / 10000, b = (i % 10000) / 1000, c = (i % 1000) / 100, d = (i % 100) / 10,\n         e = i % 10;\n\n      if (a + b + c + d + e <= B && a + b + c + d + e >= A)\n        sum += i;\n    }\n\n    cout << sum << \"\\n\";\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int n, a, b, sum = 0;\n\n  scanf(\"%d %d %d\", &n, &a, &b);\n\n  for (int i = 1; i <= n; i++) {\n\n    int c = 0, t = i;\n\n    for (int j = 0; j < 5; j++) {\n\n      c += t % 10;\n\n      t /= 10;\n    }\n\n    if (c >= a && c <= b) {\n\n      sum += i;\n    }\n  }\n\n  printf(\"%d\", sum);\n\n  return 0;\n}"}
{"fast_code_id":"4b6ab41d141c2405299d600d3ce18dc5fb1baf8494d5ead423af0cbdd64d94a7","fast_id":"66d46c3abea59b00dddb9d896c158b9b50afb1275c56e8ed7d354ae10a9c3305","fast_time":0.0059416277,"language":"cpp","measured_fast_code_id":"66d46c3abea59b00dddb9d896c158b9b50afb1275c56e8ed7d354ae10a9c3305","measured_slow_code_id":"0b48eb9ea580c32eca86916a01717a25aecf9974f35fdffa3b02714289fddd52","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3838","problem_id":"p03816","slow_code_id":"1ad871ed3691ba6a86d98f0b7c2c8a3324495816ff4d7978f256a755b6b59d6d","slow_id":"0b48eb9ea580c32eca86916a01717a25aecf9974f35fdffa3b02714289fddd52","slow_time":0.1243119103,"speedup":20.92219785160891,"stratum":"8+","sampling_key":"035136b03fd8689c1b823c8f0bff76c0cb1e176d045a49961f6c95742ea76b68","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint ar[1000000], cc[100050];\n\nvector<pair<int, int> > gg[100050];\n\nmap<int, int> o;\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> ar[i];\n\n    cc[ar[i]]++;\n  }\n\n  sort(ar, ar + n);\n\n  long long h = 0, l = 0;\n\n  for (int i = 0; i < 100050; i++) {\n\n    int x;\n\n    if (cc[i] != 0) {\n\n      if (cc[i] % 2 == 0)\n\n        h++;\n\n      else\n\n        l++;\n    }\n  }\n\n  if (h % 2 == 0)\n\n    cout << l + h;\n\n  else\n\n    cout << l + h - 1;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\nint n, ne, cur;\n\nint a[100005];\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%d\", &cur);\n\n    if (!a[cur]) {\n\n      a[cur] = 1;\n\n      ne++;\n    }\n  }\n\n  int ans;\n\n  int pan = n - ne;\n\n  if (pan % 2 == 0)\n    ans = ne;\n\n  else\n    ans = ne - 1;\n\n  printf(\"%d\", ans);\n}"}
{"fast_code_id":"2dd14602cdafb867339bd4b84690e9629ddae4fd45c2866bc2632bdc9e2d6eec","fast_id":"d27e1076b784ad2317e5cbb357c5b8e10f5e1e14f8ad245a15be7d1a22b1e51d","fast_time":0.0782869256,"language":"cpp","measured_fast_code_id":"d27e1076b784ad2317e5cbb357c5b8e10f5e1e14f8ad245a15be7d1a22b1e51d","measured_slow_code_id":"bdfbec90801e23a5bab0f432a085f87b7343a2727169f8369abb588ab60aff31","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38449","problem_id":"p03053","slow_code_id":"2ce3140419f3bec5dbefef2f5c8dc3127ecc13e67435270cd0d0abd67590299c","slow_id":"bdfbec90801e23a5bab0f432a085f87b7343a2727169f8369abb588ab60aff31","slow_time":0.8156245034,"speedup":10.418399970990814,"stratum":"8+","sampling_key":"2adf42432b58ea4a5b38724b39b165ed690a1f89a83ef2d11461b1d790fb5006","slow_code":"#include <iostream>\n\n#include <queue>\n\n#include <cstring>\n\nconst int maxn = 1010;\n\nusing namespace std;\n\nstruct Node {\n\n  int x, y;\n};\n\nqueue<Node> Q;\n\nint a[maxn][maxn], d[maxn][maxn];\n\nint vis[maxn][maxn];\n\nint main() {\n\n  memset(vis, 0, sizeof(vis));\n\n  memset(d, 0, sizeof(d));\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int h, w;\n\n  cin >> h >> w;\n\n  for (int i = 1; i <= h; i++) {\n\n    string s;\n\n    cin >> s;\n\n    for (int j = 0; j < w; j++) {\n\n      if (s[j] == '#') {\n\n        a[i][j + 1] = 1;\n\n        Q.push((Node){i, j + 1});\n\n        vis[i][j + 1] = 1;\n\n      } else\n        a[i][j + 1] = 0;\n    }\n  }\n\n  int cnt = 0;\n\n  while (!Q.empty()) {\n\n    Node p = Q.front();\n\n    Q.pop();\n\n    if (p.x > 1 && !vis[p.x - 1][p.y]) {\n\n      d[p.x - 1][p.y] = d[p.x][p.y] + 1;\n\n      Q.push((Node){p.x - 1, p.y});\n\n      vis[p.x - 1][p.y] = 1;\n    }\n\n    if (p.y > 1 && !vis[p.x][p.y - 1]) {\n\n      d[p.x][p.y - 1] = d[p.x][p.y] + 1;\n\n      Q.push((Node){p.x, p.y - 1});\n\n      vis[p.x][p.y - 1] = 1;\n    }\n\n    if (p.x < h && !vis[p.x + 1][p.y]) {\n\n      d[p.x + 1][p.y] = d[p.x][p.y] + 1;\n\n      Q.push((Node){p.x + 1, p.y});\n\n      vis[p.x + 1][p.y] = 1;\n    }\n\n    if (p.y < w && !vis[p.x][p.y + 1]) {\n\n      d[p.x][p.y + 1] = d[p.x][p.y] + 1;\n\n      Q.push((Node){p.x, p.y + 1});\n\n      vis[p.x][p.y + 1] = 1;\n    }\n  }\n\n  int ans = 0;\n\n  for (int i = 1; i <= h; i++)\n\n    for (int j = 1; j <= w; j++)\n      ans = max(ans, d[i][j]);\n\n  cout << ans;\n}","fast_code":"#include <cstdio>\n\n#include <queue>\n\n#include <algorithm>\n\nusing namespace std;\n\nchar c[1001][1002];\n\nint d[1000001];\n\nint main() {\n\n  int n, m;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%s\", c[i] + 1);\n\n  queue<int> q;\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= m; j++)\n\n      if (c[i][j] == '#') {\n\n        q.push((i - 1) * m + j);\n\n        d[(i - 1) * m + j] = 1;\n      }\n\n  int ans = 0;\n\n  while (!q.empty()) {\n\n    int u = q.front();\n\n    q.pop();\n\n    ans = max(ans, d[u]);\n\n    for (int i = 0; i < 4; i++) {\n\n      int v = u;\n\n      if (i == 0 && u <= m || i == 1 && u % m == 1 % m || i == 2 && u >= (n - 1) * m + 1 ||\n          i == 3 && u % m == 0)\n\n        continue;\n\n      if (i == 0)\n        v -= m;\n\n      else if (i == 1)\n        v--;\n\n      else if (i == 2)\n        v += m;\n\n      else\n        v++;\n\n      if (!d[v]) {\n\n        d[v] = d[u] + 1;\n\n        q.push(v);\n      }\n    }\n  }\n\n  printf(\"%d\\n\", ans - 1);\n}"}
{"fast_code_id":"8d5c96192a8d568bbef0b93d3bef8a54a3d2f580c4c60beaa81848cb04251ab7","fast_id":"7c654e49432031ebae2b515010832c70b4b8280aef9aef6d398a16bf90b01ef4","fast_time":0.0020573461,"language":"cpp","measured_fast_code_id":"7c654e49432031ebae2b515010832c70b4b8280aef9aef6d398a16bf90b01ef4","measured_slow_code_id":"e12928255585f9b93dae18be34f931361c50d91ed07858bfea7cda66e37d819d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38537","problem_id":"p02552","slow_code_id":"5c048dc99bf7aafe50e8f3cf96fdfef13d2d09ca4798013c44e5ba72208060eb","slow_id":"e12928255585f9b93dae18be34f931361c50d91ed07858bfea7cda66e37d819d","slow_time":0.0072153527,"speedup":3.5071166198045147,"stratum":"2-4","sampling_key":"1151ff0e99e014bcb3e4f5c5f5009e2641a7e604d23019731aaebbd5b6ca6657","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define endl \"\\n\"\n\nvector<ll> adj[100005];\n\nll vis[100005];\n\nll n, m;\n\nvoid add(ll x, ll y) {\n\n  adj[x].push_back(y);\n\n  adj[y].push_back(x);\n}\n\nvoid solve() {\n\n  ll x;\n\n  cin >> x;\n\n  cout << 1 - x << endl;\n}\n\nint main() {\n\n  ll t;\n\n  t = 1;\n\n  while (t--)\n\n    solve();\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define mod 1000000007\n\n#define ll long long\n\nll bow(ll x, ll y) {\n\n  ll res = 1;\n\n  for (ll i = 1; i <= y; ++i) {\n\n    res = res * x % mod;\n  }\n\n  return res;\n}\n\nvoid solve() {\n\n  ll x;\n\n  cin >> x;\n\n  cout << 1 - x << endl;\n}\n\nint main() {\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  solve();\n\n  return 0;\n}"}
{"fast_code_id":"2601b5df940a365252420bba9ea57e92399d1081199334f6927d22658e88fa9e","fast_id":"a0a2e684cbab043b2589cf4bffe5ed0e8c84e1e169728047419c34de71e1bd5c","fast_time":0.0979924571,"language":"cpp","measured_fast_code_id":"a0a2e684cbab043b2589cf4bffe5ed0e8c84e1e169728047419c34de71e1bd5c","measured_slow_code_id":"73a73cfed367e6df8e4fd7a5bc9f1eb762b7630884cc72b09709bfe206d1edd9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38560","problem_id":"p00762","slow_code_id":"bcc75121817f746edde0ba2b03091c76258428e2a29cf487c9878f962a5e72d1","slow_id":"73a73cfed367e6df8e4fd7a5bc9f1eb762b7630884cc72b09709bfe206d1edd9","slow_time":0.6848377267,"speedup":6.988677975501035,"stratum":"4-8","sampling_key":"29c1f94ff75770d8a75aa6b14c2496af4211ec35f4d747dac9cb5cc9c638ced9","slow_code":"\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\n#define out(v) cerr << #v << \": \" << (v) << endl\n\n#define SZ(v) ((int)(v).size())\n\nconst int maxint = -1u >> 1;\n\ntemplate <class T> bool get_max(T &a, const T &b) {\n  return b > a ? a = b, 1 : 0;\n}\n\ntemplate <class T> bool get_min(T &a, const T &b) {\n  return b < a ? a = b, 1 : 0;\n}\n\nstruct die {\n\n  int num[6];\n\n  die() {}\n\n  die(int top, int fr)\n\n  {\n\n    memset(num, 0, sizeof num);\n\n    num[0] = top;\n\n    num[1] = fr;\n\n    num[5] = 7 - top;\n\n    num[4] = 7 - fr;\n\n    if (top == 1) {\n\n      switch (fr) {\n\n      case 3:\n        num[2] = 2;\n        num[3] = 5;\n        break;\n\n      case 5:\n        num[2] = 3;\n        num[3] = 4;\n        break;\n\n      case 4:\n        num[2] = 5;\n        num[3] = 2;\n        break;\n\n      case 2:\n        num[2] = 4;\n        num[3] = 3;\n        break;\n      }\n\n    }\n\n    else if (top == 6) {\n\n      switch (fr) {\n\n      case 3:\n        num[2] = 2;\n        num[3] = 5;\n        break;\n\n      case 5:\n        num[2] = 3;\n        num[3] = 4;\n        break;\n\n      case 4:\n        num[2] = 5;\n        num[3] = 2;\n        break;\n\n      case 2:\n        num[2] = 4;\n        num[3] = 3;\n        break;\n      }\n\n      int tmp = num[2];\n      num[2] = num[3];\n      num[3] = tmp;\n\n    }\n\n    else if (top == 3) {\n\n      switch (fr) {\n\n      case 6:\n        num[2] = 2;\n        num[3] = 5;\n        break;\n\n      case 5:\n        num[2] = 6;\n        num[3] = 1;\n        break;\n\n      case 1:\n        num[2] = 5;\n        num[3] = 2;\n        break;\n\n      case 2:\n        num[2] = 1;\n        num[3] = 6;\n        break;\n      }\n\n    }\n\n    else if (top == 4) {\n\n      switch (fr)\n\n      {\n\n      case 6:\n        num[2] = 2;\n        num[3] = 5;\n        break;\n\n      case 5:\n        num[2] = 6;\n        num[3] = 1;\n        break;\n\n      case 1:\n        num[2] = 5;\n        num[3] = 2;\n        break;\n\n      case 2:\n        num[2] = 1;\n        num[3] = 6;\n        break;\n      }\n\n      int tmp = num[2];\n      num[2] = num[3];\n      num[3] = tmp;\n\n    }\n\n    else if (top == 2) {\n\n      switch (fr) {\n\n      case 1:\n        num[2] = 3;\n        num[3] = 4;\n        break;\n\n      case 4:\n        num[2] = 1;\n        num[3] = 6;\n        break;\n\n      case 6:\n        num[2] = 4;\n        num[3] = 3;\n        break;\n\n      case 3:\n        num[2] = 6;\n        num[3] = 1;\n        break;\n      }\n\n    }\n\n    else {\n\n      switch (fr) {\n\n      case 1:\n        num[2] = 3;\n        num[3] = 4;\n        break;\n\n      case 4:\n        num[2] = 1;\n        num[3] = 6;\n        break;\n\n      case 6:\n        num[2] = 4;\n        num[3] = 3;\n        break;\n\n      case 3:\n        num[2] = 6;\n        num[3] = 1;\n        break;\n      }\n\n      int tmp = num[2];\n      num[2] = num[3];\n      num[3] = tmp;\n    }\n  }\n\n  void rot_left()\n\n  {\n\n    int tmp;\n\n    tmp = num[0];\n\n    num[0] = num[3];\n\n    num[3] = num[5];\n\n    num[5] = num[2];\n\n    num[2] = tmp;\n  }\n\n  void rot_right()\n\n  {\n\n    int tmp;\n\n    tmp = num[0];\n\n    num[0] = num[2];\n\n    num[2] = num[5];\n\n    num[5] = num[3];\n\n    num[3] = tmp;\n  }\n\n  void rot_front()\n\n  {\n\n    int tmp;\n\n    tmp = num[0];\n\n    num[0] = num[4];\n\n    num[4] = num[5];\n\n    num[5] = num[1];\n\n    num[1] = tmp;\n  }\n\n  void rot_back()\n\n  {\n\n    int tmp;\n\n    tmp = num[0];\n\n    num[0] = num[1];\n\n    num[1] = num[5];\n\n    num[5] = num[4];\n\n    num[4] = tmp;\n  }\n\n  int gettop()\n\n  {\n\n    return num[0];\n  }\n\n  int get_front()\n\n  {\n\n    return num[1];\n  }\n\n  int get_left()\n\n  {\n\n    return num[2];\n  }\n\n  int get_right() { return num[3]; }\n\n  int get_back() { return num[4]; }\n\n  void rot(int x)\n\n  {\n\n    switch (x) {\n\n    case 0:\n      rot_front();\n      break;\n\n    case 1:\n      rot_back();\n      break;\n\n    case 2:\n      rot_left();\n      break;\n\n    case 3:\n      rot_right();\n      break;\n    }\n  }\n\n  int get(int x)\n\n  {\n\n    switch (x) {\n\n    case 0:\n      return get_front();\n      break;\n\n    case 1:\n      return get_back();\n      break;\n\n    case 2:\n      return get_left();\n      break;\n\n    case 3:\n      return get_right();\n      break;\n    }\n  }\n\n} dics;\n\nint n;\n\nint high[1000][1000], val[1000][1000];\n\nint dx[] = {-1, +1, 0, 0};\n\nint dy[] = {0, 0, -1, +1};\n\nint main() {\n\n  while (cin >> n && n != 0)\n\n  {\n\n    int x, y, z, a, b;\n\n    memset(high, 0, sizeof high);\n\n    memset(val, 0, sizeof val);\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      cin >> a >> b;\n\n      die nxt = die(a, b);\n\n      y = x = 500;\n\n      z = high[x][y];\n\n      do {\n\n        int mx = 3, dir = -1;\n\n        for (int i = 0; i < 4; i++)\n\n        {\n\n          if (nxt.get(i) > mx &&\n\n              high[x + dx[i]][y + dy[i]] < z) {\n\n            mx = nxt.get(i);\n\n            dir = i;\n          }\n        }\n\n        if (dir == -1) {\n\n          high[x][y]++;\n\n          val[x][y] = nxt.gettop();\n\n          break;\n\n        }\n\n        else {\n\n          nxt.rot(dir);\n\n          x += dx[dir];\n\n          y += dy[dir];\n\n          z = high[x][y];\n        }\n\n      } while (1);\n    }\n\n    int ans[7];\n\n    memset(ans, 0, sizeof ans);\n\n    for (int i = 0; i < 505; i++)\n\n      for (int j = 0; j < 505; j++)\n\n        ans[val[i][j]]++;\n\n    for (int i = 1; i <= 5; i++)\n\n      cout << ans[i] << ' ';\n\n    cout << ans[6] << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long int lint;\n\nstruct {\n\n  int nDice, tmp_score, last_score;\n\n} mp[201][201] = {};\n\nint opposide[7] = {0, 6, 5, 4, 3, 2, 1};\n\nint right_side[7][7] = {{},\n\n                        {0, 0, 3, 5, 2, 4},\n\n                        {0, 4, 0, 1, 6, 0, 3},\n\n                        {0, 2, 6, 0, 0, 1, 5},\n\n                        {0, 5, 1, 0, 0, 6, 2},\n\n                        {0, 3, 0, 6, 1, 0, 4},\n\n                        {0, 0, 4, 2, 5, 3}};\n\nint final_score[7] = {};\n\nvoid roll(int top, int front, int row, int col);\n\nint main()\n\n{\n\n  int n = 0;\n\n  while (scanf(\"%d\", &n) == 1 && n != 0)\n\n  {\n\n    int top = 0, front = 0;\n\n    for (int i = 0; i < 201; i++)\n\n      for (int j = 0; j < 201; j++)\n\n        mp[i][j].nDice = mp[i][j].tmp_score = mp[i][j].last_score = 0;\n\n    for (int i = 1; i < 7; i++)\n\n      final_score[i] = 0;\n\n    while (n-- > 0)\n\n    {\n\n      scanf(\"%d %d\", &top, &front);\n\n      mp[100][100].nDice++;\n\n      final_score[mp[100][100].tmp_score]--;\n\n      mp[100][100].last_score = mp[100][100].tmp_score;\n\n      mp[100][100].tmp_score = top;\n\n      final_score[top]++;\n\n      roll(top, front, 100, 100);\n    }\n\n    for (int i = 1; i < 7; i++)\n\n      printf(\"%d%s\", final_score[i], i == 6 ? \"\\n\" : \" \");\n  }\n\n  return 0;\n}\n\nvoid roll(int top, int front, int row, int col)\n\n{\n\n  int dire = 0;\n\n  for (int i = 4; i < 7; i++)\n\n  {\n\n    if (i != top && i != opposide[top])\n\n    {\n\n      if (i == front && mp[row + 1][col].nDice + 1 < mp[row][col].nDice)\n\n        dire = dire > i ? dire : i;\n\n      else if (i == opposide[front] &&\n               mp[row - 1][col].nDice + 1 < mp[row][col].nDice)\n\n        dire = dire > i ? dire : i;\n\n      else if (i == right_side[top][front] &&\n               mp[row][col + 1].nDice + 1 < mp[row][col].nDice)\n\n        dire = dire > i ? dire : i;\n\n      else if (i == opposide[right_side[top][front]] &&\n               mp[row][col - 1].nDice + 1 < mp[row][col].nDice)\n\n        dire = dire > i ? dire : i;\n    }\n  }\n\n  if (dire > 0)\n\n  {\n\n    mp[row][col].nDice--;\n\n    final_score[mp[row][col].tmp_score]--;\n\n    mp[row][col].tmp_score = mp[row][col].last_score;\n\n    final_score[mp[row][col].tmp_score]++;\n\n    if (dire == front)\n\n    {\n\n      mp[row + 1][col].nDice++;\n\n      final_score[mp[row + 1][col].tmp_score]--;\n\n      final_score[opposide[front]]++;\n\n      mp[row + 1][col].last_score = mp[row + 1][col].tmp_score;\n\n      mp[row + 1][col].tmp_score = opposide[front];\n\n      roll(opposide[front], top, row + 1, col);\n\n    }\n\n    else if (dire == opposide[front])\n\n    {\n\n      mp[row - 1][col].nDice++;\n\n      final_score[mp[row - 1][col].tmp_score]--;\n\n      mp[row - 1][col].last_score = mp[row - 1][col].tmp_score;\n\n      mp[row - 1][col].tmp_score = front;\n\n      final_score[mp[row - 1][col].tmp_score]++;\n\n      roll(front, opposide[top], row - 1, col);\n\n    }\n\n    else if (dire == right_side[top][front])\n\n    {\n\n      mp[row][col + 1].nDice++;\n\n      final_score[mp[row][col + 1].tmp_score]--;\n\n      mp[row][col + 1].last_score = mp[row][col + 1].tmp_score;\n\n      mp[row][col + 1].tmp_score = opposide[right_side[top][front]];\n\n      final_score[mp[row][col + 1].tmp_score]++;\n\n      roll(opposide[right_side[top][front]], front, row, col + 1);\n\n    }\n\n    else if (dire == opposide[right_side[top][front]])\n\n    {\n\n      mp[row][col - 1].nDice++;\n\n      final_score[mp[row][col - 1].tmp_score]--;\n\n      mp[row][col - 1].last_score = mp[row][col - 1].tmp_score;\n\n      mp[row][col - 1].tmp_score = right_side[top][front];\n\n      final_score[mp[row][col - 1].tmp_score]++;\n\n      roll(right_side[top][front], front, row, col - 1);\n    }\n  }\n}"}
{"fast_code_id":"1bb6b15431b8ce2037f9d2935153826d01c5d9a40ea58bdc66d41bcc5bdf308d","fast_id":"05d331447f8236a0e9677394ffe9d482c67bcbf8862b9784fe2408646bba6692","fast_time":0.0061654061,"language":"cpp","measured_fast_code_id":"05d331447f8236a0e9677394ffe9d482c67bcbf8862b9784fe2408646bba6692","measured_slow_code_id":"f097c2ec355650a29e2bed7696b9f2c0fad9ccd7abcb7bd24dea55fa88bcd53e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38667","problem_id":"p01835","slow_code_id":"25e63a3f694a641ef799bdabcdc5cd6836d552943203d3a84c6439e530660f5b","slow_id":"f097c2ec355650a29e2bed7696b9f2c0fad9ccd7abcb7bd24dea55fa88bcd53e","slow_time":0.2504522343,"speedup":40.62217966469395,"stratum":"8+","sampling_key":"2d76a61fe5487a678b724334c01d131d4807ab562623e28552533e819a55784c","slow_code":"#include <iostream>\n\n#include <stdio.h>\n\n#include <math.h>\n\n#include <string.h>\n\n#include <time.h>\n\n#include <stdlib.h>\n\n#include <string>\n\n#include <bitset>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <sstream>\n\n#include <stack>\n\n#include <iomanip>\n\nusing namespace std;\n\ninline char nc() {\n\n  static char buf[100000], *p1 = buf, *p2 = buf;\n\n  if (p1 == p2) {\n    p2 = (p1 = buf) + fread(buf, 1, 100000, stdin);\n    if (p1 == p2)\n      return EOF;\n  }\n\n  return *p1++;\n}\n\ninline void read(int &x) {\n\n  char c = nc(), b = 1;\n\n  for (; !(c >= '0' && c <= '9'); c = nc())\n    if (c == '-')\n      b = -1;\n\n  for (x = 0; c >= '0' && c <= '9'; x = x * 10 + c - '0', c = nc())\n    ;\n  x *= b;\n}\n\nconst int N = 200005;\n\nstruct abcd {\n\n  int l, r;\n\n  abcd(int l = -1, int r = -1) : l(l), r(r) {}\n\n  bool operator==(const abcd &B) const { return l == B.l && r == B.r; }\n\n} T[N << 2];\n\nbool Jud(abcd L, abcd R) { return L.r + 1 == R.l; }\n\ninline void Push(int x, abcd u) {\n\n  if (T[x] == abcd(-1, -1)) {\n    T[x] = u;\n    return;\n  }\n\n  if (T[x] == abcd(-2, -2))\n    return;\n\n  if (u == abcd(-2, -2)) {\n    T[x] = u;\n    return;\n  }\n\n  if (Jud(T[x], u) || T[x] == abcd(-1, -1))\n    T[x].r = u.r;\n\n  else\n    T[x] = abcd(-2, -2);\n}\n\ninline void Modify(int x, int l, int r, int ql, int qr, abcd u) {\n\n  int mid = (l + r) >> 1;\n\n  if (!(T[x] == abcd(-1, -1)) && l != r)\n    Push(x << 1, T[x]), Push(x << 1 | 1, T[x]), T[x] = abcd(-1, -1);\n\n  if (ql <= l && r <= qr) {\n\n    Push(x, u);\n\n    return;\n  }\n\n  if (ql <= mid)\n    Modify(x << 1, l, mid, ql, qr, u);\n\n  if (mid < qr)\n    Modify(x << 1 | 1, mid + 1, r, ql, qr, u);\n}\n\nint n, K;\n\nint cnt = 0;\n\ninline void Query(int x, int l, int r) {\n\n  if (l == r) {\n\n    if (T[x] == abcd(0, K))\n\n      cnt++;\n\n    return;\n  }\n\n  if (!(T[x] == abcd(-1, -1)) && l != r)\n    Push(x << 1, T[x]), Push(x << 1 | 1, T[x]), T[x] = abcd(-1, -1);\n\n  int mid = (l + r) >> 1;\n\n  Query(x << 1, l, mid);\n\n  Query(x << 1 | 1, mid + 1, r);\n}\n\nint main() {\n\n  int Q;\n  int l, r, c;\n\n  read(n);\n  read(K);\n\n  T[1] = abcd(0, 0);\n\n  read(Q);\n\n  while (Q--) {\n\n    read(l);\n    read(r);\n    read(c);\n\n    Modify(1, 1, n, l, r, abcd(c, c));\n  }\n\n  Query(1, 1, n);\n\n  printf(\"%d\\n\", cnt);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define MAXN 200010\n\n#define INF 1000000000\n\nstruct node\n\n{\n\n  int l, r, mx, mn, tg;\n\n} t[MAXN * 4];\n\nint cnt, n, k, rt, tm, ans;\n\nvoid Build(int &i, int l, int r)\n\n{\n\n  if (i == 0)\n    i = ++cnt;\n\n  if (l == r)\n\n  {\n\n    t[i].l = t[i].r = t[i].mx = t[i].mn = t[i].tg = 0;\n\n    return;\n  }\n\n  int mid = (l + r) >> 1;\n\n  Build(t[i].l, l, mid);\n\n  Build(t[i].r, mid + 1, r);\n}\n\nvoid PushDown(int i)\n\n{\n\n  if (t[i].tg)\n\n  {\n\n    int l = t[i].l, r = t[i].r, c = t[i].tg;\n\n    if (l)\n      t[l].tg += c, t[l].mx += c, t[l].mn += c;\n\n    if (r)\n      t[r].tg += c, t[r].mx += c, t[r].mn += c;\n\n    t[i].tg = 0;\n  }\n}\n\nvoid PushUp(int i)\n\n{\n\n  t[i].mx = max(t[t[i].l].mx, t[t[i].r].mx);\n\n  t[i].mn = min(t[t[i].l].mn, t[t[i].r].mn);\n}\n\nvoid Solve(int &i, int l, int r, int x)\n\n{\n\n  if (i == 0)\n    return;\n\n  if (t[i].mn == x - 1 && t[i].mx == x - 1)\n\n  {\n\n    t[i].tg++;\n    t[i].mx++, t[i].mn++;\n\n    return;\n  }\n\n  if (t[i].mn >= x && t[i].mx < x - 1)\n\n  {\n\n    i = 0;\n\n    return;\n  }\n\n  PushDown(i);\n\n  int mid = (l + r) >> 1;\n\n  Solve(t[i].l, l, mid, x);\n\n  Solve(t[i].r, mid + 1, r, x);\n\n  PushUp(i);\n\n  if (t[i].l == 0 && t[i].r == 0)\n    i = 0;\n}\n\nvoid Modify(int &i, int l, int r, int L, int R, int x)\n\n{\n\n  if (i == 0)\n    return;\n\n  if (L <= l && r <= R)\n\n  {\n\n    Solve(i, l, r, x);\n\n    return;\n  }\n\n  PushDown(i);\n\n  int mid = (l + r) >> 1;\n\n  if (L <= mid)\n    Modify(t[i].l, l, mid, L, R, x);\n\n  if (R > mid)\n    Modify(t[i].r, mid + 1, r, L, R, x);\n\n  PushUp(i);\n\n  if (t[i].l == 0 && t[i].r == 0)\n    i = 0;\n}\n\nvoid dfs(int i, int l, int r)\n\n{\n\n  if (i == 0 || t[i].mx < k)\n    return;\n\n  if (l == r)\n\n  {\n\n    if (t[i].mx == k)\n      ans++;\n\n    return;\n  }\n\n  PushDown(i);\n\n  int mid = (l + r) >> 1;\n\n  dfs(t[i].l, l, mid);\n\n  dfs(t[i].r, mid + 1, r);\n}\n\nint main()\n\n{\n\n  t[0].mx = -INF;\n\n  t[0].mn = INF;\n\n  t[0].l = t[0].r = t[0].tg = 0;\n\n  scanf(\"%d%d%d\", &n, &k, &tm);\n\n  Build(rt, 1, n);\n\n  int l, r, x;\n\n  while (tm--)\n\n  {\n\n    scanf(\"%d%d%d\", &l, &r, &x);\n\n    Modify(rt, 1, n, l, r, x);\n  }\n\n  dfs(rt, 1, n);\n\n  printf(\"%d\\n\", ans);\n}\n"}
{"fast_code_id":"152bd13195bf1aa0a38152b59129a0357b93e01a29002aa6823bdd4ccbeb1787","fast_id":"b2bf1bd1327f045a423dab1b3ff377253e9234de5719b0e4bff5dcb4fdfe874a","fast_time":0.1054072597,"language":"cpp","measured_fast_code_id":"b2bf1bd1327f045a423dab1b3ff377253e9234de5719b0e4bff5dcb4fdfe874a","measured_slow_code_id":"5817c0e6137211ecfd49f6420ed925244f240aae227bd6a3f222516aff0e2496","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38673","problem_id":"p04052","slow_code_id":"5596a5fdc785fc9ebeaddc0599cc1460dc67d489987dc09faa468949850f829c","slow_id":"5817c0e6137211ecfd49f6420ed925244f240aae227bd6a3f222516aff0e2496","slow_time":0.3190308447,"speedup":3.0266496407172983,"stratum":"2-4","sampling_key":"335b326d3b49df5ea4ca28e0ba97c39d3371264f4f62406449369febf3c3866f","slow_code":"#include <iostream>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <vector>\n\n#include <list>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <algorithm>\n\n#include <iterator>\n\n#include <bitset>\n\n#include <ctime>\n\n#include <fstream>\n\n#include <complex>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define RFOR(i, b, a) for (int i = (b) - 1; i >= (a); i--)\n\n#define ITER(it, a) for (typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define ALL(a) a.begin(), a.end()\n\n#define SZ(a) (int)a.size()\n\n#define PB push_back\n\n#define MP make_pair\n\ntypedef long long LL;\n\ntypedef vector<LL> VI;\n\ntypedef pair<int, LL> PII;\n\nconst double PI = acos(-1.0);\n\nconst int INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = INF * (LL)INF;\n\nconst int MOD = 1000 * 1000 * 1000 + 7;\n\nconst int MAX = 1000 * 500 + 7;\n\nstruct RMQ\n\n{\n\n  int T[MAX << 2];\n\n  void upd(int v, int tl, int tr, int p, int x)\n\n  {\n\n    if (tl == tr)\n\n    {\n\n      T[v] = x;\n\n      return;\n    }\n\n    int tm = (tl + tr) / 2;\n\n    if (p <= tm)\n      upd(v + v, tl, tm, p, x);\n\n    else\n      upd(v + v + 1, tm + 1, tr, p, x);\n\n    T[v] = max(T[v + v], T[v + v + 1]);\n  }\n\n  int get(int v, int tl, int tr, int l, int r)\n\n  {\n\n    if (r < l)\n      return -INF;\n\n    if (l == tl && r == tr)\n      return T[v];\n\n    int tm = tl + tr >> 1;\n\n    return max(get(v + v, tl, tm, l, min(r, tm)),\n\n               get(v + v + 1, tm + 1, tr, max(tm + 1, l), r));\n  }\n\n} T;\n\nint P[MAX], Q[MAX], R[MAX], C[MAX];\n\nint k, n;\n\nset<int> S;\n\nvoid updBlock(int block)\n\n{\n\n  if (C[block] != -1)\n\n  {\n\n    S.erase(-C[block]);\n\n    C[block] = -1;\n  }\n\n  int L = block * k;\n\n  int R = min(L + k - 1, n - 1);\n\n  int x = T.get(1, 0, n - 1, L, R);\n\n  if (x == -INF)\n    return;\n\n  if (T.get(1, 0, n - 1, max(0, Q[x] - k + 1), min(n - 1, Q[x] + k + -1)) == x)\n\n    S.insert(-Q[x]), C[block] = Q[x];\n}\n\nint main()\n\n{\n\n  scanf(\"%d %d\", &n, &k);\n\n  FOR(i, 0, n)\n\n  {\n\n    scanf(\"%d\", P + i);\n\n    P[i]--;\n\n    Q[P[i]] = i;\n\n    T.upd(1, 0, n - 1, i, P[i]);\n  }\n\n  int cnt = (n + k - 1) / k;\n\n  FILL(C, -1);\n\n  FOR(i, 0, cnt)\n\n  updBlock(i);\n\n  RFOR(i, n, 0)\n\n  {\n\n    int x = -*S.begin();\n\n    S.erase(S.begin());\n\n    R[x] = i;\n\n    T.upd(1, 0, n - 1, x, -INF);\n\n    updBlock(x / k);\n\n    if (x / k - 1 >= 0)\n      updBlock(x / k - 1);\n\n    if (x / k + 1 < cnt)\n      updBlock(x / k + 1);\n  }\n\n  FOR(i, 0, n)\n\n  printf(\"%d \", R[i] + 1);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define LL long long\n\nusing namespace std;\n\nconst int N = 5e5 + 10, M = 1e8 + 10;\n\nint rd()\n\n{\n\n  int x = 0, w = 1;\n  char ch = 0;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      w = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = x * 10 + (ch ^ 48);\n    ch = getchar();\n  }\n\n  return x * w;\n}\n\nint to[N << 1], nt[N << 1], dg[N], hd[N], tot = 1;\n\nvoid adde(int x, int y) { ++tot, to[tot] = y, nt[tot] = hd[x], hd[x] = tot, ++dg[y]; }\n\nint n, m, a[N], an[N];\n\nint mi[N << 2];\n\nvoid psup(int o) { mi[o] = min(mi[o << 1], mi[o << 1 | 1]); }\n\nvoid modif(int o, int l, int r, int lx, int x)\n\n{\n\n  if (l == r) {\n    mi[o] = x;\n    return;\n  }\n\n  int mid = (l + r) >> 1;\n\n  if (lx <= mid)\n    modif(o << 1, l, mid, lx, x);\n\n  else\n    modif(o << 1 | 1, mid + 1, r, lx, x);\n\n  psup(o);\n}\n\nint quer(int o, int l, int r, int ll, int rr)\n\n{\n\n  if (ll > rr)\n    return n + 1;\n\n  if (ll <= l && r <= rr)\n    return mi[o];\n\n  int an = n + 1, mid = (l + r) >> 1;\n\n  if (ll <= mid)\n    an = min(an, quer(o << 1, l, mid, ll, rr));\n\n  if (rr > mid)\n    an = min(an, quer(o << 1 | 1, mid + 1, r, ll, rr));\n\n  psup(o);\n\n  return an;\n}\n\nvoid bui(int o, int l, int r)\n\n{\n\n  if (l == r) {\n    mi[o] = n + 1;\n    return;\n  }\n\n  int mid = (l + r) >> 1;\n\n  bui(o << 1, l, mid), bui(o << 1 | 1, mid + 1, r);\n\n  psup(o);\n}\n\nstruct node\n\n{\n\n  int x;\n\n  bool operator<(const node &bb) const { return a[x] > a[bb.x]; }\n};\n\npriority_queue<node> q;\n\nint main()\n\n{\n\n  n = rd(), m = rd();\n\n  for (int i = 1; i <= n; ++i)\n    a[rd()] = i;\n\n  bui(1, 1, n);\n\n  for (int i = n; i; --i)\n\n  {\n\n    int n1 = quer(1, 1, n, max(a[i] - m + 1, 1), a[i] - 1),\n        n2 = quer(1, 1, n, a[i] + 1, min(a[i] + m - 1, n));\n\n    if (n1 <= n)\n      adde(i, n1);\n\n    if (n2 <= n)\n      adde(i, n2);\n\n    modif(1, 1, n, a[i], i);\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n    if (!dg[i])\n      q.push((node){i});\n\n  for (int h = 1; h <= n; ++h)\n\n  {\n\n    int x = q.top().x;\n\n    q.pop();\n\n    an[a[x]] = h;\n\n    for (int i = hd[x]; i; i = nt[i])\n\n    {\n\n      int y = to[i];\n\n      --dg[y];\n\n      if (!dg[y])\n        q.push((node){y});\n    }\n  }\n\n  for (int i = 1; i <= n; ++i)\n    printf(\"%d\\n\", an[i]);\n\n  return 0;\n}\n"}
{"fast_code_id":"1b921e82f0697a3cc6dd3ed1f100033d3456d4705a30e86ea22e8a5f79beea1e","fast_id":"9534d8ba5462effc8a505f2b6323a3fad9d6b786ce745875c3a9e050ba844a17","fast_time":0.1245706539,"language":"cpp","measured_fast_code_id":"9534d8ba5462effc8a505f2b6323a3fad9d6b786ce745875c3a9e050ba844a17","measured_slow_code_id":"ed8a0713440e47cde336576be494f381bb1ed9c87371f3a26c4dc1a8d99ef4dc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38701","problem_id":"p00721","slow_code_id":"be1558afb2872c80d2e281a3deae0cd632aba8cf69d1ee093cf2596b7fda1c6a","slow_id":"ed8a0713440e47cde336576be494f381bb1ed9c87371f3a26c4dc1a8d99ef4dc","slow_time":0.3943383773,"speedup":3.165580054003393,"stratum":"2-4","sampling_key":"188984e9e26ba326710d0b2aefac68130eee4b419846f9e688cf62ae2aa8928d","slow_code":"#include <iostream>\n\n#include <iomanip>\n\n#include <vector>\n\n#include <map>\n\n#include <algorithm>\n\n#include <string>\n\n#include <cstring>\n\n#include <queue>\n\n#include <cctype>\n\nusing namespace std;\n\n#define fr first\n\n#define sc second\n\ntypedef pair<int, int> Pt;\n\ntypedef pair<Pt, int> P;\n\nPt ST, GL;\n\nint h, w, c, used[20][20][1 << 10], d[] = {0, 1, 0, -1};\n\nchar mas[20][20];\n\nint bfs();\n\nint main() {\n\n  while (cin >> w >> h && w) {\n\n    c = 0;\n\n    for (int i = 0; i < h; i++) {\n\n      for (int j = 0; j < w; j++) {\n\n        cin >> mas[i][j];\n\n        if (mas[i][j] == 'o')\n          ST = Pt(i, j);\n\n        else if (mas[i][j] == '*')\n          mas[i][j] = c++;\n      }\n    }\n\n    cout << bfs() << endl;\n  }\n}\n\nint bfs() {\n\n  memset(used, -1, sizeof(used));\n\n  queue<P> que;\n\n  que.push(P(ST, 0));\n\n  used[ST.fr][ST.sc][0] = 0;\n\n  while (!que.empty()) {\n\n    P p = que.front();\n\n    que.pop();\n\n    if (p.sc == (1 << c) - 1)\n      return used[p.fr.fr][p.fr.sc][p.sc];\n\n    int log = used[p.fr.fr][p.fr.sc][p.sc];\n\n    for (int i = 0; i < 4; i++) {\n\n      int nx = d[i] + p.fr.fr, ny = d[3 - i] + p.fr.sc;\n\n      int bits = p.sc;\n\n      if (nx >= 0 && nx < h && ny >= 0 && ny < w) {\n\n        if (mas[nx][ny] == 'x')\n          continue;\n\n        if (mas[nx][ny] >= 0 && mas[nx][ny] < 10) {\n\n          bits |= 1 << mas[nx][ny];\n        }\n\n        if (used[nx][ny][bits] != -1)\n          continue;\n\n        que.push(P(Pt(nx, ny), bits));\n\n        used[nx][ny][bits] = log + 1;\n      }\n    }\n  }\n\n  return -1;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <queue>\n\n#include <cstring>\n\nusing namespace std;\n\n#define INF 1 << 29\n\ntypedef pair<int, int> Pi;\n\nint h, w;\n\nchar mas[50][50];\n\nint graph[11][11];\n\nint min_cost[50][50];\n\nPi gomi[11];\n\nint gomi_size, uoo;\n\nint memo[12][1 << 11];\n\nconst int dy[] = {1, 0, 0, -1}, dx[] = {0, 1, -1, 0};\n\nint rec(int idx, int used)\n\n{\n\n  if (used == (1 << gomi_size) - 1)\n    return 0;\n\n  if (memo[idx][used])\n    return memo[idx][used];\n\n  int ret = INF;\n\n  for (int i = 0; i < gomi_size; i++) {\n\n    if (!(used & (1 << i)) && graph[idx][i] != -1) {\n\n      ret = min(ret, rec(i, used | (1 << i)) + graph[idx][i]);\n    }\n  }\n\n  return memo[idx][used] = ret;\n}\n\nint bfs(Pi a, Pi b)\n\n{\n\n  memset(min_cost, -1, sizeof(min_cost));\n\n  queue<Pi> que;\n\n  que.push(a);\n\n  min_cost[a.first][a.second] = 0;\n\n  while (!que.empty()) {\n\n    Pi p = que.front();\n    que.pop();\n\n    if (p == b)\n      return min_cost[p.first][p.second];\n\n    for (int i = 0; i < 4; i++) {\n\n      int ny = p.first + dy[i], nx = p.second + dx[i];\n\n      if (ny < 0 || ny >= h || nx < 0 || nx >= w)\n        continue;\n\n      if (mas[ny][nx] != 'x' && min_cost[ny][nx] == -1) {\n\n        min_cost[ny][nx] = min_cost[p.first][p.second] + 1;\n\n        que.push(Pi(ny, nx));\n      }\n    }\n  }\n\n  return -1;\n}\n\nint main()\n\n{\n\n  while (cin >> w >> h, w) {\n\n    gomi_size = 0;\n\n    for (int i = 0; i < h; i++) {\n\n      for (int j = 0; j < w; j++) {\n\n        cin >> mas[i][j];\n\n        if (mas[i][j] == '*' || mas[i][j] == 'o') {\n\n          gomi[gomi_size++] = Pi(i, j);\n\n          if (mas[i][j] == 'o')\n            uoo = gomi_size - 1;\n        }\n      }\n    }\n\n    for (int i = 0; i < gomi_size; i++) {\n\n      for (int j = i + 1; j < gomi_size; j++) {\n\n        graph[i][j] = graph[j][i] = bfs(gomi[i], gomi[j]);\n      }\n    }\n\n    memset(memo, 0, sizeof(memo));\n\n    int ret = rec(uoo, 1 << uoo);\n\n    if (ret != INF)\n      cout << ret << endl;\n\n    else\n      cout << -1 << endl;\n  }\n\n  return (0);\n}"}
{"fast_code_id":"db29a620297231cb49e82f9da25a22a774b8136226805c25585280daca23f05d","fast_id":"ce2b506328dd0f05910e00a1be5c1127158e6b6a905f27ae1c5370c7d9a9acb6","fast_time":0.0068675433,"language":"cpp","measured_fast_code_id":"ce2b506328dd0f05910e00a1be5c1127158e6b6a905f27ae1c5370c7d9a9acb6","measured_slow_code_id":"9840123f8cb2dcbcd292f51134d3207a2fd8f1df9d06c99be5455588cfdba0a9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38742","problem_id":"p03647","slow_code_id":"dea9ad3f4712e60e920ecdf7190ac95539c4fa110d3b92c1147b5bd64b4e79df","slow_id":"9840123f8cb2dcbcd292f51134d3207a2fd8f1df9d06c99be5455588cfdba0a9","slow_time":0.2348066283,"speedup":34.1907750767294,"stratum":"8+","sampling_key":"178388708085c092f6811092c0fbbeee9fa99b322b47330259c66fb25dd67e9d","slow_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\nvector<int> p[200010];\n\nint main()\n\n{\n\n  int n, m, i, j, k, x, y, flag = 0;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (i = 0; i < m; i++)\n\n  {\n\n    scanf(\"%d%d\", &x, &y);\n\n    p[x].push_back(y);\n\n    p[y].push_back(x);\n  }\n\n  for (i = 0; i < p[1].size(); i++)\n\n  {\n\n    k = p[1][i];\n\n    for (j = 0; j < p[k].size(); j++)\n\n      if (p[k][j] == n)\n\n      {\n\n        flag = 1;\n\n        break;\n      }\n  }\n\n  if (flag)\n\n    printf(\"POSSIBLE\\n\");\n\n  else\n\n    printf(\"IMPOSSIBLE\\n\");\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <stdlib.h>\n\nint cmp(const void *p, const void *q)\n\n{\n\n  return (*(int *)p - *(int *)q);\n}\n\nint a[300000], b[300000], c[300000], d[300000];\n\nint main()\n\n{\n\n  int n, m, i, j, k, l, r, z;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (k = j = i = 0; i < m; i++)\n\n  {\n\n    scanf(\"%d%d\", &a[i], &b[i]);\n\n    if (a[i] == 1)\n\n      c[j++] = b[i];\n\n    if (b[i] == n)\n\n      d[k++] = a[i];\n  }\n\n  z = 0;\n\n  if (c[0] != 0 && d[0] != 0)\n\n  {\n\n    qsort(c, j, sizeof(c[0]), cmp);\n\n    qsort(d, k, sizeof(d[0]), cmp);\n\n    for (z = i = 0; i < j; i++)\n\n    {\n\n      l = 0;\n      r = k - 1;\n\n      while (l <= r)\n\n      {\n\n        int m = (l + r) / 2;\n\n        if (d[m] < c[i])\n\n          l = m + 1;\n\n        else if (d[m] > c[i])\n\n          r = m - 1;\n\n        else\n\n        {\n\n          z = 1;\n\n          break;\n        }\n      }\n    }\n  }\n\n  if (z)\n\n    printf(\"POSSIBLE\\n\");\n\n  else\n\n    printf(\"IMPOSSIBLE\\n\");\n\n  return 0;\n}\n"}
{"fast_code_id":"dd3c094aae5749cc53d10f9a36cae74dfc95bcb1e28d96f672802531b875121f","fast_id":"1e0cf4845bdce2a1ecdb9c1be4496652d2b081bbd0af9315f8cfbfb825a303cb","fast_time":0.1054546716,"language":"cpp","measured_fast_code_id":"1e0cf4845bdce2a1ecdb9c1be4496652d2b081bbd0af9315f8cfbfb825a303cb","measured_slow_code_id":"452206e705b31402ccdf62639558f025dbc457c1de1f5e07932d8c6672aaa93e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38781","problem_id":"p01537","slow_code_id":"0e49294927fce4c4908c9373e4f5ef87145df6b53fd97e8336ff7ea6ece8f789","slow_id":"452206e705b31402ccdf62639558f025dbc457c1de1f5e07932d8c6672aaa93e","slow_time":0.7434745993,"speedup":7.050181732299853,"stratum":"4-8","sampling_key":"03cd76db79aee9d4c4ba4144d56a37ad02d8134a0bb5e600a827ee9036fb80e0","slow_code":"#define _CRT_SECURE_NO_WARNINGS\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <ctime>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <sstream>\n\n#include <utility>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<int> vi;\n\ntypedef vector<vi> vvi;\n\ntypedef pair<int, int> pii;\n\n#define all(c) (c).begin(), (c).end()\n\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n\n#define rep(i, b) loop(i, 0, b)\n\n#define each(e, c) for (auto &e : c)\n\n#define pb push_back\n\n#define eb emplace_back\n\n#define mp make_pair\n\n#define mt make_tuple\n\n#define lb lower_bound\n\n#define ub upper_bound\n\n#ifdef DEBUG\n\n#define dump(...)                                                                                  \\\n  (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" << __LINE__ << \"]\" << endl)\n\nstruct DUMP : ostringstream {\n  template <class T> DUMP &operator,(const T &t) {\n    if (this->tellp())\n      *this << \", \";\n    *this << t;\n    return *this;\n  }\n};\n\n#else\n\n#define dump(...)\n\n#endif\n\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n\n  rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n\n  return os;\n}\n\n#include <complex>\n\n#include <cstdio>\n\n#include <string>\n\n#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define curr(g, i) g[i]\n\n#define next(g, i) g[(i + 1) % g.size()]\n\n#define self (*this)\n\ntypedef long double R;\n\nconst R eps = 1e-10;\n\nconst R inf = 1e12;\n\nconst R pi = acos(-1);\n\ntypedef complex<R> P;\n\nR arg(P a, P b, P c) {\n  R th = arg((a - b) / (c - b));\n  return th > 0 ? th : th + 2 * pi;\n}\n\nbool comp_x(P const &a, P const &b) {\n  return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\n\nbool comp_y(P const &a, P const &b) {\n  return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\n\nP CENTER = P();\n\nbool comp_arg(P const &a, P const &b) {\n  return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\n\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n}                 \n\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\n\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\n\nstruct L : public vector<P> {\n\n  L(P const &a = P(), P const &b = P()) {\n    push_back(a);\n    push_back(b);\n  }\n\n  L(R a, R b, R c) {\n\n    if (fabs(a) < eps)\n      self = L(P(0, -c / b), P(1, -c / b));\n\n    else if (fabs(b) < eps)\n      self = L(P(-c / a, 0), P(-c / a, 1));\n\n    else\n      self = L(P(-c / a, 0), P(0, -c / b));\n  }\n\n  P vec() const { return self[1] - self[0]; }\n};\n\nstruct S : public vector<P> {\n\n  S(P const &a = P(), P const &b = P()) {\n    push_back(a);\n    push_back(b);\n  }\n\n  L line() const { return L(self[0], self[1]); }\n\n  P vec() const { return line().vec(); }\n\n  R len() const { return abs(vec()); }\n};\n\ntypedef vector<P> G;\n\nstruct C {\n\n  P p;\n  R r;\n\n  C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\n\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\n\nint ccw(P a, P b, P c) {\n\n  b -= a;\n  c -= a;\n\n  if (cross(b, c) > 0)\n    return CCW;\n\n  if (cross(b, c) < 0)\n    return CW;\n\n  if (dot(b, c) < 0)\n    return CAB;\n\n  if (norm(b) < norm(c))\n    return ABC;\n\n  return SEG;\n}\n\nR area(C const &c) { return pi * c.r * c.r; }\n\nR area(G const &g) {\n  R res = 0;\n  int n = g.size();\n  rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n  return abs(res) / 2;\n}\n\nR heron(R a, R b, R c) {\n  R s = (a + b + c) / 2;\n  return sqrt(s * (s - a) * (s - b) * (s - c));\n}\n\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n\n  return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\n\nP gravity_center(P const &a, P const &b, P const &c) { return biased_center(a, b, c, 1, 1, 1); }\n\nP inner_center(P const &a, P const &b, P const &c) {\n\n  R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n\n  return biased_center(a, b, c, la, lb, lc);\n}\n\nP circumcenter(P const &a, P const &b, P const &c) {\n\n  R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)), sc = sin(2 * arg(b, c, a));\n\n  return biased_center(a, b, c, sa, sb, sc);\n}\n\nP orthocenter(P const &a, P const &b, P const &c) {\n\n  if (abs(arg(c, a, b)) == pi)\n    return a;\n\n  if (abs(arg(a, b, c)) == pi)\n    return b;\n\n  if (abs(arg(b, c, a)) == pi)\n    return c;\n\n  R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n\n  return biased_center(a, b, c, ta, tb, tc);\n}\n\nP excenter(P const &a, P const &b, P const &c) {\n\n  R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n\n  return biased_center(a, b, c, -sa, sb, sc);\n}\n\nbool col(L const &l, L const &m) {\n  return abs(cross(l.vec(), m.vec())) > eps || abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\n\nbool col(L const &l, S const &s) {\n  return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\n\nbool col(S const &s, L const &l) { return col(l, s); }\n\nbool col(L const &l, P const &p) { return abs(cross(l[1] - p, l[0] - p)) < eps; }\n\nbool col(P const &p, L const &l) { return col(l, p); }\n\nbool col(const S &s, const S &t) {\n  return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n         ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\n\nbool col(const S &s, const P &p) { return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps; }\n\nint col(const C &c1, const C &c2) {\n\n  R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n\n  if (r1 + r2 < d)\n    return 0;\n\n  if (abs(r1 + r2 - d) < eps)\n    return 1;\n\n  if (abs(d - abs(r1 - r2)) < eps)\n    return -1;\n\n  if (d < r1 - r2)\n    return +3;\n\n  if (d < r2 - r1)\n    return -3;\n\n  return 2;\n}\n\nP proj(L const &l, P const &p) {\n  R t = dot(p - l[0], l.vec()) / norm(l.vec());\n  return l[0] + t * (l.vec());\n}\n\nP proj(P const &p, L const &l) { return proj(l, p); }\n\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\n\nP refl(P const &p, L const &l) { return refl(l, p); }\n\nR dist(P const &p, P const &q) { return abs(p - q); }\n\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\n\nR dist(P const &p, L const &l) { return dist(l, p); }\n\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\n\nR dist(L const &l, S const &s) { return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1])); }\n\nR dist(S const &s, L const &l) { return dist(l, s); }\n\nR dist(S const &s, P const &p) {\n  P const r = proj(s.line(), p);\n  return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\n\nR dist(P const &p, S const &s) { return dist(s, p); }\n\nR dist(S const &s, S const &t) {\n  return col(s, t) ? 0 : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])), dist(t, s[1]));\n}\n\nvector<P> hit(L const &l, L const &m) {\n\n  R A = cross(l.vec(), m.vec());\n\n  R B = cross(l.vec(), l[1] - m[0]);\n\n  if (abs(A) < eps && abs(B) < eps)\n    return {m[0]};\n\n  if (abs(A) < eps)\n    return G();\n\n  return {m[0] + B / A * (m.vec())};\n}\n\nvector<P> hit(S const &s, S const &t) { return col(s, t) ? hit(s.line(), t.line()) : G(); }\n\nvector<P> hit(L const &l, S const &s) { return col(l, s) ? hit(l, s.line()) : G(); }\n\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\n\nvector<P> hit(C const &c, L const &l) {\n\n  R d = dist(l, c.p);\n\n  if (fabs(d - c.r) < eps)\n    return {proj(l, c.p)};\n\n  if (d > c.r)\n    return G();\n\n  P h = proj(l, c.p);\n\n  P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n\n  return {h + u, h - u};\n}\n\nvector<P> hit(C const &c, S const &s) {\n  G cps = hit(c, s.line()), res;\n  for (const P &p : cps)\n    if (col(s, p))\n      res.push_back(p);\n  return res;\n}\n\nvector<P> hit(C const &c1, C const &c2) {\n\n  if (abs(c1.p - c2.p) < 0)\n    return G();\n\n  int i = col(c1, c2);\n\n  if (i == 0 || abs(i) == 3)\n    return G();\n\n  R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n\n  if (i == 1)\n    return {c1.p + (c2.p - c1.p) * r1 / d};\n\n  P p = c1.p - c2.p;\n\n  R A = -2. * p.real(), B = 2 * p.imag();\n\n  R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n\n  return hit(c1, L(A, B, C));\n}\n\nvector<P> hit(C const &c, G const &g) {\n\n  vector<P> res;\n  int n = g.size();\n\n  rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n\n  return res;\n}\n\nC min_ball(G const &g) {\n\n  int n = g.size();\n\n  if (n == 1)\n    return C(g[0], 0);\n\n  if (n == 2)\n    return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n\n  P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n\n  R r = 1.0;\n\n  rep(i, 1000) {\n\n    R d = 0;\n\n    int x = 0;\n\n    rep(j, n) {\n\n      if (d < abs(g[j] - c)) {\n\n        d = abs(g[j] - c);\n\n        x = j;\n      }\n    }\n\n    c += (g[x] - c) * r;\n\n    if (i & 2)\n      r *= 0.8;\n  }\n\n  R d = -1;\n\n  int x = 0;\n\n  rep(i, n) {\n\n    if (d < abs(c - g[i])) {\n\n      d = abs(c - g[i]);\n      x = i;\n    }\n  }\n\n  return C(c, abs(c - g[x]));\n}\n\nint n, m;\n\nR r[111], mb[111];\n\nvi ans;\n\nbool used[111];\n\nbool chk(int s) {\n\n  vi b;\n\n  rep(i, n) if (!used[i]) b.eb(r[i]);\n\n  vector<R> a;\n\n  loop(i, s, m) a.eb(mb[i]);\n\n  sort(all(a));\n\n  sort(all(b));\n\n  int last = -1;\n\n  rep(i, a.size()) {\n\n    bool found = false;\n\n    loop(j, last + 1, b.size()) {\n\n      if (a[i] < b[j] + eps) {\n\n        found = true;\n\n        last = j;\n\n        break;\n      }\n    }\n\n    if (!found)\n      return false;\n  }\n\n  return true;\n}\n\nint main() {\n\n#ifdef LOCAL\n\n  freopen(\"in\", \"r\", stdin);\n\n#endif\n\n  while (cin >> n >> m) {\n\n    ans.clear();\n\n    rep(i, n) cin >> r[i];\n\n    rep(i, m) {\n\n      int k;\n      cin >> k;\n\n      G g(k);\n\n      rep(j, k) {\n\n        R x, y;\n\n        cin >> x >> y;\n\n        g[j] = P(x, y);\n      }\n\n      mb[i] = min_ball(g).r;\n    }\n\n    rep(i, m) used[i] = false;\n\n    bool f = true;\n\n    rep(i, m) {\n\n      bool found = false;\n\n      rep(j, n) {\n\n        if (used[j])\n          continue;\n\n        if (!(mb[i] < r[j] + eps))\n          continue;\n\n        used[j] = true;\n\n        if (chk(i + 1)) {\n\n          ans.push_back(j);\n\n          found = true;\n\n          break;\n        }\n\n        used[j] = false;\n      }\n\n      if (!found) {\n\n        f = false;\n        break;\n      }\n    }\n\n    if (f) {\n\n      rep(i, m) cout << ans[i] + 1 << \"\\n\";\n\n    }\n\n    else\n      cout << \"NG\" << endl;\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define all(c) begin(c), end(c)\n\n#define dump(x) cerr << __LINE__ << \":\\t\" #x \" = \" << x << endl\n\nusing ld = long double;\n\nusing P = complex<ld>;\n\nusing G = vector<P>;\n\nconst ld pi = acos(-1);\n\nconst ld eps = 1e-10;\n\nconst ld inf = 1e12;\n\nld cross(const P &a, const P &b) {\n  return a.real() * b.imag() - a.imag() * b.real();\n}\n\nld dot(const P &a, const P &b) {\n  return a.real() * b.real() + a.imag() * b.imag();\n}\n\nusing C = pair<ld, P>;\n\n#define rad first\n\n#define pnt second\n\nC smallest_enclosing_disc(vector<P> ps) {\n\n  auto c3 = [](const P &a, const P &b, const P &c) {\n    ld A = norm(b - c);\n\n    ld B = norm(c - a);\n\n    ld C = norm(a - b);\n\n    ld S = abs(cross(b - a, c - a));\n\n    P p = (A * (B + C - A) * a + B * (C + A - B) * b + C * (A + B - C) * c) /\n          (4 * S * S);\n\n    ld r = abs(p - a);\n\n    return make_pair(r, p);\n  };\n\n  auto c2 = [](const P &a, const P &b) {\n    P c = (a + b) / (ld)2;\n\n    ld r = abs(a - c);\n\n    return make_pair(r, c);\n  };\n\n  auto in_circle = [](const P &a, const C &c) {\n    return norm(a - c.pnt) <= c.rad * c.rad + eps;\n  };\n\n  int n = ps.size();\n\n  random_shuffle(ps.begin(), ps.end());\n\n  C c = c2(ps[0], ps[1]);\n\n  for (int i = 2; i < n; ++i) {\n\n    if (!in_circle(ps[i], c)) {\n\n      c = c2(ps[0], ps[i]);\n\n      for (int j = 1; j < i; ++j) {\n\n        if (!in_circle(ps[j], c)) {\n\n          c = c2(ps[j], ps[i]);\n\n          for (int k = 0; k < j; ++k) {\n\n            if (!in_circle(ps[k], c)) {\n\n              c = c3(ps[i], ps[j], ps[k]);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  return c;\n}\n\nint n, m;\n\nld r[111], mb[111];\n\nbool used[111];\n\nbool chk(int s) {\n\n  vector<int> b;\n\n  rep(i, n) if (!used[i]) b.emplace_back(r[i]);\n\n  vector<ld> a;\n\n  for (int i = s; i < m; ++i)\n    a.emplace_back(mb[i]);\n\n  sort(all(a));\n\n  sort(all(b));\n\n  int last = -1;\n\n  rep(i, a.size()) {\n\n    bool found = false;\n\n    for (int j = last + 1; j < (int)b.size(); ++j) {\n\n      if (a[i] < b[j] + eps) {\n\n        found = true;\n\n        last = j;\n\n        break;\n      }\n    }\n\n    if (!found)\n      return false;\n  }\n\n  return true;\n}\n\nint main() {\n\n  vector<int> ans;\n\n  cin >> n >> m;\n\n  rep(i, n) cin >> r[i];\n\n  rep(i, m) {\n\n    int k;\n    cin >> k;\n\n    G g(k);\n\n    rep(j, k) {\n\n      ld x, y;\n\n      cin >> x >> y;\n\n      g[j] = P(x, y);\n    }\n\n    mb[i] = smallest_enclosing_disc(g).rad;\n  }\n\n  rep(i, m) used[i] = false;\n\n  bool f = true;\n\n  rep(i, m) {\n\n    bool found = false;\n\n    rep(j, n) {\n\n      if (used[j])\n        continue;\n\n      if (!(mb[i] < r[j] + eps))\n        continue;\n\n      used[j] = true;\n\n      if (chk(i + 1)) {\n\n        ans.push_back(j);\n\n        found = true;\n\n        break;\n      }\n\n      used[j] = false;\n    }\n\n    if (!found) {\n\n      f = false;\n      break;\n    }\n  }\n\n  if (f) {\n\n    rep(i, m) cout << ans[i] + 1 << \"\\n\";\n\n  } else {\n\n    cout << \"NG\" << endl;\n  }\n}"}
{"fast_code_id":"343738050b2b67e1f3a2b5d71345fce30ed6905e395be4a968912ae0918cba50","fast_id":"5b87f8ec4ad7bc12579d259a0c7914ef5c856ed18a14deaf388acbf73a93ea86","fast_time":0.0554904622,"language":"cpp","measured_fast_code_id":"5b87f8ec4ad7bc12579d259a0c7914ef5c856ed18a14deaf388acbf73a93ea86","measured_slow_code_id":"147429faf0a8ecf74034fe19945c9b2b45ff1c94b27f8cdbd226826775460ec4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38783","problem_id":"p01089","slow_code_id":"96931f486586b49e942e85505f0d3e03c949452b1ad94dc6f8aa7a0b2e71a270","slow_id":"147429faf0a8ecf74034fe19945c9b2b45ff1c94b27f8cdbd226826775460ec4","slow_time":0.1499774465,"speedup":2.702760808865636,"stratum":"2-4","sampling_key":"7e1a1d6f64af3e086ea7d2efc85ec50a9e00b13314de721b8d553a454d9ded64","slow_code":"#include <bits/stdc++.h>\n\n#define INF 1e9\n\nusing namespace std;\n\nvector<vector<int> > A;\n\nvoid Min(int &a, int b) { a = min(a, b); }\n\nbool DP() {\n\n  sort(A.begin(), A.end());\n\n  A.erase(unique(A.begin(), A.end()), A.end());\n\n  int n = A.size();\n\n  for (int i = 0; i < n; i++)\n\n    for (int j = 0, used[10] = {}; j < A[i].size(); j++)\n      if (used[A[i][j]]++)\n        return 1;\n\n  vector<vector<int> > dp(1 << 10, vector<int>(1 << 10, INF));\n\n  dp[0][0] = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    for (int j = (1 << 10) - 1; j >= 0; j--)\n\n      for (int k = (1 << 10) - 1; k >= 0; k--) {\n\n        if (dp[j][k] == INF || dp[j][k] == 10)\n          continue;\n\n        if ((j && k) && __builtin_popcount(j & k) == dp[j][k])\n          return 1;\n\n        for (int l = 0, nj = j; l < (int)A[i].size(); l++) {\n\n          int num = A[i][l];\n\n          if (l)\n            Min(dp[nj][k | (1 << num)], dp[j][k] + 1);\n\n          if (j & (1 << num))\n            break;\n\n          nj |= (1 << num);\n\n          Min(dp[nj][k], dp[j][k] + 1);\n        }\n      }\n  }\n\n  for (int i = 1; i < (1 << 10); i++)\n\n    for (int j = 1; j < (1 << 10); j++) {\n\n      if (__builtin_popcount(i & j) == dp[i][j])\n        return 1;\n    }\n\n  return 0;\n}\n\ntypedef pair<int, int> P;\n\nbool bfs() {\n\n  sort(A.begin(), A.end());\n\n  A.erase(unique(A.begin(), A.end()), A.end());\n\n  int n = A.size();\n\n  for (int i = 0; i < n; i++)\n\n    for (int j = 0, used[10] = {}; j < A[i].size(); j++)\n      if (used[A[i][j]]++)\n        return 1;\n\n  queue<P> Q;\n\n  vector<vector<int> > D(1 << 10, vector<int>(1 << 10, INF));\n\n  D[0][0] = 0;\n\n  Q.push(P(0, 0));\n\n  while (!Q.empty()) {\n\n    P t = Q.front();\n    Q.pop();\n\n    int I = t.first, J = t.second;\n\n    if (I && J && __builtin_popcount(I & J) == D[I][J])\n      return 1;\n\n    if (D[I][J] == 10)\n      continue;\n\n    for (int i = 0; i < n; i++) {\n\n      for (int l = 0, ni = I; l < (int)A[i].size(); l++) {\n\n        int num = A[i][l];\n\n        if (l && D[ni][J | (1 << num)] == INF) {\n\n          D[ni][J | (1 << num)] = D[I][J] + 1;\n\n          Q.push(P(ni, J | (1 << num)));\n        }\n\n        if (I & (1 << num))\n          break;\n\n        ni |= (1 << num);\n\n        if (D[ni][J] == INF)\n          D[ni][J] = D[I][J] + 1, Q.push(P(ni, J));\n      }\n    }\n  }\n\n  return 0;\n}\n\nint main() {\n\n  int n;\n\n  while (cin >> n, n) {\n\n    string str;\n\n    cin >> str;\n\n    A.clear();\n\n    for (int i = 0; i < str.size(); i++) {\n\n      A.push_back(vector<int>());\n\n      while (str[i] != 'u')\n        A.back().push_back(str[i++] - '0');\n    }\n\n    cout << (bfs() ? \"UN\" : \"\") << \"SAFE\" << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define INF 1e9\n\nusing namespace std;\n\nvector<vector<int> > A;\n\ntypedef pair<short, short> P;\n\nbool bfs() {\n\n  sort(A.begin(), A.end());\n\n  A.erase(unique(A.begin(), A.end()), A.end());\n\n  int n = A.size();\n\n  for (int i = 0; i < n; i++)\n\n    for (int j = 0, used[10] = {}; j < A[i].size(); j++)\n      if (used[A[i][j]]++)\n        return 1;\n\n  queue<P> Q;\n\n  bool D[1 << 10][1 << 10] = {};\n\n  D[0][0] = 1;\n\n  Q.push(P(0, 0));\n\n  while (!Q.empty()) {\n\n    P t = Q.front();\n    Q.pop();\n\n    int I = t.first, J = t.second;\n\n    if (I && J && __builtin_popcount(I & J) == __builtin_popcount(J))\n      return 1;\n\n    for (int i = 0; i < n; i++) {\n\n      for (int k = 0, ni = I; k < A[i].size(); k++) {\n\n        int num = A[i][k], nj = (J | 1 << num);\n\n        if (k && D[ni][nj] == 0 && J != nj)\n          D[ni][nj] = 1, Q.push(P(ni, nj));\n\n        if (I & (1 << num))\n          break;\n\n        ni |= (1 << num);\n      }\n    }\n  }\n\n  return 0;\n}\n\nint main() {\n\n  int n;\n\n  while (cin >> n, n) {\n\n    string str;\n\n    cin >> str;\n\n    A.clear();\n\n    for (int i = 0; i < str.size(); i++) {\n\n      A.push_back(vector<int>());\n\n      while (str[i] != 'u')\n        A.back().push_back(str[i++] - '0');\n    }\n\n    cout << (bfs() ? \"UN\" : \"\") << \"SAFE\" << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"57eb41a312d2ddf593f20f5bcf25e8e3447d2e50caf33e31b6774dc88d6ebade","fast_id":"ea74b73c55846f4616421bc067193773e8a3a91895e399c2f1230b5002f22d81","fast_time":0.0001868158,"language":"cpp","measured_fast_code_id":"ea74b73c55846f4616421bc067193773e8a3a91895e399c2f1230b5002f22d81","measured_slow_code_id":"af80bec633b0aab1dcd669c085e46da7983f617a023df5949d72fb9b0d5934fd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_38920","problem_id":"p03673","slow_code_id":"46175438dd7e7d300893cd92b213071c202376d2027eb242c9f719a143b9b4c3","slow_id":"af80bec633b0aab1dcd669c085e46da7983f617a023df5949d72fb9b0d5934fd","slow_time":0.0018264729,"speedup":9.776865233026328,"stratum":"8+","sampling_key":"5e4da1f094fea79fd48c72a1709721fffde37e20ba06e1385e636d3cfc262c19","slow_code":"#include <bits/stdc++.h>\n\n#define INF 200001\n\nusing namespace std;\n\ninline int read()\n\n{\n\n  register int number_read = 0, if_ok_read = 1;\n\n  char ch_read = getchar();\n\n  while (ch_read < '0' || ch_read > '9')\n\n  {\n\n    if (ch_read == '-')\n\n      if_ok_read = -1;\n\n    ch_read = getchar();\n  }\n\n  while (ch_read >= '0' && ch_read <= '9')\n\n  {\n\n    number_read = number_read * 10 + ch_read - '0';\n\n    ch_read = getchar();\n  }\n\n  return number_read * if_ok_read;\n}\n\ninline void write(register int x_write)\n\n{\n\n  if (x_write < 0)\n\n  {\n\n    putchar('-');\n\n    x_write = -x_write;\n  }\n\n  if (x_write > 9)\n\n    write(x_write / 10);\n\n  putchar(x_write % 10 + '0');\n\n  return;\n}\n\nint main()\n\n{\n\n  int n = read(), a[INF] = {0};\n\n  for (int i = 0; i < n; i++)\n\n    a[i] = read();\n\n  for (int i = n - 1; i >= 0; i -= 2)\n\n  {\n\n    write(a[i]);\n\n    putchar(' ');\n  }\n\n  for (int i = (n & 1); i < n; i += 2)\n\n  {\n\n    write(a[i]);\n\n    putchar(' ');\n  }\n\n  putchar('\\n');\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\nint n, a[200010];\n\ninline int read() {\n\n  register int ret = 0;\n  char c = getchar();\n\n  while (c < '0' || c > '9')\n    c = getchar();\n\n  while (c >= '0' && c <= '9')\n    ret = (ret << 1) + (ret << 3) + (c ^ 48), c = getchar();\n\n  return ret;\n}\n\nint main()\n\n{\n\n  n = read();\n\n  for (register int i = 1; i <= n; ++i)\n    a[i] = read();\n\n  for (register int i = n; i > 0; i -= 2)\n    printf(\"%d \", a[i]);\n\n  for (register int i = (n & 1) + 1; i <= n; i += 2)\n    printf(\"%d \", a[i]);\n\n  return 0;\n}"}
{"fast_code_id":"8ee0c7cd0cab8907238a2fad4f9aad9f031b3fda29b166b9b136dfacf3e5d2e4","fast_id":"5910224bd9a1f681dc8faca7882a5452eb85cd8fdc1edd7a53aa42de0567959e","fast_time":0.0065745365,"language":"cpp","measured_fast_code_id":"5910224bd9a1f681dc8faca7882a5452eb85cd8fdc1edd7a53aa42de0567959e","measured_slow_code_id":"0f63ab51a531719ff5754708af4da44e15d1fbcbc7d3837f1a63767fbbdb3c9c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39075","problem_id":"p03295","slow_code_id":"e1866dca6afcef9b391699729aaa946b103b3fc216f776816b3b2ac7476d164e","slow_id":"0f63ab51a531719ff5754708af4da44e15d1fbcbc7d3837f1a63767fbbdb3c9c","slow_time":0.1095450019,"speedup":16.66201136764546,"stratum":"8+","sampling_key":"12eeddc1ef070401c02a9cb98edc7b677f3a2be028f231b07b4daf766351ec16","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool cmp(pair<int, int> A, pair<int, int> B) {\n\n  if (A.second == B.second)\n\n    return A.first < B.first;\n\n  return A.second < B.second;\n}\n\nint main() {\n\n  int n, m;\n\n  vector<pair<int, int> > v(m);\n\n  scanf(\"%d %d\", &n, &m);\n\n  for (int i = 0; i < m; i++) {\n\n    int a, b;\n\n    scanf(\"%d %d\", &a, &b);\n\n    v.push_back(make_pair(a, b));\n  }\n\n  sort(v.begin(), v.end(), cmp);\n\n  int ans = 1;\n\n  int cur = v[0].second;\n\n  for (int i = 1; i < m; i++) {\n\n    if (v[i].first >= cur) {\n\n      ans++;\n\n      cur = v[i].second;\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define ll long long\n\n#define INF 0x3f3f3f3f\n\nstruct po {\n\n  int a, b;\n\n} f[100010];\n\nbool cmp(po x, po y)\n\n{\n\n  if (x.a == y.a)\n\n    return x.b < y.b;\n\n  return x.a < y.a;\n}\n\nint main()\n\n{\n\n  int n, m, ans = 0, t = INF;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++)\n\n    scanf(\"%d%d\", &f[i].a, &f[i].b);\n\n  sort(f + 1, f + 1 + m, cmp);\n\n  for (int i = m; i >= 1; i--)\n\n  {\n\n    if (f[i].a != f[i - 1].a && f[i].b <= t)\n\n    {\n\n      ans++;\n\n      t = f[i].a;\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"957a0b711b6677bee0d77f0bebf682366f22681c90108fd8ed15d35296269272","fast_id":"17c2e45db3544e9fb5570daf93c2979ca1fb48867bfd6e7b4f40d1de2317531f","fast_time":0.0127129697,"language":"cpp","measured_fast_code_id":"17c2e45db3544e9fb5570daf93c2979ca1fb48867bfd6e7b4f40d1de2317531f","measured_slow_code_id":"871048cf077ddcea4a3a9f5ee9c535a0fde78b6a0ca75bb40c08d5031523c839","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39108","problem_id":"p00033","slow_code_id":"6df392cf097f44e27fdec6319520bf7e8e931a3b133b72a738560866f129ab73","slow_id":"871048cf077ddcea4a3a9f5ee9c535a0fde78b6a0ca75bb40c08d5031523c839","slow_time":0.0671792859,"speedup":5.284311021365841,"stratum":"4-8","sampling_key":"37eb8267f261fcc1bdf05578be926fd70657f99fd7b8ee6ea63cabaedee29e1d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint a[20];\n\nbool check(int x)\n\n{\n\n  int pre = 0;\n\n  for (int i = 0; i < 10; i++)\n    if (x & (1 << i))\n\n    {\n\n      if (a[i] < pre)\n        return false;\n\n      pre = a[i];\n    }\n\n  return true;\n}\n\nbool dfs(int i, int x, int pre)\n\n{\n\n  if (i == 10)\n\n  {\n\n    return check(x);\n  }\n\n  bool temp = false;\n\n  if (a[i] > pre)\n    temp = dfs(i + 1, x, a[i]);\n\n  return temp || dfs(i + 1, x | (1 << i), pre);\n}\n\nint main()\n\n{\n\n  int T;\n\n  cin >> T;\n\n  while (T--)\n\n  {\n\n    for (int i = 0; i < 10; i++)\n      scanf(\"%d\", &a[i]);\n\n    printf(\"%s\\n\", dfs(1, 0, a[0]) ? \"YES\" : \"NO\");\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nint a, l1, l2, n;\n\nbool f;\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    f = 0;\n    l1 = 0;\n    l2 = -1;\n\n    for (int j = 1; j <= 10; j++)\n\n    {\n\n      scanf(\"%d\", &a);\n\n      if (!f && a < l2 && a < l1) {\n        printf(\"NO\\n\");\n        f = 1;\n        continue;\n      }\n\n      if (!f && l1 > l2)\n\n      {\n\n        if (l1 < a)\n          l1 = a;\n\n        else\n          l2 = a;\n      }\n\n      if (!f && l2 > l1)\n\n      {\n\n        if (l2 < a)\n          l2 = a;\n\n        else\n          l1 = a;\n      }\n    }\n\n    if (!f)\n      printf(\"YES\\n\");\n  }\n}"}
{"fast_code_id":"0d37c5eb8482c6208e275bfac5f69951216d02bd1d4b7f5cea59cac3afc164c7","fast_id":"79c4726c2e9afdcafb4d325f5b3dfaa0f03d6cef162e13f01a995e110cee24ed","fast_time":0.012871575,"language":"cpp","measured_fast_code_id":"79c4726c2e9afdcafb4d325f5b3dfaa0f03d6cef162e13f01a995e110cee24ed","measured_slow_code_id":"8f99a2cace7b1d32840f31c38ff74da5d1f9c631c61fff90181b4fee25978c77","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39115","problem_id":"p03629","slow_code_id":"1a26fc375c876bb3c002b35704b7119bc9d841532cefc3087d78844fb05545f5","slow_id":"8f99a2cace7b1d32840f31c38ff74da5d1f9c631c61fff90181b4fee25978c77","slow_time":0.3415405459,"speedup":26.534479727616862,"stratum":"8+","sampling_key":"675d838ba65a6c69ca6350fecb899b7b1d3ee07b39401d073d3faf178c817404","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long lint;\n\ntypedef long double louble;\n\ntemplate <typename T1, typename T2> inline T1 max(T1 a, T2 b) { return a < b ? b : a; }\n\ntemplate <typename T1, typename T2> inline T1 min(T1 a, T2 b) { return a < b ? a : b; }\n\nnamespace ae86\n\n{\n\nconst int bufl = 1 << 15;\n\nchar buf[bufl], *s = buf, *t = buf;\n\ninline int fetch()\n\n{\n\n  if (s == t) {\n    t = (s = buf) + fread(buf, 1, bufl, stdin);\n    if (s == t)\n      return EOF;\n  }\n\n  return *s++;\n}\n\ninline int ty()\n\n{\n\n  int a = 0, b = 1, c = fetch();\n\n  while (!isdigit(c))\n    b ^= c == '-', c = fetch();\n\n  while (isdigit(c))\n    a = a * 10 + c - 48, c = fetch();\n\n  return b ? a : -a;\n}\n\ntemplate <typename T>\ninline int ts(T *s)\n\n{\n\n  int a = 0, c = fetch();\n\n  while (c <= 32 && c != EOF)\n    c = fetch();\n\n  while (c > 32 && c != EOF)\n    s[a++] = c, c = fetch();\n\n  return a;\n}\n\n}                  \n\nusing ae86::ty;\n\nusing ae86::ts;\n\nconst int alp = 26, _ = 500007;\n\nint n, s[_], las[alp], f[_], wha[_], nex[_];\n\nint main()\n\n{\n\n  n = ts(s);\n\n  for (int i = 0; i < n; i++)\n    s[i] -= 'a';\n\n  for (int i = 0; i < alp; i++)\n    las[i] = n;\n\n  memset(f, 63, sizeof(f)), memset(nex, 63, sizeof(nex));\n\n  f[n + 1] = 0;\n\n  for (int i = n - 1; i >= 0; i--)\n\n  {\n\n    las[s[i]] = i;\n\n    for (int j = 0; j < alp; j++)\n\n      if (f[i] > f[las[j] + 1] + 1)\n\n        f[i] = f[las[j] + 1] + 1, wha[i] = j, nex[i] = las[j] + 1;\n  }\n\n  int now = 0;\n\n  while (now < n)\n    putchar('a' + wha[now]), now = nex[now];\n\n  puts(\"\");\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#define N 200002\n\n#define M 26\n\nchar s[N], a[N], f[N];\n\nint head[M] = {0}, last[N][M], c[N], l;\n\nint dfs(int p, int d)\n\n{\n\n  int i, td = d + 1, tp;\n\n  a[d] = s[p], f[d] = 1;\n\n  for (i = 0; i < M; i++) {\n\n    if (d + c[tp = last[p][i]] < l) {\n\n      if (tp) {\n\n        if (td < l && dfs(tp, td))\n          return 1;\n\n      }\n\n      else {\n\n        a[td] = i + 97, f[td] = 1;\n\n        return 1;\n      }\n    }\n  }\n\n  f[d] = 0;\n\n  return 0;\n}\n\nint main()\n\n{\n\n  int i, j, m, t, mp, tp;\n\n  scanf(\"%s\", s + 1);\n\n  l = strlen(s + 1);\n\n  for (i = l, c[0] = 0; i; i--) {\n\n    for (j = 0, m = l; j < M; j++) {\n\n      t = c[last[i][j] = head[j]];\n\n      if (t < m)\n        m = t;\n    }\n\n    c[i] = m + 1;\n\n    head[s[i] - 97] = i;\n  }\n\n  for (i = 1, m = c[head[mp = 0]]; i < M; i++) {\n\n    if (c[head[i]] < c[head[mp]])\n      mp = i;\n  }\n\n  tp = head[mp];\n\n  if (!tp) {\n\n    putchar(mp + 97);\n\n    putchar(10);\n\n    return 0;\n  }\n\n  l = c[tp];\n\n  for (i = 0; i <= l; i++)\n    f[i] = 0;\n\n  dfs(tp, 0);\n\n  a[l + 1] = 0;\n\n  for (i = l; !f[i]; i--)\n    a[i] = 97;\n\n  puts(a);\n\n  return 0;\n}"}
{"fast_code_id":"97c845d55b6769aac5fd13c5aee49c6cd5b8c21cbc11fbabbd5f471ceb8914ad","fast_id":"6cacfcf3ea6bbc2c11941f9b22bd4fd69ebb9f5a20a7ef2e46d7ced5c214df3c","fast_time":0.0111531978,"language":"cpp","measured_fast_code_id":"6cacfcf3ea6bbc2c11941f9b22bd4fd69ebb9f5a20a7ef2e46d7ced5c214df3c","measured_slow_code_id":"40456525b2aba5e4b09ab4a9f6b3429101f46674c164e85715c74b58f7a946f1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39135","problem_id":"p03724","slow_code_id":"25d7bd54e411b13ce600fe696d0f11beaadb06d0f9ec53595b98e594bbc0dc89","slow_id":"40456525b2aba5e4b09ab4a9f6b3429101f46674c164e85715c74b58f7a946f1","slow_time":0.0893213164,"speedup":8.008583547222663,"stratum":"8+","sampling_key":"99e1d40095a4a8411cb30ca4fceaeb772943cde952c1cd82e40de996f13ea44e","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n, m;\n\n  while (cin >> n >> m)\n\n  {\n\n    int a[100000] = {0};\n\n    int b[100000], c[100000];\n\n    for (int i = 0; i < m; i++)\n\n    {\n\n      cin >> b[i] >> c[i];\n    }\n\n    for (int i = 0; i < m; i++)\n\n    {\n\n      a[b[i]]++;\n\n      a[c[i]]++;\n    }\n\n    int flag = 1;\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      if (a[i] % 2 != 0)\n\n        flag = 0;\n    }\n\n    if (flag == 1)\n\n      cout << \"YES\\n\";\n\n    else\n\n      cout << \"NO\\n\";\n  }\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define MAXN 100006\n\nusing namespace std;\n\nint n, m, u, v, du[MAXN];\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    scanf(\"%d%d\", &u, &v);\n\n    du[u]++;\n\n    du[v]++;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    if (du[i] % 2 == 1)\n\n    {\n\n      printf(\"NO\");\n\n      return 0;\n    }\n\n  printf(\"YES\");\n}"}
{"fast_code_id":"51c4bf55cd373d45e104276b86699028d7217f9a2ed701921345d06bd678ce2d","fast_id":"9c6ea01d73779614337aa3a3c997955f713f1276f6ef6e008c6f3114ce4b708a","fast_time":0.0173080473,"language":"cpp","measured_fast_code_id":"9c6ea01d73779614337aa3a3c997955f713f1276f6ef6e008c6f3114ce4b708a","measured_slow_code_id":"846a991885afaa2f9b0e6021de47955beaac43efa73308d44a9c3fe9cdf6f616","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39164","problem_id":"p03353","slow_code_id":"a28cf468197d5d2b5003dd0858052f70a9ffff97b1e1a6edb6eb486be497fe00","slow_id":"846a991885afaa2f9b0e6021de47955beaac43efa73308d44a9c3fe9cdf6f616","slow_time":0.2300794081,"speedup":13.293204259962936,"stratum":"8+","sampling_key":"3b37c003b977d8bfc5e31c02ba839addbda138fc3b6b4d9d167909d0a20688e3","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<double, int> pdi;\n\nconst int N = 50005;\n\nstring str[N];\n\nint main()\n\n{\n\n  string a;\n\n  cin >> a;\n\n  int k, cnt = 0;\n\n  scanf(\"%d\", &k);\n\n  int siz = a.size();\n\n  int mini;\n\n  for (int i = 0; i < siz; i++)\n\n  {\n\n    str[++cnt] = a[i];\n\n    mini = min(k, siz - i);\n\n    for (int j = 1 + i; j < mini + i; j++, cnt++)\n\n      str[cnt + 1] = str[cnt] + a[j];\n  }\n\n  sort(str + 1, str + cnt + 1);\n\n  unique(str + 1, str + cnt + 1);\n\n  cout << str[k] << endl;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\nint N, K;\n\nchar sz[5000];\n\nbool ok(int n, char a[], int lo) {\n\n  if (lo == 0)\n    return true;\n\n  for (int i = n; i < n + lo; i++) {\n\n    if (sz[i] != a[i - n])\n      return false;\n  }\n\n  return true;\n}\n\nvoid sou(char a[]) {\n\n  if (K == 0)\n    return;\n\n  char b[5000] = {0};\n\n  bool o[26] = {false};\n\n  int ng = strlen(a);\n\n  for (int i = 0; i < ng; i++)\n    b[i] = a[i];\n\n  for (int i = ng; i < N; i++) {\n\n    if (ok(i - ng, a, ng))\n      o[sz[i] - 'a'] = true;\n  }\n\n  for (int i = 0; i < 26; i++) {\n\n    if (o[i]) {\n\n      b[ng] = i + 'a';\n\n      --K;\n\n      if (K == 0) {\n\n        printf(\"%s\", b);\n\n        return;\n      }\n\n      sou(b);\n    }\n\n    if (K == 0)\n      return;\n  }\n}\n\nint main() {\n\n  scanf(\"%s %d\", sz, &K);\n\n  while (sz[N] != '\\0')\n    ++N;\n\n  char a[5000] = {'\\0'};\n\n  sou(a);\n}"}
{"fast_code_id":"e066de2bb8c89bffb973033238fe49147e39fd3b72d8218d7d0e5c24a4f013fd","fast_id":"a0064ca0ecd2f7b3f659eb9ea65637e48af0f10e5631bce9b3acfba7dcdd9bde","fast_time":0.0143583798,"language":"cpp","measured_fast_code_id":"a0064ca0ecd2f7b3f659eb9ea65637e48af0f10e5631bce9b3acfba7dcdd9bde","measured_slow_code_id":"afb33c3c3738b3e44f579ef2196d08d7195b244cac8ebb02b62b901dd59ebb0c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39225","problem_id":"p03832","slow_code_id":"19e66c62122e2f257071372646b6a3c8ce94a902f347819a6555d498a0e43e96","slow_id":"afb33c3c3738b3e44f579ef2196d08d7195b244cac8ebb02b62b901dd59ebb0c","slow_time":0.6776890678,"speedup":47.19815726005521,"stratum":"8+","sampling_key":"110e6af11a01725835c19cb543507255a3f0a13407e106cacb79f8ff42c299f2","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nll mod = 1e9 + 7;\n\nll modpow(ll A, ll B) {\n\n  if (B == 0)\n    return 1;\n\n  if (B % 2)\n    return A * modpow(A, B - 1) % mod;\n\n  ll half = modpow(A, B / 2);\n\n  return half * half % mod;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, A, B, C, D;\n\n  cin >> N >> A >> B >> C >> D;\n\n  ll F[1001], FI[1001];\n\n  F[0] = 1;\n\n  rep1(i, 1000) { F[i] = F[i - 1] * i % mod; }\n\n  FI[1000] = modpow(F[1000], mod - 2);\n\n  for (int i = 1000; i > 0; i--) {\n\n    FI[i - 1] = FI[i] * i % mod;\n  }\n\n  ll dp[1001][1001] = {};\n\n  dp[0][0] = F[N];\n\n  rep(i, N) {\n\n    rep(j, N) {\n\n      if (dp[i][j]) {\n\n        dp[i + 1][j] += dp[i][j];\n\n        dp[i + 1][j] %= mod;\n\n        if (A <= i + 1 && i + 1 <= B) {\n\n          for (int k = C; k <= D; k++) {\n\n            int kari = j + k * (i + 1);\n\n            if (kari <= N) {\n\n              dp[i + 1][kari] +=\n                  dp[i][j] * modpow(FI[i + 1], k) % mod * FI[k] % mod;\n\n              dp[i + 1][kari] %= mod;\n\n            }\n\n            else\n              break;\n          }\n        }\n      }\n    }\n  }\n\n  ll kotae = 0;\n\n  rep(i, N + 1) {\n\n    kotae += dp[i][N];\n\n    kotae %= mod;\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst ll mod = 1e9 + 7;\n\nll modpow(ll A, ll B) {\n\n  ll kotae = 1;\n\n  while (B > 0) {\n\n    if (B & 1)\n      kotae = kotae * A % mod;\n\n    A = A * A % mod;\n\n    B >>= 1;\n  }\n\n  return kotae;\n}\n\nconst int IMAX = 1001;\n\nll fac[IMAX + 1], ifac[IMAX + 1];\n\nll dp[2][1001];\n\nint main() {\n\n  fac[0] = 1;\n\n  rep1(i, IMAX) fac[i] = fac[i - 1] * i % mod;\n\n  ifac[IMAX] = modpow(fac[IMAX], mod - 2);\n\n  for (int i = IMAX; i > 0; i--)\n    ifac[i - 1] = ifac[i] * i % mod;\n\n  int N, A, B, C, D;\n\n  scanf(\"%d %d %d %d %d\", &N, &A, &B, &C, &D);\n\n  dp[1][0] = fac[N];\n\n  for (int i = A; i <= B; i++) {\n\n    rep(j, N + 1) dp[0][j] = (dp[1][j] %= mod);\n\n    int d = min(D, N / i);\n\n    ll tmp = modpow(ifac[i], d) * ifac[d] % mod;\n\n    for (int j = d; j >= C; j--) {\n\n      for (int k = 0; k + i * j <= N; k++) {\n\n        dp[1][k + i * j] += dp[0][k] * tmp % mod;\n      }\n\n      tmp = tmp * fac[i] % mod * j % mod;\n    }\n  }\n\n  printf(\"%lld\", dp[1][N] % mod);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"afb8839424fc9e97b7335ac7ee3e9f1555113935a217b22beb135c0587189c3d","fast_id":"6cf9734f64eef9375e38b2e07efdd2af2c3f0b97382d75de009a7df350a2d52b","fast_time":0.0417329049,"language":"cpp","measured_fast_code_id":"6cf9734f64eef9375e38b2e07efdd2af2c3f0b97382d75de009a7df350a2d52b","measured_slow_code_id":"186aea3353a1756a5bf244ff976a4de2123a52704dc7d8a668c7175e310ca7d1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39251","problem_id":"p03328","slow_code_id":"5db52ba5354047f17cf8e5a8489fd509a44ff2f3398739fa9aa61d87fe8712b9","slow_id":"186aea3353a1756a5bf244ff976a4de2123a52704dc7d8a668c7175e310ca7d1","slow_time":0.1239610343,"speedup":2.9703428169458674,"stratum":"2-4","sampling_key":"f3a041a187aec40fac0de8b52a7ddb20b0925b6d7c939f802a5e86a28f55306d","slow_code":"#include <algorithm>\n\n#include <cstring>\n\n#include <deque>\n\n#include <functional>\n\n#include <iostream>\n\n#include <map>\n\n#include <numeric>\n\n#include <queue>\n\n#include <set>\n\n#include <vector>\n\nusing namespace std;\n\n#define fst first\n\n#define snd second\n\nusing ll = long long;\n\nusing I = pair<int, int>;\n\nint main() {\n\n  int a, b;\n\n  while (cin >> a >> b) {\n\n    int d = b - a;\n\n    int res = -1;\n\n    for (int i = 1; i <= 999; i++) {\n\n      for (int j = 1; j <= 999; j++) {\n\n        int A = i * (i + 1) / 2;\n\n        int B = j * (j + 1) / 2;\n\n        if (A > a && B > b && B - A == d) {\n\n          res = A - a;\n        }\n      }\n    }\n\n    cout << res << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <algorithm>\n\n#include <cstring>\n\n#include <deque>\n\n#include <functional>\n\n#include <iostream>\n\n#include <map>\n\n#include <numeric>\n\n#include <queue>\n\n#include <set>\n\n#include <vector>\n\nusing namespace std;\n\n#define fst first\n\n#define snd second\n\nusing ll = long long;\n\nusing I = pair<int, int>;\n\nint main() {\n\n  int a, b;\n\n  while (cin >> a >> b) {\n\n    int d = b - a;\n\n    int k = d - 1;\n\n    int res = k * (k + 1) / 2 - a;\n\n    cout << res << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"b6abbe17745e7354d59ca82d02d12d3307bb6cfdf40b1db7b1359d0e833b1271","fast_id":"8674b4aaddd68d7851c44ae4cf47d5e8a4ce3f54738cf29199b53d20cb4e3e72","fast_time":0.1066142786,"language":"cpp","measured_fast_code_id":"8674b4aaddd68d7851c44ae4cf47d5e8a4ce3f54738cf29199b53d20cb4e3e72","measured_slow_code_id":"5a91ce913e0e5e556f26712cd1680333b7cff1af403c4a75682bb4cb8a7a14b0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39287","problem_id":"p02721","slow_code_id":"f09cd4d0eff462f0b5b2aa208aa7da3c5eac023fd1477810e8b77c3870054617","slow_id":"5a91ce913e0e5e556f26712cd1680333b7cff1af403c4a75682bb4cb8a7a14b0","slow_time":0.2780061753,"speedup":2.6075885796032576,"stratum":"2-4","sampling_key":"0d61d3db8571fba4f2e0022478d2e54c69896ae55be6840e43a9a952f6998a42","slow_code":"#include <bits/stdc++.h>\n\n#define INF 1000000000\n\n#define LINF 1000000000000000000\n\n#define MOD 1000000007\n\n#define mod 1000007\n\n#define INF63 1061109567\n\n#define INF127 9187201950435737471\n\n#define UINF 18446744073709551615\n\n#define F first\n\n#define S second\n\n#define ll long long\n\n#define N 200010\n\nusing namespace std;\n\nll n, k, c, nxt[N], pre[N], tms[N];\n\nstring s;\n\nvector<ll> wk, r1, r2;\n\nint main() {\n\n  ll i, j;\n\n  cin >> n >> k >> c >> s;\n\n  for (i = 0; i < s.size(); i++)\n\n  {\n\n    if (s[i] == 'o')\n\n    {\n\n      wk.push_back(i);\n    }\n  }\n\n  memset(tms, 0, sizeof(tms));\n\n  for (i = wk.size() - 1; i >= 0; i--)\n\n  {\n\n    j = lower_bound(wk.begin(), wk.end(), wk[i] + c + 1) - wk.begin();\n\n    nxt[i] = j;\n  }\n\n  for (i = 0; i < wk.size(); i++)\n\n  {\n\n    j = upper_bound(wk.begin(), wk.end(), wk[i] - c - 1) - wk.begin() - 1;\n\n    pre[i] = j;\n  }\n\n  i = 0;\n\n  while (i < wk.size())\n\n  {\n\n    r1.push_back(i);\n\n    i = nxt[i];\n  }\n\n  i = wk.size() - 1;\n\n  while (i >= 0)\n\n  {\n\n    r2.push_back(i);\n\n    i = pre[i];\n  }\n\n  sort(r1.begin(), r1.end());\n\n  sort(r2.begin(), r2.end());\n\n  if (r1.size() > k || r2.size() > k)\n\n  {\n\n    return 0;\n  }\n\n  for (i = 0; i < r1.size(); i++)\n\n  {\n\n    tms[r1[i]]++;\n  }\n\n  for (i = 0; i < r2.size(); i++)\n\n  {\n\n    tms[r2[i]]++;\n  }\n\n  for (i = 0; i < wk.size(); i++)\n\n  {\n\n    if (tms[i] == 2)\n\n    {\n\n      cout << wk[i] + 1 << endl;\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define INF 1000000000\n\n#define LINF 1000000000000000000\n\n#define MOD 1000000007\n\n#define mod 1000007\n\n#define INF63 1061109567\n\n#define INF127 9187201950435737471\n\n#define UINF 18446744073709551615\n\n#define F first\n\n#define S second\n\n#define ll long long\n\n#define N 200010\n\nusing namespace std;\n\nll n, k, c;\n\nstring s;\n\nvector<ll> wk1, wk2;\n\nint main() {\n\n  ll i, j;\n\n  cin >> n >> k >> c >> s;\n\n  for (i = 0; i < s.size(); i++)\n\n  {\n\n    if (s[i] == 'o')\n\n    {\n\n      wk1.push_back(i);\n\n      i += c;\n    }\n  }\n\n  for (i = s.size() - 1; i >= 0; i--)\n\n  {\n\n    if (s[i] == 'o')\n\n    {\n\n      wk2.push_back(i);\n\n      i -= c;\n    }\n  }\n\n  sort(wk1.begin(), wk1.end());\n\n  sort(wk2.begin(), wk2.end());\n\n  if (wk1.size() > k || wk2.size() > k || wk1.size() != wk2.size())\n\n  {\n\n    return 0;\n  }\n\n  for (i = 0; i < wk1.size(); i++)\n\n  {\n\n    if (wk1[i] == wk2[i])\n\n    {\n\n      cout << wk1[i] + 1 << \" \";\n    }\n  }\n\n  puts(\"\");\n\n  return 0;\n}"}
{"fast_code_id":"2494fdb34e98698feabe773239ccc1c1bda749996f89129b18d48cc2c3eb5f9d","fast_id":"9ff7d82bc9ed3eec640bfb723d96a613af84f35b422643dec7f9298ae13137a2","fast_time":0.0443334729,"language":"cpp","measured_fast_code_id":"9ff7d82bc9ed3eec640bfb723d96a613af84f35b422643dec7f9298ae13137a2","measured_slow_code_id":"80026560d9b615ceab65a49806a197e2e501a8ee35ce62422e668d7b99851702","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39329","problem_id":"p03621","slow_code_id":"413599eff861e71a29ba235d9a413e96fd70c2156dc4eae9385a6e27dba224cf","slow_id":"80026560d9b615ceab65a49806a197e2e501a8ee35ce62422e668d7b99851702","slow_time":0.1922201144,"speedup":4.335778404583324,"stratum":"4-8","sampling_key":"2a48e2a5876527e709ba26c8ca794b4c4d00eec215060c480b874d9ed0f2788a","slow_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <vector>\n\nusing namespace std;\n\nstatic_assert(sizeof(long) >= 8, \"sizeof(long) >= 8\");\n\nconstexpr int mod = 998244353;\n\nlong fac[100001], inv[100001];\n\nint dp[10001];\n\nint solve(int x, int y) {\n\n  dp[0] = 1;\n\n  for (int i = 1; i <= x; i++)\n\n    for (int j = 1; j <= y; j++)\n\n      dp[j] = (dp[j] + (long)i * dp[j - 1]) % mod;\n\n  long ans = 0;\n\n  for (int i = 0; i <= y; i++)\n\n    ans = (ans + dp[i] * inv[x + i]) % mod;\n\n  return ans * fac[x] % mod * fac[x] % mod * fac[y] % mod * fac[x + y] % mod;\n}\n\nchar a[10001], b[10001];\n\nint main() {\n\n  fac[0] = 1;\n\n  for (int i = 1; i <= 100000; i++)\n\n    fac[i] = fac[i - 1] * i % mod;\n\n  inv[100000] = 812950533;\n\n  for (int i = 100000; i >= 1; i--)\n\n    inv[i - 1] = inv[i] * i % mod;\n\n  scanf(\"%s%s\", a, b);\n\n  int x = 0, y = 0;\n\n  for (int i = 0; a[i]; i++)\n\n    if (a[i] == '1')\n\n      (b[i] == '0' ? x : y)++;\n\n  printf(\"%d\\n\", solve(x, y));\n}\n","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nstatic_assert(sizeof(long) >= 8, \"sizeof(long) >= 8\");\n\nconstexpr int mod = 998244353;\n\nint fac[20001], inv[20001];\n\nint dp[10001];\n\nint solve(int x, int y) {\n\n  dp[0] = 1;\n\n  for (int i = 1; i <= x; i++)\n\n    for (int j = 1; j <= y; j++)\n\n      dp[j] = (dp[j] + (long)i * dp[j - 1]) % mod;\n\n  int ans = 0;\n\n  for (int i = 0; i <= y; i++)\n\n    ans = (ans + (long)dp[i] * inv[x + i]) % mod;\n\n  return (long)ans * fac[x] % mod\n\n         * fac[x] % mod\n\n         * fac[y] % mod\n\n         * fac[x + y] % mod;\n}\n\nchar a[10001], b[10001];\n\nint main() {\n\n  fac[0] = 1;\n\n  for (int i = 1; i <= 20000; i++)\n\n    fac[i] = (long)fac[i - 1] * i % mod;\n\n  inv[20000] = 292343761;\n\n  for (int i = 20000; i >= 1; i--)\n\n    inv[i - 1] = (long)inv[i] * i % mod;\n\n  scanf(\"%s%s\", a, b);\n\n  int x = 0, y = 0;\n\n  for (int i = 0; a[i]; i++)\n\n    if (a[i] == '1')\n\n      (b[i] == '0' ? x : y)++;\n\n  printf(\"%d\\n\", solve(x, y));\n}\n"}
{"fast_code_id":"cbc981f997fa805783687983d5bf909ed85c8070e798c3cae603ef4946d1e03b","fast_id":"232f3396961651198a36f6e2bc6256a7a4d5d9ad61faecae98a2aa9a2141eb3d","fast_time":0.1051109196,"language":"cpp","measured_fast_code_id":"232f3396961651198a36f6e2bc6256a7a4d5d9ad61faecae98a2aa9a2141eb3d","measured_slow_code_id":"967ac30df58b1f75041c674494d392b192f690f56b5707bc8c015cf822304c6c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39333","problem_id":"p02570","slow_code_id":"f9fb73c7cde11a473701273a185d2cb8ad3a935943d9c11c6a7b4bd77432ba36","slow_id":"967ac30df58b1f75041c674494d392b192f690f56b5707bc8c015cf822304c6c","slow_time":0.8691829475,"speedup":8.269197442165657,"stratum":"8+","sampling_key":"f4db937d1d78bac9eb787ad5189d5828819ea1132cf4af0063f22a30ab05e638","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define endl \"\\n\"\n\nll n, m;\n\nvector<ll> vis(200006, 0);\n\nvector<ll> ad[200006];\n\nvoid add(ll x, ll y) {\n\n  ad[x].push_back(y);\n\n  ad[y].push_back(x);\n}\n\nvoid dfs(ll node) {\n\n  vis[node] = 1;\n\n  for (ll x : ad[node]) {\n\n    if (!vis[x])\n\n      dfs(x);\n  }\n}\n\nvoid solve() {\n\n  ll d, s, t;\n\n  cin >> d >> t >> s;\n\n  if (d <= t * s) {\n\n    cout << \"Yes\" << endl;\n\n    return;\n  }\n\n  cout << \"No\" << endl;\n}\n\nint main() {\n\n  ll t;\n\n  t = 1;\n\n  while (t--)\n\n    solve();\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define endl \"\\n\"\n\nvoid solve() {\n\n  ll d, t, s;\n\n  cin >> d >> t >> s;\n\n  if (d <= t * s) {\n\n    cout << \"Yes\\n\";\n\n    return;\n  }\n\n  cout << \"No\\n\";\n}\n\nint main() {\n\n  ll t;\n\n  t = 1;\n\n  while (t--)\n\n    solve();\n\n  return 0;\n}"}
{"fast_code_id":"47c9db7ee6099b58cd73eca09cb6f0ed4387db8875363525f1afd1befc736f04","fast_id":"442c6180acb8190437d87c4c160246972f5a4524b8091f0cb2142d9ee659406e","fast_time":0.0208181302,"language":"cpp","measured_fast_code_id":"442c6180acb8190437d87c4c160246972f5a4524b8091f0cb2142d9ee659406e","measured_slow_code_id":"c2978c0f08185d5b9297351f9420865d45588c21fcad65589757ea2e30d4de07","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39337","problem_id":"p03022","slow_code_id":"662f11f3d89133e402d5627238a560e01ac066eee32222c485a1f4306a24b1c2","slow_id":"c2978c0f08185d5b9297351f9420865d45588c21fcad65589757ea2e30d4de07","slow_time":0.9584254197,"speedup":46.03801640648784,"stratum":"8+","sampling_key":"cad803703e5c21385dc205b7bda03fe26e408f110969b2c1b3fbf1108341dc27","slow_code":"#include <cstdio>\n\nconst int MOD = 998244353;\n\nconst int INV2 = (MOD + 1) >> 1;\n\nint add(int x, int y) { return (x + y >= MOD ? x + y - MOD : x + y); }\n\nint sub(int x, int y) { return (x - y < 0 ? x - y + MOD : x - y); }\n\nint mul(int x, int y) { return 1LL * x * y % MOD; }\n\nint pow_mod(int b, int p) {\n\n  int ret = 1;\n\n  for (int i = p; i; i >>= 1, b = mul(b, b))\n\n    if (i & 1)\n      ret = mul(ret, b);\n\n  return ret;\n}\n\nstruct node {\n\n  int k, b;\n\n  node() : k(0), b(0) {}\n\n  node(int _k, int _b) : k(_k), b(_b) {}\n\n  int get(int x) { return add(mul(k, x), b); }\n\n  friend node operator+(node a, node b) {\n\n    return node(add(a.k, b.k), add(a.b, b.b));\n  }\n\n  friend node operator-(node a, node b) {\n\n    return node(sub(a.k, b.k), sub(a.b, b.b));\n  }\n\n  friend node operator*(node a, int k) {\n\n    return node(mul(a.k, k), mul(a.b, k));\n  }\n\n  friend node operator/(node a, int k) { return a * pow_mod(k, MOD - 2); }\n};\n\nvoid fwt(node *A, int m, int type) {\n\n  int n = (1 << m), f = (type == 1 ? 1 : INV2);\n\n  for (int i = 1; i <= m; i++) {\n\n    int s = (1 << i), t = (s >> 1);\n\n    for (int j = 0; j < n; j += s)\n\n      for (int k = 0; k < t; k++) {\n\n        node x = A[j + k], y = A[j + k + t];\n\n        A[j + k] = (x + y) * f, A[j + k + t] = (x - y) * f;\n      }\n  }\n}\n\nnode A[1 << 18], B[1 << 18], C[1 << 18], f[1 << 18];\n\nint main() {\n\n  int N, M, S = 0;\n  scanf(\"%d\", &N), M = (1 << N);\n\n  for (int i = 0; i < M; i++)\n    scanf(\"%d\", &A[i].b), S = add(S, A[i].b);\n\n  S = pow_mod(S, MOD - 2);\n\n  for (int i = 0; i < M; i++)\n    A[i].b = sub(i == 0 ? 1 : 0, mul(A[i].b, S));\n\n  for (int i = 0; i < M; i++)\n    B[i].b = 1;\n\n  C[0].b = MOD - 1;\n\n  fwt(A, N, 1), fwt(B, N, 1), fwt(C, N, 1);\n\n  int tmp = mul(B[0].b, pow_mod(C[0].b, MOD - 2));\n\n  for (int i = 1; i < M; i++)\n\n    f[i] = (B[i] - C[i] * tmp) / A[i].b;\n\n  f[0].k = 1;\n  fwt(f, N, -1);\n\n  int x = sub(0, mul(pow_mod(f[0].k, MOD - 2), f[0].b));\n\n  for (int i = 0; i < M; i++)\n    printf(\"%d\\n\", f[i].get(x));\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#define retrun return\n\n#define cpnst const\n\ntypedef long long ll;\n\ncpnst ll mod = 998244353, inv2 = (mod + 1) >> 1;\n\nll qpow(ll x, ll k)\n\n{\n  ll r = 1;\n  for (; k; k >>= 1, (x *= x) %= mod)\n    if (k & 1)\n      (r *= x) %= mod;\n  return r;\n}\n\nll N, A[1111111];\n\nvoid FWT(ll *x, int op)\n\n{\n\n  for (register int i = 1, ii, iii; i < N; i <<= 1)\n\n    for (ii = 0; ii < N; ii += (i << 1))\n\n      for (iii = 0; iii < i; iii++)\n\n      {\n\n        int px = ii + iii, py = px + i;\n\n        ll vx = x[px] + x[py], vy = x[px] - x[py] + mod;\n\n        if (op < 0)\n          vx *= inv2, vy *= inv2;\n\n        x[px] = vx % mod, x[py] = vy % mod;\n      }\n}\n\nll C[1111111];\n\nint main()\n\n{\n\n  scanf(\"%lld\", &N), N = 1 << N;\n\n  register int i;\n\n  ll S = 0;\n\n  for (i = 0; i < N; i++)\n\n    scanf(\"%lld\", A + i), S += A[i];\n\n  S = qpow(S, mod - 2);\n\n  for (i = 0; i < N; i++)\n    (A[i] *= S) %= mod;\n\n  C[0] = N - 1, A[0] = (mod - 1 + A[0]) % mod;\n\n  for (i = 1; i < N; i++)\n    C[i] = mod - 1;\n\n  FWT(C, 1), FWT(A, 1);\n\n  for (i = 0; i < N; i++)\n    C[i] = qpow(A[i], mod - 2) * C[i] % mod;\n\n  FWT(C, -1);\n\n  for (i = 0; i < N; i++)\n    printf(\"%lld\\n\", (C[i] - C[0] + mod) % mod);\n}\n"}
{"fast_code_id":"48aba4d5fb94f4915b0735eac6cf485571728eb072dbf03cdcccfe9a0262399d","fast_id":"1a8d77b14dc7b5c9d1ca5f283efe9569cd81fe71107e67cd57fafe7aeb881093","fast_time":0.0392258704,"language":"cpp","measured_fast_code_id":"1a8d77b14dc7b5c9d1ca5f283efe9569cd81fe71107e67cd57fafe7aeb881093","measured_slow_code_id":"0696c0fcd568cdd897a179989c54d122e74ffa1a3a3babfc1067e459bc103407","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_3936","problem_id":"p01360","slow_code_id":"cf27842acb53314d77ba90d014352dc8ac8401f8be1f7881c95809c02d959400","slow_id":"0696c0fcd568cdd897a179989c54d122e74ffa1a3a3babfc1067e459bc103407","slow_time":0.089812167,"speedup":2.2896156563042127,"stratum":"2-4","sampling_key":"c4f7e228b8709f5f37d60551ad9003f51a4630170e18c217a1ba8f88fb4bd9bf","slow_code":"#include <algorithm>\n\n#include <iostream>\n\n#include <cstring>\n\n#include <cstdio>\n\n#include <map>\n\n#define INF 100005\n\nusing namespace std;\n\nint F[INF][2];\n\nchar str[INF];\n\nint X[3] = {3, 1, 2};\n\nint getnum(char c0, char c1)\n\n{\n\n  return X[(c0 - 48) % 3] <= X[(c1 - 48) % 3];\n}\n\nint main()\n\n{\n\n  int n, m, i, j;\n\n  while (scanf(\"%s\", str))\n\n  {\n\n    if (str[0] == '#')\n      break;\n\n    memset(F, 0x0f, sizeof(F));\n\n    F[1][1] = F[1][0] = 0;\n\n    int len = strlen(str);\n\n    for (i = 2; i <= len; i++)\n\n    {\n\n      F[i][0] = min(F[i][0], F[i - 1][0] + 1);\n\n      if (getnum(str[i - 1], str[i - 2]))\n\n        F[i][0] = min(F[i][0], F[i - 1][1]);\n\n      F[i][1] = min(F[i][1], F[i - 1][1] + 1);\n\n      if (getnum(str[i - 2], str[i - 1]))\n\n        F[i][1] = min(F[i][1], F[i - 1][0]);\n    }\n\n    int ans = min(F[len][0], F[len][1]);\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nusing ll = int64_t;\n\nenum {\n\n  LEFT,\n  RIGHT\n\n};\n\nbool isOK(ll left_sq, ll right_sq) {\n\n  if (left_sq == -1 || right_sq == -1) {\n\n    return true;\n  }\n\n  ll l = (left_sq % 3 + 2) % 3;\n\n  ll r = (right_sq % 3 + 2) % 3;\n\n  return l <= r;\n}\n\nint main() {\n\n  string s;\n\n  while (cin >> s) {\n\n    if (s == \"#\") {\n\n      break;\n    }\n\n    ll ans = INT_MAX;\n\n    for (ll turn : {LEFT, RIGHT}) {\n\n      ll left_sq = -1, right_sq = -1;\n\n      ll tmp = 0;\n\n      for (char c : s) {\n\n        int sq = c - '0';\n\n        if (turn == RIGHT) {\n\n          if (isOK(left_sq, sq)) {\n\n            right_sq = sq;\n\n            turn = LEFT;\n\n          } else {\n\n            tmp++;\n\n            left_sq = sq;\n\n            turn = RIGHT;\n          }\n\n        } else {\n\n          if (isOK(sq, right_sq)) {\n\n            left_sq = sq;\n\n            turn = RIGHT;\n\n          } else {\n\n            tmp++;\n\n            right_sq = sq;\n\n            turn = LEFT;\n          }\n        }\n      }\n\n      ans = min(ans, tmp);\n    }\n\n    cout << ans << endl;\n  }\n}\n"}
{"fast_code_id":"5fb1214eb9fd4fd24ee68c039cd733c21d49ebeec66470c41b8c2845d38204c7","fast_id":"93bf68eb8fe8db811508f9d699a4b70c8e6913b31b4a3aaf35ae49384916c9bb","fast_time":0.0346051331,"language":"cpp","measured_fast_code_id":"93bf68eb8fe8db811508f9d699a4b70c8e6913b31b4a3aaf35ae49384916c9bb","measured_slow_code_id":"40f0cd69605b38990ae83d43ae37feae3bab372c01ea63203c72d2d87fa29944","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_39823","problem_id":"p00930","slow_code_id":"56b76f6c9376578129b47ba7f059eeb803a36ad957dbb2c3e071310334674588","slow_id":"40f0cd69605b38990ae83d43ae37feae3bab372c01ea63203c72d2d87fa29944","slow_time":0.5382419585,"speedup":15.55381847382636,"stratum":"8+","sampling_key":"b139f48899e872f35db1aa5b2ca06e69dbf5e2b22b2f141a271528b1b0ec06c7","slow_code":"#include <stdio.h>\n\n#include <string.h>\n\n#define lson rt << 1\n\n#define rson rt << 1 | 1\n\n#define mid ((l + r) >> 1)\n\n#define clr(a, b) memset(a, b, sizeof(a))\n\ninline int min(int a, int b) { return a < b ? a : b; }\n\nconst int MAX_N = 300010;\n\nstruct SegTree {\n\n  int f, a, lazy;\n\n} node[MAX_N << 2];\n\nchar s[MAX_N];\n\nint N, Q, k;\n\nvoid pushup(int rt) {\n\n  node[rt].a = min(node[lson].a, node[rson].a);\n\n  node[rt].f = min(node[lson].f, node[rson].f);\n}\n\nvoid pushdown(int rt) {\n\n  if (node[rt].lazy) {\n\n    node[lson].lazy += node[rt].lazy;\n\n    node[rson].lazy += node[rt].lazy;\n\n    node[lson].a += node[rt].lazy;\n\n    node[rson].a += node[rt].lazy;\n\n    node[lson].f += node[rt].lazy;\n\n    node[rson].f += node[rt].lazy;\n\n    node[rt].lazy = 0;\n  }\n}\n\nvoid build(int l, int r, int rt, int a, int p) {\n\n  node[rt].lazy = 0;\n\n  if (l == r) {\n\n    node[rt].f = a - l;\n\n    node[rt].a = a;\n\n    return;\n  }\n\n  if (p <= mid)\n    build(l, mid, lson, a, p);\n\n  else\n    build(mid + 1, r, rson, a, p);\n\n  pushup(rt);\n}\n\nvoid init() {\n\n  clr(node, 0);\n\n  int sum = 0;\n\n  for (int i = 1; i <= N; ++i) {\n\n    sum += (s[i] == '(' ? 1 : -1);\n\n    build(1, N, 1, sum, i);\n  }\n}\n\nvoid update(int L, int R, int val, int l, int r, int rt) {\n\n  if (L <= l && r <= R) {\n\n    node[rt].lazy += val;\n\n    node[rt].f += val;\n\n    node[rt].a += val;\n\n    return;\n  }\n\n  pushdown(rt);\n\n  if (L <= mid)\n    update(L, R, val, l, mid, lson);\n\n  if (R > mid)\n    update(L, R, val, mid + 1, r, rson);\n\n  pushup(rt);\n}\n\nint query1(int l, int r, int rt) {\n\n  if (l == r)\n    return l;\n\n  pushdown(rt);\n\n  if (node[lson].f < 0)\n    return query1(l, mid, lson);\n\n  return query1(mid + 1, r, rson);\n}\n\nint query2(int l, int r, int rt) {\n\n  if (l == r)\n    return l + 1;\n\n  pushdown(rt);\n\n  if (node[rson].a < 2)\n    return query2(mid + 1, r, rson);\n\n  return query2(l, mid, lson);\n}\n\nint main() {\n\n  while (~scanf(\"%d %d\", &N, &Q)) {\n\n    scanf(\"%s\", s + 1);\n\n    init();\n\n    while (Q--) {\n\n      scanf(\"%d\", &k);\n\n      bool flag = (s[k] == '(');\n\n      s[k] = flag ? ')' : '(';\n\n      update(k, N, flag ? -2 : 2, 1, N, 1);\n\n      k = (flag ? query1(1, N, 1) : query2(1, N, 1));\n\n      flag = (s[k] == '(');\n\n      s[k] = flag ? ')' : '(';\n\n      update(k, N, flag ? -2 : 2, 1, N, 1);\n\n      printf(\"%d\\n\", k);\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (i = 0; i < n; i++)\n\n#define repl(i, n) for (i = 1; i <= n; i++)\n\n#define sz(x) (int)x.size()\n\n#define pb push_back\n\n#define all(x) x.begin(), x.end()\n\n#define uu first\n\n#define vv second\n\n#define mem(x, y) memset(x, y, sizeof(x))\n\n#define un(x) x.erase(unique(all(x)), x.end())\n\n#define sdi(x) scanf(\"%d\", &x)\n\n#define sdii(x, y) scanf(\"%d %d\", &x, &y)\n\n#define sdiii(x, y, z) scanf(\"%d %d %d\", &x, &y, &z)\n\n#define sdl(x) scanf(\"%lld\", &x)\n\n#define sdll(x, y) scanf(\"%lld %lld\", &x, &y)\n\n#define sdlll(x, y, z) scanf(\"%lld %lld %lld\", &x, &y, &z)\n\n#define sds(x) scanf(\"%s\", x)\n\n#define pfi(x) printf(\"%d\\n\", x)\n\n#define pfii(x, y) printf(\"%d %d\\n\", x, y)\n\n#define pfiii(x, y, z) printf(\"%d %d %d\\n\", x, y, z)\n\n#define pfl(x) printf(\"%lld\\n\", x)\n\n#define pfll(x, y) printf(\"%lld %lld\\n\", x, y)\n\n#define pflll(x, y, z) printf(\"%lld %lld %lld\\n\", x, y, z)\n\n#define eps 1e-9\n\n#define OK cerr << \"ok\\n\"\n\n#define DB(x) cerr << #x << \" = \" << x << endl\n\ntypedef long long LL;\n\ntypedef unsigned long long ULL;\n\ntypedef long double LD;\n\ntypedef pair<int, int> pii;\n\ninline int setBit(int N, int pos) { return N = N | (1 << pos); }\n\ninline int resetBit(int N, int pos) { return N = N & ~(1 << pos); }\n\ninline bool checkBit(int N, int pos) { return (bool)(N & (1 << pos)); }\n\nconst int MAX = 300005, INF = 100000000;\n\nint n, q, cum[MAX];\n\nchar str[MAX];\n\nset<int> closeList;\n\nstruct data {\n\n  int mn, prop;\n\n} tree[MAX * 4];\n\nvoid init(int node, int beg, int endd) {\n\n  if (beg == endd) {\n\n    tree[node] = {cum[beg], 0};\n\n    return;\n  }\n\n  int left = node << 1;\n\n  int right = left + 1;\n\n  int mid = (beg + endd) >> 1;\n\n  init(left, beg, mid);\n\n  init(right, mid + 1, endd);\n\n  tree[node].mn = min(tree[left].mn, tree[right].mn);\n}\n\ninline void pushDown(int node, int left, int right) {\n\n  tree[left].mn += tree[node].prop;\n\n  tree[right].mn += tree[node].prop;\n\n  tree[left].prop += tree[node].prop;\n\n  tree[right].prop += tree[node].prop;\n\n  tree[node].prop = 0;\n}\n\nvoid update(int node, int beg, int endd, int x, int y, int val) {\n\n  if (x > y)\n    return;\n\n  if (beg == x && endd == y) {\n\n    tree[node].mn += val;\n\n    tree[node].prop += val;\n\n    return;\n  }\n\n  int left = node << 1;\n\n  int right = left + 1;\n\n  int mid = (beg + endd) >> 1;\n\n  if (tree[node].prop)\n    pushDown(node, left, right);\n\n  if (x <= min(y, mid))\n    update(left, beg, mid, x, min(y, mid), val);\n\n  if (max(x, mid + 1) <= y)\n    update(right, mid + 1, endd, max(x, mid + 1), y, val);\n\n  tree[node].mn = min(tree[left].mn, tree[right].mn);\n}\n\nint query(int node, int beg, int endd, int x, int y) {\n\n  if (x > y)\n    return INF;\n\n  if (beg == x && endd == y)\n    return tree[node].mn;\n\n  int left = node << 1;\n\n  int right = left + 1;\n\n  int mid = (beg + endd) >> 1;\n\n  if (tree[node].prop)\n    pushDown(node, left, right);\n\n  int l = (x <= min(y, mid)) ? query(left, beg, mid, x, min(y, mid)) : INF;\n\n  int r = (max(x, mid + 1) <= y) ? query(right, mid + 1, endd, max(x, mid + 1), y) : INF;\n\n  return min(l, r);\n}\n\ninline int bs(int high) {\n\n  int low = 1, mid, ret = high, ub = high;\n\n  while (low <= high) {\n\n    mid = (low + high) >> 1;\n\n    if (query(1, 1, n, mid, ub) >= 2) {\n\n      ret = min(ret, mid);\n\n      high = mid - 1;\n\n    }\n\n    else\n      low = mid + 1;\n  }\n\n  return ret;\n}\n\ninline int query(int idx) {\n\n  int ret = idx;\n\n  if (str[idx] == '(') {\n\n    str[idx] = ')';\n\n    closeList.insert(idx);\n\n    update(1, 1, n, idx, n, -2);\n\n    ret = *closeList.begin();\n\n    str[ret] = '(';\n\n    closeList.erase(ret);\n\n    update(1, 1, n, ret, n, +2);\n\n    return ret;\n\n  }\n\n  else {\n\n    str[idx] = '(';\n\n    closeList.erase(idx);\n\n    update(1, 1, n, idx, n, +2);\n\n    ret = bs(idx);\n\n    str[ret] = ')';\n\n    closeList.insert(ret);\n\n    update(1, 1, n, ret, n, -2);\n\n    return ret;\n  }\n}\n\nint main() {\n\n  int i, idx;\n\n  sdii(n, q);\n\n  sds(str + 1);\n\n  repl(i, n) {\n\n    if (str[i] == '(')\n      cum[i] = 1;\n\n    else {\n\n      cum[i] = -1;\n\n      closeList.insert(i);\n    }\n\n    cum[i] += cum[i - 1];\n  }\n\n  init(1, 1, n);\n\n  while (q--) {\n\n    sdi(idx);\n\n    pfi(query(idx));\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"fb7942da3c3a13199d74ce1a37b977b9cf402b199465614b7c93d0c496940908","fast_id":"74b1de8701f159d079c0ec450ea3f07557bdcd6fe3e9221710222b5e3010f70f","fast_time":0.0150708344,"language":"cpp","measured_fast_code_id":"74b1de8701f159d079c0ec450ea3f07557bdcd6fe3e9221710222b5e3010f70f","measured_slow_code_id":"d8c639af4faed750082a26c8fe3a33f263b1af4b8c220aa0df8cd4bdb7e16a17","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_399","problem_id":"p03952","slow_code_id":"4c1e8212fce28ee0034d83a673382195abd0c71056ff46b7a5c71ee4d9d3b599","slow_id":"d8c639af4faed750082a26c8fe3a33f263b1af4b8c220aa0df8cd4bdb7e16a17","slow_time":0.0808181566,"speedup":5.3625535557606545,"stratum":"4-8","sampling_key":"0dbd834cbfe31909ffdd9bb6ddf7c0ad922f2d2ce8be247eac3d0ad80fad5152","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint a[200005];\n\nint main(int argc, char **argv) {\n\n  int n, m;\n\n  cin >> n >> m;\n\n  if (m == 1 || m == 2 * n - 1)\n\n  {\n\n    puts(\"No\");\n\n    return 0;\n  }\n\n  puts(\"Yes\");\n\n  a[n] = m;\n\n  a[n - 1] = m - 1;\n\n  a[n + 1] = m + 1;\n\n  int now = 0;\n\n  for (int i = 1; i < n * 2; i++)\n\n  {\n\n    if (i == n || i == n - 1 || i == n + 1)\n\n      continue;\n\n    ++now;\n\n    if (now == m - 1)\n\n      now = m + 2;\n\n    a[i] = now;\n  }\n\n  for (int i = 1; i < n * 2; i++)\n\n    cout << a[i] << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nint N, X;\n\nint main() {\n\n  scanf(\"%d%d\", &N, &X);\n\n  if (X == 1 || X == 2 * N - 1)\n\n    return !puts(\"No\");\n\n  puts(\"Yes\");\n\n  if (N == 2)\n\n    return !puts(\"1\\n2\\n3\");\n\n  if (X == 2) {\n\n    for (int i = 1; i <= N - 2; i++)\n\n      printf(\"%d\\n\", 4 + i);\n\n    printf(\"3\\n2\\n1\\n4\\n\");\n\n    for (int i = 1; i <= N - 3; i++)\n\n      printf(\"%d\\n\", N + 2 + i);\n\n    return 0;\n  }\n\n  int cnt = 1;\n\n  for (int i = 1; i <= N - 2; i++) {\n\n    if (cnt == X - 2)\n\n      cnt = X + 2;\n\n    printf(\"%d\\n\", cnt++);\n  }\n\n  printf(\"%d\\n%d\\n%d\\n%d\\n\", X - 1, X, X + 1, X - 2);\n\n  for (int i = 1; i <= N - 3; i++) {\n\n    if (cnt == X - 2)\n\n      cnt = X + 2;\n\n    printf(\"%d\\n\", cnt++);\n  }\n}"}
{"fast_code_id":"038afa43bd5a50762c163b59c3d4cf65e94a18632124e4061da2f2a516b6ca89","fast_id":"090f9f9cb866972e6d1efc7ae07e74ca0346981bfa8968f4da0dd099cc18cf24","fast_time":0.0051729275,"language":"cpp","measured_fast_code_id":"090f9f9cb866972e6d1efc7ae07e74ca0346981bfa8968f4da0dd099cc18cf24","measured_slow_code_id":"dde2fef09ccca4829e782a8d9ad71046d2406dc16b99f66efbd15151a95c5a19","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4048","problem_id":"p03013","slow_code_id":"7b119d3b93c9e06c639c26af9bc2cf04eb0333c8e1380966e90ce066f7e99d07","slow_id":"dde2fef09ccca4829e782a8d9ad71046d2406dc16b99f66efbd15151a95c5a19","slow_time":0.2596600701,"speedup":50.19596159041471,"stratum":"8+","sampling_key":"3d52e07c920ca2470df0cf38602347a2e1559e19a4ad44b8ffff4edbdde3ab13","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nll memo[1000002];\n\nll n;\n\nmap<ll, bool> s;\n\nll dp(ll x) {\n\n  if (x > n)\n\n  {\n\n    memo[x] = 0;\n\n    return 0;\n  }\n\n  if (s[x]) {\n\n    memo[x] = 0;\n\n    return 0;\n  }\n\n  ll to_add = 0;\n\n  if (x == n)\n\n  {\n\n    return 1;\n  }\n\n  if (memo[x] != -1)\n\n    return memo[x];\n\n  else\n\n  {\n\n    if (!s[x + 1])\n\n      to_add += dp(x + 1);\n\n    if (!s[x + 2] && x + 2 <= n)\n\n      to_add += dp(x + 2);\n\n    memo[x] = to_add % 1000000007;\n\n    return memo[x];\n  }\n}\n\nint main()\n\n{\n\n  memset(memo, -1, sizeof(memo));\n\n  ll m, t;\n\n  cin >> n >> m;\n\n  while (m--)\n\n  {\n\n    cin >> t;\n\n    s[t] = 1;\n  }\n\n  cout << dp(0) << '\\n';\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nlong long mod = 1e9 + 7;\n\nlong long vis[100005], a[100005] = {1, 1, 2};\n\nint main()\n\n{\n\n  long long i, x, n, k;\n\n  scanf(\"%lld%lld\", &n, &k);\n\n  for (i = 1; i <= k; i++)\n\n  {\n\n    scanf(\"%lld\", &x);\n\n    vis[x] = 1;\n  }\n\n  if (vis[1])\n    a[1] = 0;\n\n  for (i = 2; i <= n; i++)\n\n  {\n\n    if (vis[i])\n      a[i] = 0;\n\n    else\n      a[i] = (a[i - 1] % mod + a[i - 2] % mod) % mod;\n  }\n\n  printf(\"%lld\\n\", a[n]);\n\n  return 0;\n}\n"}
{"fast_code_id":"b4b92b3ab7c804904d6ae2104875b46422629e4110b468205edf5e9bee130d53","fast_id":"09353040781e7cfd2ecd6a0a46770ab787415f2913f26169b44225f6207896c9","fast_time":0.0199463361,"language":"cpp","measured_fast_code_id":"09353040781e7cfd2ecd6a0a46770ab787415f2913f26169b44225f6207896c9","measured_slow_code_id":"c34d2d38005364ea22114dc8cec84560c4b36796e75687b5ec386e0f12b27707","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_40667","problem_id":"p03325","slow_code_id":"abea82f34fb2e97e55873911de8f64c3804be6c29a9228ac79bff147130db2d9","slow_id":"c34d2d38005364ea22114dc8cec84560c4b36796e75687b5ec386e0f12b27707","slow_time":0.0977305403,"speedup":4.899673795228989,"stratum":"4-8","sampling_key":"e22808e7f2b9adf643d1e7f8c367c794c7a2ca680624857efdbd136776bd62af","slow_code":"#include <cstdio>\n\n#include <vector>\n\nusing namespace std;\n\nint N, t;\nvector<int> v;\n\nint rec(int x, int cnt) {\n\n  if (x % 2 == 1)\n    return cnt;\n\n  return rec(x / 2, cnt + 1);\n}\n\nint main() {\n\n  int N;\n  scanf(\"%d\", &N);\n\n  for (int i = 0; i < N; i++) {\n\n    scanf(\"%d\", &t);\n\n    if (t % 2 == 0)\n      v.push_back(t);\n  }\n\n  int sum;\n\n  for (int x : v)\n    sum += rec(x, 0);\n\n  printf(\"%d\\n\", sum);\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nint N, t, ans;\n\nint main() {\n\n  int N;\n  scanf(\"%d\", &N);\n\n  for (int i = 0; i < N; i++) {\n\n    scanf(\"%d\", &t);\n\n    while (t % 2 == 0) {\n      t /= 2;\n      ans++;\n    }\n  }\n\n  printf(\"%d\", ans);\n}"}
{"fast_code_id":"731f31568bce4f1a6b16f6b5d2cad694c601e55aa6e3892e0d13107856d535a7","fast_id":"b5f1eeac201ab31ddfdeca292c826bff287a344133c04ff33d6f9624456801b5","fast_time":0.0692967778,"language":"cpp","measured_fast_code_id":"b5f1eeac201ab31ddfdeca292c826bff287a344133c04ff33d6f9624456801b5","measured_slow_code_id":"b92cdbb7d22dae5cb8a32379c552733ee6ffa5ef0bd58e221b8db0e2c51d67e2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_40703","problem_id":"p02795","slow_code_id":"784c6d55292436464c0c9307fd044d973ddc9ac71aa8d42929b3d23e9ad6e0ed","slow_id":"b92cdbb7d22dae5cb8a32379c552733ee6ffa5ef0bd58e221b8db0e2c51d67e2","slow_time":0.2416765105,"speedup":3.4875576927618703,"stratum":"2-4","sampling_key":"45ec34d0ca486e7d84038c0c80d316234fcf0c1e656cc50e9f780d3a4baf02d8","slow_code":"\n\n#ifndef _GLIBCXX_NO_ASSERT\n\n#include <cassert>\n\n#endif\n\n#include <cctype>\n\n#include <cerrno>\n\n#include <cfloat>\n\n#include <ciso646>\n\n#include <climits>\n\n#include <clocale>\n\n#include <cmath>\n\n#include <csetjmp>\n\n#include <csignal>\n\n#include <cstdarg>\n\n#include <cstddef>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <ctime>\n\n#if __cplusplus >= 201103L\n\n#include <ccomplex>\n\n#include <cfenv>\n\n#include <cinttypes>\n\n#include <cstdbool>\n\n#include <cstdint>\n\n#include <ctgmath>\n\n#include <cwchar>\n\n#include <cwctype>\n\n#endif\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <complex>\n\n#include <deque>\n\n#include <exception>\n\n#include <fstream>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <ios>\n\n#include <iosfwd>\n\n#include <iostream>\n\n#include <istream>\n\n#include <iterator>\n\n#include <limits>\n\n#include <list>\n\n#include <locale>\n\n#include <map>\n\n#include <memory>\n\n#include <new>\n\n#include <numeric>\n\n#include <ostream>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <stdexcept>\n\n#include <streambuf>\n\n#include <string>\n\n#include <typeinfo>\n\n#include <utility>\n\n#include <valarray>\n\n#include <vector>\n\n#if __cplusplus >= 201103L\n\n#include <array>\n\n#include <atomic>\n\n#include <chrono>\n\n#include <condition_variable>\n\n#include <forward_list>\n\n#include <future>\n\n#include <initializer_list>\n\n#include <mutex>\n\n#include <random>\n\n#include <ratio>\n\n#include <regex>\n\n#include <scoped_allocator>\n\n#include <system_error>\n\n#include <thread>\n\n#include <tuple>\n\n#include <typeindex>\n\n#include <type_traits>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#endif\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\n#define intt long long\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    } else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nvector<int> v[100004];\n\nbool went[100004];\n\nvoid dfs(int x) {\n\n  went[x] = true;\n\n  for (int i = 0; i < (int)v[x].size(); i++) {\n\n    if (!went[v[x][i]]) {\n\n      dfs(v[x][i]);\n    }\n  }\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\nint lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    } else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\nint fukugen(vector<int> l) {\n\n  int ans = 0;\n\n  for (int i = 0; i < l.size(); i++) {\n\n    ans *= 10;\n\n    ans += l[i];\n  }\n\n  return ans;\n}\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nint n, a[100004], ans, big, h, w;\n\nsigned main() {\n\n  cin >> h >> w >> n;\n\n  int ans1 = n / h;\n\n  if (n % h) {\n\n    ans1++;\n  }\n\n  int ans2 = n / w;\n\n  if (n % w) {\n\n    ans2++;\n  }\n\n  cout << min(ans1, ans2) << endl;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)((1e9) + 7)\n\n#define intt long long\n\n#define itn long long\n\n#define P pair<int, int>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, n) for (int i = 1; i <= n; i++)\n\n#define ALL(v) v.begin(), v.end()\n\nusing namespace std;\n\ninline int modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % m;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ninline int gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\ninline int lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\ntemplate <class T, class U>\n\ninline bool chmax(T &lhs, const U &rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\ntemplate <class T, class U>\n\ninline bool chmin(T &lhs, const U &rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\nvoid Yes() { cout << \"Yes\" << endl; }\n\nvoid No() { cout << \"No\" << endl; }\n\nvoid YES() { cout << \"YES\" << endl; }\n\nvoid NO() { cout << \"NO\" << endl; }\n\n#define fin(i) scanf(\"%lld\", &i)\n\n#define fout(i) printf(\"%lld\", i)\n\n#define fendl printf(\"\\n\")\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\n#define vecin(v)                                                               \\\n  for (int i = 0; i < v.size(); i++)                                           \\\n    scanf(\"%lld\", &v[i]);\n\n#define vecout(v)                                                              \\\n  {                                                                            \\\n    for (int i = 0; i < (int)v.size(); i++)                                    \\\n      printf(\"%lld \", v[i]);                                                   \\\n    printf(\"\\n\");                                                              \\\n  }\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\n  vector<int> ookisa;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    ookisa = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n\n      ookisa[i] = 1;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n      ookisa[y] += ookisa[x];\n\n      ookisa[x] = 0;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      ookisa[x] += ookisa[y];\n\n      ookisa[y] = 0;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  int size(int i) {\n\n    i = find(i);\n\n    return ookisa[i];\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\n#define endl \"\\n\"\n\nint perm[1000005];\n\nvoid init_perm() {\n\n  perm[0] = 1;\n\n  REP(i, 1000000) { perm[i] = perm[i - 1] * i % mod; }\n}\n\nint nCk(int x, int y) {\n\n  return perm[x] * modpow(perm[x - y], mod - 2) % mod *\n         modpow(perm[y], mod - 2) % mod;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint a, b, c, ans;\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  std::cin.tie(nullptr);\n\n  cin >> a >> b >> c;\n\n  ans = inf;\n\n  rep(i, a + 1) {\n\n    rep(j, b + 1) {\n\n      if (i * b + j * a - i * j >= c) {\n\n        chmin(ans, i + j);\n      }\n    }\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"5af57a221fcfe57d934f998635067bbedd208755f50e1155908192959b7142e0","fast_id":"49e86957bd5764a8517e9a0769d3237703699bb54593b07fc91e1e188a7050e6","fast_time":0.0133072425,"language":"cpp","measured_fast_code_id":"49e86957bd5764a8517e9a0769d3237703699bb54593b07fc91e1e188a7050e6","measured_slow_code_id":"61ae4016c3458ac2b120f6fde40408fcf085a6281956b96f224bde85147713c1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_40772","problem_id":"p03032","slow_code_id":"b615d36d067027ce92aabc0530879ef0c9da98b359a927bb183ed9c302a9054a","slow_id":"61ae4016c3458ac2b120f6fde40408fcf085a6281956b96f224bde85147713c1","slow_time":0.8312465825,"speedup":62.465727403705166,"stratum":"8+","sampling_key":"43160e38903958b047856c8b40b00a453baeb5d533a25ed5b049ab2520882d21","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define all(v) ((v).begin()), ((v).end())\n\n#define ll long long\n\n#define fastIO                                                                 \\\n  cout << fixed << setprecision(12), ios::sync_with_stdio(false),              \\\n      cin.tie(nullptr), cout.tie(nullptr)\n\ndouble const EPS = 1e-12, PI = acos(-1);\n\nconst int N = 2e5 + 9, M = 3e3 + 9, OO = 1e9 + 7, MOD = 1e9 + 7;\n\nconst ll inf = 1e18;\n\nll mem[109][109][109], arr[N];\n\nint n, m;\n\nll solve(int l, int r, int steps) {\n\n  if (steps < 0)\n\n    return -inf;\n\n  if (steps == 0 || l > r)\n\n    return 0;\n\n  ll &ret = mem[l][r][steps];\n\n  if (~ret)\n\n    return ret;\n\n  ret = -inf;\n\n  ll c1 = solve(l + 1, r, steps - 1) + arr[l];\n\n  ll c2 = solve(l, r - 1, steps - 1) + arr[r];\n\n  ll c3 = solve(l + 1, r, steps - 2);\n\n  ll c4 = solve(l, r - 1, steps - 2);\n\n  ret = max(max(c1, c2), max(c3, c4));\n\n  return ret;\n}\n\nint main() {\n\n  fastIO;\n\n#ifdef LOCAL\n\n  freopen(\"input.in\", \"rt\", stdin);\n\n#endif\n\n  cin >> n >> m;\n\n  for (int i = 0; i < n; ++i) {\n\n    cin >> arr[i];\n  }\n\n  memset(mem, -1, sizeof mem);\n\n  ll best = -inf;\n\n  for (int i = 0; i <= m; ++i) {\n\n    best = max(best, solve(0, n - 1, i));\n  }\n\n  cout << best;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing std::min;\n\nusing std::max;\n\nusing std::sort;\n\n#define MAXN 103\n\nint main(void)\n\n{\n\n  int N, K, R;\n\n  int a[MAXN], plate[MAXN];\n\n  scanf(\"%d%d\", &N, &K);\n\n  int i, j, res = 0;\n\n  for (i = 0; i < N; i++)\n\n  {\n\n    scanf(\"%d\", a + i);\n  }\n\n  R = min(N, K);\n\n  for (int A = 0; A <= R; A++)\n\n  {\n\n    for (int B = 0; B <= R - A; B++)\n\n    {\n\n      for (i = 0; i < A; i++)\n\n      {\n\n        plate[i] = a[i];\n      }\n\n      for (j = 0; j < B; j++)\n\n      {\n\n        plate[i + j] = a[N - 1 - j];\n      }\n\n      sort(plate, plate + A + B);\n\n      i = 0;\n\n      while (i < K - (A + B) && plate[i] < 0)\n\n      {\n\n        i++;\n      }\n\n      int s = 0;\n\n      for (; i < A + B; i++)\n\n      {\n\n        s += plate[i];\n      }\n\n      res = max(s, res);\n    }\n  }\n\n  printf(\"%d\\n\", res);\n\n  return 0;\n}"}
{"fast_code_id":"97c198803955589be52323d8f5e2fe26ca80987b53b9cd2954b65aa7e9e25e70","fast_id":"c4c70d289dde34de6465cd890957ebba062d9f99f46cdae43358da5bd0f5d6ba","fast_time":0.0196091633,"language":"cpp","measured_fast_code_id":"c4c70d289dde34de6465cd890957ebba062d9f99f46cdae43358da5bd0f5d6ba","measured_slow_code_id":"81056477fa8ce32a8c10954dc0af10d5f3bdef1b3d9ef7879c8c611455a2f2a5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4078","problem_id":"p02571","slow_code_id":"4406fc14d0ed74290c423cc346c0d11b53003e679e617c95d5973b351a2119f7","slow_id":"81056477fa8ce32a8c10954dc0af10d5f3bdef1b3d9ef7879c8c611455a2f2a5","slow_time":0.1036047927,"speedup":5.283488699387801,"stratum":"4-8","sampling_key":"274991ce237b96b7db122c01bc7faa722c258940e0b5351f20bb49ac7e111bcc","slow_code":"#include <cmath>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint lt, ls, i, j, tt, ans = 0x7fffffff;\n\nchar s[1010], t[1010];\n\nint main() {\n\n  scanf(\"%s%s\", s + 1, t + 1);\n\n  ls = strlen(s + 1);\n\n  lt = strlen(t + 1);\n\n  for (i = 1; i <= ls - lt + 1; i++) {\n\n    tt = 0;\n\n    for (j = i; j <= i + lt - 1; j++) {\n\n      if (s[j] != t[j - i + 1]) {\n\n        tt++;\n      }\n    }\n\n    ans = min(tt, ans);\n  }\n\n  printf(\"%d\\n\", ans);\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#define min(a, b) ((a) < (b) ? (a) : (b))\n\nchar s[1003], t[1003];\n\nint lens, lent, ans = 1 << 30, sum;\n\nint main() {\n\n  scanf(\"%s%s\", s, t);\n\n  lens = strlen(s), lent = strlen(t);\n\n  for (int i = 0; i < lens - lent + 1; i++) {\n\n    sum = 0;\n\n    for (int j = 0; j < lent; j++)\n      if (s[i + j] != t[j])\n        ++sum;\n\n    ans = min(ans, sum);\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"1027afc724c6b8a7ae3d1704e7a57fa4673750a49657398bb8f4f5427f279b69","fast_id":"ae5dcbfcec598c960bc52f99216f87c04da7d1d0a044ee1bb307f90559196eba","fast_time":0.0010224297,"language":"cpp","measured_fast_code_id":"ae5dcbfcec598c960bc52f99216f87c04da7d1d0a044ee1bb307f90559196eba","measured_slow_code_id":"193aa7a71375f17db1a46973a65c083e97ba0614a62b48c25ccb61d8792121e2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_40798","problem_id":"p03356","slow_code_id":"e74a5badbeb0f691b326d444c33a6586499b96f14c3bd004e8682749049b884d","slow_id":"193aa7a71375f17db1a46973a65c083e97ba0614a62b48c25ccb61d8792121e2","slow_time":0.0022763875,"speedup":2.226448918688493,"stratum":"2-4","sampling_key":"c373d187a023d3b7ee39728bcd9891a8080d360b9e45c86a230103b5faab1256","slow_code":"#include <bits/stdc++.h>\n\n#define INF 1000000000;\n\n#define debug(x) cerr << #x << \": \" << x << '\\n';\n\nusing namespace std;\n\nusing ll = long long;\n\nusing P = pair<int, int>;\n\nconst int MAX_N = (int)1e5;\n\ntemplate <size_t N>\n\nclass unionFindTree {\n\nprivate:\n  int par[N];\n\n  int rank[N];\n\n  int united[N];\n\npublic:\n  unionFindTree() {\n\n    for (int i = 0; i < (int)N; i++) {\n\n      par[i] = i;\n      rank[i] = 0;\n      united[i] = 1;\n    }\n  }\n\n  void init() {\n\n    for (int i = 0; i < (int)N; i++) {\n\n      par[i] = i;\n      rank[i] = 0;\n      united[i] = 1;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x)\n      return x;\n\n    else\n      return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n    y = find(y);\n\n    if (x == y)\n      return;\n\n    if (rank[x] < rank[y]) {\n\n      par[x] = y;\n\n      united[y] += united[x];\n\n    } else {\n\n      par[y] = x;\n\n      united[x] += united[y];\n\n      if (rank[x] == rank[y])\n        rank[x]++;\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n\n  int count(int x) { return united[find(x)]; }\n};\n\nint main(void) {\n\n  int N, M;\n  cin >> N >> M;\n\n  int p[MAX_N];\n\n  unionFindTree<MAX_N> uf;\n\n  for (int i = 0; i < N; i++) {\n\n    cin >> p[i];\n\n    p[i]--;\n  }\n\n  for (int i = 0; i < M; i++) {\n\n    int x, y;\n    cin >> x >> y;\n\n    uf.unite(--x, --y);\n  }\n\n  int res = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    if (uf.same(i, p[i]))\n      res++;\n  }\n\n  cout << res << '\\n';\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define debug(x) cerr << #x << \": \" << x << '\\n';\n\nusing namespace std;\n\nusing ll = long long;\n\nusing P = pair<int, int>;\n\nconst int INF = (int)1e9;\n\n#ifndef UNION_FIND_TREE\n\n#define UNION_FIND_TREE\n\nclass UnionFindTree {\n\nprivate:\n  int N;\n\n  unique_ptr<int[]> parent;\n\n  unique_ptr<int[]> rank;\n\n  unique_ptr<int[]> size;\n\npublic:\n  UnionFindTree(int N) {\n\n    this->N = N;\n\n    this->parent = make_unique<int[]>(N);\n\n    this->rank = make_unique<int[]>(N);\n\n    this->size = make_unique<int[]>(N);\n\n    for (int i = 0; i < (int)N; i++) {\n\n      parent[i] = i;\n      rank[i] = 0;\n      size[i] = 1;\n    }\n  }\n\n  void init() {\n\n    for (int i = 0; i < (int)N; i++) {\n\n      parent[i] = i;\n      rank[i] = 0;\n      size[i] = 1;\n    }\n  }\n\n  int find(int x) {\n\n    if (parent[x] == x)\n      return x;\n\n    else\n      return parent[x] = find(parent[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n    y = find(y);\n\n    if (x == y)\n      return;\n\n    if (rank[x] < rank[y]) {\n\n      parent[x] = y;\n\n      size[y] += size[x];\n\n    } else {\n\n      parent[y] = x;\n\n      size[x] += size[y];\n\n      if (rank[x] == rank[y])\n        rank[x]++;\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n\n  int count(int x) { return size[find(x)]; }\n};\n\n#endif\n\nint N, M;\n\nint p[100000];\n\nint main(void) {\n\n  cin >> N >> M;\n\n  UnionFindTree ut(N);\n\n  for (int i = 0; i < N; i++) {\n\n    cin >> p[i];\n\n    p[i]--;\n  }\n\n  for (int i = 0; i < M; i++) {\n\n    int x, y;\n    cin >> x >> y;\n\n    ut.unite(--x, --y);\n  }\n\n  int res = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    if (ut.same(p[i], i))\n      res++;\n  }\n\n  cout << res << '\\n';\n\n  return 0;\n}"}
{"fast_code_id":"38356dda747b899aad4265c9deb8bce20d9d77132d38af7c576fa8eaaa2c7300","fast_id":"49a3831e68ddbbe32612c2f7546706876b00760f89e09d41ef0d51d0e1c5be57","fast_time":0.0212220148,"language":"cpp","measured_fast_code_id":"49a3831e68ddbbe32612c2f7546706876b00760f89e09d41ef0d51d0e1c5be57","measured_slow_code_id":"ee3869e8ea0a75c0a7cac873f004571ce22209108c492fc4b3fa62820b60557a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_40849","problem_id":"p03735","slow_code_id":"9932b73619ed56acb1af066d3e0fd8a5d33decb62c561b1627f0ab8e8810bc44","slow_id":"ee3869e8ea0a75c0a7cac873f004571ce22209108c492fc4b3fa62820b60557a","slow_time":0.3461614122,"speedup":16.31143015695192,"stratum":"8+","sampling_key":"14c968697931c42018a2199c1bb3767806331526473b6ae19ea8d37ceb86d723","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; i++)\n\n#define DREP(i, a, b) for (int i = (a), _end_ = (b); i >= _end_; i--)\n\n#define EREP(i, a) for (int i = start[(a)]; i; i = e[i].next)\n\ntemplate <class T> inline void chkmax(T &a, T b) {\n  if (a < b)\n    a = b;\n}\n\ntemplate <class T> inline void chkmin(T &a, T b) {\n  if (a > b)\n    a = b;\n}\n\n#define fi first\n\n#define se second\n\n#define mkr(a, b) make_pair(a, b)\n\ninline int read()\n\n{\n\n  int sum = 0, p = 1;\n  char ch = getchar();\n\n  while (!(('0' <= ch && ch <= '9') || ch == '-'))\n    ch = getchar();\n\n  if (ch == '-')\n    p = -1, ch = getchar();\n\n  while ('0' <= ch && ch <= '9')\n    sum = sum * 10 + ch - 48, ch = getchar();\n\n  return sum * p;\n}\n\n#define pii pair<ll, ll>\n\nconst int maxn = 4e5 + 20;\n\npii a[maxn];\n\nint n;\n\nint x[maxn], y[maxn];\n\ninline void init()\n\n{\n\n  n = read();\n\n  REP(i, 1, n)\n  x[i] = read(),\n  y[i] = read(), a[i * 2 - 1] = mkr(x[i], i), a[i * 2] = mkr(y[i], i);\n\n  REP(i, 1, n) if (x[i] > y[i]) swap(x[i], y[i]);\n\n  sort(a + 1, a + n * 2 + 1);\n}\n\nll Ans = 1ll << 60;\n\nint vis[maxn];\n\ninline void doing()\n\n{\n\n  if (a[1].se != a[n * 2].se)\n\n  {\n\n    memset(vis, 0, sizeof(vis));\n\n    ll L, R;\n\n    vis[a[n * 2].se]++;\n\n    REP(i, 1, n * 2 - 1)\n\n    {\n\n      if (!vis[a[i].se])\n        vis[a[i].se]++;\n\n      else {\n        L = i;\n        break;\n      }\n    }\n\n    memset(vis, 0, sizeof(vis));\n\n    vis[a[1].se]++;\n\n    DREP(i, n * 2, 1)\n\n    {\n\n      if (!vis[a[i].se])\n        vis[a[i].se]++;\n\n      else {\n        R = a[i].fi;\n        break;\n      }\n    }\n\n    memset(vis, 0, sizeof(vis));\n\n    REP(i, 2, L)\n\n    {\n\n      chkmin(Ans, 1ll * (a[n * 2].fi - a[1].fi) * (R - a[i].fi));\n\n      chkmax(R, (ll)y[a[i].se]);\n    }\n  }\n\n  ll mn1 = 1ll << 60, mx1 = 0, mn2 = 1ll << 60, mx2 = 0;\n\n  memset(vis, 0, sizeof(vis));\n\n  REP(i, 1, n * 2)\n\n  {\n\n    if (!vis[a[i].se])\n      vis[a[i].se]++, chkmin(mn1, a[i].fi), chkmax(mx1, a[i].fi);\n\n    else\n      chkmin(mn2, a[i].fi), chkmax(mx2, a[i].fi);\n  }\n\n  chkmin(Ans, 1ll * (mx2 - mn2) * (mx1 - mn1));\n\n  printf(\"%lld\\n\", Ans);\n}\n\nint main()\n\n{\n\n  init();\n\n  doing();\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#define inf 1e18 + 2\n\nusing namespace std;\n\ntypedef unsigned long long ll;\n\ninline ll rd()\n\n{\n\n  ll x = 0, p = 1;\n\n  char a = getchar();\n\n  while ((a < 48 || a > 57) && a != '-')\n    a = getchar();\n\n  if (a == '-')\n    p = -p, a = getchar();\n\n  while (a > 47 && a < 58)\n\n  {\n\n    x = (x << 1) + (x << 3) + (a & 15);\n\n    a = getchar();\n  }\n\n  return x * p;\n}\n\ninline void write(ll x)\n\n{\n\n  if (x < 0)\n    x = -x, putchar('-');\n\n  if (x > 9)\n    write(x / 10);\n\n  putchar(x % 10 + 48);\n}\n\ninline void print(ll x, int type = 0)\n\n{\n\n  write(x);\n\n  if (!type)\n    putchar(' ');\n\n  else\n    puts(\"\");\n}\n\nstruct node\n\n{\n\n  ll x, y;\n\n} d[200002];\n\nll n, lmax, lmin, rmax, rmin;\n\nll ans;\n\nint main()\n\n{\n\n  srand(time(0));\n\n  n = rd();\n\n  d[1].x = rd();\n  d[1].y = rd();\n\n  lmax = lmin = d[1].x;\n  rmax = rmin = d[1].y;\n\n  for (int i = 2; i <= n; i++)\n\n  {\n\n    d[i].x = rd();\n    d[i].y = rd();\n\n    ll a, b;\n\n    if (d[i].x > lmax)\n\n    {\n\n      if (d[i].y > rmax)\n        a = (d[i].x - lmin) * (d[i].y - rmin);\n\n      else if (d[i].y < rmin)\n        a = (d[i].x - lmin) * (rmax - d[i].y);\n\n      else\n        a = (d[i].x - lmin) * (rmax - rmin);\n\n    }\n\n    else if (d[i].x < lmin)\n\n    {\n\n      if (d[i].y > rmax)\n        a = (lmax - d[i].x) * (d[i].y - rmin);\n\n      else if (d[i].y < rmin)\n        a = (lmax - d[i].x) * (rmax - d[i].y);\n\n      else\n        a = (lmax - d[i].x) * (rmax - rmin);\n\n    }\n\n    else\n\n    {\n\n      if (d[i].y > rmax)\n        a = (lmax - lmin) * (d[i].y - rmin);\n\n      else if (d[i].y < rmin)\n        a = (lmax - lmin) * (rmax - d[i].y);\n\n      else\n        a = (lmax - lmin) * (rmax - rmin);\n    }\n\n    swap(d[i].x, d[i].y);\n\n    if (d[i].x > lmax)\n\n    {\n\n      if (d[i].y > rmax)\n        b = (d[i].x - lmin) * (d[i].y - rmin);\n\n      else if (d[i].y < rmin)\n        b = (d[i].x - lmin) * (rmax - d[i].y);\n\n      else\n        b = (d[i].x - lmin) * (rmax - rmin);\n\n    }\n\n    else if (d[i].x < lmin)\n\n    {\n\n      if (d[i].y > rmax)\n        b = (lmax - d[i].x) * (d[i].y - rmin);\n\n      else if (d[i].y < rmin)\n        b = (lmax - d[i].x) * (rmax - d[i].y);\n\n      else\n        b = (lmax - d[i].x) * (rmax - rmin);\n\n    }\n\n    else\n\n    {\n\n      if (d[i].y > rmax)\n        b = (lmax - lmin) * (d[i].y - rmin);\n\n      else if (d[i].y < rmin)\n        b = (lmax - lmin) * (rmax - d[i].y);\n\n      else\n        b = (lmax - lmin) * (rmax - rmin);\n    }\n\n    swap(d[i].x, d[i].y);\n\n    if (a <= b)\n\n    {\n\n      lmax = max(lmax, d[i].x);\n      lmin = min(lmin, d[i].x);\n\n      rmax = max(rmax, d[i].y);\n      rmin = min(rmin, d[i].y);\n\n    }\n\n    else\n\n    {\n\n      lmax = max(lmax, d[i].y);\n      lmin = min(lmin, d[i].y);\n\n      rmax = max(rmax, d[i].x);\n      rmin = min(rmin, d[i].x);\n    }\n  }\n\n  ans = (lmax - lmin) * (rmax - rmin);\n\n  for (int q = 1; q <= 150; q++)\n\n  {\n\n    random_shuffle(d + 1, d + n + 1);\n\n    lmax = lmin = d[1].x;\n    rmax = rmin = d[1].y;\n\n    for (int i = 2; i <= n; i++)\n\n    {\n\n      ll a, b;\n\n      if (d[i].x > lmax)\n\n      {\n\n        if (d[i].y > rmax)\n          a = (d[i].x - lmin) * (d[i].y - rmin);\n\n        else if (d[i].y < rmin)\n          a = (d[i].x - lmin) * (rmax - d[i].y);\n\n        else\n          a = (d[i].x - lmin) * (rmax - rmin);\n\n      }\n\n      else if (d[i].x < lmin)\n\n      {\n\n        if (d[i].y > rmax)\n          a = (lmax - d[i].x) * (d[i].y - rmin);\n\n        else if (d[i].y < rmin)\n          a = (lmax - d[i].x) * (rmax - d[i].y);\n\n        else\n          a = (lmax - d[i].x) * (rmax - rmin);\n\n      }\n\n      else\n\n      {\n\n        if (d[i].y > rmax)\n          a = (lmax - lmin) * (d[i].y - rmin);\n\n        else if (d[i].y < rmin)\n          a = (lmax - lmin) * (rmax - d[i].y);\n\n        else\n          a = (lmax - lmin) * (rmax - rmin);\n      }\n\n      swap(d[i].x, d[i].y);\n\n      if (d[i].x > lmax)\n\n      {\n\n        if (d[i].y > rmax)\n          b = (d[i].x - lmin) * (d[i].y - rmin);\n\n        else if (d[i].y < rmin)\n          b = (d[i].x - lmin) * (rmax - d[i].y);\n\n        else\n          b = (d[i].x - lmin) * (rmax - rmin);\n\n      }\n\n      else if (d[i].x < lmin)\n\n      {\n\n        if (d[i].y > rmax)\n          b = (lmax - d[i].x) * (d[i].y - rmin);\n\n        else if (d[i].y < rmin)\n          b = (lmax - d[i].x) * (rmax - d[i].y);\n\n        else\n          b = (lmax - d[i].x) * (rmax - rmin);\n\n      }\n\n      else\n\n      {\n\n        if (d[i].y > rmax)\n          b = (lmax - lmin) * (d[i].y - rmin);\n\n        else if (d[i].y < rmin)\n          b = (lmax - lmin) * (rmax - d[i].y);\n\n        else\n          b = (lmax - lmin) * (rmax - rmin);\n      }\n\n      swap(d[i].x, d[i].y);\n\n      if (a <= b)\n\n      {\n\n        lmax = max(lmax, d[i].x);\n        lmin = min(lmin, d[i].x);\n\n        rmax = max(rmax, d[i].y);\n        rmin = min(rmin, d[i].y);\n\n      }\n\n      else\n\n      {\n\n        lmax = max(lmax, d[i].y);\n        lmin = min(lmin, d[i].y);\n\n        rmax = max(rmax, d[i].x);\n        rmin = min(rmin, d[i].x);\n      }\n    }\n\n    ans = min(ans, (lmax - lmin) * (rmax - rmin));\n  }\n\n  print(ans, 1);\n\n  return 0;\n}"}
{"fast_code_id":"2687af3bc09bb8a61912b66b8a2609727e66c85c9d96ea5298ff0049f1cbd1ec","fast_id":"95f634bec22725cd05630ebb2870883413e08b1e4d2fcc580b592ba746f6d7d2","fast_time":0.104019505,"language":"cpp","measured_fast_code_id":"95f634bec22725cd05630ebb2870883413e08b1e4d2fcc580b592ba746f6d7d2","measured_slow_code_id":"f4d9672185334ad73fbe48d6c0ab8696f7b9226de48c637a6f8d090d46c2de4b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_40882","problem_id":"p00965","slow_code_id":"1581764da2e65612db54d6fc69488ac73b8bab384e4d7d0707fbd5eaba64f23a","slow_id":"f4d9672185334ad73fbe48d6c0ab8696f7b9226de48c637a6f8d090d46c2de4b","slow_time":0.2356310577,"speedup":2.2652584022583073,"stratum":"2-4","sampling_key":"24eccdfc092780d3f78266489a3c1f87d13cf38ed1b766f22ba6c252cf718b02","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 2 * 1e5 + 100;\n\nint a[maxn], b[maxn], s[maxn], sum[maxn], rr[maxn], ll[maxn];\n\nint main()\n\n{\n\n  int n, t, last, ans2 = 0, ans1 = 0;\n\n  scanf(\"%d\", &n);\n\n  priority_queue<int, vector<int>, greater<int> > r;\n\n  priority_queue<int, vector<int>, less<int> > l;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%d %d\", &a[i], &b[i]);\n\n    s[a[i]]++, s[b[i]]--;\n\n    l.push(a[i]), r.push(b[i]);\n  }\n\n  t = r.top(), r.pop();\n\n  rr[last = t] = 1;\n\n  while (!r.empty())\n\n  {\n\n    t = r.top(), r.pop();\n\n    rr[t] = rr[last] + 1;\n\n    last = t;\n  }\n\n  t = l.top(), l.pop();\n\n  ll[last = t] = 1;\n\n  while (!l.empty())\n\n  {\n\n    t = l.top(), l.pop();\n\n    ll[t] = ll[last] + 1;\n\n    last = t;\n  }\n\n  for (int i = 1; i <= 100000; i++)\n\n    if (!rr[i])\n      rr[i] = rr[i - 1];\n\n  for (int i = 100000; i >= 0; i--)\n\n    if (!ll[i])\n      ll[i] = ll[i + 1];\n\n  for (int i = 0; i < n; i++)\n\n    ans1 = max(n - ll[b[i]] - rr[a[i]], ans1);\n\n  for (int i = 1; i <= 100000; i++)\n\n    ans2 = max(s[i] = s[i - 1] + s[i], ans2);\n\n  printf(\"%d %d\\n\", ans1, ans2);\n}\n","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <vector>\n\n#include <queue>\n\n#include <set>\n\nusing namespace std;\n\nconst int maxn = 200000 + 10;\n\nstruct Node {\n\n  int l, r;\n\n  bool operator<(const Node &b) const { return r == b.r && l > b.l || r < b.r; }\n\n} P[maxn];\n\nvector<int> sl, sr;\n\nint n;\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d %d\", &P[i].l, &P[i].r);\n\n    sl.push_back(P[i].l);\n\n    sr.push_back(P[i].r);\n  }\n\n  sort(sl.begin(), sl.end());\n\n  sort(sr.begin(), sr.end());\n\n  int mmax = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    int t1 = upper_bound(sr.begin(), sr.end(), P[i].l) - sr.begin();\n\n    int t2 = lower_bound(sl.begin(), sl.end(), P[i].r) - sl.begin();\n\n    t2 = n - t2;\n\n    mmax = max(mmax, n - t1 - t2);\n  }\n\n  sort(P, P + n);\n\n  multiset<int> s;\n\n  multiset<int>::iterator it;\n\n  for (int i = 0; i < n; i++) {\n\n    if (s.empty()) {\n\n      s.insert(-P[i].r);\n\n    } else {\n\n      it = s.lower_bound(-P[i].l);\n\n      if (it == s.end()) {\n\n        s.insert(-P[i].r);\n\n      } else {\n\n        s.erase(it);\n\n        s.insert(-P[i].r);\n      }\n    }\n  }\n\n  cout << mmax << \" \" << s.size() << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"d5e980ba26adf2afee5c3940a2374206ef953d0f3d41a80107793bae5727a255","fast_id":"84a49262fa2810a87ff51f92709554864d7ab466a4d27b85fe81be3ff3d8ad4e","fast_time":0.021795075,"language":"cpp","measured_fast_code_id":"84a49262fa2810a87ff51f92709554864d7ab466a4d27b85fe81be3ff3d8ad4e","measured_slow_code_id":"53c4650d865be809b47a146249ef366958a909a09447e2be74bcb9c511d4c477","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_40912","problem_id":"p02784","slow_code_id":"b2f5efa4e081402cae71669eff9f1c91d06b3ccb140cbef567aad360bc347112","slow_id":"53c4650d865be809b47a146249ef366958a909a09447e2be74bcb9c511d4c477","slow_time":0.1068609934,"speedup":4.9029881016697585,"stratum":"4-8","sampling_key":"147e15a068f9d4c7ce19fb04455e3509a5caf92ba3086322164cace9b422d7ff","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  map<int, bool> move_map;\n\n  bool yes = false;\n\n  int h, n;\n\n  cin >> h >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    int a;\n\n    cin >> a;\n\n    h -= a;\n  }\n\n  if (h > 0) {\n\n    cout << \"No\";\n\n  } else {\n\n    cout << \"Yes\";\n  }\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int i;\n\n  long long int H, N, sum = 0, arr[100000];\n\n  scanf(\"%lld %lld\", &H, &N);\n\n  for (i = 0; i < N; i++)\n\n  {\n\n    scanf(\"%lld\", &arr[i]);\n\n    sum = sum + arr[i];\n  }\n\n  if (sum >= H)\n\n  {\n\n    printf(\"Yes\\n\");\n\n  }\n\n  else if (sum < H)\n\n  {\n\n    printf(\"No\\n\");\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"7e83bdd4251a1a163957b5a5c6bcc413b9b08dc27679dd0c8fe47a5514629d2e","fast_id":"65d9abc885d6007820ffd08a83a5463f0bc4003782f117b79969c8d905b87c31","fast_time":0.0048263123,"language":"cpp","measured_fast_code_id":"65d9abc885d6007820ffd08a83a5463f0bc4003782f117b79969c8d905b87c31","measured_slow_code_id":"fed99e2703e6f25dff94002b43a47e0a5f13d00d9c043955f80a7e7665d4698a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41253","problem_id":"p00496","slow_code_id":"6636d67c2bc55e121774d9d11188f4634c9e641055840e0193f8f0e91b71eda4","slow_id":"fed99e2703e6f25dff94002b43a47e0a5f13d00d9c043955f80a7e7665d4698a","slow_time":0.0261239584,"speedup":5.4128197215915765,"stratum":"4-8","sampling_key":"023026824fcf9129674ce213c2cfd0f60e392470aa13baf203a93e22f373f000","slow_code":"\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <string>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\n#include <stack>\n\n#include <functional>\n\n#include <iostream>\n\n#include <map>\n\n#include <set>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\ntypedef pair<int, P> P1;\n\ntypedef pair<P, P> P2;\n\ntypedef long long ll;\n\n#define pu push\n\n#define pb push_back\n\n#define mp make_pair\n\n#define eps 1e-7\n\n#define INF 2000000000\n\n#define s(x) scanf(\"%d\", &x)\n\n#define rep(i, x) for (int i = 0; i < x; i++)\n\nint a[3005], b[3005];\n\nint dp[3005][2] = {};\n\nint main()\n\n{\n\n  int n, t, s;\n\n  scanf(\"%d %d %d\", &n, &t, &s);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d %d\", &a[i], &b[i]);\n  }\n\n  int cur = 0;\n\n  int nex = 1;\n\n  dp[0][cur] = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    for (int j = 0; j < 3005; j++)\n      dp[j][nex] = 0;\n\n    for (int j = 0; j <= t; j++)\n\n    {\n\n      dp[j][nex] = max(dp[j][nex], dp[j][cur]);\n    }\n\n    for (int j = 0; j <= t - b[i]; j++)\n\n    {\n\n      if (j < s && s < j + b[i])\n        continue;\n\n      dp[j + b[i]][nex] = max(dp[j + b[i]][nex], dp[j][cur] + a[i]);\n    }\n\n    cur = 1 - cur;\n    nex = 1 - nex;\n  }\n\n  int ret = 0;\n\n  for (int i = 0; i <= t; i++)\n    ret = max(ret, dp[i][cur]);\n\n  printf(\"%d\\n\", ret);\n}","fast_code":"#include <stdio.h>\n\nint max(int a, int b) { return a < b ? b : a; }\n\nint n, t, s;\n\nint dp[3005] = {}, a[3005], b[3005], ret = 0;\n\nint main() {\n\n  scanf(\"%d%d%d\", &n, &t, &s);\n\n  for (int i = 1; i <= n; i++)\n    scanf(\"%d%d\", &a[i], &b[i]);\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = t; j >= b[i]; j--) {\n\n      if (j - b[i] >= s || j <= s) {\n\n        dp[j] = max(dp[j], dp[j - b[i]] + a[i]);\n      }\n\n      ret = max(ret, dp[j]);\n    }\n  }\n\n  printf(\"%d\\n\", ret);\n}"}
{"fast_code_id":"0056d6efa871b8582e3bfd0436304934152eed642c5db9ea48c08285b79252ab","fast_id":"1bfc50ee40ee63d21c418d801df9c816bfcb170755f97c21ecff2d55891d728e","fast_time":0.03494687,"language":"cpp","measured_fast_code_id":"1bfc50ee40ee63d21c418d801df9c816bfcb170755f97c21ecff2d55891d728e","measured_slow_code_id":"37cb19910d51c08f4c5c4657351b34d1ef38b7019453299831eb02cc43495bb1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41264","problem_id":"p03790","slow_code_id":"c33de5131d7922df1821f4c6f25e8a830c54c53f56d404a6d238834d55af2eb1","slow_id":"37cb19910d51c08f4c5c4657351b34d1ef38b7019453299831eb02cc43495bb1","slow_time":0.1120939022,"speedup":3.207551983911578,"stratum":"2-4","sampling_key":"0869a1f07d5c18658536f453b001a282d200c150b0259d6bf211da75f7dde5c1","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAXN = 200005;\n\nint segsiz;\n\nint mn[MAXN * 4];\n\nint Query(int pos, int L = 1, int R = segsiz, int id = 1)\n\n{\n\n  if (L == R)\n\n    return mn[id];\n\n  int ret = mn[id], mid = (L + R) / 2;\n\n  if (pos <= mid)\n\n    return min(ret, Query(pos, L, mid, id * 2));\n\n  return min(ret, Query(pos, mid + 1, R, id * 2 + 1));\n}\n\nvoid Insert(int l, int r, int v, int L = 1, int R = segsiz, int id = 1)\n\n{\n\n  if (l > r)\n\n    return;\n\n  if (l <= L && R <= r)\n\n  {\n\n    mn[id] = min(mn[id], v);\n\n    return;\n  }\n\n  int mid = (L + R) / 2;\n\n  if (l <= mid)\n\n    Insert(l, r, v, L, mid, id * 2);\n\n  if (mid < r)\n\n    Insert(l, r, v, mid + 1, R, id * 2 + 1);\n}\n\nint N, M, K, A[MAXN], B[MAXN];\n\nint sumA[MAXN];\n\nint L[MAXN], R[MAXN];\n\nint val[MAXN];\n\nlong long dp[MAXN];\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &N, &K);\n\n  long long sum = 0;\n\n  for (int i = 1; i <= N; i++)\n\n  {\n\n    scanf(\"%d%d\", &A[i], &B[i]);\n\n    if (B[i] == 1 && 2 * A[i] > K)\n\n    {\n\n      puts(\"-1\");\n\n      return 0;\n    }\n\n    sum += A[i];\n\n    sumA[i] = (sumA[i - 1] + A[i]) % K;\n  }\n\n  for (int i = 1; i <= N; i++)\n\n  {\n\n    if (B[i] == 1)\n\n    {\n\n      L[i] = 2 * (K - sumA[i - 1]) % K;\n\n      R[i] = 2 * (K - sumA[i]) % K;\n\n    }\n\n    else\n\n      L[i] = 0, R[i] = K - 1;\n  }\n\n  for (int i = 1; i <= N; i++)\n\n    val[i * 2 - 1] = L[i], val[i * 2] = R[i];\n\n  sort(val + 1, val + 2 * N + 1);\n\n  M = unique(val + 1, val + 2 * N + 1) - val - 1;\n\n  for (int i = 1; i <= N; i++)\n\n  {\n\n    L[i] = lower_bound(val + 1, val + M + 1, L[i]) - val;\n\n    R[i] = lower_bound(val + 1, val + M + 1, R[i]) - val;\n  }\n\n  segsiz = M;\n\n  memset(mn, 0x3F, sizeof mn);\n\n  for (int i = N; i >= 1; i--)\n\n  {\n\n    int j = Query(L[i]);\n\n    if (j == 0x3F3F3F3F)\n\n      dp[i] = 0;\n\n    else\n\n      dp[i] = dp[j] + (val[L[j]] - val[L[i]] + K) % K;\n\n    if (L[i] <= R[i])\n\n    {\n\n      Insert(1, L[i] - 1, i);\n\n      Insert(R[i] + 1, M, i);\n\n    }\n\n    else\n\n      Insert(R[i] + 1, L[i] - 1, i);\n  }\n\n  long long ans = 0x3F3F3F3F3F3F3F3FLL;\n\n  for (int i = 1; i <= M; i++)\n\n  {\n\n    int j = Query(i);\n\n    if (j == 0x3F3F3F3F)\n\n      ans = 0;\n\n    else\n\n      ans = min(ans, 1LL * (val[L[j]] - val[i] + K) % K + dp[j]);\n  }\n\n  ans = ans + 2LL * sum;\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int Maxn = 100005;\n\nstruct node {\n\n  long long l, r, x, d;\n\n  node(long long l, long long r, long long x, long long d)\n      :\n\n        l(l), r(r), x(x), d(d) {}\n\n  node() { l = r = x = d = 0; }\n\n  bool operator<(const node &b) const { return l < b.l; }\n};\n\nint n, b[Maxn];\n\nlong long k, ans;\n\nlong long a[Maxn];\n\nset<node> st;\n\nint main() {\n\n  scanf(\"%d %lld\", &n, &k), ans = 0;\n\n  for (int i = 0; i < n; ++i) {\n\n    scanf(\"%lld %d\", a + i, b + i);\n\n    ans += (a[i] <<= 1);\n\n    if (a[i] > k && b[i] == 1)\n\n      return puts(\"-1\") & 0;\n\n    if (b[i] == 2)\n      a[i] %= k;\n  }\n  st.insert({0, k, 0, 0});\n\n  long long cur = 0;\n\n  for (int i = 0; i < n; ++i) {\n\n    long long d = a[i];\n\n    long long nx = cur + d;\n\n    (nx > k) && (nx -= k);\n\n    if (b[i] == 1) {\n\n      if (cur < nx) {\n\n        auto it = st.lower_bound({cur, 0, 0, 0});\n\n        while (it->r < nx)\n          st.erase(it++);\n\n        node x1 = *it, x2 = *it;\n\n        st.erase(it), x2.l = nx;\n\n        long long now = x2.x + x2.d * (x2.r - nx);\n\n        x1 = node(cur, nx, now, 1);\n\n        st.insert(x1);\n\n        if (x2.l ^ x2.r)\n          st.insert(x2);\n\n      } else {\n\n        auto it = st.lower_bound({cur, 0, 0, 0});\n\n        while (it != st.end())\n          st.erase(it++);\n\n        it = st.begin();\n\n        while (it->r < nx)\n          st.erase(it++);\n\n        node x1 = *it, x2 = *it;\n\n        st.erase(it), x2.l = nx;\n\n        long long now = x2.x + x2.d * (x2.r - nx);\n\n        x1 = node(0, nx, now, 1);\n\n        st.insert(x1);\n\n        if (x2.l != x2.r)\n          st.insert(x2);\n\n        now = x1.x + x1.d * x1.r;\n\n        x2 = node(cur, k, now, 1);\n\n        st.insert(x2);\n      }\n      cur = (cur + a[i]) % k;\n\n    } else {\n\n      (cur += a[i]) %= k;\n\n      auto it = st.lower_bound({cur, 0, 0, 0});\n\n      if (it == st.begin())\n        continue;\n\n      if ((--it)->r <= cur)\n        continue;\n\n      node x1 = *it, x2 = *it;\n\n      st.erase(it), x2.l = cur;\n\n      x1.x = x2.x + x2.d * (x2.r - cur);\n\n      x1.r = cur;\n\n      st.insert(x1), st.insert(x2);\n    }\n  }\n\n  long long mn = st.begin()->x;\n\n  for (auto x : st)\n\n    mn = min(mn, x.x);\n\n  printf(\"%lld\\n\", ans + mn);\n\n  return 0;\n}"}
{"fast_code_id":"afb106540e2cb697fc666ff0d36b8d1682d9b643949f4fc50bd5750bd3d5168f","fast_id":"b01c1f092c8067d3fbde68e09d82136ae9f39d7a8ae09c6b9bb6020767ec762b","fast_time":0.022300888,"language":"cpp","measured_fast_code_id":"b01c1f092c8067d3fbde68e09d82136ae9f39d7a8ae09c6b9bb6020767ec762b","measured_slow_code_id":"6d4d8f297a938117602ab8efb385410759792efc1f5762f0d7f463b85c196813","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41298","problem_id":"p02881","slow_code_id":"95f5a9b8847a987e83efcef3f9c249a3dabbe90a053e4e4807f5e8fbae9187e9","slow_id":"6d4d8f297a938117602ab8efb385410759792efc1f5762f0d7f463b85c196813","slow_time":0.080572824,"speedup":3.6129872496557085,"stratum":"2-4","sampling_key":"af626cbf2c659f1fccdac87c5e7b20d0f06b7c2a8d669df879b3ea93bbac84fd","slow_code":"#include <stdio.h>\n\n#include <algorithm>\n\n#include <assert.h>\n\n#include <bitset>\n\n#include <cmath>\n\n#include <complex>\n\n#include <deque>\n\n#include <functional>\n\n#include <iostream>\n\n#include <limits.h>\n\n#include <map>\n\n#include <math.h>\n\n#include <queue>\n\n#include <deque>\n\n#include <set>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <string>\n\n#include <time.h>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <vector>\n\n#include <chrono>\n\n#include <random>\n\n#include <time.h>\n\n#include <fstream>\n\n#define ll long long\n\n#define rep2(i, a, b) for (ll i = a; i <= b; ++i)\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define rep3(i, a, b) for (ll i = a; i >= b; i--)\n\n#define pii pair<int, int>\n\n#define pll pair<ll, ll>\n\n#define pq priority_queue<int>\n\n#define pqg priority_queue<int, vector<int>, greater<int>>\n\n#define pb push_back\n\n#define vec vector<int>\n\n#define vecll vector<ll>\n\n#define vecpii vector<pii>\n\n#define endl \"\\n\"\n\n#define all(c) begin(c), end(c)\n\nusing namespace std;\n\nint in() {\n  int x;\n  scanf(\"%d\", &x);\n  return x;\n}\n\nll lin() {\n  ll x;\n  scanf(\"%lld\", &x);\n  return x;\n}\n\nvoid print(vec v) {\n  for (auto e : v)\n    cout << e << \" \";\n  cout << endl;\n}\n\nvoid print(vecll v) {\n  for (auto e : v)\n    cout << e << \" \";\n  cout << endl;\n}\n\nvoid print(map<int, int> mp) {\n  for (auto e : mp)\n    cout << e.first << \" \" << e.second << endl;\n  cout << endl;\n}\n\n#define INF 1e9 + 7\n\n#define LLINF 1e18 + 7\n\nll MOD = 998244353;\n\nconst int N = 160000;\n\ntemplate <ll Modulus> class modint {\n\n  using u64 = ll;\n\npublic:\n  u64 a;\n\n  constexpr modint(const u64 x = 0) noexcept\n      : a((x % Modulus + Modulus) % Modulus) {}\n\n  constexpr u64 &value() noexcept { return a; }\n\n  constexpr const u64 &value() const noexcept { return a; }\n\n  constexpr modint operator+(const modint rhs) const noexcept {\n\n    return modint(*this) += rhs;\n  }\n\n  constexpr modint operator-(const modint rhs) const noexcept {\n\n    return modint(*this) -= rhs;\n  }\n\n  constexpr modint operator*(const modint rhs) const noexcept {\n\n    return modint(*this) *= rhs;\n  }\n\n  constexpr modint operator/(const modint rhs) const noexcept {\n\n    return modint(*this) /= rhs;\n  }\n\n  constexpr modint &operator+=(const modint rhs) noexcept {\n\n    a += rhs.a;\n\n    if (a >= Modulus) {\n\n      a -= Modulus;\n    }\n\n    return *this;\n  }\n\n  constexpr modint &operator-=(const modint rhs) noexcept {\n\n    if (a < rhs.a) {\n\n      a += Modulus;\n    }\n\n    a -= rhs.a;\n\n    return *this;\n  }\n\n  constexpr modint &operator*=(const modint rhs) noexcept {\n\n    a = a * rhs.a % Modulus;\n\n    return *this;\n  }\n\n  constexpr modint &operator/=(modint rhs) noexcept {\n\n    u64 exp = Modulus - 2;\n\n    while (exp) {\n\n      if (exp % 2) {\n\n        *this *= rhs;\n      }\n\n      rhs *= rhs;\n\n      exp /= 2;\n    }\n\n    return *this;\n  }\n};\n\n#define mint modint<998244353>\n\nmint inv[N], comb[N], prd[N], invprd[N];\n\nvoid calc_inv() {\n\n  inv[1] = 1;\n\n  rep2(i, 2, N - 1) { inv[i] = inv[MOD % i] * (-MOD / i); }\n\n  return;\n}\n\nvoid calc_product() {\n\n  prd[0] = prd[1] = 1;\n\n  invprd[0] = invprd[1] = 1;\n\n  rep2(i, 2, N - 1) {\n\n    prd[i] = prd[i - 1] * i;\n\n    invprd[i] = inv[i] * invprd[i - 1];\n  }\n\n  return;\n}\n\nvoid calc_mod() { calc_inv(), calc_product(); }\n\nmint cmb(int a, int b) {\n\n  if (a < b)\n    return 0;\n\n  if (a < 0 || b < 0)\n    return 0;\n\n  return {prd[a] * invprd[b] * invprd[a - b]};\n}\n\nmint modpow(mint x, ll n) {\n\n  if (n == 0)\n    return 1;\n\n  mint res = modpow(x * x, n / 2);\n\n  if (n & 1)\n    res = res * x;\n\n  return res;\n}\n\nvector<vec> G;\n\nvector<mint> subtree;\n\nmint calc_sub(int x, int p) {\n\n  mint res = 1;\n\n  for (auto e : G[x]) {\n\n    if (e != p)\n\n      res += calc_sub(e, x);\n  }\n\n  return subtree[x] = res;\n}\n\nstruct querry {\n\n  int l, r;\n\n  mint p;\n};\n\nint n;\n\nvector<vector<querry>> mem;\n\nvec ls, rs;\n\nvoid dfs(int x, int p, int &idx) {\n\n  ls[x] = idx++;\n\n  vecpii visit;\n\n  for (auto e : G[x]) {\n\n    if (e != p)\n      visit.pb({subtree[e].a, e});\n  }\n\n  sort(all(visit));\n\n  for (auto e : visit) {\n\n    dfs(e.second, x, idx);\n  }\n\n  int now = 0, start = 0;\n\n  now = subtree[x].a;\n\n  mem[x].pb(querry{0, ls[x], inv[n] * (now)});\n\n  mem[x].pb(querry{ls[x], ls[x] + 1, (mint)1});\n\n  rep(i, visit.size()) {\n\n    now = visit[i].first, start = ls[visit[i].second];\n\n    while (i < visit.size() - 1 && visit[i + 1].first == now)\n      i++;\n\n    mem[x].pb(querry{start, rs[visit[i].second], inv[n] * (n - now)});\n  }\n\n  rs[x] = idx;\n\n  now = subtree[x].a;\n\n  mem[x].pb(querry{rs[x], n, inv[n] * (now)});\n\n  reverse(all(mem[x]));\n\n  return;\n}\n\ntemplate <typename T>\n\nstruct BIT {\n\n  vector<T> data;\n\n  BIT(int size) { data.assign(++size, 0); }\n\n  T sum(int k) {\n\n    T ret = 0;\n\n    for (++k; k > 0; k -= k & -k)\n      ret += data[k];\n\n    return (ret);\n  }\n\n  void add(int k, T x) {\n\n    for (++k; k < data.size(); k += k & -k)\n      data[k] += x;\n  }\n};\n\nBIT<mint> bit0(N), bit1(N);\n\nmain() {\n\n  ll n = lin();\n\n  ll ans = 1e18;\n\n  int sq = sqrt(n);\n\n  for (ll i = sq; i >= 1; i--) {\n\n    if (n % i == 0) {\n\n      printf(\"%lld\", n / i + i - 2);\n\n      return 0;\n    }\n  }\n}","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\n#include <assert.h>\n\n#include <bitset>\n\n#include <cmath>\n\n#include <complex>\n\n#include <deque>\n\n#include <functional>\n\n#include <iostream>\n\n#include <limits.h>\n\n#include <map>\n\n#include <math.h>\n\n#include <queue>\n\n#include <deque>\n\n#include <set>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <string>\n\n#include <time.h>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <vector>\n\n#include <chrono>\n\n#include <random>\n\n#include <time.h>\n\n#include <fstream>\n\n#define ll long long\n\n#define rep2(i, a, b) for (ll i = a; i <= b; ++i)\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define rep3(i, a, b) for (ll i = a; i >= b; i--)\n\n#define pii pair<int, int>\n\n#define pll pair<ll, ll>\n\n#define pq priority_queue<int>\n\n#define pqg priority_queue<int, vector<int>, greater<int>>\n\n#define pb push_back\n\n#define vec vector<int>\n\n#define vecll vector<ll>\n\n#define vecpii vector<pii>\n\n#define endl \"\\n\"\n\n#define all(c) begin(c), end(c)\n\nusing namespace std;\n\nint in() {\n  int x;\n  scanf(\"%d\", &x);\n  return x;\n}\n\nll lin() {\n  ll x;\n  scanf(\"%lld\", &x);\n  return x;\n}\n\nvoid print(vec v) {\n  for (auto e : v)\n    cout << e << \" \";\n  cout << endl;\n}\n\nvoid print(vecll v) {\n  for (auto e : v)\n    cout << e << \" \";\n  cout << endl;\n}\n\nvoid print(map<int, int> mp) {\n  for (auto e : mp)\n    cout << e.first << \" \" << e.second << endl;\n  cout << endl;\n}\n\n#define INF 1e9 + 7\n\n#define LLINF 1e18 + 7\n\nmain() {\n\n  ll n = lin();\n\n  ll ans = 1e18;\n\n  int sq = sqrt(n);\n\n  for (ll i = sq; i >= 1; i--) {\n\n    if (n % i == 0) {\n\n      printf(\"%lld\", n / i + i - 2);\n\n      return 0;\n    }\n  }\n}"}
{"fast_code_id":"7fb1c33a892eab370e650abfae78dd959740905683bdb12a9f9fa4a2af73a144","fast_id":"79eeed8338cb15e5659de56bc84039fd82dfb0a0171e2a8eb9138c270d77a06d","fast_time":0.1077471804,"language":"cpp","measured_fast_code_id":"79eeed8338cb15e5659de56bc84039fd82dfb0a0171e2a8eb9138c270d77a06d","measured_slow_code_id":"7fa306dd631ad4f0c78b28e552ea440f66f2b5ec1aeb0a7995623d708e88a892","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_413","problem_id":"p02893","slow_code_id":"f304b2afe287a014f08d4c8401641c3a1f481587ce07076ad813cdf52c99934b","slow_id":"7fa306dd631ad4f0c78b28e552ea440f66f2b5ec1aeb0a7995623d708e88a892","slow_time":0.4519181072,"speedup":4.19424532059495,"stratum":"4-8","sampling_key":"b6a9d4db5694406f7c5b12c3382655dae62de2f00b376ec297dde8eb086b6b7d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long   signed int LL;\n\ntypedef long long unsigned int LU;\n\n#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)\n\n#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)\n\n#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)\n\n#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)\n\n#define inc(i, n)  incID(i, 0, n)\n\n#define inc1(i, n) incII(i, 1, n)\n\n#define dec(i, n)  decID(i, 0, n)\n\n#define dec1(i, n) decII(i, 1, n)\n\n#define inID(v, l, r) ((l) <= (v) && (v) <  (r))\n\n#define inII(v, l, r) ((l) <= (v) && (v) <= (r))\n\n#define PB push_back\n\n#define EB emplace_back\n\n#define MP make_pair\n\n#define FI first\n\n#define SE second\n\n#define  ALL(v)  v.begin(),  v.end()\n\n#define RALL(v) v.rbegin(), v.rend()\n\ntemplate<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }\n\nLL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }\n\nLL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }\n\nLL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }\n\ntemplate<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }\n\ntemplate<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }\n\n#define bit(b, i) (((b) >> (i)) & 1)\n\n#define BC __builtin_popcountll\n\n#define SC static_cast\n\n#define SI(v) SC<int>(v.size())\n\n#define SL(v) SC<LL >(v.size())\n\n#define RF(e, v) for(auto & e: v)\n\n#define ef else if\n\n#define UR assert(false)\n\n\n\n            \n\n\n\ntemplate<LL M> class ModInt {\n\nprivate:\n\n  LL v = 0;\n\npublic:\n\n  ModInt() { }\n\n  ModInt(LL vv) { setval(vv); }\n\n  ModInt & setval(LL vv) { v = vv % M; if(v < 0) { v += M; } return (*this); }\n\n  LL getval() const { return v; }\n\n  ModInt & operator+=(const ModInt & b)       { return setval(v + b.v); }\n\n  ModInt & operator-=(const ModInt & b)       { return setval(v - b.v); }\n\n  ModInt & operator*=(const ModInt & b)       { return setval(v * b.v); }\n\n  ModInt & operator/=(const ModInt & b)       { return setval(v * b.inv()); }\n\n  ModInt & operator^=(            LU b)       { return setval(ex(v, b)); }\n\n  ModInt   operator+ (                ) const { return ModInt(+v); }\n\n  ModInt   operator- (                ) const { return ModInt(-v); }\n\n  ModInt   operator+ (const ModInt & b) const { return ModInt(v + b.v); }\n\n  ModInt   operator- (const ModInt & b) const { return ModInt(v - b.v); }\n\n  ModInt   operator* (const ModInt & b) const { return ModInt(v * b.v); }\n\n  ModInt   operator/ (const ModInt & b) const { return ModInt(v * b.inv()); }\n\n  ModInt   operator^ (            LU b) const { return ModInt(ex(v, b)); }\n\n  LL inv() const {\n\n    LL x = (ex_gcd(v, M).FI + M) % M;\n\n    assert(v * x % M == 1);\n\n    return x;\n\n  }\n\n  LL ex(LL a, LU b) const {\n\n    LL D = 64, x[64], y = 1;\n\n    inc(i, D) { if((b >> i) == 0) { D = i; break; } }\n\n    inc(i, D) { x[i] = (i == 0 ? a : x[i - 1] * x[i - 1]) % M; }\n\n    inc(i, D) { if((b >> i) & 1) { (y *= x[i]) %= M; } }\n\n    return y;\n\n  }\n\n  pair<LL, LL> ex_gcd(LL a, LL b) const {\n\n    if(b == 0) { return MP(1, 0); }\n\n    auto p = ex_gcd(b, a % b);\n\n    return MP(p.SE, p.FI - (a / b) * p.SE);\n\n  }\n\n};\n\ntemplate<LL M> ModInt<M> operator+(LL a, const ModInt<M> & b) { return  b + a; }\n\ntemplate<LL M> ModInt<M> operator-(LL a, const ModInt<M> & b) { return -b + a; }\n\ntemplate<LL M> ModInt<M> operator*(LL a, const ModInt<M> & b) { return  b * a; }\n\ntemplate<LL M> ModInt<M> operator/(LL a, const ModInt<M> & b) { return  a * b.inv(); }\n\ntemplate<LL M> istream & operator>>(istream & is, ModInt<M> & b) { LL v; is >> v; b.setval(v); return is; }\n\ntemplate<LL M> ostream & operator<<(ostream & os, const ModInt<M> & b) { return (os << b.getval()); }\n\n\n\n            \n\n\n\nvector<pair<LL, LL>> prime_factorization(LL x) {\n\n  assert(x > 0);\n\n  vector<pair<LL, LL>> f;\n\n  for(LL i = 2; i <= x; i++) {\n\n    if(i * i > x) { i = x; }\n\n    if(x % i == 0) {\n\n      f.EB(i, 0);\n\n      while(x % i == 0) { f.back().SE++; x /= i; }\n\n    }\n\n  }\n\n  return f;\n\n}\n\n\n\nvector<LL> divisors(LL x) {\n\n  auto pf = prime_factorization(x);\n\n  vector<LL> d = { 1 };\n\n  for(auto e: pf) {\n\n    int ds = d.size();\n\n    inc(i, ds) {\n\n      LL v = d[i];\n\n      inc(j, e.SE) { v *= e.FI; d.PB(v); }\n\n    }\n\n  }\n\n  sort(ALL(d));\n\n  return d;\n\n}\n\n\n\ntypedef ModInt<998244353> MI;\n\n\n\nint n;\n\nstring x;\n\nvector<LL> di;\n\n\n\nMI mu[200001];\n\nvoid mumu(LL x) {\n\n  auto pf = prime_factorization(x);\n\n  RF(e, pf) { if(e.SE > 1) { return; } }\n\n  mu[x] = (SI(pf) % 2 == 0 ? +1 : -1);\n\n}\n\n\n\nMI f[200001];\n\nvoid ff(int d) {\n\n  if(n % d != 0) { return; }\n\n  int B = n / d;\n\n  if(B % 2 == 0) { return; }\n\n\t\n\n  MI ans = 0;\n\n  inc(i, d) {\n\n    ans *= 2;\n\n    ans += (x[i] - '0');\n\n  }\n\n\t\n\n  string s = x.substr(0, d);\n\n  string t = s;\n\n  inc(i, d) { t[i] = (t[i] == '0' ? '1' : '0'); }\n\n\t\n\n  string u = s;\n\n  inc(i, (B - 1) / 2) { u += t + s; }\n\n  assert(SI(x) == SI(u));\n\n  if(u <= x) { ans += 1; }\n\n\t\n\n  f[d] = ans;\n\n}\n\n\n\nMI g(int d) {\n\n  if(n % d != 0) { return 0; }\n\n  int B = n / d;\n\n  if(B % 2 == 0) { return 0; }\n\n\t\n\n  MI ans = 0;\n\n  RF(e, di) {\n\n    if(d % e == 0) { ans += mu[d / e] * f[e]; }\n\n  }\n\n  return ans;\n\n}\n\n\n\nint main() {\n\n  cin >> n >> x;\n\n\t\n\n  di = divisors(n);\n\n  inc1(d, n) { ff(d); }\n\n  inc1(d, n) { mumu(d); }\n\n\t\n\n  MI ans = 0;\n\n  inc1(d, n) { ans += 2 * d * g(d); }\n\n\t\n\n  cout << ans << endl;\n\n\t\n\n  return 0;\n\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long   signed int LL;\n\ntypedef long long unsigned int LU;\n\n#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)\n\n#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)\n\n#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)\n\n#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)\n\n#define inc(i, n)  incID(i, 0, n)\n\n#define inc1(i, n) incII(i, 1, n)\n\n#define dec(i, n)  decID(i, 0, n)\n\n#define dec1(i, n) decII(i, 1, n)\n\n#define inID(v, l, r) ((l) <= (v) && (v) <  (r))\n\n#define inII(v, l, r) ((l) <= (v) && (v) <= (r))\n\n#define PB push_back\n\n#define EB emplace_back\n\n#define MP make_pair\n\n#define FI first\n\n#define SE second\n\n#define  ALL(v)  v.begin(),  v.end()\n\n#define RALL(v) v.rbegin(), v.rend()\n\ntemplate<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }\n\nLL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }\n\nLL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }\n\nLL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }\n\ntemplate<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }\n\ntemplate<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }\n\n#define bit(b, i) (((b) >> (i)) & 1)\n\n#define BC __builtin_popcountll\n\n#define SC static_cast\n\n#define SI(v) SC<int>(v.size())\n\n#define SL(v) SC<LL >(v.size())\n\n#define RF(e, v) for(auto & e: v)\n\n#define ef else if\n\n#define UR assert(false)\n\n\n\n            \n\n\n\ntemplate<LL M> class ModInt {\n\nprivate:\n\n  LL v = 0;\n\npublic:\n\n  ModInt() { }\n\n  ModInt(LL vv) { setval(vv); }\n\n  ModInt & setval(LL vv) { v = vv % M; if(v < 0) { v += M; } return (*this); }\n\n  LL getval() const { return v; }\n\n  ModInt & operator+=(const ModInt & b)       { return setval(v + b.v); }\n\n  ModInt & operator-=(const ModInt & b)       { return setval(v - b.v); }\n\n  ModInt & operator*=(const ModInt & b)       { return setval(v * b.v); }\n\n  ModInt & operator/=(const ModInt & b)       { return setval(v * b.inv()); }\n\n  ModInt & operator^=(            LU b)       { return setval(ex(v, b)); }\n\n  ModInt   operator+ (                ) const { return ModInt(+v); }\n\n  ModInt   operator- (                ) const { return ModInt(-v); }\n\n  ModInt   operator+ (const ModInt & b) const { return ModInt(v + b.v); }\n\n  ModInt   operator- (const ModInt & b) const { return ModInt(v - b.v); }\n\n  ModInt   operator* (const ModInt & b) const { return ModInt(v * b.v); }\n\n  ModInt   operator/ (const ModInt & b) const { return ModInt(v * b.inv()); }\n\n  ModInt   operator^ (            LU b) const { return ModInt(ex(v, b)); }\n\n  LL inv() const {\n\n    LL x = (ex_gcd(v, M).FI + M) % M;\n\n    assert(v * x % M == 1);\n\n    return x;\n\n  }\n\n  LL ex(LL a, LU b) const {\n\n    LL D = 64, x[64], y = 1;\n\n    inc(i, D) { if((b >> i) == 0) { D = i; break; } }\n\n    inc(i, D) { x[i] = (i == 0 ? a : x[i - 1] * x[i - 1]) % M; }\n\n    inc(i, D) { if((b >> i) & 1) { (y *= x[i]) %= M; } }\n\n    return y;\n\n  }\n\n  pair<LL, LL> ex_gcd(LL a, LL b) const {\n\n    if(b == 0) { return MP(1, 0); }\n\n    auto p = ex_gcd(b, a % b);\n\n    return MP(p.SE, p.FI - (a / b) * p.SE);\n\n  }\n\n};\n\ntemplate<LL M> ModInt<M> operator+(LL a, const ModInt<M> & b) { return  b + a; }\n\ntemplate<LL M> ModInt<M> operator-(LL a, const ModInt<M> & b) { return -b + a; }\n\ntemplate<LL M> ModInt<M> operator*(LL a, const ModInt<M> & b) { return  b * a; }\n\ntemplate<LL M> ModInt<M> operator/(LL a, const ModInt<M> & b) { return  a * b.inv(); }\n\ntemplate<LL M> istream & operator>>(istream & is, ModInt<M> & b) { LL v; is >> v; b.setval(v); return is; }\n\ntemplate<LL M> ostream & operator<<(ostream & os, const ModInt<M> & b) { return (os << b.getval()); }\n\n\n\n            \n\n\n\ntypedef ModInt<998244353> MI;\n\n\n\nint main() {\n\n  int n;\n\n  string x;\n\n  cin >> n >> x;\n\n\t\n\n  vector<MI> dp(n + 1);\n\n  inc1(i, n) {\n\n    if(! (n % i == 0 && n / i % 2 != 0)) { continue; }\n\n\t\t\n\n    string s = x.substr(0, i);\n\n    MI v = 0;\n\n    RF(e, s) { v = 2 * v + (e - '0'); }\n\n    dp[i] = v;\n\n\t\t\n\n    string t = s;\n\n    RF(e, t) { e = (e == '0' ? '1' : '0'); }\n\n    string u = s;\n\n    inc(j, (n / i - 1) / 2) { u += t + s; }\n\n    if(u <= x) { dp[i] += 1; }\n\n  }\n\n\t\n\n  MI ans = 0;\n\n  inc1(i, n) {\n\n    if(! (n % i == 0 && n / i % 2 != 0)) { continue; }\n\n\t\t\n\n    ans += 2 * i * dp[i];\n\n    for(int j = 2 * i; j <= n; j += i) { dp[j] -= dp[i]; }\n\n  }\n\n\t\n\n  cout << ans << endl;\n\n\t\n\n  return 0;\n\n}\n"}
{"fast_code_id":"5becbc2c69160878757b552c3e9d19e4780b5257f0707a5489c55688394ad3fc","fast_id":"9c7530ebd72285df9c7e5122fd218efce302a3da1c01ce98516a647a2e529933","fast_time":0.0200865757,"language":"cpp","measured_fast_code_id":"9c7530ebd72285df9c7e5122fd218efce302a3da1c01ce98516a647a2e529933","measured_slow_code_id":"133dff291b30370bc2beae3962f91509d9a073e43fe703cb7c0e0e0b21622eb8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4132","problem_id":"p03953","slow_code_id":"a0aed9a6ce7cc4e45b1da8c93ae49a7e9170d6a950b1e2cf81bcedba89d3def0","slow_id":"133dff291b30370bc2beae3962f91509d9a073e43fe703cb7c0e0e0b21622eb8","slow_time":0.466553653,"speedup":23.227137366176354,"stratum":"8+","sampling_key":"f80f69933c2f94171bf755013bf93c5f7fa0597607a662b550faabd1787868e6","slow_code":"#include <bits/stdc++.h>\n\n#define N 100005\n\n#define int long long\n\nusing namespace std;\n\nint n, m, x[N], a[N], p[N], s[N], cnt;\n\nlong long k;\n\nint be[N], num[N], v[N];\n\nvector<int> q[N];\n\nvoid dfs(int x, int dep)\n\n{\n\n  num[x] = dep;\n  v[x] = 1;\n  be[x] = cnt;\n\n  q[cnt].push_back(x);\n\n  if (!v[p[x]])\n    dfs(p[x], dep + 1);\n}\n\nsigned main()\n\n{\n\n  memset(v, 0, sizeof(v));\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++)\n    cin >> x[i];\n\n  for (int i = 1; i < n; i++)\n    s[i] = x[i + 1] - x[i];\n\n  cin >> m >> k;\n\n  for (int i = 1; i < n; i++)\n    p[i] = i;\n\n  for (int i = 1; i <= m; i++) {\n    cin >> a[i];\n    swap(p[a[i]], p[a[i] - 1]);\n  }\n\n  for (int i = 1; i < n; i++)\n    if (!v[i])\n      cnt++, dfs(i, 0);\n\n  cout << x[1] << endl;\n\n  int now = x[1];\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    now += s[q[be[i]][(num[i] + k) % q[be[i]].size()]];\n\n    cout << now << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define int long long\n\nconst int N = 200003;\n\nint x[N], ans[N], g[N], n, m, k, used[N], siz;\n\nsigned main() {\n\n  scanf(\"%lld\", &n);\n\n  for (int i = 1; i <= n; i++)\n    scanf(\"%lld\", x + i), g[i] = i;\n\n  for (int i = n; i; i--)\n    x[i] -= x[i - 1];\n\n  scanf(\"%lld%lld\", &m, &k);\n\n  for (int i, j = 1; j <= m; j++)\n    scanf(\"%lld\", &i), std::swap(g[i], g[i + 1]);\n\n  for (int i = 1, j, v; i <= n; i++)\n    if (!used[i]) {\n\n      siz = 1;\n\n      for (j = g[i]; j != i; j = g[j])\n\n        siz++;\n\n      j = i;\n\n      for (int id = 1; id <= k % siz; id++)\n        j = g[j];\n\n      ans[i] = x[j], used[j] = 1;\n\n      for (j = g[j], v = g[i]; !used[j]; j = g[j], v = g[v])\n\n        ans[v] = x[j], used[j] = 1;\n    }\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%lld\\n\", ans[i] += ans[i - 1]);\n\n  return 0;\n}"}
{"fast_code_id":"5640b88015e9255daba83eb7c1a7512afcba1683ff13da06675b920d667e15aa","fast_id":"a730eb39d93e6dab7391e386c8c12ce282216eedd9ee4ed2bf67cf2f4b1a21a9","fast_time":0.1047817874,"language":"cpp","measured_fast_code_id":"a730eb39d93e6dab7391e386c8c12ce282216eedd9ee4ed2bf67cf2f4b1a21a9","measured_slow_code_id":"5212f1e4ce3a439c4c21da84e146df89aa797189590f9e06a6d62308ef300931","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41334","problem_id":"p03132","slow_code_id":"87f18e5efaa5a74d9257b3699a4938967a7705493652cdf2b8b76dada3f48acd","slow_id":"5212f1e4ce3a439c4c21da84e146df89aa797189590f9e06a6d62308ef300931","slow_time":0.9979058587,"speedup":9.52365753115603,"stratum":"8+","sampling_key":"5b20e2eafee0e3273d8bb308ae2210846a4f3688a18a621b5fbeef819b82025c","slow_code":"#include <bits/stdc++.h>\n\nconst int N = 200010;\n\ntypedef long long ll;\n\nll dp[N][5];\n\nint a[N];\n\nvoid update(ll &a, ll b) {\n\n  if (a == -1 || a > b) {\n\n    a = b;\n  }\n}\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; ++i) {\n\n    scanf(\"%d\", &a[i]);\n  }\n\n  memset(dp, -1, sizeof(dp));\n\n  dp[0][0] = 0;\n\n  for (int i = 1; i <= n + 1; ++i) {\n\n    for (int j = 0; j <= 0; ++j) {\n\n      if (dp[i - 1][j] != -1) {\n\n        update(dp[i][0], dp[i - 1][j] + a[i]);\n      }\n    }\n\n    for (int j = 0; j <= 1; ++j) {\n\n      if (dp[i - 1][j] != -1) {\n\n        update(dp[i][1], dp[i - 1][j] + (a[i] == 0 ? 2 : a[i] & 1));\n      }\n    }\n\n    for (int j = 0; j <= 2; ++j) {\n\n      if (dp[i - 1][j] != -1) {\n\n        update(dp[i][2], dp[i - 1][j] + !(a[i] & 1));\n      }\n    }\n\n    for (int j = 0; j <= 3; ++j) {\n\n      if (dp[i - 1][j] != -1) {\n\n        update(dp[i][3], dp[i - 1][j] + (a[i] == 0 ? 2 : a[i] & 1));\n      }\n    }\n\n    for (int j = 0; j <= 4; ++j) {\n\n      if (dp[i - 1][j] != -1) {\n\n        update(dp[i][4], dp[i - 1][j] + a[i]);\n      }\n    }\n  }\n\n  printf(\"%lld\\n\", dp[n + 1][4]);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define inf 0x3f3f3f3f\n\ntypedef long long ll;\n\nconst int N = 2e5 + 5;\n\nint n, a[N][3];\n\nll dp[N][5];\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i][0]);\n\n    a[i][1] = a[i][0] % 2 == 0;\n\n    a[i][2] = a[i][0] == 0 ? 2 : a[i][0] % 2;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    ll mn = 1e18;\n\n    for (int j = 0; j < 5; j++)\n\n    {\n\n      mn = min(mn, dp[i - 1][j]);\n\n      ll s;\n\n      if (j == 0)\n        s = a[i][0];\n\n      else if (j == 1)\n        s = a[i][2];\n\n      else if (j == 2)\n        s = a[i][1];\n\n      else if (j == 3)\n        s = a[i][2];\n\n      else\n        s = a[i][0];\n\n      dp[i][j] = mn + s;\n    }\n  }\n\n  ll ans = 1e18;\n\n  for (int i = 0; i < 5; i++)\n    ans = min(ans, dp[n][i]);\n\n  printf(\"%lld\\n\", ans);\n}\n"}
{"fast_code_id":"94d983ebbc014b5ea808228c56ffbb3b9a11ea73d08ea7d29e3fced0e3c32d9c","fast_id":"deb8f1714d253bb242e88ec55792149f2f7f1b81ffcaf764abf5aeb14a581126","fast_time":0.0001932425,"language":"cpp","measured_fast_code_id":"deb8f1714d253bb242e88ec55792149f2f7f1b81ffcaf764abf5aeb14a581126","measured_slow_code_id":"fc8d05ed612c44554a3eaced372a942909f397a0fc3714176b0d1c332de5e42a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41364","problem_id":"p03848","slow_code_id":"738da6aa85b5c7a4422dbf2f75a19cc7a0d31c392d0e89be64ecf72687ac01de","slow_id":"fc8d05ed612c44554a3eaced372a942909f397a0fc3714176b0d1c332de5e42a","slow_time":0.0014296199,"speedup":7.398061503033753,"stratum":"4-8","sampling_key":"bc3cb649f6ac49129e6823e3b8eb0266ee4dfb60a9adf902a678820c1dca8a79","slow_code":"#include <iostream>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <stack>\n\n#include <queue>\n\n#include <map>\n\n#include <cstring>\n\nusing namespace std;\n\nconst int MAX = 1e5 + 10;\n\nint a[MAX];\n\nint p[MAX];\n\nlong long mod_exp(int b) {\n\n  long long res, t;\n\n  res = 1;\n\n  t = 2;\n\n  while (b) {\n\n    if (b & 1) {\n\n      res = res * t % 1000000007;\n    }\n\n    t = t * t % 1000000007;\n\n    b >>= 1;\n  }\n\n  return res;\n}\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  memset(p, 0, sizeof(p));\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d\", &a[i]);\n\n    p[a[i]]++;\n  }\n\n  int cnt = 0;\n\n  bool flag = true;\n\n  for (int i = 0; i < n; i++) {\n\n    if ((n + a[i] + 1) % 2 != 0 || (n - a[i] + 1) % 2 != 0 || (p[0] != 1 && n % 2 == 1) ||\n        (p[a[i]] != 2 && a[i] != 0)) {\n\n      cout << \"0\" << endl;\n\n      flag = false;\n\n      break;\n    }\n\n    if (p[i] == 2)\n\n      cnt++;\n  }\n\n  if (flag)\n\n    cout << mod_exp(cnt) << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint result(int a, int b, int m)\n\n{\n\n  long long d = 1, t = a;\n\n  while (b)\n\n  {\n\n    if (b & 1)\n\n      d = (d * t) % m;\n\n    b /= 2;\n\n    t = (t * t) % m;\n  }\n\n  return d;\n}\n\nint a[100010];\n\nint main()\n\n{\n\n  int n;\n\n  while (scanf(\"%d\", &n) != EOF)\n\n  {\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      scanf(\"%d\", &a[i]);\n    }\n\n    sort(a + 1, a + n + 1);\n\n    int f = 1;\n\n    if (n % 2 == 1)\n\n    {\n\n      for (int i = 1; i <= n; i++)\n\n      {\n\n        if (i % 2 == 0)\n\n        {\n\n          if (a[i] != i)\n\n          {\n\n            f = 0;\n            break;\n          }\n\n        }\n\n        else\n\n        {\n\n          if (a[i] != i - 1)\n\n          {\n\n            f = 0;\n            break;\n          }\n        }\n      }\n\n    }\n\n    else\n\n    {\n\n      for (int i = 1; i <= n; i++)\n\n      {\n\n        if (i % 2 == 0)\n\n        {\n\n          if (a[i] != i - 1)\n\n          {\n\n            f = 0;\n            break;\n          }\n\n        }\n\n        else\n\n        {\n\n          if (a[i] != i)\n\n          {\n\n            f = 0;\n            break;\n          }\n        }\n      }\n    }\n\n    if (f == 0)\n\n      printf(\"0\\n\");\n\n    else\n\n    {\n\n      printf(\"%d\\n\", result(2, n / 2, 1000000007));\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"fe8fef4b25de1b458022aaf1013b3b3b2027a08962c2616ac85e750ae2aff3b0","fast_id":"4f4c2cc861f85a96abd1efe5773a0e9c8ec7be1213c3faadf971fc1322726f7d","fast_time":0.0207926353,"language":"cpp","measured_fast_code_id":"4f4c2cc861f85a96abd1efe5773a0e9c8ec7be1213c3faadf971fc1322726f7d","measured_slow_code_id":"a25b97f13241fae7822deaf82764fcf6c996f8dc5edac07aebc36696190b9458","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41431","problem_id":"p03736","slow_code_id":"5d8ac44386b539fb00a6d18628928936c7069e0535386b22a535ec7bb6b936b4","slow_id":"a25b97f13241fae7822deaf82764fcf6c996f8dc5edac07aebc36696190b9458","slow_time":1.4716047146,"speedup":70.77528621876996,"stratum":"8+","sampling_key":"0c0b06fb43fb5e90d9cdc9a575052206379f41a3709578c1453e1e6e30ebab9b","slow_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define MAXN 200010\n\nlong long A[MAXN << 2], B[MAXN << 2], T[MAXN << 2];\n\ninline void pushDown(int x) {\n\n  if (!T[x])\n    return;\n\n  A[x << 1] += T[x];\n  A[x << 1 | 1] += T[x];\n\n  B[x << 1] += T[x];\n  B[x << 1 | 1] += T[x];\n\n  T[x << 1] += T[x];\n  T[x << 1 | 1] += T[x];\n\n  T[x] = 0;\n}\n\ninline void pushUp(int x) {\n\n  A[x] = std::min(A[x << 1], A[x << 1 | 1]);\n\n  B[x] = std::min(B[x << 1], B[x << 1 | 1]);\n}\n\nvoid Insert(int n, int l, int r, int x, long long v) {\n\n  if (l == r) {\n\n    A[n] = std::min(A[n], v - x);\n    B[n] = std::min(B[n], v + x);\n    return;\n  }\n\n  pushDown(n);\n  int mid = (l + r) >> 1;\n\n  if (x <= mid)\n    Insert(n << 1, l, mid, x, v);\n\n  else\n    Insert(n << 1 | 1, mid + 1, r, x, v);\n\n  pushUp(n);\n}\n\nvoid Insert(int n, int l, int r, int L, int R, long long v) {\n\n  if (l == L && r == R) {\n\n    A[n] += v;\n    B[n] += v;\n    T[n] += v;\n    return;\n  }\n\n  pushDown(n);\n  int mid = (l + r) >> 1;\n\n  if (R <= mid)\n    Insert(n << 1, l, mid, L, R, v);\n\n  else if (L > mid)\n    Insert(n << 1 | 1, mid + 1, r, L, R, v);\n\n  else\n    Insert(n << 1, l, mid, L, mid, v),\n        Insert(n << 1 | 1, mid + 1, r, mid + 1, R, v);\n\n  pushUp(n);\n}\n\nlong long a(int n, int l, int r, int L, int R) {\n\n  if (l == L && r == R)\n    return A[n];\n\n  pushDown(n);\n  int mid = (l + r) >> 1;\n\n  if (R <= mid)\n    return a(n << 1, l, mid, L, R);\n\n  else if (L > mid)\n    return a(n << 1 | 1, mid + 1, r, L, R);\n\n  return std::min(a(n << 1, l, mid, L, mid),\n                  a(n << 1 | 1, mid + 1, r, mid + 1, R));\n}\n\nlong long b(int n, int l, int r, int L, int R) {\n\n  if (l == L && r == R)\n    return B[n];\n\n  pushDown(n);\n  int mid = (l + r) >> 1;\n\n  if (R <= mid)\n    return b(n << 1, l, mid, L, R);\n\n  else if (L > mid)\n    return b(n << 1 | 1, mid + 1, r, L, R);\n\n  return std::min(b(n << 1, l, mid, L, mid),\n                  b(n << 1 | 1, mid + 1, r, mid + 1, R));\n}\n\nint n, q, p[MAXN], x;\n\nint main() {\n\n  scanf(\"%d%d%d\", &n, &q, &x);\n\n  for (int i = 0; i <= q; i++)\n    scanf(\"%d\", &p[i]);\n\n  memset(A, 0x3F, sizeof(A));\n  memset(B, 0x3F, sizeof(B));\n\n  Insert(1, 1, n, x, 0);\n\n  for (int i = 1; i <= q; i++) {\n\n    long long now =\n        std::min(a(1, 1, n, 1, p[i]) + p[i], b(1, 1, n, p[i], n) - p[i]);\n\n    Insert(1, 1, n, 1, n, std::abs(p[i] - p[i - 1]));\n\n    Insert(1, 1, n, p[i - 1], now);\n  }\n\n  long long ans = 0x7FFFFFFFFFFFFFFF;\n\n  for (int i = 1; i <= n; i++) {\n\n    ans = std::min(ans, a(1, 1, n, i, i) + i);\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\n#define MN 200005\n\nusing namespace std;\n\ntypedef long long ll;\n\nint n, q;\n\nll mk[MN << 2];\n\nstruct node {\n\n  ll mi[4];\n\n  friend node operator+(node x, node y) {\n\n    node z;\n\n    for (int i = 1; i <= 3; i++)\n      z.mi[i] = min(x.mi[i], y.mi[i]);\n\n    return z;\n  }\n\n} T[MN << 2];\n\nvoid uadd(int v) {\n  for (int i = 1; i <= 3; i++)\n    T[1].mi[i] += v;\n  mk[1] += v;\n}\n\nvoid pushdown(int k, int l, int r) {\n\n  mk[k << 1] += mk[k], mk[k << 1 | 1] += mk[k];\n\n  for (int i = 1; i <= 3; i++)\n    T[k << 1].mi[i] += mk[k], T[k << 1 | 1].mi[i] += mk[k];\n  mk[k] = 0;\n}\n\nvoid update(int l, int r, int a, int k, ll ad) {\n\n  if (l == r)\n    return (void)(T[k].mi[1] > ad ? (T[k].mi[1] = ad, T[k].mi[2] = ad - l,\n                                     T[k].mi[3] = ad + l)\n                                  : 0);\n  if (mk[k])\n    pushdown(k, l, r);\n  int mid = (l + r) >> 1;\n\n  if (a <= mid)\n    update(l, mid, a, k << 1, ad);\n  else\n    update(mid + 1, r, a, k << 1 | 1, ad);\n  T[k] = T[k << 1] + T[k << 1 | 1];\n}\n\nll que1(int l, int r, int a, int b, int k) {\n\n  if (l == a && r == b)\n    return T[k].mi[2];\n  if (mk[k])\n    pushdown(k, l, r);\n  int mid = (l + r) >> 1;\n\n  if (b <= mid)\n    return que1(l, mid, a, b, k << 1);\n  if (a > mid)\n    return que1(mid + 1, r, a, b, k << 1 | 1);\n\n  return min(que1(l, mid, a, mid, k << 1),\n             que1(mid + 1, r, mid + 1, b, k << 1 | 1));\n}\n\nll que2(int l, int r, int a, int b, int k) {\n\n  if (l == a && r == b)\n    return T[k].mi[3];\n  if (mk[k])\n    pushdown(k, l, r);\n  int mid = (l + r) >> 1;\n\n  if (b <= mid)\n    return que2(l, mid, a, b, k << 1);\n  if (a > mid)\n    return que2(mid + 1, r, a, b, k << 1 | 1);\n\n  return min(que2(l, mid, a, mid, k << 1),\n             que2(mid + 1, r, mid + 1, b, k << 1 | 1));\n}\n\nvoid build(int l, int r, int k) {\n\n  if (l == r)\n    return (void)(T[k].mi[1] = T[k].mi[2] = T[k].mi[3] = 1e18);\n  int mid = (l + r) >> 1;\n\n  build(l, mid, k << 1);\n  build(mid + 1, r, k << 1 | 1);\n  T[k] = T[k << 1] + T[k << 1 | 1];\n}\n\nint main() {\n\n  int a, b;\n  scanf(\"%d%d%d%d\", &n, &q, &a, &b);\n  build(1, n, 1);\n\n  update(1, n, b, 1, 0);\n\n  int lst = a, x;\n\n  for (int i = 1; i <= q; i++) {\n\n    scanf(\"%d\", &x);\n\n    ll tmp = min(que1(1, n, 1, x, 1) + x, que2(1, n, x, n, 1) - x);\n\n    uadd(abs(x - lst));\n    update(1, n, lst, 1, tmp);\n    lst = x;\n  }\n  printf(\"%lld\\n\", T[1].mi[1]);\n}"}
{"fast_code_id":"c32237e7a6e2efce18f315e207bee456bd6773c2005b9f000a3dd6ed61355598","fast_id":"054ea51aaa2a1fa77b6c648f32d7f9e81da41be973b398f5063a8ca80d21bdba","fast_time":0.111937818,"language":"cpp","measured_fast_code_id":"054ea51aaa2a1fa77b6c648f32d7f9e81da41be973b398f5063a8ca80d21bdba","measured_slow_code_id":"ecb7f0c677dbf9aa82a3294c23a0d8334c4e8811cc2aa8167c0f03eedc82c1e2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41564","problem_id":"p02702","slow_code_id":"147e402fed2aa90a77046dd89b1093db2bfb3fb7c2f174f72300a937fea69da6","slow_id":"ecb7f0c677dbf9aa82a3294c23a0d8334c4e8811cc2aa8167c0f03eedc82c1e2","slow_time":0.4268682112,"speedup":3.8134405228445676,"stratum":"2-4","sampling_key":"5528bb467ec37b0b5ebdfca7307449ab946518ecec358fd01f61bc82ab28e240","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define LL long long int\n\n#define getcx getchar_unlocked\n\n#define X first\n\n#define Y second\n\n#define PB push_back\n\n#define MP make_pair\n\n#define MAX 200005\n\n#define MOD 1000000007\n\n#define INF 0x3f3f3f3f\n\n#define INFL (LL(1e18))\n\n#define rep(i, a, n) for (i = a; i < n; i++)\n\n#define rev(i, a, n) for (i = a; i >= n; i--)\n\n#define MSV(A, a) memset(A, a, sizeof(A))\n\n#define rep_itr(itr, c) for (itr = (c).begin(); itr != (c).end(); itr++)\n\nusing namespace std;\n\ninline void inp(int &n) {\n\n  n = 0;\n  int ch = getcx();\n  int sign = 1;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      sign = -1;\n    ch = getcx();\n  }\n\n  while (ch >= '0' && ch <= '9')\n\n    n = (n << 3) + (n << 1) + ch - '0', ch = getcx();\n\n  n = n * sign;\n}\n\ninline void inp1(LL &n) {\n\n  n = 0;\n  LL ch = getcx();\n  LL sign = 1;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      sign = -1;\n    ch = getcx();\n  }\n\n  while (ch >= '0' && ch <= '9')\n\n    n = (n << 3) + (n << 1) + ch - '0', ch = getcx();\n\n  n = n * sign;\n}\n\nint mod[MAX];\n\nint first[2019];\n\nvector<int> possible;\n\nvoid pre() {\n\n  memset(first, -1, sizeof first);\n\n  int i;\n\n  int x = 10;\n\n  for (i = 1; i < MAX; i++) {\n\n    if (first[x] == -1) {\n\n      first[x] = i;\n    }\n\n    x = (x * 10) % 2019;\n  }\n\n  for (i = 1; i < 2019; i++) {\n\n    if (first[i] != -1)\n      possible.PB(i);\n  }\n}\n\nvector<int> mods[2019];\n\nint main() {\n\n  string s;\n\n  int i, j;\n\n  pre();\n\n  cin >> s;\n\n  LL ans = 0;\n\n  for (i = 0; i < s.length(); i++) {\n\n    mod[i] = (i == 0) ? (s[i] - '0') % 2019 : (mod[i - 1] * 10 + s[i] - '0') % 2019;\n\n    if (mod[i] == 0)\n      ans++;\n  }\n\n  int oc[2019][225] = {0};\n\n  for (i = 0; i < s.length(); i++) {\n\n    oc[mod[i]][i % 224]++;\n  }\n\n  for (i = 0; i < s.length(); i++) {\n\n    oc[mod[i]][i % 224]--;\n\n    for (j = 0; j < possible.size(); j++) {\n\n      int start = first[possible[j]];\n\n      int pos = (i + start) % 224;\n\n      int target = (mod[i] * possible[j]) % 2019;\n\n      ans += oc[target][pos];\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define LL long long int\n\n#define getcx getchar_unlocked\n\n#define X first\n\n#define Y second\n\n#define PB push_back\n\n#define MP make_pair\n\n#define MAX 200005\n\n#define MOD 1000000007\n\n#define INF 0x3f3f3f3f\n\n#define INFL (LL(1e18))\n\n#define rep(i, a, n) for (i = a; i < n; i++)\n\n#define rev(i, a, n) for (i = a; i >= n; i--)\n\n#define MSV(A, a) memset(A, a, sizeof(A))\n\n#define rep_itr(itr, c) for (itr = (c).begin(); itr != (c).end(); itr++)\n\nusing namespace std;\n\ninline void inp(int &n) {\n\n  n = 0;\n  int ch = getcx();\n  int sign = 1;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      sign = -1;\n    ch = getcx();\n  }\n\n  while (ch >= '0' && ch <= '9')\n\n    n = (n << 3) + (n << 1) + ch - '0', ch = getcx();\n\n  n = n * sign;\n}\n\ninline void inp1(LL &n) {\n\n  n = 0;\n  LL ch = getcx();\n  LL sign = 1;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      sign = -1;\n    ch = getcx();\n  }\n\n  while (ch >= '0' && ch <= '9')\n\n    n = (n << 3) + (n << 1) + ch - '0', ch = getcx();\n\n  n = n * sign;\n}\n\nvector<int> mods[2019];\n\nint main() {\n\n  string s;\n\n  int i, j;\n\n  cin >> s;\n\n  LL ans = 0;\n\n  int r = 0;\n\n  int x = 1;\n\n  int freq[2019] = {0};\n\n  for (i = s.length() - 1; i >= 0; i--) {\n\n    r = (r + x * (s[i] - '0')) % 2019;\n\n    x = (x * 10) % 2019;\n\n    freq[r]++;\n  }\n\n  for (i = 1; i < 2019; i++) {\n\n    ans = ans + (freq[i] * (freq[i] - 1)) / 2;\n  }\n\n  ans = ans + (freq[0] * (freq[0] + 1)) / 2;\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"73df96730361b795911d981181576eaaf4141f17537b0e535aefd3413ed0b531","fast_id":"1f574ed08bb7550e82c82b8ec93e57959c6e11f3d361a3713374b51e198d48eb","fast_time":0.0001877822,"language":"cpp","measured_fast_code_id":"1f574ed08bb7550e82c82b8ec93e57959c6e11f3d361a3713374b51e198d48eb","measured_slow_code_id":"1e1695d57cfd19bae1ad3797be545ec73a313c7fa90327e1473a3b83bef9fd02","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41615","problem_id":"p03627","slow_code_id":"bc97c2f8c33e3dd3b33f4c6b3eeb541dbdd1b0735c78b541bc87aeb03f1c2620","slow_id":"1e1695d57cfd19bae1ad3797be545ec73a313c7fa90327e1473a3b83bef9fd02","slow_time":0.005197313,"speedup":27.67734641515543,"stratum":"8+","sampling_key":"f77d5e9ec13f6856d4c2cc28107b65589a3761210430a15b352692326607ba6a","slow_code":"#include <iostream>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nint f[1000000];\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  memset(f, 0, sizeof(f));\n\n  for (int i = 1; i <= n; i++)\n\n    cin >> f[i];\n\n  sort(f + 1, f + 1 + n);\n\n  int flag = 0, max1 = 0, max2 = 0;\n\n  for (int i = n - 1; i >= 1; i--)\n\n    if (f[i] == f[i + 1] && !flag) {\n\n      max1 = f[i];\n\n      flag = 1;\n\n    } else if (f[i] == f[i + 1] && flag) {\n\n      if (f[i] == f[i - 1] && f[i] == max1) {\n\n        max2 = f[i];\n\n        break;\n\n      }\n\n      else if (f[i] != max1) {\n\n        max2 = f[i];\n\n        break;\n      }\n    }\n\n  long long s;\n\n  s = (long long)max1 * (long long)max2;\n\n  cout << s << endl;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define ll long long\n\n#define N 100005\n\n#define mod 1000000007\n\n#define rep(i, j, k) for (ll i = j; i <= k; ++i)\n\n#define per(i, j, k) for (ll i = j; i >= k; --i)\n\nusing namespace std;\n\ninline ll read() {\n\n  char ch = getchar();\n  ll x = 0, f = 1;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      f = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = x * 10 + ch - '0';\n    ch = getchar();\n  }\n\n  return x * f;\n}\n\nll n, tot, ans1, ans2, a[N];\n\nint main() {\n\n  n = read();\n\n  rep(i, 1, n) a[i] = read();\n\n  sort(a + 1, a + 1 + n);\n\n  for (ll l = 1, r = 1; l <= n; l = ++r) {\n\n    while (a[l] == a[r + 1])\n      ++r;\n\n    if (r - l + 1 >= 2)\n      ans2 = ans1, ans1 = a[l];\n\n    if (r - l + 1 >= 4)\n      ans2 = ans1, ans1 = a[l];\n  }\n\n  printf(\"%lld\", ans1 * ans2);\n}"}
{"fast_code_id":"bb1cda78b489f061092dbdbea2d714388d3b39732f6ed192a01056f9e788808f","fast_id":"83a2e9a308259885c7fde8031c40cefbdb96c66d9461fa5834f8f803ff592e77","fast_time":0.0198770695,"language":"cpp","measured_fast_code_id":"83a2e9a308259885c7fde8031c40cefbdb96c66d9461fa5834f8f803ff592e77","measured_slow_code_id":"d5520f579c0cad3612afccbe1f2003695ea5672a4e0d88295b380bb9cd2022ad","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41691","problem_id":"p03249","slow_code_id":"8d9c22da6f1dee098753768fd20734538b22ce90ef1e038f1748eab384d7a6ad","slow_id":"d5520f579c0cad3612afccbe1f2003695ea5672a4e0d88295b380bb9cd2022ad","slow_time":0.3873863837,"speedup":19.489109483669107,"stratum":"8+","sampling_key":"329cfbe60e04028baff039c263f0bbd7e07db95fb75768cefc953c5122dddf47","slow_code":"\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <math.h>\n\n#include <string.h>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <set>\n\n#include <cassert>\n\n#include <cstdlib>\n\n#include <complex>\n\n#include <cctype>\n\n#include <cmath>\n\n#include <ctime>\n\n#include <deque>\n\n#include <queue>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <sstream>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <bitset>\n\nusing namespace std;\n\n#define ll long long\n\n#define pii pair<int, int>\n\n#define qi ios::sync_with_stdio(0)\n\nbool debug = false;\n\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &o, pair<T1, T2> p) {\n\n  o << \"{\";\n\n  o << p.first << \",\" << p.second;\n\n  o << \"}\";\n\n  return o;\n}\n\nll n;\n\nll d[100005];\n\nmap<ll, ll> m;\n\npair<ll, ll> p[100005];\n\nll sub[100005];\n\nll sz[100005];\n\nvector<pair<ll, ll> > res;\n\nint fa[100005];\n\nint getFa(int x) {\n\n  if (fa[x] == x) {\n\n    return x;\n  }\n\n  return fa[x] = getFa(fa[x]);\n}\n\nvoid Union(int a, int b) {\n\n  if (fa[a] == fa[b]) {\n\n    return;\n  }\n\n  fa[getFa(a)] = getFa(b);\n}\n\nll dp[100005];\n\nll dis[100005];\n\nvector<int> nei[100005];\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin >> n;\n\n  for (ll i = 0; i < n; i++)\n\n  {\n\n    cin >> d[i];\n\n    if (d[i] > n * (n - 1) / 2) {\n\n      cout << -1;\n\n      return 0;\n    }\n\n    m[d[i]] = i;\n\n    p[i].first = d[i];\n\n    p[i].second = i;\n\n    sz[i] = 1;\n  }\n\n  sort(p, p + n);\n\n  reverse(p, p + n);\n\n  memset(sub, -1, sizeof(sub));\n\n  for (ll i = 0; i < n - 1; i++)\n\n  {\n\n    ll de = p[i].first;\n\n    ll x = p[i].second;\n\n    sub[x] = n - sz[x] * 2;\n\n    if (sub[x] == 0) {\n\n      cout << -1;\n\n      return 0;\n    }\n\n    if (m.find(de - sub[x]) == m.end()) {\n\n      cout << -1;\n\n      return 0;\n    }\n\n    ll par = m[de - sub[x]];\n\n    sz[par] += sz[x];\n\n    dp[par] += dp[x] + sz[x];\n\n    res.push_back(make_pair(x, par));\n  }\n\n  for (int i = 0; i < n - 1; i++) {\n\n    nei[res[i].first].push_back(res[i].second);\n\n    nei[res[i].second].push_back(res[i].first);\n  }\n\n  queue<int> q;\n\n  memset(dis, -1, sizeof(dis));\n\n  q.push(p[n - 1].second);\n\n  dis[p[n - 1].second] = 0;\n\n  while (!q.empty()) {\n\n    int last = q.front();\n\n    q.pop();\n\n    for (int to : nei[last]) {\n\n      if (dis[to] == -1) {\n\n        dis[to] = dis[last] + 1;\n\n        q.push(to);\n      }\n    }\n  }\n\n  ll sm = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    sm += dis[i];\n  }\n\n  if (sm != p[n - 1].first) {\n\n    cout << -1;\n\n    return 0;\n  }\n\n  for (ll i = 0; i < n - 1; i++)\n\n  {\n\n    cout << res[i].first + 1 << \" \" << res[i].second + 1 << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <vector>\n\n#define file(x) freopen(#x \".in\", \"r\", stdin), freopen(#x \".out\", \"w\", stdout)\n\nconst int N(1e5 + 10);\n\nstruct edge {\n  int x, y;\n} e[N];\n\nstruct node {\n  long long d;\n  int id;\n} a[N];\n\ninline int operator<(const node &l, const node &r)\n\n{\n  return l.d < r.d;\n}\n\nint n, size[N], cnt;\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%lld\", &a[i].d), a[i].id = i, size[i] = 1;\n\n  std::sort(a + 1, a + n + 1);\n\n  long long dis = 0, d;\n\n  for (int i = n, p; i > 1; i--)\n\n  {\n\n    d = a[i].d - n + (size[i] << 1), p = std::lower_bound(a + 1, a + n + 1, (node){d, 0}) - a;\n\n    if (a[p].d != d)\n      return puts(\"-1\"), 0;\n\n    e[++cnt] = (edge){a[i].id, a[p].id}, size[p] += size[i], dis += size[i];\n  }\n\n  if (dis != a[1].d)\n    puts(\"-1\");\n\n  else\n    for (int i = 1; i < n; i++)\n      printf(\"%d %d\\n\", e[i].x, e[i].y);\n\n  return 0;\n}\n"}
{"fast_code_id":"5f5ad34717762f76385731ed2e63dbdb8d49c7017e8b85e4f75e624792968cc3","fast_id":"3f1182c55f67974811910714275e70a56e8d9496f5056dac872d1382426a18b5","fast_time":0.0825577862,"language":"cpp","measured_fast_code_id":"3f1182c55f67974811910714275e70a56e8d9496f5056dac872d1382426a18b5","measured_slow_code_id":"6c10c81673eb9c1e037893e247570420dbccc59cd23d5eec5d13d8e59f6f56e8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4176","problem_id":"p02368","slow_code_id":"ef9808bb6b7e22fd3b1c3ad87cb515605d320343d8426aed748823b24065a436","slow_id":"6c10c81673eb9c1e037893e247570420dbccc59cd23d5eec5d13d8e59f6f56e8","slow_time":0.5329107026,"speedup":6.455002333868298,"stratum":"4-8","sampling_key":"cfdc5bfb86226bd24b790278050a73544d4cd49ae99b9629f9886f75d2fb5040","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <set>\n\n#include <stack>\n\nusing namespace std;\n\nvector<vector<int>> G1(100000), G2(100000);\n\nvector<bool> visit1(100000, false), visit2(100000, false);\n\nint timer = 0;\n\nvoid dfs1(int u, vector<int> &prenum) {\n\n  visit1[u] = true;\n\n  for (int v : G1[u]) {\n\n    if (visit1[v] == false) {\n\n      dfs1(v, prenum);\n    }\n  }\n\n  prenum[timer++] = u;\n}\n\nvoid dfs2(int u, vector<int> &Ans) {\n\n  visit2[u] = true;\n\n  Ans[u] = timer;\n\n  for (int v : G2[u]) {\n\n    if (visit2[v] == false) {\n\n      dfs2(v, Ans);\n    }\n  }\n}\n\nint main() {\n\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  int V, E;\n  cin >> V >> E;\n\n  vector<int> Ans(V);\n\n  vector<int> prenum(V);\n\n  for (int i = 0; i < E; i++) {\n\n    int s, t;\n    cin >> s >> t;\n\n    G1[s].emplace_back(t);\n\n    G2[t].emplace_back(s);\n  }\n\n  for (int i = 0; i < V; i++) {\n\n    if (visit1[i] == false) {\n\n      dfs1(i, prenum);\n    }\n  }\n\n  timer = 0;\n\n  for (int i = V - 1; i >= 0; i--) {\n\n    if (visit2[prenum[i]] == false) {\n\n      dfs2(prenum[i], Ans);\n\n      timer++;\n    }\n  }\n\n  int Q;\n  cin >> Q;\n\n  for (int i = 0; i < Q; i++) {\n\n    int u, v;\n    cin >> u >> v;\n\n    if (Ans[u] == Ans[v]) {\n      cout << 1 << endl;\n    }\n\n    else {\n      cout << 0 << endl;\n    }\n  }\n}","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\n#define INF 1 << 30\n\n#define LINF 1LL << 60\n\nclass SCC {\n\npublic:\n  ll V;\n\n  vector<vector<ll>> G;\n\n  vector<vector<ll>> rG;\n\n  vector<ll> group;\n\n  vector<ll> List;\n\n  vector<int> visited;\n\n  SCC(ll V) : V(V) {\n\n    G.resize(V);\n    rG.resize(V);\n\n    group.assign(V, -1);\n  }\n\n  void add_edge(ll u, ll v) {\n\n    G[u].emplace_back(v);\n\n    rG[v].emplace_back(u);\n  }\n\n  void dfs1(ll u) {\n\n    visited[u] = 1;\n\n    for (auto next : G[u]) {\n\n      if (visited[next] == 1)\n        continue;\n\n      dfs1(next);\n    }\n\n    List.emplace_back(u);\n  }\n\n  void dfs2(ll u, ll group_num) {\n\n    visited[u] = 1;\n\n    group[u] = group_num;\n\n    for (auto next : rG[u]) {\n\n      if (visited[next] == 1)\n        continue;\n\n      dfs2(next, group_num);\n    }\n  }\n\n  void solve() {\n\n    visited.assign(V, 0);\n\n    for (int i = 0; i < V; i++) {\n\n      if (visited[i] == 1)\n        continue;\n\n      dfs1(i);\n    }\n\n    reverse(List.begin(), List.end());\n\n    visited.assign(V, 0);\n\n    ll group_num = 0;\n\n    for (auto v : List) {\n\n      if (visited[v] == 1)\n        continue;\n\n      dfs2(v, group_num);\n\n      group_num++;\n    }\n  }\n\n  bool same(ll u, ll v) { return group[u] == group[v]; }\n};\n\nint main(void) {\n\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  ll V, E;\n  cin >> V >> E;\n\n  SCC scc(V);\n\n  for (int i = 0; i < E; i++) {\n\n    ll s, t;\n    cin >> s >> t;\n\n    scc.add_edge(s, t);\n  }\n\n  scc.solve();\n\n  ll Q;\n  cin >> Q;\n\n  for (int i = 0; i < Q; i++) {\n\n    ll s, t;\n    cin >> s >> t;\n\n    cout << scc.same(s, t) << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"2dec5bebfd78cce7e373077a666bdb94f9f811969b94bbd2141399f7e6b9dc64","fast_id":"94f6f2bd3cd065aef863331db5ba23f850babb5682f0ad3d2ac585422e0b5fec","fast_time":0.0488681144,"language":"cpp","measured_fast_code_id":"94f6f2bd3cd065aef863331db5ba23f850babb5682f0ad3d2ac585422e0b5fec","measured_slow_code_id":"0725212cb42271a02af01bc0875f16829b4da41e6e1ce2051e4f4a08732b9a6f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41785","problem_id":"p03580","slow_code_id":"b0b62c96cfeef03fe0c46fa0b83225084ea0218a80c9568314ba8f4d31e0393f","slow_id":"0725212cb42271a02af01bc0875f16829b4da41e6e1ce2051e4f4a08732b9a6f","slow_time":0.14606051,"speedup":2.98887141018889,"stratum":"2-4","sampling_key":"53261e3d51c08db7ec7b7af9da915e66814efb6ac856dd2fed04d0fd51c43625","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int N;\n\n  string S;\n\n  int dp[500005] = {};\n\n  int pos = -1;\n\n  cin >> N >> S;\n\n  for (int i = 2; i < N; i++) {\n\n    dp[i + 1] = dp[i];\n\n    if (S.substr(i - 2, 3) == \"101\") {\n\n      pos = i - 3;\n\n      for (int j = i - 2; j >= 0 && S[j] != '0'; j--) {\n\n        dp[i + 1] = max(dp[i + 1], dp[j] + i - j - 1);\n      }\n    }\n\n    if (S[i] == '0')\n      pos = -1;\n\n    if (~pos)\n      dp[i + 1] = max(dp[i + 1], dp[pos + 1] + i - pos - 2);\n  }\n\n  cout << dp[N] << endl;\n\n  return (0);\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing Pi = pair<int, int>;\n\nusing Pl = pair<ll, ll>;\n\nusing vint = vector<int>;\n\nusing vvint = vector<vint>;\n\nusing vvvint = vector<vvint>;\n\nusing vdouble = vector<double>;\n\nusing vvdouble = vector<vdouble>;\n\nusing vvvdouble = vector<vvdouble>;\n\nusing vll = vector<ll>;\n\nusing vvll = vector<vll>;\n\nusing vvvll = vector<vvll>;\n\nusing uint = unsigned int;\n\nusing ull = unsigned long long;\n\ntemplate <typename T> using uset = unordered_set<T>;\n\ntemplate <typename T1, typename T2> using umap = unordered_map<T1, T2>;\n\nconstexpr int INF = (1 << 30) - 1;\n\nconstexpr ll LLINF = 1LL << 60;\n\nconstexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nconstexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconstexpr char el = '\\n';\n\nconstexpr int mod = 1000000007;\n\nconstexpr int mod2 = 998244353;\n\ntemplate <typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }\n\ntemplate <typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }\n\ntemplate <typename T1, typename T2>\n\ninline bool chmin(T1 &a, T2 b) {\n  return (a > b && (a = b, true));\n}\n\ntemplate <typename T1, typename T2>\n\ninline bool chmax(T1 &a, T2 b) {\n  return (a < b && (a = b, true));\n}\n\ntemplate <typename T>\n\nbool isin(T y, T x, T h, T w) {\n  return (0 <= y && 0 <= x && y < h && x < w);\n}\n\ntemplate <typename T>\n\nbool isin1(T y, T x, T h, T w) {\n  return (0 < y && 0 < x && y <= h && x <= w);\n}\n\ntemplate <typename T>\n\nostream &operator<<(ostream &os, vector<T> &v) {\n\n  os << v[0];\n\n  for (int i = 1; i < v.size(); i++)\n    os << \" \" << v[i];\n\n  return (os);\n}\n\ntemplate <typename T>\n\nistream &operator>>(istream &is, vector<T> &v) {\n\n  for (auto &u : v)\n    is >> u;\n\n  return (is);\n}\n\ntemplate <typename T1, typename T2>\n\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n\n  return (is >> p.first >> p.second);\n}\n\nvoid Main() {\n\n  int N;\n  cin >> N;\n\n  string S;\n  cin >> S;\n\n  vector<vector<Pi>> G(N + 1);\n\n  int pos = -1;\n\n  int cnt = 0;\n\n  for (int i = 2; i < N; i++) {\n\n    if (S[i] == '1' && S[i - 1] == '0' && S[i - 2] == '1') {\n\n      pos = i - 2;\n    }\n\n    if (S[i] == '0') {\n\n      pos = -1;\n\n      cnt = 0;\n\n    } else if (pos != -1) {\n\n      G[pos].emplace_back(i + 1, ++cnt);\n    }\n  }\n\n  pos = -1;\n\n  cnt = 0;\n\n  for (int i = N - 3; i >= 0; i--) {\n\n    if (S[i] == '1' && S[i + 1] == '0' && S[i + 2] == '1') {\n\n      pos = i + 2;\n    }\n\n    if (S[i] == '0') {\n\n      pos = -1;\n\n      cnt = 0;\n\n    } else if (pos != -1) {\n\n      G[i].emplace_back(pos + 1, ++cnt);\n    }\n  }\n\n  vint dp(N + 1, -INF);\n\n  dp[0] = 0;\n\n  for (int u = 0; u <= N; u++) {\n\n    if (u > 0)\n      chmax(dp[u], dp[u - 1]);\n\n    for (auto &e : G[u]) {\n\n      chmax(dp[e.first], dp[u] + e.second);\n    }\n  }\n\n  cout << dp[N] << endl;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(0);\n\n  cout << fixed << setprecision(20);\n\n  Main();\n\n  return (0);\n}\n"}
{"fast_code_id":"319f981c6c54efd3c9ae2433a79f40bcdeeb6a997bc831d8138338ba786af4d0","fast_id":"35285f727863a7441025cf4605d2d32546823e0075dd3b8dfb60eb33c6d87b78","fast_time":0.1013734044,"language":"cpp","measured_fast_code_id":"35285f727863a7441025cf4605d2d32546823e0075dd3b8dfb60eb33c6d87b78","measured_slow_code_id":"7d60546b5b17600e80573fcf206980229ec02d38865dfb1d9a0f771cd0da0ab1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41794","problem_id":"p03393","slow_code_id":"0161a877f31eb455ce15f0fc8f728d6b3f7fa5d656895d0db247f29f7356affa","slow_id":"7d60546b5b17600e80573fcf206980229ec02d38865dfb1d9a0f771cd0da0ab1","slow_time":0.6554269553,"speedup":6.46547246962143,"stratum":"4-8","sampling_key":"57ce60b86c8f5fb86fc5e16f5bd260bb2ac5d134538faeeccde6029e4ebce74f","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <numeric>\n\n#include <climits>\n\n#include <iterator>\n\n#include <iomanip>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\nusing namespace std;\n\nconst constexpr int INF = 1e9;\n\ntypedef long long ll;\n\ntypedef vector<int> VI;\n\nvector<pair<int, int> > vp;\n\nstruct Less {\n\n  bool operator()(const pair<int, int> &x, const pair<int, int> &y) const {\n\n    return x.first > y.first;\n  }\n};\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\nVI g[200010];\n\nint h[100010];\n\nll N, K;\n\nstring s;\n\nint arr[26];\n\nint main(void) {\n\n  cin >> s;\n\n  for (int i = 0; i < s.size(); ++i) {\n\n    arr[(s[i] - 'a')]++;\n  }\n\n  if (s == \"zyxwvutsrqponmlkjihgfedcba\") {\n\n    cout << -1 << endl;\n\n    return 0;\n  }\n\n  if (s.size() <= 25) {\n\n    cout << s;\n\n    for (int i = 0; i < 26; ++i) {\n\n      if (arr[i] != 1) {\n\n        cout << (char)('a' + i) << endl;\n\n        break;\n      }\n    }\n\n  } else {\n\n    vector<char> can;\n\n    int i = 25;\n\n    can.push_back(s[s.size() - 1]);\n\n    while (s[i - 1] > s[i]) {\n\n      i--;\n\n      can.push_back(s[i]);\n    }\n\n    i--;\n\n    sort(can.begin(), can.end());\n\n    for (int l = 0; l < can.size(); ++l) {\n\n      if (s[i] < can[l]) {\n\n        cout << s.substr(0, i) << can[l] << endl;\n\n        return 0;\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <numeric>\n\n#include <climits>\n\n#include <iterator>\n\n#include <iomanip>\n\n#include <stack>\n\n#include <set>\n\n#include <cstdio>\n\n#include <bitset>\n\n#include <functional>\n\n#include <tuple>\n\n#include <list>\n\n#include <deque>\n\n#include <sstream>\n\nusing namespace std;\n\nconst constexpr int INF = 1e9;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\ntypedef long long ll;\n\ntypedef vector<int> VI;\n\nconst constexpr ll MOD = 1e9 + 7;\n\nstruct Less {\n\n  bool operator()(const pair<string, int> &a, const pair<string, int> &b) {\n\n    if (a.first == b.first) {\n\n      return a.second < b.second;\n    }\n\n    return a.first < b.first;\n  }\n};\n\nll extGCD(ll a, ll b, ll &x, ll &y) {\n\n  if (b == 0) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n  }\n\n  ll d = extGCD(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\nll GCD(ll a, ll b) {\n\n  if (a < b)\n    swap(a, b);\n\n  if (b == 0)\n    return a;\n\n  return GCD(b, a % b);\n}\n\nint par[100010], rr[100010];\n\nvoid init() {\n\n  for (int i = 0; i < 100010; ++i) {\n\n    par[i] = i;\n\n    rr[i] = 0;\n  }\n}\n\nint root(int x) { return par[x] == x ? x : par[x] = root(par[x]); }\n\nbool same(int x, int y) { return root(x) == root(y); }\n\nvoid unite(int x, int y) {\n\n  x = root(x);\n\n  y = root(y);\n\n  if (x == y)\n    return;\n\n  if (rr[x] < rr[y]) {\n\n    par[x] = y;\n\n  } else {\n\n    par[y] = x;\n\n    if (rr[x] == rr[y])\n      rr[x]++;\n  }\n}\n\nll pow_mod(ll x, ll n) {\n\n  ll res = 1;\n\n  while (n > 0) {\n\n    if (n & 1) {\n\n      res = res * x % MOD;\n    }\n\n    x = x * x % MOD;\n\n    n >>= 1;\n  }\n\n  return res;\n}\n\nint alph[26];\n\nint main() {\n\n  string S;\n  cin >> S;\n\n  if (S == \"zyxwvutsrqponmlkjihgfedcba\") {\n\n    cout << -1 << endl;\n\n    return 0;\n  }\n\n  if (S.size() < 26) {\n\n    for (int i = 0; i < S.size(); ++i) {\n\n      alph[S[i] - 'a']++;\n    }\n\n    cout << S;\n\n    for (int i = 0; i < 26; ++i) {\n\n      if (alph[i] == 0) {\n\n        cout << (char)(i + 'a') << endl;\n\n        break;\n      }\n    }\n\n    cout << endl;\n\n  } else {\n\n    vector<string> v;\n\n    for (int i = S.size() - 1; i >= 0; i--) {\n\n      for (int j = i - 1; j >= 0; j--) {\n\n        if (S[i] > S[j]) {\n\n          string s = \"\";\n\n          for (int k = 0; k < j; ++k) {\n\n            s += S[k];\n          }\n\n          s += S[i];\n\n          v.push_back(s);\n\n          break;\n        }\n      }\n    }\n\n    v.push_back(S);\n\n    sort(v.begin(), v.end());\n\n    for (int i = 0; i < v.size(); ++i) {\n\n      if (v[i] == S)\n        cout << v[i + 1] << endl;\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"518657a839d977bac70ffb536151718fe867a459f60413ba131eda7e16a58629","fast_id":"f447feeda8940a3a74d64b28ae18f69eae2176003e53a39f3a4e723029669fa9","fast_time":0.0065143052,"language":"cpp","measured_fast_code_id":"f447feeda8940a3a74d64b28ae18f69eae2176003e53a39f3a4e723029669fa9","measured_slow_code_id":"86c7e04c360fb5bb9c8e053a500182f7c08f9f00002a17d76c825aa3222c79e5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4180","problem_id":"p00916","slow_code_id":"785dc23aa93d39828911fc456073af37502b4a3bd21f903314dc9b148786ffcf","slow_id":"86c7e04c360fb5bb9c8e053a500182f7c08f9f00002a17d76c825aa3222c79e5","slow_time":0.0979430609,"speedup":15.035074024471559,"stratum":"8+","sampling_key":"ae7be6eb18f519744c518e9f8fc7fd82b2c173f74a05243e9ebd9e416d6e04fc","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <map>\n\nusing namespace std;\n\n#define N 207\n\nvector<int> vx, vy;\n\nmap<int, int> hx, hy;\n\nint dx[4] = {0, 0, 1, -1};\n\nint dy[4] = {1, -1, 0, 0};\n\nint vis[N][N];\n\nint l[55], r[55], t[55], b[55];\n\nbool OK(int nx, int ny)\n\n{\n\n  if (nx >= 0 && nx <= 201 && ny >= 0 && ny <= 201 && !vis[nx][ny])\n\n    return 1;\n\n  return 0;\n}\n\nvoid dfs(int x, int y)\n\n{\n\n  vis[x][y] = 1;\n\n  for (int k = 0; k < 4; k++)\n\n  {\n\n    int nx = x + dx[k];\n\n    int ny = y + dy[k];\n\n    if (OK(nx, ny))\n\n      dfs(nx, ny);\n  }\n}\n\nint main() {\n\n  int n, i, j;\n\n  while (scanf(\"%d\", &n) != EOF && n) {\n\n    vx.clear();\n\n    vy.clear();\n\n    hx.clear();\n\n    hy.clear();\n\n    for (int i = 0; i < n; i++) {\n\n      scanf(\"%d%d%d%d\", &l[i], &t[i], &r[i], &b[i]);\n\n      vx.push_back(l[i]);\n\n      vx.push_back(r[i]);\n\n      vy.push_back(t[i]);\n\n      vy.push_back(b[i]);\n    }\n\n    sort(vx.begin(), vx.end());\n\n    vx.erase(unique(vx.begin(), vx.end()), vx.end());\n\n    sort(vy.begin(), vy.end());\n\n    vy.erase(unique(vy.begin(), vy.end()), vy.end());\n\n    for (int i = 0; i < vx.size(); i++)\n\n      hx[vx[i]] = 2 * i + 1;\n\n    for (int i = 0; i < vy.size(); i++)\n\n      hy[vy[i]] = 2 * i + 1;\n\n    for (int i = 0; i < n; i++) {\n\n      l[i] = hx[l[i]];\n\n      t[i] = hy[t[i]];\n\n      r[i] = hx[r[i]];\n\n      b[i] = hy[b[i]];\n    }\n\n    memset(vis, 0, sizeof(vis));\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = b[i]; j <= t[i]; j++) {\n\n        vis[j][l[i]] = 1;\n\n        vis[j][r[i]] = 1;\n      }\n\n      for (int j = l[i]; j <= r[i]; j++) {\n\n        vis[t[i]][j] = 1;\n\n        vis[b[i]][j] = 1;\n      }\n    }\n\n    int cnt = 0;\n\n    for (int i = 0; i <= 201; i++) {\n\n      for (int j = 0; j <= 201; j++) {\n\n        if (!vis[i][j]) {\n\n          cnt++;\n          dfs(i, j);\n        }\n      }\n    }\n\n    printf(\"%d\\n\", cnt);\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAXN = 60;\n\nint n;\n\nint l[MAXN], t[MAXN], r[MAXN], b[MAXN];\n\nint x[MAXN * 2], w;\n\nint y[MAXN * 2], h;\n\nbool c[MAXN * 4][MAXN * 4];\n\nint ans;\n\nconst int dx[] = {0, -1, 0, 1};\n\nconst int dy[] = {-1, 0, 1, 0};\n\nvoid init()\n\n{\n\n  w = h = 0;\n\n  for (int i = 0; i < n; ++i) {\n\n    scanf(\"%d%d%d%d\", &l[i], &t[i], &r[i], &b[i]);\n\n    x[w++] = l[i];\n\n    x[w++] = r[i];\n\n    y[h++] = t[i];\n\n    y[h++] = b[i];\n  }\n\n  sort(x, x + w);\n\n  w = unique(x, x + w) - x;\n\n  sort(y, y + h);\n\n  h = unique(y, y + h) - y;\n}\n\nvoid build()\n\n{\n\n  memset(c, 0, sizeof(c));\n\n  for (int i = 0; i < n; ++i) {\n\n    int x1 = (lower_bound(x, x + w, l[i]) - x) * 2 + 1;\n\n    int x2 = (lower_bound(x, x + w, r[i]) - x) * 2 + 1;\n\n    int y1 = (lower_bound(y, y + h, b[i]) - y) * 2 + 1;\n\n    int y2 = (lower_bound(y, y + h, t[i]) - y) * 2 + 1;\n\n    for (int x = x1; x <= x2; ++x)\n      c[x][y1] = c[x][y2] = true;\n\n    for (int y = y1; y <= y2; ++y)\n      c[x1][y] = c[x2][y] = true;\n  }\n}\n\nbool inrange(int x, int y)\n\n{\n\n  return x >= 0 && x <= w && y >= 0 && y <= h;\n}\n\nvoid dfs(int x, int y)\n\n{\n\n  c[x][y] = true;\n\n  for (int i = 0; i < 4; ++i) {\n\n    int nx = x + dx[i], ny = y + dy[i];\n\n    if (inrange(nx, ny) && !c[nx][ny])\n      dfs(nx, ny);\n  }\n}\n\nvoid solve()\n\n{\n\n  ans = 0;\n\n  w *= 2, h *= 2;\n\n  for (int i = 0; i <= w; ++i) {\n\n    for (int j = 0; j <= h; ++j) {\n\n      if (!c[i][j])\n        dfs(i, j), ++ans;\n    }\n  }\n}\n\nint main()\n\n{\n\n  while (scanf(\"%d\", &n) != EOF && n) {\n\n    init();\n\n    build();\n\n    solve();\n\n    printf(\"%d\\n\", ans);\n  }\n}"}
{"fast_code_id":"103d5fa1dc6e4d71f0bc924f2680bf6e31c1ca65df2e76bb030303fcef7f0794","fast_id":"d55c721d3d6c1714336744d0b6b76fd602a925b04b6cc32ced6a04a2dbaa3d0d","fast_time":0.1689883881,"language":"cpp","measured_fast_code_id":"d55c721d3d6c1714336744d0b6b76fd602a925b04b6cc32ced6a04a2dbaa3d0d","measured_slow_code_id":"3041e8e2f8b865fae06d77692e2addd9a40bebd1729b46a411db683f74d1f585","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4184","problem_id":"p00474","slow_code_id":"934caa751f5652d4a06c19180d99759414fc2f215b9662adcfbe0fed6443c47c","slow_id":"3041e8e2f8b865fae06d77692e2addd9a40bebd1729b46a411db683f74d1f585","slow_time":0.4117853062,"speedup":2.436766873924635,"stratum":"2-4","sampling_key":"e5e41dbe0a6a1afe1d3dd2b9ffd763914312428a1335aa4b8fd9a2259ec2bdae","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define PB push_back\n\n#define INF (1LL << 61LL)\n\ntypedef pair<int, int> pii;\n\nint N, L, a[100005], dx[] = {-1, 1};\n\nvector<int> g[100005];\n\nbool flg[100005];\n\nint cal(int x) {\n\n  int res = L - a[x], temp = 0;\n\n  for (int i = 0; i < g[x].size(); ++i) {\n\n    temp = max(temp, cal(g[x][i]));\n  }\n\n  return res + temp;\n}\n\nsigned main() {\n\n  fill(a, a + 100005, INF);\n\n  cin >> N >> L;\n\n  for (int i = 1; i <= N; ++i)\n\n    cin >> a[i];\n\n  for (int i = 1; i <= N; ++i) {\n\n    int count = 0;\n\n    for (int j = 0; j < 2; ++j) {\n\n      if (a[i + dx[j]] < a[i]) {\n\n        g[i].PB(i + dx[j]);\n\n        count++;\n      }\n    }\n\n    if ((count == 2) || (((i == 1) || (i == N)) && (count == 1)))\n\n      flg[i] = true;\n  }\n\n  int maxt = 0;\n\n  for (int i = 1; i <= N; ++i) {\n\n    if (!flg[i])\n      continue;\n\n    maxt = max(maxt, cal(i));\n  }\n\n  cout << maxt << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define PB push_back\n\n#define INF (1LL << 61LL)\n\ntypedef pair<int, int> pii;\n\nint N, L, a[100005], dx[] = {-1, 1};\n\nbool flg[100005];\n\nint cal(int x) {\n\n  int res = L - a[x], temp = 0;\n\n  for (int i = 0; i < 2; ++i) {\n\n    if (a[x] < a[x + dx[i]])\n      continue;\n\n    temp = max(temp, cal(x + dx[i]));\n  }\n\n  return res + temp;\n}\n\nsigned main() {\n\n  fill(a, a + 100005, INF);\n\n  cin >> N >> L;\n\n  for (int i = 1; i <= N; ++i)\n\n    cin >> a[i];\n\n  int maxt = 0;\n\n  for (int i = 1; i <= N; ++i) {\n\n    int count = 0;\n\n    for (int j = 0; j < 2; ++j) {\n\n      if (a[i + dx[j]] < a[i]) {\n\n        count++;\n      }\n    }\n\n    if ((count == 2) || (((i == 1) || (i == N)) && (count == 1)))\n\n      maxt = max(maxt, cal(i));\n  }\n\n  cout << maxt << endl;\n\n  return 0;\n}"}
{"fast_code_id":"a159adb39dfa77d9af7d24843b5cbd25c076bdbb953945b4ae355363e92a758a","fast_id":"7d59268a451b463a713ea0fc16f5872117481cdc8145641ef18dfc1ff7bce5a1","fast_time":0.1041593856,"language":"cpp","measured_fast_code_id":"7d59268a451b463a713ea0fc16f5872117481cdc8145641ef18dfc1ff7bce5a1","measured_slow_code_id":"f85bca4b764e661188862ae2553c0f42f1ae9bf84f8fd899e9c72434dd3b94ee","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41890","problem_id":"p03331","slow_code_id":"0e5460256747b196cb0c70bd66a9202229a405a49ebd1634e6423061c91dcb86","slow_id":"f85bca4b764e661188862ae2553c0f42f1ae9bf84f8fd899e9c72434dd3b94ee","slow_time":0.6612838878,"speedup":6.348769090665604,"stratum":"4-8","sampling_key":"a168fad77352588deac1ec2ad7761ddae3f45ba901fd3537eccda20925705a73","slow_code":"#include <iostream>\n\n#include <climits>\n\n#include <stack>\n\n#include <queue>\n\n#include <string>\n\n#include <set>\n\n#include <map>\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string.h>\n\n#include <random>\n\n#include <iomanip>\n\n#include <limits>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\nlong long int INF = 1e18;\n\ndouble Pi = 3.141592653589;\n\nconst int mod = 1000000007;\n\nvector<int> G[100005];\n\nstd::vector<P> tree[100010];\n\nint dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\n\nint dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};\n\n#define p(x) cout << x << endl;\n\n#define el cout << endl;\n\n#define pe(x) cout << x << \" \";\n\n#define re(i, a, b) for (i = a; i <= b; i++)\n\nll i, j, k, l, ii, jj;\n\nll n, m, a, b, c, d, ans = INF, num, ddx, ddy;\n\nll x[100005], y[100005];\n\nchar s[300004];\n\nll de(ll x) {\n\n  ll num = 0;\n\n  while (true) {\n\n    num += x % 10;\n\n    x = x / 10;\n\n    if (x == 0)\n      break;\n  }\n\n  return num;\n}\n\nint main() {\n\n  cin >> n;\n\n  for (i = 1; i < n; i++) {\n\n    ans = min(ans, de(i) + de(n - i));\n  }\n\n  p(ans);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#include <unistd.h>\n\n#include <sys/time.h>\n\n#include <stdlib.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<P, ll> T;\n\nlong long int INF = 2e18;\n\nconst ll fact_table = 1200008;\n\ndouble Pi = 3.1415926535897932384626;\n\npriority_queue<ll> pql;\n\npriority_queue<P> pqp;\n\npriority_queue<P> bag;\n\npriority_queue<ll, vector<ll>, greater<ll> > pqls;\n\npriority_queue<P, vector<P>, greater<P> > pqps;\n\nll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\n\nll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};\n\nchar dir[] = \"DRUL\";\n\n#define endl \"\\n\"\n\n#ifdef ENJAPMA\n\n#undef endl\n\n#endif\n\n#define p(x) cout << x << endl;\n\n#define el cout << endl;\n\n#define pe(x) cout << x << \" \";\n\n#define ps(x) cout << fixed << setprecision(25) << x << endl;\n\n#define pu(x) cout << (x);\n\n#define pb push_back\n\n#define lb lower_bound\n\n#define ub upper_bound\n\n#define CLEAR(a) a = decltype(a)();\n\n#define pc(x) cout << x << \",\";\n\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\nconst ll mod = 998244353ll;\n\nll mypow(ll number1, ll number2, ll mod) {\n\n  if (number2 == 0) {\n\n    return 1ll;\n\n  } else {\n\n    ll number3 = mypow(number1, number2 / 2, mod);\n\n    number3 *= number3;\n\n    number3 %= mod;\n\n    if (number2 % 2 == 1) {\n\n      number3 *= number1;\n\n      number3 %= mod;\n    }\n\n    return number3;\n  }\n}\n\nvoid YES(bool condition) {\n\n  if (condition) {\n    p(\"YES\");\n  } else {\n    p(\"NO\");\n  }\n\n  return;\n}\n\nvoid Yes(bool condition) {\n\n  if (condition) {\n\n    p(\"Yes\");\n\n  } else {\n\n    p(\"No\");\n  }\n\n  return;\n}\n\nll mygcd(ll a, ll b) {\n\n  if (b > a)\n    swap(a, b);\n\n  if (a == b || b == 0)\n    return a;\n\n  return mygcd(b, a % b);\n}\n\nbool multicase = false;\n\nll n, m, num, a, b, c, d, e, q, w, ans;\n\nll x[500005], y[500005];\n\nll r, k;\n\nstring s;\n\nll sum(ll num) {\n\n  ll res = 0;\n\n  while (true) {\n\n    if (num == 0)\n      return res;\n\n    res += num % 10;\n\n    num /= 10;\n  }\n\n  return -INF;\n}\n\nvoid solve() {\n\n  cin >> n;\n\n  ans = INF;\n\n  for (ll i = 1; i < n; i++) {\n\n    ll a = i, b = n - i;\n\n    ll res = sum(a) + sum(b);\n\n    ans = min(ans, res);\n  }\n\n  p(ans);\n\n  return;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  ll q, testcase = 1;\n\n  if (multicase) {\n\n    cin >> q;\n\n  } else {\n\n    q = 1;\n  }\n\n  while (q--) {\n\n    solve();\n\n    testcase++;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"196752a249a4a0a2cfcd8370a6686bb70b76d217255d9e8e230703e6b98e6103","fast_id":"d3c69683701f3569f8f8056fdccf69db6c3471d315c2bd3bc340ae6768a879f9","fast_time":0.0231829778,"language":"cpp","measured_fast_code_id":"d3c69683701f3569f8f8056fdccf69db6c3471d315c2bd3bc340ae6768a879f9","measured_slow_code_id":"f654cedfda077c1479921d47bd2c2bbe4ccd4ccd58a34481d3375105d8382fac","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_419","problem_id":"p02964","slow_code_id":"91fff2f4f508dcedabb4cfd764cdf56dad1eaf61bbb92f7090afe557ab0e06e5","slow_id":"f654cedfda077c1479921d47bd2c2bbe4ccd4ccd58a34481d3375105d8382fac","slow_time":0.1682311282,"speedup":7.256666061251199,"stratum":"4-8","sampling_key":"0a7ca398cef000c3c8586fc0792cd1e4c4a0bd07334565937f7b67c50da585d7","slow_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\n#ifndef LOCAL\n\n#define endl '\\n'\n\n#endif\n\n#define fr(i, a, b) for (int i = a; i <= b; i++)\n\n#define rf(i, a, b) for (int i = a; i >= b; i--)\n\n#define pf push_front\n\n#define pb push_back\n\n#define eb emplace_back\n\n#define fi first\n\n#define se second\n\n#define all(x) x.begin(), x.end()\n\n#define rall(x) x.rbegin(), x.rend()\n\n#define sz(x) (int)x.size()\n\n#define lb lower_bound\n\n#define ub upper_bound\n\ntypedef long long ll;\n\ntypedef long double f80;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\nint pct(int x) { return __builtin_popcount(x); }\n\nint pct(ll x) { return __builtin_popcountll(x); }\n\nint bt(int x) { return 31 - __builtin_clz(x); }\n\nint bt(ll x) { return 63 - __builtin_clzll(x); }\n\nint cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }\n\nll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }\n\nint nxt_C(int x) {\n  int c = x & -x, r = x + c;\n  return (((r ^ x) >> 2) / c) | r;\n}\n\nll nxt_C(ll x) {\n  ll c = x & -x, r = x + c;\n  return (((r ^ x) >> 2) / c) | r;\n}\n\nvector<int> get_bits(int mask) {\n\n  vector<int> bb;\n\n  while (mask) {\n    int b = bt(mask);\n    bb.pb(b);\n    mask ^= (1 << b);\n  }\n\n  reverse(all(bb));\n\n  return bb;\n}\n\nint get_mask(vector<int> v) {\n\n  int mask = 0;\n\n  for (int x : v) {\n    mask ^= (1 << x);\n  }\n\n  return mask;\n}\n\ntemplate <typename T>\n\nvoid uniq(vector<T> &v) {\n  sort(all(v));\n  v.resize(unique(all(v)) - v.begin());\n}\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\n\nll rand(ll l, ll r) {\n\n  uniform_int_distribution<ll> uid(l, r);\n\n  return uid(rng);\n}\n\nvoid sc() {}\n\ntemplate <typename Head, typename... Tail>\n\nvoid sc(Head &H, Tail &... T) {\n  cin >> H;\n  sc(T...);\n}\n\n#ifdef LOCAL\n\n#define debug(...) cerr << \"[L:\" << __LINE__ << \"][\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n\n#else\n\n#define debug(...) 42\n\n#endif\n\nconst int mod = 1e9 + 7;\n\nint pwr(int a, ll b) {\n\n  int ans = 1;\n\n  while (b) {\n\n    if (b & 1)\n      ans = (ans * 1LL * a) % mod;\n\n    a = (a * 1LL * a) % mod;\n\n    b >>= 1;\n  }\n\n  return ans;\n}\n\nconst int N = 2e5 + 5;\n\nint a[N];\n\npii pt[N];\n\nvector<int> pos[N];\n\nint cnt[N];\n\nvoid solve() {\n\n  int n;\n\n  ll k;\n\n  sc(n, k);\n\n  fr(i, 1, n) {\n\n    sc(a[i]);\n\n    pos[a[i]].pb(i);\n  }\n\n  fr(i, 1, N - 1) {\n\n    if (pos[i].empty())\n      continue;\n\n    fr(j, 0, sz(pos[i]) - 2) {\n\n      pt[pos[i][j]] = {(pos[i][j + 1] % n) + 1, pos[i][j + 1] - pos[i][j]};\n    }\n\n    pt[pos[i].back()] = {(pos[i][0] % n) + 1, n - pos[i].back() + pos[i][0]};\n  }\n\n  ll cyc = 0;\n\n  int x = 1;\n\n  fr(i, 1, n) {\n\n    pt[i].se++;\n\n    debug(i, pt[i].fi, pt[i].se);\n  }\n\n  do {\n\n    cyc += pt[x].se;\n\n    x = pt[x].fi;\n\n  } while (x != 1);\n\n  debug(cyc);\n\n  ll tot = n * k;\n\n  tot %= cyc;\n\n  int st = 1;\n\n  while (tot >= pt[st].se) {\n\n    tot -= pt[st].se;\n\n    st = pt[st].fi;\n  }\n\n  vector<int> ans;\n\n  while (tot) {\n\n    tot--;\n\n    ans.pb(a[st]);\n\n    cnt[a[st]]++;\n\n    if (cnt[a[st]] == 2) {\n\n      while (cnt[a[st]]) {\n\n        cnt[ans.back()]--;\n\n        ans.pop_back();\n      }\n    }\n\n    st = (st % n) + 1;\n  }\n\n  for (int x : ans) {\n\n    cout << x << \" \";\n  }\n}\n\nint main() {\n\n  ios ::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  int t = 1;\n\n  for (int tt = 1; tt <= t; tt++) {\n\n    solve();\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 2e5 + 7;\n\nlong long n, k, d;\n\nint a[maxn], lst[maxn], to[maxn], zz[maxn], t, hs[maxn];\n\nint main() {\n\n  scanf(\"%lld%lld\", &n, &k);\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%d\", &a[i]);\n\n  for (int i = n; i; --i)\n    lst[a[i]] = i;\n\n  for (int i = n; i; --i) {\n\n    to[i] = lst[a[i]];\n\n    lst[a[i]] = i;\n  }\n\n  int pos = 1;\n\n  do {\n\n    if (to[pos] <= pos)\n      ++d;\n\n    if (to[pos] == n)\n      ++d;\n\n    pos = to[pos] % n + 1;\n\n  } while (pos != 1);\n\n  k %= d;\n\n  if (k == 0)\n    return 0;\n\n  pos = 1;\n\n  while (1) {\n\n    if (to[pos] <= pos) {\n\n      if (k > 1)\n        --k;\n\n      else\n        break;\n    }\n\n    pos = to[pos] % n + 1;\n  }\n\n  for (int i = pos; i <= n; ++i) {\n\n    if (hs[a[i]]) {\n\n      while (zz[t] != a[i])\n\n        hs[zz[t--]] = 0;\n\n      hs[zz[t--]] = 0;\n\n    }\n\n    else {\n\n      hs[a[i]] = 1;\n\n      zz[++t] = a[i];\n    }\n  }\n\n  for (int i = 1; i <= t; ++i)\n    printf(\"%d \", zz[i]);\n\n  printf(\"\\n\");\n\n  return 0;\n}"}
{"fast_code_id":"b5f8e49d4618b6d603f0b451307f30815bf72d8006323f4577b5fef402c62fdf","fast_id":"60eb03dae75b20de53b13399a62c8012548bad981adf95ed44289c313f5c44ba","fast_time":0.1113007012,"language":"cpp","measured_fast_code_id":"60eb03dae75b20de53b13399a62c8012548bad981adf95ed44289c313f5c44ba","measured_slow_code_id":"0be2417adfe32d7b226856f6f3c27c37c171a56c0e6abf3b325d06e2479a6448","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41913","problem_id":"p01110","slow_code_id":"8c0e4220a9840782b5107bb7acb34b06abc3ac78958f8d9fac84aaafb2170dec","slow_id":"0be2417adfe32d7b226856f6f3c27c37c171a56c0e6abf3b325d06e2479a6448","slow_time":0.2774318893,"speedup":2.4926337957338944,"stratum":"2-4","sampling_key":"cbb6d176ac778e338edfe3f8c9254a85cdd43f645802c31e1cd2389a30f08ac3","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nlong long l[10000], r[10000], x1, x2, y1, y2, m, n, t, p, d[10000], c[10000], a[300][300],\n    b[300][300], x, y;\n\nint main()\n\n{\n\n  while (1)\n\n  {\n\n    scanf(\"%lld%lld%lld%lld\", &n, &m, &t, &p);\n\n    if (n == 0 && m == 0 && t == 0 && p == 0)\n      break;\n\n    x1 = 32;\n    y1 = 32;\n    x2 = 31 + m;\n    y2 = 31 + n;\n\n    memset(a, 0, sizeof(a));\n\n    for (int i = 32; i <= m + 31; i++)\n\n      for (int j = 32; j <= n + 31; j++)\n\n        a[i][j] = 1;\n\n    for (int k = 1; k <= t; k++)\n\n    {\n\n      scanf(\"%lld%lld\", &d[k], &c[k]);\n\n      if (d[k] == 2)\n\n      {\n\n        for (int i = x2 - c[k] + 1; i <= x2; i++)\n\n          for (int j = 32; j <= y2; j++)\n\n          {\n\n            a[2 * (x2 - c[k]) + 1 - i][j] += a[i][j];\n\n            a[i][j] = 0;\n          }\n\n        x1 = min(x1, x2 - 2 * c[k] + 1);\n\n        x2 = x2 - c[k];\n\n        x = 31;\n\n        for (int i = x1; i <= x2; i++)\n\n        {\n\n          x++;\n\n          y = 31;\n\n          for (int j = y1; j <= y2; j++)\n\n            b[x][++y] = a[i][j];\n        }\n\n        memset(a, 0, sizeof(a));\n\n        for (int i = 32; i <= x; i++)\n\n          for (int j = 32; j <= y; j++)\n\n            a[i][j] = b[i][j];\n\n        x1 = 32;\n        y1 = 32;\n\n        x2 = x;\n        y2 = y;\n\n      } else\n\n          if (d[k] == 1)\n\n      {\n\n        c[k] += 31;\n\n        for (int i = 32; i <= x2; i++)\n\n          for (int j = 32; j <= c[k]; j++)\n\n          {\n\n            a[i][2 * c[k] + 1 - j] += a[i][j];\n\n            a[i][j] = 0;\n          }\n\n        y2 = max(y2, 2 * c[k] - 31);\n\n        y1 = c[k] + 1;\n\n        x = 31;\n\n        for (int i = x1; i <= x2; i++)\n\n        {\n\n          x++;\n\n          y = 31;\n\n          for (int j = y1; j <= y2; j++)\n\n            b[x][++y] = a[i][j];\n        }\n\n        memset(a, 0, sizeof(a));\n\n        for (int i = 32; i <= x; i++)\n\n          for (int j = 32; j <= y; j++)\n\n            a[i][j] = b[i][j];\n\n        x1 = 32;\n        y1 = 32;\n\n        x2 = x;\n        y2 = y;\n      }\n    }\n\n    for (int k = 1; k <= p; k++)\n\n    {\n\n      scanf(\"%lld%lld\", &l[k], &r[k]);\n\n      l[k] += 32;\n\n      printf(\"%lld\\n\", a[x2 - r[k]][l[k]]);\n    }\n  }\n\n  return (0);\n}\n","fast_code":"\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <string>\n\n#include <cstring>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <utility>\n\n#include <cmath>\n\n#include <climits>\n\n#include <deque>\n\n#include <functional>\n\n#define INF 0x7fffffff\n\n#define maxn 100000\n\n#define eps 1e-15\n\n#define MOD ((int)(1e9 + 7))\n\n#define ABS(x) ((x) >= 0 ? (x) : (-(x)))\n\n#define pb(x) push_back(x)\n\n#define lowbit(x) (x & -x)\n\n#define mid (L + R) / 2\n\n#define Lson (index * 2)\n\n#define Rson (index * 2 + 1)\n\nusing namespace std;\n\ntypedef long long ll;\n\ninline ll read() {\n\n  char c;\n\n  ll ret = 0, sgn = 1;\n\n  do {\n    c = getchar();\n  } while ((c < '0' || c > '9') && c != '-');\n\n  if (c == '-')\n    sgn = -1;\n  else\n    ret = c - '0';\n\n  while ((c = getchar()) >= '0' && c <= '9')\n    ret = ret * 10 + (c - '0');\n\n  return sgn * ret;\n}\n\nint arr[100][100];\n\nint n, m, t, p, o, x, a, b;\n\nvoid move_left(ll x) {\n\n  for (ll i = 1; i <= m; i++)\n\n    for (ll j = 1; j <= max(x, n - x); j++) {\n\n      arr[i][j] = arr[i][j + x];\n\n      arr[i][j + x] = 0;\n    }\n\n  n = max(x, n - x);\n}\n\nvoid move_down(ll x) {\n\n  for (ll i = 1; i <= n; i++)\n\n    for (ll j = 1; j <= max(x, m - x); j++) {\n\n      arr[j][i] = arr[j + x][i];\n\n      arr[j + x][i] = 0;\n    }\n\n  m = max(x, m - x);\n}\n\nint main(void)\n\n{\n\n  while (scanf(\"%d %d %d %d\", &n, &m, &t, &p) && n && m && t && p) {\n\n    memset(arr, 0, sizeof(arr));\n\n    for (ll i = 1; i <= m; i++)\n\n      for (ll j = 1; j <= n; j++)\n        arr[i][j] = 1;\n\n    for (ll i = 1; i <= t; i++) {\n\n      cin >> o >> x;\n\n      if (o == 1) {\n\n        for (int k = 1; k <= m; k++) {\n\n          for (int j = 1; j <= x; j++)\n\n            arr[k][2 * x - j + 1] += arr[k][j];\n        }\n\n        move_left(x);\n\n      }\n\n      else if (o == 2) {\n\n        for (int k = 1; k <= n; k++)\n\n          for (int j = 1; j <= x; j++)\n\n            arr[2 * x - j + 1][k] += arr[j][k];\n\n        move_down(x);\n      }\n    }\n\n    for (int i = 1; i <= p; i++) {\n\n      cin >> a >> b;\n      a++;\n      b++;\n\n      cout << arr[b][a] << endl;\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"a52cdda6f27c79f5078fcf7f34ecfc284591f4826ba15c7d8c6948393c40b375","fast_id":"03af17349c9b8b565ea97099b4fc16a60809ae92adde8a833ae619519ef44983","fast_time":0.1056342705,"language":"cpp","measured_fast_code_id":"03af17349c9b8b565ea97099b4fc16a60809ae92adde8a833ae619519ef44983","measured_slow_code_id":"8094061f3f7d71fb52ab69fa29baf1991bea3d2095f6713a944bed6c59ec60bc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41916","problem_id":"p03317","slow_code_id":"786cdcc69405e59a300b628f0faf45c990c278f01c3481bce95641367c778bec","slow_id":"8094061f3f7d71fb52ab69fa29baf1991bea3d2095f6713a944bed6c59ec60bc","slow_time":0.6933642985,"speedup":6.563819631811629,"stratum":"4-8","sampling_key":"454c727c31863a3fbf14391fe2a585735ec076d21697544ec28b750e8e4e2d45","slow_code":"#include <iostream>\n\n#include <bits/stdc++.h>\n\n#define mod 998244353\n\ntypedef long long ll;\n\nusing namespace std;\n\nvoid Fastio() {\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n}\n\nll fact[1000006], inv[1000006];\n\nll fp(ll base, ll exp)\n\n{\n\n  if (exp == 0)\n\n    return 1;\n\n  ll ans = fp(base, exp / 2);\n\n  ans = (ans * ans) % mod;\n\n  if (exp % 2 != 0)\n\n    ans = (ans * (base % mod)) % mod;\n\n  return ans;\n}\n\nvoid calcFacAndInv(ll n)\n\n{\n\n  fact[0] = inv[0] = 1;\n\n  for (ll i = 1; i <= n; i++)\n\n  {\n\n    fact[i] = (i * fact[i - 1]);\n\n    inv[i] = fp(fact[i], mod - 2);\n  }\n}\n\nll ncr(ll n, ll r)\n\n{\n\n  return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;\n}\n\nll npr(ll n, ll r)\n\n{\n\n  return (fact[n] * inv[n - r]) % mod;\n}\n\nlong double NCR(int n, int m) {\n\n  long double res = 1;\n\n  m = min(m, n - m);\n\n  for (int i = 0; i < m; i++) {\n\n    res = res * (n - i) / (i + 1);\n  }\n\n  return res;\n}\n\nll tol(string a) {\n\n  ll res = 0;\n\n  while (a[0] == '0') {\n\n    a.erase(a.begin());\n  }\n\n  if (a == \"\")\n    a = \"0\";\n\n  for (int i = 0; i < a.size(); i++) {\n\n    res *= 10;\n    res += a[i] - '0';\n  }\n\n  return res;\n}\n\nint check(string a, string b) {\n\n  for (int i = 0; i < a.size(); i++) {\n\n    if (a[i] > b[i])\n      return 1;\n\n    if (b[i] > a[i])\n      return -1;\n  }\n\n  return 0;\n}\n\nclass data {\n\npublic:\n  ll v, d, p;\n\n  data() {}\n\n  data(ll vv, ll dd, ll pp) {\n\n    v = vv;\n    d = dd;\n    p = pp;\n  }\n};\n\nint primeFactors(int n)\n\n{\n\n  ll c = 0;\n\n  while (n % 2 == 0)\n\n  {\n\n    c++;\n\n    n = n / 2;\n  }\n\n  for (int i = 3; i * i <= n; i = i + 2)\n\n  {\n\n    while (n % i == 0)\n\n    {\n\n      c++;\n\n      n = n / i;\n    }\n  }\n\n  if (n > 2)\n\n    c++;\n\n  return c;\n}\n\nint n, m, counter;\n\nvector<int> arr[200005];\n\nint vis[200005];\n\nvoid dfs(int node) {\n\n  vis[node] = 1;\n  counter++;\n\n  for (int i = 0; i < arr[node].size(); i++) {\n\n    if (!vis[arr[node][i]])\n      dfs(arr[node][i]);\n  }\n}\n\nint main()\n\n{\n\n  Fastio();\n\n  double n, k, pos = 0;\n  cin >> n >> k;\n  k--;\n\n  for (int i = 0; i < n; i++) {\n\n    int x;\n    cin >> x;\n\n    if (x == 1)\n      pos = i;\n  }\n\n  ll tmp1, tmp2;\n\n  int p = pos, kk = k;\n\n  while (p % kk && p + 1 < n)\n    p++;\n\n  pos = p;\n  tmp1 = ceil(pos / k);\n\n  tmp2 = ceil((n - pos - 1) / k);\n\n  ll res = tmp1 + tmp2;\n\n  cout << res << '\\n';\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 1e5 + 5, mod = 1e9 + 7, inf = INT_MAX;\n\nint main()\n\n{\n\n  int n, m, c, x, ans = inf;\n\n  cin >> n >> m;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> x;\n\n    if (x == 1)\n\n      c = i + 1;\n  }\n\n  for (int i = max(1, c - m + 1); i <= n; i++)\n\n  {\n\n    int l = i, r = i + m - 1;\n\n    ans = min(ans, 1 + (l - 1) / (m - 1) + ((l - 1) % (m - 1) == 0 ? 0 : 1) +\n\n                       (n - r) / (m - 1) + ((n - r) % (m - 1) == 0 ? 0 : 1));\n  }\n\n  cout << ans;\n\n  return 0;\n}"}
{"fast_code_id":"66f7450db1c80d873b435059861bf5f7ed49f16beaea4f8ec5932260da094699","fast_id":"7f56074d141abca3c6524dc5d722f9ad5c7186cee7235efad4813044db1ade3f","fast_time":0.0104778806,"language":"cpp","measured_fast_code_id":"7f56074d141abca3c6524dc5d722f9ad5c7186cee7235efad4813044db1ade3f","measured_slow_code_id":"7d067b33f25b697a67a4153d942ca7f1545dd02c0103934bf32f348de2c578e3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41936","problem_id":"p00841","slow_code_id":"a2f46c5eb6eca3a289cda49488294032b6c96d8f4f92e6cf5e949063010165aa","slow_id":"7d067b33f25b697a67a4153d942ca7f1545dd02c0103934bf32f348de2c578e3","slow_time":0.0257386315,"speedup":2.456473067654541,"stratum":"2-4","sampling_key":"f9322150165d6bc44a015c823c44844e257bfa8a4f7339b05e322bacaacefdaf","slow_code":"#include <cmath>\n\n#include <ctime>\n\n#include <cstdio>\n\n#include <cctype>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <sstream>\n\n#include <algorithm>\n\n#include <set>\n\n#include <stack>\n\n#include <queue>\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n#define maxn 110\n\n#define maxl 1000000000\n\n#define mod 1000000007\n\nusing namespace std;\n\ntypedef unsigned long long ull;\n\nint a[maxn];\n\ndouble ans[maxn];\n\nbool solve() {\n\n  int n, i, j, r, k;\n\n  double b, v, e, f, temp2, temp;\n\n  scanf(\"%d\", &n);\n\n  if (n == 0)\n    return false;\n\n  for (i = 1; i <= n; ++i) {\n\n    scanf(\"%d\", &a[i]);\n\n    ans[i] = 1e30;\n  }\n\n  scanf(\"%lf%d%lf%lf%lf\", &b, &r, &v, &e, &f);\n\n  ans[0] = -b;\n\n  for (i = 0; i < n; ++i) {\n\n    temp = ans[i] + b;\n\n    for (j = i + 1; j <= n; ++j) {\n\n      for (k = a[j - 1]; k < a[j]; ++k) {\n\n        if (k - a[i] >= r)\n          temp2 = 1 / (v - e * (k - a[i] - r));\n\n        else\n          temp2 = 1 / (v - f * (r - (k - a[i])));\n\n        temp += temp2;\n      }\n\n      ans[j] = min(temp, ans[j]);\n    }\n  }\n\n  printf(\"%.4f\\n\", ans[n]);\n\n  return true;\n}\n\nint main() {\n\n  while (solve())\n    ;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#define MAXN 10010\n\ndouble v, e, f, b;\n\nint dis[MAXN];\n\ndouble dp[MAXN], time[MAXN];\n\nint r, n;\n\nvoid calc()\n\n{\n\n  int i;\n\n  memset(time, 0, sizeof time);\n\n  for (i = 0; i <= dis[n] + 1; i++)\n\n  {\n\n    double tmp;\n\n    if (i >= r)\n      tmp = 1.0 / (v - e * (i - r));\n\n    else\n      tmp = 1.0 / (v - f * (r - i));\n\n    time[i + 1] = time[i] + tmp;\n  }\n}\n\nint main() {\n\n  while (scanf(\"%d\", &n) && n)\n\n  {\n\n    memset(dp, 0, sizeof dp);\n\n    memset(dis, 0, sizeof dis);\n\n    for (int i = 1; i <= n; i++)\n\n      scanf(\"%d\", &dis[i]);\n\n    scanf(\"%lf\", &b);\n\n    scanf(\"%d%lf%lf%lf\", &r, &v, &e, &f);\n\n    calc();\n\n    double min;\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      double tmp;\n\n      min = 10000000000;\n\n      for (int j = 0; j < i; j++)\n\n        if ((tmp = dp[j] + time[dis[i] - dis[j]]) < min)\n\n          min = tmp;\n\n      dp[i] = min + b;\n    }\n\n    printf(\"%.4lf\\n\", dp[n] - b);\n  }\n}"}
{"fast_code_id":"1c18468832524292157ae8f4f9eb0451f3d7dc6a1d0ce63a8ea18d3109222eb8","fast_id":"adc6e34d68fabe3d95aaf5ba656a3c93ea81ca61f9cf5a02bb07568d8c70d0f4","fast_time":0.0729540758,"language":"cpp","measured_fast_code_id":"adc6e34d68fabe3d95aaf5ba656a3c93ea81ca61f9cf5a02bb07568d8c70d0f4","measured_slow_code_id":"d9dd839e41ee107a0d027de8a56aa28aa8a95b21baa39ccd9122779eecd06554","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41946","problem_id":"p02611","slow_code_id":"34dbd32ad63077253437e5af8ae84236488718b670ec22e66124e14c92e346c9","slow_id":"d9dd839e41ee107a0d027de8a56aa28aa8a95b21baa39ccd9122779eecd06554","slow_time":0.1495053314,"speedup":2.0493074548687518,"stratum":"2-4","sampling_key":"2b87b449a0e4e21c29c74bf15b1ff14af016b3e22445aaa7ab5a63dfb72911c7","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)\n\n#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)\n\n#define REP(i, n) rep(i, 0, n)\n\n#define REP2(i, n) rep2(i, 0, n)\n\n#define all(hoge) (hoge).begin(), (hoge).end()\n\n#define en '\\n'\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\ntemplate <class T>\n\nusing vec = vector<T>;\n\ntemplate <class T>\n\nusing vvec = vector<vec<T>>;\n\ntypedef pair<ll, ll> P;\n\nconstexpr long long INF = 1LL << 60;\n\nconstexpr int INF_INT = 1 << 25;\n\nconstexpr long long MOD = (ll)1e9 + 7;\n\nusing ld = long double;\n\nstatic const ld pi = 3.141592653589793L;\n\ntypedef vector<ll> Array;\n\ntypedef vector<Array> Matrix;\n\ntemplate <class T>\n\ninline bool chmin(T &a, T b) {\n\n  if (a > b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <class T>\n\ninline bool chmax(T &a, T b) {\n\n  if (a < b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\nstruct Edge {\n\n  ll to, rev;\n\n  long double cap;\n\n  Edge(ll _to, long double _cap, ll _rev) {\n\n    to = _to;\n\n    cap = _cap;\n\n    rev = _rev;\n  }\n};\n\nusing Edges = vector<Edge>;\n\nusing Graph = vector<Edges>;\n\nvoid add_edge(Graph &G, ll from, ll to, long double cap, bool revFlag,\n\n              long double revCap) {\n\n  G[from].push_back(Edge(to, cap, (ll)G[to].size()));\n\n  if (revFlag)\n\n    G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\n}\n\nll mod_pow(ll x, ll n, ll mod) {\n\n  ll res = 1LL;\n\n  while (n > 0) {\n\n    if (n & 1)\n\n      res = res * x % mod;\n\n    x = x * x % mod;\n\n    n >>= 1;\n  }\n\n  return res;\n}\n\nll mod_inv(ll x, ll mod) { return mod_pow(x, mod - 2, mod); }\n\nll LagrangeInterpolation(vector<ll> y, ll t) {\n\n  int n = y.size() - 1;\n\n  if (t <= n)\n\n    return y[t];\n\n  ll fi = 1, ft = 1;\n\n  for (ll i = 0; i <= n; i++) {\n\n    if (i)\n\n      (fi *= MOD - i) %= MOD;\n\n    (ft *= t - i) %= MOD;\n  }\n\n  ll ret = 0;\n\n  for (ll i = 0; i <= n; i++) {\n\n    (ret += y[i] * ft % MOD * mod_inv(t - i, MOD) % MOD * mod_inv(fi, MOD) % MOD) %= MOD;\n\n    (fi *= (i + 1) * mod_inv(MOD - n + i, MOD) % MOD) %= MOD;\n  }\n\n  return ret;\n}\n\nll nCr(int n, int r) {\n\n  if (n < r)\n\n    return 0;\n\n  ll ret = 1;\n\n  REP(i, r) {\n\n    (ret *= n - i) %= MOD;\n\n    (ret *= mod_inv(i + 1, MOD)) %= MOD;\n  }\n\n  return ret;\n}\n\nll f(int n) {\n\n  ll ret = 0;\n\n  REP(i, (n - 5) / 2 + 1) {\n\n    ret += nCr(i + 4, 4) * nCr(n - 2 * i + 5, 10) % MOD;\n\n    ret %= MOD;\n  }\n\n  return ret;\n}\n\nvoid solve() {\n\n  ll n;\n\n  cin >> n;\n\n  if (n < 5) {\n\n    cout << 0 << en;\n\n    return;\n  }\n\n  vec<ll> y(16);\n\n  REP(i, 16) { y[i] = f(2 * i + 5 + (n - 5) % 2); }\n\n  cout << LagrangeInterpolation(y, (n - 5) / 2) << en;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  ll t;\n\n  cin >> t;\n\n  while (t--)\n\n    solve();\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)\n\n#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)\n\n#define REP(i, n) rep(i, 0, n)\n\n#define REP2(i, n) rep2(i, 0, n)\n\n#define all(hoge) (hoge).begin(), (hoge).end()\n\n#define en '\\n'\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\ntemplate <class T>\n\nusing vec = vector<T>;\n\ntemplate <class T>\n\nusing vvec = vector<vec<T>>;\n\ntypedef pair<ll, ll> P;\n\nconstexpr long long INF = 1LL << 60;\n\nconstexpr int INF_INT = 1 << 25;\n\nconstexpr long long MOD = (ll)1e9 + 7;\n\nusing ld = long double;\n\nstatic const ld pi = 3.141592653589793L;\n\ntypedef vector<ll> Array;\n\ntypedef vector<Array> Matrix;\n\ntemplate <class T>\n\ninline bool chmin(T &a, T b) {\n\n  if (a > b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <class T>\n\ninline bool chmax(T &a, T b) {\n\n  if (a < b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\nstruct Edge {\n\n  ll to, rev;\n\n  long double cap;\n\n  Edge(ll _to, long double _cap, ll _rev) {\n\n    to = _to;\n\n    cap = _cap;\n\n    rev = _rev;\n  }\n};\n\nusing Edges = vector<Edge>;\n\nusing Graph = vector<Edges>;\n\nvoid add_edge(Graph &G, ll from, ll to, long double cap, bool revFlag,\n\n              long double revCap) {\n\n  G[from].push_back(Edge(to, cap, (ll)G[to].size()));\n\n  if (revFlag)\n\n    G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\n}\n\nll mod_pow(ll x, ll n, ll mod) {\n\n  ll res = 1LL;\n\n  while (n > 0) {\n\n    if (n & 1)\n\n      res = res * x % mod;\n\n    x = x * x % mod;\n\n    n >>= 1;\n  }\n\n  return res;\n}\n\nll mod_inv(ll x, ll mod) { return mod_pow(x, mod - 2, mod); }\n\nll nCr(int n, int r) {\n\n  if (n < r)\n\n    return 0;\n\n  ll ret = 1;\n\n  REP(i, r) {\n\n    (ret *= n - i) %= MOD;\n\n    (ret *= mod_inv(i + 1, MOD)) %= MOD;\n  }\n\n  return ret;\n}\n\nvoid solve() {\n\n  ll n;\n\n  cin >> n;\n\n  if (n < 5) {\n\n    cout << 0 << en;\n\n    return;\n  }\n\n  n -= 5;\n\n  ll ans = 0;\n\n  REP(i, 12) {\n\n    if (n < i or (n - i) % 2)\n\n      continue;\n\n    ans += nCr((n - i) / 2 + 15, 15) * nCr(11, i) % MOD;\n\n    ans %= MOD;\n  }\n\n  cout << ans << en;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  ll t;\n\n  cin >> t;\n\n  while (t--)\n\n    solve();\n\n  return 0;\n}\n"}
{"fast_code_id":"7471a1560fd289a123714449ef669cce77b6760f92b997e58a93dfc5de49dce3","fast_id":"70dc36f4524afd00ec731504d02271cdb07015722c8d53bbfa6c1391bb8bd1e9","fast_time":0.0568500072,"language":"cpp","measured_fast_code_id":"70dc36f4524afd00ec731504d02271cdb07015722c8d53bbfa6c1391bb8bd1e9","measured_slow_code_id":"8a24d70a850c4dd3c7c145870a9325ec772863995682149e052c99cf393126f9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_41998","problem_id":"p02633","slow_code_id":"a3de7fce0d95937247610c9af6e7c6952c8dbc3957f2b2af2020693a4c4f800d","slow_id":"8a24d70a850c4dd3c7c145870a9325ec772863995682149e052c99cf393126f9","slow_time":0.149187604,"speedup":2.6242319279776627,"stratum":"2-4","sampling_key":"19aeb0f25155804b8825fa0211099e07a6325d34a19e4a63829fe5fe987f58e7","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <cmath>\n\n#include <iomanip>\n\n#include <stack>\n\n#include <queue>\n\n#include <numeric>\n\n#include <map>\n\n#include <unordered_map>\n\n#include <set>\n\n#include <fstream>\n\n#include <chrono>\n\n#include <random>\n\n#include <bitset>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define all(x) x.begin(), x.end()\n\n#define rall(x) x.rbegin(), x.rend()\n\n#define sz(x) ((int)(x).size())\n\n#define pb push_back\n\nusing ll = long long;\n\nusing namespace std;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\n\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n\nint main() {\n\n  int t;\n  cin >> t;\n\n  int output;\n\n  for (int X = 1; X <= 179; X++) {\n\n    double px = 0, py = 0;\n\n    int ans = 0;\n\n    double deg = X;\n\n    do {\n\n      px += cos(deg * 2 * acos(-1) / 360);\n\n      py += sin(deg * 2 * acos(-1) / 360);\n\n      deg += X;\n\n      ans++;\n\n    } while (abs(px) > 0.00001 || abs(py) > 0.00001);\n\n    int ans2 = 0;\n\n    int now = 0;\n\n    rep(i, 1000) {\n\n      now += X;\n\n      ans2++;\n\n      if (now % 360 == 0)\n        break;\n    }\n\n    if (ans ^ ans2)\n      cout << \"!\";\n\n    if (X == t)\n      output = ans;\n  }\n\n  cout << output << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <cmath>\n\n#include <iomanip>\n\n#include <stack>\n\n#include <queue>\n\n#include <numeric>\n\n#include <map>\n\n#include <unordered_map>\n\n#include <set>\n\n#include <fstream>\n\n#include <chrono>\n\n#include <random>\n\n#include <bitset>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define all(x) x.begin(), x.end()\n\n#define rall(x) x.rbegin(), x.rend()\n\n#define sz(x) ((int)(x).size())\n\n#define pb push_back\n\nusing ll = long long;\n\nusing namespace std;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\n\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n\nint main() {\n\n  int X;\n  cin >> X;\n\n  int now = 0;\n\n  int ans = 0;\n\n  rep(i, 1000) {\n\n    now += X;\n\n    ans++;\n\n    if (now % 360 == 0)\n      break;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"1fd7ebac1c605ee9a4d423b677918bdf4eff20e4547c1e7c534dd3b04178aaab","fast_id":"e4a91f5d6bff623be898f0d16e0538bd2d227a85cd31cf58c8b6e90579543cdb","fast_time":0.0101254262,"language":"cpp","measured_fast_code_id":"e4a91f5d6bff623be898f0d16e0538bd2d227a85cd31cf58c8b6e90579543cdb","measured_slow_code_id":"83a564a13e3187e34da142724214b8b265583aa583653dc69c4e1151805ddf62","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42087","problem_id":"p02679","slow_code_id":"248e2a2d1a06abd5f2440966fa61621043ebfb82e8f5a22185b61ff3937346a1","slow_id":"83a564a13e3187e34da142724214b8b265583aa583653dc69c4e1151805ddf62","slow_time":0.3037888645,"speedup":30.0025755459064,"stratum":"8+","sampling_key":"247b0371611fa15e6ac733e30781162b187b6419b236b1e65cf5fdaa7151c15b","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx2\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int mod = 1e9 + 7;\n\nconstexpr ll modpow(ll A, ll B) {\n\n  ll kotae = 1;\n\n  while (B > 0) {\n\n    if (B & 1)\n      kotae = kotae * A % mod;\n\n    A = A * A % mod;\n\n    B >>= 1;\n  }\n\n  return kotae;\n}\n\nint gcd3(int A, int B) {\n\n  if (B == 0)\n    return A;\n\n  else\n    return gcd3(B, A % B);\n}\n\nll gcd2(ll A, ll B) {\n\n  if (B == 0)\n    return A;\n\n  ll k = A - ll(double(A) / B) * B;\n\n  if (B < 2e9)\n    return gcd3(B, k);\n\n  else\n    return gcd2(B, k);\n}\n\nll gcd(ll A, ll B) {\n\n  if (B == 0)\n    return A;\n\n  if (B < 2e9)\n    return gcd3(B, A % B);\n\n  if (B < 2e15)\n    return gcd2(B, A % B);\n\n  else\n    return gcd(B, A % B);\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  pair<ll, ll> AB[200200], BA[200200];\n\n  int a0 = 0, b0 = 0;\n\n  int ab00 = 0;\n\n  int ka = 0, kb = 0;\n\n  rep(i, N) {\n\n    ll a, b;\n\n    cin >> a >> b;\n\n    if (a == 0 && b == 0) {\n\n      ab00++;\n\n      continue;\n    }\n\n    if (a == 0) {\n\n      a0++;\n\n      continue;\n    }\n\n    if (b == 0) {\n\n      b0++;\n\n      continue;\n    }\n\n    ll G = gcd(abs(a), abs(b));\n\n    a /= G;\n\n    b /= G;\n\n    if (a < 0) {\n\n      a = -a;\n\n      b = -b;\n    }\n\n    if (b > 0)\n      AB[ka++] = {a, b};\n\n    else\n      BA[kb++] = {-b, a};\n  }\n\n  ll kotae = 1;\n\n  sort(AB, AB + ka);\n\n  sort(BA, BA + kb);\n\n  BA[kb] = {2e18, 2e18};\n\n  pair<ll, ll> mae = AB[0];\n\n  int p = 0;\n\n  int kA = 0;\n\n  rep(i, ka) {\n\n    ll a = AB[i].first;\n\n    ll b = AB[i].second;\n\n    if (mae != AB[i]) {\n\n      int tmp = 0;\n\n      pair<ll, ll> mae2 = BA[p];\n\n      int kB = 0;\n\n      while (p < kb && BA[p] <= mae) {\n\n        if (mae2 != BA[p]) {\n\n          kotae = kotae * modpow(2, kB) % mod;\n\n          mae2 = BA[p];\n\n          kB = 1;\n\n        }\n\n        else\n          kB++;\n\n        p++;\n      }\n\n      if (mae == mae2) {\n\n        tmp = kB;\n\n      }\n\n      else {\n\n        kotae = kotae * modpow(2, kB) % mod;\n      }\n\n      if (tmp) {\n\n        kotae = kotae * (modpow(2, kA) + modpow(2, kB) - 1) % mod;\n\n      }\n\n      else {\n\n        kotae = kotae * modpow(2, kA) % mod;\n      }\n\n      mae = AB[i];\n\n      kA = 1;\n\n    }\n\n    else\n      kA++;\n  }\n\n  int tmp = 0;\n\n  pair<ll, ll> mae2 = BA[p];\n\n  int kB = 0;\n\n  while (p < kb) {\n\n    if (mae2 != BA[p]) {\n\n      if (AB[ka - 1] == mae2) {\n\n        tmp = kB;\n\n      }\n\n      else {\n\n        kotae = kotae * modpow(2, kB) % mod;\n      }\n\n      mae2 = BA[p];\n\n      kB = 1;\n\n    }\n\n    else\n      kB++;\n\n    p++;\n  }\n\n  if (AB[ka - 1] == mae2) {\n\n    tmp = kB;\n\n  }\n\n  else {\n\n    kotae = kotae * modpow(2, kB) % mod;\n  }\n\n  if (tmp) {\n\n    kotae = kotae * (modpow(2, kA) + modpow(2, kB) - 1) % mod;\n\n  }\n\n  else {\n\n    kotae = kotae * modpow(2, kA) % mod;\n  }\n\n  kotae = kotae * (modpow(2, a0) + modpow(2, b0) - 1) % mod;\n\n  co((kotae - 1 + ab00 + 2 * mod) % mod);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef __int128 lll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int mod = 1e9 + 7;\n\nconst int IMAX = 200000;\n\nconst int D[9] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000};\n\nclass unko {\n\npublic:\n  int f[IMAX + 1];\n\n  constexpr unko() : f() {\n\n    f[0] = 1;\n\n    rep1(i, IMAX) f[i] = ll(f[i - 1]) * 2 % mod;\n  }\n\n} f;\n\nvoid pakuri_sort(int N, ull A[]) {\n\n  const int b = 8;\n\n  ull tmp[200001];\n\n  rep(k, 8) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n  }\n}\n\nconst int CM = 1 << 17, CL = 22;\n\nchar cn[CM + CL], *ci = cn + CM + CL, *owa = cn + CM, ct;\n\nconst ll ma0 = 1157442765409226768;\n\nconst ll ma1 = 1085102592571150095;\n\nconst ll ma2 = 71777214294589695;\n\nconst ll ma3 = 281470681808895;\n\nconst ll ma4 = 4294967295;\n\ninline ll getint() {\n\n  if (ci - owa > 0) {\n\n    memcpy(cn, owa, CL);\n\n    ci -= CM;\n\n    fread(cn + CL, 1, CM, stdin);\n  }\n\n  int pn = 1;\n\n  if (*ci == '-') {\n\n    pn = -pn;\n\n    ci++;\n  }\n\n  ll tmp = *(ll *)ci;\n\n  int dig = ((tmp & ma0) ^ ma0) ? 68 - __builtin_ctzll((tmp & ma0) ^ ma0) : 0;\n\n  tmp = tmp << dig & ma1;\n\n  tmp = tmp * 10 + (tmp >> 8) & ma2;\n\n  tmp = tmp * 100 + (tmp >> 16) & ma3;\n\n  tmp = tmp * 10000 + (tmp >> 32) & ma4;\n\n  ci += (64 - dig >> 3);\n\n  ll tmp2 = *(ll *)ci;\n\n  dig = ((tmp2 & ma0) ^ ma0) ? 68 - __builtin_ctzll((tmp2 & ma0) ^ ma0) : 0;\n\n  tmp2 = dig == 64 ? 0 : tmp2 << dig & ma1;\n\n  tmp2 = tmp2 * 10 + (tmp2 >> 8) & ma2;\n\n  tmp2 = tmp2 * 100 + (tmp2 >> 16) & ma3;\n\n  tmp2 = tmp2 * 10000 + (tmp2 >> 32) & ma4;\n\n  int d = (64 - dig >> 3);\n\n  tmp = tmp * D[d] + tmp2;\n\n  ci += d;\n\n  while ((ct = *ci++) >= '0')\n    tmp = tmp * 10 + ct - '0';\n\n  return pn * tmp;\n}\n\nconst ull ma = (1ull << 52) - 1;\n\nint main() {\n\n  int N = getint();\n\n  ull AB[200001];\n\n  int a0 = 0, b0 = 0;\n\n  int ab00 = 0;\n\n  int n = 0;\n\n  rep(i, N) {\n\n    ll a = getint(), b = getint();\n\n    if (a == 0 && b == 0) {\n\n      ab00++;\n\n      continue;\n    }\n\n    if (a == 0) {\n\n      a0++;\n\n      continue;\n    }\n\n    if (b == 0) {\n\n      b0++;\n\n      continue;\n    }\n\n    if (a < 0) {\n\n      a = -a;\n\n      b = -b;\n    }\n\n    bool p = (b > 0);\n\n    if (!p) {\n\n      b = -b;\n\n      swap(a, b);\n    }\n\n    ull tmp = 0;\n\n    rep(i, 3) {\n\n      tmp *= 3;\n\n      if (b) {\n\n        int k = __builtin_clzll(a) - __builtin_clzll(b);\n\n        if (k > 0)\n          a <<= k;\n\n        else\n          b <<= -k;\n\n        if (a > b) {\n\n          b <<= 1;\n\n          k--;\n        }\n\n        double d = double(b) / a;\n\n        ull tmp1 = *(ull *)&d;\n\n        ull c = tmp1 & ma | (1ull << 52);\n\n        lll sa = (lll(b) << 52) - lll(a) * c;\n\n        while (sa >= 0) {\n\n          sa -= a;\n\n          c++;\n        }\n\n        while (sa < 0) {\n\n          sa += a;\n\n          c--;\n        }\n\n        tmp += ull(k + 63) << 53 | c;\n\n        b = sa;\n      }\n    }\n\n    if (p)\n      AB[n++] = tmp << 1 | 1ull;\n\n    else\n      AB[n++] = tmp << 1;\n  }\n\n  pakuri_sort(n, AB);\n\n  ll kotae = 1;\n\n  ull mae = AB[0] >> 1;\n\n  int k1 = 0, k2 = 0;\n\n  rep(i, n) {\n\n    if (mae != AB[i] >> 1) {\n\n      kotae = kotae * (f.f[k1] + f.f[k2] - 1) % mod;\n\n      k1 = 0;\n\n      k2 = 0;\n\n      mae = AB[i] >> 1;\n    }\n\n    if (AB[i] & 1ull)\n      k1++;\n\n    else\n      k2++;\n  }\n\n  kotae = kotae * (f.f[k1] + f.f[k2] - 1) % mod;\n\n  kotae = kotae * (f.f[a0] + f.f[b0] - 1) % mod;\n\n  printf(\"%lld\\n\", (kotae - 1 + ab00 + mod) % mod);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"a355e575cb84cdf76519b82fd3703dfd5bd9a098cfc5fa78a20fd207c3223372","fast_id":"f28959edc4659dce9924217c58f3b7ffd39d64a71f43b07410d08855334ffaad","fast_time":0.0208269604,"language":"cpp","measured_fast_code_id":"f28959edc4659dce9924217c58f3b7ffd39d64a71f43b07410d08855334ffaad","measured_slow_code_id":"c2530054049a61651a8935bad29bd26f82904f048eeda7243f63e948c03b9e08","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42159","problem_id":"p00890","slow_code_id":"e79bdb69fabbcd8923c3b46ec1e58d1326500f6b8f0f625ac319a592de63decf","slow_id":"c2530054049a61651a8935bad29bd26f82904f048eeda7243f63e948c03b9e08","slow_time":0.0898224602,"speedup":4.312797377768097,"stratum":"4-8","sampling_key":"6ef129e6352280c7506cab00a8dd7eea946560fe5afb32661243ff653a7f2575","slow_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define INF (1 << 28)\n\nint N, M, C, u[2000], v[2000];\n\nint g[128][128], dp[1024][128];\n\nint main() {\n\n  for (;;) {\n\n    scanf(\"%d%d%d\", &N, &M, &C);\n\n    if (N == 0)\n      return 0;\n\n    memset(g, -1, sizeof(g));\n\n    rep(i, N) g[i][i] = 0;\n\n    rep(i, M) {\n\n      int w;\n\n      scanf(\"%d%d%d\", u + i, v + i, &w);\n\n      u[i]--, v[i]--;\n\n      g[u[i]][v[i]] = w;\n    }\n\n    rep(k, N) rep(i, N) if (g[i][k] != -1) rep(j, N) if (g[k][j] != -1) {\n\n      if (g[i][j] == -1 || g[i][j] > g[i][k] + g[k][j])\n        g[i][j] = g[i][k] + g[k][j];\n    }\n\n    memset(dp, -1, sizeof(dp));\n\n    rep(i, N) dp[0][i] = g[0][i];\n\n    rep(k, M + 1) {\n\n      if (dp[k][N - 1] <= C) {\n\n        printf(\"%d\\n\", k);\n\n        break;\n      }\n\n      rep(i, M) if (dp[k][u[i]] != -1) rep(j, N) if (g[v[i]][j] != -1) {\n\n        if (dp[k + 1][j] == -1 || dp[k + 1][j] > dp[k][u[i]] + g[v[i]][j]) {\n\n          dp[k + 1][j] = dp[k][u[i]] + g[v[i]][j];\n        }\n      }\n    }\n  }\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define INF (1 << 28)\n\nint N, M, C, u[2000], v[2000];\n\nint g[128][128], dp[2][128];\n\nint main() {\n\n  for (;;) {\n\n    scanf(\"%d%d%d\", &N, &M, &C);\n\n    if (N == 0)\n      return 0;\n\n    rep(i, N) rep(j, N) g[i][j] = i == j ? 0 : INF;\n\n    rep(i, M) {\n\n      int w;\n\n      scanf(\"%d%d%d\", u + i, v + i, &w);\n\n      u[i]--, v[i]--;\n\n      g[u[i]][v[i]] = w;\n    }\n\n    rep(k, N) rep(i, N) rep(j, N) g[i][j] = min(g[i][j], g[i][k] + g[k][j]);\n\n    int *cur = dp[0], *nxt = dp[1];\n\n    rep(i, N) cur[i] = g[0][i];\n\n    rep(e, M + 1) {\n\n      if (cur[N - 1] <= C) {\n\n        printf(\"%d\\n\", e);\n\n        break;\n      }\n\n      rep(i, N) nxt[i] = cur[i];\n\n      rep(i, M) rep(j, N) nxt[j] = min(nxt[j], cur[u[i]] + g[v[i]][j]);\n\n      swap(cur, nxt);\n    }\n  }\n}"}
{"fast_code_id":"467bf075b6c92871f9aecab74950b08ba880cce30b6a806049605e5fc5a28a61","fast_id":"60a0a82a6a0638628295fa9c40df660c6305711ac89edf7b1c6c26d14e5826a4","fast_time":0.0082200227,"language":"cpp","measured_fast_code_id":"60a0a82a6a0638628295fa9c40df660c6305711ac89edf7b1c6c26d14e5826a4","measured_slow_code_id":"97286845c4190f0bb4be20d77c6822083b550fc4fe211bf1873c24d3053eec39","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42163","problem_id":"p02577","slow_code_id":"df91cf986e842166d5b80f2394ea7d3390cca3b03b7d23d87cc3bc313950bb4e","slow_id":"97286845c4190f0bb4be20d77c6822083b550fc4fe211bf1873c24d3053eec39","slow_time":0.039528328,"speedup":4.808785747027195,"stratum":"4-8","sampling_key":"01069bb090bfcf1ede431df55c112d736ef15638a1ab9dee0d49d35e0fc9e6af","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  long long s = 0, i;\n\n  string x;\n\n  cin >> x;\n\n  for (i = 0; i < x.size(); i++)\n\n  {\n\n    s += (x[i] - '0');\n\n    s %= 9;\n  }\n\n  if (s % 9 == 0)\n\n    cout << \"Yes\";\n\n  else\n\n    cout << \"No\";\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\nint main()\n\n{\n\n  char s[1000000];\n\n  long long int i, j, p = 0, a, k;\n\n  scanf(\"%s\", s);\n\n  a = strlen(s);\n\n  for (i = 0; i < a; i++)\n\n  {\n\n    p = p + (s[i] - '0');\n\n    p = p % 9;\n  }\n\n  if (p % 9 == 0)\n\n    printf(\"Yes\\n\");\n\n  else\n\n    printf(\"No\\n\");\n\n  return 0;\n}\n"}
{"fast_code_id":"75a020c52e965493f6f12b122c60a0fd61796e4ca8b1dfb80eb65885d919670b","fast_id":"26e4a10a845890bfcb793ff25f465b68c5b9af6979f5a862e49ff2dcbdd841fd","fast_time":0.0010152268,"language":"cpp","measured_fast_code_id":"26e4a10a845890bfcb793ff25f465b68c5b9af6979f5a862e49ff2dcbdd841fd","measured_slow_code_id":"62809293b847c9cc623d2310db7bffc3e08be84ea591d58f83556f13a82ede6a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4225","problem_id":"p03715","slow_code_id":"d2853b4d1d94b42045f9f17aea3bcde1510570ace66c40d677b40e958c20902d","slow_id":"62809293b847c9cc623d2310db7bffc3e08be84ea591d58f83556f13a82ede6a","slow_time":0.0036118491,"speedup":3.5576770628986547,"stratum":"2-4","sampling_key":"a8f59307bab04ce311316a919f829cc7847b83cb9b91d981ccdfe4e88c7807ed","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <iomanip>\n\n#include <vector>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <utility>\n\n#include <functional>\n\n#include <deque>\n\n#include <cctype>\n\n#include <stack>\n\n#include <bitset>\n\nusing ll = long long;\n\ntypedef unsigned long long ull;\n\ntypedef std::pair<ll, ll> P;\n\nll gcd(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  return gcd(b, a % b);\n}\n\nll lcm(ll a, ll b) {\n\n  ll g = gcd(a, b);\n\n  return a / g * b;\n}\n\nconst ll mod = 1000000007;\n\nconst ll INF = 1 << 30;\n\nconst ll INF2 = 9000000000000000000LL;\n\nbool fl = true;\n\nint dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nstd::string abc = \"abcdefghijklmnopqrstuvwxyz\";\n\nstruct edge {\n  ll to, cost;\n};\n\nstruct edge1 {\n  ll from, to, cost;\n};\n\ndouble pai = 3.141592653589793;\n\nstd::vector<P> v[100010];\n\nint main() {\n\n  ll h, w, ans = INF2;\n\n  std::cin >> h >> w;\n\n  if (h % 3 == 0 || w % 3 == 0) {\n\n    std::cout << 0 << std::endl;\n\n    exit(0);\n  }\n\n  if (h == 2 && w == 2)\n    ans = 1;\n\n  for (int i = 1; i < w - 1; i++) {\n\n    ll a, b, c, max = 0, min = INF;\n\n    a = h * i;\n\n    b = h * ((w - i) / 2);\n\n    c = h * (w - (i + (w - i) / 2));\n\n    max = std::max(a, std::max(b, c));\n\n    min = std::min(a, std::min(b, c));\n\n    ans = std::min(max - min, ans);\n  }\n\n  for (int i = 1; i < w - 1; i++) {\n\n    ll a, b, c, max = 0, min = INF;\n\n    a = h * i;\n\n    b = (w - i) * (h / 2);\n\n    c = (w - i) * (h - h / 2);\n\n    max = std::max(a, std::max(b, c));\n\n    min = std::min(a, std::min(b, c));\n\n    ans = std::min(max - min, ans);\n  }\n\n  for (int i = 1; i < h - 1; i++) {\n\n    ll a, b, c, max = 0, min = INF;\n\n    a = w * i;\n\n    b = w * ((h - i) / 2);\n\n    c = w * (h - (i + (h - i) / 2));\n\n    max = std::max(a, std::max(b, c));\n\n    min = std::min(a, std::min(b, c));\n\n    ans = std::min(max - min, ans);\n  }\n\n  for (int i = 1; i < h - 1; i++) {\n\n    ll a, b, c, max = 0, min = INF;\n\n    a = w * i;\n\n    b = (h - i) * (w / 2);\n\n    c = (h - i) * (w - w / 2);\n\n    max = std::max(a, std::max(b, c));\n\n    min = std::min(a, std::min(b, c));\n\n    ans = std::min(max - min, ans);\n  }\n\n  std::cout << ans << std::endl;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <map>\n\n#include <vector>\n\n#include <queue>\n\n#include <functional>\n\n#include <string>\n\n#include <stack>\n\n#include <set>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <limits>\n\n#include <cstring>\n\nusing namespace std;\n\nusing ll = long long;\n\ntypedef unsigned long long ull;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<double, double> pd;\n\ntypedef pair<string, string> sP;\n\ntypedef pair<ll, P> PP;\n\ntypedef pair<P, P> PPP;\n\nconst ll MOD = 1e9 + 7;\n\nconst ll MOD2 = 998244353;\n\nconst ll INF = 1 << 30;\n\nconst ll INF2 = 9e18;\n\nconst double INF3 = 5e14;\n\nconst double eps = 1e-10;\n\nconst double PI = acos(-1);\n\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nconst int tx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}, ty[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define ALLR(x) (x).rbegin(), (x).rend()\n\n#define pb push_back\n\n#define eb emplace_back\n\n#define fr first\n\n#define sc second\n\nll h, w, ans = INF2;\n\nint main() {\n\n  cin >> h >> w;\n\n  if (h % 3 == 0 || w % 3 == 0) {\n\n    cout << 0 << endl;\n\n    return 0;\n  }\n\n  ans = min(h, w);\n\n  for (int i = 1; i < h; i++) {\n\n    ll tp = i * w, l = (h - i) * (w / 2), r = (h - i) * (w - w / 2);\n\n    ans = min(ans, max({tp, l, r}) - min({tp, l, r}));\n  }\n\n  for (int i = 1; i < w; i++) {\n\n    ll tp = i * h, l = (w - i) * (h / 2), r = (w - i) * (h - h / 2);\n\n    ans = min(ans, max({tp, l, r}) - min({tp, l, r}));\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"6218e83cc842e09438a51715e93ac52828013e6fcc93117dea7913b48e48983a","fast_id":"45d72a66dc68a1fa3892b11a66db4e529664c74961735b11f3b9adfae242b5da","fast_time":0.1072161359,"language":"cpp","measured_fast_code_id":"45d72a66dc68a1fa3892b11a66db4e529664c74961735b11f3b9adfae242b5da","measured_slow_code_id":"412cfa4814d81f20e1e2a9422f5099fced93896402ea750a364f7ed15ac727ce","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42279","problem_id":"p02923","slow_code_id":"fd023d49069573066641d074dfaf9d5c730334446fcd2d6be50687facd333a92","slow_id":"412cfa4814d81f20e1e2a9422f5099fced93896402ea750a364f7ed15ac727ce","slow_time":0.3749140126,"speedup":3.496805862782451,"stratum":"2-4","sampling_key":"d97f1953bffd51d40e3f67ea99d3c722a0ad0a0415499c04a7284005c88288e0","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int inf = 1e5 + 5;\n\ntypedef long long ll;\n\nint n, m;\n\nbool vis[100005];\n\nvector<int> v[100005];\n\nint main()\n\n{\n\n  cin >> n;\n\n  int a[n + 1];\n\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n\n  int ans = 0;\n\n  int k = 0;\n\n  for (int i = 1; i < n; i++) {\n\n    if (a[i] > a[i - 1]) {\n\n      k = i;\n    }\n\n    ans = max(ans, i - k);\n  }\n\n  cout << ans;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\n#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size() - 1));\n\nusing namespace __gnu_pbds;\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;\n\nstring text = \"abcdefghijklmnopqrstuvwxyz\";\n\nconst int maxn = 1e6 + 7;\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  ll n;\n\n  cin >> n;\n\n  ll a[n + 2];\n\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n\n  ll cnt = 1;\n\n  ll mx = -1;\n\n  for (int i = 1; i < n; i++) {\n\n    if (a[i] <= a[i - 1])\n      cnt++;\n\n    else {\n\n      mx = max(mx, cnt);\n\n      cnt = 1;\n    }\n  }\n\n  mx = max(mx, cnt);\n\n  if (mx == -1)\n    cout << 0 << endl;\n\n  else\n    cout << mx - 1 << endl;\n}\n"}
{"fast_code_id":"96f1b1e8126a8b9185a244caafafbc2df24b2a7269eb0724ade646ddfefe78e8","fast_id":"5383c8999796bcc5c893c22a3822b702d8fa4cdbb1bc2ed4f7cf2c79c4b26864","fast_time":0.0026624066,"language":"cpp","measured_fast_code_id":"5383c8999796bcc5c893c22a3822b702d8fa4cdbb1bc2ed4f7cf2c79c4b26864","measured_slow_code_id":"330a5314135128b7d488f9c48e23bf3ccb47e0e6c2b7a9ce2976e36d5cc407f7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4230","problem_id":"p03090","slow_code_id":"16df4303ee23f7542b61a29723ba390a325a2a06cc68ff29bbc809433805bb20","slow_id":"330a5314135128b7d488f9c48e23bf3ccb47e0e6c2b7a9ce2976e36d5cc407f7","slow_time":0.0131697497,"speedup":4.946558388189092,"stratum":"4-8","sampling_key":"61e679d0cc0bdc12e0a1b77e8b20b421d103885a748c603c384addaabb3daf2e","slow_code":"#include <cstdio>\n\n#include <vector>\n\nusing namespace std;\n\nint n;\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  int x = (n & 1) ? n : (n + 1);\n\n  vector<pair<int, int>> edges;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    for (int j = i + 1; j <= n; j++)\n\n    {\n\n      if (i + j != x)\n\n      {\n\n        edges.push_back(make_pair(i, j));\n      }\n    }\n  }\n\n  printf(\"%d\\n\", edges.size());\n\n  for (auto &p : edges)\n    printf(\"%d %d\\n\", p.first, p.second);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\nint n, ans;\nlong long t, f[233];\nchar a[1200][2];\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  if (n & 1) {\n\n    for (int i = 1; i <= n; i++)\n\n      for (int j = i + 1; j <= n; j++)\n\n        if (i + j != n)\n          ans++;\n    printf(\"%d\\n\", ans);\n\n    for (int i = 1; i <= n; i++)\n\n      for (int j = i + 1; j <= n; j++)\n\n        if (i + j != n)\n\n          printf(\"%d %d\\n\", i, j);\n\n  }\n\n  else {\n\n    for (int i = 1; i <= n; i++)\n\n      for (int j = i + 1; j <= n; j++)\n\n        if (i + j != n + 1)\n          ans++;\n    printf(\"%d\\n\", ans);\n\n    for (int i = 1; i <= n; i++)\n\n      for (int j = i + 1; j <= n; j++)\n\n        if (i + j != n + 1)\n          printf(\"%d %d\\n\", i, j);\n  }\n}\n"}
{"fast_code_id":"db5b087803223f98a9bbf7ec783df0276c5d9095a169026e91b0566c8789971f","fast_id":"10efea2ce5840a1ed7199d411c3cb0377e0449ac214be9a96ab42d5191380a16","fast_time":0.04533554,"language":"cpp","measured_fast_code_id":"10efea2ce5840a1ed7199d411c3cb0377e0449ac214be9a96ab42d5191380a16","measured_slow_code_id":"786e42fa23513a8f68c2c3f10ae2dc8c02ebc978f249d5c6e61ec300a3dab606","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42301","problem_id":"p03338","slow_code_id":"4cb2db77fbda1abc08f326c25d505eb9d1efa6a4c32c132da9d140bf214250b6","slow_id":"786e42fa23513a8f68c2c3f10ae2dc8c02ebc978f249d5c6e61ec300a3dab606","slow_time":0.0910552034,"speedup":2.008472897863354,"stratum":"2-4","sampling_key":"44f54a2b5d626e99e5f4238d62bd8a14a420bc8afdf4907f9d02215b1f14f3ce","slow_code":"#include <algorithm>\n\n#include <iostream>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <vector>\n\n#define rep(i, f, n) for (int i = (f); i < (int)(n); i++)\n\n#define repe(i, f, n) for (int i = (f); i <= (int)(n); i++)\n\nusing namespace std;\n\nusing ll = long long;\n\nusing pint = pair<int, int>;\n\nconst int INF = 1001001001;\n\nint f(string s) {\n\n  set<char> ss;\n\n  for (auto c : s)\n    ss.insert(c);\n\n  return ss.size();\n}\n\nint main() {\n\n  int N;\n\n  string S;\n\n  cin >> N >> S;\n\n  int ans = 0;\n\n  rep(i, 0, N) {\n\n    rep(j, 1, N) {\n\n      set<string> sx, sy;\n\n      string x = S.substr(0, j);\n\n      string y = S.substr(j, S.size());\n\n      int cnt = 0;\n\n      rep(k, 0, 26) {\n\n        char c = 'a' + k;\n\n        if (x.find_first_of(c) == string::npos ||\n\n            y.find_first_of(c) == string::npos)\n\n          continue;\n\n        cnt++;\n      }\n\n      ans = max(ans, cnt);\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <algorithm>\n\n#include <iostream>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <vector>\n\n#define rep(i, f, n) for (int i = (f); i < (int)(n); i++)\n\n#define repe(i, f, n) for (int i = (f); i <= (int)(n); i++)\n\nusing namespace std;\n\nusing ll = long long;\n\nusing pint = pair<int, int>;\n\nconst int INF = 1001001001;\n\nint main() {\n\n  int N;\n\n  string S;\n\n  cin >> N >> S;\n\n  int ans = 0;\n\n  rep(i, 1, N) {\n\n    int cnt = 0;\n\n    for (char c = 'a'; c <= 'z'; c++) {\n\n      bool left = false, right = false;\n\n      rep(j, 0, i) if (S[j] == c) left = true;\n\n      rep(j, i, N) if (S[j] == c) right = true;\n\n      if (left && right)\n        cnt++;\n    }\n\n    ans = max(ans, cnt);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"dfa4b5e24f7746fc2f30c1afb26590a65554d36b5606c16eabda866f12aecaa7","fast_id":"5aa25c5fae9d69fa31b800a2ca375ecceb5559a0047aad20b6cd91d6714f1f9e","fast_time":0.0150192162,"language":"cpp","measured_fast_code_id":"5aa25c5fae9d69fa31b800a2ca375ecceb5559a0047aad20b6cd91d6714f1f9e","measured_slow_code_id":"9404124915b6a28ef8e4a5f9bde643cb6de4de6deb3c67f99e5069b931801c2c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42353","problem_id":"p03994","slow_code_id":"7e2928cafd7811cf9f325ed8eac7b2be5c8c88ba073bf98ba27b8a587b4737e4","slow_id":"9404124915b6a28ef8e4a5f9bde643cb6de4de6deb3c67f99e5069b931801c2c","slow_time":0.0884315941,"speedup":5.887896739911102,"stratum":"4-8","sampling_key":"c21d267f930e544364c0d984630039e4f6e173decaaf8627cb7aac080948d034","slow_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int MAXN = 1e5;\n\nchar s[MAXN + 5], ans[MAXN + 5];\n\nLL a[MAXN + 5], b[MAXN + 5];\n\nbool q = 0;\n\nLL sum = 0, k = 0;\n\nint main() {\n\n  memset(s, 0, sizeof(s));\n\n  cin >> s + 1;\n\n  cin >> k;\n\n  int len = strlen(s + 1);\n\n  for (int i = 1; i <= len; i++) {\n\n    a[i] = (LL)s[i];\n  }\n\n  for (int i = 1; i <= len; i++) {\n\n    if (k == 0)\n      break;\n\n    if (a[i] == 97)\n      continue;\n\n    else {\n\n      if (a[i] + k > 122) {\n\n        k = k - (122 - a[i] + 1);\n\n        a[i] = 97;\n      }\n    }\n  }\n\n  if (k > 0) {\n\n    if (k > 26)\n      k %= 26;\n\n    a[len] += k;\n\n    if (a[len] > 122) {\n\n      a[len] = 97 + a[len] - 122 - 1;\n    }\n  }\n\n  for (int i = 1; i <= len; i++) {\n\n    cout << (char)a[i];\n  }\n\n  cout << endl;\n}","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\nchar str[100005];\n\nint num[100005];\n\nint main()\n\n{\n\n  int k, i, j, min, bei;\n\n  scanf(\"%s\", str);\n\n  scanf(\"%d\", &k);\n\n  int len = strlen(str);\n\n  for (i = 0; i < len; i++)\n\n  {\n\n    if (str[i] == 'a')\n\n    {\n\n      num[i] = 0;\n\n      continue;\n    }\n\n    num[i] = 'z' - str[i] + 1;\n  }\n\n  for (i = 0; i < len; i++)\n\n  {\n\n    if (k == 0)\n\n      break;\n\n    if (i + 1 < len)\n\n    {\n\n      if (k >= num[i] && str[i] != 'a')\n\n      {\n\n        str[i] = 'a';\n\n        k -= num[i];\n      }\n\n    }\n\n    else\n\n    {\n\n      k = k % 26;\n\n      if (str[i] + k <= 'z')\n\n      {\n\n        str[i] = str[i] + k;\n\n      }\n\n      else\n\n      {\n\n        k = k - num[i];\n\n        str[i] = 'a';\n\n        str[i] = str[i] + k;\n      }\n\n      k = 0;\n    }\n  }\n\n  puts(str);\n\n  return 0;\n}\n"}
{"fast_code_id":"2239bd6885dd55418a61db80d197638d468a602470408eed078d28f0b86bf04b","fast_id":"1066ed02c9c4baecb27df088f6302684c7a73399678ea982459cec72ba07847f","fast_time":0.0705227901,"language":"cpp","measured_fast_code_id":"1066ed02c9c4baecb27df088f6302684c7a73399678ea982459cec72ba07847f","measured_slow_code_id":"94848a38a715eb6590326309190cc928664e53a0dfb43b34ff38acf1632b7deb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42357","problem_id":"p03205","slow_code_id":"25538e89be48acbe291dab56e0a8d581e447c05ad1ae4429092d0d92cc071df2","slow_id":"94848a38a715eb6590326309190cc928664e53a0dfb43b34ff38acf1632b7deb","slow_time":0.1720751727,"speedup":2.439993829739303,"stratum":"2-4","sampling_key":"3b667077874cf007f446553e4a4673f4c78fadbcb2dc55777ea32d4cd5bf9c4b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MAXN = 200100, MAXM = 1000100, INF = 0x3f3f3f3f;\n\nstruct Edge\n\n{\n\n  int to, val, nxt;\n\n  inline Edge() {}\n\n  inline Edge(register int to, register int val, register int nxt)\n      : to(to), val(val), nxt(nxt) {}\n};\n\nEdge e[MAXM];\n\nint head[MAXN], S, T, cnt = -1;\n\nint d[MAXN], cur[MAXN];\n\nint vis1[MAXN], vis2[MAXN], id[MAXN], nxt[MAXN];\n\nint N;\n\nqueue<int> q, q_;\n\nvector<int> bel[MAXN];\n\ninline void Addedge(register int x, register int y, register int z)\n\n{\n\n  e[++cnt] = Edge(y, z, head[x]), head[x] = cnt;\n\n  e[++cnt] = Edge(x, 0, head[y]), head[y] = cnt;\n\n  return;\n}\n\ninline bool bfs()\n\n{\n\n  while (!q.empty())\n    q.pop();\n\n  memset(d, -1, sizeof(d));\n\n  d[S] = 0, cur[S] = head[S], q.push(S);\n\n  while (!q.empty())\n\n  {\n\n    register int now = q.front();\n    q.pop();\n\n    for (register int i = head[now]; ~i; i = e[i].nxt)\n\n      if (e[i].val && (!(~d[e[i].to])))\n\n      {\n\n        register int to = e[i].to;\n\n        d[to] = d[now] + 1, cur[to] = head[to];\n\n        if (to == T)\n          return 1;\n\n        q.push(to);\n      }\n  }\n\n  return 0;\n}\n\ninline int dfs(register int now, register int num)\n\n{\n\n  if (now == T || !num)\n    return num;\n\n  register int ans = 0;\n\n  for (register int &i = cur[now]; ~i; i = e[i].nxt)\n\n    if (e[i].val && d[e[i].to] == d[now] + 1)\n\n    {\n\n      register int to = e[i].to;\n\n      register int f = dfs(to, min(num, e[i].val));\n\n      if (f)\n\n      {\n\n        e[i].val -= f, e[i ^ 1].val += f;\n\n        ans += f, num -= f;\n\n        if (!num)\n          break;\n      }\n    }\n\n  return ans;\n}\n\ninline int maxflow()\n\n{\n\n  register int ans = 0;\n\n  while (bfs())\n    ans += dfs(S, INF);\n\n  return ans;\n}\n\ninline bool solve(register int n)\n\n{\n\n  for (register int i = 1; i < n; i++)\n\n    for (register int j = head[n + i]; ~j; j = e[j].nxt)\n\n      if (e[j].to && !e[j].val)\n        id[i] = e[j].to, vis1[e[j].to] = 1;\n\n  for (register int i = 1; i <= n; i++)\n\n    if (!vis1[i])\n      q_.push(i);\n\n  register int cnt_ = 0;\n\n  while (!q_.empty())\n\n  {\n\n    register int now = q_.front();\n    q_.pop();\n\n    cnt_++;\n\n    for (register int i = 0; i < (int)bel[now].size(); i++)\n\n      if (!vis2[bel[now][i]])\n\n      {\n\n        register int to = bel[now][i];\n\n        vis2[to] = 1, nxt[to] = now, q_.push(id[to]);\n      }\n  }\n\n  return cnt_ == n;\n}\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n  memset(head, -1, sizeof(head));\n\n  cin >> N;\n\n  S = 0, T = N << 1;\n\n  for (register int i = 1, x, y; i < N; i++)\n\n  {\n\n    cin >> x;\n\n    Addedge(S, N + i, 1);\n\n    for (register int j = 1; j <= x; j++)\n      cin >> y, Addedge(N + i, y, 1), bel[y].push_back(i);\n  }\n\n  for (register int i = 1; i <= N; i++)\n    Addedge(i, T, 1);\n\n  if (maxflow() < N - 1)\n    return puts(\"-1\"), 0;\n\n  if (!solve(N))\n    return puts(\"-1\"), 0;\n\n  for (register int i = 1; i < N; i++)\n    cout << id[i] << \" \" << nxt[i] << \"\\n\";\n\n  cout << endl;\n\n  return 0;\n}","fast_code":"#include <queue>\n\n#include <cstdio>\n\n#include <cctype>\n\nconst int N = 100007;\n\nstd::vector<int> e[N];\nstd::queue<int> q;\n\nint vis[N], mat[N], tam[N];\n\nint read() {\n  int x = 0, c = getchar();\n  while (isspace(c))\n    c = getchar();\n  while (isdigit(c))\n    (x *= 10) += c & 15, c = getchar();\n  return x;\n}\n\nint dfs(int u, int root)\n\n{\n\n  for (int v : e[u])\n    if (vis[v] ^ root)\n      if (vis[v] = root, !mat[v] || dfs(mat[v], root))\n        return mat[v] = u;\n\n  return 0;\n}\n\nint main()\n\n{\n\n  int n = read();\n\n  for (int i = 1; i < n; ++i)\n    for (int j = read(); j; --j)\n      e[read()].push_back(i);\n\n  for (int i = 2; i <= n; ++i)\n    if (!dfs(i, i))\n      return puts(\"-1\"), 0;\n\n  q.push(1);\n\n  for (int i = 1, u; i <= n; ++i)\n\n  {\n\n    if (q.empty())\n      return puts(\"-1\"), 0;\n\n    u = q.front(), q.pop();\n\n    for (int v : e[u])\n      if (!tam[v])\n        tam[v] = u, q.push(mat[v]);\n  }\n\n  for (int i = 1; i < n; ++i)\n    printf(\"%d %d\\n\", tam[i], mat[i]);\n}\n"}
{"fast_code_id":"04113450844b57620104d4e276480f9fe3c87b89a6eab879e50f4a6ab6608a61","fast_id":"909c551b3e20c1e465c1c5f7e731ef0f51a5add2bfc56b5307cc9df1b94ee83d","fast_time":0.0036004466,"language":"cpp","measured_fast_code_id":"909c551b3e20c1e465c1c5f7e731ef0f51a5add2bfc56b5307cc9df1b94ee83d","measured_slow_code_id":"dd233936502f04df3d78444c8c0fc86508e6426ea3800ad01824ec8358aec345","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42379","problem_id":"p02972","slow_code_id":"2348d467f51d649ac7fe954f96e096c34858e918ac2c7924158958396d20826d","slow_id":"dd233936502f04df3d78444c8c0fc86508e6426ea3800ad01824ec8358aec345","slow_time":0.0361342218,"speedup":10.036038806963559,"stratum":"8+","sampling_key":"025e9f2830d5595d0b57a8b47eecf03e7476410c30aad29ac42463e9c910e93b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int A[200001];\n\n  rep1(i, N) cin >> A[i];\n\n  vector<int> kotae;\n\n  int B[200001] = {};\n\n  for (int i = N; i > 0; i--) {\n\n    if (A[i] != B[i]) {\n\n      cesp(i);\n\n      cesp(A[i]);\n\n      ce(B[i]);\n\n      kotae.pb(i);\n\n      int rt = sqrt(i);\n\n      rep1(j, rt) {\n\n        if (i % j == 0) {\n\n          B[j] ^= 1;\n\n          if (i != j * j)\n            B[i / j] ^= 1;\n        }\n      }\n    }\n  }\n\n  co(kotae.size());\n\n  rep1(i, kotae.size()) { cosp(kotae[kotae.size() - i]); }\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn;\n\ninline void putint(int X) {\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nbool b[200001];\n\nint main() {\n\n  char c;\n\n  int N = 0;\n\n  while ((c = getchar_unlocked()) >= '0')\n    N = N * 10 + c - '0';\n\n  bool a[200001];\n\n  rep1(i, N) {\n\n    a[i] = getchar_unlocked() - '0';\n\n    getchar_unlocked();\n  }\n\n  int kazu = 0;\n\n  for (int i = N; i > 0; i--) {\n\n    bool k = a[i];\n\n    for (int j = i + i; j <= N; j += i) {\n\n      k ^= b[j];\n    }\n\n    if (k) {\n\n      kazu++;\n\n      b[i] = true;\n    }\n  }\n\n  if (kazu == 0) {\n\n    *di++ = '0';\n\n    *di++ = '\\n';\n\n  }\n\n  else\n    putint(kazu);\n\n  rep1(i, N) {\n\n    if (b[i])\n      putint(i);\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"20d4e626abaef4bbb45b79c00c7de1aa446a2b915a7ec7e5d776698476bef215","fast_id":"462e8416a389e28b3fa0f548ebbcda979b42e05f75d6ab957b325dd9aaead6c4","fast_time":0.0924025334,"language":"cpp","measured_fast_code_id":"462e8416a389e28b3fa0f548ebbcda979b42e05f75d6ab957b325dd9aaead6c4","measured_slow_code_id":"d76a65cd5e5e4e55937c35e9e4b1a81b3d87c0660a4225d7e2413f662b3ba230","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42433","problem_id":"p03823","slow_code_id":"5a22d60561b42bb4f2b306db4bdf9cf6318130a52278ac40baf3a29c8c8e3ae0","slow_id":"d76a65cd5e5e4e55937c35e9e4b1a81b3d87c0660a4225d7e2413f662b3ba230","slow_time":0.2259901773,"speedup":2.44571408363572,"stratum":"2-4","sampling_key":"044f9cc649cc865fa5e0241897ea910db9fdf362843a034cb02cd8e6e717f34d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define fs first\n\n#define sc second\n\n#define pb push_back\n\n#define mp make_pair\n\n#define eb emplace_back\n\n#define ALL(A) A.begin(), A.end()\n\n#define RALL(A) A.rbegin(), A.rend()\n\ntypedef long long LL;\n\ntypedef pair<LL, LL> P;\n\nconst LL mod = 1000000007;\n\nconst LL LINF = 1LL << 60;\n\nconst int INF = 1 << 30;\n\nint dx[] = {1, 0, -1, 0};\n\nint dy[] = {0, 1, 0, -1};\n\ntemplate <int mod>\n\nstruct ModInt {\n\n  int x;\n\n  ModInt() : x(0) {}\n\n  ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n  ModInt &operator+=(const ModInt &p) {\n\n    if ((x += p.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  ModInt &operator-=(const ModInt &p) {\n\n    if ((x += mod - p.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  ModInt &operator*=(const ModInt &p) {\n\n    x = (int)(1LL * x * p.x % mod);\n\n    return *this;\n  }\n\n  ModInt &operator/=(const ModInt &p) {\n\n    *this *= p.inverse();\n\n    return *this;\n  }\n\n  ModInt operator-() const { return ModInt(-x); }\n\n  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\n  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\n  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\n  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\n  bool operator==(const ModInt &p) const { return x == p.x; }\n\n  bool operator!=(const ModInt &p) const { return x != p.x; }\n\n  ModInt inverse() const {\n\n    int a = x, b = mod, u = 1, v = 0, t;\n\n    while (b > 0) {\n\n      t = a / b;\n\n      a -= t * b;\n\n      swap(a, b);\n\n      u -= t * v;\n\n      swap(u, v);\n    }\n\n    return ModInt(u);\n  }\n\n  ModInt pow(int e) {\n\n    long long a = 1, p = x;\n\n    while (e > 0) {\n\n      if (e % 2 == 0) {\n        p = (p * p) % mod;\n        e /= 2;\n      }\n\n      else {\n        a = (a * p) % mod;\n        e--;\n      }\n    }\n\n    return ModInt(a);\n  }\n\n  friend ostream &operator<<(ostream &os, const ModInt<mod> &p) { return os << p.x; }\n\n  friend istream &operator>>(istream &is, ModInt<mod> &a) {\n\n    long long x;\n\n    is >> x;\n\n    a = ModInt<mod>(x);\n\n    return (is);\n  }\n};\n\nusing modint = ModInt<mod>;\n\nconst int M_N = 200000;\n\nstruct BIT {\n\n  int n;\n\n  modint bit[M_N + 1];\n\n  modint sum(int i) {\n\n    modint s = 0;\n\n    while (i > 0) {\n\n      s += bit[i];\n\n      i = i & (i - 1);\n    }\n\n    return s;\n  }\n\n  void add(int i, modint x) {\n\n    while (i <= n) {\n\n      bit[i] += x;\n\n      i += i & -i;\n    }\n  }\n};\n\nint main() {\n\n  int n;\n\n  LL A, B;\n\n  cin >> n >> A >> B;\n\n  vector<LL> s(n + 1, -LINF);\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> s[i + 1];\n  }\n\n  BIT bit[2];\n\n  bit[0].n = bit[1].n = n + 1;\n\n  bit[0].add(1, 1);\n\n  bit[1].add(1, 1);\n\n  int la = 1, lb = 1;\n\n  for (int i = 1; i < n; i++) {\n\n    auto x = upper_bound(ALL(s), s[i + 1] - A) - s.begin();\n\n    bit[0].add(i + 1, bit[1].sum(min(i, (int)x)));\n\n    auto y = upper_bound(ALL(s), s[i + 1] - B) - s.begin();\n\n    bit[1].add(i + 1, bit[0].sum(min(i, (int)y)));\n\n    if (s[i + 1] < s[i] + A) {\n\n      for (int j = la; j <= i; j++) {\n\n        bit[0].add(j, -bit[0].sum(j));\n      }\n\n      la = i + 1;\n    }\n\n    if (s[i + 1] < s[i] + B) {\n\n      for (int j = lb; j <= i; j++) {\n\n        bit[1].add(j, -bit[1].sum(j));\n      }\n\n      lb = i + 1;\n    }\n  }\n\n  cout << bit[0].sum(n + 1) + bit[1].sum(n + 1) << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define fs first\n\n#define sc second\n\n#define pb push_back\n\n#define mp make_pair\n\n#define eb emplace_back\n\n#define ALL(A) A.begin(), A.end()\n\n#define RALL(A) A.rbegin(), A.rend()\n\ntypedef long long LL;\n\ntypedef pair<LL, LL> P;\n\nconst LL mod = 1000000007;\n\nconst LL LINF = 1LL << 60;\n\nconst int INF = 1 << 30;\n\nint dx[] = {1, 0, -1, 0};\n\nint dy[] = {0, 1, 0, -1};\n\nconst int M_N = 200000;\n\nstruct BIT {\n\n  LL bit[M_N + 1], n;\n\n  LL sum(int i) {\n\n    LL s = 0;\n\n    while (i > 0) {\n\n      s = (s + bit[i]) % mod;\n\n      i = i & (i - 1);\n    }\n\n    return s;\n  }\n\n  void add(int i, LL x) {\n\n    x %= mod;\n\n    while (i <= n) {\n\n      bit[i] = (bit[i] + x) % mod;\n\n      i += i & -i;\n    }\n  }\n};\n\nint main() {\n\n  int n;\n\n  LL A, B;\n\n  cin >> n >> A >> B;\n\n  vector<LL> s(n + 1, -LINF);\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> s[i + 1];\n  }\n\n  BIT bit[2];\n\n  bit[0].n = bit[1].n = n + 1;\n\n  bit[0].add(1, 1);\n\n  bit[1].add(1, 1);\n\n  int la = 1, lb = 1;\n\n  for (int i = 1; i < n; i++) {\n\n    auto x = upper_bound(ALL(s), s[i + 1] - A) - s.begin();\n\n    bit[0].add(i + 1, bit[1].sum(min(i, (int)x)));\n\n    auto y = upper_bound(ALL(s), s[i + 1] - B) - s.begin();\n\n    bit[1].add(i + 1, bit[0].sum(min(i, (int)y)));\n\n    if (s[i + 1] < s[i] + A) {\n\n      for (int j = la; j <= i; j++) {\n\n        bit[0].add(j, mod - bit[0].sum(j) % mod);\n      }\n\n      la = i + 1;\n    }\n\n    if (s[i + 1] < s[i] + B) {\n\n      for (int j = lb; j <= i; j++) {\n\n        bit[1].add(j, mod - bit[1].sum(j) % mod);\n      }\n\n      lb = i + 1;\n    }\n  }\n\n  cout << (bit[0].sum(n + 1) + bit[1].sum(n + 1)) % mod << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"789cae0ef4429d06a894b98fa37e1d96455138653ce76fea0fbbaca43f1bcb54","fast_id":"35c087b74c3350266eaecd29b801e0411e56f30dec9761378b63cbdba1cba42e","fast_time":0.021100802,"language":"cpp","measured_fast_code_id":"35c087b74c3350266eaecd29b801e0411e56f30dec9761378b63cbdba1cba42e","measured_slow_code_id":"50e9a54c86e5f1ee3c074ad67b50902c5ce2749a64067eab78e366349bb390c8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42441","problem_id":"p01417","slow_code_id":"e00ed1375e30c352afec830ed238b892df6fd6d894e08322f22c19374fe98451","slow_id":"50e9a54c86e5f1ee3c074ad67b50902c5ce2749a64067eab78e366349bb390c8","slow_time":0.0936932222,"speedup":4.440268298806842,"stratum":"4-8","sampling_key":"39443c22ff2b934bb2298728b407150b651ef34d5de8cfcdace465891470f258","slow_code":"#include <cstdio>\n\n#include <vector>\n\n#include <cmath>\n\nusing namespace std;\n\nstruct node\n\n{\n\n  double x, y, z;\n};\n\nstruct node x[21];\n\nvector<double> a;\n\nint b[25], i, n, m, j;\n\ndouble d[21][21], maxx = 0, ans;\n\ndouble dis(int i, int j)\n\n{\n\n  return\n\n      ((x[i].x - x[j].x) * (x[i].x - x[j].x) + (x[i].y - x[j].y) * (x[i].y - x[j].y) +\n       (x[i].z - x[j].z) * (x[i].z - x[j].z));\n}\n\nvoid dfs(int v, int k)\n\n{\n\n  int x, i, j, t;\n\n  b[v] = 1;\n\n  if (k == m)\n\n  {\n\n    ans = 0;\n\n    for (i = 0; i < a.size(); i++)\n\n    {\n\n      x = a[i];\n\n      for (j = 0; j < a.size(); j++)\n\n        if (j != i)\n\n        {\n\n          t = a[j];\n\n          ans = ans + d[x][t];\n        }\n    }\n\n    if (ans / 2 > maxx)\n      maxx = ans / 2;\n\n    return;\n  }\n\n  a.push_back(v);\n  k++;\n\n  if (v + 1 <= n)\n    dfs(v + 1, k);\n\n  a.pop_back();\n  k--;\n\n  if (v + 1 <= n)\n    dfs(v + 1, k);\n\n  b[v] = 0;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (i = 0; i < n; i++)\n\n    scanf(\"%lf%lf%lf\", &x[i].x, &x[i].y, &x[i].z);\n\n  for (i = 0; i < n; i++)\n\n    for (j = 0; j < n; j++)\n\n      d[i][j] = dis(i, j);\n\n  dfs(0, 0);\n\n  printf(\"%lf\\n\", maxx);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\n#include <string.h>\n\n#define MAX 25\n\ndouble x[MAX], y[MAX], z[MAX], Dis[MAX][MAX], Max;\n\nint N, M, ipos[MAX];\n\ndouble dis(int n, int m)\n\n{\n\n  return pow(x[n] - x[m], 2) + pow(y[n] - y[m], 2) + pow(z[n] - z[m], 2);\n}\n\nvoid dfs(int cur, int count, double ans)\n\n{\n\n  double k = ans;\n\n  int i;\n\n  if (count == M)\n\n  {\n\n    if (Max < ans)\n\n      Max = ans;\n\n    return;\n  }\n\n  if (cur >= N)\n\n    return;\n\n  if (count > M)\n\n    return;\n\n  dfs(cur + 1, count, ans);\n\n  ipos[cur] = 1;\n\n  for (i = 0; i < cur; i++)\n\n  {\n\n    if (ipos[i] == 1)\n\n      k += Dis[i][cur];\n  }\n\n  dfs(cur + 1, count + 1, k);\n\n  ipos[cur] = 0;\n\n  return;\n}\n\nint main()\n\n{\n\n  int i, j;\n\n  while (scanf(\"%d%d\", &N, &M) != EOF)\n\n  {\n\n    for (i = 0; i < N; i++)\n\n      scanf(\"%lf%lf%lf\", &x[i], &y[i], &z[i]);\n\n    memset(Dis, 0, sizeof(Dis));\n\n    memset(ipos, 0, sizeof(ipos));\n\n    Max = 0;\n\n    for (i = 0; i < N; i++)\n\n      for (j = i + 1; j < N; j++)\n\n        Dis[i][j] = dis(i, j);\n\n    dfs(0, 0, 0);\n\n    printf(\"%.20lf\\n\", Max);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"a57fd98145cbd4839338ae92fd98575632b93077c056627a4e54d5d65be3e4c9","fast_id":"ff323e9a23841d207c212aa83534b00a52e4490a77f59bff1c9a5d8652c567d3","fast_time":0.0108493825,"language":"cpp","measured_fast_code_id":"ff323e9a23841d207c212aa83534b00a52e4490a77f59bff1c9a5d8652c567d3","measured_slow_code_id":"ec066b021210d2748c07f4a632697a8d6d6888fbc48841cd20ccefc3606b828d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_42505","problem_id":"p03989","slow_code_id":"2039af19ec975b400bf2388d16178e64c9db617403c19506d4e3a9cf0bc52724","slow_id":"ec066b021210d2748c07f4a632697a8d6d6888fbc48841cd20ccefc3606b828d","slow_time":0.0624897487,"speedup":5.7597516448516775,"stratum":"4-8","sampling_key":"292fa5bd176ef54c5fc4cee38129a24086e99d1a474eee59db6fe303164617db","slow_code":"#include <iostream>\n\n#include <sstream>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <string>\n\n#include <cstring>\n\n#include <bitset>\n\n#include <functional>\n\n#include <random>\n\n#define REP(i, a, n) for (int i = a; i <= n; ++i)\n\n#define PER(i, a, n) for (int i = n; i >= a; --i)\n\n#define hr putchar(10)\n\n#define pb push_back\n\n#define lc (o << 1)\n\n#define rc (lc | 1)\n\n#define mid ((l + r) >> 1)\n\n#define ls lc, l, mid\n\n#define rs rc, mid + 1, r\n\n#define x first\n\n#define y second\n\n#define io std::ios::sync_with_stdio(false)\n\n#define endl '\\n'\n\n#define DB(a)                                                                                      \\\n  ({                                                                                               \\\n    REP(__i, 1, n) cout << a[__i] << ',';                                                          \\\n    hr;                                                                                            \\\n  })\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 1e4 + 10, P = 924844033, G = 5, Gi = 554906420;\n\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\n\nll qpow(ll a, ll n) {\n  ll r = 1 % P;\n  for (a %= P; n; a = a * a % P, n >>= 1)\n    if (n & 1)\n      r = r * a % P;\n  return r;\n}\n\nll inv(ll x) { return x <= 1 ? 1 : inv(P % x) * (P - P / x) % P; }\n\nint lim, l, A[N], B[N], R[N];\n\nvoid init(int n) {\n\n  for (lim = 1, l = 0; lim <= n; lim <<= 1, ++l)\n    ;\n\n  REP(i, 0, lim - 1) R[i] = (R[i >> 1] >> 1) | ((i & 1) << (l - 1));\n}\n\nvoid NTT(int *J, int tp = 1) {\n\n  REP(i, 0, lim - 1) if (i < R[i]) swap(J[i], J[R[i]]);\n\n  for (int j = 1; j < lim; j <<= 1) {\n\n    ll T = qpow(tp == 1 ? G : Gi, (P - 1) / (j << 1));\n\n    for (int k = 0; k < lim; k += j << 1) {\n\n      ll t = 1;\n\n      for (int l = 0; l < j; ++l, t = t * T % P) {\n\n        int y = t * J[k + j + l] % P;\n\n        J[k + j + l] = (J[k + l] - y) % P;\n\n        J[k + l] = (J[k + l] + y) % P;\n      }\n    }\n  }\n\n  if (tp == -1) {\n\n    ll inv = qpow(lim, P - 2);\n\n    REP(i, 0, lim - 1) J[i] = (ll)inv * J[i] % P;\n  }\n}\n\nint n, k, fac[N], ifac[N], a[N], b[N];\n\nint C(int n, int m) {\n\n  if (m > n)\n    return 0;\n\n  return (ll)fac[n] * ifac[m] % P * ifac[n - m] % P;\n}\n\nint main() {\n\n  fac[0] = 1;\n\n  REP(i, 1, N - 1) fac[i] = (ll)fac[i - 1] * i % P;\n\n  ifac[N - 1] = inv(fac[N - 1]);\n\n  PER(i, 0, N - 2) ifac[i] = (ll)ifac[i + 1] * (i + 1) % P;\n\n  scanf(\"%d%d\", &n, &k);\n\n  REP(i, 0, n) a[i] = C(n / k - i, i), b[i] = C(n / k + 1 - i, i);\n\n  init(2 * n + 2);\n\n  NTT(a), NTT(b);\n\n  REP(i, 0, lim - 1) a[i] = qpow(a[i], (k - n % k) * 2) * qpow(b[i], n % k * 2) % P;\n\n  NTT(a, -1);\n\n  int ans = 0;\n\n  REP(i, 0, n) {\n\n    if (i & 1)\n      ans = (ans - (ll)a[i] * fac[n - i]) % P;\n\n    else\n      ans = (ans + (ll)a[i] * fac[n - i]) % P;\n  }\n\n  if (ans < 0)\n    ans += P;\n\n  printf(\"%d\\n\", ans);\n}\n","fast_code":"#include <cstdio>\n\n#define N 2002\n\n#define p 924844033\n\ninline int mod(int x) { return x < p ? x : x - p; }\n\nint a[N], f[N][2], i, j, m, n, s, x;\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m), f[0][0] = 1;\n\n  for (i = 1; i <= m; i++)\n\n  {\n\n    for (j = 0; j <= n; f[j++][0] = 0)\n      f[j][1] = mod(f[j][0] + f[j][1]);\n\n    for (s = (n - i) / m + 2 >> 1; s--;)\n\n      for (j = n; j--;)\n\n      {\n\n        f[j + 1][0] = mod(f[j + 1][0] + f[j][0]);\n\n        f[j + 1][1] = mod(f[j + 1][1] + mod(f[j][0] + f[j][1]));\n\n        f[j][0] = mod(f[j][0] + f[j][1]);\n\n        f[j][1] = 0;\n      }\n\n    if (~((n - i) / m) & 1)\n      for (j = 0; j <= n; j++)\n        f[j][1] = 0;\n  }\n\n  for (; i <= n && i <= m << 1; i++)\n\n  {\n\n    for (j = 0; j <= n; f[j++][1] = 0)\n      f[j][0] = mod(f[j][0] + f[j][1]);\n\n    for (s = (n - i) / m + 2 >> 1; s--;)\n\n      for (j = n; j--;)\n\n      {\n\n        f[j + 1][0] = mod(f[j + 1][0] + f[j][0]);\n\n        f[j + 1][1] = mod(f[j + 1][1] + mod(f[j][0] + f[j][1]));\n\n        f[j][0] = mod(f[j][0] + f[j][1]);\n\n        f[j][1] = 0;\n      }\n\n    if (~((n - i) / m) & 1)\n      for (j = 0; j <= n; j++)\n        f[j][1] = 0;\n  }\n\n  for (i = *a = 1; i <= n; i++)\n    a[i] = (long long)a[i - 1] * i % p;\n\n  for (i = 0; i <= n; i++)\n    x = i & 1 ? (x + (long long)(p - a[n - i]) * (f[i][0] + f[i][1])) % p\n              : (x + (long long)a[n - i] * (f[i][0] + f[i][1])) % p;\n\n  return 0 & printf(\"%d\\n\", x);\n}"}
{"fast_code_id":"e7943e398448ad36528c31e00cfcfc902a8078e29e13b0e0456b000a393b8032","fast_id":"36b8f38b509fe996885e60a2970600cb5160d4aa92924bd8650154c60e93b983","fast_time":0.1083149176,"language":"cpp","measured_fast_code_id":"36b8f38b509fe996885e60a2970600cb5160d4aa92924bd8650154c60e93b983","measured_slow_code_id":"14b874e058d731614c51660b0b7b3f467e4e4b103328c88999799828deec145d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4258","problem_id":"p02883","slow_code_id":"51b9182bf511632c764d3161d1e7d0cf049a9082a14e66e352b55e3dce72ded5","slow_id":"14b874e058d731614c51660b0b7b3f467e4e4b103328c88999799828deec145d","slow_time":0.4547054475,"speedup":4.197994676773867,"stratum":"4-8","sampling_key":"e9427dbfb876a9fbd34cdff76e03af890dc4db380179717907bcfad1158fc5be","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define FOR(i, a, b) for (ll i = a; i < b; i++)\n\n#define len(v) ll(v.size())\n\n#define fi first\n\n#define se second\n\ntemplate <class T>\n\nvoid cout_vec(const vector<T> &vec) {\n\n  for (auto itr : vec)\n    cout << itr << ' ';\n\n  cout << endl;\n}\n\ntemplate <class T>\n\nvoid cout_vec2(const vector<vector<T>> &vec) {\n\n  rep(i, vec.size()) {\n\n    rep(j, vec[i].size()) { cout << vec[i][j] << ' '; }\n\n    cout << endl;\n  }\n}\n\ntypedef pair<ll, ll> P;\n\nconst ll mod = 1e9 + 7;\n\nconst ll inf = 1e15;\n\nll n, k;\n\nvector<ll> a(200010), f(200010);\n\nbool solve(ll x) {\n\n  ll ret = k;\n\n  rep(i, n) {\n\n    if (a[i] * f[i] <= x)\n      continue;\n\n    ll now = (a[i] * f[i] - x + f[i] - 1) / f[i];\n\n    if (now <= ret)\n      ret -= now;\n\n    else {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> n >> k;\n\n  rep(i, n) cin >> a[i];\n\n  rep(i, n) cin >> f[i];\n\n  sort(begin(a), begin(a) + n);\n\n  sort(begin(f), begin(f) + n, greater<ll>());\n\n  ll ans = 0;\n\n  ll high = 1e18, low = -1, mid;\n\n  while (high - low > 1) {\n\n    mid = (high + low) / 2;\n\n    if (solve(mid))\n      high = mid;\n\n    else\n      low = mid;\n  }\n\n  cout << high << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<int, int> Pi;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define FOR(i, a, b) for (ll i = a; i < b; i++)\n\n#define fi first\n\n#define se second\n\n#define endl \"\\n\"\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <typename T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {\n  return s << \"(\" << d.real() << \", \" << d.imag() << \")\";\n}\n\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &s, const pair<T1, T2> &d) {\n  return s << \"(\" << d.first << \", \" << d.second << \")\";\n}\n\ntemplate <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {\n  int len = d.size();\n  rep(i, len) {\n    s << d[i];\n    if (i < len - 1)\n      s << \" \";\n  }\n  return s;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &s, const vector<vector<T>> &d) {\n  int len = d.size();\n  rep(i, len) { s << d[i] << endl; }\n  return s;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &s, const set<T> &v) {\n  s << \"{ \";\n  for (auto itr = v.begin(); itr != v.end(); ++itr) {\n    if (itr != v.begin()) {\n      s << \", \";\n    }\n    s << (*itr);\n  }\n  s << \" }\";\n  return s;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &s, const multiset<T> &v) {\n  s << \"{ \";\n  for (auto itr = v.begin(); itr != v.end(); ++itr) {\n    if (itr != v.begin()) {\n      s << \", \";\n    }\n    s << (*itr);\n  }\n  s << \" }\";\n  return s;\n}\n\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &s, const map<T1, T2> &m) {\n  s << \"{\" << endl;\n  for (auto itr = m.begin(); itr != m.end(); ++itr) {\n    s << \" \" << (*itr).first << \" : \" << (*itr).second << endl;\n  }\n  s << \"}\" << endl;\n  return s;\n}\n\nconst ll mod = 1'000'000'007;\n\nconst ll inf = 1'000'000'000'000'000'00;\n\nconst int INF = 1'000'000'000;\n\nconst double EPS = 1e-10;\n\nconst double PI = acos(-1);\n\nint main() {\n\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  ll n, k;\n\n  cin >> n >> k;\n\n  vector<ll> a(n), f(n);\n\n  rep(i, n) { cin >> a[i]; }\n\n  rep(i, n) { cin >> f[i]; }\n\n  sort(begin(a), end(a));\n\n  sort(begin(f), end(f), greater<ll>());\n\n  auto solve = [&](ll x) {\n    ll cnt = 0;\n\n    rep(i, n) {\n\n      if (a[i] * f[i] <= x)\n        continue;\n\n      cnt += a[i] - x / f[i];\n    }\n\n    return cnt <= k;\n  };\n\n  ll ok = inf, ng = -1, mid;\n\n  while (ok - ng > 1) {\n\n    mid = (ok + ng) / 2;\n\n    if (solve(mid))\n      ok = mid;\n\n    else\n      ng = mid;\n  }\n\n  cout << ok << endl;\n}"}
{"fast_code_id":"708286449751a1248d902c708d99781a0431454ee6d6287087d01ba1b19bb883","fast_id":"4e03a559836c5e2ae148c47bbc38ce246ee8cb9b59e2d62fdd6d85ddd4d6d1d4","fast_time":0.1067462244,"language":"cpp","measured_fast_code_id":"4e03a559836c5e2ae148c47bbc38ce246ee8cb9b59e2d62fdd6d85ddd4d6d1d4","measured_slow_code_id":"3102dcc81a16d3f9ceeedd01ff6545c45f614fd27d2ad2f2368490b6550af869","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4261","problem_id":"p01919","slow_code_id":"0136224e069f478b6485e4e45434ad87b13f869d4be5c1aed9197b927a3841e8","slow_id":"3102dcc81a16d3f9ceeedd01ff6545c45f614fd27d2ad2f2368490b6550af869","slow_time":0.3157929472,"speedup":2.9583523817822264,"stratum":"2-4","sampling_key":"9d9efa5722678a28c5089f1f7b5aedf4e82affb3f4b2c5b339de11b7c9af201b","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntypedef long long ll;\n\nstruct edge {\n  int to;\n  ll cost;\n};\n\nvector<edge> G[60000];\n\nll dp[60000];\n\npriority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> qu;\n\nint a, b, c;\n\nint nextv(int v) { return (a * v + b) % c; }\n\nint main(void) {\n\n  int n, m, v0;\n\n  cin >> n >> m;\n\n  vector<int> x(m), y(m);\n\n  vector<ll> t(m);\n\n  rep(i, m) {\n\n    cin >> x[i] >> y[i] >> t[i];\n\n    --x[i];\n\n    --y[i];\n  }\n\n  cin >> v0 >> a >> b >> c;\n\n  rep(i, m) rep(v, c) {\n\n    G[x[i] * c + v].push_back({y[i] * c + nextv(v), t[i] * v});\n\n    G[y[i] * c + v].push_back({x[i] * c + nextv(v), t[i] * v});\n\n    G[((n - 1) * 2 - x[i]) * c + v].push_back({((n - 1) * 2 - y[i]) * c + nextv(v), t[i] * v});\n\n    G[((n - 1) * 2 - y[i]) * c + v].push_back({((n - 1) * 2 - x[i]) * c + nextv(v), t[i] * v});\n  }\n\n  rep(i, 60000) dp[i] = LLONG_MAX;\n\n  dp[v0] = 0;\n\n  qu.push({0, v0});\n\n  while (qu.size()) {\n\n    pair<ll, int> u = qu.top();\n\n    qu.pop();\n\n    if (u.second / c == 2 * (n - 1)) {\n\n      cout << dp[u.second] << endl;\n\n      return 0;\n    }\n\n    if (dp[u.second] < u.first)\n      continue;\n\n    for (auto e : G[u.second]) {\n\n      if (dp[e.to] > dp[u.second] + e.cost) {\n\n        dp[e.to] = dp[u.second] + e.cost;\n\n        qu.push({dp[e.to], e.to});\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntypedef long long ll;\n\nstruct Trio {\n\n  int to, v;\n\n  ll cost;\n\n  bool operator<(const Trio &right) const { return (cost > right.cost); }\n};\n\nint main(void) {\n\n  int n, m, v0, a, b, c;\n\n  cin >> n >> m;\n\n  vector<int> x(m), y(m);\n\n  vector<ll> t(m);\n\n  rep(i, m) cin >> x[i] >> y[i] >> t[i];\n\n  cin >> v0 >> a >> b >> c;\n\n  vector<Trio> G[(n + 1) * 2][c];\n\n  ll dp[(n + 1) * 2][c];\n\n  rep(i, m) rep(v, c) {\n\n    int nextv = (a * v + b) % c;\n\n    ll cost = t[i] * v;\n\n    G[x[i]][v].push_back({y[i], nextv, cost});\n\n    G[y[i]][v].push_back({x[i], nextv, cost});\n\n    G[n + x[i]][v].push_back({n + y[i], nextv, cost});\n\n    G[n + y[i]][v].push_back({n + x[i], nextv, cost});\n  }\n\n  rep(v, c) G[n][v].push_back({n * 2, v, 0});\n\n  rep(i, (n + 1) * 2) rep(v, c) dp[i][v] = LLONG_MAX;\n\n  dp[1][v0] = 0;\n\n  priority_queue<Trio, vector<Trio>> qu;\n\n  qu.push({1, v0, 0});\n\n  while (qu.size()) {\n\n    Trio u = qu.top();\n    qu.pop();\n\n    if (u.to == n + 1) {\n\n      cout << dp[u.to][u.v] << endl;\n\n      return 0;\n    }\n\n    if (dp[u.to][u.v] < u.cost)\n      continue;\n\n    for (auto e : G[u.to][u.v]) {\n\n      if (dp[e.to][e.v] > dp[u.to][u.v] + e.cost) {\n\n        dp[e.to][e.v] = dp[u.to][u.v] + e.cost;\n\n        qu.push({e.to, e.v, dp[e.to][e.v]});\n      }\n    }\n  }\n}"}
{"fast_code_id":"a2b4748f88d9d941c7c72db33dae19a253e56f92216375deb676b6b1597904a7","fast_id":"de840d5f8d875cf609fd586d4c5ef098ccad175039176eea9ece377a3f616691","fast_time":0.0200828668,"language":"cpp","measured_fast_code_id":"de840d5f8d875cf609fd586d4c5ef098ccad175039176eea9ece377a3f616691","measured_slow_code_id":"e20f7c03328afe37f9e0f53bc0368ba9b5ed35a73953e390b3bd2158a6ae8f76","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4263","problem_id":"p02560","slow_code_id":"0ae2e2f372f58030836d437ec0eaa70774486e4605bed77f9af90a3bfbda0d99","slow_id":"e20f7c03328afe37f9e0f53bc0368ba9b5ed35a73953e390b3bd2158a6ae8f76","slow_time":0.1045561937,"speedup":5.206238468902257,"stratum":"4-8","sampling_key":"1f6314e844c4b598e42cb1d8edff4bd0a30f3eb48659f12d4654d94bce097c2f","slow_code":"#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define ALL(v) v.begin(), v.end()\n\ntypedef long long ll;\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nll floor_sum(ll n, ll m, ll a, ll b) {\n\n  ll ans = 0;\n\n  ans += (n - 1) * n * (a / m) / 2 + n * (b / m);\n\n  a %= m;\n\n  b %= m;\n\n  ll y = (a * n + b) / m;\n\n  if (y == 0)\n    return ans;\n\n  ll x = (m * y - b + a - 1) / a;\n\n  ans += (n - x) * y + floor_sum(y, a, m, a * x - m * y + b);\n\n  return ans;\n}\n\nint main() {\n\n  int t;\n\n  cin >> t;\n\n  rep(i, t) {\n\n    int n, m, a, b;\n\n    cin >> n >> m >> a >> b;\n\n    cout << floor_sum(n, m, a, b) << endl;\n  }\n\n  return 0;\n}","fast_code":"#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define ALL(v) v.begin(), v.end()\n\ntypedef long long ll;\n\n#include <stdio.h>\n\nusing namespace std;\n\nll floor_sum(ll n, ll m, ll a, ll b) {\n\n  ll ans = 0;\n\n  if (a >= m) {\n\n    ans += (n - 1) * n * (a / m) / 2;\n\n    a %= m;\n  }\n\n  if (b >= m) {\n\n    ans += n * (b / m);\n\n    b %= m;\n  }\n\n  ll y_max = (a * n + b) / m;\n\n  if (y_max == 0)\n    return ans;\n\n  ans += floor_sum(y_max, a, m, a * n - y_max * m + b);\n\n  return ans;\n}\n\nint main() {\n\n  int t;\n\n  scanf(\"%d\", &t);\n\n  while (t--) {\n\n    int n, m, a, b;\n\n    scanf(\"%d%d%d%d\", &n, &m, &a, &b);\n\n    printf(\"%lld\\n\", floor_sum(n, m, a, b));\n  }\n\n  return 0;\n}"}
{"fast_code_id":"793c602c6708c6a8e739a754e8e1eda6351c1aa9eb4d87c31bd4a1b804b79664","fast_id":"8b9c313e6e99e18f6bcbb6b779cc1c1253cb1e847a99ed6ecd14b3091d738959","fast_time":0.1166974317,"language":"cpp","measured_fast_code_id":"8b9c313e6e99e18f6bcbb6b779cc1c1253cb1e847a99ed6ecd14b3091d738959","measured_slow_code_id":"f95f766306962bf583e06017fdea5de37c54d4fd31b66e0e95afda926d54a652","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4269","problem_id":"p02968","slow_code_id":"9230465f0a4771f664db0fffeec1e665cca95cd6192ffcd2cdade10a6857ccde","slow_id":"f95f766306962bf583e06017fdea5de37c54d4fd31b66e0e95afda926d54a652","slow_time":0.4652627671,"speedup":3.986915224459048,"stratum":"2-4","sampling_key":"2f4c91f120a8933cde899049b979035172c97bb0972a055788275adfa214c1bb","slow_code":"\n\n#include <vector>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 700;\n\nint n, mod, Nf, Ng;\n\nvector<pair<int, int> > Epr;\n\nint Ef[N + 3][N + 3];\n\nint main() {\n\n  scanf(\"%d%d\", &n, &mod);\n\n  Nf = 2 * n - 1;\n  Ng = 2 * n - 1;\n\n  for (int i = 0; i < 2 * n; i++) {\n\n    while (i * i + Nf * Nf > 4 * n * n && Nf >= 0)\n      Nf--;\n\n    while (i * i + Ng * Ng >= n * n && Ng >= 0)\n      Ng--;\n\n    if (i >= n)\n      Epr.push_back(make_pair(Nf + 1, 0));\n\n    else\n      Epr.push_back(make_pair(Ng + 1, Nf + 1));\n  }\n\n  sort(Epr.begin(), Epr.end());\n\n  int Vans = 0;\n  long long typ = 1;\n\n  for (int k = 0; k <= n; k++) {\n\n    memset(Ef, 0, sizeof Ef);\n\n    Ef[0][0] = 1;\n\n    for (int i = 0, Ctf = 0, Ctg = 0; i < (int)Epr.size();\n         Ctg += Epr[i].second == 0, Ctf += Epr[i].second != 0, i++) {\n\n      for (int j = 0; j <= k; j++) {\n\n        int tmp = Ef[i][j];\n\n        if (Epr[i].second) {\n\n          if (j != k)\n            Ef[i + 1][j + 1] =\n                (Ef[i + 1][j + 1] + 1ll * tmp * (Epr[i].first - j - Ctg) % mod) % mod;\n\n          Ef[i + 1][j] =\n              (Ef[i + 1][j] + 1ll * tmp * (Epr[i].second - k - n - (Ctf - j)) % mod) % mod;\n\n        }\n\n        else\n\n          Ef[i + 1][j] = (Ef[i + 1][j] + 1ll * tmp * (Epr[i].first - j - Ctg) % mod) % mod;\n      }\n    }\n\n    Vans = (Vans + typ * Ef[Epr.size()][k] + mod) % mod;\n\n    typ *= -1;\n  }\n\n  printf(\"%d\\n\", Vans);\n\n  return 0;\n}\n","fast_code":"\n\n#include <vector>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 250;\n\n#define fir first\n\n#define sec second\n\nint n, mod;\n\nstruct MNUM {\n\n  int num;\n\n  MNUM() {}\n\n  MNUM(int x) : num(x) {}\n\n  MNUM operator+(const MNUM &B) const & { return (1ll * num + B.num) % mod; }\n\n  MNUM operator-(const MNUM &B) const & { return ((1ll * num - B.num) % mod + mod) % mod; }\n\n  MNUM operator*(const MNUM &B) const & { return (1ll * num * B.num) % mod; }\n\n  MNUM operator+=(const MNUM &B) { return *this = (*this) + B; }\n\n  MNUM operator-=(const MNUM &B) { return *this = (*this) - B; }\n\n  MNUM operator*=(const MNUM &B) { return *this = (*this) * B; }\n\n} dp[N * 2 + 3][N + 3], ans;\n\nvector<pair<int, int> > per;\n\nint main() {\n\n  scanf(\"%d%d\", &n, &mod);\n\n  for (int i = 0, Nf = 2 * n - 1, Ng = 2 * n - 1; i < 2 * n; i++) {\n\n    while (i * i + Nf * Nf > 4 * n * n && Nf >= 0)\n      Nf--;\n\n    while (i * i + Ng * Ng >= n * n && Ng >= 0)\n      Ng--;\n\n    if (i < n) {\n\n      int Vf = Nf, Vg = Ng;\n\n      per.push_back(make_pair(Vg + 1, Vf + 1));\n\n    }\n\n    else {\n\n      int Vf = Nf;\n\n      per.push_back(make_pair(Vf + 1, 0));\n    }\n  }\n\n  sort(per.begin(), per.end());\n\n  for (int k = 0; k <= n; k++) {\n\n    memset(dp, 0, sizeof dp);\n\n    dp[0][0] = 1;\n\n    int cnt_2f = 0;\n\n    int cnt_fg = 0;\n\n    for (int i = 0; i < (int)per.size(); i++) {\n\n      for (int j = 0; j <= k; j++)\n\n        if (per[i].sec == 0)\n\n          dp[i + 1][j] += dp[i][j] * (per[i].fir - j - cnt_2f);\n\n        else {\n\n          if (j < k)\n            dp[i + 1][j + 1] += dp[i][j] * (per[i].fir - j - cnt_2f);\n\n          dp[i + 1][j] += dp[i][j] * (per[i].sec - n - k - (cnt_fg - j));\n        }\n\n      if (per[i].sec == 0)\n        cnt_2f++;\n\n      else\n        cnt_fg++;\n    }\n\n    if (k % 2)\n      ans -= dp[per.size()][k];\n\n    else\n      ans += dp[per.size()][k];\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"7dd33c71897df8ed7a3d0a1f6da6911181ade7bd660eff0b6426d61d6d8f9984","fast_id":"0966792914b35c6464d0f21a93732d37dc131a8ee8896c82ab0601cacefb5059","fast_time":0.1103934183,"language":"cpp","measured_fast_code_id":"0966792914b35c6464d0f21a93732d37dc131a8ee8896c82ab0601cacefb5059","measured_slow_code_id":"06729ebdf67620329b56a7e28532de2cd0af2ead18bc5eb83fd284f141b8c670","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_43029","problem_id":"p03476","slow_code_id":"be891ad6bc925c982bb4fe39676f6e6ba71eacd47a3720a66489ceb5da9251d1","slow_id":"06729ebdf67620329b56a7e28532de2cd0af2ead18bc5eb83fd284f141b8c670","slow_time":0.24052376,"speedup":2.1787871387981106,"stratum":"2-4","sampling_key":"023580de5ea7bd8e3d3dc99d474425162bdf536a636ed3ab553f43413391c253","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define REPR(i, n) for (int i = n - 1; i >= 0; i--)\n\n#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)\n\n#define ALL(obj) (obj).begin(), (obj).end()\n\n#define ALLR(obj) (obj).rbegin(), (obj).rend()\n\ntemplate <int_fast64_t max_N> struct Prime {\n\n  bool sieve[max_N];\n\n  constexpr Prime() : sieve() {\n\n    for (int_fast64_t i = 0; i < max_N; ++i)\n\n      sieve[i] = true;\n\n    sieve[0] = sieve[1] = false;\n\n    for (int_fast64_t i = 2; i < max_N; ++i) {\n\n      for (int_fast64_t j = i * i; j < max_N; j += i)\n\n        sieve[j] = false;\n    }\n  }\n};\n\nconst int SZ = 1e5 + 1;\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  constexpr auto p = Prime<SZ>();\n\n  vector<int> cnt(SZ + 1);\n\n  cnt[0] = 0;\n\n  for (int i = 1; i < SZ; i++) {\n\n    cnt[i] = cnt[i - 1];\n\n    if (p.sieve[i] && p.sieve[(i + 1) / 2]) {\n\n      cnt[i]++;\n    }\n  }\n\n  int Q;\n\n  cin >> Q;\n\n  while (Q--) {\n\n    int l, r;\n\n    cin >> l >> r;\n\n    cout << cnt[r] - cnt[l - 1] << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int SZ = 1e5 + 1;\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int q;\n\n  cin >> q;\n\n  vector<int> l(q), r(q);\n\n  int high = 0;\n\n  for (int i = 0; i < q; i++) {\n\n    cin >> l[i] >> r[i];\n\n    high = max(high, r[i]);\n  }\n\n  bitset<SZ> prime;\n\n  prime.flip();\n\n  prime[0] = false;\n\n  prime[1] = false;\n\n  for (int i = 2; i <= high; i++) {\n\n    if (prime[i]) {\n\n      for (int j = i + i; j <= high; j += i) {\n\n        prime[j] = false;\n      }\n    }\n  }\n\n  vector<int> cnt(high + 1);\n\n  cnt[0] = 0;\n\n  for (int i = 1; i <= high; i++) {\n\n    cnt[i] = cnt[i - 1];\n\n    if (prime[i] && prime[(i + 1) / 2]) {\n\n      cnt[i]++;\n    }\n  }\n\n  for (int i = 0; i < q; i++) {\n\n    cout << cnt[r[i]] - cnt[l[i] - 1] << '\\n';\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"ae0cd63d658011829723979c948619ef1ef43be3414238a421e635ae69b57bda","fast_id":"72ee6550959ae1f559d6875f65ecd7dd7bcea2571ed498c71fb65f80462ea08e","fast_time":0.1063313903,"language":"cpp","measured_fast_code_id":"72ee6550959ae1f559d6875f65ecd7dd7bcea2571ed498c71fb65f80462ea08e","measured_slow_code_id":"433a32d9f6f39f857dd362b895bad7ed5bec386ddfad7c1a7954498af155f7c7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4306","problem_id":"p02240","slow_code_id":"013d0d78102b83301000e432278faf16d2c8b1237c2a1e5058d7732592e05c7d","slow_id":"433a32d9f6f39f857dd362b895bad7ed5bec386ddfad7c1a7954498af155f7c7","slow_time":0.369669421,"speedup":3.4765784586943376,"stratum":"2-4","sampling_key":"e2de00a9ffd8937ee273bea7d4d24d213dcbec222d1dbf7af48445a6f3fccede","slow_code":"#include <iostream>\n\n#include <vector>\n\n#define N_MAX 100000\n\nusing namespace std;\n\nvector<int> sns[N_MAX];\n\nint *group;\n\nint g = 0;\n\nvoid dfs(int s) {\n\n  if (group[s] != 0)\n    return;\n\n  group[s] = g;\n\n  int len = sns[s].size();\n\n  for (int i = 0; i < len; i++) {\n\n    dfs(sns[s][i]);\n  }\n}\n\nint main() {\n\n  int n, m, q, s, t;\n\n  cin >> n >> m;\n\n  for (int i = 0; i < m; i++) {\n\n    cin >> s >> t;\n\n    sns[s].push_back(t);\n\n    sns[t].push_back(s);\n  }\n\n  group = new int[n];\n\n  for (int i = 0; i < n; i++) {\n\n    if (group[i] == 0) {\n\n      g++;\n\n      dfs(i);\n    }\n  }\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n\n    cin >> s >> t;\n\n    if (group[s] == group[t]) {\n\n      cout << \"yes\" << endl;\n\n    } else {\n\n      cout << \"no\" << endl;\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <vector>\n\n#define eol '\\n'\n\nusing namespace std;\n\nvector<vector<int> > list;\n\nvector<int> group;\n\nvoid bfs(int v, int g) {\n\n  if (group[v] != 0) {\n\n    return;\n  }\n\n  group[v] = g;\n\n  for (int i = 0; i < list[v].size(); i++) {\n\n    bfs(list[v][i], g);\n  }\n}\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int n, m, s, t, q;\n\n  cin >> n >> m;\n\n  list = vector<vector<int> >(n, vector<int>());\n\n  group = vector<int>(n, 0);\n\n  for (int i = 0; i < m; i++) {\n\n    cin >> s >> t;\n\n    list[s].push_back(t);\n\n    list[t].push_back(s);\n  }\n\n  int g = 1;\n\n  for (int i = 0; i < n; i++) {\n\n    if (group[i] == 0) {\n\n      bfs(i, g);\n\n      g++;\n    }\n  }\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n\n    cin >> s >> t;\n\n    if (group[s] == group[t]) {\n\n      cout << \"yes\" << eol;\n\n    } else {\n\n      cout << \"no\" << eol;\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"d61c88a52d93b5141577e74e62a9c7e615c74f872b5d7e3c94a5491cb537fb2e","fast_id":"611d4cb91ab9ef1ec7210c0aa149719430540eaa53d2e4f81c50b666955a52e4","fast_time":0.0196289084,"language":"cpp","measured_fast_code_id":"611d4cb91ab9ef1ec7210c0aa149719430540eaa53d2e4f81c50b666955a52e4","measured_slow_code_id":"8ffe4fc2e33e52c50c8519560302546965b6a6da494f3ac2cfabf59194958766","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4311","problem_id":"p03659","slow_code_id":"4a003b9943230c93e30a46f54958c9829c19728ae8f297f0d7dc18fb132cc6eb","slow_id":"8ffe4fc2e33e52c50c8519560302546965b6a6da494f3ac2cfabf59194958766","slow_time":0.2731877746,"speedup":13.917624405440701,"stratum":"8+","sampling_key":"8cba088ba6a7a89bfc4e1fa233f3aab96f1dedf148ef9bfe8350a237af31553e","slow_code":"#include <iostream>\n\n#include <iomanip>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <cctype>\n\n#define szxb 200010\n\nusing namespace std;\n\nint n;\n\nlong long a[szxb];\n\nint main()\n\n{\n\n  memset(a, 0, sizeof(a));\n\n  scanf(\"%d\", &n);\n\n  int t;\n\n  long long total = 0;\n\n  for (register int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &t);\n\n    total += t, a[i] = (a[i - 1] + t);\n  }\n\n  long long minn = 1e17;\n\n  for (register int i = 2; i <= n; i++)\n\n  {\n\n    minn = (min(minn, abs(total - (a[i - 1] * 2))));\n  }\n\n  printf(\"%lld\", minn);\n\n  putchar(10);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\nint n;\n\nlong long int sum, min, x;\n\nint a[200000];\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  for (int i = 0; i < n; i++)\n\n    sum += a[i];\n\n  min = labs(sum - 2 * a[0]);\n\n  for (int i = 0; i < n - 1; i++)\n\n  {\n\n    x += a[i];\n\n    if (labs(sum - 2 * x) < min)\n\n      min = abs(sum - 2 * x);\n  }\n\n  printf(\"%d\\n\", min);\n\n  return 0;\n}"}
{"fast_code_id":"823c2f32766a2904f8bd512b6a48e142ffe3b68be33d67f469655657bd8b4c1c","fast_id":"d8563c8672891aeccdac69498cd98ea847f6599959e8298946474d7a26884c68","fast_time":0.0412958592,"language":"cpp","measured_fast_code_id":"d8563c8672891aeccdac69498cd98ea847f6599959e8298946474d7a26884c68","measured_slow_code_id":"6a9466d5951ec4911c40e9972817b8b853813942d40554bfaa4240a2f6aa17d8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_43139","problem_id":"p02787","slow_code_id":"c7cc52e501268028d1dd39881af1fda44cd16a39a971fd97522c26fb81af1573","slow_id":"6a9466d5951ec4911c40e9972817b8b853813942d40554bfaa4240a2f6aa17d8","slow_time":0.0998119239,"speedup":2.416995936967937,"stratum":"2-4","sampling_key":"0718178b93b5436a6a12d3026d8629635bc6a4a24c8a33675374d83e783338cf","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <tuple>\n\n#include <cmath>\n\n#include <iomanip>\n\n#include <map>\n\n#include <cstring>\n\n#define ll long long\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define repp(i, n) for (int i = n - 1; i >= 0; i--)\n\n#define fi first\n\n#define se second\n\n#define pb push_back\n\nusing namespace std;\n\ntemplate <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\ntypedef pair<int, int> P;\n\ntypedef pair<ll, ll> Pll;\n\nconst int INF = 100100100;\n\nint main() {\n\n  int h, n;\n  cin >> h >> n;\n\n  int a[n], b[n];\n\n  rep(i, n) cin >> a[i] >> b[i];\n\n  ll dp[n + 1][30020];\n\n  memset(dp, INF, sizeof(dp));\n\n  dp[0][0] = 0;\n\n  rep(i, n) {\n\n    rep(j, 30020) {\n\n      if (j - a[i] >= 0) {\n\n        dp[i + 1][j] = min(dp[i][j], dp[i + 1][j - a[i]] + b[i]);\n\n      }\n\n      else\n        dp[i + 1][j] = dp[i][j];\n    }\n  }\n\n  ll ans = INF;\n\n  rep(j, 30020) if (j >= h) ans = min(ans, dp[n][j]);\n\n  rep(i, n + 1) {}\n\n  cout << ans << endl;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <tuple>\n\n#include <cmath>\n\n#include <iomanip>\n\n#include <map>\n\n#include <cstring>\n\n#include <functional>\n\n#include <cctype>\n\n#include <locale>\n\n#define ll long long\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rrep(i, n) for (int i = n - 1; i >= 0; i--)\n\n#define fi first\n\n#define se second\n\n#define pb push_back\n\n#define ALL(a) (a).begin(), (a).end()\n\nusing namespace std;\n\ntemplate <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\ntypedef pair<int, int> P;\n\ntypedef pair<long long, long long> Pll;\n\n#define fout(num) cout << fixed << setprecision(20) << (num) << endl\n\nsigned main() {\n\n  const int INF = 1e9;\n\n  std::cin.tie(nullptr);\n\n  std::ios_base::sync_with_stdio(false);\n\n  int h, n;\n  cin >> h >> n;\n\n  int dp[n + 1][h + 1];\n\n  rep(i, n + 1) rep(j, h + 1) dp[i][j] = INF;\n\n  dp[0][0] = 0;\n\n  rep(i, n) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    rep(j, h + 1) dp[i + 1][j] = dp[i][j];\n\n    rep(j, h + 1) {\n\n      int x = min(h, j + a);\n\n      chmin(dp[i + 1][x], dp[i + 1][j] + b);\n    }\n  }\n\n  cout << dp[n][h] << endl;\n}\n"}
{"fast_code_id":"b34360cf43621a3fbce764d1876db3d130123dcae4ce717c8b9840a66ee6930e","fast_id":"bf051b8c504c53e623748b00af999a76b02867b731876a48caa595a011c6ff08","fast_time":0.1031965901,"language":"cpp","measured_fast_code_id":"bf051b8c504c53e623748b00af999a76b02867b731876a48caa595a011c6ff08","measured_slow_code_id":"c838d7e4bf28ba4b6046c0bd3c68c82c7df949a9350701c85f5def2d979e0d4c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4322","problem_id":"p02536","slow_code_id":"a19b6f1cfcdde5bd14ef7fa2e424b502eb9150073d7816c755c30a6be5d0a332","slow_id":"c838d7e4bf28ba4b6046c0bd3c68c82c7df949a9350701c85f5def2d979e0d4c","slow_time":0.3593500459,"speedup":3.482189145511311,"stratum":"2-4","sampling_key":"b8d44ea434d52575b6e1f018997e663f26670bcfd9629491b6ee8bc7b8e09d02","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nvector<int> adj[100005];\n\nvector<bool> vis(100005, false);\n\nvoid dfs(int i) {\n\n  if (!vis[i]) {\n\n    vis[i] = true;\n\n    for (auto v : adj[i])\n\n      dfs(v);\n  }\n}\n\nvoid solve() {\n\n  int n, m;\n\n  cin >> n >> m;\n\n  for (int i = 0; i < m; i++) {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    --x;\n\n    --y;\n\n    adj[x].push_back(y);\n\n    adj[y].push_back(x);\n  }\n\n  int comp = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    if (!vis[i]) {\n\n      comp++;\n\n      dfs(i);\n    }\n  }\n\n  cout << comp - 1;\n}\n\nint main() {\n\n  solve();\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\ntypedef long long ll;\n\nusing namespace std;\n\nvector<int> par;\n\nint find(int n) {\n\n  if (par[n] == n)\n    return n;\n\n  else\n    return par[n] = find(par[n]);\n}\n\nvoid uni(int a, int b) {\n\n  a = find(a);\n\n  b = find(b);\n\n  if (a != b)\n    par[b] = a;\n}\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  cout.tie(NULL);\n\n  int i, j, n, m, a, b;\n\n  cin >> n >> m;\n\n  par = vector<int>(n + 1);\n\n  for (i = 1; i <= n; i++)\n    par[i] = i;\n\n  while (m--) {\n\n    cin >> a >> b;\n\n    uni(a, b);\n  }\n\n  set<int> s;\n\n  for (i = 1; i <= n; i++)\n    s.insert(find(i));\n\n  cout << s.size() - 1;\n\n  return 0;\n}"}
{"fast_code_id":"3c6168f3c34b2cb205f9a4ed05bc2fba175169b53b906bcb0875711aaf367e24","fast_id":"cd1e16f7c9fcccebe6b3bc86f30e3b83edc25a1b95e93ffd7db46ad4e57980c7","fast_time":0.0114135404,"language":"cpp","measured_fast_code_id":"cd1e16f7c9fcccebe6b3bc86f30e3b83edc25a1b95e93ffd7db46ad4e57980c7","measured_slow_code_id":"2a3ea894f9a17ff2e60a14566e11eb42bb24cb598fadabc23f2d234080441986","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_43374","problem_id":"p03579","slow_code_id":"53f8c52feed900c35a4ac26a393cd6d00cadcfc88d303cd6e2f7bd7edd8fd16c","slow_id":"2a3ea894f9a17ff2e60a14566e11eb42bb24cb598fadabc23f2d234080441986","slow_time":0.0351187643,"speedup":3.076938712198364,"stratum":"2-4","sampling_key":"f4ecf46d69531496f8a8ffd2a5b27ce52586a0de44cf24c3586055c3cf858ec1","slow_code":"#include <cstdio>\n\n#include <queue>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nnamespace io {\n\n#define gc()                                                                                       \\\n  (iS == iT ? (iT = (iS = ibuff) + fread(ibuff, 1, SIZ, stdin), (iS == iT ? EOF : *iS++)) : *iS++)\n\nconst int SIZ = 1 << 21 | 1;\n\nchar *iS, *iT, ibuff[SIZ], obuff[SIZ], *oS = obuff, *oT = oS + SIZ - 1, fu[110], c;\n\nint fr;\n\ninline void out() {\n\n  fwrite(obuff, 1, oS - obuff, stdout);\n\n  oS = obuff;\n}\n\ntemplate <class Type>\n\ninline void read(Type &x) {\n\n  x = 0;\n\n  Type y = 1;\n\n  for (c = gc(); (c > '9' || c < '0') && c != '-'; c = gc())\n    ;\n\n  c == '-' ? y = -1 : x = (c & 15);\n\n  for (c = gc(); c >= '0' && c <= '9'; c = gc())\n\n    x = x * 10 + (c & 15);\n\n  x *= y;\n}\n\ntemplate <class Type>\n\ninline void print(Type x, char text = '\\n') {\n\n  if (x < 0)\n\n    *oS++ = '-', x *= -1;\n\n  if (x == 0)\n\n    *oS++ = '0';\n\n  while (x)\n\n    fu[++fr] = x % 10 + '0', x /= 10;\n\n  while (fr)\n\n    *oS++ = fu[fr--];\n\n  *oS++ = text;\n\n  out();\n}\n\n}                \n\nusing namespace io;\n\n#define ll long long\n\nconst int maxn = 100010;\n\nint n, m, a, b;\n\nint col[maxn + 5], lnk[maxn + 5], son[maxn << 1], nxt[maxn << 1];\n\nint u;\n\ninline void Add(int x, int y) {\n\n  son[++u] = y;\n\n  nxt[u] = lnk[x];\n\n  lnk[x] = u;\n}\n\nvoid dfs(int x, int now = 0, int fa = 0) {\n\n  col[x] = now;\n  now ^= 1;\n\n  for (int j = lnk[x]; j; j = nxt[j]) {\n\n    if (col[son[j]] == -1)\n\n      dfs(son[j], now, x);\n\n    if (col[son[j]] != now)\n\n      print((ll)n * (n - 1) / 2 - m), exit(0);\n  }\n}\n\nint main() {\n\n  read(n);\n\n  read(m);\n\n  memset(col, 255, sizeof(col));\n\n  for (int i = 1, x, y; i <= m; i++)\n\n    read(x), read(y), Add(x, y), Add(y, x);\n\n  dfs(1);\n\n  for (int i = 1; i <= n; i++)\n\n    col[i] ? ++a : ++b;\n\n  print((ll)a * b - m);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#define For(i, a, b) for (register long long i = a; i <= b; i++)\n\n#define Rof(i, a, b) for (register long long i = a; i >= b; i--)\n\n#define int long long\n\nusing namespace std;\n\nconst int maxn = 1e5 + 10;\n\nint fa[maxn << 1];\n\ninline int findfa(int i) { return i == fa[i] ? i : fa[i] = findfa(fa[i]); }\n\ninline void uni(int i, int j) {\n\n  int a = findfa(i), b = findfa(j);\n\n  if (a != b)\n    fa[a] = b;\n}\n\ninline bool wxp(int i, int j) { return findfa(i) == findfa(j); }\n\nint n, m;\n\nsigned main() {\n\n  scanf(\"%lld%lld\", &n, &m);\n\n  Rof(i, n << 1, 1) { fa[i] = i; }\n\n  For(i, 1, m) {\n\n    int u, v;\n\n    scanf(\"%lld%lld\", &u, &v);\n\n    uni(u, v + n);\n\n    uni(u + n, v);\n  }\n\n  For(i, 1, n) {\n\n    if (wxp(i, i + n)) {\n\n      printf(\"%lld\\n\", n * (n - 1) / 2 - m);\n\n      return 0;\n    }\n  }\n\n  int ls = 1, rs = 0;\n\n  For(i, 2, n) {\n\n    if (wxp(i, 1)) {\n\n      ++ls;\n\n    } else {\n\n      ++rs;\n    }\n  }\n\n  printf(\"%lld\\n\", ls * rs - m);\n}"}
{"fast_code_id":"c36aa6faa210be60d939037a2727538a8f9cb8223a06e76048f904d69cc3ac6b","fast_id":"00a4702a5f599d4c19c9b6c14265b80e8a050b6a4a8c6b58cecfddba2ca99007","fast_time":0.1071530411,"language":"cpp","measured_fast_code_id":"00a4702a5f599d4c19c9b6c14265b80e8a050b6a4a8c6b58cecfddba2ca99007","measured_slow_code_id":"e353f401b104ededa37030ca0e7bca97a172e09ab820fe2846ebbe126a6df667","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_434","problem_id":"p03694","slow_code_id":"7c7c0b8988726067f295c8683fc3e85e8ced802dc29977604a205446b707ec47","slow_id":"e353f401b104ededa37030ca0e7bca97a172e09ab820fe2846ebbe126a6df667","slow_time":0.9946123213,"speedup":9.282166059774108,"stratum":"8+","sampling_key":"03a5d8791b806193c2f761f53cef72785bd4b305d5396e8b7875030addd74c61","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <vector>\n\n#include <string>\n\n#include <iomanip>\n\n#include <bits/stdc++.h>\n\n#define INF 999999999\n\nusing namespace std;\n\n#define ll long long\n\n#define boost                                                                  \\\n  ios_base::sync_with_stdio(false);                                            \\\n  cin.tie(0);                                                                  \\\n  cout.tie(0);\n\nstruct shi\n\n{\n\n  int x = 0;\n\n  int T;\n\n} s[1000000];\n\nint cmd(shi a, shi b)\n\n{\n\n  return a.x < b.x;\n}\n\nint main()\n\n{\n\n  boost;\n\n  int N;\n\n  cin >> N;\n\n  int hh[100000];\n\n  for (int i = 0; i < N; i++) {\n\n    cin >> hh[i];\n  }\n\n  sort(hh, hh + N);\n\n  int kk[105000];\n\n  int ma = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    if (i != 0 && i != N - 1) {\n\n      kk[i] += abs(hh[i] - hh[N - 1]) * 2;\n\n      kk[i] += abs(hh[i] - hh[0]);\n\n    }\n\n    else\n\n      kk[i] += abs(hh[0] - hh[N - 1]);\n  }\n\n  sort(kk, kk + N);\n\n  cout << kk[0] << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cmath>\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <fstream>\n\n#include <queue>\n\nusing namespace std;\n\nvoid ll() {\n\n  std::ios_base::sync_with_stdio(0);\n\n  cin.tie(NULL);\n\n  cout.tie(0);\n}\n\nint main()\n\n{\n\n  ll();\n\n  vector<int> v;\n\n  int arr[1000];\n\n  int n, d = 0, t = 0;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> arr[i];\n\n    v.push_back(arr[i]);\n  }\n\n  sort(v.begin(), v.end());\n\n  d = v[n - 1] - v[0];\n\n  cout << d << endl;\n}"}
{"fast_code_id":"8ae614491bd23a9c083e9582d3b9a76c7ff5d2bb65c95fa1559a5602fa2fa257","fast_id":"7bd0b14c1be43856601753d47dc9ceea2abf771a62da0e4b92fa2537b87158c0","fast_time":0.0196125404,"language":"cpp","measured_fast_code_id":"7bd0b14c1be43856601753d47dc9ceea2abf771a62da0e4b92fa2537b87158c0","measured_slow_code_id":"9d07037735ea3e988163478dd39690a7fc2e3652c7effbfcbe71c1478c0326d9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_43417","problem_id":"p02975","slow_code_id":"0d1b626461af8293c99b2a02f16ee2e0ccc651ad74ff9797fe531c954b798343","slow_id":"9d07037735ea3e988163478dd39690a7fc2e3652c7effbfcbe71c1478c0326d9","slow_time":0.3370389285,"speedup":17.184868539518725,"stratum":"8+","sampling_key":"6ee6db3a1f5251e0aac842bbaa9084b52adfabf281d09b4457f3d4f7a887a531","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define PB push_back\n\n#define MP make_pair\n\n#define EB emplace_back\n\n#define f first\n\n#define s second\n\n#define FOR(i, a, b) for (int i = a; i < (b); ++i)\n\n#define RFOR(i, b, a) for (int i = b - 1; i >= a; --i)\n\n#define FILL(a, b) memset(a, b, sizeof a)\n\n#define ALL(a) a.begin(), a.end()\n\n#define SZ(a) ((int)a.size())\n\n#define bitc(n) __builtin_popcount(n)\n\n#define MAGIC0 mt19937 rnd(time(0));\n\ntypedef long long LL;\n\ntypedef unsigned long long ULL;\n\ntypedef vector<int> VI;\n\ntypedef pair<int, int> PII;\n\ntypedef pair<LL, LL> PLL;\n\nconst int INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = 1LL * INF * INF;\n\nconst int MAX = 1e6 + 7;\n\nconst double PI = acos(-1.);\n\nconst double EPS = 1e-7;\n\nconst int MAXN = 100005;\n\nmt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n\nunordered_map<int, int> mep(200007);\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(0);\n\n  time_t st = clock();\n\n  int n;\n\n  cin >> n;\n\n  VI a(n);\n\n  FOR(i, 0, n)\n\n  {\n\n    cin >> a[i];\n\n    mep[a[i]]++;\n  }\n\n  deque<int> res;\n\n  int ind = rnd() % n;\n\n  res.PB(a[ind]);\n\n  mep[a[ind]]--;\n\n  FOR(i, 0, n)\n\n  {\n\n    if (mep[a[i]] == 0 || !mep.count(a[i] ^ a[ind]) || mep[a[i] ^ a[ind]] == 0)\n\n    {\n\n      continue;\n    }\n\n    res.PB(a[i]);\n\n    mep[a[i]]--;\n\n    int it = 0;\n\n    while (true)\n\n    {\n\n      if (((double)clock() - st) / CLOCKS_PER_SEC >= 1.9)\n\n      {\n\n        cout << \"No\\n\";\n\n        return 0;\n      }\n\n      ++it;\n\n      if (it % 2 == 0)\n\n      {\n\n        int sz = SZ(res);\n\n        int el = res[sz - 1] ^ res[sz - 2];\n\n        if (mep.count(el) && mep[el] > 0)\n\n        {\n\n          res.PB(el);\n\n          mep[el]--;\n\n        }\n\n        else\n\n        {\n\n          break;\n        }\n\n      }\n\n      else\n\n      {\n\n        int el = res[0] ^ res[1];\n\n        if (mep.count(el) && mep[el] > 0)\n\n        {\n\n          res.push_front(el);\n\n          mep[el]--;\n\n        }\n\n        else\n\n        {\n\n          break;\n        }\n      }\n    }\n\n    if (SZ(res) == n)\n\n    {\n\n      cout << \"Yes\\n\";\n\n      return 0;\n    }\n\n    while (SZ(res) > 1)\n\n    {\n\n      mep[res.back()]++;\n\n      res.pop_back();\n    }\n  }\n\n  cout << \"No\\n\";\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint a[100001];\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  int ql = 1;\n\n  for (int i = 1; i <= n; i++)\n\n    if (a[i])\n      ql = 0;\n\n  if (ql) {\n\n    printf(\"Yes\\n\");\n\n    return 0;\n  }\n\n  if (n % 3) {\n\n    printf(\"No\\n\");\n\n    return 0;\n  }\n\n  sort(a + 1, a + n + 1);\n\n  for (int i = 2; i <= n; i++)\n\n    if (i != n / 3 + 1 && i != n / 3 * 2 + 1 && a[i] != a[i - 1]) {\n\n      printf(\"No\\n\");\n\n      return 0;\n    }\n\n  if (a[1] ^ a[n / 3 + 1] ^ a[n / 3 * 2 + 1]) {\n\n    printf(\"No\\n\");\n\n    return 0;\n  }\n\n  printf(\"Yes\\n\");\n}"}
{"fast_code_id":"17c4b118d54b42309d667b6759baeb02f0cd5df696bade8461777a0feab923e3","fast_id":"85f5b41187a45a01946042807f622328513bd02454529ca1123bae894580c7af","fast_time":0.0300156234,"language":"cpp","measured_fast_code_id":"85f5b41187a45a01946042807f622328513bd02454529ca1123bae894580c7af","measured_slow_code_id":"6388f1564f5ab8bb608d929d0dac1e4a33c0361ccb4d4e654bba12c50a3ea9a3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_43441","problem_id":"p02703","slow_code_id":"354481ca6c2bbb99ae1ef7dd4ec161d4bebc4ec0c8b1d63d557912761191a7ee","slow_id":"6388f1564f5ab8bb608d929d0dac1e4a33c0361ccb4d4e654bba12c50a3ea9a3","slow_time":0.0658771082,"speedup":2.1947606192313835,"stratum":"2-4","sampling_key":"2186b1bce391d11f41a83ee29e10154fd92e2e3168bb0d59f22eaac08fe094cd","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<ll> vec;\n\ntypedef vector<vec> mat;\n\ntypedef pair<ll, ll> pll;\n\nconst ll mod = 1e9 + 7;\n\nconst ll inf = 5e18;\n\nstruct E {\n  ll to, co, ti;\n};\n\nstruct P {\n  ll ti, id, re;\n};\n\nbool operator<(const P &a, const P &b) { return a.ti > b.ti; }\n\nll dp[50][5001], c[50], d[50], ans[50], n, m, s;\n\nvector<E> edge[50];\n\npriority_queue<P> que;\n\nint main() {\n\n  cin >> n >> m >> s;\n\n  for (ll i = 0; i < m; i++) {\n\n    ll u, v, a, b;\n\n    cin >> u >> v >> a >> b;\n\n    u--;\n    v--;\n\n    edge[u].push_back({v, a, b});\n\n    edge[v].push_back({u, a, b});\n  }\n\n  for (ll i = 0; i < n; i++)\n    cin >> c[i] >> d[i];\n\n  que.push({1, 0, min(5000LL, s)});\n\n  while (que.size()) {\n\n    P p = que.top();\n\n    que.pop();\n\n    if (dp[p.id][p.re])\n      continue;\n\n    dp[p.id][p.re] = p.ti;\n\n    if (!ans[p.id])\n      ans[p.id] = p.ti;\n\n    for (E q : edge[p.id]) {\n\n      if (p.re >= q.co && !dp[q.to][p.re - q.co]) {\n\n        que.push({p.ti + q.ti, q.to, p.re - q.co});\n      }\n    }\n\n    if (p.re + c[p.id] <= 5000)\n      que.push({p.ti + d[p.id], p.id, p.re + c[p.id]});\n  }\n\n  for (ll i = 1; i < n; i++)\n    cout << --ans[i] << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<ll> vec;\n\ntypedef vector<vec> mat;\n\ntypedef pair<ll, ll> pll;\n\nconst ll mod = 1e9 + 7;\n\nconst ll inf = 1LL << 61;\n\ntypedef pair<ll, pll> ppll;\n\nint main() {\n\n  ll n, m, s;\n\n  cin >> n >> m >> s;\n\n  vector<map<ll, pll>> G(n);\n\n  for (ll i = 0; i < m; i++) {\n\n    ll u, v, a, b;\n\n    cin >> u >> v >> a >> b;\n\n    u--, v--;\n\n    G[u][v] = {a, b};\n\n    G[v][u] = {a, b};\n  }\n\n  vec mai(n), mnu(n);\n\n  for (ll i = 0; i < n; i++) {\n\n    cin >> mai[i] >> mnu[i];\n  }\n\n  mat d(n, vec(50 * (n - 1) + 1, -1));\n\n  vec ans(n, -1);\n\n  vec mins(n, -1);\n\n  priority_queue<ppll, vector<ppll>, greater<ppll>> q;\n\n  s = min(s, 50 * (n - 1));\n\n  q.push({0, {0, s}});\n\n  while (q.size()) {\n\n    ll td = q.top().first;\n\n    ll f = q.top().second.first;\n\n    ll s = q.top().second.second;\n\n    q.pop();\n\n    ll flag = 0;\n\n    if (ans[f] < 0)\n      ans[f] = td;\n\n    if (d[f][s] > -1)\n      continue;\n\n    d[f][s] = td;\n\n    mins[f] = s;\n\n    for (auto p : G[f]) {\n\n      ll t = p.first;\n\n      ll co = p.second.first;\n\n      ll v = p.second.second;\n\n      if (s - co >= 0 && d[t][s - co] == -1) {\n\n        q.push({td + v, {t, s - co}});\n      }\n    }\n\n    ll ns = min(s + mai[f], 50 * (n - 1));\n\n    ll nd = td + mnu[f];\n\n    if (d[f][ns] == -1)\n      q.push({nd, {f, ns}});\n  }\n\n  for (ll i = 1; i < n; i++) {\n\n    cout << ans[i] << endl;\n  }\n}"}
{"fast_code_id":"9d1ddb9a8f34ec37b5608825569eb95e89279208833f196be63852586d0aa510","fast_id":"6d07a80453996a0db9ec6ca783c67300a43cebb025345cfee148f127209a4cec","fast_time":0.0206232544,"language":"cpp","measured_fast_code_id":"6d07a80453996a0db9ec6ca783c67300a43cebb025345cfee148f127209a4cec","measured_slow_code_id":"b5d57731fd21bf4b25310eb2f049f30e6a46aa37e2293304d8acad8f118aaba0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_43454","problem_id":"p02914","slow_code_id":"44278ed97a28eb73e9e9b362d2f2ef63c6801b75d22eb323d08e319cc9274bfd","slow_id":"b5d57731fd21bf4b25310eb2f049f30e6a46aa37e2293304d8acad8f118aaba0","slow_time":0.7561856136,"speedup":36.666648189143224,"stratum":"8+","sampling_key":"fa4841ca0d5b976f1dbd81dae50158dbe1f092d15c963cc2c76f70e4951ede85","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  ll a[100000];\n\n  ll goukei = 0;\n\n  rep(i, N) {\n\n    cin >> a[i];\n\n    goukei ^= a[i];\n  }\n\n  int M = 60;\n\n  bool A[100000][60] = {};\n\n  rep(i, N) {\n\n    rep(j, M) { A[i][j] = a[i] >> j & 1; }\n  }\n\n  int r = 0;\n\n  for (int i = M - 1; i >= 0; i--) {\n\n    if (!(goukei >> i & 1)) {\n\n      for (int j = r; j < N; j++) {\n\n        if (A[j][i]) {\n\n          rep(k, M) swap(A[r][k], A[j][k]);\n\n          for (int j = r + 1; j < N; j++) {\n\n            if (A[j][i]) {\n\n              rep(k, M) A[j][k] ^= A[r][k];\n            }\n          }\n\n          if (!A[0][i]) {\n\n            rep(k, M) A[0][k] ^= A[r][k];\n          }\n\n          r++;\n\n          break;\n        }\n      }\n    }\n  }\n\n  ll kotae = 0;\n\n  rep(i, M) {\n\n    if (!(goukei >> i & 1)) {\n\n      if (A[0][i]) {\n\n        kotae += 1ll << (i + 1);\n      }\n\n    }\n\n    else {\n\n      kotae += 1ll << i;\n    }\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline ll getint() {\n\n  ll A = 0;\n\n  if (ci - cn + 24 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  int N = getint();\n\n  ll a[100000];\n\n  ll goukei = 0;\n\n  rep(i, N) {\n\n    a[i] = getint();\n    ;\n\n    goukei ^= a[i];\n  }\n\n  int M = 60;\n\n  int r = 0;\n\n  for (int i = M - 1; i >= 0; i--) {\n\n    if (!(goukei >> i & 1)) {\n\n      for (int j = r; j < N; j++) {\n\n        if (a[j] >> i & 1) {\n\n          swap(a[r], a[j]);\n\n          for (int k = max(j, r + 1); k < N; k++) {\n\n            if (a[k] >> i & 1) {\n\n              a[k] ^= a[r];\n            }\n          }\n\n          if (!(a[0] >> i & 1)) {\n\n            a[0] ^= a[r];\n          }\n\n          r++;\n\n          break;\n        }\n      }\n    }\n  }\n\n  printf(\"%lld\", a[0] + (a[0] ^ goukei));\n\n  Would you please return 0;\n}"}
{"fast_code_id":"59cc43df7fa070ab6e79a3261cc86c3b76400e0a91b39bb338976c50af819c18","fast_id":"3f97e75f0f27fad303dc87705a65371863007b0e0317bb017bf701b065c4acc9","fast_time":0.0409552643,"language":"cpp","measured_fast_code_id":"3f97e75f0f27fad303dc87705a65371863007b0e0317bb017bf701b065c4acc9","measured_slow_code_id":"b1d8a4246c76658fffceefe935af6c251bb506b88fb452190b8bb96b2ccf8fd7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4348","problem_id":"p03127","slow_code_id":"d1c391e8a3c03f08dfc2e10df17d309a3662afa54749cc0d0a93809ccc43cb75","slow_id":"b1d8a4246c76658fffceefe935af6c251bb506b88fb452190b8bb96b2ccf8fd7","slow_time":0.3867904232,"speedup":9.444217484881424,"stratum":"8+","sampling_key":"a371d28730ce5b652288512fc1ab6f8b432edcb050b3da63b121596da074b0cc","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nll GCD(ll a, ll b)\n\n{\n\n  if (b == 0)\n    return a;\n\n  else\n    return GCD(b, a % b);\n}\n\nint main(int argc, char **argv)\n\n{\n\n  int n;\n\n  vector<ll> v(1000000);\n\n  cin >> n;\n\n  for (int i = 0; i < n; ++i)\n    cin >> v[i];\n\n  int ans{0};\n\n  for (int i = 0; i < n; ++i)\n    ans = GCD(ans, v[i]);\n\n  std::cout << ans << std::endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nll GCD(ll a, ll b)\n\n{\n\n  if (b == 0)\n    return a;\n\n  else\n    return GCD(b, a % b);\n}\n\nint main(int argc, char **argv)\n\n{\n\n  ll n;\n  cin >> n;\n\n  vector<ll> v(n);\n  for (int i = 0; i < n; ++i)\n    cin >> v[i];\n\n  ll res{0};\n\n  for (int i = 0; i < n; ++i)\n\n  {\n\n    res = GCD(v[i], res);\n  }\n\n  std::cout << res << std::endl;\n}"}
{"fast_code_id":"e98f77fcc07cb9a60d92ad2a259b676b4d4a1e75e679457c2af347095bbf6b29","fast_id":"74379c7222f0a271da0fc2ecc364c339619a99c3aca9fc8f0eff2c4b0fd5e258","fast_time":0.0345706269,"language":"cpp","measured_fast_code_id":"74379c7222f0a271da0fc2ecc364c339619a99c3aca9fc8f0eff2c4b0fd5e258","measured_slow_code_id":"fef33cf053a9df843fbf5f3a7dc08fc5f17e8b15fc0cc53b0ee70dd7dab1937b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_436","problem_id":"p03748","slow_code_id":"cc1122cfa9b3085f22e27c70aef80be70382eebc940dd0e6f57129723ffacc7f","slow_id":"fef33cf053a9df843fbf5f3a7dc08fc5f17e8b15fc0cc53b0ee70dd7dab1937b","slow_time":0.1138037492,"speedup":3.2919203209473764,"stratum":"2-4","sampling_key":"13f260c4924fc24716a1fd0fa7378791a4838ce79f3888fe284d081c4e5412e8","slow_code":"\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <stack>\n\n#include <queue>\n\n#include <list>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <string>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#define ll unsigned long long\n\n#define db double\n\n#define inf 3001\n\n#define INF (int)1e8\n\n#define mod (int)(1e9 + 7)\n\n#define pi acos(-1)\n\n#define rd(n)                                                                  \\\n  {                                                                            \\\n    n = 0;                                                                     \\\n    char ch;                                                                   \\\n    int f = 0;                                                                 \\\n    do {                                                                       \\\n      ch = getchar();                                                          \\\n      if (ch == '-') {                                                         \\\n        f = 1;                                                                 \\\n      }                                                                        \\\n    } while (ch < '0' || ch > '9');                                            \\\n    while ('0' <= ch && ch <= '9') {                                           \\\n      n = (n << 1) + (n << 3) + ch - 48;                                       \\\n      ch = getchar();                                                          \\\n    }                                                                          \\\n    if (f)                                                                     \\\n      n = -n;                                                                  \\\n  }\n\nusing namespace std;\n\nint f[2][inf * 2];\n\nint DP(int n, int m) {\n\n  memset(f, 0, sizeof(f));\n\n  int now = 0;\n\n  for (int i = 0; i <= n; i++) {\n\n    f[now][i] = 1;\n  }\n\n  for (int i = 1; i <= m; i++) {\n\n    now ^= 1;\n\n    for (int j = 0; j <= n; j++) {\n\n      f[now][j] = 0;\n    }\n\n    for (int j = 0; j <= n; j++) {\n\n      if (j > 0) {\n\n        f[now][j - 1] = (f[now][j - 1] + f[now ^ 1][j]) % mod;\n\n        f[now][j] = (f[now][j] + f[now ^ 1][j]) % mod;\n      }\n\n      if (j < n) {\n\n        f[now][j + 1] = (f[now][j + 1] + f[now ^ 1][j]) % mod;\n\n        f[now][j] = (f[now][j] + f[now ^ 1][j]) % mod;\n      }\n    }\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i <= n; i++) {\n\n    ans = (ans + f[now][i]) % mod;\n  }\n\n  return ans;\n}\n\nint n, m;\n\nint main() {\n\n  rd(n) rd(m)\n\n      printf(\"%d\\n\", (DP(n, m) - DP(n - 1, m) + mod) % mod);\n\n  return 0;\n}","fast_code":"#include <cmath>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define gt getchar()\n\n#define ll long long\n\n#define File(s) freopen(s \".in\", \"r\", stdin), freopen(s \".out\", \"w\", stdout)\n\ntypedef std::pair<int, int> P;\n\n#define mk std::make_pair\n\n#define fr first\n\n#define sc second\n\ninline int in()\n\n{\n\n  int k = 0;\n  char ch = gt;\n  bool p = 1;\n\n  while (ch < '-')\n    ch = gt;\n  if (ch == '-')\n    ch = gt, p = 0;\n\n  while (ch > '-')\n    k = k * 10 + ch - '0', ch = gt;\n\n  return p ? k : -k;\n}\n\nconst int N = 3005, YL = 1e9 + 7;\n\ninline int MO(const int &x) { return x >= YL ? x - YL : x; }\n\ninline void add(int &x, int y) {\n  if ((x += y) >= YL)\n    x -= YL;\n}\n\nint f[2][N][2], now;\n\nint main()\n\n{\n\n  int n = in(), m = in();\n  f[now][0][1] = 1;\n\n  for (int i = 1; i <= n; ++i)\n    f[now][i][0] = 1;\n\n  for (int i = 1; i <= m; ++i)\n\n  {\n\n    now ^= 1;\n    memset(f[now], 0, sizeof f[now]);\n\n    for (int j = 1; j <= n; ++j)\n      add(f[now][j][0], f[now ^ 1][j - 1][0]);\n\n    for (int j = 1; j <= n; ++j)\n      add(f[now][j][1], f[now ^ 1][j - 1][1]);\n\n    for (int j = 1; j < n; ++j)\n      add(f[now][j][0], f[now ^ 1][j + 1][0]);\n\n    for (int j = 1; j < n; ++j)\n      add(f[now][j][1], f[now ^ 1][j + 1][1]);\n\n    add(f[now][0][1], f[now ^ 1][1][1]), add(f[now][0][1], f[now ^ 1][1][0]);\n\n    for (int j = 0; j < n; ++j)\n      add(f[now][j][0], f[now ^ 1][j][0]);\n\n    for (int j = 0; j < n; ++j)\n      add(f[now][j][1], f[now ^ 1][j][1]);\n\n    for (int j = 2; j <= n; ++j)\n      add(f[now][j][0], f[now ^ 1][j][0]);\n\n    for (int j = 2; j <= n; ++j)\n      add(f[now][j][1], f[now ^ 1][j][1]);\n\n    add(f[now][1][1], f[now ^ 1][1][1]), add(f[now][1][1], f[now ^ 1][1][0]);\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i <= n; ++i)\n    add(ans, f[now][i][1]);\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"3ab2e1eeea0445bf15cf663d3749905528a0e24295de19a7231bbdbe497e0ca8","fast_id":"e85aed2e3090810b06705b3327a63ef0a36229b5d89f9a357c138fc4fc96d761","fast_time":0.1048542023,"language":"cpp","measured_fast_code_id":"e85aed2e3090810b06705b3327a63ef0a36229b5d89f9a357c138fc4fc96d761","measured_slow_code_id":"069c3e0a130d329956c6de07fd6899c100a1afbeab3c3c52093a68dd162dd356","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4368","problem_id":"p04011","slow_code_id":"6c4e8c86d9696a6b755babbc7d8602516e2664c4acd4245c95f3c1a10d4bd500","slow_id":"069c3e0a130d329956c6de07fd6899c100a1afbeab3c3c52093a68dd162dd356","slow_time":0.3713234679,"speedup":3.541331293881771,"stratum":"2-4","sampling_key":"06076dfffc3e709dd096e16bc23fb305a4624761e8e84bac3ad540fb562364d8","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 100005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nbool check[maxii];\n\nbool dfs(int node, int c)\n\n{\n\n  check[node] = true;\n\n  arr2[node] = c;\n\n  for (int child = 0; child < vi[node].size(); child++)\n\n  {\n\n    if (check[vi[node][child]] == false)\n\n    {\n\n      if (dfs(vi[node][child], c ^ 1) == false)\n\n      {\n\n        return false;\n      }\n\n    }\n\n    else if (arr2[node] == arr2[vi[node][child]])\n\n    {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main()\n\n{\n\n  int n, k, x, y;\n\n  cin >> n >> k >> x >> y;\n\n  if (n <= k)\n\n  {\n\n    cout << n * x;\n\n  }\n\n  else\n\n  {\n\n    int res = k * x;\n\n    int res1 = n - k;\n\n    res1 = res1 * y;\n\n    cout << res + res1;\n  }\n}\n","fast_code":"#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  long long int n, k, x, y, rem, coast;\n\n  cin >> n >> k >> x >> y;\n\n  if (n > k)\n\n  {\n\n    rem = n - k;\n\n    coast = (k * x) + (rem * y);\n\n  }\n\n  else if (n == k)\n\n    coast = k * x;\n\n  else\n\n    coast = n * x;\n\n  cout << coast << endl;\n\n  return 0;\n}"}
{"fast_code_id":"d5baeaa7bc942b3bbcc643dc683a74f8ad50ecb684bc4e2c35cc2b247eaf65e6","fast_id":"e89f33c8b859a5b1a3dce496edd7a8f6b46c19217f1167b820dd24b84a13ea5d","fast_time":0.0438846691,"language":"cpp","measured_fast_code_id":"e89f33c8b859a5b1a3dce496edd7a8f6b46c19217f1167b820dd24b84a13ea5d","measured_slow_code_id":"597416b0aea4ab80d55bda14b7bc8e9965fb39835f8bb1e1bac1d11fa34384ab","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_43755","problem_id":"p03133","slow_code_id":"2d2f253c0fa7a6ca9348a96386b94cfbfebbbebc6cdcf773d865a90813324be6","slow_id":"597416b0aea4ab80d55bda14b7bc8e9965fb39835f8bb1e1bac1d11fa34384ab","slow_time":0.15935718,"speedup":3.6312722248599565,"stratum":"2-4","sampling_key":"06e2baeda031cad806a5b57e24e7c1c8513448d9602a6b7cad228d4642bb7b52","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)\n\n#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)\n\n#define PB push_back\n\n#define EB emplace_back\n\n#define MP make_pair\n\n#define FI first\n\n#define SE second\n\n#define SHOW1d(v, n)                                                                               \\\n  {                                                                                                \\\n    REP(WW, n) cerr << v[WW] << ' ';                                                               \\\n    cerr << endl << endl;                                                                          \\\n  }\n\n#define SHOW2d(v, WW, HH)                                                                          \\\n  {                                                                                                \\\n    REP(W_, WW) {                                                                                  \\\n      REP(H_, HH) cerr << v[W_][H_] << ' ';                                                        \\\n      cerr << endl;                                                                                \\\n    }                                                                                              \\\n    cerr << endl;                                                                                  \\\n  }\n\n#define ALL(v) v.begin(), v.end()\n\n#define Decimal fixed << setprecision(20)\n\n#define INF 1000000000\n\n#define LLINF 1000000000000000000LL\n\n#define MOD 998244353\n\n#define BIT_N 333\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef bitset<BIT_N> Bit;\n\nvector<int> baseNum;\n\nll pow_two[2 * BIT_N];\n\nlong long mod_div(long long a, long long b) {\n\n  long long tmp = MOD - 2, c = b, ret = 1;\n\n  while (tmp > 0) {\n\n    if (tmp & 1) {\n\n      ret *= c;\n      ret %= MOD;\n    }\n\n    c *= c;\n    c %= MOD;\n    tmp >>= 1;\n  }\n\n  return a * ret % MOD;\n}\n\n#define MAX_K 333333\n\nvector<long long> kaijo(MAX_K);\n\nlong long combination(long long n, long long r) {\n\n  if (n < r || n < 0 || r < 0)\n\n    return 0;\n\n  if (kaijo[0] != 1) {\n\n    kaijo[0] = 1;\n\n    for (long long i = 1; i < MAX_K; i++)\n      kaijo[i] = (kaijo[i - 1] * i) % MOD;\n  }\n\n  long long ret = kaijo[n];\n\n  long long tmp = (kaijo[r] * kaijo[n - r]) % MOD;\n\n  return mod_div(ret, tmp);\n}\n\nvector<Bit> gauss(vector<Bit> &v, ll &ran) {\n\n  ran = 0;\n\n  REP(i, BIT_N) {\n\n    int pla = -1;\n\n    for (int j = ran; j < v.size(); j++) {\n\n      if (v[j][i] == 1) {\n\n        pla = j;\n\n        break;\n      }\n    }\n\n    if (pla != -1) {\n\n      swap(v[ran], v[pla]);\n\n      for (int j = 0; j < v.size(); j++) {\n\n        if (j != ran && v[j][i] == 1)\n          v[j] ^= v[ran];\n      }\n\n      ran++;\n    }\n  }\n\n  return v;\n}\n\nint main() {\n\n  pow_two[0] = 1;\n\n  REP(i, BIT_N - 1) pow_two[i + 1] = pow_two[i] * 2 % MOD;\n\n  vector<Bit> v;\n\n  ll n, m;\n  cin >> n >> m;\n\n  REP(i, n) {\n\n    Bit now;\n\n    REP(j, m) {\n\n      int a;\n      cin >> a;\n\n      if (a)\n        now[j] = 1;\n    }\n\n    v.PB(now);\n  }\n\n  ll ran = 0;\n\n  ll ans = 0;\n\n  gauss(v, ran);\n\n  cout << ((pow_two[n] - pow_two[n - ran] + MOD) % MOD) * pow_two[m - 1] % MOD << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)\n\n#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)\n\n#define PB push_back\n\n#define EB emplace_back\n\n#define MP make_pair\n\n#define FI first\n\n#define SE second\n\n#define SHOW1d(v, n)                                                                               \\\n  {                                                                                                \\\n    REP(WW, n) cerr << v[WW] << ' ';                                                               \\\n    cerr << endl << endl;                                                                          \\\n  }\n\n#define SHOW2d(v, WW, HH)                                                                          \\\n  {                                                                                                \\\n    REP(W_, WW) {                                                                                  \\\n      REP(H_, HH) cerr << v[W_][H_] << ' ';                                                        \\\n      cerr << endl;                                                                                \\\n    }                                                                                              \\\n    cerr << endl;                                                                                  \\\n  }\n\n#define ALL(v) v.begin(), v.end()\n\n#define Decimal fixed << setprecision(20)\n\n#define INF 1000000000\n\n#define LLINF 1000000000000000000LL\n\n#define MOD 998244353\n\n#define fastcin()                                                                                  \\\n  cin.tie(0);                                                                                      \\\n  ios::sync_with_stdio(false)\n\n#define BIT_N 333\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef bitset<BIT_N> Bit;\n\nvector<int> baseNum;\n\nll pow_two[BIT_N];\n\nvector<Bit> gauss(vector<Bit> &v, ll &ran) {\n\n  ran = 0;\n\n  REP(i, BIT_N) {\n\n    int pla = -1;\n\n    for (int j = ran; j < v.size(); j++) {\n\n      if (v[j][i] == 1) {\n\n        pla = j;\n\n        break;\n      }\n    }\n\n    if (pla != -1) {\n\n      swap(v[ran], v[pla]);\n\n      for (int j = 0; j < v.size(); j++) {\n\n        if (j != ran && v[j][i] == 1)\n          v[j] ^= v[ran];\n      }\n\n      ran++;\n    }\n  }\n\n  return v;\n}\n\nint main() {\n\n  fastcin();\n\n  pow_two[0] = 1;\n\n  REP(i, BIT_N - 1) pow_two[i + 1] = pow_two[i] * 2 % MOD;\n\n  vector<Bit> v;\n\n  ll n, m;\n  cin >> n >> m;\n\n  REP(i, n) {\n\n    Bit now;\n\n    REP(j, m) {\n\n      int a;\n      cin >> a;\n\n      if (a)\n        now[j] = 1;\n    }\n\n    v.PB(now);\n  }\n\n  ll ran = 0;\n\n  ll ans = 0;\n\n  gauss(v, ran);\n\n  cout << ((pow_two[n] - pow_two[n - ran] + MOD) % MOD) * pow_two[m - 1] % MOD << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"4175971763a1118d8e400f3c33fe3d35e0a8de24ca12cf2a6a6fd471a83b71da","fast_id":"98b203bd578a18b4041588a5c4126671ac73f0b72b9a2c1484b052446d84f2dc","fast_time":0.0421827772,"language":"cpp","measured_fast_code_id":"98b203bd578a18b4041588a5c4126671ac73f0b72b9a2c1484b052446d84f2dc","measured_slow_code_id":"eab8f17ed23840d4e945f53871b7f71cf40d9893188b2db61837122ee7c6aa7f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_44028","problem_id":"p03650","slow_code_id":"67c6a1e7d9fcb220d7facc7204cc89af0353b801ebcaba4028e8461daaa80abb","slow_id":"eab8f17ed23840d4e945f53871b7f71cf40d9893188b2db61837122ee7c6aa7f","slow_time":0.5162544458,"speedup":12.238512494146544,"stratum":"8+","sampling_key":"055eddef9ebcc57a089430cb6c29c6aea84d72db688bb50f084c632d3177f87c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, p[200005], in[200005], ta, tb;\n\nset<int> s[200005];\n\nvector<int> x, y;\n\nbool v[200005];\n\nvoid go(int a) {\n\n  v[a] = 1;\n\n  for (int i = 0;; i++)\n\n    if (s[a].find(i) == s[a].end()) {\n\n      s[p[a]].insert(i);\n\n      break;\n    }\n\n  in[p[a]]--;\n\n  if (in[p[a]] == 0)\n\n    go(p[a]);\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%d\", p + i);\n\n    in[p[i]]++;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    if (!in[i] && !v[i])\n\n      go(i);\n\n  for (int i = 1; i <= n; i++)\n\n    if (!v[i]) {\n\n      ta = i;\n\n      while (1) {\n\n        x.push_back(ta);\n\n        if (p[ta] == i)\n\n          break;\n\n        ta = p[ta];\n      }\n\n      break;\n    }\n\n  for (int i = 0; y.size() < 2; i++)\n\n    if (s[x[0]].find(i) == s[x[0]].end())\n\n      y.push_back(i);\n\n  for (int i = 0; i < 2; i++) {\n\n    in[0] = y[i];\n\n    for (int j = 1; j < x.size(); j++)\n\n      for (int k = 0;; k++)\n\n        if (in[j - 1] != k && s[x[j]].find(k) == s[x[j]].end()) {\n\n          in[j] = k;\n\n          break;\n        }\n\n    if (i == 0 && in[x.size() - 1] != y[0]) {\n\n      printf(\"POSSIBLE\\n\");\n\n      return 0;\n    }\n\n    if (i == 1 && in[x.size() - 1] == y[0]) {\n\n      printf(\"POSSIBLE\\n\");\n\n      return 0;\n    }\n  }\n\n  printf(\"IMPOSSIBLE\\n\");\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2050000;\n\ninline int rd(register int x = 0, register char ch = getchar(), register int f = 0) {\n\n  for (; !isdigit(ch); ch = getchar())\n    f = ch == '-';\n\n  for (; isdigit(ch); ch = getchar())\n    x = (x << 1) + (x << 3) + ch - 48;\n\n  return f ? -x : x;\n}\n\nint n, B;\n\nint head[N], to[N << 1], nxt[N << 1], sta[N], vis[N], a[N], al[N];\n\nvector<int> scc;\n\nvoid lnk(int x, int y) { to[++B] = y, nxt[B] = head[x], head[x] = B; }\n\nvoid dfs(int x, int prt) {\n\n  if (vis[x]) {\n\n    for (int i = vis[x]; i <= sta[0]; ++i)\n      scc.push_back(sta[i]);\n\n    return;\n  }\n\n  sta[++sta[0]] = x, vis[x] = sta[0];\n\n  for (int i = head[x]; i; i = nxt[i])\n    if (to[i] != prt)\n      dfs(to[i], x);\n\n  vis[x] = 0;\n  --sta[0];\n}\n\nvoid DFS(int x, int prt) {\n\n  for (int i = head[x]; i; i = nxt[i])\n    if (to[i] != prt && !vis[to[i]])\n      DFS(to[i], x);\n\n  for (int i = head[x]; i; i = nxt[i])\n    if (to[i] != prt && !vis[to[i]])\n      al[a[to[i]]] = 1;\n\n  while (al[a[x]])\n    ++a[x];\n\n  for (int i = head[x]; i; i = nxt[i])\n    if (to[i] != prt && !vis[to[i]])\n      al[a[to[i]]] = 0;\n}\n\nint main() {\n\n  n = rd();\n\n  for (int i = 1; i <= n; ++i)\n    lnk(rd(), i);\n\n  for (int i = 1; i <= n; ++i)\n    if (!scc.size())\n      dfs(i, 0);\n\n  for (auto x : scc)\n    vis[x] = 1;\n\n  for (auto x : scc)\n    DFS(x, 0);\n\n  int mx = -n - 100, mn = n + 100;\n\n  for (auto x : scc)\n    mx = max(mx, a[x]), mn = min(mn, a[x]);\n\n  puts((mx == mn && scc.size() % 2 != 0) ? \"IMPOSSIBLE\" : \"POSSIBLE\");\n}"}
{"fast_code_id":"d5df3cf74e32f1d3d0e578bf7be0aacd57d20386dcac077d02d825f0abdcaeed","fast_id":"24f9b97a6314f4c749159181eb735aac5835b95b90bb6af9023e9a0f950354af","fast_time":0.0010444663,"language":"cpp","measured_fast_code_id":"24f9b97a6314f4c749159181eb735aac5835b95b90bb6af9023e9a0f950354af","measured_slow_code_id":"3b09c814a802b0e53c3ca3d5ea77cfa469c34a3563d75d55b2a0b3cd38a7c851","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_44084","problem_id":"p03946","slow_code_id":"d9e29121c48129cefae3c688b92ee122ac7a76161daf688c93ad67e95f643458","slow_id":"3b09c814a802b0e53c3ca3d5ea77cfa469c34a3563d75d55b2a0b3cd38a7c851","slow_time":0.0073565543,"speedup":7.0433620500728455,"stratum":"4-8","sampling_key":"3309a02dd3d662c10a0e6e6fb8d2a7604ee89940bb5264f2e447c610edf0bc6a","slow_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <iostream>\n\nusing namespace std;\n\nconst int N = 1e5 + 5;\n\nint ls[N], s[N], pos[N], num[N], n, a[N];\n\nint sum[N * 4];\n\nvoid add(int now, int l, int r, int pos) {\n\n  sum[now]++;\n\n  if (l == r)\n    return;\n\n  int mid = l + r >> 1;\n\n  if (pos <= mid)\n    add(now * 2, l, mid, pos);\n\n  else\n    add(now * 2 + 1, mid + 1, r, pos);\n}\n\nbool ask(int now, int l, int r, int L, int R) {\n\n  if (l > R || L > r)\n    return false;\n\n  if (L <= l && r <= R)\n    return (sum[now] != 0);\n\n  int mid = l + r >> 1;\n\n  return ask(now * 2, l, mid, L, R) | ask(now * 2 + 1, mid + 1, r, L, R);\n}\n\nbool ask(int pos) { return ask(1, 1, n, 1, pos); }\n\nvoid add(int pos) { add(1, 1, n, pos); }\n\nbool find(int x, int right) {\n\n  int l = 1, r = n;\n\n  for (int mid = l + r >> 1; l < r; mid = l + r >> 1) {\n\n    if (ls[mid] < x)\n      l = mid + 1;\n\n    else\n      r = mid;\n  }\n\n  while (ls[l] > x && l > 0)\n    l--;\n\n  if (l == 0)\n    return false;\n\n  return ask(l);\n}\n\nbool check(int x) {\n\n  memset(sum, 0, sizeof(sum));\n\n  for (int i = 1; i <= n; i++) {\n\n    if (find(a[i] - x, i))\n      return true;\n\n    add(num[i]);\n  }\n\n  return false;\n}\n\nint main()\n\n{\n\n  int minn = 0, maxn = 0, m;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%d\", &a[i]);\n\n    ls[i] = a[i];\n\n    maxn = max(maxn, a[i]);\n  }\n\n  sort(ls + 1, ls + n + 1);\n\n  for (int i = 1; i <= n; i++) {\n\n    num[i] = lower_bound(ls + 1, ls + n + 1, a[i]) - ls;\n\n    pos[num[i]] = i;\n  }\n\n  int l = minn, r = maxn;\n\n  for (int mid = (l + r) >> 1; l < r; mid = (l + r) >> 1) {\n\n    if (check(mid))\n      l = mid + 1;\n\n    else\n      r = mid;\n  }\n\n  if (!check(l))\n    l--;\n\n  memset(sum, 0, sizeof(sum));\n\n  int ans = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (find(a[i] - l, i))\n      ans++;\n\n    add(num[i]);\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n, t;\n\n  int money = 0, counts = 0;\n\n  cin >> n >> t;\n\n  int a[100001], b[100001];\n\n  for (int i = 0; i < n; ++i)\n\n    cin >> a[i];\n\n  for (int i = 0; i < n - 1; ++i)\n\n    b[i] = a[i + 1] - a[i];\n\n  int maxium[100001];\n\n  maxium[0] = b[0];\n\n  money = maxium[0];\n\n  counts = 1;\n\n  for (int i = 1; i < n - 1; ++i)\n\n  {\n\n    if (maxium[i - 1] > 0)\n\n      maxium[i] = maxium[i - 1] + b[i];\n\n    else\n\n      maxium[i] = b[i];\n\n    if (maxium[i] > money)\n\n    {\n\n      money = maxium[i];\n\n      counts = 1;\n\n    }\n\n    else if (maxium[i] == money)\n\n      ++counts;\n  }\n\n  cout << counts << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"2e6ad3c197ff605f709a1e22a0b17738ce782c79940e169d06fe6df3a84f2f4d","fast_id":"70fd0cbe70c2f49317131fb7fd880708b6205b0926b342675e23d30ad5a58f66","fast_time":0.0201311962,"language":"cpp","measured_fast_code_id":"70fd0cbe70c2f49317131fb7fd880708b6205b0926b342675e23d30ad5a58f66","measured_slow_code_id":"8fa1b8c5b4f28475b8cb15b3d3d214cdfcdc2200cd2da9b07728b833f90dd3ea","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4410","problem_id":"p00448","slow_code_id":"64c2e8efa31162ce88caed9a2e53bff643bcdbeead6626e98931139464e27e93","slow_id":"8fa1b8c5b4f28475b8cb15b3d3d214cdfcdc2200cd2da9b07728b833f90dd3ea","slow_time":1.0624777406,"speedup":52.77767550643613,"stratum":"8+","sampling_key":"35cf7bd0f27ddbe3d9b110cad70e3c9e2041180f07e04e684cbe0bd9c519a489","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\nint n, m, ans;\n\nint a[11][100001];\n\nvoid dfs(int x)\n\n{\n\n  int i, j;\n\n  if (x >= n)\n\n    return;\n\n  else\n\n  {\n\n    int sum = 0;\n\n    for (i = 0; i < m; i++)\n\n    {\n\n      int count = 0;\n\n      for (j = 0; j < n; j++)\n\n      {\n\n        if (a[j][i] == 1)\n\n          count++;\n      }\n\n      sum += max(count, n - count);\n    }\n\n    if (sum > ans)\n\n      ans = sum;\n\n    dfs(x + 1);\n\n    for (i = 0; i < m; i++)\n\n    {\n\n      if (a[x][i] == 1)\n\n        a[x][i] = 0;\n\n      else\n\n        a[x][i] = 1;\n    }\n\n    dfs(x + 1);\n\n    for (i = 0; i < m; i++)\n\n    {\n\n      if (a[x][i] == 1)\n\n        a[x][i] = 0;\n\n      else\n\n        a[x][i] = 1;\n    }\n  }\n}\n\nint main()\n\n{\n\n  int i, j;\n\n  while (~scanf(\"%d%d\", &n, &m))\n\n  {\n\n    if (n == 0 && m == 0)\n\n      break;\n\n    memset(a, 0, sizeof(a));\n\n    ans = 0;\n\n    for (i = 0; i < n; i++)\n\n    {\n\n      for (j = 0; j < m; j++)\n\n      {\n\n        scanf(\"%d\", &a[i][j]);\n      }\n    }\n\n    dfs(0);\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint M[15][10005];\n\nint r, c, ans;\n\nvoid Dfs(int now) {\n\n  if (now == r) {\n\n    int res = 0;\n\n    for (int i = 0; i < c; i++) {\n\n      int on = 0;\n\n      for (int j = 0; j < r; j++)\n\n        if (M[j][i] == 1)\n          on++;\n\n      res += max(on, r - on);\n    }\n\n    ans = max(ans, res);\n\n    return;\n  }\n\n  Dfs(now + 1);\n\n  for (int i = 0; i < c; i++)\n\n    M[now][i] = 1 - M[now][i];\n\n  Dfs(now + 1);\n}\n\nint main() {\n\n  while (~scanf(\"%d%d\", &r, &c)) {\n\n    if (!r && !c)\n      break;\n\n    for (int i = 0; i < r; i++)\n\n      for (int j = 0; j < c; j++)\n\n        scanf(\"%d\", &M[i][j]);\n\n    ans = 0;\n    Dfs(0);\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"caa3d4f2813ca49bb40ce4d71595c20fdca6405d03657335d52b2f7f43fab774","fast_id":"3ff5e6cf86972ead8477135b82a8670f2b9d1273e3bbb45e9c4f2db6006af192","fast_time":0.1131991918,"language":"cpp","measured_fast_code_id":"3ff5e6cf86972ead8477135b82a8670f2b9d1273e3bbb45e9c4f2db6006af192","measured_slow_code_id":"9b6c54c076d44e5161315df4839d96dc8f05f1e3c33a071a658120ab20574c19","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_44120","problem_id":"p03178","slow_code_id":"8c0d5c064ad1f82d5e1249ffa0a840b1f66f5a98fe9e7a12e685db658891bf90","slow_id":"9b6c54c076d44e5161315df4839d96dc8f05f1e3c33a071a658120ab20574c19","slow_time":1.4641940073,"speedup":12.93466838426668,"stratum":"8+","sampling_key":"80381241174ecbf9b9fbaa8d96fbf85c661c2d3d242293105c52d19b93946bb9","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint ans = -1, d, mod = 1e9 + 7, dp[10004][3][101];\n\nstring x;\n\nint solve(int i, int t, int cnt) {\n\n  if (i == x.size() - 1) {\n\n    if (cnt)\n      return 0;\n\n    return 1;\n  }\n\n  if (dp[i][t][cnt] != -1)\n    return dp[i][t][cnt];\n\n  int v = 0;\n\n  for (int j = 0; j < 10; j++) {\n\n    if (t == 0 && j == x[i + 1] - 48)\n      v = (v + solve(i + 1, 0, (cnt + j) % d)) % mod;\n\n    else if (t == 0 && j > x[i + 1] - 48)\n      break;\n\n    else\n      v = (v + solve(i + 1, 1, (cnt + j) % d)) % mod;\n  }\n\n  return dp[i][t][cnt] = v;\n}\n\nint main()\n\n{\n\n  memset(dp, -1, sizeof dp);\n\n  cin >> x >> d;\n\n  int first = x[0] - 48;\n\n  for (int i = 0; i < first; i++)\n    ans = (ans + solve(0, 1, i % d)) % mod;\n\n  ans = (ans + solve(0, 0, first % d)) % mod;\n\n  cout << ans % mod;\n\n  return 0;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\ntypedef long long ll;\n\n#define pb push_back\n\nconst int MOD = 1e9 + 7;\n\nconst int N = 1e5;\n\nint dp[N][100];\n\nvoid add(int &x, int y) {\n\n  x += y;\n\n  if (x > MOD)\n    x -= MOD;\n}\n\nint main() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n  cout.tie(0);\n\n  string a;\n\n  cin >> a;\n\n  int b;\n\n  cin >> b;\n\n  int k = a.size();\n\n  dp[0][0] = 1;\n\n  for (int i = 1; i < k; i++)\n\n    for (int j = 0; j < b; j++)\n\n      for (int x = 0; x < 10; ++x)\n\n        add(dp[i][j], dp[i - 1][((j - x) % b + b) % b]);\n\n  int ans = 0;\n\n  int sum = 0;\n\n  for (int i = 0; i < k; i++) {\n\n    for (int j = 0; j < (a[i] - '0'); j++)\n\n      add(ans, dp[k - i - 1][((b - sum - j) % b + b) % b]);\n\n    sum += (a[i] - '0');\n\n    sum %= b;\n  }\n\n  if (sum == 0)\n\n    ans++;\n\n  cout << ans - 1;\n\n  return 0;\n}\n"}
{"fast_code_id":"52419a12f085be8a14c804d51cb097eb3db158ec0587e0b10fbab5bb99e042e3","fast_id":"ebec31eb8f5607ebadcba89ac6b879088f956faa034124c6d15a7df659c31e9e","fast_time":0.0201057843,"language":"cpp","measured_fast_code_id":"ebec31eb8f5607ebadcba89ac6b879088f956faa034124c6d15a7df659c31e9e","measured_slow_code_id":"69502309f1b8d336a745da550c736177ebf0df454e9aeafc7f3ed35d775539fc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_44550","problem_id":"p03607","slow_code_id":"349d115226bf5927975c5492e9a493f42c8945810c8ce67a799f0d54f4b26fa0","slow_id":"69502309f1b8d336a745da550c736177ebf0df454e9aeafc7f3ed35d775539fc","slow_time":0.1475223021,"speedup":7.337306513330097,"stratum":"4-8","sampling_key":"8f19d795ccce75e1a2cc8f116ffe37d02ac4982064f28e9a1777669fcaa76588","slow_code":"#include <iostream>\n\n#include <stdio.h>\n\n#include <algorithm>\n\n#include <string.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n;\n\n  int a[100005];\n\n  scanf(\"%d\", &n);\n\n  memset(a, 0, sizeof(a));\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n  }\n\n  sort(a, a + n);\n\n  int x = 0;\n\n  for (int j = 0; j < n;)\n\n  {\n\n    if (a[j] == a[j + 1])\n\n    {\n\n      x += 0;\n\n      j += 2;\n\n    }\n\n    else\n\n    {\n\n      j += 1;\n\n      x++;\n    }\n  }\n\n  printf(\"%d\\n\", x);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nlong long a[1000010];\n\nint main()\n\n{\n\n  int n, x = 1, ans = 0;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n\n    scanf(\"%lld\", &a[i]);\n\n  sort(a, a + n);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    if (a[i] == a[i - 1])\n\n      x = (x + 1) % 2;\n\n    else\n\n    {\n\n      ans += x;\n\n      x = 1;\n    }\n  }\n\n  if (x % 2)\n\n    ans++;\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"6da8d2e740f22f41fa198875ee6d6ebd24819348f99d8146200ed4d0b8126a0f","fast_id":"51d30cd8e8ec677020debcce8173a4b601a93c9f5538003eadc98f8f073c7f84","fast_time":0.0111029733,"language":"cpp","measured_fast_code_id":"51d30cd8e8ec677020debcce8173a4b601a93c9f5538003eadc98f8f073c7f84","measured_slow_code_id":"f4a321c26443ab2b4e67666ffb33b81b199bc0a01fc3c3c54779ab6c3e6941f9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45207","problem_id":"p02911","slow_code_id":"496c966f7c8da89caa6b38c41a2176141a879dff964e0d7208900392a53bb068","slow_id":"f4a321c26443ab2b4e67666ffb33b81b199bc0a01fc3c3c54779ab6c3e6941f9","slow_time":0.278448071,"speedup":25.07869410079551,"stratum":"8+","sampling_key":"7b312b28a137351b2432c493ce802057caf4aa2c406a36d8b2b40f6453e36e28","slow_code":"#include <stdio.h>\n\n#include <iostream>\n\n#include <math.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int N;\n\n  long long K, Q;\n\n  long long a[500005] = {0};\n\n  cin >> N;\n\n  cin >> K;\n\n  cin >> Q;\n\n  for (int i = 1; i <= N; i++)\n\n  {\n    a[i] += K;\n    a[i] -= Q;\n  }\n\n  for (int i = 1; i <= Q; i++)\n\n  {\n\n    int op;\n\n    cin >> op;\n\n    a[op]++;\n  }\n\n  for (int j = 1; j <= N; j++)\n\n  {\n\n    if (a[j] > 0)\n\n      printf(\"Yes\\n\");\n\n    else\n\n      printf(\"No\\n\");\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  long long int n, k, q;\n\n  long long int p;\n\n  long long int a[100005];\n\n  scanf(\"%lld%lld%lld\", &n, &k, &q);\n\n  for (int i = 1; i <= n; i++)\n\n    a[i] = k;\n\n  for (int i = 1; i <= q; i++)\n\n  {\n\n    scanf(\"%lld\", &p);\n\n    a[p]++;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    a[i] -= q;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (a[i] <= 0)\n\n      printf(\"No\\n\");\n\n    else\n\n      printf(\"Yes\\n\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"e32cc74c6c4d4e29933fc643b1079380ddebf5f6aa7ce8026b6742ed9fe3376c","fast_id":"aea2486d839d3fac0875a8bc6d61fb3e5290d9999a479df3d740549361825c9d","fast_time":0.0001898182,"language":"cpp","measured_fast_code_id":"aea2486d839d3fac0875a8bc6d61fb3e5290d9999a479df3d740549361825c9d","measured_slow_code_id":"90b8ad3a0672dac6b26104923cb47bd82ca534505be5991b505ce08c72ba8394","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45313","problem_id":"p00494","slow_code_id":"43da8ca23c5606f3f10d3010acab55bd65e7c806f653bf1bedbc21f1984e2985","slow_id":"90b8ad3a0672dac6b26104923cb47bd82ca534505be5991b505ce08c72ba8394","slow_time":0.00121747,"speedup":6.4138739067170585,"stratum":"4-8","sampling_key":"5f2f3c5ffe63f3da36c15a14b1d070af2b470eac4bd3c1ca0cf6620bedcc3088","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <string>\n\n#include <algorithm>\n\nusing namespace std;\n\nchar x[1000005];\n\nint a = 0, b = 0, c = 0, d = 0, e, f, i, j, k, maxi = 0;\n\nint main() {\n\n  fill(x, x + 1000005, 'A');\n\n  scanf(\"%s\", x);\n\n  int leng = strlen(x);\n\n  while (1) {\n\n    if (a == leng) {\n      break;\n    }\n\n    if (x[a] != 'J') {\n\n      a++;\n\n    } else {\n\n      while (1) {\n\n        if (x[a] == 'J') {\n\n          b++;\n\n          a++;\n\n        } else {\n\n          break;\n        }\n      }\n\n      while (1) {\n\n        if (x[a] == 'O') {\n\n          c++;\n\n          a++;\n\n        } else {\n\n          break;\n        }\n      }\n\n      while (1) {\n\n        if (x[a] == 'I') {\n\n          d++;\n\n          a++;\n\n        } else {\n\n          break;\n        }\n      }\n\n      if (b >= c && c <= d) {\n\n        maxi = max(maxi, c);\n      }\n\n      b = 0;\n\n      c = 0;\n\n      d = 0;\n    }\n  }\n\n  printf(\"%d\\n\", maxi);\n  scanf(\"%d\", &a);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\nchar s[1000005];\n\nint min(int a, int b) { return a < b ? a : b; }\n\nint max(int a, int b) { return a > b ? a : b; }\n\nint main() {\n\n  scanf(\"%s\", &s);\n  int n = strlen(s), beg = 0, ret = 0;\n\n  while (beg < n)\n\n  {\n\n    if (s[beg] != 'J') {\n      beg++;\n      continue;\n    }\n\n    int j = 0, o = 0, i = 0;\n\n    while (beg < n && s[beg] == 'J') {\n      j++;\n      beg++;\n    }\n\n    while (beg < n && s[beg] == 'O') {\n      o++;\n      beg++;\n    }\n\n    while (beg < n && s[beg] == 'I') {\n      i++;\n      beg++;\n    }\n\n    if (o == min(j, min(o, i)))\n\n    {\n\n      ret = max(ret, o);\n    }\n  }\n\n  printf(\"%d\\n\", ret);\n}"}
{"fast_code_id":"33740efec946e44c532268efac8fe7c186c5adbeee5a40956f619bb7d4f1e566","fast_id":"3fb513af6e903ec276fcc5386c9f331763de18bc09c1bdf801935ecda7a51cf5","fast_time":0.0065490894,"language":"cpp","measured_fast_code_id":"3fb513af6e903ec276fcc5386c9f331763de18bc09c1bdf801935ecda7a51cf5","measured_slow_code_id":"8f728803af57c0956569d5f0b866e0cc045c78356cbb2fbf92d8c0064e49f592","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45319","problem_id":"p04028","slow_code_id":"25947dc37d7b4445f22b44cde7bb31c27ddbb353675782a5d1e06265f5276757","slow_id":"8f728803af57c0956569d5f0b866e0cc045c78356cbb2fbf92d8c0064e49f592","slow_time":0.0425883238,"speedup":6.502938225274494,"stratum":"4-8","sampling_key":"ae0e8c4edc60865bd1657709159a6d7d73f08ba4b416ac7feaa19e0d9d472704","slow_code":"#include <bits/stdc++.h>\n\n#define int long long\n\nusing namespace std;\n\nconst int N = 5005;\n\nconst int mod = 1e9 + 7;\n\nvoid add(int &x, int y) {\n\n  x += y;\n\n  x %= mod;\n}\n\nint dp[N], f[N];\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  int n;\n\n  string s;\n\n  cin >> n >> s;\n\n  dp[0] = 1;\n\n  for (int i = 0; i < n; i++) {\n\n    memset(f, 0, sizeof(f));\n\n    for (int j = 0; j <= i; j++) {\n\n      add(f[j + 1], dp[j]);\n\n      if (j)\n        add(f[j - 1], 2 * dp[j]);\n\n      else\n        add(f[j], dp[j]);\n    }\n\n    for (int j = 0; j < N; j++)\n      dp[j] = f[j];\n  }\n\n  cout << dp[s.length()];\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nconst long long mod = 1e9 + 7;\n\nlong long matmod(long long val, long long k) {\n\n  long long ret = 1ll;\n\n  for (; k; k >>= 1) {\n\n    if (k & 1)\n      ret = (val * ret) % mod;\n\n    val = (val * val) % mod;\n  }\n\n  return ret;\n}\n\nvoid add(long long &des, long long sor) {\n  des += sor;\n  des %= mod;\n  return;\n}\n\nchar s[5005];\n\nint n;\n\nlong long f[2][5005];\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  scanf(\"%s\", s);\n\n  int len = strlen(s);\n\n  if (len > n) {\n    puts(\"0\");\n    return 0;\n  }\n\n  long long mul = matmod(2ll, len);\n\n  f[0][0] = 1ll;\n\n  long long ans = f[0][len];\n\n  for (int i = 1; i <= n; i++) {\n\n    f[i & 1][0] = (f[(i - 1) & 1][0] + f[(i - 1) & 1][1]) % mod;\n\n    for (int j = 1; j <= i; j++) {\n\n      f[i & 1][j] = 0;\n\n      add(f[i & 1][j], f[(i - 1) & 1][j - 1] * 2ll);\n\n      add(f[i & 1][j], f[(i - 1) & 1][j + 1]);\n    }\n\n    add(ans, f[i & 1][len]);\n  }\n\n  long long tmp = matmod(mul, mod - 2ll);\n\n  long long newans = f[n & 1][len] * tmp % mod;\n\n  printf(\"%lld\\n\", newans);\n\n  return 0;\n}"}
{"fast_code_id":"8cc7164a00e8bccac8ff66cf44b8ac5f513600cbbe4d44f478aecb885be405ee","fast_id":"fba9020aec44b3eff6139f41edc4e74f5f78504ba5ce0ad451c2c8f95a19706d","fast_time":0.0868858319,"language":"cpp","measured_fast_code_id":"fba9020aec44b3eff6139f41edc4e74f5f78504ba5ce0ad451c2c8f95a19706d","measured_slow_code_id":"bdc2d355e55440ea09ba52fcaf538c383c38ad67bf2edac0ed6af99c1626ba33","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45322","problem_id":"p03419","slow_code_id":"cc820812c0a3d5bbc3e85ea98638762769b4942f57f7395af3159c04ea9aca8f","slow_id":"bdc2d355e55440ea09ba52fcaf538c383c38ad67bf2edac0ed6af99c1626ba33","slow_time":0.7978404503,"speedup":9.18263004281599,"stratum":"8+","sampling_key":"d9341f52f8e07065f3102321f184300753ec0877393d8d77403227aeca9a0ec1","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <random>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <cassert>\n\n#define int long long\n\n#define double long double\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define srep(i, n, m) for (int i = n; i < m; i++)\n\n#define elif else if\n\n#define pi 3.141592653589793\n\n#define prique priority_queue\n\nconstexpr auto mod = 1000000007;\n\nusing namespace std;\n\nint gcd(int a, int b) {\n\n  if (b == 0)\n    return a;\n\n  return gcd(b, a % b);\n}\n\nint lcm(int a, int b) { return a * b / gcd(a, b); }\n\nbool prime(int n) {\n\n  int cnt = 0;\n\n  for (int i = 1; i <= sqrt(n); i++) {\n\n    if (n % 1 == 0)\n      cnt++;\n  }\n\n  if (cnt != 1)\n    return false;\n\n  else\n    return n != 1;\n}\n\nstruct UnionFind {\n\n  vector<int> r;\n\n  UnionFind(int N) { r = vector<int>(N, -1); }\n\n  int root(int x) {\n\n    if (r[x] < 0)\n      return x;\n\n    return r[x] = root(r[x]);\n  }\n\n  bool unite(int x, int y) {\n\n    x = root(x);\n\n    y = root(y);\n\n    if (x == y)\n      return false;\n\n    if (r[x] > r[y])\n      swap(x, y);\n\n    r[x] += r[y];\n\n    r[y] = x;\n\n    return true;\n  }\n\n  int size(int x) { return -r[root(x)]; }\n};\n\nvector<int> v;\n\nint n, m, cnt = 0, ans = 0, aa[220000], ab[220000];\n\npair<int, int> pp[220000];\n\nstring s, ss[220000];\n\nqueue<int> que;\n\nsigned main() {\n\n  cin >> n >> m;\n\n  cout << abs(n - 2) * abs(m - 2);\n}","fast_code":"#include <iostream>\n\nusing namespace std;\n\nlong long n, m;\n\nint main() {\n\n  cin >> n >> m;\n\n  cout << abs(n - 2) * abs(m - 2);\n}"}
{"fast_code_id":"b11844a03bb607a0c4dc9f99d51fcda001e6d70a5b55a8a65f56fa2f4cc98916","fast_id":"d6d8ee15c6a7c364e38e74442e5b3b378bf20e35dd59520f96573632333e7e8e","fast_time":0.0515717868,"language":"cpp","measured_fast_code_id":"d6d8ee15c6a7c364e38e74442e5b3b378bf20e35dd59520f96573632333e7e8e","measured_slow_code_id":"15fb7a525c47b1a29ab773daf4e1b09c5f0f5943c6e93d73503e2c5505f2e45a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45324","problem_id":"p03530","slow_code_id":"d80fc8ae3145463e8681a33af15115be287d2d522a3230587512498ea0ff130e","slow_id":"15fb7a525c47b1a29ab773daf4e1b09c5f0f5943c6e93d73503e2c5505f2e45a","slow_time":0.6513490933,"speedup":12.629950089299602,"stratum":"8+","sampling_key":"dac084e58ecf5366270ce18836d06e326ee5d70adcfa891d72642ddbe7742762","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long lint;\n\ntypedef long double llf;\n\ntypedef pair<int, int> pi;\n\nconst int MAXN = 41;\n\nconst int mod = 1e9 + 7;\n\n#define sz(v) ((int)v.size())\n\nint n, m, px, py;\n\nchar str[MAXN][MAXN];\n\nint sum[MAXN][MAXN];\n\nint dp[MAXN][MAXN][MAXN][MAXN];\n\nbool has(int sx, int ex, int sy, int ey) {\n\n  return sx <= px && px < ex && sy <= py && py < ey;\n}\n\nint gs(int sx, int ex, int sy, int ey) {\n\n  return sum[ex][ey] - sum[sx][ey] - sum[ex][sy] + sum[sx][sy];\n}\n\nint f(int sx, int ex, int sy, int ey) {\n\n  if (ex - sx == 1 && ey - sy == 1)\n    return 0;\n\n  if (~dp[sx][ex][sy][ey])\n    return dp[sx][ex][sy][ey];\n\n  int ret = min({\n\n      gs(sx, px + 1, sy, py + 1),\n\n      gs(px, ex, py, ey),\n\n      gs(sx, px + 1, py, ey),\n\n      gs(px, ex, sy, py + 1)});\n\n  for (int i = sx + 1; i < ex; i++) {\n\n    int x1 = has(sx, i, sy, ey) ? f(sx, i, sy, ey) : gs(sx, i, sy, ey);\n\n    int x2 = has(i, ex, sy, ey) ? f(i, ex, sy, ey) : gs(i, ex, sy, ey);\n\n    ret = min(ret, x1 + x2);\n  }\n\n  for (int i = sy + 1; i < ey; i++) {\n\n    int x1 = has(sx, ex, sy, i) ? f(sx, ex, sy, i) : gs(sx, ex, sy, i);\n\n    int x2 = has(sx, ex, i, ey) ? f(sx, ex, i, ey) : gs(sx, ex, i, ey);\n\n    ret = min(ret, x1 + x2);\n  }\n\n  for (int i = sx + 1; i < ex; i++) {\n\n    for (int j = sy + 1; j < ey; j++) {\n\n      if (has(sx, i, sy, j)) {\n\n        ret = min(ret, f(sx, i, sy, j) + gs(i, ex, sy, j) + gs(sx, i, j, ey));\n      }\n\n      if (has(i, ex, sy, j)) {\n\n        ret = min(ret, f(i, ex, sy, j) + gs(i, ex, j, ey) + gs(sx, i, sy, j));\n      }\n\n      if (has(sx, i, j, ey)) {\n\n        ret = min(ret, f(sx, i, j, ey) + gs(sx, i, sy, j) + gs(i, ex, j, ey));\n      }\n\n      if (has(i, ex, j, ey)) {\n\n        ret = min(ret, f(i, ex, j, ey) + gs(sx, i, j, ey) + gs(i, ex, sy, j));\n      }\n    }\n  }\n\n  return dp[sx][ex][sy][ey] = ret;\n}\n\nint main() {\n\n  cin >> n >> m;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> str[i];\n\n    for (int j = 0; j < m; j++) {\n\n      if (str[i][j] == 'P') {\n\n        px = i;\n\n        py = j;\n      }\n\n      if (str[i][j] == '#')\n        sum[i + 1][j + 1]++;\n    }\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = 1; j <= m; j++) {\n\n      sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];\n    }\n  }\n\n  memset(dp, -1, sizeof(dp));\n\n  cout << f(0, n, 0, m) << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define F(i, a, b) for (int i = (a); i <= (b); ++i)\n\n#define D(i, a, b) for (int i = (a); i >= (b); --i)\n\n#define y1 yy1\n\nusing namespace std;\n\nconst int N = 50, inf = 1e9;\n\nchar a[N][N];\n\nint s[N][N];\n\nint dp[N][N][N][N];\n\ninline void cmin(int &x, int y) { x = x < y ? x : y; }\n\ninline int qsize(int x1, int y1, int x2, int y2) {\n\n  return s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1];\n}\n\nint main() {\n\n  int n, m;\n\n  scanf(\"%d%d\", &n, &m);\n\n  F(i, 1, n) scanf(\"%s\", a[i] + 1);\n\n  int px, py;\n\n  F(i, 1, n) F(j, 1, m) {\n\n    if (a[i][j] == 'P')\n\n      px = i, py = j, a[i][j] = '+';\n\n    s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (a[i][j] == '#');\n  }\n\n  F(x1, 1, n)\n  F(y1, 1, m) F(x2, x1, n) F(y2, y1, m)\n\n      dp[x1][y1][x2][y2] = inf;\n\n  dp[1][1][n][m] = 0;\n\n  int ans = inf;\n\n  F(x1, 1, n)\n  F(y1, 1, m)\n\n      D(x2, n, x1) D(y2, m, y1) {\n\n    if (px < x1 || px > x2 || py < y1 || py > y2)\n      continue;\n\n    int w = dp[x1][y1][x2][y2];\n\n    F(x, x1, x2) F(y, y1, y2) {\n\n      int c1 = qsize(x1, y1, x, y) + qsize(x + 1, y + 1, x2, y2);\n\n      int c2 = qsize(x1, y1, x2, y2) - c1;\n\n      cmin(dp[x1][y + 1][x][y2], w + c1);\n\n      cmin(dp[x + 1][y1][x2][y], w + c1);\n\n      cmin(dp[x1][y1][x][y], w + c2);\n\n      cmin(dp[x + 1][y + 1][x2][y2], w + c2);\n    }\n\n    cmin(ans, w + qsize(x1, y1, px, py));\n\n    cmin(ans, w + qsize(px, y1, x2, py));\n\n    cmin(ans, w + qsize(x1, py, px, y2));\n\n    cmin(ans, w + qsize(px, py, x2, y2));\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"2b54b48baacfcd5af3eef27b68f01a27ba6d8dd1b4ab72f64160b89b3051492f","fast_id":"193d9d7ca7cfa4fd26587ced82622717178dabbc5797b61cbcb9372e3464d835","fast_time":0.0964624981,"language":"cpp","measured_fast_code_id":"193d9d7ca7cfa4fd26587ced82622717178dabbc5797b61cbcb9372e3464d835","measured_slow_code_id":"f11ff195debb8a874b3aeeca68523b057ec9e00e7f3e2e5dd072f233c1f4bf40","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45327","problem_id":"p03185","slow_code_id":"ba887308bc8850039c8633709b0ce36dbf0f8ccb1d6555b188413bb9b50fb538","slow_id":"f11ff195debb8a874b3aeeca68523b057ec9e00e7f3e2e5dd072f233c1f4bf40","slow_time":0.2641552059,"speedup":2.738423854897036,"stratum":"2-4","sampling_key":"afa4d124c4527137571b52a9152bccfd862be52d2b012f64d872950483854431","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <string>\n\n#include <queue>\n\n#include <stack>\n\nusing namespace std;\n\n#define MOD 1000000007\n\n#define LINF (1LL << 60)\n\n#define EPS (1e-10)\n\ntypedef long long Int;\n\ntypedef pair<Int, Int> P;\n\n#define max(x, y) ((x) > (y) ? (x) : (y))\n\n#define min(x, y) ((x) < (y) ? (x) : (y))\n\nvector<Int> frompoInt(216000);\n\nInt dp[216000];\n\nInt n, C, h[216000];\n\nvoid add(vector<Int> &bit, Int ind, Int val) {\n\n  ind++;\n\n  while (ind < bit.size()) {\n\n    bit[ind] = max(bit[ind], val);\n\n    ind += ind & -ind;\n  }\n}\n\nInt sum(vector<Int> &bit, Int ind) {\n\n  ind++;\n\n  Int res = 0;\n\n  while (ind) {\n\n    res = max(res, bit[ind]);\n\n    ind -= ind & -ind;\n  }\n\n  return res;\n}\n\nInt calc(Int x, Int f) { return (h[f] - h[x]) * (h[f] - h[x]) + C + dp[f]; }\n\nint main() {\n\n  cin >> n >> C;\n\n  fill(dp, dp + n, LINF);\n\n  dp[0] = 0;\n\n  for (Int i = 0; i < n; i++)\n    cin >> h[i];\n\n  for (Int i = 0; i < n; i++) {\n\n    Int bottom = i, top = n;\n\n    if (i)\n      dp[i] = calc(i, sum(frompoInt, i));\n\n    while (top - bottom > 1) {\n\n      Int mid = (top + bottom) / 2;\n\n      if (calc(mid, i) >= calc(mid, sum(frompoInt, mid)))\n        bottom = mid;\n\n      else\n        top = mid;\n    }\n\n    add(frompoInt, top, i);\n  }\n\n  cout << dp[n - 1] << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cassert>\n\n#include <cmath>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <string>\n\n#include <queue>\n\n#include <stack>\n\nusing namespace std;\n\n#define MOD 1000000007\n\n#define MOD2 998244353\n\n#define INF ((1 << 30) - 1)\n\n#define LINF (1LL << 60)\n\n#define EPS (1e-10)\n\ntypedef long long Int;\n\ntypedef pair<Int, Int> P;\n\nInt n, c;\n\nInt dp[220000];\n\nInt h[220000];\n\nInt calc(P f, Int x) { return f.first * x + f.second; }\n\nstruct CHTrick {\n\n  vector<Int> to;\n\n  vector<P> f;\n\n  CHTrick() {}\n\n  void add_line(Int a, Int b) {\n\n    P new_f = P(a, b);\n\n    if (f.empty()) {\n\n      f.push_back(new_f);\n\n      return;\n    }\n\n    if (calc(new_f, INF) >= calc(f.back(), INF))\n      return;\n\n    if (calc(new_f, -INF) <= calc(f.front(), -INF)) {\n\n      f.clear();\n\n      to.clear();\n\n      f.push_back(new_f);\n\n      return;\n    }\n\n    while (!to.empty()) {\n\n      int lastl = to.back() + 1;\n\n      if (calc(new_f, lastl) <= calc(f.back(), lastl)) {\n\n        f.pop_back();\n\n        to.pop_back();\n\n      }\n\n      else\n        break;\n    }\n\n    int bottom;\n\n    if (to.empty())\n      bottom = -INF;\n\n    else\n      bottom = to.back() + 1;\n\n    int top = INF;\n\n    while (top - bottom > 1) {\n\n      int mid = (top + bottom) / 2;\n\n      if (calc(new_f, mid) <= calc(f.back(), mid))\n        top = mid;\n\n      else\n        bottom = mid;\n    }\n\n    to.push_back(bottom);\n\n    f.push_back(new_f);\n  }\n\n  Int get_min(int x) {\n\n    Int ind = lower_bound(to.begin(), to.end(), x) - to.begin();\n\n    return calc(f[ind], x);\n  }\n};\n\nint main() {\n\n  cin >> n >> c;\n\n  for (int i = 0; i < n; i++)\n    cin >> h[i];\n\n  CHTrick ch;\n\n  dp[0] = 0;\n\n  ch.add_line(-2 * h[0], dp[0] + h[0] * h[0]);\n\n  for (int i = 1; i < n; i++) {\n\n    dp[i] = ch.get_min(h[i]) + h[i] * h[i] + c;\n\n    ch.add_line(-2 * h[i], dp[i] + h[i] * h[i]);\n  }\n\n  cout << dp[n - 1] << endl;\n\n  return 0;\n}"}
{"fast_code_id":"5ad394169dae4275a09ede7c312ceed333606ee24395bd5f4414973f1c80eb30","fast_id":"d494f8823d2648a0ace522504321890cefd9de06fdf04bbb69a825a88fff8d07","fast_time":0.0196108089,"language":"cpp","measured_fast_code_id":"d494f8823d2648a0ace522504321890cefd9de06fdf04bbb69a825a88fff8d07","measured_slow_code_id":"5826bcdf90ab9ec6b3a279c0041f02a1502e8249358ef57b30cb2e564b6df609","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45350","problem_id":"p02958","slow_code_id":"54cf308f8ac218a6df4aad6e615942d746a5a065afc0fde48a29620aec577a5e","slow_id":"5826bcdf90ab9ec6b3a279c0041f02a1502e8249358ef57b30cb2e564b6df609","slow_time":0.1920600319,"speedup":9.793580309683199,"stratum":"8+","sampling_key":"3d636636ede56556604cbb59eb3ed3ba6785f0176be01eb3332b40e1d4e91be2","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long int\n\nusing namespace std;\n\nint main()\n\n{\n\n  ll n, a[100000 + 9], b[100000 + 9] = {0}, i, j, f = 0, c = 0;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    cin >> a[i];\n\n    b[i] = a[i];\n  }\n\n  sort(a, a + n);\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    if (a[i] != b[i])\n\n    {\n\n      f = 1;\n\n      c++;\n    }\n  }\n\n  if (f == 0)\n\n  {\n\n    cout << \"YES\" << endl;\n\n  }\n\n  else if (f == 1)\n\n  {\n\n    if (c == 2)\n\n    {\n\n      cout << \"YES\" << endl;\n\n    }\n\n    else\n\n    {\n\n      cout << \"NO\" << endl;\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int i, j, a[60], b[60], n, flag;\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n  }\n\n  for (i = 0, j = 1; i < n; i++, j++)\n\n  {\n\n    b[i] = j;\n  }\n\n  for (i = 0, flag = 0; i < n; i++)\n\n  {\n\n    if (a[i] != b[i])\n\n      flag++;\n  }\n\n  if (flag <= 2)\n\n    printf(\"YES\");\n\n  else\n\n    printf(\"NO\");\n\n  return 0;\n}"}
{"fast_code_id":"f4a37f2abefaa14119bfe6d9c0e0aaca4ba09ea49fafd30875894184a748af83","fast_id":"723501f0ddf2897c8c8182c2719e2b9885107ecdcc3e96fa3ead03442d75119c","fast_time":0.1082482247,"language":"cpp","measured_fast_code_id":"723501f0ddf2897c8c8182c2719e2b9885107ecdcc3e96fa3ead03442d75119c","measured_slow_code_id":"430cbc44f0368f0eba2aa907281f307a287598e011bc3e9a1f320fa6e5468cdb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4554","problem_id":"p02659","slow_code_id":"6e7009c838ae8332b290a916800efb97dd50e8b8a4aac9b96e15bb3670464d9a","slow_id":"430cbc44f0368f0eba2aa907281f307a287598e011bc3e9a1f320fa6e5468cdb","slow_time":0.6905038154,"speedup":6.378892746866453,"stratum":"4-8","sampling_key":"10cc74f729c39a6a600e43e477fbfa3b2e3f0af6db871b3c610656caae3cf656","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <utility>\n\n#include <iostream>\n\n#include <functional>\n\n#include <bitset>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <forward_list>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <numeric>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define pb push_back\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define INF 1e+9\n\nstruct edge {\n\n  int to;\n\n  double cost;\n};\n\nusing P = pair<double, int>;\n\nint V;\n\nconst int ci = 2e5 + 5;\n\nvector<edge> G[ci];\n\ndouble d[ci];\n\nvoid dijkstra(int s) {\n\n  priority_queue<P, vector<P>, greater<P> > que;\n\n  fill(d, d + V, INF);\n\n  d[s] = 0;\n\n  que.push(P(0, s));\n\n  while (!que.empty()) {\n\n    P p = que.top();\n\n    que.pop();\n\n    int v = p.second;\n\n    if (d[v] < p.first)\n      continue;\n\n    for (int i = 0; i < G[v].size(); i++) {\n\n      edge e = G[v][i];\n\n      if (d[e.to] > d[v] + e.cost) {\n\n        d[e.to] = d[v] + e.cost;\n\n        que.push(P(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nint main() {\n\n  long double a, b;\n  cin >> a >> b;\n\n  long long int ans = a * b;\n\n  cout << ans << endl;\n}","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <tuple>\n\n#include <cstdint>\n\n#include <cstdio>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <stack>\n\n#include <deque>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <bitset>\n\n#include <cctype>\n\n#include <numeric>\n\n#include <cmath>\n\n#include <iomanip>\n\n#include <cassert>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define pb push_back\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define REP(i, n) for (int i = 1; i <= (n); i++)\n\n#define P pair<int, int>\n\nint mx8[] = {0, 0, 1, -1, -1, 1, -1, 1};\n\nint my8[] = {-1, 1, 0, 0, -1, -1, 1, 1};\n\nint mx4[] = {1, -1, 0, 0};\n\nint my4[] = {0, 0, -1, 1};\n\nconst int MOD = 1000000007;\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  ll a;\n  double b;\n  cin >> a >> b;\n\n  ll b1 = b * 100 + 0.5;\n\n  ll ans = a * b1 / 100;\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"3b9777e99594aa2ebe04793724d86f80cbb7eca51604b0c7e9feb3051e40ee58","fast_id":"d3cb491e7f347169d3deac564704aa37a2604c6e814b9d293495eb94cae606f9","fast_time":0.1132640915,"language":"cpp","measured_fast_code_id":"d3cb491e7f347169d3deac564704aa37a2604c6e814b9d293495eb94cae606f9","measured_slow_code_id":"8944c1b9e3a2635a60596222244a696c8fa33e28e1fcd268b67ef42d6f5e5160","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45552","problem_id":"p00200","slow_code_id":"e443c911da68ffb53f03ca301272afd341ca49530fdae53443674a153e9ed7d2","slow_id":"8944c1b9e3a2635a60596222244a696c8fa33e28e1fcd268b67ef42d6f5e5160","slow_time":0.9965969279,"speedup":8.79887804423876,"stratum":"8+","sampling_key":"2e144c3e190a2e68d93b0ac22e149b8c45f6ac703887f726e4d8cbeb80fe4e78","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <list>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <stack>\n\n#include <numeric>\n\n#include <vector>\n\n#include <cstdio>\n\n#include <climits>\n\n#include <cfloat>\n\n#include <cstring>\n\n#define foreach(t, p, tit) for (t::iterator tit = p.begin(); tit != p.end(); ++tit)\n\n#define rforeach(t, p) for (t::reverse_iterator it = p.rbegin(); it != p.rend(); ++it)\n\n#define all(p) p.begin(), p.end()\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nusing namespace std;\n\nint costs[1010][1010];\n\nint times[1010][1010];\n\nint d[1010];\n\n#define INF 10000\n\nstruct E\n\n{\n\n  int a, b, c;\n\n  E(){};\n\n  E(int a, int b, int c) : a(a), b(b), c(c){};\n};\n\n#define MONEY 0\n\n#define EKI 1\n\nint main()\n\n{\n\n  int n, m;\n\n  while (cin >> n >> m)\n\n  {\n\n    if (n == 0 && m == 0)\n      break;\n\n    memset(costs, INF, sizeof(costs));\n\n    memset(times, INF, sizeof(times));\n\n    vector<E> cs;\n\n    vector<E> ts;\n\n    int a, b, c, t;\n\n    rep(i, n)\n\n    {\n\n      cin >> a >> b >> c >> t;\n\n      costs[a][b] = c;\n      costs[b][a] = c;\n\n      times[a][b] = t;\n      times[b][a] = t;\n\n      cs.push_back(E(a, b, c));\n\n      cs.push_back(E(b, a, c));\n\n      ts.push_back(E(a, b, t));\n\n      ts.push_back(E(b, a, t));\n    }\n\n    rep(i, m)\n\n    {\n\n      costs[i][i] = 0;\n\n      times[i][i] = 0;\n    }\n\n    int k, p, q, r;\n\n    cin >> k;\n\n    rep(i, k)\n\n    {\n\n      memset(d, INF, sizeof(d));\n\n      cin >> p >> q >> r;\n\n      d[p] = 0;\n\n      if (r == MONEY)\n\n      {\n\n        while (true)\n\n        {\n\n          bool update = false;\n\n          rep(j, n * 2)\n\n          {\n\n            if ((d[cs[j].a] != INF) && d[cs[j].b] > d[cs[j].a] + cs[j].c)\n\n            {\n\n              d[cs[j].b] = d[cs[j].a] + cs[j].c;\n\n              update = true;\n            }\n          }\n\n          if (!update)\n            break;\n        }\n\n        cout << d[q] << endl;\n\n      }\n\n      else\n\n      {\n\n        while (true)\n\n        {\n\n          bool update = false;\n\n          rep(j, n * 2)\n\n          {\n\n            if (d[ts[j].a] != INF && d[ts[j].b] > d[ts[j].a] + ts[j].c)\n\n            {\n\n              d[ts[j].b] = d[ts[j].a] + ts[j].c;\n\n              update = true;\n            }\n          }\n\n          if (!update)\n            break;\n        }\n\n        cout << d[q] << endl;\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <stack>\n\n#include <queue>\n\n#include <map>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(n) rep(i, n)\n\nconst int MAXN = 301, MAXM = 101;\n\nconst int INF = 1000000;\n\nconst int TIME = 1, COST = 0;\n\nint cost[2][MAXM][MAXM] = {};\n\nint d[MAXM] = {};\n\nbool used[MAXM] = {};\n\nint n, m, a, b, c, t, k;\n\nint p, q, r;\n\nint main()\n\n{\n\n  while (cin >> n >> m && n)\n\n  {\n\n    memset(cost, INF, sizeof(cost));\n\n    REP(n)\n\n    {\n\n      cin >> a >> b >> c >> t;\n\n      a--;\n\n      b--;\n\n      cost[COST][a][b] = cost[COST][b][a] = c;\n\n      cost[TIME][a][b] = cost[TIME][b][a] = t;\n    }\n\n    cin >> k;\n\n    rep(s, k)\n\n    {\n\n      cin >> p >> q >> r;\n\n      p--;\n\n      q--;\n\n      memset(d, INF, sizeof(d));\n\n      memset(used, false, sizeof(used));\n\n      d[p] = 0;\n\n      while (true)\n\n      {\n\n        int v = -1;\n\n        rep(i, m) if (!used[i] && (v == -1 || d[i] < d[v])) v = i;\n\n        if (v == -1)\n          break;\n\n        used[v] = true;\n\n        rep(i, m) d[i] = min(d[i], d[v] + cost[r][v][i]);\n      }\n\n      cout << d[q] << endl;\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"a6b802f76709ea38ee88e61a011acfb27a35e14f9cfa5fe625b784daef179eea","fast_id":"2792c6165c2868c178fdb18fe97e4e898414e261cf38d1f351aea99d3f81c342","fast_time":0.0558121307,"language":"cpp","measured_fast_code_id":"2792c6165c2868c178fdb18fe97e4e898414e261cf38d1f351aea99d3f81c342","measured_slow_code_id":"07e3cb1838623667fc87c4f835a287336b56df3f5bc4ce5c3c589b3c44b2339f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45579","problem_id":"p02551","slow_code_id":"96c83b4b6e85fcf84519b1fa1c16dab92fbefce36cbd64d9b7f0ed69320ca32a","slow_id":"07e3cb1838623667fc87c4f835a287336b56df3f5bc4ce5c3c589b3c44b2339f","slow_time":0.2295968315,"speedup":4.113744245567747,"stratum":"4-8","sampling_key":"34027b78fe9b00486acb1cafc992a852cf0abe15a8d80becaf73ecfa18a3785c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\nconst int maxn = 2e5 + 5;\n\nint minTA[maxn], minPA[maxn];\n\nint minTB[maxn], minPB[maxn];\n\nint lowbit(int x) { return x & -x; }\n\nvoid modify(int x, int c, int n, int minn[]) {\n\n  while (x <= n) {\n\n    minn[x] = min(minn[x], c);\n\n    x += lowbit(x);\n  }\n}\n\nint ask(int x, int n, int minn[]) {\n\n  int ans = 1e9;\n\n  while (x) {\n\n    ans = min(ans, minn[x]);\n\n    x -= lowbit(x);\n  }\n\n  return ans;\n}\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false);\n\n  ll n, q;\n  cin >> n >> q;\n\n  for (int i = 0; i < maxn; i++) {\n\n    minTA[i] = minTB[i] = minPA[i] = minPB[i] = 1e9;\n  }\n\n  ll ans = (n - 2) * (n - 2);\n\n  for (int g = 1; g <= q; g++) {\n\n    int op, x;\n    cin >> op >> x;\n\n    if (op == 1) {\n\n      int res = ask(x, n, minTA);\n\n      if (res == 1e9)\n        res = g - 1;\n\n      int res2 = minPB[res];\n\n      if (res2 == 1e9)\n        ans -= n - 2;\n\n      else\n        ans -= res2 - 2;\n\n      modify(x, g, n, minTA);\n\n      minPA[g] = x;\n\n    } else {\n\n      int res = ask(x, n, minTB);\n\n      if (res == 1e9)\n        res = g - 1;\n\n      int res2 = minPA[res];\n\n      if (res2 == 1e9)\n        ans -= n - 2;\n\n      else\n        ans -= res2 - 2;\n\n      modify(x, g, n, minTB);\n\n      minPB[g] = x;\n    }\n\n    minPB[g] = min(minPB[g], minPB[g - 1]);\n\n    minPA[g] = min(minPA[g], minPA[g - 1]);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\nconst int maxn = 2e5 + 5;\n\nint l[maxn], h[maxn];\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false);\n\n  ll n, q;\n  cin >> n >> q;\n\n  ll ans = (n - 2) * (n - 2), maxl = n, maxh = n;\n\n  for (int i = 2; i <= n; i++) {\n\n    l[i] = n;\n\n    h[i] = n;\n  }\n\n  while (q--) {\n\n    int op, x;\n    cin >> op >> x;\n\n    if (op == 1) {\n\n      if (x < maxl) {\n\n        for (int i = x; i <= maxl - 1; i++)\n          l[i] = maxh;\n\n        maxl = x;\n      }\n\n      ans -= l[x] - 2;\n\n    } else {\n\n      if (x < maxh) {\n\n        for (int i = x; i <= maxh - 1; i++)\n          h[i] = maxl;\n\n        maxh = x;\n      }\n\n      ans -= h[x] - 2;\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"4e6e0b23239e276ad3783d767f974938086f08c5a528963b1de40ce054799ae9","fast_id":"22536a5c10cd9cc18d4043ba52fb66ecf60222e918c14f88e8dbcab8c7d8ee10","fast_time":0.2729651327,"language":"cpp","measured_fast_code_id":"22536a5c10cd9cc18d4043ba52fb66ecf60222e918c14f88e8dbcab8c7d8ee10","measured_slow_code_id":"22b91962513fa0b79f260219def6dba1cd62f257510f2723d27ed94f9d0cd4f9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45583","problem_id":"p03306","slow_code_id":"3d33d702acd663e2479d7d3862440e888e56084310b5e5bb9f63a2673c39c82f","slow_id":"22b91962513fa0b79f260219def6dba1cd62f257510f2723d27ed94f9d0cd4f9","slow_time":0.5561190303,"speedup":2.0373262504233383,"stratum":"2-4","sampling_key":"01b2fb03cc55d70677361490a7b0ba6036a54350dfa59e64459f864cd0c95322","slow_code":"\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <vector>\n\n#include <queue>\n\nusing namespace std;\n\nconst int MAXN = 1e5;\n\nint n_pnt, n_edg;\n\nstruct NODE {\n\n  int p, val;\n\n  NODE() {}\n\n  NODE(int a, int b) {\n    p = a;\n    val = b;\n  }\n};\n\nstruct QUEUE {\n\n  int u, p;\n\n  long long val;\n\n  QUEUE() {}\n\n  QUEUE(int a, int b, long long c) {\n    u = a;\n    p = b;\n    val = c;\n  }\n};\n\nvector<pair<int, int> > lnk[MAXN + 5];\n\nlong long vis[2][MAXN + 5];\n\ninline int G(int p) { return p == 1; }\n\nlong long MIN = -1e15, MAX = 1e15;\n\nint main()\n\n{\n\n  fill(vis[0], vis[0] + MAXN + 5, 1e15);\n\n  fill(vis[1], vis[1] + MAXN + 5, 1e15);\n\n  scanf(\"%d%d\", &n_pnt, &n_edg);\n\n  for (int i = 0, u, v, l; i < n_edg; i++)\n\n    scanf(\"%d%d%d\", &u, &v, &l),\n\n        lnk[u].push_back(make_pair(v, l)), lnk[v].push_back(make_pair(u, l));\n\n  queue<QUEUE> que;\n\n  que.push(QUEUE(1, 1, 0));\n\n  while (!que.empty())\n\n  {\n\n    QUEUE fro = que.front();\n    que.pop();\n\n    for (int i = 0; i < lnk[fro.u].size(); i++)\n\n    {\n\n      int v = lnk[fro.u][i].first, l = lnk[fro.u][i].second;\n\n      long long val = l - fro.val;\n      int p = fro.p == 1 ? -1 : 1;\n\n      if (vis[G(p)][v] != 1e15)\n\n      {\n\n        if (val != vis[G(p)][v])\n\n        {\n\n          printf(\"%d\\n\", 0);\n\n          return 0;\n\n        }\n\n        else\n\n          continue;\n      }\n\n      vis[G(p)][v] = val;\n\n      if (G(p))\n\n        MIN = max(MIN, max((long long)0, -vis[1][v]));\n\n      else\n\n        MAX = min(MAX, vis[0][v]);\n\n      que.push(QUEUE(v, p, val));\n    }\n  }\n\n  long long ans = -1;\n\n  for (int i = 1; i <= n_pnt; i++)\n\n    if (vis[0][i] != 1e15 && vis[1][i] != 1e15)\n\n    {\n\n      int res = (vis[0][i] - vis[1][i]) / 2;\n\n      if (res < 0) {\n        printf(\"0\\n\");\n        return 0;\n      }\n\n      if (ans == -1)\n        ans = res;\n\n      if (ans != res) {\n        printf(\"0\\n\");\n        return 0;\n      }\n    }\n\n  if (ans != -1)\n\n  {\n\n    if (MIN < ans && ans < MAX)\n\n      printf(\"%d\\n\", 1);\n\n    else\n\n      printf(\"%d\\n\", 0);\n\n    return 0;\n  }\n\n  if (MAX - MIN - 1 < 0)\n    printf(\"%d\\n\", 0);\n\n  else\n    printf(\"%lld\\n\", MAX - MIN - 1);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <climits>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <queue>\n\nusing namespace std;\n\n#define MAXN 100000\n\n#define MAXM 100000\n\n#define INF 1000000000000000\n\nstruct node\n\n{\n\n  int next, to;\n\n  long long w;\n\n} e[MAXM * 2 + 5];\n\nstruct Qr\n\n{\n\n  int xr, dec;\n\n  long long lim;\n};\n\nlong long T;\n\nint cnt, m, n;\n\nint x, y, z, flag;\n\nlong long ri = INF, le = -INF;\n\nlong long vis[2][MAXN + 5];\n\nint b[MAXN + 5];\n\nvoid fpush(int u, int v, long long w)\n\n{\n\n  e[++cnt].next = b[u];\n\n  e[cnt].w = w;\n\n  e[cnt].to = v;\n\n  b[u] = cnt;\n}\n\nint Ch(int x) {\n  if (x == -1)\n    x = 0;\n  return x;\n}\n\nvoid dfs(int xr, int dec, long long lim)\n\n{\n\n  if (flag)\n    return;\n\n  for (int i = b[xr]; i; i = e[i].next)\n\n  {\n\n    int xnext = e[i].to;\n\n    long long nlim = e[i].w - lim;\n\n    int FD = Ch(dec);\n\n    if (vis[FD][xnext] != INF)\n\n    {\n\n      if (vis[FD][xnext] != nlim) {\n        flag = 1;\n        return;\n      }\n\n      else\n        continue;\n    }\n\n    vis[FD][xnext] = nlim;\n\n    if (!FD)\n      le = max(le, -vis[FD][xnext]);\n\n    else\n      ri = min(ri, vis[FD][xnext]);\n\n    dfs(xnext, -dec, nlim);\n  }\n}\n\nint main()\n\n{\n\n  fill(vis[0], vis[0] + MAXN + 1, INF);\n\n  fill(vis[1], vis[1] + MAXN + 1, INF);\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    scanf(\"%d%d%d\", &x, &y, &z);\n\n    fpush(x, y, z);\n    fpush(y, x, z);\n  }\n\n  dfs(1, 1, 0);\n\n  if (flag) {\n    printf(\"0\\n\");\n    return 0;\n  }\n\n  long long T = -1;\n\n  for (int i = 1; i <= n; i++)\n\n    if (vis[0][i] != INF && vis[1][i] != INF)\n\n    {\n\n      long long NT = (vis[1][i] - vis[0][i]) / 2;\n\n      if (NT < 0) {\n        flag = 1;\n        break;\n      }\n\n      if (T == -1)\n        T = NT;\n\n      else if (T != NT) {\n        flag = 1;\n        break;\n      }\n    }\n\n  if (flag) {\n    printf(\"0\\n\");\n    return 0;\n  }\n\n  if (T != -1)\n\n  {\n\n    if (T > le && T < ri)\n      printf(\"1\\n\");\n\n    else\n      printf(\"0\\n\");\n\n  }\n\n  else\n    printf(\"%lld\", max((long long)0, ri - le - 1));\n}"}
{"fast_code_id":"767d8e52209205b6888c09e17f9a2e805168503703a44941d70f4145c0a80191","fast_id":"5a6d6d9aed7743f554044884e41a439d23639f33e2e879527876cefb5009221d","fast_time":0.0058612869,"language":"cpp","measured_fast_code_id":"5a6d6d9aed7743f554044884e41a439d23639f33e2e879527876cefb5009221d","measured_slow_code_id":"20ec3ef60041f7ce6aae4c61ef31f47f2a91021e41fb588cea708eacd78e23c9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45597","problem_id":"p00211","slow_code_id":"326cc7b68a35723448d4d127fa62c220e26130d5683cba9a036428c256ff06e6","slow_id":"20ec3ef60041f7ce6aae4c61ef31f47f2a91021e41fb588cea708eacd78e23c9","slow_time":0.0308351984,"speedup":5.260823932710068,"stratum":"4-8","sampling_key":"9b9924ec78050956570bb2261e61dfb0a637a0df1fc4858bab698915e970ffa1","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nlong long d[10], v[10];\n\nvoid compute(int n) {\n\n  for (int i = 2; i <= min(d[n], v[n]); i++) {\n\n    if (d[n] % i == 0 || v[n] % i == 0) {\n\n      while (d[n] % i == 0 && v[n] % i == 0) {\n\n        d[n] /= i;\n\n        v[n] /= i;\n      }\n    }\n  }\n}\n\nint main() {\n\n  int n;\n\n  while (cin >> n, n) {\n\n    long long a, b;\n\n    for (int i = 0; i < n; i++) {\n\n      cin >> d[i] >> v[i];\n\n      compute(i);\n    }\n\n    a = (d[0] * d[1]) / __gcd(d[0], d[1]);\n\n    b = __gcd(v[0], v[1]);\n\n    for (int i = 2; i < n; i++) {\n\n      a = (a * d[i]) / __gcd(a, d[i]);\n\n      b = __gcd(b, v[i]);\n    }\n\n    for (int i = 0; i < n; i++) {\n\n      cout << a * v[i] / (b * d[i]) << endl;\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define MAX 10\n\ntypedef long long ll;\n\nll d[MAX], v[MAX];\n\nll gcd(ll a, ll b) { return __gcd(a, b); }\n\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\n\nint main() {\n\n  int n;\n\n  while (scanf(\"%d\", &n), n) {\n\n    for (int i = 0; i < n; i++) {\n\n      scanf(\"%lld %lld\", &d[i], &v[i]);\n\n      ll a = gcd(d[i], v[i]);\n\n      d[i] /= a;\n\n      v[i] /= a;\n    }\n\n    ll T = d[0], V = v[0];\n\n    for (int i = 1; i < n; i++) {\n\n      T = lcm(T, d[i]);\n\n      V = gcd(V, v[i]);\n    }\n\n    for (int i = 0; i < n; i++) {\n\n      ll div = T / d[i];\n\n      printf(\"%lld\\n\", div * v[i] / V);\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"a10b71cff9ff3522c0e1b403716a9d3b2b143ff423264fdb642b4e9fb24c628d","fast_id":"550b3f7f9cc82d2e7eaa21e8ba4e81b75fc29cb2ebf3c75070643655791c58a2","fast_time":0.0241885887,"language":"cpp","measured_fast_code_id":"550b3f7f9cc82d2e7eaa21e8ba4e81b75fc29cb2ebf3c75070643655791c58a2","measured_slow_code_id":"357c498f49f4adfa344b768e83e33a95ca2af10e4caeb729ec9a36e9098d190d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45614","problem_id":"p03733","slow_code_id":"ee6e91b94676356b3795ba07cd318497d8a7804864b514dcb155f751177ac8ce","slow_id":"357c498f49f4adfa344b768e83e33a95ca2af10e4caeb729ec9a36e9098d190d","slow_time":0.1078683932,"speedup":4.45947444631195,"stratum":"4-8","sampling_key":"44f7f3144105b39f6d506e7e9a607af2beb65d5379fad1325d8778d1c1ce74d9","slow_code":"#include <iostream>\n\n#include <cstring>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <algorithm>\n\n#include <map>\n\n#include <cmath>\n\n#include <cstdlib>\n\nusing namespace std;\n\nconst int M = 200005;\n\nlong long int n, m, flag, sum;\n\nint a[M];\n\nint main()\n\n{\n\n  cin >> n >> m;\n\n  cin >> a[1];\n\n  sum = 0;\n\n  for (int i = 2; i <= n; i++)\n\n  {\n\n    cin >> a[i];\n\n    if (a[i] - a[i - 1] >= m)\n\n      sum += m;\n\n    else if (a[i] - a[i - 1] < m)\n\n      sum += a[i] - a[i - 1];\n  }\n\n  sum += m;\n\n  cout << sum << endl;\n}\n","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int a[200005];\n\n  int b[200005];\n\n  int n, i, t;\n\n  scanf(\"%d %d\", &n, &t);\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n\n    b[i] = a[i] + t;\n  }\n\n  for (i = 1; i <= n - 1; i++)\n\n  {\n\n    if (b[i] > a[i + 1])\n\n    {\n\n      a[i + 1] = b[i];\n    }\n  }\n\n  int sum = 0;\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    sum = sum + b[i] - a[i];\n  }\n\n  printf(\"%d\\n\", sum);\n\n  return 0;\n}\n"}
{"fast_code_id":"cbc5485ad7210bdb9f9f7c9ea5c6e2c5f93d735bb0c891b1ad8339b02463ca02","fast_id":"2d55bc57b65a707d54643471311c20a1e55114cf2c9b1ce22eac2102e77d0a33","fast_time":0.0059922917,"language":"cpp","measured_fast_code_id":"2d55bc57b65a707d54643471311c20a1e55114cf2c9b1ce22eac2102e77d0a33","measured_slow_code_id":"586a5231b4a89bcbc23d087b26e911582cdb6c64ecfb1b7ec894920457647d19","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45660","problem_id":"p02624","slow_code_id":"8bb133ec1d0a8bc50feb9adc32d5ae68c7df30003569f0cba25a2b36c19ccc91","slow_id":"586a5231b4a89bcbc23d087b26e911582cdb6c64ecfb1b7ec894920457647d19","slow_time":0.0216066024,"speedup":3.605732744952987,"stratum":"2-4","sampling_key":"869ace340384f624607c403d3769ee332bbf9dae9402ea31275047f9903b68ae","slow_code":"#include <stdio.h>\n\n#define LL long long\n\nLL ans, b;\n\nint n, prime[2000], not_prime[10010], tot;\n\nvoid linear_shaker(int x) {\n\n  int i, j;\n\n  for (i = 2; i <= x; i++) {\n\n    if (!not_prime[i])\n      prime[++tot] = i;\n\n    for (j = 1; prime[j] * i <= x; j++) {\n\n      not_prime[prime[j] * i] = 1;\n\n      if (i % prime[j] == 0)\n        break;\n    }\n  }\n}\n\nint main() {\n\n  int i, n, cnt, x, j;\n\n  linear_shaker(10000);\n\n  ans = 0;\n\n  scanf(\"%d\", &n);\n\n  for (i = 1; i <= n; i++) {\n\n    x = i, b = 1;\n\n    for (j = 1; prime[j] * prime[j] <= x; j++) {\n\n      cnt = 0;\n\n      if (x % prime[j] == 0) {\n\n        while (x % prime[j] == 0)\n          x /= prime[j], cnt++;\n\n        b *= (cnt + 1);\n      }\n    }\n\n    if (x > 1)\n      b *= 2;\n\n    ans += b * i;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#define LL long long\n\nLL ans;\n\nint main() {\n\n  int n, i, m, a, b;\n\n  scanf(\"%d\", &n);\n\n  for (i = 1; i <= n; i++) {\n\n    m = n / i;\n\n    a = i, b = a + (m - 1) * i;\n\n    ans += (LL)(a + b) * m / 2;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"fbbff6fe6680d748f244baaee668a972f80447f544199411422c9d8470d0f905","fast_id":"d438c4ebe47b0feb4f998d71c7b545b06789d527e0280a395172e57de4672b97","fast_time":0.0069992525,"language":"cpp","measured_fast_code_id":"d438c4ebe47b0feb4f998d71c7b545b06789d527e0280a395172e57de4672b97","measured_slow_code_id":"a36ee8c31d929c8dbf18f797eb611f4972062b1dc984aa5c4c747de7266dd4a4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45697","problem_id":"p02345","slow_code_id":"3c41582f4b82c023ff3c3a54e83f6e2ca2f9e427cbf932449b1562e5cebb3e80","slow_id":"a36ee8c31d929c8dbf18f797eb611f4972062b1dc984aa5c4c747de7266dd4a4","slow_time":0.3160204885,"speedup":45.1506055110885,"stratum":"8+","sampling_key":"5afc16b31179e9dc23f001924cbfd6e54212495c59a8b1d57945aa7afff51e7d","slow_code":"#include <cstdio>\n\n#include <vector>\n\n#include <map>\n\n#include <climits>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef pair<int, int> Pt;\n\n#define MAX 1000001\n\n#define fr first\n\n#define sc second\n\nint n, dat[MAX * 2 - 1];\n\nvoid update(int i, int x) {\n\n  i += n - 1;\n\n  dat[i] = x;\n\n  while (i > 0) {\n\n    i = (i - 1) / 2;\n\n    dat[i] = min(dat[i * 2 + 1], dat[i * 2 + 2]);\n  }\n}\n\nint query(int a, int b, int k, int l, int r) {\n\n  if (r <= a || b <= l)\n    return INT_MAX;\n\n  if (a <= l && r <= b)\n    return dat[k];\n\n  return min(query(a, b, k * 2 + 1, l, (l + r) / 2),\n             query(a, b, k * 2 + 2, (l + r) / 2, r));\n}\n\nint main() {\n\n  int q, a, b, c, N;\n\n  for (int i = 0; i < MAX * 2 - 1; i++)\n    dat[i] = INT_MAX;\n\n  scanf(\"%d %d\", &N, &q);\n\n  n = 1;\n\n  while (n < N)\n    n *= 2;\n\n  while (q--) {\n\n    scanf(\"%d %d %d\", &a, &b, &c);\n\n    if (!a)\n      update(b, c);\n\n    else\n      printf(\"%d\\n\", query(b, c + 1, 0, 0, n));\n  }\n}","fast_code":"\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <climits>\n\nusing namespace std;\n\n#define MAX (1 << 17)\n\nconst int INF = INT_MAX;\n\nint n, seg[MAX * 2 - 1];\n\nvoid update(int i, int x) {\n\n  i += n - 1;\n\n  seg[i] = x;\n\n  while (i > 0) {\n\n    i = (i - 1) / 2;\n\n    seg[i] = min(seg[i * 2 + 1], seg[i * 2 + 2]);\n  }\n}\n\nint query(int a, int b, int k, int l, int r) {\n\n  if (r <= a || b <= l)\n    return INF;\n\n  if (a <= l && r <= b)\n    return seg[k];\n\n  int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\n  int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\n  return min(vl, vr);\n}\n\nvoid init(int &size) {\n\n  n = 1;\n\n  while (n < size)\n    n *= 2;\n\n  fill_n(seg, n * 2 - 1, INF);\n}\n\nint main() {\n\n  int size, q;\n\n  scanf(\"%d %d\", &size, &q);\n\n  init(size);\n\n  while (q--) {\n\n    int com, a, b;\n\n    scanf(\"%d %d %d\", &com, &a, &b);\n\n    if (com == 0)\n      update(a, b);\n\n    else\n      printf(\"%d\\n\", query(a, b + 1, 0, 0, n));\n  }\n}"}
{"fast_code_id":"579791004a9fc4e8bdbdf565946d233ded95e7bd06e8420b4933b1ad5c163c90","fast_id":"636eb27d0eaf0f87cea68b59a6a15846622e3aa9e8965efa615d33e2ca8e866c","fast_time":0.0173830402,"language":"cpp","measured_fast_code_id":"636eb27d0eaf0f87cea68b59a6a15846622e3aa9e8965efa615d33e2ca8e866c","measured_slow_code_id":"6b809a6379c7794a3cbeec683ceabb043b7fde132d042f40189db8c702abec1f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4577","problem_id":"p03069","slow_code_id":"19009e2d89b88a8b34c1c5204ea73143cc9c7b52a0bf187847f5b9a8b28e3a8d","slow_id":"6b809a6379c7794a3cbeec683ceabb043b7fde132d042f40189db8c702abec1f","slow_time":0.0598160492,"speedup":3.4410579801800143,"stratum":"2-4","sampling_key":"0fade352c1bec2b9e311f3a2874ea5447518e1ceb7831878b0ef66c8faf11ef7","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int c = 300000;\n\nint main() {\n\n  int n, b[c] = {}, w[c] = {}, ans = c;\n\n  string s;\n\n  cin >> n >> s;\n\n  for (int i = 0; i < n; i++) {\n\n    int flag = 0, flag1 = 0;\n\n    if (s[i] == '#')\n      flag++;\n\n    b[i + 1] = b[i] + flag;\n\n    if (s[n - i - 1] == '.')\n      flag1++;\n\n    w[i + 1] = w[i] + flag1;\n  }\n\n  reverse(w, w + n + 1);\n\n  for (int i = 0; i <= n; i++)\n    ans = min(ans, b[i] + w[i]);\n\n  cout << ans << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  int n, w = 0, b = 0;\n\n  string s;\n\n  cin >> n >> s;\n\n  for (int i = 0; i < n; i++) {\n\n    if (s[i] == '.')\n      w++;\n  }\n\n  int ans = w;\n\n  for (int i = 0; i < n; i++) {\n\n    if (s[i] == '#')\n      b++;\n\n    else\n      w--;\n\n    ans = min(ans, b + w);\n  }\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"39a3b286a63793a1b292a4fdfc0d7b57a0cf45dcdd1b7ef34ce83cd5e3df4a71","fast_id":"7e95152fb720b68fb0e2110f53980b141416a35bad3d51a36189c742e0d80515","fast_time":0.094092604,"language":"cpp","measured_fast_code_id":"7e95152fb720b68fb0e2110f53980b141416a35bad3d51a36189c742e0d80515","measured_slow_code_id":"645df5d61aeba7a6a18e6d6502741937dded5dc2862fb844b2b1c17995dbab7e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4579","problem_id":"p01696","slow_code_id":"36efb025a7b77e167d04b0d7cac84ea4813e9ed7152426ea67409bd97d721bab","slow_id":"645df5d61aeba7a6a18e6d6502741937dded5dc2862fb844b2b1c17995dbab7e","slow_time":0.2278356054,"speedup":2.42139759890161,"stratum":"2-4","sampling_key":"76e81793578a35bb8ebffdd93e0bb79e57576362c35dec276132f4197c20bff7","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))\n\n#define each(itr, c) for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)\n\n#define all(x) (x).begin(), (x).end()\n\n#define mp make_pair\n\n#define pb push_back\n\n#define fi first\n\n#define se second\n\nstring C(string x);\n\nstring D(string x);\n\nstring S(string x);\n\nstring L(string x);\n\nint main()\n\n{\n\n  string s;\n\n  while (cin >> s, (s != \".\"))\n\n  {\n\n    int ct = 0;\n\n    rep(i, s.size()) ct += (s[i] == '?');\n\n    int lim = 1;\n\n    rep(i, ct) lim *= 26;\n\n    string ans(100, 'z');\n\n    rep(mask, lim)\n\n    {\n\n      int t = mask;\n\n      string im(ct, ' ');\n\n      rep(i, ct)\n\n      {\n\n        im[i] = 'A' + t % 26;\n\n        t /= 26;\n      }\n\n      int c = 0;\n\n      string ss = s;\n\n      rep(i, ss.size())\n\n      {\n\n        if (ss[i] == '?')\n          ss[i] = im[c++];\n      }\n\n      ans = min(ans, C(ss));\n    }\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}\n\nstring C(string x)\n\n{\n\n  if (x[0] == '[')\n\n  {\n\n    int br = 0;\n\n    int idx = 0;\n\n    while (idx < x.size())\n\n    {\n\n      if (x[idx] == '[')\n        ++br;\n\n      else if (x[idx] == ']')\n        --br;\n\n      if (br == 0)\n        break;\n\n      ++idx;\n    }\n\n    string a = S(x.substr(0, idx + 1));\n\n    string b = \"\";\n\n    if (idx + 1 != x.size())\n      b = D(x.substr(idx + 1));\n\n    return a + b;\n\n  }\n\n  else\n\n  {\n\n    int idx = 0;\n\n    while (idx < x.size())\n\n    {\n\n      if ('A' <= x[idx] && x[idx] <= 'Z')\n        break;\n\n      ++idx;\n    }\n\n    string a = S(x.substr(0, idx + 1));\n\n    string b = D(x.substr(idx + 1));\n\n    return a + b;\n  }\n}\n\nstring D(string x)\n\n{\n\n  if (x == \"\")\n    return x;\n\n  return C(x);\n}\n\nstring S(string x)\n\n{\n\n  if (x[0] == '[')\n\n  {\n\n    string r = C(x.substr(1, x.size() - 2));\n\n    reverse(all(r));\n\n    return r;\n\n  }\n\n  else\n    return L(x);\n}\n\nstring L(string x)\n\n{\n\n  if (x[0] == '+')\n\n  {\n\n    string r = L(x.substr(1));\n\n    if (r[0] == 'Z')\n      r[0] = 'A';\n\n    else\n      ++r[0];\n\n    return r;\n\n  }\n\n  else if (x[0] == '-')\n\n  {\n\n    string r = L(x.substr(1));\n\n    if (r[0] == 'A')\n      r[0] = 'Z';\n\n    else\n      --r[0];\n\n    return r;\n\n  }\n\n  else\n    return x;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))\n\n#define each(itr, c) for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)\n\n#define all(x) (x).begin(), (x).end()\n\n#define mp make_pair\n\n#define pb push_back\n\n#define fi first\n\n#define se second\n\nstring C(string x);\n\nstring D(string x);\n\nstring S(string x);\n\nstring L(string x);\n\nint main()\n\n{\n\n  string s;\n\n  while (cin >> s, (s != \".\"))\n\n  {\n\n    string ans = C(s);\n\n    rep(i, s.size())\n\n    {\n\n      if (ans[i] == '?')\n        ans[i] = 'A';\n    }\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}\n\nstring C(string x)\n\n{\n\n  if (x[0] == '[')\n\n  {\n\n    int br = 0;\n\n    int idx = 0;\n\n    while (idx < x.size())\n\n    {\n\n      if (x[idx] == '[')\n        ++br;\n\n      else if (x[idx] == ']')\n        --br;\n\n      if (br == 0)\n        break;\n\n      ++idx;\n    }\n\n    string a = S(x.substr(0, idx + 1));\n\n    string b = \"\";\n\n    if (idx + 1 != x.size())\n      b = D(x.substr(idx + 1));\n\n    return a + b;\n\n  }\n\n  else\n\n  {\n\n    int idx = 0;\n\n    while (idx < x.size())\n\n    {\n\n      if (x[idx] == '?' || ('A' <= x[idx] && x[idx] <= 'Z'))\n        break;\n\n      ++idx;\n    }\n\n    string a = S(x.substr(0, idx + 1));\n\n    string b = D(x.substr(idx + 1));\n\n    return a + b;\n  }\n}\n\nstring D(string x)\n\n{\n\n  if (x == \"\")\n    return x;\n\n  return C(x);\n}\n\nstring S(string x)\n\n{\n\n  if (x[0] == '[')\n\n  {\n\n    string r = C(x.substr(1, x.size() - 2));\n\n    reverse(all(r));\n\n    return r;\n\n  }\n\n  else\n    return L(x);\n}\n\nstring L(string x)\n\n{\n\n  if (x[0] == '+')\n\n  {\n\n    string r = L(x.substr(1));\n\n    if (r[0] != '?')\n\n    {\n\n      if (r[0] == 'Z')\n        r[0] = 'A';\n\n      else\n        ++r[0];\n    }\n\n    return r;\n\n  }\n\n  else if (x[0] == '-')\n\n  {\n\n    string r = L(x.substr(1));\n\n    if (r[0] != '?')\n\n    {\n\n      if (r[0] == 'A')\n        r[0] = 'Z';\n\n      else\n        --r[0];\n    }\n\n    return r;\n\n  }\n\n  else\n    return x;\n}"}
{"fast_code_id":"899b7065d3c4e1c6eaed716231e97c9bfb1e46e1885d70a6055b611267edcbdc","fast_id":"1a343cf241447f27b5267de019b927b4b6ec8c6505383aa5b640cdbda3305e3f","fast_time":0.1182158057,"language":"cpp","measured_fast_code_id":"1a343cf241447f27b5267de019b927b4b6ec8c6505383aa5b640cdbda3305e3f","measured_slow_code_id":"a3eee9a15a292d22a42c97ac1d91346c6bbb0e8af4b9df94629e278d95ee8537","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_45945","problem_id":"p03558","slow_code_id":"60656097addabdd7308660bf996b6dda71847ad2e01ccf1f94e6f6439af7d503","slow_id":"a3eee9a15a292d22a42c97ac1d91346c6bbb0e8af4b9df94629e278d95ee8537","slow_time":0.778001983,"speedup":6.581201036470202,"stratum":"4-8","sampling_key":"035f892bc8021843d1ca8c073f2469fd0190f089fdea559416dc58dd4ae86a38","slow_code":"#include <bits/stdc++.h>\n\n#define il inline\n\n#define rg register\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst LL m_63 = 1061109567;\n\nconst LL m_127 = 2139062143;\n\nconst int inf = 2147483647;\n\nconst double pi = atan(1.0) * 4.0;\n\nconst LL llf = 9223372036854775807;\n\nconst LL N = 1e6 + 7;\n\nconst int M = 1e6;\n\nint n, d[N], flag[N];\n\nint num, b[N], w[N], p[N], nt[N];\n\nil LL read() {\n\n  LL x(0), ff(1);\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9') {\n\n    if (ch == '-')\n      ff = -1;\n\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9')\n    x = x * 10 + ch - '0', ch = getchar();\n\n  return x * ff;\n}\n\nil void fre() { freopen(\"6.in\", \"r\", stdin); }\n\nil void spfa() {\n\n  queue<int> q;\n\n  memset(d, 127, sizeof(d));\n\n  memset(flag, 0, sizeof(flag));\n\n  q.push(1);\n  d[1] = 0;\n\n  while (!q.empty()) {\n\n    int k = q.front();\n    q.pop();\n\n    int e = p[k];\n    flag[k] = 0;\n\n    while (e) {\n\n      int kk = b[e];\n\n      if (d[kk] > d[k] + w[e]) {\n\n        d[kk] = d[k] + w[e];\n\n        if (!flag[kk]) {\n\n          flag[kk] = 1;\n\n          q.push(kk);\n        }\n      }\n\n      e = nt[e];\n    }\n  }\n}\n\nil void add(int x, int y, int z) { b[++num] = y, w[num] = z, nt[num] = p[x], p[x] = num; }\n\nint main() {\n\n  int k = read();\n\n  for (rg int j = 0; j < k; ++j) {\n\n    add(j, (j + 1) % k, 1);\n\n    add(j, (j * 10) % k, 0);\n  }\n\n  spfa();\n\n  printf(\"%d\\n\", d[0] + 1);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define LL long long\n\nusing namespace std;\n\ninline int read() {\n\n  int res = 0, f = 1;\n  char ch = ' ';\n\n  while (!isdigit(ch)) {\n    if (ch == '-')\n      f = -1;\n    ch = getchar();\n  }\n\n  while (isdigit(ch)) {\n    res = res * 10 + ch - '0';\n    ch = getchar();\n  }\n\n  return res * f;\n}\n\nconst int N = 1e5 + 5;\n\nconst int mod = 998244353;\n\nint n, S, T;\n\nint d[N], flag[N];\n\nint head[N * 20], to[N * 20], w[N * 20], nxt[N * 20], cnt;\n\ninline void qxx(int x, int y, int z) {\n\n  cnt++;\n  nxt[cnt] = head[x];\n  head[x] = cnt;\n  to[cnt] = y;\n  w[cnt] = z;\n}\n\ninline void SPFA() {\n\n  memset(d, 63, sizeof(d));\n\n  queue<int> q;\n  q.push(S);\n  d[S] = 0;\n  flag[S] = 1;\n\n  while (!q.empty()) {\n\n    int k = q.front();\n    q.pop();\n    flag[k] = 0;\n\n    for (register int i = head[k]; i; i = nxt[i]) {\n\n      int kk = to[i];\n\n      if (d[kk] > d[k] + w[i]) {\n\n        d[kk] = d[k] + w[i];\n\n        if (!flag[kk]) {\n\n          flag[kk] = 1;\n          q.push(kk);\n        }\n      }\n    }\n  }\n}\n\nint main() {\n\n  n = read();\n\n  S = 0;\n  T = 1;\n\n  for (register int i = 1; i <= n; i++)\n\n    for (register int j = 0; j <= 9; j++)\n\n      qxx(i, ((i - 1) * 10 + j) % n + 1, j);\n\n  for (register int i = 1; i <= 9; i++)\n    qxx(0, i + 1, i);\n\n  SPFA();\n\n  printf(\"%d\\n\", d[1]);\n\n  return 0;\n}"}
{"fast_code_id":"067c4d109de427e91d90edc13845546d186a7c29d1483e43d322c7f03b40e558","fast_id":"3a6d38c6ab470c0d904767de04c264649f4946cfeb496dea0c52f23249413fa5","fast_time":0.0109541232,"language":"cpp","measured_fast_code_id":"3a6d38c6ab470c0d904767de04c264649f4946cfeb496dea0c52f23249413fa5","measured_slow_code_id":"1835a7b6d68c4bb9ad893d289967cf86c5fe60960953aa2daad9fb7a54e5b30b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46050","problem_id":"p02731","slow_code_id":"24703be8fe3acc9fd0bbac6bd31f59c8a788b80201595698dd7c51909c57a927","slow_id":"1835a7b6d68c4bb9ad893d289967cf86c5fe60960953aa2daad9fb7a54e5b30b","slow_time":0.0505988391,"speedup":4.61915921303496,"stratum":"4-8","sampling_key":"2019bfb3a53915cdcadd2bf59bf196ef1d48f7e5a9609d30445552bd4429ff34","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define sf(a) scanf(\"%d\", &a)\n\n#define sfl(a) scanf(\"%lld\", &a)\n\n#define sff(a, b) scanf(\"%d %d\", &a, &b)\n\n#define sffl(a, b) scanf(\"%lld %lld\", &a, &b)\n\n#define sfff(a, b, c) scanf(\"%d %d %d\", &a, &b, &c)\n\n#define sfffl(a, b, c) scanf(\"%lld %lld %lld\", &a, &b, &c)\n\n#define sffff(a, b, c, d) scanf(\"%d %d %d %d\", &a, &b, &c, &d)\n\n#define sffffl(a, b, c, d) scanf(\"%lld %lld %lld %lld\", &a, &b, &c, &d)\n\n#define sfffff(a, b, c, d, e) scanf(\"%d %d %d %d %d\", &a, &b, &c, &d, &e)\n\n#define sfffffl(a, b, c, d, e) scanf(\"%lld %lld %lld %lld %lld\", &a, &b, &c, &d, &e)\n\n#define sfc(a) scanf(\"%c\", &a)\n\n#define MEM(a, b) memset(a, (b), sizeof(a))\n\n#define fast()                                                                                     \\\n  ios_base::sync_with_stdio(0);                                                                    \\\n  cin.tie(0)\n\n#define pb(a) push_back(a)\n\n#define X first\n\n#define Y second\n\n#define sz(x) x.size()\n\n#define pii pair<int, int>\n\n#define pli pair<long long int, int>\n\n#define mp(a, b) make_pair(a, b)\n\n#define fr(i, x, n) for (int i = x; i < n; i++)\n\n#define rfr(i, x, n) for (int i = x; i > n; i--)\n\n#define LCM(a, b) ((a) * ((b) / GCD(a, b)))\n\ntemplate <typename T> T Abs(T a) { return (a < 0 ? -a : a); }\n\ntemplate <typename T> T MAX(T a, T b) { return (a > b ? a : b); }\n\ntemplate <typename T> T MIN(T a, T b) { return (a < b ? a : b); }\n\ntemplate <typename T> T GCD(T a, T b) {\n  if (b == 0)\n    return a;\n  return GCD(b, a % b);\n}\n\ntemplate <typename T> inline void read(T &x) {\n\n  T f = 1;\n  char c;\n  x = 0;\n\n  for (c = getchar(); c < '0' || c > '9'; c = getchar())\n    if (c == '-')\n      f = -1;\n\n  for (; c >= '0' && c <= '9'; c = getchar())\n    x = x * 10 + c - '0';\n\n  x *= f;\n}\n\nusing fl = float;\n\nusing db = double;\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\nconst int mx = 1000005;\n\nconst int inf = 99999999;\n\nconst int intlim = 2147483648;\n\nconst db PI = acos(-1);\n\nusing namespace std;\n\nint main() {\n\n  int l;\n\n  sf(l);\n\n  db ans = (db)l / 3.0;\n\n  printf(\"%0.12lf\\n\", ans * ans * ans);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\nint main()\n\n{\n\n  double L, v;\n\n  scanf(\"%lf\", &L);\n\n  v = pow((L / 3), 3);\n\n  printf(\"%.12lf\\n\", v);\n\n  return 0;\n}\n"}
{"fast_code_id":"7695b867af1903d0b536d2b19a6deee31d803d61a2238ecd6f7d6e30e1ccac3a","fast_id":"02d3c918ea230597bb36914df07617c0613267fcdb7af22543761c6060536c73","fast_time":0.1901459334,"language":"cpp","measured_fast_code_id":"02d3c918ea230597bb36914df07617c0613267fcdb7af22543761c6060536c73","measured_slow_code_id":"e7a886c665c7b173aa310259624b4e0646bf28f1db7f5d07a9b1df24d458871c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46057","problem_id":"p02456","slow_code_id":"9e6b430fc8b1fb0e1df8de12c6a7e689606257f2ac4fdd02b2c2f40a18c3f73e","slow_id":"e7a886c665c7b173aa310259624b4e0646bf28f1db7f5d07a9b1df24d458871c","slow_time":0.8069041609,"speedup":4.243604617105106,"stratum":"4-8","sampling_key":"2b7f3c5a1a136345837386394d6c95583b8615f17976d7077f9be1be8921f5a1","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate <typename T>\n\nclass avl_tree {\n\n  struct node {\n\n    T val;\n\n    int dep, size;\n\n    node *ch[2];\n\n    node() : node(0) {}\n\n    node(T v, node *l = nullptr, node *r = nullptr)\n\n        : val(v), dep(1), size(1), ch{l, r} {}\n\n    void *operator new(size_t) {\n\n      static const int pmax = 2e5;\n\n      static int p = 0;\n\n      static node pool[pmax];\n\n      return pool + p++;\n    }\n  };\n\n  int depth(node *t) { return !t ? 0 : t->dep; }\n\n  int count(node *t) { return !t ? 0 : t->size; }\n\n  node *update(node *t) {\n\n    t->dep = max(depth(t->ch[0]), depth(t->ch[1])) + 1;\n\n    t->size = count(t->ch[0]) + count(t->ch[1]) + 1;\n\n    return t;\n  }\n\n  node *rotate(node *t, int b) {\n\n    node *s = t->ch[!b];\n\n    t->ch[!b] = s->ch[b];\n\n    s->ch[b] = t;\n\n    update(t);\n\n    return update(s);\n  }\n\n  node *fix(node *t) {\n\n    if (!t)\n      return t;\n\n    int dd = depth(t->ch[0]) - depth(t->ch[1]);\n\n    if (abs(dd) < 2)\n      return t;\n\n    int b = dd < 0;\n\n    if (depth(t->ch[b]->ch[!b]) > depth(t->ch[b]->ch[b])) {\n\n      t->ch[b] = rotate(t->ch[b], b);\n    }\n\n    return rotate(t, !b);\n  }\n\n  node *insert(node *t, T val) {\n\n    if (!t)\n      return new node(val);\n\n    if (val == t->val)\n      return t;\n\n    int b = val > t->val;\n\n    t->ch[b] = insert(t->ch[b], val);\n\n    return fix(update(t));\n  }\n\n  T minimum(node *t) {\n\n    while (t->ch[0])\n      t = t->ch[0];\n\n    return t->val;\n  }\n\n  node *erase(node *t) {\n\n    if (!t)\n      return t;\n\n    if (!t->ch[0] && !t->ch[1])\n      return nullptr;\n\n    if (!t->ch[0])\n      return t->ch[1];\n\n    if (!t->ch[1])\n      return t->ch[0];\n\n    T mini = minimum(t->ch[1]);\n\n    return fix(update(new node(mini, t->ch[0], erase(t->ch[1], mini))));\n  }\n\n  node *erase(node *t, T val) {\n\n    if (!t)\n      return t;\n\n    if (val == t->val)\n      return fix(erase(t));\n\n    int b = val > t->val;\n\n    t->ch[b] = erase(t->ch[b], val);\n\n    return fix(update(t));\n  }\n\n  node *root;\n\npublic:\n  avl_tree() : root(nullptr) {}\n\n  int size() { return count(root); }\n\n  void insert(T val) { root = insert(root, val); }\n\n  void erase(T val) { root = erase(root, val); }\n\n  bool count(T val) {\n\n    node *t = root;\n\n    while (t) {\n\n      if (t->val == val)\n        return true;\n\n      t = t->ch[val > t->val];\n    }\n\n    return false;\n  }\n};\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  int q;\n\n  cin >> q;\n\n  avl_tree<int> avl;\n\n  while (q--) {\n\n    int com, x;\n\n    cin >> com >> x;\n\n    if (com == 0) {\n\n      avl.insert(x);\n\n      printf(\"%d\\n\", avl.size());\n\n    }\n\n    else if (com == 1) {\n\n      puts(avl.count(x) ? \"1\" : \"0\");\n\n    }\n\n    else {\n\n      avl.erase(x);\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nvoid compress(vector<int> &v) {\n\n  auto vs = v;\n\n  sort(vs.begin(), vs.end());\n\n  vs.erase(unique(vs.begin(), vs.end()), vs.end());\n\n  for (auto &val : v) {\n\n    val = lower_bound(vs.begin(), vs.end(), val) - vs.begin();\n  }\n}\n\nconst int MAX = 2e5;\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  int q;\n\n  cin >> q;\n\n  vector<int> c(q), x(q);\n\n  for (int i = 0; i < q; i++) {\n\n    cin >> c[i] >> x[i];\n  }\n\n  compress(x);\n\n  vector<int> cnt(MAX);\n\n  int size = 0;\n\n  for (int i = 0; i < q; i++) {\n\n    if (c[i] == 0) {\n\n      if (!cnt[x[i]]) {\n\n        cnt[x[i]] = 1;\n\n        ++size;\n      }\n\n      printf(\"%d\\n\", size);\n\n    }\n\n    else if (c[i] == 1) {\n\n      puts(cnt[x[i]] ? \"1\" : \"0\");\n\n    }\n\n    else {\n\n      if (cnt[x[i]]) {\n\n        cnt[x[i]] = 0;\n\n        --size;\n      }\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"6559cff4ede681ed3344bd3ce7a758029cc6283f3171295de267c7e9dd72bd6d","fast_id":"f892d65501d8c12fb85f55d098fbb32d1e5e934070da5757e487762201b29f7e","fast_time":0.0198580842,"language":"cpp","measured_fast_code_id":"f892d65501d8c12fb85f55d098fbb32d1e5e934070da5757e487762201b29f7e","measured_slow_code_id":"83de1574876aaa34ce92c225b44160b08cdce3e0a9be190b995213e5c500225e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46077","problem_id":"p03573","slow_code_id":"6a7a03de70576b2efc2a2dadd83d15f065246f5aebc7ab5c56adced14c4177c3","slow_id":"83de1574876aaa34ce92c225b44160b08cdce3e0a9be190b995213e5c500225e","slow_time":0.1055392118,"speedup":5.314672389192508,"stratum":"4-8","sampling_key":"05ff4bfb9eb37fdca8c856471d1900b6cf1e7a57cc75eaf1f0d786bd75dcd0b7","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int A, B, C;\n\n  cin >> A >> B >> C;\n\n  if (A == B)\n\n    cout << C << endl;\n\n  else if (A == C)\n\n    cout << B << endl;\n\n  else if (B == C)\n\n    cout << A << endl;\n}\n","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int a, b, c;\n\n  scanf(\"%d %d %d\", &a, &b, &c);\n\n  if (a != b && a != c)\n    printf(\"%d\", a);\n\n  else if (b != a && b != c)\n    printf(\"%d\", b);\n\n  else if (c != a && c != a)\n    printf(\"%d\", c);\n\n  return 0;\n}"}
{"fast_code_id":"aa84106ae72dc4f10e0a6e7eacd89f72f399517618477e9f5093e2ef04e7fae5","fast_id":"111c14607eb01ae20bb36a1fa2d5e998e7e1e7ac56ea7e1a807666b8e96b8b07","fast_time":0.0010094593,"language":"cpp","measured_fast_code_id":"111c14607eb01ae20bb36a1fa2d5e998e7e1e7ac56ea7e1a807666b8e96b8b07","measured_slow_code_id":"361408c1896a9ea16243272cac9061994ce611e18732dc6adb65b3e064f86f4f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46080","problem_id":"p03676","slow_code_id":"26b49cd938462332a49ddaddc46acc8944493420094b9c1e9372acf25724c276","slow_id":"361408c1896a9ea16243272cac9061994ce611e18732dc6adb65b3e064f86f4f","slow_time":0.003884851,"speedup":3.848447381682451,"stratum":"2-4","sampling_key":"1eb54fdb1e95fae22c92d2961609a108c393bd83ac14821917f86c48e475b8c6","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int Max = 1e5 + 10;\n\nconst int MOD = 1e9 + 7;\n\nint a[Max];\n\nint pos[Max];\n\nll inv[Max];\n\nll fac[Max];\n\nint sp;\n\nint ss;\n\nvoid init() {\n\n  fac[0] = 1;\n\n  fac[1] = 1;\n\n  inv[0] = 1;\n\n  inv[1] = 1;\n\n  for (ll i = 2; i <= Max; i++) {\n\n    fac[i] = fac[i - 1] * i % MOD;\n\n    inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;\n  }\n\n  for (ll i = 1; i <= Max; i++)\n\n    inv[i] = inv[i] * inv[i - 1] % MOD;\n}\n\nll C(ll n, ll m) {\n\n  if (m > n)\n\n    return 0;\n\n  return ((fac[n] * inv[m] % MOD) * inv[n - m]) % MOD;\n}\n\nint main() {\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  int n;\n\n  cin >> n;\n\n  init();\n\n  for (int i = 1; i <= n + 1; i++) {\n\n    cin >> a[i];\n\n    if (pos[a[i]]) {\n\n      ss = a[i];\n\n      sp = i;\n\n    } else {\n\n      pos[a[i]] = i;\n    }\n  }\n\n  for (int i = 0; i <= n; i++) {\n\n    ll res = 0;\n\n    res += C(n + 1, i + 1);\n\n    res %= MOD;\n\n    res = (res + MOD - C(n - sp + pos[a[sp]], i)) % MOD;\n\n    cout << res << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<int, pii> pipii;\n\ntypedef pair<pii, int> piipi;\n\ntypedef pair<pii, pii> piipii;\n\n#define mp make_pair\n\n#define fi first\n\n#define se second\n\n#define all(a) (a).begin(), (a).end()\n\n#define sz(a) (int)(a).size()\n\n#define eb emplace_back\n\nconst int mod = 1e9 + 7;\n\nint a[100005];\n\nbool vis[100005];\n\nll f1[100005], f2[100005];\n\nll pw(ll a, ll b) {\n\n  ll ans = 1;\n\n  while (b) {\n\n    if (b % 2 == 1)\n      ans = ans * a % mod;\n\n    a = a * a % mod;\n\n    b /= 2;\n  }\n\n  return ans;\n}\n\nll func(int a, int b) {\n\n  if (b > a)\n    return 0;\n\n  return f1[a] * f2[b] % mod * f2[a - b] % mod;\n}\n\nint main() {\n\n  int n, l, r;\n\n  scanf(\"%d\", &n);\n\n  f1[0] = f2[0] = 1;\n\n  for (int i = 1; i <= n + 1; i++) {\n\n    f1[i] = f1[i - 1] * i % mod;\n\n    f2[i] = pw(f1[i], mod - 2);\n  }\n\n  for (int i = 1; i <= n + 1; i++) {\n\n    scanf(\"%d\", &a[i]);\n\n    if (vis[a[i]])\n      r = i;\n\n    vis[a[i]] = 1;\n  }\n\n  for (int i = 1; i <= n + 1; i++) {\n\n    if (a[i] == a[r]) {\n\n      l = i;\n\n      break;\n    }\n  }\n\n  for (int i = 1; i <= n + 1; i++) {\n\n    if (i == 1)\n      printf(\"%d\\n\", n);\n\n    else if (i == n + 1)\n      printf(\"1\\n\");\n\n    else {\n\n      ll ans = func(n + 1, i);\n\n      ans = (ans - func(n + 1 - (r - l + 1), i - 1) + mod) % mod;\n\n      printf(\"%lld\\n\", ans);\n    }\n  }\n}"}
{"fast_code_id":"413c35d174cf63a172bb716f4c5f624834cb6c3a173d2dcb8913224c5f4d0075","fast_id":"e1009c77ff4d9dbfb9dc26e0eb0aef2292f43ad391bc5495a415d8caed0a7cea","fast_time":0.0196495044,"language":"cpp","measured_fast_code_id":"e1009c77ff4d9dbfb9dc26e0eb0aef2292f43ad391bc5495a415d8caed0a7cea","measured_slow_code_id":"f73974f0448676d209ed5c08c7ece7933f0efe1e8ca977f8660a81af392a5314","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46118","problem_id":"p01885","slow_code_id":"b12d9652862e1fad545ba80a2fb1103103c8b8b6dbb63804fdf41d175a761479","slow_id":"f73974f0448676d209ed5c08c7ece7933f0efe1e8ca977f8660a81af392a5314","slow_time":0.267759381,"speedup":13.62677528905004,"stratum":"8+","sampling_key":"c5253f755051cd666b968b0155ef3864beb6f1eb289d1008502d238a9b1bc512","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <cctype>\n\n#include <cmath>\n\n#include <ctime>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <functional>\n\n#include <string>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 1e5 + 5, INF = 0x3f3f3f3f;\n\nstruct P\n\n{\n\n  ll dif;\n  int id;\n\n  P(ll dif = 0, int id = -1) : dif(dif), id(id) {}\n\n  P operator+(const P &a) const { return P(dif + a.dif, id); }\n\n  bool operator<(const P &a) const { return dif > a.dif; }\n};\n\nP p[N];\n\nint n, ans, loc[N];\n\nll L, a[N], b[N], c[N], d[N];\n\nll ok(int mid, int i)\n\n{\n\n  if (i <= mid)\n    return p[mid].dif - a[p[i].id] + b[p[i].id];\n\n  return p[mid].dif;\n}\n\nint main()\n\n{\n\n  while (~scanf(\"%d%lld\", &n, &L))\n\n  {\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      scanf(\"%lld%lld\", &a[i], &b[i]);\n\n      p[i] = P(a[i] - b[i], i);\n    }\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      scanf(\"%lld\", &c[i]);\n\n      if (i)\n        c[i] += c[i - 1];\n    }\n\n    sort(p, p + n);\n\n    for (int i = 0; i < n; i++)\n\n      loc[p[i].id] = i;\n\n    int fu = n - 1;\n\n    for (; fu >= 0 && p[fu].dif <= 0; fu--)\n      ;\n\n    for (int i = 1; i < n; i++)\n\n      p[i] = p[i] + p[i - 1];\n\n    ans = INF;\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      ll len = L - a[i];\n\n      int l = -1, r = fu;\n\n      if (len <= 0) {\n        ans = min(ans, 1);\n        continue;\n      }\n\n      while (r - l > 1)\n\n      {\n\n        int mid = l + r >> 1;\n\n        if (ok(mid, loc[i]) < len)\n          l = mid;\n\n        else\n          r = mid;\n      }\n\n      int now = r - (r >= loc[i]), v = ok(r, loc[i]);\n\n      if (v >= len && v > c[now])\n\n        ans = min(ans, now + 2);\n    }\n\n    printf(\"%d\\n\", ans == INF ? -1 : ans);\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int maxn = 1e6 + 5;\n\nconst int imax = 1e6;\n\nconst int inf = 999999999;\n\nint en, n, a[maxn], b[maxn];\n\ntypedef long long ll;\n\nll tree[maxn], sum[maxn], c[maxn];\n\nstruct node\n\n{\n\n  int x, id;\n\n  node() {}\n\n  bool operator<(const node &a) const\n\n  {\n\n    if (a.x == x)\n      return id < a.id;\n\n    return x > a.x;\n  }\n\n} p[maxn];\n\nbool cmp(node a, node b)\n\n{\n\n  return a.x == b.x ? a.id < b.id : a.x > b.x;\n}\n\nvoid build(int l, int r, int rt)\n\n{\n\n  if (l == r)\n\n  {\n\n    tree[rt] = sum[l] - c[l - 1];\n\n    return;\n  }\n\n  int mid = (l + r) >> 1;\n\n  build(l, mid, rt * 2);\n\n  build(mid + 1, r, rt * 2 + 1);\n\n  tree[rt] = min(tree[rt * 2], tree[rt * 2 + 1]);\n}\n\nll qu(int L, int R, int l, int r, int rt)\n\n{\n\n  if (L > R)\n    return inf;\n\n  if (r < L || l > R)\n    return inf;\n\n  if (l >= L && r <= R)\n    return tree[rt];\n\n  int mid = (l + r) >> 1;\n\n  int a1 = inf, a2 = inf;\n\n  a1 = qu(L, R, l, mid, rt * 2);\n\n  a2 = qu(L, R, mid + 1, r, rt * 2 + 1);\n\n  return min(a1, a2);\n}\n\nbool check(int i, int mid)\n\n{\n\n  if (i > mid)\n    return sum[mid] + a[p[i].id] >= en;\n\n  return sum[mid] - p[i].x + a[p[i].id] >= en;\n}\n\nint main()\n\n{\n\n  int ans = inf;\n\n  c[0] = 0;\n\n  sum[0] = 0;\n\n  scanf(\"%d%d\", &n, &en);\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    scanf(\"%d%d\", a + i, b + i);\n\n    p[i].x = a[i] - b[i];\n\n    p[i].id = i;\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    scanf(\"%lld\", c + i);\n\n    c[i] += c[i - 1];\n  }\n\n  sort(p + 1, p + 1 + n, cmp);\n\n  for (int i = 1; i <= n; ++i)\n    sum[i] = sum[i - 1] + p[i].x;\n\n  build(1, n, 1);\n\n  int gg = n;\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    if (p[i].x < 0)\n\n    {\n\n      gg = i;\n\n      break;\n    }\n  }\n\n  gg++;\n\n  int num = 1;\n\n  while (sum[num] > c[num])\n\n  {\n\n    if (num > n)\n      break;\n\n    num++;\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    int l = 0, r = n + 1;\n\n    while (l < r)\n\n    {\n\n      int mid = (l + r) / 2;\n\n      if (check(i, mid))\n        r = mid;\n\n      else\n        l = mid + 1;\n    }\n\n    if (r > n)\n      continue;\n\n    if (r < i)\n\n    {\n\n      if (r < num)\n        ans = min(ans, r + 1);\n\n    }\n\n    else\n\n        if (qu(i + 1, r, 1, n, 1) > p[i].x)\n      ans = min(ans, r);\n  }\n\n  if (ans == inf)\n    printf(\"-1\\n\");\n\n  else\n    printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"8d55d1b3ffef274df2f413c2267d67b624526d2ff28abb571bb482abcf7e2097","fast_id":"23e31a29bc2acb26161aec4474e73702843a0ee7a5a73fbad8dfc5cd4f686b75","fast_time":0.0585160204,"language":"cpp","measured_fast_code_id":"23e31a29bc2acb26161aec4474e73702843a0ee7a5a73fbad8dfc5cd4f686b75","measured_slow_code_id":"8cab7a71fc3d53b57793a7762408080df9d520e5efd3b94ead111a93a98ab986","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4614","problem_id":"p02805","slow_code_id":"5ea754cdec3e88a52b44657735f5f02203f4ba884ea2c1bf2166d081eb19a1fd","slow_id":"8cab7a71fc3d53b57793a7762408080df9d520e5efd3b94ead111a93a98ab986","slow_time":0.1673669563,"speedup":2.860190340285,"stratum":"2-4","sampling_key":"2f4ea0041968a234e5b1d15b219826346e62b4a06fd7719224c76dcfadb07d61","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <stack>\n\n#include <string>\n\n#include <string.h>\n\n#include <vector>\n\n#include <queue>\n\n#include <cmath>\n\n#include <bitset>\n\n#include <complex>\n\n#include <functional>\n\n#include <numeric>\n\n#include <iomanip>\n\n#define SPBR(w, n) std::cout << (w + 1 == n ? '\\n' : ' ');\n\n#define YES cout << \"YES\" << endl\n\n#define Yes cout << \"Yes\" << endl\n\n#define NO cout << \"NO\" << endl\n\n#define No cout << \"No\" << endl\n\n#define ALL(i) (i).begin(), (i).end()\n\n#define FOR(i, a, n) for (int i = (a); i < (n); ++i)\n\n#define RFOR(i, a, n) for (int i = (n)-1; i >= (a); --i)\n\n#define REP(i, n) for (int i = 0; i < int(n); ++i)\n\n#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)\n\n#define IN(a, x, b) (a <= x && x < b)\n\n#define OUT(a, x, b) (x < a || b <= x)\n\ntemplate <class T> inline T chmax(T &a, const T b) { return a = (a < b) ? b : a; }\n\ntemplate <class T> inline T chmin(T &a, const T b) { return a = (a > b) ? b : a; }\n\n#define int ll\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\nusing ld = long double;\n\nconst int MOD = 1000000007;\n\nconst int INF = 1e18;\n\nconst double PI = acos(-1);\n\nusing namespace std;\n\nstruct INIT {\n  INIT() {\n\n    cin.tie(0);\n    ios::sync_with_stdio(false);\n\n    cout << fixed << setprecision(10);\n  }\n} INIT;\n\nint N;\n\nvector<int> X, Y;\n\ndouble g(double x, double y) {\n\n  double ret = 0;\n\n  REP(i, N) { chmax(ret, hypot(X[i] - x, Y[i] - y)); }\n\n  return ret;\n}\n\ndouble f(double x) {\n\n  double y1 = 0;\n\n  double y2 = 1000;\n\n  REP(i, 100) {\n\n    double m1 = (y1 * 2 + y2 * 1) / 3;\n\n    double m2 = (y1 * 1 + y2 * 2) / 3;\n\n    if (g(x, m1) > g(x, m2))\n      y1 = m1;\n\n    else\n      y2 = m2;\n  }\n\n  return g(x, y1);\n}\n\nsigned main() {\n\n  cin >> N;\n\n  X.resize(N);\n  Y.resize(N);\n\n  REP(i, N) cin >> X[i] >> Y[i];\n\n  double x1 = 0;\n\n  double x2 = 1000;\n\n  REP(i, 100) {\n\n    double m1 = (x1 * 2 + x2 * 1) / 3;\n\n    double m2 = (x1 * 1 + x2 * 2) / 3;\n\n    if (f(m1) > f(m2))\n      x1 = m1;\n\n    else\n      x2 = m2;\n  }\n\n  cout << f(x1) << \"\\n\";\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <stack>\n\n#include <string>\n\n#include <string.h>\n\n#include <vector>\n\n#include <queue>\n\n#include <cmath>\n\n#include <bitset>\n\n#include <complex>\n\n#include <functional>\n\n#include <numeric>\n\n#include <iomanip>\n\n#define SPBR(w, n) std::cout << (w + 1 == n ? '\\n' : ' ');\n\n#define YES cout << \"YES\" << endl\n\n#define Yes cout << \"Yes\" << endl\n\n#define NO cout << \"NO\" << endl\n\n#define No cout << \"No\" << endl\n\n#define ALL(i) (i).begin(), (i).end()\n\n#define FOR(i, a, n) for (int i = (a); i < (n); ++i)\n\n#define RFOR(i, a, n) for (int i = (n)-1; i >= (a); --i)\n\n#define REP(i, n) for (int i = 0; i < int(n); ++i)\n\n#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)\n\n#define IN(a, x, b) (a <= x && x < b)\n\n#define OUT(a, x, b) (x < a || b <= x)\n\ntemplate <class T> inline T chmax(T &a, const T b) { return a = (a < b) ? b : a; }\n\ntemplate <class T> inline T chmin(T &a, const T b) { return a = (a > b) ? b : a; }\n\n#define int ll\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\nusing ld = long double;\n\nconst int MOD = 1000000007;\n\nconst int INF = 1e18;\n\nconst double PI = acos(-1);\n\nusing namespace std;\n\nstruct INIT {\n  INIT() {\n\n    cin.tie(0);\n    ios::sync_with_stdio(false);\n\n    cout << fixed << setprecision(10);\n  }\n} INIT;\n\nint N;\n\nvector<double> x(50), y(50);\n\ndouble dist(int i, int j) { return hypot(x[j] - x[i], y[j] - y[i]); }\n\ndouble mid;\n\nbool f(double xx, double yy) {\n\n  REP(i, N) {\n\n    if (hypot(xx - x[i], yy - y[i]) > mid + 1e-10)\n      return false;\n  }\n\n  return true;\n}\n\nbool check() {\n\n  bool flag = true;\n\n  REP(i, N) {\n\n    FOR(j, i + 1, N) {\n\n      if (dist(i, j) > mid * 2 + 1e-10)\n        continue;\n\n      double d = sqrt(mid * mid - dist(i, j) * (dist(i, j)) / 4);\n\n      double mx = (x[i] + x[j]) / 2;\n\n      double my = (y[i] + y[j]) / 2;\n\n      double px = (y[i] - y[j]) / dist(i, j) * d;\n\n      double py = -(x[i] - x[j]) / dist(i, j) * d;\n\n      if (f(mx + px, my + py))\n        return true;\n\n      if (f(mx - px, my - py))\n        return true;\n\n      flag = false;\n    }\n  }\n\n  return false;\n}\n\nsigned main() {\n\n  cin >> N;\n\n  REP(i, N) cin >> x[i] >> y[i];\n\n  double ok = 4000;\n\n  double ng = 0;\n\n  REP(i, 50) {\n\n    mid = (ok + ng) / 2;\n\n    if (check())\n      ok = mid;\n\n    else\n      ng = mid;\n  }\n\n  cout << ok << \"\\n\";\n\n  return 0;\n}"}
{"fast_code_id":"84f0a4ce16a9b1cffd586a13dc2abaad538d3cdb4786b8867a4ff5852018b2ee","fast_id":"43d0c2384fa2970d27bdb053bc2dcd532c966371e343da61822718667b71b0bf","fast_time":0.3543796834,"language":"cpp","measured_fast_code_id":"43d0c2384fa2970d27bdb053bc2dcd532c966371e343da61822718667b71b0bf","measured_slow_code_id":"e6e6bed0e5d01ece82d4d12538dc2b2686b2c63e34b6ef90623beb8883ac418b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46177","problem_id":"p00539","slow_code_id":"172ebd6694b94a2c18d49fbbb97fdfa98cf8db2f22c7c027066d248ba1841e0f","slow_id":"e6e6bed0e5d01ece82d4d12538dc2b2686b2c63e34b6ef90623beb8883ac418b","slow_time":0.9187353432,"speedup":2.5925169704579067,"stratum":"2-4","sampling_key":"a3a621c3937b803a837701cac65446ab773c0cbeb434542b104e11f5bdec79a0","slow_code":"#include <cstdio>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <map>\n\n#include <queue>\n\n#include <functional>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> pii;\n\n#define fst first\n\n#define scd second\n\n#define PB push_back\n\n#define rep(i, x) for (ll i = 0; i < (x); ++i)\n\nconst ll linf = 3e18;\n\nstruct edge {\n\n  ll to, cost;\n\n  edge(ll to, ll cost = linf) : to(to), cost(cost) {}\n};\n\nll N, M, C;\n\nll d[100000];\n\nvector<edge> G[100000];\n\nmap<ll, vector<ll> > m;\n\nbool found[100000];\n\nmap<ll, bool> used[100000];\n\nvoid dijkstra(ll s)\n\n{\n\n  priority_queue<pii, vector<pii>, greater<pii> > q;\n\n  fill(d, d + N, linf);\n\n  d[s] = 0;\n\n  q.push(pii(0, s));\n\n  while (q.size()) {\n\n    pii p = q.top();\n    q.pop();\n\n    ll v = p.scd;\n\n    if (d[v] < p.fst)\n      continue;\n\n    rep(i, G[v].size()) {\n\n      edge e = G[v][i];\n\n      if (d[e.to] > d[v] + e.cost) {\n\n        d[e.to] = d[v] + e.cost;\n\n        m[d[e.to]].PB(e.to);\n\n        q.push(pii(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nsigned main()\n\n{\n\n  scanf(\"%lld %lld %lld\", &N, &M, &C);\n\n  ll sum = 0;\n\n  rep(i, M) {\n\n    ll A, B, D;\n    scanf(\"%lld %lld %lld\", &A, &B, &D), A--, B--;\n\n    G[A].PB(edge(B, D));\n\n    G[B].PB(edge(A, D));\n\n    sum += D;\n  }\n\n  dijkstra(0);\n\n  found[0] = true;\n\n  ll mi = linf;\n\n  m[0] = vector<ll>();\n\n  for (map<ll, vector<ll> >::iterator itr = m.begin(); itr != m.end(); ++itr) {\n\n    ll X = itr->fst;\n\n    vector<ll> vs = itr->scd;\n\n    rep(i, vs.size()) found[vs[i]] = true;\n\n    rep(i, vs.size()) {\n\n      ll v = vs[i];\n\n      rep(j, G[v].size()) {\n\n        edge e = G[v][j];\n\n        if (!found[e.to])\n          continue;\n\n        if (used[v][e.to])\n          continue;\n\n        used[v][e.to] = used[e.to][v] = true;\n\n        sum -= e.cost;\n      }\n    }\n\n    mi = min(mi, sum + C * X);\n  }\n\n  printf(\"%lld\\n\", mi);\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define rep(i, x) for (int i = 0; i < x; ++i)\n\n#define fst first\n\n#define scd second\n\nusing vi = vector<int>;\n\nusing pii = pair<int, int>;\n\nusing vpii = vector<pii>;\n\nconst int inf = 3e18;\n\nstruct edge {\n  int to, cost;\n};\n\nvector<edge> G[100010];\n\nint d[100010];\n\nbool used[100010];\n\nint n, m, c;\n\nsigned main()\n\n{\n\n  cin >> n >> m >> c;\n\n  int sum = 0;\n\n  rep(i, m) {\n\n    int a, b, d;\n    cin >> a >> b >> d;\n\n    --a, --b;\n\n    G[a].push_back(edge{b, d});\n\n    G[b].push_back(edge{a, d});\n\n    sum += d;\n  }\n\n  priority_queue<pii, vector<pii>, greater<pii>> q;\n\n  q.push(pii(0, 0));\n\n  fill_n(d, n + 1, inf);\n\n  d[0] = 0;\n\n  int ans = inf;\n\n  while (q.size()) {\n\n    pii p = q.top();\n    q.pop();\n\n    if (d[p.scd] == p.fst) {\n\n      used[p.scd] = true;\n\n      for (edge &e : G[p.scd]) {\n\n        if (used[e.to])\n          sum -= e.cost;\n      }\n\n      ans = min(ans, p.fst * c + sum);\n    }\n\n    if (d[p.scd] < p.fst) {\n\n      continue;\n    }\n\n    for (edge &e : G[p.scd]) {\n\n      if (d[e.to] > d[p.scd] + e.cost) {\n\n        d[e.to] = d[p.scd] + e.cost;\n\n        q.push(pii(d[e.to], e.to));\n      }\n    }\n  }\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"35f0d1a0d4628303e1b8df5020175965473aad38fd05ede0e9ad669e4eaa6018","fast_id":"bc63e8e75b865bfe98db7f86e65211d77cd7a0d4ff67b194770b7575f0231c11","fast_time":0.0185152479,"language":"cpp","measured_fast_code_id":"bc63e8e75b865bfe98db7f86e65211d77cd7a0d4ff67b194770b7575f0231c11","measured_slow_code_id":"8c4dbcd22d487c06eb4c4dc618aa9664d44dcb2fb83743e19720ea43c8b70874","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46180","problem_id":"p00170","slow_code_id":"45383e37d9145f3072bb81e59b156db775138fc114666e209e3815084534a135","slow_id":"8c4dbcd22d487c06eb4c4dc618aa9664d44dcb2fb83743e19720ea43c8b70874","slow_time":0.0899776526,"speedup":4.859651519977758,"stratum":"4-8","sampling_key":"70f0148454fe05500321afb2af887719cdb69313aaea248455bd899d39db3d83","slow_code":"#include <cstdio>\n\n#include <cfloat>\n\nusing namespace std;\n\nchar f[10][21];\n\nint n, w[10], s[10], a[10], b[10];\n\nbool u[10];\n\ndouble maxg;\n\nvoid dfs(int x, int tw, int m, double g) {\n\n  if (m == n) {\n\n    if (maxg < g) {\n\n      maxg = g;\n\n      for (int i = 0; i < n; i++) {\n\n        b[i] = a[i];\n      }\n    }\n\n    return;\n  }\n\n  if (x >= n) {\n\n    return;\n  }\n\n  if (!u[x] && tw <= s[x]) {\n\n    u[x] = true;\n\n    tw += w[x];\n\n    a[m] = x;\n\n    dfs(0, tw, m + 1, g + w[x] * (m + 1));\n\n    tw -= w[x];\n\n    u[x] = false;\n  }\n\n  dfs(x + 1, tw, m, g);\n}\n\nint main() {\n\n  while (1) {\n\n    scanf(\"%d\", &n);\n\n    if (!n)\n      break;\n\n    for (int i = 0; i < n; i++) {\n\n      scanf(\"%s %d %d\", f[i], &w[i], &s[i]);\n    }\n\n    for (int i = 0; i < n; i++) {\n\n      u[i] = false;\n    }\n\n    maxg = -DBL_MAX;\n\n    dfs(0, 0, 0, 0.);\n\n    for (int i = n - 1; i >= 0; i--) {\n\n      printf(\"%s\\n\", f[b[i]]);\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nstruct C {\n\n  int id;\n\n  int w;\n\n  int s;\n\n  static bool compare(const C &l, const C &r) {\n\n    if (l.w > r.w) {\n\n      return true;\n\n    } else if (l.w < r.w) {\n\n      return false;\n\n    } else {\n\n      return (l.s > r.s);\n    }\n  }\n};\n\nint main() {\n\n  C c[10];\n\n  char f[10][21];\n\n  int n, tw, a[10];\n\n  bool u[10];\n\n  while (1) {\n\n    scanf(\"%d\", &n);\n\n    if (!n)\n      break;\n\n    for (int i = 0; i < n; i++) {\n\n      c[i].id = i;\n\n      scanf(\"%s %d %d\", f[i], &c[i].w, &c[i].s);\n    }\n\n    sort(c, c + n, C::compare);\n\n    tw = 0;\n\n    for (int i = 0; i < n; i++) {\n\n      tw += c[i].w;\n    }\n\n    for (int i = 0; i < n; i++) {\n\n      u[i] = false;\n    }\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = 0; j < n; j++) {\n\n        if (!u[j] && tw - c[j].w <= c[j].s) {\n\n          tw -= c[j].w;\n\n          a[i] = c[j].id;\n\n          u[j] = true;\n\n          break;\n        }\n      }\n    }\n\n    for (int i = 0; i < n; i++) {\n\n      printf(\"%s\\n\", f[a[i]]);\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"775f05107060d27d1da947cc7ae8464a2d181f18fcda4f4d40e989033da8c39b","fast_id":"8754f31936ee7a0be9c6038433a94837dd057a082e83782d95ae51a419badac8","fast_time":0.0203821878,"language":"cpp","measured_fast_code_id":"8754f31936ee7a0be9c6038433a94837dd057a082e83782d95ae51a419badac8","measured_slow_code_id":"31953205de5a969867df9f60155af5d51a74366c3f5457bc7e1f17ac68b44145","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46181","problem_id":"p00254","slow_code_id":"440dfd35d63551d4ceba10eaabb2163ea958979935e0da529bc0ea07d3e26f26","slow_id":"31953205de5a969867df9f60155af5d51a74366c3f5457bc7e1f17ac68b44145","slow_time":0.0898234915,"speedup":4.40696025281447,"stratum":"4-8","sampling_key":"16a66cd21d34b057a4a30a6306aa007e302a9e298603b9cde6100132da26fba1","slow_code":"#include <cstdio>\n\n#include <sstream>\n\n#include <string>\n\n#include <algorithm>\n\nusing namespace std;\n\ntemplate <class F, class T>\n\nvoid convert(const F &f, T &t) {\n\n  stringstream ss;\n\n  ss << f;\n\n  ss >> t;\n}\n\nint main() {\n\n  int x, a, b;\n\n  string s;\n\n  while (scanf(\"%d\", &x), x) {\n\n    if (x % 1111 == 0) {\n\n      puts(\"NA\");\n\n    }\n\n    else {\n\n      int ans;\n\n      for (ans = 0; x != 6174; ++ans) {\n\n        convert(x, s);\n\n        s.resize(4, '0');\n\n        sort(s.begin(), s.end());\n\n        convert(s, a);\n\n        reverse(s.begin(), s.end());\n\n        convert(s, b);\n\n        x = b - a;\n      }\n\n      printf(\"%d\\n\", ans);\n    }\n  }\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstdlib>\n\n#include <climits>\n\nusing namespace std;\n\nint ans[10010];\n\nchar tmp[8];\n\nint dfs(int x) {\n\n  if (ans[x] >= 0) {\n\n    return ans[x];\n  }\n\n  if (ans[x] != -1) {\n\n    return INT_MIN;\n  }\n\n  ans[x] = INT_MIN;\n\n  sprintf(tmp, \"%04d\", x);\n\n  sort(tmp, tmp + 4);\n\n  int b = strtol(tmp, 0, 10);\n\n  reverse(tmp, tmp + 4);\n\n  int a = strtol(tmp, 0, 10);\n\n  ans[x] = dfs(a - b) + 1;\n\n  return ans[x];\n}\n\nint main() {\n\n  for (int i = 0; i < 10005; ++i) {\n\n    ans[i] = -1;\n  }\n\n  ans[6174] = 0;\n\n  int n;\n\n  while (scanf(\"%d\", &n), n) {\n\n    int a = dfs(n);\n\n    printf(a < 0 ? \"NA\\n\" : \"%d\\n\", a);\n  }\n}"}
{"fast_code_id":"6d6b79150bc07901b16c2bf4a6f4c4d8a357d014d56842fbe43b13815547d570","fast_id":"31e20dcca5847dc3351cafcd92944b734d6b8bd5f858094937e6544ebc0655eb","fast_time":0.0254039071,"language":"cpp","measured_fast_code_id":"31e20dcca5847dc3351cafcd92944b734d6b8bd5f858094937e6544ebc0655eb","measured_slow_code_id":"93c23252cec92e1799bfdfb04c63f75f25607ee4f7a7f4340e84396b2e62af6b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46186","problem_id":"p03479","slow_code_id":"5da5693c931c71b34e0fe1322b83141e0845b1a2443052f2d41600c14144e466","slow_id":"93c23252cec92e1799bfdfb04c63f75f25607ee4f7a7f4340e84396b2e62af6b","slow_time":0.0901003761,"speedup":3.5467133360757725,"stratum":"2-4","sampling_key":"25905b9599f5d9e09f0a07c8a71f1896c1b108f1b3c27f9c3230b43fd8e427b8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define pb push_back\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define rep1(i, n) for (int i = 1; i <= n; i++)\n\n#define mp make_pair\n\n#define F first\n\n#define S second\n\n#define IOS                                                                    \\\n  ios_base::sync_with_stdio(0);                                                \\\n  cin.tie(0)\n\ntypedef long long ll;\n\nvector<int> g[100005];\n\nll q, n;\n\nll a[1500005];\n\nint main()\n\n{\n\n  ll x, y;\n\n  while (cin >> x >> y)\n\n  {\n\n    ll sum = 0;\n\n    for (sum = 0; x <= y; x = x * 2, sum++)\n      ;\n\n    cout << sum << \"\\n\";\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  long long int a, b, c, d, e, i, j, k = 0;\n\n  vector<long long> v;\n\n  cin >> a >> b;\n\n  while (1)\n\n  {\n\n    if (a > b)\n      break;\n\n    a = a * 2;\n    k++;\n  }\n\n  cout << k << endl;\n}"}
{"fast_code_id":"e43737f284f68a9d18b2d1dca517e8f60ebeae5a01a544a95167d87678582eee","fast_id":"437f23f3b16770de3b7a17f4b370a01baf1ff9b1f71fddb2f6eee90a946618c0","fast_time":0.0076868174,"language":"cpp","measured_fast_code_id":"437f23f3b16770de3b7a17f4b370a01baf1ff9b1f71fddb2f6eee90a946618c0","measured_slow_code_id":"15180930f0f0326f64e3d862bb1c0d6ee85284e7ece6d6be5e4786e538783ec5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46279","problem_id":"p02907","slow_code_id":"57c0f48bcf5872a452cc8245fcd6aa25224ec735ddf45479eeae870e9b31b06d","slow_id":"15180930f0f0326f64e3d862bb1c0d6ee85284e7ece6d6be5e4786e538783ec5","slow_time":0.0956618077,"speedup":12.444917411463424,"stratum":"8+","sampling_key":"21169290ef23390bf173a14082800f00bcaf372a99485aa7098cb89d6cccb5b9","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int mod = 998244353, lim = 512;\n\ninline void add(int &x, int y) { (x += y) >= mod ? x -= mod : 0; }\n\ninline int pl(int x, int y) { return (x += y) >= mod ? x - mod : x; }\n\ninline int kpow(int a, int b)\n\n{\n\n  int s = 1;\n\n  for (; b; b >>= 1, a = 1ll * a * a % mod)\n\n    if (b & 1)\n      s = 1ll * s * a % mod;\n\n  return s;\n}\n\nint n, a[410], b[410], jc[512], jcv[512], S, Sv, ans;\n\nint dp[2][410][512], r[512], w[9][256], A[512];\n\nvoid init()\n\n{\n\n  jc[0] = 1;\n\n  for (int i = 1; i < lim; ++i)\n    jc[i] = 1ll * jc[i - 1] * i % mod;\n\n  jcv[lim - 1] = kpow(jc[lim - 1], mod - 2);\n\n  for (int i = lim - 1; i; --i)\n    jcv[i - 1] = 1ll * jcv[i] * i % mod;\n\n  for (int i = 1; i < lim; ++i)\n    r[i] = (r[i >> 1] >> 1) | (i & 1 ? lim >> 1 : 0);\n\n  for (int len = 1, i = 0; len < lim; len <<= 1, ++i)\n\n  {\n\n    int tmp = kpow(3, (mod - 1) / len / 2);\n\n    w[i][0] = 1;\n\n    for (int j = 1; j < len; ++j)\n      w[i][j] = 1ll * w[i][j - 1] * tmp % mod;\n  }\n}\n\nvoid ntt(int f[], int opt)\n\n{\n\n  for (int i = 1; i < lim; ++i)\n    if (i < r[i])\n      swap(f[i], f[r[i]]);\n\n  int x, y;\n\n  for (int len = 1, i = 0; len < lim; len <<= 1, ++i)\n\n    for (int j = 0; j < lim; j += len << 1)\n\n      for (int k = 0; k < len; ++k)\n\n      {\n\n        x = f[j + k], y = 1ll * f[j + k + len] * w[i][k] % mod;\n\n        f[j + k] = pl(x, y), f[j + k + len] = pl(x, mod - y);\n      }\n\n  if (opt == -1)\n\n  {\n\n    reverse(f + 1, f + lim);\n\n    int inv = kpow(lim, mod - 2);\n\n    for (int i = 0; i < lim; ++i)\n      f[i] = 1ll * f[i] * inv % mod;\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  init();\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%d %d\", &a[i], &b[i]), S += a[i];\n\n  for (int i = 0; i < lim; ++i)\n    dp[0][0][i] = 1;\n\n  Sv = kpow(S, mod - 2);\n\n  int t = 0;\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    memset(A, 0, sizeof(A));\n\n    int tmp = 1ll * a[i] * Sv % mod, cur = 1;\n\n    for (int j = 0; j < b[i]; ++j)\n\n    {\n\n      A[j] = 1ll * (mod - cur) * jcv[j] % mod;\n\n      cur = 1ll * cur * tmp % mod;\n    }\n\n    ntt(A, 1);\n\n    t ^= 1;\n    memset(dp[t], 0, sizeof(dp[t]));\n\n    for (int j = 0; j < S; ++j)\n\n    {\n\n      for (int k = 0; k < lim; ++k)\n        dp[t][j][k] = 1ll * A[k] * dp[t ^ 1][j][k] % mod;\n\n      if (j >= a[i])\n        for (int k = 0; k < lim; ++k)\n          add(dp[t][j][k], dp[t ^ 1][j - a[i]][k]);\n    }\n  }\n\n  for (int i = 0; i < S; ++i)\n\n  {\n\n    ntt(dp[t][i], -1);\n\n    int na = 1ll * i * Sv % mod, tmp = kpow(mod + 1 - na, mod - 2), w = tmp;\n\n    for (int j = 0; j < lim; ++j)\n      ans = (ans + 1ll * dp[t][i][j] * w % mod * jc[j]) % mod,\n      w = 1ll * w * tmp % mod;\n  }\n\n  if (ans)\n    ans = mod - ans;\n\n  printf(\"%d\", ans);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int mod = 998244353;\n\ninline void add(int &x, int y) { (x += y) >= mod ? x -= mod : 0; }\n\ninline int pl(int x, int y) { return (x += y) >= mod ? x - mod : x; }\n\ninline int kpow(int a, int b)\n\n{\n\n  int s = 1;\n\n  for (; b; b >>= 1, a = 1ll * a * a % mod)\n\n    if (b & 1)\n      s = 1ll * s * a % mod;\n\n  return s;\n}\n\nint n, a[410], b[410], jc[410], jcv[410], Sa, Sb, Sv, ans;\n\nint dp[410][410], A[410];\n\nvoid init()\n\n{\n\n  jc[0] = 1;\n\n  for (int i = 1; i <= 400; ++i)\n    jc[i] = 1ll * jc[i - 1] * i % mod;\n\n  jcv[400] = kpow(jc[400], mod - 2);\n\n  for (int i = 400; i; --i)\n    jcv[i - 1] = 1ll * jcv[i] * i % mod;\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  init();\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%d %d\", &a[i], &b[i]), Sa += a[i];\n\n  Sv = kpow(Sa, mod - 2);\n\n  dp[0][0] = 1;\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    int tmp = 1ll * a[i] * Sv % mod, cur = 1;\n\n    for (int j = 0; j < b[i]; ++j)\n\n    {\n\n      A[j] = 1ll * (mod - cur) * jcv[j] % mod;\n\n      cur = 1ll * cur * tmp % mod;\n    }\n\n    for (int j = Sa - 1; ~j; --j)\n\n      for (int k = Sb; ~k; --k)\n\n      {\n\n        for (int l = 1; l < b[i]; ++l)\n          dp[j][k + l] = (dp[j][k + l] + 1ll * dp[j][k] * A[l]) % mod;\n\n        dp[j][k] = mod - dp[j][k];\n\n        if (j >= a[i])\n          add(dp[j][k], dp[j - a[i]][k]);\n      }\n\n    Sb += b[i] - 1;\n  }\n\n  for (int i = 0; i < Sa; ++i)\n\n  {\n\n    int na = 1ll * i * Sv % mod, tmp = kpow(mod + 1 - na, mod - 2), w = tmp;\n\n    for (int j = 0; j <= Sb; ++j)\n      ans = (ans + 1ll * dp[i][j] * w % mod * jc[j]) % mod,\n      w = 1ll * w * tmp % mod;\n  }\n\n  if (ans)\n    ans = mod - ans;\n\n  printf(\"%d\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"cc5cd042216a855616c7a10c61df84e0510cab57d0fa20914ca2d5402ff19ad1","fast_id":"4d917cbf9444581e45f80d92a5b12d1897f1322dae57afdcf16eebcb2fb524fc","fast_time":0.1064956475,"language":"cpp","measured_fast_code_id":"4d917cbf9444581e45f80d92a5b12d1897f1322dae57afdcf16eebcb2fb524fc","measured_slow_code_id":"5d295fcd5eed1d08e89abe6d2b11c4e8d794baac04170c9e0c2e1acfaea8af58","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46321","problem_id":"p03452","slow_code_id":"5a58d4e6bc330677e89ddd40e0efe7d1a2f71e5ed5b55d46863370f83dc184bb","slow_id":"5d295fcd5eed1d08e89abe6d2b11c4e8d794baac04170c9e0c2e1acfaea8af58","slow_time":0.835131007,"speedup":7.841926187640674,"stratum":"4-8","sampling_key":"2f0d8c109fa3d4aab1fbc2399abc6022d57a723bd253dbd2be32b07f382e616a","slow_code":"#include <bits/stdc++.h>\n\n#define LL long long\n\n#define mp make_pair\n\n#define pb push_back\n\n#define INF (1 << 29)\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\nint n, m;\n\nvector<pii> G[200010];\n\nint col[200010];\n\nint vis[200010];\n\nbool dfs(int x, int co) {\n\n  if (vis[x] != -1)\n    return col[x] == co;\n\n  vis[x] = 1;\n\n  col[x] = co;\n\n  for (pii i : G[x]) {\n\n    if (dfs(i.first, co + i.second) == 0)\n      return false;\n  }\n\n  return true;\n}\n\nint main() {\n\n  cin >> n >> m;\n\n  memset(vis, -1, sizeof(vis));\n\n  if (m == 0) {\n\n    cout << \"Yes\\n\";\n\n    return 0;\n  }\n\n  for (int i = 1; i <= m; i++) {\n\n    int l, r, d;\n\n    cin >> l >> r >> d;\n\n    G[l].pb(mp(r, d));\n\n    G[r].pb(mp(l, -d));\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    if (vis[i] != -1)\n      continue;\n\n    memset(col, 0, sizeof(col));\n\n    if (dfs(i, 0) == 0) {\n\n      cout << \"No\\n\";\n\n      return 0;\n    }\n  }\n\n  cout << \"Yes\\n\";\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <cstring>\n\n#define max(x, y) x > y ? x : y\n\nusing namespace std;\n\nconst int maxn = 1011111;\n\nint father[maxn];\n\nint gradfa[maxn];\n\nint find(int x)\n\n{\n\n  if (father[x] == x)\n\n    return x;\n\n  int r = find(father[x]);\n\n  gradfa[x] = gradfa[father[x]] + gradfa[x];\n\n  return father[x] = r;\n}\n\nint fix(int x, int y, int z)\n\n{\n\n  int fx = find(x);\n\n  int fy = find(y);\n\n  if (fx == fy)\n\n    return z == gradfa[y] - gradfa[x];\n\n  father[fy] = fx;\n\n  gradfa[fy] = gradfa[x] + z - gradfa[y];\n\n  return 1;\n}\n\nint main()\n\n{\n\n  int n, m;\n\n  int lose = 1;\n\n  cin >> n >> m;\n\n  for (int i = 1; i <= n; i++)\n\n    father[i] = i;\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int x, y, z;\n\n    cin >> x >> y >> z;\n\n    if (lose)\n\n      lose = fix(x, y, z);\n  }\n\n  if (lose)\n\n    cout << \"Yes\" << endl;\n\n  else\n\n    cout << \"No\" << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"4b89ffb32face980aaa53d968ac23b4ef7e66e882e0e33aa848ba89368b2ba2a","fast_id":"e699a2c525536a51e482319ce89538c32828268524e027b0daacc675cce5dad8","fast_time":0.0215314968,"language":"cpp","measured_fast_code_id":"e699a2c525536a51e482319ce89538c32828268524e027b0daacc675cce5dad8","measured_slow_code_id":"1a2281c2c0d2304439d6ab6159eae23d95bb81a8b99ec7dcc5f2aaf871186545","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4642","problem_id":"p02550","slow_code_id":"1402c0516effe665d1c97f36ba89465387a231ff9500d48aeca26902c2e5603d","slow_id":"1a2281c2c0d2304439d6ab6159eae23d95bb81a8b99ec7dcc5f2aaf871186545","slow_time":0.0736319101,"speedup":3.419730211231762,"stratum":"2-4","sampling_key":"7efc2a260e962dc5511f1b698c19104edff3c0dc27f1c1b98df4a5562dec6195","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define repl(i, l, r) for (ll i = (l); i < (r); i++)\n\n#define per(i, n) for (ll i = n - 1; i >= 0; i--)\n\n#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)\n\n#define fi fist\n\n#define se second\n\n#define pb push_back\n\n#define ins insert\n\n#define all(x) (x).begin(), (x).end()\n\nusing ll = long long;\n\nusing vl = vector<ll>;\n\nusing vvl = vector<vector<ll>>;\n\nconst ll MOD9 = 1000000007;\n\nconst ll MOD = 998244353;\n\nconst int inf = 1e9 + 10;\n\nconst ll INF = 4e18;\n\nconst ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};\n\nconst ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};\n\nusing Graph = vector<vector<int>>;\n\nstruct edge {\n  ll to, cost;\n};\n\ntypedef pair<ll, ll> P;\n\nstruct graph {\n\n  ll V;\n\n  vector<vector<edge> > G;\n\n  vector<ll> d;\n\n  graph(ll n) { init(n); }\n\n  void init(ll n) {\n\n    V = n;\n\n    G.resize(V);\n\n    d.resize(V);\n\n    rep(i, V) { d[i] = INF; }\n  }\n\n  void add_edge(ll s, ll t, ll cost) {\n\n    edge e;\n\n    e.to = t, e.cost = cost;\n\n    G[s].push_back(e);\n  }\n\n  void dijkstra(ll s) {\n\n    rep(i, V) { d[i] = INF; }\n\n    d[s] = 0;\n\n    priority_queue<P, vector<P>, greater<P> > que;\n\n    que.push(P(0, s));\n\n    while (!que.empty()) {\n\n      P p = que.top();\n      que.pop();\n\n      ll v = p.second;\n\n      if (d[v] < p.first)\n        continue;\n\n      for (auto e : G[v]) {\n\n        if (d[e.to] > d[v] + e.cost) {\n\n          d[e.to] = d[v] + e.cost;\n\n          que.push(P(d[e.to], e.to));\n        }\n      }\n    }\n  }\n};\n\nclass UnionFind\n\n{\n\npublic:\n  ll par[100005];\n\n  ll depth[100005];\n\n  ll nGroup[100005];\n\n  UnionFind(ll n) { init(n); }\n\n  void init(ll n) {\n\n    for (ll i = 0; i < n; i++) {\n\n      par[i] = i;\n\n      depth[i] = 0;\n\n      nGroup[i] = 1;\n    }\n  }\n\n  ll root(ll x) {\n\n    if (par[x] == x) {\n\n      return x;\n\n    } else {\n\n      return par[x] = root(par[x]);\n    }\n  }\n\n  bool same(ll x, ll y) { return root(x) == root(y); }\n\n  void unite(ll x, ll y) {\n\n    x = root(x);\n\n    y = root(y);\n\n    if (x == y)\n      return;\n\n    if (depth[x] < depth[y]) {\n\n      par[x] = y;\n\n      nGroup[y] += nGroup[x];\n\n      nGroup[x] = 0;\n\n    } else {\n\n      par[y] = x;\n\n      nGroup[x] += nGroup[y];\n\n      nGroup[y] = 0;\n\n      if (depth[x] == depth[y])\n\n        depth[x]++;\n    }\n  }\n};\n\nconst ll MAX = 500010;\n\nll fac[MAX], finv[MAX], inv[MAX];\n\nvoid COMinit() {\n\n  fac[0] = fac[1] = 1;\n\n  finv[0] = finv[1] = 1;\n\n  inv[1] = 1;\n\n  for (ll i = 2; i < MAX; i++) {\n\n    fac[i] = fac[i - 1] * i % MOD;\n\n    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n\n    finv[i] = finv[i - 1] * inv[i] % MOD;\n  }\n}\n\nvector<ll> depth;\n\nvector<ll> f;\n\nvector<ll> g;\n\nvoid dfs(const Graph &G, ll v, ll p, ll d) {\n\n  depth[v] = d;\n\n  for (auto nv : G[v]) {\n\n    if (nv == p)\n      continue;\n\n    dfs(G, nv, v, d + 1);\n  }\n\n  f[v] = 1;\n\n  g[v] = 1;\n\n  for (auto c : G[v]) {\n\n    if (c == p)\n      continue;\n\n    f[v] *= g[c];\n\n    f[v] %= MOD;\n\n    g[v] *= f[c];\n\n    g[v] %= MOD;\n  }\n\n  f[v] += g[v];\n\n  f[v] %= MOD;\n}\n\ntemplate <ll MOD> struct Fp {\n\n  ll val;\n\n  constexpr Fp(ll v = 0) noexcept : val(v % MOD) {\n\n    if (val < 0)\n      val += MOD;\n  }\n\n  constexpr ll getmod() { return MOD; }\n\n  constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }\n\n  constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }\n\n  constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }\n\n  constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }\n\n  constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }\n\n  constexpr Fp &operator+=(const Fp &r) noexcept {\n\n    val += r.val;\n\n    if (val >= MOD)\n      val -= MOD;\n\n    return *this;\n  }\n\n  constexpr Fp &operator-=(const Fp &r) noexcept {\n\n    val -= r.val;\n\n    if (val < 0)\n      val += MOD;\n\n    return *this;\n  }\n\n  constexpr Fp &operator*=(const Fp &r) noexcept {\n\n    val = val * r.val % MOD;\n\n    return *this;\n  }\n\n  constexpr Fp &operator/=(const Fp &r) noexcept {\n\n    ll a = r.val, b = MOD, u = 1, v = 0;\n\n    while (b) {\n\n      ll t = a / b;\n\n      a -= t * b;\n      swap(a, b);\n\n      u -= t * v;\n      swap(u, v);\n    }\n\n    val = val * u % MOD;\n\n    if (val < 0)\n      val += MOD;\n\n    return *this;\n  }\n\n  constexpr bool operator==(const Fp &r) const noexcept { return this->val == r.val; }\n\n  constexpr bool operator!=(const Fp &r) const noexcept { return this->val != r.val; }\n\n  friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {\n\n    return os << x.val;\n  }\n\n  friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, ll n) noexcept {\n\n    if (n == 0)\n      return 1;\n\n    auto t = modpow(a, n / 2);\n\n    t = t * t;\n\n    if (n & 1)\n      t = t * a;\n\n    return t;\n  }\n};\n\nusing mint = Fp<MOD>;\n\nmint calc(ll N, ll K) {\n\n  mint res = 1;\n\n  for (ll n = 0; n < K; ++n) {\n\n    res *= (N - n);\n\n    res /= (n + 1);\n  }\n\n  return res;\n}\n\nmint COM(ll n, ll k) {\n\n  if (k == 0)\n    return 1;\n\n  if (n < k)\n    return 0;\n\n  if (n < 0 || k < 0)\n    return 0;\n\n  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nint main() {\n\n  ll n, x, m;\n  cin >> n >> x >> m;\n\n  ll a[100005] = {};\n\n  ll loop = 1;\n\n  ll ca = x;\n\n  ll k = x;\n\n  ll sum[100005] = {};\n\n  a[x]++;\n\n  ll c[100005] = {};\n\n  sum[1] = x;\n\n  c[x] = 1;\n\n  while (1) {\n\n    k = (k * k) % m;\n\n    ca += k;\n\n    loop++;\n\n    a[k]++;\n\n    if (loop == n)\n      break;\n\n    if (a[k] == 2)\n      break;\n\n    c[k] = loop;\n\n    sum[loop] += k + sum[loop - 1];\n  }\n\n  if (loop == n) {\n\n    cout << ca << endl;\n\n    return 0;\n  }\n\n  ca -= k;\n\n  ll sum1 = sum[loop - 1] - sum[c[k] - 1];\n\n  ll roop = loop - c[k];\n\n  ll len = n - loop + 1;\n\n  ll mo = len % roop;\n\n  ca += sum1 * (len / roop);\n\n  for (ll i = 0; i < mo; i++) {\n\n    ca += k;\n\n    k = (k * k) % m;\n  }\n\n  cout << ca << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define per(i, n) for (int i = n - 1; i >= 0; i--)\n\ntypedef long long ll;\n\ntypedef pair<int, int> P;\n\ntypedef pair<long long, long long> Pll;\n\ntypedef vector<int> vi;\n\ntypedef vector<ll> vll;\n\nconst long long mod = 1000000007LL;\n\nll check[110000];\n\nint main() {\n\n  ll n, x, m;\n\n  cin >> n >> x >> m;\n\n  if (x == 0) {\n\n    cout << 0 << endl;\n\n    return 0;\n  }\n\n  vll v;\n\n  ll cnt = 0LL;\n\n  ll a = x;\n\n  rep(i, m * 2) {\n\n    v.push_back(a);\n\n    cnt += a;\n\n    check[a] = true;\n\n    a *= a;\n\n    a %= m;\n\n    if (check[a])\n      break;\n\n    if (a == 0) {\n\n      cout << cnt << endl;\n\n      return 0;\n    }\n  }\n\n  if (a == x) {\n\n    ll s = v.size();\n\n    ll ans = 0LL;\n\n    ll b = n / s;\n\n    ans += cnt * b;\n\n    rep(i, n % s) ans += v[i];\n\n    cout << ans << endl;\n\n  }\n\n  else {\n\n    ll ans = 0LL;\n\n    bool swi = true;\n\n    vll vv;\n\n    ll vs = v.size();\n\n    rep(i, vs) {\n\n      if (v[i] == a)\n        swi = false;\n\n      if (swi) {\n\n        ans += v[i];\n\n        n--;\n\n      }\n\n      else\n        vv.push_back(v[i]);\n    }\n\n    ll s = vv.size();\n\n    ll sum = 0LL;\n\n    rep(i, s) sum += vv[i];\n\n    ll b = n / s;\n\n    ans += sum * b;\n\n    rep(i, n % s) ans += vv[i];\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"fae2975b7f877c6edd8ebeacac8014e884dda205743a7a4193b502746b1a75ea","fast_id":"4c9c8cf15b3c3fb33717ac33d9486fc4b31da574aed7bd4bb2660420131a1f13","fast_time":0.0194813854,"language":"cpp","measured_fast_code_id":"4c9c8cf15b3c3fb33717ac33d9486fc4b31da574aed7bd4bb2660420131a1f13","measured_slow_code_id":"a9f0ea708a02c37c097450df7f24c24ba923a5f457a47c90d8c3575d123521e0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46494","problem_id":"p02835","slow_code_id":"46bc5eb71f741b7eaeb3f6231d64955f560a28ec16083e227f289f71721f4ae2","slow_id":"a9f0ea708a02c37c097450df7f24c24ba923a5f457a47c90d8c3575d123521e0","slow_time":0.1042382247,"speedup":5.3506576950117735,"stratum":"4-8","sampling_key":"000eb2d4bebd5dc0fa0324deda67d88a218b21c93c93122cb3ab952fc19fdb7c","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int a, b, c;\n\n  cin >> a >> b >> c;\n\n  if (a + b + c >= 22)\n\n  {\n\n    cout << \"bust\";\n\n  }\n\n  else {\n\n    cout << \"win\";\n  }\n}","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int a1, a2, a3, score;\n\n  scanf(\"%d %d %d\", &a1, &a2, &a3);\n\n  score = a1 + a2 + a3;\n\n  if (score >= 22) {\n\n    printf(\"bust\\n\");\n\n  }\n\n  else {\n\n    printf(\"win\\n\");\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"1ef2c7e432b45be981067081075c2ad30ca115e22e3738c4fb33ce546b15eb70","fast_id":"eb033cd9c295cf5529e6d0051db811ca21ea20b1f733db4577c07def5a9e8417","fast_time":0.0898503755,"language":"cpp","measured_fast_code_id":"eb033cd9c295cf5529e6d0051db811ca21ea20b1f733db4577c07def5a9e8417","measured_slow_code_id":"17b2c1a70420fcba03b58384320f6cbe1fb83f0a9a7e3051e8beecc5a9d8e73b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4655","problem_id":"p00743","slow_code_id":"50bebec041baceacca5d49b75fd9f66018b87a6856bcce1239b6dd78385c6fd8","slow_id":"17b2c1a70420fcba03b58384320f6cbe1fb83f0a9a7e3051e8beecc5a9d8e73b","slow_time":0.3420607625,"speedup":3.807004262324981,"stratum":"2-4","sampling_key":"e2b3ff82841d1dbb0a5ff0a4a23c486c242d54275b01b42ca45e910099e45599","slow_code":"#include <stdio.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\n#include <functional>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nusing namespace std;\n\nconst int INF = 100000000;\n\nconst double EPS = 0.0000001;\n\ntypedef pair<int, int> P;\n\nint n, m;\n\nstruct edge\n\n{\n\n  int to, cost, ub;\n\n  edge(int to, int cost, int ub) {\n\n    this->to = to;\n\n    this->cost = cost;\n\n    this->ub = ub;\n  }\n};\n\nvector<edge> G[103];\n\nint s, g;\n\ndouble dist[103][103][33];\n\ntypedef pair<double, int> PD;\n\ntypedef pair<PD, P> PP;\n\ndouble dijkstra() {\n\n  rep(i, 103) rep(j, 103) rep(k, 33) dist[i][j][k] = INF;\n\n  dist[s][0][0] = 0;\n\n  priority_queue<PP, vector<PP>, greater<PP> > que;\n\n  que.push(PP(PD(0, s), P(0, 0)));\n\n  while (!que.empty())\n\n  {\n\n    PP pp = que.top();\n    que.pop();\n\n    int v = pp.first.second;\n\n    int prev = pp.second.first;\n\n    int u = pp.second.second;\n\n    if (dist[v][prev][u] < pp.first.first)\n      continue;\n\n    rep(i, G[v].size()) {\n\n      edge e = G[v][i];\n\n      if (e.to == prev)\n        continue;\n\n      for (int j = -1; j <= 1; j++) {\n\n        if (j + u <= 0 || u + j > e.ub)\n          continue;\n\n        if (dist[e.to][v][u + j] > dist[v][prev][u] + (1.0 * e.cost / (u + j))) {\n\n          dist[e.to][v][u + j] = dist[v][prev][u] + (1.0 * e.cost / (u + j));\n\n          que.push(PP(PD(dist[e.to][v][u + j], e.to), P(v, u + j)));\n        }\n      }\n    }\n  }\n\n  double ans = INF;\n\n  rep(i, 103) ans = min(ans, dist[g][i][1]);\n\n  return ans;\n}\n\nvoid solve() {\n\n  rep(i, 103) G[i].clear();\n\n  cin >> s >> g;\n\n  rep(i, m) {\n\n    int x, y, d, c;\n\n    cin >> x >> y >> d >> c;\n\n    G[x].push_back(edge(y, d, c));\n\n    G[y].push_back(edge(x, d, c));\n  }\n\n  double ans;\n\n  ans = dijkstra();\n\n  if (ans == INF) {\n\n    cout << \"unreachable\" << endl;\n\n  }\n\n  else\n\n  {\n\n    cout << ans << endl;\n  }\n}\n\nint main() {\n\n  while (cin >> n >> m)\n\n  {\n\n    if (n + m == 0)\n      return 0;\n\n    solve();\n  }\n}","fast_code":"#include <algorithm>\n\n#include <functional>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <string>\n\n#include <sstream>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <vector>\n\n#include <list>\n\n#include <stack>\n\n#include <queue>\n\n#include <map>\n\n#include <set>\n\n#include <bitset>\n\n#include <climits>\n\n#define all(c) (c).begin(), (c).end()\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define pb(e) push_back(e)\n\n#define mp(a, b) make_pair(a, b)\n\n#define fr first\n\n#define sc second\n\nconst int INF = 100000000;\n\nint dx[4] = {1, 0, -1, 0};\n\nint dy[4] = {0, 1, 0, -1};\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\ntypedef long long ll;\n\ntemplate <class T>\n\nbool chmin(T &a, const T &b) {\n\n  if (a > b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\nstruct Edge {\n\n  int to, d, c;\n\n  Edge(int to = 0, int d = 0, int c = 0)\n      :\n\n        to(to), d(d), c(c) {}\n};\n\nstruct State {\n\n  int v, u;\n\n  int spd;\n\n  double t;\n\n  State(int v = 0, int u = 0, int spd = 0, double t = 0)\n      :\n\n        v(v), u(u), spd(spd), t(t) {}\n\n  bool operator<(const State &rhs) const { return t > rhs.t; }\n};\n\nint s, g;\n\nint n, m;\n\nvector<Edge> G[40];\n\ndouble dijk() {\n\n  double d[40][40][40];\n\n  rep(i, 40) rep(j, 40) rep(k, 40) d[i][j][k] = INF;\n\n  d[s][s][0] = 0;\n\n  priority_queue<State> que;\n\n  que.push(State(s, s, 0));\n\n  while (que.size()) {\n\n    State s = que.top();\n    que.pop();\n\n    rep(i, G[s.v].size()) {\n\n      Edge e = G[s.v][i];\n\n      if (e.to == s.u)\n        continue;\n\n      for (int k = -1; k <= 1; k++) {\n\n        if (!(0 <= s.spd + k && s.spd + k <= e.c))\n          continue;\n\n        if (s.spd + k <= 0)\n          continue;\n\n        if (chmin(d[e.to][s.v][s.spd + k], d[s.v][s.u][s.spd] + 1.0 * e.d / (s.spd + k))) {\n\n          que.push(State(e.to, s.v, s.spd + k, d[e.to][s.v][s.spd + k]));\n        }\n      }\n    }\n  }\n\n  double ret = INF;\n\n  rep(i, 40) chmin(ret, d[g][i][1]);\n\n  return ret;\n}\n\nvoid solve() {\n\n  rep(i, 40) G[i].clear();\n\n  cin >> s >> g;\n\n  s--, g--;\n\n  rep(i, m) {\n\n    int x, y, d, c;\n\n    cin >> x >> y >> d >> c;\n\n    x--, y--;\n\n    G[x].push_back(Edge(y, d, c));\n\n    G[y].push_back(Edge(x, d, c));\n  }\n\n  double ans = dijk();\n\n  if (ans == INF)\n    cout << \"unreachable\" << endl;\n\n  else\n    printf(\"%.10f\\n\", ans);\n}\n\nint main() {\n\n  while (cin >> n >> m) {\n\n    if (n == 0)\n      break;\n\n    solve();\n  }\n\n  return 0;\n}"}
{"fast_code_id":"c4d9478001129b8733e9f43ff8a39d7f48440bb3cd6a83ec3c672cafe3373f6c","fast_id":"fa8fd875fa771c51571a687614917dff5c7c22c39e6c358ff579f5542ff5b102","fast_time":0.0071479751,"language":"cpp","measured_fast_code_id":"fa8fd875fa771c51571a687614917dff5c7c22c39e6c358ff579f5542ff5b102","measured_slow_code_id":"b8b8a64719431604bd31fe63ec59bb7d8cfb15efc7564b43240df8e1418ef63b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46557","problem_id":"p02713","slow_code_id":"a6672d931cc38cc3935dcf3ab5bf5f7fcfbd29ace97f8cff3d9a950d7eeabfad","slow_id":"b8b8a64719431604bd31fe63ec59bb7d8cfb15efc7564b43240df8e1418ef63b","slow_time":0.0301493235,"speedup":4.217883117695807,"stratum":"4-8","sampling_key":"99da89ed334d5639ac937af4b527944ec93474ac365b6dbccaf93fe8f0bf523c","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint gcd(int p, int q)\n\n{\n\n  if (q == 0)\n    return p;\n\n  return gcd(q, p % q);\n}\n\nint main(void)\n\n{\n\n  int k, sum = 0, g;\n\n  cin >> k;\n\n  for (int i = 1; i <= k; i++)\n\n  {\n\n    for (int j = 1; j <= k; j++)\n\n    {\n\n      g = gcd(i, j);\n\n      for (int l = 1; l <= k; l++)\n\n      {\n\n        sum += gcd(g, l);\n      }\n    }\n  }\n\n  cout << sum;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\nint e(int p, int q)\n\n{\n\n  if (q == 0)\n\n    return p;\n\n  return e(q, p % q);\n}\n\nint main(void)\n\n{\n\n  int k, sum = 0;\n\n  scanf(\"%d\", &k);\n\n  for (int i = 1; i <= k; i++)\n\n    for (int j = 1; j <= k; j++)\n\n    {\n\n      int g = e(i, j);\n\n      for (int l = 1; l <= k; l++)\n\n        sum += e(g, l);\n    }\n\n  printf(\"%d\", sum);\n\n  return 0;\n}\n"}
{"fast_code_id":"7ae7bc9766f1e6e6e04aea4b0304402cef50242d06ad5c60f84426d3ebce61d8","fast_id":"d1daa2cbc041d15060d4333eb46e5a92f6757a83f2d29366d2664f79dddd00ed","fast_time":0.1027386143,"language":"cpp","measured_fast_code_id":"d1daa2cbc041d15060d4333eb46e5a92f6757a83f2d29366d2664f79dddd00ed","measured_slow_code_id":"587d2e9ff06b3678130cf3b1712524a49254712220e03f6e57e1a1d45c95d4c1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46562","problem_id":"p03238","slow_code_id":"1bf29ac73f8b65a0c42201ec15e6931cf0c736089e0e8906a6c67035b500c37e","slow_id":"587d2e9ff06b3678130cf3b1712524a49254712220e03f6e57e1a1d45c95d4c1","slow_time":0.3642966015,"speedup":3.545858623674273,"stratum":"2-4","sampling_key":"dcf63eb36170119721d323a489022e59081c85334e9cd522ec797336da762326","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <string>\n\n#include <vector>\n\n#include <set>\n\n#include <cmath>\n\n#include <stdio.h>\n\n#include <list>\n\n#include <numeric>\n\n#include <stack>\n\n#include <queue>\n\n#include <tuple>\n\n#include <bitset>\n\n#include <map>\n\n#include <math.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\ntypedef long long ll;\n\ntypedef pair<int, int> P;\n\nconst int inf = 1012345678;\n\nint dx[] = {1, -1, 0, 0};\n\nint dy[] = {0, 0, 1, -1};\n\nvector<int> v[100001];\n\nint c[100000];\n\nint y[100000];\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  if (n == 1)\n    cout << \"Hello World\" << endl;\n\n  else {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    cout << a + b << endl;\n  }\n}\n","fast_code":"#include <algorithm>\n\n#include <bitset>\n\n#include <cmath>\n\n#include <ctime>\n\n#include <iostream>\n\n#include <list>\n\n#include <map>\n\n#include <math.h>\n\n#include <numeric>\n\n#include <queue>\n\n#include <set>\n\n#include <stack>\n\n#include <stdio.h>\n\n#include <string>\n\n#include <tuple>\n\n#include <vector>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define all(a) begin(a), end(a)\n\ntypedef long long ll;\n\ntypedef pair<int, int> P;\n\nconst int inf = 1e+9;\n\nconst ll mod = 1000000007;\n\nconst double PI = 3.14159265358979323846;\n\nint dx[] = {1, -1, 0, 0};\n\nint dy[] = {0, 0, 1, -1};\n\nll gcd(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  else\n    return gcd(b, a % b);\n}\n\nint cans(bool f) {\n\n  if (f)\n    cout << \"Yes\" << endl;\n\n  else\n    cout << \"No\" << endl;\n\n  return 0;\n}\n\nint main() {\n\n  int N;\n\n  cin >> N;\n\n  if (N == 1)\n    cout << \"Hello World\" << endl;\n\n  else {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    cout << a + b << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"7e297d32fb265267135920e361f30f0286e56030814b0f9a0ced93be85d90136","fast_id":"ab3594cf0723dc1a63f78ac7f9ac88163917dab2f02d52df7d1ffbb764249110","fast_time":0.0240649638,"language":"cpp","measured_fast_code_id":"ab3594cf0723dc1a63f78ac7f9ac88163917dab2f02d52df7d1ffbb764249110","measured_slow_code_id":"4c59b3ced59188dba19f17df1801079d8f3718dbeb4f0ed36d67b7d9080b5751","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46656","problem_id":"p02617","slow_code_id":"9bcdb99d9fe67943850352b173a1d911def21c6e82e561a06218e1559d3bd805","slow_id":"4c59b3ced59188dba19f17df1801079d8f3718dbeb4f0ed36d67b7d9080b5751","slow_time":0.1581448377,"speedup":6.5715801201412996,"stratum":"4-8","sampling_key":"595c48514423361e84da5c51cb5de991aaa254ad125958da750e57d3d38614dd","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MAXN = 2e5 + 5;\n\nvector<int> e[MAXN];\n\nint main(int argc, char *argv[]) {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  long long ans = 1LL * n * (n + 1) * (n + 2) / 6;\n\n  for (int i = 1; i < n; i++) {\n\n    int u, v;\n\n    scanf(\"%d %d\", &u, &v);\n\n    if (u > v)\n      swap(u, v);\n\n    ans -= 1LL * u * (n - v + 1);\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nnamespace chtholly {\n\ntypedef long long ll;\n\n#define re0 register int\n\n#define rel register ll\n\n#define rec register char\n\n#define gc getchar\n\n#define pc putchar\n\n#define p32 pc(' ')\n\n#define pl puts(\"\")\n\nchar buf[1 << 23], *p1 = buf, *p2 = buf;\n\ninline int read() {\n\n  int x = 0, f = 1;\n  char c = gc();\n\n  for (; !isdigit(c); c = gc())\n    f ^= c == '-';\n\n  for (; isdigit(c); c = gc())\n    x = (x << 3) + (x << 1) + (c ^ '0');\n\n  return f ? x : -x;\n}\n\ntemplate <typename mitsuha>\n\ninline bool read(mitsuha &x) {\n\n  x = 0;\n  int f = 1;\n  char c = gc();\n\n  for (; !isdigit(c) && ~c; c = gc())\n    f ^= c == '-';\n\n  if (!~c)\n    return 0;\n\n  for (; isdigit(c); c = gc())\n    x = (x << 3) + (x << 1) + (c ^ '0');\n\n  return x = f ? x : -x, 1;\n}\n\ntemplate <typename mitsuha>\n\ninline int write(mitsuha x) {\n\n  if (!x)\n    return 0 & pc(48);\n\n  if (x < 0)\n    pc('-'), x = -x;\n\n  int bit[20], i, p = 0;\n\n  for (; x; x /= 10)\n    bit[++p] = x % 10;\n\n  for (i = p; i; --i)\n    pc(bit[i] + 48);\n\n  return 0;\n}\n\ninline char fuhao() {\n\n  char c = gc();\n\n  for (; isspace(c); c = gc())\n    ;\n\n  return c;\n}\n\n}                      \nusing namespace chtholly;\n\nusing namespace std;\n\nconst int yuzu = 2e5;\n\ntypedef int fuko[yuzu | 10];\n\nint main() {\n\n  int i, n = read(), u, v;\n\n  ll lxy = 1ll * n * (n + 1) * (n + 2) / 6;\n\n  for (i = 1; i < n; ++i) {\n\n    read(u), read(v);\n\n    if (u > v)\n      swap(u, v);\n\n    lxy -= 1ll * u * (n - v + 1);\n  }\n\n  printf(\"%lld\\n\", lxy);\n}"}
{"fast_code_id":"3e9f577c1f75a5f7af75441e0687bb770da64516409b42668ef0314d59ec2b80","fast_id":"4b4fbb84160f6dd781ed6c567629107c73291458b8c63ab427b127408a1e967a","fast_time":0.0177784312,"language":"cpp","measured_fast_code_id":"4b4fbb84160f6dd781ed6c567629107c73291458b8c63ab427b127408a1e967a","measured_slow_code_id":"bca486ee07191201aae077d6768483b9b50313f4869cea03c477ec6667b36045","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46670","problem_id":"p02749","slow_code_id":"b5351c66d94154315210b8d2800021e36b1da6f1a4b4da89e6c7807bcb027da1","slow_id":"bca486ee07191201aae077d6768483b9b50313f4869cea03c477ec6667b36045","slow_time":0.8475952436,"speedup":47.67548014022745,"stratum":"8+","sampling_key":"282293e759eaf22bdaa6fdf071589a2b59d583cbb9a017334cb8c20420e87e05","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint N;\n\nvector<int> E[200001];\n\nint D[200001], cnt[2];\n\nvoid dfs(int p, int prev, int d) {\n\n  D[p] = d;\n\n  cnt[d]++;\n\n  for (int to : E[p]) {\n\n    if (to != prev) {\n\n      dfs(to, p, (d + 1) % 2);\n    }\n  }\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> N;\n\n  rep(i, N - 1) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    E[a].pb(b);\n\n    E[b].pb(a);\n  }\n\n  dfs(1, 0, 0);\n\n  int k0 = 0, k1 = 0, k2 = 0;\n\n  int n0 = (N + 2) / 3;\n\n  int n1 = (N + 1) / 3;\n\n  int n2 = N / 3;\n\n  if (cnt[0] < cnt[1]) {\n\n    if (cnt[0] > N / 3) {\n\n      rep1(i, N) {\n\n        if (D[i] == 0) {\n\n          if (k0 < n0)\n            cosp(k0++ * 3 + 1);\n\n          else\n            cosp(k2++ * 3 + 3);\n\n        }\n\n        else {\n\n          if (k1 < n1)\n            cosp(k1++ * 3 + 2);\n\n          else\n            cosp(k2++ * 3 + 3);\n        }\n      }\n\n    }\n\n    else {\n\n      rep1(i, N) {\n\n        if (D[i] == 0) {\n\n          cosp(k2++ * 3 + 3);\n\n        }\n\n        else {\n\n          if (k0 < n0)\n            cosp(k0++ * 3 + 1);\n\n          else if (k1 < n1)\n            cosp(k1++ * 3 + 2);\n\n          else\n            cosp(k2++ * 3 + 3);\n        }\n      }\n    }\n\n  }\n\n  else {\n\n    if (cnt[1] > N / 3) {\n\n      rep1(i, N) {\n\n        if (D[i] == 0) {\n\n          if (k0 < n0)\n            cosp(k0++ * 3 + 1);\n\n          else\n            cosp(k2++ * 3 + 3);\n\n        }\n\n        else {\n\n          if (k1 < n1)\n            cosp(k1++ * 3 + 2);\n\n          else\n            cosp(k2++ * 3 + 3);\n        }\n      }\n\n    }\n\n    else {\n\n      rep1(i, N) {\n\n        if (D[i] == 1) {\n\n          cosp(k2++ * 3 + 3);\n\n        }\n\n        else {\n\n          if (k0 < n0)\n            cosp(k0++ * 3 + 1);\n\n          else if (k1 < n1)\n            cosp(k1++ * 3 + 2);\n\n          else\n            cosp(k2++ * 3 + 3);\n        }\n      }\n    }\n  }\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn;\n\ninline void putint(int X) {\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = ' ';\n}\n\nint N;\n\nint E[400001], ne[400001], he[200001], cnt[2];\n\nbool D[200001], d;\n\nvoid dfs(int p, int prev) {\n\n  D[p] = d;\n\n  cnt[d]++;\n\n  d = !d;\n\n  for (int i = he[p]; i; i = ne[i]) {\n\n    int to = E[i];\n\n    if (to != prev) {\n\n      dfs(to, p);\n    }\n  }\n\n  d = !d;\n}\n\nint main() {\n\n  N = getint();\n\n  int k = 1;\n\n  rep(i, N - 1) {\n\n    int a = getint(), b = getint();\n\n    E[k] = b;\n\n    ne[k] = he[a];\n\n    he[a] = k++;\n\n    E[k] = a;\n\n    ne[k] = he[b];\n\n    he[b] = k++;\n  }\n\n  dfs(1, 0);\n\n  int k0 = 0, k1 = 0, k2 = 0;\n\n  int n0 = (N + 2) / 3;\n\n  int n1 = (N + 1) / 3;\n\n  int n2 = N / 3;\n\n  if (cnt[0] < cnt[1]) {\n\n    if (cnt[0] > N / 3) {\n\n      rep1(i, N) {\n\n        if (D[i] == 0) {\n\n          if (k0 < n0)\n            putint(k0++ * 3 + 1);\n\n          else\n            putint(k2++ * 3 + 3);\n\n        }\n\n        else {\n\n          if (k1 < n1)\n            putint(k1++ * 3 + 2);\n\n          else\n            putint(k2++ * 3 + 3);\n        }\n      }\n\n    }\n\n    else {\n\n      rep1(i, N) {\n\n        if (D[i] == 0) {\n\n          putint(k2++ * 3 + 3);\n\n        }\n\n        else {\n\n          if (k0 < n0)\n            putint(k0++ * 3 + 1);\n\n          else if (k1 < n1)\n            putint(k1++ * 3 + 2);\n\n          else\n            putint(k2++ * 3 + 3);\n        }\n      }\n    }\n\n  }\n\n  else {\n\n    if (cnt[1] > N / 3) {\n\n      rep1(i, N) {\n\n        if (D[i] == 0) {\n\n          if (k0 < n0)\n            putint(k0++ * 3 + 1);\n\n          else\n            putint(k2++ * 3 + 3);\n\n        }\n\n        else {\n\n          if (k1 < n1)\n            putint(k1++ * 3 + 2);\n\n          else\n            putint(k2++ * 3 + 3);\n        }\n      }\n\n    }\n\n    else {\n\n      rep1(i, N) {\n\n        if (D[i] == 1) {\n\n          putint(k2++ * 3 + 3);\n\n        }\n\n        else {\n\n          if (k0 < n0)\n            putint(k0++ * 3 + 1);\n\n          else if (k1 < n1)\n            putint(k1++ * 3 + 2);\n\n          else\n            putint(k2++ * 3 + 3);\n        }\n      }\n    }\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"2f2afc0303187c3ab940f6c4382170d1333c7c962b2f0f66efc9dc2009d11551","fast_id":"f28aab3c6ee10d5f74a06fce228fda854ff82f80de9a6beaad598fc81dcb7fe4","fast_time":0.0162294381,"language":"cpp","measured_fast_code_id":"f28aab3c6ee10d5f74a06fce228fda854ff82f80de9a6beaad598fc81dcb7fe4","measured_slow_code_id":"0493b0680d59201f4c37aea154b97a5b2e49034430b366cbc709c9be1b499ebf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4670","problem_id":"p04049","slow_code_id":"134fd3aa322c8a9c1fbe9375bb2c7880090adcc8afb9ec77bd5938e72e104c09","slow_id":"0493b0680d59201f4c37aea154b97a5b2e49034430b366cbc709c9be1b499ebf","slow_time":0.3024422415,"speedup":18.635410519850343,"stratum":"8+","sampling_key":"2a3f8cff0c5107bda64a19d87affe5babf595989d0825b4d535d1ecfce2a3e3e","slow_code":"#include <bits/stdc++.h>\n\n#define debug puts(\"&&&&&&\")\n\n#define read(x) scanf(\"%d\", &x)\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int maxn = 1e5 + 5;\n\nconst int mod = 1e9 + 7;\n\nint n, k;\n\nint u[maxn], v[maxn];\n\nLL next[maxn], cnt, temp;\n\nLL cnt1;\n\nvector<int> ma[maxn];\n\nvoid dfs(int f, int t, int deep) {\n\n  cnt1++;\n\n  if (deep == 0) {\n\n    return;\n  }\n\n  for (int i = 0; i < ma[f].size(); i++) {\n\n    if (ma[f][i] != t) {\n\n      dfs(ma[f][i], f, deep - 1);\n    }\n  }\n}\n\nint main() {\n\n  while (read(n) != EOF) {\n\n    read(k);\n\n    for (int i = 0; i <= n; i++) {\n\n      ma[i].clear();\n    }\n\n    cnt = 0;\n\n    temp = 0;\n\n    LL ans = 0;\n\n    for (int i = 1; i <= n - 1; i++) {\n\n      read(u[i]);\n\n      read(v[i]);\n\n      ma[u[i]].push_back(v[i]);\n\n      ma[v[i]].push_back(u[i]);\n    }\n\n    if (k % 2 == 1) {\n\n      for (int i = 1; i <= n - 1; i++) {\n\n        cnt = 0;\n\n        cnt1 = 0;\n\n        dfs(u[i], v[i], k / 2);\n\n        dfs(v[i], u[i], k / 2);\n\n        cnt += cnt1;\n\n        ans = max(ans, cnt);\n      }\n\n    }\n\n    else {\n\n      for (int i = 1; i <= n; i++) {\n\n        cnt = 0;\n\n        cnt1 = 0;\n\n        dfs(i, 0, k / 2);\n\n        cnt += cnt1;\n\n        ans = max(ans, cnt);\n      }\n    }\n\n    printf(\"%d\\n\", n - ans);\n  }\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\n#define MAXN 2010\n\nint n, k, u[MAXN], v[MAXN];\n\nint Adj[MAXN], V[MAXN * 2], nxt[MAXN * 2], c;\n\nvoid AddEdge(int u, int v)\n\n{\n\n  c++;\n  V[c] = v, nxt[c] = Adj[u];\n  Adj[u] = c;\n}\n\nint dep[MAXN];\n\nvoid dfs(int u, int p)\n\n{\n\n  for (int i = Adj[u]; i; i = nxt[i])\n\n    if (V[i] != p)\n\n    {\n\n      dep[V[i]] = dep[u] + 1;\n\n      dfs(V[i], u);\n    }\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &k);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    scanf(\"%d%d\", &u[i], &v[i]);\n\n    AddEdge(u[i], v[i]);\n\n    AddEdge(v[i], u[i]);\n  }\n\n  int ans = n;\n\n  if (k & 1)\n\n  {\n\n    for (int i = 1; i < n; i++)\n\n    {\n\n      dep[u[i]] = dep[v[i]] = 0;\n\n      dfs(u[i], v[i]);\n\n      dfs(v[i], u[i]);\n\n      int tmp = 0;\n\n      for (int j = 1; j <= n; j++)\n        if (dep[j] > k / 2)\n          tmp++;\n\n      ans = min(ans, tmp);\n    }\n\n  }\n\n  else\n\n  {\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      dep[i] = 0;\n\n      dfs(i, 0);\n\n      int tmp = 0;\n\n      for (int j = 1; j <= n; j++)\n        if (dep[j] > k / 2)\n          tmp++;\n\n      ans = min(ans, tmp);\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n}"}
{"fast_code_id":"5540aea2adf0a7828346445a5a0f836b4ea5666fa4f395456ea6d15c1969949b","fast_id":"7fa29865fb4d6e8e1e8b9e5dd2a6fff5e58426beecb3e31bc2a21232d0938591","fast_time":0.1402157746,"language":"cpp","measured_fast_code_id":"7fa29865fb4d6e8e1e8b9e5dd2a6fff5e58426beecb3e31bc2a21232d0938591","measured_slow_code_id":"c2f2033d6dde3986c93b4666ab55c984582ed767eb260fcb24463886dfa4f739","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46700","problem_id":"p03049","slow_code_id":"5a60e8491ee78b4e47f7bb1d4cd207f0f60fea08511ae7140233f99e1fcaea2d","slow_id":"c2f2033d6dde3986c93b4666ab55c984582ed767eb260fcb24463886dfa4f739","slow_time":0.4601480744,"speedup":3.281714027631239,"stratum":"2-4","sampling_key":"0279f7dee31e8ea5752996c593e5c24a0f9e648a1f237e5fccb0f2f7894e515d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 100100;\n\nstring s[N];\n\nint main()\n\n{\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  ll n;\n\n  cin >> n;\n\n  int t;\n\n  ll res;\n\n  map<char, ll> m;\n\n  map<char, ll> p;\n\n  int flag = 0;\n\n  for (ll i = 0; i < n; i++)\n\n  {\n\n    cin >> s[i];\n\n    m[s[i][0]]++;\n\n    p[s[i][s[i].size() - 1]]++;\n\n    if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')\n\n      flag++;\n  }\n\n  ll a = m['B'], b = p['A'];\n\n  ll c = a - flag, d = b - flag;\n\n  ll ans = 0;\n\n  for (ll i = 0; i < n; i++)\n\n  {\n\n    t = s[i].size();\n\n    for (ll j = 0; j < t; j++)\n\n    {\n\n      if (s[i][j + 1] == 'B' && s[i][j] == 'A')\n\n        ans++;\n    }\n  }\n\n  res = min(b, a);\n\n  ans += res;\n\n  if (c == 0 && d == 0 && flag != 0)\n    ans--;\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <stdio.h>\n\n#include <algorithm>\n\n#include <string>\n\n#define ios ios::sync_with_stdio(false)\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 1e4 + 100;\n\nstring a[maxn];\n\nint main()\n\n{\n\n  ios;\n\n  int n, A = 0, B = 0, AB = 0;\n  cin >> n;\n\n  ll sum = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n\n    int len = a[i].size() - 1;\n\n    for (int j = 1; j <= len; j++) {\n\n      if (a[i][j] == 'B' && a[i][j - 1] == 'A')\n        sum++;\n    }\n\n    if (a[i][0] == 'B' && a[i][len] == 'A') {\n\n      AB++;\n      continue;\n    }\n\n    if (a[i][0] == 'B') {\n\n      B++;\n      continue;\n    }\n\n    if (a[i][len] == 'A') {\n\n      A++;\n      continue;\n    }\n  }\n\n  ll ans = 0;\n\n  if (AB > 0) {\n\n    if (A > 0 || B > 0) {\n\n      A -= 1;\n      B -= 1;\n\n      ans += 2;\n      AB -= 1;\n\n    }\n\n    else\n      AB -= 1;\n  }\n\n  ans += min(A, B) + AB + sum;\n\n  cout << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"af4e99403384a0033f654a6efb598bcb206e422f04ef852413b629ec8b62d110","fast_id":"d552c2d899882524d20cff8e6f2bca0f36e5e086e8d88379f40768d632d97d62","fast_time":0.0151921115,"language":"cpp","measured_fast_code_id":"d552c2d899882524d20cff8e6f2bca0f36e5e086e8d88379f40768d632d97d62","measured_slow_code_id":"d30afa503389de9436efb93f4f414707081df0586fec386573fca5994fea5547","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46717","problem_id":"p03686","slow_code_id":"e54da6fd6fb5dd4d40c36ee1c13b3ae52f70feb3f180af9bdee5c721bc748d4a","slow_id":"d30afa503389de9436efb93f4f414707081df0586fec386573fca5994fea5547","slow_time":0.5186902807,"speedup":34.14207963784363,"stratum":"8+","sampling_key":"cae13833c8b2621065d476c8c30caa40639f373859a3599a204a35495e7027b7","slow_code":"#include <bits/stdc++.h>\n\n#define ll(x) (x << 1)\n\n#define rr(x) (x << 1 | 1)\n\nusing namespace std;\n\nconst int N = 2e5 + 5;\n\nconst int inf = 0x3f3f3f3f;\n\nint n, m, ans = 0;\n\nvector<int> a[N];\n\nstruct SegmentTree {\n  int l, r, mx, tag;\n} t[N * 4];\n\nvoid up(int x) { t[x].mx = max(t[ll(x)].mx, t[rr(x)].mx); }\n\nvoid build(int l, int r, int x = 1) {\n\n  t[x].l = l, t[x].r = r;\n  int mid = (l + r >> 1);\n\n  if (l == r) {\n    t[x].mx = -m + r - 1;\n    return;\n  }\n\n  build(l, mid, ll(x)), build(mid + 1, r, rr(x)), up(x);\n}\n\nvoid pushdown(int x) {\n\n  if (!t[x].tag)\n    return;\n\n  t[ll(x)].tag += t[x].tag, t[ll(x)].mx += t[x].tag;\n\n  t[rr(x)].tag += t[x].tag, t[rr(x)].mx += t[x].tag;\n\n  t[x].tag = 0;\n}\n\nvoid update(int l, int r, int val, int x = 1) {\n\n  if (l <= t[x].l && t[x].r <= r) {\n\n    t[x].tag += val, t[x].mx += val;\n    return;\n  }\n\n  int mid = (t[x].l + t[x].r >> 1);\n  pushdown(x);\n\n  if (l <= mid)\n    update(l, r, val, ll(x));\n\n  if (mid < r)\n    update(l, r, val, rr(x));\n  up(x);\n}\n\nint query(int l, int r, int x = 1) {\n\n  if (l <= t[x].l && t[x].r <= r)\n    return t[x].mx;\n\n  if (r < t[x].l || t[x].r < l)\n    return -inf;\n\n  pushdown(x);\n\n  return max(query(l, r, ll(x)), query(l, r, rr(x)));\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  int x, y;\n  cin >> n >> m, ans = max(ans, n - m);\n\n  for (int i = 1; i <= n; i++)\n    cin >> x >> y, a[x].push_back(y);\n\n  build(0, m + 1);\n\n  for (int i = 0; i <= m - 1; i++) {\n\n    for (int j = 0; j < a[i].size(); j++)\n      update(1, a[i][j], 1);\n\n    ans = max(ans, query(i + 2, m + 1) - i);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define N 200005\n\n#define M 200005\n\n#define mid ((l + r) / 2)\n\n#define ls 2 * rt\n\n#define rs 2 * rt + 1\n\nint head[M];\n\nint cnt;\n\nstruct edge {\n  int des, next;\n} e[N];\n\nvoid ins(int u, int v) {\n  e[++cnt].des = v;\n  e[cnt].next = head[u];\n  head[u] = cnt;\n}\n\nint n, m;\n\nstruct node {\n\n  int l, r;\n\n} a[N];\n\nbool cmp(node a, node b) { return a.l < b.l; }\n\nint maxn[M << 2], lazy[M << 2];\n\nvoid pushup(int rt) { maxn[rt] = max(maxn[ls], maxn[rs]); }\n\nvoid build(int rt, int l, int r) {\n\n  if (l == r) {\n    maxn[rt] = l;\n    return;\n  }\n\n  build(ls, l, mid);\n\n  build(rs, mid + 1, r);\n\n  pushup(rt);\n}\n\nvoid pushdown(int rt) {\n\n  int t = lazy[rt];\n  lazy[rt] = 0;\n\n  lazy[ls] += t;\n  lazy[rs] += t;\n\n  maxn[ls] += t;\n  maxn[rs] += t;\n}\n\nvoid update(int rt, int l, int r, int ll, int rr) {\n\n  if (l >= ll && r <= rr) {\n\n    maxn[rt] += 1;\n\n    lazy[rt] += 1;\n\n    return;\n  }\n\n  if (lazy[rt])\n    pushdown(rt);\n\n  if (ll <= mid)\n    update(ls, l, mid, ll, rr);\n\n  if (rr >= mid + 1)\n    update(rs, mid + 1, r, ll, rr);\n\n  pushup(rt);\n}\n\nint query(int rt, int l, int r, int ll, int rr) {\n\n  if (l >= ll && r <= rr)\n    return maxn[rt];\n\n  int res = 0;\n\n  if (lazy[rt])\n    pushdown(rt);\n\n  if (ll <= mid)\n    res = max(res, query(ls, l, mid, ll, rr));\n\n  if (rr >= mid + 1)\n    res = max(res, query(rs, mid + 1, r, ll, rr));\n\n  return res;\n}\n\nint main() {\n\n  int ans = 0;\n\n  scanf(\"%d %d\", &n, &m);\n\n  for (int i = 1; i <= n; ++i) {\n\n    scanf(\"%d %d\", &a[i].l, &a[i].r);\n\n    ins(a[i].l, a[i].r);\n  }\n\n  sort(a + 1, a + 1 + n, cmp);\n\n  build(1, 0, m + 1);\n\n  for (int i = 0; i <= m; ++i) {\n\n    for (int j = head[i]; j; j = e[j].next) {\n\n      int r = e[j].des;\n\n      update(1, 0, m + 1, 1, r);\n    }\n\n    ans = max(ans, query(1, 0, m + 1, i + 1, m + 1) - (m + i + 1));\n  }\n\n  ans = max(ans, n - m);\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"0928e992472cb4159d1587c10f104e7a1a74767206c004ac754535787df695c7","fast_id":"5af9637e766aebef23f4302becac7b2a02de5091ccc1af3084cbf021595110db","fast_time":0.001024982,"language":"cpp","measured_fast_code_id":"5af9637e766aebef23f4302becac7b2a02de5091ccc1af3084cbf021595110db","measured_slow_code_id":"cdb4e188dd5090fbabcadd997396380f809a7d8e4c95daa6a9289a4b8574f906","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46758","problem_id":"p03560","slow_code_id":"eaf51b41f9e6753fbc8f51ce16257290679f9c1e6a6e692be33cb4f5df57490e","slow_id":"cdb4e188dd5090fbabcadd997396380f809a7d8e4c95daa6a9289a4b8574f906","slow_time":0.0106717971,"speedup":10.411692205326533,"stratum":"8+","sampling_key":"328e68da06fac1f0b0151efcabad8078a2630c9af83e6598ab90a70c2847ac56","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int MAXN = 1000005;\n\nstruct node\n\n{\n\n  int from, to, w;\n\n} G[MAXN];\n\nint dist[MAXN];\n\nint head[MAXN];\n\nbool vis[MAXN];\n\nint cnt;\n\nvoid add(int u, int v, int w)\n\n{\n\n  G[cnt].to = v;\n\n  G[cnt].w = w;\n\n  G[cnt].from = head[u];\n\n  head[u] = cnt++;\n}\n\nvoid spfa(int s)\n\n{\n\n  memset(vis, false, sizeof(vis));\n\n  queue<int> q;\n\n  while (!q.empty())\n\n    q.pop();\n\n  vis[1] = true;\n\n  q.push(s);\n\n  dist[s] = 0;\n\n  while (!q.empty())\n\n  {\n\n    int u = q.front();\n\n    q.pop();\n\n    vis[u] = false;\n\n    for (int i = head[u]; ~i; i = G[i].from)\n\n    {\n\n      int v = G[i].to;\n\n      if (dist[v] > dist[u] + G[i].w)\n\n      {\n\n        dist[v] = dist[u] + G[i].w;\n\n        if (!vis[v])\n\n        {\n\n          vis[v] = true;\n\n          q.push(v);\n        }\n      }\n    }\n  }\n}\n\nint main()\n\n{\n\n  int k;\n\n  scanf(\"%d\", &k);\n\n  memset(head, -1, sizeof(head));\n\n  memset(dist, 0x3f, sizeof(dist));\n\n  cnt = 0;\n\n  for (int i = 0; i < k; ++i)\n\n  {\n\n    add(i, (i + 1) % k, 1);\n\n    add(i, i * 10 % k, 0);\n  }\n\n  spfa(1);\n\n  printf(\"%d\\n\", dist[0] + 1);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <queue>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int MAXN = 100005;\n\nconst LL inf = 0x3f3f3f3f;\n\nint main(void) {\n\n  int k, v, u;\n\n  cin >> k;\n\n  vector<int> dp(k, 46);\n\n  dp[1] = 1;\n\n  deque<int> deq = {1};\n\n  while (v = deq.front()) {\n\n    deq.pop_front();\n\n    u = (v * 10) % k;\n\n    if (dp[u] > dp[v]) {\n\n      dp[u] = dp[v];\n\n      deq.push_front(u);\n    }\n\n    u = (v + 1) % k;\n\n    if (dp[u] > dp[v] + 1) {\n\n      dp[u] = dp[v] + 1;\n\n      deq.push_back(u);\n    }\n  }\n\n  cout << dp[v] << endl;\n}\n"}
{"fast_code_id":"5dfef9ef1263716e4a0436bc808a80a5b81e4a84c55921dcd8a5c8e8c73ea862","fast_id":"1612d68ff5179a20f0902d7b0dae771053c9dd4521b33426ea2f43f1c13a80d2","fast_time":0.0001924766,"language":"cpp","measured_fast_code_id":"1612d68ff5179a20f0902d7b0dae771053c9dd4521b33426ea2f43f1c13a80d2","measured_slow_code_id":"361bc04844cfa23418f2793c2076dba688ffdf931026030ded0d69f52e6c9ad1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46777","problem_id":"p03482","slow_code_id":"ca7044842b0579df60d5d2d92c54af03e397e9f46ec6b57422144671706808c5","slow_id":"361bc04844cfa23418f2793c2076dba688ffdf931026030ded0d69f52e6c9ad1","slow_time":0.0010043534,"speedup":5.218054558320336,"stratum":"4-8","sampling_key":"75fe87a0aaff3fee60ccbc0d42a77a6ddbfe22d894ecdcd782ef999858724b62","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <set>\n\n#include <cstdlib>\n\n#include <vector>\n\n#include <map>\n\n#include <cstring>\n\nusing namespace std;\n\nconst int maxn = 2e6 + 100;\n\nconst long long mod = 1e12 + 7;\n\nlong long ans, l1, l2, len1, len2, ty, z, n, m, k, t, x, y;\n\nset<long long> s;\nchar c[maxn];\nbool le;\nchar tt;\n\nlong long h[maxn];\n\nint main()\n\n{\n\n  scanf(\"%s\", c);\n\n  k = strlen(c);\n\n  ans = k;\n\n  for (long long i = 1; i < k; ++i)\n\n  {\n\n    if (c[i] != c[i - 1])\n\n      ans = min(ans, max(i, k - i));\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\nint max(int x, int y)\n\n{\n\n  return x > y ? x : y;\n}\n\nint min(int x, int y)\n\n{\n\n  return x < y ? x : y;\n}\n\nint main()\n\n{\n\n  char ch[100010];\n\n  while (scanf(\"%s\", ch) != EOF)\n\n  {\n\n    int len = strlen(ch);\n\n    int ans = len;\n\n    for (int i = 1; i <= len - 1; i++)\n\n    {\n\n      if (ch[i] != ch[i - 1])\n\n        ans = min(ans, max(i, len - i));\n    }\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"44ee86c744cb7afd7757f3e0dea44b7db6da76d6b6ff169491ca7ab3cde38434","fast_id":"81253614f97de164c55edd14e22c71bf2b2fd88891f554ea3c982e3b7914bfeb","fast_time":0.0323102505,"language":"cpp","measured_fast_code_id":"81253614f97de164c55edd14e22c71bf2b2fd88891f554ea3c982e3b7914bfeb","measured_slow_code_id":"ca7bd5c880886b0f1aeb06fd5c7ef877eb000e37d5ae2ea6ab0f1ab7c3c21ccf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46780","problem_id":"p03727","slow_code_id":"021a8d60afe7e069c0e9debe90c9b01faaba11f61b47ecb96ef6de0bda842cdb","slow_id":"ca7bd5c880886b0f1aeb06fd5c7ef877eb000e37d5ae2ea6ab0f1ab7c3c21ccf","slow_time":0.3881237206,"speedup":12.012402088928404,"stratum":"8+","sampling_key":"58ea3a6eba282157e3aeff2aa5241acffa3299bdc051e22f01d51a7709ad86e1","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAXN = 100005;\n\nint N;\n\nset<int> E[MAXN];\n\nmap<int, int> cnt[MAXN];\n\nqueue<pair<int, int>> Q;\n\nint fa[MAXN];\n\nint Root(int x)\n\n{\n  return fa[x] == 0 ? x : (fa[x] = Root(fa[x]));\n}\n\nvoid Link(int u, int v)\n\n{\n\n  E[u].insert(v);\n\n  E[v].insert(u);\n\n  if (u > v)\n\n    swap(u, v);\n\n  cnt[u][v]++;\n\n  if (cnt[u][v] > 2)\n\n  {\n\n    puts(\"NO\");\n\n    exit(0);\n  }\n\n  if (cnt[u][v] == 2)\n\n    Q.emplace(u, v);\n}\n\nvoid Cut(int u, int v)\n\n{\n\n  E[u].erase(v);\n\n  if (u > v)\n\n    swap(u, v);\n\n  cnt[u].erase(v);\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &N);\n\n  for (int i = 1; i <= 2 * N - 2; i++)\n\n  {\n\n    int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    Link(u, v);\n  }\n\n  for (int i = 1; i < N; i++)\n\n  {\n\n    int u, v;\n\n    do\n\n    {\n\n      if (Q.empty())\n\n      {\n\n        puts(\"NO\");\n\n        return 0;\n      }\n\n      u = Root(Q.front().first), v = Root(Q.front().second);\n\n      Q.pop();\n\n    } while (u == v);\n\n    if (E[u].size() < E[v].size())\n\n      swap(u, v);\n\n    fa[v] = u;\n\n    Cut(u, v);\n\n    for (auto e : E[v])\n\n    {\n\n      int t = Root(e);\n\n      if (t == u)\n\n        continue;\n\n      Link(t, u);\n\n      Cut(t, v);\n    }\n  }\n\n  puts(\"YES\");\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rg register\n\ntemplate <typename _Tp> inline _Tp read(_Tp &x) {\n\n  char c11 = getchar();\n  x = 0;\n  while (!isdigit(c11))\n    c11 = getchar();\n\n  while (isdigit(c11))\n    x = x * 10 + c11 - '0', c11 = getchar();\n  return x;\n}\n\nconst int N = 101000, ae = 20;\n\nstruct Edge {\n  int v, nxt;\n} a[N * ae * 2];\n\nint qx[N * ae], qy[N * ae], dad[N];\n\nint head[N], _, sz[N];\n\nint n, he = 1, ta = 0;\n\ninline int find(int x) { return dad[x] ? dad[x] = find(dad[x]) : x; }\n\ninline void ins(int u, int v) { ++sz[u], a[++_].v = v, a[_].nxt = head[u], head[u] = _; }\n\nmap<ll, int> cnt;\n\n#define h(x, y) (x + 1ll * n * y)\n\ninline void add(int x, int y) {\n\n  if (x > y)\n    swap(x, y);\n\n  ins(x, y), ins(y, x);\n\n  if ((++cnt[h(x, y)]) == 2)\n\n    ++ta, qx[ta] = x, qy[ta] = y;\n}\n\nint main() {\n\n  read(n);\n  int x, y, p;\n\n  for (rg int i = n - 2 + n; i; --i)\n    read(x), read(y), add(x, y);\n\n  for (rg int i = 1; i < n; ++i) {\n\n    do\n      x = qx[he], y = qy[he], ++he;\n\n    while (find(x) == find(y) && he <= ta);\n\n    x = find(x), y = find(y);\n\n    if (x == y) {\n      puts(\"NO\");\n      return 0;\n    }\n\n    if (sz[x] > sz[y])\n      swap(x, y);\n\n    --sz[y];\n    cnt.erase(x < y ? h(x, y) : h(y, x));\n\n    for (rg int j = head[x]; j; j = a[j].nxt) {\n\n      p = find(a[j].v);\n\n      if (p ^ y)\n        if (p != find(x))\n          add(p, y);\n    }\n\n    dad[x] = y;\n  }\n  puts(\"YES\");\n}"}
{"fast_code_id":"e803c7cea501290183836b41cdd32bc1c7b7e9110fb2f883083fee0c1d01c9db","fast_id":"5787cde04ec4b52bb6d54255550280e13484d2bfc6192001cf47495e5b594724","fast_time":0.0199337776,"language":"cpp","measured_fast_code_id":"5787cde04ec4b52bb6d54255550280e13484d2bfc6192001cf47495e5b594724","measured_slow_code_id":"d9aaacefe571ff3ada09065925b90d7ea8beb4473cbca298b1cffbf84e76d1d4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46793","problem_id":"p00344","slow_code_id":"f5663ac51513f27476f3274e6e6f4c8625394d7dea2dcfc8e92db9a11bc10b6d","slow_id":"d9aaacefe571ff3ada09065925b90d7ea8beb4473cbca298b1cffbf84e76d1d4","slow_time":0.191512903,"speedup":9.60745659166981,"stratum":"8+","sampling_key":"d7f02f92dcf21c6186c90f578549f9f907005200f04ec43a69b1e574dbe1f6f8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n;\n\nint a[100005];\n\nint x[100005];\n\nint y[100005];\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n  }\n\n  memset(x, -1, sizeof(x));\n\n  memset(y, -1, sizeof(y));\n\n  int ans = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    int p = i, c = 0;\n\n    while (x[p] == -1) {\n\n      x[p] = c++;\n\n      y[p] = i;\n\n      p = (p + a[p]) % n;\n    }\n\n    if (y[p] == i)\n      ans += (c - x[p]);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint n, i, p, c, ans = 0;\n\nint a[100000];\n\nint x[100000];\n\nint y[100000];\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++) {\n\n    scanf(\"%d\", &a[i]);\n\n    x[i] = -1;\n\n    y[i] = -1;\n  }\n\n  for (i = 0; i < n; i++) {\n\n    p = i;\n\n    c = 0;\n\n    while (x[p] == -1) {\n\n      x[p] = c++;\n\n      y[p] = i;\n\n      p = (p + a[p]) % n;\n    }\n\n    if (y[p] == i)\n      ans += (c - x[p]);\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"fbeed9a6d4aa65f3f45c268fe3f6f4d673c5888d279cde1c23bda932911fcab9","fast_id":"a33bce8d7edd3b79cdade45dbc5e9a91f5cd9c1047efbdf94e083aa17d669052","fast_time":0.1067037011,"language":"cpp","measured_fast_code_id":"a33bce8d7edd3b79cdade45dbc5e9a91f5cd9c1047efbdf94e083aa17d669052","measured_slow_code_id":"9d7d28c5cfd890dc9584be69e1695a7b7f159b7553f794de488f04992d68f368","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46915","problem_id":"p04006","slow_code_id":"708defcb2f01847caeea7e61094c2874f53440715a93b414548cce41ed7a1bce","slow_id":"9d7d28c5cfd890dc9584be69e1695a7b7f159b7553f794de488f04992d68f368","slow_time":0.3319804382,"speedup":3.1112363936549525,"stratum":"2-4","sampling_key":"3c871080c285b35483bc0303d7e50c857f305f7f09211e4f1af64b987af9450d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> pll;\n\nll mod = 1e9 + 7;\n\nconst ll max_n = 1 << 18;\n\nconst ll init_m = 1e18;\n\nll leaf_n;\n\nvector<ll> dat(max_n);\n\nvoid init(ll n) {\n\n  leaf_n = 1;\n\n  while (leaf_n < n)\n    leaf_n *= 2;\n\n  for (ll i = 0; i < 2 * leaf_n - 1; i++)\n    dat[i] = init_m;\n}\n\nvoid update(ll k, ll a) {\n\n  k += leaf_n - 1;\n\n  dat[k] = a;\n\n  while (k > 0) {\n\n    k = (k - 1) / 2;\n\n    dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);\n  }\n}\n\nll find(ll a, ll b, ll k, ll l, ll r) {\n\n  if (r <= a || b <= l)\n    return init_m;\n\n  if (a <= l && r <= b)\n    return dat[k];\n\n  else {\n\n    ll vl = find(a, b, k * 2 + 1, l, (l + r) / 2);\n\n    ll vr = find(a, b, k * 2 + 2, (l + r) / 2, r);\n\n    return min(vl, vr);\n  }\n}\n\nint main() {\n\n  ll n, x;\n\n  cin >> n >> x;\n\n  init(n);\n\n  for (ll i = 0; i < n; i++) {\n\n    ll a;\n\n    cin >> a;\n\n    update(i, a);\n  }\n\n  ll ans = 1e18;\n\n  for (ll i = 0; i < n; i++) {\n\n    ll tans = x * i;\n\n    for (ll j = 0; j < n; j++) {\n\n      ll f = j - i;\n\n      if (f < 0) {\n\n        f += n;\n\n        tans += min(find(f, n, 0, 0, leaf_n), find(0, j + 1, 0, 0, leaf_n));\n\n      }\n\n      else {\n\n        tans += find(f, j + 1, 0, 0, leaf_n);\n      }\n    }\n\n    ans = min(ans, tans);\n  }\n\n  cout << ans << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<ll> vec;\n\ntypedef vector<vec> mat;\n\ntypedef pair<ll, ll> pll;\n\nconst ll mod = 1e9 + 7;\n\nconst ll inf = 1LL << 61;\n\nint main() {\n\n  ll n, x;\n\n  cin >> n >> x;\n\n  vec a(n);\n\n  for (ll i = 0; i < n; i++)\n    cin >> a[i];\n\n  vec b(n, inf);\n\n  ll ans = inf;\n\n  for (ll i = 0; i < n; i++) {\n\n    ll tans = 0;\n\n    for (ll j = 0; j < n; j++) {\n\n      b[j] = min(b[j], a[(j - i + n) % n]);\n\n      tans += b[j];\n    }\n\n    tans += i * x;\n\n    ans = min(ans, tans);\n  }\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"55aaea3ad94fd3d914c244b87f833915634c882948c07acb5661bf9a42d914d4","fast_id":"002eaf31353458d2b42bb0f042342445c53dda9eef35c1a4b6dcdf837a4a2492","fast_time":0.0978058075,"language":"cpp","measured_fast_code_id":"002eaf31353458d2b42bb0f042342445c53dda9eef35c1a4b6dcdf837a4a2492","measured_slow_code_id":"41ee3aea5fe4de3e5c98d2b8097f7bd379a0cd9124c826f878fcc1af086f2392","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_46927","problem_id":"p01140","slow_code_id":"5c74724f88f873c27626e3acf897eda94717e12e73898710fba3263303302cc5","slow_id":"41ee3aea5fe4de3e5c98d2b8097f7bd379a0cd9124c826f878fcc1af086f2392","slow_time":1.3381602228,"speedup":13.681807420280233,"stratum":"8+","sampling_key":"37d9aaec1b5142c9beac1f0f8a4c0e249e006d6751de86ca9408b26ddb12cfb9","slow_code":"#include <stdio.h>\n\nint main() {\n\n  int h[1501], w[1501];\n\n  int n, m, i, j;\n\n  while (scanf(\"%d%d\", &n, &m) && (n | m)) {\n\n    int dat[1500001] = {};\n\n    n++, m++;\n\n    h[0] = w[0] = 0;\n\n    for (i = 1; i < n; i++) {\n      scanf(\"%d\", &h[i]);\n      h[i] += h[i - 1];\n    }\n\n    for (i = 1; i < m; i++) {\n      scanf(\"%d\", &w[i]);\n      w[i] += w[i - 1];\n    }\n\n    for (i = 0; i < m - 1; i++)\n\n      for (j = i + 1; j < m; j++)\n\n        dat[w[j] - w[i]]++;\n\n    int cnt = 0;\n\n    for (i = 0; i < n - 1; i++)\n\n      for (j = i + 1; j < n; j++)\n\n        cnt += dat[h[j] - h[i]];\n\n    printf(\"%d\\n\", cnt);\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <vector>\n\nint main() {\n\n  int h[1501], w[1501];\n\n  int n, m, i, j;\n\n  while (scanf(\"%d%d\", &n, &m) && (n | m)) {\n\n    std::vector<int> dat(std::max(n, m) * 1500 + 1, 0);\n\n    n++, m++;\n\n    h[0] = w[0] = 0;\n\n    for (i = 1; i < n; i++) {\n      scanf(\"%d\", &h[i]);\n      h[i] += h[i - 1];\n    }\n\n    for (i = 1; i < m; i++) {\n      scanf(\"%d\", &w[i]);\n      w[i] += w[i - 1];\n    }\n\n    for (i = 0; i < m - 1; i++)\n\n      for (j = i + 1; j < m; j++)\n\n        dat[w[j] - w[i]]++;\n\n    int cnt = 0;\n\n    for (i = 0; i < n - 1; i++)\n\n      for (j = i + 1; j < n; j++)\n\n        cnt += dat[h[j] - h[i]];\n\n    printf(\"%d\\n\", cnt);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"4a425616dd1200f1f7f305327d04a60826c4bc47f1187b6eb5d02d599bb8b636","fast_id":"6d3374fc5b8456a14ba3fb3329fce2aa45aa263a9b6b7ac09bd9d17c80d05355","fast_time":0.1038819107,"language":"cpp","measured_fast_code_id":"6d3374fc5b8456a14ba3fb3329fce2aa45aa263a9b6b7ac09bd9d17c80d05355","measured_slow_code_id":"fa65ceef2ab75ddb9122c0690c303dd212fcf17c85cc0b5f666351c4446b630a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_47416","problem_id":"p04020","slow_code_id":"53bd81ddf3c6ffc037e62f02f9cd4cde47e9777356b86f54e8e62bde209e804a","slow_id":"fa65ceef2ab75ddb9122c0690c303dd212fcf17c85cc0b5f666351c4446b630a","slow_time":0.2756978504,"speedup":2.65395436551207,"stratum":"2-4","sampling_key":"49d6564f199b1e022a75fb9072f267d05e5bc2fe2f058b8ef548b37c998d6ca5","slow_code":"#include<bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int MAXN = 1e5+7;\n\n\n\nLL a[MAXN];\n\nLL dp[MAXN][2];\n\n\n\nLL solve(int now, int connected) {\n\n  if (now==0) {\n\n    assert(connected==0);\n\n    return 0;\n\n  }\n\n\n\n  if (dp[now][connected] != -1) return dp[now][connected];\n\n\n\n  LL has = a[now]-connected;\n\n  LL ans = solve(now-1, 0)+has/2;\n\n  if (has > 0 && a[now-1] > 0) {\n\n    LL tmp = 1 + solve(now-1, 1) + (has-1)/2;\n\n    ans = max(ans, tmp);\n\n  }\n\n  return dp[now][connected] = ans;\n\n}\n\n\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++) cin >> a[i];\n\n\n\n  memset(dp, -1, sizeof dp);\n\n  cout << solve(n, 0) << endl;\n\n\n\n\n\n  return 0;\n\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\nusing namespace std;\n\nll ara[100005];\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &ara[i]);\n\n  ll res = 0;\n\n  for (int i = n - 1; i > 0; i--)\n\n  {\n\n    int p1 = ara[i];\n\n    int p2 = ara[i - 1];\n\n    int x = min(ara[i - 1], ara[i]);\n    ;\n\n    res += x;\n\n    ara[i - 1] -= x;\n\n    ara[i] -= x;\n\n    res += (ara[i] / 2);\n\n    ara[i] -= ((ara[i] / 2) * 2);\n\n    if (ara[i] == 1 && ara[i] != p1 && ara[i - 1] != p2)\n      ara[i - 1]++;\n  }\n\n  res += (ara[0] / 2);\n\n  printf(\"%lld\\n\", res);\n\n  return 0;\n}\n"}
{"fast_code_id":"e4c122c1aea73bf6d1a487c484dd001b62876a019632cecd5eedd14f2fc7a68e","fast_id":"39f9a7e94ee96fa61c5bf724ec84de624bf7fe33d05185d82f94e1afe1b378da","fast_time":0.0408414844,"language":"cpp","measured_fast_code_id":"39f9a7e94ee96fa61c5bf724ec84de624bf7fe33d05185d82f94e1afe1b378da","measured_slow_code_id":"d19d1b23061ce1b2962cac9891f834303a8b113eeaa700b71170bcaff45679b4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_47418","problem_id":"p00643","slow_code_id":"541092b6f8067676b40f9ab3fe4fbeff721d49a53adb80c93908d683d1cb16d9","slow_id":"d19d1b23061ce1b2962cac9891f834303a8b113eeaa700b71170bcaff45679b4","slow_time":0.1999662751,"speedup":4.89615590710508,"stratum":"4-8","sampling_key":"eda8d0be8dc64fbac728613b5b9bc5176a20e81f68627feec78f9533a078d647","slow_code":"\n\n#include <vector>\n\n#include <list>\n\n#include <map>\n\n#include <set>\n\n#include <deque>\n\n#include <stack>\n\n#include <bitset>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <string.h>\n\n#include <queue>\n\nusing namespace std;\n\nint dp[16][16][8][8][8];\n\nint main() {\n\n  for (int h, w; scanf(\"%d%d\", &h, &w) && h;) {\n\n    int table[16][16];\n\n    int x, y;\n\n    for (y = 0; y < h; y++)\n\n      for (x = 0; x < w; x++)\n\n        scanf(\"%d\", &table[x][y]);\n\n    int startX, startY, goalX, goalY;\n\n    cin >> startY >> startX >> goalY >> goalX;\n\n    vector<int> node;\n\n    priority_queue<vector<int>, vector<vector<int > > , greater<vector<int > > > q;\n\n    {\n\n      node.push_back(0);\n\n      node.push_back(startX);\n\n      node.push_back(startY);\n\n      node.push_back(1);\n\n      node.push_back(2);\n\n      node.push_back(3);\n\n      q.push(node);\n    }\n\n    memset(dp, 100, sizeof(dp));\n\n    int oo = dp[0][0][0][0][0];\n\n    dp[startX][startY][1][2][3] = 0;\n\n    while (!q.empty()) {\n\n      const vector<int> node = q.top();\n\n      q.pop();\n\n      const int cost = node[0];\n\n      const int x = node[1];\n\n      const int y = node[2];\n\n      const int up = node[3];\n\n      const int south = node[4];\n\n      const int east = node[5];\n\n      if (dp[x][y][up][south][east] != cost) {\n\n        continue;\n      }\n\n      for (int dir = 0; dir < 4; ++dir) {\n\n        int nx, ny, nup, nsouth, neast, ncost;\n\n        switch (dir) {\n\n        case 0:\n\n          if (x + 1 == w) {\n\n            continue;\n          }\n\n          nx = x + 1;\n\n          ny = y;\n\n          nup = 7 - east;\n\n          nsouth = south;\n\n          neast = up;\n\n          break;\n\n        case 1:\n\n          if (x == 0) {\n\n            continue;\n          }\n\n          nx = x - 1;\n\n          ny = y;\n\n          nup = east;\n\n          nsouth = south;\n\n          neast = 7 - up;\n\n          break;\n\n        case 2:\n\n          if (y + 1 == h) {\n\n            continue;\n          }\n\n          nx = x;\n\n          ny = y + 1;\n\n          nup = 7 - south;\n\n          nsouth = up;\n\n          neast = east;\n\n          break;\n\n        case 3:\n\n          if (y == 0) {\n\n            continue;\n          }\n\n          nx = x;\n\n          ny = y - 1;\n\n          nup = south;\n\n          nsouth = 7 - up;\n\n          neast = east;\n\n          break;\n        }\n\n        ncost = cost + table[nx][ny] * (7 - nup);\n\n        if (dp[nx][ny][nup][nsouth][neast] <= ncost) {\n\n          continue;\n        }\n\n        dp[nx][ny][nup][nsouth][neast] = ncost;\n\n        vector<int> next;\n\n        next.push_back(ncost);\n\n        next.push_back(nx);\n\n        next.push_back(ny);\n\n        next.push_back(nup);\n\n        next.push_back(nsouth);\n\n        next.push_back(neast);\n\n        q.push(next);\n      }\n    }\n\n    int best = oo;\n\n    for (int i = 1; i <= 6; ++i) {\n\n      for (int j = 1; j <= 6; ++j) {\n\n        for (int k = 1; k <= 6; ++k) {\n\n          best = min(best, dp[goalX][goalY][i][j][k]);\n        }\n      }\n    }\n\n    cout << best << endl;\n  }\n}","fast_code":"#include <stdio.h>\n\ntypedef struct duitype\n\n{\n\n  long x, y, z;\n\n} duitype;\n\nduitype dui[1000000];\n\nlong jl[7][7][7][7][7][7];\n\nbool bj[11][11][1000];\n\nlong temp[7];\n\nlong vv[7];\n\nlong v[46657][7];\n\nlong have[11][11][1000];\n\nlong aa, a1, b1, c1, d1, e1, f1, a2, b2, head, last, x, y, z, top, i, ans, k, j, place, zz, n, m;\n\nlong map[105][105];\n\nvoid cha(long a, long b, long c, long d)\n\n{\n\n  long t;\n\n  t = temp[a];\n\n  temp[a] = temp[b];\n\n  temp[b] = temp[c];\n\n  temp[c] = temp[d];\n\n  temp[d] = t;\n}\n\nlong change(long z, char c)\n\n{\n\n  long i;\n\n  for (i = 1; i <= 6; i++)\n\n    temp[i] = v[z][i];\n\n  switch (c)\n\n  {\n\n  case 'u':\n    cha(6, 3, 4, 5);\n    break;\n\n  case 'd':\n    cha(4, 3, 6, 5);\n    break;\n\n  case 'r':\n    cha(1, 5, 2, 3);\n    break;\n\n  case 'l':\n    cha(1, 3, 2, 5);\n    break;\n  }\n\n  return jl[temp[1]][temp[2]][temp[3]][temp[4]][temp[5]][temp[6]];\n}\n\nvoid ind(long x, long y, long z, long all, char c)\n\n{\n\n  long ne;\n\n  if (x <= 0 || x > n || y <= 0 || y > m)\n\n    return;\n\n  ne = change(z, c);\n\n  if (have[x][y][ne] > all + vv[v[ne][5]] * map[x][y])\n\n  {\n\n    have[x][y][ne] = all + vv[v[ne][5]] * map[x][y];\n\n    if (!bj[x][y][ne]) {\n\n      bj[x][y][ne] = true;\n\n      last++;\n\n      dui[last].x = x;\n\n      dui[last].y = y;\n\n      dui[last].z = ne;\n    }\n  }\n\n  if (x == a2 && y == b2)\n\n    if (ans > have[x][y][ne])\n\n    {\n\n      ans = have[x][y][ne];\n    }\n}\n\nint main()\n\n{\n\n  top = 0;\n\n  for (a1 = 1; a1 <= 6; a1++)\n\n    for (b1 = 1; b1 <= 6; b1++)\n\n      if (b1 != a1)\n\n        for (c1 = 1; c1 <= 6; c1++)\n\n          if (c1 != a1 && c1 != b1)\n\n            for (d1 = 1; d1 <= 6; d1++)\n\n              if (d1 != a1 && d1 != b1 && d1 != c1)\n\n                for (e1 = 1; e1 <= 6; e1++)\n\n                  if (e1 != a1 && e1 != b1 && e1 != c1 && e1 != d1)\n\n                  {\n\n                    f1 = 21 - a1 - b1 - c1 - d1 - e1;\n\n                    top++;\n                    jl[a1][b1][c1][d1][e1][f1] = top;\n\n                    v[top][1] = a1;\n                    v[top][2] = b1;\n                    v[top][3] = c1;\n                    v[top][4] = d1;\n                    v[top][5] = e1;\n                    v[top][6] = f1;\n                  }\n\n  while (scanf(\"%d %d\", &n, &m) == 2) {\n\n    if (n == 0)\n\n      return 0;\n\n    for (i = 1; i <= n; i++)\n\n      for (j = 1; j <= m; j++)\n\n        for (k = 1; k <= top; k++) {\n\n          have[i][j][k] = 10000000;\n\n          bj[i][j][k] = false;\n        }\n\n    ans = 10000000;\n\n    for (i = 1; i <= n; i++)\n\n      for (j = 1; j <= m; j++)\n\n        scanf(\"%d\", &map[i][j]);\n\n    scanf(\"%d%d%d%d\", &a1, &b1, &a2, &b2);\n\n    a1++;\n    a2++;\n    b1++;\n    b2++;\n\n    vv[1] = 4;\n    vv[2] = 3;\n    vv[3] = 1;\n    vv[4] = 2;\n    vv[5] = 6;\n    vv[6] = 5;\n\n    z = zz = jl[1][2][3][4][5][6];\n\n    head = 0;\n    last = 1;\n    dui[1].x = a1;\n    dui[1].y = b1;\n    dui[1].z = z;\n\n    have[a1][b1][z] = 0;\n\n    while (head < last)\n\n    {\n\n      head++;\n\n      x = dui[head].x;\n      y = dui[head].y;\n      z = dui[head].z;\n\n      bj[x][y][z] = false;\n\n      ind(x + 1, y, z, have[x][y][z], 'd');\n\n      ind(x - 1, y, z, have[x][y][z], 'u');\n\n      ind(x, y + 1, z, have[x][y][z], 'r');\n\n      ind(x, y - 1, z, have[x][y][z], 'l');\n    }\n\n    printf(\"%ld\\n\", ans);\n  }\n}"}
{"fast_code_id":"e77196285008ceb090778c2ed0ca95152f6bcee45311edb4312640192faec6ab","fast_id":"21ebf2d455e5810ee714132f73ae6438c9a656a44d3795c2577a9532fd70e77f","fast_time":0.0056807617,"language":"cpp","measured_fast_code_id":"21ebf2d455e5810ee714132f73ae6438c9a656a44d3795c2577a9532fd70e77f","measured_slow_code_id":"2d53efaecb75e3ca576cfc2fb6bdd2b9b650c6b92c0e9139fa1e00057df830c0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_47495","problem_id":"p03801","slow_code_id":"6995ec653f250f5b8a13e722f76241ed65e578b1927a063c00a509f1c7a91332","slow_id":"2d53efaecb75e3ca576cfc2fb6bdd2b9b650c6b92c0e9139fa1e00057df830c0","slow_time":0.1503357421,"speedup":26.46401134904145,"stratum":"8+","sampling_key":"4b6304abf4f4a67fc0174ab1d741642c683f4caa4e70ebf12ec47a271b71b1fd","slow_code":"#include <bits/stdc++.h>\n\ntypedef long long ll;\n\ntypedef double db;\n\n#define pa pair<int, int>\n\n#define mk make_pair\n\n#define LOG(format, args...) fprintf(stderr, format, args)\n\nusing namespace std;\n\ninline int rd() {\n\n  int x = 0, f = 1;\n  char ch = getchar();\n\n  for (; !isdigit(ch); ch = getchar())\n    if (ch == '-')\n      f = -1;\n\n  for (; isdigit(ch); ch = getchar())\n    x = x * 10 + ch - '0';\n\n  return x * f;\n}\n\nconst int MAXN = 5e5 + 100;\n\nll N, a[MAXN];\n\nll l[MAXN];\n\nll but[MAXN], idx[MAXN];\n\nll ans[MAXN];\n\nint main() {\n\n  memset(idx, 0x3f, sizeof idx);\n\n  N = rd();\n\n  for (int i = 1; i <= N; ++i)\n    a[i] = rd(), l[++*l] = a[i];\n\n  sort(l + 1, l + *l + 1);\n\n  *l = unique(l + 1, l + *l + 1) - l - 1;\n\n  for (int i = 1; i <= N; ++i)\n    a[i] = lower_bound(l + 1, l + *l + 1, a[i]) - l;\n\n  for (int i = 1; i <= N; ++i)\n    but[a[i]]++, idx[a[i]] = min((ll)i, idx[a[i]]);\n\n  for (int i = *l; i >= 1; --i)\n    if (but[i]) {\n\n      but[i - 1] += but[i];\n\n      idx[i - 1] = min(idx[i], idx[i - 1]);\n\n      ans[idx[i]] += (ll)(l[i] - (i > 1 ? l[i - 1] : 0)) * but[i];\n    }\n\n  for (int i = 1; i <= N; ++i)\n    printf(\"%lld\\n\", ans[i]);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define int long long\n\nusing namespace std;\n\nstruct arr\n\n{\n\n  int aa, bb;\n\n} a[100010];\n\nint n;\n\nlong long b[100010];\n\nint cmp(arr x, arr y)\n\n{\n\n  if (x.aa != y.aa)\n    return x.aa > y.aa;\n\n  return x.bb < y.bb;\n}\n\nsigned main()\n\n{\n\n  scanf(\"%lld\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%lld\", &a[i].aa);\n\n    a[i].bb = i;\n    b[i] = 0;\n  }\n\n  sort(a + 1, a + 1 + n, cmp);\n\n  int maxa = 1;\n  int maxb = 1;\n\n  while (true)\n\n  {\n\n    while ((a[maxb].aa == a[maxa].aa) && (maxb <= n))\n      maxb = maxb + 1;\n\n    if (maxb > n)\n      break;\n\n    b[a[maxa].bb] += (maxb - 1) * (a[maxa].aa - a[maxb].aa);\n\n    a[maxa].aa = a[maxb].aa;\n\n    if (a[maxa].bb > a[maxb].bb)\n      maxa = maxb;\n  }\n\n  b[a[maxa].bb] += a[maxa].aa * n;\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%lld\\n\", b[i]);\n\n  return 0;\n}"}
{"fast_code_id":"92ff1464a1a4edbd88b09183ae6ddc74c59f421407626d5dffc250e7fadfc4f6","fast_id":"1f5b28d4f21cb157e56994aae726b175012d1fd3b624efd82bb00b449e0c0530","fast_time":0.0010431947,"language":"cpp","measured_fast_code_id":"1f5b28d4f21cb157e56994aae726b175012d1fd3b624efd82bb00b449e0c0530","measured_slow_code_id":"8f6ddc91f4f6e5c51d9db2165b4265aca59fec3540d26b8603b99d8d743d97e6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_47506","problem_id":"p03355","slow_code_id":"b165897b589f9d3e63e85f9328d63bad8f1c3a8b51c6a77cf527eb291dcf4164","slow_id":"8f6ddc91f4f6e5c51d9db2165b4265aca59fec3540d26b8603b99d8d743d97e6","slow_time":0.0036290122,"speedup":3.4787486937960868,"stratum":"2-4","sampling_key":"d45a1429bac491725beb3d8a908d2e3908ceacc887b852b4171f0afc0d3b14f4","slow_code":"\n\n#ifndef _GLIBCXX_NO_ASSERT\n\n#include <cassert>\n\n#endif\n\n#include <cctype>\n\n#include <cerrno>\n\n#include <cfloat>\n\n#include <ciso646>\n\n#include <climits>\n\n#include <clocale>\n\n#include <cmath>\n\n#include <csetjmp>\n\n#include <csignal>\n\n#include <cstdarg>\n\n#include <cstddef>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <ctime>\n\n#if __cplusplus >= 201103L\n\n#include <ccomplex>\n\n#include <cfenv>\n\n#include <cinttypes>\n\n#include <cstdbool>\n\n#include <cstdint>\n\n#include <ctgmath>\n\n#include <cwchar>\n\n#include <cwctype>\n\n#endif\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <complex>\n\n#include <deque>\n\n#include <exception>\n\n#include <fstream>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <ios>\n\n#include <iosfwd>\n\n#include <iostream>\n\n#include <istream>\n\n#include <iterator>\n\n#include <limits>\n\n#include <list>\n\n#include <locale>\n\n#include <map>\n\n#include <memory>\n\n#include <new>\n\n#include <numeric>\n\n#include <ostream>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <stdexcept>\n\n#include <streambuf>\n\n#include <string>\n\n#include <typeinfo>\n\n#include <utility>\n\n#include <valarray>\n\n#include <vector>\n\n#if __cplusplus >= 201103L\n\n#include <array>\n\n#include <atomic>\n\n#include <chrono>\n\n#include <condition_variable>\n\n#include <forward_list>\n\n#include <future>\n\n#include <initializer_list>\n\n#include <mutex>\n\n#include <random>\n\n#include <ratio>\n\n#include <regex>\n\n#include <scoped_allocator>\n\n#include <system_error>\n\n#include <thread>\n\n#include <tuple>\n\n#include <typeindex>\n\n#include <type_traits>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#endif\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\n#define intt long long\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nvector<int> v[100004];\n\nbool went[100004];\n\nvoid dfs(int x) {\n\n  went[x] = true;\n\n  for (int i = 0; i < (int)v[x].size(); i++) {\n\n    if (!went[v[x][i]]) {\n\n      dfs(v[x][i]);\n    }\n  }\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\nint lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\nint fukugen(vector<int> l) {\n\n  int ans = 0;\n\n  for (int i = 0; i < (int)l.size(); i++) {\n\n    ans *= 10;\n\n    ans += l[i];\n  }\n\n  return ans;\n}\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nint n, now;\n\nstring s;\n\nsigned main() {\n\n  cin >> s >> n;\n\n  for (int k = 0; k < 26; k++) {\n\n    vector<string> st;\n\n    for (int i = 1; i <= s.size(); i++) {\n\n      if (s[i - 1] == ('a' + k)) {\n\n        for (int j = 1; j <= min((int)s.size() - i + 1, 5ll); j++) {\n\n          st.push_back(s.substr(i - 1, j));\n        }\n      }\n    }\n\n    sort(st.begin(), st.end());\n\n    if (st.size())\n      now++;\n\n    if (now >= n && st.size()) {\n\n      cout << st[0] << endl;\n\n      return 0;\n    }\n\n    for (int i = 1; i < st.size(); i++) {\n\n      if (st[i - 1] != st[i]) {\n\n        now++;\n      }\n\n      if (now >= n) {\n\n        cout << st[i] << endl;\n\n        return 0;\n      }\n    }\n  }\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)((1e9) + 7)\n\n#define intt long long\n\n#define itn long long\n\n#define P pair<int, int>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, n) for (int i = 1; i <= n; i++)\n\n#define ALL(v) v.begin(), v.end()\n\nusing namespace std;\n\ninline int modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % m;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ninline int gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\ninline int lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\ntemplate <class T, class U>\n\ninline bool chmax(T &lhs, const U &rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\ntemplate <class T, class U>\n\ninline bool chmin(T &lhs, const U &rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\nvoid Yes() { cout << \"Yes\" << endl; }\n\nvoid No() { cout << \"No\" << endl; }\n\nvoid YES() { cout << \"YES\" << endl; }\n\nvoid NO() { cout << \"NO\" << endl; }\n\n#define fin(i) scanf(\"%lld\", &i)\n\n#define fout(i) printf(\"%lld\", i)\n\n#define fendl printf(\"\\n\")\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\n#define vecin(v)                                                                                   \\\n  for (int i = 0; i < v.size(); i++)                                                               \\\n    scanf(\"%lld\", &v[i]);\n\n#define vecout(v)                                                                                  \\\n  {                                                                                                \\\n    for (int i = 0; i < (int)v.size(); i++)                                                        \\\n      printf(\"%lld \", v[i]);                                                                       \\\n    printf(\"\\n\");                                                                                  \\\n  }\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\n  vector<int> ookisa;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    ookisa = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n\n      ookisa[i] = 1;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n      ookisa[y] += ookisa[x];\n\n      ookisa[x] = 0;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      ookisa[x] += ookisa[y];\n\n      ookisa[y] = 0;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  int size(int i) {\n\n    i = find(i);\n\n    return ookisa[i];\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\n#define endl \"\\n\"\n\nint perm[1000005];\n\nvoid init_perm() {\n\n  perm[0] = 1;\n\n  REP(i, 1000000) { perm[i] = perm[i - 1] * i % mod; }\n}\n\nint nCk(int x, int y) {\n\n  return perm[x] * modpow(perm[x - y], mod - 2) % mod * modpow(perm[y], mod - 2) % mod;\n}\n\nstring s, ans;\n\nint K, now;\n\nvector<int> basho[30];\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  std::cin.tie(nullptr);\n\n  cin >> s >> K;\n\n  rep(i, s.size()) { basho[s[i] - 'a'].push_back(i); }\n\n  rep(i, 26) {\n\n    set<string> k;\n\n    for (int j : basho[i]) {\n\n      REP(l, min(5ll, (int)s.size() - j)) { k.insert(s.substr(j, l)); }\n    }\n\n    if (now + k.size() < K) {\n\n      now += k.size();\n\n      continue;\n    }\n\n    for (auto &j : k) {\n\n      now++;\n\n      if (now == K) {\n\n        cout << j << endl;\n\n        return 0;\n      }\n    }\n  }\n}\n"}
{"fast_code_id":"9c2b80e720d5c61a00f397df65e900d206bb3d13497306035eb0a3178147b9c2","fast_id":"194c0c7b7034a222a6380335d6d61440e8487b09c1ad590881f1cdfb53b29760","fast_time":0.010473747,"language":"cpp","measured_fast_code_id":"194c0c7b7034a222a6380335d6d61440e8487b09c1ad590881f1cdfb53b29760","measured_slow_code_id":"ae801ca75f3231aee8c71d41ab888c624d536b92f33dcb82a8de4754579fae2a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_47562","problem_id":"p02660","slow_code_id":"194a5270731c60d63f476e6f4183381223dfb8098eead4a75cf475b72c81abd0","slow_id":"ae801ca75f3231aee8c71d41ab888c624d536b92f33dcb82a8de4754579fae2a","slow_time":0.1628718403,"speedup":15.55048449232161,"stratum":"8+","sampling_key":"9ffb1527e8f993aeaf07fe10481e1ac466a421fbc330e3f2a5e4127c6873e0bb","slow_code":"#include <stdio.h>\n\nconst int e[40] = {0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5,\n\n                   5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8};\n\nint main(void)\n\n{\n\n  int i, x;\n\n  long long a = 0, N;\n\n  x = scanf(\"%lld\", &N) - 1;\n\n  while (N % 2 == 0) {\n    x++;\n    N /= 2;\n  }\n\n  a += e[x];\n\n  for (i = 3; i <= 1e6; i += 2)\n\n  {\n\n    x = 0;\n    while (!(N % i))\n      x++, N /= i;\n\n    a += e[x];\n  }\n\n  if (N > 1)\n    a++;\n\n  return printf(\"%lld\\n\", a), 0;\n}","fast_code":"#include <stdio.h>\n\ntypedef long long LL;\n\nconst int e[40] = {0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5,\n\n                   5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8};\n\nLL IN(void)\n\n{\n\n  LL x = 0;\n  short f = 0, c = getchar();\n  while (c < 48 || c > 57) {\n    f ^= c == 45, c = getchar();\n  }\n\n  while (c > 47 && c < 58) {\n    x = x * 10 + c - 48, c = getchar();\n  }\n  return f ? -x : x;\n}\n\nLL BinaryModularPower(LL x, LL y, LL mod)\n\n{\n  LL p = x, v = 1;\n  while (y) {\n    if (y & 1) {\n      v = (v * p) % mod;\n    }\n    p = (p * p) % mod;\n    y >>= 1;\n  }\n  return v;\n}\n\nint Prime(LL a, LL b, LL x, LL mod)\n\n{\n\n  LL y = BinaryModularPower(a, b, x);\n\n  if (y == 1)\n    return 1;\n\n  while (x) {\n    if (y + 1 == mod) {\n      return 1;\n    }\n    y = (y * y) % mod;\n    x--;\n  }\n\n  return 0;\n}\n\nint main(void)\n\n{\n\n  LL a = 0, i = 3, p = 2, N = IN();\n\n  if (N == 1)\n    return puts(\"0\"), 0;\n\n  while (p * p < N)\n\n  {\n\n    int count = 0;\n    LL y = i >> 1, loop = 1;\n\n    while (!(N % p)) {\n      count++, N /= p;\n    }\n    a += e[count];\n\n    if (i == 3 || i == 5 || i == 7 || i == 11) {\n      p++;\n      continue;\n    }\n\n    while (!(y & 1)) {\n      y >>= 1;\n      loop++;\n    }\n\n    if (Prime(2, y, loop, i) && Prime(3, y, loop, i) &&\n\n        Prime(5, y, loop, i) && Prime(7, y, loop, i) && Prime(11, y, loop, i)) {\n      p++;\n    }\n\n    i += 2;\n  }\n\n  if (N > 1) {\n    a++;\n  }\n  return printf(\"%lld\\n\", a), 0;\n}"}
{"fast_code_id":"939b231da5938c55408ec2410c211815e4ec2941638c30e5943a8dffc9daa459","fast_id":"2c000e6d5cf0b782f64adde165184924882e61778e82b6a839331316352e3023","fast_time":0.0040687707,"language":"cpp","measured_fast_code_id":"2c000e6d5cf0b782f64adde165184924882e61778e82b6a839331316352e3023","measured_slow_code_id":"17ee9cd656a0a9f65080748fc60c348b909d0c294a614c26c9b374f45c5aa57b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_47849","problem_id":"p03846","slow_code_id":"c7f2f10a659ce0b827bfd7e6d307551af69734ef608d75ab5ce1447387db067b","slow_id":"17ee9cd656a0a9f65080748fc60c348b909d0c294a614c26c9b374f45c5aa57b","slow_time":0.0316699108,"speedup":7.783655834918394,"stratum":"4-8","sampling_key":"02531ae8dbb0100ad90668efbaef36df24321d3335d758f686027480455d20f0","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define getchar getchar_unlocked\n\n#define putchar putchar_unlocked\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint getint() {\n\n  char C;\n\n  while (!isdigit(C = getchar()))\n    ;\n\n  int A = C - '0';\n\n  while (isdigit(C = getchar()))\n    A = A * 10 + C - '0';\n\n  return A;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N = getint();\n\n  int odd = N & 1;\n\n  ll mod = 1e9 + 7;\n\n  ll kotae = 1;\n\n  int A[100000] = {};\n\n  rep(i, N) {\n\n    int a = getint();\n\n    A[a]++;\n  }\n\n  if (odd) {\n\n    if (A[0] != 1) {\n\n      co(0);\n\n      return 0;\n    }\n\n    for (int i = 2; i < N; i += 2) {\n\n      if (A[i] != 2) {\n\n        co(0);\n\n        return 0;\n      }\n\n      kotae = kotae * 2 % mod;\n    }\n\n  }\n\n  else {\n\n    for (int i = 1; i < N; i += 2) {\n\n      if (A[i] != 2) {\n\n        co(0);\n\n        return 0;\n      }\n\n      kotae = kotae * 2 % mod;\n    }\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint A[50001];\n\nbool OK = 1;\n\nll ans = 1;\n\nconst ll mod = 1e9 + 7;\n\nconst int ma = 31;\n\nint main() {\n\n  int N = getint();\n\n  if (N & 1) {\n\n    rep(i, N) {\n\n      int a = getint();\n\n      if (a & 1) {\n\n        printf(\"0\");\n\n        return 0;\n      }\n\n      A[a / 2]++;\n    }\n\n    if (A[0] != 1)\n      OK = 0;\n\n    rep1(i, N / 2) {\n\n      if (A[i] != 2)\n        OK = 0;\n\n      ans = ans << 1;\n\n      if (!(i & ma))\n        ans %= mod;\n    }\n\n    if (OK)\n      printf(\"%lld\", ans % mod);\n\n    else\n      printf(\"0\");\n\n  }\n\n  else {\n\n    rep(i, N) {\n\n      int a = getint();\n\n      if (!(a & 1)) {\n\n        printf(\"0\");\n\n        return 0;\n      }\n\n      A[a / 2]++;\n    }\n\n    rep(i, N / 2) {\n\n      if (A[i] != 2)\n        OK = 0;\n\n      ans = ans << 1;\n\n      if (!(i & ma))\n        ans %= mod;\n    }\n\n    if (OK)\n      printf(\"%lld\", ans % mod);\n\n    else\n      printf(\"0\");\n  }\n\n  Would you please return 0;\n}"}
{"fast_code_id":"b2bf427ad43dd68b45c5342b74a05edba5eeed7a7164ffcc8db9abe443e40940","fast_id":"f9246b0d01ad4aa6b40f081d88d2f653356f69d389e3b4a0bb2d0a835680fe63","fast_time":0.0010226087,"language":"cpp","measured_fast_code_id":"f9246b0d01ad4aa6b40f081d88d2f653356f69d389e3b4a0bb2d0a835680fe63","measured_slow_code_id":"6fa06c210e05b93a7bf37ad22b9c1498068a6ebec7d8c6d7775e9a4daf9e5e7e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_47889","problem_id":"p00379","slow_code_id":"f69a2ae8705afa3c6b30ae5e4763fbdcc8dbe2ba903b85c54b8492815fd33569","slow_id":"6fa06c210e05b93a7bf37ad22b9c1498068a6ebec7d8c6d7775e9a4daf9e5e7e","slow_time":0.0063754685,"speedup":6.234514237948495,"stratum":"4-8","sampling_key":"990b3020034dc127d2c2f5c58f47e1cef54b72492331aef5a6dbd97ed03f971d","slow_code":"#include <iostream>\n\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n\n  int a, n, m, L_sum;\n\n  int ans = 0, i = 1;\n\n  long long R_ans;\n\n  cin >> a >> n >> m;\n\n  R_ans = powl(i + a, n);\n\n  while (R_ans <= m) {\n\n    int num = R_ans;\n\n    L_sum = 0;\n\n    while (num > 0) {\n\n      L_sum += num % 10;\n\n      num /= 10;\n    }\n\n    if (R_ans == powl(L_sum + a, n))\n      ans++;\n\n    i++;\n\n    R_ans = powl(i + a, n);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cmath>\n\nusing namespace std;\n\nint main(void) {\n\n  int a, n, m, ans = 0;\n\n  int rightAns = 0, rightDigitSum = 0, leftSum = 1;\n  ;\n\n  int rightSum;\n\n  cin >> a >> n >> m;\n\n  while (pow(leftSum + a, n) <= m) {\n\n    rightAns = pow(leftSum + a, n);\n\n    rightSum = rightAns;\n\n    rightDigitSum = 0;\n\n    while (rightSum) {\n\n      rightDigitSum += (rightSum % 10);\n\n      rightSum /= 10;\n    }\n\n    if (rightAns == pow(rightDigitSum + a, n))\n      ans++;\n\n    leftSum++;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"8046a004d51d9cfd3200a5bb99ff12530ec75c7fc132f18cc9621c73bd5f4a76","fast_id":"44146398f253aaea794ae2a61e66a42dcb56b09994afd2ca152ac95862cfa884","fast_time":0.1405121037,"language":"cpp","measured_fast_code_id":"44146398f253aaea794ae2a61e66a42dcb56b09994afd2ca152ac95862cfa884","measured_slow_code_id":"046b87fa408a0bbf8745596133d0f6a87671321fc7605beb01d0e8285d8675c0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_47892","problem_id":"p00269","slow_code_id":"80f17572efd5b8eced516f6fd8fc0c1b7e518ed9670b442ec9d726925c7cd9fd","slow_id":"046b87fa408a0bbf8745596133d0f6a87671321fc7605beb01d0e8285d8675c0","slow_time":0.5704144841,"speedup":4.059539848025206,"stratum":"4-8","sampling_key":"839e24ddb7987d26fbba85b2ea14bc433aa1e44c8ba5c42a166d1fd147121e36","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int INF = 1001001001;\n\nconst int MAX_V = 1000;\n\nconst int S = MAX_V - 2, T = MAX_V - 1;\n\nstruct edge {\n\n  int to, cap, cost, rev;\n\n  edge(int to, int cap, int cost, int rev)\n\n      : to(to), cap(cap), cost(cost), rev(rev) {}\n};\n\nvector<edge> G[MAX_V];\n\nint dist[MAX_V];\n\nint prevv[MAX_V], preve[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost) {\n\n  G[from].push_back(edge(to, cap, cost, G[to].size()));\n\n  G[to].push_back(edge(from, 0, -cost, G[from].size() - 1));\n}\n\nint min_cost_flow(int s, int t, int f) {\n\n  int res = 0;\n\n  while (f > 0) {\n\n    fill_n(dist, MAX_V, INF);\n\n    dist[s] = 0;\n\n    bool update = true;\n\n    while (update) {\n\n      update = false;\n\n      for (int v = 0; v < MAX_V; v++) {\n\n        if (dist[v] == INF)\n          continue;\n\n        for (int i = 0; i < G[v].size(); i++) {\n\n          edge &e = G[v][i];\n\n          if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n\n            dist[e.to] = dist[v] + e.cost;\n\n            prevv[e.to] = v;\n\n            preve[e.to] = i;\n\n            update = true;\n          }\n        }\n      }\n    }\n\n    if (dist[t] == INF)\n      return -1;\n\n    int d = f;\n\n    for (int v = t; v != s; v = prevv[v]) {\n\n      edge &e = G[prevv[v]][preve[v]];\n\n      d = min(d, e.cap);\n    }\n\n    f -= d;\n\n    res += dist[t] * d;\n\n    for (int v = t; v != s; v = prevv[v]) {\n\n      edge &e = G[prevv[v]][preve[v]];\n\n      e.cap -= d;\n\n      G[v][e.rev].cap += d;\n    }\n  }\n\n  return res;\n}\n\nint D, K, L;\n\nint M, N, P;\n\nint c[8][8], r[200], t[200];\n\nint cost[1 << 16];\n\nint dp[9][1 << 16];\n\nvoid DPing() {\n\n  fill_n(*dp, 9 * (1 << 16), INF);\n\n  dp[0][0] = 0;\n\n  for (int i = 0; i < D; i++) {\n\n    for (int j = 0; j < L; j++) {\n\n      for (int k = 0; k < (1 << (2 * K)); k++) {\n\n        for (int l = 0; l < K; l++) {\n\n          if ((k >> (2 * l) & 3) >= 2)\n            continue;\n\n          dp[j + 1][k + (1 << (2 * l))] =\n              min(dp[j + 1][k + (1 << (2 * l))], dp[j][k] + c[i][l]);\n        }\n      }\n    }\n\n    for (int j = 0; j < (1 << (2 * K)); j++) {\n\n      for (int k = 1; k <= L; k++) {\n\n        dp[0][j] = min(dp[0][j], dp[k][j]);\n\n        dp[k][j] = INF;\n      }\n    }\n  }\n\n  for (int i = 0; i < (1 << (2 * K)); i++) {\n\n    cost[i] = dp[0][i];\n  }\n}\n\nbool in(int a, int b) {\n\n  for (int i = 0; i < K; i++) {\n\n    int va = a >> (i * 2) & 3;\n\n    int vb = b >> (i * 2) & 3;\n\n    if (va > vb)\n      return false;\n  }\n\n  return true;\n}\n\nvoid solve() {\n\n  DPing();\n\n  fill_n(G, MAX_V, vector<edge>());\n\n  for (int i = 0; i < M; i++)\n    add_edge(S, i, 1, 0);\n\n  for (int i = 0; i < P; i++)\n    add_edge(M + i, T, 1, 0);\n\n  for (int i = 0; i < M; i++) {\n\n    if (cost[r[i]] != INF)\n      add_edge(i, T, 1, cost[r[i]]);\n\n    for (int j = 0; j < P; j++) {\n\n      if (in(t[j], r[i]) && cost[r[i] - t[j]] != INF) {\n\n        add_edge(i, M + j, 1, cost[r[i] - t[j]]);\n      }\n    }\n  }\n\n  cout << min_cost_flow(S, T, N) << endl;\n}\n\nint get() {\n\n  int ret = 0;\n\n  for (int i = 0; i < K; i++) {\n\n    int v;\n    cin >> v;\n\n    ret += v << (i * 2);\n  }\n\n  return ret;\n}\n\nint main() {\n\n  while (cin >> D >> K >> L, D || K || L) {\n\n    for (int i = 0; i < D; i++)\n      for (int j = 0; j < K; j++)\n        cin >> c[i][j];\n\n    cin >> M >> N >> P;\n\n    for (int i = 0; i < M; i++)\n      r[i] = get();\n\n    for (int i = 0; i < P; i++)\n      t[i] = get();\n\n    solve();\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <cassert>\n\n#include <cstring>\n\n#include <queue>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <string>\n\n#include <climits>\n\nusing namespace std;\n\ntypedef pair<int, int> pint;\n\ntypedef vector<int> vint;\n\n#define pb push_back\n\n#define mp make_pair\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\ntemplate <class T, class U> void chmin(T &t, U f) {\n  if (t > f)\n    t = f;\n}\n\ntemplate <class T, class U> void chmax(T &t, U f) {\n  if (t < f)\n    t = f;\n}\n\nconst int INF = 1001001001;\n\nint D, K, L;\n\nint c[8][8];\n\nint M, N, P;\n\nint r[200];\n\nint t[200];\n\nint dp[1 << 16];\n\nvoid dping() {\n\n  fill_n(dp, 1 << 16, INF);\n\n  dp[0] = 0;\n\n  rep(i, D) rep(latte, L) {\n\n    for (int j = (1 << (2 * K)) - 1; j >= 0; j--) {\n\n      rep(k, K) {\n\n        if ((j >> (2 * k) & 3) >= 2)\n          continue;\n\n        chmin(dp[j + (1 << (2 * k))], dp[j] + c[i][k]);\n      }\n    }\n  }\n}\n\nstruct edge {\n\n  int to, cap, cost, rev;\n\n  edge(int to, int cap, int cost, int rev)\n      : to(to), cap(cap), cost(cost), rev(rev) {}\n};\n\nconst int MAX_V = 500;\n\nint S = MAX_V - 2, T = MAX_V - 1;\n\nint V;\n\nvector<edge> G[MAX_V];\n\nint dist[MAX_V];\n\nint prevv[MAX_V], preve[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost) {\n\n  G[from].pb(edge(to, cap, cost, G[to].size()));\n\n  G[to].pb(edge(from, 0, -cost, G[from].size() - 1));\n}\n\nint min_cost_flow(int s, int t, int f) {\n\n  int res = 0;\n\n  while (f > 0) {\n\n    fill_n(dist, MAX_V, INF);\n\n    dist[s] = 0;\n\n    bool update = true;\n\n    while (update) {\n\n      update = false;\n\n      rep(v, MAX_V) {\n\n        if (dist[v] == INF)\n          continue;\n\n        rep(i, G[v].size()) {\n\n          edge &e = G[v][i];\n\n          if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n\n            dist[e.to] = dist[v] + e.cost;\n\n            prevv[e.to] = v;\n\n            preve[e.to] = i;\n\n            update = true;\n          }\n        }\n      }\n    }\n\n    if (dist[t] == INF)\n      return -1;\n\n    int d = f;\n\n    for (int v = t; v != s; v = prevv[v]) {\n\n      chmin(d, G[prevv[v]][preve[v]].cap);\n    }\n\n    f -= d;\n\n    res += d * dist[t];\n\n    for (int v = t; v != s; v = prevv[v]) {\n\n      edge &e = G[prevv[v]][preve[v]];\n\n      e.cap -= d;\n\n      G[v][e.rev].cap += d;\n    }\n  }\n\n  return res;\n}\n\nint main() {\n\n  while (cin >> D >> K >> L, D || K || L) {\n\n    memset(r, 0, sizeof(r));\n    memset(t, 0, sizeof(t));\n\n    rep(i, MAX_V) G[i].clear();\n\n    rep(i, D) rep(j, K) cin >> c[i][j];\n\n    cin >> M >> N >> P;\n\n    rep(i, M) {\n\n      rep(j, K) {\n\n        int a;\n        cin >> a;\n\n        r[i] |= a << (j * 2);\n      }\n    }\n\n    rep(i, P) {\n\n      rep(j, K) {\n\n        int a;\n        cin >> a;\n\n        t[i] |= a << (j * 2);\n      }\n    }\n\n    dping();\n\n    rep(i, M) {\n\n      add_edge(S, i, 1, 0);\n\n      if (r[i] != INF)\n        add_edge(i, T, 1, dp[r[i]]);\n    }\n\n    rep(i, P) { add_edge(M + i, T, 1, 0); }\n\n    rep(i, M) {\n\n      rep(j, P) {\n\n        bool ok = true;\n\n        rep(k, K) if ((r[i] >> (2 * k) & 3) < (t[j] >> (2 * k) & 3)) ok = false;\n\n        if (ok)\n          add_edge(i, M + j, 1, dp[r[i] - t[j]]);\n      }\n    }\n\n    cout << min_cost_flow(S, T, N) << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"187fe0cb8db5d1df61972d4d24b9d89efae3d68166c7b8c61e4282ffa7a74256","fast_id":"ac612ff96966991030b32f21bf8e15b05d4d1a055c9b60572ee8bf91f40a78be","fast_time":0.0084697888,"language":"cpp","measured_fast_code_id":"ac612ff96966991030b32f21bf8e15b05d4d1a055c9b60572ee8bf91f40a78be","measured_slow_code_id":"1ffebb0bb59c0519e31346d931ce3bee80db4b8ff7660fff2733af432ff58489","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_47915","problem_id":"p04015","slow_code_id":"70cceec5404387d6cc518e0904d2547b63ea4cb5bfc47c07dfde3016636d326b","slow_id":"1ffebb0bb59c0519e31346d931ce3bee80db4b8ff7660fff2733af432ff58489","slow_time":0.1382667375,"speedup":16.32469719906121,"stratum":"8+","sampling_key":"6f26e026c345b972cdf5cced8a0ea345586c777e7c45fc37de9118d2721e8dc5","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long F[60][2601], n, K, a[210];\n\nlong long ans, tmp[60][2601];\n\nint main()\n\n{\n\n  scanf(\"%lld%lld\", &n, &K);\n\n  for (int i = 1; i <= n; i++)\n    scanf(\"%lld\", &a[i]);\n  F[0][0] = 1;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    memset(tmp, 0, sizeof tmp);\n\n    for (int j = 0; j < i; j++)\n\n      for (int k = 0; k <= 2501; k++)\n\n      {\n\n        tmp[j + 1][k + a[i]] += F[j][k];\n\n        tmp[j][k] += F[j][k];\n      }\n\n    for (int j = 0; j <= i; j++)\n\n      for (int k = 0; k <= 2501; k++)\n\n        F[j][k] = tmp[j][k];\n  }\n\n  for (int i = 1; i <= n; i++)\n    if (i * K <= 2500)\n      ans += F[i][i * K];\n\n  cout << ans << endl;\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define MAXN 50\n\nusing namespace std;\n\ntypedef long long LL;\n\nint a[MAXN + 5];\n\nLL dp[MAXN + 5][MAXN * MAXN + 5];\n\nint main()\n\n{\n\n  int n, A;\n\n  scanf(\"%d %d\", &n, &A);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  dp[0][0] = 1LL;\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = A * n; j >= a[i]; j--)\n\n      for (int tot = n; tot >= 1; tot--)\n\n        dp[tot][j] += dp[tot - 1][j - a[i]];\n\n  LL ans = 0;\n\n  for (int tot = 1; tot <= n; tot++)\n\n    ans += dp[tot][A * tot];\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"b2e494685e3e00e167c966543d06c8932da68cac6b0b938dfb32287d5a3aaa56","fast_id":"df067776519bb34a4d5f369f2cfe7a1afcea69ecd47f1ca739c15086eb8e473b","fast_time":0.007732113,"language":"cpp","measured_fast_code_id":"df067776519bb34a4d5f369f2cfe7a1afcea69ecd47f1ca739c15086eb8e473b","measured_slow_code_id":"d6fd4596ca6f05de32f88eca6526249eb7056a9c35967a6db672c450d1e9c066","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48104","problem_id":"p03726","slow_code_id":"560f3dc792f80e92f643a796e1b908056becadf0f74d686fdb6c38c812d55057","slow_id":"d6fd4596ca6f05de32f88eca6526249eb7056a9c35967a6db672c450d1e9c066","slow_time":0.0592999536,"speedup":7.669307678250434,"stratum":"4-8","sampling_key":"544aeee464ff4b2699f58205660fd2c30d30f6f6cb6dc7256bef90c47e1f5c73","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 100010;\n\ninline char nc() {\n\n  static char buf[100000], *p1 = buf, *p2 = buf;\n\n  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)\n             ? EOF\n             : *p1++;\n}\n\ninline int read() {\n\n  char ch = nc();\n  int sum = 0;\n\n  while (!(ch >= '0' && ch <= '9'))\n    ch = nc();\n\n  while (ch >= '0' && ch <= '9')\n    sum = sum * 10 + ch - 48, ch = nc();\n\n  return sum;\n}\n\nstruct E {\n\n  int t, xt;\n\n} e[N << 1];\n\nint h[N], cnt;\n\nvoid adge(int f, int t) {\n\n  e[++cnt] = (E){t, h[f]};\n  h[f] = cnt;\n}\n\nint dp[N][2], dan[N];\n\nvoid dfs1(int u, int fa) {\n\n  for (int i = h[u]; ~i; i = e[i].xt)\n    if (e[i].t != fa) {\n\n      dfs1(e[i].t, u);\n\n      if (dan[e[i].t])\n        dp[u][1]++;\n\n      else\n        dp[u][0]++;\n    }\n\n  if (dp[u][1] + dp[u][0] == 0) {\n\n    dan[u] = 1;\n\n  }\n\n  else if (dp[u][1] > 1) {\n\n    puts(\"First\");\n\n    exit(0);\n\n  }\n\n  else if (dp[u][1] == 1) {\n\n    dan[u] = 0;\n\n  }\n\n  else if (dp[u][1] == 0) {\n\n    dan[u] = 1;\n  }\n}\n\nvoid dfs2(int u, int fa) {\n\n  if (dp[u][1] != 1) {\n\n    puts(\"First\");\n\n    exit(0);\n  }\n\n  for (int i = h[u]; ~i; i = e[i].xt)\n    if (e[i].t != fa) {\n\n      int t[2];\n\n      t[0] = dp[u][0] - (!dan[e[i].t]);\n\n      t[1] = dp[u][1] - dan[e[i].t];\n\n      if (t[1] + t[0] == 0) {\n\n        dp[e[i].t][1]++;\n\n      }\n\n      else if (t[1] == 1) {\n\n        dp[e[i].t][0]++;\n\n      }\n\n      else if (t[1] == 0) {\n\n        dp[e[i].t][1]++;\n      }\n\n      dfs2(e[i].t, u);\n    }\n}\n\nint main() {\n\n  memset(h, cnt = -1, sizeof(h));\n\n  int n;\n\n  n = read();\n\n  for (int i = 1; i < n; i++) {\n\n    int a, b;\n\n    a = read();\n\n    b = read();\n\n    adge(a, b);\n\n    adge(b, a);\n  }\n\n  dfs1(1, 1);\n\n  dfs2(1, 1);\n\n  puts(\"Second\");\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define max(a, b) (a > b ? a : b)\n\n#define min(a, b) (a < b ? a : b)\n\n#define reg register\n\ntypedef long long ll;\n\ntemplate <typename T> inline T read() {\n\n  reg T x = 0;\n  reg short f = 1;\n  reg char c = getchar();\n\n  for (; !isdigit(c); f = c == '-' ? -1 : 1, c = getchar())\n    ;\n\n  for (; isdigit(c); x = x * 10 + (c ^ 48), c = getchar())\n    ;\n\n  return x * f;\n}\n\nconst int MN = 100005;\n\nstruct edge {\n  int t, nxt;\n} es[MN << 1];\n\nint h[MN], cnt;\n\ninline void ins(int s, int t) {\n\n  es[++cnt] = (edge){t, h[s]};\n  h[s] = cnt;\n  es[++cnt] = (edge){s, h[t]};\n  h[t] = cnt;\n}\n\nint n, f;\n\ninline int dfs(int st, int fa) {\n\n  if (f)\n    return 1;\n\n  reg int son = 0;\n\n  for (reg int i = h[st]; i; i = es[i].nxt)\n\n    if (es[i].t != fa)\n      son += dfs(es[i].t, st);\n\n  if (son > 1)\n    return f = 1;\n\n  return !son;\n}\n\nint main() {\n\n  n = read<int>();\n\n  for (reg int i = 1; i < n; i++)\n    ins(read<int>(), read<int>());\n\n  reg int ans = dfs(1, 0);\n  puts((ans | f) ? \"First\" : \"Second\");\n\n  return 0;\n}"}
{"fast_code_id":"d0fe46036736dbbb6633eb0c337ced35f2db20df2784e2339b3c39aa0f23dc4b","fast_id":"da58aabba637796fb18c965822cd14204dadfd0d80c41f94674ef7daa4e1af63","fast_time":0.0235800316,"language":"cpp","measured_fast_code_id":"da58aabba637796fb18c965822cd14204dadfd0d80c41f94674ef7daa4e1af63","measured_slow_code_id":"98b208948f5e3ac2ab0e5dc929a5bcf8a96a4c6d3b290207de3a0682ee7c209e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48175","problem_id":"p02642","slow_code_id":"9e2b75fef32269ac1ec21861cc3aa37cc14816ef36932490c6a47f256d2073ac","slow_id":"98b208948f5e3ac2ab0e5dc929a5bcf8a96a4c6d3b290207de3a0682ee7c209e","slow_time":0.1838055914,"speedup":7.794967984690912,"stratum":"4-8","sampling_key":"6f5c9d282f231e3e540a7e7133bd20c398fd9115cbbd555249ad2afcc42e5326","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\nusing namespace std;\n\nusing ll = long long;\n\nusing P = pair<int, int>;\n\nconst int M = 1000005;\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  vector<int> a(n);\n\n  rep(i, n) cin >> a[i];\n\n  vector<int> cnt(M);\n\n  for (int x : a) {\n\n    if (cnt[x] != 0) {\n\n      cnt[x] = 2;\n\n      continue;\n    }\n\n    for (int i = x; i < M; i += x)\n      cnt[i]++;\n  }\n\n  int ans = 0;\n\n  for (int x : a) {\n\n    if (cnt[x] == 1)\n      ans++;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nusing ll = long long;\n\ntemplate <typename T>\n\nvoid print_vec(const vector<T> &v, bool is_reverse = false, ll num = 0) {\n\n  if (num == 0)\n    num = (ll)v.size();\n\n  cout << endl;\n  cout << \"i=  \";\n  for (ll i = 0; i < num; i++)\n    cout << i << \"   \";\n  cout << endl;\n\n  cout << \"    \";\n\n  if (is_reverse)\n    for (ll i = num - 1; i >= 0; i--) {\n      cout << v[i];\n      if (i != 0)\n        cout << \"   \";\n    }\n\n  else\n    for (ll i = 0; i < num; i++) {\n      cout << v[i];\n      if (i != num - 1)\n        cout << \"   \";\n    }\n\n  cout << endl;\n}\n\ntemplate <typename T>\n\nvoid print_pairvec(const T &_pair, ll num = 0) {\n\n  cout << endl;\n  for (pair<ll, int> x : _pair) {\n    cout << x.first << \" \" << x.second << endl;\n  }\n}\n\ntemplate <typename T>\n\nvoid print_vec2(const vector<vector<T>> &v) {\n\n  cout << endl;\n  cout << \"       \";\n\n  for (ll i = 0; i < v[0].size(); i++)\n    cout << i << \"   \";\n\n  cout << endl;\n\n  for (ll i = 0; i < v.size(); i++) {\n\n    cout << \"i=\" << i << \":   \";\n\n    for (ll j = 0; j < v[i].size(); j++) {\n\n      if (v[i][j] == 0)\n        cout << \"\\x1B[0m\" << v[i][j] << \"   \";\n\n      else\n        cout << \"\\x1B[31m\" << v[i][j] << \"   \";\n    }\n\n    cout << \"\\x1B[0m\" << endl;\n  }\n}\n\nstruct Eratosthenes {\n\n  vector<ll> sieve;\n\n  Eratosthenes(ll n) : sieve(n + 1) {\n\n    for (int i = 0; i <= n; i++)\n      sieve[i] = i;\n\n    for (ll i = 2; i * i <= n; i++) {\n\n      if (sieve[i] < i)\n        continue;\n\n      for (ll j = i * i; j <= n; j += i)\n        sieve[j] = min(sieve[j], i);\n    }\n  }\n\n  vector<ll> prime_divisors(ll x, bool tmp = false) {\n\n    vector<ll> res(1, 1);\n\n    while (x > 1) {\n\n      if (res.back() != sieve[x])\n        res.push_back(sieve[x]);\n\n      x /= sieve[x];\n    }\n\n    return res;\n  }\n\n  map<ll, int> prime_divisors(ll x, int tmp = 0) {\n\n    map<ll, int> mp;\n\n    while (x > 1) {\n\n      mp[sieve[x]]++;\n\n      x /= sieve[x];\n    }\n\n    return mp;\n  }\n};\n\nint main() {\n\n  int N;\n\n  cin >> N;\n\n  vector<int> A(N);\n\n  for (int i = 0; i < N; i++)\n    cin >> A[i];\n\n  sort(A.begin(), A.end());\n\n  const int INF = A.back() + 1;\n\n  vector<int> vec(INF, 0);\n\n  for (int i = 0; i < N; i++) {\n\n    for (int j = 1; j * A[i] <= INF; j++) {\n\n      vec[A[i] * j]++;\n    }\n  }\n\n  int ans = 0;\n\n  for (ll i = 0; i < N; i++) {\n\n    if (vec[A[i]] == 1)\n      ans++;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"788d42148eb0fdf69e127f3dab9c2d00d54b7a44f6ae50ca6d1855eac4a72547","fast_id":"d50bfc4073439a5161319703f72fbfab612b445eb31826810935a26543dda794","fast_time":0.106564919,"language":"cpp","measured_fast_code_id":"d50bfc4073439a5161319703f72fbfab612b445eb31826810935a26543dda794","measured_slow_code_id":"202b784e0979d7a6cb920b4b4665fd074d1265cec0cbce62afff5db97dabb5fe","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48211","problem_id":"p03095","slow_code_id":"8adedaeac37e394d116c5ea04595e2eae69141ff0bf20cdc59e653ac014e85d3","slow_id":"202b784e0979d7a6cb920b4b4665fd074d1265cec0cbce62afff5db97dabb5fe","slow_time":0.2793313108,"speedup":2.621231390416578,"stratum":"2-4","sampling_key":"1a1aa9b99d2ca9c4e766364a8c45d65c92db61ce478d86736df61f08d1795562","slow_code":"#include <bits/stdc++.h>\n\n#define range(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rep(i, b) for (int i = 0; i < (b); i++)\n\n#define all(a) (a).begin(), (a).end()\n\n#define show(x) cerr << #x << \" = \" << (x) << endl;\n\n#define int long long\n\nusing namespace std;\n\ntemplate <typename X, typename T>\n\nauto vectors(X x, T a) {\n\n  return vector<T>(x, a);\n}\n\ntemplate <typename X, typename Y, typename Z, typename... Zs>\n\nauto vectors(X x, Y y, Z z, Zs... zs) {\n\n  auto cont = vectors(y, z, zs...);\n\n  return vector<decltype(cont)>(x, cont);\n}\n\ntemplate <typename T>\n\nostream &operator<<(ostream &os, vector<T> &v) {\n\n  rep(i, v.size()) { os << v[i] << (i == v.size() - 1 ? \"\" : \" \"); }\n  return os;\n}\n\ntemplate <typename T>\n\nistream &operator>>(istream &is, vector<T> &v) {\n\n  for (T &x : v) {\n    is >> x;\n  }\n  return is;\n}\n\nconst int M = 1000000007;\n\nsigned main() {\n\n  int n;\n\n  string s;\n\n  cin >> n >> s;\n\n  vector<int> num(26, 0);\n\n  for (auto i : s) {\n\n    num[i - 'a']++;\n  }\n\n  vector<int> a, b;\n\n  rep(s, 1 << 13) {\n\n    int sum = 1;\n\n    rep(j, 13) {\n\n      if ((s >> j) bitand 1) {\n\n        (sum *= num[j]) %= M;\n      }\n    }\n\n    a.emplace_back(sum);\n  }\n\n  rep(s, 1 << 13) {\n\n    int sum = 1;\n\n    rep(j, 13) {\n\n      if ((s >> j) bitand 1) {\n\n        (sum *= num[j + 13]) %= M;\n      }\n    }\n\n    b.emplace_back(sum);\n  }\n\n  int ans = 0;\n\n  int b_sum = 0;\n\n  rep(i, b.size()) { (b_sum += b[i]) %= M; }\n\n  rep(i, a.size()) { (ans += a[i] * b_sum % M) %= M; }\n\n  cout << ans - 1 << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define range(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rep(i, b) for (int i = 0; i < (b); i++)\n\n#define all(a) (a).begin(), (a).end()\n\n#define show(x) cerr << #x << \" = \" << (x) << endl;\n\n#define int long long\n\nusing namespace std;\n\ntemplate <typename X, typename T>\n\nauto vectors(X x, T a) {\n\n  return vector<T>(x, a);\n}\n\ntemplate <typename X, typename Y, typename Z, typename... Zs>\n\nauto vectors(X x, Y y, Z z, Zs... zs) {\n\n  auto cont = vectors(y, z, zs...);\n\n  return vector<decltype(cont)>(x, cont);\n}\n\ntemplate <typename T>\n\nostream &operator<<(ostream &os, vector<T> &v) {\n\n  rep(i, v.size()) { os << v[i] << (i == v.size() - 1 ? \"\" : \" \"); }\n  return os;\n}\n\ntemplate <typename T>\n\nistream &operator>>(istream &is, vector<T> &v) {\n\n  for (T &x : v) {\n    is >> x;\n  }\n  return is;\n}\n\nconst int M = 1000000007;\n\nsigned main() {\n\n  int n;\n\n  string s;\n\n  cin >> n >> s;\n\n  vector<int> num(26, 0);\n\n  for (auto i : s) {\n\n    num[i - 'a']++;\n  }\n\n  int ans = 1;\n\n  rep(i, num.size()) { (ans *= num[i] + 1) %= M; }\n\n  cout << ans - 1 << endl;\n}\n"}
{"fast_code_id":"3702acc7813f53040741960261519ab43773c8ab027a655f15a4f52a53e348fe","fast_id":"1134ce3485bef75f34a76edc1b37d3a0192c125d0c4fa5cd642d266b9e056572","fast_time":0.0640375161,"language":"cpp","measured_fast_code_id":"1134ce3485bef75f34a76edc1b37d3a0192c125d0c4fa5cd642d266b9e056572","measured_slow_code_id":"8dfc5203f4c32189c33d27efaf3c9957d94fa61884158a83929189e68b799fc5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48257","problem_id":"p03329","slow_code_id":"42f0e186315acf1ce712ad730c6eb5ff4477e921436f1f72434612f0e95457b7","slow_id":"8dfc5203f4c32189c33d27efaf3c9957d94fa61884158a83929189e68b799fc5","slow_time":0.5086563056,"speedup":7.943098617468081,"stratum":"4-8","sampling_key":"13e1ca05f954e562c33c5cbc3b1415672aaa3243c4ab8bc4adc9fcb1edc8a4e0","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate <class T> bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\nconst int MAX_N = 15;\n\nconst int MAX_W = 110000;\n\nint dp[MAX_N][MAX_W];\n\nint main() {\n\n  int N;\n  cin >> N;\n\n  vector<int> weight;\n\n  for (int i = 1; i <= N; i *= 6)\n    weight.push_back(i);\n\n  for (int i = 9; i <= N; i *= 9)\n    weight.push_back(i);\n\n  int n = (int)weight.size();\n\n  for (int i = 0; i < MAX_N; ++i)\n    for (int w = 0; w < MAX_W; ++w)\n      dp[i][w] = 1 << 29;\n\n  for (int i = 0; i <= n; ++i)\n    dp[i][0] = 0;\n\n  for (int i = 0; i < n; ++i) {\n\n    for (int w = 0; w <= N; ++w) {\n\n      if (w >= weight[i])\n        chmin(dp[i + 1][w], dp[i + 1][w - weight[i]] + 1);\n\n      chmin(dp[i + 1][w], dp[i][w]);\n    }\n  }\n\n  cout << dp[n][N] << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint func(int n, int a) {\n\n  int res = 0;\n\n  while (n > 0) {\n\n    res += n % a;\n\n    n /= a;\n  }\n\n  return res;\n}\n\nint main() {\n\n  int N;\n  cin >> N;\n\n  int res = N;\n\n  for (int i = 0; i <= N; ++i) {\n\n    int tmp = func(i, 6) + func(N - i, 9);\n\n    res = min(res, tmp);\n  }\n\n  cout << res << endl;\n\n  return 0;\n}"}
{"fast_code_id":"50b47d588c9e902f0976102180c6b113811b8c0ecefb86180d1e29dad27c6372","fast_id":"4417df717d0daa34b763f98034677a74991aa10064632d3ae0256a8b03548427","fast_time":0.0847327046,"language":"cpp","measured_fast_code_id":"4417df717d0daa34b763f98034677a74991aa10064632d3ae0256a8b03548427","measured_slow_code_id":"832adcf5fa66ce4ce843466cbc1a792a1873e2b8fd91d0be6e2ee786ef896a66","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48352","problem_id":"p03689","slow_code_id":"e8c90bff550669bf97168e1df3110ff39b91cc48834994fb46447afe601fd4ae","slow_id":"832adcf5fa66ce4ce843466cbc1a792a1873e2b8fd91d0be6e2ee786ef896a66","slow_time":0.8029379684,"speedup":9.47612816315083,"stratum":"8+","sampling_key":"0907651af5cc3105f868354006c9896218d5282519d6fbe4342d86bd61de800a","slow_code":"#include \"iostream\"\n\n#include \"climits\"\n\n#include \"list\"\n\n#include \"queue\"\n\n#include \"stack\"\n\n#include \"set\"\n\n#include \"functional\"\n\n#include \"algorithm\"\n\n#include \"math.h\"\n\n#include \"utility\"\n\n#include \"string\"\n\n#include \"map\"\n\n#include \"unordered_map\"\n\n#include \"iomanip\"\n\n#include \"random\"\n\nusing namespace std;\n\nconst long long int MOD = 1000000007;\n\nlist<long long int> Prime(int M) {\n\n  list<long long int> P;\n\n  P.push_back(2);\n\n  P.push_back(3);\n\n  for (int i = 5; i <= M; i += 6) {\n\n    bool flag = true;\n\n    for (auto j : P) {\n\n      if (i % j == 0) {\n\n        flag = false;\n\n        break;\n      }\n    }\n\n    if (flag)\n      P.push_back(i);\n\n    flag = true;\n\n    for (auto j : P) {\n\n      if ((i + 2) % j == 0) {\n\n        flag = false;\n\n        break;\n      }\n    }\n\n    if (flag)\n      P.push_back(i + 2);\n  }\n\n  return P;\n}\n\nlong long int power(long long int x, long long int n, long long int M) {\n\n  long long int tmp = 1;\n\n  if (n > 0) {\n\n    tmp = power(x, n / 2, M);\n\n    if (n % 2 == 0)\n      tmp = (tmp * tmp) % M;\n\n    else\n      tmp = (((tmp * tmp) % M) * x) % M;\n  }\n\n  return tmp;\n}\n\nlong long int N, M, K, Q, W, H;\n\nlong long int ans;\n\nlong long int pas[100001];\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin >> H >> W >> N >> M;\n\n  long long int num[1000][1000] = {};\n\n  for (int i = 0; i < H; i++) {\n\n    for (int j = 0; j < W; j++) {\n\n      num[i][j] = 1;\n    }\n  }\n\n  for (int i = 0; i < H; i += N) {\n\n    for (int j = 0; j <= W; j += M) {\n\n      num[i][j] += 250000;\n    }\n  }\n\n  for (int i = N - 1; i < H; i += N) {\n\n    for (int j = M - 1; j < W; j += M) {\n\n      num[i][j] = -(N * M + 250000);\n    }\n  }\n\n  for (int i = 0; i < H; i++) {\n\n    for (int j = 0; j < W; j++)\n      ans += num[i][j];\n  }\n\n  if (ans < 0) {\n\n    cout << \"No\\n\";\n\n    return 0;\n  }\n\n  cout << \"Yes\\n\";\n\n  for (int i = 0; i < H; i++) {\n\n    for (int j = 0; j < W; j++) {\n\n      if (j)\n        cout << \" \";\n\n      cout << num[i][j];\n    }\n\n    cout << endl;\n  }\n\n  return 0;\n}","fast_code":"#include \"iostream\"\n\n#include \"climits\"\n\n#include \"list\"\n\n#include \"queue\"\n\n#include \"stack\"\n\n#include \"set\"\n\n#include \"functional\"\n\n#include \"algorithm\"\n\n#include \"string\"\n\n#include \"map\"\n\n#include \"iomanip\"\n\nusing namespace std;\n\nconst long long int MOD = 1000000007;\n\nlong long int N, M, K, H, W, L, R;\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int h, w;\n\n  cin >> H >> W >> h >> w;\n\n  if (H % h == 0 && W % w == 0) {\n\n    cout << \"No\\n\";\n\n    return 0;\n  }\n\n  cout << \"Yes\\n\";\n\n  for (int i = 1; i <= H; i++) {\n\n    for (int j = 1; j <= W; j++) {\n\n      if (i % h == 0 && j % w == 0) {\n\n        cout << -(4000 * (h * w - 1)) - 1 << \" \";\n\n      }\n\n      else {\n\n        cout << \"4000 \";\n      }\n    }\n\n    cout << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"b5719e4d7223352c916cdf705623598055da221d4d56657558c1a7ddc49e2ff2","fast_id":"70d392124840526c843ccd43a8d4ab8e64ed7452daf9b671d424c0666f9c4fd2","fast_time":0.0161422647,"language":"cpp","measured_fast_code_id":"70d392124840526c843ccd43a8d4ab8e64ed7452daf9b671d424c0666f9c4fd2","measured_slow_code_id":"5ac48951354a08d9c96a190283e6a54b2835d6cd964c005a2ce10ef78b3527b1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48409","problem_id":"p03600","slow_code_id":"321bf6229eaf3d77293a1eeaf5eacbf132c66c5ee89793912e84d35aeff4692d","slow_id":"5ac48951354a08d9c96a190283e6a54b2835d6cd964c005a2ce10ef78b3527b1","slow_time":0.7771106486,"speedup":48.141364488961706,"stratum":"8+","sampling_key":"ade2235fd6e9164c5c536fd7d0e888805cf6c567f62c876c135b09d1b27f799f","slow_code":"#include <iostream>\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long int a[1000][1000], b[1000][1000], c[1000][1000];\n\nint main()\n\n{\n\n  long long int i, n, m, j, k, x, y;\n\n  long long int sum = 0;\n\n  scanf(\"%lld\", &n);\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    for (j = 1; j <= n; j++)\n\n    {\n\n      scanf(\"%lld\", &a[i][j]);\n    }\n  }\n\n  memset(c, 0, sizeof(c));\n\n  for (k = 1; k <= n; k++)\n\n  {\n\n    for (i = 1; i <= n; i++)\n\n    {\n\n      for (j = 1; j <= n; j++)\n\n      {\n\n        if (b[i][j] == 0)\n\n        {\n\n          b[i][j] = a[i][j];\n        }\n\n        b[i][j] = min(b[i][j], a[i][k] + a[k][j]);\n\n        if ((a[i][j] >= a[i][k] + a[k][j]) && (i != k && j != k))\n\n        {\n\n          c[i][j] = 1;\n\n          b[i][j] = a[i][k] + a[k][j];\n        }\n      }\n    }\n  }\n\n  int f = 0;\n\n  for (i = 1; i < n; i++)\n\n  {\n\n    for (j = i + 1; j <= n; j++)\n\n    {\n\n      if (a[i][j] != b[i][j])\n\n      {\n\n        f = -1;\n\n        break;\n      }\n      if ((c[i][j] != 1) && (a[i][j] == b[i][j]))\n\n      {\n\n        sum += b[i][j];\n      }\n    }\n\n    if (f == -1)\n\n    {\n\n      break;\n    }\n  }\n\n  if (f == -1)\n\n  {\n\n    printf(\"-1\");\n\n  } else\n\n  {\n\n    printf(\"%lld\", sum);\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int a[309][309], n;\n\n  while (~scanf(\"%d\", &n))\n\n  {\n\n    for (int i = 1; i <= n; i++)\n\n      for (int j = 1; j <= n; j++)\n\n        scanf(\"%d\", &a[i][j]);\n\n    long long ans = 0;\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      for (int j = 1; j < i; j++)\n\n      {\n\n        bool flag = 1;\n\n        for (int k = 1; k <= n; k++)\n\n        {\n\n          if (a[i][j] > a[i][k] + a[k][j])\n\n          {\n\n            printf(\"-1\\n\");\n\n            return 0;\n\n          }\n\n          else if (i != k && k != j && a[i][j] == a[i][k] + a[k][j])\n\n            flag = 0;\n        }\n\n        if (flag)\n\n          ans += a[i][j];\n      }\n    }\n\n    printf(\"%lld\\n\", ans);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"2308a2c261b1ffca4ee7aa90d986914b5007cd805bc4b35c5cdbebefab9eac2b","fast_id":"9ce507c7aa246f058761e7b3b572e4a0a29ae13c2cea17fda9e34e3167e7d7f3","fast_time":0.0155201652,"language":"cpp","measured_fast_code_id":"9ce507c7aa246f058761e7b3b572e4a0a29ae13c2cea17fda9e34e3167e7d7f3","measured_slow_code_id":"96e772805f4611f4081912fb61e782535a77d2cac9366e9241914980fee51c00","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48428","problem_id":"p03746","slow_code_id":"39f0bbcc8859377a801eb24c0959c0bfc49a936381984621fbfc0b185ba00857","slow_id":"96e772805f4611f4081912fb61e782535a77d2cac9366e9241914980fee51c00","slow_time":0.2825894643,"speedup":18.207890229158128,"stratum":"8+","sampling_key":"76188da24e3f8baf81f224ebd94825b9c40c8100faa54d64e9b4329afa473e96","slow_code":"\n\n#include <functional>\n\n#include <algorithm>\n\n#include <exception>\n\n#include <stdexcept>\n\n#include <streambuf>\n\n#include <iterator>\n\n#include <string.h>\n\n#include <stdlib.h>\n\n#include <typeinfo>\n\n#include <valarray>\n\n#include <iostream>\n\n#include <sstream>\n\n#include <istream>\n\n#include <stdio.h>\n\n#include <climits>\n\n#include <clocale>\n\n#include <complex>\n\n#include <csetjmp>\n\n#include <csignal>\n\n#include <cstdarg>\n\n#include <cstddef>\n\n#include <ctype.h>\n\n#include <cassert>\n\n#include <cstdlib>\n\n#include <utility>\n\n#include <cstring>\n\n#include <numeric>\n\n#include <ostream>\n\n#include <cwctype>\n\n#include <fstream>\n\n#include <iomanip>\n\n#include <math.h>\n\n#include <bitset>\n\n#include <cctype>\n\n#include <string>\n\n#include <vector>\n\n#include <limits>\n\n#include <locale>\n\n#include <memory>\n\n#include <cerrno>\n\n#include <time.h>\n\n#include <iosfwd>\n\n#include <cfloat>\n\n#include <cstdio>\n\n#include <cwchar>\n\n#include <cmath>\n\n#include <ctime>\n\n#include <deque>\n\n#include <queue>\n\n#include <stack>\n\n#include <list>\n\n#include <ios>\n\n#include <map>\n\n#include <set>\n\n#include <new>\n\n#define ll long long\n\n#define pb push_back\n\n#define pob pop_back\n\n#define mp make_pair\n\n#define FILL(a, v) memset((void *)a, v, sizeof(a))\n\n#define FILL0(a) FILL(a, 0)\n\n#define FILL1(a) FILL(a, -1)\n\n#define FILLBIG(a) FILL(a, 0x7f)\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define Inf ((int)0x7f7f7f7f)\n\n#define Mod 1000000007\n\n#define foreach(it, x) for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)\n\n#define FOR(i, x) for (int i = 0; i < x; i++)\n\n#define RFOR(i, x) for (int i = x - 1; i >= 0; i--)\n\n#define FFOR(i, a, b) for (int i = a; i < b; i++)\n\n#define FRFOR(i, a, b) for (int i = a - 1; i >= b; i--)\n\n#define SZ(a) ((int)(a).size())\n\n#define fi first\n\n#define se second\n\n#define OVER(a) return puts(a), 0\n\n#define fastio ios::sync_with_stdio(0)\n\n#define filei(f) freopen(f, \"r\", stdin)\n\n#define fileo(f) freopen(f, \"w\", stdout)\n\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\n\n#define MASK(a) (1 << (a))\n\n#define MASKX(x, a) ((x) << (a))\n\n#define BIT(a, b) ((a >> b) & 1)\n\n#define cddx(a) priority_queue<a>\n\n#define cxdd(a) priority_queue<a, vector<a>, greater<a> >\n\n#define deval(a)                                                                                   \\\n  { cerr << #a << \" = \" << a << endl; }\n\n#define dearr(be, en)                                                                              \\\n  {                                                                                                \\\n    cerr << #be;                                                                                   \\\n    cerr << \" = {\";                                                                                \\\n    for (auto i = be; i != en; i++)                                                                \\\n      cerr << ' ' << *i;                                                                           \\\n    cerr << \" }\\n\";                                                                                \\\n  }\n\n#define reg register\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef unsigned long long UINT;\n\ntypedef unsigned int uint;\n\ntypedef long long INT;\n\ntypedef long double ldouble;\n\ntypedef pair<INT, INT> PII;\n\ntypedef stringstream sst;\n\ntypedef istringstream iss;\n\ntypedef vector<int> vint;\n\ntypedef vector<INT> VINT;\n\ntypedef vector<pii> vpii;\n\ntypedef vector<PII> VPII;\n\ntypedef priority_queue<int> pqi;\n\ntypedef priority_queue<INT> PQI;\n\ntypedef priority_queue<pii> pqp;\n\ntypedef priority_queue<PII> PQP;\n\ntypedef priority_queue<int, vint, greater<int> > xqi;\n\ntypedef priority_queue<INT, VINT, greater<INT> > XQI;\n\ntypedef priority_queue<pii, vpii, greater<pii> > xqp;\n\ntypedef priority_queue<PII, VPII, greater<PII> > XQP;\n\nconst int INF = 1e9 + 7;\n\nusing namespace std;\n\nint n, m;\n\nvector<int> v[100005];\n\nvector<int> path;\n\nstring s;\n\nint vis[100005];\n\nint prime(int x)\n\n{\n\n  if (x == 1)\n    return 0;\n\n  for (int i = 2; i * i <= x; i++)\n\n    if (x % i == 0)\n      return 0;\n\n  return 1;\n}\n\nint check(int x, int y)\n\n{\n\n  if (x > n || x < 1 || y >= m || y < 0)\n    return 0;\n\n  return 1;\n}\n\nlong long gcd(long long a, long long b) {\n\n  if (b == 0) {\n\n    return a;\n  }\n\n  return gcd(b, a % b);\n}\n\nvoid dfs(int x)\n\n{\n\n  vis[x] = 1;\n\n  path.push_back(x);\n\n  for (int i = 0; i < v[x].size(); i++)\n\n    if (!vis[v[x][i]])\n\n    {\n\n      dfs(v[x][i]);\n\n      return;\n    }\n}\n\nint main()\n\n{\n\n  cin >> n >> m;\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    v[a].push_back(b);\n\n    v[b].push_back(a);\n  }\n\n  dfs(1);\n\n  reverse(path.begin(), path.end());\n\n  int tmp = path.back();\n\n  path.pop_back();\n\n  dfs(tmp);\n\n  cout << path.size() << endl;\n\n  for (int i = 0; i < path.size(); i++)\n\n    cout << path[i] << \" \";\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAXN = 100005, MAXM = 200005;\n\nint n, m;\n\nstruct edge\n\n{\n\n  int v, nxt;\n\n  edge() {}\n\n  edge(int vv, int nn)\n\n  {\n\n    v = vv, nxt = nn;\n  }\n\n} E[MAXM];\n\nint w[MAXN], ncnt, ans[2][MAXN];\n\nbool vis[MAXN];\n\nvoid addedge(int u, int v)\n\n{\n\n  E[++ncnt] = edge(v, w[u]);\n\n  w[u] = ncnt;\n\n  E[++ncnt] = edge(u, w[v]);\n\n  w[v] = ncnt;\n}\n\nvoid dfs(int u, int id)\n\n{\n\n  vis[u] = 1;\n\n  ans[id][++ans[id][0]] = u;\n\n  for (int i = w[u]; i; i = E[i].nxt)\n\n  {\n\n    int v = E[i].v;\n\n    if (!vis[v])\n\n    {\n\n      dfs(v, id);\n\n      return;\n    }\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d %d\", &n, &m);\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int u, v;\n\n    scanf(\"%d %d\", &u, &v);\n\n    addedge(u, v);\n  }\n\n  dfs(1, 0);\n\n  dfs(1, 1);\n\n  int zans = ans[1][0] + ans[0][0] - 1;\n\n  printf(\"%d\\n\", zans);\n\n  int key = 0;\n\n  for (int i = ans[1][0]; i >= 2; i--)\n\n  {\n\n    if (key)\n\n      printf(\" \");\n\n    printf(\"%d\", ans[1][i]);\n\n    key = 1;\n  }\n\n  for (int i = 1; i <= ans[0][0]; i++)\n\n  {\n\n    if (key)\n\n      printf(\" \");\n\n    printf(\"%d\", ans[0][i]);\n\n    key = 1;\n  }\n\n  printf(\"\\n\");\n\n  fclose(stdin);\n\n  fclose(stdout);\n}"}
{"fast_code_id":"2475a7c9aadfb1d8501dbc1624896a7859a662284e51caacf428031d4fd098a4","fast_id":"3512a87ffbaf369784bac6a8fb7e3489791ce139d9f36d9b646749ff0fc61830","fast_time":0.0194041047,"language":"cpp","measured_fast_code_id":"3512a87ffbaf369784bac6a8fb7e3489791ce139d9f36d9b646749ff0fc61830","measured_slow_code_id":"56d047bc916a2b90c2ccafb928ce5ce231f9f4a40391d4bc863d7c3425c990a3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48483","problem_id":"p04018","slow_code_id":"e7b834ead33d8ac4d7f6016940a6364ec7209d8e1cdca2862d8aed817bff3fa7","slow_id":"56d047bc916a2b90c2ccafb928ce5ce231f9f4a40391d4bc863d7c3425c990a3","slow_time":0.6393687915,"speedup":32.95018251988714,"stratum":"8+","sampling_key":"76fefb746d65ec94a080cdab22f6fc6ea377782ca4d19a2f02950a0aa1aa3eea","slow_code":"#include <bits/stdc++.h>\n\n#define int long long\n\nusing namespace std;\n\nconst int N = 5e5 + 5;\n\nconst int base = 317;\n\nconst int mod = 1e9 + 2277;\n\nstring s;\n\nint Hash[N], pw[N], n;\n\nbool pref[N], suff[N];\n\nvoid buildHash() {\n\n  s = \"#\" + s;\n\n  pw[0] = 1;\n\n  for (int i = 1; i < N; i++)\n    pw[i] = (pw[i - 1] * base) % mod;\n\n  Hash[0] = 0;\n\n  for (int i = 1; i <= n; i++)\n    Hash[i] = (Hash[i - 1] * base + s[i]) % mod;\n}\n\nint get(int l, int r) {\n\n  return ((1LL * Hash[r] - 1LL * Hash[l - 1] * pw[r - l + 1]) % mod + mod) %\n         mod;\n}\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  cin >> s;\n\n  n = s.length();\n\n  bool same = true;\n\n  for (int i = 0; i < n; i++)\n    if (s[i] != s[0])\n      same = false;\n\n  if (same) {\n\n    cout << n << \"\\n\" << 1;\n\n    return 0;\n  }\n\n  buildHash();\n\n  memset(pref, 0, sizeof(pref));\n\n  memset(suff, 0, sizeof(suff));\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = i * 2; j <= n; j = j + i) {\n\n      if (get(1, i) == get(j - i + 1, j))\n        pref[j] = true;\n\n      else\n        break;\n    }\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = n - i * 2 + 1; j >= 1; j = j - i) {\n\n      if (get(j, j + i - 1) == get(n - i + 1, n))\n        suff[j] = true;\n\n      else\n        break;\n    }\n  }\n\n  if (!pref[n])\n    return cout << 1 << \"\\n\" << 1, 0;\n\n  int ans = 0;\n\n  for (int i = 1; i < n; i++)\n    if (!pref[i] && !suff[i + 1])\n      ans++;\n\n  cout << 2 << \"\\n\" << ans;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\n#define Maxn 500005\n\nchar s[Maxn];\n\nint n, ans, fail1[Maxn], fail2[Maxn];\n\nvoid buildFail(char *s, int *fail) {\n\n  int j = fail[0] = -1;\n\n  for (int i = 1; i <= n; ++i) {\n\n    while (j >= 0 && s[j] != s[i - 1])\n      j = fail[j];\n\n    fail[i] = ++j;\n  }\n}\n\nint main() {\n\n  scanf(\"%s\", s);\n  n = strlen(s);\n\n  buildFail(s, fail1);\n\n  int len =\n      n % (n - fail1[n]) == 0 && (n - fail1[n] <= n / 2) ? n - fail1[n] : -1;\n\n  if (len == -1)\n    return puts(\"1\\n1\") & 0;\n\n  if (len == 1)\n    return printf(\"%d\\n1\\n\", n) & 0;\n\n  puts(\"2\");\n  std ::reverse(s, s + n);\n\n  buildFail(s, fail2);\n  for (int i = 1; i < n; ++i)\n\n    if ((!fail1[i] || i % (i - fail1[i])) &&\n        (!fail2[n - i] || (n - i) % ((n - i) - fail2[n - i])))\n      ++ans;\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"d93dc5c39786663af56a279a2c29a7b3b098da50115948ffe9341f0718703cc1","fast_id":"32a4851192154c17e74ef214acc71b888f410e15eafc6f1f23ca9ff58cc1bfc7","fast_time":0.0084045001,"language":"cpp","measured_fast_code_id":"32a4851192154c17e74ef214acc71b888f410e15eafc6f1f23ca9ff58cc1bfc7","measured_slow_code_id":"d6848e643f0a8b13129e9c1ab5748e6c90006edf3297dd73bbdf72c7e9e4bd27","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48540","problem_id":"p03020","slow_code_id":"a048630496639ac75480bf182c500c8850844770fec0a2902f82920ec7b73c8f","slow_id":"d6848e643f0a8b13129e9c1ab5748e6c90006edf3297dd73bbdf72c7e9e4bd27","slow_time":0.0378148428,"speedup":4.499356576841494,"stratum":"4-8","sampling_key":"36c80ab2da565c488dbecf45585dcd7bb7061e6b23829d7f243bbba82575e2bc","slow_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <queue>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 2000, maxm = 20005;\n\nconst ll inf = 1e11;\n\nstruct Edge {\n\n  Edge() {}\n\n  Edge(int a, int b, ll c, int d) {\n    v = a;\n    f = b;\n    w = c;\n    nxt = d;\n  }\n\n  int v, f, w, nxt;\n};\n\nint n, lmt;\n\nint g[maxn + 10];\n\nEdge e[maxm + 10];\n\nint nume = 1;\n\nint src, sink;\n\nvoid addedge(int u, int v, int c, ll w) {\n\n  e[++nume] = Edge(v, c, w, g[u]);\n\n  g[u] = nume;\n\n  e[++nume] = Edge(u, 0, -w, g[v]);\n\n  g[v] = nume;\n}\n\nqueue<int> que;\n\nbool inq[maxn + 10];\n\nll dist[maxn + 10];\n\nint prv[maxn + 10], pree[maxn + 10];\n\nbool findpath() {\n\n  while (!que.empty())\n    que.pop();\n\n  que.push(src);\n\n  memset(dist, 63, sizeof dist);\n\n  dist[src] = 0;\n\n  inq[src] = true;\n\n  while (!que.empty()) {\n\n    int u = que.front();\n    que.pop();\n\n    for (int i = g[u]; i; i = e[i].nxt) {\n\n      if (e[i].f > 0 && dist[u] + e[i].w < dist[e[i].v]) {\n\n        dist[e[i].v] = dist[u] + e[i].w;\n\n        prv[e[i].v] = u;\n\n        pree[e[i].v] = i;\n\n        if (!inq[e[i].v]) {\n\n          inq[e[i].v] = true;\n\n          que.push(e[i].v);\n        }\n      }\n    }\n\n    inq[u] = false;\n  }\n\n  if (dist[sink] < inf)\n    return true;\n\n  else\n    return false;\n}\n\nll augment() {\n\n  int u = sink;\n\n  ll delta = inf;\n\n  while (u != src) {\n\n    if (e[pree[u]].f < delta)\n      delta = e[pree[u]].f;\n\n    u = prv[u];\n  }\n\n  u = sink;\n\n  while (u != src) {\n\n    e[pree[u]].f -= delta;\n\n    e[pree[u] ^ 1].f += delta;\n\n    u = prv[u];\n  }\n\n  return dist[sink] * delta;\n}\n\nll mincostflow() {\n\n  ll cur = 0, ans = 0;\n\n  while (findpath()) {\n\n    cur += augment();\n\n    if (cur < ans)\n      ans = cur;\n  }\n\n  return ans;\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  src = 2 * n + 1, sink = 2 * n + 2;\n\n  for (int i = 1; i <= n; ++i) {\n\n    int x, y, c;\n    scanf(\"%d%d%d\", &x, &y, &c);\n\n    addedge(2 * n + 1, i, c, 0);\n\n    addedge(i, 2 * n + 3, c, x + y);\n\n    addedge(i, 2 * n + 4, c, x - y);\n\n    addedge(i, 2 * n + 5, c, -x + y);\n\n    addedge(i, 2 * n + 6, c, -x - y);\n  }\n\n  for (int i = 1; i <= n; ++i) {\n\n    int x, y, c;\n    scanf(\"%d%d%d\", &x, &y, &c);\n\n    addedge(n + i, 2 * n + 2, c, 0);\n\n    addedge(2 * n + 3, n + i, c, -x - y);\n\n    addedge(2 * n + 4, n + i, c, -x + y);\n\n    addedge(2 * n + 5, n + i, c, x - y);\n\n    addedge(2 * n + 6, n + i, c, x + y);\n  }\n\n  ll res = mincostflow();\n\n  printf(\"%lld\", -res);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#define N 1001\n\n#define V 2020\n\n#define E 20386\n\n#define F 0x7fffffff\n\n#define MIN(A, B) ((A) < (B) ? (A) : (B))\n\nstruct edge {\n\n  int u, v;\n\n  long long w;\n\n  int c, x;\n\n} e[E];\n\nconst long long y[2][4] = {{-1, 1, -1, 1}, {-1, -1, 1, 1}};\n\nlong long p[2][2][N], d[V];\n\nint h[V], m[2][N], f[V], q[V], l, t, z, n, g;\n\nbool v[V];\n\ninline void adde(int u, int v, long long w, int c) {\n\n  e[z] = edge{u, v, -w, c, h[u]};\n  h[u] = z++;\n\n  e[z] = edge{v, u, w, 0, h[v]};\n  h[v] = z++;\n}\n\ninline void push(int x) {\n\n  q[t++] = x;\n\n  if (t == V)\n    t = 0;\n}\n\ninline int pop() {\n\n  int x = q[l++];\n\n  if (l == V)\n    l = 0;\n\n  return x;\n}\n\nbool spfa() {\n\n  memset(d, 0x3f, sizeof d);\n\n  d[0] = 0;\n  push(0);\n  v[0] = true;\n\n  while (l != t) {\n\n    int x = pop();\n\n    v[x] = false;\n\n    for (int i = h[x]; ~i; i = e[i].x) {\n\n      if (e[i].c && d[e[i].v] > d[x] + e[i].w) {\n\n        d[e[i].v] = d[x] + e[i].w;\n        f[e[i].v] = i;\n\n        if (!v[e[i].v]) {\n          push(e[i].v);\n          v[e[i].v] = true;\n        }\n      }\n    }\n  }\n\n  return d[g] != 0x3f3f3f3f3f3f3f3fLL;\n}\n\nlong long solve() {\n\n  long long c = 0;\n\n  while (spfa()) {\n\n    int w = F;\n\n    for (int u = g; u; u = e[f[u]].u)\n      w = MIN(w, e[f[u]].c);\n\n    for (int u = g; u; u = e[f[u]].u) {\n\n      c += e[f[u]].w * w;\n      e[f[u]].c -= w;\n      e[f[u] ^ 1].c += w;\n    }\n  }\n\n  return -c;\n}\n\nint main() {\n\n  memset(h, -1, sizeof h);\n\n  scanf(\"%d\", &n);\n  g = (n << 1) + 9;\n\n  for (int i = 1; i <= 4; i++)\n    adde((n << 1) + i, (n << 1) + i + 4, 0, F);\n\n  for (int s = 0; s <= 1; s++)\n\n    for (int i = 1; i <= n; i++)\n\n      scanf(\"%lld%lld%d\", &p[s][0][i], &p[s][1][i], &m[s][i]);\n\n  for (int i = 1; i <= n; i++) {\n\n    adde(0, i, 0, m[0][i]);\n    adde(n + i, g, 0, m[1][i]);\n\n    for (int j = 0; j < 4; j++) {\n\n      adde(i, (n << 1) + j + 1, p[0][0][i] * y[0][j] + p[0][1][i] * y[1][j], F);\n\n      adde((n << 1) + 8 - j, n + i, p[1][0][i] * y[0][j] + p[1][1][i] * y[1][j], F);\n    }\n  }\n\n  printf(\"%lld\\n\", solve());\n  return 0;\n}\n"}
{"fast_code_id":"19370b25e54479248c654aa73dfd15390190c77704100165c174e07eb68ee7a6","fast_id":"7206a4cf72926a8760a63f2f7cc3722356cc5dfdec4918b5242991178c4331ca","fast_time":0.0144040648,"language":"cpp","measured_fast_code_id":"7206a4cf72926a8760a63f2f7cc3722356cc5dfdec4918b5242991178c4331ca","measured_slow_code_id":"f2653b92b9986bf3eda0295dbd8a0cc5a2d4e499265f1b1509ad2280b04d584c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48613","problem_id":"p03809","slow_code_id":"022f54269f2ff6b71bb68a88f242625285d2feca96606b4078c931d987d252bf","slow_id":"f2653b92b9986bf3eda0295dbd8a0cc5a2d4e499265f1b1509ad2280b04d584c","slow_time":0.4950521299,"speedup":34.36891854999153,"stratum":"8+","sampling_key":"34997f4ea93985d518a52056ac2e53375064ca6c91115ea8c6ea46da02eaa870","slow_code":"#include <iostream>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <vector>\n\n#include <list>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <algorithm>\n\n#include <iterator>\n\n#include <bitset>\n\n#include <ctime>\n\nusing namespace std;\n\n#define F(i, n) for (int i = 0; i < n; ++i)\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define RFOR(i, b, a) for (int i = (b) - 1; i >= (a); i--)\n\n#define ITER(it, a)                                                            \\\n  for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int)a.size()\n\n#define ALL(a) a.begin(), a.end()\n\n#define PB push_back\n\n#define MP make_pair\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\n\nconst int INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = INF * (LL)INF;\n\nconst int MAX = 200 * 1000 + 47;\n\nVI G[MAX];\n\nint A[MAX];\n\nbool ok;\n\nLL DFS(int v, int p)\n\n{\n\n  LL val = A[v];\n\n  bool leaf = (SZ(G[v]) == 1);\n\n  if (!leaf)\n    val *= 2;\n\n  LL ans = val;\n\n  FOR(i, 0, SZ(G[v]))\n\n  {\n\n    int to = G[v][i];\n\n    if (to == p)\n      continue;\n\n    LL res = DFS(to, v);\n\n    if (!leaf && res * 2 > val)\n      ok = false;\n\n    ans -= res;\n  }\n\n  if (!leaf && ans * 2 > val)\n    ok = false;\n\n  if (ans < 0)\n    ok = false;\n\n  return ans;\n}\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  FOR(i, 0, n) scanf(\"%d\", A + i);\n\n  FOR(i, 0, n - 1)\n\n  {\n\n    int a, b;\n\n    scanf(\"%d%d\", &a, &b);\n\n    --a, --b;\n\n    G[a].PB(b);\n\n    G[b].PB(a);\n  }\n\n  ok = true;\n\n  if (DFS(0, -1) == 0 && ok)\n\n  {\n\n    printf(\"YES\\n\");\n\n  }\n\n  else\n\n  {\n\n    printf(\"NO\\n\");\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define int long long\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int MAXN = 1e5 + 5;\n\nint n;\n\nint head[MAXN], to[MAXN << 1], nxt[MAXN << 1], cnt, ans, du[MAXN << 1];\n\nLL f[MAXN], a[MAXN];\n\nvoid add(int u, int v) {\n  nxt[++cnt] = head[u];\n  head[u] = cnt;\n  to[cnt] = v;\n}\n\nvoid dfs(int x, int fa) {\n\n  LL _sum = 0, mx = 0;\n\n  for (int i = head[x]; i; i = nxt[i]) {\n\n    if (to[i] == fa)\n      continue;\n\n    dfs(to[i], x);\n\n    if (ans)\n      return;\n\n    mx = max(mx, f[to[i]]);\n\n    _sum += f[to[i]];\n  }\n\n  if (!_sum) {\n\n    f[x] = a[x];\n\n    return;\n  }\n\n  f[x] = 2ll * a[x] - _sum;\n\n  if (f[x] < 0 || f[x] > a[x] || mx - f[x] > _sum - mx || a[x] < mx) {\n\n    printf(\"NO\");\n\n    exit(0);\n  }\n}\n\nsigned main() {\n\n  scanf(\"%lld\", &n);\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%lld\", &a[i]);\n\n  if (n == 2)\n    return puts(a[1] == a[2] ? \"YES\" : \"NO\"), 0;\n\n  int root = 0;\n\n  for (int i = 1; i < n; ++i) {\n\n    int u, v;\n\n    scanf(\"%lld %lld\", &u, &v);\n\n    du[u]++;\n    du[v]++;\n\n    add(u, v);\n    add(v, u);\n\n    if (du[u] > 1)\n      root = u;\n\n    if (du[v] > 1)\n      root = v;\n  }\n\n  dfs(root, 0);\n\n  if (f[root])\n    printf(\"NO\");\n\n  else\n    printf(\"YES\");\n\n  return 0;\n}"}
{"fast_code_id":"db0bd7fcde3e9a29847d9a1d9bf4a0683aeb65015bedbd7cc0e93e43404e2f27","fast_id":"65cdf446ec9906c7937329a2e3bed4e5480253a82c667644d793efe7588a1285","fast_time":0.1057242074,"language":"cpp","measured_fast_code_id":"65cdf446ec9906c7937329a2e3bed4e5480253a82c667644d793efe7588a1285","measured_slow_code_id":"5975c93f4399bb384ca97e95a101438f879e261568111d3f82c1de30c8695843","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48640","problem_id":"p03312","slow_code_id":"f7ec2f494df0daab3edb7b7a501cda2992a8ff804ef8bd75377efe2ae5dc69b8","slow_id":"5975c93f4399bb384ca97e95a101438f879e261568111d3f82c1de30c8695843","slow_time":0.4530509752,"speedup":4.2852151493168815,"stratum":"4-8","sampling_key":"9b29abc9049e14ce6a78dd3e46322efb2c8df87d05485f45e0e9c84dee71a5d8","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <vector>\n\nusing namespace std;\n\ntemplate <typename T>\n\nusing V = vector<T>;\n\ntemplate <typename S, typename T>\n\nusing P = pair<S, T>;\n\nusing ll = long long;\n\n#define FOR(i, a, b) for (ll i = (a); i < (b); i++)\n\n#define NREP(i, n) FOR(i, 1, n + 1)\n\nll N;\n\nV<ll> A(200010), sum(200010, 0);\n\nP<ll, ll> divide(ll b, ll e) {\n\n  ll ok = b, ng = e;\n\n  ll ds = sum[e] - sum[b - 1];\n\n  while (ng - ok > 1) {\n\n    ll mid = (ok + ng) / 2;\n\n    ll ps = sum[mid] - sum[b - 1];\n\n    if (ps * 2 <= ds) {\n\n      ok = mid;\n\n    } else {\n\n      ng = mid;\n    }\n  }\n\n  P<ll, ll> ret1 = make_pair(sum[ok] - sum[b - 1], sum[e] - sum[ok]);\n\n  P<ll, ll> ret2 = make_pair(sum[ok + 1] - sum[b - 1], sum[e] - sum[ok + 1]);\n\n  if (ret1.first - ret1.second > ret2.second - ret2.first) {\n\n    return ret1;\n\n  } else {\n\n    return ret2;\n  }\n}\n\nll cut(ll itr) {\n\n  V<P<ll, ll>> psum(2);\n\n  psum[0] = divide(1, itr);\n\n  psum[1] = divide(itr + 1, N);\n\n  V<ll> elem;\n\n  for (auto p : psum) {\n\n    elem.push_back(p.first);\n\n    elem.push_back(p.second);\n  }\n\n  sort(elem.begin(), elem.end());\n\n  return elem.back() - elem.front();\n}\n\nint main() {\n\n  cin >> N;\n\n  NREP(i, N) {\n\n    cin >> A[i];\n\n    sum[i] = sum[i - 1] + A[i];\n  }\n\n  ll ans = sum[N];\n\n  FOR(i, 2, N - 1) { ans = min(ans, cut(i)); }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <algorithm>\n\n#include <iostream>\n\nusing namespace std;\n\nusing ll = long long;\n\nll N;\n\nll A[200010], sum[200010];\n\npair<ll, ll> divide(ll b, ll e) {\n\n  ll ok = b, ng = e;\n\n  ll ds = sum[e] - sum[b - 1];\n\n  while (ng - ok > 1) {\n\n    ll mid = (ok + ng) / 2;\n\n    ll ps = sum[mid] - sum[b - 1];\n\n    if (ps * 2 <= ds) {\n\n      ok = mid;\n\n    } else {\n\n      ng = mid;\n    }\n  }\n\n  pair<ll, ll> former = make_pair(sum[ok] - sum[b - 1], sum[e] - sum[ok]);\n\n  pair<ll, ll> later = make_pair(sum[ok + 1] - sum[b - 1], sum[e] - sum[ok + 1]);\n\n  if (abs(former.first - former.second) < abs(later.first - later.second)) {\n\n    return former;\n\n  } else {\n\n    return later;\n  }\n}\n\nll cut(ll itr) {\n\n  pair<ll, ll> res[2] = {divide(1, itr), divide(itr + 1, N)};\n\n  ll elem[4];\n\n  for (ll i = 0; i < 2; ++i) {\n\n    elem[i * 2] = res[i].first;\n\n    elem[i * 2 + 1] = res[i].second;\n  }\n\n  sort(elem, elem + 4);\n\n  return elem[3] - elem[0];\n}\n\nint main() {\n\n  cin >> N;\n\n  sum[0] = 0;\n\n  for (ll i = 1; i <= N; ++i) {\n\n    cin >> A[i];\n\n    sum[i] = sum[i - 1] + A[i];\n  }\n\n  ll ans = sum[N];\n\n  for (ll i = 2; i < N; ++i) {\n\n    ans = min(ans, cut(i));\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"a43ac02f272e3719d2dda8254a263f1c6302fe3172151d7b566ae3b91014cb43","fast_id":"15cd9b3a734555e4b3e160e2a4e1dd826e6ca12b1d03ee1bc1b5bb8d2d78f129","fast_time":0.0182716769,"language":"cpp","measured_fast_code_id":"15cd9b3a734555e4b3e160e2a4e1dd826e6ca12b1d03ee1bc1b5bb8d2d78f129","measured_slow_code_id":"1f2bb5a9a5a780afbf2b502056ba8b1761718ec0890610068c23855ec48dfd10","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48680","problem_id":"p03677","slow_code_id":"9b5bdaaedb0c9d01ddc76f942f12395a31a957cedc18d4e83aca69d3145cb305","slow_id":"1f2bb5a9a5a780afbf2b502056ba8b1761718ec0890610068c23855ec48dfd10","slow_time":0.7361665583,"speedup":40.290038091687144,"stratum":"8+","sampling_key":"a34bdd17bbc7445aa408a5084d797ac75b76c0f91dd5c09309249b2443f535be","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<int> vi;\n\n#define Forn(i, n) for (int i = 1; i <= (n); i++)\n\n#define forn(i, n) for (int i = 0; i < (n); i++)\n\n#define lid id << 1 | 1\n\n#define rid (id << 1) + 2\n\n#define foreach(it, a)                                                         \\\n  for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)\n\n#define pb push_back\n\n#define mp make_pair\n\n#define all(x) (x).begin(), (x).end()\n\n#define mid l + r >> 1\n\n#define lson lid, l, mid\n\n#define rson rid, mid, r\n\n#define f first\n\n#define s second\n\n#define int long long\n\nconst int MAX = 1e5 + 5;\n\nint N, M, ptr, ret, a[MAX];\n\nstruct Seg\n\n{\n\n  int tag1[MAX * 4], tag2[MAX * 4];\n\n  Seg()\n\n  {\n\n    memset(tag1, 0, sizeof(tag1));\n\n    memset(tag2, 0, sizeof(tag2));\n  }\n\n  inline void update(int id, int l, int r, int a, int b, int k1, int b1)\n\n  {\n\n    if (r <= a || b <= l)\n      return;\n\n    if (a <= l && r <= b)\n\n    {\n\n      tag1[id] += k1;\n\n      tag2[id] += b1;\n\n      return;\n    }\n\n    update(lson, a, b, k1, b1);\n\n    update(rson, a, b, k1, b1);\n  }\n\n  inline void update(int l, int r, int k1, int b1)\n\n  {\n\n    if (l >= r)\n      return;\n\n    update(0, 0, ptr, l, r, k1, b1);\n  }\n\n  inline void print(int id, int l, int r, int &ret)\n\n  {\n\n    if (l + 1 == r)\n\n    {\n\n      if (l)\n        ret = min(ret, tag1[id] * l + tag2[id]);\n\n      return;\n    }\n\n    tag1[lid] += tag1[id];\n\n    tag2[lid] += tag2[id];\n\n    tag1[rid] += tag1[id];\n\n    tag2[rid] += tag2[id];\n\n    print(lson, ret);\n\n    print(rson, ret);\n  }\n\n} S;\n\nsigned main()\n\n{\n\n  scanf(\"%lld %lld\", &N, &M);\n\n  forn(i, N)\n\n      scanf(\"%lld\", &a[i]);\n\n  ptr = M + 1;\n\n  forn(i, N - 1)\n\n  {\n\n    if (a[i] == a[i + 1])\n      continue;\n\n    if (a[i] < a[i + 1])\n\n    {\n\n      S.update(1, a[i] + 1, 0, a[i + 1] - a[i]);\n\n      S.update(a[i] + 1, a[i + 1] + 1, -1, a[i + 1] + 1);\n\n      S.update(a[i + 1] + 1, ptr, 0, a[i + 1] - a[i]);\n\n    }\n\n    else\n\n    {\n\n      S.update(1, a[i + 1] + 1, -1, a[i + 1] + 1);\n\n      S.update(a[i + 1] + 1, a[i] + 1, 0, M - a[i] + a[i + 1]);\n\n      S.update(a[i] + 1, ptr, -1, M + a[i + 1] + 1);\n    }\n  }\n\n  ret = 2e18;\n\n  S.print(0, 0, ptr, ret);\n\n  printf(\"%lld\\n\", ret);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define ll long long\n\nconst int maxn = 1e5 + 5;\n\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n\nint a[maxn];\n\nstruct node\n\n{\n\n  int l, r;\n\n  ll diff, lz;\n\n} tree[4 * maxn];\n\nvoid build(int l, int r, int cur)\n\n{\n\n  tree[cur].l = l;\n\n  tree[cur].r = r;\n\n  if (l == r)\n\n    return;\n\n  int mid = (l + r) >> 1;\n\n  build(l, mid, cur << 1);\n\n  build(mid + 1, r, cur << 1 | 1);\n\n  return;\n}\n\nvoid push_up(int cur)\n\n{\n\n  tree[cur].diff = tree[cur << 1].diff + tree[cur << 1 | 1].diff;\n\n  return;\n}\n\nvoid push_down(int cur)\n\n{\n\n  if (tree[cur].lz != 0)\n\n  {\n\n    tree[cur << 1].diff +=\n        (tree[cur << 1].r - tree[cur << 1].l + 1) * tree[cur].lz;\n\n    tree[cur << 1].lz += tree[cur].lz;\n\n    tree[cur << 1 | 1].diff +=\n        (tree[cur << 1 | 1].r - tree[cur << 1 | 1].l + 1) * tree[cur].lz;\n\n    tree[cur << 1 | 1].lz += tree[cur].lz;\n\n    tree[cur].lz = 0;\n  }\n\n  return;\n}\n\nvoid add(int l, int r, ll val, int cur)\n\n{\n\n  if (l > r)\n    return;\n\n  if (tree[cur].l >= l && tree[cur].r <= r)\n\n  {\n\n    tree[cur].diff += (tree[cur].r - tree[cur].l + 1) * val;\n\n    tree[cur].lz += val;\n\n    return;\n  }\n\n  if (tree[cur].l > r || tree[cur].r < l)\n\n    return;\n\n  push_down(cur);\n\n  add(l, r, val, cur << 1);\n\n  add(l, r, val, cur << 1 | 1);\n\n  push_up(cur);\n\n  return;\n}\n\nll diff0[maxn];\n\nvoid together(int cur)\n\n{\n\n  if (tree[cur].l == tree[cur].r)\n\n  {\n\n    diff0[tree[cur].l] = tree[cur].diff;\n\n    return;\n  }\n\n  push_down(cur);\n\n  together(cur << 1);\n\n  together(cur << 1 | 1);\n\n  push_up(cur);\n\n  return;\n}\n\nll minn[maxn];\n\nint main()\n\n{\n\n  int n, m;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  build(0, m - 1, 1);\n\n  ll base = 0;\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    if (a[i] < a[i + 1])\n\n    {\n\n      base += (ll)(a[i + 1] - a[i]);\n\n      add(a[i] + 1, a[i + 1] - 1, -1, 1);\n\n      add(a[i + 1], a[i + 1], a[i + 1] - a[i] - 1, 1);\n\n    }\n\n    else\n\n    {\n\n      base += (ll)(m - a[i] + a[i + 1]);\n\n      add(0, 0, -(m - a[i]), 1);\n\n      add(1, a[i + 1] - 1, -1, 1);\n\n      add(a[i + 1], a[i + 1], m - a[i] + a[i + 1] - 1, 1);\n\n      add(a[i] + 1, m - 1, -1, 1);\n    }\n  }\n\n  together(1);\n\n  minn[0] = base;\n\n  for (int i = 1; i <= m; i++)\n\n    minn[i] = minn[i - 1] + diff0[i - 1];\n\n  ll ans = INF;\n\n  for (int i = 1; i <= m; i++)\n\n    ans = min(ans, minn[i]);\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"7acdda1c8585c570d62c54f2278a4e63fe748cfe790330ff5dfaf8aaeea04ddf","fast_id":"ab65ad4b7acea122f47a19b8f7858492d691e046adca319db251911e791b264d","fast_time":0.0198210001,"language":"cpp","measured_fast_code_id":"ab65ad4b7acea122f47a19b8f7858492d691e046adca319db251911e791b264d","measured_slow_code_id":"6ef89cd3d54a8c66df19303b98c707f3dfef75efd3cfed5414c60a1ffc5a6359","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48698","problem_id":"p02652","slow_code_id":"453af1d9795eea5bd58b214a37fff4f85836490f984c3b48f227bfa263593509","slow_id":"6ef89cd3d54a8c66df19303b98c707f3dfef75efd3cfed5414c60a1ffc5a6359","slow_time":0.1074044855,"speedup":5.418721808088786,"stratum":"4-8","sampling_key":"0dd032f129b33ac697433898ffdb4b3a6eb1e3eb2b57951ba1e210dfedc2274d","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <cstdlib>\n\ntemplate <typename T>\n\nvoid fin(T const &t) {\n  std::cout << t << std::endl;\n  exit(0);\n}\n\nint main() {\n\n  std::cin.tie(0);\n  std::ios::sync_with_stdio(false);\n\n  std::string s;\n  std::cin >> s;\n\n  int ans = s.size();\n\n  int aa[] = {0, 1, 0, 1};\n\n  int bb[] = {0, -1, -1, 0};\n\n  for (int i = 0; i < 4; ++i) {\n\n    int a = aa[i], b = bb[i];\n\n    int cur = a - b;\n\n    for (auto c : s) {\n\n      if (c == '0') {\n        --a;\n        --b;\n      }\n\n      else if (c == '1') {\n        ++a;\n        ++b;\n      }\n\n      else {\n        --a;\n        ++b;\n      }\n\n      if (a < 0)\n        a += 2;\n\n      if (b > 0)\n        b -= 2;\n\n      cur = std::max(cur, a - b);\n    }\n\n    ans = std::min(ans, cur);\n  }\n\n  fin(ans);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nchar buf[1000010];\n\nint main() {\n\n  scanf(\"%s\", buf);\n\n  int a0 = 0, a1 = 1, b0 = 0, b1 = -1;\n\n  int c0 = a0 - b0, c1 = a0 - b1, c2 = a1 - b0, c3 = a1 - b1;\n\n  for (char *p = buf; *p; p++) {\n\n    if (*p == '0') {\n      --a0;\n      --a1;\n      --b0;\n      --b1;\n    }\n\n    else if (*p == '1') {\n      ++a0;\n      ++a1;\n      ++b0;\n      ++b1;\n    }\n\n    else {\n      --a0;\n      --a1;\n      ++b0;\n      ++b1;\n    }\n\n    if (a0 < 0)\n      a0 += 2;\n\n    if (a1 < 0)\n      a1 += 2;\n\n    if (b0 > 0)\n      b0 -= 2;\n\n    if (b1 > 0)\n      b1 -= 2;\n\n    if (c0 < a0 - b0)\n      c0 = a0 - b0;\n\n    if (c1 < a0 - b1)\n      c1 = a0 - b1;\n\n    if (c2 < a1 - b0)\n      c2 = a1 - b0;\n\n    if (c3 < a1 - b1)\n      c3 = a1 - b1;\n  }\n\n  if (c0 > c1)\n    c0 = c1;\n\n  if (c2 > c3)\n    c2 = c3;\n\n  if (c0 > c2)\n    c0 = c2;\n\n  printf(\"%d\\n\", c0);\n\n  return 0;\n}\n"}
{"fast_code_id":"2e5f356e23f1290c4c2f50d8e6a400bd4d14a81ab8a48c08ec93560d7a29b1bf","fast_id":"591369c1edf84effa582e70ce5118584e0cea92363083fe9af0e96eb6e8d7e36","fast_time":0.0250618042,"language":"cpp","measured_fast_code_id":"591369c1edf84effa582e70ce5118584e0cea92363083fe9af0e96eb6e8d7e36","measured_slow_code_id":"0bfef0f3bf4b132970be3bcb7da47c51c70b903e94ee91266302b9e944bae557","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48704","problem_id":"p03038","slow_code_id":"1acff1796c3139b5831d0e30fd3843f6c7daf86a106240a081dedebe48e158cc","slow_id":"0bfef0f3bf4b132970be3bcb7da47c51c70b903e94ee91266302b9e944bae557","slow_time":0.1943449116,"speedup":7.75462572642715,"stratum":"4-8","sampling_key":"26fa4c6e0d77bbd38d1c635b8ac3654aa1eaf15ea77827332fa4e1520b5bbfeb","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N = getint(), M = getint();\n\n  int A[100000];\n\n  rep(i, N) * (A + i) = getint();\n\n  sort(A, A + N);\n\n  pair<int, int> BC[100000];\n\n  rep(i, M) {\n\n    (*(BC + i)).second = getint();\n\n    (*(BC + i)).first = getint();\n  }\n\n  sort(BC, BC + M);\n\n  ll kotae = 0;\n\n  int kazu = 0;\n\n  for (int i = M - 1; i >= 0; i--) {\n\n    rep(j, BC[i].second) {\n\n      if (kazu >= N)\n        break;\n\n      kotae += max(A[kazu], BC[i].first);\n\n      kazu++;\n    }\n  }\n\n  for (int i = kazu; i < N; i++)\n    kotae += A[i];\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nvoid pakuri_sort(int N, int A[]) {\n\n  const int b = 8;\n\n  int tmp[100001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n  }\n}\n\nvoid pakuripair_sort(int N, int A[], int B[]) {\n\n  const int b = 8;\n\n  int tmp[100001], tmp2[100001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n      tmp2[kazu[A[i] >> k * b & ((1 << b) - 1)]] = B[i];\n    }\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n\n      B[kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp2[i];\n    }\n  }\n}\n\nint main() {\n\n  int N = getint(), M = getint();\n\n  int A[100000];\n\n  rep(i, N) A[i] = getint();\n\n  pakuri_sort(N, A);\n\n  int B[100000], C[100000];\n\n  rep(i, M) {\n\n    B[i] = getint();\n\n    C[i] = getint();\n  }\n\n  pakuripair_sort(M, C, B);\n\n  ll kotae = 0;\n\n  int kazu = 0;\n\n  for (int i = M - 1; i >= 0; i--) {\n\n    rep(j, B[i]) {\n\n      if (kazu >= N)\n        break;\n\n      kotae += max(A[kazu], C[i]);\n\n      kazu++;\n    }\n  }\n\n  for (int i = kazu; i < N; i++)\n    kotae += A[i];\n\n  printf(\"%lld\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"4acfa6e2bf5b6986720f6c134bf6acb94215b3a457e95e9ba1d5ab31b5174b43","fast_id":"14de792b363e192439011d5ac97e5f22ae67f623579063fed00d3b9b575a996a","fast_time":0.0044127103,"language":"cpp","measured_fast_code_id":"14de792b363e192439011d5ac97e5f22ae67f623579063fed00d3b9b575a996a","measured_slow_code_id":"cfa5085f0706114faa4ad02792ea6f8dc55db9685b31cbda5205dd4c563342a0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48761","problem_id":"p03346","slow_code_id":"d938436e14b3ce07e031e8157dde327a3418c747388f065fcd52896730c6580e","slow_id":"cfa5085f0706114faa4ad02792ea6f8dc55db9685b31cbda5205dd4c563342a0","slow_time":0.1737781586,"speedup":39.3812751768454,"stratum":"8+","sampling_key":"859cbf11f815f4aa4df524065144c69202e7ca39f2f72ef6a6344454f5bda2cd","slow_code":"\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <queue>\n\n#include <vector>\n\n#define Max int(2e5 + 10)\n\nusing namespace std;\n\nint n, p[Max], a[Max], dp[Max];\n\nvector<int> g[Max];\n\nint dfs(int x)\n\n{\n\n  if (dp[x] > 0)\n\n    return dp[x];\n\n  dp[x] = 1;\n\n  for (int i = 0; i < g[x].size(); i++)\n\n    dp[x] = dfs(g[x][i]) + 1;\n\n  return dp[x];\n}\n\nint main()\n\n{\n\n  while (~scanf(\"%d\", &n))\n\n  {\n\n    for (int i = 1; i <= n; i++)\n\n      g[i].clear();\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      scanf(\"%d\", &p[i]);\n\n      a[p[i]] = i;\n    }\n\n    for (int i = 1; i < n; i++)\n\n      if (a[i] < a[i + 1])\n\n        g[a[i]].push_back(a[i + 1]);\n\n    memset(dp, 0, sizeof dp);\n\n    int ma = -1;\n\n    for (int i = 1; i <= n; i++)\n\n      ma = max(ma, dfs(i));\n\n    printf(\"%d\\n\", n - ma);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define mem(v, x) memset(v, x, sizeof(v))\n\n#define low(x) (x & (-x))\n\nint pos[500010], n, m;\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%d\", &m);\n\n    pos[m] = i;\n  }\n\n  int len = 1, ans = 5000000;\n\n  for (int i = 1; i < n; i++) {\n\n    if (pos[i + 1] > pos[i])\n      len++;\n    else {\n\n      ans = min(ans, n - len);\n\n      len = 1;\n    }\n  }\n\n  ans = min(ans, n - len);\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"3fcec708df61139345c3c8ffba6f9568a51c9cf96888e209b92001639b610971","fast_id":"d5b1184b1aa24c9863332784ae57a3c68617bc29da0b3a4928f17e5f50880f0f","fast_time":0.0058080328,"language":"cpp","measured_fast_code_id":"d5b1184b1aa24c9863332784ae57a3c68617bc29da0b3a4928f17e5f50880f0f","measured_slow_code_id":"c61c1edb4ee7a225ab6bbd6a9a78f602b10b32436dece403f6b53396332889b3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_48918","problem_id":"p01288","slow_code_id":"2dc336077c052402d845f4f39b32236274405cbaa7e7a824b575a8d237fef6a9","slow_id":"c61c1edb4ee7a225ab6bbd6a9a78f602b10b32436dece403f6b53396332889b3","slow_time":0.327056492,"speedup":56.31106146645728,"stratum":"8+","sampling_key":"110f297768ebf8f2bb66f511c4dbd6c59e51bb8184e6838f06df4db427b512ef","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#define LL long long\n\n#define L (x << 1)\n\n#define R (x << 1 | 1)\n\n#define N 100110\n\nusing namespace std;\n\nvector<int> edge[N];\n\nvector<int> mark[N], query[N];\n\nint n, m;\n\nstruct Tree {\n\n  struct node {\n\n    int v;\n\n  } tr[N * 3];\n\n  void init() { memset(tr, 0, sizeof(tr)); }\n\n  void update(int x) { tr[x].v = max(tr[L].v, tr[R].v); }\n\n  void modify(int x, int a, int b, int pos, int ad) {\n\n    if (a == b) {\n\n      tr[x].v = ad;\n\n      return;\n    }\n\n    int mid = a + b >> 1;\n\n    if (pos <= mid)\n      modify(L, a, mid, pos, ad);\n\n    else\n      modify(R, mid + 1, b, pos, ad);\n\n    update(x);\n  }\n\n  int query(int x, int a, int b, int l, int r) {\n\n    if (l <= a && b <= r)\n      return tr[x].v;\n\n    int mid = a + b >> 1;\n\n    if (r <= mid)\n      return query(L, a, mid, l, r);\n\n    else if (l > mid)\n      return query(R, mid + 1, b, l, r);\n\n    else\n      return max(query(L, a, mid, l, r), query(R, mid + 1, b, l, r));\n  }\n\n} sg;\n\nLL ans = 0;\n\nint list[N];\n\nint pos[N], f[N];\n\nvoid dfs() {\n\n  int u = 1, d = 1;\n\n  for (int i = 1; i <= n; i++)\n    pos[i] = 0;\n\n  while (1) {\n\n    list[d] = u;\n\n    for (int i = 0; i < mark[u].size(); i++) {\n\n      int _index = mark[u][i];\n\n      sg.modify(1, 1, m, _index, d);\n    }\n\n    for (int i = 0; i < query[u].size(); i++) {\n\n      int _index = query[u][i];\n\n      int id = sg.query(1, 1, m, 1, _index);\n\n      ans = ans + list[id];\n    }\n\n    if (pos[u] < edge[u].size()) {\n\n      u = edge[u][pos[u]++];\n\n      d++;\n\n    }\n\n    else {\n\n      while (1) {\n\n        if (pos[u] < edge[u].size() || u == 1)\n          break;\n\n        for (int i = 0; i < mark[u].size(); i++) {\n\n          int _index = mark[u][i];\n\n          sg.modify(1, 1, m, _index, 0);\n        }\n\n        u = f[u];\n\n        d--;\n      }\n\n      if (pos[u] < edge[u].size()) {\n\n        u = edge[u][pos[u]++];\n\n        d++;\n\n      }\n\n      else\n        break;\n    }\n  }\n}\n\nvoid solve() {\n\n  ans = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    edge[i].clear();\n\n    query[i].clear();\n\n    mark[i].clear();\n  }\n\n  for (int i = 2; i <= n; i++) {\n\n    scanf(\"%d\", &f[i]);\n\n    edge[f[i]].push_back(i);\n  }\n\n  mark[1].push_back(1);\n\n  m++;\n\n  for (int i = 2; i <= m; i++) {\n\n    char str[2];\n\n    int v;\n\n    scanf(\"%s%d\", str, &v);\n\n    if (str[0] == 'Q')\n      query[v].push_back(i);\n\n    else\n      mark[v].push_back(i);\n  }\n\n  sg.init();\n\n  dfs();\n\n  printf(\"%lld\\n\", ans);\n}\n\nint main() {\n\n  while (scanf(\"%d%d\", &n, &m) == 2 && n + m) {\n\n    solve();\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define N 100010\n\nint a[N];\n\nlong long Find(int x) { return a[x] == x ? a[x] : Find(a[x]); }\n\nint main() {\n\n  while (true) {\n\n    int n, q;\n\n    scanf(\"%d%d\", &n, &q);\n\n    if (!(n || q))\n\n      break;\n\n    a[1] = 1;\n\n    for (int i = 2; i <= n; i++)\n\n      scanf(\"%d\", a + i);\n\n    long long ans = 0ll;\n\n    while (q--) {\n\n      char tmp[10] = {};\n\n      int x;\n\n      scanf(\"%s%d\", tmp, &x);\n\n      if (*tmp == 'Q')\n\n        ans += Find(x);\n\n      else\n\n        a[x] = x;\n    }\n\n    printf(\"%lld\\n\", ans);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"7052e63336953abacecff79fb088dc29035651937d55566158334305f0fd8ff5","fast_id":"d1802abea59b130c68150ff81bc9ce397a66d8cd9a6c97af8d461769117b3dfb","fast_time":0.0099290014,"language":"cpp","measured_fast_code_id":"d1802abea59b130c68150ff81bc9ce397a66d8cd9a6c97af8d461769117b3dfb","measured_slow_code_id":"73d24f434e5ab427e1801d789788f2c1ab3f6855047107d410f470deb0501043","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49086","problem_id":"p03033","slow_code_id":"7445cf01dfc7dc4630d7a7f0d269b1282ecaa062bc87dda58f9ca3d1d29ef20a","slow_id":"73d24f434e5ab427e1801d789788f2c1ab3f6855047107d410f470deb0501043","slow_time":0.3899743285,"speedup":39.27628900324257,"stratum":"8+","sampling_key":"2bb90d4e5c056cefdd01a501e2d28de67256ddea4489a4472816f7a29db69582","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int K = 19;\n\nconst int KM = 1 << (K - 1);\n\nint laz[1 << K];\n\nint zero = 2e9;\n\nvoid update(int L, int R, int X, int A, int l, int r) {\n\n  if (r <= L || R <= l)\n    return;\n\n  if (L <= l && r <= R) {\n\n    laz[A] = X;\n\n    return;\n  }\n\n  update(L, R, X, A * 2, l, (l + r) / 2);\n\n  update(L, R, X, A * 2 + 1, (l + r) / 2, r);\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, Q;\n\n  cin >> N >> Q;\n\n  pair<int, pair<int, int>> XST[200000];\n\n  rep(i, N) {\n\n    int S, T, X;\n\n    cin >> S >> T >> X;\n\n    XST[i] = mp(X, mp(S, T));\n  }\n\n  sort(XST, XST + N);\n\n  reverse(XST, XST + N);\n\n  int D[200002];\n\n  D[0] = 0;\n\n  D[Q + 1] = zero;\n\n  rep1(i, Q) cin >> D[i];\n\n  rep(i, 1 << K) laz[i] = zero;\n\n  rep(i, N) {\n\n    int L = 0, R = Q + 1;\n\n    while (L + 1 < R) {\n\n      int H = (L + R) / 2;\n\n      if (D[H] + XST[i].first >= XST[i].second.first)\n        R = H;\n\n      else\n        L = H;\n    }\n\n    int L2 = 0, R2 = Q + 1;\n\n    while (L2 + 1 < R2) {\n\n      int H = (L2 + R2) / 2;\n\n      if (D[H] + XST[i].first >= XST[i].second.second)\n        R2 = H;\n\n      else\n        L2 = H;\n    }\n\n    if (R <= L2)\n      update(R, L2 + 1, XST[i].first, 1, 0, KM);\n  }\n\n  rep1(i, KM - 1) {\n\n    laz[i * 2] = min(laz[i * 2], laz[i]);\n\n    laz[i * 2 + 1] = min(laz[i * 2 + 1], laz[i]);\n  }\n\n  rep1(i, Q) {\n\n    if (laz[KM + i] == zero)\n      co(-1);\n\n    else\n      co(laz[KM + i]);\n  }\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn, dt;\n\ninline void putint(int X) {\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nint tmp[200001], tmp2[200001], tmp3[200001];\n\nvoid pakuri_sort2(int N, int A[], int B[]) {\n\n  const int b = 8;\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n      tmp2[kazu[A[i] >> k * b & ((1 << b) - 1)]] = B[i];\n    }\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n\n      B[kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp2[i];\n    }\n  }\n}\n\nvoid pakuri_sort3(int N, int A[], int B[], int C[]) {\n\n  const int b = 8;\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n      tmp2[kazu[A[i] >> k * b & ((1 << b) - 1)]] = B[i];\n\n      tmp3[kazu[A[i] >> k * b & ((1 << b) - 1)]] = C[i];\n    }\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n\n      B[kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp2[i];\n\n      C[kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp3[i];\n    }\n  }\n}\n\nint S[200002], T[200002], X[200002];\n\nint D[200002];\n\nint P[200002];\n\nint kotae[200002] = {};\n\nint ima;\n\nint Find(int A) {\n\n  if (D[A] >= T[ima] - X[ima])\n    return A - 1;\n\n  if (P[A])\n    return P[A] = Find(P[A] + 1);\n\n  else {\n\n    kotae[A] = X[ima];\n\n    return P[A] = Find(A + 1);\n  }\n}\n\nint main() {\n\n  int N = getint(), Q = getint();\n\n  rep1(i, N) {\n\n    S[i] = getint();\n\n    T[i] = getint();\n\n    X[i] = getint();\n  }\n\n  pakuri_sort3(N, X + 1, S + 1, T + 1);\n\n  rep1(i, N) tmp3[i] = S[i] - X[i] + 1000000000;\n\n  rep1(i, N) S[i] = i;\n\n  pakuri_sort2(N, tmp3 + 1, S + 1);\n\n  rep1(i, Q) D[i] = getint();\n\n  D[Q + 1] = 2e9;\n\n  int k = 1;\n\n  rep1(i, N) {\n\n    while (D[k] < tmp3[i] - 1000000000)\n      k++;\n\n    tmp[S[i]] = k;\n  }\n\n  for (ima = 1; ima <= N; ima++)\n    Find(tmp[ima]);\n\n  rep1(i, Q) {\n\n    if (kotae[i] == 0) {\n\n      *di++ = '-';\n\n      *di++ = '1';\n\n      *di++ = '\\n';\n\n    }\n\n    else\n      putint(kotae[i]);\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"e0afa360944fccaad4beb35ed47f55c9eecea4586df4ba18cf77f87a318e9ffb","fast_id":"4e5525e1970cdde6b988e6b53c9c28f82817490058771508f33484704b548d86","fast_time":0.0382864931,"language":"cpp","measured_fast_code_id":"4e5525e1970cdde6b988e6b53c9c28f82817490058771508f33484704b548d86","measured_slow_code_id":"1dde462a6c3bf39181c0b8e9bccabd52583e26975db5d6dbf7a4ee98e6afa52c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49102","problem_id":"p02326","slow_code_id":"600ae580cf63ced4aa0828b89887072def5e3cfbb1f8cd85ee3faf6d1cfd62f3","slow_id":"1dde462a6c3bf39181c0b8e9bccabd52583e26975db5d6dbf7a4ee98e6afa52c","slow_time":0.1227369578,"speedup":3.20575085003019,"stratum":"2-4","sampling_key":"a511294f9490f840cea690dab7fe59861342a50d3dd237e1aeadcdd0f4eecebc","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAX = 1400;\n\nint minSquare(int tile[MAX][MAX], int x, int y) {\n\n  if (tile[y][x] == 1) {\n\n    tile[y][x] = 0;\n\n    return 0;\n  }\n\n  return min(tile[y - 1][x - 1], min(tile[y - 1][x], tile[y][x - 1])) + 1;\n}\n\nint main() {\n\n  int H, W;\n\n  int tile[MAX][MAX];\n\n  int ans = 0;\n\n  cin >> H >> W;\n\n  for (int i = 0; i < H; i++) {\n\n    for (int j = 0; j < W; j++) {\n\n      cin >> tile[i][j];\n    }\n  }\n\n  for (int i = 0; i < H; i++) {\n\n    if (tile[i][0] == 1)\n      tile[i][0] = 0;\n\n    else {\n\n      tile[i][0] = 1;\n\n      ans = 1;\n    }\n  }\n\n  for (int i = 1; i < W; i++) {\n\n    if (tile[0][i] == 1)\n      tile[0][i] = 0;\n\n    else {\n\n      tile[0][i] = 1;\n\n      ans = 1;\n    }\n  }\n\n  int x = 1;\n\n  int y = 1;\n\n  int n = min(H, W);\n\n  for (int i = 1; i < n; i++) {\n\n    for (int j = y; j < H; j++) {\n\n      tile[j][x] = minSquare(tile, x, j);\n\n      ans = max(tile[j][x], ans);\n    }\n\n    for (int j = x + 1; j < W; j++) {\n\n      tile[y][j] = minSquare(tile, j, y);\n\n      ans = max(tile[y][j], ans);\n    }\n\n    x++;\n\n    y++;\n  }\n\n  cout << ans * ans << endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAX = 1400;\n\nint main() {\n\n  int H, W;\n\n  int tile[MAX][MAX];\n\n  int ans = 0;\n\n  scanf(\"%d%d\", &H, &W);\n\n  for (int i = 0; i < H; i++) {\n\n    for (int j = 0; j < W; j++) {\n\n      scanf(\"%d\", &tile[i][j]);\n    }\n  }\n\n  for (int y = 0; y < H; y++) {\n\n    for (int x = 0; x < W; x++) {\n\n      if (tile[y][x] == 1)\n        tile[y][x] = 0;\n\n      else if (x < 1 || y < 1)\n        tile[y][x] = 1;\n\n      else\n        tile[y][x] =\n            min(tile[y - 1][x - 1], min(tile[y - 1][x], tile[y][x - 1])) + 1;\n\n      ans = max(tile[y][x], ans);\n    }\n  }\n\n  printf(\"%d\\n\", ans * ans);\n\n  return 0;\n}"}
{"fast_code_id":"e705f3a7521aca263d124c7add66cd8b6e758583d39054531810a05872c48112","fast_id":"3dc3ffddf6c76b2541029de56ae1d9dd1baf64cf5b4e917aa8a3578f5d7dc0b4","fast_time":0.0594186747,"language":"cpp","measured_fast_code_id":"3dc3ffddf6c76b2541029de56ae1d9dd1baf64cf5b4e917aa8a3578f5d7dc0b4","measured_slow_code_id":"57dd95d52370caff7688ba9cf94b56ea01060238780c0001a9d0beaff34972ef","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49135","problem_id":"p02973","slow_code_id":"64f3ab5b018d3ccb9424313f31686080e52c722a5e98e5cf3d30eb6dda1b463c","slow_id":"57dd95d52370caff7688ba9cf94b56ea01060238780c0001a9d0beaff34972ef","slow_time":0.5492127112,"speedup":9.24309931133486,"stratum":"8+","sampling_key":"8cdb6c71a01cfda06092c30b42d3069497f01e18f86efe987679efc59a348339","slow_code":"#include <iostream>\n\n#include <map>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <map>\n\n#include <string>\n\n#include <queue>\n\n#include <set>\n\n#include <math.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<ll, P> Q;\n\nconst ll mod = 1000000007;\n\nconst ll INF = 1000000000000000;\n\nll bit[100010], num;\n\nll par[100010], sz[100010];\n\nll n, a;\n\nmultiset<ll> st;\n\nstruct edge {\n  ll to, cost;\n};\n\nll V;\n\nvector<edge> G[300010];\n\nll d[300010];\n\nll root(int x) {\n\n  if (par[x] == x)\n    return x;\n\n  return par[x] = root(par[x]);\n}\n\nvoid unite(int x, int y) {\n\n  int rx = root(x);\n\n  int ry = root(y);\n\n  if (rx == ry)\n    return;\n\n  par[rx] = ry;\n}\n\nbool same(int x, int y) {\n\n  int rx = root(x);\n\n  int ry = root(y);\n\n  return rx == ry;\n}\n\nll sum(ll i)\n\n{\n\n  ll s = 0;\n\n  while (i > 0)\n\n  {\n\n    s += bit[i];\n\n    i -= i & -i;\n  }\n\n  return s;\n}\n\nvoid add(ll i, ll x)\n\n{\n\n  while (i <= num)\n\n  {\n\n    bit[i] += x;\n\n    i += i & -i;\n  }\n}\n\nll po(ll x, ll y)\n\n{\n\n  if (y == 0)\n    return 1;\n\n  if (y % 2)\n\n  {\n\n    return po(x, y - 1) * x % mod;\n\n  }\n\n  else\n\n  {\n\n    ll yyy = po(x, y / 2);\n\n    return yyy * yyy % mod;\n  }\n}\n\nll pow_mod(ll x, ll y)\n\n{\n\n  ll res = 1;\n\n  while (y > 0)\n\n  {\n\n    if (y % 2 == 1)\n\n    {\n\n      (res *= x) %= mod;\n    }\n\n    (x *= x) %= mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nll div(ll x)\n\n{\n\n  return po(x, mod - 2);\n}\n\nint main(void)\n\n{\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> a;\n\n    if (i == 0)\n\n    {\n\n      st.insert(a);\n\n    }\n\n    else\n\n    {\n\n      auto itr = st.lower_bound(a);\n\n      if (itr != st.begin())\n\n      {\n\n        itr--;\n\n        st.erase(itr);\n      }\n\n      st.insert(a);\n    }\n  }\n\n  cout << st.size() << endl;\n\n  int www;\n\n  cin >> www;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <map>\n\n#include <string>\n\n#include <queue>\n\n#include <fstream>\n\n#include <string>\n\n#include <math.h>\n\n#include <set>\n\n#include <string>\n\n#include <bitset>\n\n#include <fstream>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<ll, ll> P;\n\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\n#define revrep(i, n) for (ll i = (n) - 1; i >= 0; i--)\n\n#define f first\n\n#define s second\n\n#define pb push_back\n\nll mod = 1000000007;\n\nconst ll INF = 100000000000010000;\n\nvector<ll> dx = {0, 1, 0, -1, 1, -1, 1, -1, 0};\n\nvector<ll> dy = {1, 0, -1, 0, 1, 1, -1, -1, 0};\n\nvoid chmin(double &x, double y) { x = min(x, y); }\n\nvoid chmax(double &x, double y) { x = max(x, y); }\n\nll pow_long(ll x, ll y) {\n\n  ll res = 1;\n\n  while (y > 0) {\n\n    if (y % 2 == 1)\n      res *= x;\n\n    x *= x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nvoid test() { cout << \"888888888888888888888888\" << endl; }\n\nll gcd(ll x, ll y) {\n\n  if (y == 0)\n    return x;\n\n  return gcd(y, x % y);\n}\n\nll pow_mod(ll x, ll k) {\n\n  x %= mod;\n\n  ll res = 1;\n\n  while (k > 0) {\n\n    if (k % 2) {\n\n      res *= x;\n      res %= mod;\n    }\n\n    x *= x;\n    x %= mod;\n\n    k /= 2;\n  }\n\n  return res;\n}\n\nll div_mod(ll x) { return pow_mod(x, mod - 2); }\n\nconst int MAXcomb = 1000010;\n\nll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];\n\nvoid COMinit() {\n\n  fac[0] = fac[1] = 1;\n\n  finv[0] = finv[1] = 1;\n\n  inv[1] = 1;\n\n  for (int i = 2; i < MAXcomb; i++) {\n\n    fac[i] = fac[i - 1] * i % mod;\n\n    inv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\n    finv[i] = finv[i - 1] * inv[i] % mod;\n  }\n}\n\nll comb(int n, int k) {\n\n  if (n < k)\n    return 0;\n\n  if (n < 0 || k < 0)\n    return 0;\n\n  return fac[n] * finv[k] % mod * finv[n - k] % mod;\n}\n\nll N;\n\nll A[100010];\n\nmultiset<ll> S;\n\nvoid solve() {\n\n  cin >> N;\n\n  rep(i, N) {\n\n    cin >> A[i];\n\n    auto itr = S.lower_bound(A[i]);\n\n    if (itr != S.begin()) {\n\n      itr--;\n\n      S.erase(itr);\n    }\n\n    S.insert(A[i]);\n  }\n\n  cout << S.size() << endl;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  ll T = 1;\n\n  rep(i, T) solve();\n}\n"}
{"fast_code_id":"2656ed7b16820d044842ef0e887347ec7e1dfc65bb5eab19985a30ef13753bbe","fast_id":"deef40e7b54a6574e84dd1389bf28d4e16effcba8f7751ac55b8b2a3456dc158","fast_time":0.0002503961,"language":"cpp","measured_fast_code_id":"deef40e7b54a6574e84dd1389bf28d4e16effcba8f7751ac55b8b2a3456dc158","measured_slow_code_id":"40cedd14b98c32b8f3e5fb0b0347a17c8a5a6d7930875bc124f865835d39a7e2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49187","problem_id":"p03830","slow_code_id":"7b25ab7060909e34297c46a218049c2008aa7a3e8f33484e25f01527e6477edb","slow_id":"40cedd14b98c32b8f3e5fb0b0347a17c8a5a6d7930875bc124f865835d39a7e2","slow_time":0.0010148384,"speedup":4.052932134326373,"stratum":"4-8","sampling_key":"1add7925c05a2a335b511593b4557be750da4e7be8704ee60022db1a701740e4","slow_code":"#include <iostream>\n\nusing namespace std;\n\n#define LL long long\n\nconst LL MOD = 1e9 + 7;\n\nLL n;\n\nLL get(LL x, LL y)\n\n{\n\n  LL ret = 0;\n\n  while (x >= y) {\n\n    ret += x / y;\n\n    x /= y;\n  }\n\n  return ret;\n}\n\nbool prime(int x)\n\n{\n\n  if (x < 2)\n    return false;\n\n  if (x == 2)\n    return true;\n\n  if (x % 2 == 0)\n    return false;\n\n  for (int i = 3; i * i <= x; i += 2)\n    if (x % i == 0)\n      return false;\n\n  return true;\n}\n\nint main()\n\n{\n\n  while (cin >> n) {\n\n    LL ans = 1;\n\n    for (int i = 2; i <= n; i++) {\n\n      if (!prime(i))\n        continue;\n\n      LL dv = get(n, i);\n\n      ans = (ans * (dv + 1LL)) % MOD;\n    }\n\n    cout << ans << '\\n';\n  }\n\n  return 0;\n}\n","fast_code":"\n\n#include <cstdio>\n\n#include <math.h>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int mod = 1e9 + 7;\n\nint a[1010], num;\n\nLL bit[1010];\n\nbool isprime(int x) {\n\n  if (x == 1)\n    return false;\n\n  int q = sqrt(x);\n\n  for (int i = 2; i <= q; i++)\n\n    if (x % i == 0)\n      return false;\n\n  return true;\n}\n\nvoid init() {\n\n  num = 0;\n\n  for (int i = 1; i <= 1000; i++)\n\n    if (isprime(i))\n      a[num++] = i;\n}\n\nvoid solve(int n) {\n\n  for (int i = 0; i < num; i++) {\n\n    if (n % a[i])\n      continue;\n\n    while (n % a[i] == 0) {\n\n      bit[i]++;\n\n      n /= a[i];\n    }\n  }\n}\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  if (n == 1) {\n\n    puts(\"1\");\n\n    return 0;\n  }\n\n  init();\n\n  for (int i = 0; i < num; i++)\n\n    bit[i] = 1;\n\n  for (int i = 2; i <= n; i++) {\n\n    solve(i);\n  }\n\n  LL ans = 1;\n\n  for (int i = 0; i < num; i++) {\n\n    ans = ans * bit[i] % mod;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"08f09cb28f2a1393331196d82089e7646a8282a55298a1025b14b4b5598a0ecd","fast_id":"58f8e5f536872ace10fd8d6404744ae140a3b2e9f9bbdb9f3dfe500c51a9c4f9","fast_time":0.0194957099,"language":"cpp","measured_fast_code_id":"58f8e5f536872ace10fd8d6404744ae140a3b2e9f9bbdb9f3dfe500c51a9c4f9","measured_slow_code_id":"f789a85b96392f2b1cafb51220a87144d3ca3c294c6b9f1a72d37315539c631f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49359","problem_id":"p01340","slow_code_id":"a7bd068ef2e5f15d2427d2c3175f1f3e0fcad35aa74279cc16f6c52de3c7fec4","slow_id":"f789a85b96392f2b1cafb51220a87144d3ca3c294c6b9f1a72d37315539c631f","slow_time":0.1059009411,"speedup":5.432012562928011,"stratum":"4-8","sampling_key":"94cc497d2154ec0a2ef72bbbf5346d81c610f76e08a5c21ea06f89552d26e6f1","slow_code":"#include <vector>\n\n#include <list>\n\n#include <map>\n\n#include <set>\n\n#include <deque>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <fstream>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <cstring>\n\nusing namespace std;\n\nint n, m;\n\nchar a[15][15];\n\nbool bo[15][15];\n\nint dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};\n\nchar UNdir(int x)\n\n{\n\n  if (x == 0)\n    return 'U';\n\n  if (x == 1)\n    return 'R';\n\n  if (x == 2)\n    return 'D';\n\n  if (x == 3)\n    return 'L';\n}\n\nint dir(char x)\n\n{\n\n  if (x == 'U')\n    return 3;\n\n  if (x == 'R')\n    return 0;\n\n  if (x == 'D')\n    return 1;\n\n  if (x == 'L')\n    return 2;\n}\n\nstruct node\n\n{\n\n  int d;\n\n  int x[105];\n\n  int y[105];\n\n  int num;\n\n  char fa;\n\n  string ans;\n};\n\nbool in(int x, int y)\n\n{\n\n  return (x >= 0 && x < n && y >= 0 && y < m);\n}\n\nvoid out(node x)\n\n{\n\n  char xx[15][15];\n\n  for (int i = 0; i < n; ++i)\n\n  {\n\n    for (int j = 0; j < m; ++j)\n\n    {\n\n      xx[i][j] = '.';\n    }\n  }\n\n  xx[x.d / m][x.d % m] = x.fa;\n\n  for (int i = 0; i < x.num; ++i)\n\n  {\n\n    xx[x.x[i]][x.y[i]] = 'o';\n  }\n\n  for (int i = 0; i < n; ++i)\n\n  {\n\n    for (int j = 0; j < m; ++j)\n\n    {\n\n      cout << xx[i][j];\n    }\n\n    cout << endl;\n  }\n\n  cout << endl;\n}\n\nint ans = 0, ansd = 0;\n\nint main(int argc, char *argv[])\n\n{\n\n  int T;\n\n  cin >> n >> m;\n\n  node xx;\n  xx.num = 0;\n\n  xx.ans = \"\";\n\n  for (int i = 0; i < n; ++i)\n\n  {\n\n    for (int j = 0; j < m; ++j)\n\n    {\n\n      cin >> a[i][j];\n\n      if (a[i][j] == 'o')\n\n      {\n\n        xx.x[xx.num] = i;\n\n        xx.y[xx.num++] = j;\n\n      }\n\n      else if (a[i][j] == 'U' || a[i][j] == 'L' || a[i][j] == 'R' || a[i][j] == 'D')\n\n      {\n\n        xx.d = i * m + j;\n\n        xx.fa = a[i][j];\n      }\n    }\n  }\n\n  queue<node> q;\n\n  q.push(xx);\n\n  bool gan = 0;\n\n  while (!q.empty())\n\n  {\n\n    node now = q.front();\n\n    if (now.num == 0)\n\n    {\n\n      cout << now.ans << endl;\n\n      break;\n    }\n\n    q.pop();\n\n    int x = now.d / m, y = now.d % m;\n\n    memset(bo, 0, sizeof(bo));\n\n    bo[x][y] = 1;\n\n    for (int i = 0; i < now.num; ++i)\n\n    {\n\n      bo[now.x[i]][now.y[i]] = 1;\n    }\n\n    int face = dir(now.fa);\n\n    for (int i = face; i < face + 3; ++i)\n\n    {\n\n      int ii = i % 4;\n\n      int l = 1;\n\n      int xx = x + dx[ii], yy = y + dy[ii];\n\n      while (1)\n\n      {\n\n        if (!in(xx, yy))\n          break;\n\n        if (bo[xx][yy])\n\n        {\n\n          node go;\n\n          go.d = xx * m + yy;\n\n          go.ans = now.ans + UNdir(ii);\n\n          go.fa = UNdir(ii);\n\n          go.num = 0;\n\n          for (int j = 0; j < now.num; ++j)\n\n          {\n\n            int xxx = now.x[j], yyy = now.y[j];\n\n            if (!(xxx == xx && yyy == yy))\n\n            {\n\n              go.x[go.num] = xxx;\n\n              go.y[go.num++] = yyy;\n            }\n          }\n\n          q.push(go);\n\n          break;\n        }\n\n        xx += dx[ii];\n\n        yy += dy[ii];\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"#include \"stdio.h\"\n\n#include \"stdlib.h\"\n\nint n, m;\n\nint map[15][15];\n\nchar str[100];\n\nchar dir[] = {' ', 'U', 'D', 'R', 'L'};\n\nint sx, sy;\n\nint c;\n\nint ans[100];\n\nbool dfs(int x, int y, int step)\n\n{\n\n  if (step == c)\n    return true;\n\n  if (map[x][y] != 2)\n\n    for (int i = x - 1; i >= 0; i--)\n\n      if (!map[i][y])\n\n      {\n\n        ans[step] = 1;\n\n        map[i][y] = 1;\n\n        if (dfs(i, y, step + 1))\n          return true;\n\n        map[i][y] = 0;\n\n        break;\n      }\n\n  if (map[x][y] != 1)\n\n    for (int i = x + 1; i < n; i++)\n\n      if (!map[i][y])\n\n      {\n\n        ans[step] = 2;\n\n        map[i][y] = 2;\n\n        if (dfs(i, y, step + 1))\n          return true;\n\n        map[i][y] = 0;\n\n        break;\n      }\n\n  if (map[x][y] != 4)\n\n    for (int i = y + 1; i < m; i++)\n\n      if (!map[x][i])\n\n      {\n\n        ans[step] = 3;\n\n        map[x][i] = 3;\n\n        if (dfs(x, i, step + 1))\n          return true;\n\n        map[x][i] = 0;\n\n        break;\n      }\n\n  if (map[x][y] != 3)\n\n    for (int i = y - 1; i >= 0; i--)\n\n      if (!map[x][i])\n\n      {\n\n        ans[step] = 4;\n\n        map[x][i] = 4;\n\n        if (dfs(x, i, step + 1))\n          return true;\n\n        map[x][i] = 0;\n\n        break;\n      }\n\n  return false;\n}\n\nint main(int argc, char const *argv[])\n\n{\n\n  scanf(\"%d %d\", &n, &m);\n\n  c = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%s\", str);\n\n    for (int j = 0; j < m; j++)\n\n      if (str[j] == '.')\n        map[i][j] = -1;\n\n      else if (str[j] == 'o') {\n        map[i][j] = 0;\n        c++;\n      }\n\n      else {\n\n        sx = i;\n\n        sy = j;\n\n        if (str[j] == 'U')\n          map[i][j] = 1;\n\n        else if (str[j] == 'D')\n          map[i][j] = 2;\n\n        else if (str[j] == 'R')\n          map[i][j] = 3;\n\n        else if (str[j] == 'L')\n          map[i][j] = 4;\n      }\n  }\n\n  dfs(sx, sy, 0);\n\n  for (int i = 0; i < c; i++)\n\n    printf(\"%c\", dir[ans[i]]);\n\n  printf(\"\\n\");\n\n  return 0;\n}"}
{"fast_code_id":"4046d3af895dd53f8460c70029184468f54e2b42ea1617f6aaa19f71d8471380","fast_id":"7b629d60471d0c244b22e7d3ca3b39e2241fed8a779a2a87eba489d4abfde1b9","fast_time":0.0085737549,"language":"cpp","measured_fast_code_id":"7b629d60471d0c244b22e7d3ca3b39e2241fed8a779a2a87eba489d4abfde1b9","measured_slow_code_id":"1757f803d44b7d2f1758cece9e9348b72b6eecb45d61d9ffed883a3bcd66e4a4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49364","problem_id":"p01359","slow_code_id":"ee14683bb7277e984c546ff75abc277874cfe803224235fd2e155804d4c925d7","slow_id":"1757f803d44b7d2f1758cece9e9348b72b6eecb45d61d9ffed883a3bcd66e4a4","slow_time":0.0436077153,"speedup":5.086186368588634,"stratum":"4-8","sampling_key":"0f408893cc5f9ba4ba11371a1ec02269a3cfd3104f4b2482117c8ce6973a7ba4","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <queue>\n\n#include <vector>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <algorithm>\n\n#include <map>\n\n#define inf 1e9\n\n#define eps 1e-8\n\n#define MAXT 500000\n\n#define MAXN 1010\n\nusing namespace std;\n\nint n, q;\n\nstruct Node\n\n{\n\n  char nam[20];\n\n  int st, ed;\n\n  int id;\n\n} a[MAXN];\n\nint main()\n\n{\n\n  while (scanf(\"%d%d\", &n, &q))\n\n  {\n\n    if (n == 0 && q == 0)\n      break;\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      scanf(\"%s\", a[i].nam);\n\n      int x, y;\n\n      scanf(\"%d%d\", &x, &y);\n\n      a[i].st = y - x + 1;\n      a[i].ed = y;\n    }\n\n    while (q--)\n\n    {\n\n      int tp;\n\n      scanf(\"%d\", &tp);\n\n      int flag = 0;\n\n      for (int i = 1; i <= n; i++)\n\n      {\n\n        if (tp >= a[i].st && tp <= a[i].ed)\n\n        {\n\n          printf(\"%s %d\\n\", a[i].nam, tp - a[i].st + 1);\n\n          flag = 1;\n\n          break;\n        }\n      }\n\n      if (!flag)\n        printf(\"Unknown\\n\");\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\n#define inf 1000000111\n\n#define N 1005\n\nusing namespace std;\n\nstruct Calender\n\n{\n\n  int l, r;\n\n  char st[22];\n\n} cale[N];\n\nint cmp(Calender x, Calender y)\n\n{\n\n  return x.l < y.l;\n}\n\nint main()\n\n{\n\n  int n, q, x;\n\n  while (scanf(\"%d%d\", &n, &q))\n\n  {\n\n    if (n == 0 && q == 0)\n\n    {\n\n      break;\n    }\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      scanf(\"%s%d%d\", cale[i].st, &x, &cale[i].r);\n\n      cale[i].l = cale[i].r - x;\n    }\n\n    sort(cale, cale + n, cmp);\n\n    cale[n].l = inf;\n\n    while (q--)\n\n    {\n\n      scanf(\"%d\", &x);\n\n      for (int i = 0; i <= n; i++)\n\n      {\n\n        if (cale[i].l >= x)\n\n        {\n\n          if (i > 0 && cale[i - 1].l < x && cale[i - 1].r >= x)\n\n          {\n\n            printf(\"%s %d\\n\", cale[i - 1].st, x - cale[i - 1].l);\n\n          }\n\n          else\n\n          {\n\n            printf(\"Unknown\\n\");\n          }\n\n          break;\n        }\n      }\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"5a0f2c7ea72cfbf5c3bd3ce80a25e78044b39738d11917a4ca63d4587b502f53","fast_id":"0cf961592fbbd5392250a0b9a4b3dc7582a330eec5dc8b8458aa651e9745c565","fast_time":0.0097829214,"language":"cpp","measured_fast_code_id":"0cf961592fbbd5392250a0b9a4b3dc7582a330eec5dc8b8458aa651e9745c565","measured_slow_code_id":"644cf0a018d779365df21c13a4a0a1888fe07ad7c1b35b7b2e14e9382c495f8a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49368","problem_id":"p04014","slow_code_id":"85c9edfc3645f8c32d9294c3c33d8d827b0abeeb332a2b03f236fd888850857b","slow_id":"644cf0a018d779365df21c13a4a0a1888fe07ad7c1b35b7b2e14e9382c495f8a","slow_time":0.047444719,"speedup":4.849749585026821,"stratum":"4-8","sampling_key":"2d4901c50fdaa087094ae3e9894ce56a5593090bb5bea91b0218e50ed5bdf98d","slow_code":"\n\n#ifdef local\n\n#include \"D:\\vscode\\acm\\local.hpp\"\n\n#else\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define debug(...)                                                                                 \\\n  do {                                                                                             \\\n  } while (false)\n\nvoid Main();\n\nint main() {\n\n  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n  Main();\n\n  return 0;\n}\n\n#endif\n\nint64_t Function(int64_t b, int64_t n) {\n\n  if (n < b)\n    return n;\n\n  return Function(b, n / b) + n % b;\n}\n\nvoid Main() {\n\n  int64_t n, s;\n  cin >> n >> s;\n\n  if (n == s) {\n\n    cout << (n + 1) << '\\n';\n\n    return;\n  }\n\n  for (int64_t b = 2; b <= n / b; b++) {\n\n    if (Function(b, n) == s) {\n\n      cout << b << '\\n';\n\n      return;\n    }\n  }\n\n  if (s > n) {\n\n    cout << \"-1\\n\";\n\n    return;\n  }\n\n  int64_t ans = LLONG_MAX;\n\n  for (int64_t x = 1; x <= (n - s) / x; x++) {\n\n    if ((n - s) % x == 0) {\n\n      const int64_t b = (n - s) / x + 1;\n\n      if (Function(b, n) == s) {\n\n        ans = min(ans, b);\n      }\n    }\n  }\n\n  if (ans == LLONG_MAX) {\n\n    ans = -1;\n  }\n\n  cout << ans << '\\n';\n}","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\ntypedef long long LL;\n\nLL f(LL x, LL n)\n\n{\n\n  if (n < x)\n    return n;\n\n  return f(x, n / x) + n % x;\n}\n\nint main()\n\n{\n\n  LL n, s, i, d, k, x, y;\n\n  scanf(\"%lld%lld\", &n, &s);\n\n  if (s > n) {\n\n    puts(\"-1\");\n\n    return 0;\n  }\n\n  if (s == n) {\n\n    printf(\"%lld\\n\", n + 1);\n\n    return 0;\n  }\n\n  for (i = 2; n / i >= i; i++) {\n\n    if (f(i, n) == s) {\n\n      printf(\"%lld\\n\", i);\n\n      return 0;\n    }\n  }\n\n  d = n - s;\n\n  for (i = sqrt(d); i > 0; i--) {\n\n    if (d % i == 0) {\n\n      x = d / i + 1, y = s - i;\n\n      if (y >= 0 && y < x && n / x < x) {\n\n        printf(\"%lld\\n\", x);\n\n        return 0;\n      }\n    }\n  }\n\n  puts(\"-1\");\n\n  return 0;\n}"}
{"fast_code_id":"36d7fd75d26525e7040df4ae22fe600e14bee776437e34c6f7bc7cfa7712dd0b","fast_id":"00c061419a58846b1dce70f9a6686950930822608315b0816efaa325707d82bb","fast_time":0.1100505369,"language":"cpp","measured_fast_code_id":"00c061419a58846b1dce70f9a6686950930822608315b0816efaa325707d82bb","measured_slow_code_id":"9d105f71e40ccfc09a11ce84a9dcaf54ed2005d5a6c23b3f5f05de92696dd00a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49401","problem_id":"p02839","slow_code_id":"cdab797d23049f6433d4a1c32c26c5bac5ee56a994a5678fb1c9c47c27de4b57","slow_id":"9d105f71e40ccfc09a11ce84a9dcaf54ed2005d5a6c23b3f5f05de92696dd00a","slow_time":0.3191738504,"speedup":2.9002480077859576,"stratum":"2-4","sampling_key":"05d2ba59bb173450b208823b1400a19b7bf5f868232dfb1ebf6fe927d72efd59","slow_code":"\n\n#include <vector>\n\n#include <list>\n\n#include <map>\n\n#include <climits>\n\n#include <set>\n\n#include <unordered_set>\n\n#include <unordered_map>\n\n#include <deque>\n\n#include <stack>\n\n#include <bitset>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <cctype>\n\n#include <string>\n\n#include <cstring>\n\n#include <ctime>\n\n#include <queue>\n\n#include <random>\n\n#include <cctype>\n\n#include <complex>\n\n#include <regex>\n\n#include <unordered_map>\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef vector<bool> VB;\n\ntypedef vector<char> VC;\n\ntypedef vector<double> VD;\n\ntypedef vector<string> VS;\n\ntypedef vector<LL> VLL;\n\ntypedef vector<VI> VVI;\n\ntypedef vector<VB> VVB;\n\ntypedef vector<VS> VVS;\n\ntypedef vector<VLL> VVLL;\n\ntypedef vector<VVI> VVVI;\n\ntypedef vector<VVVI> VVVVI;\n\ntypedef vector<VVLL> VVVLL;\n\ntypedef pair<int, int> PII;\n\ntypedef pair<LL, LL> PLL;\n\ntypedef pair<int, string> PIS;\n\ntypedef pair<string, int> PSI;\n\ntypedef pair<string, string> PSS;\n\ntypedef vector<PII> VPII;\n\ntypedef vector<PLL> VPLL;\n\ntypedef vector<VPII> VVPII;\n\ntypedef vector<VPLL> VVPLL;\n\ntypedef vector<VS> VVS;\n\ntypedef map<int, int> MII;\n\ntypedef map<LL, LL> MLL;\n\ntypedef map<string, int> MSI;\n\ntypedef map<int, string> MIS;\n\ntypedef __int128 Lint;\n\ninline int toInt(string s) {\n\n  int v;\n\n  istringstream sin(s);\n\n  sin >> v;\n\n  return v;\n}\n\ninline LL toLongLong(string s) {\n\n  LL v;\n\n  istringstream sin(s);\n\n  sin >> v;\n\n  return v;\n}\n\nLint toLint(const string s) {\n\n  Lint ret = 0;\n\n  for (int i = 0; i < s.length(); i++)\n\n    if ('0' <= s[i] && s[i] <= '9')\n\n      ret = 10 * ret + s[i] - '0';\n\n  return ret;\n}\n\ntemplate <class T>\n\ninline string toString(T x) {\n\n  ostringstream sout;\n\n  sout << x;\n\n  return sout.str();\n}\n\ninline VC toVC(string s) {\n\n  VC data(s.begin(), s.end());\n\n  return data;\n}\n\nvector<string> SPRIT(const string &s, const string &delim) {\n\n  vector<string> result;\n\n  string::size_type pos = 0;\n\n  while (pos != string::npos) {\n\n    string::size_type p = s.find(delim, pos);\n\n    if (p == string::npos) {\n\n      result.push_back(s.substr(pos));\n\n      break;\n\n    } else {\n\n      result.push_back(s.substr(pos, p - pos));\n    }\n\n    pos = p + delim.size();\n  }\n\n  return result;\n}\n\nstring TRIM(const string &str, const char *trimCharacterList = \" \\t\\v\\r\\n\") {\n\n  string result;\n\n  string::size_type left = str.find_first_not_of(trimCharacterList);\n\n  if (left != string::npos) {\n\n    string::size_type right = str.find_last_not_of(trimCharacterList);\n\n    result = str.substr(left, right - left + 1);\n  }\n\n  return result;\n}\n\nstring REPLACE_STRING(const string source, const string find, const string alt) {\n\n  string result = source;\n\n  string::size_type pos = 0;\n\n  while (pos = result.find(find, pos), pos != string::npos) {\n\n    result.replace(pos, find.length(), alt);\n\n    pos += alt.length();\n  }\n\n  return result;\n}\n\ntemplate <typename T>\n\nbool VECTOR_EXISTS(vector<T> vec, T data) {\n\n  auto itr = std::find(vec.begin(), vec.end(), data);\n\n  size_t index = distance(vec.begin(), itr);\n\n  if (index != vec.size())\n    return true;\n\n  else\n    return false;\n}\n\ntemplate <typename T>\n\nvoid VECTOR_REMOVE_VALUE_ALL(vector<T> &vec, T data) {\n\n  vec.erase(remove(vec.begin(), vec.end(), data), vec.end());\n}\n\ntemplate <typename T>\n\nvector<T> VECTOR_REMOVE_VALUE_ALL_FAST(vector<T> vec, T data) {\n\n  vector<T> vec2;\n\n  for (auto &x : vec)\n    if (x != data)\n      vec2.push_back(x);\n\n  return vec2;\n}\n\nbool REG_MATCH(string const &text, regex const &re) {\n\n  bool result = regex_match(text, re);\n\n  return result;\n}\n\nbool REG_MATCH(string const &text, smatch &match, regex const &re) {\n\n  bool result = regex_match(text, match, re);\n\n  return result;\n}\n\nsmatch REG_SEARCH(string const &text, regex const &re) {\n\n  smatch m;\n\n  regex_search(text, m, re);\n\n  return m;\n}\n\nvector<smatch> REG_ALL_SEARCH(string const &text, regex const &re) {\n\n  vector<smatch> matchs;\n\n  sregex_iterator iter(text.cbegin(), text.cend(), re);\n\n  sregex_iterator end;\n\n  for (; iter != end; iter++)\n    matchs.push_back(*iter);\n\n  return matchs;\n}\n\nstring REG_REPLACE(string const &text, regex const &re, string const &replace) {\n\n  string result = regex_replace(text, re, replace, regex_constants::format_first_only);\n\n  return result;\n}\n\nstring REG_ALL_REPLACE(string const &text, regex const &re, string const &replace) {\n\n  string result = regex_replace(text, re, replace);\n\n  return result;\n}\n\ntemplate <typename T>\n\nvector<T> COMPRESS(vector<T> v) {\n\n  sort(v.begin(), v.end());\n\n  v.erase(unique(v.begin(), v.end()), v.end());\n\n  return v;\n}\n\ntemplate <typename T>\n\npair<map<T, int>, map<int, T>> MAPPING(const vector<T> v) {\n\n  map<T, int> zip;\n\n  map<int, T> unzip;\n\n  for (int i = 0; i < v.size(); i++)\n    zip[v[i]] = i;\n\n  for (int i = 0; i < v.size(); i++)\n    unzip[i] = v[i];\n\n  return make_pair(zip, unzip);\n}\n\ntemplate <typename T>\n\nvector<pair<T, LL>> RUN_LENGTH(const vector<T> &v) {\n\n  vector<pair<T, LL>> ret;\n\n  int len = v.size();\n\n  for (int i = 0, j = 0; i < len; i = j) {\n\n    while (j < len && v[i] == v[j])\n      j++;\n\n    ret.push_back(make_pair(v[i], j - i));\n  }\n\n  return ret;\n}\n\ntemplate <typename T, typename U, typename V, typename W>\n\nauto operator+(const std::pair<T, U> &l, const std::pair<V, W> &r)\n    -> std::pair<decltype(l.first + r.first), decltype(l.second + r.second)> {\n\n  return {l.first + r.first, l.second + r.second};\n}\n\ntemplate <typename T, typename U, typename V, typename W>\n\nauto operator-(const std::pair<T, U> &l, const std::pair<V, W> &r)\n    -> std::pair<decltype(l.first - r.first), decltype(l.second - r.second)> {\n\n  return {l.first - r.first, l.second - r.second};\n}\n\nostream &operator<<(ostream &dest, __int128_t value) {\n\n  ostream::sentry s(dest);\n\n  if (s) {\n\n    __uint128_t tmp = value < 0 ? -value : value;\n\n    char buffer[128];\n\n    char *d = std::end(buffer);\n\n    do {\n\n      --d;\n\n      *d = \"0123456789\"[tmp % 10];\n\n      tmp /= 10;\n\n    } while (tmp != 0);\n\n    if (value < 0) {\n\n      --d;\n\n      *d = '-';\n    }\n\n    int len = std::end(buffer) - d;\n\n    if (dest.rdbuf()->sputn(d, len) != len) {\n\n      dest.setstate(ios_base::badbit);\n    }\n  }\n\n  return dest;\n}\n\n#define UPPER(s) transform((s).begin(), (s).end(), (s).begin(), ::toupper)\n\n#define LOWER(s) transform((s).begin(), (s).end(), (s).begin(), ::tolower)\n\ndouble ceil_n(double dIn, long long nLen) {\n\n  double dOut;\n\n  dOut = dIn * pow(10.0, nLen);\n\n  dOut = (double)(long long)(dOut + 0.9);\n\n  return dOut * pow(10.0, -nLen);\n}\n\ndouble floor_n(double dIn, long long nLen) {\n\n  double dOut;\n\n  dOut = dIn * pow(10.0, nLen);\n\n  dOut = (double)(long long)(dOut);\n\n  return dOut * pow(10.0, -nLen);\n}\n\ndouble round_n(double dIn, long long nLen) {\n\n  double dOut;\n\n  dOut = dIn * pow(10.0, nLen);\n\n  dOut = (double)(long long)(dOut + 0.5);\n\n  return dOut * pow(10.0, -nLen);\n}\n\nint take_a_n(LL num, int n) {\n\n  string str = toString(num);\n\n  return str[str.length() - n] - '0';\n}\n\nint bitcount32(int bits) {\n\n  bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);\n\n  bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);\n\n  bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);\n\n  bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);\n\n  return (bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff);\n}\n\nLL bitcount64(LL bits) {\n\n  bits = (bits & 0x5555555555555555) + (bits >> 1 & 0x5555555555555555);\n\n  bits = (bits & 0x3333333333333333) + (bits >> 2 & 0x3333333333333333);\n\n  bits = (bits & 0x0f0f0f0f0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f0f0f0f0f);\n\n  bits = (bits & 0x00ff00ff00ff00ff) + (bits >> 8 & 0x00ff00ff00ff00ff);\n\n  bits = (bits & 0x0000ffff0000ffff) + (bits >> 16 & 0x0000ffff0000ffff);\n\n  return (bits & 0x00000000ffffffff) + (bits >> 32 & 0x00000000ffffffff);\n}\n\n#define C_MAX(a, b) ((a) > (b) ? (a) : (b))\n\n#define C_MIN(a, b) ((a) < (b) ? (a) : (b))\n\n#define C_ABS(a, b) ((a) < (b) ? (b) - (a) : (a) - (b))\n\ntemplate <class T1, class T2>\n\ninline bool chmin(T1 &a, T2 b) {\n\n  if (a > b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <class T1, class T2>\n\ninline bool chmax(T1 &a, T2 b) {\n\n  if (a < b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define RALL(a) (a).rbegin(), (a).rend()\n\n#define SZ(a) int((a).size())\n\n#define EACH(i, arr) for (typeof((arr).begin()) i = (arr).begin(); i != (arr).end(); ++i)\n\n#define EXIST(str, e) ((str).find(e) != (str).end())\n\n#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)\n\n#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())\n\n#define B_SEARCH(arr, v) binary_search((arr).begin(), (arr).end(), v)\n\n#define SORT(c) sort((c).begin(), (c).end())\n\n#define RSORT(c) sort((c).rbegin(), (c).rend())\n\n#define REVERSE(c) reverse((c).begin(), (c).end())\n\n#define ROTATE_LEFT(arr, c) rotate((arr).begin(), (arr).begin() + (c), (arr).end())\n\n#define ROTATE_RIGHT(arr, c) rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())\n\n#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)\n\n#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)\n\n#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)\n\n#define SUMS(arr) accumulate((arr).begin(), (arr).end(), string())\n\n#define MULD(arr) accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())\n\n#define MULLL(arr) accumulate((arr).begin(), (arr).end(), 1LL, multiplies<long long>())\n\n#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)\n\n#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)\n\n#define OF_ALL(arr, func) all_of((arr).begin(), (arr).end(), (func))\n\n#define OF_NONE(arr, func) none_of((arr).begin(), (arr).end(), (func))\n\n#define OF_ANY(arr, func) any_of((arr).begin(), (arr).end(), (func))\n\n#define PB push_back\n\n#define MP make_pair\n\n#define ft first\n\n#define sd second\n\n#define GL(s) getline(cin, (s))\n\n#define INIT()                                                                                     \\\n  std::ios::sync_with_stdio(false);                                                                \\\n  std::cin.tie(0);\n\n#define OUT(d) std::cout << (d)\n\n#define OUT_L(d) std::cout << (d) << endl\n\n#define FOUT(n, data) std::cout << std::fixed << std::setprecision(n) << (data)\n\n#define FOUT_L(n, data) std::cout << std::fixed << std::setprecision(n) << (data) << \"\\n\"\n\n#define EL() printf(\"\\n\")\n\n#define SHOW_VECTOR(v)                                                                             \\\n  {                                                                                                \\\n    std::cerr << #v << \"\\t:\";                                                                      \\\n    for (const auto &xxx : v) {                                                                    \\\n      std::cerr << xxx << \" \";                                                                     \\\n    }                                                                                              \\\n    std::cerr << \"\\n\";                                                                             \\\n  }\n\n#define SHOW_MAP(v)                                                                                \\\n  {                                                                                                \\\n    std::cerr << #v << endl;                                                                       \\\n    for (const auto &xxx : v) {                                                                    \\\n      std::cerr << xxx.first << \" \" << xxx.second << \"\\n\";                                         \\\n    }                                                                                              \\\n  }\n\n#define Yes() printf(\"Yes\\n\")\n\n#define No() printf(\"No\\n\")\n\n#define YES() printf(\"YES\\n\")\n\n#define NO() printf(\"NO\\n\")\n\n#define Yay() printf(\"Yay!\\n\")\n\n#define Nnn() printf(\":(\\n\")\n\ntemplate <typename T1, typename T2>\n\nistream &operator>>(istream &in, pair<T1, T2> &p) {\n\n  in >> p.first >> p.second;\n\n  return in;\n}\n\ntemplate <typename T>\n\nistream &operator>>(istream &in, vector<T> &v) {\n\n  for (auto &x : v)\n\n    in >> x;\n\n  return in;\n}\n\nistream &operator>>(istream &in, Lint &d) {\n\n  string s;\n\n  cin >> s;\n\n  Lint tmp = 0;\n\n  for (int i = 0; i < s.length(); i++)\n    if ('0' <= s[i] && s[i] <= '9')\n      tmp = 10 * tmp + s[i] - '0';\n\n  d = tmp;\n\n  return in;\n}\n\ntemplate <typename T1, typename T2>\n\nostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {\n\n  out << \"[\" << p.first << \", \" << p.second << \"]\"\n      << \"\\n\";\n\n  return out;\n}\n\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n\n#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define RREP(i, n) for (int i = n - 1; i >= 0; i--)\n\n#define FORLL(i, a, b) for (LL i = LL(a); i < LL(b); ++i)\n\n#define RFORLL(i, a, b) for (LL i = LL(b) - 1; i >= LL(a); --i)\n\n#define REPLL(i, n) for (LL i = 0; i < LL(n); ++i)\n\n#define RREPLL(i, n) for (LL i = LL(n) - 1; i >= 0; --i)\n\n#define FOREACH(x, arr) for (auto &(x) : (arr))\n\n#define FORITER(x, arr) for (auto(x) = (arr).begin(); (x) != (arr).end(); ++(x))\n\nconst double EPS = 1e-10;\n\nconst double PI = acos(-1.0);\n\ntemplate <typename T>\n\ninline bool BETWEEN(const T aim, const T min, const T max) {\n\n  if (min <= aim && aim <= max) {\n\n    return true;\n\n  } else {\n\n    return false;\n  }\n}\n\ntemplate <typename T1, typename T2>\n\ninline bool IS_OUT(const T1 toY, const T1 toX, const T2 H, const T2 W) {\n\n  return (toY < 0 || toY >= H || toX < 0 || toX >= W);\n}\n\ntemplate <class T>\n\ninline T SQR(const T x) {\n  return x * x;\n}\n\ntemplate <class T1, class T2>\n\ninline T1 POW(const T1 x, const T2 y) {\n\n  if (!y)\n    return 1;\n\n  else if ((y & 1) == 0) {\n\n    return SQR(POW(x, y >> 1));\n\n  } else\n    return POW(x, y ^ 1) * x;\n}\n\ntemplate <typename T>\n\nconstexpr T ABS(T x) {\n\n  return x < 0 ? -x : x;\n}\n\ntemplate <class Iter>\n\nbool next_partial_permutation(Iter first, Iter middle, Iter last) {\n\n  reverse(middle, last);\n\n  return next_permutation(first, last);\n}\n\ntemplate <class Iter>\n\nbool next_combination(Iter first1, Iter last1, Iter first2,\n\n                      Iter last2) {\n\n  if ((first1 == last1) || (first2 == last2)) {\n\n    return false;\n  }\n\n  Iter m1 = last1;\n\n  Iter m2 = last2;\n\n  --m2;\n\n  while (--m1 != first1 && !(*m1 < *m2)) {\n  }\n\n  bool result = (m1 == first1) && !(*first1 < *m2);\n\n  if (!result) {\n\n    while (first2 != m2 && !(*m1 < *first2)) {\n\n      ++first2;\n    }\n\n    first1 = m1;\n\n    std::iter_swap(first1, first2);\n\n    ++first1;\n\n    ++first2;\n  }\n\n  if ((first1 != last1) && (first2 != last2)) {\n\n    m1 = last1;\n\n    m2 = first2;\n\n    while ((m1 != first1) && (m2 != last2)) {\n\n      std::iter_swap(--m1, m2);\n\n      ++m2;\n    }\n\n    std::reverse(first1, m1);\n\n    std::reverse(first1, last1);\n\n    std::reverse(m2, last2);\n\n    std::reverse(first2, last2);\n  }\n\n  return !result;\n}\n\ntemplate <typename T>\n\nconstexpr bool ODD(T x) {\n\n  return x % 2 != 0;\n}\n\ntemplate <typename T>\n\nconstexpr bool EVEN(T x) {\n\n  return x % 2 == 0;\n}\n\ntemplate <class T>\n\ninline T GCD(const T x, const T y) {\n\n  if (x < 0)\n    return GCD(-x, y);\n\n  if (y < 0)\n    return GCD(x, -y);\n\n  return (!y) ? x : GCD(y, x % y);\n}\n\ntemplate <class T>\n\ninline T LCM(const T x, const T y) {\n\n  if (x < 0)\n    return LCM(-x, y);\n\n  if (y < 0)\n    return LCM(x, -y);\n\n  return x * (y / GCD(x, y));\n}\n\ntemplate <class T>\n\ninline T EXTGCD(const T a, const T b, T &x, T &y) {\n\n  if (a < 0) {\n\n    T d = EXTGCD(-a, b, x, y);\n\n    x = -x;\n\n    return d;\n  }\n\n  if (b < 0) {\n\n    T d = EXTGCD(a, -b, x, y);\n\n    y = -y;\n\n    return d;\n  }\n\n  if (!b) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n\n  } else {\n\n    T d = EXTGCD(b, a % b, x, y);\n\n    T t = x;\n\n    x = y;\n\n    y = t - (a / b) * y;\n\n    return d;\n  }\n}\n\ntemplate <class T>\n\ninline T INV_MOD(const T a, const T m) {\n\n  T x, y;\n\n  EXTGCD(a, m, x, y);\n\n  return (x + m) % m;\n}\n\nLL POW_MOD(LL N, LL P, LL M) {\n\n  LL ret = 1;\n\n  while (P > 0) {\n\n    if (P & 1LL)\n      ret = (ret * N) % M;\n\n    N = (N * N) % M;\n\n    P >>= 1LL;\n  }\n\n  return ret;\n}\n\nLL ARITH_SUM(LL a, LL d, LL n) { return (2 * a + (n - 1) * d) * n / 2; }\n\nLL ARITH_SUM_MOD(LL a, LL d, LL n, LL MOD) {\n\n  return (2 * a + (n - 1) * d) % MOD * n % MOD * POW_MOD(2, MOD - 2, MOD) % MOD;\n}\n\ntemplate <class T>\n\ninline bool ISPRIME(const T x) {\n\n  if (x <= 1)\n    return false;\n\n  for (T i = 2; i * i <= x; i++)\n    if (x % i == 0)\n      return false;\n\n  return true;\n}\n\ntemplate <class T>\n\nVB ERATOSTHENES(const T n) {\n\n  VB arr(n + 1, true);\n\n  arr[0] = arr[1] = false;\n\n  for (T i = 2; i * i <= n; i++) {\n\n    if (arr[i]) {\n\n      for (T j = i * 2LL; j <= n; j += i) {\n\n        arr[j] = false;\n      }\n    }\n  }\n\n  return arr;\n}\n\ntemplate <typename T>\n\nVB ERATOSTHENES(const T a, const T b) {\n\n  VB small = ERATOSTHENES(b);\n\n  VB prime(b - a, true);\n\n  for (T i = 2; i * i <= b; i++) {\n\n    if (small[i]) {\n\n      for (T j = max(2LL, (a + i - 1) / i) * i; j < b; j += i) {\n\n        prime[j - a] = false;\n      }\n    }\n  }\n\n  return prime;\n}\n\ntemplate <typename T>\n\nvector<T> DIVISOR(T n) {\n\n  vector<T> v;\n\n  for (T i = 1; i * i <= n; ++i) {\n\n    if (n % i == 0) {\n\n      v.push_back(i);\n\n      if (i != n / i) {\n\n        v.push_back(n / i);\n      }\n    }\n  }\n\n  sort(v.begin(), v.end());\n\n  return v;\n}\n\ntemplate <typename T>\n\nvector<vector<T>> DIVISOR_ALL(T n) {\n\n  vector<vector<T>> res(n + 1);\n\n  for (T i = 1; i <= n; i++) {\n\n    for (T j = i; j <= n; j += i) {\n\n      res[j].push_back(i);\n    }\n  }\n\n  return res;\n}\n\ntemplate <typename T>\n\nvector<pair<T, T>> FACTORIZATION(T x) {\n\n  vector<pair<T, LL>> ans;\n\n  for (T i = 2; i * i <= x; i++) {\n\n    if (x % i == 0) {\n\n      T count = 0;\n\n      while (x % i == 0) {\n\n        count++;\n\n        x /= i;\n      }\n\n      ans.push_back(MP(i, count));\n    }\n  }\n\n  if (x != 1)\n    ans.push_back(MP(x, 1));\n\n  return ans;\n}\n\ntemplate <typename T>\n\ninline T NCR(T n, T r) {\n\n  if (r > n - r)\n    r = n - r;\n\n  T ans = 1LL;\n\n  for (T i = 0; i < r; i++) {\n\n    ans = ans * (n - i) / (i + 1);\n  }\n\n  return ans;\n}\n\nLL NCR_MOD(LL n, LL r, LL M) {\n\n  if (r > n - r)\n    return NCR_MOD(n, n - r, M);\n\n  LL numerator = 1LL;\n\n  LL denominator = 1LL;\n\n  for (LL i = 0; i < r; i++) {\n\n    numerator *= (n - i);\n\n    numerator %= M;\n\n    denominator *= (i + 1);\n\n    denominator %= M;\n  }\n\n  return numerator * POW_MOD(denominator, M - 2, M) % M;\n}\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n\n#define debug(x)                                                                                   \\\n  cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\"                                           \\\n       << \" \" << endl;\n\nconstexpr LL NORM = 9000;\n\nconstexpr LL MAX = NORM * 2;\n\nint main() {\n\n  int H, W;\n\n  cin >> H >> W;\n\n  VVI A(H, VI(W));\n\n  cin >> A;\n\n  VVI B(H, VI(W));\n\n  cin >> B;\n\n  VVI C(H, VI(W));\n\n  REP(i, H) {\n\n    REP(j, W) { C[i][j] = abs(A[i][j] - B[i][j]); }\n  }\n\n  VVVLL dp(H, VVLL(W, VLL(MAX, 0)));\n\n  dp[0][0][C[0][0] + NORM] = 1;\n\n  for (int i = 0; i < H; i++) {\n\n    for (int j = 0; j < W; j++) {\n\n      for (int k = 0; k < MAX; k++) {\n\n        if (dp[i][j][k] == 0)\n          continue;\n\n        if (i + 1 < H) {\n\n          if (k >= C[i + 1][j]) {\n\n            dp[i + 1][j][k - C[i + 1][j]] = 1;\n          }\n\n          if (k + C[i + 1][j] < MAX) {\n\n            dp[i + 1][j][k + C[i + 1][j]] = 1;\n          }\n        }\n\n        if (j + 1 < W) {\n\n          if (k >= C[i][j + 1]) {\n\n            dp[i][j + 1][k - C[i][j + 1]] = 1;\n          }\n\n          if (k + C[i][j + 1] < MAX) {\n\n            dp[i][j + 1][k + C[i][j + 1]] = 1;\n          }\n        }\n      }\n    }\n  }\n\n  LL ans = LLONG_MAX;\n\n  for (int i = 0; i < MAX; i++) {\n\n    if (dp[H - 1][W - 1][i]) {\n\n      ans = min(ans, abs(i - NORM));\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"\n\n#include <vector>\n\n#include <list>\n\n#include <map>\n\n#include <unordered_map>\n\n#include <climits>\n\n#include <set>\n\n#include <unordered_set>\n\n#include <deque>\n\n#include <stack>\n\n#include <bitset>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <cctype>\n\n#include <string>\n\n#include <cstring>\n\n#include <ctime>\n\n#include <queue>\n\n#include <random>\n\n#include <chrono>\n\n#include <complex>\n\n#include <regex>\n\n#include <locale>\n\n#include <random>\n\n#include <cassert>\n\n#include <type_traits>\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef vector<bool> VB;\n\ntypedef vector<char> VC;\n\ntypedef vector<double> VD;\n\ntypedef vector<string> VS;\n\ntypedef vector<LL> VLL;\n\ntypedef vector<VI> VVI;\n\ntypedef vector<VB> VVB;\n\ntypedef vector<VS> VVS;\n\ntypedef vector<VLL> VVLL;\n\ntypedef vector<VVI> VVVI;\n\ntypedef vector<VVLL> VVVLL;\n\ntypedef pair<int, int> PII;\n\ntypedef pair<LL, LL> PLL;\n\ntypedef pair<int, string> PIS;\n\ntypedef pair<string, int> PSI;\n\ntypedef pair<string, string> PSS;\n\ntypedef vector<PII> VPII;\n\ntypedef vector<PLL> VPLL;\n\ntypedef vector<VPII> VVPII;\n\ntypedef vector<VPLL> VVPLL;\n\ntypedef vector<VS> VVS;\n\ntypedef map<int, int> MII;\n\ntypedef map<LL, LL> MLL;\n\ntypedef map<string, int> MSI;\n\ntypedef map<int, string> MIS;\n\ninline int toInt(string s) {\n\n  int v;\n\n  istringstream sin(s);\n\n  sin >> v;\n\n  return v;\n}\n\ninline LL toLongLong(string s) {\n\n  LL v;\n\n  istringstream sin(s);\n\n  sin >> v;\n\n  return v;\n}\n\ntemplate <class T>\n\ninline string toString(T x) {\n\n  ostringstream sout;\n\n  sout << x;\n\n  return sout.str();\n}\n\ninline VC toVC(string s) {\n\n  VC data(s.begin(), s.end());\n\n  return data;\n}\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define SZ(a) int((a).size())\n\n#define EACH(i, arr) for (typeof((arr).begin()) i = (arr).begin(); i != (arr).end(); ++i)\n\n#define EXIST(str, e) ((str).find(e) != (str).end())\n\n#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)\n\n#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())\n\n#define SORT(c) sort((c).begin(), (c).end())\n\n#define RSORT(c) sort((c).rbegin(), (c).rend())\n\n#define REVERSE(c) reverse((c).begin(), (c).end())\n\n#define ROTATE_LEFT(arr, c) rotate((arr).begin(), (arr).begin() + (c), (arr).end())\n\n#define ROTATE_RIGHT(arr, c) rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())\n\n#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)\n\n#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)\n\n#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)\n\n#define SUMS(arr) accumulate((arr).begin(), (arr).end(), string())\n\n#define MULD(arr) accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())\n\n#define MULLL(arr) accumulate((arr).begin(), (arr).end(), 1LL, multiplies<long long>())\n\n#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)\n\n#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)\n\n#define OF_ALL(arr, func) all_of((arr).begin(), (arr).end(), (func))\n\n#define OF_NONE(arr, func) none_of((arr).begin(), (arr).end(), (func))\n\n#define OF_ANY(arr, func) any_of((arr).begin(), (arr).end(), (func))\n\n#define PB push_back\n\n#define MP make_pair\n\n#define ft first\n\n#define sd second\n\n#define GL(s) getline(cin, (s))\n\n#define INIT()                                                                                     \\\n  std::ios::sync_with_stdio(false);                                                                \\\n  std::cin.tie(0)\n\n#define OUT(d) std::cout << (d)\n\n#define OUT_L(d) std::cout << (d) << endl\n\n#define FOUT(n, data) std::cout << std::fixed << std::setprecision(n) << (data)\n\n#define FOUT_L(n, data) std::cout << std::fixed << std::setprecision(n) << (data) << \"\\n\"\n\n#define EL() printf(\"\\n\")\n\n#define SHOW_VECTOR(v)                                                                             \\\n  {                                                                                                \\\n    std::cerr << #v << \"\\t:\";                                                                      \\\n    for (const auto &xxx : v) {                                                                    \\\n      std::cerr << xxx << \" \";                                                                     \\\n    }                                                                                              \\\n    std::cerr << \"\\n\";                                                                             \\\n  }\n\n#define SHOW_MAP(v)                                                                                \\\n  {                                                                                                \\\n    std::cerr << #v << endl;                                                                       \\\n    for (const auto &xxx : v) {                                                                    \\\n      std::cerr << xxx.first << \" \" << xxx.second << \"\\n\";                                         \\\n    }                                                                                              \\\n  }\n\n#define Yes() printf(\"Yes\\n\")\n\n#define No() printf(\"No\\n\")\n\n#define YES() printf(\"YES\\n\")\n\n#define NO() printf(\"NO\\n\")\n\n#define Yay() printf(\"Yay!\\n\")\n\n#define Nnn() printf(\":(\\n\")\n\ntemplate <typename T1, typename T2>\n\nistream &operator>>(istream &in, pair<T1, T2> &p) {\n\n  in >> p.first >> p.second;\n\n  return in;\n}\n\ntemplate <typename T>\n\nistream &operator>>(istream &in, vector<T> &v) {\n\n  for (auto &x : v)\n\n    in >> x;\n\n  return in;\n}\n\ntemplate <typename T1, typename T2>\n\nostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {\n\n  out << \"[\" << p.first << \", \" << p.second << \"]\"\n      << \"\\n\";\n\n  return out;\n}\n\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n\n#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define RREP(i, n) for (int i = n - 1; i >= 0; i--)\n\n#define FORLL(i, a, b) for (LL i = LL(a); i < LL(b); ++i)\n\n#define RFORLL(i, a, b) for (LL i = LL(b) - 1; i >= LL(a); --i)\n\n#define REPLL(i, n) for (LL i = 0; i < LL(n); ++i)\n\n#define RREPLL(i, n) for (LL i = LL(n) - 1; i >= 0; --i)\n\n#define FOREACH(x, arr) for (auto &(x) : (arr))\n\n#define FORITER(x, arr) for (auto(x) = (arr).begin(); (x) != (arr).end(); ++(x))\n\ntemplate <class T>\n\nvoid chmin(T &a, const T b) {\n  a = min(a, b);\n}\n\ntemplate <class T>\n\nvoid chmax(T &a, const T b) {\n  a = max(a, b);\n}\n\nconstexpr int MAX = 13000;\n\nconstexpr int HF = MAX / 2;\n\nint main() {\n\n  int H, W;\n\n  cin >> H >> W;\n\n  vector<vector<int>> A(H, vector<int>(W));\n\n  vector<vector<int>> B(H, vector<int>(W));\n\n  for (int i = 0; i < H; i++)\n    for (int j = 0; j < W; j++)\n      cin >> A[i][j];\n\n  for (int i = 0; i < H; i++)\n    for (int j = 0; j < W; j++)\n      cin >> B[i][j];\n\n  vector<vector<int>> C(H, vector<int>(W));\n\n  for (int i = 0; i < H; i++)\n    for (int j = 0; j < W; j++)\n      C[i][j] = abs(A[i][j] - B[i][j]);\n\n  vector<vector<bitset<MAX>>> dp(H, vector<bitset<MAX>>(W));\n\n  dp[0][0][HF + C[0][0]] = true;\n\n  for (int i = 0; i < H; i++) {\n\n    for (int j = 0; j < W; j++) {\n\n      if (i)\n        dp[i][j] |= dp[i - 1][j] >> C[i][j];\n\n      if (i)\n        dp[i][j] |= dp[i - 1][j] << C[i][j];\n\n      if (j)\n        dp[i][j] |= dp[i][j - 1] >> C[i][j];\n\n      if (j)\n        dp[i][j] |= dp[i][j - 1] << C[i][j];\n    }\n  }\n\n  int ans = INT_MAX;\n\n  for (int i = 0; i < MAX; i++) {\n\n    if (dp[H - 1][W - 1][i]) {\n\n      chmin(ans, abs(HF - i));\n    }\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"df9eb0a19b9073743918e6ba770edd3c3daeb62fc806e34d1320d8432ab799c8","fast_id":"84e94f171b16fd956f9719009e25844b44b054659df1f3dc1a2e83207a8f158c","fast_time":0.0002514523,"language":"cpp","measured_fast_code_id":"84e94f171b16fd956f9719009e25844b44b054659df1f3dc1a2e83207a8f158c","measured_slow_code_id":"706843c87ee05cdfb0f3435d02389630895d4887d02e5f45dfce2a7ff6fcf420","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49469","problem_id":"p02245","slow_code_id":"52aedcaac05d7fae1e27ebbb80602dab13b2da23b3472c54e66f9a416f422963","slow_id":"706843c87ee05cdfb0f3435d02389630895d4887d02e5f45dfce2a7ff6fcf420","slow_time":0.0026627816,"speedup":10.589609241991425,"stratum":"8+","sampling_key":"b5bd854fb8fbf9c5128502abf3160cd18a66c66dc51aa33756727f5831696b07","slow_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\nusing namespace std;\n\n#include <map>\n\n#include <queue>\n\n#define Max 9\n\nint gg[Max] = {1, 2, 3, 4, 5, 6, 7, 8, 0}, s[Max];\n\nint ff[4][2] = {0, -1, 1, 0, 0, 1, -1, 0};\n\nint sum;\n\nstruct node\n\n{\n\n  int a[Max];\n\n  int step;\n};\n\nmap<int, int> m;\n\nint bfs()\n\n{\n\n  node tt;\n\n  memcpy(tt.a, s, sizeof(s));\n\n  tt.step = 0;\n\n  queue<node> q;\n\n  q.push(tt);\n\n  while (!q.empty())\n\n  {\n\n    node star = q.front();\n\n    q.pop();\n\n    int i;\n\n    for (i = 0; i < 9; i++)\n\n      if (star.a[i] == 0)\n\n        break;\n\n    int y = i / 3;\n\n    int x = i % 3;\n\n    for (i = 0; i < 4; i++)\n\n    {\n\n      int tx = x + ff[i][0];\n\n      int ty = y + ff[i][1];\n\n      if (tx >= 0 && ty >= 0 && ty < 3 && tx < 3)\n\n      {\n\n        node end;\n\n        memcpy(end.a, star.a, sizeof(star.a));\n\n        int k = ty * 3 + tx;\n\n        swap(end.a[k], end.a[y * 3 + x]);\n\n        int sum1 = 0;\n\n        for (int j = 0; j < 9; j++)\n\n          sum1 = sum1 * 10 + end.a[j];\n\n        if (!m[sum1])\n\n        {\n\n          m[sum1] = sum++;\n\n          end.step = star.step + 1;\n\n          if (memcmp(end.a, gg, sizeof(gg)) == 0)\n\n            return end.step;\n\n          q.push(end);\n        }\n      }\n    }\n  }\n}\n\nint main()\n\n{\n\n  int i, j;\n\n  while (~scanf(\"%d\", &s[0]))\n\n  {\n\n    m.clear();\n\n    int k = s[0];\n\n    sum = 1;\n\n    for (i = 1; i < 9; i++)\n\n    {\n\n      scanf(\"%d\", &s[i]);\n\n      k = k * 10 + s[i];\n    }\n\n    m[k] = sum++;\n\n    if (memcmp(s, gg, sizeof(gg)) == 0)\n\n      printf(\"0\\n\");\n\n    else\n      printf(\"%d\\n\", bfs());\n  }\n\n  return 0;\n}\n","fast_code":"\n\n#include <stdio.h>\n\n#include <string.h>\n\n#include <math.h>\n\nint Map[4][4];\n\nint max1, min1;\n\nint start_x, start_y;\n\nint flag;\n\nint c[4][2] = {0, 1, -1, 0, 1, 0, 0, -1};\n\nint HMD()\n\n{\n\n  int i, j, num = 0;\n\n  for (i = 0; i < 3; i++)\n\n    for (j = 0; j < 3; j++)\n\n      if (Map[i][j] == 0)\n\n        continue;\n\n      else\n\n        num += fabs((Map[i][j] - 1) / 3 - i) + fabs((Map[i][j] - 1) % 3 - j);\n\n  return num;\n}\n\nvoid start_xyz()\n\n{\n\n  int i, j;\n\n  for (i = 0; i < 3; i++)\n\n    for (j = 0; j < 3; j++)\n\n      if (Map[i][j] == 0)\n\n      {\n\n        start_x = i;\n\n        start_y = j;\n\n        return;\n      }\n}\n\nvoid swap(int *a, int *b)\n\n{\n\n  int t;\n\n  t = *a;\n\n  *a = *b;\n\n  *b = t;\n}\n\nvoid dfs(int x, int y, int s, int last_step)\n\n{\n\n  if (flag)\n\n    return;\n\n  if (s == max1)\n\n  {\n\n    int l = HMD();\n\n    if (l == 0)\n\n    {\n\n      min1 = s;\n\n      flag = 1;\n    }\n\n    return;\n  }\n\n  for (int i = 0; i < 4; i++)\n\n  {\n\n    if (last_step + i == 3 && s > 0)\n\n      continue;\n\n    int dx = x + c[i][0];\n\n    int dy = y + c[i][1];\n\n    if (dx < 0 || dy < 0 || dx >= 3 || dy >= 3)\n\n      continue;\n\n    swap(&Map[dx][dy], &Map[x][y]);\n\n    if (HMD() + s <= max1 && !flag)\n\n    {\n\n      dfs(dx, dy, s + 1, i);\n\n      if (flag)\n\n        return;\n    }\n\n    swap(&Map[dx][dy], &Map[x][y]);\n  }\n}\n\nint main()\n\n{\n\n  char a[10];\n\n  int i, j;\n\n  for (i = 0; i < 3; i++)\n\n    for (j = 0; j < 3; j++)\n\n      scanf(\"%d\", &Map[i][j]);\n\n  start_xyz();\n\n  max1 = HMD();\n\n  flag = 0;\n\n  while (!flag)\n\n  {\n\n    dfs(start_x, start_y, 0, 0);\n\n    if (!flag)\n\n      max1++;\n  }\n\n  printf(\"%d\\n\", min1);\n\n  return 0;\n}\n"}
{"fast_code_id":"71fbe2bb44bb4ba54dac89667a4fd151f47e1e171ee26edccbd9204ee84daf3a","fast_id":"be67fcddb02ae73e5dbd45e9c88aaa3e98fc15216038b844cbc277870677c9e7","fast_time":0.0678259519,"language":"cpp","measured_fast_code_id":"be67fcddb02ae73e5dbd45e9c88aaa3e98fc15216038b844cbc277870677c9e7","measured_slow_code_id":"aa89b04f93bf0015b287e204b12310990ca8d2dfe6c0ba8fcf798804c207d183","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49512","problem_id":"p02364","slow_code_id":"1756e0907ba523975f89ba22862777d3715a0b086a27dfa86804b1feaf50b1b5","slow_id":"aa89b04f93bf0015b287e204b12310990ca8d2dfe6c0ba8fcf798804c207d183","slow_time":0.1458062166,"speedup":2.1497113201591502,"stratum":"2-4","sampling_key":"09469cde700e363c5db2f5604dd8db65bab152a9070316d54a91744fdfaf7845","slow_code":"#include <stdio.h>\n\n#include <algorithm>\n\n#include <iostream>\n\nusing namespace std;\n\nint fa[100010];\n\nint n, m;\n\nstruct edge {\n\n  int x, y, w;\n\n  edge(int x = 0, int y = 0, int w = 0) : x(x), y(y), w(w) {}\n\n} a[100010];\n\nint getfa(int x) {\n\n  if (x == fa[x])\n    return x;\n\n  else\n    return getfa(fa[x]);\n}\n\nbool cmp(edge a, edge b) { return a.w < b.w; }\n\nint f() {\n\n  int ans = 0;\n\n  sort(a, a + m, cmp);\n\n  int cnt = n;\n\n  for (int i = 0; i < n; i++)\n    fa[i] = i;\n\n  for (int i = 0; i < m; i++) {\n\n    int f1 = getfa(a[i].x),\n\n        f2 = getfa(a[i].y);\n\n    if (f1 != f2) {\n\n      ans += a[i].w;\n\n      cnt--;\n\n      fa[f1] = f2;\n\n      if (cnt == 1)\n        break;\n    }\n  }\n\n  return ans;\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 0; i < m; i++) {\n\n    scanf(\"%d%d%d\", &a[i].x, &a[i].y, &a[i].w);\n  }\n\n  printf(\"%d\\n\", f());\n\n  return 0;\n}\n","fast_code":"#define _CRT_SECURE_NO_WARNINGS\n\n#include \"bits/stdc++.h\"\n\n#define PB push_back\n\n#define PF push_front\n\n#define LB lower_bound\n\n#define UB upper_bound\n\n#define fr(x) freopen(x, \"r\", stdin)\n\n#define fw(x) freopen(x, \"w\", stdout)\n\n#define iout(x) printf(\"%d\\n\", x)\n\n#define lout(x) printf(\"%lld\\n\", x)\n\n#define REP(x, l, u) for (ll x = l; x < u; x++)\n\n#define RREP(x, l, u) for (ll x = l; x >= u; x--)\n\n#define complete_unique(a) a.erase(unique(a.begin(), a.end()), a.end())\n\n#define mst(x, a) memset(x, a, sizeof(x))\n\n#define all(a) a.begin(), a.end()\n\n#define PII pair<int, int>\n\n#define PLL pair<ll, ll>\n\n#define MP make_pair\n\n#define sqr(x) ((x) * (x))\n\n#define lowbit(x) ((x) & (-(x)))\n\n#define lson (ind << 1)\n\n#define rson (ind << 1 | 1)\n\n#define se second\n\n#define fi first\n\n#define sz(x) ((int)x.size())\n\n#define EX0 exit(0);\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef double db;\n\ntypedef long double ld;\n\nusing namespace std;\n\ntypedef vector<ll> VLL;\n\ntypedef vector<int> VI;\n\nconst int block_size = 320;\n\ntypedef complex<ll> point;\n\nconst ll mod = 1e9 + 7;\n\nconst ll inf = 1e9 + 7;\n\nconst ld eps = 1e-9;\n\nconst db PI = atan(1) * 4;\n\ntemplate <typename T, typename S> inline bool upmin(T &a, const S &b) {\n  return a > b ? a = b, 1 : 0;\n}\n\ntemplate <typename T, typename S> inline bool upmax(T &a, const S &b) {\n  return a < b ? a = b, 1 : 0;\n}\n\nll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }\n\nll pow(ll a, ll b) {\n\n  if (b == 0) {\n\n    return 1;\n  }\n\n  if (b == 1) {\n\n    return a;\n  }\n\n  ll ans = pow(a, b / 2);\n\n  ans *= ans;\n\n  ans *= b % 2 == 1 ? a : 1;\n\n  return ans;\n}\n\nnamespace SOLVE {\n\nstruct edge {\n\n  ll v1, v2, weight;\n};\n\nVI id;\n\nll parent(ll a) {\n\n  if (id[a] == a) {\n\n    return a;\n  }\n\n  id[a] = parent(id[a]);\n\n  return id[a];\n}\n\nvoid unite(ll a, ll b) { id[parent(a)] = parent(b); }\n\nint query(ll a, ll b) { return (parent(a) == parent(b)); }\n\nbool comp(edge a, edge b) { return a.weight < b.weight; }\n\nvoid main() {\n\n  ll V, E, a, b, c;\n\n  cin >> V >> E;\n\n  vector<edge> edges;\n\n  REP(i, 0, E) {\n\n    cin >> a >> b >> c;\n\n    edge x;\n\n    x.v1 = a;\n\n    x.v2 = b;\n\n    x.weight = c;\n\n    edges.push_back(x);\n  }\n\n  sort(edges.begin(), edges.end(), comp);\n\n  id.resize(V);\n\n  REP(i, 0, V) { id[i] = i; }\n\n  ll ans = 0;\n\n  for (int i = 0; i < E; i++) {\n\n    const edge &e = edges[i];\n\n    if (!query(e.v1, e.v2)) {\n\n      unite(e.v1, e.v2);\n\n      ans += e.weight;\n    }\n  }\n\n  cout << ans << endl;\n}\n\n}                   \n\nsigned main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  int t;\n\n  t = 1;\n\n  while (t--) {\n\n    SOLVE::main();\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"7618d6b85823e79e8ab71e6be8634d03ed515d6ae448a7ee88040a167960a378","fast_id":"fb0f04cf89ea6f3074240a4198addbec5a288b97fa9682e62eba1c9c49ab7733","fast_time":0.0196395448,"language":"cpp","measured_fast_code_id":"fb0f04cf89ea6f3074240a4198addbec5a288b97fa9682e62eba1c9c49ab7733","measured_slow_code_id":"08b50d80b5c1888a32e92a47e6c2591e0a35a2024717e5d0ba4bc1c8066136fa","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49543","problem_id":"p02999","slow_code_id":"ed93b4aa0f4d25dcba7965b5e9d5227b9b342f53e18fb25f21cf357c34370d96","slow_id":"08b50d80b5c1888a32e92a47e6c2591e0a35a2024717e5d0ba4bc1c8066136fa","slow_time":0.1053103,"speedup":5.362155847929836,"stratum":"4-8","sampling_key":"1575ca29d0a883e1acf9e30199b3ff368392bcb1304d2a948c42762ae2d44b94","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int x, n;\n\n  cin >> x >> n;\n\n  if (x < n) {\n\n    cout << 0;\n\n  } else {\n\n    cout << 10;\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int x, a;\n\n  scanf(\"%d%d\", &x, &a);\n\n  if (x < a) {\n    printf(\"0\");\n  }\n\n  else {\n    printf(\"10\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"7603a52c2c19a8d2d6bdabbffaf0147eb24629b666dbbe14a30bba4ba8f29873","fast_id":"505cf33aa5b4707e546dedfcad33d5c30d73da9d907001ff1a10f00c5da0be22","fast_time":0.0688932885,"language":"cpp","measured_fast_code_id":"505cf33aa5b4707e546dedfcad33d5c30d73da9d907001ff1a10f00c5da0be22","measured_slow_code_id":"0115ad7bad3773eeb5e76d62a775de01fa52aeb766b961372249e8a5913227e2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49547","problem_id":"p01062","slow_code_id":"e42950ccfee76a5028674376894854eeee03ab10be2d24f2c201131a5e12716a","slow_id":"0115ad7bad3773eeb5e76d62a775de01fa52aeb766b961372249e8a5913227e2","slow_time":0.8553726413,"speedup":12.415906685888569,"stratum":"8+","sampling_key":"1785d9e12f4f024868d98e59b9366869ccd7c19fb281ed5161d249bee4bc4584","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <cmath>\n\n#include <complex>\n\nusing namespace std;\n\nusing ll = long long;\n\nconst int MN = 200200;\n\nvector<int> g[MN];\n\nint sz[MN], rt[MN];\n\nvoid dfs(int p, int b) {\n\n  sz[p] = 1;\n\n  rt[p] = b;\n\n  for (int d : g[p]) {\n\n    if (d == b)\n      continue;\n\n    dfs(d, p);\n\n    sz[p] += sz[d];\n  }\n}\n\nvector<int> g2[MN];\n\nbool ispath(int s) {\n\n  if (g2[s].size() >= 2)\n    return false;\n\n  if (g2[s].size() == 0)\n    return true;\n\n  int b = -1;\n\n  int p = s;\n\n  while (true) {\n\n    for (int d : g2[p]) {\n\n      if (d == b)\n        continue;\n\n      b = p;\n\n      p = d;\n\n      break;\n    }\n\n    if (g2[p].size() == 1)\n      return true;\n\n    if (g2[p].size() > 2)\n      return false;\n  }\n}\n\nbool solve() {\n\n  int n, u, v;\n\n  cin >> n >> u >> v;\n  u--;\n  v--;\n\n  if (n % 2)\n    return false;\n\n  static int A[MN], B[MN];\n\n  for (int i = 1; i < n; i++) {\n\n    int a, b;\n\n    cin >> a >> b;\n    a--;\n    b--;\n\n    A[i] = a;\n    B[i] = b;\n\n    g[a].push_back(b);\n\n    g[b].push_back(a);\n  }\n\n  dfs(u, -1);\n\n  int st = v;\n\n  while (true) {\n\n    if (sz[st] > n / 2) {\n\n      return false;\n    }\n\n    if (sz[st] == n / 2) {\n\n      break;\n    }\n\n    st = rt[st];\n  }\n\n  for (int i = 1; i < n; i++) {\n\n    int a = A[i], b = B[i];\n\n    if (rt[b] == a)\n      swap(a, b);\n\n    if (a == st)\n      continue;\n\n    g2[a].push_back(b);\n\n    g2[b].push_back(a);\n  }\n\n  return (ispath(u) && ispath(v));\n}\n\nint main2() {\n\n  if (solve()) {\n\n    printf(\"Yes\\n\");\n\n  } else {\n\n    printf(\"No\\n\");\n  }\n\n  return 0;\n}\n\nint main() {\n\n  static ll eord, enew;\n\n  const int sz = 256 * 1024 * 1024;\n\n  static unsigned char *p = (unsigned char *)malloc(sz);\n\n  enew = ((ll)(p + sz - 1) & ~0xff);\n\n  __asm__ volatile(\"mov %%rsp, %0\" : \"=r\"(eord));\n\n  __asm__ volatile(\"mov %0, %%rsp\" : : \"r\"(enew));\n\n  main2();\n\n  __asm__ volatile(\"mov %0, %%rsp\" : : \"r\"(eord));\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <stack>\n\n#include <queue>\n\n#include <deque>\n\n#include <vector>\n\n#include <string>\n\n#include <string.h>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <cmath>\n\n#include <map>\n\n#include <set>\n\n#include <iostream>\n\n#include <sstream>\n\n#include <numeric>\n\n#include <cctype>\n\n#include <bitset>\n\n#include <cassert>\n\n#define fi first\n\n#define se second\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\n#define rrep(i, n) for (int i = 1; i <= (n); ++i)\n\n#define drep(i, n) for (int i = (n) - 1; i >= 0; --i)\n\n#define gep(i, g, j) for (int i = g.head[j]; i != -1; i = g.e[i].next)\n\n#define each(it, c)                                                            \\\n  for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)\n\n#define rng(a) a.begin(), a.end()\n\n#define maxs(x, y) x = max(x, y)\n\n#define mins(x, y) x = min(x, y)\n\n#define pb push_back\n\n#define sz(x) (int)(x).size()\n\n#define pcnt __builtin_popcount\n\n#define snuke srand((unsigned)clock() + (unsigned)time(NULL));\n\n#define df(x) int x = in()\n\n#define dame                                                                   \\\n  {                                                                            \\\n    puts(\"No\");                                                                \\\n    return 0;                                                                  \\\n  }\n\n#define BEGIN_STACK_EXTEND(size)                                               \\\n  void *stack_extend_memory_ = malloc(size);                                   \\\n  void *stack_extend_origin_memory_;                                           \\\n  char *stack_extend_dummy_memory_ = (char *)alloca(                           \\\n      (1 + (int)(((long long)stack_extend_memory_) & 127)) * 16);              \\\n  *stack_extend_dummy_memory_ = 0;                                             \\\n  asm volatile(\"mov %%rsp, %%rbx\\nmov %%rax, %%rsp\"                            \\\n               : \"=b\"(stack_extend_origin_memory_)                             \\\n               : \"a\"((char *)stack_extend_memory_ + (size) - 1024));\n\n#define END_STACK_EXTEND                                                       \\\n  asm volatile(\"mov %%rax, %%rsp\" ::\"a\"(stack_extend_origin_memory_));         \\\n  free(stack_extend_memory_);\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<int, int> P;\n\ntypedef vector<int> vi;\n\ntypedef vector<vi> vvi;\n\ntypedef vector<ll> vl;\n\ntypedef vector<P> vp;\n\ninline int in() {\n  int x;\n  scanf(\"%d\", &x);\n  return x;\n}\n\ninline void priv(vi a) {\n  rep(i, sz(a)) printf(\"%d%c\", a[i], i == sz(a) - 1 ? '\\n' : ' ');\n}\n\ntemplate <typename T>\nistream &operator>>(istream &i, vector<T> &v)\n\n{\n  for (T &x : v)\n    i >> x;\n  return i;\n}\n\ntemplate <typename T>\nstring join(vector<T> &v)\n\n{\n  stringstream s;\n  for (T &x : v)\n    s << ' ' << x;\n  return s.str().substr(1);\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &o, vector<T> &v)\n\n{\n  if (sz(v))\n    o << join(v);\n  return o;\n}\n\nconst int MX = 100005, INF = 1001001001;\n\nconst ll LINF = 1e18;\n\nconst double eps = 1e-10;\n\nint n;\n\nint s, t;\n\nvvi to;\n\nP e;\n\nint dfs(int v, int p = -1) {\n\n  int res = 1;\n\n  for (int u : to[v])\n    if (u != p) {\n\n      res += dfs(u, v);\n    }\n\n  if (res * 2 == n)\n    e = P(v, p);\n\n  return res;\n}\n\nbool ok;\n\nvi vs;\n\nvoid efs(int v, int p) {\n\n  vs.pb(v);\n\n  int cnt = 0;\n\n  for (int u : to[v])\n    if (u != p) {\n\n      cnt++;\n\n      efs(u, v);\n    }\n\n  if (cnt > 1)\n    ok = false;\n}\n\nbool f(int v, int p) {\n\n  int cnt = 0;\n\n  vi a;\n\n  for (int u : to[v])\n    if (u != p) {\n\n      cnt++;\n\n      if (cnt > 2)\n        return false;\n\n      ok = true;\n      vs = vi();\n\n      efs(u, v);\n\n      if (!ok)\n        return false;\n\n      reverse(rng(a));\n\n      if (cnt == 1)\n        a.pb(v);\n\n      a.insert(a.end(), rng(vs));\n    }\n\n  if (sz(a) == 0)\n    return false;\n\n  if (a[0] == s || a[0] == t)\n    return true;\n\n  if (a.back() == s || a.back() == t)\n    return true;\n\n  return false;\n}\n\nint main() {\n\n  BEGIN_STACK_EXTEND(60 * 1024 * 1024);\n\n  scanf(\"%d%d%d\", &n, &s, &t);\n\n  --s;\n  --t;\n\n  to = vvi(n);\n\n  rep(i, n - 1) {\n\n    int a, b;\n\n    scanf(\"%d%d\", &a, &b);\n\n    --a;\n    --b;\n\n    to[a].pb(b);\n\n    to[b].pb(a);\n  }\n\n  dfs(0);\n\n  if (e == P(0, 0))\n    dame;\n\n  if (!f(e.fi, e.se) || !f(e.se, e.fi))\n    dame;\n\n  puts(\"Yes\");\n\n  END_STACK_EXTEND;\n\n  return 0;\n}"}
{"fast_code_id":"a70a09b63bf42d2d0a18d071bc3db39c11dce94ce706f64d9accac448c64410d","fast_id":"22d04ff96832efeef4650407f5aff9e117a8b5931a3c2b998287c5e6d27218af","fast_time":0.0464972005,"language":"cpp","measured_fast_code_id":"22d04ff96832efeef4650407f5aff9e117a8b5931a3c2b998287c5e6d27218af","measured_slow_code_id":"98352d1f8e44917c41485ad9c36be03a397ebde38f697bed782cb1becdd41881","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49560","problem_id":"p02366","slow_code_id":"c59883e45180781708606af03fefd6eb53dcc549bdcb96ba4e4784ae438005e8","slow_id":"98352d1f8e44917c41485ad9c36be03a397ebde38f697bed782cb1becdd41881","slow_time":0.1815358202,"speedup":3.904231184843053,"stratum":"2-4","sampling_key":"0345e0c12fc9ee02a18ba10e141c6125d9c7e092f0f2aa3533a039dfc7a504db","slow_code":"\n\n#include <iostream>\n\n#include <vector>\n\n#include <set>\n\nusing namespace std;\n\nstatic const int MAX = 100000;\n\nstatic const int NIL = -1;\n\nstatic const int WHITE = 0;\n\nstatic const int GRAY = 1;\n\nstatic const int BLACK = 2;\n\nint N, num = 1;\n\nvector<int> G[MAX];\n\nset<int> st;\n\nint colors[MAX], prenum[MAX], parent[MAX], lowest[MAX];\n\nvoid dfs(int u) {\n\n  prenum[u] = num++;\n\n  lowest[u] = prenum[u];\n\n  for (auto i : G[u]) {\n\n    if (colors[i] == WHITE) {\n\n      parent[i] = u;\n\n      colors[i] = GRAY;\n\n      dfs(i);\n\n      lowest[u] = min(lowest[u], lowest[i]);\n\n    } else {\n\n      lowest[u] = min(lowest[u], prenum[i]);\n    }\n  }\n\n  colors[u] = BLACK;\n}\n\nvoid articulationPoint() {\n\n  for (int i = 0; i < MAX; i++)\n    colors[i] = WHITE;\n\n  parent[0] = NIL;\n\n  colors[0] = GRAY;\n\n  dfs(0);\n\n  int cnt = 0;\n\n  for (int i = 1; i < N; i++) {\n\n    if (parent[i] == 0)\n      cnt++;\n\n    else if (prenum[parent[i]] <= lowest[i])\n      st.insert(parent[i]);\n  }\n\n  if (cnt > 1)\n    st.insert(0);\n}\n\nint main() {\n\n  int M, s, t;\n\n  cin >> N >> M;\n\n  for (int i = 0; i < M; i++) {\n\n    cin >> s >> t;\n\n    G[s].push_back(t);\n\n    G[t].push_back(s);\n  }\n\n  articulationPoint();\n\n  for (auto itr = st.begin(); itr != st.end(); itr++)\n    cout << *itr << endl;\n}\n","fast_code":"\n\n#include <iostream>\n\n#include <vector>\n\n#include <set>\n\nusing namespace std;\n\nstatic const int MAX = 100000;\n\nstatic const int NIL = -1;\n\nint timer;\n\nint prenum[MAX], parent[MAX], lowest[MAX];\n\nbool visited[MAX];\n\nvoid dfs(int current, int prev, int n, vector<vector<int>> &G) {\n\n  visited[current] = true;\n\n  prenum[current] = lowest[current] = timer++;\n\n  for (auto next : G[current]) {\n\n    if (!visited[next]) {\n\n      parent[next] = current;\n\n      dfs(next, current, n, G);\n\n      lowest[current] = min(lowest[current], lowest[next]);\n\n    }\n\n    else if (next != prev) {\n\n      lowest[current] = min(lowest[current], prenum[next]);\n    }\n  }\n}\n\nset<int> articulationPoint(int n, vector<vector<int>> &G) {\n\n  parent[0] = NIL;\n\n  for (int i = 0; i < n; i++)\n    visited[i] = false;\n\n  timer = 0;\n\n  dfs(0, NIL, n, G);\n\n  set<int> st;\n\n  int np = 0;\n\n  for (int i = 1; i < n; i++) {\n\n    int p = parent[i];\n\n    if (p == 0)\n      np++;\n\n    else if (prenum[p] <= lowest[i])\n      st.insert(p);\n  }\n\n  if (np > 1)\n    st.insert(0);\n\n  return st;\n}\n\nint main() {\n\n  int n, m, s, t;\n\n  cin >> n >> m;\n\n  vector<vector<int>> G(n);\n\n  for (int i = 0; i < m; i++) {\n\n    cin >> s >> t;\n\n    G[s].push_back(t);\n\n    G[t].push_back(s);\n  }\n\n  set<int> st = articulationPoint(n, G);\n\n  for (auto a : st)\n    cout << a << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"f05e268624d24bebce8c2026626292e16dfc60571e4e6eb63b87bf25e18f50c5","fast_id":"3b1d43d5a867f15826e6ff17b09075b5b88f249026abaad396f2adfc5c4e635a","fast_time":0.1079442313,"language":"cpp","measured_fast_code_id":"3b1d43d5a867f15826e6ff17b09075b5b88f249026abaad396f2adfc5c4e635a","measured_slow_code_id":"3b63864c9418c505def930db00ec6245686d2b7937422cea34fef917b5739cc1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49574","problem_id":"p00324","slow_code_id":"c03c33b771ff28037dd00ec65015ec511a94da652121076da58afbd0ce578c69","slow_id":"3b63864c9418c505def930db00ec6245686d2b7937422cea34fef917b5739cc1","slow_time":0.3353321311,"speedup":3.1065312806577,"stratum":"2-4","sampling_key":"753e359dbe276c6f56cc22b717b6919da2b3c9da0d49bf05e352a00842995a48","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <array>\n\n#include <cstdint>\n\n#include <functional>\n\n#include <map>\n\n#include <math.h>\n\n#include <queue>\n\n#include <set>\n\n#include <stdlib.h>\n\n#include <string>\n\n#include <unordered_map>\n\n#include <utility>\n\n#include <vector>\n\n#define INF 1000000000\n\n#define MOD 1000000007\n\n#define rep(i, a, b) for (uint32 i = (a); i < (b); ++i)\n\n#define bitget(a, b) (((a) >> (b)) & 1)\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define C(x) std::cout << #x << \" : \" << x << std::endl\n\n#define scanf scanf_s\n\nusing int32 = std::int_fast32_t;\n\nusing int64 = std::int_fast64_t;\n\nusing uint32 = std::uint_fast32_t;\n\nusing uint64 = std::uint_fast64_t;\n\ntemplate <typename T>\n\nclass hashmap64 {\n\n  std::vector<std::pair<uint64, T>> map;\n\n  uint64 mask, count, temp;\n\n  uint64 hash64(uint64 key) {\n\n    key ^= key << 13;\n\n    key ^= key >> 19;\n\n    return key ^ (key << 17);\n  }\n\npublic:\n  hashmap64() : map(1024, std::make_pair(~static_cast<std::uint_fast64_t>(0), T())) {\n\n    mask = 1023;\n    count = 0;\n  }\n\n  hashmap64(size_t s) : map(1 << s, std::make_pair(~static_cast<std::uint_fast64_t>(0), T())) {\n\n    mask = (1 << s) - 1;\n    count = 0;\n  }\n\n  T &operator[](uint64 suf) {\n\n    temp = mask & hash64(suf);\n\n    while (~map[temp].first) {\n\n      if (map[temp].first == suf) {\n\n        return map[temp].second;\n      }\n\n      temp = mask & (temp + 1);\n    }\n\n    std::cerr << \"?????¨????????????????????§????????????\\n\";\n\n    std::abort();\n  }\n\n  void insert(uint64 key, const T &value) {\n\n    temp = mask & hash64(key);\n\n    while (~map[temp].first) {\n\n      if (map[temp].first == key) {\n\n        map[temp].second = value;\n\n        return;\n      }\n\n      temp = mask & (temp + 1);\n    }\n\n    map[temp] = std::make_pair(key, value);\n\n    ++count;\n\n    if ((count << 1) > mask) {\n\n      std::pair<uint64, T> mkey;\n\n      mask = mask << 1 | 1;\n\n      map.resize(mask + 1, std::make_pair(~static_cast<std::uint_fast64_t>(0), T()));\n\n      for (uint64 t = 0; t <= mask >> 1; ++t) {\n\n        if (!~map[t].first) {\n\n          mkey = map[t];\n\n          map[t].first = ~0;\n\n          temp = mask & hash64(mkey.first);\n\n          while (~map[temp].first) {\n\n            temp = mask & (temp + 1);\n          }\n\n          map[temp] = mkey;\n        }\n      }\n    }\n\n    return;\n  }\n\n  bool find(uint64 key) {\n\n    temp = mask & hash64(key);\n\n    while (~map[temp].first) {\n\n      if (map[temp].first == key) {\n\n        return true;\n      }\n\n      temp = mask & (temp + 1);\n    }\n\n    return false;\n  }\n\n  bool empty(void) { return !count; }\n\n  size_t size(void) { return count; }\n};\n\nint main(void) {\n\n  std::ios::sync_with_stdio(false);\n\n  std::cin.tie(0);\n\n  std::unordered_map<uint64, uint32> map;\n\n  uint32 n;\n\n  std::cin >> n;\n\n  int64 a, sum = 1e15;\n\n  uint32 ans = 0;\n\n  map.reserve(200001);\n\n  map[sum] = 0;\n\n  rep(i, 0, n) {\n\n    std::cin >> a;\n\n    sum += a;\n\n    if (map.find(sum) != map.end()) {\n\n      ans = std::max(ans, i + 1 - map[sum]);\n\n    }\n\n    else {\n\n      map[sum] = i + 1;\n    }\n  }\n\n  std::cout << ans << \"\\n\";\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <array>\n\n#include <cstdint>\n\n#include <functional>\n\n#include <map>\n\n#include <math.h>\n\n#include <queue>\n\n#include <set>\n\n#include <stdlib.h>\n\n#include <string>\n\n#include <utility>\n\n#include <vector>\n\n#define INF 1000000000\n\n#define MOD 1000000007\n\n#define rep(i, a, b) for (uint32 i = (a); i < (b); ++i)\n\n#define bitget(a, b) (((a) >> (b)) & 1)\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define C(x) std::cout << #x << \" : \" << x << std::endl\n\n#define scanf scanf_s\n\nusing int32 = std::int_fast32_t;\n\nusing int64 = std::int_fast64_t;\n\nusing uint32 = std::uint_fast32_t;\n\nusing uint64 = std::uint_fast64_t;\n\ntemplate <typename T>\n\nclass hashmap64 {\n\n  std::vector<std::pair<uint64, T>> map;\n\n  uint64 mask, count, temp;\n\n  uint64 hash64(uint64 key) {\n\n    key = ~key;\n\n    key ^= key << 13;\n\n    key ^= key >> 19;\n\n    return key ^ (key << 17);\n  }\n\npublic:\n  hashmap64()\n      : map(8192, std::make_pair(~static_cast<std::uint_fast64_t>(0), T())) {\n\n    mask = 8191;\n    count = 0;\n  }\n\n  hashmap64(size_t s) {\n\n    s |= s << 1;\n\n    s |= s >> 2;\n\n    s |= s >> 4;\n\n    s |= s >> 8;\n\n    s |= s >> 16;\n\n    s |= s >> 32;\n\n    mask = s;\n\n    count = 0;\n\n    map.resize(s + 1, std::make_pair(~static_cast<std::uint_fast64_t>(0), T()));\n  }\n\n  T &operator[](uint64 suf) {\n\n    temp = mask & hash64(suf);\n\n    while (map[temp].first != suf) {\n\n      temp = mask & (temp + 1);\n    }\n\n    return map[temp].second;\n  }\n\n  void insert(uint64 key, const T &value) {\n\n    temp = mask & hash64(key);\n\n    while (~map[temp].first) {\n\n      if (map[temp].first == key) {\n\n        map[temp].second = value;\n\n        return;\n      }\n\n      temp = mask & (temp + 1);\n    }\n\n    map[temp] = std::make_pair(key, value);\n\n    ++count;\n\n    if ((count << 1) > mask) {\n\n      std::pair<uint64, T> mkey;\n\n      mask = mask << 1 | 1;\n\n      map.resize(mask + 1,\n                 std::make_pair(~static_cast<std::uint_fast64_t>(0), T()));\n\n      for (uint64 t = 0; t <= mask >> 1; ++t) {\n\n        if (~map[t].first) {\n\n          mkey = map[t];\n\n          map[t].first = ~static_cast<std::uint_fast64_t>(0);\n\n          temp = mask & hash64(mkey.first);\n\n          while (~map[temp].first) {\n\n            temp = mask & (temp + 1);\n          }\n\n          map[temp] = mkey;\n        }\n      }\n    }\n\n    return;\n  }\n\n  bool find(uint64 key) {\n\n    temp = mask & hash64(key);\n\n    while (~map[temp].first) {\n\n      if (map[temp].first == key) {\n\n        return true;\n      }\n\n      temp = mask & (temp + 1);\n    }\n\n    return false;\n  }\n\n  bool empty(void) { return !count; }\n\n  size_t size(void) { return count; }\n};\n\nint main(void) {\n\n  std::ios::sync_with_stdio(false);\n\n  std::cin.tie(0);\n\n  hashmap64<uint32> map(250);\n\n  uint32 n;\n\n  std::cin >> n;\n\n  int64 a, sum = 1e15;\n\n  uint32 ans = 0;\n\n  map.insert(sum, 0);\n\n  rep(i, 0, n) {\n\n    std::cin >> a;\n\n    sum += a;\n\n    if (map.find(sum)) {\n\n      ans = std::max(ans, i + 1 - map[sum]);\n\n    }\n\n    else {\n\n      map.insert(sum, i + 1);\n    }\n  }\n\n  std::cout << ans << \"\\n\";\n\n  return 0;\n}"}
{"fast_code_id":"10f35518bcafef852b5296100af2306d896bfeb51ac2b9303cc7587a81e9ae09","fast_id":"b123260a5e44405b99bccdac20c2c2d5ff85461016ef8d2737926b77d072f4a2","fast_time":0.0196682881,"language":"cpp","measured_fast_code_id":"b123260a5e44405b99bccdac20c2c2d5ff85461016ef8d2737926b77d072f4a2","measured_slow_code_id":"9024dbfcda69f62a28a3591b2e96c6dadbf0519cce345040f7b0cf1fdd3f7a15","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49585","problem_id":"p03473","slow_code_id":"0c7a1518113f088eb1abaf4b869bb38bdc8e8a40e549616f9a009ab4d85277cb","slow_id":"9024dbfcda69f62a28a3591b2e96c6dadbf0519cce345040f7b0cf1fdd3f7a15","slow_time":0.1045645813,"speedup":5.316404801900375,"stratum":"4-8","sampling_key":"02d0497017299465593cd948d866756333cc0fc8e63eb1a9eb00bb00c03b7012","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  int m;\n\n  cin >> m;\n\n  cout << 48 - m << endl;\n}","fast_code":"#include <cstdio>\n\nint m;\n\nint main() {\n\n  scanf(\"%d\", &m);\n\n  printf(\"%d\\n\", 48 - m);\n}"}
{"fast_code_id":"2fd19137c4843275f4bfedca5bb92df4995aa4826adfee5a29978726a42503b6","fast_id":"e7f1a960991c01f8b06caa5995ff7ec5c5a4e15163bb82eb8f398f4d6b6a67fc","fast_time":0.0772586252,"language":"cpp","measured_fast_code_id":"e7f1a960991c01f8b06caa5995ff7ec5c5a4e15163bb82eb8f398f4d6b6a67fc","measured_slow_code_id":"12ab68ff1ac57d72fdc05a9fbea72a0a7de171542d5f37a972a2837528625b89","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49589","problem_id":"p02976","slow_code_id":"ee79117dc7b513630d76e163cb5a62dce5497728b6e5c5dcd059b5d0c84122b0","slow_id":"12ab68ff1ac57d72fdc05a9fbea72a0a7de171542d5f37a972a2837528625b89","slow_time":0.5049941511,"speedup":6.536411304145236,"stratum":"4-8","sampling_key":"11d39aa7f20049479e53ea72795bc8610cda006d76c3d910ff90fc3b839cf5d8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 1000 * 100 + 20;\n\nvector<int> gr[maxn], ans[maxn];\n\nint n, m, vis[maxn];\n\nvoid dfs(int v, int u) {\n\n  vis[v] = 1;\n\n  for (int i : gr[v]) {\n\n    if (!vis[i]) {\n\n      dfs(i, v);\n\n      if (ans[i].size() % 2)\n\n        ans[i].push_back(v);\n\n      else\n\n        ans[v].push_back(i);\n\n    }\n\n    else if (i != u) {\n\n      if (i > v)\n\n        ans[v].push_back(i);\n    }\n  }\n}\n\nint main() {\n\n  cin >> n >> m;\n\n  for (int i = 0; i < m; i++) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    gr[a].push_back(b);\n\n    gr[b].push_back(a);\n  }\n\n  if (m % 2)\n\n    cout << -1 << endl;\n\n  else {\n\n    dfs(1, 0);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j : ans[i])\n\n      cout << i << \" \" << j << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\nstruct E {\n\n  int v;\n\n  bool vis;\n\n  E *next, *rev;\n};\n\nconst int N = 100010;\n\nint n, m;\n\nbool vis[N], par[N];\n\nE *g[N];\n\nE *adde(int u, int v) {\n\n  static E pool[N * 2], *p = pool;\n\n  ++p;\n\n  p->v = v;\n\n  p->next = g[u];\n\n  g[u] = p;\n\n  return p;\n}\n\nvoid dfs(int u) {\n\n  vis[u] = true;\n\n  for (E *p = g[u]; p; p = p->next)\n\n    if (!p->vis) {\n\n      p->vis = p->rev->vis = true;\n\n      if (!vis[p->v]) {\n\n        dfs(p->v);\n\n        if (par[p->v]) {\n\n          printf(\"%d %d\\n\", p->v, u);\n\n        } else {\n\n          printf(\"%d %d\\n\", u, p->v);\n\n          par[u] ^= 1;\n        }\n\n      } else {\n\n        printf(\"%d %d\\n\", u, p->v);\n\n        par[u] ^= 1;\n      }\n    }\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n\n  if (m % 2) {\n\n    puts(\"-1\");\n\n    return 0;\n  }\n\n  while (m--) {\n\n    int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    E *p = adde(u, v), *q = adde(v, u);\n\n    p->rev = q;\n\n    q->rev = p;\n  }\n\n  dfs(1);\n\n  return 0;\n}"}
{"fast_code_id":"37d0e27aa22c82e38c55ba44c7a855597790e6f25ea6e893f297dd9fe955f6f3","fast_id":"d1f903c369ce8ff3ab1313af9f97bbdeac0af7fbf6959387731b9347c2912a73","fast_time":0.0676844191,"language":"cpp","measured_fast_code_id":"d1f903c369ce8ff3ab1313af9f97bbdeac0af7fbf6959387731b9347c2912a73","measured_slow_code_id":"c5c7ac05d32ba1758ee1894759881faafdd0157706428ccd4e4ac3da9a566d8b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49630","problem_id":"p03087","slow_code_id":"5045e3ffab73b813cdf3b5a79aaf27d75bae2fa3b2fc810f904a6acce117d4d4","slow_id":"c5c7ac05d32ba1758ee1894759881faafdd0157706428ccd4e4ac3da9a566d8b","slow_time":0.7413315836,"speedup":10.952765694933769,"stratum":"8+","sampling_key":"b7922ba00f79ee1330e65f4099daa7779b97fbd2fb89cef328d1c1ef3adde28c","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define fast()                                                                 \\\n  ios_base::sync_with_stdio(0);                                                \\\n  cin.tie(0)\n\n#define all(x) x.begin(), x.end()\n\n#define pb push_back\n\n#define F first\n\n#define S second\n\nconst int N = 1e5 + 5;\n\nstring s;\n\nstruct seg\n\n{\n  int pre, suf, tot;\n\n  seg()\n\n  {\n    pre = suf = tot = 0;\n  }\n};\n\nseg tree[4 * N];\n\nseg combine(seg a, seg b)\n\n{\n  seg c;\n\n  c.pre = a.pre;\n\n  c.suf = b.suf;\n\n  c.tot = a.tot + b.tot + (int)(a.suf && b.pre);\n\n  return c;\n}\n\nvoid build(int node, int beg, int en)\n\n{\n  if (beg == en)\n\n  {\n    if (s[beg - 1] == 'A')\n\n      tree[node].suf = 1;\n\n    else if (s[beg - 1] == 'C')\n\n      tree[node].pre = 1;\n\n    return;\n  }\n\n  int mid = (beg + en) / 2;\n\n  build(2 * node, beg, mid);\n\n  build(2 * node + 1, mid + 1, en);\n\n  tree[node] = combine(tree[2 * node], tree[2 * node + 1]);\n}\n\nseg qu(int node, int beg, int en, int l, int r)\n\n{\n  if (beg > en || l > en || r < beg)\n\n  {\n    seg null;\n\n    return null;\n  }\n\n  if (l <= beg && en <= r)\n\n    return tree[node];\n\n  int mid = (beg + en) / 2;\n\n  return (combine(qu(2 * node, beg, mid, l, r),\n                  qu(2 * node + 1, mid + 1, en, l, r)));\n}\n\nint32_t main()\n\n{\n  int n, q, l, r;\n\n  fast();\n\n  cin >> n >> q >> s;\n\n  build(1, 1, n);\n\n  for (; q; --q)\n\n  {\n    cin >> l >> r;\n\n    cout << qu(1, 1, n, l, r).tot << \"\\n\";\n  }\n\n  return 0;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define fast()                                                                 \\\n  ios_base::sync_with_stdio(0);                                                \\\n  cin.tie(0)\n\n#define all(x) x.begin(), x.end()\n\n#define pb push_back\n\n#define F first\n\n#define S second\n\nint32_t main()\n\n{\n  int n, q, i, l, r;\n\n  string s;\n\n  fast();\n\n  cin >> n >> q >> s;\n\n  vector<int> a(n + 1);\n\n  a[0] = a[1] = 0;\n\n  char prev = s[0];\n\n  for (i = 1; i < n; ++i)\n\n  {\n    if (prev == 'A' && s[i] == 'C')\n\n      a[i + 1] = a[i] + 1;\n\n    else\n\n      a[i + 1] = a[i];\n\n    prev = s[i];\n  }\n\n  for (; q; --q)\n\n  {\n    cin >> l >> r;\n\n    cout << a[r] - a[l] << \"\\n\";\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"78f28b15fc085cf4da018daa46b9b40e8c9b9a5a4df5928e81ccc38f0f7567a6","fast_id":"2523b96d28451c0346b389fa18ffe8d8607dd337e7d970902945fb7b474c0a3e","fast_time":0.0947026726,"language":"cpp","measured_fast_code_id":"2523b96d28451c0346b389fa18ffe8d8607dd337e7d970902945fb7b474c0a3e","measured_slow_code_id":"bc5343d76c12e22a7c2f146d61659e9aa8aa13bfdc8a0c630919b25a502a5b48","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49645","problem_id":"p02820","slow_code_id":"4c00c669b668e1ebb28268e24cfc3237128103131227f662f33599a3fa365f85","slow_id":"bc5343d76c12e22a7c2f146d61659e9aa8aa13bfdc8a0c630919b25a502a5b48","slow_time":0.3681737957,"speedup":3.887681156107098,"stratum":"2-4","sampling_key":"6913124ee5d0bd8743965032b0907a23d699343682d437bea63c1451fe62c2c9","slow_code":"#include <bits/stdc++.h>\n\n#define _GLIBCXX_DEBUG\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nusing namespace std;\n\nusing ll = long long;\n\nconst int INF = 1001001001;\n\nconst int mod = 1000000007;\n\nint score = 0;\n\nint N, K;\n\nint R, S, P;\n\nstring T;\n\nvector<vector<int>> dp(3, vector<int>(100001, 0));\n\nvector<char> used(100001, 'x');\n\nvoid dps(int idx) {\n\n  if (idx == N) {\n\n    return;\n  }\n\n  int before_maxi = max(dp[0][idx - 1], max(dp[1][idx - 1], dp[2][idx - 1]));\n\n  if (T[idx] == 's') {\n\n    if (used[idx - K] == 's') {\n\n      dp[0][idx] = -1;\n\n    } else {\n\n      dp[0][idx] = before_maxi + R;\n\n      used[idx] = 's';\n    }\n\n  } else if (T[idx] == 'p') {\n\n    if (used[idx - K] == 'p') {\n\n      dp[1][idx] = -1;\n\n    } else {\n\n      dp[1][idx] = before_maxi + S;\n\n      used[idx] = 'p';\n    }\n\n  } else if (T[idx] == 'r') {\n\n    if (used[idx - K] == 'r') {\n\n      dp[2][idx] = -1;\n\n    } else {\n\n      dp[2][idx] = before_maxi + P;\n\n      used[idx] = 'r';\n    }\n\n  } else {\n\n    cout << \"error\" << endl;\n  }\n\n  for (int i = 0; i < 3; i++) {\n\n    if (dp[i][idx] == 0) {\n\n      dp[i][idx] = before_maxi;\n    }\n  }\n\n  dps(idx + 1);\n\n  return;\n}\n\nint main() {\n\n  cin >> N >> K;\n\n  cin >> R >> S >> P;\n\n  cin >> T;\n\n  int before_maxi = 0;\n\n  for (int i = 0; i < K; i++) {\n\n    if (T[i] == 's') {\n\n      dp[0][i] += before_maxi + R;\n\n      used[i] = 's';\n\n    } else if (T[i] == 'p') {\n\n      dp[1][i] += before_maxi + S;\n\n      used[i] = 'p';\n\n    } else if (T[i] == 'r') {\n\n      dp[2][i] += before_maxi + P;\n\n      used[i] = 'r';\n\n    } else {\n\n      cout << \"error\" << endl;\n\n      return 0;\n    }\n\n    for (int j = 0; j < 3; j++) {\n\n      if (dp[j][i] == 0) {\n\n        dp[j][i] = before_maxi;\n      }\n    }\n\n    before_maxi = max(dp[0][i], max(dp[1][i], dp[2][i]));\n  }\n\n  dps(K);\n\n  cout << max(dp[0][N - 1], max(dp[1][N - 1], dp[2][N - 1])) << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define _GLIBCXX_DEBUG\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nusing namespace std;\n\nusing ll = long long;\n\nconst int INF = 1001001001;\n\nconst int MOD = 1000000007;\n\ntypedef long long ll;\n\nint main() {\n\n  int N, K;\n\n  cin >> N >> K;\n\n  int R, S, P;\n\n  cin >> R >> S >> P;\n\n  string T;\n\n  cin >> T;\n\n  int total = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    if (T[i] == 'r')\n      total += P;\n\n    if (T[i] == 's')\n      total += R;\n\n    if (T[i] == 'p')\n      total += S;\n  }\n\n  for (int i = 0; i < K; i++) {\n\n    char before = 'x';\n\n    int cnt = 1;\n\n    for (int j = 0; j < (N + K - 1) / K; j++) {\n\n      if (j * K + i >= N)\n        continue;\n\n      char now = T[j * K + i];\n\n      if (before == now) {\n\n        cnt++;\n\n      } else {\n\n        int kake = cnt / 2;\n\n        if (before == 'r')\n          total -= P * kake;\n\n        if (before == 'p')\n          total -= S * kake;\n\n        if (before == 's')\n          total -= R * kake;\n\n        before = now;\n\n        cnt = 1;\n      }\n    }\n\n    int kake = cnt / 2;\n\n    if (before == 'r')\n      total -= P * kake;\n\n    if (before == 'p')\n      total -= S * kake;\n\n    if (before == 's')\n      total -= R * kake;\n  }\n\n  cout << total << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"1889e6710bed1856fbaf961925688694485efb150634bdff9b57e0315f8cb0a8","fast_id":"41c773cad00d8f11c44a795831033c6ce7eee5d74558fdcd19713e0b158a21c3","fast_time":0.0001934504,"language":"cpp","measured_fast_code_id":"41c773cad00d8f11c44a795831033c6ce7eee5d74558fdcd19713e0b158a21c3","measured_slow_code_id":"300054744b7ec325574ba6c4c16bdfc576e4fe3458031982dc27dbaf5c1b3d12","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49654","problem_id":"p03847","slow_code_id":"98bc0cbddbb055b345df782d58ccfb7ece1392f883e4f46c988cd14d237e52dd","slow_id":"300054744b7ec325574ba6c4c16bdfc576e4fe3458031982dc27dbaf5c1b3d12","slow_time":0.0016030841,"speedup":8.286796512180901,"stratum":"8+","sampling_key":"ee4bf090999a3e3fc713a1c248fab7e0b768a49fd11a8342f02d403ef1deb312","slow_code":"#include <stdio.h>\n\n#include <string>\n\n#include <cstring>\n\n#include <stdlib.h>\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <iterator>\n\n#pragma warning(disable : 4996)\n\ntypedef long long ll;\n\n#define MIN(a, b) ((a) > (b) ? (b) : (a))\n\n#define MAX(a, b) ((a) < (b) ? (b) : (a))\n\n#define LINF 9223300000000000000\n\n#define INF 2140000000\n\n#define MOD 1000000007\n\nusing namespace std;\n\nll dp[62][2];\n\nll calc(const vector<pair<long, long> > &zz, long jj)\n\n{\n\n  ll val[2] = {dp[jj][0], dp[jj][1]};\n\n  long p;\n\n  for (p = (long)zz.size() - 1; p >= 0; p--) {\n\n    ll valnew[2] = {0, 0};\n\n    long j = zz[p].first;\n\n    long k = zz[p].second;\n\n    valnew[0] = (valnew[0] + (j * k + 1) * val[0]) % MOD;\n\n    valnew[0] = (valnew[0] + j * val[1]) % MOD;\n\n    valnew[1] = (valnew[1] + k * val[0]) % MOD;\n\n    valnew[1] = (valnew[1] + 1 * val[1]) % MOD;\n\n    val[0] = valnew[0];\n\n    val[1] = valnew[1];\n  }\n\n  return val[0];\n}\n\nint main(int argc, char *argv[])\n\n{\n\n  ll n;\n\n  scanf(\"%lld\", &n);\n\n  n++;\n\n  long i, j, k;\n\n  dp[0][0] = 1;\n\n  dp[0][1] = 0;\n\n  for (i = 1; i < 60; i++) {\n\n    for (j = 1; j <= i; j++) {\n\n      if (j == i) {\n\n        dp[i][0] = (dp[i][0] + 1) % MOD;\n\n      }\n\n      else {\n\n        for (k = 1; k <= i - j; k++) {\n\n          dp[i][0] = (dp[i][0] + (j * k + 1) * dp[i - j - k][0]) % MOD;\n\n          dp[i][0] = (dp[i][0] + j * dp[i - j - k][1]) % MOD;\n\n          dp[i][1] = (dp[i][1] + k * dp[i - j - k][0]) % MOD;\n\n          dp[i][1] = (dp[i][1] + 1 * dp[i - j - k][1]) % MOD;\n        }\n      }\n    }\n  }\n\n  vector<pair<long, long> > zz;\n\n  long count1 = 0, count0 = 0;\n\n  ll ans = 0;\n\n  for (i = 60; i >= 0; i--) {\n\n    if (n & ((ll)1 << i)) {\n\n      for (j = i; j >= 0; j--) {\n\n        vector<pair<long, long> > zz_tmp = zz;\n\n        if (count1) {\n\n          zz_tmp.push_back(make_pair(count1, count0 + (i - j + 1)));\n        }\n\n        ans = (ans + calc(zz_tmp, j)) % MOD;\n      }\n\n      if (count1 && count0) {\n\n        zz.push_back(make_pair(count1, count0));\n\n        count1 = 1;\n\n        count0 = 0;\n\n      }\n\n      else {\n\n        count1++;\n      }\n\n    }\n\n    else {\n\n      if (count1) {\n\n        count0++;\n      }\n    }\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string>\n\n#include <cstring>\n\n#include <stdlib.h>\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <iterator>\n\n#pragma warning(disable : 4996)\n\ntypedef long long ll;\n\n#define MIN(a, b) ((a) > (b) ? (b) : (a))\n\n#define MAX(a, b) ((a) < (b) ? (b) : (a))\n\n#define LINF 9223300000000000000\n\n#define INF 2140000000\n\n#define MOD 1000000007\n\nusing namespace std;\n\nll dp[62][2];\n\nvoid prepare()\n\n{\n\n  dp[0][0] = 1;\n\n  dp[0][1] = 0;\n\n  long i;\n\n  for (i = 1; i < 60; i++) {\n\n    dp[i][0] = (dp[i][0] + 2 * dp[i - 1][0]) % MOD;\n\n    dp[i][0] = (dp[i][0] + dp[i - 1][1]) % MOD;\n\n    dp[i][1] = (dp[i][1] + dp[i - 1][0]) % MOD;\n\n    dp[i][1] = (dp[i][1] + 2 * dp[i - 1][1]) % MOD;\n  }\n}\n\nll calc(ll n, long i)\n\n{\n\n  ll val[2] = {dp[i][0], dp[i][1]};\n\n  long p;\n\n  for (p = i; p < 60; p++) {\n\n    ll valnew[2] = {0, 0};\n\n    bool curr = (p == i ? 0 : ((n & ((ll)1 << p)) != 0));\n\n    if (curr) {\n\n      valnew[0] = (valnew[0] + val[0]) % MOD;\n\n      valnew[0] = (valnew[0] + val[1]) % MOD;\n\n      valnew[1] = (valnew[1] + val[1]) % MOD;\n\n    }\n\n    else {\n\n      valnew[0] = (valnew[0] + val[0]) % MOD;\n\n      valnew[1] = (valnew[1] + val[0]) % MOD;\n\n      valnew[1] = (valnew[1] + val[1]) % MOD;\n    }\n\n    val[0] = valnew[0];\n\n    val[1] = valnew[1];\n  }\n\n  return val[0];\n}\n\nlong solve(ll n)\n\n{\n\n  n++;\n\n  ll ans = 0;\n\n  long i;\n\n  for (i = 60; i >= 0; i--) {\n\n    if (n & ((ll)1 << i)) {\n\n      ans = (ans + calc(n, i)) % MOD;\n    }\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n\nint main(int argc, char *argv[])\n\n{\n\n  ll n;\n\n  scanf(\"%lld\", &n);\n\n  prepare();\n\n  return solve(n);\n}"}
{"fast_code_id":"1dd308952b2493c0c112a24dace57b8f21812dbcb889102cfb06fc33a1d9ced3","fast_id":"3d33167b1f3f7b307c49888ba55e892d83d58355be37308124c9e586ad50c5a9","fast_time":0.0126449801,"language":"cpp","measured_fast_code_id":"3d33167b1f3f7b307c49888ba55e892d83d58355be37308124c9e586ad50c5a9","measured_slow_code_id":"d928094ec13277a0f445d3fcc4b5b2837620f536403286cd742237d784a7ff61","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49663","problem_id":"p03270","slow_code_id":"19ae93a3a796fec10827506f4e387b1ee826abb542d7617442a6b7ae67eb850d","slow_id":"d928094ec13277a0f445d3fcc4b5b2837620f536403286cd742237d784a7ff61","slow_time":0.1328985432,"speedup":10.509984369212253,"stratum":"8+","sampling_key":"fdca158f576c41a22180e3116ec06c3e6b60a43c6863b4154b4e927c674b75a0","slow_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#define min(a, b) (a < b ? a : b)\n\nconst int clz = 998244353;\n\n#define mod clz\n\nlong long matm(long long val, long long k) {\n\n  long long ret = 1;\n\n  while (k) {\n\n    if (k & 1)\n      ret = ret * val % mod;\n\n    k >>= 1;\n    val = val * val % mod;\n  }\n\n  return ret;\n}\n\nint n, k;\n\nlong long pw[100005], pu[100005], inv[100005];\n\ninline long long C(int n, int m) {\n  if (m < 0 || m > n)\n    return 0;\n  return (pu[n] * inv[m] % mod) * inv[n - m] % mod;\n}\n\nlong long getans(int val) {\n\n  if (val & 1) {\n\n    long long ans = 0;\n\n    int gro = min(k - val / 2, val / 2);\n\n    int p = k - gro * 2;\n\n    for (int i = (p == 0) ? 1 : 0; i <= gro; i++) {\n      ans += (C(n + p - 1, i + p - 1) * pw[i] % mod) * C(gro, i) % mod;\n      ans %= mod;\n    }\n\n    return ans;\n\n  }\n\n  else {\n\n    long long ans = 0;\n\n    int gro = min(k - val / 2 + 1, val / 2);\n\n    int p = k - gro * 2 + 1;\n\n    for (int i = (p == 0) ? 1 : 0; i < gro; i++) {\n      ans += (C(n + p - 1, i + p - 1) * pw[i] % mod) * C(gro - 1, i) % mod;\n      ans %= mod;\n    }\n\n    for (int i = (p == 0) ? 1 : 0; i < gro; i++) {\n      ans += (C(n + p - 2, i + p - 1) * pw[i] % mod) * C(gro - 1, i) % mod;\n      ans %= mod;\n    }\n\n    return ans;\n  }\n}\n\nint main() {\n\n  pu[0] = pw[0] = 1;\n\n  for (int i = 1; i <= 100000; i++)\n    pu[i] = pu[i - 1] * i % mod;\n\n  for (int i = 1; i <= 100000; i++)\n    pw[i] = pw[i - 1] * 2 % mod;\n\n  inv[100000] = matm(pu[100000], mod - 2);\n\n  for (int i = 99999; i >= 0; i--)\n    inv[i] = inv[i + 1] * (i + 1) % mod;\n\n  scanf(\"%d%d\", &k, &n);\n\n  for (int i = 2; i <= 2 * k; i++)\n    printf(\"%lld\\n\", getans(i));\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define ll long long\n\n#define mod 998244353\n\n#define MN 4000\n\nusing namespace std;\n\ninline int in() {\n\n  int x = 0;\n  bool f = 0;\n  char c;\n\n  for (; (c = getchar()) < '0' || c > '9'; f = c == '-')\n    ;\n\n  for (x = c - '0'; (c = getchar()) >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0')\n    ;\n\n  return f ? -x : x;\n}\n\nint fac[MN + 5], pw[MN + 5], inv[MN + 5];\n\nint n, k, res, num;\n\ninline int qpow(int x, int k) {\n\n  int res = 1;\n\n  while (k) {\n\n    if (k & 1)\n      res = (1ll * res * x) % mod;\n\n    x = (1ll * x * x) % mod;\n    k >>= 1;\n  }\n  return res;\n}\n\ninline int C(int x, int y) {\n\n  if (x < y || y < 0)\n    return 0;\n\n  return (1ll * fac[x] * inv[y] % mod * inv[x - y] % mod);\n}\n\ninline int calc(int x, int p, int n) {\n\n  int res = 0;\n\n  for (int i = 0; i <= x; ++i)\n\n    res = (1ll * res + (1ll * pw[i] * C(x, i) % mod * C(n + p - 1, p + i - 1) % mod)) % mod;\n\n  return res;\n}\n\nint main()\n\n{\n\n  fac[0] = pw[0] = 1;\n\n  for (int i = 1; i <= MN; ++i)\n\n    fac[i] = (1ll * fac[i - 1] * i) % mod, pw[i] = (pw[i - 1] * 2) % mod;\n\n  inv[MN] = qpow(fac[MN], mod - 2);\n\n  for (int i = MN - 1; i >= 0; --i)\n\n    inv[i] = (1ll * inv[i + 1] * (i + 1)) % mod;\n\n  k = in();\n  n = in();\n\n  for (int i = 2; i <= (k << 1); ++i) {\n\n    num = min(i - 1, k) - max(i - k - 1, 0);\n\n    if (i & 1)\n      printf(\"%d\\n\", calc((num >> 1), k - num, n));\n\n    else\n      printf(\"%d\\n\",\n             (calc(((num - 1) >> 1), k - num, n) + calc(((num - 1) >> 1), k - num, n - 1)) % mod);\n  }\n  return 0;\n}"}
{"fast_code_id":"84979bb9161d53560cb361b7c78038f768a90021008c7c58df792345632d312e","fast_id":"6fe4e1d1fa0968382940c018dbd2b3f2dcd8d20368cd1196fd50a5b8ee0dfdf6","fast_time":0.0119274049,"language":"cpp","measured_fast_code_id":"6fe4e1d1fa0968382940c018dbd2b3f2dcd8d20368cd1196fd50a5b8ee0dfdf6","measured_slow_code_id":"2e4e2e825153d441e950896bde30c197472f2c17bc91565e37e6946143c9803f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49681","problem_id":"p03014","slow_code_id":"06d4725b6caa46b7a3098f29ded8accce321c351dd45b860f69b02373b3d7beb","slow_id":"2e4e2e825153d441e950896bde30c197472f2c17bc91565e37e6946143c9803f","slow_time":0.0698555169,"speedup":5.856723862874815,"stratum":"4-8","sampling_key":"d6e24fada0f8dba972deb4db001b84ce3076a5964cfdf4f6527a3abee916a7b9","slow_code":"#include <bits/stdc++.h>\n\n#define N 2020\n\nusing namespace std;\n\nchar grid[N][N];\n\nvector<int> ln[N], vln[N];\n\nint main() {\n\n  int n, m, i, j, k, l, num, ans = 0, pos1, pos2, posa, posb;\n\n  cin >> n >> m;\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    for (j = 0; j < m; j++)\n\n    {\n\n      cin >> grid[i][j];\n\n      if (grid[i][j] == '#')\n\n      {\n\n        ln[i].push_back(j);\n\n        vln[j].push_back(i);\n      }\n    }\n  }\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    for (j = 0; j < m; j++)\n\n    {\n\n      if (grid[i][j] == '#')\n\n      {\n\n        continue;\n      }\n\n      pos1 = upper_bound(ln[i].begin(), ln[i].end(), j) - ln[i].begin();\n\n      pos2 = upper_bound(vln[j].begin(), vln[j].end(), i) - vln[j].begin();\n\n      posa = pos1 - 1;\n\n      posb = pos2 - 1;\n\n      if (pos1 == ln[i].size())\n\n      {\n\n        pos1 = m - 1;\n\n      }\n\n      else\n\n      {\n\n        pos1 = ln[i][pos1] - 1;\n      }\n\n      if (pos2 == vln[j].size())\n\n      {\n\n        pos2 = n - 1;\n\n      }\n\n      else\n\n      {\n\n        pos2 = vln[j][pos2] - 1;\n      }\n\n      if (posa == -1)\n\n      {\n\n        posa = 0;\n\n      }\n\n      else\n\n      {\n\n        posa = ln[i][posa] + 1;\n      }\n\n      if (posb == -1)\n\n      {\n\n        posb = 0;\n\n      }\n\n      else\n\n      {\n\n        posb = vln[j][posb] + 1;\n      }\n\n      num = pos1 - posa + pos2 - posb + 1;\n\n      ans = max(ans, num);\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nchar g[2001][2001];\n\nint n, m, maxc[2001][2001], maxr[2001][2001], lst = -1, res, max;\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%s\", g[i]);\n\n  for (int i = 0; i < n; i++, lst = -1, res = 0)\n    for (int j = 0; j <= m; j++)\n\n      if (j == m || g[i][j] != '.') {\n\n        for (int k = lst + 1; k < j; k++)\n          maxc[i][k] = res;\n\n        res = 0, lst = j;\n\n      }\n\n      else\n        res++;\n\n  lst = -1, res = 0;\n\n  for (int j = 0; j < m; j++, lst = -1, res = 0)\n    for (int i = 0; i <= n; i++)\n\n      if (i == n || g[i][j] != '.') {\n\n        for (int k = lst + 1; k < i; k++)\n          maxr[k][j] = res;\n\n        res = 0, lst = i;\n\n      }\n\n      else\n        res++;\n\n  for (int i = 0; i < n; i++)\n    for (int j = 0; j < m; j++)\n      if (maxc[i][j] + maxr[i][j] > max)\n        max = maxc[i][j] + maxr[i][j];\n\n  printf(\"%d\\n\", max - 1);\n\n  return 0;\n}\n"}
{"fast_code_id":"9025f651c16877b391c92f6bf86aa78cf7dd44d1dc3bbd4357262f94f6c162ab","fast_id":"60f60d9f4ab90a429ae7d2cce7426399afd4b139d986f7ef7cc615ba67ec79ac","fast_time":0.0108796082,"language":"cpp","measured_fast_code_id":"60f60d9f4ab90a429ae7d2cce7426399afd4b139d986f7ef7cc615ba67ec79ac","measured_slow_code_id":"e5b8b9e674aba8680a4db922bead8ca3f02e5235ac444537ee6b5119b76cbf98","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_4979","problem_id":"p02864","slow_code_id":"a33c93908ea887df8530927f7037fdbc055445691fdd455acf625a87d6f550ef","slow_id":"e5b8b9e674aba8680a4db922bead8ca3f02e5235ac444537ee6b5119b76cbf98","slow_time":0.1425418054,"speedup":13.101740685845654,"stratum":"8+","sampling_key":"16d1ed4bf8a347f3ec9e4fa3862759dac26de8915760c4083773b084e3f68c00","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, K;\n\n  cin >> N >> K;\n\n  int H[302] = {};\n\n  rep1(i, N) cin >> H[i];\n\n  ll hutuu = 0;\n\n  rep(i, N + 1) {\n\n    if (H[i + 1] > H[i])\n      hutuu += H[i + 1] - H[i];\n  }\n\n  ll dp[302][601] = {};\n\n  rep(i, N + 1) {\n\n    auto dpi = dp[i];\n\n    ll tmp1 = max(0, H[i + 1] - H[i]);\n\n    ll tmp2 = max(0, H[i] - H[i + 1]);\n\n    ll tmp3 = min(tmp1, tmp2);\n\n    int mae = H[i + 1];\n\n    ll maetmp = tmp3;\n\n    for (int j = i + 2; j <= N + 1; j++) {\n\n      if (mae < H[j])\n        tmp1 += H[j] - mae;\n\n      if (mae > H[j])\n        tmp2 += mae - H[j];\n\n      tmp3 = min(tmp1, tmp2);\n\n      if (maetmp < tmp3) {\n\n        int k = j - i - 1;\n\n        auto dpj = dp[j] + k;\n\n        rep(p, K) chmax(dpj[p], dpi[p] + tmp3);\n      }\n\n      mae = H[j];\n\n      maetmp = tmp3;\n    }\n\n    auto dpi2 = dp[i + 1];\n\n    rep(p, K + 1) chmax(dpi2[p], dpi[p]);\n  }\n\n  co(hutuu - dp[N + 1][K]);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nll dp[302][301];\n\nint main() {\n\n  int N, K;\n\n  scanf(\"%d\", &N);\n\n  scanf(\"%d\", &K);\n\n  int H[302] = {};\n\n  rep1(i, N) scanf(\"%d\", H + i);\n\n  ll hutuu = 0;\n\n  rep(i, N + 1) {\n\n    if (H[i + 1] > H[i])\n      hutuu += H[i + 1] - H[i];\n  }\n\n  if (N == K) {\n\n    printf(\"0\");\n\n    return 0;\n  }\n\n  rep(i, N + 1) {\n\n    auto dpi = dp[i];\n\n    ll tmp1 = max(0, H[i + 1] - H[i]);\n\n    ll tmp2 = max(0, H[i] - H[i + 1]);\n\n    ll tmp3 = min(tmp1, tmp2);\n\n    int mae = H[i + 1];\n\n    ll maetmp = tmp3;\n\n    for (int j = i + 2; j <= min(N + 1, K + i + 1); j++) {\n\n      if (mae < H[j])\n        tmp1 += H[j] - mae;\n\n      if (mae > H[j])\n        tmp2 += mae - H[j];\n\n      tmp3 = min(tmp1, tmp2);\n\n      if (maetmp < tmp3) {\n\n        int k = j - i - 1;\n\n        auto dpj = dp[j] + k;\n\n        rep(p, K - k + 1) if (dpj[p] < dpi[p] + tmp3) dpj[p] = dpi[p] + tmp3;\n      }\n\n      mae = H[j];\n\n      maetmp = tmp3;\n    }\n\n    auto dpi2 = dp[i + 1];\n\n    rep(p, K + 1) if (dpi2[p] < dpi[p]) dpi2[p] = dpi[p];\n  }\n\n  printf(\"%lld\", hutuu - dp[N + 1][K]);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"3298729b1634944c395c653735bf300568e07fd3ac027a832e7cc07e39e28002","fast_id":"12fc327a6768d4fa83e7f37069ff927f1142ea3fa698ffcea30c25c12904ae1f","fast_time":0.105739761,"language":"cpp","measured_fast_code_id":"12fc327a6768d4fa83e7f37069ff927f1142ea3fa698ffcea30c25c12904ae1f","measured_slow_code_id":"9dce9a4d3c3cf3d846946e727b9b8b8c3da482d0e8b140e85e45490bbf0a8ef4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_49988","problem_id":"p03101","slow_code_id":"f052dcd405cf7c3c0ef066196548fb624da4a4898d40289a49c5ee529b039608","slow_id":"9dce9a4d3c3cf3d846946e727b9b8b8c3da482d0e8b140e85e45490bbf0a8ef4","slow_time":0.2203226657,"speedup":2.083631205672954,"stratum":"2-4","sampling_key":"fc808bb4026ba3621999d6985dbc01136a5875b638e113e35304884648756fa9","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\n#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))\n\n#define ALL(a) (a).begin(), (a).end()\n\nusing ll = long long;\n\nint main() {\n\n  int H, W, h, w;\n\n  cin >> H >> W >> h >> w;\n\n  vector<vector<int>> data(int(500), vector<int>(500));\n\n  rep(i, H) {\n\n    rep(j, W) { data.at(i).at(j) = 0; }\n  }\n\n  int count = 0;\n\n  rep(i, H) {\n\n    rep(j, W) {\n\n      if (data.at(i).at(j) == 0)\n        count++;\n    }\n  }\n\n  if (h > H)\n    h = H;\n\n  if (w > W)\n    w = W;\n\n  cout << count - h * W - w * H + h * w << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\n#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))\n\n#define ALL(a) (a).begin(), (a).end()\n\nusing ll = long long;\n\nint main() {\n\n  int H, W, h, w;\n\n  cin >> H >> W >> h >> w;\n\n  cout << H * W - h * W - w * H + h * w << endl;\n}"}
{"fast_code_id":"1298fabe52b6f8b9d6b607fd3684132726831d1dc6c28b3fa7136e76623a27c6","fast_id":"d538f509d440a83105219d3faf77164065011009a4e55f69dac1993d6180e66a","fast_time":0.0001973778,"language":"cpp","measured_fast_code_id":"d538f509d440a83105219d3faf77164065011009a4e55f69dac1993d6180e66a","measured_slow_code_id":"56bdc598700060346edba5ee10d1abe8033eb677a89eb620964f294957f0f63f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5016","problem_id":"p04045","slow_code_id":"31ae1b53f0f6a6853928c509e34c5dfb9d06bd7598874dc3982dd4003e596aee","slow_id":"56bdc598700060346edba5ee10d1abe8033eb677a89eb620964f294957f0f63f","slow_time":0.0014218304,"speedup":7.203598378338395,"stratum":"4-8","sampling_key":"7b698df02b16bc321aaeed972c16622a4a1049a6fbfc75011eeff5219c242b20","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define Inf 0x3f3f3f3f\n\nusing namespace std;\n\ntypedef long long ll;\n\nint a[100010];\n\nint vis[100010];\n\nbool check(int n)\n\n{\n\n  while (n)\n\n  {\n\n    if (vis[n % 10])\n\n      return false;\n\n    n /= 10;\n  }\n\n  return true;\n}\n\nint main()\n\n{\n\n  int n, k;\n\n  scanf(\"%d %d\", &n, &k);\n\n  memset(vis, 0, sizeof(vis));\n\n  for (int i = 0; i < k; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n\n    vis[a[i]] = 1;\n  }\n\n  for (int i = n;; i++)\n\n  {\n\n    if (check(i))\n\n    {\n\n      printf(\"%d\\n\", i);\n\n      return 0;\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nint n, k, x;\n\nbool arr[10];\n\nbool check(int n)\n\n{\n\n  while (n)\n\n  {\n\n    if (arr[n % 10])\n\n      return 0;\n\n    n /= 10;\n  }\n\n  return 1;\n}\n\nint main()\n\n{\n\n  while (scanf(\"%d%d\", &n, &k) != EOF)\n\n  {\n\n    for (int i = 0; i < k; i++)\n\n    {\n\n      scanf(\"%d\", &x);\n\n      arr[x] = 1;\n    }\n\n    for (int i = n;; i++)\n\n    {\n\n      if (check(i))\n\n      {\n\n        printf(\"%d\\n\", i);\n\n        break;\n      }\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"8f9c888f6efb52a52053470d55b1226d27d6ceb4bcd53bbaaf13561d9eb2a216","fast_id":"dc57cee783afaea0ff64b23157798b3837301746946731514c2d547442c729ba","fast_time":0.0198563851,"language":"cpp","measured_fast_code_id":"dc57cee783afaea0ff64b23157798b3837301746946731514c2d547442c729ba","measured_slow_code_id":"f1b3784c59b32b8c272f23a10d2b57fffa4cdf51a133ee5a6acc2e6f0435ba94","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50405","problem_id":"p04029","slow_code_id":"1a12d4896bc9bfd778e548e897ab2f8d08e4a53abcc2762eb8b4a9ae0240eccd","slow_id":"f1b3784c59b32b8c272f23a10d2b57fffa4cdf51a133ee5a6acc2e6f0435ba94","slow_time":0.3747682993,"speedup":18.87394394360331,"stratum":"8+","sampling_key":"0068d5e5e13b9d5b57914deaaea919762792a62468dd78ea5ee13c9c52bee421","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 100005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nbool check[maxii];\n\nbool dfs(int node, int c)\n\n{\n\n  check[node] = true;\n\n  arr2[node] = c;\n\n  for (int child = 0; child < vi[node].size(); child++)\n\n  {\n\n    if (check[vi[node][child]] == false)\n\n    {\n\n      if (dfs(vi[node][child], c ^ 1) == false)\n\n      {\n\n        return false;\n      }\n\n    }\n\n    else if (arr2[node] == arr2[vi[node][child]])\n\n    {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  int res = n * (n + 1);\n\n  res /= 2;\n\n  cout << res;\n}\n","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int N, candies = 0;\n\n  int i;\n\n  scanf(\"%d\", &N);\n\n  for (i = 1; i <= N; i++) {\n\n    candies = candies + i;\n  }\n\n  printf(\"%d\", candies);\n\n  return 0;\n}"}
{"fast_code_id":"fa558bcabbc52eb8a8b6219873e4ad7c3ce932b1aad56a571349b67540ee96e1","fast_id":"a74285bf2d8a4c3dbad59f0493bb51232759ec2b6d1bf6a6fcdb36d3dba96b76","fast_time":0.1041508823,"language":"cpp","measured_fast_code_id":"a74285bf2d8a4c3dbad59f0493bb51232759ec2b6d1bf6a6fcdb36d3dba96b76","measured_slow_code_id":"29320bae76a1559e5a3040629edb514c99799a1172720292ca2a82ad8d8581a7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50579","problem_id":"p02284","slow_code_id":"eb9b9553c1acf3656d9aaeaf5b622eb23df0f2058013cf489365b693afd16c24","slow_id":"29320bae76a1559e5a3040629edb514c99799a1172720292ca2a82ad8d8581a7","slow_time":1.1505239697,"speedup":11.046704015295703,"stratum":"8+","sampling_key":"0d272f2e99ec0fb1b1676fabebecdf2b2ce58f8f842243d17c96c667a46876e1","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\nusing namespace std;\n\n#define N 600000\n\n#define NIL -1\n\nint key[N];\n\nint parent[N];\n\nint leftc[N];\n\nint rightc[N];\n\nint root = NIL;\n\nvoid insert(int z) {\n\n  int x, y;\n\n  y = NIL;\n\n  x = root;\n\n  while (x != NIL) {\n\n    y = x;\n\n    if (key[z] < key[x])\n      x = leftc[x];\n\n    else\n      x = rightc[x];\n  }\n\n  parent[z] = y;\n\n  if (y == NIL)\n    root = z;\n\n  else if (key[z] < key[y])\n    leftc[y] = z;\n\n  else\n    rightc[y] = z;\n}\n\nbool find(int now, int data) {\n\n  if (now == NIL)\n    return false;\n\n  if (data == key[now])\n    return true;\n\n  if (data < key[now])\n    return find(leftc[now], data);\n\n  else\n    return find(rightc[now], data);\n}\n\nvoid inorderprint(int now) {\n\n  if (now != NIL) {\n\n    inorderprint(leftc[now]);\n\n    printf(\" %d\", key[now]);\n\n    inorderprint(rightc[now]);\n  }\n}\n\nvoid preorderprint(int now) {\n\n  if (now != NIL) {\n\n    printf(\" %d\", key[now]);\n\n    preorderprint(leftc[now]);\n\n    preorderprint(rightc[now]);\n  }\n}\n\nint main() {\n\n  int n, i, j, data;\n\n  int z = 0;\n\n  char str[10];\n\n  for (i = 0; i < N; i++) {\n\n    parent[i] = NIL;\n\n    key[i] = NIL;\n\n    rightc[i] = NIL;\n\n    leftc[i] = NIL;\n  }\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++) {\n\n    scanf(\"%s\", str);\n\n    if (strcmp(str, \"insert\") == 0) {\n\n      scanf(\"%d\", &data);\n\n      key[z] = data;\n\n      insert(z);\n\n      z++;\n\n    }\n\n    else if (strcmp(str, \"find\") == 0) {\n\n      scanf(\"%d\", &data);\n\n      if (find(root, data) == true)\n        printf(\"yes\\n\");\n\n      else\n        printf(\"no\\n\");\n\n    }\n\n    else if (strcmp(str, \"print\") == 0) {\n\n      inorderprint(root);\n\n      cout << endl;\n\n      preorderprint(root);\n\n      cout << endl;\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\nusing namespace std;\n\n#define NIL NULL\n\nstruct Node {\n\n  int key;\n\n  struct Node *parent;\n\n  struct Node *leftc;\n\n  struct Node *rightc;\n};\n\ntypedef struct Node *Nodepointer;\n\nNodepointer root;\n\nvoid insert(int k) {\n\n  Nodepointer x, y, z;\n\n  y = NIL;\n\n  x = root;\n\n  z = new struct Node();\n\n  z->key = k;\n\n  z->leftc = NIL;\n\n  z->rightc = NIL;\n\n  while (x != NIL) {\n\n    y = x;\n\n    if (z->key < x->key)\n      x = x->leftc;\n\n    else\n      x = x->rightc;\n  }\n\n  z->parent = y;\n\n  if (y == NIL)\n    root = z;\n\n  else if (z->key < y->key)\n    y->leftc = z;\n\n  else\n    y->rightc = z;\n}\n\nNodepointer find(Nodepointer now, int data) {\n\n  if (now == NIL || data == now->key)\n    return now;\n\n  if (data < now->key)\n    return find(now->leftc, data);\n\n  else\n    return find(now->rightc, data);\n}\n\nvoid inorderprint(Nodepointer now) {\n\n  if (now != NIL) {\n\n    inorderprint(now->leftc);\n\n    printf(\" %d\", now->key);\n\n    inorderprint(now->rightc);\n  }\n}\n\nvoid preorderprint(Nodepointer now) {\n\n  if (now != NIL) {\n\n    printf(\" %d\", now->key);\n\n    preorderprint(now->leftc);\n\n    preorderprint(now->rightc);\n  }\n}\n\nint main() {\n\n  int n, i, j, data;\n\n  char str[10];\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++) {\n\n    scanf(\"%s\", str);\n\n    if (strcmp(str, \"insert\") == 0) {\n\n      scanf(\"%d\", &data);\n\n      insert(data);\n\n    }\n\n    else if (strcmp(str, \"find\") == 0) {\n\n      scanf(\"%d\", &data);\n\n      if (find(root, data) != NIL)\n        printf(\"yes\\n\");\n\n      else\n        printf(\"no\\n\");\n\n    }\n\n    else if (strcmp(str, \"print\") == 0) {\n\n      inorderprint(root);\n\n      cout << endl;\n\n      preorderprint(root);\n\n      cout << endl;\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"3f6f55fb5be3eb5ce8a1ebeb966b88b4b22795c9672fc4665a1ed9829d74fa1a","fast_id":"904b2a2a0b8fade7143fee40d6229b9182467a42e90adb9558d961a632665d50","fast_time":0.0138831587,"language":"cpp","measured_fast_code_id":"904b2a2a0b8fade7143fee40d6229b9182467a42e90adb9558d961a632665d50","measured_slow_code_id":"8cab6db2c6f4c73ffc4ea76efccca701607216523d5d297c29c5e682df9ff4dc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50591","problem_id":"p04039","slow_code_id":"101dacd4782e51b75a8d5336591a8f13d01d9bc91c10b2f0ebf249396e8ca10d","slow_id":"8cab6db2c6f4c73ffc4ea76efccca701607216523d5d297c29c5e682df9ff4dc","slow_time":0.0800864264,"speedup":5.76860267397217,"stratum":"4-8","sampling_key":"145da5e7dca9166bde8619a7bd7c2e6ef0480918cf4c9612361e0450d9c66777","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <fstream>\n\n#include <iomanip>\n\n#include <valarray>\n\n#include <iterator>\n\n#include <stack>\n\n#include <set>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <queue>\n\n#include <list>\n\n#include <map>\n\n#include <strstream>\n\n#include <streambuf>\n\n#include <string>\n\n#include <sstream>\n\n#define def(type, vec) vector<type> vec\n\n#define last(arr) arr.size() - a\n\n#define loop(i, n) for (ll i = 0; i < n; ++i)\n\n#define all(v) ((v).begin()), ((v).end())\n\n#define pb push_back\n\n#define ll long long\n\n#define iteloop(type, data, name, it)                                          \\\n  for (type<data>::iterator it = name.begin(); it != name.end(); ++it)\n\nusing namespace std;\n\nstring int_to_string(int x) {\n\n  string str;\n\n  ostringstream temp;\n\n  temp << x;\n\n  str = temp.str();\n\n  return str;\n}\n\nint main() {\n\n  int n, k;\n\n  cin >> n >> k;\n\n  char chr;\n\n  set<char> st;\n\n  loop(i, k) {\n\n    cin >> chr;\n\n    st.insert(chr);\n  }\n\n  for (int i = n; i <= 100000; i++) {\n\n    string str = int_to_string(i);\n\n    bool x = true;\n\n    loop(j, str.size()) {\n\n      if (binary_search(all(st), str[j])) {\n\n        x = false;\n      }\n    }\n\n    if (x) {\n\n      cout << i << endl;\n\n      break;\n    }\n  }\n}\n","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\n#define MAX_N 10000\n\n#define MAX_k 9\n\nint N, k;\n\nint D[MAX_k];\n\nint check(int a) {\n\n  int i, j, n, m;\n\n  n = a;\n\n  while (n != 0) {\n\n    m = n % 10;\n\n    for (j = 0; j < k; j++)\n\n      if (m == D[j])\n        return 1;\n\n    n /= 10;\n  }\n\n  return 0;\n}\n\nint main() {\n\n  int i;\n\n  scanf(\"%d%d\", &N, &k);\n\n  for (i = 0; i < k; i++)\n\n    scanf(\"%d\", &D[i]);\n\n  i = N;\n\n  while (1)\n\n  {\n\n    if (check(i) == 0)\n      break;\n\n    else\n\n    {\n\n      i++;\n    }\n  }\n\n  printf(\"%d\\n\", i);\n\n  return 0;\n}\n"}
{"fast_code_id":"39f176c225228d05c0e5540c5fe71f5619753d534be01ba92affef705c48fd75","fast_id":"116baf51e8f5155dafb800e3a2f309141f28c49b5037f7b61772012ee75694aa","fast_time":0.0047780687,"language":"cpp","measured_fast_code_id":"116baf51e8f5155dafb800e3a2f309141f28c49b5037f7b61772012ee75694aa","measured_slow_code_id":"8ce00404e66821f96c1477f0c728363fe8dd81c45e2b55448617f9ed8f33284f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50617","problem_id":"p00618","slow_code_id":"2568a26b121abc6e0dbffb249e16d1fba08724d4495358dfbffaf320460e21ad","slow_id":"8ce00404e66821f96c1477f0c728363fe8dd81c45e2b55448617f9ed8f33284f","slow_time":0.053145559,"speedup":11.122811817251604,"stratum":"8+","sampling_key":"414542b2019bf660fb04fd5c601f238014b8362c177ac2bfa9399c3510864419","slow_code":"#include <cstdio>\n\n#include <cctype>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\n#define REP(i, N) for (int i = 0; i < (int)(N); ++i)\n\nint unit[20];\n\nint need[20];\n\nint nextInt() {\n  int r = 0, ch;\n  while (isspace(ch = getchar()))\n    ;\n  do {\n    r = r * 10 + ch - '0';\n  } while (isdigit(ch = getchar()));\n  return r;\n}\n\nbool visited[1 << 20];\n\nstruct State {\n\n  int one, mask, have;\n};\n\nint solve(int N, int U) {\n\n  memset(visited, 0, sizeof(visited));\n\n  queue<State> up;\n\n  State s;\n\n  s.one = 0;\n\n  s.mask = 0;\n\n  s.have = 0;\n\n  visited[s.mask] = 1;\n\n  up.push(s);\n\n  while (!up.empty()) {\n\n    s = up.front();\n    up.pop();\n\n    if (s.have >= U)\n      return s.one;\n\n    for (int i = 0; i < N; i++)\n\n      if (visited[s.mask | (1 << i)] == 0 && (s.mask | need[i]) == s.mask)\n\n      {\n\n        State next;\n\n        next.mask = s.mask | (1 << i);\n\n        next.one = s.one + 1;\n\n        next.have = s.have + unit[i];\n\n        visited[next.mask] = 1;\n\n        up.push(next);\n      }\n  }\n\n  return -1;\n}\n\nint main() {\n\n  for (;;) {\n\n    int N, U;\n\n    N = nextInt();\n\n    U = nextInt();\n\n    if (N == 0 && U == 0)\n      break;\n\n    REP(i, N) need[i] = 0;\n\n    int all = 0;\n\n    REP(i, N) {\n\n      unit[i] = nextInt();\n\n      all += unit[i];\n\n      int K = nextInt();\n\n      REP(k, K) {\n\n        int x = nextInt();\n\n        need[i] |= (1 << x);\n      }\n    }\n\n    if (all == U) {\n\n      printf(\"%d\\n\", N);\n\n      continue;\n    }\n\n    int best = solve(N, U);\n\n    printf(\"%d\\n\", best);\n  }\n}","fast_code":"#include <cstdio>\n\n#include <cctype>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\n#define REP(i, N) for (int i = 0; i < (int)(N); ++i)\n\nint unit[20];\n\nint need[20];\n\nint nextInt() {\n  int r = 0, ch;\n  while (isspace(ch = getchar()))\n    ;\n  do {\n    r = r * 10 + ch - '0';\n  } while (isdigit(ch = getchar()));\n  return r;\n}\n\nint best;\n\nint N, U;\n\nint tno;\n\nint gain[20];\n\nchar visited[1 << 20];\n\nvoid dfs(int mask, int one, int have) {\n\n  if (best <= one)\n    return;\n\n  if (have >= U) {\n\n    best = one;\n\n    return;\n  }\n\n  if (have + gain[best - one - 1] < U)\n    return;\n\n  for (int i = 0; i < N; i++)\n\n    if (visited[mask | (1 << i)] != tno && (mask | need[i]) == mask)\n\n    {\n\n      visited[mask | (1 << i)] = tno;\n\n      dfs(mask | (1 << i), one + 1, have + unit[i]);\n    }\n}\n\nint main() {\n\n  for (tno = 1;; tno++) {\n\n    N = nextInt();\n\n    U = nextInt();\n\n    if (N == 0 && U == 0)\n      break;\n\n    REP(i, N) need[i] = 0;\n\n    int all = 0;\n\n    REP(i, N) {\n\n      unit[i] = nextInt();\n\n      all += unit[i];\n\n      gain[i] = unit[i];\n\n      int K = nextInt();\n\n      REP(k, K) {\n\n        int x = nextInt();\n\n        need[i] |= (1 << x);\n      }\n    }\n\n    sort(gain, gain + N);\n\n    reverse(gain, gain + N);\n\n    for (int i = 1; i < N; i++)\n\n      gain[i] += gain[i - 1];\n\n    if (all == U) {\n\n      printf(\"%d\\n\", N);\n\n      continue;\n    }\n\n    best = N;\n\n    dfs(0, 0, 0);\n\n    printf(\"%d\\n\", best);\n  }\n}"}
{"fast_code_id":"fb2d0413a6e3e09f7e412d99c1cceb7ecb7c2cb7a19665d9a153b3953cea4c10","fast_id":"861358e56b13bead4aa0e415abc7e13a2032b1e280c0963359406d3b7f200b88","fast_time":0.1049836459,"language":"cpp","measured_fast_code_id":"861358e56b13bead4aa0e415abc7e13a2032b1e280c0963359406d3b7f200b88","measured_slow_code_id":"f26866a82b822ddd4aabc8e2e319ef0fc31eaf530a23a776d4312c7b43994719","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50620","problem_id":"p03685","slow_code_id":"e8a5e869466a48523d0b631d216f0bb8d38971407635304e2292ca79019d62a6","slow_id":"f26866a82b822ddd4aabc8e2e319ef0fc31eaf530a23a776d4312c7b43994719","slow_time":0.3546916762,"speedup":3.3785421830163354,"stratum":"2-4","sampling_key":"1249229683d83313225763b418f1a3c6fceeb9b208f45d56723b6407c746681a","slow_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\n#define mst(a, b) memset(a, b, sizeof(a))\n\n#define lowbit(x) ((x) & (-x))\n\n#define X first\n\n#define Y second\n\nusing namespace std;\n\nusing namespace __gnu_cxx;\n\nusing namespace __gnu_pbds;\n\ntypedef long long LL;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\nconst int inf = 0x3f3f3f3f;\n\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n\nconst int maxn = 200000 + 10;\n\nconst int maxm = 2222222 + 10;\n\nconst int mod = 1e9 + 7;\n\nconst double eps = 1e-9;\n\nint r, c;\n\nbool check(int x, int y) { return x == 0 || x == r || y == 0 || y == c; }\n\nll dist(int x, int y) { return 1ll * x * x + 1ll * y * y; }\n\nstruct Point {\n\n  int x, y, id;\n\n  Point(int x = 0, int y = 0, int id = 0) : x(x), y(y), id(id) {}\n\n  bool operator<(const Point &rhs) const {\n\n    return 1ll * x * rhs.y > 1ll * rhs.x * y ||\n           1ll * x * rhs.y == 1ll * rhs.x * y &&\n               dist(x, y) < dist(rhs.x, rhs.y);\n  }\n\n} a[maxn];\n\nbool in[maxn];\n\nstack<int> stk;\n\nint main() {\n\n#ifdef local\n\n  freopen(\"in.txt\", \"r\", stdin);\n\n#endif\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n  cout.tie(0);\n\n  int n;\n  cin >> r >> c >> n;\n\n  int tot = 0, p = -1;\n\n  for (int i = 0; i < n; i++) {\n\n    int x1, y1, x2, y2;\n    cin >> x1 >> y1 >> x2 >> y2;\n\n    if (check(x1, y1) && check(x2, y2)) {\n\n      if (p == -1 || (a[p].y > y1 || a[p].y == y1 && a[p].x > x1))\n        p = tot;\n\n      a[tot++] = Point(x1, y1, i);\n\n      if (p == -1 || (a[p].y > y2 || a[p].y == y2 && a[p].x > x2))\n        p = tot;\n\n      a[tot++] = Point(x2, y2, i);\n    }\n  }\n\n  if (~p) {\n\n    int dx = a[p].x, dy = a[p].y;\n\n    for (int i = 0; i < tot; i++) {\n\n      a[i].x -= dx;\n\n      a[i].y -= dy;\n    }\n\n    sort(a, a + tot);\n\n    for (int i = 0; i < tot; i++) {\n\n      if (!in[a[i].id]) {\n\n        in[a[i].id] = true;\n\n        stk.push(a[i].id);\n\n      } else {\n\n        if (stk.top() != a[i].id) {\n\n          cout << \"NO\\n\";\n\n          return 0;\n        }\n\n        stk.pop();\n\n        in[a[i].id] = false;\n      }\n    }\n  }\n\n  cout << \"YES\\n\";\n\n  return 0;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace __gnu_pbds;\n\nusing namespace std;\n\n#define ll long long\n\n#define ld long double\n\ntypedef pair<ll, ll> ii;\n\ntypedef vector<ll> vi;\n\ntypedef vector<vi> vvi;\n\ntypedef vector<ii> vii;\n\ntypedef vector<vii> vvii;\n\n#define pq priority_queue\n\n#define ff first\n\n#define ss second\n\n#define pb push_back\n\n#define mp make_pair\n\n#define all(c) (c).begin(), (c).end()\n\n#define ordered_set                                                            \\\n  tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>\n\nint main(void)\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  ll r, c, n;\n\n  cin >> r >> c >> n;\n\n  vector<ii> seg;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    ll x1, x2, y1, y2;\n\n    cin >> x1 >> y1 >> x2 >> y2;\n\n    ll flag = 0;\n\n    if (x1 == 0 || x1 == r || y1 == 0 || y1 == c)\n\n      flag++;\n\n    if (x2 == 0 || x2 == r || y2 == 0 || y2 == c)\n\n      flag++;\n\n    if (flag == 2)\n\n    {\n\n      if (x1 == 0)\n\n        seg.pb({y1, i});\n\n      else if (y1 == c)\n\n        seg.pb({c + x1, i});\n\n      else if (x1 == r)\n\n        seg.pb({r + c + (c - y1), i});\n\n      else if (y1 == 0)\n\n        seg.pb({r + (2 * c) + (r - x1), i});\n\n      if (x2 == 0)\n\n        seg.pb({y2, i});\n\n      else if (y2 == c)\n\n        seg.pb({c + x2, i});\n\n      else if (x2 == r)\n\n        seg.pb({r + c + (c - y2), i});\n\n      else if (y2 == 0)\n\n        seg.pb({r + (2 * c) + (r - x2), i});\n    }\n  }\n\n  sort(all(seg));\n\n  stack<ll> s;\n\n  for (auto it : seg)\n\n  {\n\n    if (!s.empty() && s.top() == it.ss)\n\n      s.pop();\n\n    else\n\n      s.push(it.ss);\n  }\n\n  if (s.empty())\n\n    cout << \"YES\\n\";\n\n  else\n\n    cout << \"NO\\n\";\n}\n"}
{"fast_code_id":"f006ab339203816fbbd20a7875dde064c5b1af590f6c6be05797bc7c848de98a","fast_id":"371ac0ce145818d1b72b7236d63add9f3ca225443b8c7b478dac58fb9674aac8","fast_time":0.010897198,"language":"cpp","measured_fast_code_id":"371ac0ce145818d1b72b7236d63add9f3ca225443b8c7b478dac58fb9674aac8","measured_slow_code_id":"557a19734925f58ba7f29e4f08b44e779f251dc9a23c52ead71f1b1997d025d8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50630","problem_id":"p01130","slow_code_id":"cc1bf137748f8c572acd7c2052672eba9c8bd5274abba284c72b244b6034b57e","slow_id":"557a19734925f58ba7f29e4f08b44e779f251dc9a23c52ead71f1b1997d025d8","slow_time":0.0488975132,"speedup":4.487163874603361,"stratum":"4-8","sampling_key":"9f0f23d8debcb64224a3b3436d6bc39c083386b4727bb9e3fac9d5b95977dfc7","slow_code":"#include <iostream>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef int W;\n\nconst int MAXV = 1005;\n\nconst int MAXE = 5005;\n\nconst int INF = 100000000;\n\nint adj[100][100];\n\nint main() {\n\n  int n, m, s, g1, g2, b1, b2, c;\n\n  while (cin >> n >> m >> s >> g1 >> g2, n | m | s | g1 | g2) {\n\n    s--, g1--, g2--;\n\n    for (int i = 0; i < 100; ++i) {\n\n      for (int j = 0; j < 100; ++j)\n\n        adj[i][j] = INF;\n\n      adj[i][i] = 0;\n    }\n\n    for (int i = 0; i < m; ++i) {\n\n      cin >> b1 >> b2 >> c;\n\n      b1--, b2--;\n\n      adj[b1][b2] = c;\n    }\n\n    for (int k = 0; k < n; ++k)\n\n      for (int i = 0; i < n; ++i) {\n\n        const int p = adj[i][k];\n\n        for (int j = 0; j < n; ++j)\n\n          adj[i][j] = min(adj[i][j], p + adj[k][j]);\n      }\n\n    int minc = INF;\n\n    for (int i = 0; i < n; ++i)\n\n      minc = min(minc, (adj[s][i] + adj[i][g1] + adj[i][g2]));\n\n    cout << minc << endl;\n  }\n}","fast_code":"#include <queue>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef int W;\n\nconst int MAXV = 1005;\n\nconst int MAXE = 5005;\n\nconst int INF = 100000000;\n\nint adj[100][100];\n\nint main() {\n\n  int n, m, s, g1, g2, b1, b2, c;\n\n  while (~scanf(\"%d%d%d%d%d\", &n, &m, &s, &g1, &g2),\n\n         n | m | s | g1 | g2) {\n\n    s--, g1--, g2--;\n\n    for (int i = 0; i < 100; ++i) {\n\n      for (int j = 0; j < 100; ++j)\n\n        adj[i][j] = INF;\n\n      adj[i][i] = 0;\n    }\n\n    for (int i = 0; i < m; ++i) {\n\n      scanf(\"%d%d%d\", &b1, &b2, &c);\n\n      b1--, b2--;\n\n      adj[b1][b2] = c;\n    }\n\n    for (int k = 0; k < n; ++k)\n\n      for (int i = 0; i < n; ++i) {\n\n        const int p = adj[i][k];\n\n        for (int j = 0; j < n; ++j)\n\n          adj[i][j] = min(adj[i][j], p + adj[k][j]);\n      }\n\n    int minc = INF;\n\n    for (int i = 0; i < n; ++i)\n\n      minc = min(minc, adj[s][i] + adj[i][g1] + adj[i][g2]);\n\n    printf(\"%d\\n\", minc);\n  }\n}"}
{"fast_code_id":"1e607bc51d25d183b2fea51a573cd627140fae02e3423c77d405129a931d6c2d","fast_id":"0bc1159b7427c2679cf1ce2474ece09df1e1952c6c668e9eaed7b24ce8dc9378","fast_time":0.1047167979,"language":"cpp","measured_fast_code_id":"0bc1159b7427c2679cf1ce2474ece09df1e1952c6c668e9eaed7b24ce8dc9378","measured_slow_code_id":"e00e4ea98549bc86b57d39511c5fdaba46a3b3d81e0934d1043aeac9dc177b27","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50646","problem_id":"p03738","slow_code_id":"e15eee1cd0138e05d5fa11f668539aa91c23d34fd5b0b5bc31394f17e527c7b9","slow_id":"e00e4ea98549bc86b57d39511c5fdaba46a3b3d81e0934d1043aeac9dc177b27","slow_time":0.8488419337,"speedup":8.106072289477446,"stratum":"8+","sampling_key":"0692ecf0f2fe4521f6cee85a43c1d33888b44852c15cbb52fa53e2b8d8bf7a10","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long int\n\n#define sz 200010\n\nusing namespace std;\n\nstring ss[sz];\n\nint main()\n\n{\n\n  string a, b;\n\n  ll x, y;\n\n  cin >> a >> b;\n\n  x = a.length();\n\n  y = b.length();\n\n  if (x > y)\n\n    cout << \"GREATER\" << endl;\n\n  else if (x < y)\n\n    cout << \"LESS\" << endl;\n\n  else\n\n  {\n\n    for (ll i = 0; i < x; i++)\n\n    {\n\n      if (a[i] > b[i])\n\n      {\n\n        cout << \"GREATER\" << endl;\n\n        return 0;\n\n      }\n\n      else if (a[i] < b[i])\n\n      {\n\n        cout << \"LESS\" << endl;\n\n        return 0;\n      }\n    }\n\n    cout << \"EQUAL\" << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nmap<int, int> mp;\n\nmap<char, int>::iterator it;\n\nvector<int> v[1000];\n\nint main()\n\n{\n\n  string s, s1;\n\n  cin >> s >> s1;\n\n  int l, l1, c = 0, f = 0, d, r, m;\n\n  l = s.length();\n\n  l1 = s1.length();\n\n  if (l > l1) {\n    cout << \"GREATER\" << endl;\n  }\n\n  else if (l < l1) {\n    cout << \"LESS\" << endl;\n  }\n\n  else\n\n  {\n\n    for (int i = 0; i < l; i++)\n\n    {\n\n      if (s[i] != s1[i])\n\n      {\n\n        d = s[i] - '0';\n\n        m = s1[i] - '0';\n\n        if (d > m) {\n          f = 1;\n        }\n\n        else {\n          f = 2;\n        }\n\n        break;\n      }\n    }\n\n    if (f == 0) {\n      cout << \"EQUAL\" << endl;\n    }\n\n    else if (f == 1) {\n      cout << \"GREATER\" << endl;\n    }\n\n    else {\n      cout << \"LESS\" << endl;\n    }\n  }\n}\n"}
{"fast_code_id":"97be12a1dbff1f94b784ecf8a9f60cef59d4a14abc378c8dcf6ae13b95125a22","fast_id":"521c05e47f234f88c72ee5fc9a13c7ce4bb8543509921bb4a754bf7c5706b2df","fast_time":0.1072977297,"language":"cpp","measured_fast_code_id":"521c05e47f234f88c72ee5fc9a13c7ce4bb8543509921bb4a754bf7c5706b2df","measured_slow_code_id":"80a413e7f32b6c686e8a7b9f6a26209d9b91e1f550fa1319720e5b2e92787bd8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50656","problem_id":"p02987","slow_code_id":"85acb9c5d8a80018bf68f8fd6f2a9bfe8b2eb5d47c278588c3472ca187f96da7","slow_id":"80a413e7f32b6c686e8a7b9f6a26209d9b91e1f550fa1319720e5b2e92787bd8","slow_time":0.6931973388,"speedup":6.460503318552508,"stratum":"4-8","sampling_key":"2e6e9c307aeefa0a8e29f6c38923e09d7d934be17cb23f670cb635a67f19b797","slow_code":"#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <string>\n\n#include <vector>\n\n#include <limits>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <sstream>\n\n#include <numeric>\n\n#include <iterator>\n\nusing namespace std;\n\n#define repd(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rep(i, n) repd(i, 0, n)\n\ntypedef long long ll;\n\ntypedef pair<int, int> P;\n\nconst int V = 100005;\n\nvector<int> to[V * 2];\n\nbool visited[V * 2];\n\nvector<int> cnt;\n\nvoid dfs(int v) {\n\n  if (visited[v])\n    return;\n\n  visited[v] = true;\n\n  cnt[v / V]++;\n\n  for (int u : to[v])\n    dfs(u);\n}\n\nint main(int argc, const char *argv[]) {\n\n  string s;\n\n  cin >> s;\n\n  char first = s[0];\n\n  char second = '\\0';\n\n  rep(i, 4) {\n\n    if (first != s[i]) {\n\n      second = s[i];\n\n      break;\n    }\n  }\n\n  int sum1 = 0, sum2 = 0;\n\n  rep(i, 4) {\n\n    if (first == s[i]) {\n\n      sum1 += 1;\n\n    } else if (second == s[i]) {\n\n      sum2 += 1;\n    }\n  }\n\n  bool flag = false;\n\n  if (sum1 == 2 && sum2 == 2)\n    flag = true;\n\n  if (flag) {\n\n    puts(\"Yes\");\n\n  } else {\n\n    puts(\"No\");\n  }\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <map>\n\nusing namespace std;\n\n#define repd(i, a, b) for (int i = (a); i < (b); ++i)\n\n#define rep(i, n) repd(i, 0, n)\n\nint main() {\n\n  string s;\n\n  cin >> s;\n\n  map<char, int> mp;\n\n  rep(i, s.size()) { mp[s[i]] += 1; }\n\n  for (auto value : mp) {\n\n    if (value.second != 2) {\n\n      cout << \"No\" << endl;\n\n      return 0;\n    }\n  }\n\n  cout << \"Yes\" << endl;\n\n  return 0;\n}"}
{"fast_code_id":"b987fb3b77f9cbf681e1e91a66aa225bd3f52447a5024463267685688a34526e","fast_id":"26cf5b10b7fef1b613813de8e12f8b43d6688fdccf36ccaa2f67b301334f4a54","fast_time":0.0070598642,"language":"cpp","measured_fast_code_id":"26cf5b10b7fef1b613813de8e12f8b43d6688fdccf36ccaa2f67b301334f4a54","measured_slow_code_id":"e45989d2b565dd181560a49acdb48ee24386509c94ea425ce3c7112e25f9cb57","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50663","problem_id":"p03556","slow_code_id":"5a4f07396c3b05d8b7c602b3d9bb922d837c8c0b62ad1ee8f8d3aaee0f749dbc","slow_id":"e45989d2b565dd181560a49acdb48ee24386509c94ea425ce3c7112e25f9cb57","slow_time":0.0344185922,"speedup":4.875248478575551,"stratum":"4-8","sampling_key":"7fe2f0df927ac816fa64b3fc9c957e05a9c1d61e2821065ba5eb7e33eb9f1cfe","slow_code":"#include <iostream>\n\nusing namespace std;\n\nbool IsSquare(int N)\n\n{\n\n  int i;\n\n  for (i = 1; N > 0; i += 2)\n\n  {\n\n    N -= i;\n  }\n\n  if (N == 0)\n\n    return true;\n\n  else\n\n    return false;\n}\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  while (n) {\n\n    if (IsSquare(n)) {\n\n      cout << n;\n\n      break;\n\n    }\n\n    else\n      n--;\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  n = sqrt(n);\n\n  printf(\"%d\\n\", n * n);\n\n  return 0;\n}"}
{"fast_code_id":"d1338bf0f5bf7c12d089c6283d99cf048231eb1c08fa6559b54b0a6c33d76f09","fast_id":"f584b6e0e4dd75b0184bc236ade117aaa36e8a3ca5df3116e3fec336df3b1afd","fast_time":0.0824893761,"language":"cpp","measured_fast_code_id":"f584b6e0e4dd75b0184bc236ade117aaa36e8a3ca5df3116e3fec336df3b1afd","measured_slow_code_id":"3ed1acf8d8986389800fca850d2c8d239068b23f4203eb952e17907aa6f46fe2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50690","problem_id":"p02748","slow_code_id":"8af8cac057003b08a11274828e5215cc8852bc94ed0484f900806b2f11b70841","slow_id":"3ed1acf8d8986389800fca850d2c8d239068b23f4203eb952e17907aa6f46fe2","slow_time":0.3895123206,"speedup":4.7219695312982255,"stratum":"4-8","sampling_key":"632a258f565ea0fa487dc377c3c74b615fddafec674c92e7c245caa184cf3004","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, a, b) for (int i = a; i < b; i++)\n\n#define rrep(i, a, b) for (int i = a; i >= b; i--)\n\n#define fore(i, a) for (auto &i : a)\n\n#define all(x) (x).begin(), (x).end()\n\nusing namespace std;\nvoid _main();\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  _main();\n}\n\ntypedef long long ll;\nconst int inf = INT_MAX / 2;\nconst ll infl = 1LL << 60;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\n#define def inf\n\ntemplate <class V, int NV> struct SegTree {\n\n  V comp(V &l, V &r) { return min(l, r); };\n\n  vector<V> val;\n  SegTree() { val = vector<V>(NV * 2, def); }\n\n  V get(int x, int y, int l = 0, int r = NV, int k = 1) {\n\n    if (r <= x || y <= l)\n      return def;\n    if (x <= l && r <= y)\n      return val[k];\n\n    auto a = get(x, y, l, (l + r) / 2, k * 2);\n\n    auto b = get(x, y, (l + r) / 2, r, k * 2 + 1);\n\n    return comp(a, b);\n  }\n\n  void update(int i, V v) {\n\n    i += NV;\n    val[i] = v;\n\n    while (i > 1)\n      i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]);\n  }\n\n  void add(int i, V v) { update(i, val[i + NV] + v); }\n\n  V operator[](int x) { return get(x, x + 1); }\n};\n\nint A, B, M;\n\nint a[101010], b[101010];\n\nvector<pair<int, int>> coupons[101010];\n\nSegTree<int, 1 << 17> st;\n\nvoid _main() {\n\n  cin >> A >> B >> M;\n\n  rep(i, 0, A) cin >> a[i];\n\n  rep(i, 0, B) cin >> b[i];\n\n  rep(i, 0, B) st.update(i, b[i]);\n\n  rep(i, 0, M) {\n\n    int x, y, c;\n    cin >> x >> y >> c;\n\n    y--;\n    x--;\n\n    coupons[x].push_back({y, c});\n  }\n\n  int ans = inf;\n\n  rep(i, 0, A) {\n\n    fore(cp, coupons[i]) {\n\n      chmin(ans, a[i] + b[cp.first] - cp.second);\n\n      st.update(cp.first, inf);\n    }\n\n    chmin(ans, a[i] + st.get(0, B));\n\n    fore(cp, coupons[i]) st.update(cp.first, b[cp.first]);\n  }\n\n  cout << ans << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define rep(i, a, b) for (int i = a; i < b; i++)\n\n#define rrep(i, a, b) for (int i = a; i >= b; i--)\n\n#define fore(i, a) for (auto &i : a)\n\n#define all(x) (x).begin(), (x).end()\n\nusing namespace std;\nvoid _main();\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  _main();\n}\n\ntypedef long long ll;\nconst int inf = INT_MAX / 2;\nconst ll infl = 1LL << 60;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nint A, B, M;\n\nint a[101010], b[101010];\n\nvoid _main() {\n\n  cin >> A >> B >> M;\n\n  rep(i, 0, A) cin >> a[i];\n\n  rep(i, 0, B) cin >> b[i];\n\n  int mi_a = inf;\n\n  rep(i, 0, A) chmin(mi_a, a[i]);\n\n  int mi_b = inf;\n\n  rep(i, 0, B) chmin(mi_b, b[i]);\n\n  int ans = mi_a + mi_b;\n\n  rep(i, 0, M) {\n\n    int x, y, c;\n    cin >> x >> y >> c;\n\n    y--;\n    x--;\n\n    chmin(ans, a[x] + b[y] - c);\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"43a7acde38d27f2aa0f8371da586733d271a4aa8d0a9610fbea16fce0f67251d","fast_id":"d92b474e5a59c2032e04addef2be376ac79baeae251ad21d25e8eecf0cee6ea6","fast_time":0.0001932734,"language":"cpp","measured_fast_code_id":"d92b474e5a59c2032e04addef2be376ac79baeae251ad21d25e8eecf0cee6ea6","measured_slow_code_id":"c41e99af6f35dee207274ccd90b87e75932e029ba074b5ca77247060d0859184","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_50911","problem_id":"p03163","slow_code_id":"794fafcdc67eb024b32873e19965e4a182d2209ef84ddf5b65b038caeab28df4","slow_id":"c41e99af6f35dee207274ccd90b87e75932e029ba074b5ca77247060d0859184","slow_time":0.0026574202,"speedup":13.749539253720377,"stratum":"8+","sampling_key":"025c2eafb6b1dfd0b1fd7eda79bd0fb43b1c20a0a29d99983d3d95d17423f09d","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef unsigned long long ULL;\n\nULL N, w;\n\nULL W[105];\n\nULL Value[105];\n\nULL f[200000];\n\ninline ULL max(ULL x, ULL y) { return x > y ? x : y; }\n\nint main() {\n\n  cin >> N >> w;\n\n  ULL ans = 0;\n\n  for (ULL i = 1; i <= N; i++)\n\n    cin >> W[i] >> Value[i];\n\n  memset(f, 0, sizeof(f));\n\n  for (ULL i = 1; i <= N; i++)\n\n    for (ULL j = w; j >= W[i]; j--)\n\n      f[j] = max(f[j], f[j - W[i]] + Value[i]);\n\n  cout << f[w];\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nusing namespace std;\n\n#define MAX(a, b) (a > b ? a : b)\n\nint main() {\n\n  int num, cap;\n\n  scanf(\"%d %d\", &num, &cap);\n\n  int itens[num + 1][2];\n\n  for (size_t i = 1; i < num + 1; i++) {\n\n    scanf(\"%d %d\", itens[i], itens[i] + 1);\n  }\n\n  num++, cap++;\n\n  long long parciais[num][cap];\n\n  for (size_t i = 0; i < cap; i++) {\n\n    parciais[0][i] = 0;\n  }\n\n  for (size_t i = 1; i < num; i++) {\n\n    for (size_t j = 0; j < cap; j++) {\n\n      if (j < itens[i][0])\n\n        parciais[i][j] = parciais[i - 1][j];\n\n      else\n\n        parciais[i][j] =\n            MAX(parciais[i - 1][j], (long long)itens[i][1] + parciais[i - 1][j - itens[i][0]]);\n    }\n  }\n\n  num--, cap--;\n\n  printf(\"%lld\\n\", parciais[num][cap]);\n}\n"}
{"fast_code_id":"68566931bbd8e51449e2f1808dbb984c7de6efa73d2627a3de86c99bf304d3b4","fast_id":"1d4d3e879be0d4b7021bd8893e7ff3aead9ac3a56fd64b9f395d5417a4ccf5c2","fast_time":0.1101411054,"language":"cpp","measured_fast_code_id":"1d4d3e879be0d4b7021bd8893e7ff3aead9ac3a56fd64b9f395d5417a4ccf5c2","measured_slow_code_id":"73297273122ad49910df6a40052404accb1d9d912c6232a16ac1bcf08be3ef56","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_51","problem_id":"p03078","slow_code_id":"f57afc6dc77d2ff81e85f56271afd0ea36720701bd1d106e682754a897c9d0fc","slow_id":"73297273122ad49910df6a40052404accb1d9d912c6232a16ac1bcf08be3ef56","slow_time":0.4075104219,"speedup":3.699894062439653,"stratum":"2-4","sampling_key":"a0f3f3f5d73748b4d8273e1ec5065dec152dbd23c0a01eabf6ff00d2a75eee7f","slow_code":"#include <bits/stdc++.h>\n\n#define repd(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rep(i, n) repd(i, 0, n)\n\n#define int long long\n\ntypedef long long ll;\n\nusing namespace std;\n\nconst int MOD = 1000000007;\n\nconst int INF = 1000000000000000000;\n\nconst double EPS = 1e-10;\n\nconst pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),\n                             make_pair(0, -1)};\n\nstruct edge {\n  int to, cost;\n};\n\nvector<edge> g[110000];\n\nint d[110000];\n\nint v, e, s, t;\n\nvoid dijkstra(int s, int d[], vector<edge> g[]) {\n\n  priority_queue<pair<int, int>, vector<pair<int, int>>,\n                 greater<pair<int, int>>>\n      que;\n\n  fill(d, d + v + 1, INF);\n  d[s] = 0;\n  que.push(pair<int, int>(0, s));\n\n  while (!que.empty()) {\n\n    pair<int, int> p = que.top();\n    que.pop();\n\n    int v = p.second;\n\n    if (d[v] < p.first)\n      continue;\n\n    rep(i, g[v].size()) {\n\n      edge e = g[v][i];\n\n      if (d[e.to] > d[v] + e.cost) {\n\n        d[e.to] = d[v] + e.cost;\n\n        que.push(pair<int, int>(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nsigned main() {\n\n  int x, y, z, k;\n  cin >> x >> y >> z >> k;\n\n  int a[1100], b[1100], c[1100];\n  rep(i, x) cin >> a[i];\n  rep(i, y) cin >> b[i];\n  rep(i, z) cin >> c[i];\n\n  vector<int> d(x * y);\n  int ind = 0;\n\n  rep(i, x) {\n\n    rep(j, y) {\n\n      d[ind] = a[i] + b[j];\n\n      ind++;\n    }\n  }\n\n  sort(d.begin(), d.end(), greater<int>());\n  sort(c, c + z, greater<int>());\n\n  deque<int> q;\n\n  rep(i, z) {\n\n    rep(j, min(k, x * y)) { q.push_back(c[i] + d[j]); }\n  }\n\n  sort(q.begin(), q.end(), greater<int>());\n\n  rep(i, k) { cout << q[i] << endl; }\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define repd(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rep(i, n) repd(i, 0, n)\n\n#define int long long\n\ntypedef long long ll;\n\nusing namespace std;\n\nconst int MOD = 1000000007;\n\nconst int INF = 1010000000;\n\nconst double EPS = 1e-10;\n\nconst pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),\n                             make_pair(0, -1)};\n\nvector<int> init(int size) {\n\n  vector<int> par(size, -1);\n\n  return par;\n}\n\nint root(int x, vector<int> &par) {\n\n  if (par[x] < 0) {\n\n    return x;\n\n  } else {\n\n    return par[x] = root(par[x], par);\n  }\n}\n\nbool same(int x, int y, vector<int> &par) {\n\n  return root(x, par) == root(y, par);\n}\n\nvoid unite(int x, int y, vector<int> &par) {\n\n  x = root(x, par), y = root(y, par);\n\n  if (same(x, y, par))\n    return;\n\n  par[x] += par[y];\n\n  par[y] = x;\n}\n\nint size(int x, vector<int> &par) { return -par[root(x, par)]; }\n\nint pow(int x, int n) {\n\n  if (n == 0)\n    return 1;\n\n  if (n % 2 == 0)\n    return pow(x * x % MOD, n / 2);\n\n  else\n    return x * pow(x, n - 1) % MOD;\n}\n\nsigned main() {\n\n  int x, y, z, k;\n  cin >> x >> y >> z >> k;\n\n  int a[1100], b[1100], c[1100];\n  rep(i, x) cin >> a[i];\n  rep(i, y) cin >> b[i];\n  rep(i, z) cin >> c[i];\n\n  sort(a, a + x, greater<int>());\n  sort(b, b + y, greater<int>());\n  sort(c, c + z, greater<int>());\n\n  vector<int> v;\n\n  rep(i, x) {\n\n    rep(j, y) {\n\n      rep(l, z) {\n\n        if ((i + 1) * (j + 1) * (l + 1) > k)\n          break;\n\n        v.push_back(a[i] + b[j] + c[l]);\n      }\n    }\n  }\n\n  sort(v.begin(), v.end(), greater<int>());\n\n  rep(i, k) cout << v[i] << endl;\n}\n"}
{"fast_code_id":"eaa859af3cde9b4bac5866c079a4ebb7b64d13557e4bb9d55cb7f2986f4531bb","fast_id":"baa0ffa47a63d5409a0c60903bd7ca20c499ec63ca980588b8f10a27a9ca284d","fast_time":0.0121110309,"language":"cpp","measured_fast_code_id":"baa0ffa47a63d5409a0c60903bd7ca20c499ec63ca980588b8f10a27a9ca284d","measured_slow_code_id":"494dad853a71082a95d45ea7478493ed11c35078933121806a70a7d2183dd9ae","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5131","problem_id":"p00946","slow_code_id":"dffe179e9d2278e67417fef3b481fbda819ce07dee37fe86a8d0cc621effe3ab","slow_id":"494dad853a71082a95d45ea7478493ed11c35078933121806a70a7d2183dd9ae","slow_time":0.027391896,"speedup":2.261731162786481,"stratum":"2-4","sampling_key":"0fba36250fd0f709dbcc2d4eb59676d40b7d6435de03436e73c492d74838d0cd","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define N 1000002\n\n#define pb push_back\n\nint hit[N], a[N];\n\nint main() {\n\n  int n, m;\n\n  cin >> n >> m;\n\n  for (int i = 1; i <= m; i++) {\n\n    scanf(\"%d\", &a[i]);\n  }\n\n  for (int i = m; i >= 1; i--) {\n\n    int x = a[i];\n\n    if (hit[x] == 0)\n      printf(\"%d\\n\", x);\n\n    hit[x] = 1;\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    if (hit[i] == 0)\n      printf(\"%d\\n\", i);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\nint n, m;\n\nbool flag[250000];\n\nint a[250000];\n\nint main()\n\n{\n\n  memset(flag, 1, sizeof(flag));\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  for (int i = m; i >= 1; i--)\n\n    if (flag[a[i]])\n\n      printf(\"%d\\n\", a[i]), flag[a[i]] = 0;\n\n  for (int i = 1; i <= n; i++)\n\n    if (flag[i])\n\n      printf(\"%d\\n\", i);\n\n  return 0;\n}"}
{"fast_code_id":"5230a163dc47f8ba0d01f66628369fffa7299371ad752e5564cad1f8ffd0c8a3","fast_id":"443f8eb1c8766c3c452405686462d3180281ca616e1e69a8187f6fef2f3726e1","fast_time":0.1064760262,"language":"cpp","measured_fast_code_id":"443f8eb1c8766c3c452405686462d3180281ca616e1e69a8187f6fef2f3726e1","measured_slow_code_id":"f48de9cc3f4d87bf297658e5b54660c00eadb82d627039a9c3b43ab77ddb7f07","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_51437","problem_id":"p03341","slow_code_id":"5af05b6c009ba394082e10089f3c5dceb3ce1d696954b50ea90170de48966b4a","slow_id":"f48de9cc3f4d87bf297658e5b54660c00eadb82d627039a9c3b43ab77ddb7f07","slow_time":0.4979467015,"speedup":4.676608615771199,"stratum":"4-8","sampling_key":"46694d1544d0c95101e6f2980c69d44780b1e28095d2fa1d9b6968ef1e2eef8e","slow_code":"#include <bits/stdc++.h>\n\nconst int MAX_N = 300000;\n\nint main() {\n\n  int N;\n\n  std::string S;\n\n  std::cin >> N >> S;\n\n  std::vector<int> left(MAX_N), right(MAX_N), cost(MAX_N);\n\n  int cnt;\n\n  cnt = 0;\n\n  for (int i = 0; i < N; ++i) {\n\n    left[i] = cnt;\n\n    if (S[i] == 'W')\n      ++cnt;\n  }\n\n  cnt = 0;\n\n  for (int i = N - 1; i >= 0; --i) {\n\n    right[i] = cnt;\n\n    cost[i] = left[i] + right[i];\n\n    if (S[i] == 'E')\n      ++cnt;\n  }\n\n  std::sort(cost.begin(), cost.begin() + N);\n\n  std::cout << cost[0] << std::endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nconst int MAX_N = 300000;\n\nint main() {\n\n  int N;\n\n  std::string S;\n\n  std::cin >> N >> S;\n\n  static int left[MAX_N], right[MAX_N], cost[MAX_N];\n\n  int cnt;\n\n  cnt = 0;\n\n  for (int i = 0; i < N; ++i) {\n\n    left[i] = cnt;\n\n    if (S[i] == 'W')\n      ++cnt;\n  }\n\n  cnt = 0;\n\n  for (int i = N - 1; i >= 0; --i) {\n\n    right[i] = cnt;\n\n    cost[i] = left[i] + right[i];\n\n    if (S[i] == 'E')\n      ++cnt;\n  }\n\n  std::sort(cost, cost + N);\n\n  std::cout << cost[0] << std::endl;\n}"}
{"fast_code_id":"da25932aeaadce3823b2a17c758c0cca5dbb976870faa7bc87f7389ad3ae2c45","fast_id":"ac64b80976ef8c2edbbbdb8c2b50cfefc8bf22489c1f2ce8be68c851c51e720f","fast_time":0.1106343927,"language":"cpp","measured_fast_code_id":"ac64b80976ef8c2edbbbdb8c2b50cfefc8bf22489c1f2ce8be68c851c51e720f","measured_slow_code_id":"5a852485f9092c4943c5d883877a0903cad80ac663505353fa522a8cea741898","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_51452","problem_id":"p03436","slow_code_id":"2276b3eb8406d922d2c70fd60623cadcb0a28a0ee4e8e88cc15450d0253bc273","slow_id":"5a852485f9092c4943c5d883877a0903cad80ac663505353fa522a8cea741898","slow_time":0.2213677692,"speedup":2.0008946928489806,"stratum":"2-4","sampling_key":"67e408b839be9d24bcd27c800644d85bea4f09dac0997a50fb7c50b4e0513e20","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing Edge = pair<int, int>;\n\nusing Graph = vector<vector<Edge>>;\n\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n\n#define SORT(v) sort((v).begin(), (v).end())\n\n#define RSORT(v) sort((v).rbegin(), (v).rend())\n\nconst ll MOD = 1000000007;\n\nconst ll nmax = 8;\n\nconst ll INF = 1e9;\n\nbool graph[nmax][nmax];\n\nvector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));\n\nvoid warshall_floyd(ll n)\n\n{\n\n  for (size_t i = 0; i < n; i++)\n\n  {\n\n    for (size_t j = 0; j < n; j++)\n\n    {\n\n      for (size_t k = 0; k < n; k++)\n\n      {\n\n        dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);\n      }\n    }\n  }\n}\n\nclass UnionFind\n\n{\n\npublic:\n  vector<ll> Parent;\n\n  UnionFind(ll N)\n\n  {\n\n    Parent = vector<ll>(N, -1);\n  }\n\n  ll find(ll A)\n\n  {\n\n    if (Parent[A] < 0)\n\n      return A;\n\n    return Parent[A] = find(Parent[A]);\n  }\n\n  ll size(ll A)\n\n  {\n\n    return -Parent[find(A)];\n  }\n\n  bool Union(ll A, ll B)\n\n  {\n\n    A = find(A);\n\n    B = find(B);\n\n    if (A == B)\n\n    {\n\n      return false;\n    }\n\n    if (size(A) < size(B))\n\n      swap(A, B);\n\n    Parent[A] += Parent[B];\n\n    Parent[B] = A;\n\n    return true;\n  }\n};\n\nll gcd(ll a, ll b)\n\n{\n\n  if (b == 0)\n\n    return a;\n\n  return gcd(b, a % b);\n}\n\nll lcm(ll a, ll b)\n\n{\n\n  ll g = gcd(a, b);\n\n  return a / g * b;\n}\n\nll mulMod(ll a, ll b)\n\n{\n\n  return (((a % MOD) * (b % MOD)) % MOD);\n}\n\nll powMod(ll a, ll p)\n\n{\n\n  if (p == 0)\n\n  {\n\n    return 1;\n\n  }\n\n  else if (p % 2 == 0)\n\n  {\n\n    ll half = powMod(a, p / 2);\n\n    return mulMod(half, half);\n\n  }\n\n  else\n\n  {\n\n    return mulMod(powMod(a, p - 1), a);\n  }\n}\n\nll ceil(ll a, ll b)\n\n{\n\n  return (a + b - 1) / b;\n}\n\nconst int dx[4] = {1, 0, -1, 0};\n\nconst int dy[4] = {0, 1, 0, -1};\n\nll H, W;\n\nint seen[510][510];\n\nchar math[510][510];\n\nint main()\n\n{\n\n  cin >> H >> W;\n\n  ll cnt_white = 0;\n\n  for (int i = 0; i < H; i++)\n\n  {\n\n    string str;\n\n    cin >> str;\n\n    for (int j = 0; j < W; j++)\n\n    {\n\n      if (str[j] == '.')\n\n        cnt_white++;\n\n      math[i][j] = str[j];\n    }\n  }\n\n  memset(seen, -1, sizeof(seen));\n\n  queue<pair<int, int>> que;\n\n  que.push(make_pair(0, 0));\n\n  seen[0][0] = 1;\n\n  while (!que.empty())\n\n  {\n\n    pair<int, int> current_pos = que.front();\n\n    int x = current_pos.first;\n\n    int y = current_pos.second;\n\n    que.pop();\n\n    for (int dir = 0; dir < 4; dir++)\n\n    {\n\n      int nh = x + dx[dir];\n\n      int nw = y + dy[dir];\n\n      if (nh < 0 || nw < 0 || nh >= H || nw >= W)\n\n        continue;\n\n      if (math[nh][nw] == '#')\n\n        continue;\n\n      if (seen[nh][nw] != -1)\n\n        continue;\n\n      if (seen[nh][nw] == -1) {\n\n        que.push(make_pair(nh, nw));\n\n        seen[nh][nw] = seen[x][y] + 1;\n      }\n    }\n  }\n\n  if (seen[H - 1][W - 1] == -1)\n\n  {\n\n    cout << -1 << endl;\n\n  }\n\n  else\n\n  {\n\n    cout << cnt_white - seen[H - 1][W - 1] << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing Edge = int;\n\nusing Graph = vector<vector<Edge>>;\n\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n\n#define SORT(v) sort((v).begin(), (v).end())\n\n#define RSORT(v) sort((v).rbegin(), (v).rend())\n\nconst ll MOD = 1000000007;\n\nconst ll nmax = 8;\n\nconst ll INF = 1e9;\n\nbool graph[nmax][nmax];\n\nvector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));\n\nstruct SegmentTree\n\n{\n\nprivate:\n  ll n;\n\n  vector<ll> node;\n\npublic:\n  SegmentTree(vector<ll> v)\n\n  {\n\n    ll sz = v.size();\n\n    n = 1;\n\n    while (n < sz)\n\n    {\n\n      n *= 2;\n    }\n\n    node.resize(2 * n - 1, INF);\n\n    for (ll i = 0; i < sz; i++)\n\n    {\n\n      node[i + n - 1] = v[i];\n    }\n\n    for (ll i = n - 2; i >= 0; i--)\n\n    {\n\n      node[i] = min(node[2 * i + 1], node[2 * i + 2]);\n    }\n  }\n\n  void update(ll x, ll val)\n\n  {\n\n    x += (n - 1);\n\n    node[x] = val;\n\n    while (x > 0)\n\n    {\n\n      x = (x - 1) / 2;\n\n      node[x] = min(node[2 * x + 1], node[2 * x + 2]);\n    }\n  }\n\n  ll find(ll a, ll b, ll k = 0, ll l = 0, ll r = -1)\n\n  {\n\n    if (r < 0)\n\n      r = n;\n\n    if (r <= a || b <= l)\n\n      return INF;\n\n    if (a <= l && r <= b)\n\n      return node[k];\n\n    ll vl = find(a, b, 2 * k + 1, l, (l + r) / 2);\n\n    ll vr = find(a, b, 2 * k + 2, (l + r) / 2, r);\n\n    return min(vl, vr);\n  }\n};\n\nvoid warshall_floyd(ll n)\n\n{\n\n  for (size_t i = 0; i < n; i++)\n\n  {\n\n    for (size_t j = 0; j < n; j++)\n\n    {\n\n      for (size_t k = 0; k < n; k++)\n\n      {\n\n        dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);\n      }\n    }\n  }\n}\n\nclass UnionFind\n\n{\n\npublic:\n  vector<ll> Parent;\n\n  UnionFind(ll N)\n\n  {\n\n    Parent = vector<ll>(N, -1);\n  }\n\n  ll find(ll A)\n\n  {\n\n    if (Parent[A] < 0)\n\n      return A;\n\n    return Parent[A] = find(Parent[A]);\n  }\n\n  ll size(ll A)\n\n  {\n\n    return -Parent[find(A)];\n  }\n\n  bool Union(ll A, ll B)\n\n  {\n\n    A = find(A);\n\n    B = find(B);\n\n    if (A == B)\n\n    {\n\n      return false;\n    }\n\n    if (size(A) < size(B))\n\n      swap(A, B);\n\n    Parent[A] += Parent[B];\n\n    Parent[B] = A;\n\n    return true;\n  }\n};\n\nll gcd(ll a, ll b)\n\n{\n\n  if (b == 0)\n\n    return a;\n\n  return gcd(b, a % b);\n}\n\nll lcm(ll a, ll b)\n\n{\n\n  ll g = gcd(a, b);\n\n  return a / g * b;\n}\n\nll mulMod(ll a, ll b)\n\n{\n\n  return (((a % MOD) * (b % MOD)) % MOD);\n}\n\nll powMod(ll a, ll p)\n\n{\n\n  if (p == 0)\n\n  {\n\n    return 1;\n\n  }\n\n  else if (p % 2 == 0)\n\n  {\n\n    ll half = powMod(a, p / 2);\n\n    return mulMod(half, half);\n\n  }\n\n  else\n\n  {\n\n    return mulMod(powMod(a, p - 1), a);\n  }\n}\n\nll ceil(ll a, ll b)\n\n{\n\n  return (a + b - 1) / b;\n}\n\nvector<ll> tsort(Graph G)\n\n{\n\n  ll N = G.size();\n\n  vector<ll> in(N);\n\n  for (auto &&edges : G)\n\n  {\n\n    for (auto &&edge : edges)\n\n    {\n\n      in[edge]++;\n    }\n  }\n\n  queue<int> que;\n\n  for (int i = 0; i < N; i++)\n\n  {\n\n    if (in[i] == 0)\n\n    {\n\n      que.push(i);\n    }\n  }\n\n  int cnt = 0;\n\n  vector<ll> ans;\n\n  while (!que.empty())\n\n  {\n\n    int v = que.front();\n\n    que.pop();\n\n    ans.push_back(v);\n\n    for (auto &&next : G[v])\n\n    {\n\n      in[next]--;\n\n      if (in[next] == 0)\n\n      {\n\n        que.push(next);\n      }\n    }\n  }\n\n  return ans;\n}\n\nconst int distX[4] = {-1, 0, 0, 1};\n\nconst int distY[4] = {0, 1, -1, 0};\n\nint main()\n\n{\n\n  int H, W;\n\n  cin >> H >> W;\n\n  vector<string> map(H);\n\n  for (int i = 0; i < H; i++)\n\n  {\n\n    string str;\n\n    cin >> str;\n\n    map[i] = str;\n  }\n\n  ll cnt = 0;\n\n  for (int i = 0; i < H; i++)\n\n  {\n\n    for (int j = 0; j < W; j++)\n\n    {\n\n      if (map[i][j] == '.')\n\n      {\n\n        cnt++;\n      }\n    }\n  }\n\n  queue<pair<int, int>> que;\n\n  vector<vector<ll>> dist(H, vector<ll>(W, -1));\n\n  dist[0][0] = 0;\n\n  que.push(make_pair(0, 0));\n\n  while (!que.empty())\n\n  {\n\n    pair<int, int> p = que.front();\n\n    int x = p.first;\n\n    int y = p.second;\n\n    que.pop();\n\n    for (int i = 0; i < 4; i++)\n\n    {\n\n      int newX = x + distX[i];\n\n      int newY = y + distY[i];\n\n      if (newX < 0 || newX >= H || newY < 0 || newY >= W)\n\n      {\n\n        continue;\n      }\n\n      if (dist[newX][newY] != -1)\n\n      {\n\n        continue;\n      }\n\n      if (map[newX][newY] == '#')\n\n      {\n\n        continue;\n      }\n\n      dist[newX][newY] = dist[x][y] + 1;\n\n      que.push(make_pair(newX, newY));\n    }\n  }\n\n  if (dist[H - 1][W - 1] == -1)\n\n  {\n\n    cout << -1 << endl;\n\n  }\n\n  else\n\n  {\n\n    cout << cnt - dist[H - 1][W - 1] - 1 << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"52cafe65967ada06ea8c0917fbfd633f9d63deb46fe1e06af5f1c75f08b87d8d","fast_id":"9320ed17d6bec7102dafb822b01b306444dd71680b51eba33dae4cdcd9761a70","fast_time":0.0059481093,"language":"cpp","measured_fast_code_id":"9320ed17d6bec7102dafb822b01b306444dd71680b51eba33dae4cdcd9761a70","measured_slow_code_id":"4472ae4534fb3a9064942e32a9a172014a9abe7a82e8d5013ee47b28bb9afc4d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_51472","problem_id":"p03674","slow_code_id":"cfc85cd2e0170962e12f9447f98e9867f93837eba3d069ff2c68e0ed877f24c4","slow_id":"4472ae4534fb3a9064942e32a9a172014a9abe7a82e8d5013ee47b28bb9afc4d","slow_time":0.0872759977,"speedup":14.672897436501378,"stratum":"8+","sampling_key":"78c879724071800d5ff4185a85752acd548b8565bd967997e7126da3ea180ead","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define Would\n\n#define you\n\n#define please\n\nll mod = 1e9 + 7;\n\nll POW(ll A, ll B) {\n\n  if (B == 0)\n    return 1;\n\n  if (B % 2 == 0) {\n\n    ll hannbunn = POW(A, B / 2);\n\n    return hannbunn * hannbunn % mod;\n\n  }\n\n  else {\n\n    return A * POW(A, B - 1) % mod;\n  }\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int A[100100];\n\n  map<int, int> MAP;\n\n  rep(i, N + 1) {\n\n    cin >> A[i];\n\n    MAP[A[i]]++;\n  }\n\n  int ooi = 0;\n\n  for (auto itr : MAP) {\n\n    if (itr.second == 2) {\n\n      ooi = itr.first;\n\n      break;\n    }\n  }\n\n  int K1 = -1, K2;\n\n  rep(i, N + 1) {\n\n    if (A[i] == ooi) {\n\n      if (K1 == -1)\n        K1 = i;\n\n      else\n        K2 = i;\n    }\n  }\n\n  int K = K1 + N - K2;\n\n  ll comb[100100] = {};\n\n  comb[0] = 1;\n\n  rep1(i, N + 1) {\n\n    comb[i] = comb[i - 1] * (N + 2 - i) % mod;\n\n    comb[i] = comb[i] * POW(i, mod - 2) % mod;\n  }\n\n  ll comb2[100100] = {};\n\n  comb2[0] = 1;\n\n  rep1(i, K) {\n\n    comb2[i] = comb2[i - 1] * (K + 1 - i) % mod;\n\n    comb2[i] = comb2[i] * POW(i, mod - 2) % mod;\n  }\n\n  rep1(i, N + 1) {\n\n    ll kotae = (comb[i] - comb2[i - 1] + mod) % mod;\n\n    co(kotae);\n  }\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 20;\n\nchar dn[dm], *di = dn;\n\ninline void putint(ll X) {\n\n  int keta = 0;\n\n  char C[11];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nll mod = 1e9 + 7;\n\nll modpow(ll A, ll B) {\n\n  ll kotae = 1;\n\n  while (B > 0) {\n\n    if (B & 1)\n      kotae = kotae * A % mod;\n\n    A = A * A % mod;\n\n    B >>= 1;\n  }\n\n  return kotae;\n}\n\nll facN, facK;\n\nint A[100001];\n\nll fac[100001];\n\nint main() {\n\n  int N = getint();\n\n  int kazu = 0;\n\n  rep1(i, N) {\n\n    int a = getint();\n\n    if (A[a])\n      kazu = A[a] + N - i;\n\n    else\n      A[a] = i;\n  }\n\n  fac[0] = 1;\n\n  rep1(i, N + 1) fac[i] = fac[i - 1] * i % mod;\n\n  facN = fac[N + 1];\n\n  facK = fac[kazu];\n\n  fac[N + 1] = modpow(fac[N + 1], mod - 2);\n\n  for (int i = N + 1; i > 0; i--)\n    fac[i - 1] = fac[i] * i % mod;\n\n  rep1(i, N + 1) {\n\n    ll kotae = fac[i] * fac[N + 1 - i] % mod * facN;\n\n    if (kazu >= i - 1) {\n\n      kotae = kotae - fac[i - 1] * fac[kazu - i + 1] % mod * facK;\n    }\n\n    kotae %= mod;\n\n    if (kotae < 0)\n      kotae += mod;\n\n    putint(kotae);\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"bcfa709e7efd2d1d9ad37c06d4e5387253becc1aba29b4d8412c4a4a74a28aef","fast_id":"6e1d2fa2c1e2efc0b5e6faaf0f6b269a857da481d848495482aebda4af61a036","fast_time":0.020455715,"language":"cpp","measured_fast_code_id":"6e1d2fa2c1e2efc0b5e6faaf0f6b269a857da481d848495482aebda4af61a036","measured_slow_code_id":"1afb84bbf3cb1ed734348b7f6d8935095c514880b73968bc5cbb3950df8d2b23","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_51518","problem_id":"p02887","slow_code_id":"de85ea70a6adc01635f986b29f3887bdf5583225702ca261c8ceb15ad2ff2851","slow_id":"1afb84bbf3cb1ed734348b7f6d8935095c514880b73968bc5cbb3950df8d2b23","slow_time":0.131966728,"speedup":6.451337829061464,"stratum":"4-8","sampling_key":"2acbe9e3ade4406fee816d633df9508d21ca7ae1d994f2c176310f5c770f10dd","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define maxn 100010\n\nchar ss[maxn];\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  cin >> ss;\n\n  int siz = sizeof(ss);\n\n  char pre;\n\n  pre = ss[0];\n\n  int cnt = 0;\n\n  for (int i = 1; i < siz; i++)\n\n  {\n\n    if (pre != ss[i])\n\n    {\n\n      cnt++;\n\n      pre = ss[i];\n    }\n  }\n\n  cout << cnt;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int a, n, cnt = 1;\n\n  char s[100000];\n\n  scanf(\"%d\", &n);\n\n  getchar();\n\n  for (a = 0; a < n; a++) {\n\n    scanf(\"%c\", &s[a]);\n  }\n\n  for (a = 0; a < n - 1; a++) {\n\n    if (s[a] != s[a + 1]) {\n\n      cnt++;\n    }\n  }\n\n  printf(\"%d\", cnt);\n}"}
{"fast_code_id":"698cf8415c3f9b1889fb3b905cb6bbc871187d5be12e21607515a62e3a5e81fd","fast_id":"fe9f435467e7b7bc0713b2b7c029757c38acdc330aa53935c20bdb79dd65e5f7","fast_time":0.101033091,"language":"cpp","measured_fast_code_id":"fe9f435467e7b7bc0713b2b7c029757c38acdc330aa53935c20bdb79dd65e5f7","measured_slow_code_id":"66058d3da01b4a9283deecefd1ca393a56efaa12d593739abab573e75a054c4b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_51547","problem_id":"p02361","slow_code_id":"3367a4c322586b76bbf178a36ec356d0aa1645e2b3931086e23bd2fe496e2929","slow_id":"66058d3da01b4a9283deecefd1ca393a56efaa12d593739abab573e75a054c4b","slow_time":0.743228508,"speedup":7.3562879314461425,"stratum":"4-8","sampling_key":"40013b78ba1580d6aa52300dde74d9c52ba7fae5d8003bbd7638d9e1388dab1f","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <utility>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <complex>\n\n#define INF 2147483647\n\n#define llINF 9223372036854775807\n\n#define pb push_back\n\n#define mp make_pair\n\n#define F first\n\n#define S second\n\n#define ll long long\n\nusing namespace std;\n\ntypedef struct E {\n\n  int to, cost;\n\n} edge;\n\nconst int MAX_V = 200100;\n\nconst int Inf = 1e9;\n\nvector<vector<edge > >  E(MAX_V);\n\nint d[MAX_V];\n\nvoid dijkstra(int s) {\n\n  priority_queue<pair<int, int>, vector<pair<int, int > > , greater<pair<int, int > > > que;\n\n  fill_n(d, MAX_V, Inf);\n\n  d[s] = 0;\n\n  que.push(pair<int, int>(0, s));\n\n  while (!que.empty()) {\n\n    pair<int, int> p = que.top();\n    que.pop();\n\n    int v = p.second;\n\n    if (d[v] < p.first)\n      continue;\n\n    for (int j = 0; j < E[v].size(); j++) {\n\n      edge t = E[v][j];\n\n      if (d[t.to] > d[v] + t.cost) {\n\n        d[t.to] = d[v] + t.cost;\n\n        que.push(pair<int, int>(d[t.to], t.to));\n      }\n    }\n  }\n}\n\nint main() {\n\n  int a, b, r;\n  cin >> a >> b >> r;\n\n  for (int i = 0; i < b; i++) {\n\n    edge e;\n\n    int s;\n    cin >> s >> e.to >> e.cost;\n\n    E[s].pb(e);\n  }\n\n  dijkstra(r);\n\n  for (int i = 0; i < a; i++) {\n\n    if (d[i] == Inf)\n      cout << \"INF\" << endl;\n\n    else\n\n      cout << d[i] << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define INF 1e9\n\n#define llINF 1e18\n\n#define MOD 1000000007\n\n#define pb push_back\n\n#define mp make_pair\n\n#define F first\n\n#define S second\n\n#define ll long long\n\n#define vi vector<ll>\n\n#define vvi vector<vi>\n\n#define BITLE(n) (1LL << ((ll)n))\n\n#define SHIFT_LEFT(n) (1LL << ((ll)n))\n\n#define SUBS(s, f, t) ((s).substr((f), (t) - (f)))\n\n#define ALL(a) (a).begin(), (a).end()\n\ntemplate <typename T>\n\nstruct Dijkstra {\n\n  struct edge {\n\n    int to;\n\n    T cost;\n  };\n\n  int V;\n\n  std::vector<std::vector<edge>> Edges;\n\n  const T Inf = 1e9;\n\n  Dijkstra(int V) : V(V), Edges(V) {}\n\n  void add_edge(int from, int to, T cost) { Edges[from].push_back({to, cost}); }\n\n  std::vector<T> execution(int s) {\n\n    std::vector<T> dist(V, Inf);\n\n    std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>,\n                        std::greater<>>\n        que;\n\n    dist[s] = 0;\n\n    que.push(std::make_pair(0, s));\n\n    while (!que.empty()) {\n\n      int v = que.top().second;\n\n      T cost = que.top().first;\n\n      que.pop();\n\n      if (dist[v] < cost)\n        continue;\n\n      for (auto e : Edges[v]) {\n\n        if (dist[e.to] > dist[v] + e.cost) {\n\n          dist[e.to] = dist[v] + e.cost;\n\n          que.push(std::make_pair(dist[e.to], e.to));\n        }\n      }\n    }\n\n    return dist;\n  }\n};\n\nint main() {\n\n  std::cin.tie(0);\n\n  std::ios::sync_with_stdio(false);\n\n  ll v, e, r;\n  std::cin >> v >> e >> r;\n\n  Dijkstra<int> dijkstra(v);\n\n  for (int i = 0; i < e; i++) {\n\n    ll a, b, c;\n    std::cin >> a >> b >> c;\n\n    dijkstra.add_edge(a, b, c);\n  }\n\n  for (auto e : dijkstra.execution(r)) {\n\n    if (e == INF)\n      std::cout << \"INF\" << std::endl;\n\n    else\n      std::cout << e << std::endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"83d22b0c32c0b5a082e4488cfc182f2b5957a5149b115613d89fb2043d70d81b","fast_id":"267a50ef6c50c07778d2b34ff9b978c72616c34b2e51d0732636912e1bc96010","fast_time":0.1087335649,"language":"cpp","measured_fast_code_id":"267a50ef6c50c07778d2b34ff9b978c72616c34b2e51d0732636912e1bc96010","measured_slow_code_id":"2e4714785813053c34087f207fb17676906a39dcddb2f32755a09b616d3f2e74","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5160","problem_id":"p02850","slow_code_id":"e3d1b493c2e86ba48077db594e14a350dcde83e1c954d9258366f67b131694e2","slow_id":"2e4714785813053c34087f207fb17676906a39dcddb2f32755a09b616d3f2e74","slow_time":0.4264801644,"speedup":3.9222494433271358,"stratum":"2-4","sampling_key":"18883f482e4f9541c6fb2d89e913cf644d74be388de9c81b30f0cca2d681a289","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\ntypedef long long int ll;\n\ntypedef pair<int, int> P;\n\nint n;\n\nvector<vector<int>> graph(101010, vector<int>(0));\n\nvector<int> colors(101010);\n\nmap<P, int> edge_num;\n\nint mc = 0;\n\nvoid dfs(int a, int pa, int pc) {\n\n  int c = 1;\n\n  for (int x : graph.at(a)) {\n\n    if (x == pa)\n      continue;\n\n    if (c == pc)\n      c++;\n\n    colors.at(edge_num[P(x, a)]) = c;\n\n    dfs(x, a, c);\n\n    c++;\n  }\n\n  mc = max(c - 1, mc);\n}\n\nint main() {\n\n  cin >> n;\n\n  rep(i, n - 1) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    graph.at(a).emplace_back(b);\n\n    graph.at(b).emplace_back(a);\n\n    edge_num[P(a, b)] = edge_num[P(b, a)] = i;\n  }\n\n  dfs(1, 0, 0);\n\n  cout << mc << endl;\n\n  rep(i, n - 1) cout << colors[i] << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep2(i, m, n) for (int i = (m); i < (n); ++i)\n\n#define rep(i, n) rep2(i, 0, n)\n\ntypedef long long int ll;\n\ntypedef long double ld;\n\ntypedef pair<int, int> P;\n\ntemplate <typename T> struct V : vector<T> { using vector<T>::vector; };\n\nV()->V<int>;\n\nV(size_t)->V<int>;\n\ntemplate <typename T> V(size_t, T) -> V<T>;\n\ntemplate <typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }\n\ntemplate <typename... Ts> auto make_vec(size_t n, Ts... ts) {\n  return vector<decltype(make_vec(ts...))>(n, make_vec(ts...));\n}\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {\n  for (auto &e : v)\n    os << e << ' ';\n  return os;\n}\n\nstruct fast_ios {\n  fast_ios() {\n    cin.tie(nullptr);\n    ios::sync_with_stdio(false);\n    cout << fixed << setprecision(20);\n  };\n} fast_ios_;\n\ntemplate <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\nconst int INF = 1 << 30;\n\nconst ll LINF = 1LL << 61;\n\nvector<vector<P>> G;\n\nvector<int> ans;\n\nvoid func(int cur, int p, int c)\n\n{\n\n  int nc = 1;\n\n  for (auto [to, e] : G[cur])\n\n  {\n\n    if (to == p)\n      continue;\n\n    if (nc == c)\n      nc++;\n\n    ans[e] = nc;\n\n    func(to, cur, nc);\n\n    nc++;\n  }\n\n  return;\n}\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  G.assign(n, vector<P>(0));\n\n  ans.assign(n - 1, 0);\n\n  rep(i, n - 1)\n\n  {\n\n    int u, v;\n\n    cin >> u >> v;\n\n    --u;\n    --v;\n\n    G[u].emplace_back(v, i);\n\n    G[v].emplace_back(u, i);\n  }\n\n  func(0, -1, 0);\n\n  ll ans1 = 0;\n\n  for (auto x : ans)\n    chmax(ans1, x);\n\n  cout << ans1 << endl;\n\n  for (auto x : ans)\n    cout << x << \"\\n\";\n\n  return 0;\n}"}
{"fast_code_id":"ad446d484762a9f5149df6795e293793b08613a7125259c089df005eb7bb89a5","fast_id":"1b6ec7508dd9628ed4dd327a40604476846461b90e3f80e3311bda53dcde2f93","fast_time":0.0188818072,"language":"cpp","measured_fast_code_id":"1b6ec7508dd9628ed4dd327a40604476846461b90e3f80e3311bda53dcde2f93","measured_slow_code_id":"3637d0b92e5765bcce46583b2b4718dec68f78ddbfe50fc4e33e20a790388886","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_51611","problem_id":"p04027","slow_code_id":"2c43d32f630b80823f10aa2b217d1e248dfac7dce5ae1647d4b1bc4d2df56130","slow_id":"3637d0b92e5765bcce46583b2b4718dec68f78ddbfe50fc4e33e20a790388886","slow_time":0.4693924644,"speedup":24.8595094435664,"stratum":"8+","sampling_key":"08e786da5fae6398aa145c403895d19be17af65042a1f2694932d06e41087bb8","slow_code":"#include <bits/stdc++.h>\n\n#define il inline\n\n#define rg register\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int O = 510;\n\nconst ll mod = 1e9 + 7;\n\nil int gi() {\n\n  int o = 0, fl = 1;\n  char ch = getchar();\n\n  while (!isdigit(ch) && ch != '-')\n    ch = getchar();\n\n  if (ch == '-')\n    fl = -1, ch = getchar();\n\n  while (isdigit(ch))\n    o = o * 10 + ch - '0', ch = getchar();\n\n  return fl * o;\n}\n\nint n, c, a[O], b[O];\n\nll f[O][O], bin[O][O];\n\nint main() {\n\n  for (int i = 1; i < O; ++i)\n    bin[i][0] = 1;\n\n  for (int i = 1; i < O; ++i)\n\n    for (int j = 1; j < O; ++j)\n\n      bin[i][j] = bin[i][j - 1] * i % mod;\n\n  for (int i = 1; i < O; ++i)\n\n    for (int j = 0; j < O; ++j)\n\n      bin[i][j] = (bin[i - 1][j] + bin[i][j]) % mod;\n\n  n = gi();\n  c = gi();\n\n  for (int i = 1; i <= n; ++i)\n    a[i] = gi();\n\n  for (int i = 1; i <= n; ++i)\n    b[i] = gi();\n\n  f[0][0] = 1;\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 0; j <= c; ++j)\n\n      for (int k = 0; k <= j; ++k)\n\n        (f[i][j] += f[i - 1][j - k] * ((bin[b[i]][k] - bin[a[i] - 1][k]) % mod + mod) % mod) %= mod;\n\n  printf(\"%lld\\n\", f[n][c]);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#define ll long long\n\nusing namespace std;\n\ninline int read() {\n\n  int x = 0, f = 1;\n  char c = getchar();\n\n  while (c < '0' || c > '9') {\n    if (c == '-')\n      f = -1;\n    c = getchar();\n  }\n\n  while (c >= '0' && c <= '9') {\n    x = (x << 1) + (x << 3) + (c ^ 48);\n    c = getchar();\n  }\n\n  return x * f;\n}\n\nconst int mod(1e9 + 7), maxn(405);\n\nint n, c;\n\nll sum[maxn], f[maxn][maxn];\n\nint a[maxn], b[maxn];\n\nvoid init() {\n\n  n = read(), c = read();\n\n  for (int i(1); i <= n; ++i)\n    a[i] = read();\n\n  for (int i(1); i <= n; ++i)\n    b[i] = read();\n\n  f[0][0] = 1;\n}\n\nvoid calc(int a, int b) {\n\n  memset(sum, 0, sizeof(sum));\n\n  for (int i(a); i <= b; ++i) {\n\n    ll t = 1;\n\n    for (int j(0); j <= c; ++j) {\n\n      sum[j] = sum[j] + t, sum[j] %= mod;\n\n      t = t * i % mod;\n    }\n  }\n}\n\nsigned main() {\n\n  init();\n\n  for (int i(1); i <= n; ++i) {\n\n    calc(a[i], b[i]);\n\n    for (int j(0); j <= c; ++j)\n\n      for (int k(0); k <= j; ++k)\n\n        f[i][j] = (f[i][j] + f[i - 1][j - k] * sum[k]) % mod;\n  }\n\n  printf(\"%d\\n\", f[n][c]);\n\n  return 0;\n}\n"}
{"fast_code_id":"9e3b0d4a6e55cedf62ae96ec06e92ceb569f21297f68f6f5bd9d4ca6f4e0cfec","fast_id":"06657330edca3010faf7264aab95b77b875ca1b08011ec9a1e733defd16ea0e5","fast_time":0.0201955019,"language":"cpp","measured_fast_code_id":"06657330edca3010faf7264aab95b77b875ca1b08011ec9a1e733defd16ea0e5","measured_slow_code_id":"cd3b87b3a2af193a3cb6907f69471952a0a27802b2d4b66097379a47b2456ead","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_51797","problem_id":"p03625","slow_code_id":"e5602c7850ec9abaa65e884be40e60e03ce156027043b161d9b02ae02a743a68","slow_id":"cd3b87b3a2af193a3cb6907f69471952a0a27802b2d4b66097379a47b2456ead","slow_time":0.3768591644,"speedup":18.660549575150693,"stratum":"8+","sampling_key":"3ea4464bfffe7e94251ce5a889f643672920697c355954611a267f8f43cadd19","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define pb push_back\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define rep1(i, n) for (int i = 1; i <= n; i++)\n\n#define mp make_pair\n\n#define F first\n\n#define S second\n\n#define IOS                                                                    \\\n  ios_base::sync_with_stdio(0);                                                \\\n  cin.tie(0)\n\ntypedef long long ll;\n\nvector<int> g[100005];\n\nll q, n;\n\nll a[1005];\n\nint main()\n\n{\n\n  while (cin >> n)\n\n  {\n\n    map<ll, ll> m;\n\n    vector<ll> ans;\n\n    rep(i, n)\n\n    {\n\n      ll tmp;\n\n      cin >> tmp;\n\n      m[tmp]++;\n\n      if (m[tmp] % 2 == 0)\n        ans.pb(tmp);\n    }\n\n    sort(ans.begin(), ans.end());\n\n    if (ans.size() < 2)\n      cout << 0 << \"\\n\";\n\n    else\n      cout << ans[ans.size() - 1] * ans[ans.size() - 2] << \"\\n\";\n  }\n\n  return 0;\n}\n","fast_code":"\n\n#include <stdio.h>\n\n#include <algorithm>\n\ntypedef long long ll;\n\nint n;\n\nll a[100005];\n\nbool cmp(const ll &a, const ll &b)\n\n{\n\n  return a > b;\n}\n\nint main()\n\n{\n\n  int i;\n\n  ll l = 0ll, w = 0ll;\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%lld\", a + i);\n  }\n\n  std::sort(a, a + n, cmp);\n\n  for (i = 1; i < n; i++)\n\n  {\n\n    if (a[i - 1] == a[i])\n\n    {\n\n      l = a[i];\n\n      break;\n    }\n  }\n\n  for (i += 2; i < n; i++)\n\n  {\n\n    if (a[i - 1] == a[i])\n\n    {\n\n      w = a[i];\n\n      break;\n    }\n  }\n\n  printf(\"%lld\\n\", l * w);\n\n  return 0;\n}"}
{"fast_code_id":"1a91fac133d0d19971816ab8bcd470ee5ed73dc19b9ee2575ff91ddac7d62ad8","fast_id":"fafba6265d4a50c85c977f9b2c055f4921855f2ab63ec15f0aa72637abc4acd1","fast_time":0.0193894944,"language":"cpp","measured_fast_code_id":"fafba6265d4a50c85c977f9b2c055f4921855f2ab63ec15f0aa72637abc4acd1","measured_slow_code_id":"3cacaa80998aca196b5e25e94d2d238d8ba6401f42225ea7c3cb43bf18d52623","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_51924","problem_id":"p03349","slow_code_id":"e0d5bb72a539dea6c59ea474cb32d773c8a949528d65b22a1eb4e279709364bf","slow_id":"3cacaa80998aca196b5e25e94d2d238d8ba6401f42225ea7c3cb43bf18d52623","slow_time":0.2537606912,"speedup":13.087535237638791,"stratum":"8+","sampling_key":"1ee5ce741fa24b26097beab8aa3ef3822d6b746a78d21a9fc9cd99440d5b38c8","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, l, r) for (int i = l; i <= r; i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 305;\n\nll f[maxn][maxn], g[maxn][maxn], c[maxn][maxn], fac[maxn], inv[maxn];\n\nint n, k;\n\nll mm;\n\nll dfs(int i, int j);\n\nll getsum(int i, int j) {\n\n  if (~g[i][j])\n    return g[i][j];\n\n  g[i][j] = 0;\n\n  rep(p, j, k)(g[i][j] += dfs(i, p)) %= mm;\n\n  return g[i][j];\n}\n\nll dfs(int i, int j) {\n\n  if (~f[i][j])\n    return f[i][j];\n\n  if (i == 1)\n    return f[i][j] = 1;\n\n  f[i][j] = 0;\n\n  rep(len, 1, i - 1) {\n\n    (f[i][j] += getsum(len, j + 1) * dfs(i - len, j) % mm * c[i - 2][len - 1] % mm) %= mm;\n  }\n\n  return f[i][j];\n}\n\nint main() {\n\n  scanf(\"%d%d%lld\", &n, &k, &mm);\n\n  c[0][0] = 1;\n\n  rep(i, 1, n) {\n\n    c[i][0] = 1;\n    c[i][i] = 1;\n\n    rep(j, 1, i - 1) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mm;\n  }\n\n  memset(f, -1, sizeof(f));\n\n  memset(g, -1, sizeof(g));\n\n  dfs(n + 1, 0);\n\n  printf(\"%lld\\n\", f[n + 1][0]);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\n#define N 305\n\nint n, m, p, dp[N][N], su[N][N], c[N][N];\n\nint main()\n\n{\n\n  scanf(\"%d%d%d\", &n, &m, &p);\n  n++;\n  m++;\n\n  for (int i = 1; i <= m; i++)\n    dp[1][i] = 1, su[1][i] = i;\n\n  for (int i = 0; i <= n; i++)\n    c[i][i] = c[i][0] = 1;\n\n  for (int i = 2; i <= n; i++)\n    for (int j = 1; j < i; j++)\n      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % p;\n\n  for (int i = 2; i <= n; i++)\n\n  {\n\n    for (int k = 1; k <= m; k++)\n\n      for (int j = 1; j < i; j++)\n\n        dp[i][k] = (dp[i][k] + 1ll * dp[i - j][k] * su[j][k - 1] % p * c[i - 2][j - 1]) % p;\n\n    for (int k = 1; k <= m; k++)\n      su[i][k] = (su[i][k - 1] + dp[i][k]) % p;\n  }\n\n  printf(\"%d\\n\", dp[n][m]);\n}"}
{"fast_code_id":"95d1da3c06f87b05c134fe87e88be779fb6a86bf097b56d42f4ca296d99e6ef9","fast_id":"529cfe9f73279bc4409efcfee833fdce4969e01eae49ff427fd2b3782734cd94","fast_time":0.0005828451,"language":"cpp","measured_fast_code_id":"529cfe9f73279bc4409efcfee833fdce4969e01eae49ff427fd2b3782734cd94","measured_slow_code_id":"fcb721738d13f2a5cb230a96a11dfccfbbf4a8b1e4a9b80e43d5aca85f6b7640","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_52960","problem_id":"p02613","slow_code_id":"2c7d56226864642ceabbc1ad262bfb63f2a02421f7dc77a5ecc2d81aa4789a79","slow_id":"fcb721738d13f2a5cb230a96a11dfccfbbf4a8b1e4a9b80e43d5aca85f6b7640","slow_time":0.0135124367,"speedup":23.183581195072243,"stratum":"8+","sampling_key":"01c21ff2ff892f459d1c5714ae9687b19b7bfd8c2669f5dd6e8131949e1ed120","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  string s[100000];\n\n  int i, n;\n\n  int AC = 0, WA = 0, TLE = 0, RE = 0;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++) {\n\n    cin >> s[i];\n  }\n\n  for (i = 0; i < n; i++) {\n\n    if (s[i] == \"AC\") {\n      AC += 1;\n    }\n\n    else if (s[i] == \"WA\") {\n      WA += 1;\n    }\n\n    else if (s[i] == \"TLE\") {\n      TLE += 1;\n    }\n\n    else if (s[i] == \"RE\") {\n      RE += 1;\n    }\n  }\n\n  cout << \"AC\"\n       << \" \"\n       << \"x\"\n       << \" \" << AC << endl;\n\n  cout << \"WA\"\n       << \" \"\n       << \"x\"\n       << \" \" << WA << endl;\n\n  cout << \"TLE\"\n       << \" \"\n       << \"x\"\n       << \" \" << TLE << endl;\n\n  cout << \"RE\"\n       << \" \"\n       << \"x\"\n       << \" \" << RE << endl;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int ac = 0, wa = 0, tle = 0, re = 0, in;\n\n  char input[10];\n\n  scanf(\"%d\", &in);\n\n  for (int i = 0; i < in; i++)\n\n  {\n\n    scanf(\"%s\", input);\n\n    if (input[0] == 'A') {\n\n      ac++;\n\n    }\n\n    else if (input[0] == 'W') {\n\n      wa++;\n\n    }\n\n    else if (input[0] == 'T') {\n\n      tle++;\n\n    }\n\n    else if (input[0] == 'R') {\n\n      re++;\n    }\n  }\n\n  printf(\"AC x %d \\n\", ac);\n\n  printf(\"WA x %d \\n\", wa);\n\n  printf(\"TLE x %d \\n\", tle);\n\n  printf(\"RE x %d \\n\", re);\n\n  return 0;\n}"}
{"fast_code_id":"7c6ba5dfd2b020a469589ea886f78f6467ac3c1bc6bcedac563d735d78e7114b","fast_id":"4685bb85b7ce18c79920c7e2d13f2d0d96c4bca568b4027adbe407ab45e2ebdd","fast_time":0.0195530964,"language":"cpp","measured_fast_code_id":"4685bb85b7ce18c79920c7e2d13f2d0d96c4bca568b4027adbe407ab45e2ebdd","measured_slow_code_id":"f5efb333a869803d7a263600b0cc3755b2466f3b1159a2b3a9fc16cc95eeee31","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5392","problem_id":"p03768","slow_code_id":"411f49c78546def77b809061571765b964415a5608434d7cc6f9956718dd3637","slow_id":"f5efb333a869803d7a263600b0cc3755b2466f3b1159a2b3a9fc16cc95eeee31","slow_time":0.8183565848,"speedup":41.85304301982575,"stratum":"8+","sampling_key":"312239051acfb39513e8db5a0166862a39e8dbd239fb0788e60057ee36a2ac00","slow_code":"\n\n#include <stdio.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <deque>\n\n#include <set>\n\n#include <stack>\n\n#include <string.h>\n\n#include <map>\n\n#include <vector>\n\n#include <queue>\n\n#include <math.h>\n\n#include <stack>\n\n#include <complex>\n\n#define ll long long\n\n#define X real()\n\n#define Y imag()\n\n#define f first\n\n#define s second\n\n#define angle(a) (atan2((a).imag(), (a).real()))\n\n#define vec(a, b) ((b) - (a))\n\n#define same(p1, p2) (dp(vec(p1, p2), vec(p1, p2)) < EPS)\n\n#define dp(a, b) ((conj(a) * (b)).real())\n\n#define cp(a, b) ((conj(a) * (b)).imag())\n\n#define lngth(a) (hypot((a).imag(), (a).real()))\n\n#define normalize(a) (a) / length(a)\n\nusing namespace std;\n\nconst int N = 200005;\n\ntypedef pair<ll, int> ii;\n\ntypedef pair<ii, int> event;\n\ntypedef complex<double> point;\n\nconst double EPS = 1e-9;\n\nconst int INF = 100000;\n\nconst double PI = acos(-1);\n\nint gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }\n\nint n, m, a[N], d[N], c[N], mx[N], sol[N];\n\nvector<int> adj[N];\n\nbool v[N][12];\n\nvoid bfs(int node, int dep, int col) {\n\n  if (mx[node] > dep)\n    return;\n\n  queue<int> q;\n\n  q.push(node);\n\n  q.push(dep);\n\n  v[node][dep] = 1;\n\n  if (mx[node] == -1)\n\n    sol[node] = col;\n\n  mx[node] = dep;\n\n  while (q.size()) {\n\n    node = q.front();\n\n    q.pop();\n\n    dep = q.front();\n\n    q.pop();\n\n    if (!dep)\n      continue;\n\n    for (int i = 0; i < adj[node].size(); i++) {\n\n      int to = adj[node][i];\n\n      if (mx[to] >= dep - 1)\n        continue;\n\n      if (mx[to] == -1)\n\n        sol[to] = col;\n\n      mx[to] = dep - 1;\n\n      q.push(to);\n\n      q.push(dep - 1);\n    }\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 0; i < m; i++) {\n\n    int a, b;\n\n    scanf(\"%d%d\", &a, &b);\n\n    adj[a].push_back(b);\n\n    adj[b].push_back(a);\n  }\n\n  memset(mx, -1, sizeof(mx));\n\n  int q;\n\n  scanf(\"%d\", &q);\n\n  for (int i = 0; i < q; i++)\n\n    scanf(\"%d%d%d\", &a[i], &d[i], &c[i]);\n\n  memset(sol, 0, sizeof(sol));\n\n  for (int i = q - 1; i > -1; i--) {\n\n    bfs(a[i], d[i], c[i]);\n  }\n\n  for (int i = 1; i <= n; i++)\n    cout << sol[i] << endl;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\n#define MN 100005\n\nusing namespace std;\n\nint n, m, q, v[MN], c[MN], d[MN], col[MN][11], num, head[MN];\n\nstruct edge {\n  int to, next;\n} g[MN << 2];\n\nvoid ins(int u, int v) {\n  g[++num].next = head[u];\n  head[u] = num;\n  g[num].to = v;\n}\n\nvoid dfs(int u, int cc, int dd) {\n\n  if (col[u][dd])\n    return;\n  col[u][dd] = cc;\n\n  for (int i = head[u]; i; i = g[i].next)\n    if (dd - 1 >= 0)\n      dfs(g[i].to, cc, dd - 1);\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n  int x, y;\n\n  for (int i = 1; i <= m; i++)\n    scanf(\"%d%d\", &x, &y), ins(x, y), ins(y, x);\n\n  for (int i = 1; i <= n; i++)\n    ins(i, i);\n\n  scanf(\"%d\", &q);\n  for (int i = 1; i <= q; i++)\n    scanf(\"%d%d%d\", &v[i], &d[i], &c[i]);\n\n  for (int i = q; i >= 1; i--)\n    dfs(v[i], c[i], d[i]);\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%d\\n\", col[i][0]);\n}"}
{"fast_code_id":"527680f237fbe723618c05aedc280161509cf23b2b16fb3b766b6d861a9868bd","fast_id":"4ec9c4aaf744d46713e86baefa89442ed4b7e17c405f38c81a861efda77b3a81","fast_time":0.007075362,"language":"cpp","measured_fast_code_id":"4ec9c4aaf744d46713e86baefa89442ed4b7e17c405f38c81a861efda77b3a81","measured_slow_code_id":"7359f75a0850c29e1f25da2f9f8c91c02f95e48c2a313c8a753658f281825008","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54218","problem_id":"p02729","slow_code_id":"a0f5d647cbcaa3251e81b99d3a1cdc2db96b60d136de119f4e80ac2cb71fdf35","slow_id":"7359f75a0850c29e1f25da2f9f8c91c02f95e48c2a313c8a753658f281825008","slow_time":0.1332844516,"speedup":18.837827887816903,"stratum":"8+","sampling_key":"169c91b49c64de8cdacc96232467dd2ea6dbdfa502d4abe821c4ad0d3a478801","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint gcd(long long a, long long b)\n\n{\n\n  if (b == 0)\n\n    return a;\n\n  return gcd(b, a % b);\n}\n\nconst int N = 1e5 + 5;\n\nvector<int> adj[N];\n\nbool visited[N];\n\nint nodesNum;\n\nvoid dfs(int node)\n\n{\n\n  if (visited[node])\n\n    return;\n\n  visited[node] = true;\n\n  for (int child : adj[node])\n\n    dfs(child);\n}\n\nint main()\n\n{\n\n  long long n, m;\n\n  cin >> n >> m;\n\n  long long a = (n * (n - 1)) / (2);\n\n  long long b = (m * (m - 1)) / (2);\n\n  long long ans = (a + b);\n\n  cout << ans;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int a, b, c, d;\n\n  scanf(\"%d %d\", &a, &b);\n\n  c = a * (a - 1) / 2;\n\n  d = b * (b - 1) / 2;\n\n  printf(\"%d\\n\", c + d);\n\n  return 0;\n}"}
{"fast_code_id":"6a688b913193d3bd70248afea2b524dab6b76e26830068f5db4d89552554fa2e","fast_id":"ab99e650a13049ba30321f4b51264f5dbeabc26ac66a5a77f142daa30e69ae45","fast_time":0.0373815499,"language":"cpp","measured_fast_code_id":"ab99e650a13049ba30321f4b51264f5dbeabc26ac66a5a77f142daa30e69ae45","measured_slow_code_id":"3f2bf4a942332b8bf12e59e0589b898990fa93d081b270063ffeb1e382df8c74","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54231","problem_id":"p03641","slow_code_id":"dbd4ef8675ef4a0b679e5aa05318f6f075047b164ab1004465658a4083b69b23","slow_id":"3f2bf4a942332b8bf12e59e0589b898990fa93d081b270063ffeb1e382df8c74","slow_time":0.4148106811,"speedup":11.096668870329532,"stratum":"8+","sampling_key":"12977ea9b70893302dcb3dbc3489e14e1457cb347540c3bffdf8fe679e6ac17e","slow_code":"#include <stdio.h>\n\n#include <iostream>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <string>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <stack>\n\n#include <queue>\n\n#include <set>\n\n#include <map>\n\n#include <ctime>\n\n#include <vector>\n\n#include <fstream>\n\n#include <list>\n\n#include <iomanip>\n\n#include <numeric>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\n#define ms(s) memset(s, 0, sizeof(s))\n\nconst int INF = 1e9;\n\ninline int read() {\n\n  int X = 0, w = 0;\n\n  char ch = 0;\n\n  while (!isdigit(ch)) {\n    w |= ch == '-';\n    ch = getchar();\n  }\n\n  while (isdigit(ch))\n    X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();\n\n  return w ? -X : X;\n}\n\nint n;\n\nint m = 1;\n\nint a[800005];\n\nint seg[2][800005];\n\nint ans[200005];\n\nstruct node\n\n{\n\n  int a, b;\n\n  int mint;\n};\n\nvoid update(int k)\n\n{\n\n  int odd;\n\n  int pos = k;\n\n  odd = k % 2;\n\n  k += m - 1;\n\n  seg[odd][k] = pos;\n\n  seg[(odd + 1) % 2][k] = INF;\n\n  while (k > 1)\n\n  {\n\n    k /= 2;\n\n    for (int i = 0; i < 2; i++)\n\n    {\n\n      if (seg[i][k * 2] == INF and seg[i][k * 2 + 1] != INF)\n\n      {\n\n        seg[i][k] = seg[i][k * 2 + 1];\n\n      }\n\n      else if (seg[i][k * 2 + 1] == INF && seg[i][k * 2] != INF)\n\n      {\n\n        seg[i][k] = seg[i][k * 2];\n\n      }\n\n      else if (seg[i][k * 2] != INF && seg[i][k * 2 + 1] != INF)\n\n      {\n\n        if (a[seg[i][k * 2]] < a[seg[i][k * 2 + 1]])\n\n        {\n\n          seg[i][k] = seg[i][k * 2];\n\n        }\n\n        else\n\n        {\n\n          seg[i][k] = seg[i][k * 2 + 1];\n        }\n      }\n    }\n  }\n}\n\nint query(int l, int r, int k, int l1, int r1)\n\n{\n\n  int odd = l % 2;\n\n  if (l <= l1 and r >= r1)\n\n  {\n\n    return seg[odd][k];\n  }\n\n  if (r < l1 or l > r1)\n\n  {\n\n    return INF;\n\n  }\n\n  else\n\n  {\n\n    int x = query(l, r, k * 2, l1, (l1 + r1) / 2);\n\n    int y = query(l, r, k * 2 + 1, (l1 + r1 + 1) / 2, r1);\n\n    if (x == INF and y != INF)\n\n    {\n\n      return y;\n\n    }\n\n    else if (x != INF and y == INF)\n\n    {\n\n      return x;\n\n    }\n\n    else if (x == INF and y == INF)\n\n    {\n\n      return INF;\n\n    }\n\n    else\n\n    {\n\n      if (a[x] < a[y])\n\n      {\n\n        return x;\n\n      }\n\n      else\n\n      {\n\n        return y;\n      }\n    }\n  }\n}\n\nbool operator>(node x, node y)\n\n{\n\n  if (x.mint != INF and y.mint != INF)\n\n  {\n\n    return a[x.mint] > a[y.mint];\n\n  }\n\n  else if (x.mint == INF and y.mint != INF)\n\n  {\n\n    return true;\n\n  }\n\n  else if (x.mint != INF and y.mint == INF)\n\n  {\n\n    return false;\n  }\n\n  return true;\n}\n\nint main()\n\n{\n\n  cin >> n;\n\n  for (int i = 0; i < 800000; i++)\n\n  {\n\n    a[i] = INF;\n\n    seg[0][i] = INF;\n\n    seg[1][i] = INF;\n  }\n\n  while (m < n)\n\n  {\n\n    m *= 2;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> a[i];\n  }\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    update(i);\n  }\n\n  priority_queue<node, vector<node>, greater<node> > pq;\n\n  node init = {1, n, query(1, n, 1, 1, m)};\n\n  pq.push(init);\n\n  int id = 1;\n\n  while (id <= n and !pq.empty())\n\n  {\n\n    node f = pq.top();\n\n    pq.pop();\n\n    ans[id++] = f.mint;\n\n    int tmp = query(f.mint + 1, f.b, 1, 1, m);\n\n    node nx, dx = {f.mint + 1, f.b, tmp};\n\n    if (f.a < f.mint - 1)\n\n    {\n\n      tmp = query(f.a, f.mint - 1, 1, 1, m);\n\n      nx = {f.a, f.mint - 1, tmp};\n\n      pq.push(nx);\n    }\n\n    ans[id++] = dx.mint;\n\n    node sec, thir;\n\n    if (dx.a < dx.mint - 1)\n\n    {\n\n      tmp = query(dx.a, dx.mint - 1, 1, 1, m);\n\n      sec = {dx.a, dx.mint - 1, tmp};\n\n      pq.push(sec);\n    }\n\n    if (dx.mint + 1 < dx.b)\n\n    {\n\n      tmp = query(dx.mint + 1, dx.b, 1, 1, m);\n\n      thir = {dx.mint + 1, dx.b, tmp};\n\n      pq.push(thir);\n    }\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cout << a[ans[i]] << \" \";\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 10;\n\nint n, a[N], t[2][N << 2];\n\ninline int read() {\n\n  int s = 0, f = 1;\n\n  char ch;\n\n  for (; ch < '0' || ch > '9'; ch = getchar())\n    if (ch == '-')\n      f = -1;\n\n  for (; ch >= '0' && ch <= '9'; ch = getchar())\n    s = (s << 1) + (s << 3) + ch - '0';\n\n  return s * f;\n}\n\ninline void add(int o, int pos, int l, int r, int cnt) {\n\n  if (a[cnt] < a[t[o][pos]])\n    t[o][pos] = cnt;\n\n  if (l == r)\n    return;\n\n  int mid = (l + r) >> 1;\n\n  if (cnt <= mid)\n    add(o, pos << 1, l, mid, cnt);\n\n  else\n    add(o, pos << 1 | 1, mid + 1, r, cnt);\n}\n\ninline int ask(int o, int pos, int l, int r, int L, int R) {\n\n  if (l > R || r < L)\n    return 0;\n\n  if (L <= l && r <= R)\n    return t[o][pos];\n\n  int mid = (l + r) >> 1;\n\n  int lans = ask(o, pos << 1, l, mid, L, R);\n\n  int rans = ask(o, pos << 1 | 1, mid + 1, r, L, R);\n\n  return a[lans] < a[rans] ? lans : rans;\n}\n\nstruct node {\n\n  int l, r, v;\n\n  node() {}\n\n  node(int _l, int _r) {\n    l = _l, r = _r, v = l > r ? 0 : ask(l & 1, 1, 1, n, l, r);\n  }\n\n  friend bool operator<(node A, node B) { return a[A.v] < a[B.v]; }\n};\n\nset<node> s;\n\nint main() {\n\n  n = read();\n\n  a[0] = n + 1;\n\n  for (int i = 1; i <= n; ++i) {\n\n    a[i] = read();\n\n    add(i & 1, 1, 1, n, i);\n  }\n\n  s.clear();\n\n  s.insert(node(1, n));\n\n  for (int i = 1; i <= n >> 1; ++i) {\n\n    node now = *s.begin();\n\n    s.erase(s.begin());\n\n    int l = now.l, r = now.r;\n\n    int lmid = now.v, rmid = ask((lmid & 1) ^ 1, 1, 1, n, lmid, r);\n\n    printf(\"%d %d \", a[lmid], a[rmid]);\n\n    s.insert(node(l, lmid - 1));\n\n    s.insert(node(lmid + 1, rmid - 1));\n\n    s.insert(node(rmid + 1, r));\n  }\n\n  puts(\"\");\n\n  return 0;\n}\n"}
{"fast_code_id":"372f1541c415f6e10d6cd5407194656872faa4da4733486c664fc23720791907","fast_id":"5f94dd3fffe45b455bb7a61dfad5ab5111d49480874a259f62003bb20b92dd13","fast_time":0.0010313246,"language":"cpp","measured_fast_code_id":"5f94dd3fffe45b455bb7a61dfad5ab5111d49480874a259f62003bb20b92dd13","measured_slow_code_id":"726482d4034b3a67be414ea3af97538390a20470a6a223bc8a6a7cb48a91720f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54257","problem_id":"p04016","slow_code_id":"01e9dde53a2117be68226e1d445d0780238158c42575f47e9e9df18295a4044b","slow_id":"726482d4034b3a67be414ea3af97538390a20470a6a223bc8a6a7cb48a91720f","slow_time":0.0030813872,"speedup":2.987795694973242,"stratum":"2-4","sampling_key":"2a7d7d9fc41b2214beec13d77be37cd5895ab7ee74abadadccbd1bf913de386f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\nLL f(LL b, LL n) {\n\n  if (b > n)\n    return n;\n\n  return f(b, n / b) + n % b;\n}\n\nint main() {\n\n  LL n, s, ans = 1e18;\n\n  scanf(\"%lld%lld\", &n, &s);\n\n  for (int b = 2; b <= 1000000; b++)\n    if (f(b, n) == s)\n      ans = min(ans, b * 1ll);\n\n  if (n == s)\n    ans = min(ans, n + 1);\n\n  else if (n > s) {\n\n    LL ns = n - s;\n\n    for (LL i = 1; i * i <= ns; i++) {\n\n      if (ns % i == 0) {\n\n        if (f(i + 1, n) == s)\n          ans = min(ans, i + 1);\n\n        if (f(ns / i + 1, n) == s)\n          ans = min(ans, ns / i + 1);\n      }\n    }\n  }\n\n  if (ans == 1e18)\n    ans = -1;\n\n  printf(\"%lld\\n\", ans);\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <set>\n\n#include <list>\n\n#include <vector>\n\n#include <stack>\n\n#include <queue>\n\n#include <map>\n\n#include <string>\n\n#include <sstream>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cctype>\n\n#include <cmath>\n\n#include <fstream>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define dbg(x) cerr << #x \" = \" << x << endl;\n\ntypedef pair<int, int> P;\n\ntypedef long long ll;\n\nll f(ll b, ll n)\n\n{\n\n  ll ans = 0;\n\n  while (n)\n\n  {\n\n    ans += n % b;\n\n    n /= b;\n  }\n\n  ans += n;\n\n  return ans;\n}\n\nint main()\n\n{\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  ll n, s;\n\n  cin >> n >> s;\n\n  ll b = -1;\n\n  if (s > n)\n\n  {\n\n    cout << -1 << endl;\n\n  }\n\n  else if (s == n)\n\n  {\n\n    cout << n + 1 << endl;\n\n  }\n\n  else\n\n  {\n\n    for (ll i = 2; i <= sqrt(n) + 1; i++)\n\n    {\n\n      if (f(i, n) == s)\n\n      {\n\n        b = i;\n\n        break;\n      }\n    }\n\n    if (b != -1)\n\n    {\n\n      cout << b << endl;\n\n      return 0;\n    }\n\n    if (b == -1)\n\n    {\n\n      for (ll i = 1; i <= sqrt(n - s) + 1; i++)\n\n      {\n\n        if ((n - s) % i == 0)\n\n        {\n\n          ll x1 = i;\n\n          ll x0 = s - x1;\n\n          ll tmpb = (n - s) / i + 1;\n\n          if (x1 < tmpb && x0 < tmpb && x0 >= 0 && tmpb >= 2)\n\n          {\n\n            if (b == -1)\n              b = tmpb;\n\n            else\n\n              b = min(b, tmpb);\n          }\n        }\n      }\n\n      cout << b << endl;\n    }\n  }\n}"}
{"fast_code_id":"71fe0cf58ef8680a47484d4b0364e29033d04e9420154e8d9e59b8719aebeb14","fast_id":"ffb8bca4f037e7c171018911fb7d42449b3b35a80e175b596f52e92a7555f5b3","fast_time":0.1031956977,"language":"cpp","measured_fast_code_id":"ffb8bca4f037e7c171018911fb7d42449b3b35a80e175b596f52e92a7555f5b3","measured_slow_code_id":"17e1c683a7bc200c2883f67f52d8b4cf1d39d02b587c2d56db6e7b18c5f977e3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54259","problem_id":"p01886","slow_code_id":"98eb16042f3d4099eadf733869f80e9983568c3b91c3313745bbdc9bc4952744","slow_id":"17e1c683a7bc200c2883f67f52d8b4cf1d39d02b587c2d56db6e7b18c5f977e3","slow_time":0.6150568999,"speedup":5.9601021516229356,"stratum":"4-8","sampling_key":"935c388549a0b3952ffdf5da0bb9f8c381f7c871d4e23f23ff37e576f259926a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\ninline LL sqr(const LL &v) { return v * v; }\n\nstruct PT\n\n{\n\n  LL x, y;\n\n  PT(LL x = 0, LL y = 0) : x(x), y(y) {}\n\n  PT operator+(const PT &d) const { return PT(x + d.x, y + d.y); }\n\n  PT &operator+=(const PT &d) {\n    x += d.x, y += d.y;\n    return *this;\n  }\n\n  PT operator-(const PT &d) const { return PT(x - d.x, y - d.y); }\n\n  PT &operator-=(const PT &d) {\n    x -= d.x, y -= d.y;\n    return *this;\n  }\n\n  bool operator<(const PT &o) { return x != o.x ? x < o.x : y < o.y; }\n};\n\nLL norm2(const PT &v) { return sqr(v.x) + sqr(v.y); }\n\nLL norm2(const PT &p1, const PT &p2) { return norm2(p1 - p2); }\n\nLL vect(const PT &v1, const PT &v2) { return v1.x * v2.y - v2.x * v1.y; }\n\nLL vect(const PT &p, const PT &p1, const PT &p2) {\n  return vect(p1 - p, p2 - p);\n}\n\nconst int maxn = 100100;\n\nint n, hn1, hn2, xn, x[maxn];\n\nLL area, db1[maxn], db2[maxn];\n\nPT p[maxn], h1[maxn], h2[maxn];\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; ++i)\n    scanf(\"%lld%lld\", &p[i].x, &p[i].y), x[xn++] = p[i].x;\n\n  sort(p, p + n);\n\n  sort(x, x + xn), xn = unique(x, x + xn) - x;\n\n  hn1 = hn2 = area = 0;\n\n  for (int i = 0, j; i < n;) {\n\n    for (j = i; j < n; ++j) {\n\n      if (p[i].x != p[j].x)\n        break;\n\n      for (; hn1 >= 2 && vect(h1[hn1 - 2], h1[hn1 - 1], p[j]) <= 0; --hn1)\n\n        area -= vect(h1[hn1 - 2], h1[hn1 - 1]);\n\n      if (hn1)\n        area += vect(h1[hn1 - 1], p[j]);\n\n      h1[hn1++] = p[j];\n\n      for (; hn2 >= 2 && vect(p[j], h2[hn2 - 1], h2[hn2 - 2]) <= 0; --hn2)\n\n        area -= vect(h2[hn2 - 1], h2[hn2 - 2]);\n\n      if (hn2)\n        area += vect(p[j], h2[hn2 - 1]);\n\n      h2[hn2++] = p[j];\n    }\n\n    int id = lower_bound(x, x + xn, p[i].x) - x + 1;\n\n    db1[id] = area;\n\n    i = j;\n  }\n\n  hn1 = hn2 = area = 0;\n\n  for (int i = n - 1, j; i >= 0;) {\n\n    for (j = i; j >= 0; --j) {\n\n      if (p[i].x != p[j].x)\n        break;\n\n      p[j].x = -p[j].x;\n\n      for (; hn1 >= 2 && vect(h1[hn1 - 2], h1[hn1 - 1], p[j]) <= 0; --hn1)\n\n        area -= vect(h1[hn1 - 2], h1[hn1 - 1]);\n\n      if (hn1)\n        area += vect(h1[hn1 - 1], p[j]);\n\n      h1[hn1++] = p[j];\n\n      for (; hn2 >= 2 && vect(p[j], h2[hn2 - 1], h2[hn2 - 2]) <= 0; --hn2)\n\n        area -= vect(h2[hn2 - 1], h2[hn2 - 2]);\n\n      if (hn2)\n        area += vect(p[j], h2[hn2 - 1]);\n\n      h2[hn2++] = p[j];\n\n      p[j].x = -p[j].x;\n    }\n\n    int id = lower_bound(x, x + xn, p[i].x) - x + 1;\n\n    db2[id] += area;\n\n    i = j;\n  }\n\n  LL ans = 8e18;\n\n  for (int i = 0; i <= xn; ++i)\n    ans = min(ans, db1[i] + db2[i + 1]);\n\n  printf(\"%lld\\n\", (ans + 1) / 2);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cstring>\n\n#include <string>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#define ll long long\n\nusing namespace std;\n\nconst int maxn = 1e5 + 10;\n\nstruct Point {\n\n  ll x, y;\n\n  Point() {}\n\n  Point(ll _x, ll _y) : x(_x), y(_y) {}\n\n  bool operator<(const Point &P) const { return x < P.x || (x == P.x && y < P.y); }\n\n  Point operator-(const Point &P) const { return Point(x - P.x, y - P.y); }\n\n  ll Cross(const Point &P) const { return x * P.y - y * P.x; }\n\n  void pt() { printf(\"(%lld,%lld)\\n\", x, y); }\n\n} p[maxn], cxh1[maxn], cxh2[maxn];\n\nll Area(Point P1, Point P2) { return P1.Cross(P2); }\n\nll s1[maxn][2], s2[maxn][2];\n\nPoint down_Convexhull[maxn], up_Convexhull[maxn];\n\nvoid solve(ll s[maxn][2], int n, bool rev) {\n\n  int top1 = 0, top2 = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    if (i)\n      s[i][0] = s[i - 1][0], s[i][1] = s[i - 1][1];\n\n    while (top1 > 1 && (p[i] - down_Convexhull[top1 - 2])\n                               .Cross(down_Convexhull[top1 - 1] - down_Convexhull[top1 - 2]) >= 0) {\n\n      s[i][0] -= Area(down_Convexhull[top1 - 2] - down_Convexhull[0],\n                      down_Convexhull[top1 - 1] - down_Convexhull[0]);\n      top1--;\n    }\n    down_Convexhull[top1++] = p[i];\n\n    if (top1 > 2)\n      s[i][0] += Area(down_Convexhull[top1 - 2] - down_Convexhull[0],\n                      down_Convexhull[top1 - 1] - down_Convexhull[0]);\n\n    while (\n        top2 > 1 &&\n        (up_Convexhull[top2 - 1] - up_Convexhull[top2 - 2]).Cross(p[i] - up_Convexhull[top2 - 2]) >=\n            0) {\n\n      s[i][1] -= Area(up_Convexhull[top2 - 1] - up_Convexhull[0],\n                      up_Convexhull[top2 - 2] - up_Convexhull[0]);\n      top2--;\n    }\n    up_Convexhull[top2++] = p[i];\n\n    if (top2 > 2)\n      s[i][1] += Area(up_Convexhull[top2 - 1] - up_Convexhull[0],\n                      up_Convexhull[top2 - 2] - up_Convexhull[0]);\n  }\n\n  if (rev) {\n\n    for (int i = 0; i < n / 2; i++) {\n\n      swap(s[i][0], s[n - i - 1][0]);\n\n      swap(s[i][1], s[n - i - 1][1]);\n    }\n  }\n}\n\nint main() {\n\n  int n;\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n    scanf(\"%lld%lld\", &p[i].x, &p[i].y);\n  }\n\n  if (n <= 3) {\n    printf(\"0\\n\");\n    return 0;\n  }\n  sort(p, p + n);\n\n  solve(s1, n, 0);\n  reverse(p, p + n);\n\n  solve(s2, n, 1);\n  reverse(p, p + n);\n\n  ll ans = s1[n - 1][0] + s1[n - 1][1];\n\n  for (int i = 0; i < n - 1; i++) {\n\n    if (p[i].x == p[i + 1].x)\n      continue;\n\n    ans = min(ans, s1[i][0] + s1[i][1] + s2[i + 1][0] + s2[i + 1][1]);\n  }\n\n  for (int i = n - 1; i > 0; i--) {\n\n    if (p[i].x == p[i - 1].x)\n      continue;\n\n    ans = min(ans, s1[i - 1][0] + s1[i - 1][1] + s2[i][0] + s2[i][1]);\n  }\n\n  printf(\"%lld\\n\", ans / 2 + ans % 2);\n\n  return 0;\n}\n"}
{"fast_code_id":"6e0f81460d156f03a32a4849dd6e894921352758ed83d59ca58c5aeae07253d7","fast_id":"d43c9a5b1e64ebcec1d3b9d18df2c7866862eabc9231648518e26113ef570fa2","fast_time":0.1079486508,"language":"cpp","measured_fast_code_id":"d43c9a5b1e64ebcec1d3b9d18df2c7866862eabc9231648518e26113ef570fa2","measured_slow_code_id":"6f9968d9ba63c1d9eb7effa7d813eae7267f87850a52f6a28e4dac4efecc6ee6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54274","problem_id":"p02734","slow_code_id":"e2ae386244c9fd36a0848fc350c6c780e1c284ccd39c7f6488590930db75a4c2","slow_id":"6f9968d9ba63c1d9eb7effa7d813eae7267f87850a52f6a28e4dac4efecc6ee6","slow_time":0.2999970648,"speedup":2.779071925186118,"stratum":"2-4","sampling_key":"297997b70dcd26c82c80cce91caa512f7c9a50a93ea5f40c58ae26c64ad6201a","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <string>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <iomanip>\n\n#include <fstream>\n\n#include <cassert>\n\n#include <cstring>\n\n#include <unordered_set>\n\n#include <unordered_map>\n\n#include <numeric>\n\n#include <ctime>\n\n#include <bitset>\n\n#include <complex>\n\n#include <random>\n\nusing namespace std;\n\nconst int N = 3002;\n\nconst int MOD = 998244353;\n\ntypedef long long ll;\n\nint add(int a, int b) {\n\n  if (a + b >= MOD) {\n\n    return a + b - MOD;\n\n  } else {\n\n    return a + b;\n  }\n}\n\nint mul(int a, int b) { return ((ll)a * b) % MOD; }\n\nvector<vector<int>> calc(vector<int> &a) {\n\n  int n = (int)a.size();\n\n  vector<vector<int>> dp(n + 1, vector<int>(N));\n\n  dp[0][0] = 1;\n\n  for (int i = 0; i < n; i++) {\n\n    for (int j = 0; j < N; j++) {\n\n      if (j + a[i] < N) {\n\n        dp[i + 1][j + a[i]] = add(dp[i + 1][j + a[i]], dp[i][j]);\n      }\n\n      dp[i + 1][j] = add(dp[i + 1][j], dp[i][j]);\n    }\n  }\n\n  vector<vector<int>> rdp(n + 1, vector<int>(N));\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = 0; j < N; j++) {\n\n      if (j >= a[i - 1]) {\n\n        rdp[i][j] = dp[i - 1][j - a[i - 1]];\n      }\n    }\n  }\n\n  rdp[0][0] = 1;\n\n  return rdp;\n}\n\nint n, s;\n\nint a[N];\n\nint solve(int l, int r) {\n\n  if (l == r) {\n\n    return 0;\n  }\n\n  if (l + 1 == r) {\n\n    if (a[l] == s) {\n\n      return (l + 1) * (n - l);\n\n    } else {\n\n      return 0;\n    }\n  }\n\n  int m = (r + l) >> 1;\n\n  int ans = 0;\n\n  ans = add(ans, solve(l, m));\n\n  ans = add(ans, solve(m, r));\n\n  vector<int> x, y;\n\n  for (int i = l; i < r; i++) {\n\n    if (i < m)\n      x.push_back(a[i]);\n\n    else\n      y.push_back(a[i]);\n  }\n\n  reverse(x.begin(), x.end());\n\n  auto fdp = calc(x);\n\n  auto sdp = calc(y);\n\n  vector<int> tsum(s);\n\n  for (int fs = 0; fs < s; fs++) {\n\n    if (s - fs >= N)\n      continue;\n\n    int c = 0;\n\n    for (int j = m; j < r; j++) {\n\n      c = add(c, mul(sdp[j - m + 1][s - fs], (n - j)));\n    }\n\n    tsum[fs] = c;\n  }\n\n  for (int i = l; i < m; i++) {\n\n    for (int fsum = 1; fsum < s; fsum++) {\n\n      int ml = mul((i + 1), fdp[m - i][fsum]);\n\n      int c = tsum[fsum];\n\n      ans = add(ans, mul(c, ml));\n    }\n  }\n\n  return ans;\n}\n\nsigned main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cin >> n >> s;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n  }\n\n  int ans = solve(0, n);\n\n  cout << ans << endl;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <string>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <iomanip>\n\n#include <fstream>\n\n#include <cassert>\n\n#include <cstring>\n\n#include <unordered_set>\n\n#include <unordered_map>\n\n#include <numeric>\n\n#include <ctime>\n\n#include <bitset>\n\n#include <complex>\n\n#include <random>\n\nusing namespace std;\n\nconst int N = 3002;\n\nconst int MOD = 998244353;\n\ntypedef long long ll;\n\nint add(int a, int b) {\n\n  if (a + b >= MOD) {\n\n    return a + b - MOD;\n\n  } else {\n\n    return a + b;\n  }\n}\n\nint mul(int a, int b) { return ((ll)a * b) % MOD; }\n\nint pw[N];\n\nint dp[N][N];\n\nvoid init() {\n\n  pw[0] = 1;\n\n  for (int i = 1; i < N; i++) {\n\n    pw[i] = mul(2, pw[i - 1]);\n  }\n}\n\nsigned main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int n, s;\n\n  cin >> n >> s;\n\n  vector<int> a(n);\n\n  for (auto &t : a) {\n\n    cin >> t;\n  }\n\n  int ans = 0;\n\n  dp[0][0] = 1;\n\n  for (int i = 0; i < n; i++) {\n\n    for (int j = 0; j <= s + 1; j++) {\n\n      int nw = min(s + 1, j + a[i]);\n\n      if (j == 0) {\n\n        dp[i + 1][nw] = i + 1;\n\n      } else {\n\n        dp[i + 1][nw] = add(dp[i + 1][nw], dp[i][j]);\n      }\n\n      dp[i + 1][j] = add(dp[i + 1][j], dp[i][j]);\n    }\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    for (int j = 0; j <= s + 1; j++) {\n\n      if (j + a[i] == s) {\n\n        if (j > 0)\n\n          ans = add(ans, mul(dp[i][j], n - i));\n\n        else\n\n          ans = add(ans, mul(i + 1, n - i));\n      }\n    }\n  }\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"10c235f21e0b0ee70cf9e1c084fcddb6c11c75b347941b1f3da02f717ec4aecb","fast_id":"11b38c558ff53899770615907a5d398c42eb43a060b1d07e0acf28bb0481c3c6","fast_time":0.0010277461,"language":"cpp","measured_fast_code_id":"11b38c558ff53899770615907a5d398c42eb43a060b1d07e0acf28bb0481c3c6","measured_slow_code_id":"a9be480e3f4997055502f196322b307934ff3d1adfe2619b8a5a8c6a5e2cd0d9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54285","problem_id":"p03779","slow_code_id":"992a8ffdb0e945c81fb44f5957bfa76e609c15c464ab4d254a3db6bcea19e07f","slow_id":"a9be480e3f4997055502f196322b307934ff3d1adfe2619b8a5a8c6a5e2cd0d9","slow_time":0.002508369,"speedup":2.44065046804848,"stratum":"2-4","sampling_key":"7b6a0801ee1f08b228ec4d0815140ee0921207a511d35d8cb8dfbb83132132e6","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define FOR(i, a, b) for (ll i = a; i < b; i++)\n\n#define is(a, b) a == b\n\n#define len(v) ll(v.size())\n\ntemplate <class T>\n\nvoid cout_vec(const vector<T> &vec1) {\n\n  rep(i, len(vec1)) { cout << vec1[i] << ' '; }\n\n  cout << '\\n';\n}\n\ntypedef pair<ll, ll> P;\n\nconst ll mod = 1e9 + 7;\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  ll x;\n\n  cin >> x;\n\n  vector<ll> sum;\n\n  sum.push_back(1);\n\n  ll cnt = 2;\n\n  while (sum.back() <= 1e9) {\n\n    sum.push_back(cnt + sum.back());\n\n    cnt++;\n  }\n\n  cout << lower_bound(begin(sum), end(sum), x) - begin(sum) + 1 << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<int, int> Pi;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\n#define FOR(i, a, b) for (ll i = a; i < b; i++)\n\n#define fi first\n\n#define se second\n\n#define endl \"\\n\"\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <typename T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {\n  return s << \"(\" << d.real() << \", \" << d.imag() << \")\";\n}\n\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &s, const pair<T1, T2> &d) {\n  return s << \"(\" << d.first << \", \" << d.second << \")\";\n}\n\ntemplate <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {\n  int len = d.size();\n  rep(i, len) {\n    s << d[i];\n    if (i < len - 1)\n      s << \" \";\n  }\n  return s;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &s, const vector<vector<T>> &d) {\n  int len = d.size();\n  rep(i, len) { s << d[i] << endl; }\n  return s;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &s, const set<T> &v) {\n  s << \"{ \";\n  for (auto itr = v.begin(); itr != v.end(); ++itr) {\n    if (itr != v.begin()) {\n      s << \", \";\n    }\n    s << (*itr);\n  }\n  s << \" }\";\n  return s;\n}\n\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &s, const map<T1, T2> &m) {\n  s << \"{\" << endl;\n  for (auto itr = m.begin(); itr != m.end(); ++itr) {\n    s << \" \" << (*itr).first << \" : \" << (*itr).second << endl;\n  }\n  s << \"}\" << endl;\n  return s;\n}\n\nconst ll mod = 1e9 + 7;\n\nconst ll inf = 1e17;\n\nconst int INF = 1e9;\n\nconst double PI = acos(-1);\n\nconst double EPS = 1e-10;\n\nint main() {\n\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  ll x;\n\n  cin >> x;\n\n  ll n;\n\n  rep(i, 1e9) {\n\n    if (i * (i + 1) >= 2 * x) {\n\n      n = i;\n\n      break;\n    }\n  }\n\n  ll y = n * (n + 1) / 2 - x;\n\n  if (y <= n) {\n\n    cout << n << endl;\n\n  } else {\n\n    cout << y << endl;\n  }\n}"}
{"fast_code_id":"e9ce073d55c065caba2660af1215dab067b91a3a2c00c2ed47d99a834a69fd55","fast_id":"c45650b6380b623ced3f8cb55361bd50716751983cbe78cfd0c5c60f203246f9","fast_time":0.0477029682,"language":"cpp","measured_fast_code_id":"c45650b6380b623ced3f8cb55361bd50716751983cbe78cfd0c5c60f203246f9","measured_slow_code_id":"cbc32c6a3b97e4f0025872333151b2df2b5b9d9ce5a3433e1943291ce919668b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54293","problem_id":"p02823","slow_code_id":"64d32069b2096a9f883dbd8d7ba576049e1cd39c4b254a66441784a2c892e048","slow_id":"cbc32c6a3b97e4f0025872333151b2df2b5b9d9ce5a3433e1943291ce919668b","slow_time":0.4522284996,"speedup":9.480091421229423,"stratum":"8+","sampling_key":"85d36e7ae85d03ce7fdc310f46454901393dbf9e761cd1ed2374a45cb39b35ef","slow_code":"#include <bits/stdc++.h>\n\n#define pi 3.1415926535897932384626\n\nusing namespace std;\n\nstruct vec\n\n{\n\n  long double x, y;\n\n  bool operator==(const vec &a) const { return x == a.x && y == a.y; }\n\n  bool operator<(const vec &a) const {\n\n    if (a.x != x)\n      return x < a.x;\n\n    return y < a.y;\n  }\n\n  vec operator+(const vec &a) const { return {x + a.x, y + a.y}; }\n\n  vec operator*(const long double &a) const { return {x * a, y * a}; }\n\n  vec operator-(const vec &a) const { return {x - a.x, y - a.y}; }\n\n  vec operator/(const long double &a) const { return {x / a, y / a}; }\n\n  long double len() const { return (x * x + y * y); }\n\n  long double dot(const vec &a) const { return x * a.x + y * a.y; }\n\n  long double crs(const vec &a) const { return x * a.y - y * a.x; }\n\n  vec proj(const vec &a) const { return (a / a.len()) * (*this).dot(a) / a.len(); }\n};\n\nstruct P\n\n{\n\n  int x, y;\n\n  bool operator<(const P &a) const { return x > a.x; }\n};\n\nlong long x, y, z, mod = 998244353;\n\nvector<P> v[300110];\n\nint i, n, m, k, a, d, b, c, h, dx[10] = {1, 0, -1, 0}, dy[10] = {0, 1, 0, -1};\n\nint e;\n\nint l[311111];\n\nint o[311111];\n\nint j[211111];\n\nstack<int> s;\n\nqueue<int> q, q1;\n\nP u[1], u1[3];\n\nstring r, r1;\n\nmap<int, int> p;\n\nbool as(P a, P b)\n\n{\n\n  return a.y < b.y;\n}\n\nint main()\n\n{\n\n  scanf(\"%lld %lld %lld\", &x, &y, &z);\n\n  if ((z - y) % 2 == 0)\n    printf(\"%lld\", (z - y) / 2);\n\n  else\n    printf(\"%lld\", min(y + (z - y) / 2, x - z + 1 + (z - y) / 2));\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define pi 3.1415926535897932384626\n\nusing namespace std;\n\nstruct P {\n\n  int x, y;\n\n  bool operator<(const P &a) const { return y > a.y; };\n};\n\nint a, b, c, d, i, k, n, m, e, dx[10] = {1, 0, -1, 0, 1, 1, -1, -1},\n                               dy[10] = {0, 1, 0, -1, 1, -1, 1, -1};\n\nint o[1];\n\nint l[5];\n\nint j[1];\n\nlong long x, y, z, mod = 1000000007;\n\nchar r[1];\n\nP u[1];\n\nqueue<int> q;\n\nset<int> s;\n\nmap<int, int> p;\n\nvector<P> v;\n\nbool as(P a, P b)\n\n{\n\n  if (a.x == b.x)\n\n    return a.y < b.y;\n\n  return a.x < b.x;\n}\n\nint main()\n\n{\n\n  scanf(\"%lld %lld %lld\", &z, &y, &x);\n\n  if (x > y)\n    swap(x, y);\n\n  if ((x - y) % 2 == 0)\n    printf(\"%lld\", (y - x) / 2);\n\n  else\n\n  {\n\n    printf(\"%lld\", min(x - 1, z - y) + (y - x + 1) / 2);\n  }\n}\n"}
{"fast_code_id":"f0c476516dd2bbf3ab6ba42fcd01a602af4b813fe6e9fa02d3f0f8f7a833da0a","fast_id":"2dad0e5ca58f6ae31fad4a90b6d2755dad1f5bd0092ef699aa4abfa76b408b32","fast_time":0.0184485779,"language":"cpp","measured_fast_code_id":"2dad0e5ca58f6ae31fad4a90b6d2755dad1f5bd0092ef699aa4abfa76b408b32","measured_slow_code_id":"93f6fdc46d9876f34b72c323559cb5248466e82cb0f130d7c4602cfef7fddceb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54294","problem_id":"p03413","slow_code_id":"f92eb2b4256f2c2e815f3459a8729cf00570d5025329ddd852a80a35473e1fbe","slow_id":"93f6fdc46d9876f34b72c323559cb5248466e82cb0f130d7c4602cfef7fddceb","slow_time":0.0957973562,"speedup":5.192668872325385,"stratum":"4-8","sampling_key":"2940008f7255a6a81cdbf94a8aa2ee60e51ad117a3fd0e2f595655c7bf25eb4b","slow_code":"#include <bits/stdc++.h>\n\n#define F(i, a, b) for (int i = (a); i <= (b); ++i)\n\n#define F2(i, a, b) for (int i = (a); i < (b); ++i)\n\n#define dF(i, a, b) for (int i = (a); i >= (b); --i)\n\n#define dF2(i, a, b) for (int i = (a); i > (b); --i)\n\n#define dF3(i, a, b) for (int i = (a)-1; i >= (b); --i)\n\nusing namespace std;\ntypedef long long ll;\ntypedef double ld;\nint INF = 0x3f3f3f3f;\nint INF2 = 0x7fffffff;\nll LNF = 0x3f3f3f3f3f3f3f3f;\nll LNF2 = 0x7fffffffffffffff;\n\nint n, q;\n\nint a[1001], A[1001];\n\nint b[1001], c[1001];\n\nint B[1001], C[1001];\n\nll sum1, sum2;\n\nint K[1001], cnt;\n\nint Ans[1001], tot;\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  F(i, 1, n) scanf(\"%d\", a + i), (i & 1 ? b : c)[(i + 1) / 2] = a[i];\n\n  F(i, 1, (n + 1) / 2)\n\n  if (b[i] > 0)\n    B[i] = 1, sum1 += b[i];\n\n  F(i, 1, n / 2)\n\n  if (c[i] > 0)\n    C[i] = 1, sum2 += c[i];\n\n  if (sum1 == 0 && sum2 == 0) {\n\n    int maxi = 1;\n\n    F(i, 2, n) if (a[maxi] < a[i]) maxi = i;\n\n    printf(\"%d\\n%d\\n\", a[maxi], n - 1);\n\n    F(i, 1, maxi - 1) puts(\"1\");\n\n    dF(i, n - maxi + 1, 2) printf(\"%d\\n\", i);\n\n    return 0;\n  }\n\n  if (sum1 > sum2) {\n\n    F(i, 1, n) if (i & 1) A[i] = B[(i + 1) / 2];\n\n  }\n\n  else {\n\n    F(i, 1, n) if (!(i & 1)) A[i] = C[i / 2];\n  }\n\n  printf(\"%lld\\n\", max(sum1, sum2));\n\n  int l = n + 1, r = 0;\n\n  F(i, 1, n) if (A[i]) l = min(l, i), r = max(r, i);\n\n  F(i, 1, l - 1) Ans[++tot] = 1;\n\n  dF(i, n - l + 1, r - l + 2) Ans[++tot] = i;\n\n  F(i, l, r) if (A[i])++ cnt;\n  else ++K[cnt];\n\n  F(i, 1, cnt - 1) {\n\n    F(j, 1, K[i] / 2) Ans[++tot] = 3;\n\n    Ans[++tot] = 2;\n  }\n\n  printf(\"%d\\n\", tot);\n\n  F(i, 1, tot) printf(\"%d\\n\", Ans[i]);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nint a[1005], n, ans[1005], cnt;\n\nlong long sum[2];\n\nint main() {\n\n  scanf(\"%d\", &n);\n  bool t = 0;\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%d\", a + i), a[i] > 0 ? (t = 1) : 0;\n\n  if (n == 2) {\n    printf(\"%d\\n1\\n%d\\n\", a[1] > a[2] ? a[1] : a[2], a[1] > a[2] ? 2 : 1);\n    return 0;\n  }\n\n  if (!t) {\n\n    int Max = 1;\n    for (int i = 2; i <= n; ++i)\n      if (a[i] > a[Max])\n        Max = i;\n\n    printf(\"%d\\n%d\\n\", a[Max], n - 1);\n\n    for (int i = n; i > Max; --i)\n      printf(\"%d\\n\", i);\n\n    for (int i = 1; i < Max; ++i)\n      puts(\"1\");\n\n    return 0;\n  }\n\n  for (int i = 1; i <= n; ++i)\n    if (a[i] > 0)\n      sum[i & 1] += a[i];\n\n  if (sum[1] > sum[0]) {\n\n    printf(\"%lld\\n\", sum[1]);\n\n    if ((n & 1) == 0)\n      ans[++cnt] = n--;\n\n    bool ok = 1;\n\n    for (int i = n; i >= 1; i -= 2)\n      if (a[i] < 0)\n\n        if (ok)\n          ans[++cnt] = i, ans[++cnt] = i - 1;\n\n        else\n          ans[++cnt] = i, i == 1 ? (ans[++cnt] = 1) : 0;\n\n      else if (ok)\n        ok = 0;\n\n      else\n        ans[++cnt] = i + 1;\n\n  }\n\n  else {\n\n    printf(\"%lld\\n\", sum[0]);\n\n    if (n & 1)\n      ans[++cnt] = n--;\n\n    bool ok = 1;\n\n    for (int i = n; i >= 1; i -= 2)\n      if (a[i] < 0)\n\n        if (ok)\n          ans[++cnt] = i, ans[++cnt] = i - 1;\n\n        else\n          ans[++cnt] = i;\n\n      else if (ok)\n        ok = 0;\n\n      else\n        ans[++cnt] = i + 1;\n\n    ans[++cnt] = 1;\n  }\n\n  printf(\"%d\\n\", cnt);\n\n  for (int i = 1; i <= cnt; ++i)\n    printf(\"%d\\n\", ans[i]);\n\n  return 0;\n}"}
{"fast_code_id":"8ae4caf1319f89f10eec8a3731ca0f57f7c87fd7562fad70d41020a12b722453","fast_id":"39953b2866fca9912da9cc70c26643734bdcec9b24c546981da130f84ee93aee","fast_time":0.1055480303,"language":"cpp","measured_fast_code_id":"39953b2866fca9912da9cc70c26643734bdcec9b24c546981da130f84ee93aee","measured_slow_code_id":"64cb1c1af86fefa68b759d894c4aeb606c7e5698dbf033630ce27ef819268d1d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54426","problem_id":"p03860","slow_code_id":"c367b319ea486a4378827ef20188203c07b549ee579499035eeb91a2c3a3970d","slow_id":"64cb1c1af86fefa68b759d894c4aeb606c7e5698dbf033630ce27ef819268d1d","slow_time":0.6884221979,"speedup":6.522359497787805,"stratum":"4-8","sampling_key":"ca58be5000cc9a4e7142ea7ee6b0ac5f115f0f28c5f66ec7e9a5381979e33555","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 200005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nint main()\n\n{\n\n  string a;\n\n  getline(cin, a);\n\n  int len = a.length();\n\n  cout << a[0];\n\n  for (int i = 1; i < len; i++)\n\n  {\n\n    if (a[i] >= 'A' && a[i] <= 'Z' && a[i - 1] == ' ')\n\n    {\n\n      cout << a[i];\n    }\n  }\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\nint main()\n\n{\n\n  string a, b, c;\n\n  cin >> a >> b >> c;\n\n  cout << a[0] << b[0] << c[0];\n}\n"}
{"fast_code_id":"5dcb88c7689690e9082c2fcf0293cc7ae9034985ebdcc5f95cfcf4711fb22f9b","fast_id":"c9063ecc1fac3744ae594cfed16f43ab5f564eed9d2b289998f348aeac7131c1","fast_time":0.0473684082,"language":"cpp","measured_fast_code_id":"c9063ecc1fac3744ae594cfed16f43ab5f564eed9d2b289998f348aeac7131c1","measured_slow_code_id":"2815c1f24b47f60194e9d83ffd8c02b5413ee93ce2a1bf770beadfe58081f180","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54430","problem_id":"p02845","slow_code_id":"518a0f62769fcd92e46bc5f5062d1632ace549ccfa29185cc87d1ac4b083e327","slow_id":"2815c1f24b47f60194e9d83ffd8c02b5413ee93ce2a1bf770beadfe58081f180","slow_time":0.1232613565,"speedup":2.60218489883728,"stratum":"2-4","sampling_key":"09345bcb3f35148eef89fc5103b7661b1e5751a2082bbdc7809b8f5e32d08bf4","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = (int)1e5 + 5;\n\nconst int M = (int)1e9 + 7;\n\nll powmod(ll a, ll b) {\n\n  if (b == 0)\n    return 1;\n\n  ll ans = powmod(a, b / 2);\n\n  ans = ans * ans % M;\n\n  if (b % 2)\n    ans = ans * a % M;\n\n  return ans;\n}\n\nll f[N], rf[N], n, a[N];\n\nll c(ll x, ll y) { return f[x] * rf[y] % M * rf[x - y] % M; }\n\nvoid build() {\n\n  f[0] = 1;\n\n  for (int i = 1; i < N; ++i)\n    f[i] = f[i - 1] * i % M;\n\n  rf[N - 1] = powmod(f[N - 1], M - 2);\n\n  for (int i = N - 2; i >= 0; --i)\n    rf[i] = rf[i + 1] * (i + 1) % M;\n}\n\nvoid init() {\n\n  cin >> n;\n\n  for (int i = 1; i <= n; ++i)\n    cin >> a[i];\n}\n\nvoid solve() {\n\n  int cc[3] = {0};\n\n  ll ans = 1;\n\n  for (int i = 1; i <= n; ++i) {\n\n    int ccc = 0, k = 0;\n\n    for (int j = 2; j >= 0; --j)\n      if (cc[j] == a[i]) {\n\n        ccc++;\n\n        k = j;\n      }\n\n    cc[k]++;\n\n    ans = ans * ccc % M;\n  }\n\n  cout << ans << '\\n';\n}\n\nint main() {\n\n  ios_base::sync_with_stdio(0), cin.tie(0);\n\n  build();\n\n  init();\n\n  solve();\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = (int)1e5 + 5;\n\nconst int M = (int)1e9 + 7;\n\nll n, a[N];\n\nvoid init() {\n\n  cin >> n;\n\n  for (int i = 1; i <= n; ++i)\n    cin >> a[i];\n}\n\nvoid solve() {\n\n  int cc[3] = {0};\n\n  ll ans = 1;\n\n  for (int i = 1; i <= n; ++i) {\n\n    int ccc = 0, k = 0;\n\n    for (int j = 2; j >= 0; --j)\n      if (cc[j] == a[i]) {\n\n        ccc++;\n\n        k = j;\n      }\n\n    cc[k]++;\n\n    ans = ans * ccc % M;\n  }\n\n  cout << ans << '\\n';\n}\n\nint main() {\n\n  ios_base::sync_with_stdio(0), cin.tie(0);\n\n  init();\n\n  solve();\n}\n"}
{"fast_code_id":"0223fc7e3135c9182b3ae53d987f21ec57ffd6fae8fe1dccbee7815e4a8ae3c2","fast_id":"fcfd95d8002d27b8003dfc57fbdd8704e752deb1685a08874ab56f278b8fc35d","fast_time":0.0010297175,"language":"cpp","measured_fast_code_id":"fcfd95d8002d27b8003dfc57fbdd8704e752deb1685a08874ab56f278b8fc35d","measured_slow_code_id":"bcb28016637fe0559973c028335fed117e119bb252b9f810a8ed13399bc98017","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_54479","problem_id":"p00481","slow_code_id":"d747513110ceaadeb2d9085c0dee9c6bb8a2a8089453a6b627a2a01efe6a6220","slow_id":"bcb28016637fe0559973c028335fed117e119bb252b9f810a8ed13399bc98017","slow_time":0.0131736233,"speedup":12.793434412836529,"stratum":"8+","sampling_key":"03cae637bdb1878e0ae314f683711492979b1b41f2c6854640491e08a1b5aead","slow_code":"\n\n#include <iostream>\n\n#include <cstring>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <string>\n\n#include <queue>\n\n#define CLR(ARR, NUM) memset(ARR, NUM, sizeof(ARR))\n\n#define GETNUM(NUM) scanf(\"%d\", &NUM)\n\n#define faster_io() ios_base::sync_with_stdio(false)\n\nusing namespace std;\n\nconst int MAXN = 1010;\n\nchar map[MAXN][MAXN];\n\nbool vis[10][MAXN][MAXN];\n\nstruct node {\n\n  int x;\n\n  int y;\n\n  int deep;\n\n  int n;\n};\n\nint dx[] = {0, 0, 1, -1};\n\nint dy[] = {1, -1, 0, 0};\n\nint main()\n\n{\n\n  CLR(vis, false);\n\n  CLR(map, 'X');\n\n  int h, w, n;\n\n  cin >> h >> w >> n;\n\n  getchar();\n\n  int sx, sy;\n\n  for (int i = 1; i <= h; i++) {\n\n    for (int j = 1; j <= w; j++) {\n\n      map[i][j] = getchar();\n\n      if (map[i][j] == 'S') {\n\n        sx = i;\n\n        sy = j;\n      }\n    }\n\n    getchar();\n  }\n\n  node t;\n\n  t.x = sx;\n\n  t.y = sy;\n\n  t.deep = 0;\n\n  t.n = 0;\n\n  queue<node> q;\n\n  vis[0][sx][sy] = true;\n\n  q.push(t);\n\n  int ans = -1;\n\n  while (!q.empty()) {\n\n    node cur = q.front();\n\n    if (cur.n == n) {\n\n      ans = cur.deep;\n\n      break;\n    }\n\n    q.pop();\n\n    for (int i = 0; i < 4; i++) {\n\n      int tx = cur.x + dx[i];\n\n      int ty = cur.y + dy[i];\n\n      if (map[tx][ty] != 'X' && !vis[cur.n][tx][ty]) {\n\n        node t = cur;\n\n        t.x = tx;\n\n        t.y = ty;\n\n        t.deep++;\n\n        if (map[tx][ty] == '1' + t.n) {\n\n          t.n++;\n        }\n\n        vis[t.n][tx][ty] = true;\n\n        q.push(t);\n      }\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <string>\n\n#include <stack>\n\n#include <stdlib.h>\n\n#include <cctype>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <cmath>\n\n#include <iomanip>\n\nusing namespace std;\n\nconst int INF = 1000000000;\n\nconst int max_n = 1005;\n\ntypedef pair<int, int> P;\n\nchar maze[max_n][max_n + 1];\n\nint n, m, sx, sy;\n\nint d[max_n][max_n];\n\nint dx[4] = {-1, 0, 0, 1};\n\nint dy[4] = {0, -1, 1, 0};\n\nint bfs(char e)\n\n{\n\n  queue<P> que;\n\n  for (int i = 0; i < n; i++)\n\n    for (int j = 0; j < m; j++)\n      d[i][j] = INF;\n\n  que.push(P(sx, sy));\n\n  d[sx][sy] = 0;\n\n  while (!que.empty())\n\n  {\n\n    P q = que.front();\n\n    que.pop();\n\n    if (maze[q.first][q.second] == e) {\n      sx = q.first;\n      sy = q.second;\n      break;\n    }\n\n    for (int i = 0; i < 4; i++)\n\n    {\n\n      int nx = q.first + dx[i], ny = q.second + dy[i];\n\n      if (0 <= nx && nx < n && ny >= 0 && ny < m && maze[nx][ny] != 'X' && d[nx][ny] == INF)\n\n      {\n\n        que.push(P(nx, ny));\n\n        d[nx][ny] = d[q.first][q.second] + 1;\n      }\n    }\n  }\n\n  return d[sx][sy];\n}\n\nint main()\n\n{\n\n  int t;\n\n  while (cin >> n >> m >> t)\n\n  {\n\n    for (int i = 0; i < n; i++)\n\n      for (int j = 0; j < m; j++)\n\n      {\n\n        cin >> maze[i][j];\n\n        if (maze[i][j] == 'S')\n          sx = i, sy = j;\n      }\n\n    int res = 0;\n\n    for (int i = 1; i <= t; i++) {\n\n      res += bfs(i + '0');\n    }\n\n    cout << res << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"794eed61c486288692637bb753ad64891e69eecb4f875e16e5582227cdeaf951","fast_id":"dbf733531eeccbcb95bd415abe7db4a8d1ae3b9e62fa1fa0bd28516ad56505b7","fast_time":0.048745109,"language":"cpp","measured_fast_code_id":"dbf733531eeccbcb95bd415abe7db4a8d1ae3b9e62fa1fa0bd28516ad56505b7","measured_slow_code_id":"3400bc83b531393d640532b6c2c30f19758031f59fbe4950fffaa846f0f0686a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55406","problem_id":"p03130","slow_code_id":"614c6987e16d0012e2f89afe8cdb8571c651a154e3d24d930f1fc797ff8aa53b","slow_id":"3400bc83b531393d640532b6c2c30f19758031f59fbe4950fffaa846f0f0686a","slow_time":0.4633311938,"speedup":9.505183254385583,"stratum":"8+","sampling_key":"24614840aff9bc40087c54ba1c20bb355093115ed7764f3b154c924250410c3d","slow_code":"#include <bits/stdc++.h>\n\n#define fi first\n\n#define se second\n\n#define ll long long\n\nusing namespace std;\n\nconst int N = 3e5 + 7;\n\nconst int mod = 1e9 + 7;\n\nint cnt;\n\nbool used[N];\n\nvector<int> v[N];\n\nvoid dfs(int x)\n\n{\n\n  if (used[x]) {\n\n    return;\n  }\n\n  used[x] = true;\n\n  cnt++;\n\n  if (cnt == 4) {\n\n    cout << \"YES\";\n\n    exit(0);\n  }\n\n  for (int y : v[x]) {\n\n    dfs(y);\n  }\n\n  cnt--;\n}\n\nvoid solve1()\n\n{\n\n  for (int i = 1; i < 4; i++) {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    v[x].push_back(y);\n\n    v[y].push_back(x);\n  }\n\n  for (int i = 1; i <= 4; i++) {\n\n    cnt = 0;\n\n    dfs(i);\n\n    for (int j = 1; j <= 4; j++) {\n\n      used[j] = false;\n    }\n  }\n\n  cout << \"NO\";\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n  cout.tie(0);\n  srand(time(0));\n\n  int cghf = 1;\n\n  while (cghf--) {\n\n    solve1();\n  }\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define speedup ios_base::sync_with_stdio(NULL)\n\n#define fin freopen(\"gymnastics.in\", \"r\", stdin)\n\n#define fout freopen(\"gymnastics.out\", \"w\", stdout)\n\n#define FILENAME\n\n#define PUBG push_back\n\n#define p_b pop_back\n\n#define mp make_pair\n\n#define fi first\n\n#define se second\n\n#define cls clear\n\n#define INF const int ci = 1e6 + 100\n\n#define K_INF 1e9 + 7\n\n#define time cerr << \"\\nTime elapsed: \" << 1.0 * clock() / CLOCKS_PER_SEC << \" s.\\n\"\n\n#define MIN_INT -999999999\n\n#define MOD 1000000007\n\n#define d109 1000000000\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef long L;\n\ntypedef unsigned long long ULL;\n\ntypedef unsigned long UL;\n\ntypedef string STR;\n\nint a1, b1, a2, b2, a3, b3, ch1, ch2, ch3, ch4, h1, h2;\n\nvector<int> vc;\n\nint main() {\n\n#ifdef FILENAMEs\n\n  fin;\n\n  fout;\n\n#endif\n\n  cin >> a1 >> b1 >> a2 >> b2 >> a3 >> b3;\n\n  if (a1 == 1)\n    ch1++;\n\n  if (a2 == 1)\n    ch1++;\n\n  if (a3 == 1)\n    ch1++;\n\n  if (b1 == 1)\n    ch1++;\n\n  if (b2 == 1)\n    ch1++;\n\n  if (b3 == 1)\n    ch1++;\n\n  if (a1 == 2)\n    ch2++;\n\n  if (a2 == 2)\n    ch2++;\n\n  if (a3 == 2)\n    ch2++;\n\n  if (b1 == 2)\n    ch2++;\n\n  if (b2 == 2)\n    ch2++;\n\n  if (b3 == 2)\n    ch2++;\n\n  if (a1 == 3)\n    ch3++;\n\n  if (a2 == 3)\n    ch3++;\n\n  if (a3 == 3)\n    ch3++;\n\n  if (b1 == 3)\n    ch3++;\n\n  if (b2 == 3)\n    ch3++;\n\n  if (b3 == 3)\n    ch3++;\n\n  if (a1 == 4)\n    ch4++;\n\n  if (a2 == 4)\n    ch4++;\n\n  if (a3 == 4)\n    ch4++;\n\n  if (b1 == 4)\n    ch4++;\n\n  if (b2 == 4)\n    ch4++;\n\n  if (b3 == 4)\n    ch4++;\n\n  vc.PUBG(ch1);\n\n  vc.PUBG(ch2);\n\n  vc.PUBG(ch3);\n\n  vc.PUBG(ch4);\n\n  for (int i = 0; i < 4; ++i) {\n\n    if (vc[i] == 1) {\n\n      h1++;\n\n    }\n\n    else if (vc[i] == 2) {\n\n      h2++;\n    }\n  }\n\n  if (h1 == 2 && h2 == 2)\n    cout << \"YES\";\n\n  else\n    cout << \"NO\";\n\n  return 0;\n}\n"}
{"fast_code_id":"d8a693db6f94ec11b01b93af5f4e51eede0ec1f5f6d2b64dce5c60eb6ca95057","fast_id":"429a4c46baa7d2b3037a9e9182b329ebe8dd47f0899b68013e383d364f39080e","fast_time":0.0558249735,"language":"cpp","measured_fast_code_id":"429a4c46baa7d2b3037a9e9182b329ebe8dd47f0899b68013e383d364f39080e","measured_slow_code_id":"d6a9f34ae299880981425e1c0308be2165edc2d18aaf14d2c7667e7e0e532b26","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55484","problem_id":"p00645","slow_code_id":"af2b19dc716ce3dc710ed2c0efb053b899a3d17d0d44d366ccc9d93256f5db0f","slow_id":"d6a9f34ae299880981425e1c0308be2165edc2d18aaf14d2c7667e7e0e532b26","slow_time":0.474629751,"speedup":8.50210436732227,"stratum":"8+","sampling_key":"9ab022baecf5fa185d1332fc588f6cf0594816cb3775e430c6b49b4298561775","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <map>\n\n#include <queue>\n\nusing namespace std;\n\ninline int upb(int n)\n\n{\n\n  return 32 - __builtin_clz(n);\n}\n\nint main()\n\n{\n\n  vector<bool> close(1 << (5 * 5), false);\n\n  vector<int> cls(1000000);\n\n  int cls_cnt = 0;\n\n  for (int n; cin >> n, !(n == 0);) {\n\n    vector<vector<int> > pats(n * n + 1);\n\n    vector<vector<int> > tmp(n, vector<int>(n, 0));\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = 0; j < n; j++) {\n\n        for (int k = i; k < n; k++) {\n\n          for (int l = j; l < n; l++) {\n\n            for (int a = i; a <= k; a++)\n\n              for (int b = j; b <= l; b++)\n\n                tmp[a][b] = 1;\n\n            int bd = 0;\n\n            for (int a = 0; a < n; a++) {\n\n              for (int b = 0; b < n; b++) {\n\n                bd = (bd << 1) | tmp[a][b];\n              }\n            }\n\n            pats[upb(bd)].push_back(bd);\n\n            for (int a = i; a <= k; a++)\n\n              for (int b = j; b <= l; b++)\n\n                tmp[a][b] = 0;\n          }\n        }\n      }\n    }\n\n    int bd = 0;\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = 0; j < n; j++) {\n\n        int t;\n        cin >> t;\n\n        bd = (bd << 1) | t;\n      }\n    }\n\n    queue<int> mm;\n\n    mm.push(bd);\n\n    close[bd] = true;\n\n    cls[cls_cnt++] = bd;\n\n    while (!mm.empty()) {\n\n      int dep = mm.front() >> 25;\n\n      int cbd = mm.front() & 0x1ffffff;\n\n      mm.pop();\n\n      int ub = 32 - __builtin_clz(cbd);\n\n      const vector<int> &ps = pats[ub];\n\n      int sz = ps.size();\n\n      for (int i = 0; i < sz; i++) {\n\n        int nbd = cbd ^ ps[i];\n\n        if (nbd == 0) {\n\n          for (int i = 0; i <= dep; i++)\n\n            cout << \"myon\";\n\n          cout << endl;\n\n          goto _exit;\n        }\n\n        if (close[nbd])\n          continue;\n\n        close[nbd] = true;\n\n        cls[cls_cnt++] = nbd;\n\n        mm.push(((dep + 1) << 25) | nbd);\n      }\n    }\n\n  _exit:;\n\n    for (int i = 0; i < cls_cnt; i++)\n\n      close[cls[i]] = false;\n\n    cls_cnt = 0;\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  static int close[(1 << (5 * 5)) / 32];\n\n  static int cls[1000000];\n\n  for (int n; scanf(\"%d\", &n), !(n == 0);) {\n\n    vector<vector<int> > pats(33);\n\n    static int tmp[5][5];\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = 0; j < n; j++) {\n\n        for (int k = i; k < n; k++) {\n\n          for (int l = j; l < n; l++) {\n\n            for (int a = i; a <= k; a++)\n\n              for (int b = j; b <= l; b++)\n\n                tmp[a][b] = 1;\n\n            int bd = 0;\n\n            for (int a = 0; a < n; a++) {\n\n              for (int b = 0; b < n; b++) {\n\n                bd = (bd << 1) | tmp[a][b];\n              }\n            }\n\n            pats[__builtin_clz(bd)].push_back(bd);\n\n            for (int a = i; a <= k; a++)\n\n              for (int b = j; b <= l; b++)\n\n                tmp[a][b] = 0;\n          }\n        }\n      }\n    }\n\n    int bd = 0;\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = 0; j < n; j++) {\n\n        int t;\n        scanf(\"%d\", &t);\n\n        bd = (bd << 1) | t;\n      }\n    }\n\n    int cls_cnt = 0, cls_cur = 0;\n\n    close[bd >> 5] |= (1 << (bd & 31));\n\n    cls[cls_cnt++] = bd;\n\n    for (;;) {\n\n      int dep = cls[cls_cur] >> 25;\n\n      int cbd = cls[cls_cur] & 0x1ffffff;\n\n      cls_cur++;\n\n      const vector<int> &ps = pats[__builtin_clz(cbd)];\n\n      int sz = ps.size();\n\n      for (int i = 0; i < sz; i++) {\n\n        int nbd = cbd ^ ps[i];\n\n        if (close[nbd >> 5] & (1 << (nbd & 31)))\n\n          continue;\n\n        close[nbd >> 5] |= (1 << (nbd & 31));\n\n        cls[cls_cnt++] = ((dep + 1) << 25) | nbd;\n\n        if (nbd == 0) {\n\n          for (int i = 0; i <= dep; i++)\n\n            printf(\"myon\");\n\n          puts(\"\");\n\n          goto _exit;\n        }\n      }\n    }\n\n  _exit:;\n\n    {\n\n      int i = 0;\n\n      for (; i + 3 < cls_cnt; i += 4) {\n\n        close[(cls[i + 0] & 0x1ffffff) >> 5] = 0;\n\n        close[(cls[i + 1] & 0x1ffffff) >> 5] = 0;\n\n        close[(cls[i + 2] & 0x1ffffff) >> 5] = 0;\n\n        close[(cls[i + 3] & 0x1ffffff) >> 5] = 0;\n      }\n\n      for (; i < cls_cnt; i++)\n\n        close[(cls[i] & 0x1ffffff) >> 5] = 0;\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"15d7abfd417442edd43a753e1b208ee1667bb59c304deb86678ab1a9e0b05046","fast_id":"9a9f0e258c9a0b0527af1ef573e3e6fb8a2f520dc4f3473190c1c89db207e40a","fast_time":0.0439857358,"language":"cpp","measured_fast_code_id":"9a9f0e258c9a0b0527af1ef573e3e6fb8a2f520dc4f3473190c1c89db207e40a","measured_slow_code_id":"ba36e9b449d36636475ffb755ddd5f3842e40255189e3cdb9ddd7d253f41492f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55491","problem_id":"p03462","slow_code_id":"01af1532fa5edb7ba1a22d33082f79c06ba107f6bc641bcf5c83acd02792e967","slow_id":"ba36e9b449d36636475ffb755ddd5f3842e40255189e3cdb9ddd7d253f41492f","slow_time":0.34711048,"speedup":7.891432840370945,"stratum":"4-8","sampling_key":"865d76b3054851e2f0cb65e77869ec23a512eddff31122fa3d5f81d2e2f165f3","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MOD = 1e9 + 7;\n\ninline int add(int a, int b) { return a += b, a >= MOD ? a - MOD : a; }\n\ninline int del(int a, int b) { return a -= b, a < 0 ? a + MOD : a; }\n\ninline int mul(int a, int b) { return 1LL * a * b % MOD; }\n\nconst int MAXN = 110;\n\nint C[MAXN][MAXN];\n\ninline void initC(int N)\n\n{\n\n  for (int i = 0; i <= N; i++)\n    C[i][0] = 1;\n\n  for (int i = 1; i <= N; i++)\n\n    for (int j = 1; j <= i; j++)\n      C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]);\n\n  return;\n}\n\nint dp[MAXN][MAXN][MAXN], up[MAXN], sum[MAXN];\n\ninline void solve(int n, int m, int c)\n\n{\n\n  int r = m + (c << 1) - 1;\n\n  memset(dp, 0, sizeof(dp)), dp[0][0][0] = 1;\n\n  for (int i = 0; i < m; i++)\n\n    for (int j = 0; j <= up[i] && (j << 1) + r <= n + m; j++)\n\n    {\n\n      int tmp = dp[i][j][0];\n\n      for (int k = 1; k <= up[m] && j + (m - i) * k <= up[m]; k++)\n\n      {\n\n        for (int l = 1; i + l <= m && j + k * l <= up[i + l]; l++)\n          dp[i + l][j + k * l][k] =\n              add(dp[i + l][j + k * l][k], mul(tmp, C[i + l][l]));\n\n        tmp = add(tmp, dp[i][j][k]);\n      }\n    }\n\n  for (int i = 0; i <= up[m] && (i << 1) + r <= n + m; i++)\n\n  {\n\n    int tmp = 0, tmp_ = (i << 1) + r - m;\n\n    for (int j = 0; j <= i; j++)\n      tmp = add(tmp, dp[m][i][j]);\n\n    if (!tmp)\n      continue;\n\n    for (int j = 0; j <= ((m + 1) << 1) && tmp_ + j <= n; j++)\n      sum[tmp_ + j] =\n          add(sum[tmp_ + j], mul(tmp, mul(C[m + c][c], C[(m + 1) << 1][j])));\n  }\n\n  return;\n}\n\nchar ch[MAXN];\n\nint q[MAXN], pos[MAXN], vis[MAXN];\n\nint n, k, ans;\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n  cin >> n >> k >> (ch + 1);\n\n  initC(100);\n\n  for (int i = 0; (i << 1) <= k; i++)\n\n  {\n\n    memset(vis, 0, sizeof(vis));\n\n    int cnt = 0, L = 1, R = 0, s = 0, r = 1;\n\n    for (int j = 1; j <= k && cnt < i; j++)\n\n      if (ch[j] == 'r')\n        q[++R] = j;\n\n      else if (L <= R)\n        vis[q[L++]] = vis[j] = 1, pos[++cnt] = j;\n\n    if (cnt < i)\n      continue;\n\n    for (int j = 1; j <= k; j++)\n\n      if (!vis[j] && ch[j] == 'r')\n        s++;\n\n    pos[i + 1] = k + 1, up[i + 1] = 0;\n\n    for (int j = 0; j <= s; j++)\n\n    {\n\n      if (j)\n\n      {\n\n        while (vis[r] || ch[r] != 'r')\n          r++;\n\n        vis[r] = 1;\n      }\n\n      for (int t = i; t > 0; t--)\n\n      {\n\n        up[t] = up[t + 1];\n\n        for (int t_ = pos[t + 1] - 1; t_ > pos[t]; t_--)\n\n          if (!vis[t_])\n            up[t]++;\n\n        up[t]++;\n      }\n\n      reverse(up + 1, up + i + 1), solve(n, i, j);\n    }\n  }\n\n  for (int i = 1; i <= n; i++)\n    ans = add(ans, mul(sum[i], C[n - 1][i - 1]));\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define N 255\n\n#define ll long long\n\n#define mod 1000000007\n\nint n, k, ans, g, Ga, Gb;\n\nint c[N][N], S[N];\n\nchar s[N];\n\nvoid Calc()\n\n{\n\n  int ga = g, gb = g, tot = 0;\n\n  for (int i = 1; i <= k; i++)\n\n    if (s[i] == 'r' && ga)\n\n      ga--;\n\n    else\n\n        if (s[i] == 'b' && gb > ga && S[gb] > 1)\n\n      tot += S[gb] - 2, gb--;\n\n    else\n\n        if (tot)\n\n      tot--;\n\n  for (; S[gb] == 1;)\n    gb--;\n\n  if (ga || gb || tot)\n\n    return;\n\n  tot = 1;\n\n  for (int i = 1, j = 0; i <= g; i = j + 1)\n\n  {\n\n    for (; j < g && S[j + 1] == S[i];)\n      j++;\n\n    tot = (ll)tot * c[j][j - i + 1] % mod;\n  }\n\n  ga = Ga - 1;\n\n  gb = Gb + Ga;\n\n  ans = ((ll)tot * c[n - ga + gb][gb] + ans) % mod;\n}\n\nvoid Find(int m, int w, int len)\n\n{\n\n  Calc();\n\n  ++g;\n\n  int la = Ga, lb = Gb;\n\n  for (int i = len; m + (i == 1 ? 2 : i * 2 - 2) <= n + 1 && w + i <= k; i++)\n\n  {\n\n    Ga = la + (i == 1 ? 2 : i * 2 - 2), Gb = lb + (i > 1) * 2, S[g] = i;\n\n    Find(m + (i == 1 ? 2 : i * 2 - 2), w + i, i);\n  }\n\n  --g;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\\n%s\", &n, &k, s + 1);\n\n  for (int i = 0; i <= 250; i++)\n\n  {\n\n    c[i][0] = 1;\n\n    for (int j = 1; j <= i; j++)\n\n      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;\n  }\n\n  Find(0, 0, 1);\n\n  printf(\"%d\\n\", ans);\n}\n"}
{"fast_code_id":"98e015f1ba9d4fd3263a1a86257bdef439cbbd9255b3bad57d809a3ca25fe32d","fast_id":"137efa876e7bf112266df336f45e3568fabd014fd9517d694bf9a17bd796da6e","fast_time":0.1054289296,"language":"cpp","measured_fast_code_id":"137efa876e7bf112266df336f45e3568fabd014fd9517d694bf9a17bd796da6e","measured_slow_code_id":"b491d395d76b07d7b9d835ae47161a771ac53cc02e9b8feb5d2d9d4191560e23","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55510","problem_id":"p03561","slow_code_id":"b7a255243cf5c13023148a21ebf0e3e45a57b5d75239df5ec3355bc2ddaa9c11","slow_id":"b491d395d76b07d7b9d835ae47161a771ac53cc02e9b8feb5d2d9d4191560e23","slow_time":0.2307848955,"speedup":2.1890091872847774,"stratum":"2-4","sampling_key":"d1dd8fa04e953ad794cd44a83b38b1a9175e2a13ea5a7523996d978c216d5f00","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long int N, K, A[364364], B, L;\n\nint main() {\n\n  scanf(\"%lld%lld\", &K, &N);\n\n  if (K == 1) {\n\n    for (int i = 0; i < (N + 1) / 2; ++i)\n      cout << \"1 \";\n\n    return 0;\n  }\n\n  if (K & 1) {\n\n    fill(A, A + 364364, K / 2 + 1);\n\n    B = N / 2;\n\n    L = N;\n\n    for (int i = 0; i < B; ++i) {\n\n      if (--A[L - 1]) {\n\n        for (; L < N; ++L) {\n\n          A[L] = K;\n        }\n\n      } else {\n\n        --L;\n      }\n    }\n\n    for (int i = 0; i < N; ++i) {\n\n      if (A[i] == 0)\n        return 0 & puts(\"\");\n\n      cout << A[i] << \" \";\n    }\n\n  } else {\n\n    cout << (K >> 1) << \" \";\n\n    for (int i = 0; ++i < N;)\n      cout << K << \" \";\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long int K, N, A[303030], L, R;\n\nint main() {\n\n  scanf(\"%lld%lld\", &K, &N);\n\n  if (K ^ 1) {\n\n    if (K & 1) {\n\n      fill(A, A + N, (K + 1) / 2);\n\n      L = N;\n\n      for (R = N / 2 + 1; --R;)\n        if (--A[--L])\n          for (; L < N; A[++L] = K)\n            ;\n\n      for (int i = 0; i < N; cout << A[i++] << \" \")\n        if (!A[i])\n          return 0 & puts(\"\");\n\n    } else {\n\n      cout << K / 2 << \" \";\n\n      for (; --N; cout << K << \" \")\n        ;\n    }\n\n  } else\n    for (N = (N + 3) / 2; --N; cout << \"1 \")\n      ;\n\n  return 0;\n}\n"}
{"fast_code_id":"90193c124dd2d76ce2058934e752ebad2e738a8afaaf6264de777d2022fa292b","fast_id":"6ed15dc9b1260981dd8a4cdc355386c2a9b101a8174defc2ae6ab4912c3ee703","fast_time":0.1065673469,"language":"cpp","measured_fast_code_id":"6ed15dc9b1260981dd8a4cdc355386c2a9b101a8174defc2ae6ab4912c3ee703","measured_slow_code_id":"c35ce2704b6407c5c9bb4e18a582e3111cf858e1a1e655bf4bc6b8936c581d28","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55517","problem_id":"p01368","slow_code_id":"3e250e0a492ca06f8316246216b8d8b4b3344be63d70fc46925e2959cc61ccef","slow_id":"c35ce2704b6407c5c9bb4e18a582e3111cf858e1a1e655bf4bc6b8936c581d28","slow_time":1.6906894799,"speedup":15.864986124563078,"stratum":"8+","sampling_key":"cd45ceaebe40bf86b78782f26c0ac3a007a6c2c1361bc231429755e4888e8c12","slow_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int maxn = 1010;\n\nconst int inf = 0x3f3f3f3f;\n\nint dis[maxn][maxn];\n\nint n, m, L;\n\nstruct node\n\n{\n\n  int s, t;\n\n  node(int _s, int _t) : s(_s), t(_t) {}\n\n  node(){};\n\n  bool operator<(const node &o) const\n\n  {\n\n    return t < o.t;\n  }\n\n} q[maxn];\n\nint nn;\n\nbool e[maxn][maxn];\n\nvoid build()\n\n{\n\n  memset(e, 0, sizeof(e));\n\n  nn = L;\n\n  for (int i = 1; i <= nn; i++)\n\n    for (int j = i + 1; j <= nn; j++)\n\n    {\n\n      int d1 = q[j].t - q[i].t;\n\n      int d2 = dis[q[j].s][q[i].s];\n\n      if (d2 <= d1)\n\n      {\n\n        e[i][j] = 1;\n      }\n    }\n\n  for (int k = 1; k <= nn; k++)\n\n    for (int i = 1; i < k; i++)\n\n      for (int j = k + 1; j <= nn; j++)\n\n        e[i][j] = (e[i][j] | (e[i][k] & e[k][j]));\n\n  return;\n}\n\nint vis[maxn];\n\nint cx[maxn];\n\nint cy[maxn];\n\nint find(int u)\n\n{\n\n  for (int v = u; v <= nn; v++)\n\n  {\n\n    if (e[u][v] && !vis[v])\n\n    {\n\n      vis[v] = 1;\n\n      if (cy[v] == -1 || find(cy[v]))\n\n      {\n\n        cx[u] = v;\n\n        cy[v] = u;\n\n        return true;\n      }\n    }\n  }\n\n  return false;\n}\n\nint solve()\n\n{\n\n  memset(vis, 0, sizeof(vis));\n\n  memset(cx, -1, sizeof(cx));\n\n  memset(cy, -1, sizeof(cy));\n\n  int res = 0;\n\n  for (int i = 1; i <= nn; i++)\n\n  {\n\n    if (cx[i] == -1)\n\n    {\n\n      memset(vis, 0, sizeof(vis));\n\n      if (find(i))\n\n        res++;\n    }\n  }\n\n  return res;\n}\n\nint main()\n\n{\n\n  while (scanf(\"%d%d%d\", &n, &m, &L) == 3)\n\n  {\n\n    if (n == 0 && m == 0 && L == 0)\n\n      break;\n\n    memset(dis, inf, sizeof(dis));\n\n    for (int i = 1; i <= m; i++)\n\n    {\n\n      int u, v, d;\n\n      scanf(\"%d%d%d\", &u, &v, &d);\n\n      u++;\n\n      v++;\n\n      if (d < dis[u][v])\n\n      {\n\n        dis[u][v] = d;\n\n        dis[v][u] = d;\n      }\n    }\n\n    for (int k = 1; k <= n; k++)\n\n      for (int i = 1; i <= n; i++)\n\n        for (int j = 1; j <= n; j++)\n\n          dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);\n\n    for (int i = 1; i <= n; i++)\n\n      dis[i][i] = 0;\n\n    for (int i = 1; i <= L; i++)\n\n    {\n\n      int s, t;\n\n      scanf(\"%d%d\", &s, &t);\n\n      s++;\n\n      q[i] = node(s, t);\n    }\n\n    sort(q + 1, q + 1 + L);\n\n    build();\n\n    int res = solve();\n\n    int ans = L - res;\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstring>\n\nusing namespace std;\n\nconst int N = 1010;\n\nconst int oo = 1000000000;\n\nstruct edge\n\n{\n\n  int v, next;\n\n} e[N * N];\n\nint head[N], cnt;\n\nvoid addedge(int u, int v)\n\n{\n\n  e[cnt].v = v;\n\n  e[cnt].next = head[u];\n\n  head[u] = cnt++;\n}\n\nint pre[N], visit[N];\n\nint f[N / 10][N / 10];\n\nint find(int u)\n\n{\n\n  for (int i = head[u]; i != -1; i = e[i].next)\n\n    if (!visit[e[i].v]) {\n\n      visit[e[i].v] = 1;\n\n      int tmp = pre[e[i].v];\n\n      pre[e[i].v] = u;\n\n      if (tmp == -1 || find(tmp))\n        return 1;\n\n      pre[e[i].v] = tmp;\n    }\n\n  return 0;\n}\n\nstruct point\n\n{\n\n  int x, t;\n\n  void read() { scanf(\"%d%d\", &x, &t); }\n\n  friend bool operator<(const point &p, const point &q) { return p.t < q.t; }\n\n} a[N];\n\nint main()\n\n{\n\n  int n, m, r;\n\n  int x, y, z;\n\n  while (scanf(\"%d%d%d\", &n, &m, &r)) {\n\n    if (!n && !m && !r)\n      break;\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = 0; j < n; j++)\n\n        f[i][j] = oo;\n\n      f[i][i] = 0;\n    }\n\n    cnt = 0;\n\n    memset(head, -1, sizeof(head));\n\n    while (m--) {\n\n      scanf(\"%d%d%d\", &x, &y, &z);\n\n      f[x][y] = f[y][x] = min(z, f[x][y]);\n    }\n\n    for (int k = 0; k < n; k++)\n\n      for (int i = 0; i < n; i++)\n\n        for (int j = 0; j < n; j++)\n\n          f[i][j] = min(f[i][j], f[i][k] + f[k][j]);\n\n    for (int i = 0; i < r; i++)\n\n      a[i].read();\n\n    sort(a, a + r);\n\n    memset(pre, -1, sizeof(pre));\n\n    int ans = r;\n\n    for (int i = 0; i < r; i++)\n\n      for (int j = i + 1; j < r; j++)\n\n        if (f[a[i].x][a[j].x] + a[i].t <= a[j].t)\n\n          addedge(i, j);\n\n    for (int i = 0; i < r; i++) {\n\n      memset(visit, 0, sizeof(visit));\n\n      ans -= find(i);\n    }\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"584109def6667e52885f085ee9547159e18c98b4f2ebecc8edb457530f5ced5e","fast_id":"96a9581f2edf9e6b3cfac235fc5293b5b07617642cca418570e1d2e5970ab28f","fast_time":0.0256804694,"language":"cpp","measured_fast_code_id":"96a9581f2edf9e6b3cfac235fc5293b5b07617642cca418570e1d2e5970ab28f","measured_slow_code_id":"c94c7c09b00412dc668fff928250b47d749f87bef3007d3099693e5445b1181b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55531","problem_id":"p03186","slow_code_id":"b241a76c071d330d1ee51377f90ae22fdda061312a37419310603e58f34e7907","slow_id":"c94c7c09b00412dc668fff928250b47d749f87bef3007d3099693e5445b1181b","slow_time":0.0907960654,"speedup":3.5356077019370993,"stratum":"2-4","sampling_key":"51168c8d09d28233b92cc07cb73db7e7e7f1c59645e6ed6f370548b559464c8a","slow_code":"\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\n#pragma comment(linker, \"/stack:200000000\")\n\n#pragma GCC optimize(\"Ofast\")\n\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n\n#define iter set<int>::iterator\n\n#define f first\n\n#define s second\n\n#define pb push_back\n\n#define pf push_front\n\n#define mp make_pair\n\n#define cont continue\n\n#define ll long long\n\n#define Speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n\n#define sz size()\n\n#define all(x) x.begin(), x.end()\n\n#define cont continue\n\n#define r0 return 0\n\n#define endl '\\n'\n\nconst int MAXN = 1e5 + 7;\n\nconst int MOD = 1e9 + 7;\n\nconst int INF = 1e9 + 7;\n\nconst ll MINF = 1e18 + 7;\n\nconst int EPS = 1e-6;\n\nconst int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};\n\nconst int dy[] = {1, -1, 0, 0, -1, 1, -1, 1};\n\nconst double pi = acos(-1.0);\n\ntypedef long double ld;\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<char, char> pcc;\n\nvector<int> g[MAXN], v;\n\nbool used[MAXN];\n\nll n, m, k, cnt, sum, ans, mx, mn = INF;\n\nbool y;\n\nvoid freopen() {\n\n  freopen(\"A.in\", \"r\", stdin);\n\n  freopen(\"A.out\", \"w\", stdout);\n}\n\nll a, b, c;\n\nvoid solve() {\n\n  cin >> a >> b >> c;\n\n  mn = min(b, c);\n\n  cnt += mn * 2;\n\n  b -= mn;\n\n  c -= mn;\n\n  mn = min(a, c);\n\n  cnt += mn;\n\n  a -= mn;\n\n  c -= mn;\n\n  cnt += b;\n\n  if (c > 0) {\n\n    cnt++;\n  }\n\n  cout << cnt;\n}\n\nint main() {\n\n  Speed;\n\n  ll T = 1;\n\n  while (T--) {\n\n    solve();\n  }\n\n  r0;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  int a, b, c;\n\n  int ans = 0;\n\n  cin >> a >> b >> c;\n\n  if (c <= a) {\n\n    ans += c;\n\n    ans += b;\n\n  }\n\n  else {\n\n    ans = a;\n\n    c -= a;\n\n    if (c <= b) {\n\n      ans += c + b;\n\n    }\n\n    else {\n\n      ans += (b * 2);\n\n      c -= b;\n\n      if (c > 0)\n\n        ans++;\n    }\n  }\n\n  cout << ans;\n\n  return 0;\n}"}
{"fast_code_id":"b68b2b7c0d662e2181e6762e921734f7cc8a47c009f73a6876c50e29bd82ad87","fast_id":"5bb969c8d3eb928fa7f1ac213563955948a196c217c05f21915167d663fa1f05","fast_time":0.0072122608,"language":"cpp","measured_fast_code_id":"5bb969c8d3eb928fa7f1ac213563955948a196c217c05f21915167d663fa1f05","measured_slow_code_id":"70ff77c8bbd804eef3591ff03aaadb1c16e5ae28f9df7a452ba0994b91c1cdff","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55534","problem_id":"p03491","slow_code_id":"25397d466456fbc00b60944f9bb7aad9f8401ee2d2328f014c511f435ac1e778","slow_id":"70ff77c8bbd804eef3591ff03aaadb1c16e5ae28f9df7a452ba0994b91c1cdff","slow_time":0.288058443,"speedup":39.94010352481985,"stratum":"8+","sampling_key":"0cb00e79fc92b5322c27326116606d8115fe50d6b42e970da81bb45e6616a605","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  ll N, L;\n\n  cin >> N >> L;\n\n  set<string> ST[100001];\n\n  ll G = 0;\n\n  rep(i, N) {\n\n    string S;\n\n    cin >> S;\n\n    int M = S.size();\n\n    ST[M].insert(S);\n  }\n\n  for (int i = 100000; i > 0; i--) {\n\n    if (ST[i].size() & 1) {\n\n      ll K = L - i + 1;\n\n      ll GK = 1;\n\n      while (K % 2 == 0) {\n\n        GK <<= 1;\n\n        K /= 2;\n      }\n\n      G ^= GK;\n    }\n\n    for (string S : ST[i]) {\n\n      S.pop_back();\n\n      ST[i - 1].insert(S);\n    }\n\n    ST[i].clear();\n  }\n\n  if (G)\n    co(\"Alice\");\n\n  else\n    co(\"Bob\");\n\n  Would you please return 0;\n}\n","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint T[100001][2];\n\nchar D[100001];\n\nint main() {\n\n  int N;\n\n  ll L;\n\n  scanf(\"%d\", &N);\n\n  scanf(\"%lld\", &L);\n\n  getchar_unlocked();\n\n  int k = 0;\n\n  rep(i, N) {\n\n    int mae = 0;\n\n    ll d = L;\n\n    char c;\n\n    while ((c = getchar_unlocked()) >= '0') {\n\n      int C = c - '0';\n\n      if (!T[mae][C]) {\n\n        T[mae][C] = ++k;\n\n        D[k] = __builtin_ctzll(d);\n      }\n\n      mae = T[mae][C];\n\n      d--;\n    }\n  }\n\n  ll kotae = 0;\n\n  rep1(i, k) { kotae ^= 1ll << D[i]; }\n\n  if (kotae)\n    printf(\"Alice\\n\");\n\n  else\n    printf(\"Bob\\n\");\n\n  Would you please return 0;\n}"}
{"fast_code_id":"46a8b0f76afb2eecb8566f48ec6237a2e3594def6ad718fdcd9a16f0e9ed8912","fast_id":"b835505309b6506dcb66583ddb0cdd8746ce93dd9ed29c347575ec54fba2f82d","fast_time":0.0181489465,"language":"cpp","measured_fast_code_id":"b835505309b6506dcb66583ddb0cdd8746ce93dd9ed29c347575ec54fba2f82d","measured_slow_code_id":"d5e1d0019d1ae4bb3efdb289155e3156acbfe018b80f0b54fef1a9975adf17ce","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55536","problem_id":"p00959","slow_code_id":"18fd6fa099500bbe48846c4ee84adb2a2fdb687f6e9db35dd4711983e068ebac","slow_id":"d5e1d0019d1ae4bb3efdb289155e3156acbfe018b80f0b54fef1a9975adf17ce","slow_time":0.0885754553,"speedup":4.880473657245064,"stratum":"4-8","sampling_key":"0a9684724a0656a2c2d13f52f81694190a409f695d060180d9c59a9f69fcc79b","slow_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <iostream>\n\n#include <sstream>\n\n#include <string>\n\n#include <cstring>\n\n#include <map>\n\n#include <set>\n\n#include <vector>\n\n#include <stack>\n\n#include <queue>\n\n#include <deque>\n\n#include <utility>\n\n#include <algorithm>\n\n#include <cassert>\n\nusing namespace std;\n\ntypedef long long int LLI;\n\ntypedef pair<int, int> PII;\n\n#define _ ios_base::sync_with_stdio(0);\n\n#define debug\n\n#define x first\n\n#define y second\n\n#define MXN 100005\n\nconst int inf = 0x3f3f3f3f;\n\nconst int mod = 1e9 + 7;\n\nconst double eps = 1e-8;\n\nint main() {\n  _\n\n      int n,\n      t, k, mx;\n\n  LLI sum;\n\n  while (cin >> n >> t) {\n\n    mx = -1;\n\n    sum = 0;\n\n    for (int i = 0; i < n; ++i) {\n\n      cin >> k;\n\n      mx = max(mx, k);\n\n      sum += k;\n\n      if (sum <= t)\n        cout << int(1 + ceil((double)(t + 0.5 - sum) / (double)mx)) << \"\\n\";\n\n      else\n        cout << \"1\\n\";\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long LL;\n\nint main()\n\n{\n\n  LL n, t;\n\n  while (~scanf(\"%lld%lld\", &n, &t)) {\n\n    LL sum = 0, MaX = 0;\n\n    for (int i = 1; i <= n; i++) {\n\n      LL x;\n      scanf(\"%lld\", &x);\n\n      sum += x;\n      MaX = max(MaX, x);\n\n      LL ans = 1;\n\n      if (t >= sum)\n        ans = (LL)floor((t - sum) * 1.0 / MaX) + 2;\n\n      printf(\"%lld\\n\", ans);\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"023aec36cbcca35e8024f1d50cdeaa17137d2ba448891a1d6b2a2688e6fbbf4c","fast_id":"184c7329fc51a106f4350d57106896726974351786acf4aadab6623c0c7b0c89","fast_time":0.0165034773,"language":"cpp","measured_fast_code_id":"184c7329fc51a106f4350d57106896726974351786acf4aadab6623c0c7b0c89","measured_slow_code_id":"8e3748e7d76cedee1f90f5cecb56fa6270704e7c8f8c60d294f6eb9f65ac21e0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55605","problem_id":"p02684","slow_code_id":"4db8241a67174d84369e10cb1bd9b88398e4af8bc3cb3a8e3eaaebb7b882ecc9","slow_id":"8e3748e7d76cedee1f90f5cecb56fa6270704e7c8f8c60d294f6eb9f65ac21e0","slow_time":0.2305465439,"speedup":13.969573787943467,"stratum":"8+","sampling_key":"0133cecfacc1a19e8ec34b1c9ecf9c4e041fefa3ebc686a0183f34a3ad9b1006","slow_code":"#include <stdio.h>\n\nint main(void)\n\n{\n\n  int N, i, j, A[200000] = {0}, check[200000] = {}, move[200000] = {0};\n\n  long long K;\n\n  i = scanf(\"%d %lld\", &N, &K);\n\n  for (i = 0; i < N; i++)\n    check[i] = -scanf(\"%d\", &A[i]);\n\n  for (i = 0, j = 0;; i = A[i] - 1, j++)\n    if (check[i] < 0)\n      check[i] = j, move[j] = i;\n    else\n      break;\n\n  if (K >= j)\n    K = (K - check[i]) % (check[i] - j) + check[i];\n\n  return printf(\"%d\\n\", move[K] + 1), 0;\n}","fast_code":"#include <stdio.h>\n\ntypedef long long LL;\n\nint N, i, j, x, y = 0, A[200000], town[200000];\nLL K;\n\nint main(void)\n\n{\n\n  i = scanf(\"%d %lld\", &N, &K);\n\n  for (i = 0; i < N; i++)\n    town[i] = -scanf(\"%d\", &A[i]);\n\n  for (i = 0, j = 0;; i = A[i] - 1, j++)\n    if (town[i] < 0)\n      town[i] = j;\n    else {\n      x = town[i];\n      break;\n    }\n\n  while (K > 0) {\n    if (i == y) {\n      K %= x - j;\n      if (!K)\n        return printf(\"%d\", i + 1), 0;\n    }\n    y = A[y] - 1, K--;\n  }\n\n  return printf(\"%d\\n\", y + 1), 0;\n}"}
{"fast_code_id":"eea9953bac6c41160a873e97efe3d96c61db1e085c5bb0a46a5ce37264328c12","fast_id":"c3d90fb33abfb38ce7834a8a10b047268de04de3a764d692fdacc36b65592ce2","fast_time":0.0164059052,"language":"cpp","measured_fast_code_id":"c3d90fb33abfb38ce7834a8a10b047268de04de3a764d692fdacc36b65592ce2","measured_slow_code_id":"d8abcf56e24c9f190ac57fced83bcb26f51b888bd312bde30fe7a71207594c52","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55681","problem_id":"p03819","slow_code_id":"f7de84e4b66940353866658a2fae5c0005a67b865b04c86a12e477776ae6b9ce","slow_id":"d8abcf56e24c9f190ac57fced83bcb26f51b888bd312bde30fe7a71207594c52","slow_time":0.798102057,"speedup":48.647243006134154,"stratum":"8+","sampling_key":"07098927a022bb61504f27d2888d33a74746004ab58e6464ad7ceb203b62c172","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <map>\n\n#include <cstdlib>\n\n#include <set>\n\n#include <stack>\n\n#include <queue>\n\nusing namespace std;\n\n#define X first\n\n#define Y second\n\n#define N 300010\n\n#define M 400010\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\nconst int Mod = 1000000007;\n\nint n, m;\n\nint c[N];\n\nvector<pii> g[N];\n\ninline int Lowbit(int x) { return x & (-x); }\n\nvoid Add(int x, int v)\n\n{\n\n  while (x <= m)\n\n  {\n\n    c[x] += v;\n\n    x += Lowbit(x);\n  }\n}\n\nint Val(int x)\n\n{\n\n  int res = 0;\n\n  while (x)\n\n  {\n\n    res += c[x];\n\n    x -= Lowbit(x);\n  }\n\n  return res;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int l, r;\n    scanf(\"%d%d\", &l, &r);\n\n    g[r - l + 1].push_back(make_pair(l, r));\n  }\n\n  int sz = 0;\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int x = i, res = 0;\n\n    do\n\n    {\n\n      res += Val(x);\n\n      x += i;\n\n    } while (x <= m);\n\n    for (int j = 0; j < g[i].size(); j++)\n\n    {\n\n      Add(g[i][j].X, 1);\n\n      Add(g[i][j].Y + 1, -1);\n    }\n\n    printf(\"%d\\n\", res + n - sz);\n\n    sz += g[i].size();\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 300005;\n\nstruct BIT {\n\n  int maxn, c[N];\n\n  inline void init(int n) { maxn = n + 1; }\n\n  inline void add(int x, int r) {\n\n    x++;\n\n    for (int i = x; i <= maxn; i += i & -i)\n\n      c[i]++;\n  }\n\n  inline int sum(int x) {\n\n    int ret = 0;\n\n    for (int i = x; i; i -= i & -i)\n\n      ret += c[i];\n\n    return ret;\n  }\n\n  inline int sum(int l, int r) {\n\n    l++, r++;\n\n    if (r > maxn)\n      r = maxn;\n\n    if (l > r)\n      return 0;\n\n    return sum(r) - sum(l - 1);\n  }\n\n} bit1, bit2;\n\nint n, m;\n\nstruct abcd {\n\n  int l, r;\n\n  int len() { return r - l + 1; }\n\n  bool operator<(const abcd &B) const { return r - l + 1 < B.r - B.l + 1; }\n\n} a[N];\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++)\n    scanf(\"%d%d\", &a[i].l, &a[i].r);\n\n  sort(a + 1, a + n + 1);\n\n  int pnt = 1, ans;\n  bit1.init(m);\n  bit2.init(m);\n\n  for (int d = 1; d <= m; d++) {\n\n    while (pnt <= n && a[pnt].len() < d)\n      bit1.add(a[pnt].l - 1, 1), bit2.add(a[pnt].r, 1), pnt++;\n\n    ans = n - pnt + 1;\n\n    for (int x = 0; x <= m / d; x++)\n\n      ans += x * bit2.sum(x * d, (x + 1) * d - 1);\n\n    for (int x = 0; x <= m / d; x++)\n\n      ans -= x * bit1.sum(x * d, (x + 1) * d - 1);\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"14d9f0b5a743d20a49b62f85b6a3bea35b2c56f7cda7c5e8aa9420fa7bc8ac6e","fast_id":"458643445a1037adad8ea16d2bd1006cba71930d1b8034d1d01225c4b45f4687","fast_time":0.0104949336,"language":"cpp","measured_fast_code_id":"458643445a1037adad8ea16d2bd1006cba71930d1b8034d1d01225c4b45f4687","measured_slow_code_id":"36ffa49645159b1a1d51a97caf5f3389ae1b0fd9b991c8b139d87fbc0ceea475","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55828","problem_id":"p03666","slow_code_id":"e9da9b5823b25c9d8b4ba9f40c36d434c57274287f5de917410e165baca0c394","slow_id":"36ffa49645159b1a1d51a97caf5f3389ae1b0fd9b991c8b139d87fbc0ceea475","slow_time":0.0649249375,"speedup":6.186312365044405,"stratum":"4-8","sampling_key":"0e7d039ecc2d53e57eea5a2aa347bf9c71e11d760c3b45c2b407e6793c7317f5","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define RFOR(i, b, a) for (int i = (b) - 1; i >= (a); i--)\n\n#define ITER(it, a) for (typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int)a.size()\n\n#define ALL(a) a.begin(), a.end()\n\n#define PB push_back\n\n#define MP make_pair\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\n\nconst LL INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = INF * (LL)INF;\n\nconst int MAX = 500500;\n\nLL L[MAX], R[MAX];\n\nLL U[MAX], D[MAX];\n\nbool intersect(LL x1, LL y1, LL x2, LL y2)\n\n{\n\n  if (y1 < x2)\n    return false;\n\n  if (y2 < x1)\n    return false;\n\n  return true;\n}\n\nint main()\n\n{\n\n  LL n, a, b, c, d;\n\n  cin >> n >> a >> b >> c >> d;\n\n  L[0] = R[0] = a;\n\n  FOR(i, 1, n)\n\n  {\n\n    L[i] = L[i - 1] + c;\n\n    R[i] = R[i - 1] + d;\n  }\n\n  U[n - 1] = D[n - 1] = b;\n\n  RFOR(i, n - 1, 0)\n\n  {\n\n    D[i] = D[i + 1] + c;\n\n    U[i] = U[i + 1] + d;\n  }\n\n  FOR(i, 0, n)\n\n  {\n\n    if (intersect(L[i], R[i], D[i], U[i]))\n\n    {\n\n      cout << \"YES\" << endl;\n\n      return 0;\n    }\n  }\n\n  cout << \"NO\" << endl;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define ll long long\n\nusing namespace std;\n\ninline ll in() {\n\n  ll x = 0;\n  bool f = 0;\n  char c;\n\n  for (; (c = getchar()) < '0' || c > '9'; f = c == '-')\n    ;\n\n  for (x = c - '0'; (c = getchar()) >= '0' && c <= '9';\n       x = (x << 3) + (x << 1) + c - '0')\n    ;\n\n  return f ? -x : x;\n}\n\nll n, a, b, c, d, mxp, mnp, mxn, mnn;\n\nint main()\n\n{\n\n  n = in();\n  a = in();\n  b = in();\n  c = in();\n  d = in();\n\n  for (int i = 0; i < n; ++i) {\n\n    mnp = c * i;\n    mxp = d * i;\n\n    mxn = -c * (n - 1ll - i);\n    mnn = -d * (n - 1ll - i);\n\n    if (mnp + mnn <= b - a && mxp + mxn >= b - a) {\n      printf(\"YES\");\n      return 0;\n    }\n  }\n  printf(\"NO\");\n  return 0;\n}"}
{"fast_code_id":"5b317b6b2fc3ef08c4a98be05bef849e7135ef1281d5f722ae9ef83ae1784346","fast_id":"394659304454a7f7ee4b3c056ad731ccd04f4f2e6ebfac9bb029ef63b0970fa0","fast_time":0.0176643627,"language":"cpp","measured_fast_code_id":"394659304454a7f7ee4b3c056ad731ccd04f4f2e6ebfac9bb029ef63b0970fa0","measured_slow_code_id":"bb85e025c50257baab41e48075929fc39db6e635040dab81704697d9e5456eba","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55846","problem_id":"p02919","slow_code_id":"bd6bdc4b831ac645b2d3c95238c63f2eb217040fab229e6f165d89c842afb8f3","slow_id":"bb85e025c50257baab41e48075929fc39db6e635040dab81704697d9e5456eba","slow_time":0.1913247839,"speedup":10.831117269801078,"stratum":"8+","sampling_key":"6f437acc9bf00d4fb2557bef5e96d705ff31cd4c3ea13e88cfc6d36fb5bd8f38","slow_code":"#include <bits/stdc++.h>\n\n#define ci const int &\n\n#define Updl(x) (t[x].vl = Mrgl(t[x << 1].vl, t[x << 1 | 1].vl))\n\n#define Updr(x) (t[x].vr = Mrgr(t[x << 1].vr, t[x << 1 | 1].vr))\n\n#define pi pair<int, int>\n\n#define f first\n\n#define s second\n\nusing namespace std;\n\nstruct node {\n\n  int l, r;\n\n  pi vl, vr;\n\n} t[400010];\n\nint n, p[100010], pos[100010], l1, l2, r1, r2;\n\nlong long ans;\n\npi tmp;\n\npi Mrgl(const pi &x, const pi &y) {\n\n  return x.f > y.f ? (pi){x.f, max(x.s, y.f)} : (pi){y.f, max(x.f, y.s)};\n}\n\npi Mrgr(const pi &x, const pi &y) {\n\n  return x.f < y.f ? (pi){x.f, min(x.s, y.f)} : (pi){y.f, min(x.f, y.s)};\n}\n\nvoid Build(ci x, ci l, ci r) {\n\n  t[x].l = l, t[x].r = r;\n\n  if (l == r)\n    return (void)(t[x].vr.f = pos[l], t[x].vr.s = n + 1);\n\n  int mid = l + r >> 1;\n\n  Build(x << 1, l, mid), Build(x << 1 | 1, mid + 1, r), Updr(x);\n}\n\nvoid Changel(ci x, ci id, ci v) {\n\n  if (t[x].l == t[x].r)\n    return (void)(t[x].vl.f = v);\n\n  int mid = t[x].l + t[x].r >> 1;\n\n  id <= mid ? Changel(x << 1, id, v) : Changel(x << 1 | 1, id, v), Updl(x);\n}\n\nvoid Changer(ci x, ci id) {\n\n  if (t[x].l == t[x].r)\n    return (void)(t[x].vr.f = n + 1);\n\n  int mid = t[x].l + t[x].r >> 1;\n\n  id <= mid ? Changer(x << 1, id) : Changer(x << 1 | 1, id), Updr(x);\n}\n\npi Queryl(ci x, ci l, ci r) {\n\n  if (l > r)\n    return (pi){0, 0};\n\n  if (t[x].l == l && t[x].r == r)\n    return t[x].vl;\n\n  int mid = t[x].l + t[x].r >> 1;\n\n  return r <= mid ? Queryl(x << 1, l, r)\n                  : (l > mid ? Queryl(x << 1 | 1, l, r)\n                             : (Mrgl(Queryl(x << 1, l, mid),\n                                     Queryl(x << 1 | 1, mid + 1, r))));\n}\n\npi Queryr(ci x, ci l, ci r) {\n\n  if (l > r)\n    return (pi){n + 1, n + 1};\n\n  if (t[x].l == l && t[x].r == r)\n    return t[x].vr;\n\n  int mid = t[x].l + t[x].r >> 1;\n\n  return r <= mid ? Queryr(x << 1, l, r)\n                  : (l > mid ? Queryr(x << 1 | 1, l, r)\n                             : (Mrgr(Queryr(x << 1, l, mid),\n                                     Queryr(x << 1 | 1, mid + 1, r))));\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%d\", &p[i]), pos[p[i]] = i;\n\n  Build(1, 1, n);\n\n  for (int i = 1; i <= n; ++i) {\n\n    Changer(1, p[i]), Changel(1, p[i], i),\n        tmp = Queryl(1, p[i] + 1, n), l1 = tmp.f, l2 = tmp.s,\n        tmp = Queryr(1, p[i] + 1, n), r1 = tmp.f, r2 = tmp.s;\n\n    ans +=\n        1ll * (i - l1) * (r2 - r1) * p[i] + 1ll * (l1 - l2) * (r1 - i) * p[i];\n  }\n\n  printf(\"%lld\", ans);\n\n  return 0;\n}","fast_code":"\n\n#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace __gnu_pbds;\n\nusing namespace std;\n\ntemplate <typename T>\nusing ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n\n#define F first\n\n#define S second\n\n#define lb lower_bound\n\n#define ub upper_bound\n\n#define pb push_back\n\n#define pf push_front\n\n#define ppb pop_back\n\n#define mp make_pair\n\n#define bpp __builtin_popcountll\n\n#define sqr(x) ((x) * (x))\n\n#define al 0x3F3F3F3F\n\n#define sz(x) (int)x.size()\n\n#define all(x) x.begin(), x.end()\n\n#define in insert\n\n#define ppf pop_front\n\n#define endl '\\n'\n\ntypedef unsigned long long ull;\n\ntypedef long long ll;\n\ntypedef long double ld;\n\ntypedef pair<int, int> pii;\n\nconst int mod = (int)1e9 + 7;\n\nconst int N = (int)3e5 + 123;\n\nconst ll inf = (ll)1e18 + 1;\n\nconst double pi = acos(-1.0);\n\nconst double eps = 1e-7;\n\nconst int dx[] = {0, 0, 1, 0, -1};\n\nconst int dy[] = {0, 1, 0, -1, 0};\n\nint n, a[N], l[N], r[N], mx[20][N], lg[N];\n\nll ans;\n\nstack<int> st;\n\ninline int get(int l, int r) {\n\n  int len = lg[r - l + 1];\n\n  return max(mx[len][l], mx[len][r - (1 << len) + 1]);\n}\n\ninline void boost() {\n\n  ios_base ::sync_with_stdio(NULL);\n\n  cin.tie(NULL), cout.tie(NULL);\n}\n\ninline void Solve() {\n\n  cin >> n;\n\n  lg[0] = -1;\n\n  for (int i = 1; i <= n; i++)\n    cin >> a[i], mx[0][i] = a[i], lg[i] = lg[i / 2] + 1;\n\n  for (int p = 1; (1 << p) <= n; p++)\n\n    for (int i = 1; i + (1 << p) - 1 <= n; i++)\n\n      mx[p][i] = max(mx[p - 1][i], mx[p - 1][i + (1 << (p - 1))]);\n\n  for (int i = 1; i <= n; i++) {\n\n    while (sz(st) && a[st.top()] < a[i])\n      st.pop();\n\n    if (!sz(st))\n      l[i] = 0;\n\n    else\n      l[i] = st.top();\n\n    st.push(i);\n  }\n\n  st = stack<int>();\n\n  for (int i = n; i >= 1; i--) {\n\n    while (sz(st) && a[st.top()] < a[i])\n      st.pop();\n\n    if (!sz(st))\n      r[i] = n + 1;\n\n    else\n      r[i] = st.top();\n\n    st.push(i);\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    if (l[i] == 0 && r[i] == n + 1)\n      continue;\n\n    if (r[i] != n + 1) {\n\n      int pos = n + 1;\n\n      int L = r[i] + 1, R = n;\n\n      while (L <= R) {\n\n        int mid = L + R >> 1;\n\n        if (get(r[i] + 1, mid) > a[i])\n          pos = mid, R = mid - 1;\n\n        else\n          L = mid + 1;\n      }\n\n      ans += 1ll * (i - l[i]) * (pos - r[i]) * a[i];\n    }\n\n    if (l[i]) {\n\n      int pos = 0;\n\n      int L = 1, R = l[i] - 1;\n\n      while (L <= R) {\n\n        int mid = L + R >> 1;\n\n        if (get(mid, l[i] - 1) > a[i])\n          pos = mid, L = mid + 1;\n\n        else\n          R = mid - 1;\n      }\n\n      ans += 1ll * (l[i] - pos) * (r[i] - i) * a[i];\n    }\n  }\n\n  cout << ans;\n}\n\nmain() {\n\n  boost();\n\n  int tt = 1;\n\n  while (tt--) {\n\n    Solve();\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"5db867f01d47dc8e748f74a739da255e47eb33b52ef0623fd93a1f52f39a10aa","fast_id":"9180ef34f053c1a0464c13cf9d4c643a7f83758aeb75c3b43b050bc896d68961","fast_time":0.0193224194,"language":"cpp","measured_fast_code_id":"9180ef34f053c1a0464c13cf9d4c643a7f83758aeb75c3b43b050bc896d68961","measured_slow_code_id":"1031a4017b3165993bac5479f30ed649cc37b302f318fd1f203d9179c323afa4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55857","problem_id":"p02785","slow_code_id":"867cea11993ccf4b972c1944f3fc326336dae544a52914b9dc45573abae47910","slow_id":"1031a4017b3165993bac5479f30ed649cc37b302f318fd1f203d9179c323afa4","slow_time":0.1093636015,"speedup":5.659933118934371,"stratum":"4-8","sampling_key":"e27847ba30e3f0f4e1bb9edfe7784ad4470aa4124fc4b8839dc1065351cf7055","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\nusing namespace std;\n\nint main()\n\n{\n\n  unsigned long long n, k;\n\n  unsigned long long arr[200005];\n\n  unsigned long long maxm = 1;\n\n  unsigned long long cnt = 0;\n\n  cin >> n >> k;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> arr[i];\n\n    cnt += arr[i];\n  }\n\n  sort(arr, arr + n);\n\n  if (k >= n) {\n\n    cout << 0;\n\n  } else if (k == 0) {\n\n    cout << cnt;\n\n  }\n\n  else {\n\n    for (int i = n - 1; i >= 0; i--) {\n\n      if (maxm <= k) {\n\n        cnt -= arr[i];\n      }\n\n      maxm++;\n    }\n\n    cout << cnt;\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\n#define ll long long\n\nclass FIO\n\n{\n\npublic:\n  template <typename T> FIO &operator>>(T &x) {\n    _R(x);\n    return *this;\n  }\n\n  template <typename T> FIO &operator<<(T x) {\n    _W(x);\n    return *this;\n  }\n\nprivate:\n  char f, c, a[25], i;\n\n  template <typename T>\n  inline void _R(T &x)\n\n  {\n\n    for (f = 0; (c = getchar()) < 48; c == 45 && (f = 1))\n      ;\n\n    for (x = c ^ 48; (c = getchar()) > 47; x = (x << 3) + (x << 1) + (c ^ 48))\n      ;\n\n    if (f)\n      x = -x;\n  }\n\n  template <typename T>\n  inline void _W(T x)\n\n  {\n\n    if (sizeof(x) == 1) {\n      putchar(x);\n      return;\n    }\n\n    if (x < 0)\n      putchar(45), x = -x;\n\n    if (x > 99) {\n\n      for (i = 0; x; x /= 10)\n        a[i++] = x % 10;\n\n      while (i--)\n        putchar(a[i] + 48);\n\n    } else if (x > 9)\n      putchar(x / 10 + 48), putchar(x % 10 + 48);\n\n    else\n      putchar(x + 48);\n  }\n\n} io;\n\nll a[200005];\n\nint main()\n\n{\n\n  ll n, k;\n\n  io >> n >> k;\n\n  for (int i = 0; i < n; ++i)\n    io >> a[i];\n\n  std::sort(a, a + n);\n\n  ll ans = 0;\n\n  for (int i = 0, _i = n - k; i < _i; ++i)\n\n    ans += a[i];\n\n  io << ans;\n\n  return 0;\n}"}
{"fast_code_id":"c602f7fab9db430d03af99f277c1a0364be37e90fd08ba9601d9eea5ad03df6b","fast_id":"ef74d8c7d55c2a8ff0ab788adc2a2f7d6dcf6e7d5f5dae67d28edb77b8d326db","fast_time":0.097383989,"language":"cpp","measured_fast_code_id":"ef74d8c7d55c2a8ff0ab788adc2a2f7d6dcf6e7d5f5dae67d28edb77b8d326db","measured_slow_code_id":"9760b0e75da2af69ad3c50ae2afa18a9ca813bc268bf6b5ef339c3cd3243941c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5590","problem_id":"p01422","slow_code_id":"e245baa8873a6bebd788bee4f0586a8a7cfb2328e9d1a00503f02b501346d11b","slow_id":"9760b0e75da2af69ad3c50ae2afa18a9ca813bc268bf6b5ef339c3cd3243941c","slow_time":0.3318039551,"speedup":3.407171533094624,"stratum":"2-4","sampling_key":"63eb7d7b64cb3dfbd736f359ed8bc5ff53ec0ea2a7f7f2035a467c2e2c16b400","slow_code":"#include <cstdio>\n\n#include <cstring>\n\ninline int gcd(int a, int b) {\n\n  while (a != 0) {\n\n    int t = b % a;\n\n    b = a;\n\n    a = t;\n  }\n\n  return b;\n}\n\ninline int abs(int x) { return x < 0 ? -x : x; }\n\nstruct Frac {\n\n  int a, b;\n\n  Frac() : a(1), b(1) {}\n\n  Frac(int a, int b) : a(a), b(b) { reduce(); }\n\n  void reduce() {\n\n    int g = gcd(a, b);\n\n    a /= g;\n\n    b /= g;\n  }\n\n  bool operator<(const Frac &f) const { return (long long)a * f.b < (long long)b * f.a; }\n};\n\ninline void checkMin(Frac &ret, const Frac &val) {\n\n  if (val < ret) {\n\n    ret = val;\n  }\n}\n\ninline void checkMax(Frac &ret, const Frac &val) {\n\n  if (ret < val) {\n\n    ret = val;\n  }\n}\n\nint n;\n\nint a[100000];\n\nFrac dp[2][200001];\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; ++i) {\n\n    scanf(\"%d\", &a[i]);\n  }\n\n  for (int i = 1; i <= a[0] * 2; ++i) {\n\n    dp[0][i] = Frac(0, 1);\n  }\n\n  for (int i = 0; i < n; ++i) {\n\n    int lim = i + 1 == n ? 0 : a[i + 1] * 2;\n\n    for (int j = 1; j <= a[i] * 2; ++j) {\n\n      checkMax(dp[i % 2][j], Frac(abs(j - a[i]), a[i]));\n\n      for (int k = j; k <= lim; k += j) {\n\n        checkMin(dp[1 - i % 2][k], dp[i % 2][j]);\n      }\n    }\n  }\n\n  Frac res;\n\n  for (int i = 1; i <= a[n - 1] * 2; ++i) {\n\n    checkMin(res, dp[(n - 1) % 2][i]);\n  }\n\n  printf(\"%.13lf\\n\", (double)res.a / res.b);\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#define INF 210000000\n\nusing namespace std;\n\nint a[300], b[300];\n\nint n;\n\nint abs(int x) { return x < 0 ? -x : x; }\n\nint dfs(int now, double radio, int last) {\n\n  int low = (int)ceil(a[now] - a[now] * radio);\n\n  int high = (int)ceil(a[now] + a[now] * radio);\n\n  int st;\n\n  if (low % last == 0)\n    st = low;\n  else\n    st = (low / last + 1) * last;\n\n  for (int i = st; i < high; i += last) {\n\n    if (now == n - 1)\n      return 1;\n\n    if (dfs(now + 1, radio, i))\n      return 1;\n  }\n\n  return 0;\n}\n\nint check(double x) { return dfs(0, x, 1); }\n\nint main() {\n\n  int i, j;\n\n  double ans = 1e10;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n\n    cin >> a[i];\n\n  double l = 0, r = 1;\n\n  while (r - l >= 1e-11) {\n\n    double mid = (r + l) / 2.0;\n\n    if (check(mid))\n      r = mid;\n    else\n      l = mid;\n  }\n\n  printf(\"%.10f\\n\", l);\n\n  return 0;\n}"}
{"fast_code_id":"eb4846c2fa618a44c3c2d89d8b540966af3797572ad4a78ae770cf6356c16c37","fast_id":"589b1114066e28642fdcdbf0c2aea6fc2e783077e0f3580675cfdaeeeca3fb42","fast_time":0.105518171,"language":"cpp","measured_fast_code_id":"589b1114066e28642fdcdbf0c2aea6fc2e783077e0f3580675cfdaeeeca3fb42","measured_slow_code_id":"c90309f3f2d5a37f7925e2e384df56f4d953ec77e7cf7e1aad66ad5f0554d4bb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55927","problem_id":"p03991","slow_code_id":"5879de4b1d39baa4159a8287e5c186bebf8ec37a1e445ea499401555eee536e4","slow_id":"c90309f3f2d5a37f7925e2e384df56f4d953ec77e7cf7e1aad66ad5f0554d4bb","slow_time":0.4058379522,"speedup":3.8461427861557613,"stratum":"2-4","sampling_key":"013e2c8f1d73935d9bde61bdda9842ce50f4e2a7706f2442d78e24b55e193033","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cmath>\n\ntypedef long long lint;\n\nconst int N = 262144;\n\nconst int mod = 924844033;\n\nint n, cal[N], fac[N], inv[N];\n\ninline int nxi() {\n\n  int x = 0;\n\n  char c;\n\n  while ((c = getchar()) > '9' || c < '0')\n    ;\n\n  while (x = x * 10 - 48 + c, (c = getchar()) >= '0' && c <= '9')\n    ;\n\n  return x;\n}\n\ninline int fpow(int x, int t) {\n\n  int ans = 1;\n\n  for (; t; x = (lint)x * x % mod, t >>= 1) {\n\n    if (t & 1)\n      ans = (lint)ans * x % mod;\n  }\n\n  return ans;\n}\n\ninline void init() {\n\n  fac[0] = 1;\n\n  for (int i = 1; i < N; ++i)\n    fac[i] = (lint)fac[i - 1] * i % mod;\n\n  inv[N - 1] = fpow(fac[N - 1], mod - 2);\n\n  for (int i = N - 1; i; --i)\n    inv[i - 1] = (lint)inv[i] * i % mod;\n}\n\ninline int C(const int x, const int y) {\n\n  if (x < y)\n    return 0;\n\n  return (lint)fac[x] * inv[y] % mod * inv[x - y] % mod;\n}\n\nnamespace G {\n\nint cnt, fir[N], sz[N];\n\nstruct edge {\n\n  int to, nx;\n\n} eg[N << 1];\n\ninline void add(const int a, const int b) {\n\n  eg[++cnt] = (edge){b, fir[a]};\n\n  fir[a] = cnt;\n}\n\ninline void dfs_cal(const int x) {\n\n  sz[x] = 1;\n\n  for (int i = fir[x]; i; i = eg[i].nx) {\n\n    const int y = eg[i].to;\n\n    if (!sz[y]) {\n\n      dfs_cal(y);\n\n      ++cal[sz[y]];\n\n      sz[x] += sz[y];\n    }\n  }\n\n  ++cal[n - sz[x]];\n}\n\n}               \n\nnamespace P {\n\nvoid ntt(int *a, int len, bool f) {\n\n  static int rev[N << 1];\n\n  for (int i = 1; i < len; ++i) {\n\n    rev[i] = rev[i >> 1] >> 1 | (i & 1 ? len >> 1 : 0);\n\n    if (i < rev[i])\n      std::swap(a[i], a[rev[i]]);\n  }\n\n  for (int i = 1; i < len; i <<= 1) {\n\n    int t = fpow(5, (mod - 1) / (i << 1));\n\n    for (int j = 0; j < len; j += i << 1) {\n\n      for (int w = 1, k = 0; k < i; ++k, w = (lint)w * t % mod) {\n\n        lint p = (lint)w * a[j + k + i];\n\n        a[j + k + i] = (a[j + k] - p) % mod;\n\n        a[j + k] = (a[j + k] + p) % mod;\n      }\n    }\n  }\n\n  for (int i = 0; i < len; ++i) {\n\n    if (a[i] < 0)\n      a[i] += mod;\n  }\n\n  if (f == 0)\n    return;\n\n  std::reverse(a + 1, a + len);\n\n  int tmp = fpow(len, mod - 2);\n\n  for (int i = 0; i < len; ++i) {\n\n    a[i] = (lint)a[i] * tmp % mod;\n  }\n}\n\nclass poly {\n\npublic:\n  int len, *n;\n\n  poly(int len = 0) {\n\n    this->len = len;\n\n    n = new int[len + 1];\n  }\n\n  friend poly operator*(poly a, poly b);\n\n} ans;\n\npoly operator*(poly a, poly b) {\n\n  static int buka[N << 1], bukb[N << 1];\n\n  poly c(a.len + b.len);\n\n  int len = 1;\n\n  while (len <= c.len)\n    len <<= 1;\n\n  memset(buka, 0, len * sizeof(int));\n\n  memset(bukb, 0, len * sizeof(int));\n\n  memcpy(buka, a.n, (a.len + 1) * sizeof(int));\n\n  memcpy(bukb, b.n, (b.len + 1) * sizeof(int));\n\n  ntt(buka, len, 0);\n\n  ntt(bukb, len, 0);\n\n  for (int i = 0; i < len; ++i) {\n\n    buka[i] = (lint)buka[i] * bukb[i] % mod;\n  }\n\n  ntt(buka, len, 1);\n\n  memcpy(c.n, buka, (c.len + 1) * sizeof(int));\n\n  return c;\n}\n\ninline void get_poly() {\n\n  poly a(n), b(n);\n\n  for (int i = 1; i < n; ++i) {\n\n    a.n[i] = (lint)cal[i] * fac[i] % mod;\n\n    b.n[i] = inv[n - i - 1];\n  }\n\n  ans = a * b;\n}\n\n}               \n\nint main() {\n\n  init();\n\n  n = nxi();\n\n  for (int i = 1; i < n; ++i) {\n\n    const int a = nxi(), b = nxi();\n\n    G::add(a, b);\n\n    G::add(b, a);\n  }\n\n  G::dfs_cal(1);\n\n  P::get_poly();\n\n  for (int i = 1; i <= n; ++i) {\n\n    const int all = (lint)n * C(n, i) % mod;\n\n    const int invld = (lint)inv[i] * P::ans.n[n - 1 + i] % mod;\n\n    printf(\"%d\\n\", (all + mod - invld) % mod);\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define maxn 800010\n\n#define P 924844033\n\n#define G 5\n\nusing namespace std;\n\ntypedef long long ll;\n\ntemplate <typename T>\ninline void read(T &x)\n\n{\n\n  x = 0;\n  char c = getchar();\n  bool flag = false;\n\n  while (!isdigit(c)) {\n    if (c == '-')\n      flag = true;\n    c = getchar();\n  }\n\n  while (isdigit(c)) {\n    x = (x << 1) + (x << 3) + (c ^ 48);\n    c = getchar();\n  }\n\n  if (flag)\n    x = -x;\n}\n\nll n;\n\nll rev[maxn], f[maxn], g[maxn], fac[maxn], ifac[maxn], siz[maxn], cnt[maxn];\n\nstruct edge\n\n{\n\n  int to, nxt;\n\n} e[maxn];\n\nint head[maxn], edge_cnt;\n\nvoid add(int from, int to)\n\n{\n\n  e[++edge_cnt] = {to, head[from]}, head[from] = edge_cnt;\n}\n\nll qp(ll x, ll y)\n\n{\n\n  ll v = 1;\n\n  while (y)\n\n  {\n\n    if (y & 1)\n      v = v * x % P;\n\n    x = x * x % P, y >>= 1;\n  }\n\n  return v;\n}\n\nint calc(int n)\n\n{\n\n  int lim = 1;\n\n  while (lim <= n)\n    lim <<= 1;\n\n  for (int i = 0; i < lim; ++i)\n\n    rev[i] = (rev[i >> 1] >> 1) | ((i & 1) ? lim >> 1 : 0);\n\n  return lim;\n}\n\nvoid NTT(ll *a, int lim, int type)\n\n{\n\n  for (int i = 0; i < lim; ++i)\n\n    if (i < rev[i])\n\n      swap(a[i], a[rev[i]]);\n\n  for (int len = 1; len < lim; len <<= 1)\n\n  {\n\n    ll wn = qp(G, (P - 1) / (len << 1));\n\n    for (int i = 0; i < lim; i += len << 1)\n\n    {\n\n      ll w = 1;\n\n      for (int j = i; j < i + len; ++j, w = w * wn % P)\n\n      {\n\n        ll x = a[j], y = w * a[j + len] % P;\n\n        a[j] = (x + y) % P, a[j + len] = (x - y + P) % P;\n      }\n    }\n  }\n\n  if (type == 1)\n    return;\n\n  ll inv = qp(lim, P - 2);\n\n  for (int i = 0; i < lim; ++i)\n    a[i] = a[i] * inv % P;\n\n  reverse(a + 1, a + lim);\n}\n\nvoid mul(ll *f, ll *g)\n\n{\n\n  int lim = calc(n << 1);\n\n  NTT(f, lim, 1), NTT(g, lim, 1);\n\n  for (int i = 0; i < lim; ++i)\n    f[i] = f[i] * g[i] % P;\n\n  NTT(f, lim, -1);\n}\n\nvoid dfs(int x, int fa)\n\n{\n\n  siz[x] = 1;\n\n  for (int i = head[x]; i; i = e[i].nxt)\n\n  {\n\n    int y = e[i].to;\n\n    if (y == fa)\n      continue;\n\n    dfs(y, x), siz[x] += siz[y];\n  }\n\n  cnt[siz[x]]++, cnt[n - siz[x]]++;\n}\n\nll C(ll n, ll m)\n\n{\n\n  return fac[n] * ifac[m] % P * ifac[n - m] % P;\n}\n\nvoid init()\n\n{\n\n  fac[0] = ifac[0] = 1;\n\n  for (int i = 1; i <= n; ++i)\n    fac[i] = fac[i - 1] * i % P;\n\n  ifac[n] = qp(fac[n], P - 2);\n\n  for (int i = n - 1; i; --i)\n    ifac[i] = ifac[i + 1] * (i + 1) % P;\n}\n\nint main()\n\n{\n\n  read(n), init();\n\n  for (int i = 1; i < n; ++i)\n\n  {\n\n    int x, y;\n\n    read(x), read(y);\n\n    add(x, y), add(y, x);\n  }\n\n  dfs(1, 0), g[0] = 1;\n\n  for (int i = 1; i <= n; ++i)\n    f[i] = cnt[n - i] * fac[n - i] % P, g[i] = ifac[i];\n\n  mul(f, g), reverse(f, f + n + 1);\n\n  for (int i = 1; i <= n; ++i)\n    printf(\"%lld\\n\", (n * C(n, i) % P - ifac[i] * f[i] % P + P) % P);\n\n  return 0;\n}"}
{"fast_code_id":"281d90dad972822067708f142a072de4bc37205dab18154ba41a094c436ae37f","fast_id":"936e4c4966ee6bd068c3658767a1fc6f5ce48b9f13379e3d9447ac8308c09c13","fast_time":0.0785141975,"language":"cpp","measured_fast_code_id":"936e4c4966ee6bd068c3658767a1fc6f5ce48b9f13379e3d9447ac8308c09c13","measured_slow_code_id":"39b16e5f83013629991d1c28b26c09c007fac45577bb90a0e747890402008dd0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55933","problem_id":"p00602","slow_code_id":"348b38ebe208a3ba53473310de8c1c0a92c8e25ee6cdec948ada68c1c054a5a7","slow_id":"39b16e5f83013629991d1c28b26c09c007fac45577bb90a0e747890402008dd0","slow_time":1.0649689751,"speedup":13.56403057039461,"stratum":"8+","sampling_key":"a4cadd30aec8874d6c9e2ac00e3a0f65fe6a19730bdccc342c471897ec777568","slow_code":"#include <iostream>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define N_F 1010\n\n#define N_CONST 1001\n\nusing namespace std;\n\nint v, d, f1, f2;\n\nunsigned long long int f[N_F];\n\nint node[N_CONST + 10][N_CONST + 10];\n\nvoid rmNode(int i) {\n\n  node[i][i] = 0;\n\n  for (int j = 0; j < N_CONST; j++) {\n\n    if (node[j][j] == 0)\n\n      continue;\n\n    if (node[i][j] == 1) {\n\n      rmNode(j);\n    }\n  }\n}\n\nint main() {\n\n  f[0] = 1;\n  f[1] = 2;\n\n  for (int i = 2; i < N_F; i++) {\n\n    f[i] = (f[i - 1] + f[i - 2]) % N_CONST;\n  }\n\n  while (cin >> v >> d) {\n\n    memset(node, 0, sizeof(node));\n\n    for (int i = 1; i <= v; i++) {\n\n      f1 = f[i] % N_CONST;\n\n      node[f1][f1] = 1;\n\n      for (int j = 1; j <= v; j++) {\n\n        f2 = f[j] % N_CONST;\n\n        if (abs(f1 - f2) < d) {\n\n          node[f1][f2] = 1;\n\n          node[f2][f1] = 1;\n        }\n      }\n    }\n\n    int n = 0;\n\n    for (int i = 0; i < N_CONST; i++) {\n\n      if (node[i][i] == 0)\n\n        continue;\n\n      n++;\n\n      rmNode(i);\n    }\n\n    cout << n << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdlib>\n\n#include <set>\n\nusing namespace std;\n\nconst int N = 1001;\n\nconst int SIZE = 1000 + 100;\n\nint parent[SIZE];\n\nint f[SIZE];\n\nint cal(int n) {\n\n  if (f[n] > 0)\n    return f[n];\n\n  return f[n] = (cal(n - 1) + cal(n - 2)) % N;\n}\n\nint find(int n) {\n\n  if (parent[n] == n)\n    return n;\n\n  return parent[n] = find(parent[n]);\n}\n\nint main() {\n\n  f[0] = 1;\n\n  f[1] = 2;\n\n  for (int i = 2; i < SIZE; i++)\n    f[i] = -1;\n\n  int v, d;\n\n  while (cin >> v >> d) {\n\n    for (int i = 1; i <= v; i++)\n\n      parent[i] = i;\n\n    for (int i = 1; i <= v; i++) {\n\n      for (int j = i + 1; j <= v; j++)\n\n        if (abs(cal(i) - cal(j)) < d)\n\n          parent[find(j)] = find(i);\n    }\n\n    set<int> s;\n\n    for (int i = 1; i <= v; i++)\n\n      s.insert(find(i));\n\n    cout << s.size() << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"9e9a9dbd28151c30f22f5e11c6efb26a0490abcc0f8cc56fcd08e7234d4a57fb","fast_id":"4544a0436bc9ad1eec845bfc37c8796ac74faa9085cbd7858b3a604724b218b3","fast_time":0.0010351398,"language":"cpp","measured_fast_code_id":"4544a0436bc9ad1eec845bfc37c8796ac74faa9085cbd7858b3a604724b218b3","measured_slow_code_id":"9677f6b498e6fa8813a63c3b00df160b7f6cc8223f89b41d6a3f2b86a58ea789","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55938","problem_id":"p03911","slow_code_id":"20552905b225d86d1ff916a74c4d204bfbb491f9537a9e0a43fd55abfef2130c","slow_id":"9677f6b498e6fa8813a63c3b00df160b7f6cc8223f89b41d6a3f2b86a58ea789","slow_time":0.0086256716,"speedup":8.332856682739859,"stratum":"8+","sampling_key":"42b20a81bad71f424f0126fc0da7794620035536fb9d1eef66c5b8a35740563e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing PII = pair<int, int>;\n\nusing VI = vector<int>;\n\nconst int N = 2e5 + 100;\n\nVI val[N];\n\nstruct DSU {\n\n  VI sz, par;\n\n  DSU(int n) {\n\n    par.resize(n);\n\n    iota(par.begin(), par.end(), 0);\n\n    sz.resize(n, 1);\n  }\n\n  int find(int u) {\n\n    if (par[u] == u)\n      return u;\n\n    return par[u] = find(par[u]);\n  }\n\n  void merge(int u, int v) {\n\n    u = find(u), v = find(v);\n\n    if (u != v) {\n\n      par[u] = v;\n\n      sz[v] += sz[u];\n    }\n  }\n\n  int get(int u) { return sz[find(u)]; }\n};\n\nint main() {\n\n#ifdef LOCAL_EXEC\n\n#else\n\n  ios_base::sync_with_stdio(false);\n  cin.tie(NULL);\n\n#endif\n\n  int n;\n  cin >> n;\n\n  int m;\n  cin >> m;\n\n  for (int i = 0; i < n; i++) {\n\n    int sz;\n    cin >> sz;\n\n    while (sz--) {\n\n      int x;\n      cin >> x;\n\n      val[x].push_back(i);\n    }\n  }\n\n  DSU dsu(N + 100);\n\n  for (int x = 1; x <= m; x++) {\n\n    for (int i : val[x]) {\n\n      dsu.merge(i, val[x][0]);\n    }\n  }\n\n  if (dsu.get(0) == n) {\n\n    cout << \"YES\\n\";\n\n  } else {\n\n    cout << \"NO\\n\";\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define LLMAX (1ll << 60) - 1\n\n#define INTMAX (1 << 30) - 1\n\n#define MOD 1000000007\n\n#define NMAX 1000 * 100 + 1\n\n#define numberOfSetBits(S) __builtin_popcount(S)\n\n#define MSET(x, y) memset(x, y, sizeof(x))\n\n#define gcd(a, b) __gcd(a, b)\n\n#define all(x) x.begin(), x.end()\n\n#define isOn(S, j) (S & (1 << j))\n\n#define endl '\\n'\n\n#define setBit(S, j) (S |= (1 << j))\n\n#define clearBit(S, j) (S &= ~(1 << j))\n\n#define toggleBit(S, j) (S ^= (1 << j))\n\n#define print(x)                                                               \\\n  for (auto it : x)                                                            \\\n    cout << it << ' ';                                                         \\\n  cout << endl;\n\n#define printii(x)                                                             \\\n  for (auto it : x)                                                            \\\n    cout << it.F << ' ' << it.S << '\\t';                                       \\\n  cout << endl;\n\n#define in(x, n)                                                               \\\n  for (int e = 0; e < n; e++) {                                                \\\n    ll y;                                                                      \\\n    cin >> y;                                                                  \\\n    x.pb(y);                                                                   \\\n  }\n\n#define vi vector<ll>\n\n#define vvi vector<vi>\n\n#define ii pair<ll, ll>\n\n#define pll pair<ll, ll>\n\n#define vii vector<ii>\n\n#define vvii vector<vii>\n\n#define viii vector<pair<ii, ll>>\n\n#define pb push_back\n\n#define F first\n\n#define S second\n\n#define mp make_pair\n\n#define mc(a, b, c) mp(mp(a, b), c)\n\nstruct DSU\n\n{\n\n  int n, x;\n\n  vi p, r, sz;\n\n  DSU(int N) {\n\n    n = N;\n    x = N - 1;\n    sz.assign(N, 1);\n    p.assign(N, 0);\n    r.assign(N, 1);\n\n    for (int i = 0; i < N; i++)\n      p[i] = i;\n  }\n\n  int find(int i) { return (p[i] == i) ? i : (p[i] = find(p[i])); }\n\n  bool sameset(int i, int j) { return find(i) == find(j); }\n\n  void join(int i, int j)\n\n  {\n\n    int p1 = find(i);\n    int p2 = find(j);\n\n    if (p1 != p2) {\n\n      x--;\n\n      if (r[p1] >= r[p2]) {\n\n        p[p2] = p1;\n\n        sz[p1] += sz[p2];\n\n        if (r[p1] == r[p2])\n\n          r[p1]++;\n\n      }\n\n      else {\n\n        p[p1] = p2;\n\n        sz[p2] += sz[p1];\n      }\n    }\n  }\n\n  void debug() {\n    for (int it : p)\n      cout << it << ' ';\n    cout << endl;\n  }\n\n  int getsize(int i) { return sz[find(i)]; }\n\n  int noOfSets() { return x; }\n};\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  ll n, x, t, m, y, z;\n\n  cin >> n >> m;\n\n  DSU foo(n);\n\n  vvi lang(m);\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> x;\n\n    for (int j = 0; j < x; j++) {\n\n      cin >> y;\n\n      y--;\n\n      lang[y].pb(i);\n    }\n  }\n\n  for (int i = 0; i < m; i++) {\n\n    for (int j = 1; j < lang[i].size(); j++) {\n\n      foo.join(lang[i][j], lang[i][j - 1]);\n    }\n  }\n\n  cout << (foo.noOfSets() ? \"NO\" : \"YES\");\n\n  return 0;\n}"}
{"fast_code_id":"9b703979eacbbb7cc3545633b42c3d6a8515c7c007e033ee416fac6e1cae04a9","fast_id":"5231cfa6ce83496533f817cb1086680cefdb49073c1e042fa616fdee05319c0a","fast_time":0.0188391392,"language":"cpp","measured_fast_code_id":"5231cfa6ce83496533f817cb1086680cefdb49073c1e042fa616fdee05319c0a","measured_slow_code_id":"8b0b8f42f54019f7fe04ddb25245452d25df32c2a1b8fb0a85e67bb92e22f95e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55949","problem_id":"p03370","slow_code_id":"ed0068184ba9f64b7ae57e6850357af26ee5f294f6028828af58f336aa528c00","slow_id":"8b0b8f42f54019f7fe04ddb25245452d25df32c2a1b8fb0a85e67bb92e22f95e","slow_time":0.0508273408,"speedup":2.697965138449638,"stratum":"2-4","sampling_key":"3293e19c3f7b1870a15d7e1e8dbdeb22a6a597d989c6ab2d63cf7cc8b20ab382","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing vi = vector<int>;\n\nusing ii = pair<int, int>;\n\nvector<int> v;\n\nint f[3][3];\n\nint main() {\n\n  int n, m, x;\n\n  cin >> n >> m;\n\n  int minn = 10e6 + 100;\n\n  for (int i = 0; i < n; ++i) {\n\n    cin >> x;\n\n    m -= x;\n\n    minn = min(minn, x);\n  }\n\n  int ans = n;\n\n  ans += m / minn;\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  long long int m[1000000];\n\n  long long int sum = 0, q;\n\n  int x, i, p, z, o;\n\n  scanf(\"%d %d\", &x, &o);\n\n  for (i = 0; i < x; i++)\n\n  {\n\n    scanf(\"%lld\", &m[i]);\n\n    sum = sum + m[i];\n  }\n\n  q = 1000000;\n\n  for (i = 0; i < x; i++)\n\n  {\n\n    if (m[i] < q)\n\n    {\n\n      q = m[i];\n    }\n  }\n\n  if (o == sum)\n\n  {\n\n    printf(\"%d\", x);\n\n  }\n\n  else if (o != sum)\n\n  {\n\n    p = o - sum;\n\n    z = p / q;\n\n    printf(\"%d\", z + x);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"32467d52bf0960202a2731d1b72b86437eacfd823e2abb4ce84a660cae6ba4d7","fast_id":"eb5635a59ee89d8fdbcec0dedde687c68f052f2612541744ab2b683ea20b948e","fast_time":0.1048898628,"language":"cpp","measured_fast_code_id":"eb5635a59ee89d8fdbcec0dedde687c68f052f2612541744ab2b683ea20b948e","measured_slow_code_id":"ffa410f82b0ecd4b9cdbde7e335001b68f4017ee2567629a499a08288ed07990","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55983","problem_id":"p02937","slow_code_id":"d56178e03e29615881d0f6a099cfd38f1b5b376c1089a7b6803a21bc8fff2c44","slow_id":"ffa410f82b0ecd4b9cdbde7e335001b68f4017ee2567629a499a08288ed07990","slow_time":1.4580949151,"speedup":13.901199564730483,"stratum":"8+","sampling_key":"3f141bdec0a8384fa1c3d28f23898477e13f0b07af00f9e97f5ce76cb05010a0","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint dp[100005][30];\n\nint vis[30];\n\nint main()\n\n{\n\n  string s;\n\n  string t;\n\n  cin >> s >> t;\n\n  memset(dp, 0x3f, sizeof(dp));\n\n  for (int i = 0; i < s.length(); i++)\n\n  {\n\n    vis[s[i] - 'a'] = 1;\n  }\n\n  for (int i = s.length() - 2; i >= 0; i--)\n\n  {\n\n    for (int j = 0; j < 26; j++)\n\n    {\n\n      dp[i + 1][j] = dp[i + 2][j];\n    }\n\n    dp[i + 1][s[i + 1] - 'a'] = i + 2;\n  }\n\n  for (int j = 0; j < 26; j++)\n\n  {\n\n    dp[0][j] = dp[1][j];\n  }\n\n  dp[0][s[0] - 'a'] = 1;\n\n  long long nowl = 0, nowr = 0;\n\n  for (int i = 0; i < t.length(); i++)\n\n  {\n\n    if (!vis[t[i] - 'a'])\n\n    {\n\n      cout << \"-1\" << endl;\n\n      return 0;\n    }\n\n    if (dp[nowl][t[i] - 'a'] == 0x3f3f3f3f)\n\n    {\n\n      nowr++;\n\n      nowl = dp[0][t[i] - 'a'];\n\n    }\n\n    else\n\n    {\n\n      nowl = dp[nowl][t[i] - 'a'];\n    }\n  }\n\n  cout << nowl + nowr * s.length();\n}","fast_code":"#include <iostream>\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nchar s[100005], t[100005];\n\nvector<int> pos[26];\n\nint slen, tlen;\n\nbool have[26];\n\nint main()\n\n{\n\n  scanf(\"%s%s\", s, t);\n\n  slen = strlen(s);\n\n  tlen = strlen(t);\n\n  for (int i = 0; i < tlen; ++i) {\n\n    have[t[i] - 'a'] = true;\n  }\n\n  for (int i = 0; i < slen; ++i) {\n\n    pos[s[i] - 'a'].push_back(i);\n\n    have[s[i] - 'a'] = false;\n  }\n\n  for (int i = 0; i < 26; ++i) {\n\n    if (have[i]) {\n\n      printf(\"-1\\n\");\n      return 0;\n    }\n  }\n\n  long long ans = 1, now = 0;\n\n  for (int i = 0; i < tlen;) {\n\n    auto np = lower_bound(pos[t[i] - 'a'].begin(),\n\n                          pos[t[i] - 'a'].end(), now % slen);\n\n    if (np == pos[t[i] - 'a'].end()) {\n\n      now = (now / slen + 1) * slen;\n      continue;\n    }\n\n    now = now / slen * slen + *np;\n\n    if (now >= ans) {\n\n      ans = now + 1;\n      ++i;\n      ++now;\n      continue;\n    }\n\n    ++i;\n    ++now;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"c929abbc60af7817288eb14e64cb7bb700c6accf93c7640a8b5686b79117a8a2","fast_id":"a4650bec019307bff0a717e460b82ea76d2b65b26f12026857caa9306fcbf870","fast_time":0.0019512602,"language":"cpp","measured_fast_code_id":"a4650bec019307bff0a717e460b82ea76d2b65b26f12026857caa9306fcbf870","measured_slow_code_id":"64880d2aba1f4a90562169a94d7c31d0cbc780531bb08944f270050cf32a931c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_55999","problem_id":"p03912","slow_code_id":"98a1dc7c853b660fb1622f6cacf4971a17438e236c3753965033a3d2a8be8e7c","slow_id":"64880d2aba1f4a90562169a94d7c31d0cbc780531bb08944f270050cf32a931c","slow_time":0.00390906,"speedup":2.003351475113365,"stratum":"2-4","sampling_key":"8d70e0cf7ca5212378541496d15e3c77b0edb8a623307efd8ec9765127794a67","slow_code":"\n\n#pragma GCC optimize(\"Ofast\")\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <queue>\n\n#include <vector>\n\n#include <bitset>\n\n#include <cmath>\n\n#include <limits>\n\n#include <iostream>\n\n#include <map>\n\n#include <tuple>\n\nusing namespace std;\n\n#define INF 3e18 + 7\n\n#define MAX 100000\n\n#define MOD 1000000007\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\n#define bit(n, k) ((n >> k) & 1)\n\n#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)\n\nstruct edge {\n  ll to, cost, val;\n};\n\ntemplate <class T, class U> bool chmin(T &a, const U &b) {\n  if (a <= b)\n    return false;\n  a = b;\n  return true;\n}\n\ntemplate <class T, class U> bool chmax(T &a, const U &b) {\n  if (a >= b)\n    return false;\n  a = b;\n  return true;\n}\n\nint S[110000], Z[110000];\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  int N, M, X;\n\n  cin >> N >> M;\n\n  vector<int> V[110000];\n\n  for (int i = 0; i < N; i++) {\n\n    cin >> X;\n\n    V[X % M].push_back(X);\n  }\n\n  for (int i = 0; i < M; i++) {\n\n    sort(V[i].begin(), V[i].end());\n\n    S[i] = (int)V[i].size();\n\n    int count = 1;\n\n    for (int j = 0; j < S[i] - 1; j++) {\n\n      if (V[i][j] == V[i][j + 1])\n        count++;\n\n      else {\n\n        Z[i] += count - count % 2;\n\n        count = 1;\n      }\n    }\n\n    Z[i] += count - count % 2;\n  }\n\n  int count = 0;\n\n  for (int i = 0; i <= M / 2; i++) {\n\n    if (i == 0 || i * 2 == M) {\n\n      count += S[i] / 2;\n\n      continue;\n    }\n\n    count += min(S[i], S[M - i]);\n\n    if (S[i] > S[M - i]) {\n\n      S[i] -= S[M - i];\n\n      count += min(Z[i], S[i]) / 2;\n\n    } else {\n\n      S[M - i] -= S[i];\n\n      count += min(Z[M - i], S[M - i]) / 2;\n    }\n  }\n\n  cout << count << endl;\n}","fast_code":"#pragma GCC optimize(\"Ofast\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<int, ll> pil;\n\ntypedef pair<ll, int> pli;\n\ntypedef pair<ll, ll> pll;\n\ntemplate <class T, class U> constexpr bool chmin(T &a, const U b) {\n  if (a <= b)\n    return false;\n  a = b;\n  return true;\n}\n\ntemplate <class T, class U> constexpr bool chmax(T &a, const U b) {\n  if (a >= b)\n    return false;\n  a = b;\n  return true;\n}\n\n#define bit(n, k) ((n >> k) & 1)\n\ntemplate <class T>\n\nvoid Vout(vector<T> &V) {\n\n  cout << \"\\nstart\\n\";\n\n  const int sz = V.size();\n\n  for (int i = 0; i < sz; i++) {\n\n    cout << i << \" \" << V[i] << '\\n';\n  }\n\n  cout << \"end\\n\" << endl;\n}\n\nconstexpr int MAX = 1 << 30;\n\nconstexpr ll INF = 1LL << 62;\n\nconstexpr int MOD = 1e9 + 7;\n\nint dx[] = {1, -1, 0, 0}, dy[] = {0, 0, -1, 1};\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  int N, M;\n\n  cin >> N >> M;\n\n  vector<int> V(N);\n\n  for (int i = 0; i < N; i++)\n    cin >> V[i];\n\n  int same[110000] = {}, num[110000] = {};\n\n  sort(V.begin(), V.end());\n\n  for (int i = 0; i < N - 1; i++) {\n\n    if (V[i] == V[i + 1]) {\n\n      same[V[i] % M]++;\n\n      i++;\n    }\n  }\n\n  for (int i = 0; i < N; i++) {\n\n    num[V[i] % M]++;\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i <= M / 2; i++) {\n\n    if (i * 2 % M == 0) {\n\n      ans += num[i] / 2;\n\n    } else {\n\n      int x = M - i;\n\n      int n = min(num[i], num[x]);\n\n      num[i] -= n;\n      num[x] -= n;\n\n      ans += n;\n\n      ans += min(num[i] / 2, same[i]);\n\n      ans += min(num[x] / 2, same[x]);\n    }\n  }\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"69bcf340dfd3195fad97121ac1544438803a3d63adec4ae25f00fad92eb92b98","fast_id":"ed1de6e48bb55085ce77770d7484da3594f98f06ddfd1a2e8068d3954bb4ba19","fast_time":0.0067117728,"language":"cpp","measured_fast_code_id":"ed1de6e48bb55085ce77770d7484da3594f98f06ddfd1a2e8068d3954bb4ba19","measured_slow_code_id":"511131f4f83636e52e3113f3df8b67bfabe44f7e5d5603d6f29f6295916fe5c3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56023","problem_id":"p03441","slow_code_id":"ef45d47227cdb3289c23d7f5c4d9774b264038f231151b7ddaaac9539f5da214","slow_id":"511131f4f83636e52e3113f3df8b67bfabe44f7e5d5603d6f29f6295916fe5c3","slow_time":0.1263108464,"speedup":18.819297101355996,"stratum":"8+","sampling_key":"1cad45df98a9e30be01ef0b880cbb9cb620aef4ad468893c5c756d7d6dc8d90f","slow_code":"\n\n#include <iostream>\n\n#include <cctype>\n\n#include <queue>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <sstream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <vector>\n\n#include <ctime>\n\n#include <cstdlib>\n\n#include <map>\n\n#include <utility>\n\n#include <iomanip>\n\n#include <set>\n\n#include <stack>\n\n#define lowbit(i) ((i) & (-i))\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\ntypedef vector<string> vss;\n\ntypedef vector<int> vii;\ntypedef vector<pii> vpi;\n\ntypedef vector<ll> vll;\ntypedef vector<pll> vpl;\ntypedef long double ld;\n\ntypedef unsigned long long ul;\ntypedef queue<int> qii;\ntypedef queue<pii> qpi;\n\nint n, x, y, dp[100005], res, t;\n\nvii v[100005];\n\nint mx = 0, deg[1000005];\n\nqii q;\n\nint main()\n\n{\n\n  cin >> n;\n\n  for (int i = 1; i < n; i++) {\n\n    cin >> x >> y;\n\n    v[x].push_back(y);\n\n    v[y].push_back(x);\n\n    deg[x]++;\n\n    deg[y]++;\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    if (v[i].size() > mx)\n\n      mx = v[i].size();\n  }\n\n  if (mx <= 2) {\n\n    puts(\"1\");\n\n    return 0;\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    if (deg[i] == 1)\n      q.push(i);\n  }\n\n  while (!q.empty()) {\n\n    int p = q.front(), to = -1;\n    q.pop();\n\n    for (int i = 0; i < v[p].size(); i++) {\n\n      to = v[p][i];\n\n      if (deg[to] != 1)\n        break;\n    }\n\n    if (deg[to] == 2) {\n\n      deg[to] = 1;\n\n      q.push(to);\n    }\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    if (deg[i] == 1)\n      continue;\n\n    t = 0;\n\n    for (int j = 0; j < v[i].size(); j++) {\n\n      int to = v[i][j];\n\n      if (deg[to] == 1)\n        t++;\n    }\n\n    res += max(0, t - 1);\n  }\n\n  cout << res << '\\n';\n\n  return 0;\n}","fast_code":"#include <cmath>\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nstruct node {\n\n  int ne, tow;\n};\n\nnode pth[200000 + 10];\n\nint mp[100000 + 10], szp;\n\nint vis[100000 + 10];\n\nint n;\n\nint deg[100000 + 10];\n\nint root = -1;\n\nint son[100000 + 10];\n\nint bro[100000 + 10];\n\nint dp[100000 + 10];\n\nint left[100000 + 10];\n\nvoid addpath(int i, int j) {\n\n  ++szp;\n\n  pth[szp].ne = mp[i];\n\n  pth[szp].tow = j;\n\n  mp[i] = szp;\n\n  deg[i]++;\n}\n\nvoid dfs1(int i, int j) {\n\n  if (vis[i] != 0)\n    return;\n\n  vis[i] = j;\n\n  int po = mp[i];\n\n  while (po != -1) {\n\n    if (vis[pth[po].tow] == 0) {\n\n      bro[pth[po].tow] = son[i];\n\n      son[i] = pth[po].tow;\n    }\n\n    dfs1(pth[po].tow, j + 1);\n\n    po = pth[po].ne;\n  }\n}\n\nvoid dfs2(int i) {\n\n  int j = son[i];\n\n  if (j == -1) {\n\n    left[i] = 1;\n\n    dp[i] = 1;\n\n    return;\n  }\n\n  while (j != -1) {\n\n    dfs2(j);\n\n    left[i] += left[j];\n\n    dp[i] += dp[j];\n\n    j = bro[j];\n  }\n\n  j = son[i];\n\n  if (j != -1 && bro[j] != -1)\n\n    while (j != -1) {\n\n      if (dp[j] == 1 && left[j] == 1) {\n\n        dp[i]--;\n\n        return;\n      }\n\n      j = bro[j];\n    }\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int f1 = 0; f1 < n; f1++) {\n\n    mp[f1] = -1;\n\n    vis[f1] = 0;\n  }\n\n  for (int f1 = 1; f1 < n; f1++) {\n\n    int i, j;\n\n    scanf(\"%d%d\", &i, &j);\n\n    addpath(i, j);\n\n    addpath(j, i);\n\n    if (deg[i] > 2)\n      root = i;\n\n    if (deg[j] > 2)\n      root = j;\n  }\n\n  if (root == -1) {\n\n    printf(\"1\\n\");\n\n    return 0;\n  }\n\n  for (int f1 = 0; f1 < n; f1++) {\n\n    son[f1] = -1;\n\n    bro[f1] = -1;\n\n    left[f1] = 0;\n\n    dp[f1] = 0;\n  }\n\n  dfs1(root, 1);\n\n  dfs2(root);\n\n  printf(\"%d\\n\", dp[root]);\n}\n"}
{"fast_code_id":"19ccea7e329ba5cf15fdd5f4d7227d370813bfbe40946a2646fb3a6215f56d21","fast_id":"d247a45150fabb38de1512fe6fe6d49f6b5bdc9cdef251d42bb3701cd19fe021","fast_time":0.0220254858,"language":"cpp","measured_fast_code_id":"d247a45150fabb38de1512fe6fe6d49f6b5bdc9cdef251d42bb3701cd19fe021","measured_slow_code_id":"c3436ebc6a1391def007ad3abdb5527f4241e8a9422965957f2d62879d25f903","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56065","problem_id":"p03172","slow_code_id":"9ee93eeaa013eb56879938c644e77b54bdc2e79d555136de21e37a04e11ce967","slow_id":"c3436ebc6a1391def007ad3abdb5527f4241e8a9422965957f2d62879d25f903","slow_time":0.0650806505,"speedup":2.9547884251433856,"stratum":"2-4","sampling_key":"adc12d7bd876004ac20de887716c17b404af8fbeb3df2907c9e0efd7d67fbb2a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing PII = pair<int, int>;\n\nusing VI = vector<int>;\n\nconst int mod = 1e9 + 7;\n\ninline int add(int u, int v) { return u + v >= mod ? u + v - mod : u + v; }\n\ninline int mul(ll u, int v) { return u * v % mod; }\n\ninline int sub(int u, int v) { return add(u, mod - v); }\n\nconst int N = 105, K = 1e5 + 5;\n\nint ways[2][K];\n\nint pre[2][K];\n\nvoid compute_pre(int idx) {\n\n  pre[idx][0] = ways[idx][0];\n\n  for (int i = 1; i < K; i++) {\n\n    pre[idx][i] = add(pre[idx][i - 1], ways[idx][i]);\n  }\n}\n\nint main() {\n\n#ifdef LOCAL_EXEC\n\n#else\n\n  ios_base::sync_with_stdio(false);\n  cin.tie(NULL);\n\n#endif\n\n  int n, k;\n  cin >> n >> k;\n\n  ways[0][0] = 1;\n\n  compute_pre(0);\n\n  for (int i = 1; i <= n; i++) {\n\n    int a;\n    cin >> a;\n\n    int cur = i & 1, prv = (i & 1) ^ 1;\n\n    for (int x = 0; x <= k; x++) {\n\n      ways[cur][x] = sub(pre[prv][x], x > a ? pre[prv][x - a - 1] : 0);\n    }\n\n    compute_pre(cur);\n  }\n\n  cout << ways[n & 1][k] << endl;\n\n  return 0;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing ii = pair<int, int>;\n\nusing iii = pair<ii, int>;\n\n#define vt vector\n\n#define pq priority_queue\n\n#define pb push_back\n\n#define mp make_pair\n\n#define fi first\n\n#define se second\n\nconst int MOD = 1e9 + 7;\n\nconst int INF = 2e9;\n\nconst int N = 1e2 + 5;\n\nconst int K = 1e5 + 5;\n\nint n, k;\n\nint a[N];\n\nint dp[N][K];\n\nint add(int x, int y) {\n\n  int ret = x + y;\n\n  return ret >= MOD ? ret % MOD : ret;\n}\n\nint sub(int x, int y) {\n\n  int ret = x - y;\n\n  return ret < 0 ? ret + MOD : ret;\n}\n\nvoid computeDP() {\n\n  dp[0][0] = 1;\n\n  for (int idx = 1; idx <= n; idx++) {\n\n    for (int candy = 0; candy <= k; candy++) {\n\n      int &sol = dp[idx][candy];\n\n      sol = add(dp[idx][candy - 1], dp[idx - 1][candy]);\n\n      sol = sub(sol, (candy - a[idx] - 1 >= 0 ? dp[idx - 1][candy - a[idx] - 1] : 0));\n    }\n  }\n}\n\nvoid solve() {\n\n  int T = 1;\n\n#ifdef multicase\n\n  cin >> T;\n\n#endif\n\n  for (int tc = 1; tc <= T; tc++) {\n\n    cin >> n >> k;\n\n    for (int i = 1; i <= n; i++) {\n\n      cin >> a[i];\n    }\n\n    computeDP();\n\n    cout << dp[n][k] << \"\\n\";\n  }\n}\n\nint main() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n  cout.tie(0);\n\n  solve();\n}\n"}
{"fast_code_id":"fdecc8fbf6ec119d674977e5cec67c05293e879f20c4099e569fab265ad5bcc4","fast_id":"83dce00b45bba9db493144d1d8f2bb833d72b4e198dc9087b97e123ed3e8dc1c","fast_time":0.008746708,"language":"cpp","measured_fast_code_id":"83dce00b45bba9db493144d1d8f2bb833d72b4e198dc9087b97e123ed3e8dc1c","measured_slow_code_id":"e47d28a7b61f1830b12b830b6e4ed15fb26b5252f33649b66b3239f7d7ca67c3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5609","problem_id":"p01342","slow_code_id":"d8f51b96f8f8a6861860f2e80b01de99f8f6f8709e7b4328d6f945f0454745f8","slow_id":"e47d28a7b61f1830b12b830b6e4ed15fb26b5252f33649b66b3239f7d7ca67c3","slow_time":0.0356997115,"speedup":4.0815026064663416,"stratum":"4-8","sampling_key":"2914efa1f3e5e5b9d63364f4414d1632b09e95f418a57f3253edfdf2fe6d44bd","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <algorithm>\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\nusing namespace std;\n\nbool opx[60][60], opy[60][60];\n\nbool vis[60][60];\n\nint W, H, N;\n\nint dir[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};\n\nstruct node\n\n{\n\n  int x, y, step;\n\n  node(){};\n\n  node(int _x, int _y, int _step) {\n\n    x = _x;\n    y = _y;\n    step = _step;\n  }\n};\n\nnode S, E;\n\nqueue<node> q;\n\nint bfs()\n\n{\n\n  while (!q.empty())\n    q.pop();\n\n  q.push(S);\n\n  memset(vis, 0, sizeof(vis));\n\n  vis[S.x][S.y] = 1;\n\n  while (!q.empty()) {\n\n    node now = q.front();\n\n    q.pop();\n\n    for (int i = 0; i < 4; i++) {\n\n      if (i == 0 && opx[now.x + 1][now.y])\n        continue;\n\n      if (i == 1 && opx[now.x][now.y])\n        continue;\n\n      if (i == 2 && opy[now.x][now.y + 1])\n        continue;\n\n      if (i == 3 && opy[now.x][now.y])\n        continue;\n\n      node sun;\n\n      sun.x = now.x + dir[i][0];\n\n      sun.y = now.y + dir[i][1];\n\n      if (vis[sun.x][sun.y] || (sun.x < 0) || (sun.x >= W) || (sun.y < 0) || (sun.y >= H))\n\n        continue;\n\n      vis[sun.x][sun.y] = 1;\n\n      sun.step = now.step + 1;\n\n      if (sun.x == E.x && sun.y == E.y)\n        return sun.step;\n\n      q.push(sun);\n    }\n  }\n\n  return -1;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d%d\", &W, &H, &N);\n\n  memset(opx, 0, sizeof(opx));\n\n  memset(opy, 0, sizeof(opy));\n\n  for (int i = 1; i <= N; i++) {\n\n    int t1, t2, t3, t4;\n\n    scanf(\"%d%d%d%d\", &t1, &t2, &t3, &t4);\n\n    if (t1 == t3) {\n\n      if (t4 < t2)\n        swap(t2, t4);\n\n      for (int j = t2; j < t4; j++) {\n\n        opx[t1][j] = 1;\n      }\n\n    }\n\n    else if (t2 == t4) {\n\n      if (t3 < t1)\n        swap(t1, t3);\n\n      for (int j = t1; j < t3; j++) {\n\n        opy[j][t2] = 1;\n      }\n    }\n  }\n\n  scanf(\"%d%d%d%d\", &S.x, &S.y, &E.x, &E.y);\n\n  S.step = 0;\n\n  int num1, ans = 0;\n\n  num1 = bfs();\n\n  for (int i = 1; i < W; i++) {\n\n    for (int j = 0; j < H; j++) {\n\n      if (!opx[i][j]) {\n\n        opx[i][j] = 1;\n\n        ans = max(ans, bfs() - num1);\n\n        opx[i][j] = 0;\n      }\n    }\n  }\n\n  for (int i = 0; i < W; i++) {\n\n    for (int j = 1; j < H; j++) {\n\n      if (!opy[i][j]) {\n\n        opy[i][j] = 1;\n\n        ans = max(ans, bfs() - num1);\n\n        opy[i][j] = 0;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <math.h>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define maxw 55\n\n#define maxn 1010\n\nint n;\n\nint w;\n\nint h;\n\nbool wall[maxw][maxw][4];\n\nint mp[maxw][maxw];\n\nint ix, iy;\n\nint ox, oy;\n\nint que[maxw * maxw][2];\n\nint dir[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\n\nint bfs()\n\n{\n\n  memset(mp, -1, sizeof(mp));\n\n  mp[ix][iy] = 0;\n\n  int head = 0, tail = 0;\n\n  tail++;\n\n  que[tail][0] = ix;\n\n  que[tail][1] = iy;\n\n  while (head < tail)\n\n  {\n\n    ++head;\n\n    int x = que[head][0];\n\n    int y = que[head][1];\n\n    for (int i = 0; i < 4; i++) {\n\n      if (!wall[x][y][i]) {\n\n        int xx = x + dir[i][0];\n\n        int yy = y + dir[i][1];\n\n        if (mp[xx][yy] == -1) {\n\n          mp[xx][yy] = mp[x][y] + 1;\n\n          if (xx == ox && yy == oy)\n\n            return mp[xx][yy];\n\n          tail++;\n\n          que[tail][0] = xx;\n\n          que[tail][1] = yy;\n        }\n      }\n    }\n  }\n\n  return mp[ox][oy];\n}\n\nvoid init()\n\n{\n\n  memset(wall, 0, sizeof(wall));\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int sx, sy, dx, dy;\n\n    scanf(\"%d%d%d%d\", &sx, &sy, &dx, &dy);\n\n    if (sx == dx && sy == dy)\n\n      continue;\n\n    if (sx == dx) {\n\n      if (sy > dy)\n\n        swap(sy, dy);\n\n      for (int j = max(0, sy); j < min(h, dy); j++) {\n\n        if (sx - 1 >= 0) {\n\n          wall[sx - 1][j][1] = 1;\n        }\n\n        if (sx < w) {\n\n          wall[sx][j][3] = 1;\n        }\n      }\n    }\n\n    if (sy == dy) {\n\n      if (sx > dx)\n\n        swap(sx, dx);\n\n      for (int j = max(sx, 0); j < min(dx, w); j++) {\n\n        if (sy - 1 >= 0) {\n\n          wall[j][sy - 1][0] = 1;\n        }\n\n        if (sy < h) {\n\n          wall[j][sy][2] = 1;\n        }\n      }\n    }\n  }\n\n  for (int j = 0; j < h; j++) {\n\n    wall[0][j][3] = 1;\n\n    wall[w - 1][j][1] = 1;\n  }\n\n  for (int i = 0; i < w; i++) {\n\n    wall[i][0][2] = 1;\n\n    wall[i][h - 1][0] = 1;\n  }\n\n  scanf(\"%d%d\", &ix, &iy);\n\n  scanf(\"%d%d\", &ox, &oy);\n\n  return;\n}\n\nbool check(int x, int y)\n\n{\n\n  return (x >= 0 && x < w && y >= 0 && y < h);\n}\n\nint main()\n\n{\n\n  while (scanf(\"%d%d%d\", &w, &h, &n) != EOF)\n\n  {\n\n    init();\n\n    if (ix == ox && iy == oy) {\n\n      puts(\"0\");\n\n      continue;\n    }\n\n    int tmp = bfs();\n\n    int ans = 0;\n\n    for (int i = 0; i < w; i++)\n\n      for (int j = 0; j < h; j++)\n\n        for (int k = 0; k < 4; k++)\n\n          if (!wall[i][j][k]) {\n\n            wall[i][j][k] = 1;\n\n            int ii = i + dir[k][0];\n\n            int jj = j + dir[k][1];\n\n            int kk = (k + 2) % 4;\n\n            if (check(ii, jj))\n\n              wall[ii][jj][kk] = 1;\n\n            int ttt = bfs();\n\n            if (ttt >= 0) {\n\n              if (ttt - tmp > ans)\n\n                ans = ttt - tmp;\n            }\n\n            wall[i][j][k] = 0;\n\n            if (check(ii, jj))\n\n              wall[ii][jj][kk] = 0;\n          }\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"1e553f72715a57a1553c6610823db20271d87a327699eb3abd3d5d5a91a3373d","fast_id":"7cf39148a2aa5110682ed38d359cbb8fa4e5cbb3f5db1d430becce584b11bd05","fast_time":0.0175627707,"language":"cpp","measured_fast_code_id":"7cf39148a2aa5110682ed38d359cbb8fa4e5cbb3f5db1d430becce584b11bd05","measured_slow_code_id":"95b9da3915b19087abf15799c10810bc4d37cc82f1f7119b56c884e5b41f75df","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_561","problem_id":"p03606","slow_code_id":"c8278221cc98161234e17da496402f60124c32a7ae9e16bec2dbdadd1b3b170c","slow_id":"95b9da3915b19087abf15799c10810bc4d37cc82f1f7119b56c884e5b41f75df","slow_time":0.4611332197,"speedup":26.25629108167995,"stratum":"8+","sampling_key":"042292a8974ec58e2ceeac95cdc461e18a0fde5d636dedfd2d4cfa1b58c18084","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint ans, n, a, b, c[1000001];\n\nint main() {\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a >> b;\n\n    for (int j = a; j <= b; j++)\n\n      c[j] = 1;\n  }\n\n  for (int i = 0; i < 1000001; i++) {\n\n    if (c[i] == 1)\n\n      ans++;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cmath>\n\nusing namespace std;\n\nint l, r, ans, n;\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; ++i) {\n\n    scanf(\"%d%d\", &l, &r);\n\n    ans += r - l + 1;\n  }\n\n  printf(\"%d\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"728f6d9c1fa2af18a623df4f2e4984af700be8f735e453800ceeca5d214cb2f8","fast_id":"174501985622a6ed458befa7422708fde23836fc1698e19ec62251d46080565d","fast_time":0.0468289719,"language":"cpp","measured_fast_code_id":"174501985622a6ed458befa7422708fde23836fc1698e19ec62251d46080565d","measured_slow_code_id":"51de79481d9071f6a9ec56ee7f0b751716fbbc009339bc37b3ccd6b046dd3f56","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56168","problem_id":"p03824","slow_code_id":"3dbed121c8553ec53f9b434685d4628715f44a351b4baa4e6a958d4965d73907","slow_id":"51de79481d9071f6a9ec56ee7f0b751716fbbc009339bc37b3ccd6b046dd3f56","slow_time":0.1164393482,"speedup":2.4864809855029084,"stratum":"2-4","sampling_key":"f82bc9e98fda6faa0f9ad412c3bc1181305f80c535942435cf52026eea52201f","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <vector>\n\n#include <algorithm>\n\n#define MAXN 100000\n\nusing namespace std;\n\ntypedef long long LL;\n\nvector<int> G[MAXN + 5];\n\nint N, ans;\n\nint cnt[MAXN + 5][21];\n\nvoid DFS(int u, int fa)\n\n{\n\n  for (int i = 0; i < (int)G[u].size(); i++)\n\n  {\n\n    int v = G[u][i];\n\n    if (v == fa)\n\n      continue;\n\n    DFS(v, u);\n\n    for (int j = 0; j < 20; j++)\n\n      cnt[u][j] += cnt[v][j];\n  }\n\n  int val = 0;\n\n  for (int i = 20; i >= 0; i--)\n\n    if (cnt[u][i] >= 2)\n\n    {\n\n      val = i + 1;\n\n      break;\n    }\n\n  while (cnt[u][val] == 1)\n\n    val++;\n\n  ans = max(ans, val);\n\n  cnt[u][val]++;\n\n  for (int i = 0; i < val; i++)\n\n    cnt[u][i] = 0;\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &N);\n\n  int u, v;\n\n  for (int i = 1; i < N; i++)\n\n  {\n\n    scanf(\"%d %d\", &u, &v);\n\n    G[u].push_back(v);\n\n    G[v].push_back(u);\n  }\n\n  DFS(1, -1);\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (a), i##_end_ = (b); i <= i##_end_; ++i)\n\n#define drep(i, a, b) for (int i = (a), i##_end_ = (b); i >= i##_end_; --i)\n\n#define clar(a, b) memset((a), (b), sizeof(a))\n\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n\ntemplate <typename T> bool chkmax(T &a, const T &b) {\n  return a < b ? a = b, true : false;\n}\n\ntemplate <typename T> bool chkmin(T &a, const T &b) {\n  return a > b ? a = b, true : false;\n}\n\ntemplate <typename T> T sgn(const T &a) { return (a > T(0)) - (a < T(0)); }\n\ntypedef long long LL;\n\ntypedef long double LD;\n\nconst int BUF_SIZE = (int)2e7 + 10;\n\nstruct fastIO {\n\n  char buf[BUF_SIZE], buf1[BUF_SIZE];\n\n  int cur, cur1;\n  FILE *in, *out;\n\n  fastIO() {\n    cur = BUF_SIZE, in = stdin, out = stdout;\n    cur1 = 0;\n    __builtin_prefetch(buf);\n    __builtin_prefetch(buf1);\n  }\n\n  inline char getchar() {\n    if (cur == BUF_SIZE)\n      fread(buf, BUF_SIZE, 1, in), cur = 0;\n    return *(buf + (cur++));\n  }\n\n  inline void putchar(char ch) {\n    *(buf1 + (cur1++)) = ch;\n    if (cur1 == BUF_SIZE)\n      fwrite(buf1, BUF_SIZE, 1, out), cur1 = 0;\n  }\n\n  inline int flush() {\n    if (cur1 > 0)\n      fwrite(buf1, cur1, 1, out);\n    return cur1 = 0;\n  }\n\n} IO;\n\n#define getchar IO.getchar\n\nLL read() {\n\n  LL x = 0, flag = 1;\n\n  char ch = getchar();\n\n  for (; !isdigit(ch); ch = getchar())\n    if (ch == '-')\n      flag *= -1;\n\n  for (; isdigit(ch); ch = getchar())\n    x = x * 10 + ch - 48;\n\n  return x * flag;\n}\n\nvoid write(LL x) {\n\n  if (x < 0)\n    putchar('-'), x = -x;\n\n  if (x >= 10)\n    write(x / 10);\n\n  putchar(x % 10 + '0');\n}\n\nconst int Maxn = 1e5 + 9;\n\nstruct edge {\n\n  int to, nxt;\n\n} g[Maxn << 1];\n\nint n, head[Maxn];\n\nvoid add(int u, int v) {\n\n  static int e = 0;\n\n  g[++e] = (edge){v, head[u]}, head[u] = e;\n}\n\nint ans = 0;\n\nstatic int bit[Maxn];\n\nvoid dfs(int u, int pa) {\n\n  int same = 0;\n\n  for (int i = head[u]; ~i; i = g[i].nxt) {\n\n    int v = g[i].to;\n\n    if (v != pa) {\n\n      dfs(v, u);\n\n      same |= bit[u] & bit[v];\n\n      bit[u] |= bit[v];\n    }\n  }\n\n  int mx = same ? 32 - __builtin_clz(same) : 0;\n\n  while (bit[u] & (1 << mx))\n    ++mx;\n\n  bit[u] |= (1 << mx);\n\n  chkmax(ans, mx), bit[u] = bit[u] >> mx << mx;\n}\n\nint main() {\n\n  clar(head, -1);\n\n  n = read();\n\n  rep(i, 1, n - 1) {\n\n    int u = read(), v = read();\n\n    add(u, v), add(v, u);\n  }\n\n  dfs(1, 0);\n\n  cout << ans << endl;\n\n#ifdef Qrsikno\n\n  debug(\"\\nRunning time: %.3lf(s)\\n\", clock() * 1.0 / CLOCKS_PER_SEC);\n\n#endif\n\n  return 0;\n}\n"}
{"fast_code_id":"4f9b9e98ceb77439c393b7061d7a9dd5f1aeba405aa75c9d7dd636f3fe42b0df","fast_id":"00075911efe25f63df6990667ba5980b64f90a5f217313c4d1960263a4e21951","fast_time":0.080403893,"language":"cpp","measured_fast_code_id":"00075911efe25f63df6990667ba5980b64f90a5f217313c4d1960263a4e21951","measured_slow_code_id":"275db80dc91a15259142dd599d08206c4c4a415168286e99b12886263efcb99f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56196","problem_id":"p03972","slow_code_id":"ea214b74be1c8f09c28808512e4104fc4b15d3a5475825db6cde7fdf916d5943","slow_id":"275db80dc91a15259142dd599d08206c4c4a415168286e99b12886263efcb99f","slow_time":0.2103023148,"speedup":2.615573785712092,"stratum":"2-4","sampling_key":"2198e15118fb79ac0ae4244cf285c9babf67469f69764e4fdee4872063d5c756","slow_code":"#include <bits/stdc++.h>\n\n#define range(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rep(i, b) for (int i = 0; i < (b); i++)\n\n#define all(a) (a).begin(), (a).end()\n\n#define debug(x) cout << \"debug \" << x << endl;\n\n#define INF (1 << 29)\n\nusing namespace std;\n\nint main() {\n\n  int w, h;\n\n  vector<long long> a;\n\n  vector<long long> b;\n\n  long long asum[100005] = {0}, bsum[100005] = {0};\n\n  cin >> w >> h;\n\n  rep(i, w) {\n\n    long long inp;\n\n    cin >> inp;\n\n    a.emplace_back(inp);\n  }\n\n  rep(i, h) {\n\n    long long inp;\n\n    cin >> inp;\n\n    b.emplace_back(inp);\n  }\n\n  sort(all(a));\n\n  sort(all(b));\n\n  asum[0] = a[0];\n\n  bsum[0] = b[0];\n\n  range(i, 1, w) { asum[i] = asum[i - 1] + a[i]; }\n\n  range(i, 1, h) { bsum[i] = bsum[i - 1] + b[i]; }\n\n  long long sum = 0;\n\n  rep(i, h) {\n\n    long long p = upper_bound(a.begin(), a.end(), b[i]) - a.begin();\n\n    if (p - 1 < 0) {\n\n      sum += w * b[i];\n\n    } else if (p == w) {\n\n      sum += asum[p - 1];\n\n    } else {\n\n      sum += asum[p - 1];\n\n      sum += (w - p) * b[i];\n    }\n  }\n\n  cout << sum + asum[w - 1] + bsum[h - 1] << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define range(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rep(i, b) for (int i = 0; i < (b); i++)\n\n#define all(a) (a).begin(), (a).end()\n\n#define show(x) cerr << #x << \" = \" << (x) << endl;\n\nusing namespace std;\n\nint main() {\n\n  int w, h;\n\n  cin >> w >> h;\n\n  vector<long long> x(w), y(h);\n\n  rep(i, w) { cin >> x[i]; }\n\n  rep(i, h) { cin >> y[i]; }\n\n  sort(all(x));\n\n  sort(all(y));\n\n  vector<long long> sum(w + 1, 0);\n\n  sum[0] = 0;\n\n  rep(i, w) { sum[i + 1] = sum[i] + x[i]; }\n\n  long long ans = 0;\n\n  rep(i, h) {\n\n    int p = distance(x.begin(), lower_bound(all(x), y[i]));\n\n    ans += sum[p] + (w - p) * y[i];\n  }\n\n  cout << ans + accumulate(all(x), 0LL) + accumulate(all(y), 0LL) << endl;\n}\n"}
{"fast_code_id":"a6c50e3889483dd745a9f7a15068c1c9347ca763360210f705d2dbcefa5ed296","fast_id":"5f521db841eadac16fb8b30f46f740ef989ba8c1efbba8d2cb49ac731835c136","fast_time":0.019509949,"language":"cpp","measured_fast_code_id":"5f521db841eadac16fb8b30f46f740ef989ba8c1efbba8d2cb49ac731835c136","measured_slow_code_id":"3d2e29c27cc3a9b70f5592fe924959a8f9e7c8fb1571d19d626555130d7489cf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56197","problem_id":"p03955","slow_code_id":"88b3fb299618eeb48c3dc85b5e8c5b1ac050dd556d05512bf6c4f98829fe0bd9","slow_id":"3d2e29c27cc3a9b70f5592fe924959a8f9e7c8fb1571d19d626555130d7489cf","slow_time":0.1121795798,"speedup":5.749865353312815,"stratum":"4-8","sampling_key":"25852f34d181f93b93f5be857118a936794784083e0b8f81071c7e129e083ba4","slow_code":"#include <bits/stdc++.h>\n\n#define no                                                                     \\\n  {                                                                            \\\n    puts(\"No\");                                                                \\\n    return 0;                                                                  \\\n  }\n\n#define yes                                                                    \\\n  {                                                                            \\\n    puts(\"Yes\");                                                               \\\n    return 0;                                                                  \\\n  }\n\n#define nc() getchar()\n\nusing namespace std;\n\nconst int N = 300010;\n\ninline int read() {\n\n  char ch = nc();\n  int sum = 0;\n\n  while (!(ch >= '0' && ch <= '9'))\n    ch = nc();\n\n  while (ch >= '0' && ch <= '9')\n    sum = sum * 10 + ch - 48, ch = nc();\n\n  return sum;\n}\n\nint c[N], n;\n\nvoid add(int x, int k) {\n\n  while (x <= n) {\n\n    c[x] += k;\n\n    x += x & -x;\n  }\n}\n\nint query(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += c[x];\n\n    x -= x & -x;\n  }\n\n  return ans;\n}\n\nint a[N], fu[N], s[N];\n\nbool vis[N];\n\nint main() {\n\n  n = read();\n\n  int s1 = 0, s2 = 0;\n\n  for (int i = 1; i <= 3; i++) {\n\n    for (int j = 1; j <= n; j++) {\n\n      int x;\n\n      x = read();\n\n      if (i == 1) {\n\n        if (x % 3 == 0) {\n\n          a[j] = x / 3;\n\n          fu[j] = 1;\n\n          if (j & 1)\n            s1++;\n\n          else\n            s2++;\n\n        } else {\n\n          if (x % 3 != 1) {\n            no;\n          }\n\n          a[j] = x / 3 + 1;\n        }\n\n        if (vis[a[j]]) {\n          no;\n        }\n\n        if ((j & 1) ^ (a[j] & 1)) {\n          no;\n        }\n\n        vis[a[j]] = 1;\n\n      }\n\n      else {\n\n        if (fu[j]) {\n\n          if (x != a[j] * 3 - i + 1) {\n            no;\n          }\n\n        } else {\n\n          if (x != (a[j] - 1) * 3 + i) {\n            no;\n          }\n        }\n      }\n    }\n  }\n\n  int i;\n\n  if (n & 1)\n    i = n;\n  else\n    i = n - 1;\n\n  for (; i > 0; i -= 2) {\n\n    s2 += query(a[i]);\n\n    add(a[i], 1);\n  }\n\n  if (n & 1)\n    i = n - 1;\n  else\n    i = n;\n\n  memset(c, 0, sizeof(c));\n\n  for (; i > 0; i -= 2) {\n\n    s1 += query(a[i]);\n\n    add(a[i], 1);\n  }\n\n  if (s1 % 2 == 0 && s2 % 2 == 0) {\n    yes;\n  }\n\n  else {\n    no;\n  }\n\n  return 1;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cctype>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\ninline int read(int f = 1, int x = 0, char ch = ' ')\n\n{\n\n  while (!isdigit(ch = getchar()))\n    if (ch == '-')\n      f = -1;\n\n  while (isdigit(ch))\n    x = x * 10 + ch - '0', ch = getchar();\n\n  return f * x;\n}\n\nconst int N = 1e5 + 5;\n\nint n, w[3][N], f[N], h[2];\n\nint main()\n\n{\n\n  n = read();\n\n  for (int i = 0; i < 3; ++i)\n\n    for (int j = 1; j <= n; ++j)\n\n      w[i][j] = read();\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    int a = w[0][i], b = w[1][i], c = w[2][i];\n\n    if (abs(a - b) > 1 || abs(b - c) > 1 || b % 3 != 2 || (b % 6 & i & 1))\n      return puts(\"No\"), 0;\n\n    f[i] = b / 3 + 1, h[i & 1] ^= a > c;\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n    while (f[i] != i)\n      h[i & 1 ^ 1] ^= 1, swap(f[i], f[f[i]]);\n\n  puts(h[0] || h[1] ? \"No\" : \"Yes\");\n\n  return 0;\n}"}
{"fast_code_id":"a11d425820b87fc2cc6a5710cad8a33099b1e6f9e82799061f4b027ae904785d","fast_id":"575e43daaf7237c7b31cdad2ae8036bad1f4f90df20d2e89bbad61f611a7f195","fast_time":0.0001888638,"language":"cpp","measured_fast_code_id":"575e43daaf7237c7b31cdad2ae8036bad1f4f90df20d2e89bbad61f611a7f195","measured_slow_code_id":"4c1bdca155aa7f9ba1ca07d2ab8866cf9ec9d9ee557af7a56aeb89940eb3ccce","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56207","problem_id":"p03557","slow_code_id":"26b35bfb0bb2bc57cf3c4b46c7741b8d9e718e274231dcff700d36774733310d","slow_id":"4c1bdca155aa7f9ba1ca07d2ab8866cf9ec9d9ee557af7a56aeb89940eb3ccce","slow_time":0.0034663626,"speedup":18.35376922417107,"stratum":"8+","sampling_key":"1b2fa152a4d327900ecae745e54e8b54b146f974d934d6444e3fa476d3038437","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define N 100005\n\nusing namespace std;\n\nint n, tot, a[N], b[N], c[N], e[N], d[N * 3];\n\nll ans, v[N * 3];\n\nvoid add(int x, ll y) {\n\n  for (; x <= tot; x += x & (-x))\n    v[x] += y;\n}\n\nll ask(int x) {\n\n  ll s = 0;\n\n  for (; x; x -= x & (-x))\n    s += v[x];\n\n  return s;\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]), d[++tot] = a[i];\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &b[i]), d[++tot] = b[i];\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &c[i]), d[++tot] = c[i];\n\n  sort(d + 1, d + tot + 1);\n\n  for (int i = 1; i <= n; i++) {\n\n    a[i] = lower_bound(d + 1, d + tot + 1, a[i]) - d;\n\n    add(a[i], 1);\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    b[i] = lower_bound(d + 1, d + tot + 1, b[i]) - d;\n\n    e[i] = ask(b[i] - 1);\n  }\n\n  memset(v, 0, sizeof(v));\n\n  for (int i = 1; i <= n; i++)\n\n    add(b[i], e[i]);\n\n  for (int i = 1; i <= n; i++) {\n\n    c[i] = lower_bound(d + 1, d + tot + 1, c[i]) - d;\n\n    ans += ask(c[i] - 1);\n  }\n\n  printf(\"%lld\", ans);\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define ll long long\n\n#define N 100005\n\n#define inf (1ll << 60)\n\n#define rep(i, j, k) for (ll i = j; i <= k; ++i)\n\n#define per(i, j, k) for (ll i = j; i >= k; --i)\n\nusing namespace std;\n\ninline ll read() {\n\n  char ch = getchar();\n  ll x = 0, f = 1;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      f = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = x * 10 + ch - '0';\n    ch = getchar();\n  }\n\n  return x * f;\n}\n\nll n, ans, sum[N], a[N], b[N], c[N];\n\nint main() {\n\n  n = read();\n\n  rep(i, 1, n) a[i] = read();\n\n  rep(i, 1, n) b[i] = read();\n\n  rep(i, 1, n) c[i] = read();\n\n  sort(a + 1, a + 1 + n);\n\n  sort(b + 1, b + 1 + n);\n\n  sort(c + 1, c + 1 + n);\n\n  rep(i, 1, n) {\n\n    ll pos = upper_bound(c + 1, c + 1 + n, b[i]) - c;\n\n    if (pos <= n)\n      sum[i] = n - pos + 1;\n  }\n\n  per(i, n, 1) sum[i] += sum[i + 1];\n\n  rep(i, 1, n) {\n\n    ll pos = upper_bound(b + 1, b + 1 + n, a[i]) - b;\n\n    if (pos <= n)\n      ans += sum[pos];\n  }\n\n  printf(\"%lld\", ans);\n}"}
{"fast_code_id":"fb388d5d4a3cf88cb936cbac6661ef954182ff8a707cc27c5946fe07c9f2bdb7","fast_id":"d00c6647f62540b37b3cae9f1a709144b2eb2b0dbc5d2ce4475cacf64e89b023","fast_time":0.0491424642,"language":"cpp","measured_fast_code_id":"d00c6647f62540b37b3cae9f1a709144b2eb2b0dbc5d2ce4475cacf64e89b023","measured_slow_code_id":"5d6c289994cb07a3d0ded06f1708f56774ae74e69f290080adada71bf98ff505","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56284","problem_id":"p03177","slow_code_id":"b38d1fe544fb8df31ca1b338bec1704acb47db07cf79e8c0bfa48cff4c2f1b07","slow_id":"5d6c289994cb07a3d0ded06f1708f56774ae74e69f290080adada71bf98ff505","slow_time":0.1086901441,"speedup":2.211735733431129,"stratum":"2-4","sampling_key":"264d20df997eee1e275d7db626b643f2d977714a2d28dc81fa637d1f85a8b24b","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define X first\n\n#define Y second\n\n#define MP make_pair\n\nusing namespace std;\n\nconst int N = 123;\n\nconst ll mod = 1e9 + 7;\n\nint n;\n\nstruct mtx {\n\n  ll a[N][N], len = n;\n\n  mtx() { memset(a, 0, sizeof(a)); }\n\n  void operator*=(mtx b) {\n\n    int res[N][N];\n\n    memset(res, 0, sizeof(res));\n\n    for (int i = 1; i <= len; i++) {\n\n      for (int j = 1; j <= len; j++) {\n\n        for (int k = 1; k <= len; k++) {\n\n          res[i][j] = (res[i][j] + a[i][k] * b.a[k][j]) % mod;\n        }\n      }\n    }\n\n    for (int i = 1; i <= len; i++) {\n\n      for (int j = 1; j <= len; j++) {\n\n        a[i][j] = res[i][j];\n      }\n    }\n  }\n};\n\nmtx bin_pow(mtx x, ll y) {\n\n  mtx res;\n\n  for (int i = 1; i <= n; i++) {\n\n    res.a[i][i] = 1;\n  }\n\n  while (y) {\n\n    if (y & 1LL)\n\n      res *= x;\n\n    x *= x;\n\n    y >>= 1LL;\n  }\n\n  return res;\n}\n\nint main() {\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  ll k;\n\n  cin >> n >> k;\n\n  mtx z;\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n      cin >> z.a[i][j];\n\n  z = bin_pow(z, k);\n\n  ll res = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = 1; j <= n; j++) {\n\n      res += z.a[i][j], res %= mod;\n    }\n  }\n\n  cout << res;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define int long long\n\n#define file(s)                                                                                    \\\n  freopen(s \".in\", \"r\", stdin);                                                                    \\\n  freopen(s \".out\", \"w\", stdout);\n\n#define forev(i, b, a) for (int i = (b); i >= (a); --i)\n\n#define forn(i, a, b) for (int i = (a); i <= (b); ++i)\n\n#define all(x) x.begin(), x.end()\n\n#define sz(s) (int)s.size()\n\n#define pb push_back\n\n#define ppb pop_back\n\n#define s second\n\n#define f first\n\nusing namespace std;\n\ntypedef pair<long long, long long> pll;\n\ntypedef pair<int, int> pii;\n\ntypedef unsigned long long ull;\n\ntypedef vector<pii> vpii;\n\ntypedef vector<int> vi;\n\ntypedef long double ldb;\n\ntypedef long long ll;\n\ntypedef double db;\n\nconst int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e5 + 11;\n\nconst int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;\n\nconst pii base = {1171, 3307}, Mod = {1e9 + 7, 1e9 + 9};\n\nconst db eps = 1e-12, pi = 3.14159265359;\n\nconst ll INF = 1e18;\n\nvoid add(int &x, int y) {\n\n  x += y;\n\n  if (x >= mod)\n\n    x -= mod;\n\n  if (x < 0)\n\n    x += mod;\n}\n\nvector<vi> mult(vector<vi> a, vector<vi> b) {\n\n  int n = sz(a), m = sz(a[0]), k = sz(b[0]);\n\n  vector<vi> res(n, vi(k));\n\n  forn(i, 0, n - 1)\n\n      forn(j, 0, k - 1)\n\n          forn(x, 0, m - 1)\n\n              add(res[i][j], a[i][x] * 1ll * b[x][j] % mod);\n\n  return res;\n}\n\nvector<vi> binpow(vector<vi> a, int n) {\n\n  int m = sz(a);\n\n  vector<vi> res(m, vi(m));\n\n  forn(i, 0, m - 1)\n\n      res[i][i] = 1;\n\n  while (n) {\n\n    if (n & 1)\n\n      res = mult(res, a);\n\n    a = mult(a, a);\n\n    n >>= 1;\n  }\n\n  return res;\n}\n\nint n, k;\n\nmain() {\n\n  cin >> n >> k;\n\n  vector<vi> g(n, vi(n));\n\n  forn(i, 0, n - 1)\n\n          forn(j, 0, n - 1)\n\n              cin >>\n      g[i][j];\n\n  g = binpow(g, k);\n\n  int ans = 0;\n  ;\n\n  forn(i, 0, n - 1)\n\n      forn(j, 0, n - 1)\n\n          add(ans, g[i][j]);\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"d8b40c8c14249ba7baae1fb24972cf91d12d4aff3e782fc8f2db9b42727d343c","fast_id":"e87e7e0022b18161d200919b55c3993a4cd92f56e85b75fe7526db2d80aadba9","fast_time":0.0001938099,"language":"cpp","measured_fast_code_id":"e87e7e0022b18161d200919b55c3993a4cd92f56e85b75fe7526db2d80aadba9","measured_slow_code_id":"a05653a483cdd4e96cfe5128eaf7969004e12dbcde8acdcccd9a22d2af15e20c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5632","problem_id":"p03411","slow_code_id":"5fd16c63303b257bf0edee1fe0cbb1280482e220b9188eb3b9c828c226c45149","slow_id":"a05653a483cdd4e96cfe5128eaf7969004e12dbcde8acdcccd9a22d2af15e20c","slow_time":0.0036379111,"speedup":18.770512239054867,"stratum":"8+","sampling_key":"a1c376aabc9fe09ed51a58a22c7a2d7bd51f205e7737eaa6d89a1a3ccb10e0da","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n\n#define SIZE(a) ((int)(a).size())\n\nconst int N = 100005;\n\nint n1, n2;\n\nvector<int> g[N];\n\nint m1[N], m2[N];\n\nbool in_vc1[N], in_vc2[N];\n\nbool vis[N];\n\nbool dfs(int u) {\n\n  if (u < 0)\n    return true;\n\n  if (vis[u])\n    return false;\n  else\n    vis[u] = true;\n\n  for (int v : g[u])\n\n    if (dfs(m2[v])) {\n      m1[u] = v;\n      m2[v] = u;\n      return true;\n    }\n\n  return false;\n}\n\nint matching() {\n\n  REP(i, n1) m1[i] = -1;\n\n  REP(i, n2) m2[i] = -1;\n\n  bool changed;\n\n  do {\n\n    changed = 0;\n\n    REP(i, n1) vis[i] = false;\n\n    REP(i, n1) if (m1[i] < 0) changed |= dfs(i);\n\n  } while (changed);\n\n  REP(i, n1) if (m1[i] != -1) {\n\n    if (vis[i])\n      in_vc2[m1[i]] = true;\n\n    else\n      in_vc1[i] = true;\n  }\n\n  int siz = 0;\n\n  REP(i, n1) siz += (m1[i] != -1);\n\n  return siz;\n}\n\nint X1[N], Y1[N];\n\nint X2[N], Y2[N];\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cin >> n1;\n\n  n2 = n1;\n\n  REP(i, n1) cin >> X1[i] >> Y1[i];\n\n  REP(i, n2) cin >> X2[i] >> Y2[i];\n\n  REP(i, n1) REP(j, n2) {\n\n    if (X1[i] < X2[j] && Y1[i] < Y2[j]) {\n\n      g[i].push_back(j);\n    }\n  }\n\n  cout << matching() << '\\n';\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nconst int N = 100, inf = 0x5FFFFFFF;\n\nstruct node\n\n{\n\n  int x, y;\n\n} R[N + 5], B[N + 5];\n\nint n, ans;\n\nbool vis[N + 5];\n\nint Ma[N + 5][N + 5], fa[N + 5];\n\nint Dfs(int u)\n\n{\n\n  for (int v = 1; v <= n; v++)\n\n    if (Ma[u][v] && !vis[v])\n\n    {\n\n      vis[v] = 1;\n\n      if (fa[v] == -1 || Dfs(fa[v]))\n\n      {\n\n        fa[v] = u;\n\n        return true;\n      }\n    }\n\n  return false;\n}\n\nvoid Solve()\n\n{\n\n  memset(fa, -1, sizeof(fa));\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    memset(vis, 0, sizeof(vis));\n\n    ans += Dfs(i);\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d %d\", &R[i].x, &R[i].y);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d %d\", &B[i].x, &B[i].y);\n\n    for (int j = 1; j <= n; j++)\n\n      if (R[j].x < B[i].x && R[j].y < B[i].y)\n\n        Ma[j][i] = 1;\n  }\n\n  Solve();\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"67bd165fe0788e3e68f90e6abc99635233720ffd1436374a57147ec066182b4e","fast_id":"09d73dc7015d9356fcf8f9ab9d324f3c65a7c08eab98dd9672be8fdc886ea0bb","fast_time":0.0191494721,"language":"cpp","measured_fast_code_id":"09d73dc7015d9356fcf8f9ab9d324f3c65a7c08eab98dd9672be8fdc886ea0bb","measured_slow_code_id":"8a707193dc4a72d29d6e9cf73fd12673076013156991794e13828744716b5b6f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56337","problem_id":"p02936","slow_code_id":"17c1279d41db82af0a21dda1b0f48e9aa1661ccacdcab6764e99e54fb94435e4","slow_id":"8a707193dc4a72d29d6e9cf73fd12673076013156991794e13828744716b5b6f","slow_time":0.6848341469,"speedup":35.76256010211373,"stratum":"8+","sampling_key":"4f9c67fccda32bd8e5ca0fa0d4d44d05481d5f20f55975c5b0e9243ccba5b83e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint N;\n\nint C[200001];\n\nint X[200001];\n\nvector<int> E[200001];\n\nvoid dfs(int p, int prev, int c) {\n\n  int k = c + X[p];\n\n  C[p] = k;\n\n  for (int to : E[p]) {\n\n    if (to != prev)\n      dfs(to, p, k);\n  }\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, Q;\n\n  cin >> N >> Q;\n\n  rep(i, N - 1) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    E[a].pb(b);\n\n    E[b].pb(a);\n  }\n\n  rep(i, Q) {\n\n    int p, x;\n\n    cin >> p >> x;\n\n    X[p] += x;\n  }\n\n  dfs(1, 0, 0);\n\n  rep1(i, N) cosp(C[i]);\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint N;\n\nint C[200001];\n\nint E[200001];\n\nint next[200001];\n\nint H[200001];\n\nvoid dfs(int p, int c) {\n\n  C[p] = c + C[p];\n\n  for (int i = H[p]; i; i = next[i]) {\n\n    dfs(E[i], C[p]);\n  }\n}\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn;\n\ninline void putint(int X) {\n\n  if (X == 0) {\n\n    *di++ = '0';\n\n    *di++ = ' ';\n\n    return;\n  }\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = ' ';\n}\n\nint main() {\n\n  int N = getint(), Q = getint();\n\n  int k = 1;\n\n  rep(i, N - 1) {\n\n    int a = getint(), b = getint();\n\n    E[k] = b;\n\n    next[k] = H[a];\n\n    H[a] = k++;\n  }\n\n  rep(i, Q) {\n\n    int p = getint(), x = getint();\n\n    C[p] += x;\n  }\n\n  dfs(1, 0);\n\n  rep1(i, N) putint(C[i]);\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"c87da682c074a930eea24b1903dfe3b3d45d26f7b8af86e1b08b6de1c1b1fa0e","fast_id":"3272d37a7879d0e85d4ebb3d3383e5329f61bdc8d5ac497c7de26ae18d63e74e","fast_time":0.270289639,"language":"cpp","measured_fast_code_id":"3272d37a7879d0e85d4ebb3d3383e5329f61bdc8d5ac497c7de26ae18d63e74e","measured_slow_code_id":"01598db4e31a4236b0574ce1e07b283072227a29642639f6b069b4fa53145fb4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5643","problem_id":"p00962","slow_code_id":"4e2a2fdfd9687b31cdd4584104c237ce465da82dc3f6ad7a2669720ed64597cb","slow_id":"01598db4e31a4236b0574ce1e07b283072227a29642639f6b069b4fa53145fb4","slow_time":0.6563626326,"speedup":2.42836771334768,"stratum":"2-4","sampling_key":"9111b53229549defb0be9ad427bba4fcf87fe5129b807c5c9450407d2c16a61f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n\n\nconst long long inf = 0x3f3f3f3f3f3f3f3fLL;\n\ntypedef pair<int, int> PII;\n\ntypedef unsigned int uint;\n\ntypedef unsigned long long uLL;\n\n\n\nconst int N = 1e5 + 10;\n\n\n\nint n, m;\n\n\n\nvector<PII> adj[N], radj[N];\n\n\n\nuLL cnt1[N], cnt2[N];\n\nlong long dis1[N], dis2[N];\n\n\n\nstruct node {\n\n  int u, v; long long dis;\n\n  node (int u = 0, int v = 0, long long dis = 0)\n\n      :u(u), v(v), dis(dis) {}\n\n  bool operator < (const node &rhs) const {\n\n  return dis > rhs.dis;\n\n  }\n\n};\n\n\n\nvector<node> E;\n\n\n\nint main() {\n\n  int n, m; scanf(\"%d%d\", &n, &m);\n\n  for (int i = 0; i < m; i++) {\n\n    int u, v, w; scanf(\"%d%d%d\", &u, &v, &w);\n\n    adj[u].push_back(make_pair(v, w));\n\n    radj[v].push_back(make_pair(u, w));\n\n    E.push_back(node(u, v, w));\n\n  }\n\n\n\n  memset (dis1, 0x3f, sizeof dis1);\n\n  memset (dis2, 0x3f, sizeof dis2);\n\n\t                                                \n\n  priority_queue<node> pq;\n\n  pq.push(node(0, 1, 0));\n\n  cnt1[0] = 1;\n\n  while (!pq.empty()) {\n\n    node cur = pq.top(); pq.pop();\n\n    if (dis1[cur.v] < cur.dis) continue;\n\n    if (dis1[cur.v] == cur.dis) {\n\n      cnt1[cur.v] += cnt1[cur.u];\n\n      continue;\n\n    }\n\n    dis1[cur.v] = cur.dis;\n\n    cnt1[cur.v] = cnt1[cur.u];\n\n    for (int i = 0; i < adj[cur.v].size(); i++) {\n\n      long long d = dis1[cur.v] + adj[cur.v][i].second;\n\n      if (dis1[adj[cur.v][i].first] >= d) \n\n        pq.push(node(cur.v, adj[cur.v][i].first, d));\n\n    }\n\n  }\n\n\n\n  assert (pq.empty() == true);\n\n\t                                                \n\n  pq.push(node(0, 2, 0));\n\n  cnt2[0] = 1;\n\n  while (!pq.empty()) {\n\n    node cur = pq.top(); pq.pop();\n\n    if (dis2[cur.v] < cur.dis) continue;\n\n    if (dis2[cur.v] == cur.dis) {\n\n      cnt2[cur.v] += cnt2[cur.u];\n\n      continue;\n\n    }\n\n    dis2[cur.v] = cur.dis;\n\n    cnt2[cur.v] = cnt2[cur.u];\n\n    for (int i = 0; i < radj[cur.v].size(); i++) {\n\n      long long d = dis2[cur.v] + radj[cur.v][i].second;\n\n      if (dis2[radj[cur.v][i].first] >= d) \n\n        pq.push(node(cur.v, radj[cur.v][i].first, d));\n\n    }\n\n  }\n\n\n\n  long long shortdis = dis1[2];\n\n  for (int i = 0; i < E.size(); i++) {\n\n    if (i == 5)\n\n      i = i;\n\n    node cur = E[i];\n\n    long long newdis = dis1[cur.v] + dis2[cur.u] + cur.dis;\n\n    if (shortdis > dis1[cur.v] + dis2[cur.u] + cur.dis) {\n\n      puts(\"HAPPY\");\n\n    } else if (shortdis == newdis) {\n\n      puts(\"SOSO\");\n\n    } else if (shortdis < dis1[cur.u] + dis2[cur.v] + cur.dis) {\n\n      puts(\"SOSO\");\n\n    } else if (cnt1[cur.u] * cnt2[cur.v] == cnt1[2]) {\n\n      puts(\"SAD\");\n\n    } else {\n\n      puts(\"SOSO\");\n\n    }\n\n  }\n\n\n\n  return 0;\n\n}\n\n  \n\n   \n\n     \n\n     \n\n     \n\n      \n\n      \n\n  \t\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define ll long long\n\nconst int maxn = 1e5 + 5;\n\nint n, m;\n\nbool bo[maxn];\n\nint a[maxn], b[maxn], c[maxn];\n\nint read() {\n\n  int x = 0, f = 1;\n  char ch = getchar();\n\n  for (; ch < '0' || ch > '9'; ch = getchar())\n    if (ch == '-')\n      f = -1;\n\n  for (; ch >= '0' && ch <= '9'; ch = getchar())\n    x = x * 10 + ch - '0';\n\n  return x * f;\n}\n\nstruct node {\n\n  ll v;\n\n  int u;\n\n  node() {}\n\n  node(int _u, ll _v) { u = _u, v = _v; }\n\n  bool operator<(const node &a) const { return v < a.v; }\n};\n\nstruct Heap {\n\n  int tot;\n\n  node tree[maxn];\n\n  void ins(node x) {\n\n    tree[++tot] = x;\n\n    int pos = tot;\n\n    while (pos > 1) {\n\n      if (tree[pos] < tree[pos >> 1])\n\n        swap(tree[pos], tree[pos >> 1]), pos >>= 1;\n\n      else\n        break;\n    }\n  }\n\n  int pop() {\n\n    node res = tree[1];\n\n    tree[1] = tree[tot--];\n\n    int pos = 1, son = 2;\n\n    while (son <= tot) {\n\n      if (son < tot && tree[son | 1] < tree[son])\n        son |= 1;\n\n      if (tree[son] < tree[pos])\n\n        swap(tree[son], tree[pos]), pos = son;\n\n      else\n        break;\n      son = pos << 1;\n    }\n\n    return res.u;\n  }\n\n} T;\n\nstruct graph {\n\n  int tot, h, t;\n\n  ll dis[maxn], cnt[maxn];\n\n  int list[maxn], deg[maxn];\n\n  int now[maxn], pre[maxn], son[maxn], val[maxn];\n\n  void clear() {\n\n    tot = 0;\n    memset(now, 0, sizeof(now));\n\n    memset(deg, 0, sizeof(deg));\n  }\n\n  void add(int a, int b, int c) {\n\n    pre[++tot] = now[a];\n\n    now[a] = tot;\n    son[tot] = b;\n\n    val[tot] = c;\n    deg[b]++;\n  }\n\n  void dij(int st) {\n\n    memset(dis, 63, sizeof(dis));\n\n    dis[st] = 0;\n    T.ins(node(st, 0));\n\n    while (T.tot) {\n\n      int u = T.pop();\n\n      for (int p = now[u], v = son[p]; p; p = pre[p], v = son[p])\n\n        if (dis[v] > dis[u] + val[p]) {\n\n          dis[v] = dis[u] + val[p];\n\n          T.ins(node(v, dis[v]));\n        }\n    }\n  }\n\n  void calc(int st) {\n\n    cnt[st] = 1;\n    list[0] = st;\n    h = 0, t = 1;\n\n    while (h != t) {\n\n      int u = list[h++];\n\n      for (int p = now[u], v = son[p]; p; p = pre[p], v = son[p]) {\n\n        cnt[v] += cnt[u];\n\n        if (--deg[v] == 0)\n          list[t++] = v;\n      }\n    }\n  }\n\n} G1, G2;\n\nint main() {\n\n  n = read(), m = read();\n\n  for (int i = 1; i <= m; i++) {\n\n    a[i] = read(), b[i] = read(), c[i] = read();\n\n    G1.add(a[i], b[i], c[i]);\n    G2.add(b[i], a[i], c[i]);\n  }\n  G1.dij(1), G2.dij(2);\n\n  G1.clear(), G2.clear();\n\n  for (int i = 1; i <= m; i++)\n\n    if (G1.dis[a[i]] + G2.dis[b[i]] + c[i] == G1.dis[2]) {\n\n      bo[i] = 1;\n\n      G1.add(a[i], b[i], c[i]), G2.add(b[i], a[i], c[i]);\n    }\n\n  G1.calc(1), G2.calc(2);\n\n  for (int i = 1; i <= m; i++) {\n\n    if (bo[i]) {\n\n      if (G1.cnt[a[i]] * G2.cnt[b[i]] == G1.cnt[2])\n        puts(\"SAD\");\n\n      else\n        puts(\"SOSO\");\n\n    }\n\n    else {\n\n      if (G1.dis[b[i]] + c[i] + G2.dis[a[i]] < G1.dis[2])\n        puts(\"HAPPY\");\n\n      else\n        puts(\"SOSO\");\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"d314124239ed1f0c2496123a72bb71936cb9961ec72f37808aacacb903b406e5","fast_id":"93438c24576fb82729129a3633d5989d44551bb8e11e79a88ef550db19620d71","fast_time":0.0001927506,"language":"cpp","measured_fast_code_id":"93438c24576fb82729129a3633d5989d44551bb8e11e79a88ef550db19620d71","measured_slow_code_id":"49a7f6e99d83196a16ca8d216c26a07d80d135be491305ad03af5d8399b8d0d3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5648","problem_id":"p03320","slow_code_id":"4619cc790bc213748f54928298e2fbebf03c93e7344e488719723532b04e01a0","slow_id":"49a7f6e99d83196a16ca8d216c26a07d80d135be491305ad03af5d8399b8d0d3","slow_time":0.0010167803,"speedup":5.275108352451302,"stratum":"4-8","sampling_key":"6074e2869b1dfe48b57990da1f6f634f0d0314bed4f9f680a844b99d30b4f2f4","slow_code":"#include <iostream>\n\n#include <cstdio>\n\nusing namespace std;\n\ndouble cal(long long x) {\n\n  long long y = 10, len = 1, sum = 0, ret = x;\n\n  while (y <= x)\n    y = (y << 1) + (y << 3), ++len;\n\n  while (len--) {\n\n    y /= 10;\n\n    sum += x / y;\n\n    x %= y;\n  }\n\n  return ret * 1.0 / sum;\n}\n\nbool judge(long long x) {\n\n  long long a = 1;\n\n  while (a <= x) {\n\n    if (cal(x + a) < cal(x))\n      return false;\n\n    a = (a << 1) + (a << 3);\n  }\n\n  return true;\n}\n\nlong long k, now;\n\nint main() {\n\n  scanf(\"%d\", &k);\n\n  while (k--) {\n\n    long long a = 1;\n\n    while (true) {\n\n      if (judge(now + a)) {\n\n        now += a;\n\n        break;\n      }\n\n      a = (a << 1) + (a << 3);\n    }\n\n    cout << now << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\ntypedef long long ll;\n\ntypedef long double ld;\n\nld Max(ld a, ld b) { return a > b ? a : b; }\n\ninline ll read()\n\n{\n\n  ll x = 0, f = 1;\n  char c = getchar();\n\n  while (c < '0' || c > '9') {\n    if (c == '-')\n      f = -1;\n    c = getchar();\n  }\n\n  while (c >= '0' && c <= '9') {\n    x = (x << 3) + (x << 1) + c - '0';\n    c = getchar();\n  }\n\n  return x * f;\n}\n\nll k, a;\n\nld MAA, uu;\n\nll rr(ll x)\n\n{\n\n  ll now = 0;\n\n  while (x)\n    now += x % 10, x /= 10;\n\n  return now;\n}\n\nbool check(ll x)\n\n{\n\n  ll g = 1;\n\n  while (g <= x)\n\n  {\n\n    if ((ld)(x + g) * rr(x) < (ld)x * rr(x + g))\n      return 0;\n\n    g = (g << 3) + (g << 1);\n  }\n\n  return 1;\n}\n\nint main()\n\n{\n\n  scanf(\"%lld\", &k);\n\n  while (k--)\n\n  {\n\n    ll r = 1;\n\n    while (1)\n\n    {\n\n      if (check(r + a))\n\n      {\n\n        a += r;\n\n        break;\n      }\n\n      r = (r << 3) + (r << 1);\n    }\n\n    printf(\"%lld\\n\", a);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"5d90320571619f180392114792e97cfa758b4d61513f00746dd57742e0b5336d","fast_id":"7cd5d50c9224435f4f67d39c8abb1efb8dd89ae3daea7eb4f31e1387e8b0f605","fast_time":0.0196272282,"language":"cpp","measured_fast_code_id":"7cd5d50c9224435f4f67d39c8abb1efb8dd89ae3daea7eb4f31e1387e8b0f605","measured_slow_code_id":"db8b17951e84c2749d0b29039294a3927ac67b601f7f8f26fbc4596783c53140","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5655","problem_id":"p03502","slow_code_id":"0f554554fd9c0e32ef59527f199ad5917ada9cc3860bb6a13308506f9c549039","slow_id":"db8b17951e84c2749d0b29039294a3927ac67b601f7f8f26fbc4596783c53140","slow_time":0.1045513329,"speedup":5.32685164887419,"stratum":"4-8","sampling_key":"2993054960aaf466220945c5e676e739c6275847d2e2d132219a80e97a45ea45","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n, d, a, sum = 0;\n\n  cin >> n;\n\n  a = n;\n\n  while (a > 0) {\n\n    d = a % 10;\n\n    sum = sum + d;\n\n    a = a / 10;\n  }\n\n  if (n % sum == 0)\n\n    printf(\"Yes\\n\");\n\n  else\n\n    printf(\"No\\n\");\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int input;\n\n  int temp = 0;\n\n  scanf(\"%d\", &input);\n\n  int cek = input;\n\n  while (input > 0) {\n\n    temp += input % 10;\n\n    input /= 10;\n  }\n\n  if (cek % temp == 0) {\n\n    printf(\"Yes\\n\");\n\n  } else\n    printf(\"No\\n\");\n}"}
{"fast_code_id":"61c82e90e272d10a5ba55896e7343138b340aba209e5fe2faf549e040eb29420","fast_id":"cc90a5fd11b554398fd68b25411c2c5f692c4027ff44cc3f551dc4565d940f82","fast_time":0.0198170653,"language":"cpp","measured_fast_code_id":"cc90a5fd11b554398fd68b25411c2c5f692c4027ff44cc3f551dc4565d940f82","measured_slow_code_id":"b9dc226552b704d49553d6b484806492e9cc8960ca409b9d8fb678a133b5fafc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56568","problem_id":"p00112","slow_code_id":"3d11ed7e2db7343a937ad35c6ba71c9a91f33f2407f8134737bdfd0a11dfed18","slow_id":"b9dc226552b704d49553d6b484806492e9cc8960ca409b9d8fb678a133b5fafc","slow_time":0.104695748,"speedup":5.283110612750517,"stratum":"4-8","sampling_key":"8f191dde3e4135f3a0e1817c1e3a649a58463e23cd38476e586421dedd2d5407","slow_code":"#include <list>\n\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  int i;\n\n  int n;\n\n  long long c;\n\n  for (;;) {\n\n    cin >> n;\n\n    if (n == 0)\n\n      break;\n\n    list<int> t;\n\n    c = 0;\n\n    for (i = 0; i < n; i++) {\n\n      int tmp;\n\n      cin >> tmp;\n\n      t.push_back(tmp);\n    }\n\n    t.sort();\n\n    list<int>::iterator it = t.begin();\n\n    for (i = 0; i < n - 1; i++) {\n\n      c += (*it) * (n - i - 1);\n\n      it++;\n    }\n\n    cout << c << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <algorithm>\n\n#include <cstdio>\n\nusing namespace std;\n\nint main() {\n\n  int i;\n\n  int n;\n\n  while (scanf(\"%d\", &n), n) {\n\n    int a[10000];\n\n    for (i = 0; i < n; ++i)\n\n      scanf(\"%d\", a + i);\n\n    sort(a, a + n);\n\n    long long sm = 0;\n\n    for (i = 0; i < n - 1; ++i)\n\n      sm += a[i] * (n - i - 1);\n\n    printf(\"%lld\\n\", sm);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"a326c72950edd441dafe22b27d42762998a828a8a3462de1c155c767b2f39c35","fast_id":"4906417cf52298bb120e3f9a5c95d398be9b33684147d1fe366a2ce17d8d23a3","fast_time":0.0613863007,"language":"cpp","measured_fast_code_id":"4906417cf52298bb120e3f9a5c95d398be9b33684147d1fe366a2ce17d8d23a3","measured_slow_code_id":"523158be80e98528826e6305e657b38304683e2cc271617bc015b8992b037353","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56569","problem_id":"p03204","slow_code_id":"856a9a137063b8054563f688f4d455c5566d377e0e37dbb9d95ba39aa9284b70","slow_id":"523158be80e98528826e6305e657b38304683e2cc271617bc015b8992b037353","slow_time":0.4292664147,"speedup":6.99286990427817,"stratum":"4-8","sampling_key":"60f52aeb2d23f5c350e98ed12c9b74f6176a720d1025c3e56f203813466673cf","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 2e5 + 10;\n\nvector<int> G[maxn];\n\nint in[maxn], out[maxn], tol;\n\nint sz[maxn], S[maxn], is[maxn], son[maxn];\n\nvoid get_cal(int v, int fa, int limit)\n\n{\n\n  son[v] = 0;\n\n  if (v >= limit)\n\n    return;\n\n  son[v] = 1;\n\n  for (int i = G[v].size() - 1; i >= 0; i--)\n\n  {\n\n    int u = G[v][i];\n\n    if (u == fa)\n\n      continue;\n\n    get_cal(u, v, limit);\n\n    son[v] += son[u];\n  }\n}\n\nvoid get_order(int v, int fa, int mx)\n\n{\n\n  is[v] = mx;\n\n  for (int i = G[v].size() - 1; i >= 0; i--)\n\n  {\n\n    int u = G[v][i];\n\n    if (u == fa)\n\n      continue;\n\n    if (is[v] > is[fa] || v > is[v])\n\n      get_cal(u, v, is[v]);\n\n    sz[u] = son[u];\n  }\n\n  for (int i = G[v].size() - 1; i >= 0; i--)\n\n  {\n\n    int u = G[v][i];\n\n    if (u == fa)\n\n      continue;\n\n    get_order(u, v, max(mx, v));\n  }\n}\n\nvoid dfs(int v, int fa)\n\n{\n\n  S[v]++;\n\n  for (int i = G[v].size() - 1; i >= 0; i--)\n\n  {\n\n    int u = G[v][i];\n\n    if (u == fa)\n\n      continue;\n\n    S[v] += sz[u];\n  }\n\n  for (int i = G[v].size() - 1; i >= 0; i--)\n\n  {\n\n    int u = G[v][i];\n\n    if (u == fa)\n\n      continue;\n\n    S[u] = S[v] - sz[u];\n\n    dfs(u, v);\n  }\n}\n\nint main()\n\n{\n\n  int n;\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    int x, y;\n    scanf(\"%d%d\", &x, &y);\n\n    G[x].push_back(y);\n\n    G[y].push_back(x);\n  }\n\n  get_order(1, 0, 0);\n\n  dfs(1, 0);\n\n  for (int i = 2; i <= n; i++)\n\n    printf(\"%d \", S[i] - 1);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <queue>\n\nusing namespace std;\n\n#define N 200050\n\nint fa[N], sz[N], head[N], cnt, mx[N], f[N], ti = 1, as[N], n, a, b, fr[N], vl[N];\n\nstruct edge {\n  int t, next;\n} ed[N * 2];\n\npriority_queue<pair<int, int> > st;\n\nint finds(int x) { return fa[x] == x ? x : fa[x] = finds(fa[x]); }\n\nvoid adde(int f, int t) {\n  ed[++cnt] = (edge){t, head[f]};\n  head[f] = cnt;\n  ed[++cnt] = (edge){f, head[t]};\n  head[t] = cnt;\n}\n\nvoid dfs1(int u, int fa) {\n  f[u] = fa;\n  mx[u] = mx[f[u]], fr[u] = fr[f[u]];\n  if (mx[u] < fa)\n    mx[u] = fa, fr[u] = u;\n  for (int i = head[u]; i; i = ed[i].next)\n    if (ed[i].t != fa)\n      dfs1(ed[i].t, u);\n}\n\nint que(int x) {\n  if (x < ti)\n    return sz[finds(x)] - 1;\n  int as = 0;\n  for (int i = head[x]; i; i = ed[i].next)\n    if (ed[i].t < ti)\n      as += sz[finds(ed[i].t)];\n  return as;\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n    scanf(\"%d%d\", &a, &b), adde(a, b);\n\n  for (int i = 1; i <= n; i++)\n    fa[i] = i, sz[i] = 1;\n\n  dfs1(1, 0);\n\n  for (int i = head[1]; i; i = ed[i].next)\n    st.push(make_pair(-1, ed[i].t));\n\n  while (!st.empty())\n\n  {\n\n    int las = ti;\n\n    ti = -st.top().first;\n    int s = st.top().second;\n    st.pop();\n\n    for (int i = las; i < ti; i++)\n\n      for (int j = head[i]; j; j = ed[j].next)\n        if (ed[j].t < i) {\n          int a = finds(i), b = finds(ed[j].t);\n          fa[a] = b, sz[b] += sz[a];\n        }\n\n    as[s] += as[mx[s]] + que(s) + 1 - vl[fr[s]];\n\n    for (int i = head[s]; i; i = ed[i].next)\n      if (ed[i].t != f[s])\n        st.push(make_pair(-mx[ed[i].t], ed[i].t)),\n            vl[ed[i].t] = ed[i].t < ti ? sz[finds(ed[i].t)] : 0;\n  }\n\n  for (int i = 2; i <= n; i++)\n    printf(\"%d \", as[i]);\n}"}
{"fast_code_id":"cbb22e4abf522f22b44309b1f1928931c4eed382196fc9ac77dabac03437c0e1","fast_id":"c3a0207e7774913f06a327c4c23f5c46a1b0c626014b52def6ab4ec5a5b4cfdf","fast_time":0.0979552385,"language":"cpp","measured_fast_code_id":"c3a0207e7774913f06a327c4c23f5c46a1b0c626014b52def6ab4ec5a5b4cfdf","measured_slow_code_id":"e36dc42a4de4830ea8ca5fa73aef74b6bb6d835249df840b180ce91f0a3bf92c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56572","problem_id":"p03409","slow_code_id":"b89aedb6f472f3720bcfb9841e5b6e6f38193380c0e30e6d7cea9bff7765feb6","slow_id":"e36dc42a4de4830ea8ca5fa73aef74b6bb6d835249df840b180ce91f0a3bf92c","slow_time":0.9075149034,"speedup":9.264587757601142,"stratum":"8+","sampling_key":"b89df8c939f9a8c904542d56e2ac46ec3f81aea88ee7ff338258809a6bbd5b3d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate <class T> void ckmin(T &a, T b) { a = min(a, b); }\n\ntemplate <class T> void ckmax(T &a, T b) { a = max(a, b); }\n\n#define pb push_back\n\n#define mp make_pair\n\n#define cotu cout\n\n#define itn int\n\n#define Red                                                                                        \\\n  ios_base::sync_with_stdio(0);                                                                    \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0)\n\n#define F first\n\n#define S second\n\n#define sz(x) (int)x.size()\n\n#define all(x) (x).begin(), (x).end()\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\n#define repr(i, n) for (int i = n - 1; i >= 0; --i)\n\n#define Rep(i, a, n) for (int i = (a); i <= (n); ++i)\n\n#define repst(i, n) for (auto it = n.begin(); it != n.end(); ++it)\n\n#define Repr(i, a, n) for (int i = (n); i >= (a); --i)\n\n#define setp(x) fixed << setprecision(x)\n\n#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace __gnu_pbds;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<int, int> pii;\n\nconst int inf = int(1e9);\n\nconst int mod = inf + 7;\n\nconst int N = 3e5 + 555;\n\nconst double PI = acos(-1.0);\n\nvoid mul(ll &x, ll y) {\n\n  x *= y;\n\n  if (x >= mod)\n    x %= mod;\n}\n\nvoid add(ll &x, ll y) {\n\n  x += y;\n\n  if (x >= mod)\n    x -= mod;\n\n  if (x < 0)\n    x += mod;\n}\n\nll bp(ll a, ll n) {\n\n  ll r = 1;\n\n  while (n) {\n\n    if (n & 1)\n      mul(r, a);\n\n    mul(a, a);\n\n    n >>= 1;\n  }\n\n  return r;\n}\n\nvector<int> g[N];\n\nint n, k;\n\nvector<int> mt;\n\nvector<char> used;\n\nbool try_kuhn(int v) {\n\n  if (used[v])\n    return false;\n\n  used[v] = true;\n\n  for (size_t i = 0; i < g[v].size(); ++i) {\n\n    int to = g[v][i];\n\n    if (mt[to] == -1 || try_kuhn(mt[to])) {\n\n      mt[to] = v;\n\n      return true;\n    }\n  }\n\n  return false;\n}\n\nvoid solve()\n\n{\n\n  cin >> n;\n\n  vector<pii> p(n), q(n);\n\n  rep(i, n) cin >> p[i].F >> p[i].S;\n\n  rep(i, n) cin >> q[i].F >> q[i].S;\n\n  sort(all(p));\n\n  sort(all(q));\n\n  rep(i, sz(p)) {\n\n    rep(j, sz(q)) {\n\n      if (p[i].F < q[j].F && p[i].S < q[j].S)\n        g[i].pb(j + n), g[j + n].pb(i);\n    }\n  }\n\n  k = 2 * n;\n\n  mt.assign(k, -1);\n\n  for (int v = 0; v < n; ++v) {\n\n    used.assign(n, false);\n\n    try_kuhn(v);\n  }\n\n  int res = 0;\n\n  for (int i = n; i < 2 * n; ++i)\n\n    if (mt[i] != -1)\n      ++res;\n\n  cout << res;\n}\n\nint main()\n\n{\n\n  int T = 1;\n\n  for (int i = 1; i <= T; ++i) {\n\n    solve();\n  }\n\n  return 0;\n}","fast_code":"\n\n#include \"bits/stdc++.h\"\n\n#define ll long long\n\n#define int ll\n\n#define fi first\n\n#define si second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define pi pair<ll, ll>\n\n#define node(a, b, c) mp(mp(a, b), c)\n\n#define clr(x) memset(x, 0, sizeof(x));\n\n#define f(i, l, r) for (int i = l; i <= r; i++)\n\n#define rf(i, r, l) for (int i = r; i >= l; i--)\n\n#define done(i) cout << \"done = \" << i << endl;\n\n#define show(x, y)                                                                                 \\\n  cout << x << \" : \";                                                                              \\\n  for (auto z : y)                                                                                 \\\n    cout << z << \" \";                                                                              \\\n  cout << endl;\n\n#define fast                                                                                       \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0);\n\nusing namespace std;\n\nconst ll inf = 1e18;\n\nconst int mod = 1e9 + 7;\n\nconst int M = 100005;\n\nmap<int, pi> yo;\n\nmain()\n\n{\n\n  fast\n\n      int n;\n\n  cin >> n;\n\n  f(i, 1, n)\n\n  {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    yo[x] = (mp(y, 0));\n  }\n\n  f(i, 1, n)\n\n  {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    yo[x] = (mp(y, 1));\n  }\n\n  int ses = 0;\n\n  set<int> s;\n\n  set<int>::iterator it;\n\n  for (auto z : yo)\n\n  {\n\n    int x = z.fi;\n\n    int typ = z.si.si;\n\n    int y = z.si.fi;\n\n    if (typ == 0)\n\n    {\n\n      s.insert(y);\n\n    }\n\n    else\n\n    {\n\n      if (s.empty())\n        continue;\n\n      it = s.upper_bound(y);\n\n      if (it == s.begin())\n        continue;\n\n      it--;\n\n      s.erase(it);\n\n      ses++;\n    }\n  }\n\n  cout << ses << \"\\n\";\n\n  return 0;\n}\n"}
{"fast_code_id":"8b568bb567e37a529906acbe49cf013df9144ac8a989e166ba7b302830043563","fast_id":"75e366dab850c76536de4b6c250c7e1c81456a02c6f7bf3ec87a8661e176d760","fast_time":0.0134385074,"language":"cpp","measured_fast_code_id":"75e366dab850c76536de4b6c250c7e1c81456a02c6f7bf3ec87a8661e176d760","measured_slow_code_id":"ae519fc7d678ff6cfb344d516f8e0e6de8453be66585ef9ec4ba4185f3b46c07","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5658","problem_id":"p00613","slow_code_id":"46a65d5649491d7e410a22a939967665d606fd107a4c3f829a938b047dec911f","slow_id":"ae519fc7d678ff6cfb344d516f8e0e6de8453be66585ef9ec4ba4185f3b46c07","slow_time":0.0712033931,"speedup":5.298459939085199,"stratum":"4-8","sampling_key":"43117bbab3e087915a0c98eecac70c87e76f403d158fc95b6fffbc01ada6b63d","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  int k, c, a;\n\n  while (cin >> k, k) {\n\n    a = 0;\n\n    for (int i = 0; i < k * (k - 1) / 2; i++) {\n\n      cin >> c;\n\n      a += c;\n    }\n\n    cout << (a / (k - 1)) << endl;\n  }\n}","fast_code":"#import <cstdio>\n\nint main() {\n  for (int k, c, a, i; scanf(\"%d\", &k), k; printf(\"%d\\n\", a / --k))\n    for (a = i = 0; i++ < k * (k - 1) / 2; a += c)\n      scanf(\"%d\", &c);\n}"}
{"fast_code_id":"2f1428b3170ec0b96ca7ab19c72e9d24c9313a65ccef690aac97861d8def4e80","fast_id":"01445fab7b5ddbf653727141a98f7e73340d61026b9fa33db3cd353efc0fccea","fast_time":0.142220821,"language":"cpp","measured_fast_code_id":"01445fab7b5ddbf653727141a98f7e73340d61026b9fa33db3cd353efc0fccea","measured_slow_code_id":"6b7674049f3f66845e2bceed596bd4c875ddf39aaab2c749564cf91867c4e706","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56594","problem_id":"p02949","slow_code_id":"ab13d409a7aaec68cd7214c6fc721afd0c428bccc2287ad592775713fb72bd8e","slow_id":"6b7674049f3f66845e2bceed596bd4c875ddf39aaab2c749564cf91867c4e706","slow_time":0.3771412451,"speedup":2.651800506059517,"stratum":"2-4","sampling_key":"3e59f71cb2b4ed2d1baee08e3db95478f1461a83ff3c8ddf354bdcd3c85f004e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define maxx 100010\n\n#define mp make_pair\n\ntypedef pair<int, int> ii;\n\nint ans[maxx], visitado[maxx];\n\nvector<ii> ladj[maxx];\n\nmap<int, int> dicio;\n\nint n, m, p = 0;\n\nint nos = 0;\n\nvector<int> dist;\n\nvoid dfs(int x) {\n\n  visitado[x] = 1;\n\n  for (auto e : ladj[x]) {\n\n    if (visitado[e.second] == 0)\n      dfs(e.second);\n  }\n}\n\nconst int INF = -1e9;\n\nbool spfa(int s) {\n\n  int N = n + 1;\n\n  dist.assign(N, INF);\n\n  vector<int> cnt(N, 0);\n\n  vector<bool> inqueue(N, false);\n\n  queue<int> q;\n\n  N = nos;\n\n  dist[s] = 0;\n\n  q.push(s);\n\n  inqueue[s] = true;\n\n  while (!q.empty()) {\n\n    int atual = q.front();\n\n    q.pop();\n\n    inqueue[atual] = false;\n\n    for (auto edge : ladj[atual]) {\n\n      int peso = edge.first - p;\n\n      int next = edge.second;\n\n      if (dist[atual] + peso > dist[next] && ans[next] == 1) {\n\n        dist[next] = dist[atual] + peso;\n\n        if (!inqueue[next]) {\n\n          q.push(next);\n\n          inqueue[next] = true;\n\n          cnt[next]++;\n\n          if (cnt[next] > N)\n\n            return false;\n        }\n      }\n    }\n  }\n\n  return true;\n}\n\nvector<int> help;\n\nint main() {\n\n  cin >> n >> m >> p;\n\n  int a, b, w;\n\n  for (int i = 1; i <= m; i++) {\n\n    cin >> a >> b >> w;\n\n    ladj[a].push_back(mp(w, b));\n  }\n\n  dfs(1);\n\n  bool c = true;\n\n  if (visitado[n] == 1) {\n\n    ans[1] = 1;\n\n    nos++;\n\n    for (int i = 2; i <= n; i++) {\n\n      for (int j = 1; j <= n + 1; j++)\n        visitado[j] = 0;\n\n      dfs(i);\n\n      if (visitado[1] == 1 || visitado[n] == 1) {\n        nos++;\n        ans[i] = 1;\n      }\n    }\n\n    c = spfa(1);\n  }\n\n  if (c == true)\n    cout << max(0, dist[n]) << endl;\n\n  else\n    cout << -1 << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MAXN = 6000;\n\nvector<pair<long long, pair<int, int>>> adj;\n\nvector<int> adj2[MAXN];\n\nvector<int> adj3[MAXN];\n\nlong long dist[MAXN];\n\nint pai[MAXN];\n\nbitset<MAXN> mark, mark2;\n\nint n, m;\n\nvoid bfs2(int u) {\n\n  mark2[u] = 0;\n\n  queue<int> Q;\n\n  Q.push(u);\n\n  while (!Q.empty()) {\n\n    int v = Q.front();\n\n    Q.pop();\n\n    for (int k = 0; k < adj3[v].size(); k++) {\n\n      int foco = adj3[v][k];\n\n      if (mark2[foco]) {\n\n        mark2[foco] = 0;\n\n        Q.push(foco);\n      }\n    }\n  }\n}\n\nvoid bfs(int u) {\n\n  mark[u] = 0;\n\n  queue<int> Q;\n\n  Q.push(u);\n\n  while (!Q.empty()) {\n\n    int v = Q.front();\n\n    Q.pop();\n\n    for (int k = 0; k < adj2[v].size(); k++) {\n\n      int foco = adj2[v][k];\n\n      if (mark[foco]) {\n\n        mark[foco] = 0;\n\n        Q.push(foco);\n      }\n    }\n  }\n}\n\nint bellmanFord(int s) {\n\n  dist[s] = 0;\n\n  for (int i = 1; i < n; i++) {\n\n    for (int k = 0; k < adj.size(); k++) {\n\n      if (dist[adj[k].second.second] < dist[adj[k].second.first] + adj[k].first) {\n\n        dist[adj[k].second.second] = dist[adj[k].second.first] + adj[k].first;\n\n        pai[adj[k].second.second] = adj[k].second.first;\n      }\n    }\n  }\n\n  for (int k = 0; k < adj.size(); k++) {\n\n    if (dist[adj[k].second.second] < dist[adj[k].second.first] + adj[k].first &&\n\n        mark[adj[k].second.second] == 0 && mark[adj[k].second.first] == 0 &&\n\n        mark2[adj[k].second.second] == 0 && mark2[adj[k].second.first] == 0) {\n\n      return 0;\n    }\n  }\n\n  return 1;\n}\n\nint main() {\n\n  memset(pai, 0, sizeof(pai));\n\n  long long p, w;\n\n  cin >> n >> m >> p;\n\n  for (int i = 0; i <= n; i++)\n\n    dist[i] = -1e9;\n\n  int a, b;\n\n  for (int i = 0; i < m; i++) {\n\n    cin >> a >> b >> w;\n\n    a--;\n\n    b--;\n\n    adj.push_back({w - p, {a, b}});\n\n    adj2[b].push_back(a);\n\n    adj3[a].push_back(b);\n  }\n\n  mark.set();\n\n  bfs(n - 1);\n\n  mark2.set();\n\n  bfs2(0);\n\n  if (!bellmanFord(0)) {\n\n    cout << \"-1\\n\";\n\n    return 0;\n  }\n\n  if (dist[n - 1] < 0)\n    cout << \"0\\n\";\n\n  else\n    cout << dist[n - 1] << \"\\n\";\n\n  return 0;\n}"}
{"fast_code_id":"8883dd48a9a256071b26c6b0e841448711c3bd55159491a56f845c4d6cb1573e","fast_id":"90040f578182b0fad45fb2ddc46c3499d8e47e39a4464efff4a83ee361a13249","fast_time":0.1035829269,"language":"cpp","measured_fast_code_id":"90040f578182b0fad45fb2ddc46c3499d8e47e39a4464efff4a83ee361a13249","measured_slow_code_id":"48c61d1282b29a3cb6f4a1192a75e400a972ee89fea2317fcc06494b7913449e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56599","problem_id":"p00298","slow_code_id":"1060a2b8647854607d5e064ea2cdc9c4364627b444d1bc1003f3dcc600a9b3e0","slow_id":"48c61d1282b29a3cb6f4a1192a75e400a972ee89fea2317fcc06494b7913449e","slow_time":0.3198307284,"speedup":3.0876780370260035,"stratum":"2-4","sampling_key":"ace4b14329a424d52f286d6222e04aa16f10e843ed9c99b50c39d2d014256417","slow_code":"#include <bits/stdc++.h>\n\n#define REP(i, n, N) for (int i = n; i < N; i++)\n\n#define p(S) cout << (S) << endl\n\nusing namespace std;\n\nint dp[1001][1001];\n\nint w[100010], c[100010];\n\nint sumw[100010];\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  REP(i, 0, n) {\n\n    cin >> c[i] >> w[i];\n\n    if (i > 0)\n      sumw[i] = sumw[i - 1] + w[i];\n\n    else\n      sumw[i] = w[i];\n  }\n\n  REP(i, 0, 1001) REP(j, i, 1001) dp[i][j] = j - i + 1;\n\n  REP(i, 0, n - 1) if (c[i] >= w[i + 1] || c[i + 1] >= w[i]) dp[i][i + 1] = 1;\n\n  for (int k = 2; k < n; k++) {\n\n    for (int i = 0; i + k < n; i++) {\n\n      if ((dp[i + 1][i + k] == 1 && c[i] >= sumw[i + k] - sumw[i]) ||\n          (dp[i][i + k - 1] == 1 &&\n           c[i + k] >= sumw[i + k - 1] - (i ? sumw[i - 1] : 0)))\n\n        dp[i][i + k] = 1;\n\n      else\n        dp[i][i + k] = min(dp[i + 1][i + k], dp[i][i + k - 1]) + 1;\n\n      for (int j = i + 1; j < i + k; j++)\n\n        dp[i][i + k] = min(dp[i][i + k], dp[i][j] + dp[j + 1][i + k]);\n    }\n  }\n\n  p(dp[0][n - 1]);\n\n  return 0;\n}","fast_code":"#include \"bits/stdc++.h\"\n\n#define REP(i, n, N) for (int i = (n); i < (N); i++)\n\n#define RREP(i, n, N) for (ll i = (N - 1); i >= n; i--)\n\n#define CK(n, a, b) ((a) <= (n) && (n) < (b))\n\n#define ALL(v) (v).begin(), (v).end()\n\n#define p(s) cout << (s) << endl\n\n#define p2(a, b) cout << (a) << \" \" << (b) << endl\n\n#define v2(T) vector<vector<T>>\n\ntypedef long long ll;\n\nusing namespace std;\n\nconst ll mod = 1e9 + 7;\n\nconst int inf = 1e9;\n\nint dp[1010][1010];\n\nint N;\n\nint C[1010], W[1010];\n\nint sum[1010];\n\nint main() {\n\n  cin >> N;\n\n  REP(i, 0, N) { cin >> C[i] >> W[i]; }\n\n  REP(i, 0, N) REP(j, i, N) dp[i][j] = j - i + 1;\n\n  REP(i, 0, N) sum[i + 1] = sum[i] + W[i];\n\n  REP(k, 1, N) {\n\n    REP(L, 0, N - k) {\n\n      int R = L + k;\n\n      if (dp[L + 1][R] == 1 && sum[R + 1] - sum[L + 1] <= C[L]) {\n\n        dp[L][R] = min(dp[L][R], dp[L + 1][R]);\n      }\n\n      if (dp[L][R - 1] == 1 && sum[R] - sum[L] <= C[R]) {\n\n        dp[L][R] = min(dp[L][R], dp[L][R - 1]);\n      }\n\n      REP(i, L, R) { dp[L][R] = min(dp[L][R], dp[L][i] + dp[i + 1][R]); }\n    }\n  }\n\n  p(dp[0][N - 1]);\n\n  return 0;\n}\n"}
{"fast_code_id":"397f10ce58df5c5c44ea270a07b03507aede3dd1842a6e7c6f6f73e7688a85cf","fast_id":"ce0c60659eec5d8c4020389ad1a4f6b05e90b9503e8c861be63b8ed8f7a24d7d","fast_time":0.0511767282,"language":"cpp","measured_fast_code_id":"ce0c60659eec5d8c4020389ad1a4f6b05e90b9503e8c861be63b8ed8f7a24d7d","measured_slow_code_id":"7fc201023abc5ee52b9c7e6f95e568d95442e184391258e95592638151dc5112","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56604","problem_id":"p02271","slow_code_id":"f6324bb6b49fd9a09136d851c1b84b6661613a438b0b075b380b9cf74f14600d","slow_id":"7fc201023abc5ee52b9c7e6f95e568d95442e184391258e95592638151dc5112","slow_time":0.1037784471,"speedup":2.0278445056985883,"stratum":"2-4","sampling_key":"3eb9e88faa99fee381e48fd5c5c7358f056ee14851090df3a75467c7b7eb3234","slow_code":"#include <iostream>\n\nbool solve(int i, int m);\n\nint n, q, A[2000], m[2000];\n\nint main()\n\n{\n\n  using namespace std;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> A[i];\n  }\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++)\n\n  {\n\n    cin >> m[i];\n  }\n\n  for (int i = 0; i < q; i++)\n\n  {\n\n    if (solve(0, m[i]))\n\n    {\n\n      cout << \"yes\\n\";\n\n    }\n\n    else\n\n    {\n\n      cout << \"no\\n\";\n    }\n  }\n\n  return 0;\n}\n\nbool solve(int i, int m)\n\n{\n\n  if (m == 0)\n\n  {\n\n    return true;\n  }\n\n  if (i >= n)\n\n  {\n\n    return false;\n  }\n\n  return solve(i + 1, m) || solve(i + 1, m - A[i]);\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nint n, A[50], dp[21][2001];\n\nint solve(int i, int m)\n\n{\n\n  if (dp[i][m] != -1)\n\n  {\n\n    return dp[i][m];\n  }\n\n  if (m == 0)\n\n    dp[i][m] = 1;\n\n  else if (i >= n)\n\n    dp[i][m] = 0;\n\n  else if (solve(i + 1, m))\n\n    dp[i][m] = 1;\n\n  else if (solve(i + 1, m - A[i]))\n\n    dp[i][m] = 1;\n\n  else\n\n    dp[i][m] = 0;\n\n  return dp[i][m];\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%d\", &A[i]);\n  }\n\n  int q, m;\n\n  scanf(\"%d\", &q);\n\n  for (int i = 0; i < q; i++)\n\n  {\n\n    memset(dp, -1, sizeof(dp));\n\n    scanf(\"%d\", &m);\n\n    if (solve(0, m) != 0)\n      printf(\"yes\\n\");\n\n    else\n      printf(\"no\\n\");\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"2faea8df98d6671dc0a877625b2452cdf0a8ca3dae46f38f98d8b716e1d11997","fast_id":"6decc81422cf5ffe7e9a8bf99e78a394902a1f11543aa01ea075e809554c373f","fast_time":0.0711462309,"language":"cpp","measured_fast_code_id":"6decc81422cf5ffe7e9a8bf99e78a394902a1f11543aa01ea075e809554c373f","measured_slow_code_id":"9af36e3bf9ab96fdbcf799e01284ba8a57771e1f79ae32deee24850f7d11c6a9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56609","problem_id":"p03429","slow_code_id":"7064dcc4bd11c803b411d037923988b3ab61443662b57e3c7e299f3efaf99c97","slow_id":"9af36e3bf9ab96fdbcf799e01284ba8a57771e1f79ae32deee24850f7d11c6a9","slow_time":0.1500279555,"speedup":2.108726683088422,"stratum":"2-4","sampling_key":"4203952b9bbaf5790371c301b97c7d4195930426d0dd51ea3a9baf6d656c9468","slow_code":"#include <stdio.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <math.h>\n\n#include <string.h>\n\n#include <string>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 1000 + 5;\n\nchar map[maxn][maxn];\n\nint N, M, A, B;\n\nint main()\n\n{\n\n  memset(map, '.', sizeof(map));\n\n  scanf(\"%d%d%d%d\", &N, &M, &A, &B);\n\n  int tempA = A, tempB = B;\n\n  if (!(A == 0 && B == 0))\n\n  {\n\n    memset(map, '.', sizeof(map));\n\n    if (N % 2 == 1)\n\n    {\n\n      if (M >= 2)\n\n      {\n\n        for (int i = 1; i + 1 <= M; i += 2)\n\n        {\n\n          if (A == 0)\n            break;\n\n          map[1][i] = '<';\n\n          map[1][i + 1] = '>';\n\n          A--;\n        }\n      }\n    }\n\n    if (M % 2 == 1)\n\n    {\n\n      if (N >= 2)\n\n      {\n\n        for (int i = 1; i < N; i += 2)\n\n        {\n\n          if (B == 0)\n            break;\n\n          map[i][M] = '^';\n\n          map[i + 1][M] = 'v';\n\n          B--;\n        }\n      }\n    }\n\n    for (int j = 1; j < M; j++)\n\n    {\n\n      if (A == 0)\n        break;\n\n      for (int i = 1; i <= N; i++)\n\n      {\n\n        if (A == 0)\n          break;\n\n        if (map[i][j] == '.' && map[i][j + 1] == '.')\n\n        {\n\n          map[i][j] = '<';\n\n          map[i][j + 1] = '>';\n\n          A--;\n        }\n      }\n    }\n\n    for (int i = 1; i < N; i++)\n\n    {\n\n      if (B == 0)\n        break;\n\n      for (int j = 1; j <= M; j++)\n\n      {\n\n        if (B == 0)\n          break;\n\n        if (map[i][j] == '.' && map[i + 1][j] == '.')\n\n        {\n\n          map[i][j] = '^';\n\n          map[i + 1][j] = 'v';\n\n          B--;\n        }\n      }\n    }\n  }\n\n  if (!(A == 0 && B == 0))\n\n  {\n\n    memset(map, '.', sizeof(map));\n\n    A = tempA, B = tempB;\n\n    if (N % 2 == 1)\n\n    {\n\n      if (M >= 2)\n\n      {\n\n        for (int i = 1; i + 1 <= M; i += 2)\n\n        {\n\n          if (A == 0)\n            break;\n\n          map[1][i] = '<';\n\n          map[1][i + 1] = '>';\n\n          A--;\n        }\n      }\n    }\n\n    if (M % 2 == 1)\n\n    {\n\n      if (N >= 2)\n\n      {\n\n        for (int i = 1; i < N; i += 2)\n\n        {\n\n          if (B == 0)\n            break;\n\n          map[i][M] = '^';\n\n          map[i + 1][M] = 'v';\n\n          B--;\n        }\n      }\n    }\n\n    for (int i = 1; i < N; i++)\n\n    {\n\n      if (B == 0)\n        break;\n\n      for (int j = 1; j <= M; j++)\n\n      {\n\n        if (B == 0)\n          break;\n\n        if (map[i][j] == '.' && map[i + 1][j] == '.')\n\n        {\n\n          map[i][j] = '^';\n\n          map[i + 1][j] = 'v';\n\n          B--;\n        }\n      }\n    }\n\n    for (int j = 1; j < M; j++)\n\n    {\n\n      if (A == 0)\n        break;\n\n      for (int i = 1; i <= N; i++)\n\n      {\n\n        if (A == 0)\n          break;\n\n        if (map[i][j] == '.' && map[i][j + 1] == '.')\n\n        {\n\n          map[i][j] = '<';\n\n          map[i][j + 1] = '>';\n\n          A--;\n        }\n      }\n    }\n  }\n\n  if (!(A == 0 && B == 0))\n\n  {\n\n    memset(map, '.', sizeof(map));\n\n    A = tempA, B = tempB;\n\n    if (N >= 3 && M >= 3)\n\n    {\n\n      if (A != 0)\n\n      {\n\n        map[N - 2][1] = '<';\n\n        map[N - 2][2] = '>';\n\n        A--;\n      }\n\n      if (B != 0)\n\n      {\n\n        map[N - 2][3] = '^';\n\n        map[N - 1][3] = 'v';\n\n        B--;\n      }\n\n      if (B != 0)\n\n      {\n\n        map[N - 1][1] = '^';\n\n        map[N][1] = 'v';\n\n        B--;\n      }\n\n      if (A != 0)\n\n      {\n\n        map[N][2] = '<';\n\n        map[N][3] = '>';\n\n        A--;\n      }\n    }\n\n    for (int i = 1; i <= N; i++)\n\n    {\n\n      if (A == 0)\n        break;\n\n      for (int j = 1; j < M; j++)\n\n      {\n\n        if (A == 0)\n          break;\n\n        if (map[i][j] == '.' && map[i][j + 1] == '.')\n\n        {\n\n          map[i][j] = '<';\n\n          map[i][j + 1] = '>';\n\n          A--;\n        }\n      }\n    }\n\n    for (int i = 1; i < N; i++)\n\n    {\n\n      if (B == 0)\n        break;\n\n      for (int j = 1; j <= M; j++)\n\n      {\n\n        if (B == 0)\n          break;\n\n        if (map[i][j] == '.' && map[i + 1][j] == '.')\n\n        {\n\n          map[i][j] = '^';\n\n          map[i + 1][j] = 'v';\n\n          B--;\n        }\n      }\n    }\n  }\n\n  if (!(A == 0 && B == 0))\n\n  {\n\n    memset(map, '.', sizeof(map));\n\n    A = tempA, B = tempB;\n\n    if (N >= 3 && M >= 3)\n\n    {\n\n      if (A != 0)\n\n      {\n\n        map[N - 2][1] = '<';\n\n        map[N - 2][2] = '>';\n\n        A--;\n      }\n\n      if (B != 0)\n\n      {\n\n        map[N - 2][3] = '^';\n\n        map[N - 1][3] = 'v';\n\n        B--;\n      }\n\n      if (B != 0)\n\n      {\n\n        map[N - 1][1] = '^';\n\n        map[N][1] = 'v';\n\n        B--;\n      }\n\n      if (A != 0)\n\n      {\n\n        map[N][2] = '<';\n\n        map[N][3] = '>';\n\n        A--;\n      }\n    }\n\n    if (M % 2 == 1)\n\n    {\n\n      for (int j = 1; j < N; j++)\n\n      {\n\n        if (B == 0)\n          break;\n\n        if (map[j][1] == '.' && map[j + 1][1] == '.')\n\n        {\n\n          map[j][1] = '^';\n\n          map[j + 1][1] = 'v';\n\n          B--;\n        }\n      }\n    }\n\n    for (int i = 1; i < N; i++)\n\n    {\n\n      if (B == 0)\n        break;\n\n      for (int j = 1; j <= M; j++)\n\n      {\n\n        if (B == 0)\n          break;\n\n        if (map[i][j] == '.' && map[i + 1][j] == '.')\n\n        {\n\n          map[i][j] = '^';\n\n          map[i + 1][j] = 'v';\n\n          B--;\n        }\n      }\n    }\n\n    for (int i = 1; i <= N; i++)\n\n    {\n\n      if (A == 0)\n        break;\n\n      for (int j = 1; j < M; j++)\n\n      {\n\n        if (A == 0)\n          break;\n\n        if (map[i][j] == '.' && map[i][j + 1] == '.')\n\n        {\n\n          map[i][j] = '<';\n\n          map[i][j + 1] = '>';\n\n          A--;\n        }\n      }\n    }\n  }\n\n  if (A == 0 && B == 0)\n\n  {\n\n    printf(\"YES\\n\");\n\n    for (int i = 1; i <= N; i++) {\n      for (int j = 1; j <= M; j++)\n        printf(\"%c\", map[i][j]);\n      printf(\"\\n\");\n    }\n\n  } else\n    printf(\"NO\\n\");\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 2000000000\n\ntypedef long long int ll;\n\ntypedef pair<ll, ll> ii;\n\ntypedef pair<ii, ll> iii;\n\ntypedef vector<ll> vi;\n\ntypedef vector<ii> vii;\n\n#define getbit(n, i) (((n) & (1LL << (i))) != 0)\n\n#define setbit0(n, i) ((n) & (~(1LL << (i))))\n\n#define setbit1(n, i) ((n) | (1LL << (i)))\n\n#define lastone(n) ((n) & (-(n)))\n\n#define read freopen(\"debug\\\\in.txt\", \"r\", stdin)\n\n#define write freopen(\"debug\\\\out.txt\", \"w\", stdout)\n\n#define DBG(a) cout << #a << \" ->->->-> \" << a << \"\\n\"\n\n#define EN cout << \"\\n\"\n\n#define fi first\n\n#define se second\n\n#define PI (acos(-1))\n\n#define fastread                                                                                   \\\n  ios::sync_with_stdio(false);                                                                     \\\n  cin.tie(NULL)\n\n#define mod (1000000007)\n\n#define asz 200005\n\ntemplate <class T>\nostream &operator<<(ostream &s, pair<T, ll> a)\n\n{\n\n  s << a.fi << ' ' << a.se;\n\n  return s;\n}\n\nchar grid[1005][1005];\n\nint main()\n\n{\n\n  fastread;\n\n  ll T = 1;\n\n  for (ll qq = 1; qq <= T; qq++)\n\n  {\n\n    ll n, m, a, b;\n\n    cin >> n >> m >> a >> b;\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      if ((n - i) % 2)\n\n      {\n\n        for (int j = 0; j < min(m / 2, a); j++)\n\n        {\n\n          grid[i][2 * j] = '<';\n\n          grid[i][2 * j + 1] = '>';\n        }\n\n        a -= min(m / 2, a);\n\n        if (a == 0)\n          break;\n\n      }\n\n      else\n\n      {\n\n        ll x = m / 2;\n\n        for (int j = 0; j < min(x * 2, a); j++)\n\n        {\n\n          if (m % 2 && n % 2 && (a - j) == 1 && j % 2 == 0)\n\n          {\n\n            grid[n - 1][m - 2] = '<';\n\n            grid[n - 1][m - 1] = '>';\n\n            continue;\n          }\n\n          grid[i + j % 2][j / 2 * 2] = '<';\n\n          grid[i + j % 2][j / 2 * 2 + 1] = '>';\n        }\n\n        a -= min(x * 2, a);\n\n        i++;\n\n        if (a == 0)\n          break;\n      }\n    }\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      for (int j = 0; j < m; j++)\n\n      {\n\n        if (grid[i][j] == 0 && i != n - 1 && grid[i + 1][j] == 0 && b)\n\n        {\n\n          grid[i][j] = '^';\n\n          grid[i + 1][j] = 'v';\n\n          b--;\n\n        }\n\n        else if (grid[i][j] == 0)\n          grid[i][j] = '.';\n      }\n\n      grid[i][m] = '\\0';\n    }\n\n    if (a || b)\n      cout << \"NO\" << endl;\n\n    else\n\n    {\n\n      cout << \"YES\" << endl;\n\n      for (int i = 0; i < n; i++)\n\n        cout << grid[i] << endl;\n    }\n  }\n}"}
{"fast_code_id":"5458f526b509cfca71018a6ef4973e7581f47830519050d4189ba4059292f1bb","fast_id":"ef921fb1b6091032e822b2053ec4b1faa441c2e2a303f3b6e1b052888556afce","fast_time":0.0216381259,"language":"cpp","measured_fast_code_id":"ef921fb1b6091032e822b2053ec4b1faa441c2e2a303f3b6e1b052888556afce","measured_slow_code_id":"fd8423e91511257fbfb436e4c398aec7afc52b1e9876417226f73275d02143e8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56633","problem_id":"p02686","slow_code_id":"dc49bd2b2682d70b2f3becb506320c33b2f5bc90429554d3b787be4cc35c77ad","slow_id":"fd8423e91511257fbfb436e4c398aec7afc52b1e9876417226f73275d02143e8","slow_time":0.0987621123,"speedup":4.564263686995185,"stratum":"4-8","sampling_key":"19eb9c32c230ed4caedd7250f460e4b633e2512e73b5029a5a4713c43a85cd1d","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  int N;\n\n  scanf(\"%d \", &N);\n\n  int sL[101] = {}, sR[101] = {};\n\n  vector<pair<int, int>> RR, LL;\n\n  int tot = 0;\n\n  rep(i, N) {\n\n    char c;\n\n    int l = 0, r = 0;\n\n    while ((c = getchar_unlocked()) >= '(') {\n\n      if (c == '(')\n        r++;\n\n      else {\n\n        if (r > 0)\n          r--;\n\n        else\n          l++;\n      }\n    }\n\n    tot += r - l;\n\n    if (l < r) {\n\n      if (l <= 100)\n        sR[l] += r;\n\n      else\n        RR.pb({l, r});\n\n    }\n\n    else {\n\n      if (r <= 100)\n        sL[r] += l;\n\n      else\n        LL.pb({r, l});\n    }\n  }\n\n  if (tot != 0) {\n\n    printf(\"No\");\n\n    return 0;\n  }\n\n  sort(RR.begin(), RR.end());\n\n  sort(LL.begin(), LL.end());\n\n  int OK = 1;\n\n  int k = 0;\n\n  rep(i, 101) {\n\n    if (sR[i]) {\n\n      if (k < i)\n        OK = 0;\n\n      k += sR[i];\n    }\n  }\n\n  rep(i, RR.size()) {\n\n    if (k < RR[i].first)\n      OK = 0;\n\n    k += RR[i].second - RR[i].first;\n  }\n\n  k = 0;\n\n  rep(i, 101) {\n\n    if (sL[i]) {\n\n      if (k < i)\n        OK = 0;\n\n      k += sL[i];\n    }\n  }\n\n  rep(i, LL.size()) {\n\n    if (k < LL[i].first) {\n\n      OK = 0;\n    }\n\n    k += LL[i].second - LL[i].first;\n  }\n\n  if (OK)\n    printf(\"Yes\");\n\n  else\n    printf(\"No\");\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  int N;\n\n  scanf(\"%d \", &N);\n\n  int sL[1001] = {}, sR[1001] = {};\n\n  bool bL[1001] = {}, bR[1001] = {};\n\n  pair<int, int> RR[500], LL[500];\n\n  int rr = 0, ll = 0;\n\n  int tot = 0;\n\n  rep(i, N) {\n\n    char c;\n\n    int l = 0, r = 0;\n\n    while ((c = getchar_unlocked()) >= '(') {\n\n      if (c == '(')\n        r++;\n\n      else {\n\n        if (r > 0)\n          r--;\n\n        else\n          l++;\n      }\n    }\n\n    tot += r - l;\n\n    if (l <= r) {\n\n      if (l <= 1000)\n        sR[l] += r - l, bR[l] = true;\n\n      else\n        RR[rr++] = {l, r};\n\n    }\n\n    else {\n\n      if (r <= 1000)\n        sL[r] += l - r, bL[r] = true;\n\n      else\n        LL[ll++] = {r, l};\n    }\n  }\n\n  if (tot != 0) {\n\n    printf(\"No\");\n\n    return 0;\n  }\n\n  sort(RR, RR + rr);\n\n  sort(LL, LL + ll);\n\n  int OK = 1;\n\n  int k = 0;\n\n  rep(i, 1001) {\n\n    if (bR[i]) {\n\n      if (k < i)\n        OK = 0;\n\n      k += sR[i];\n    }\n  }\n\n  rep(i, rr) {\n\n    if (k < RR[i].first)\n      OK = 0;\n\n    k += RR[i].second - RR[i].first;\n  }\n\n  k = 0;\n\n  rep(i, 1001) {\n\n    if (bL[i]) {\n\n      if (k < i)\n        OK = 0;\n\n      k += sL[i];\n    }\n  }\n\n  rep(i, ll) {\n\n    if (k < LL[i].first) {\n\n      OK = 0;\n    }\n\n    k += LL[i].second - LL[i].first;\n  }\n\n  if (OK)\n    printf(\"Yes\");\n\n  else\n    printf(\"No\");\n\n  Would you please return 0;\n}"}
{"fast_code_id":"9f2dc0178a19161e17f8a740e952223187f79c5af2a9134b3c1a5316356840fe","fast_id":"da184a3ffc52c4fe60be2d7ed7003a40b471e033c8e930802f263b03c429cb1f","fast_time":0.1061648288,"language":"cpp","measured_fast_code_id":"da184a3ffc52c4fe60be2d7ed7003a40b471e033c8e930802f263b03c429cb1f","measured_slow_code_id":"27dfac040b9be884f916db2d88caa3b401a1477d89b668c6e6d943057395ae29","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56793","problem_id":"p04044","slow_code_id":"96f657cc6fa5f8b914f1a85b92c7430d8047fb7e11d567ef571efbf4d9162ca2","slow_id":"27dfac040b9be884f916db2d88caa3b401a1477d89b668c6e6d943057395ae29","slow_time":0.3685841951,"speedup":3.4718107613055373,"stratum":"2-4","sampling_key":"8cd1a3fb73d5688c37829a4769774ad1ba52c4e49a41e8e5719eabe5d3252ded","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 100005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nbool check[maxii];\n\nbool dfs(int node, int c)\n\n{\n\n  check[node] = true;\n\n  arr2[node] = c;\n\n  for (int child = 0; child < vi[node].size(); child++)\n\n  {\n\n    if (check[vi[node][child]] == false)\n\n    {\n\n      if (dfs(vi[node][child], c ^ 1) == false)\n\n      {\n\n        return false;\n      }\n\n    }\n\n    else if (arr2[node] == arr2[vi[node][child]])\n\n    {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main()\n\n{\n\n  string aarr[105];\n\n  int n, l;\n\n  cin >> n >> l;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> aarr[i];\n  }\n\n  sort(aarr, aarr + n);\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cout << aarr[i];\n  }\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define optimize()                                                                                 \\\n  ios_base::sync_with_stdio(0);                                                                    \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0);\n\n#define endl '\\n'\n\nint main()\n\n{\n\n  optimize();\n\n  int n, l;\n\n  vector<string> v;\n\n  string s;\n\n  cin >> n >> l;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> s;\n\n    v.push_back(s);\n  }\n\n  sort(v.begin(), v.end());\n\n  for (string u : v)\n\n    cout << u;\n\n  return 0;\n}\n"}
{"fast_code_id":"ccf16dc826ddb9af285f8fbb98f1fa284f21129bb528f8fada22e2a743a0cdf7","fast_id":"734297ae1adfd019391dbfd80bed540ff816c0efb485089a0869582bbae9997a","fast_time":0.0039676983,"language":"cpp","measured_fast_code_id":"734297ae1adfd019391dbfd80bed540ff816c0efb485089a0869582bbae9997a","measured_slow_code_id":"ed2b50ea1c6271b007722b99c2b7e496cf9f68f469dc1ad397309d83532f6ecd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56832","problem_id":"p02977","slow_code_id":"fc927a7ddbddfae280d2e6e41417b90041ce6d1cc66b056cfff2f87d91b76c8f","slow_id":"ed2b50ea1c6271b007722b99c2b7e496cf9f68f469dc1ad397309d83532f6ecd","slow_time":0.0210598828,"speedup":5.307833713062306,"stratum":"4-8","sampling_key":"0c7e16d188fc7cd69b66a88540daa32f5e20f04b0502c429d66371cc22d9371a","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int N;\n  scanf(\"%d\", &N);\n\n  int t;\n\n  for (int i = 1; i <= N; t = i, i <<= 1)\n\n    if (N == i)\n\n    {\n\n      printf(\"No\\n\");\n\n      return 0;\n    }\n\n  if (N == 3)\n\n  {\n\n    printf(\"Yes\\n\");\n\n    for (int i = 1; i <= 5; ++i)\n\n      printf(\"%d %d\\n\", i, i + 1);\n\n  }\n\n  else\n\n  {\n\n    puts(\"Yes\");\n\n    for (int i = 2; i < N; i += 2)\n\n    {\n\n      printf(\"%d %d\\n\", 1, i);\n\n      printf(\"%d %d\\n\", i, i + 1);\n\n      printf(\"%d %d\\n\", 1, N + i + 1);\n\n      printf(\"%d %d\\n\", N + i + 1, N + i);\n    }\n\n    printf(\"%d %d\\n\", N + 1, 3);\n\n    if (!(N & 1))\n\n    {\n\n      printf(\"%d %d\\n\", N, N ^ t);\n\n      printf(\"%d %d\\n\", N * 2, N + (t ^ 1));\n    }\n  }\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nint n;\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  if (n < 3) {\n    printf(\"No\\n\");\n    return 0;\n  }\n\n  if (n & 1)\n\n  {\n\n    printf(\"Yes\\n\");\n\n    printf(\"%d %d\\n\", 1, 2);\n    printf(\"%d %d\\n\", 2, 3);\n    printf(\"%d %d\\n\", 3, n + 1);\n    printf(\"%d %d\\n\", n + 1, n + 2);\n    printf(\"%d %d\\n\", n + 2, n + 3);\n\n    for (int i = 4; i <= n; i += 2)\n      printf(\"%d %d\\n\", i, i + 1), printf(\"%d %d\\n\", i + n, i + n + 1), printf(\"%d %d\\n\", i, 1),\n          printf(\"%d %d\\n\", i + n + 1, 1);\n\n  }\n\n  else\n\n  {\n\n    for (int i = 1; i < n; i++)\n\n      if ((n ^ i ^ 1) < n)\n\n      {\n\n        int st = n ^ i ^ 1;\n\n        printf(\"Yes\\n\");\n\n        printf(\"%d %d\\n\", 1, 2);\n        printf(\"%d %d\\n\", 2, 3);\n        printf(\"%d %d\\n\", 3, n + 1);\n        printf(\"%d %d\\n\", n + 1, n + 2);\n        printf(\"%d %d\\n\", n + 2, n + 3);\n\n        for (int j = 4; j < n; j += 2)\n          printf(\"%d %d\\n\", j, j + 1), printf(\"%d %d\\n\", j + n, j + n + 1), printf(\"%d %d\\n\", j, 1),\n              printf(\"%d %d\\n\", j + n + 1, 1);\n\n        printf(\"%d %d\\n\", n, (i & 1) ? i + n : i);\n        printf(\"%d %d\\n\", n * 2, (st & 1) ? st + n : st);\n\n        return 0;\n      }\n\n    printf(\"No\\n\");\n  }\n}\n"}
{"fast_code_id":"4437e83c31bbf64305b5afe10e666da5f15bdf5e3d30056f6ccc504dd3247c61","fast_id":"f896e297a087c3286d54c2c2ca1e5b7cd85c53eead0d8631660ed5a6a10d53a8","fast_time":0.1074089316,"language":"cpp","measured_fast_code_id":"f896e297a087c3286d54c2c2ca1e5b7cd85c53eead0d8631660ed5a6a10d53a8","measured_slow_code_id":"1ad9a88f5ced0dd4e1c0d94110a65202c3d699dcc4c75ce24fd1fe38fd1fd059","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56849","problem_id":"p03262","slow_code_id":"bc70eb576b2a95ac5dd55d6c9cad54956adf10c7a37a66348103d472505edf67","slow_id":"1ad9a88f5ced0dd4e1c0d94110a65202c3d699dcc4c75ce24fd1fe38fd1fd059","slow_time":0.6877331023,"speedup":6.402941469161769,"stratum":"4-8","sampling_key":"fae573784cdf201ad9e0c40524ae6d656d4fb8d537bfb1218c78cbbf8fd3e690","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <numeric>\n\n#include <climits>\n\n#include <iterator>\n\n#include <iomanip>\n\n#include <stack>\n\n#include <set>\n\n#include <bitset>\n\n#include <functional>\n\nusing namespace std;\n\nconst constexpr int INF = 1e9;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\ntypedef long long ll;\n\ntypedef vector<int> VI;\n\nconst constexpr ll MOD = 1e9 + 7;\n\nstruct Less {\n\n  bool operator()(const pair<int, int> &x, const pair<int, int> &y) const {\n\n    return x.first > y.first;\n  }\n};\n\nll GCD(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  return GCD(b, a % b);\n}\n\nVI g[200010];\n\nint h[100010];\n\nll N, X;\n\nll x[100010];\n\nint main() {\n\n  cin >> N >> X;\n\n  REP(i, N) {\n\n    cin >> x[i];\n\n    x[i] = abs(x[i] - X);\n  }\n\n  ll ans = x[0];\n\n  for (int i = 0; i < N; ++i) {\n\n    if (ans < x[i])\n      ans = GCD(x[i], ans);\n\n    else\n      ans = GCD(ans, x[i]);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <climits>\n\n#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include <set>\n\n#include <cmath>\n\n#include <stack>\n\n#include <algorithm>\n\n#include <iomanip>\n\n#include <map>\n\n#include <queue>\n\n#include <functional>\n\n#include <numeric>\n\n#include <chrono>\n\n#include <cstdlib>\n\nusing ll = long long;\n\nusing namespace std;\n\nconst ll MOD = 1e9 + 7;\n\nconst double pi = acos(-1);\n\ntypedef pair<int, int> P;\n\n#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))\n\n#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)\n\n#define EPS 1e-4\n\n#define OUTPUT(i) (cout << (ll)i << endl)\n\n#define ALL(a) ((a).begin(), (a).end())\n\nbool operator<(const pair<ll, ll> &a, const pair<ll, ll> &b)\n\n{\n\n  if (a.first == b.first)\n\n    return a.second < b.second;\n\n  return a.first < b.first;\n}\n\nll gcd(ll a, ll b)\n\n{\n\n  if (b == 0)\n\n    return a;\n\n  return gcd(b, a % b);\n}\n\nvector<ll> v;\n\nint main()\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  ll N, X;\n\n  cin >> N >> X;\n\n  REP(i, N)\n\n  {\n\n    ll a;\n\n    cin >> a;\n\n    v.push_back(a);\n  }\n\n  v.push_back(X);\n\n  sort(v.begin(), v.end());\n\n  ll ans = v[1] - v[0];\n\n  for (int i = 2; i < N + 1; ++i)\n\n  {\n\n    ans = gcd(ans, v[i] - v[i - 1]);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"97ad7d552b18c82eede8251cd3a6317bc1ced8a7f71582ca4580e8ab12770571","fast_id":"75afaf849677bed4568983e9e9d3b948554be54f971b2e98e45fb784d29045b5","fast_time":0.0196657567,"language":"cpp","measured_fast_code_id":"75afaf849677bed4568983e9e9d3b948554be54f971b2e98e45fb784d29045b5","measured_slow_code_id":"b78ac9544d88561653c5844a39d03305787c9c0f5f74db6611d5459bf678e5c8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56871","problem_id":"p03719","slow_code_id":"75964fdd7e37d553fd1f794f80518f36388424137ff3055a5ee1187a1c7abbb3","slow_id":"b78ac9544d88561653c5844a39d03305787c9c0f5f74db6611d5459bf678e5c8","slow_time":0.3743626092,"speedup":19.036267706901917,"stratum":"8+","sampling_key":"2eb309b5304c3d2869e5fcc2911401ba33ff76e9b3013049be159146278f3d93","slow_code":"#include <iostream>\n\n#include <bits/stdc++.h>\n\n#define pb push_back\n\n#define ob pop_back\n\n#define xx first\n\n#define yy second\n\n#define dob double\n\n#define rin(i, n, k) for (int i = 0; i < n; i += k)\n\n#define int long long int\n\n#define ss size()\n\nusing namespace std;\n\nconst int M = 1e9 + 7, maxn = 100010;\n\nstd::vector<int> adj[maxn];\n\nstd::vector<int> v1;\n\nint ans, n, k, m, x, y, q, par[maxn], h[maxn], mach[maxn], sk[maxn], dp[maxn];\n\nbool mark[maxn], bpart[maxn];\n\nstring s, s1, s2;\n\nmap<string, int> mp;\n\nbool markchaild[maxn];\n\nbool dfsmach(int v) {\n\n  if (v == -1)\n    return true;\n\n  if (mark[v] == 1)\n    return false;\n\n  mark[v] = 1;\n\n  for (int i = 0; i < adj[v].ss; i++) {\n\n    int u = adj[v][i];\n\n    if (dfsmach(mach[u])) {\n\n      bpart[u] = ((bpart[v] + 1) % 2);\n\n      mach[u] = v;\n\n      mach[v] = u;\n\n      return true;\n    }\n  }\n\n  return false;\n}\n\nint32_t main() {\n\n  cin >> n >> m >> k;\n\n  if (n <= k && m >= k)\n\n    cout << \"Yes\";\n\n  else\n\n    cout << \"No\";\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int a, b, c;\n\n  scanf(\"%d %d %d\", &a, &b, &c);\n\n  if (c >= a && c <= b)\n\n  {\n\n    printf(\"Yes\\n\");\n\n  }\n\n  else\n    printf(\"No\\n\");\n}"}
{"fast_code_id":"1df38a508edd4e5a0bacd88c77c82b639d8d98c82f02ae7f595d9905a6208169","fast_id":"946a9a75d035f1e6b27826c3511dc1892fe9e48086777cb88f3f62bed89e772a","fast_time":0.1062106011,"language":"cpp","measured_fast_code_id":"946a9a75d035f1e6b27826c3511dc1892fe9e48086777cb88f3f62bed89e772a","measured_slow_code_id":"4d3234270733e39753262e4cd75e6806ca90311e9d7c59820b2de13e95ea38ff","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56902","problem_id":"p03618","slow_code_id":"8e4eb9be81cfcc1277b3f740a309434bee2816415b92188f13ab205d24ee4532","slow_id":"4d3234270733e39753262e4cd75e6806ca90311e9d7c59820b2de13e95ea38ff","slow_time":0.2791804284,"speedup":2.628555205493513,"stratum":"2-4","sampling_key":"ec58f0842ea39eee4919e071c02bf87b9fb6425357a8f3f1afbe24a7b1da8ef6","slow_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\n#define OUT(x) cerr << #x << \" = \" << x << endl;\n\n#define all(x) x.begin(), x.end()\n\n#define mp make_pair\n\n#define pii pair<int, int>\n\n#define pll pair<long long, long long>\n\n#define ll long long\n\nlong long fact[202020];\n\nlong long nCr(long long n, long long r) {\n\n  long long ans = fact[n];\n\n  ans /= fact[r] * fact[n - r];\n\n  return ans;\n}\n\nvoid init() {\n\n  fact[0] = 1;\n\n  for (int i = 1; i < 202020; i++)\n    fact[i] = fact[i - 1] * i;\n}\n\nint main() {\n\n  init();\n\n  string s;\n\n  cin >> s;\n\n  vector<long long> cnt(26, 0);\n\n  long long n = s.size();\n\n  for (int i = 0; i < n; i++) {\n\n    cnt[s[i] - 'a']++;\n  }\n\n  long long ans = 1;\n\n  ans += n * (n - 1) / 2;\n\n  for (int i = 0; i < 26; i++) {\n\n    if (cnt[i] < 2)\n      continue;\n\n    ans -= cnt[i] * (cnt[i] - 1) / 2;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nint main() {\n\n  string s;\n  cin >> s;\n\n  vector<long long> cnt(26, 0);\n\n  long long n = s.size();\n\n  for (int i = 0; i < n; i++)\n    cnt[s[i] - 'a']++;\n\n  long long ans = 1 + n * (n - 1) / 2;\n\n  for (int i = 0; i < 26; i++)\n    if (cnt[i] >= 2)\n      ans -= cnt[i] * (cnt[i] - 1) / 2;\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"0c1330d5acf0997cd645659d1c64cb6e84f7f563e8759090ae3e65caf75c240d","fast_id":"bacb102ce1644d36260e716a1769a87cf4c43306ea91f5fe030bf94520b79cbb","fast_time":0.105092519,"language":"cpp","measured_fast_code_id":"bacb102ce1644d36260e716a1769a87cf4c43306ea91f5fe030bf94520b79cbb","measured_slow_code_id":"cf8be34020a76189ec8bc8db5a99a585fc64488b521a9c9ca9b112116d754179","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56927","problem_id":"p03852","slow_code_id":"27f8be6ab83f4e3e629dfb11afcadfe9acfc1b8126d1ad37fefb7b0327c9b595","slow_id":"cf8be34020a76189ec8bc8db5a99a585fc64488b521a9c9ca9b112116d754179","slow_time":0.6865964442,"speedup":6.533257083694036,"stratum":"4-8","sampling_key":"1cb3aaad7069bc16543f4f6637084c7224d2c60ac733443377cc7855d3fcde6e","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 200005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nint main()\n\n{\n\n  char a;\n\n  cin >> a;\n\n  if (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')\n    cout << \"vowel\";\n\n  else\n    cout << \"consonant\";\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  char c;\n\n  cin >> c;\n\n  if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {\n\n    cout << \"vowel\" << endl;\n\n  }\n\n  else {\n\n    cout << \"consonant\" << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"a8efaac1814f55ef5a3e34bd1ed03ede9eb32510a1f2333401099921906ca805","fast_id":"b8b89a1b86769951cd8e88da6e2c88e4c55f3c7a0ca1fd6b4fa9d2fdce076f4d","fast_time":0.0153174619,"language":"cpp","measured_fast_code_id":"b8b89a1b86769951cd8e88da6e2c88e4c55f3c7a0ca1fd6b4fa9d2fdce076f4d","measured_slow_code_id":"09ad8a0f26ad82b1529f1cd05387b7ae5076a62b13cf7780803fa10bdc842252","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_56956","problem_id":"p03915","slow_code_id":"47b4fa2d1fe331b0829576252aefef0b6974f50447833f94e7db4c78a137f923","slow_id":"09ad8a0f26ad82b1529f1cd05387b7ae5076a62b13cf7780803fa10bdc842252","slow_time":0.3480560775,"speedup":22.72282965495739,"stratum":"8+","sampling_key":"af7f8196a6ba93400192b323b369032208e4b6a888c63e54a959fad25cd1d194","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long int ll;\n\nconst ll MAXN = 4e5 + 51;\n\nstruct Edge {\n\n  ll from, to, dist;\n\n  inline bool operator<(const Edge &rhs) const\n\n  {\n\n    return this->dist < rhs.dist;\n  }\n};\n\nEdge ed[MAXN];\n\nll nc, cnt, x, y, z, tot;\n\nll dist[MAXN], boss[MAXN];\n\ninline ll read()\n\n{\n\n  register ll num = 0, neg = 1;\n\n  register char ch = getchar();\n\n  while (!isdigit(ch) && ch != '-')\n\n  {\n\n    ch = getchar();\n  }\n\n  if (ch == '-')\n\n  {\n\n    neg = -1;\n\n    ch = getchar();\n  }\n\n  while (isdigit(ch))\n\n  {\n\n    num = (num << 3) + (num << 1) + (ch - '0');\n\n    ch = getchar();\n  }\n\n  return num * neg;\n}\n\ninline void setup(ll cnt)\n\n{\n\n  for (register int i = 0; i < cnt; i++)\n\n  {\n\n    boss[i] = i;\n  }\n}\n\ninline void update()\n\n{\n\n  for (register int i = 0; i < nc; i++)\n\n  {\n\n    dist[i] = min(dist[i], dist[(i + nc - 1) % nc] + 2);\n  }\n}\n\ninline ll findb(ll node)\n\n{\n\n  if (node == boss[node])\n\n  {\n\n    return node;\n  }\n\n  boss[node] = findb(boss[node]);\n\n  return boss[node];\n}\n\ninline void Union(ll x, ll y)\n\n{\n\n  ll bx = findb(x), by = findb(y);\n\n  if (bx != by)\n\n  {\n\n    boss[by] = bx;\n  }\n}\n\ninline ll Kruskal()\n\n{\n\n  ll res = 0, k = 0;\n\n  sort(ed, ed + tot), setup(nc);\n\n  for (register int i = 0; k < nc - 1; i++)\n\n  {\n\n    if (findb(ed[i].from) != findb(ed[i].to))\n\n    {\n\n      Union(ed[i].from, ed[i].to), res += ed[i].dist, k++;\n    }\n  }\n\n  return res;\n}\n\nint main()\n\n{\n\n  nc = read(), cnt = read(), memset(dist, 0x3f, sizeof(dist));\n\n  for (register int i = 0; i < cnt; i++)\n\n  {\n\n    x = read(), y = read(), z = read();\n\n    ed[tot++] = (Edge){x, y, z};\n\n    dist[x] = min(dist[x], z + 1), dist[y] = min(dist[y], z + 2);\n  }\n\n  update(), update();\n\n  for (register int i = 0; i <= nc; i++)\n\n  {\n\n    ed[tot++] = (Edge){i, (i + 1) % nc, dist[i]};\n  }\n\n  printf(\"%lld\", Kruskal());\n}","fast_code":"#include <algorithm>\n\n#include <cstdio>\n\ninline int read() {\n\n  char c = getchar();\n  int x = 0;\n\n  for (; c < '0' || c > '9'; c = getchar())\n    ;\n\n  for (; c >= '0' && c <= '9'; c = getchar())\n    x = x * 10 + c - '0';\n\n  return x;\n}\n\ninline int min(int a, int b) { return a < b ? a : b; }\n\ninline void swap(int &a, int &b) {\n\n  int tmp = a;\n  a = b;\n  b = tmp;\n}\n\nconst int N = 2e5 + 5;\n\nint n, q, m, w[N], fa[N], sz[N];\n\nstruct Edge {\n\n  int u, v, w;\n\n  bool operator<(const Edge &r) const { return w < r.w; }\n\n} e[N << 1];\n\nint find(int x) {\n\n  if (x == fa[x])\n    return x;\n  else\n    return fa[x] = find(fa[x]);\n}\n\ninline void unit(int x, int y) {\n\n  if (sz[x] < sz[y])\n    swap(x, y);\n  fa[y] = x;\n  sz[x] += sz[y];\n}\n\nint main() {\n\n  n = read();\n  q = read();\n  int pos = 0;\n\n  for (int i = 0; i < n; ++i)\n    w[i] = 2e9;\n\n  for (int i = 1, a, b, c; i <= q; ++i) {\n\n    a = read();\n    b = read();\n    c = read();\n\n    e[++m] = (Edge){a, b, c};\n\n    w[(a + 1) % n] = min(w[(a + 1) % n], c + 1);\n\n    w[(b + 1) % n] = min(w[(b + 1) % n], c + 2);\n  }\n\n  for (int i = 0; i < n; ++i)\n    if (w[i] < w[pos])\n      pos = i;\n\n  for (int i = (pos + 1) % n, j = pos; i != pos;) {\n\n    w[i] = min(w[i], w[j] + 2);\n    j = i;\n    i = (i + 1) % n;\n  }\n\n  for (int i = 0; i < n; ++i)\n    e[++m] = (Edge){(i + n - 1) % n, i, w[i]};\n\n  std::sort(e + 1, e + 1 + m);\n  long long ans = 0;\n\n  for (int i = 0; i < n; ++i)\n    fa[i] = i, sz[i] = 1;\n\n  for (int i = 1; i <= m; ++i) {\n\n    int u = find(e[i].u), v = find(e[i].v);\n\n    if (u ^ v)\n      unit(u, v), ans += e[i].w;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"712d0ee1938074c55c09886cb4d062ba357da3097c7926ff97702a3ef95dbe50","fast_id":"1e3672d33bfcb4e9b4001b6b7f0d88865520481e5a5b0a8e6acf4d0f4c180402","fast_time":0.0041307938,"language":"cpp","measured_fast_code_id":"1e3672d33bfcb4e9b4001b6b7f0d88865520481e5a5b0a8e6acf4d0f4c180402","measured_slow_code_id":"27c2231eada26a5eabaf99cb8ec66007cb8b519d3b695c1389288438f54741c0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57012","problem_id":"p00760","slow_code_id":"90860a98b548fea59a62663ab6997d06a90e58cc5617ea05bdb89212ac405089","slow_id":"27c2231eada26a5eabaf99cb8ec66007cb8b519d3b695c1389288438f54741c0","slow_time":0.0245189951,"speedup":5.935661833326079,"stratum":"4-8","sampling_key":"284af5ee54d32381faffec4c611f09a1dd1a569e9cacb60da10ff8c080df33af","slow_code":"#include <string>\n\n#include <vector>\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <stack>\n\n#include <queue>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <list>\n\n#include <deque>\n\n#include <bitset>\n\n#include <set>\n\n#include <map>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <sstream>\n\n#define X first\n\n#define Y second\n\n#define pb push_back\n\nusing namespace std;\n\nint n, y, m, d, sum, days;\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  while (n--) {\n\n    scanf(\"%d %d %d\", &y, &m, &d);\n\n    sum = 0;\n\n    for (; y < 1000; y++) {\n\n      for (; m <= 10; m++) {\n\n        days = 19 + (y % 3 == 0 || m % 2 == 1);\n\n        for (; d <= days; d++) {\n\n          sum++;\n        }\n\n        d = 1;\n      }\n\n      m = 1;\n    }\n\n    printf(\"%d\\n\", sum);\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int n, Y, M, D;\n\n  int year = 20 * 5 + 19 * 5, year3 = 20 * 10;\n\n  int yearsum = 999 * year + (int)(1000 / 3) * 5;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d %d %d\", &Y, &M, &D);\n\n    Y--;\n    M--;\n    D--;\n\n    printf(\"%d\\n\", yearsum - (Y * year + (int)(Y / 3) * 5 + M * 19 + D +\n                              (((Y + 1) % 3) ? (int)((M + 1) / 2) : M)));\n  }\n}"}
{"fast_code_id":"321b86dd444864d2da8a163fcf5c66278a3f12e43dd19f1ceaa765a31a587989","fast_id":"b64c696bd622b61cf38dbb31d80f6b4b4f43fdfe5c0d38a7ae91ce5216a7da1c","fast_time":0.0128490994,"language":"cpp","measured_fast_code_id":"b64c696bd622b61cf38dbb31d80f6b4b4f43fdfe5c0d38a7ae91ce5216a7da1c","measured_slow_code_id":"0e90f73545afe339f9c01da6f539611d70cbb537a41b6354f2eda3ad92bf4923","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57064","problem_id":"p03721","slow_code_id":"bbf057a5c995042a5a6d6bda872c28c30ccc8dd631319dcb1769fb966de999ce","slow_id":"0e90f73545afe339f9c01da6f539611d70cbb537a41b6354f2eda3ad92bf4923","slow_time":0.1281845594,"speedup":9.976151277964275,"stratum":"8+","sampling_key":"b8fd5fec30d9246033aeaec50c81d71cc126b07fe0deb7584d4e653706c32875","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline ll getint() {\n\n  ll A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  ll N = getint(), K = getint();\n\n  ll S[100001] = {};\n\n  rep(i, N) {\n\n    int a = getint(), b = getint();\n\n    S[a] += b;\n  }\n\n  int k;\n\n  for (k = 1; k <= 100000; k++) {\n\n    K -= S[k];\n\n    if (K <= 0)\n      break;\n  }\n\n  co(k);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\ninline ll getK() {\n\n  ll A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nll A[100001];\n\nint main() {\n\n  ll N = getint(), K = getK();\n\n  rep(i, N) {\n\n    int a = getint();\n\n    A[a] += getint();\n  }\n\n  ll kazu = 0;\n\n  int kotae = 1;\n\n  for (; kotae <= 100000; kotae++) {\n\n    kazu += A[kotae];\n\n    if (kazu >= K)\n      break;\n  }\n\n  printf(\"%d\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"39e456c33a3c6f3800acdcbc8d5a5cd800e3cea3fb98db42f985fe06e14c44e2","fast_id":"bacbbd89b00ccc1a91bc21febdc77fb52fcb2f697074d72bf24a48a87762a07e","fast_time":0.019799826,"language":"cpp","measured_fast_code_id":"bacbbd89b00ccc1a91bc21febdc77fb52fcb2f697074d72bf24a48a87762a07e","measured_slow_code_id":"95861eba6a8953dfeb53ce322b177d7b6e466050bc1e78d269c93c1304299c22","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_5717","problem_id":"p00009","slow_code_id":"5a0e31ccbfc0925c1157ea59c92c1b768a4949d14a678383e4aa7f521f2d0bac","slow_id":"95861eba6a8953dfeb53ce322b177d7b6e466050bc1e78d269c93c1304299c22","slow_time":0.3614936365,"speedup":18.257414812635222,"stratum":"8+","sampling_key":"59e3ceff3df317ac53089199a85f2ccdc931de769e4b6072612a524bb2fa4152","slow_code":"#include <stdio.h>\n\n#include <math.h>\n\nbool flag[1000000];\n\nint main(void)\n\n{\n\n  long long i, j, p, n, count;\n\n  p = (long long)sqrt(1000000.0);\n\n  for (i = 3; i <= p; i = i + 2)\n\n  {\n\n    if (flag[i] == false)\n\n    {\n\n      for (j = i * i; j <= 1000000; j = j + 2 * i)\n\n      {\n\n        flag[j] = true;\n      }\n    }\n  }\n\n  while ((scanf(\"%lld\", &n)) != EOF)\n\n  {\n\n    if (n == 1 || n == 0)\n\n      count = 0;\n\n    else\n\n    {\n\n      count = 1;\n\n      for (i = 3; i <= n; i = i + 2)\n\n      {\n\n        if (flag[i] == false)\n\n          count++;\n      }\n    }\n\n    printf(\"%lld\\n\", count);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\n#define MAX 1000000\n\nint prime[MAX];\n\nbool is_prime[MAX];\n\nint sieve(int n) {\n\n  int p = 0;\n\n  for (int i = 0; i <= n; i++)\n\n    is_prime[i] = true;\n\n  is_prime[0] = is_prime[1] = false;\n\n  for (int i = 2; i <= n; i++) {\n\n    if (is_prime[i]) {\n\n      prime[p++] = i;\n\n      for (int j = 2 * i; j <= n; j += i)\n\n        is_prime[j] = false;\n    }\n  }\n\n  return p;\n}\n\nint main()\n\n{\n\n  int num;\n\n  while (scanf(\"%d\", &num) != EOF) {\n\n    printf(\"%d\\n\", sieve(num));\n  }\n\n  return 0;\n}"}
{"fast_code_id":"1f847b389557ac34e86cd3808bf7dfa92f3d4cf5999382887027907e470fc07e","fast_id":"c9153df9ce199ed719611fcf98035d4a130c5d02495288b877761c44d232e864","fast_time":0.107461374,"language":"cpp","measured_fast_code_id":"c9153df9ce199ed719611fcf98035d4a130c5d02495288b877761c44d232e864","measured_slow_code_id":"58d819ebbc004437b675dd9ef33d4e889623be8e7dcda04c0c88a850042096ed","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57196","problem_id":"p03363","slow_code_id":"12b079e254192df9146c31bdbce8aa8ef60ea1e5425ef7df7c004a4106421c14","slow_id":"58d819ebbc004437b675dd9ef33d4e889623be8e7dcda04c0c88a850042096ed","slow_time":0.2854272999,"speedup":2.6560920382425035,"stratum":"2-4","sampling_key":"6ac1e88d03ca48d9aa8d0bb3c80f39cd4299c43ec9b31567b6f3a9d609e51f8e","slow_code":"#include <iostream>\n\n#include <fstream>\n\n#include <set>\n\n#include <map>\n\n#include <string>\n\n#include <vector>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <functional>\n\n#include <algorithm>\n\n#include <climits>\n\n#include <cmath>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define ll long long int\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define rrep(i, n) for (int i = n; i >= 0; i--)\n\n#define REP(i, s, t) for (int i = s; i <= t; i++)\n\n#define RREP(i, s, t) for (int i = s; i >= t; i--)\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n\n#define INF 2000000000\n\n#define mod 1000000007\n\n#define INF2 1000000000000000000\n\n#define int long long\n\nsigned main(void)\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n  cin >> N;\n\n  int a[200010];\n\n  rep(i, N) cin >> a[i];\n\n  int sum[200010] = {};\n\n  rep(i, N) sum[i + 1] = sum[i] + a[i];\n\n  map<int, int> mp;\n\n  rep(i, N + 1) mp[sum[i]]++;\n\n  int ans = 0;\n\n  int num = 0;\n\n  rep(i, N) {\n\n    ans += mp[num] - 1;\n\n    mp[sum[i]]--;\n\n    num += a[i];\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <fstream>\n\n#include <set>\n\n#include <map>\n\n#include <string>\n\n#include <vector>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <functional>\n\n#include <algorithm>\n\n#include <climits>\n\n#include <cmath>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define ll long long int\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define rrep(i, n) for (int i = n; i >= 0; i--)\n\n#define REP(i, s, t) for (int i = s; i <= t; i++)\n\n#define RREP(i, s, t) for (int i = s; i >= t; i--)\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n\n#define INF 2000000000\n\n#define mod 1000000007\n\n#define INF2 1000000000000000000\n\n#define int long long\n\nint a[200010];\n\nint sum[200010];\n\nmap<int, int> mp;\n\nsigned main(void)\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n;\n  cin >> n;\n\n  rep(i, n) cin >> a[i];\n\n  rep(i, n) sum[i + 1] = sum[i] + a[i];\n\n  rep(i, n + 1) { mp[sum[i]]++; }\n\n  int ans = 0;\n\n  rep(i, n) {\n\n    mp[sum[i]]--;\n\n    ans += mp[sum[i]];\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"781c1dda4aad3f83277de059edc5a4d6786450b8c9588298e960c297290a919c","fast_id":"1bd9d998688d09eb3c2dfd553259bdeb8a08f6c4313e8a2e13530c8b7c9d9844","fast_time":0.0471924953,"language":"cpp","measured_fast_code_id":"1bd9d998688d09eb3c2dfd553259bdeb8a08f6c4313e8a2e13530c8b7c9d9844","measured_slow_code_id":"30d385613b60679a1520ec2bd6f4de6879ae17b88db4f72e7145d86afe1741a3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57232","problem_id":"p03990","slow_code_id":"e3515ffe5696fd1c75029fdf6239d0a22d7964f945d79fc4a99329872e4e38e2","slow_id":"30d385613b60679a1520ec2bd6f4de6879ae17b88db4f72e7145d86afe1741a3","slow_time":0.1256927835,"speedup":2.663406177210553,"stratum":"2-4","sampling_key":"cd08276fa99e30844953a37feb9ff3570f6732ca05786c9b53667ef4e6fe9850","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <queue>\n\nusing namespace std;\n\nconst int N = 2e5 + 10;\n\nstruct Tree\n\n{\n\n  struct edge {\n    int next, to;\n  } a[N << 1];\n\n  int head[N], cnt;\n\n  void link(int x, int y)\n\n  {\n\n    a[++cnt] = (edge){head[x], y};\n    head[x] = cnt;\n\n    a[++cnt] = (edge){head[y], x};\n    head[y] = cnt;\n  }\n\n} A, B;\n\nint n, p1, p2, dep[N], dis[N], fr[N], vis[N], ans;\n\nqueue<int> Q;\n\nvoid bfs1()\n\n{\n\n  memset(dis, -1, sizeof(dis));\n\n  if (dep[p1])\n    Q.push(p1);\n  dis[p1] = 0;\n\n  while (!Q.empty())\n\n  {\n\n    int x = Q.front();\n    Q.pop();\n    vis[x] = 1;\n\n    for (int i = A.head[x]; i; i = A.a[i].next)\n\n    {\n\n      int R = A.a[i].to;\n\n      if (dis[R] == -1)\n\n      {\n\n        dis[R] = dis[x] + 1;\n\n        if (dis[R] < dep[R])\n          Q.push(R);\n\n        else if (dis[R] == dis[R])\n          vis[R] = 1;\n      }\n    }\n  }\n}\n\nvoid bfs2()\n\n{\n\n  memset(dep, -1, sizeof(dep));\n\n  Q.push(p2);\n  dep[p2] = 0;\n\n  while (!Q.empty())\n\n  {\n\n    int x = Q.front();\n    Q.pop();\n\n    for (int i = B.head[x]; i; i = B.a[i].next)\n\n    {\n\n      int R = B.a[i].to;\n\n      if (dep[R] == -1)\n        dep[R] = dep[x] + 1, fr[R] = x, Q.push(R);\n    }\n  }\n}\n\nint Dis(int x, int y)\n\n{\n\n  if (dep[x] < dep[y])\n    swap(x, y);\n\n  if (fr[x] == fr[y] || x == y || fr[x] == y)\n    return 0;\n\n  if (fr[fr[x]] == y)\n    return 0;\n\n  return 1;\n}\n\nint main()\n\n{\n\n  cin >> n >> p1 >> p2;\n\n  for (int i = 1, x, y; i < n; i++)\n    scanf(\"%d%d\", &x, &y), A.link(x, y);\n\n  for (int i = 1, x, y; i < n; i++)\n    scanf(\"%d%d\", &x, &y), B.link(x, y);\n\n  bfs2();\n  bfs1();\n\n  for (int x = 1; x <= n; x++)\n\n    for (int i = A.head[x]; i; i = A.a[i].next)\n\n      if (vis[x] && vis[A.a[i].to] && Dis(x, A.a[i].to))\n\n        puts(\"-1\"), exit(0);\n\n  for (int i = 1; i <= n; i++)\n    if (vis[i])\n      ans = max(dep[i], ans);\n\n  cout << ans * 2 << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define MAXN 200005\n\nusing namespace std;\n\nint n, cnt, last[MAXN];\n\nint father[MAXN], deep[MAXN], dis[MAXN];\n\nint q[MAXN], nnn[MAXN], mx[MAXN];\n\nint tim, a[MAXN][2], xx, yy;\n\nbool vis[MAXN], win[MAXN];\n\nstruct edge\n\n{\n\n  int to, next, h;\n\n} t[MAXN * 4];\n\nvoid add(int u, int v, int h)\n\n{\n\n  t[++cnt].to = v;\n  t[cnt].h = h;\n\n  t[cnt].next = last[u];\n  last[u] = cnt;\n\n  t[++cnt].to = u;\n  t[cnt].h = h;\n\n  t[cnt].next = last[v];\n  last[v] = cnt;\n}\n\nvoid dfs(int x)\n\n{\n\n  deep[x] = deep[father[x]] + 1;\n  nnn[x] = ++tim;\n\n  for (int i = last[x]; i; i = t[i].next)\n\n    if (t[i].to != father[x])\n      father[t[i].to] = x, dfs(t[i].to);\n\n  mx[x] = ++tim;\n}\n\nbool check(int x, int y)\n\n{\n\n  if (nnn[x] > nnn[y])\n    swap(x, y);\n\n  if (nnn[x] < nnn[y] && mx[x] > nnn[y])\n    return deep[y] - deep[x] > 2 ? true : false;\n\n  if (father[x] == father[y])\n    return false;\n\n  return true;\n}\n\nvoid bfs()\n\n{\n\n  int h = 1, tt = 1;\n  q[1] = xx;\n  vis[xx] = 1;\n\n  while (h <= tt)\n\n  {\n\n    int x = q[h++];\n\n    for (int i = last[x]; i; i = t[i].next)\n\n      if (!t[i].h && !vis[t[i].to])\n\n      {\n\n        dis[t[i].to] = dis[x] + 1;\n\n        if (dis[t[i].to] < deep[t[i].to])\n          vis[t[i].to] = 1, q[++tt] = t[i].to;\n      }\n  }\n}\n\nint max(int a, int b) { return a > b ? a : b; }\n\ntemplate <class T>\ninline void read(T &res)\n\n{\n\n  static char ch;\n  T flag = 1;\n\n  while ((ch = getchar()) < '0' || ch > '9')\n    if (ch == '-')\n      flag = -1;\n  res = ch - 48;\n\n  while ((ch = getchar()) >= '0' && ch <= '9')\n    res = res * 10 + ch - 48;\n  res *= flag;\n}\n\nint main()\n\n{\n\n  int ans = 0;\n\n  read(n);\n  read(xx);\n  read(yy);\n\n  for (int i = 1; i < n; i++) {\n    read(a[i][0]);\n    read(a[i][1]);\n  }\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    int x, y;\n\n    read(x);\n    read(y);\n\n    add(x, y, 1);\n  }\n\n  deep[0] = -1;\n\n  dfs(yy);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    if (check(a[i][0], a[i][1]))\n\n      win[a[i][0]] = win[a[i][1]] = 1;\n\n    else\n      add(a[i][0], a[i][1], 0);\n  }\n\n  bfs();\n\n  for (int i = 1; i <= n; i++)\n\n    if (win[i] && vis[i])\n\n    {\n      putchar('-');\n      putchar('1');\n      return 0;\n    }\n\n  for (int i = 1; i <= n; i++)\n\n    if (vis[i])\n\n      ans = max(ans, deep[i] << 1);\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"17943a94f8274ceb77d54d4fddd3a0cd9cac10b8dcf6c6fd7169d29a32ba079b","fast_id":"b3ccb9319c98996170fd02dd358583b429cb64a15c16cc34e0b69a46a28121d7","fast_time":0.0537698624,"language":"cpp","measured_fast_code_id":"b3ccb9319c98996170fd02dd358583b429cb64a15c16cc34e0b69a46a28121d7","measured_slow_code_id":"d813011be66ee758b4a73970f5db2b81c0d9416d8bc97722287ba66f8de77341","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57242","problem_id":"p03969","slow_code_id":"a1960fc2d3229fc5afa8c36d8e38c3b0b6b4b08584db63cbdb94ad11bc4586f6","slow_id":"d813011be66ee758b4a73970f5db2b81c0d9416d8bc97722287ba66f8de77341","slow_time":0.1625100978,"speedup":3.0223268304290842,"stratum":"2-4","sampling_key":"fb8a95f7a8990b96bf4bb08a743fbcf1245a58498d1ca9d44cbbe288e59efac2","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int mod = 1e9 + 7;\n\nint add(int x, int y) { return x + y < mod ? x + y : x + y - mod; }\n\nint qpow(int x, int k)\n\n{\n\n  int r = 1;\n\n  while (k)\n\n  {\n\n    if (k & 1)\n      r = 1ll * r * x % mod;\n\n    k >>= 1;\n    x = 1ll * x * x % mod;\n  }\n\n  return r;\n}\n\nint gcd(int a, int b) { return b ? gcd(b, a % b) : a; }\n\nint C[1010][1010];\n\nint n, m, K;\n\nstruct data {\n\n  int to, nxt;\n\n} mp[220];\n\nint head[55], cnt;\n\nvoid link(int x, int y)\n\n{\n\n  mp[++cnt].to = y;\n\n  mp[cnt].nxt = head[x];\n\n  head[x] = cnt;\n}\n\nstruct Edge {\n\n  int x, y;\n};\n\nint dfn[55], clk;\n\nint low[55];\n\nEdge sta[1010];\n\nint top;\n\nint col[55], tcol;\n\nint cp[110], ce[110];\n\nvoid Tarjan(int x, int fa)\n\n{\n\n  low[x] = dfn[x] = ++clk;\n\n  int v, p, q;\n\n  Edge cur;\n\n  for (int i = head[x]; i; i = mp[i].nxt)\n\n  {\n\n    if (mp[i].to == fa)\n      continue;\n\n    v = mp[i].to;\n\n    if (!dfn[v])\n\n    {\n\n      sta[++top] = (Edge){x, v};\n\n      Tarjan(v, x);\n\n      low[x] = min(low[x], low[v]);\n\n      if (low[v] >= dfn[x])\n\n      {\n\n        tcol++;\n\n        while (233)\n\n        {\n\n          cur = sta[top];\n          top--;\n\n          ce[tcol]++;\n\n          p = cur.x;\n          q = cur.y;\n\n          if (col[p] != tcol)\n            col[p] = tcol, cp[tcol]++;\n\n          if (col[q] != tcol)\n            col[q] = tcol, cp[tcol]++;\n\n          if (p == x && q == v)\n            break;\n        }\n      }\n\n    }\n\n    else if (dfn[v] < dfn[x])\n\n      low[x] = min(low[x], dfn[v]), sta[++top] = (Edge){x, v};\n  }\n}\n\nint main()\n\n{\n\n  for (int i = 0; i <= 1000; ++i)\n\n  {\n\n    C[i][0] = 1;\n\n    for (int j = 1; j <= i; ++j)\n\n      C[i][j] = add(C[i - 1][j], C[i - 1][j - 1]);\n  }\n\n  scanf(\"%d%d%d\", &n, &m, &K);\n\n  int xx, yy;\n\n  for (int i = 1; i <= m; ++i)\n\n  {\n\n    scanf(\"%d%d\", &xx, &yy);\n\n    link(xx, yy);\n\n    link(yy, xx);\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n    if (!dfn[i])\n      top = 0, Tarjan(i, 0);\n\n  int ans = 1, ta;\n\n  int siz;\n\n  for (int i = 1; i <= tcol; ++i)\n\n  {\n\n    if (ce[i] == 1)\n      ans = 1ll * ans * K % mod;\n\n    else if (ce[i] == cp[i])\n\n    {\n\n      siz = ce[i];\n\n      ta = 0;\n\n      for (int j = 1; j <= siz; ++j)\n\n        ta = add(ta, qpow(K, gcd(siz, j)));\n\n      ta = 1ll * ta * qpow(siz, mod - 2) % mod;\n\n      ans = 1ll * ans * ta % mod;\n\n    }\n\n    else\n      ans = 1ll * ans * C[ce[i] + K - 1][K - 1] % mod;\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define reg register\n\n#define mo 1000000007\n\n#define maxn 1000\n\ninline ll read()\n\n{\n\n  reg ll x = 0, w = 0;\n  reg char ch = getchar();\n\n  while (!isdigit(ch))\n    w |= ch == '-', ch = getchar();\n\n  while (isdigit(ch))\n    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();\n\n  return w ? -x : x;\n}\n\ninline int ksm(int x, int y)\n\n{\n\n  int a = 1;\n\n  while (y)\n\n  {\n\n    if (y & 1)\n      a = 1ll * a * x % mo;\n\n    x = 1ll * x * x % mo;\n    y >>= 1;\n  }\n  return a;\n}\n\ninline void Min(int &x, int y) { x = x > y ? y : x; }\n\ninline int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }\n\nint n, m, base, res, ans = 1, rt;\n\nint headd[maxn], nextt[maxn << 1], to[maxn << 1], cntt = 1;\n\ninline void link(int u, int v)\n\n{\n  nextt[++cntt] = headd[u];\n  headd[u] = cntt;\n  to[cntt] = v;\n}\n\nvector<int> G[maxn];\n\nint tot, cnt, bs[maxn], bel[maxn], low[maxn], dfn[maxn], top, zhan[maxn];\n\ninline void Tarjan(int u)\n\n{\n\n  reg int i, v;\n\n  if (rt == u && headd[u] == 0) {\n    G[++tot].push_back(u);\n    return;\n  }\n\n  zhan[++top] = u;\n  low[u] = dfn[u] = ++cnt;\n\n  for (i = headd[u]; i; i = nextt[i])\n\n  {\n\n    v = to[i];\n\n    if (!dfn[v])\n\n    {\n\n      Tarjan(v);\n\n      Min(low[u], low[v]);\n\n      if (low[v] >= dfn[u])\n\n      {\n\n        ++tot;\n        G[tot].push_back(u);\n\n        while (zhan[top] != v)\n\n          G[tot].push_back(zhan[top--]);\n\n        --top;\n        G[tot].push_back(v);\n      }\n\n    }\n\n    else\n      Min(low[u], dfn[v]);\n  }\n}\n\nint vis[maxn];\n\ninline int get(int x)\n\n{\n\n  int sz = G[x].size(), i, j, res = 0;\n\n  for (i = 1; i <= n; ++i)\n    vis[i] = 0;\n\n  for (i = 0; i < sz; ++i)\n    vis[G[x][i]] = 1;\n\n  for (i = 0; i < sz; ++i)\n\n    for (j = headd[G[x][i]]; j; j = nextt[j])\n\n      if (vis[to[j]] == 1)\n        ++res;\n\n  return res / 2;\n}\n\nint jc[maxn];\n\ninline int C(int x, int y)\n\n{\n\n  if (x < y || x < 0 || y < 0)\n    return 0;\n\n  return 1ll * jc[x] * ksm(1ll * jc[y] * jc[x - y] % mo, mo - 2) % mo;\n}\n\nint main()\n\n{\n\n  n = read(), m = read(), base = read();\n\n  reg int u, v, i, j;\n\n  for (i = 1; i <= m; ++i)\n\n  {\n\n    u = read(), v = read();\n\n    link(u, v);\n    link(v, u);\n  }\n  jc[0] = 1;\n\n  for (i = 1; i <= m + n + base; ++i)\n    jc[i] = 1ll * i * jc[i - 1] % mo;\n\n  for (i = 1; i <= n; ++i)\n    if (!dfn[i])\n      rt = i, Tarjan(i);\n\n  for (i = 1; i <= tot; ++i)\n    bs[i] = get(i);\n\n  for (i = 1; i <= tot; ++i)\n\n  {\n\n    if (bs[i] == G[i].size())\n\n    {\n\n      res = 0;\n\n      for (j = 0; j < bs[i]; ++j)\n\n        (res += ksm(base, gcd(j, bs[i]))) %= mo;\n\n      res = 1ll * res * ksm(bs[i], mo - 2) % mo;\n\n    }\n\n    else if (bs[i] > G[i].size())\n      res = C(bs[i] + base - 1, base - 1);\n\n    else\n      res = ksm(base, bs[i]);\n\n    ans = 1ll * ans * res % mo;\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"702e7e80b49b9ef7120fc67bb17f8f7cc9491a34c35df0e125b3142e15374275","fast_id":"5ea39ab26da283e09115dcc0fba0e0f702e1e8914ce0e186ee90dc63e3e36592","fast_time":0.0180436665,"language":"cpp","measured_fast_code_id":"5ea39ab26da283e09115dcc0fba0e0f702e1e8914ce0e186ee90dc63e3e36592","measured_slow_code_id":"02b5d7e9ad82e5fe60be8d838053a470d110568454e26a5eb0d6277ddc71fb9f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57262","problem_id":"p02586","slow_code_id":"d6d2bda4cd5655420138e5e3a24b7f7094bb0f3745ce50295dd4cd83132852ac","slow_id":"02b5d7e9ad82e5fe60be8d838053a470d110568454e26a5eb0d6277ddc71fb9f","slow_time":0.0792566229,"speedup":4.392489902204743,"stratum":"4-8","sampling_key":"3640bc08617a2915251ba5a9dee212b25ac692326f37e5960c728575f4dcf6d1","slow_code":"#pragma GCC optimize(\"O2\")\n\n#pragma GCC target(\"avx2\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint V[3000][3000];\n\nll dp[3001];\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int R, C, K;\n\n  cin >> R >> C >> K;\n\n  rep(i, K) {\n\n    int r, c, v;\n\n    cin >> r >> c >> v;\n\n    V[r - 1][c - 1] = v;\n  }\n\n  rep(i, R) {\n\n    ll A[4] = {};\n\n    rep(j, C) {\n\n      chmax(A[0], dp[j]);\n\n      if (V[i][j]) {\n\n        chmax(A[3], A[2] + V[i][j]);\n\n        chmax(A[2], A[1] + V[i][j]);\n\n        chmax(A[1], A[0] + V[i][j]);\n      }\n\n      dp[j] = max(max(A[0], A[1]), max(A[2], A[3]));\n    }\n  }\n\n  ll kotae = dp[C - 1];\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O2\")\n\n#pragma GCC target(\"avx2\")\n\n#include <algorithm>\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int bm = 3010;\n\nll BIT[bm];\n\nvoid add(int A, ll B) {\n\n  while (A <= bm) {\n\n    BIT[A] = max(BIT[A], B);\n\n    A += A & -A;\n  }\n}\n\nll query(int A) {\n\n  ll kotae = 0;\n\n  while (A > 0) {\n\n    kotae = max(BIT[A], kotae);\n\n    A -= A & -A;\n  }\n\n  return kotae;\n}\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nll V[200000], tmp[200000];\n\nint main() {\n\n  int R = getint(), C = getint(), K = getint();\n\n  rep(i, K) {\n\n    ll r = getint(), c = getint(), v = getint();\n\n    V[i] = v << 30 | r << 12 | c;\n  }\n\n  const int b = 12;\n\n  int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n  rep(i, K) kazu[V[i] & ((1 << b) - 1)]++;\n\n  rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n  for (int i = K - 1; i >= 0; i--)\n    tmp[--kazu[V[i] & ((1 << b) - 1)]] = V[i];\n\n  rep(i, K) kazu2[tmp[i] >> b & ((1 << b) - 1)]++;\n\n  rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n  for (int i = K - 1; i >= 0; i--)\n    V[--kazu2[tmp[i] >> b & ((1 << b) - 1)]] = tmp[i];\n\n  int mae = -1;\n\n  ll A[4] = {};\n\n  ll L[3001];\n\n  int l = 0;\n\n  rep(k, K) {\n\n    int v = V[k] >> 30;\n\n    int i = V[k] >> 12 & 4095;\n\n    int j = V[k] & 4095;\n\n    if (mae != i) {\n\n      mae = i;\n\n      A[0] = 0;\n\n      A[1] = 0;\n\n      A[2] = 0;\n\n      A[3] = 0;\n\n      rep(a, l) add(L[a] & 4095, L[a] >> 12);\n\n      l = 0;\n    }\n\n    ll kari = query(j);\n\n    A[0] = kari;\n\n    chmax(A[3], kari);\n\n    chmax(A[2], kari);\n\n    chmax(A[1], kari);\n\n    chmax(A[3], A[2] + v);\n\n    chmax(A[2], A[1] + v);\n\n    chmax(A[1], A[0] + v);\n\n    L[l++] = A[3] << 12 | j;\n  }\n\n  rep(a, l) add(L[a] & 4095, L[a] >> 12);\n\n  ll kotae = query(C);\n\n  printf(\"%lld\\n\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"b91de1294e6b3d2421344592b4899134373921d6018ac31f47b62512fbad3ef2","fast_id":"02a628c33befd83b29d112a723b01018af29547d0fdd1465d1efbc43ed043e75","fast_time":0.1049752861,"language":"cpp","measured_fast_code_id":"02a628c33befd83b29d112a723b01018af29547d0fdd1465d1efbc43ed043e75","measured_slow_code_id":"04ec662e52c7ed59454c156633be563e185fa542abcb26c77cdc72d413ffcc11","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57274","problem_id":"p03271","slow_code_id":"543f94c56a63abe67ea92e88e7f35d41bccb87737e730f6ac449afd4e7019a7e","slow_id":"04ec662e52c7ed59454c156633be563e185fa542abcb26c77cdc72d413ffcc11","slow_time":0.310483469,"speedup":2.9576815699671624,"stratum":"2-4","sampling_key":"7c6f211d57b4698e949c111c4531034f1fc2fc2bb5833b3ccac854cf2465616c","slow_code":"#include <cstdio>\n\n#include <vector>\n\n#include <cstring>\n\nusing i64 = long long;\n\nint n, flg = 1, t[300007];\nstd::vector<int> p[3];\n\nint read() {\n  int x;\n  scanf(\"%d\", &x);\n  return x;\n}\n\nvoid add(int p) {\n  while (p)\n    ++t[p], p ^= p & -p;\n}\n\nint ask(int p) {\n  int r = 0;\n  while (p <= n)\n    r += t[p], p += p & -p;\n  return r;\n}\n\ni64 tao(std::vector<int> p) {\n  i64 r = 0;\n  memset(t, 0, sizeof t);\n  for (int x : p)\n    r += ask(x), add(x);\n  return r;\n}\n\nint main()\n\n{\n\n  n = read();\n\n  for (int i = 1, x; i <= n; ++i)\n    p[2].push_back(x = read()), p[i & 1].push_back(x), flg &= !((i ^ x) & 1);\n\n  puts(flg & (tao(p[2]) == 3 * (tao(p[0]) + tao(p[1]))) ? \"Yes\" : \"No\");\n}\n","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define ll long long\n\nusing namespace std;\n\ninline int read()\n\n{\n\n  int x = 0, f = 1;\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      f = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = (x << 3) + (x << 1) + (ch ^ 48);\n    ch = getchar();\n  }\n\n  return x * f;\n}\n\nconst int N = 1e6 + 1000;\n\nint n, a[N];\n\nll tr[N];\n\nll A, P, Q;\n\nint lowbit(int x) { return x & -x; }\n\nll ask(int pos) {\n  ll res = 0;\n  for (; pos; pos -= lowbit(pos))\n    res += tr[pos];\n  return res;\n}\n\nvoid add(int pos, int v) {\n  for (; pos <= n; pos += lowbit(pos))\n    tr[pos] += v;\n  return;\n}\n\nint main()\n\n{\n\n  n = read();\n  for (int i = 1; i <= n; i++)\n    if ((i & 1) != ((a[i] = read()) & 1)) {\n      puts(\"No\");\n      return 0;\n    }\n\n  for (int i = n; i >= 1; i--) {\n    A += ask(a[i]);\n    add(a[i], 1);\n  }\n\n  if (A % 3) {\n    puts(\"No\");\n    return 0;\n  }\n\n  for (int i = 1; i <= n; i++)\n    tr[i] = 0;\n\n  for (int i = n; i >= 1; i -= 2) {\n    P += ask(a[i]);\n    add(a[i], 1);\n  }\n\n  for (int i = 1; i <= n; i++)\n    tr[i] = 0;\n\n  for (int i = n - 1; i >= 1; i -= 2) {\n    Q += ask(a[i]);\n    add(a[i], 1);\n  }\n\n  if (P + Q != A / 3) {\n    puts(\"No\");\n    return 0;\n  }\n\n  else {\n    puts(\"Yes\");\n    return 0;\n  }\n}\n"}
{"fast_code_id":"0f788de65070cb103e288a7591cbf8d3d7f7cbd342f4547d16a8cc3f787ad6bf","fast_id":"4b0896c3ba11b196d5c4a675186d9ee97777dada87684e430585d8e09b1949c0","fast_time":0.0193220436,"language":"cpp","measured_fast_code_id":"4b0896c3ba11b196d5c4a675186d9ee97777dada87684e430585d8e09b1949c0","measured_slow_code_id":"5adacd142180efff9cb58e1da128e9f1d816464928465b984f386b05a0b7095b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57293","problem_id":"p03634","slow_code_id":"8ab799365c0e0e58e0b182eb5935c3b7abfe077c1431d5a1af47fbaf6b87ba22","slow_id":"5adacd142180efff9cb58e1da128e9f1d816464928465b984f386b05a0b7095b","slow_time":0.4725606197,"speedup":24.457072423747142,"stratum":"8+","sampling_key":"0e9d600bc94668bb62a6f6cb02b07cc60f426da14e7de0ea3392adc4ca92544c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  vector<pair<int, ll>> eda[100001];\n\n  rep(i, N - 1) {\n\n    int a, b, c;\n\n    cin >> a >> b >> c;\n\n    eda[a].push_back(make_pair(b, c));\n\n    eda[b].push_back(make_pair(a, c));\n  }\n\n  ll kyori[100001] = {};\n\n  int Q, K;\n\n  cin >> Q >> K;\n\n  vector<pair<int, ll>> que;\n\n  que.push_back(make_pair(K, 0));\n\n  while (que.size()) {\n\n    vector<pair<int, ll>> que2;\n\n    for (auto itr : que) {\n\n      if (kyori[itr.first] == 0) {\n\n        kyori[itr.first] = itr.second;\n\n        for (auto itr2 : eda[itr.first]) {\n\n          que2.push_back(make_pair(itr2.first, itr.second + itr2.second));\n        }\n      }\n    }\n\n    que = que2;\n  }\n\n  rep(i, Q) {\n\n    int X, Y;\n\n    cin >> X >> Y;\n\n    co(kyori[X] + kyori[Y]);\n  }\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 21;\n\nchar dn[dm], *di = dn, dt;\n\ninline void putint(ll X) {\n\n  int keta = 0;\n\n  char C[20];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nint N;\n\nll D[100001];\n\nint E[200001], Ed[200001], E2[200001], H[100001];\n\nvoid dfs(int A, ll B) {\n\n  *(D + A) = B;\n\n  for (int i = H[A]; i; i = E2[i])\n    if (!(*(D + E[i])))\n      dfs(E[i], B + Ed[i]);\n}\n\nint main() {\n\n  int N = getint();\n\n  int k = 1;\n\n  rep(i, N - 1) {\n\n    int a = getint();\n\n    int b = getint();\n\n    int c = getint();\n\n    E[k] = b;\n\n    Ed[k] = c;\n\n    E2[k] = H[a];\n\n    H[a] = k++;\n\n    E[k] = a;\n\n    Ed[k] = c;\n\n    E2[k] = H[b];\n\n    H[b] = k++;\n  }\n\n  int Q = getint();\n\n  int K = getint();\n\n  dfs(K, 1);\n\n  rep(i, Q) {\n\n    int x = getint();\n\n    int y = getint();\n\n    putint(*(D + x) + *(D + y) - 2);\n  }\n\n  fwrite_unlocked(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"0643c1f068126a3b08da2850fde016e2dcb0b7473756e6855c07a64b92f0ee04","fast_id":"bdc8bf7884903feb38c328f97af834325761acee806a5bdc12b650e260a9316e","fast_time":0.0226783803,"language":"cpp","measured_fast_code_id":"bdc8bf7884903feb38c328f97af834325761acee806a5bdc12b650e260a9316e","measured_slow_code_id":"d2556084304caffe8f60ec44e459c2d999db91c7257a7ef73d3a2f3f4c932dad","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57420","problem_id":"p03287","slow_code_id":"f5d47e4017b616bba1cfb40bc7fed75e7ead5845ad675242a8795aa26d9e27d6","slow_id":"d2556084304caffe8f60ec44e459c2d999db91c7257a7ef73d3a2f3f4c932dad","slow_time":0.2372962569,"speedup":10.463545180958096,"stratum":"8+","sampling_key":"ac499efacd2adf399fb1ddc0f9e2c66c644e3d46a86acc14b9e37696fd4dbbef","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define repeat(i, n) for (int i = 0; i < (n); i++)\n\nint main()\n\n{\n\n  int N, M;\n\n  cin >> N >> M;\n\n  int A[100001] = {};\n\n  long long B[100001] = {};\n\n  map<int, int> MAP;\n\n  repeat(i, N) {\n\n    cin >> A[i];\n\n    B[i + 1] = B[i] + A[i];\n\n    B[i + 1] %= M;\n\n    MAP[(int)B[i + 1]]++;\n  }\n\n  MAP[0]++;\n\n  long long result = 0;\n\n  for (auto ITR : MAP) {\n\n    result += 1ll * ITR.second * (ITR.second - 1) / 2;\n  }\n\n  cout << result << endl;\n\n  return 0;\n}","fast_code":"\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nvoid pakuri_sort(int N, int A[]) {\n\n  const int b = 8;\n\n  int tmp[200001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n  }\n}\n\nint main() {\n\n  int N = getint(), M = getint();\n\n  int A[100001];\n\n  A[0] = 0;\n\n  rep1(i, N) {\n\n    int a = getint();\n\n    A[i] = (A[i - 1] + a) % M;\n  }\n\n  pakuri_sort(N, A + 1);\n\n  int mae = -1;\n\n  int k = 0;\n\n  ll kotae = 0;\n\n  rep(i, N + 1) {\n\n    if (mae != A[i])\n      k = 0;\n\n    kotae += k++;\n\n    mae = A[i];\n  }\n\n  printf(\"%lld\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"e7ac4e5b857b72715564e42d6743fb87b761541aab33ea2d162cccce83218fd9","fast_id":"7b053f331ba528e97f4bccf68e18e601f1026bd202a2919863bd68985f16980a","fast_time":0.0186010136,"language":"cpp","measured_fast_code_id":"7b053f331ba528e97f4bccf68e18e601f1026bd202a2919863bd68985f16980a","measured_slow_code_id":"3481083de9c2395f9859a266ec7e2bcfd076b8accd06200c31373a979878b5e6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57480","problem_id":"p02692","slow_code_id":"137d32224e8f5ed31cfba18ba3e91288c35316cb5584081dca339bd921272cf9","slow_id":"3481083de9c2395f9859a266ec7e2bcfd076b8accd06200c31373a979878b5e6","slow_time":0.4329606224,"speedup":23.276184390295803,"stratum":"8+","sampling_key":"e295c3fdf3c1f20fcbf080bf510a4e8ec02718765dc4832444c102609254d3ec","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 1e5 + 5;\n\nstring s[N];\n\nchar ans[N];\n\nint n, a, b, c;\n\nvoid dfs(int id, int a, int b, int c) {\n\n  if (a < 0 || b < 0 || c < 0)\n    return;\n\n  if (id == n) {\n\n    puts(\"Yes\");\n\n    for (int i = 0; i < n; i++)\n      cout << ans[i] << endl;\n\n    exit(0);\n\n  }\n\n  else {\n\n    if (s[id] == \"AB\") {\n\n      ans[id] = 'A';\n\n      dfs(id + 1, a + 1, b - 1, c);\n\n      ans[id] = 'B';\n\n      dfs(id + 1, a - 1, b + 1, c);\n\n    }\n\n    else if (s[id] == \"AC\") {\n\n      ans[id] = 'A';\n\n      dfs(id + 1, a + 1, b, c - 1);\n\n      ans[id] = 'C';\n\n      dfs(id + 1, a - 1, b, c + 1);\n\n    }\n\n    else if (s[id] == \"BC\") {\n\n      ans[id] = 'B';\n\n      dfs(id + 1, a, b + 1, c - 1);\n\n      ans[id] = 'C';\n\n      dfs(id + 1, a, b - 1, c + 1);\n    }\n  }\n}\n\nmain()\n\n{\n\n  cin >> n >> a >> b >> c;\n\n  for (int i = 0; i < n; i++)\n    cin >> s[i];\n\n  dfs(0, a, b, c);\n\n  puts(\"No\");\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define maxn 100010\n\nusing namespace std;\n\nchar in[3];\n\nint n, v[3], p[maxn], q[maxn], ans[maxn];\n\nint main() {\n\n  int i;\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < 3; i++)\n    scanf(\"%d\", &v[i]);\n\n  for (i = 1; i <= n; i++)\n    scanf(\"%s\", in), p[i] = in[0] - 'A', q[i] = in[1] - 'A';\n\n  for (i = 1; i <= n; i++) {\n\n    if (v[p[i]] > v[q[i]])\n      swap(p[i], q[i]);\n\n    else if (v[p[i]] == v[q[i]]) {\n\n      if (i + 1 <= n && (q[i] == p[i + 1] || q[i] == q[i + 1]))\n        swap(p[i], q[i]);\n    }\n\n    if (!v[q[i]])\n      return 0 * printf(\"No\\n\");\n\n    v[p[i]]++, v[q[i]]--, ans[i] = p[i];\n  }\n\n  printf(\"Yes\\n\");\n\n  for (i = 1; i <= n; i++)\n    printf(\"%c\\n\", 'A' + ans[i]);\n\n  return 0;\n}"}
{"fast_code_id":"c5fcd3e07a9e0aa6f1b2c32dc9534ac414cbd149700b26eeb6f027ae439fadbd","fast_id":"9ff63e89eb3556906ff2c66d2a87f5b309f0b5ef07e28674ac6222f00f99eec1","fast_time":0.0645330042,"language":"cpp","measured_fast_code_id":"9ff63e89eb3556906ff2c66d2a87f5b309f0b5ef07e28674ac6222f00f99eec1","measured_slow_code_id":"add1e4335a2321dca13aeae3e1e42acd69159f831de8ba684d91a57d849c154d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57499","problem_id":"p02776","slow_code_id":"3fa7cc6f41b366a2336b13aece50c64c3c418d51342dccf8502159567dba2910","slow_id":"add1e4335a2321dca13aeae3e1e42acd69159f831de8ba684d91a57d849c154d","slow_time":0.2333778247,"speedup":3.6164103561135623,"stratum":"2-4","sampling_key":"1565611b5757a70a6e1e087c8b4bdc5e5781a3406c3cb375d0e48d173060e90f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 100005;\n\npair<int, int> p[N];\n\nint n, m, a[N], vis[N];\n\nvector<pair<int, int>> e[N];\n\nvector<int> ans;\n\ninline int dfs(int x)\n\n{\n\n  vis[x] = 1;\n\n  int rt = a[x];\n\n  for (auto v : e[x])\n\n  {\n\n    int y = v.first;\n\n    if (vis[y])\n\n      continue;\n\n    int t = dfs(y);\n\n    if (t)\n\n      ans.push_back(v.second);\n\n    rt ^= t;\n  }\n\n  return rt;\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin >> n >> m;\n\n  for (int i = 0; i < n; i++)\n\n    cin >> p[i].first >> p[i].second;\n\n  sort(p, p + n);\n\n  a[0] = p[0].second;\n\n  for (int i = 1; i < n; ++i)\n\n    a[i] = p[i - 1].second ^ p[i].second;\n\n  a[n] = p[n - 1].second;\n\n  for (int i = 0, l, r; i < m; i++)\n\n  {\n\n    cin >> l >> r;\n\n    l = lower_bound(p, p + n, make_pair(l, 0)) - p;\n\n    r = upper_bound(p, p + n, make_pair(r, 1)) - p;\n\n    e[l].push_back({r, i + 1});\n\n    e[r].push_back({l, i + 1});\n  }\n\n  for (int i = 0; i <= n; i++)\n\n  {\n\n    if (!vis[i])\n\n    {\n\n      if (dfs(i))\n\n      {\n\n        cout << \"-1\\n\";\n\n        return 0;\n      }\n    }\n  }\n\n  cout << ans.size() << endl;\n\n  sort(ans.begin(), ans.end());\n\n  for (int i : ans)\n\n    cout << i << ' ';\n\n  return 0;\n}\n","fast_code":"#pragma GCC optimize(\"Ofast\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nvoid *wmem;\n\nchar memarr[96000000];\n\ntemplate <class T> inline void walloc1d(T **arr, int x, void **mem = &wmem) {\n\n  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};\n\n  (*mem) = (void *)(((char *)(*mem)) + skip[((unsigned long long)(*mem)) & 15]);\n\n  (*arr) = (T *)(*mem);\n\n  (*mem) = ((*arr) + x);\n}\n\ntemplate <class T1> void sortA_L(int N, T1 a[], void *mem = wmem) {\n\n  sort(a, a + N);\n}\n\ntemplate <class T1, class T2>\nvoid sortA_L(int N, T1 a[], T2 b[], void *mem = wmem) {\n\n  int i;\n\n  pair<T1, T2> *arr;\n\n  walloc1d(&arr, N, &mem);\n\n  for (i = (0); i < (N); i++) {\n\n    arr[i].first = a[i];\n\n    arr[i].second = b[i];\n  }\n\n  sort(arr, arr + N);\n\n  for (i = (0); i < (N); i++) {\n\n    a[i] = arr[i].first;\n\n    b[i] = arr[i].second;\n  }\n}\n\ninline void rd(int &x) {\n\n  int k;\n\n  int m = 0;\n\n  x = 0;\n\n  for (;;) {\n\n    k = getchar_unlocked();\n\n    if (k == '-') {\n\n      m = 1;\n\n      break;\n    }\n\n    if ('0' <= k && k <= '9') {\n\n      x = k - '0';\n\n      break;\n    }\n  }\n\n  for (;;) {\n\n    k = getchar_unlocked();\n\n    if (k < '0' || k > '9') {\n\n      break;\n    }\n\n    x = x * 10 + k - '0';\n  }\n\n  if (m) {\n\n    x = -x;\n  }\n}\n\ninline void wt_L(char a) { putchar_unlocked(a); }\n\ninline void wt_L(int x) {\n\n  int s = 0;\n\n  int m = 0;\n\n  char f[10];\n\n  if (x < 0) {\n\n    m = 1;\n\n    x = -x;\n  }\n\n  while (x) {\n\n    f[s++] = x % 10;\n\n    x /= 10;\n  }\n\n  if (!s) {\n\n    f[s++] = 0;\n  }\n\n  if (m) {\n\n    putchar_unlocked('-');\n  }\n\n  while (s--) {\n\n    putchar_unlocked(f[s] + '0');\n  }\n}\n\ntemplate <class S>\ninline void arrInsert(const int k, int &sz, S a[], const S aval) {\n\n  int i;\n\n  sz++;\n\n  for (i = sz - 1; i > k; i--) {\n\n    a[i] = a[i - 1];\n  }\n\n  a[k] = aval;\n}\n\ntemplate <class S, class T>\ninline void arrInsert(const int k, int &sz, S a[], const S aval, T b[],\n                      const T bval) {\n\n  int i;\n\n  sz++;\n\n  for (i = sz - 1; i > k; i--) {\n\n    a[i] = a[i - 1];\n  }\n\n  for (i = sz - 1; i > k; i--) {\n\n    b[i] = b[i - 1];\n  }\n\n  a[k] = aval;\n\n  b[k] = bval;\n}\n\ntemplate <class S, class T, class U>\ninline void arrInsert(const int k, int &sz, S a[], const S aval, T b[],\n                      const T bval, U c[], const U cval) {\n\n  int i;\n\n  sz++;\n\n  for (i = sz - 1; i > k; i--) {\n\n    a[i] = a[i - 1];\n  }\n\n  for (i = sz - 1; i > k; i--) {\n\n    b[i] = b[i - 1];\n  }\n\n  for (i = sz - 1; i > k; i--) {\n\n    c[i] = c[i - 1];\n  }\n\n  a[k] = aval;\n\n  b[k] = bval;\n\n  c[k] = cval;\n}\n\ntemplate <class S, class T, class U, class V>\ninline void arrInsert(const int k, int &sz, S a[], const S aval, T b[],\n                      const T bval, U c[], const U cval, V d[], const V dval) {\n\n  int i;\n\n  sz++;\n\n  for (i = sz - 1; i > k; i--) {\n\n    a[i] = a[i - 1];\n  }\n\n  for (i = sz - 1; i > k; i--) {\n\n    b[i] = b[i - 1];\n  }\n\n  for (i = sz - 1; i > k; i--) {\n\n    c[i] = c[i - 1];\n  }\n\n  for (i = sz - 1; i > k; i--) {\n\n    d[i] = d[i - 1];\n  }\n\n  a[k] = aval;\n\n  b[k] = bval;\n\n  c[k] = cval;\n\n  d[k] = dval;\n}\n\nstruct unionFind {\n\n  int *d;\n\n  int N;\n\n  int M;\n\n  inline void malloc(const int n) {\n\n    d = (int *)std::malloc(n * sizeof(int));\n\n    M = n;\n  }\n\n  inline void free(void) { std::free(d); }\n\n  inline void walloc(const int n, void **mem = &wmem) {\n\n    walloc1d(&d, n, mem);\n\n    M = n;\n  }\n\n  inline void init(const int n) {\n\n    int i;\n\n    N = n;\n\n    for (i = (0); i < (n); i++) {\n\n      d[i] = -1;\n    }\n  }\n\n  inline void init(void) { init(M); }\n\n  inline int get(int a) {\n\n    int t = a;\n\n    int k;\n\n    while (d[t] >= 0) {\n\n      t = d[t];\n    }\n\n    while (d[a] >= 0) {\n\n      k = d[a];\n\n      d[a] = t;\n\n      a = k;\n    }\n\n    return a;\n  }\n\n  inline int connect(int a, int b) {\n\n    if (d[a] >= 0) {\n\n      a = get(a);\n    }\n\n    if (d[b] >= 0) {\n\n      b = get(b);\n    }\n\n    if (a == b) {\n\n      return 0;\n    }\n\n    if (d[a] < d[b]) {\n\n      d[a] += d[b];\n\n      d[b] = a;\n\n    }\n\n    else {\n\n      d[b] += d[a];\n\n      d[a] = b;\n    }\n\n    return 1;\n  }\n\n  inline int operator()(int a) { return get(a); }\n\n  inline int operator()(int a, int b) { return connect(a, b); }\n\n  inline int &operator[](const int a) { return d[a]; }\n\n  inline int size(int a) {\n\n    a = get(a);\n\n    return -d[a];\n  }\n\n  inline int sizeList(int res[]) {\n\n    int i;\n\n    int sz = 0;\n\n    for (i = (0); i < (N); i++) {\n\n      if (d[i] < 0) {\n\n        res[sz++] = -d[i];\n      }\n    }\n\n    return sz;\n  }\n}\n\n;\n\nstruct graph {\n\n  int N;\n\n  int *es;\n\n  int **edge;\n\n  void setEdge(int N__, int M, int A[], int B[], void **mem = &wmem) {\n\n    int i;\n\n    N = N__;\n\n    walloc1d(&es, N, mem);\n\n    walloc1d(&edge, N, mem);\n\n    for (i = (0); i < (N); i++) {\n\n      es[i] = 0;\n    }\n\n    for (i = (0); i < (M); i++) {\n\n      es[A[i]]++;\n\n      es[B[i]]++;\n    }\n\n    for (i = (0); i < (N); i++) {\n\n      walloc1d(&edge[i], es[i], mem);\n    }\n\n    for (i = (0); i < (N); i++) {\n\n      es[i] = 0;\n    }\n\n    for (i = (0); i < (M); i++) {\n\n      edge[A[i]][es[A[i]]++] = B[i];\n\n      edge[B[i]][es[B[i]]++] = A[i];\n    }\n  }\n}\n\n;\n\ntemplate <class T> struct wgraph {\n\n  int N;\n\n  int *es;\n\n  int **edge;\n\n  T **cost;\n\n  graph g;\n\n  void setEdge(int N__, int M, int A[], int B[], T C[], void **mem = &wmem) {\n\n    int i;\n\n    N = N__;\n\n    walloc1d(&es, N, mem);\n\n    for (i = (0); i < (N); i++) {\n\n      es[i] = 0;\n    }\n\n    for (i = (0); i < (M); i++) {\n\n      es[A[i]]++;\n\n      es[B[i]]++;\n    }\n\n    walloc1d(&edge, N, mem);\n\n    for (i = (0); i < (N); i++) {\n\n      walloc1d(&edge[i], es[i], mem);\n    }\n\n    walloc1d(&cost, N, mem);\n\n    for (i = (0); i < (N); i++) {\n\n      walloc1d(&cost[i], es[i], mem);\n    }\n\n    for (i = (0); i < (N); i++) {\n\n      es[i] = 0;\n    }\n\n    for (i = (0); i < (M); i++) {\n\n      edge[A[i]][es[A[i]]] = B[i];\n\n      edge[B[i]][es[B[i]]] = A[i];\n\n      cost[A[i]][es[A[i]]++] = C[i];\n\n      cost[B[i]][es[B[i]]++] = C[i];\n    }\n\n    g.N = N;\n\n    g.es = es;\n\n    g.edge = edge;\n  }\n}\n\n;\n\nint N;\n\nint A[100000];\n\nint B[100000 + 1];\n\nint M;\n\nint L[200000];\n\nint R[200000];\n\nint ind[200000];\n\nwgraph<int> g;\n\nint vis[100000 + 1];\n\nint ress;\n\nint res[200000];\n\nvoid solve(int n, int b = -1) {\n\n  int i;\n\n  int j;\n\n  vis[n] = 1;\n\n  for (i = (0); i < (g.es[n]); i++) {\n\n    j = g.edge[n][i];\n\n    if (j == b) {\n\n      continue;\n    }\n\n    solve(j, n);\n\n    if (B[j]) {\n\n      {\n\n        auto Q5VJL1cS = (1);\n\n        B[n] ^= Q5VJL1cS;\n\n        B[j] ^= Q5VJL1cS;\n      }\n\n      res[ress++] = g.cost[n][i];\n    }\n  }\n}\n\nint main() {\n\n  wmem = memarr;\n\n  int i;\n\n  int j;\n\n  int k;\n\n  int e;\n\n  unionFind uf;\n\n  rd(N);\n\n  rd(M);\n\n  {\n\n    int e98WHCEY;\n\n    for (e98WHCEY = (0); e98WHCEY < (N); e98WHCEY++) {\n\n      rd(A[e98WHCEY]);\n\n      rd(B[e98WHCEY]);\n    }\n  }\n\n  {\n\n    int FmcKpFmN;\n\n    for (FmcKpFmN = (0); FmcKpFmN < (M); FmcKpFmN++) {\n\n      rd(L[FmcKpFmN]);\n\n      rd(R[FmcKpFmN]);\n      R[FmcKpFmN] += (1);\n    }\n  }\n\n  sortA_L(N, A, B);\n\n  for (i = (0); i < (M); i++) {\n\n    L[i] = lower_bound(A, A + N, L[i]) - A;\n\n    R[i] = lower_bound(A, A + N, R[i]) - A;\n\n    ind[i] = i;\n  }\n\n  uf.malloc(N + 1);\n\n  uf.init(N + 1);\n\n  k = 0;\n\n  for (i = (0); i < (M); i++) {\n\n    if (uf(L[i], R[i])) {\n\n      arrInsert(k, k, L, L[i], R, R[i], ind, ind[i]);\n    }\n  }\n\n  M = k;\n\n  g.setEdge(N + 1, M, L, R, ind);\n\n  for (i = (N + 1) - 1; i >= (1); i--) {\n\n    if (B[i] != B[i - 1]) {\n\n      B[i] = 1;\n\n    }\n\n    else {\n\n      B[i] = 0;\n    }\n  }\n\n  for (i = (0); i < (N + 1); i++) {\n\n    if (!vis[i]) {\n\n      solve(i);\n    }\n  }\n\n  for (i = (0); i < (N + 1); i++) {\n\n    if (B[i]) {\n\n      wt_L(-1);\n\n      wt_L('\\n');\n\n      return 0;\n    }\n  }\n\n  sortA_L(ress, res);\n\n  wt_L(ress);\n\n  wt_L('\\n');\n\n  {\n\n    int jbtyPBGc;\n\n    if (ress == 0) {\n\n      putchar_unlocked('\\n');\n\n    }\n\n    else {\n\n      for (jbtyPBGc = (0); jbtyPBGc < (ress - 1); jbtyPBGc++) {\n\n        wt_L(res[jbtyPBGc] + 1);\n\n        wt_L(' ');\n      }\n\n      wt_L(res[jbtyPBGc] + 1);\n\n      wt_L('\\n');\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"8809a7a9dc351f3d9114aa74de0c2b4eaa4957cf0522013fbb7ee249558596c7","fast_id":"f19fb74643d93723e8784e5eb0a6907136949ec340bec8eed3121502ec1dbdfa","fast_time":0.0317766732,"language":"cpp","measured_fast_code_id":"f19fb74643d93723e8784e5eb0a6907136949ec340bec8eed3121502ec1dbdfa","measured_slow_code_id":"565b41d7a0dceb8ad255473b7cf9cbe00965de98129bc8c66bca2495f93a2dbb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57503","problem_id":"p02799","slow_code_id":"ed2501333c8ef336b3cf4b0b6940ad785af92f1bd4d24907063b7c74ebf65d81","slow_id":"565b41d7a0dceb8ad255473b7cf9cbe00965de98129bc8c66bca2495f93a2dbb","slow_time":0.1844837003,"speedup":5.805632928874379,"stratum":"4-8","sampling_key":"05370f3cf574f4ee8e12321266db9cdd07a0182b5d7f20ae3fa27df327a90de6","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 200005, maxm = 200005;\n\ninline int gi()\n\n{\n\n  char c = getchar();\n\n  while (c < '0' || c > '9')\n    c = getchar();\n\n  int sum = 0;\n\n  while ('0' <= c && c <= '9')\n    sum = sum * 10 + c - 48, c = getchar();\n\n  return sum;\n}\n\n#define pb push_back\n\nint n, m, d[maxn];\n\nstruct edge\n\n{\n\n  int to, next, vis;\n\n} e[maxm * 2];\n\nint h[maxn], tot = 1;\n\nint w[maxm], col[maxn], fa[maxn], fe[maxn];\n\nvector<int> vec[maxn];\n\ninline void add(int u, int v)\n\n{\n\n  e[++tot] = (edge){v, h[u]};\n  h[u] = tot;\n\n  e[++tot] = (edge){u, h[v]};\n  h[v] = tot;\n}\n\nvoid dfs(int u)\n\n{\n\n  for (int i = h[u]; i; i = e[i].next) {\n\n    if (!e[i].vis)\n      continue;\n\n    int v = e[i].to;\n\n    if (col[v] == -1)\n      col[v] = 1 - col[u], dfs(v);\n  }\n}\n\nint main()\n\n{\n\n  n = gi();\n  m = gi();\n\n  for (int i = 1; i <= n; ++i)\n    d[i] = gi();\n\n  for (int i = 1; i <= m; ++i)\n    add(gi(), gi());\n\n  fill(w + 1, w + m + 1, 1e9);\n\n  d[0] = 2e9;\n\n  for (int u = 1; u <= n; ++u) {\n\n    if (!h[u])\n      return puts(\"-1\"), 0;\n    ;\n\n    int p = h[u];\n\n    for (int i = e[p].next; i; i = e[i].next) {\n\n      if (d[e[i].to] < d[e[p].to])\n        p = i;\n\n      else if (d[e[i].to] == d[e[p].to] && e[i].to < e[p].to)\n        p = i;\n    }\n\n    if (d[e[p].to] > d[u])\n      return puts(\"-1\"), 0;\n\n    w[p >> 1] = d[u];\n    fa[u] = e[p].to;\n    e[p ^ 1].vis = 1;\n  }\n\n  fill(col + 1, col + n + 1, -1);\n\n  for (int i = 1; i <= n; ++i)\n    if (fa[fa[i]] == i && col[i] == -1)\n      col[i] = 0, dfs(i);\n\n  for (int i = 1; i <= n; ++i)\n    putchar(col[i] == 0 ? 'B' : 'W');\n\n  puts(\"\");\n\n  for (int i = 1; i <= m; ++i)\n    printf(\"%d\\n\", w[i]);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, a, b) for (int i = (a), _ed = (b); i <= _ed; ++i)\n\n#define DREP(i, a, b) for (int i = (a), _ed = (b); i >= _ed; --i)\n\ntypedef long long ll;\n\ninline int read() {\n\n  register int x = 0, f = 1;\n  register char ch = getchar();\n\n  while (!isdigit(ch)) {\n    if (ch == '-')\n      f = 0;\n    ch = getchar();\n  }\n\n  while (isdigit(ch)) {\n    x = x * 10 + (ch ^ '0');\n    ch = getchar();\n  }\n\n  return f ? x : -x;\n}\n\n#define fail return puts(\"-1\"), 0;\n\nconst int N = 1e5 + 5, inf = 1e9;\n\nconst char ch[] = \"BW\";\n\nint n, m, d[N], num = 1, head[N], w[N << 1], col[N], fa[N];\n\nstruct edge {\n  int to, next, vis;\n} e[N << 2];\n\ninline void add(int u, int v) {\n\n  e[++num] = (edge){v, head[u]}, head[u] = num;\n\n  e[++num] = (edge){u, head[v]}, head[v] = num;\n}\n\ninline void dfs(int u) {\n\n  for (int i = head[u]; i; i = e[i].next) {\n\n    int v = e[i].to;\n    if (!e[i].vis || ~col[v])\n      continue;\n\n    col[v] = 1 - col[u];\n    dfs(v);\n  }\n}\n\nint main() {\n\n  n = read(), m = read();\n\n  REP(i, 1, n) d[i] = read();\n\n  REP(i, 1, m) add(read(), read()), w[i] = inf;\n\n  REP(u, 1, n) {\n\n    if (!head[u])\n      fail;\n\n    int p = head[u];\n\n    for (int i = e[p].next; i; i = e[i].next) {\n\n      if (d[e[i].to] < d[e[p].to])\n        p = i;\n\n      else if (d[e[i].to] == d[e[p].to] && e[i].to < e[p].to)\n        p = i;\n    }\n\n    if (d[e[p].to] > d[u])\n      fail;\n\n    e[p ^ 1].vis = 1;\n    w[p >> 1] = d[u];\n    fa[u] = e[p].to;\n  }\n\n  memset(col, -1, sizeof col);\n\n  REP(i, 1, n) if (fa[fa[i]] == i && !~col[i]) col[i] = 0, dfs(i);\n\n  REP(i, 1, n) putchar(ch[col[i]]);\n\n  puts(\"\");\n\n  REP(i, 1, m) printf(\"%d\\n\", w[i]);\n\n  return 0;\n}\n"}
{"fast_code_id":"b0a7be80d45489614aa23bb021dd469ff6a08d836821ea9a9db0ce63a3930d5b","fast_id":"2b9231b27892794cac235222493f74ffa971082e388db64cf9ceb6c679c08546","fast_time":0.0198592932,"language":"cpp","measured_fast_code_id":"2b9231b27892794cac235222493f74ffa971082e388db64cf9ceb6c679c08546","measured_slow_code_id":"9dd46793651ad37e280a4b00dac2fec705f2a50083470319f2849b7881b5b183","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57526","problem_id":"p04004","slow_code_id":"ab779e2dabadcb9614a6af621c810dcbba09790cf3f41eda17b63b203308240b","slow_id":"9dd46793651ad37e280a4b00dac2fec705f2a50083470319f2849b7881b5b183","slow_time":0.0610144123,"speedup":3.0723355401188197,"stratum":"2-4","sampling_key":"1de5978bdaea75ca4e332cc4167082dc085f852e838571d47c14d39d8e31200c","slow_code":"#include <cstring>\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 900010, rhl = 1000000007;\n\nint N, M, K;\nll jie[maxn], inv[maxn], mi[maxn];\n\ninline ll qsm(ll a, int b)\n\n{\n\n  ll ret = 1;\n\n  for (; b; b >>= 1, (a *= a) %= rhl)\n    if (b & 1)\n      (ret *= a) %= rhl;\n\n  return ret;\n}\n\ninline int gi()\n\n{\n\n  char ch;\n  int ret = 0, f = 1;\n\n  do\n    ch = getchar();\n  while (!(ch >= '0' && ch <= '9') && ch != '-');\n\n  if (ch == '-')\n    f = -1, ch = getchar();\n\n  do\n    ret = ret * 10 + ch - '0', ch = getchar();\n  while (ch >= '0' && ch <= '9');\n\n  return ret * f;\n}\n\ninline ll C(int n, int m) {\n  if (n < m || m < 0)\n    return 0;\n  return jie[n] * inv[m] % rhl * inv[n - m] % rhl;\n}\n\nint main()\n\n{\n\n  N = gi();\n  M = gi();\n  K = gi();\n\n  jie[0] = mi[0] = 1;\n\n  for (int i = 1; i <= N + M + K; ++i)\n\n  {\n\n    mi[i] = mi[i - 1] * 3LL;\n    while (mi[i] >= rhl)\n      mi[i] -= rhl;\n\n    jie[i] = jie[i - 1] * (ll)i;\n    if (jie[i] >= rhl)\n      jie[i] %= rhl;\n  }\n\n  inv[N + M + K] = qsm(jie[N + M + K], rhl - 2);\n\n  for (int i = N + M + K; i; --i)\n\n  {\n\n    inv[i - 1] = inv[i] * (ll)i;\n\n    if (inv[i - 1] >= rhl)\n      inv[i - 1] %= rhl;\n  }\n\n  ll sum = 1, ans = 0;\n\n  for (int i = 0; i <= M + K; ++i)\n\n  {\n\n    ll tm = C(N + i - 1, i) * mi[M + K - i] % rhl;\n\n    ans += tm * sum % rhl;\n    if (ans >= rhl)\n      ans %= rhl;\n\n    sum <<= 1;\n    if (sum >= rhl)\n      sum -= rhl;\n\n    sum -= C(i, i - K) + C(i, M);\n    while (sum < 0)\n      sum += rhl;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 9e5 + 5;\n\nconst int mod = 1e9 + 7;\n\nint n, m, k, Q;\n\nll ans;\n\nll f[maxn], fac[maxn], inv[maxn], bin[maxn];\n\nll power(ll b, int k)\n\n{\n\n  ll res = 1;\n\n  for (; k; k >>= 1, b = b * b % mod)\n\n    if (k & 1)\n\n      res = res * b % mod;\n\n  return res;\n}\n\nll C(int n, int m)\n\n{\n\n  if (m > n)\n\n    return 0;\n\n  return fac[n] * inv[m] % mod * inv[n - m] % mod;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d%d\", &n, &m, &k);\n\n  Q = m + k;\n\n  f[0] = fac[0] = bin[0] = inv[0] = 1;\n\n  for (int i = 1; i <= n + Q; i++)\n\n  {\n\n    fac[i] = fac[i - 1] * i % mod;\n\n    inv[i] = power(fac[i], mod - 2);\n  }\n\n  for (int i = 1; i <= Q; i++)\n\n  {\n\n    f[i] = ((f[i - 1] << 1) - C(i - 1, m) - C(i - 1, k) + (mod << 1)) % mod;\n\n    bin[i] = bin[i - 1] * 3 % mod;\n  }\n\n  for (int i = 0; i <= Q; i++)\n\n  {\n\n    ll tmp = C(i + n - 1, n - 1) * f[i] % mod * bin[Q - i] % mod;\n\n    ans += tmp;\n\n    if (ans >= mod)\n\n      ans -= mod;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"b20c0d9fb0159424c72309cceca30fb3a75f2347665564c3b7675244ba54a567","fast_id":"9bcf1912cdf0d386bb27ec58d2d6924c18510d91802d4cb09f762d29835b2351","fast_time":0.109624267,"language":"cpp","measured_fast_code_id":"9bcf1912cdf0d386bb27ec58d2d6924c18510d91802d4cb09f762d29835b2351","measured_slow_code_id":"2bb529226fde1444e1ca57dde5cac27296c5858ba5b619ee0c7f4d3ea6451672","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57562","problem_id":"p02882","slow_code_id":"916a9908ce52e761a8f6d6feb3d743282c08cbcea0f76def4a5d8d36bc09fe33","slow_id":"2bb529226fde1444e1ca57dde5cac27296c5858ba5b619ee0c7f4d3ea6451672","slow_time":1.186394928,"speedup":10.822375013006928,"stratum":"8+","sampling_key":"3c56e3a28d3e0a8f45ba1e4b36620a33062c8600c28f49756920bc2db7da4700","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst long double PI = (acos(-1));\n\nconst long double EPS = 0.0000000001;\n\nlong double a, b, x;\n\nlong double f(long double a, long double b, long double theta) {\n\n  if (theta > PI / 2.0 - EPS)\n    return 0.0;\n\n  long double ret;\n\n  if (a * tan(theta) <= b)\n\n    ret = a * a * b - a * a * a * tan(theta) / 2.0;\n\n  else\n\n    ret = b * b / tan(theta) * a / 2.0;\n\n  return ret;\n}\n\nvoid solve() {\n\n  long double ok = PI / 2.0;\n\n  long double ng = 0.0;\n\n  for (int _ = 1; _ <= 100000; _++) {\n\n    long double mid = (ok + ng) / 2.0;\n\n    if (f(a, b, mid) < x)\n      ok = mid;\n\n    else\n      ng = mid;\n  }\n\n  cout << fixed << setprecision(10) << ok / PI * 180 << endl;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> a >> b >> x;\n\n  solve();\n\n  return 0;\n}","fast_code":"#include \"bits/stdc++.h\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<int, int> P;\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  double a, b, x;\n\n  cin >> a >> b >> x;\n\n  x /= a;\n\n  double rad;\n\n  if (x <= a * b / 2)\n    rad = atan2(b * b, 2 * x);\n\n  else\n    rad = atan2(2 * (a * b - x), a * a);\n\n  double ans = rad / (2 * acos(-1)) * 360;\n\n  cout << fixed << setprecision(12) << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"710097c36b32ba0f3f0d0971ea5de81857a0e4a33e25e4a70f320f96c125ab23","fast_id":"d56a8b1fc9b119b86fb9a51ddb0b6074ff68ce39c79468cef5248063be31c05e","fast_time":0.0188921058,"language":"cpp","measured_fast_code_id":"d56a8b1fc9b119b86fb9a51ddb0b6074ff68ce39c79468cef5248063be31c05e","measured_slow_code_id":"7ab9fb2d3784f8d90779f2f804f652661df0fbe741af188b5a42ff9e4ae7ae7b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57582","problem_id":"p03279","slow_code_id":"c757b66545b41adb6abb241f3c372a3bc45fd1750e39dfcbc6e7cf229b1afd02","slow_id":"7ab9fb2d3784f8d90779f2f804f652661df0fbe741af188b5a42ff9e4ae7ae7b","slow_time":0.0985298514,"speedup":5.215398031488898,"stratum":"4-8","sampling_key":"1cd0f1ae94f13ecdbe73b90c51c10d835330a2559bdd500673ae033d09055808","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define F first\n\n#define S second\n\n#define PB push_back\n\n#define sz(s) int((s).size())\n\n#define bit(n, k) (((n) >> (k)) & 1)\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\nconst int maxn = 1e5 + 10, mod = 1e9 + 7;\n\nconst ll inf = 1e18;\n\nint a[maxn], b[maxn], dp[maxn], sm[maxn], tot;\n\nmap<int, vector<pii> > mp;\n\nvector<int> v;\n\nset<pii> s;\n\nvoid add(int id, int num) {\n\n  tot = (tot + num) % mod;\n\n  while (id < maxn) {\n\n    sm[id] = (sm[id] + num) % mod;\n\n    id += (id & -id);\n  }\n}\n\nint ask(int id) {\n\n  int ans = 0;\n\n  while (id > 0) {\n\n    ans = (ans + sm[id]) % mod;\n\n    id -= (id & -id);\n  }\n\n  return ans;\n}\n\nint main() {\n\n  int n, m;\n  cin >> n >> m;\n\n  for (int i = 0; i < n; i++)\n\n    cin >> a[i];\n\n  for (int i = 0; i < m; i++)\n\n    cin >> b[i];\n\n  for (int i = 0; i < n; i++) {\n\n    if (a[i] < b[0] || b[m - 1] < a[i])\n      continue;\n\n    int id = upper_bound(b, b + m, a[i]) - b;\n\n    int A = a[i] - b[id - 1], B = b[id] - a[i];\n\n    if (s.count({A, B}))\n      continue;\n\n    s.insert({A, B});\n\n    mp[A].PB({B, i});\n\n    v.PB(B);\n  }\n\n  mp[-1].PB({-1, n});\n\n  v.PB(-1);\n\n  sort(v.begin(), v.end());\n\n  v.resize(unique(v.begin(), v.end()) - v.begin());\n\n  tot = 1;\n\n  for (auto it = mp.rbegin(); it != mp.rend(); it++) {\n\n    vector<pii> &vec = it->S;\n\n    for (pii p : vec) {\n\n      p.F = lower_bound(v.begin(), v.end(), p.F) - v.begin() + 1;\n\n      dp[p.S] = (tot - ask(p.F)) % mod;\n    }\n\n    for (pii p : vec) {\n\n      p.F = lower_bound(v.begin(), v.end(), p.F) - v.begin() + 1;\n\n      add(p.F, dp[p.S]);\n    }\n  }\n\n  if (dp[n] < 0)\n    dp[n] += mod;\n\n  cout << dp[n] << endl;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <utility>\n\n#include <functional>\n\n#include <cmath>\n\n#include <vector>\n\nusing std::min;\n\nusing std::max;\n\nusing std::swap;\n\nusing std::sort;\n\nusing std::reverse;\n\nusing std::random_shuffle;\n\nusing std::lower_bound;\n\nusing std::upper_bound;\n\nusing std::unique;\n\nusing std::vector;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef double db;\n\ntypedef std::pair<int, int> pii;\n\ntypedef std::pair<ll, ll> pll;\n\nvoid open(const char *s) {\n\n#ifndef ONLINE_JUDGE\n\n  char str[100];\n  sprintf(str, \"%s.in\", s);\n  freopen(str, \"r\", stdin);\n  sprintf(str, \"%s.out\", s);\n  freopen(str, \"w\", stdout);\n\n#endif\n}\n\nint rd() {\n  int s = 0, c, b = 0;\n  while (((c = getchar()) < '0' || c > '9') && c != '-')\n    ;\n  if (c == '-') {\n    c = getchar();\n    b = 1;\n  }\n  do {\n    s = s * 10 + c - '0';\n  } while ((c = getchar()) >= '0' && c <= '9');\n  return b ? -s : s;\n}\n\nvoid put(int x) {\n  if (!x) {\n    putchar('0');\n    return;\n  }\n  static int c[20];\n  int t = 0;\n  while (x) {\n    c[++t] = x % 10;\n    x /= 10;\n  }\n  while (t)\n    putchar(c[t--] + '0');\n}\n\nint upmin(int &a, int b) {\n  if (b < a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nint upmax(int &a, int b) {\n  if (b > a) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nconst ll p = 1000000007;\n\nconst int N = 100010;\n\nint cmp(pii a, pii b)\n\n{\n\n  if (a.first != b.first)\n\n    return a.first < b.first;\n\n  return a.second > b.second;\n}\n\nint n, m, t, t2;\n\nint a[N], b[N], d[N];\n\npii c[N];\n\nll e[N];\n\nll add(ll a, ll b)\n\n{\n\n  a += b;\n\n  return a >= p ? a - p : a;\n}\n\nvoid add(int x, ll v)\n\n{\n\n  for (; x <= t2; x += x & -x)\n\n    e[x] = add(e[x], v);\n}\n\nll sum(int x)\n\n{\n\n  ll s = 0;\n\n  for (; x; x -= x & -x)\n\n    s = add(s, e[x]);\n\n  return s;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  for (int i = 1; i <= m; i++)\n\n    scanf(\"%d\", &b[i]);\n\n  for (int i = 1; i <= n; i++)\n\n    if (a[i] > b[1] && a[i] < b[m])\n\n    {\n\n      int x = lower_bound(b + 1, b + m + 1, a[i]) - b;\n\n      if (b[x] == a[i])\n\n        continue;\n\n      c[++t] = pii(a[i] - b[x - 1], b[x] - a[i]);\n\n      d[++t2] = b[x] - a[i];\n    }\n\n  sort(d + 1, d + t2 + 1);\n\n  t2 = unique(d + 1, d + t2 + 1) - d - 1;\n\n  for (int i = 1; i <= t; i++)\n\n    c[i].second = lower_bound(d + 1, d + t2 + 1, c[i].second) - d;\n\n  sort(c + 1, c + t + 1, cmp);\n\n  t = unique(c + 1, c + t + 1) - c - 1;\n\n  ll ans = 1;\n\n  for (int i = 1; i <= t; i++)\n\n  {\n\n    ll s = sum(c[i].second - 1) + 1;\n\n    ans += s;\n\n    add(c[i].second, s);\n  }\n\n  ans %= p;\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"98f535f4071dc8cfd23419bdf5ca717b22d8ab5a2cabd2376ca8bf87d6788c15","fast_id":"3148d1c9473342714a337216ea6031a7930b11c970fe16af60cec53caa902ae0","fast_time":0.0195384792,"language":"cpp","measured_fast_code_id":"3148d1c9473342714a337216ea6031a7930b11c970fe16af60cec53caa902ae0","measured_slow_code_id":"1e5d48a4973427a27096d2307822531d8109432d1826c162f448cb533fc48b32","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57622","problem_id":"p03850","slow_code_id":"55c37c95fa017b8c4c2bee52ea93bf783f43e0aad9bd93c0665ff966605a68f5","slow_id":"1e5d48a4973427a27096d2307822531d8109432d1826c162f448cb533fc48b32","slow_time":0.3608858041,"speedup":18.470516584525164,"stratum":"8+","sampling_key":"27fbf5b2813539dd81fbf781f7df2a63a639f7caedb0737225bdf9221da4a9ef","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int N = 1e5 + 100;\n\nint n, a[N];\n\nchar op[N];\n\nLL f[N][3];\n\nvoid cmax(LL &x, LL y) { x = x > y ? x : y; }\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n    op[i] = '!';\n\n    if (i == n)\n      break;\n\n    while (op[i] != '+' && op[i] != '-')\n      op[i] = getchar();\n  }\n\n  memset(f, 0xcf, sizeof(f));\n  f[1][0] = a[1];\n\n  for (int i = 1; i < n; ++i)\n\n  {\n\n    if (op[i] == '-')\n      cmax(f[i + 1][1], f[i][0] - a[i + 1]);\n\n    if (op[i] == '+')\n      cmax(f[i + 1][0], f[i][0] + a[i + 1]);\n\n    if (op[i] == '-')\n      cmax(f[i + 1][0], f[i][0] - a[i + 1]);\n\n    if (op[i] == '+')\n      cmax(f[i + 1][1], f[i][1] - a[i + 1]);\n\n    if (op[i] == '-')\n      cmax(f[i + 1][1], f[i][1] + a[i + 1]);\n\n    if (op[i] == '-')\n      cmax(f[i + 1][2], f[i][1] + a[i + 1]);\n\n    if (op[i] == '+')\n      cmax(f[i + 1][0], f[i][1] + a[i + 1]);\n\n    if (op[i] == '-')\n      cmax(f[i + 1][0], f[i][1] - a[i + 1]);\n\n    if (op[i] == '+')\n      cmax(f[i + 1][2], f[i][2] + a[i + 1]);\n\n    if (op[i] == '-')\n      cmax(f[i + 1][2], f[i][2] + a[i + 1]);\n\n    if (op[i] == '+')\n      cmax(f[i + 1][0], f[i][2] + a[i + 1]);\n\n    if (op[i] == '-')\n      cmax(f[i + 1][0], f[i][2] - a[i + 1]);\n\n    if (op[i] == '-')\n      cmax(f[i + 1][1], f[i][2] - a[i + 1]);\n  }\n\n  printf(\"%lld\", max(f[n][0], max(f[n][1], f[n][2])));\n\n  return 0;\n}","fast_code":"#include <cctype>\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing i64 = long long;\n\nint fetc() {\n  int c = getchar();\n  while (c ^ '-' && c ^ '+')\n    c = getchar();\n  return c;\n}\n\nint read() {\n  int x = 0, c = getchar();\n  while (isspace(c))\n    c = getchar();\n  while (isdigit(c))\n    (x *= 10) += c & 15, c = getchar();\n  return x;\n}\n\nint main()\n\n{\n\n  int n = read();\n  i64 ans = read(), b = -1e18, c = -1e18;\n\n  for (int x; n ^ 1; --n)\n    fetc() == '-' ? (x = read(), c = b + x, ans = b = std::max(ans - x, c))\n                  : (x = read(), ans += x, c += x, b = std::max(b - x, c));\n\n  printf(\"%lld\", ans);\n}\n"}
{"fast_code_id":"323401e2eb2991bbfe7458b497e95636c6ba14b7a76e9d853ab597601fad3fab","fast_id":"260b466c91d74dbf16d068eb26e6d20738c3a9da5f77b73037977bfec6bd37da","fast_time":0.0189241315,"language":"cpp","measured_fast_code_id":"260b466c91d74dbf16d068eb26e6d20738c3a9da5f77b73037977bfec6bd37da","measured_slow_code_id":"ec9f1bfe0bb526c8abb9d76e69bcfab960f7ebef58400636979349283d90523e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57627","problem_id":"p01136","slow_code_id":"21a71c6842189d460593fa45b9b4bdd9cda4799371ea8d1989c86decde5abed9","slow_id":"ec9f1bfe0bb526c8abb9d76e69bcfab960f7ebef58400636979349283d90523e","slow_time":0.0999040457,"speedup":5.27918788241352,"stratum":"4-8","sampling_key":"556be9b40719fbfed9343b6cc87e22e287de9b218aaee8b6cbb15cfb59e4106e","slow_code":"#include <iostream>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long STATES;\n\nint main(void)\n\n{\n\n  register int i, j;\n\n  int n;\n\n  while (cin >> n && n)\n\n  {\n\n    STATES goal_state = 0;\n\n    for (i = 0; i < n; i++)\n      goal_state |= 1LL << i;\n\n    vector<STATES> free_days(30 + 1, 0);\n\n    for (i = 0; i < n; i++)\n\n    {\n\n      int k;\n      cin >> k;\n\n      for (j = 0; j < k; j++)\n\n      {\n\n        int free_day;\n        cin >> free_day;\n\n        free_days[free_day] |= 1LL << i;\n      }\n    }\n\n    int answer = -1;\n\n    vector<STATES> dp(n, 0);\n\n    for (i = 0; i < n; i++)\n      dp[i] = 1LL << i;\n\n    for (i = 1; answer == -1 && i <= 30; i++)\n\n    {\n\n      register STATES next = 0;\n\n      for (j = 0; j < n; j++)\n        if (free_days[i] & (1LL << j))\n          next |= dp[j];\n\n      for (j = 0; j < n; j++)\n        if (free_days[i] & (1LL << j))\n          dp[j] |= next;\n\n      if (next == goal_state)\n        answer = i;\n    }\n\n    cout << answer << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long STATES;\n\nint main(void)\n\n{\n\n  STATES free_days[31], dp[51];\n\n  STATES goal_state, next;\n\n  register int i, j;\n\n  int n, answer, free_day, k;\n\n  while (scanf(\"%d\", &n) == 1 && n)\n\n  {\n\n    memset(free_days, 0, sizeof(STATES) * 31);\n\n    memset(dp, 0, sizeof(STATES) * n);\n\n    goal_state = 0;\n\n    for (i = 0; i < n; i++)\n      goal_state |= 1LL << i;\n\n    for (i = 0; i < n; i++)\n\n    {\n\n      scanf(\"%d\", &k);\n\n      for (j = 0; j < k; j++)\n\n      {\n\n        scanf(\"%d\", &free_day);\n\n        free_days[free_day] |= 1LL << i;\n      }\n    }\n\n    answer = -1;\n\n    for (i = 0; i < n; i++)\n      dp[i] = 1LL << i;\n\n    for (i = 1; answer == -1 && i <= 30; i++)\n\n    {\n\n      next = 0;\n\n      for (j = 0; j < n; j++)\n        if (free_days[i] & (1LL << j))\n          next |= dp[j];\n\n      for (j = 0; j < n; j++)\n        if (free_days[i] & (1LL << j))\n          dp[j] |= next;\n\n      if (next == goal_state)\n        answer = i;\n    }\n\n    printf(\"%d\\n\", answer);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"f31183571400971688235c8152be7c985c9694da502fa020e522936fbb9874db","fast_id":"76eb245d7bc46855918a796768524b5dda349f180a00f9c69e3aec373a34815a","fast_time":0.1044331926,"language":"cpp","measured_fast_code_id":"76eb245d7bc46855918a796768524b5dda349f180a00f9c69e3aec373a34815a","measured_slow_code_id":"d15b10e3e74b5536e018671517c0f283a2efbd48a728094e97819bf7787f511b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57636","problem_id":"p02272","slow_code_id":"008f0623d3bf5a9c0394f25945e16bec683c5369f8e0a0753b7398e4eefe4542","slow_id":"d15b10e3e74b5536e018671517c0f283a2efbd48a728094e97819bf7787f511b","slow_time":0.3168130125,"speedup":3.0336428927674093,"stratum":"2-4","sampling_key":"42be846abe94ecc8bd0975ba8415b049e9fbea3d34dac4bc3952a0a521777ce6","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <cstdio>\n\nusing namespace std;\n\nconst int INF = 1000000001;\n\nconst int MAX = 500000;\n\nint cnt;\n\nint L[1 + MAX / 2] = {0}, R[1 + MAX / 2] = {0};\n\nvoid merge(int *A, int left, int mid, int right)\n\n{\n\n  int n1, n2, n, i, j;\n\n  n1 = mid - left;\n\n  n2 = right - mid;\n\n  for (int i = 0; i < n1; i++)\n\n  {\n\n    L[i] = A[left + i];\n  }\n\n  for (int i = 0; i < n2; i++)\n\n  {\n\n    R[i] = A[mid + i];\n  }\n\n  L[n1] = INF;\n\n  R[n2] = INF;\n\n  i = 0;\n\n  j = 0;\n\n  for (int k = 0; k < right - left; k++)\n\n  {\n\n    if (L[i] <= R[j])\n\n    {\n\n      A[left + k] = L[i];\n\n      i++;\n\n    } else\n\n    {\n\n      A[left + k] = R[j];\n\n      j++;\n    }\n\n    cnt++;\n  }\n}\n\nvoid mergesort(int *A, int left, int right)\n\n{\n\n  int mid, sol, sol_left, sol_right;\n\n  if (left + 1 < right)\n\n  {\n\n    mid = (left + right) / 2;\n\n    mergesort(A, left, mid);\n\n    mergesort(A, mid, right);\n\n    merge(A, left, mid, right);\n  }\n}\n\nint main()\n\n{\n\n  int N, S[MAX] = {0}, solution;\n\n  cnt = 0;\n\n  cin >> N;\n\n  for (int i = 0; i < N; i++)\n\n  {\n\n    cin >> S[i];\n  }\n\n  mergesort(S, 0, N);\n\n  for (int i = 0; i < N; i++)\n\n  {\n\n    if (i == N - 1)\n\n    {\n\n      cout << S[i] << endl;\n\n    } else\n\n    {\n\n      cout << S[i] << \" \";\n    }\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\nusing namespace std;\n\nconst int INF = 1000000001;\n\nconst int MAX = 500000;\n\nint cnt, N;\n\nint S[MAX] = {0}, L[1 + MAX / 2] = {0}, R[1 + MAX / 2] = {0};\n\nvoid merge(int *A, int left, int mid, int right)\n\n{\n\n  int n1, n2, i, j;\n\n  n1 = mid - left;\n\n  n2 = right - mid;\n\n  for (int i = 0; i < n1; i++)\n\n  {\n\n    L[i] = A[left + i];\n  }\n\n  for (int i = 0; i < n2; i++)\n\n  {\n\n    R[i] = A[mid + i];\n  }\n\n  L[n1] = INF;\n\n  R[n2] = INF;\n\n  i = 0;\n\n  j = 0;\n\n  for (int k = 0; k < right - left; k++)\n\n  {\n\n    if (L[i] <= R[j])\n\n    {\n\n      A[left + k] = L[i];\n\n      i++;\n\n    } else\n\n    {\n\n      A[left + k] = R[j];\n\n      j++;\n    }\n\n    cnt++;\n  }\n}\n\nvoid mergesort(int *A, int left, int right)\n\n{\n\n  int mid;\n\n  if (left + 1 < right)\n\n  {\n\n    mid = (left + right) / 2;\n\n    mergesort(A, left, mid);\n\n    mergesort(A, mid, right);\n\n    merge(A, left, mid, right);\n  }\n}\n\nint main()\n\n{\n\n  cnt = 0;\n\n  cin >> N;\n\n  for (int i = 0; i < N; i++)\n\n  {\n\n    cin >> S[i];\n  }\n\n  mergesort(S, 0, N);\n\n  for (int i = 0; i < N; i++)\n\n  {\n\n    if (i == N - 1)\n\n    {\n\n      cout << S[i] << endl;\n\n    } else\n\n    {\n\n      cout << S[i] << \" \";\n    }\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"2147bfb0014346ea8c7139b4d285ccf3facdd5ca221beb60c157a542064ce6e4","fast_id":"941bec10d11020ad3d40c5e5d7fb1485405500a9f90dba5bf026316e991627c8","fast_time":0.016799354,"language":"cpp","measured_fast_code_id":"941bec10d11020ad3d40c5e5d7fb1485405500a9f90dba5bf026316e991627c8","measured_slow_code_id":"ea21d7e603d748a03fffa7aeefcd60ce28b4e722386fb6b9a91e8d0db58cd2b6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57648","problem_id":"p03026","slow_code_id":"596f3972e83eb710c09ae9646fcb93a0d96a0932f2b6f7ab43e91da4aafbd03f","slow_id":"ea21d7e603d748a03fffa7aeefcd60ce28b4e722386fb6b9a91e8d0db58cd2b6","slow_time":0.114019499,"speedup":6.787135922012239,"stratum":"4-8","sampling_key":"42f7ef0f2984501ce00a1a4a63d807d173ea6a3e9229720b62425fe282edcae8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint d = 0;\n\nint D[10002];\n\nint topo[10002];\n\nvector<int> E[10002];\n\nvoid dfs(int A, int B) {\n\n  if (!D[A]) {\n\n    D[A] = B;\n\n    topo[A] = d;\n\n    d++;\n\n    for (int i : E[A]) {\n\n      dfs(i, B + 1);\n    }\n  }\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  rep(i, N - 1) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    E[a].pb(b);\n\n    E[b].pb(a);\n  }\n\n  int C[10002];\n\n  int goukei = 0;\n\n  int saidai = 0;\n\n  rep(i, N) {\n\n    cin >> C[i];\n\n    goukei += C[i];\n\n    saidai = max(saidai, C[i]);\n  }\n\n  sort(C, C + N);\n\n  reverse(C, C + N);\n\n  dfs(1, 1);\n\n  co(goukei - saidai);\n\n  rep1(i, N) { cosp(C[topo[i]]); }\n\n  Would you please return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint d = 1;\n\nbool D[10001];\n\nint H[10001], topo[10001];\n\npair<int, int> E[20002];\n\nvoid dfs(int A) {\n\n  if (!D[A]) {\n\n    D[A] = true;\n\n    topo[A] = d;\n\n    d++;\n\n    for (int i = H[A]; i; i = E[i].second) {\n\n      dfs(E[i].first);\n    }\n  }\n}\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 8 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  int N = getint();\n\n  for (int i = 2; i < 2 * N; i += 2) {\n\n    int a = getint(), b = getint();\n\n    E[i] = mp(a, H[b]);\n\n    H[b] = i;\n\n    E[i + 1] = mp(b, H[a]);\n\n    H[a] = i + 1;\n  }\n\n  int C[10000];\n\n  int goukei = 0;\n\n  rep(i, N) {\n\n    C[i] = getint();\n\n    goukei += C[i];\n  }\n\n  sort(C, C + N);\n\n  dfs(1);\n\n  const int dm = 1 << 17;\n\n  char dn[dm], *di = dn;\n\n  int X = goukei - C[N - 1];\n\n  int keta = 0;\n\n  char c[10];\n\n  while (X) {\n\n    *(c + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(c + i));\n\n  *di++ = '\\n';\n\n  rep1(i, N) {\n\n    X = C[N - topo[i]];\n\n    keta = 0;\n\n    while (X) {\n\n      *(c + keta) = '0' + X % 10;\n\n      X /= 10;\n\n      keta++;\n    }\n\n    for (int i = keta - 1; i >= 0; i--)\n      *di++ = (*(c + i));\n\n    *di++ = ' ';\n  }\n\n  fwrite_unlocked(dn, di - dn, 1, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"6a887a60e12db6f0e2dd2821e9dccb6549096af93f45a306550e20fa587f0ae1","fast_id":"45061dd3bac2d1b74c5f63abab349ec42fb4536046fffd3c71388852a7d36322","fast_time":0.0863257029,"language":"cpp","measured_fast_code_id":"45061dd3bac2d1b74c5f63abab349ec42fb4536046fffd3c71388852a7d36322","measured_slow_code_id":"b7ea2a6851680fd624bcaa1bf5fb2001a80c641d19ea7368c40ca2d0e46d68dd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57664","problem_id":"p02754","slow_code_id":"d2cb0f5ad5fb388b26c822c20abb5ca9a38060576379006f3c19935cb35f9bd9","slow_id":"b7ea2a6851680fd624bcaa1bf5fb2001a80c641d19ea7368c40ca2d0e46d68dd","slow_time":0.2242788717,"speedup":2.5980543936005414,"stratum":"2-4","sampling_key":"1c5007692b89724a50e1dc32bbe7a66aa471f3b730a2412970971fffbc9cba88","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <map>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <set>\n\n#include <stdio.h>\n\n#include <tuple>\n\n#include <bitset>\n\n#include <cfloat>\n\n#include <fstream>\n\n#include <limits.h>\n\n#include <list>\n\n#include <math.h>\n\n#include <random>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <bitset>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <cassert>\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n\n  if (a > b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n\n  if (a < b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\nusing namespace std;\n\n#define int long long\n\n#define ll long long\n\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\n#define P pair<ll, ll>\n\n#define sz(x) (ll) x.size()\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define ALLR(x) (x).rbegin(), (x).rend()\n\n#define VE vector<ll>\n\n#define COUT(x) cout << (x) << endl\n\n#define MA map<ll, ll>\n\n#define SE set<ll>\n\n#define PQ priority_queue<ll>\n\n#define PQR priority_queue<ll, VE, greater<ll>>\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << endl\n\n#define EPS (1e-14)\n\n#define pb push_back\n\nlong long MOD = 1000000007;\n\nconst long long INF = 1LL << 60;\n\nconst double PI = acos(-1.0);\n\nusing Graph = vector<VE>;\n\nstruct mint {\n\n  ll x;\n\n  mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}\n\n  mint operator-() const { return mint(-x); }\n\n  mint &operator+=(const mint a) {\n\n    if ((x += a.x) >= MOD)\n      x -= MOD;\n\n    return *this;\n  }\n\n  mint &operator-=(const mint a) {\n\n    if ((x += MOD - a.x) >= MOD)\n      x -= MOD;\n\n    return *this;\n  }\n\n  mint &operator*=(const mint a) {\n\n    (x *= a.x) %= MOD;\n\n    return *this;\n  }\n\n  mint operator+(const mint a) const {\n\n    mint res(*this);\n\n    return res += a;\n  }\n\n  mint operator-(const mint a) const {\n\n    mint res(*this);\n\n    return res -= a;\n  }\n\n  mint operator*(const mint a) const {\n\n    mint res(*this);\n\n    return res *= a;\n  }\n\n  mint pow(ll t) const {\n\n    if (!t)\n      return 1;\n\n    mint a = pow(t >> 1);\n\n    a *= a;\n\n    if (t & 1)\n      a *= *this;\n\n    return a;\n  }\n\n  mint inv() const { return pow(MOD - 2); }\n\n  mint &operator/=(const mint a) { return (*this) *= a.inv(); }\n\n  mint operator/(const mint a) const {\n\n    mint res(*this);\n\n    return res /= a;\n  }\n\n  friend ostream &operator<<(ostream &os, const mint &m) {\n\n    os << m.x;\n\n    return os;\n  }\n};\n\nstruct combination {\n\n  vector<mint> fact, ifact;\n\n  combination(int n) : fact(n + 1), ifact(n + 1) {\n\n    fact[0] = 1;\n\n    for (int i = 1; i <= n; ++i)\n      fact[i] = fact[i - 1] * i;\n\n    ifact[n] = fact[n].inv();\n\n    for (int i = n; i >= 1; --i)\n      ifact[i - 1] = ifact[i] * i;\n  }\n\n  mint operator()(int n, int k) {\n\n    if (k < 0 || k > n)\n      return 0;\n\n    return fact[n] * ifact[k] * ifact[n - k];\n  }\n\n} com(10);\n\nstruct Sieve {\n\n  int n;\n\n  vector<int> f, primes;\n\n  Sieve(int n = 1) : n(n), f(n + 1) {\n\n    f[0] = f[1] = -1;\n\n    for (ll i = 2; i <= n; ++i) {\n\n      if (f[i])\n        continue;\n\n      primes.push_back(i);\n\n      f[i] = i;\n\n      for (ll j = i * i; j <= n; j += i) {\n\n        if (!f[j])\n          f[j] = i;\n      }\n    }\n  }\n\n  bool isPrime(int x) { return f[x] == x; }\n\n  vector<int> factorList(int x) {\n\n    vector<int> res;\n\n    while (x != 1) {\n\n      res.push_back(f[x]);\n\n      x /= f[x];\n    }\n\n    return res;\n  }\n\n  vector<P> factor(int x) {\n\n    vector<int> fl = factorList(x);\n\n    if (fl.size() == 0)\n      return {};\n\n    vector<P> res(1, P(fl[0], 0));\n\n    for (int p : fl) {\n\n      if (res.back().first == p) {\n\n        res.back().second++;\n\n      }\n\n      else {\n\n        res.emplace_back(p, 1);\n      }\n    }\n\n    return res;\n  }\n};\n\nclass UnionFind {\n\npublic:\n  vector<ll> par;\n\n  vector<ll> siz;\n\n  UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {\n\n    for (ll i = 0; i < sz_; ++i)\n      par[i] = i;\n  }\n\n  void init(ll sz_) {\n\n    par.resize(sz_);\n\n    siz.resize(sz_, 1);\n\n    for (ll i = 0; i < sz_; ++i)\n      par[i] = i;\n  }\n\n  ll root(ll x) {\n\n    while (par[x] != x) {\n\n      x = par[x] = par[par[x]];\n    }\n\n    return x;\n  }\n\n  bool merge(ll x, ll y) {\n\n    x = root(x);\n\n    y = root(y);\n\n    if (x == y)\n      return false;\n\n    if (siz[x] < siz[y])\n      swap(x, y);\n\n    siz[x] += siz[y];\n\n    par[y] = x;\n\n    return true;\n  }\n\n  bool issame(ll x, ll y) { return root(x) == root(y); }\n\n  ll size(ll x) { return siz[root(x)]; }\n};\n\ntemplate <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }\n\nll lcm(ll a, ll b) {\n\n  ll g = gcd(a, b);\n\n  return a * b / g;\n}\n\nbool prime(ll n) {\n\n  for (ll i = 2; i <= sqrt(n); i++) {\n\n    if (n % i == 0)\n      return false;\n  }\n\n  return n != 1;\n}\n\nmap<ll, ll> prime_factor(ll n) {\n\n  map<ll, ll> ret;\n\n  for (ll i = 2; i * i <= n; i++) {\n\n    while (n % i == 0) {\n\n      ret[i]++;\n\n      n /= i;\n    }\n  }\n\n  if (n != 1)\n    ret[n] = 1;\n\n  return ret;\n}\n\nll modinv(ll a, ll m) {\n\n  ll b = m, u = 1, v = 0;\n\n  while (b) {\n\n    ll t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvector<pair<char, int>> RunLength(string s) {\n\n  if (s.size() == 0)\n    return {};\n\n  vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));\n\n  for (char p : s) {\n\n    if (res.back().first == p) {\n\n      res.back().second++;\n\n    }\n\n    else {\n\n      res.emplace_back(p, 1);\n    }\n  }\n\n  return res;\n}\n\nint GetDigit(int num) { return log10(num) + 1; }\n\nint bit_count(int n) {\n\n  int cnt = 0;\n\n  while (n > 0) {\n\n    if (n % 2 == 1)\n      cnt++;\n\n    n /= 2;\n  }\n\n  return cnt;\n}\n\nmint POW(mint n, int p) {\n\n  if (p == 0)\n    return 1;\n\n  if (p % 2 == 0) {\n\n    mint t = POW(n, p / 2);\n\n    return t * t;\n  }\n\n  return n * POW(n, p - 1);\n}\n\nconst int dx[4] = {1, 0, -1, 0};\n\nconst int dy[4] = {0, 1, 0, -1};\n\nstruct edge {\n  ll to, cost;\n};\n\ntypedef long double ld;\n\nmint dp[100010][2];\n\nsigned main() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  int n, a, b;\n  cin >> n >> a >> b;\n\n  int tmp = n / (a + b);\n\n  int ans = tmp * a;\n\n  n -= (a + b) * tmp;\n\n  if (n >= a)\n    ans += a;\n\n  else\n    ans += n;\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <map>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <set>\n\n#include <stdio.h>\n\n#include <tuple>\n\n#include <bitset>\n\n#include <cfloat>\n\n#include <fstream>\n\n#include <limits.h>\n\n#include <list>\n\n#include <math.h>\n\n#include <random>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <bitset>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <cassert>\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n\n  if (a > b) {\n\n    a = b;\n\n    return true;\n\n  }\n\n  return false;\n\n}\n\ntemplate<class T> inline bool chmax(T& a, T b) {\n\n  if (a < b) {\n\n    a = b;\n\n    return true;\n\n  }\n\n  return false;\n\n}\n\nusing namespace std;\n\n#define int long long\n\n#define ll long long\n\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\n#define P pair<ll, ll>\n\n#define sz(x) (ll)x.size()\n\n#define ALL(x) (x).begin(),(x).end()\n\n#define ALLR(x) (x).rbegin(),(x).rend()\n\n#define VE vector<ll>\n\n#define COUT(x) cout<<(x)<<endl\n\n#define MA map<ll,ll>\n\n#define SE set<ll>\n\n#define PQ priority_queue<ll>\n\n#define PQR priority_queue<ll,VE,greater<ll>>\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\"  ) << endl\n\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\"  ) << endl\n\n#define EPS (1e-14)\n\n#define pb push_back\n\nlong long MOD = 1000000007;\n\n                                  \n\nconst long long INF = 1LL << 60;\n\nconst double PI = acos(-1.0);\n\nstruct mint {\n\n  ll x;                         \n\n  mint(ll x = 0) :x((x%MOD + MOD) % MOD) {}\n\n  mint operator-() const { return mint(-x); }\n\n  mint& operator+=(const mint a) {\n\n    if ((x += a.x) >= MOD) x -= MOD;\n\n    return *this;\n\n  }\n\n  mint& operator-=(const mint a) {\n\n    if ((x += MOD - a.x) >= MOD) x -= MOD;\n\n    return *this;\n\n  }\n\n  mint& operator*=(const mint a) {\n\n    (x *= a.x) %= MOD;\n\n    return *this;\n\n  }\n\n  mint operator+(const mint a) const {\n\n    mint res(*this);\n\n    return res += a;\n\n  }\n\n  mint operator-(const mint a) const {\n\n    mint res(*this);\n\n    return res -= a;\n\n  }\n\n  mint operator*(const mint a) const {\n\n    mint res(*this);\n\n    return res *= a;\n\n  }\n\n  mint pow(ll t) const {\n\n    if (!t) return 1;\n\n    mint a = pow(t >> 1);\n\n    a *= a;\n\n    if (t & 1) a *= *this;\n\n    return a;\n\n  }\n\n\t                \n\n  mint inv() const {\n\n  return pow(MOD - 2);\n\n  }\n\n  mint& operator/=(const mint a) {\n\n  return (*this) *= a.inv();\n\n  }\n\n  mint operator/(const mint a) const {\n\n    mint res(*this);\n\n    return res /= a;\n\n  }\n\n};\n\nistream& operator>>(istream& is, const mint& a) { return is >> a.x; }\n\nostream& operator<<(ostream& os, const mint& a) { return os << a.x; }\n\nstruct combination {\n\n  vector<mint> fact, ifact;\n\n  combination(int n) :fact(n + 1), ifact(n + 1) {\n\n    assert(n < MOD);\n\n    fact[0] = 1;\n\n    for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;\n\n    ifact[n] = fact[n].inv();\n\n    for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;\n\n  }\n\n  mint operator()(int n, int k) {\n\n    if (k < 0 || k > n) return 0;\n\n    return fact[n] * ifact[k] * ifact[n - k];\n\n  }\n\n};\n\nstruct Sieve {\n\n  int n;\n\n  vector<int> f, primes;\n\n\n\n  Sieve(int n = 1) :n(n), f(n + 1) {\n\n    f[0] = f[1] = -1;\n\n    for (ll i = 2; i <= n; ++i) {\n\n      if (f[i]) continue;\n\n      primes.push_back(i);\n\n      f[i] = i;\n\n      for (ll j = i * i; j <= n; j += i) {\n\n        if (!f[j]) f[j] = i;\n\n      }\n\n    }\n\n  }\n\n\n\n  bool isPrime(int x) { return f[x] == x; }\n\n\n\n  vector<int> factorList(int x) {\n\n    vector<int> res;\n\n    while (x != 1) {\n\n      res.push_back(f[x]);\n\n      x /= f[x];\n\n    }\n\n    return res;\n\n  }\n\n\n\n  vector<P> factor(int x) {\n\n    vector<int> fl = factorList(x);\n\n    if (fl.size() == 0) return {};\n\n    vector<P> res(1, P(fl[0], 0));\n\n    for (int p : fl) {\n\n      if (res.back().first == p) {\n\n        res.back().second++;\n\n      }\n\n      else {\n\n        res.emplace_back(p, 1);\n\n      }\n\n    }\n\n    return res;\n\n  }\n\n};\n\ntemplate<class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }\n\nll lcm(ll a, ll b) {\n\n  ll g = gcd(a, b);\n\n  return a / g * b;\n\n}\n\nbool prime(ll n) {\n\n  for (ll i = 2; i <= sqrt(n); i++) {\n\n    if (n%i == 0)return false;\n\n  }\n\n  return n != 1;\n\n}\n\nmap<ll, ll> prime_factor(ll n) {\n\n  map<ll, ll> ret;\n\n  for (ll i = 2; i * i <= n; i++) {\n\n    while (n % i == 0) {\n\n      ret[i]++;\n\n      n /= i;\n\n    }\n\n  }\n\n  if (n != 1) ret[n] = 1;\n\n  return ret;\n\n}\n\nll modinv(ll a, ll m) {\n\n  ll b = m, u = 1, v = 0;\n\n  while (b) {\n\n    ll t = a / b;\n\n    a -= t * b; swap(a, b);\n\n    u -= t * v; swap(u, v);\n\n  }\n\n  u %= m;\n\n  if (u < 0) u += m;\n\n  return u;\n\n}\n\nvector<pair<char, int>> RunLength(string s) {\n\n  if (s.size() == 0)return {};\n\n  vector<pair<char, int>>res(1, pair<char, int>(s[0], 0));\n\n  for (char p : s) {\n\n    if (res.back().first == p) {\n\n      res.back().second++;\n\n    }\n\n    else {\n\n      res.emplace_back(p, 1);\n\n    }\n\n  }\n\n  return res;\n\n}\n\n              \n\nint GetDigit(int num) {\n\nreturn log10(num) + 1;\n\n}\n\n                                                         \n\nint bit_count(int n) {\n\n  int cnt = 0;\n\n  while (n > 0) {\n\n    if (n % 2 == 1)cnt++;\n\n    n /= 2;\n\n  }\n\n  return cnt;\n\n}\n\nvector<long long> enum_divisors(long long N) {\n\n  vector<long long> res;\n\n  for (long long i = 1; i * i <= N; ++i) {\n\n    if (N % i == 0) {\n\n      res.push_back(i);\n\n      if (N / i != i) res.push_back(N / i);\n\n    }\n\n  }\n\n  sort(res.begin(), res.end());\n\n  return res;\n\n}\n\nconst ll dx[4] = { 1,0,-1,0 };\n\nconst ll dy[4] = { 0,1,0,-1 };\n\nstruct edge { ll to, cost; };\n\ntypedef long double ld;\n\nusing Graph = vector<VE>;\n\n\n\nsigned main() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n\t                                    \n\n\t                          \n\n  int n, a, b; cin >> n >> a >> b;\n\n  int ans = n / (a + b)*a;\n\n  int tmp = n % (a + b);\n\n  if (tmp <= a)ans += tmp;\n\n  else ans += a;\n\n  cout << ans << endl;\n\n  return 0;\n\n}\n"}
{"fast_code_id":"2c557cbc4d89ba79d92cfe03caf6a7478f414a8682e385b61ba9b5aa5f052bdc","fast_id":"8bfbb78b00d639dc2c43e74b2edbb3eaf5b0356f35a75829a648f9c287ba456a","fast_time":0.078327555,"language":"cpp","measured_fast_code_id":"8bfbb78b00d639dc2c43e74b2edbb3eaf5b0356f35a75829a648f9c287ba456a","measured_slow_code_id":"f950a2c04d6bf53a386e1e04156c4c09ebdec1c688a549e5b57a320fa453f9d1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_57704","problem_id":"p04022","slow_code_id":"0ff221712c7ac5d02fc3ccad09194cf06e28c7a355a23424b5d4e024b4fdb005","slow_id":"f950a2c04d6bf53a386e1e04156c4c09ebdec1c688a549e5b57a320fa453f9d1","slow_time":0.1642267458,"speedup":2.0966663111085238,"stratum":"2-4","sampling_key":"f1bde23318eaf2c48484fdbfabfe32350228c46548f502a3f7801d5aa0e1dbd4","slow_code":"#include <bits/stdc++.h>\n\n#ifndef LOCAL\n\n#pragma GCC optimize(3)\n\n#define lld \"%lld\"\n\n#else\n\n#define lld \"%I64d\"\n\n#endif\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int inf = 0x3f3f3f3f;\n\nconst int maxn = 1e5;\n\nll p[maxn];\n\nbool vis[maxn];\n\nmap<ll, int> cnt;\n\nint pCnt;\n\nvoid init() {\n\n  for (int i = 2; i < maxn; i++) {\n\n    if (!vis[i])\n      p[pCnt++] = i;\n\n    for (int j = 0; j < pCnt && p[j] * i < maxn; j++) {\n\n      vis[i * p[j]] = 1;\n\n      if (i % p[j] == 0)\n        break;\n    }\n  }\n}\n\nll da1[maxn], da2[maxn];\n\nvoid deal(int id) {\n\n  ll ans1 = 1, ans2 = 1;\n\n  ll tmp = da1[id];\n\n  for (int i = 0; p[i] * p[i] * p[i] <= tmp; i++) {\n\n    int tot = 0;\n\n    while (tmp % p[i] == 0) {\n\n      tot++;\n\n      tmp /= p[i];\n    }\n\n    tot %= 3;\n\n    if (tot == 1) {\n\n      ans1 *= p[i];\n\n      ans2 *= p[i] * p[i];\n\n    } else if (tot == 2) {\n\n      ans1 *= p[i] * p[i];\n\n      ans2 *= p[i];\n    }\n  }\n\n  ll sqrTmp = sqrt(tmp);\n\n  if (sqrTmp * sqrTmp == tmp) {\n\n    ans1 *= tmp;\n\n    ans2 *= sqrTmp;\n\n  } else {\n\n    ans1 *= tmp;\n\n    ans2 *= tmp * tmp;\n  }\n\n  da1[id] = ans1;\n  da2[id] = ans2;\n\n  cnt[ans1]++;\n}\n\nint main() {\n\n#ifdef LOCAL\n\n  freopen(\"in.txt\", \"r\", stdin);\n\n  freopen(\"out.txt\", \"w\", stdout);\n\n#endif\n\n  int n;\n\n  init();\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(lld, da1 + i);\n\n    deal(i);\n  }\n\n  int ans = 0;\n\n  if (cnt[1])\n    ans++, cnt[1] = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    ans += max(cnt[da1[i]], cnt[da2[i]]);\n\n    cnt[da1[i]] = cnt[da2[i]] = 0;\n  }\n\n  printf(\"%d\", ans);\n\n  return 0;\n}","fast_code":"\n\n#include <ext/pb_ds/hash_policy.hpp>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\n#include <stack>\n\n#include <set>\n\n#include <map>\n\n#include <cstring>\n\n#include <cmath>\n\n#define X first\n\n#define Y second\n\n#define ls rt << 1\n\n#define rs rt << 1 | 1\n\n#define getmid ((l + r) >> 1)\n\n#define PB push_back\n\n#define EP emplace_back\n\n#define MP make_pair\n\n#define lowbit(x) ((x) & -(x))\n\n#define ALL(x) x.begin(), x.end()\n\n#define mst(x, a) memset(x, a, sizeof(x))\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#ifdef LOCAL\n\n#define dbg(a) cout << #a \": \" << a << endl;\n\n#else\n\n#define dbg(a)\n\n#endif\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\ntypedef long long ll;\n\nconst int inf = 0x3f3f3f3f;\n\nconst ll INF = 0x3f3f3f3f3f3f3f3fll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<double, double> pdd;\n\nconst int N = 2200 + 10;\n\nconst int M = 1e5 + 10;\n\nconst int mod = 998244353;\n\nconst double eps = 1e-10;\n\nconst double pi = acos(-1.0);\n\nint n;\n\nll a[M];\n\nint prime[N + 1], tot;\n\nvector<ll> ve;\n\ngp_hash_table<ll, int> cnt;\n\ngp_hash_table<ll, ll> mp;\n\nvoid getPrime() {\n\n  for (int i = 2; i <= N; i++) {\n\n    if (!prime[i])\n      prime[++tot] = i;\n\n    for (int j = 1; j <= tot && prime[j] <= N / i; j++) {\n\n      prime[i * prime[j]] = 1;\n\n      if (i % prime[j] == 0)\n        break;\n    }\n  }\n}\n\ninline bool check(ll n) {\n\n  ll m = sqrt(n + 0.5);\n\n  return n == m * m;\n}\n\nint main()\n\n{\n\n#ifdef LOCAL\n\n  freopen(\"in.txt\", \"r\", stdin);\n\n#endif\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  getPrime();\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++)\n    cin >> a[i];\n\n  int ans = 0;\n\n  bool one = false;\n\n  for (int i = 1; i <= n; i++) {\n\n    ll t = a[i];\n\n    ll x = 1, y = 1;\n\n    for (int j = 1; j <= tot; j++) {\n\n      if (t % prime[j] == 0) {\n\n        int num = 0;\n\n        while (t % prime[j] == 0) {\n\n          t /= prime[j];\n\n          num++;\n        }\n\n        num %= 3;\n\n        for (int k = 1; k <= num; k++)\n          x *= prime[j];\n\n        for (int k = (3 - num) % 3; k; k--)\n          y *= prime[j];\n      }\n\n      if (t == 1)\n        break;\n    }\n\n    if (t != 1) {\n\n      if (check(t)) {\n\n        x *= t;\n\n        y *= (int)sqrt(t + 0.5);\n\n      } else {\n\n        if ((double)t * t * y <= 1e10) {\n\n          x *= t;\n\n          y *= t * t;\n\n        } else {\n\n          ans++;\n\n          continue;\n        }\n      }\n    }\n\n    if (x == 1) {\n\n      if (!one) {\n\n        one = true;\n\n        ans++;\n      }\n\n      continue;\n    }\n\n    mp[x] = y;\n\n    if (++cnt[x] == 1)\n      ve.PB(x);\n  }\n\n  for (ll val : ve) {\n\n    if (!cnt[val])\n      continue;\n\n    int x = cnt[val];\n\n    int y = cnt[mp[val]];\n\n    ans += max(x, y);\n\n    cnt[mp[val]] = 0;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"f7e4ada838778c0e51c85f65585807d5d6b48e31f07cf50887bd31618b2d6438","fast_id":"09047c212519c8dc25434e71405a2693352822632c91fb3bd39d1d4af06b8a62","fast_time":0.001341308,"language":"cpp","measured_fast_code_id":"09047c212519c8dc25434e71405a2693352822632c91fb3bd39d1d4af06b8a62","measured_slow_code_id":"5f4b4a4ea24e27b802b17cd0d8be76c2f8e69a11ae7834547431e0cb4d6cb286","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58057","problem_id":"p03116","slow_code_id":"11892965b8459496d5e1c289d46a6d962c151d25dcfd20f46a66ba07638d4cf0","slow_id":"5f4b4a4ea24e27b802b17cd0d8be76c2f8e69a11ae7834547431e0cb4d6cb286","slow_time":0.0101750174,"speedup":7.585891830959033,"stratum":"4-8","sampling_key":"b4448c9cc538eaa7f4dd0a89a7666ae22b7af9021dbeacf1eb9ff1ddbdbed436","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\n#include <map>\n\n#include <iomanip>\n\n#include <limits>\n\n#include <unordered_set>\n\n#include <cmath>\n\n#include <numeric>\n\n#include <array>\n\n#include <complex>\n\n#define M_PI 3.141592653589793238\n\nusing namespace std;\n\nlong long p = 1000000007;\n\n#define int long long\n\n#define ll long long\n\n#define vel vector<ll>\n\n#define vvel vector<vel>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define sor(v) sort(v.begin(), v.end())\n\n#define mmax(a, b) a = max(a, b)\n\n#define mmin(a, b) a = min(a, b)\n\n#define mkp make_pair\n\n#define pin pair<int, int>\n\n#define qin pair<pin, int>\n\n#define V vector\n\n#define Endl endl\n\n#define veb vector<bool>\n\n#define fcout cout << fixed << setprecision(15)\n\n#define rev(s) reverse(s.begin(), s.end())\n\n#define lower(h, val) (lower_bound(h.begin(), h.end(), val) - h.begin())\n\n#define upper(h, val) (upper_bound(h.begin(), h.end(), val) - h.begin())\n\nvel kai;\n\nvel inv_kai;\n\nint rui(int a, int n, int mod) {\n\n  if (n == 0) {\n    return 1 % mod;\n  }\n\n  int x = rui(a, n / 2, mod);\n\n  x *= x;\n  x %= mod;\n\n  if (n % 2 == 1) {\n    x *= a;\n    x %= mod;\n  }\n\n  return x;\n}\n\nint root(int x, vel &pa) {\n\n  if (pa[x] == -1) {\n    return x;\n  }\n\n  int ans = root(pa[x], pa);\n  pa[x] = ans;\n\n  return ans;\n}\n\nbool mar(int x, int y, vel &pa) {\n\n  x = root(x, pa);\n\n  y = root(y, pa);\n\n  if (x != y) {\n    pa[x] = y;\n  }\n\n  return (x != y);\n}\n\nint gcd(int x, int y) {\n\n  if (x < y) {\n    return gcd(y, x);\n  }\n\n  if (y == 0) {\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint lcm(ll x, ll y) {\n\n  x = abs(x);\n  y = abs(y);\n\n  return x * y / gcd(x, y);\n}\n\nlong long modinv(long long a, long long m) {\n\n  long long b = m, u = 1, v = 0;\n\n  while (b) {\n\n    long long t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvoid make_kai(int max_kai) {\n\n  kai = vel(max_kai, 1);\n\n  inv_kai = kai;\n\n  rep(i, max_kai - 1) {\n\n    kai[i + 1] = kai[i] * (i + 1);\n    kai[i + 1] %= p;\n\n    inv_kai[i + 1] = modinv(kai[i + 1], p);\n  }\n}\n\nint com(int n, int r) {\n\n  if ((n < 0) || (r < 0) || (r > n)) {\n    return 0;\n  }\n\n  int ans = (kai[n] * inv_kai[r]) % p;\n\n  return (ans * inv_kai[n - r]) % p;\n}\n\nvel uni(vel x) {\n\n  if (x.size() == 0) {\n    return x;\n  }\n\n  sor(x);\n\n  int n = x.size();\n\n  vel ans(1, x[0]);\n\n  for (int j = 1; j < n; j++) {\n\n    if (x[j - 1] != x[j]) {\n      ans.push_back(x[j]);\n    }\n  }\n\n  x = ans;\n\n  return x;\n}\n\nvoid pr(vel &v) {\n\n  int n = v.size();\n\n  if (n != 0) {\n\n    cout << v[0];\n\n    rep(i, n - 1) { cout << \" \" << v[i + 1]; }\n\n    cout << endl;\n  }\n}\n\nvel dijk(V<V<pin>> &way, int st, int inf) {\n\n  int n = way.size();\n\n  vel dist(n, inf);\n  dist[st] = 0;\n\n  priority_queue<pin, vector<pin>, greater<pin>> pq;\n\n  pq.push(mkp(0, st));\n\n  veb is_checked(n, false);\n\n  while (!pq.empty()) {\n\n    pin x = pq.top();\n    pq.pop();\n\n    int pot = x.second;\n\n    if (!is_checked[pot]) {\n\n      is_checked[pot] = true;\n\n      for (auto y : way[pot]) {\n\n        int nex_dist = x.first + y.second;\n\n        int nex_pot = y.first;\n\n        if (dist[nex_pot] > nex_dist) {\n\n          dist[nex_pot] = nex_dist;\n\n          pq.push(mkp(nex_dist, y.first));\n        }\n      }\n    }\n  }\n\n  return dist;\n}\n\nvel mul(vel &a, vel &b) {\n\n  int n = a.size();\n\n  int m = b.size();\n\n  vel ans(n + m - 1, 0);\n\n  rep(i, n) {\n\n    rep(j, m) {\n\n      ans[i + j] += a[i] * b[j];\n\n      ans[i + j] %= p;\n    }\n  }\n\n  return ans;\n}\n\nvel rui_p(vel &a, int n) {\n\n  if (n == 0) {\n    return {1};\n  }\n\n  vel qans = rui_p(a, n / 2);\n\n  qans = mul(qans, qans);\n\n  if (n % 2 == 1) {\n\n    qans = mul(qans, a);\n  }\n\n  return qans;\n}\n\nbool is_prime(int n) {\n\n  if (n == 0 || n == 1) {\n    return false;\n  }\n\n  for (int i = 2; i * i <= n; i++) {\n\n    if (n % i == 0) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n#define bs bitset<50>\n\nvoid per(int &ans) {\n\n  ans %= p;\n\n  if (ans < 0) {\n    ans += p;\n  }\n}\n\n#define upperbound(v, val) upper_bound(v.begin(), v.end(), val) - v.begin()\n\n#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val) - v.begin()\n\n#define mat V<V<pin>>\n\nvvel disj_min(vel &v) {\n\n  int n = v.size();\n\n  vvel ret(22, vel(n));\n\n  ret[0] = v;\n\n  rep(i, 21) {\n\n    rep(j, n) {\n\n      int nex = j + (1 << i);\n\n      if (nex < n) {\n\n        ret[i + 1][j] = min(ret[i][j], ret[i][nex]);\n\n      }\n\n      else {\n\n        ret[i + 1][j] = ret[i][j];\n      }\n    }\n  }\n\n  return ret;\n}\n\nvvel disj_max(vel &v) {\n\n  int n = v.size();\n\n  vvel ret(22, vel(n));\n\n  ret[0] = v;\n\n  rep(i, 21) {\n\n    rep(j, n) {\n\n      int nex = j + (1 << i);\n\n      if (nex < n) {\n\n        ret[i + 1][j] = max(ret[i][j], ret[i][nex]);\n\n      }\n\n      else {\n\n        ret[i + 1][j] = ret[i][j];\n      }\n    }\n  }\n\n  return ret;\n}\n\nint find_min(vvel &dv, int l, int r) {\n\n  int i = 21;\n\n  while (l + (1 << i) > r) {\n\n    i--;\n  }\n\n  return min(dv[i][l], dv[i][r - (1 << i)]);\n}\n\nint find_max(vvel &dv, int l, int r) {\n\n  int i = 21;\n\n  while (l + (1 << i) > r) {\n\n    i--;\n  }\n\n  return max(dv[i][l], dv[i][r - (1 << i)]);\n}\n\nvoid pri(vel &v) {\n\n  if (v.size() == 0) {\n    return;\n  }\n\n  cout << v[0];\n\n  rep(i, v.size() - 1) { cout << \" \" << v[i + 1]; }\n\n  cout << endl;\n\n  return;\n}\n\nvvel dbl(vel &v) {\n\n  vvel ans(20, vel(v));\n\n  int n = v.size();\n\n  rep(i, 19) {\n\n    rep(j, n) { ans[i + 1][j] = ans[i][ans[i][j]]; }\n  }\n\n  return ans;\n}\n\nint lca(int s, int t, int diff, vvel &pa) {\n\n  if (diff < 0) {\n    return lca(t, s, -diff, pa);\n  }\n\n  rep(i, 19) {\n\n    if ((diff & (1 << i)) != 0) {\n\n      s = pa[i][s];\n    }\n  }\n\n  for (int i = 19; i >= 0; i--) {\n\n    if (pa[i][s] != pa[i][t]) {\n\n      s = pa[i][s];\n\n      t = pa[i][t];\n    }\n  }\n\n  if (s != t) {\n\n    s = pa[0][s];\n  }\n\n  return s;\n}\n\nint sz = 1024 * 1024;\n\nvel bit(sz + 1, 0);\n\nvoid add(int a, int w) {\n\n  while (a <= sz) {\n\n    bit[a] += w;\n\n    a += (a & (-a));\n  }\n}\n\nint sum(int a) {\n\n  int ans = 0;\n\n  while (a != 0) {\n\n    ans += bit[a];\n\n    a -= (a & (-a));\n  }\n\n  return ans;\n}\n\n#define vveb V<veb>\n\n#define omajinai                                                               \\\n  cin.tie(0);                                                                  \\\n  ios::sync_with_stdio(false);\n\n#define endl \"\\n\"\n\nint modpow(int a, int n, int p) {\n\n  if (n == 0) {\n    return 1;\n  }\n\n  int m = n / 2;\n\n  int x = modpow(a, n / 2, p);\n\n  x *= x;\n  x %= p;\n\n  if (n % 2 == 1) {\n    x *= a;\n    x %= p;\n  }\n\n  return x;\n}\n\npin solve(V<pin> &ab, int ex) {\n\n  if (ex == 0) {\n    return mkp(1, 0);\n  }\n\n  V<pin> ab0, ab1;\n\n  for (auto x : ab) {\n\n    int a1 = x.first;\n\n    int b1 = x.second;\n\n    if (b1 % 2 == 0) {\n\n      ab0.push_back(mkp(a1 / 2, b1 / 2));\n\n      if (a1 % 2 == 1) {\n        ab1.push_back(mkp(a1 / 2, b1 / 2));\n      }\n\n    }\n\n    else {\n\n      ab1.push_back(mkp(a1 / 2, b1 / 2));\n\n      if (a1 % 2 == 1) {\n        ab0.push_back(mkp(a1 / 2, (b1 + 1) / 2));\n      }\n    }\n  }\n\n  vel c0(2), c1(2);\n\n  for (auto x : ab0) {\n\n    int qa = x.first % 3;\n    qa = 3 - qa;\n\n    int qb = x.second % 3;\n\n    int qc = (qa + qb) % 3;\n\n    if (qc == 0) {\n      c0[0] ^= 1;\n    }\n\n    if (qc == 1) {\n      c0[1] ^= 1;\n    }\n\n    if (qc == 2) {\n      c0[0] ^= 1;\n      c0[1] ^= 1;\n    }\n  }\n\n  for (auto x : ab1) {\n\n    int qa = x.first % 3;\n    qa = 3 - qa;\n\n    int qb = x.second % 3;\n\n    int qc = (qa + qb) % 3;\n\n    if (qc == 0) {\n      c1[0] ^= 1;\n    }\n\n    if (qc == 1) {\n      c1[1] ^= 1;\n    }\n\n    if (qc == 2) {\n      c1[0] ^= 1;\n      c1[1] ^= 1;\n    }\n  }\n\n  vel ze(2, 0);\n\n  if (c0 == ze) {\n\n    pin ans = solve(ab1, ex - 1);\n\n    ans.first *= 2;\n    ans.second *= 2;\n\n    ans.second++;\n\n    return ans;\n  }\n\n  if (c1 == ze) {\n\n    pin ans = solve(ab0, ex - 1);\n\n    ans.first *= 2;\n    ans.second *= 2;\n\n    return ans;\n  }\n\n  rep(i, ab.size()) { ab[i].first++; }\n\n  pin ans = solve(ab, ex);\n\n  ans.first--;\n\n  return ans;\n}\n\nsigned main() {\n\n  int inf = 1;\n\n  rep(i, 57) { inf *= 2; }\n\n  int n;\n  cin >> n;\n\n  V<pin> ab(n);\n\n  rep(i, n) {\n\n    int a, b;\n    cin >> a >> b;\n\n    a += inf;\n    b += inf;\n\n    ab[i] = mkp(a, b);\n  }\n\n  pin ret = solve(ab, 70);\n\n  ret.first -= inf;\n\n  ret.second -= inf;\n\n  cout << ret.first << \" \" << ret.second << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define V vector\n\n#define L long long\n\n#define W V<L>\n\n#define R(n) for (L i = 0; i < n; i++)\n\nW S(V<W> p, L E) {\n  if (!E) {\n    return {1, 0};\n  }\n  V<V<W>> T(2);\n  for (W x : p) {\n    T[x[1] & 1].push_back({x[0] / 2, x[1] / 2});\n    if (x[0] & 1) {\n      T[(x[1] + 1) & 1].push_back({x[0] / 2, (x[1] + 1) / 2});\n    }\n  }\n  R(2) {\n    L c = 0;\n    for (W x : T[!i]) {\n      L Q = (2 * x[0] + x[1]) % 3;\n      c ^= Q + 1;\n    }\n    if (!c) {\n      W A = S(T[i], E - 1);\n      A[0] *= 2;\n      A[1] *= 2;\n      A[1] += i;\n      return A;\n    }\n  }\n  for (W &v : p) {\n    v[0]++;\n  }\n  W A = S(p, E);\n  A[0]--;\n  return A;\n}\n\nint main() {\n  L M = 2e17, n;\n  cin >> n;\n  V<W> p(n);\n  R(n) {\n    L a, b;\n    cin >> a >> b;\n    p[i] = {a + M, b + M};\n  }\n  cout << S(p, 70)[0] - M << \" \" << S(p, 70)[1] - M;\n}"}
{"fast_code_id":"1a76b766d8be0e5b4c2bdf29e3fc4f10c7bdfbf1874ec0a247185b516603bdc3","fast_id":"4bf471366fc6adc2e241196a0a06642fd428e1180b7001dc9736eae1c97c21eb","fast_time":0.0198863213,"language":"cpp","measured_fast_code_id":"4bf471366fc6adc2e241196a0a06642fd428e1180b7001dc9736eae1c97c21eb","measured_slow_code_id":"64109e26ece424bb9542e0b4ca38855f6d6761dcd5297dff745ab2695c207c04","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58288","problem_id":"p02962","slow_code_id":"3b33562cfe91307d2325fa95ad1c71e7afd0a04f93615f493e1e80c481cf67da","slow_id":"64109e26ece424bb9542e0b4ca38855f6d6761dcd5297dff745ab2695c207c04","slow_time":0.3075439324,"speedup":15.465099238842129,"stratum":"8+","sampling_key":"0e4e78fb3d4d3a2f7af60638f1a6020f03dd4c8e58d051892cdaf63fbc2941fd","slow_code":"#pragma GCC target(\"avx\")\n\n#pragma GCC optimize(\"O3\")\n\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <stdio.h>\n\n#include <cstdio>\n\nint v[2000001];\n\nchar s[2000001], t[500002];\n\nvoid Zalgorithm(int N) {\n\n  int i = 1, j = 0, k = 0;\n\n  while (i < N) {\n\n    while (i + j < N && s[i + j] == s[j])\n      ++j;\n\n    v[i] = j;\n\n    if (!j) {\n\n      ++i;\n\n      continue;\n    }\n\n    k = 1;\n\n    while (v[k] + k < j) {\n\n      v[i + k] = v[k];\n\n      ++k;\n    }\n\n    i += k;\n\n    j -= k;\n  }\n}\n\nint i, j, K, quef[1000001], ques[1000001], size;\n\nint main() {\n\n  int N, ng = 500001, mid;\n\n  std::fgets(t, 1000000, stdin);\n\n  std::fgets(s, 1000000, stdin);\n\n  while (ng - K > 1) {\n\n    mid = (ng + K) >> 1;\n\n    (s[mid] ? K : ng) = mid;\n  }\n\n  while (t[i] != '\\n') {\n\n    s[K + i] = t[i];\n    ++i;\n  }\n\n  N = i;\n\n  i += K;\n\n  while (i < 2000001) {\n\n    s[i++] = t[j++];\n\n    j *= j < N;\n  }\n\n  N = (K + N - 1) / N * N;\n\n  Zalgorithm(N + K * 2);\n\n  for (i = 0; i < N; ++i) {\n\n    if (v[i + K] < K)\n      ques[size++] = i + K - (i + K >= N) * N;\n  }\n\n  for (i = 0; i < N; ++i) {\n\n    if (i == size) {\n\n      puts(\"-1\");\n\n      return 0;\n    }\n\n    if (v[ques[i] += K] >= K) {\n\n      ques[size] = ques[i] - N * (ques[i] >= N);\n\n      quef[size++] = quef[i] + 1;\n    }\n  }\n\n  printf(\"%d\\n\", quef[N - 1]);\n}","fast_code":"#pragma GCC target(\"avx\")\n\n#pragma GCC optimize(\"O3\")\n\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <stdio.h>\n\n#include <cstdio>\n\nint v[1500001];\n\nchar s[1500001], t[500002];\n\nvoid Zalgorithm(int N) {\n\n  int i = 1, j = 0, k = 0;\n\n  while (i < N) {\n\n    while (i + j < N && s[i + j] == s[j])\n      ++j;\n\n    v[i] = j;\n\n    if (!j) {\n\n      ++i;\n\n      continue;\n    }\n\n    k = 1;\n\n    while (v[k] + k < j) {\n\n      v[i + k] = v[k];\n\n      ++k;\n    }\n\n    i += k;\n\n    j -= k;\n  }\n}\n\nint i, j, K, que[500001], bf, ans, size;\n\nint main() {\n\n  int N, ng = 500001, mid;\n\n  std::fgets(t, 1000000, stdin);\n\n  std::fgets(s, 1000000, stdin);\n\n  while (ng - K > 1) {\n\n    mid = (ng + K) >> 1;\n\n    (s[mid] ? K : ng) = mid;\n  }\n\n  while (t[i] != '\\n') {\n\n    s[K + i] = t[i];\n    ++i;\n  }\n\n  N = i;\n\n  i += K;\n\n  int M = N + (K << 1);\n\n  while (i < M) {\n\n    s[i++] = t[j++];\n\n    j *= j < N;\n  }\n\n  Zalgorithm(M);\n\n  for (i = 0; i < N; ++i) {\n\n    if (v[i + K] < K)\n      que[size++] = (i + K) % N;\n  }\n\n  for (i = 0; i < N; ++i) {\n\n    if (i == size) {\n\n      puts(\"-1\");\n\n      return 0;\n    }\n\n    if (v[que[i] += K] >= K) {\n\n      que[size++] = que[i] % N;\n\n      if (bf <= i) {\n\n        bf = size - 1;\n\n        ++ans;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n}"}
{"fast_code_id":"4dce570a900b16e163f4112dea77f4ced2936171c39c2856f48a2e777037856e","fast_id":"c6d8a15420329aefe15224a52f5f400ae532f231c86f9503706647b839fd5c6a","fast_time":0.0197113336,"language":"cpp","measured_fast_code_id":"c6d8a15420329aefe15224a52f5f400ae532f231c86f9503706647b839fd5c6a","measured_slow_code_id":"5fa62d75f0b4acc03ffcf36e74f8ee5954825f19f90bc338c6c3b187ab57e3af","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58301","problem_id":"p03858","slow_code_id":"470f92271c38b9195c492f1c18516d9cea313a8822c3296fc3ef7f3f37fefe31","slow_id":"5fa62d75f0b4acc03ffcf36e74f8ee5954825f19f90bc338c6c3b187ab57e3af","slow_time":0.2285073614,"speedup":11.592689060876125,"stratum":"8+","sampling_key":"275b619789d4d88575b46b81aa27b13ac6e0c6d9707472f8ca1fe1cccfa133af","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\nusing namespace std;\n\nconst int MAXN = 100005;\n\nstruct Point\n\n{\n\n  int x, y, id;\n\n  Point(int _x = 0, int _y = 0, int _id = 0)\n\n  {\n    x = _x;\n    y = _y;\n    id = _id;\n  }\n};\n\nstruct Node\n\n{\n\n  int v, id;\n\n  Node(int _v = 0, int _id = 0)\n\n  {\n    v = _v;\n    id = _id;\n  }\n\n  bool operator<(const Node &t) const\n\n  {\n    return v < t.v;\n  }\n};\n\nint Dis(Point A, Point B)\n\n{\n  return max(abs(A.x - B.x), abs(A.y - B.y));\n}\n\nlong long ans;\n\nint N, A, B, R;\n\nmap<int, set<Node>> sX, sY;\n\nmap<int, vector<Node>> vX, vY;\n\nvector<int> ansP;\n\nPoint P[MAXN];\n\nqueue<int> Q;\n\nint main()\n\n{\n\n  cin >> N >> A >> B;\n\n  for (int i = 1; i <= N; i++)\n\n  {\n\n    int x, y, nx, ny;\n\n    cin >> x >> y;\n\n    nx = x - y;\n\n    ny = x + y;\n\n    P[i] = Point(nx, ny, i);\n\n    if (i != A && i != B)\n\n    {\n\n      sX[nx].insert(Node(ny, i));\n\n      sY[ny].insert(Node(nx, i));\n    }\n\n    vX[nx].push_back(Node(ny, i));\n\n    vY[ny].push_back(Node(nx, i));\n  }\n\n  R = Dis(P[A], P[B]);\n\n  for (auto &it : vX)\n\n    sort(it.second.begin(), it.second.end());\n\n  for (auto &it : vY)\n\n    sort(it.second.begin(), it.second.end());\n\n  Q.push(A);\n\n  Q.push(B);\n\n  while (!Q.empty())\n\n  {\n\n    int u = Q.front();\n\n    ansP.push_back(u);\n\n    Q.pop();\n\n    if (sX.count(P[u].x + R))\n\n    {\n\n      auto &vec = sX[P[u].x + R];\n\n      auto l = vec.lower_bound(Node(P[u].y - R, 0));\n\n      for (auto it = l; it->v <= P[u].y + R && it != vec.end();)\n\n      {\n\n        Q.push(it->id);\n\n        sY[P[it->id].y].erase(Node(P[it->id].x, it->id));\n\n        vec.erase(it++);\n      }\n    }\n\n    if (sX.count(P[u].x - R))\n\n    {\n\n      auto &vec = sX[P[u].x - R];\n\n      auto l = vec.lower_bound(Node(P[u].y - R, 0));\n\n      for (auto it = l; it->v <= P[u].y + R && it != vec.end();)\n\n      {\n\n        Q.push(it->id);\n\n        sY[P[it->id].y].erase(Node(P[it->id].x, it->id));\n\n        vec.erase(it++);\n      }\n    }\n\n    if (sY.count(P[u].y + R))\n\n    {\n\n      auto &vec = sY[P[u].y + R];\n\n      auto l = vec.lower_bound(Node(P[u].x - R, 0));\n\n      for (auto it = l; it->v <= P[u].x + R && it != vec.end();)\n\n      {\n\n        Q.push(it->id);\n\n        sX[P[it->id].x].erase(Node(P[it->id].y, it->id));\n\n        vec.erase(it++);\n      }\n    }\n\n    if (sY.count(P[u].y - R))\n\n    {\n\n      auto &vec = sY[P[u].y - R];\n\n      auto l = vec.lower_bound(Node(P[u].x - R, 0));\n\n      for (auto it = l; it->v <= P[u].x + R && it != vec.end();)\n\n      {\n\n        Q.push(it->id);\n\n        sX[P[it->id].x].erase(Node(P[it->id].y, it->id));\n\n        vec.erase(it++);\n      }\n    }\n  }\n\n  for (auto u : ansP)\n\n  {\n\n    if (vX.count(P[u].x + R))\n\n    {\n\n      auto &vec = vX[P[u].x + R];\n\n      auto l = lower_bound(vec.begin(), vec.end(), Node(P[u].y - R, 0));\n\n      auto r = upper_bound(vec.begin(), vec.end(), Node(P[u].y + R, 0));\n\n      ans += r - l;\n    }\n\n    if (vX.count(P[u].x - R))\n\n    {\n\n      auto &vec = vX[P[u].x - R];\n\n      auto l = lower_bound(vec.begin(), vec.end(), Node(P[u].y - R, 0));\n\n      auto r = upper_bound(vec.begin(), vec.end(), Node(P[u].y + R, 0));\n\n      ans += r - l;\n    }\n\n    if (vY.count(P[u].y + R))\n\n    {\n\n      auto &vec = vY[P[u].y + R];\n\n      auto l = lower_bound(vec.begin(), vec.end(), Node(P[u].x - R + 1, 0));\n\n      auto r = upper_bound(vec.begin(), vec.end(), Node(P[u].x + R - 1, 0));\n\n      ans += r - l;\n    }\n\n    if (vY.count(P[u].y - R))\n\n    {\n\n      auto &vec = vY[P[u].y - R];\n\n      auto l = lower_bound(vec.begin(), vec.end(), Node(P[u].x - R + 1, 0));\n\n      auto r = upper_bound(vec.begin(), vec.end(), Node(P[u].x + R - 1, 0));\n\n      ans += r - l;\n    }\n  }\n\n  ans /= 2;\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <algorithm>\n\n#include <cstdio>\n\nusing namespace std;\n\nconst int N = 100010;\n\nint n, x, y, len;\n\nlong long ans;\n\nint a[N][2];\n\nint idx[N], idy[N];\n\nbool fx[N * 4], fy[N * 4];\n\nint d[N];\n\nbool bz[N];\n\nint dis(int x, int y, int xx, int yy) { return max(abs(xx - x), abs(yy - y)); }\n\nvoid build(int l, int r, int s) {\n\n  fx[s] = fy[s] = 1;\n\n  if (l == r)\n    return;\n\n  build(l, (l + r) / 2, s + s);\n\n  build((l + r) / 2 + 1, r, s + s + 1);\n}\n\nvoid work1(int l, int r, int s) {\n\n  if (!fy[s])\n    return;\n\n  fy[s] = 0;\n\n  if (l == r) {\n\n    if (!bz[idy[l]])\n\n      bz[d[++d[0]] = idy[l]] = 1;\n\n    return;\n  }\n\n  work1(l, (l + r) / 2, s + s);\n\n  work1((l + r) / 2 + 1, r, s + s + 1);\n}\n\nvoid work2(int l, int r, int s) {\n\n  if (!fx[s])\n    return;\n\n  fx[s] = 0;\n\n  if (l == r) {\n\n    if (!bz[idx[l]])\n\n      bz[d[++d[0]] = idx[l]] = 1;\n\n    return;\n  }\n\n  work2(l, (l + r) / 2, s + s);\n\n  work2((l + r) / 2 + 1, r, s + s + 1);\n}\n\nvoid search1(int l, int r, int s, int ll, int rr, int lll) {\n\n  if (a[idy[r]][1] < lll || a[idy[l]][1] > lll)\n    return;\n\n  if (a[idy[l]][1] == a[idy[r]][1] && (a[idy[l]][0] > rr || a[idy[r]][0] < ll))\n    return;\n\n  if (a[idy[l]][1] == a[idy[r]][1] && (a[idy[l]][0] >= ll && a[idy[r]][0] <= rr)) {\n\n    ans += r - l + 1;\n\n    work1(l, r, s);\n\n    return;\n  }\n\n  search1(l, (l + r) / 2, s + s, ll, rr, lll);\n\n  search1((l + r) / 2 + 1, r, s + s + 1, ll, rr, lll);\n\n  fy[s] = fy[s + s] | fy[s + s + 1];\n}\n\nvoid search2(int l, int r, int s, int ll, int rr, int lll) {\n\n  if (a[idx[r]][0] < lll || a[idx[l]][0] > lll)\n    return;\n\n  if (a[idx[l]][0] == a[idx[r]][0] && (a[idx[l]][1] > rr || a[idx[r]][1] < ll))\n    return;\n\n  if (a[idx[l]][0] == a[idx[r]][0] && (a[idx[l]][1] >= ll && a[idx[r]][1] <= rr)) {\n\n    ans += r - l + 1;\n\n    work2(l, r, s);\n\n    return;\n  }\n\n  search2(l, (l + r) / 2, s + s, ll, rr, lll);\n\n  search2((l + r) / 2 + 1, r, s + s + 1, ll, rr, lll);\n\n  fx[s] = fx[s + s] | fx[s + s + 1];\n}\n\nint main() {\n\n  scanf(\"%d %d %d\", &n, &x, &y);\n\n  for (int i = 1; i <= n; i++) {\n\n    int x, y;\n\n    scanf(\"%d %d\", &x, &y);\n\n    a[i][0] = x - y;\n\n    a[i][1] = x + y;\n\n    idx[i] = idy[i] = i;\n  }\n\n  len = dis(a[x][0], a[x][1], a[y][0], a[y][1]);\n\n  sort(idx + 1, idx + n + 1, [](const int &x, const int &y) {\n    return a[x][0] < a[y][0] || (a[x][0] == a[y][0] && a[x][1] < a[y][1]);\n  });\n\n  sort(idy + 1, idy + n + 1, [](const int &x, const int &y) {\n    return a[x][1] < a[y][1] || (a[x][1] == a[y][1] && a[x][0] < a[y][0]);\n  });\n\n  build(1, n, 1);\n\n  d[0] = 2;\n\n  d[1] = x;\n\n  d[2] = y;\n\n  bz[x] = bz[y] = 1;\n\n  for (int i = 1; i <= d[0]; i++)\n\n  {\n\n    int x = d[i];\n\n    search1(1, n, 1, a[x][0] - len, a[x][0] + len, a[x][1] - len);\n\n    search1(1, n, 1, a[x][0] - len, a[x][0] + len, a[x][1] + len);\n\n    search2(1, n, 1, a[x][1] - len + 1, a[x][1] + len - 1, a[x][0] - len);\n\n    search2(1, n, 1, a[x][1] - len + 1, a[x][1] + len - 1, a[x][0] + len);\n  }\n\n  printf(\"%lld\\n\", ans / 2);\n\n  return 0;\n}"}
{"fast_code_id":"d32c321ca569fee0ca8beef49e46df9485514f7b4281b1762f7d0dadbc0f83c1","fast_id":"538ffa49e8e265b6b6eb95d26ae96480bbf4ecc1f839a6e098636e95ec838b2d","fast_time":0.0735602911,"language":"cpp","measured_fast_code_id":"538ffa49e8e265b6b6eb95d26ae96480bbf4ecc1f839a6e098636e95ec838b2d","measured_slow_code_id":"5a459807bc6282b8b97122add067bcca692c25800596014494172af1a7d8426d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58313","problem_id":"p02348","slow_code_id":"5f02ea0246a9c45ea28247f60d705e9500a0e757d94937f8affa0e91f5b84d1c","slow_id":"5a459807bc6282b8b97122add067bcca692c25800596014494172af1a7d8426d","slow_time":0.2286500499,"speedup":3.108335305377823,"stratum":"2-4","sampling_key":"4244b3f5c5f63bfa2d1dedfb1cf02ba5bd022997467f31bdbb3ae1f4dee5524e","slow_code":"#include <iostream>\n\nusing namespace std;\n\n#define INF 2147483647\n\n#define ASTART (1 << 17)\n\nint a[1 << 18][2];\n\nint ti = 1;\n\nint find(int i) {\n\n  int nv = INF, t = 0;\n\n  i += ASTART - 1;\n\n  nv = a[i][0];\n\n  t = a[i][1];\n\n  while (i > 0) {\n\n    i = (i - 1) / 2;\n\n    if (t < a[i][1])\n      nv = a[i][0], t = a[i][1];\n  }\n\n  return nv;\n}\n\nvoid update(int s, int t, int x, int k, int l, int r) {\n\n  if (l >= s && r <= t) {\n\n    a[k][0] = x;\n\n    a[k][1] = ti;\n\n    return;\n  }\n\n  if (r <= s || l >= t)\n    return;\n\n  int m = (l + r) / 2;\n\n  update(s, t, x, k * 2 + 1, l, m);\n\n  update(s, t, x, k * 2 + 2, m, r);\n}\n\nint main() {\n\n  int n, q, com, s, t, x;\n\n  for (int i = 0; i < (1 << 18); i++)\n    a[i][0] = INF, a[i][1] = 0;\n\n  cin >> n >> q;\n\n  for (int i = 0; i < q; i++) {\n\n    cin >> com;\n\n    if (com == 0) {\n\n      cin >> s >> t >> x;\n\n      update(s, t + 1, x, 0, 0, ASTART);\n\n      ti++;\n\n    } else {\n\n      cin >> s;\n\n      cout << find(s) << endl;\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\nusing namespace std;\n\n#define INF (1 << 30) - 1 + (1 << 30)\n\nint a[262144], n2, lazy[262144];\n\nvoid lazyeval(int i) {\n\n  if (lazy[i] == INF)\n    return;\n\n  a[i] = lazy[i];\n\n  if (i < n2 - 1) {\n\n    lazy[2 * i + 1] = lazy[2 * i + 2] = lazy[i];\n  }\n\n  lazy[i] = INF;\n}\n\nint findsingle(int i) {\n\n  int j = i + n2 - 1;\n\n  int val = a[i + n2 - 1];\n\n  if (lazy[j] != INF)\n    val = lazy[j];\n\n  while (j > 0) {\n\n    j = (j - 1) / 2;\n\n    if (lazy[j] != INF)\n      val = lazy[j];\n  }\n\n  return val;\n}\n\nvoid updaterange(int s, int t, int i, int l, int r, int x) {\n\n  lazyeval(i);\n\n  if (s <= l && r <= t) {\n\n    a[i] = x;\n\n    if (i < n2 - 1) {\n\n      lazy[2 * i + 1] = lazy[2 * i + 2] = a[i];\n    }\n\n    return;\n  }\n\n  if (t <= l || r <= s)\n    return;\n\n  updaterange(s, t, i * 2 + 1, l, (l + r) / 2, x);\n\n  updaterange(s, t, i * 2 + 2, (l + r) / 2, r, x);\n\n  a[i] = min(a[i * 2 + 1], a[i * 2 + 2]);\n}\n\nint main() {\n\n  int n, q, com, s, t, x;\n\n  cin >> n >> q;\n\n  n2 = 1;\n\n  while (n > n2)\n    n2 *= 2;\n\n  for (int i = 0; i < n2 * 2; i++)\n    a[i] = lazy[i] = INF;\n\n  for (int i = 0; i < q; i++) {\n\n    cin >> com >> s;\n\n    if (com == 0) {\n\n      cin >> t >> x;\n\n      updaterange(s, t + 1, 0, 0, n2, x);\n\n    } else\n\n      cout << findsingle(s) << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"3a0d3febdfb1051d344afd9fe19883cf9634766a292b644de888be37e8fa64d8","fast_id":"3fc19ef41b8d4bb8c36dd4a7ce0e867ea5e1c8f405344a79e1057bfe153bb6a7","fast_time":0.0010339255,"language":"cpp","measured_fast_code_id":"3fc19ef41b8d4bb8c36dd4a7ce0e867ea5e1c8f405344a79e1057bfe153bb6a7","measured_slow_code_id":"a93757b2a9861ecf88933802a5aa0fc4376794fea00502367d04d471fa6fa97e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58315","problem_id":"p03763","slow_code_id":"025d2676269b2bc1f717cca87fef33638c47b649e3d19e5dad32787f5489c811","slow_id":"a93757b2a9861ecf88933802a5aa0fc4376794fea00502367d04d471fa6fa97e","slow_time":0.0044819752,"speedup":4.334911171066,"stratum":"4-8","sampling_key":"3394f5f3d8b6c827427977b9ea88d522c18d802181a6b914ec8d0ea8fe954b01","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long int\n\n#define sz 100100\n\nusing namespace std;\n\nstring ss[sz];\n\nstring tani(ll n, char ch)\n\n{\n\n  ll i;\n\n  string s = \"\";\n\n  for (i = 1; i <= n; i++)\n    s += ch;\n\n  return s;\n}\n\nint main()\n\n{\n\n  string s = \"abcdefghijklmnopqrstuvwxyz\";\n\n  ll i, j, k, p, x, d, c, a, b, n;\n\n  string an = \"\";\n\n  cin >> n;\n\n  ll mn = 10000000;\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    cin >> ss[i];\n  }\n\n  for (i = 0; i < 26; i++)\n\n  {\n\n    mn = 10000000;\n\n    for (j = 1; j <= n; j++)\n\n    {\n\n      c = 0;\n\n      for (k = 0; k < ss[j].size(); k++)\n\n      {\n\n        if (ss[j][k] == s[i])\n          c++;\n      }\n\n      mn = min(mn, c);\n    }\n\n    string xx = tani(mn, s[i]);\n\n    an += xx;\n  }\n\n  cout << an << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstring s;\n\nstruct node\n\n{\n\n  int a[26];\n\n  node()\n\n  {\n\n    memset(a, 0, sizeof(a));\n  }\n};\n\nnode d[52];\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(0);\n  cin.tie(0);\n  cout.tie(0);\n\n  int t, i, j, n, m, l, r;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    cin >> s;\n\n    m = s.size();\n\n    for (char c : s)\n\n    {\n\n      l = c - 97;\n\n      d[i].a[l]++;\n    }\n  }\n\n  s.clear();\n\n  for (i = 0; i < 26; i++)\n\n  {\n\n    l = INT_MAX;\n\n    for (j = 0; j < n; j++)\n\n    {\n\n      l = min(l, d[j].a[i]);\n    }\n\n    for (j = 0; j < l; j++)\n\n    {\n\n      s += (char)(i + 97);\n    }\n  }\n\n  cout << s << \"\\n\";\n\n  return 0;\n}\n"}
{"fast_code_id":"9644dc5b977ed3202574ff0f0c4a99f76abe3a96934c18aa2ee1c811fbb1aac7","fast_id":"3aa42b0c8b731f887f0f81225dc14526e670eea1cd8c1cf137f54e92291759ac","fast_time":0.0232502507,"language":"cpp","measured_fast_code_id":"3aa42b0c8b731f887f0f81225dc14526e670eea1cd8c1cf137f54e92291759ac","measured_slow_code_id":"94e06203813454b0635be68e03f5ac5eae9a3f11438ee411d4095f2f3dfe551a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58317","problem_id":"p03428","slow_code_id":"5a6a10d4ccde86dff59255264b12c1fc256e3d5b8567a0590a9b78e9ad3ed761","slow_id":"94e06203813454b0635be68e03f5ac5eae9a3f11438ee411d4095f2f3dfe551a","slow_time":0.1063318336,"speedup":4.573362884211825,"stratum":"4-8","sampling_key":"422aafaf2ab3c0c17cfd6f44594c29236f674ca444867f215e218e675dbf2c6d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst double pi = acos(-1.);\n\nconst int N = 105;\n\nint n, x[N], y[N];\n\ndouble p[N + N];\n\nsigned main()\n\n{\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n    cin >> x[i] >> y[i];\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    int tot = 0;\n\n    for (int j = 0; j < n; j++)\n\n      if (i != j)\n        p[tot++] = atan2(y[j] - y[i], x[j] - x[i]);\n\n    sort(p, p + tot);\n\n    for (int j = 0; j < tot; j++)\n      p[j + tot] = p[j] + 2 * pi;\n\n    double ans = 0;\n\n    for (int j = 0; j < tot; j++)\n      ans = max(ans, pi - p[j + tot - 1] + p[j]);\n\n    printf(\"%.8f\\n\", ans / 2 / pi);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst double pi = acos(-1);\n\nint n, x[101], y[101];\n\ndouble p[201];\n\nint pp;\n\ndouble Max(double a, double b) { return a > b ? a : b; }\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n    scanf(\"%d%d\", &x[i], &y[i]);\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = 1; j <= n; j++)\n      if (i != j)\n        p[++pp] = atan2(y[j] - y[i], x[j] - x[i]);\n\n    sort(p + 1, p + pp + 1);\n\n    for (int j = 1; j <= pp; j++)\n      p[pp + j] = p[j] + pi + pi;\n\n    double mx = 0;\n\n    for (int j = 1; j <= pp; j++)\n      mx = max(mx, pi - p[j + pp - 1] + p[j]);\n\n    printf(\"%.8lf\\n\", mx / pi / 2);\n\n    pp = 0;\n  }\n}"}
{"fast_code_id":"2dcb0d8465d19504b71e79072507549b319b29ed54167814f2a3aac475bc1062","fast_id":"5a468af218044f410f68a0e11a8c5a40419c2d71eff269fa2304af19ed24c90b","fast_time":0.0829016686,"language":"cpp","measured_fast_code_id":"5a468af218044f410f68a0e11a8c5a40419c2d71eff269fa2304af19ed24c90b","measured_slow_code_id":"8d0f4b5b354105bf55007c8fda712e03d2387f80fdd753f85f735be6111604ab","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58345","problem_id":"p02626","slow_code_id":"5be0379a3c425ea592d843d6d8cea368f1118446625f128d2835f2181ca4d322","slow_id":"8d0f4b5b354105bf55007c8fda712e03d2387f80fdd753f85f735be6111604ab","slow_time":0.1802769311,"speedup":2.1745874859266703,"stratum":"2-4","sampling_key":"1e90eb622f98a525e95f1e21f33299f773f61cddfd24c66efa6440e2958b2a48","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long int\n\n#define ld long double\n\n#define yorn(f) std::cout << ((f) ? \"Yes\" : \"No\") << endl;\n\n#define YORN(f) std::cout << ((f) ? \"YES\" : \"NO\") << endl;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define repi(i, n) for (int i = 1; i < (int)(n); i++)\n\n#define all(x) (x).begin(), (x).end()\n\n#define put(x) std::cout << x << endl;\n\n#define println(x) std::cout << x << endl;\n\ntemplate <typename T> bool mins(T &x, const T &y) {\n  if (x > y) {\n    x = y;\n    return true;\n  } else\n    return false;\n}\n\ntemplate <typename T> bool maxs(T &x, const T &y) {\n  if (x < y) {\n    x = y;\n    return true;\n  } else\n    return false;\n}\n\nusing namespace std;\n\nint N;\n\nll A[303];\n\nvoid Main()\n\n{\n\n  int i, j, k, l, r, x, y;\n  string s;\n\n  cin >> N;\n\n  rep(i, N) cin >> A[i];\n\n  ll xo = 0;\n\n  for (i = 2; i < N; i++)\n    xo ^= A[i];\n\n  vector<int> cand;\n\n  rep(i, 1 << 20) if (i < A[0]) {\n\n    ll v = (A[0] - i) ^ (A[1] + i) ^ xo;\n\n    if ((v & ((1 << 20) - 1)) == 0)\n      cand.push_back(i);\n  }\n\n  ll mi = 1LL << 50;\n\n  for (auto c : cand) {\n\n    for (ll a = c; a < min(mi, A[0]); a += 1 << 20) {\n\n      ll v = (A[0] - a) ^ (A[1] + a) ^ xo;\n\n      if (v == 0)\n        mi = min(mi, a);\n    }\n  }\n\n  if (mi == 1LL << 50)\n    mi = -1;\n\n  cout << mi << endl;\n}\n\nsigned main() {\n  Main();\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define ll long long int\n\n#define ld long double\n\n#define yorn(f) std::cout << ((f) ? \"Yes\" : \"No\") << endl;\n\n#define YORN(f) std::cout << ((f) ? \"YES\" : \"NO\") << endl;\n\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n\n#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)\n\n#define all(x) (x).begin(), (x).end()\n\n#define put(x) std::cout << x << endl;\n\n#define println(x) std::cout << x << endl;\n\ntemplate <typename T> bool mins(T &x, const T &y) {\n  if (x > y) {\n    x = y;\n    return true;\n  } else\n    return false;\n}\n\ntemplate <typename T> bool maxs(T &x, const T &y) {\n  if (x < y) {\n    x = y;\n    return true;\n  } else\n    return false;\n}\n\nusing namespace std;\n\nll A[301];\n\nvoid Main()\n\n{\n\n  ll n;\n\n  cin >> n;\n\n  rep(i, n) cin >> A[i];\n\n  ll X = 0;\n\n  for (ll i = 2; i < n; i++)\n    X ^= A[i];\n\n  vector<ll> cand;\n\n  ll mask = (1LL << 20) - 1;\n\n  rep(a, 1LL << 20) {\n\n    if (a > A[0]) {\n\n      break;\n    }\n\n    ll v = (A[0] - a) ^ (A[1] + a) ^ X;\n\n    if ((v & mask) == 0) {\n\n      cand.push_back(a);\n    }\n  }\n\n  ll ma = -1;\n\n  for (ll a1 : cand) {\n\n    for (ll a = a1; a < A[0]; a += 1LL << 20) {\n\n      ll v = (A[0] - a) ^ (A[1] + a) ^ X;\n\n      if (v == 0) {\n\n        ma = max(ma, A[0] - a);\n\n        break;\n      }\n    }\n  }\n\n  if (ma < 0) {\n\n    put(-1);\n\n    return;\n  }\n\n  ll res = A[0] - ma;\n\n  put(res);\n}\n\nsigned main() {\n  Main();\n  return 0;\n}"}
{"fast_code_id":"f19ceba7afdee7a8263ac58909885d66b78aa92209826ad107c19669fe6e7417","fast_id":"0f272d5b617334f7ac1cb1b27dcd6b811c071d50efb0d4954dc43f5ab063fc77","fast_time":0.0001937238,"language":"cpp","measured_fast_code_id":"0f272d5b617334f7ac1cb1b27dcd6b811c071d50efb0d4954dc43f5ab063fc77","measured_slow_code_id":"8169ef0d7fef6c07ef04f3ff3d4a8ec03c57102ab9b628fe91464b9e15c5157f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58356","problem_id":"p03379","slow_code_id":"1ce8ae7a66e1bf03913cd24beea62600fc994f4a54328f2bba43a905775d2a72","slow_id":"8169ef0d7fef6c07ef04f3ff3d4a8ec03c57102ab9b628fe91464b9e15c5157f","slow_time":0.0027092242,"speedup":13.984983775870596,"stratum":"8+","sampling_key":"01ca7eb7ae8a9d2b80f423d445487b9430d6c05fc0cde6eb57fb4f49d813537d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long int\n\n#define ld long double\n\n#define pii pair<int, int>\n\n#define pll pair<ll, ll>\n\n#define rep(n) for (int i = 0; i < n; i += 1)\n\n#define prarr(a, n) rep(n) cout << a[i] << endl printf(\"%s\\n\", \" \");\n\n#define sc(a) scanf(\"%d\", &a);\n\n#define scl(a) scanf(\"%lld\", &a);\n\n#define scf(a) ascanf(\"%f\", &a);\n\n#define fi first\n\n#define se second\n\n#define pu push_back\n\n#define inf 1000000001\n\n#define MOD 1000000007\n\n#define INF 100000000000001\n\nconst int MAXN = 2e5 + 10;\n\nint main()\n\n{\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  map<int, vector<int>> m;\n\n  map<int, int> ans;\n\n  int n;\n\n  pii a[MAXN];\n\n  int b[MAXN] = {0};\n\n  cin >> n;\n\n  rep(n)\n\n  {\n\n    cin >> a[i].fi;\n\n    a[i].se = i;\n  }\n\n  sort(a, a + n);\n\n  rep(n)\n\n  {\n\n    if ((i + 1) <= n / 2)\n\n      ans[a[i].se] = a[n / 2].fi;\n\n    else\n\n      ans[a[i].se] = a[n / 2 - 1].fi;\n  }\n\n  rep(n)\n\n  {\n\n    cout << ans[i] << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\nint a[200005], temp[200005];\n\nint inc(const void *a, const void *b)\n\n{\n\n  return *(int *)a - *(int *)b;\n}\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &a[i]);\n\n  for (int i = 0; i < n; i++)\n    temp[i] = a[i];\n\n  qsort(a, n, sizeof(int), inc);\n\n  for (int i = 0; i <= n / 2 - 1; i++)\n\n  {\n\n    if (temp[i] >= a[n / 2])\n      printf(\"%d\\n\", a[n / 2 - 1]);\n\n    else\n      printf(\"%d\\n\", a[n / 2]);\n  }\n\n  for (int i = n / 2; i < n; i++)\n\n  {\n\n    if (temp[i] > a[n / 2 - 1])\n      printf(\"%d\\n\", a[n / 2 - 1]);\n\n    else\n      printf(\"%d\\n\", a[n / 2]);\n  }\n}"}
{"fast_code_id":"0e532df2fe57d5169439f97bfc5bda4be06f68b2ed9985219f5608750feeaada","fast_id":"6212a45d9d55349c691206b573d80af7472c77867d73c2f02b4227755bf12134","fast_time":0.1085821199,"language":"cpp","measured_fast_code_id":"6212a45d9d55349c691206b573d80af7472c77867d73c2f02b4227755bf12134","measured_slow_code_id":"4dae1dc4da5afe657eb364c8f2522e409c884a760550b54b8e35982dea22e3dc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58372","problem_id":"p03309","slow_code_id":"32c1c7c878587f40bc2d58630da5b5d3557512e957c7d7794db2bf085eef9e3f","slow_id":"4dae1dc4da5afe657eb364c8f2522e409c884a760550b54b8e35982dea22e3dc","slow_time":0.2829746176,"speedup":2.606088533366348,"stratum":"2-4","sampling_key":"102fe384f70da1a39af7a53d568bf984f1b794b874815d0becfafbcd1aab62a5","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst long long int INF = 1000000000000000000LL;\n\nusing ll = long long int;\n\nusing vi = vector<int>;\n\nusing Vi = vector<long long int>;\n\n#define pb push_back\n\n#define all(x) (x).begin(), (x).end()\n\n#define rep(i, N) for (int i = 0; i < N; i++)\n\nauto max(auto x, auto y) {\n  if (x > y) {\n    return x;\n  } else {\n    return y;\n  }\n}\n\ntemplate <class T> bool chmax(T &former, const T &b) {\n  if (former < b) {\n    former = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &former, const T &b) {\n  if (b < former) {\n    former = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> T sqar(T x) { return x * x; }\n\n#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())\n\nint main() {\n\n  ll n;\n\n  vi v;\n\n  cin >> n;\n\n  ll ar[2 * 100000 + 1] = {0};\n\n  long double ma = 0;\n\n  rep(i, n) {\n\n    cin >> ar[i];\n\n    ar[i] = ar[i] - i - 1;\n\n    v.pb(ar[i]);\n\n    ma += (long double)ar[i] / (long double)n;\n  }\n\n  sort(all(v));\n\n  ll nya = v[n / 2];\n\n  ll ans = 0;\n\n  ll ans2 = 0;\n\n  ll ans3 = 0;\n\n  ll ans4 = 0;\n\n  rep(i, n) {\n\n    ans += abs(ar[i] - (ll)ma);\n\n    ans4 += abs(ar[i] - (ll)nya);\n\n    ans2 += abs(ar[i] - (ll)ma - 1);\n\n    ans3 += abs(ar[i] - (ll)ma + 1);\n  }\n\n  cout << min(ans4, min(ans3, min(ans, ans2))) << endl;\n\n  return 0;\n}\n","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nconst long long int INF = 1LL << 60;\n\nconst long long int Mod = 1000000007;\n\nusing ll = long long int;\nusing ci = const int;\n\nusing vi = vector<int>;\nusing Vi = vector<long long int>;\n\nusing P = pair<int, int>;\nusing PLL = pair<ll, ll>;\n\nusing matrix = vector<vector<ll>>;\n\n#define pb(x) push_back(x)\n\n#define mp(x, y) make_pair(x, y)\n\n#define all(x) (x).begin(), (x).end()\n\n#define rep(i, N) for (ll i = 0; i < (ll)N; i++)\n\n#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)\n\ntemplate <class T> bool chmax(T &former, const T &b) {\n  if (former < b) {\n    former = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <class T> bool chmin(T &former, const T &b) {\n  if (b < former) {\n    former = b;\n    return true;\n  }\n  return false;\n}\n\ntemplate <class T> T sqar(T x) { return x * x; }\n\n#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())\n\ntemplate <class T> inline void princ(T x) { cout << x << \" \"; };\n\ntemplate <class T> inline void print(T x) { cout << x << \"\\n\"; };\n\ntemplate <class T> inline void Yes(T condition) {\n  if (condition)\n    cout << \"Yes\" << endl;\n  else\n    cout << \"No\" << endl;\n}\n\ntemplate <class T> inline void YES(T condition) {\n  if (condition)\n    cout << \"YES\" << endl;\n  else\n    cout << \"NO\" << endl;\n}\n\nll n;\n\nVi a;\n\nint main() {\n\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  std::cout << std::fixed << std::setprecision(30);\n\n  cin >> n;\n\n  a.resize(n);\n\n  ll inp;\n\n  ll tmp = 0;\n\n  rep(i, n) {\n\n    cin >> inp;\n\n    a[i] = inp - i - 1;\n\n    tmp += a[i];\n  }\n\n  sort(all(a));\n\n  ll b = a[a.size() / 2], b2 = a[a.size() / 2 + 1];\n\n  ll ans = 0, Ans = INF;\n\n  rep(i, n) { ans += abs(a[i] - b); }\n\n  chmin(Ans, ans);\n\n  ans = 0;\n\n  rep(i, n) { ans += abs(a[i] - b2); }\n\n  chmin(Ans, ans);\n\n  print(Ans);\n\n  return 0;\n}"}
{"fast_code_id":"a919d0fd3242a8ba6f5a544fb86c2663f3b829970ed267165fbb263606413b9d","fast_id":"ac4bd8ebb89797967f5a663fb89e0c2b5cce13f8b77c8ea9ac3f7372836ec62a","fast_time":0.1051486899,"language":"cpp","measured_fast_code_id":"ac4bd8ebb89797967f5a663fb89e0c2b5cce13f8b77c8ea9ac3f7372836ec62a","measured_slow_code_id":"83ddbb4c7dedf37b57651c8bf97aea49f40020d9f8d06288ec1da55bfafcbc27","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58402","problem_id":"p03653","slow_code_id":"d43946194a874cf6a75776460d1b104e455710845f3dbc5a89d306b4a2772f57","slow_id":"83ddbb4c7dedf37b57651c8bf97aea49f40020d9f8d06288ec1da55bfafcbc27","slow_time":1.1764944071,"speedup":11.188864152457692,"stratum":"8+","sampling_key":"504cb0949ee6302cdbb2bc1d9432d5cdde8c1d359f892be8cd858569aafaa946","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 2e5 + 10;\n\nconst long long inf = 1e16;\n\nlong long pre[maxn], suf[maxn];\n\nstruct data {\n\n  int a, b, c;\n\n  data() {}\n\n  bool operator<(data d) const { return b - a < d.b - d.a; }\n\n} arr[maxn];\n\nint t[maxn * 4];\n\nlong long sum[maxn * 4];\n\nint rev[maxn];\n\nint idx;\n\nvoid add(int x, int c = 1, int b = 1, int e = idx) {\n\n  if (b == e) {\n\n    t[c] += 1;\n\n    sum[c] += rev[b];\n\n    return;\n  }\n\n  int m = (b + e) >> 1;\n\n  int l = c << 1;\n\n  int r = l + 1;\n\n  if (x <= m)\n    add(x, l, b, m);\n\n  else\n    add(x, r, m + 1, e);\n\n  t[c] = t[l] + t[r];\n\n  sum[c] = sum[l] + sum[r];\n}\n\nlong long get(int x, int c = 1, int b = 1, int e = idx) {\n\n  if (b == e) {\n\n    return 1LL * rev[b] * x;\n  }\n\n  int m = (b + e) >> 1;\n\n  int l = c << 1;\n\n  int r = l + 1;\n\n  if (t[r] >= x)\n    return get(x, r, m + 1, e);\n\n  else\n    return sum[r] + get(x - t[r], l, b, m);\n}\n\nint main() {\n\n  ios_base ::sync_with_stdio(false);\n  cin.tie(0);\n\n  int X, Y, Z;\n\n  cin >> X >> Y >> Z;\n\n  int n = X + Y + Z;\n\n  map<int, int> cmp;\n\n  for (int i = 1; i <= n; i++) {\n\n    cin >> arr[i].a >> arr[i].b >> arr[i].c;\n\n    cmp[arr[i].c - arr[i].a];\n\n    cmp[arr[i].c - arr[i].b];\n  }\n\n  sort(arr + 1, arr + n + 1);\n\n  for (auto &i : cmp) {\n\n    i.second = ++idx;\n\n    rev[idx] = i.first;\n  }\n\n  long long total = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    int x = cmp[arr[i].c - arr[i].a];\n\n    add(x);\n\n    total += arr[i].a;\n\n    if (i >= X)\n      pre[i] = total + get(i - X);\n\n    else\n      pre[i] = -inf;\n  }\n\n  memset(t, 0, sizeof t);\n\n  memset(sum, 0, sizeof sum);\n\n  total = 0;\n\n  for (int i = n; i >= 1; i--) {\n\n    int x = cmp[arr[i].c - arr[i].b];\n\n    add(x);\n\n    total += arr[i].b;\n\n    if (n - i + 1 >= Y)\n      suf[i] = total + get(n - i + 1 - Y);\n\n    else\n      suf[i] = -inf;\n  }\n\n  long long ans = -inf;\n\n  for (int i = 1; i < n; i++) {\n\n    ans = max(ans, pre[i] + suf[i + 1]);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ninline long long read()\n\n{\n\n  long long x = 0, f = 1, c = getchar();\n\n  while (c < 48)\n    c == '-' && (f = -1), c = getchar();\n\n  while (c > 47)\n    x = x * 10 + c - '0', c = getchar();\n\n  return x * f;\n}\n\ntypedef long long ll;\n\nconst ll MAXN = 100005;\n\nstruct Node {\n  ll a, b;\n} s[MAXN];\n\npriority_queue<ll, vector<ll>, greater<ll> > q, ept;\n\nll lp[MAXN], rp[MAXN], ans;\n\nll n, x, y, z;\n\nint main(int argc, char const *argv[])\n\n{\n\n  x = read();\n  y = read();\n  z = read();\n  n = x + y + z;\n\n  for (ll i = 1, k; i <= n; ++i)\n\n    ans += (k = read()), s[i].a = read() - k, s[i].b = read() - k;\n\n  sort(s + 1, s + n + 1,\n       [](Node a, Node b)\n\n       { return a.a - a.b > b.a - b.b; });\n\n  for (ll i = 1; i <= n; ++i)\n\n  {\n\n    lp[i] = lp[i - 1] + s[i].a;\n    q.push(s[i].a);\n\n    if (q.size() > y)\n      lp[i] -= q.top(), q.pop();\n  }\n\n  for (ll i = (q = ept, n); i; --i)\n\n  {\n\n    rp[i] = rp[i + 1] + s[i].b;\n    q.push(s[i].b);\n\n    if (q.size() > z)\n      rp[i] -= q.top(), q.pop();\n  }\n\n  ll mx = -1000000000000000000ll;\n\n  for (ll i = y; i <= n - z; ++i)\n\n    mx = max(mx, lp[i] + rp[i + 1]);\n\n  printf(\"%lld\\n\", ans + mx);\n\n  return 0;\n}"}
{"fast_code_id":"96d170d5ddc0e4497c411b79cab8adceebe88dae9b256b08687a417998a4d12d","fast_id":"5da9eb7b2eb71e6eda5381a0cbfd52821da20817ca7039b7220d43b31c45411e","fast_time":0.0199353028,"language":"cpp","measured_fast_code_id":"5da9eb7b2eb71e6eda5381a0cbfd52821da20817ca7039b7220d43b31c45411e","measured_slow_code_id":"c80f3e3df072500ae597967c77b40385cbc4b296ddf8dd301cb4bad51ed0cd22","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58443","problem_id":"p03940","slow_code_id":"3ad525d87dfd7864d4e492f4507f28354b7029b38bb12fefbbb1e0a65c62fa4d","slow_id":"c80f3e3df072500ae597967c77b40385cbc4b296ddf8dd301cb4bad51ed0cd22","slow_time":0.9061884809,"speedup":45.45646935947219,"stratum":"8+","sampling_key":"7a3bdf790dda2e3778714d7b91d27ba1b71ba879d01e4250fab8545f3fd2f787","slow_code":"#include <bits/stdc++.h>\n\n#define N 111111\n\n#define M 444444\n\n#define LL long long\n\nusing namespace std;\n\nint n, i, k, j, a[N];\nLL f[N], V1[M], V2[M], E, T;\n\nvoid ins(int k, int l, int r, int x, LL z1, LL z2) {\n\n  if (l == r) {\n    V1[k] = z1;\n    V2[k] = z2;\n    return;\n  }\n\n  int md = l + r >> 1;\n\n  if (x <= md)\n    ins(k << 1, l, md, x, z1, z2);\n  else\n    ins(k << 1 | 1, md + 1, r, x, z1, z2);\n\n  V1[k] = min(V1[k << 1], V1[k << 1 | 1]);\n\n  V2[k] = min(V2[k << 1], V2[k << 1 | 1]);\n}\n\nLL qu1(int k, int l, int r, int x, int y) {\n\n  if (x > y)\n    return 1e18;\n\n  if (x <= l && r <= y)\n    return V1[k];\n\n  int md = l + r >> 1;\n\n  if (y <= md)\n    return qu1(k << 1, l, md, x, y);\n\n  if (x > md)\n    return qu1(k << 1 | 1, md + 1, r, x, y);\n\n  return min(qu1(k << 1, l, md, x, y), qu1(k << 1 | 1, md + 1, r, x, y));\n}\n\nLL qu2(int k, int l, int r, int x, int y) {\n\n  if (x > y)\n    return 1e18;\n\n  if (x <= l && r <= y)\n    return V2[k];\n\n  int md = l + r >> 1;\n\n  if (y <= md)\n    return qu2(k << 1, l, md, x, y);\n\n  if (x > md)\n    return qu2(k << 1 | 1, md + 1, r, x, y);\n\n  return min(qu2(k << 1, l, md, x, y), qu2(k << 1 | 1, md + 1, r, x, y));\n}\n\nint main() {\n\n  for (i = 0; i < M; i++)\n    V1[i] = V2[i] = 1e18;\n\n  scanf(\"%d%lld%lld\", &n, &E, &T);\n\n  for (i = 1; i <= n; i++)\n    scanf(\"%lld\", &a[i]);\n\n  for (i = 0, k = 0; i <= n; i++) {\n\n    f[i] = 1e18;\n\n    for (; (a[i] - a[k + 1]) * 2 > T && k < i; k++)\n      ;\n\n    if (i == 0)\n      f[i] = 0;\n    else\n\n      f[i] = min(qu1(1, 0, n, k, i - 1) + T + a[i],\n                 qu2(1, 0, n, 0, k - 1) + 1ll * a[i] * 3);\n\n    ins(1, 0, n, i, f[i] - a[i], f[i] - a[i] - a[i + 1] * 2);\n  }\n\n  printf(\"%lld\\n\", f[n] + E - a[n]);\n}","fast_code":"#include <cmath>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#define ll long long\n\nusing namespace std;\n\nconst int maxn = 100000 + 10;\n\nll f[maxn], xx[maxn];\n\nll n, e, t;\n\nll store;\n\nint main() {\n\n  ll b1, b2, b3, b4;\n\n  ll p;\n\n  scanf(\"%lld%lld%lld\", &n, &e, &t);\n\n  for (b1 = 1; b1 <= n; b1++) {\n\n    scanf(\"%lld\", &xx[b1]);\n  }\n\n  for (b1 = 1; b1 <= n; b1++) {\n\n    f[maxn] = b1 * t;\n  }\n\n  p = 0;\n  store = ((ll)1 << 60);\n\n  for (b1 = 1; b1 <= n; b1++) {\n\n    while (2 * xx[p + 1] <= 2 * xx[b1] - t) {\n\n      store = min(store, f[p] - 2 * xx[p + 1]);\n\n      p++;\n    }\n\n    f[b1] = min(2 * xx[b1] + store, f[p] + t);\n\n    f[b1] = min(f[b1 - 1] + t, f[b1]);\n  }\n\n  printf(\"%lld\\n\", f[n] + e);\n}"}
{"fast_code_id":"c569c092694aff2493729559379bcb27e88ae09c71cde7e72a28426be81cddfe","fast_id":"a76876655d6a02bc4f898de143486bcae482c59c002455368f7f95cb4b93d593","fast_time":0.1060341928,"language":"cpp","measured_fast_code_id":"a76876655d6a02bc4f898de143486bcae482c59c002455368f7f95cb4b93d593","measured_slow_code_id":"8c998c8212be7887e4ca371d0b486955d0d7376930f29715338be4753fd49223","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58612","problem_id":"p00748","slow_code_id":"6b94a1c9297d5bd2064ca2c8de65157afa62f05cef5285d9569280226c163496","slow_id":"8c998c8212be7887e4ca371d0b486955d0d7376930f29715338be4753fd49223","slow_time":0.9180267293,"speedup":8.657836732265858,"stratum":"8+","sampling_key":"8737759fa9300ad65b854d5d52f72e1b3cc3c3d4b82a3674f13b6089dda515f4","slow_code":"#include <stdio.h>\n\n#define N 1000000\n\nint all[N + 1], odd[N + 1];\n\nint pollock[1000];\n\nint num;\n\nint BackTrack(int n, int type) {\n\n  int i, tmp, ans = N + 1;\n\n  if (type && odd[n] <= N)\n    return odd[n];\n\n  if (!type && all[n] <= N)\n    return all[n];\n\n  for (i = num - 1; i >= 0; i--) {\n\n    if (pollock[i] > n)\n      continue;\n\n    if (type && !(pollock[i] & 1))\n      continue;\n\n    tmp = BackTrack(n - pollock[i], type);\n\n    if (ans > tmp + 1)\n      ans = tmp + 1;\n  }\n\n  if (type)\n    odd[n] = ans;\n\n  if (!type)\n    all[n] = ans;\n\n  return ans;\n}\n\nint main() {\n\n  int i, n, tmp;\n\n  for (i = 0; i <= N; i++)\n    all[i] = odd[i] = N + 1;\n\n  all[0] = odd[0] = 0;\n\n  for (num = 1;; num++) {\n\n    tmp = num * (num + 1) * (num + 2) / 6;\n\n    if (tmp > N)\n      break;\n\n    pollock[num - 1] = tmp;\n  }\n\n  num--;\n\n  while (scanf(\"%d\", &n) && n) {\n\n    printf(\"%d %d\\n\", BackTrack(n, 0), BackTrack(n, 1));\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <vector>\n\nusing namespace std;\n\nint m;\n\nint f(int n) { return n * (n + 1) * (n + 2) / 6; }\n\nvector<int> l1, l2;\n\nvoid r(int n, int step, vector<int> &l, int p) {\n\n  if (step + 1 >= m)\n    return;\n\n  for (int i = p; i >= 0; i--) {\n\n    int n2 = n - l[i];\n\n    if (n2 < 0)\n      continue;\n\n    if (n2 == 0) {\n\n      m = step + 1;\n\n      return;\n    }\n\n    if (n2 > 0) {\n\n      r(n2, step + 1, l, i);\n    }\n  }\n}\n\nint main() {\n\n  while (1) {\n\n    vector<int> l1, l2;\n\n    int n;\n\n    cin >> n;\n\n    if (n == 0)\n      break;\n\n    for (int i = 1; true; i++) {\n\n      int mm = f(i);\n\n      if (mm > n)\n        break;\n\n      l1.push_back(mm);\n\n      if (mm & 1)\n        l2.push_back(mm);\n    }\n\n    m = n;\n\n    r(n, 0, l1, l1.size() - 1);\n\n    cout << m;\n\n    cout << ' ';\n\n    m = n;\n\n    r(n, 0, l2, l2.size() - 1);\n\n    cout << m;\n\n    cout << \"\\n\";\n  }\n\n  return 0;\n}"}
{"fast_code_id":"861cde84b93a809842c3c46b1c814d7c5578279ab9bd2c35a4560d88e8796f7b","fast_id":"185ec0143560c80ae4ba4b801a54dd67b60c8ee9a206ab0d271846604279d8ea","fast_time":0.0132035561,"language":"cpp","measured_fast_code_id":"185ec0143560c80ae4ba4b801a54dd67b60c8ee9a206ab0d271846604279d8ea","measured_slow_code_id":"1b67e0d33f74cd06d18c9d8be99add4652c97cdf604c774aea5d3178e50d4ed9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58620","problem_id":"p03776","slow_code_id":"cab902e88850f6492a85f65d39351d1bd368845677c8f868f50ec558be571c09","slow_id":"1b67e0d33f74cd06d18c9d8be99add4652c97cdf604c774aea5d3178e50d4ed9","slow_time":0.0906503486,"speedup":6.865601048190343,"stratum":"4-8","sampling_key":"4a664f5c4db69b0b4ffdd626cec69a8f26ec319cee9c49abf2b93a2923c2de5d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long dp[300][300], sum[300][300];\n\nlong long a[300];\n\nlong long n, l, r;\n\nint main()\n\n{\n\n  for (int i = 0; i <= 200; i++)\n\n  {\n\n    sum[0][i] = 0;\n\n    sum[i][0] = 1;\n\n    sum[i][i] = 1;\n  }\n\n  for (int i = 0; i <= 200; i++)\n\n  {\n\n    for (int j = 0; j <= 200; j++)\n\n    {\n\n      dp[i][j] = -1;\n    }\n  }\n\n  dp[0][0] = 0;\n\n  cin >> n >> l >> r;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> a[i];\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    dp[i][0] = 0;\n\n    for (int j = 1; j <= i && j <= r; j++)\n\n    {\n\n      long long x = dp[i - 1][j];\n\n      long long y = dp[i - 1][j - 1] + a[i];\n\n      if (x == y)\n\n      {\n\n        dp[i][j] = x;\n\n        sum[i][j] = sum[i - 1][j] + sum[i - 1][j - 1];\n\n      }\n\n      else if (x > y)\n\n      {\n\n        dp[i][j] = x;\n\n        sum[i][j] = sum[i - 1][j];\n\n      }\n\n      else\n\n      {\n\n        dp[i][j] = y;\n\n        sum[i][j] = sum[i - 1][j - 1];\n      }\n    }\n  }\n\n  int pos = 0;\n\n  long long k = 0;\n\n  for (int i = l; i <= r && i <= n; i++)\n\n  {\n\n    if (pos == 0)\n\n    {\n\n      pos = i;\n\n      k = sum[n][i];\n\n    }\n\n    else if (dp[n][i] * pos > dp[n][pos] * i)\n\n    {\n\n      pos = i;\n\n      k = sum[n][i];\n\n    }\n\n    else if (dp[n][i] * pos == dp[n][pos] * i)\n\n    {\n\n      k += sum[n][i];\n    }\n  }\n\n  printf(\"%.6f\\n\", dp[n][pos] * 1.0 / pos * 1.0);\n\n  cout << k << endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <math.h>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\nll v[55];\n\ntypedef struct Node {\n\n  ll val = 0;\n\n  int sum = 0;\n\n} node;\n\nnode s[55];\n\nll dp[55][55];\n\nll C(int n, int m);\n\nint main(void)\n\n{\n\n  int n = 0, N, a, b;\n\n  scanf(\"%d %d %d\", &N, &a, &b);\n\n  for (int i = 0; i < N; i++)\n\n    scanf(\"%lld\", &v[i]);\n\n  sort(v, v + N);\n\n  reverse(v, v + N);\n\n  s[n].val = v[0], s[n].sum++;\n\n  for (int i = 1; i < N; i++)\n\n    if (s[n].val == v[i])\n\n      s[n].sum++;\n\n    else\n\n      s[++n].val = v[i], s[n].sum++;\n\n  n++;\n\n  ll ans = 0;\n\n  double ave;\n\n  ll t = 0;\n\n  for (int i = 0; i < a; i++)\n\n    t += v[i];\n\n  ave = (double)t / a;\n\n  if (a <= s[0].sum)\n\n  {\n\n    if (b > s[0].sum)\n      b = s[0].sum;\n\n    for (int i = a; i <= b; i++)\n\n      ans += C(s[0].sum, i);\n\n  }\n\n  else\n\n  {\n\n    int k = s[0].sum, m;\n\n    for (m = 1; m < n; m++)\n\n      if (k + s[m].sum >= a)\n\n        break;\n\n      else\n\n        k += s[m].sum;\n\n    a -= k;\n\n    ans = C(s[m].sum, a);\n  }\n\n  printf(\"%.12lf\\n\", ave);\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n\nll C(int n, int m)\n\n{\n\n  if (n == m || !m)\n    return 1;\n\n  for (int i = 0; i <= 50; i++)\n\n    dp[i][0] = 1;\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= m; j++)\n\n      dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];\n\n  return dp[n][m];\n}"}
{"fast_code_id":"53411df039e315d4089185bd6cfa57475dd05623ce689473789c137590e07be7","fast_id":"fc8d2a97326de273dec6261af0715477d404de4e06ef6f6fb423b4234b9af821","fast_time":0.0287904045,"language":"cpp","measured_fast_code_id":"fc8d2a97326de273dec6261af0715477d404de4e06ef6f6fb423b4234b9af821","measured_slow_code_id":"dc4c89abd3f12dfbb4f36fcbf3d76a5207210ee2fae4ec4c1fc50ed7ef4df04a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58673","problem_id":"p00439","slow_code_id":"0cb5f3b9543473511376e2724e21c750aa6fa7e3a2ac4e53b349cf5a64968f1b","slow_id":"dc4c89abd3f12dfbb4f36fcbf3d76a5207210ee2fae4ec4c1fc50ed7ef4df04a","slow_time":0.1132207934,"speedup":3.932587796743183,"stratum":"2-4","sampling_key":"72b95fd9fee82a865b700d0a8ea555804b2fb439c657662ce9d44f912ffb8e8d","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  int n, k;\n\n  int a[1000000];\n\n  for (;;) {\n\n    cin >> n >> k;\n\n    if (!n && !k)\n      break;\n\n    for (int i = 0; i < n; i++)\n      cin >> a[i];\n\n    int sum = 0;\n\n    for (int i = 0; i < k; i++)\n      sum += a[i];\n\n    int m = sum;\n\n    for (int i = k; i < n; i++) {\n\n      sum += a[i] - a[i - k];\n\n      m = max(m, sum);\n    }\n\n    cout << m << endl;\n  }\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  int n, k;\n\n  int a[1000000];\n\n  for (;;) {\n\n    scanf(\"%d %d\", &n, &k);\n\n    if (!n && !k)\n      break;\n\n    for (int i = 0; i < n; i++)\n      scanf(\"%d\", &a[i]);\n\n    int sum = 0;\n\n    for (int i = 0; i < k; i++)\n      sum += a[i];\n\n    int m = sum;\n\n    for (int i = k; i < n; i++) {\n\n      sum += a[i] - a[i - k];\n\n      m = max(m, sum);\n    }\n\n    printf(\"%d\\n\", m);\n  }\n}"}
{"fast_code_id":"ff3b8b9ad9abe0df3784018d89a4ecb5de0df1de79af5338a65e71fc27fc562b","fast_id":"6379cfcd2a6c7d85f07c73fd35a90bc2ce738de3ba9109c3e0366b32a5547c1c","fast_time":0.0250924377,"language":"cpp","measured_fast_code_id":"6379cfcd2a6c7d85f07c73fd35a90bc2ce738de3ba9109c3e0366b32a5547c1c","measured_slow_code_id":"f3c70ccad2a2d97b848f3ade3d51d7180d540a277c8a319c059370774b86b48a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58680","problem_id":"p03426","slow_code_id":"b902adc4dec3b63c818b79457ff14e5ee315c2b1457cf50f9d61600d0e1ebc84","slow_id":"f3c70ccad2a2d97b848f3ade3d51d7180d540a277c8a319c059370774b86b48a","slow_time":0.0802395751,"speedup":3.197759263540983,"stratum":"2-4","sampling_key":"7b166b1d8ddbe65fa549a92273260e5979a6ad539d02c0f5817f16ec1a6ae019","slow_code":"#include <algorithm>\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define all(x) (x).begin(), (x).end()\n\n#define ll long long\n\n#define INF 1000000000000000000\n\nint main() {\n\n  int H, W, D, Q;\n\n  cin >> H >> W >> D;\n\n  vector<vector<ll>> A(H, vector<ll>(W));\n\n  vector<pair<ll, ll>> ps(H * W + 93000);\n\n  vector<ll> sum(H * W + 93000, 0);\n\n  rep(i, H) {\n\n    rep(j, W) {\n\n      cin >> A[i][j];\n\n      ps[A[i][j]] = {i, j};\n    }\n  }\n\n  rep(j, H * W) {\n\n    sum[j + D] = sum[j] + abs(ps[j + D].first - ps[j].first) +\n\n                 abs(ps[j + D].second - ps[j].second);\n  }\n\n  cin >> Q;\n\n  rep(i, Q) {\n\n    int l, r;\n\n    cin >> l >> r;\n\n    cout << sum[r] - sum[l] << endl;\n  }\n}","fast_code":"#include <algorithm>\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define all(x) (x).begin(), (x).end()\n\n#define ll long long\n\n#define ld long double\n\n#define INF 1000000000000000000\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<int, int> pint;\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int H, W, D;\n\n  cin >> H >> W >> D;\n\n  ll m = 0;\n\n  map<ll, pll> ma;\n\n  rep(i, H) {\n\n    rep(j, W) {\n\n      ll a;\n\n      cin >> a;\n\n      ma[a] = {i, j};\n\n      m = max(m, a);\n    }\n  }\n\n  vector<ll> table(m + 1, 0);\n\n  for (int i = 0; i < m + 1; i++) {\n\n    if (table[i] != 0)\n\n      continue;\n\n    for (int j = i + D; j < m + 1; j += D) {\n\n      pll a = ma[j], b = ma[j - D];\n\n      table[j] = table[j - D] + abs(a.first - b.first) +\n\n                 abs(a.second - b.second);\n    }\n  }\n\n  int Q;\n\n  cin >> Q;\n\n  vector<ll> L(Q), R(Q);\n\n  rep(i, Q) {\n\n    cin >> L[i] >> R[i];\n\n    cout << table[R[i]] - table[L[i]] << endl;\n  }\n}"}
{"fast_code_id":"f90da7066ab317c5edae486ae5bddecc06916488e601b7e4888047d0bdabadb0","fast_id":"21d84f873af27de7629ac70c410cecea953b87e9dd7524370947c5a18882946b","fast_time":0.0671895919,"language":"cpp","measured_fast_code_id":"21d84f873af27de7629ac70c410cecea953b87e9dd7524370947c5a18882946b","measured_slow_code_id":"8be41fe400ea49bd0f4669e69bb19e8031b659766a7a44c2075b8bb30ade9523","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58707","problem_id":"p03472","slow_code_id":"e37c406ff13a240d7fa42369d2abd51f617ade53f9717334f1c444c7c77e6316","slow_id":"8be41fe400ea49bd0f4669e69bb19e8031b659766a7a44c2075b8bb30ade9523","slow_time":0.6351055388,"speedup":9.45243929662862,"stratum":"8+","sampling_key":"1adf388e3b77f0fae0cc274b64607e606c78d47735f28d04bc278e9b9f035e50","slow_code":"#include <iostream>\n\n#include <cstdlib>\n\n#include <iomanip>\n\n#include <cmath>\n\n#include <string>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <sstream>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <cctype>\n\n#include <map>\n\n#include <climits>\n\n#include <bitset>\n\nusing namespace std;\n\n#define MATH_PI 3.14159265358979323846\n\nstruct Knife {\n\n  int iHurt;\n\n  int iType = 0;\n\n} arrKnives[1000000];\n\nbool cmp(Knife nifKnife1, Knife nifKnife2) { return (nifKnife1.iHurt > nifKnife2.iHurt); }\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  int n, iHP;\n\n  register int i, c = 0;\n\n  scanf(\"%d %d\", &n, &iHP);\n\n  for (i = 1; i <= n; ++i) {\n\n    scanf(\"%d\", &arrKnives[c].iHurt);\n\n    ++c;\n\n    arrKnives[c].iType = 1;\n\n    scanf(\"%d\", &arrKnives[c].iHurt);\n\n    ++c;\n  }\n\n  sort(arrKnives, arrKnives + c, cmp);\n\n  int iSum = 0;\n\n  for (i = 0; i < c; ++i) {\n\n    if (arrKnives[i].iType == 1) {\n\n      ++iSum;\n\n      iHP -= arrKnives[i].iHurt;\n\n      if (iHP <= 0) {\n\n        printf(\"%d\", iSum);\n\n        break;\n      }\n\n    }\n\n    else if (arrKnives[i].iType != 1) {\n\n      if (iHP % arrKnives[i].iHurt == 0)\n\n        iSum += iHP / arrKnives[i].iHurt;\n\n      else\n\n        iSum += iHP / arrKnives[i].iHurt + 1;\n\n      printf(\"%d\", iSum);\n\n      break;\n    }\n  }\n\nendapp:\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct p\n\n{\n\n  int l;\n\n  int r;\n\n} a[1000000];\n\nbool cmp(p xx, p yy)\n\n{\n\n  return xx.l > yy.l;\n}\n\nint main()\n\n{\n\n  int n, h, wsq = 0;\n  ;\n\n  int c = 0;\n\n  cin >> n >> h;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> a[c++].l;\n\n    a[c].r = 1;\n\n    cin >> a[c++].l;\n  }\n\n  sort(a, a + c, cmp);\n\n  for (int i = 0; i < c; i++)\n\n  {\n\n    if (a[i].r == 1)\n\n    {\n\n      wsq++;\n\n      h -= a[i].l;\n\n      if (h <= 0)\n\n      {\n\n        cout << wsq << endl;\n\n        return 0;\n      }\n\n    }\n\n    else if (a[i].r != 1)\n\n    {\n\n      if (h % a[i].l == 0)\n\n        wsq += h / a[i].l;\n\n      else\n\n        wsq += h / a[i].l + 1;\n\n      cout << wsq << endl;\n\n      return 0;\n    }\n  }\n}"}
{"fast_code_id":"a3f38c6880f80a20493a104e294682cced67ef87e8278c02d2c05f5c4e7adb05","fast_id":"1521d58cdc865e516b04f364ecbfbcc5391e4b3e0efce47f8bc65b7f55c68f6a","fast_time":0.0561439104,"language":"cpp","measured_fast_code_id":"1521d58cdc865e516b04f364ecbfbcc5391e4b3e0efce47f8bc65b7f55c68f6a","measured_slow_code_id":"4be494da376e87850c5753eb7f28ad5ba7ef120fef6cd9d4fecdcb54a64c3101","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58718","problem_id":"p03230","slow_code_id":"f1568246bc0f976b4125b8408778f43bcf5ae027e0648c7384b1b06a54ca3159","slow_id":"4be494da376e87850c5753eb7f28ad5ba7ef120fef6cd9d4fecdcb54a64c3101","slow_time":0.1889999054,"speedup":3.3663473750485324,"stratum":"2-4","sampling_key":"ae884b1415f4bb8168f6318dcacb39fae4506d8c3fb644f3de179f5bd21e1dfb","slow_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\n#ifndef LOCAL\n\n#define endl '\\n'\n\n#endif\n\n#define fr(i, a, b) for (int i = a; i <= b; i++)\n\n#define rf(i, a, b) for (int i = a; i >= b; i--)\n\n#define pf push_front\n\n#define pb push_back\n\n#define eb emplace_back\n\n#define fi first\n\n#define se second\n\n#define all(x) x.begin(), x.end()\n\n#define rall(x) x.rbegin(), x.rend()\n\n#define sz(x) (int)x.size()\n\n#define lb lower_bound\n\n#define ub upper_bound\n\ntypedef long long ll;\n\ntypedef long double f80;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\nint pct(int x) { return __builtin_popcount(x); }\n\nint pct(ll x) { return __builtin_popcountll(x); }\n\nint bt(int x) { return 31 - __builtin_clz(x); }\n\nint bt(ll x) { return 63 - __builtin_clzll(x); }\n\nint cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }\n\nll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }\n\nint nxt_C(int x) {\n  int c = x & -x, r = x + c;\n  return (((r ^ x) >> 2) / c) | r;\n}\n\nll nxt_C(ll x) {\n  ll c = x & -x, r = x + c;\n  return (((r ^ x) >> 2) / c) | r;\n}\n\nvector<int> get_bits(int mask) {\n\n  vector<int> bb;\n\n  while (mask) {\n    int b = bt(mask);\n    bb.pb(b);\n    mask ^= (1 << b);\n  }\n\n  reverse(all(bb));\n\n  return bb;\n}\n\nint get_mask(vector<int> v) {\n\n  int mask = 0;\n\n  for (int x : v) {\n    mask ^= (1 << x);\n  }\n\n  return mask;\n}\n\ntemplate <typename T>\n\nvoid uniq(vector<T> &v) {\n  sort(all(v));\n  v.resize(unique(all(v)) - v.begin());\n}\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\n\nll rand(ll l, ll r) {\n\n  uniform_int_distribution<ll> uid(l, r);\n\n  return uid(rng);\n}\n\nvoid sc() {}\n\ntemplate <typename Head, typename... Tail>\n\nvoid sc(Head &H, Tail &...T) {\n  cin >> H;\n  sc(T...);\n}\n\n#ifdef LOCAL\n\n#define debug(...)                                                             \\\n  cerr << \"[L:\" << __LINE__ << \"][\" << #__VA_ARGS__ << \"]:\",                   \\\n      debug_out(__VA_ARGS__)\n\n#else\n\n#define debug(...) 42\n\n#endif\n\nconst int mod = 1e9 + 7;\n\nint pwr(int a, ll b) {\n\n  int ans = 1;\n\n  while (b) {\n\n    if (b & 1)\n      ans = (ans * 1LL * a) % mod;\n\n    a = (a * 1LL * a) % mod;\n\n    b >>= 1;\n  }\n\n  return ans;\n}\n\nconst int N = 1e5 + 5;\n\nvector<int> v[N];\n\nvoid solve() {\n\n  int n;\n\n  sc(n);\n\n  int k;\n\n  for (k = 1; k * (k - 1) <= 2 * n; k++)\n    ;\n\n  k--;\n\n  if (k * (k - 1) == 2 * n) {\n\n    cout << \"Yes\" << endl;\n\n    cout << k << endl;\n\n    int c = 0;\n\n    fr(i, 1, k) {\n\n      fr(j, i + 1, k) {\n\n        v[i].pb(++c);\n\n        v[j].pb(c);\n      }\n    }\n\n    fr(i, 1, k) {\n\n      cout << sz(v[i]) << \" \";\n\n      for (int j : v[i]) {\n\n        cout << j << \" \";\n      }\n\n      cout << endl;\n    }\n\n  }\n\n  else\n\n    cout << \"No\";\n}\n\nint main() {\n\n  ios ::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  int t = 1;\n\n  for (int tt = 1; tt <= t; tt++) {\n\n    solve();\n  }\n\n  return 0;\n}","fast_code":"                                \n\n                                                                                     \n\n                                       \n\n#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\n\n\n#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);\n\n#define DECIMAL(n)  std::cout << std::fixed;std::cout << std::setprecision(n);\n\n#define hell 1000000007\n\n#define narak 998244353\n\n#define PI 3.14159265358979323844\n\n#define mp make_pair\n\n#define eb emplace_back\n\n#define pb push_back\n\n#define fi first \n\n#define se second\n\n#define all(v) v.begin(), v.end()\n\n#define endl \"\\n\"\n\n#define sqr(a) (a)*(a)\n\n#define __lcm(m,n) m*(n/__gcd(m,n))\n\n#define inputarr(a,n) for(int xxx=0;xxx<n;++xxx) cin>>(a)[xxx]\n\n#define sz(a) (int)a.size()\n\n#define sl(a) (int)a.length()\n\n#define display(x) for(auto &a:x) cout<<a<<\" \";cout<<endl\n\n#define debug cerr<<\"bhau\"<<endl\n\n#define between(n,a,b) (a<=n&&n<=b)\n\n#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC \n\n\n\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <typename Arg1>\n\nvoid __f(const char* name, Arg1&& arg1){\n\n  std::cerr << name << \" : \" << arg1 << endl;\n\n}\n\ntemplate <typename Arg1, typename... Args>\n\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\n\n  const char* comma = strchr(names + 1, ',');std::cerr.write(names, comma - names) << \" : \" << arg1<<\" | \";__f(comma+1, args...);\n\n}\n\n\n\n\n\ntemplate<typename T, typename U> static inline void amin(T &x, U y) { \n\n  if (y < x) \n\n    x = y; \n\n}\n\n\n\ntemplate<typename T, typename U> static inline void amax(T &x, U y) { \n\n  if (x < y) \n\n    x = y; \n\n}\n\n\n\ntemplate<typename T,typename U> std::ostream& operator<<(std::ostream& out, std::pair<T,U> a) {\n\n  out<<a.fi<<\" \"<<a.se;\n\n  return out;\n\n}\n\n\n\ntemplate<typename T,typename U> std::istream& operator>>(std::istream& in, std::pair<T,U> &a) {\n\n  in>>a.fi>>a.se;\n\n  return in;\n\n}\n\n\n\ninline long long toint(const std::string &s) {std::stringstream ss; ss << s; long long x; ss >> x; return x;}\n\ninline std::string tostring(long long number) {std::stringstream ss; ss << number; return ss.str();}\n\ninline std::string tobin(long long x) {return std::bitset<63>(x).to_string();}\n\n\n\nstd::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());\n\n\n\n#define ll long long\n\n#define pii std::pair<int, int>\n\n#define vi vector<int>  \n\n#define vvi vector<vi > \n\n#define vii vector<pii >\n\n#define point complex<ll>\n\n#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> \n\n\n\n                                                     \n\n                               \n\n                               \n\n                                                           \n\n                                                          \n\n                                                                   \n\n                                                                  \n\n                                                    \n\n\n\n                                           \n\n\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\n#define int long long\n\nvi adj[1005];\n\nvoid meowmeow321()\n\n{\n\n  int n;\n\n  cin>>n;\n\n  int k=1;\n\n  while(k*(k-1)/2<n){\n\n    k++;\n\n  }\n\n  if(k*(k-1)/2 != n){\n\n    cout<<\"No\\n\";\n\n    return;\n\n  }\n\n  cout<<\"Yes\\n\";\n\n  cout<<k<<endl;\n\n  int num=1;\n\n  for (int i = 0; i < k; ++i) {\n\n    for (int j = i+1; j < k; ++j) {\n\n      adj[i].pb(num);\n\n      adj[j].pb(num);\n\n      num++;\n\n    }\n\n  }\n\n  assert(num-1==n);\n\n  assert(sz(adj[0])*k==2*n);\n\n  for (int i = 0; i < k; ++i) {\n\n    cout<<sz(adj[i])<<\" \";\n\n    display(adj[i]);\n\n  }\n\n\n\n}\n\nsigned main()\n\n{\n\n  FAST;\n\n  int testcases=1;\n\n                     \n\n  for(int i=0;i<testcases;++i)\n\n  {\n\n    meowmeow321();\n\n  }\n\n  cerr<<endl<<\"Time Elasped : \"<<elasped_time<<endl;\n\n  return 0;\n\n}"}
{"fast_code_id":"0ea7a27e75d0774553796cf70f9cbe69a81d33ebce0cae87219633b1fe6845ff","fast_id":"715b1d8b7f053e4799d69e43b26e0a79764c415981e80addcfac63acf26d895d","fast_time":0.0184867509,"language":"cpp","measured_fast_code_id":"715b1d8b7f053e4799d69e43b26e0a79764c415981e80addcfac63acf26d895d","measured_slow_code_id":"3c638743c8e4a94d721a00b6d1a0e9fad95795fa39353c436b5bab1f2ffb611e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58731","problem_id":"p03442","slow_code_id":"d8eed3bfc728c1a05ddac35bdb783e01ab6e08e24a07c5f3c9a5aafdde7a90ff","slow_id":"3c638743c8e4a94d721a00b6d1a0e9fad95795fa39353c436b5bab1f2ffb611e","slow_time":0.5120811093,"speedup":27.69989773054171,"stratum":"8+","sampling_key":"4deb913157992e2870c18c01bb058b9b17ad8ae8a3cff318170cc39d2efd8806","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n;\n\nconst int N = 100010, M = 16;\n\nint s[N], cnt[M], ans, f[1000010];\n\nvoid chkmin(int &x, int y)\n\n{\n\n  if (y < x)\n    x = y;\n}\n\nint gi()\n\n{\n\n  int f = 0;\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9')\n    ch = getchar();\n\n  while (ch >= '0' && ch <= '9')\n    f = f * 10 + ch - 48, ch = getchar();\n\n  return f;\n}\n\nint main()\n\n{\n\n  n = gi();\n\n  int u, v, w;\n\n  for (int i = 1; i < n; i++)\n\n    u = gi(), v = gi(), w = gi(), s[u] ^= w, s[v] ^= w;\n\n  for (int i = 0; i < n; i++)\n\n    cnt[s[i]]++;\n\n  int now = 0;\n\n  for (int i = 1; i < 16; i++)\n\n    ans += cnt[i] / 2, now += ((cnt[i] & 1) << i - 1);\n\n  memset(f, 127, sizeof(f));\n  f[now] = 0;\n\n  for (int i = (1 << 15) - 1; i; i--)\n\n    if (f[i] < 2000000000)\n\n    {\n\n      for (int j = 1; j <= 15; j++)\n\n        if (i & (1 << j - 1))\n\n          for (int k = 1; k <= 15; k++)\n\n            if (i & (1 << k - 1) && j != k)\n\n            {\n\n              int l = j ^ k;\n\n              if (i & (1 << l - 1))\n\n                chkmin(f[i - (1 << j - 1) - (1 << k - 1) - (1 << l - 1)],\n                       f[i] + 2);\n\n              else\n\n                chkmin(f[i - (1 << j - 1) - (1 << k - 1) + (1 << l - 1)],\n                       f[i] + 1);\n            }\n    }\n\n  printf(\"%d\\n\", f[0] + ans);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <ctime>\n\n#define INF 1e9\n\nusing namespace std;\n\nconst int maxn = 100010;\n\nconst double Pi = acos(-1.0);\n\ntemplate <class T>\nvoid read(T &x)\n\n{\n\n  x = 0;\n  int f = 0;\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9') {\n    f |= (ch == '-');\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = (x << 1) + (x << 3) + (ch ^ 48);\n    ch = getchar();\n  }\n\n  x = f ? -x : x;\n\n  return;\n}\n\nint n, num[maxn], book[21], s;\n\nint f[(1 << 17) + 10], ans;\n\nint dp(int s)\n\n{\n\n  if (!s)\n\n    return 0;\n\n  if (f[s])\n\n    return f[s];\n\n  f[s] = INF;\n\n  for (int i = 1; i <= 15; i++)\n\n  {\n\n    if (!(s & (1 << i)))\n\n      continue;\n\n    for (int j = 1; j <= 15; j++)\n\n    {\n\n      if (i == j || !(s & (1 << j)))\n\n        continue;\n\n      int k = i ^ j;\n\n      int t = s ^ (1 << i) ^ (1 << j) ^ (1 << k);\n\n      if (s & (1 << k))\n\n        f[s] = min(f[s], dp(t) + 2);\n\n      else\n\n        f[s] = min(f[s], dp(t) + 1);\n    }\n  }\n\n  return f[s];\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    int a, b, c;\n\n    scanf(\"%d%d%d\", &a, &b, &c);\n\n    num[a] ^= c;\n\n    num[b] ^= c;\n  }\n\n  for (int i = 0; i < n; i++)\n\n    book[num[i]]++;\n\n  for (int i = 1; i <= 15; i++)\n\n  {\n\n    ans += (book[i] >> 1);\n\n    s |= ((book[i] & 1) << i);\n  }\n\n  printf(\"%d\", ans + dp(s));\n\n  return 0;\n}"}
{"fast_code_id":"494ae74515f2e1bc85d84c0ee45cb8007dd82fa19fc5740d4bbf85cb43e82999","fast_id":"40e15cd23416b34b8af4649cf46bb2161399b5df2d954f30fdfd3a2b36134517","fast_time":0.1083585486,"language":"cpp","measured_fast_code_id":"40e15cd23416b34b8af4649cf46bb2161399b5df2d954f30fdfd3a2b36134517","measured_slow_code_id":"0ddae31654fcc61c95ce3b3e73fb306a1e0a6b3448000e7bfec06e7f797075db","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58774","problem_id":"p02720","slow_code_id":"7c124bb0ab740f2529ef0b4e4b8cb9b4f69f2e815b57c9a869b1473874a88fdd","slow_id":"0ddae31654fcc61c95ce3b3e73fb306a1e0a6b3448000e7bfec06e7f797075db","slow_time":1.0931914748,"speedup":10.088650031992032,"stratum":"8+","sampling_key":"7d96ad58eef0a7a14f59ac956027b88a77d94431ae60d071da80444139610fa9","slow_code":"#pragma region Macros\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n                                             \n\n                                                  \n\n\n\nusing ll = long long int;\n\nusing ld = long double;\n\nusing pii = pair<int, int>;\n\nusing pll = pair<ll, ll>;\n\ntemplate <typename Q_type>\n\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\n\n\n\nconst int MOD_TYPE = 2;\n\nconst ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\n\nconst int INF = (int)1e9;\n\nconst ll LINF = (ll)4e18;\n\nconst ld PI = acos(-1.0);\n\nconst ld EPS = 1e-11;\n\n\n\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\n\n#define rep(i, n) REP(i, 0, n)\n\n#define MP make_pair\n\n#define MT make_tuple\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << endl\n\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << endl\n\n#define possible(n) cout << ((n) ? \"possible\" : \"impossible\") << endl\n\n#define Yay(n) cout << ((n) ? \"Yay!\" : \":(\") << endl\n\n#define all(v) v.begin(), v.end()\n\n#define NP(v) next_permutation(all(v))\n\n#define dbg(x) cerr << #x << \":\" << x << endl;\n\n\n\nvector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};\n\nvector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};\n\n\n\n#pragma endregion\n\n\n\nll dp[100010][11];\n\n\n\nll f(int d, int b)\n\n{\n\n  if (dp[d][b] != -1)\n\n    return dp[d][b];\n\n  if (d == 0)\n\n    return 1;\n\n\n\n  ll res = 0;\n\n\n\n  if (b == 10)\n\n  {\n\n    for (int i = 1; i <= 9; i++)\n\n    {\n\n      res += f(d - 1, i);\n\n    }\n\n  }\n\n  else\n\n  {\n\n    for (int i = max(0, b - 1); i <= min(9, b + 1); i++)\n\n    {\n\n      res += f(d - 1, i);\n\n    }\n\n  }\n\n\n\n  return dp[d][b] = res;\n\n}\n\n\n\nstring ans;\n\nll k;\n\n\n\nvoid calc(int di, int b)\n\n{\n\n  if (di == 0)\n\n    return;\n\n  ll val;\n\n\n\n\n\n  if (b == 10)\n\n  {\n\n    for (int i = 1; i <= 9; i++)\n\n    {\n\n      val = f(di - 1, i);\n\n      if (k <= val)\n\n      {\n\n        ans.push_back((char)(i + '0'));\n\n        calc(di - 1, i);\n\n        return;\n\n      }\n\n      k -= val;\n\n    }\n\n  }\n\n  else\n\n  {\n\n    for (int i = max(0, b - 1); i <= min(9, b + 1); i++)\n\n    {\n\n      val = f(di - 1, i);\n\n      if (k <= val)\n\n      {\n\n        ans.push_back((char)(i + '0'));\n\n        calc(di - 1, i);\n\n        return;\n\n      }\n\n      k -= val;\n\n    }\n\n  }\n\n  assert(false);\n\n}\n\n\n\nint main()\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cout << setprecision(30) << setiosflags(ios::fixed);\n\n\n\n  cin >> k;\n\n  rep(i, 100010) rep(j, 11) dp[i][j] = -1;\n\n\n\n  for (int d = 1; d <= 100010; d++)\n\n  {\n\n    ll val = f(d, 10);\n\n    if (k <= val)\n\n    {\n\n      calc(d, 10);\n\n      cout << ans << endl;\n\n      return 0;\n\n    }\n\n    k -= val;\n\n  }\n\n  assert(false);\n\n  return 0;\n\n}\n","fast_code":"#pragma region Macros\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long int;\n\nusing ld = long double;\n\nusing pii = pair<int, int>;\n\nusing pll = pair<ll, ll>;\n\ntemplate <typename Q_type>\n\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\n\nconst int MOD_TYPE = 2;\n\nconst ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\n\nconst int INF = (int)1e9;\n\nconst ll LINF = (ll)4e18;\n\nconst ld PI = acos(-1.0);\n\nconst ld EPS = 1e-11;\n\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\n\n#define rep(i, n) REP(i, 0, n)\n\n#define MP make_pair\n\n#define MT make_tuple\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << endl\n\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << endl\n\n#define possible(n) cout << ((n) ? \"possible\" : \"impossible\") << endl\n\n#define Yay(n) cout << ((n) ? \"Yay!\" : \":(\") << endl\n\n#define all(v) v.begin(), v.end()\n\n#define NP(v) next_permutation(all(v))\n\n#define dbg(x) cerr << #x << \":\" << x << endl;\n\nvector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};\n\nvector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};\n\n#pragma endregion\n\nint main()\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cout << setprecision(30) << setiosflags(ios::fixed);\n\n  int k;\n\n  cin >> k;\n\n  queue<ll> que;\n\n  for (int i = 1; i <= 9; ++i)\n\n    que.push(i);\n\n  rep(i, k)\n\n  {\n\n    ll q = que.front();\n\n    if (i == k - 1)\n\n    {\n\n      cout << q << endl;\n\n      return 0;\n    }\n\n    que.pop();\n\n    int t = q % 10;\n\n    if (t != 0)\n\n      que.push(10 * q + t - 1);\n\n    que.push(10 * q + t);\n\n    if (t != 9)\n\n      que.push(10 * q + t + 1);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"51d85c54b5d32a15f3306d74202595aa414ca12ebea92eabcaee242c93cda454","fast_id":"93e4fc30f42a78f0abd64c131851a823fa43c5d4c0a444560f8b5ec034366a54","fast_time":0.0172391594,"language":"cpp","measured_fast_code_id":"93e4fc30f42a78f0abd64c131851a823fa43c5d4c0a444560f8b5ec034366a54","measured_slow_code_id":"750707d62f4d085111a2d0d8e5f27c935f2d312c2ae22d4220caed54f1a1c99d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58785","problem_id":"p03181","slow_code_id":"cdf77062ee32ef991b415a9c9d584979f33899d4733a69a36b565633d227ae0b","slow_id":"750707d62f4d085111a2d0d8e5f27c935f2d312c2ae22d4220caed54f1a1c99d","slow_time":0.8301147323,"speedup":48.152854384535715,"stratum":"8+","sampling_key":"12451f8b335c8db0360df5b480414b0fe1a9618025b335031c2aac867032e166","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint N, M;\n\nint K[100001];\n\nint to[200001], ne[200001], he[100001], num[200001];\n\nvector<int> S1[100001], S2[100001];\n\nint dame[100001];\n\nint dfs(int v, int prev) {\n\n  if (dame[v]) {\n\n    ll ret = 1;\n\n    if (prev >= 2) {\n\n      int k = K[v] - num[prev];\n\n      ret = (ll)S1[v][k - 1] * S2[v][k] % M;\n\n    }\n\n    else\n      ret = S1[v][K[v]];\n\n    if (dame[v] >= 2 && dame[v] != prev) {\n\n      ll tmp = dfs(to[dame[v]], dame[v] ^ 1);\n\n      int k = K[v] - num[dame[v]];\n\n      for (int i = k; i <= K[v]; i++) {\n\n        S1[v][i] = S1[v][i] * tmp % M;\n      }\n\n      for (int i = k - 1; i >= 0; i--) {\n\n        S2[v][i] = S2[v][i] * tmp % M;\n      }\n\n      ret *= tmp;\n\n      dame[v] = -1;\n    }\n\n    return (ret + 1) % M;\n  }\n\n  dame[v] = prev;\n\n  ll ret = 1;\n\n  int k = 0;\n\n  for (int i = he[v]; i; i = ne[i]) {\n\n    int tmp = 1;\n\n    if (i != prev) {\n\n      tmp = dfs(to[i], i ^ 1);\n\n      ret = ret * tmp % M;\n    }\n\n    S2[v][k++] = tmp;\n\n    S1[v][k] = ret;\n  }\n\n  for (int i = k - 2; i >= 0; i--) {\n\n    S2[v][i] = ((ll)S2[v][i] * S2[v][i + 1]) % M;\n  }\n\n  return ret + 1;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> N >> M;\n\n  int k = 2;\n\n  rep1(i, N - 1) {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    num[k] = K[x];\n\n    to[k] = y;\n\n    ne[k] = he[x];\n\n    he[x] = k++;\n\n    num[k] = K[y];\n\n    to[k] = x;\n\n    ne[k] = he[y];\n\n    he[y] = k++;\n\n    K[x]++;\n\n    K[y]++;\n  }\n\n  rep1(i, N) {\n\n    S1[i].resize(K[i] + 1);\n\n    S2[i].resize(K[i] + 1);\n\n    S1[i][0] = 1;\n\n    S2[i][K[i]] = 1;\n  }\n\n  rep1(j, N) {\n\n    ll kotae = (dfs(j, -1) - 1 + M) % M;\n\n    co(kotae);\n  }\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 20;\n\nchar dn[dm], *di = dn;\n\ninline void putint(int X) {\n\n  if (X == 0) {\n\n    *di++ = '0';\n\n    *di++ = '\\n';\n\n    return;\n  }\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nint N, M;\n\nint K[100001];\n\nint to[200001], ne[200001], he[100001], num[200001];\n\nint dame[100001];\n\nint S1[200001], S2[200001];\n\nint dfs(int v, int prev) {\n\n  auto s1 = S1 + K[v - 1];\n\n  auto s2 = S2 + K[v - 1];\n\n  int sm = K[v] - K[v - 1];\n\n  if (dame[v]) {\n\n    if (dame[v] >= 2) {\n\n      ll tmp = dfs(to[dame[v]], dame[v] ^ 1);\n\n      int k = sm - num[dame[v]];\n\n      for (int i = k - 1; i < sm; i++) {\n\n        s1[i] = s1[i] * tmp % M;\n      }\n\n      s2[k - 1] = tmp;\n\n      tmp = s2[sm - 1];\n\n      for (int i = sm - 2; i >= 0; i--) {\n\n        tmp = tmp * s2[i] % M;\n\n        s2[i] = tmp;\n      }\n\n      dame[v] = -1;\n    }\n\n    ll ret = 1;\n\n    if (prev >= 2) {\n\n      int k = sm - num[prev];\n\n      if (k >= 2)\n        ret *= s1[k - 2];\n\n      if (k < sm)\n        ret *= s2[k];\n\n      ret %= M;\n\n    }\n\n    else\n      ret = s1[sm - 1];\n\n    return ret + 1;\n  }\n\n  dame[v] = prev;\n\n  ll ret = 1;\n\n  int k = 0;\n\n  for (int i = he[v]; i; i = ne[i]) {\n\n    int tmp = 1;\n\n    if (i != prev) {\n\n      tmp = dfs(to[i], i ^ 1);\n\n      ret = ret * tmp % M;\n    }\n\n    s1[k] = ret;\n\n    s2[k++] = tmp;\n  }\n\n  if (prev == -1) {\n\n    ll tmp2 = s2[sm - 1];\n\n    for (int i = k - 2; i >= 0; i--) {\n\n      tmp2 = tmp2 * s2[i] % M;\n\n      s2[i] = tmp2;\n    }\n  }\n\n  return ret + 1;\n}\n\nint main() {\n\n  N = getint();\n\n  M = getint();\n\n  int k = 2;\n\n  rep1(i, N - 1) {\n\n    int x = getint(), y = getint();\n\n    num[k] = K[x]++;\n\n    to[k] = y;\n\n    ne[k] = he[x];\n\n    he[x] = k++;\n\n    num[k] = K[y]++;\n\n    to[k] = x;\n\n    ne[k] = he[y];\n\n    he[y] = k++;\n  }\n\n  rep1(i, N) K[i] += K[i - 1];\n\n  rep1(j, N) putint(dfs(j, -1) - 1);\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"9ac6fb180e17e3a505a96e61c03890e4d7a0a48484f4f8b57af329b09aa41aeb","fast_id":"cd7f6cf35c5dbac5d6269e236625d5109ee550455d4dfb41abcb2efe431685b2","fast_time":0.0484551136,"language":"cpp","measured_fast_code_id":"cd7f6cf35c5dbac5d6269e236625d5109ee550455d4dfb41abcb2efe431685b2","measured_slow_code_id":"954e16a9aa59e7475a6f76bc965484b7ea2b68ebef9effbc13c8104d0058be1d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58823","problem_id":"p03643","slow_code_id":"2d27179b367ae39bbe55ddbd7f5fd8ecbb001dbad0a1b60e2c9214606dc9fe8f","slow_id":"954e16a9aa59e7475a6f76bc965484b7ea2b68ebef9effbc13c8104d0058be1d","slow_time":0.1695952678,"speedup":3.5000489153739185,"stratum":"2-4","sampling_key":"3506c11709616ff49d1c964d5516ed9a60d0f289453589e9ca72a762f7833ca2","slow_code":"#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\n#define intt long long\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nvector<int> v[100004];\n\nbool went[100004];\n\nvoid dfs(int x) {\n\n  went[x] = true;\n\n  for (int i = 0; i < (int)v[x].size(); i++) {\n\n    if (!went[v[x][i]]) {\n\n      dfs(v[x][i]);\n    }\n  }\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\nint lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\nint fukugen(vector<int> l) {\n\n  int ans = 0;\n\n  for (int i = 0; i < (int)l.size(); i++) {\n\n    ans *= 10;\n\n    ans += l[i];\n  }\n\n  return ans;\n}\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nint n;\n\nsigned main() {\n\n  cin >> n;\n\n  cout << \"ABC\" << n << endl;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\nconstexpr int mod = 998244353ll;\n\n#define intt long long\n\n#define itn long long\n\n#define P pair<int, int>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, n) for (int i = 1; i <= n; i++)\n\n#define ALL(v) v.begin(), v.end()\n\nusing namespace std;\n\ninline int modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % m;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ninline int gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\ninline int lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\ntemplate <class T, class U>\n\ninline bool chmax(T &lhs, const U &rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\ntemplate <class T, class U>\n\ninline bool chmin(T &lhs, const U &rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\nvoid Yes() { cout << \"Yes\" << endl; }\n\nvoid No() { cout << \"No\" << endl; }\n\nvoid YES() { cout << \"YES\" << endl; }\n\nvoid NO() { cout << \"NO\" << endl; }\n\n#define fin(i) scanf(\"%lld\", &i)\n\n#define fout(i) printf(\"%lld\", i)\n\n#define fendl printf(\"\\n\")\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\n#define vecin(v)                                                                                   \\\n  for (int i = 0; i < v.size(); i++)                                                               \\\n    scanf(\"%lld\", &v[i]);\n\n#define vecout(v)                                                                                  \\\n  {                                                                                                \\\n    for (int i = 0; i < (int)v.size(); i++)                                                        \\\n      printf(\"%lld \", v[i]);                                                                       \\\n    printf(\"\\n\");                                                                                  \\\n  }\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\n  vector<int> ookisa;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    ookisa = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n\n      ookisa[i] = 1;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n      ookisa[y] += ookisa[x];\n\n      ookisa[x] = 0;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      ookisa[x] += ookisa[y];\n\n      ookisa[y] = 0;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  int size(int i) {\n\n    i = find(i);\n\n    return ookisa[i];\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\n#define endl \"\\n\"\n\nint perm[1000005];\n\nvoid init_perm() {\n\n  perm[0] = 1;\n\n  REP(i, 1000000) { perm[i] = perm[i - 1] * i % mod; }\n}\n\nint nCk(int x, int y) {\n\n  return perm[x] * modpow(perm[x - y], mod - 2) % mod * modpow(perm[y], mod - 2) % mod;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\ninline string stringmax(string &x, string &y) {\n\n  if (x.size() > y.size()) {\n\n    return x;\n  }\n\n  if (x.size() < y.size()) {\n\n    return y;\n  }\n\n  rep(i, x.size()) {\n\n    if (x[i] > y[i]) {\n\n      return x;\n    }\n\n    if (x[i] < y[i]) {\n\n      return y;\n    }\n  }\n\n  return x;\n}\n\nstring n;\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  std::cin.tie(nullptr);\n\n  cin >> n;\n\n  cout << \"ABC\" << n << endl;\n}\n"}
{"fast_code_id":"1d0d5437f071f522db25a4123a4326111b204f410e08c0bfc86d9387c8b68326","fast_id":"7082f15cc8376e822c84eb7a9dc230bdad489d584ed4f5f0653d129b10eba7c3","fast_time":0.0653995053,"language":"cpp","measured_fast_code_id":"7082f15cc8376e822c84eb7a9dc230bdad489d584ed4f5f0653d129b10eba7c3","measured_slow_code_id":"75e462a2c1a256c0bff300b9daca22a4570e04aebb1b152eb6ba523ae2c63eb5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58833","problem_id":"p03508","slow_code_id":"7eab27f0ce8d078fbb70975fe925d902281c5181c65d6ff5b2c96b0a16c521c2","slow_id":"75e462a2c1a256c0bff300b9daca22a4570e04aebb1b152eb6ba523ae2c63eb5","slow_time":0.2335482052,"speedup":3.5711004865964946,"stratum":"2-4","sampling_key":"ab068a5dce734982558ecd1f31f84b07c71ee687a08a6de53b035bc0ae86a654","slow_code":"\n\n#include <stdio.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <deque>\n\n#include <string>\n\n#include <string.h>\n\n#include <vector>\n\n#include <stack>\n\n#include <queue>\n\n#include <math.h>\n\n#include <stdlib.h>\n\n#include <map>\n\n#include <set>\n\n#include <time.h>\n\n#include <bitset>\n\n#include <list>\n\n#include <assert.h>\n\n#include <time.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<LL, LL> pll;\n\ntypedef pair<string, string> pss;\n\ntypedef vector<int> vi;\n\ntypedef vector<vi> vvi;\n\ntypedef vector<pii> vii;\n\ntypedef vector<LL> vl;\n\ntypedef vector<vl> vvl;\n\ndouble EPS = 1e-9;\n\nint INF = 1000000005;\n\nlong long INFF = 1000000000000000005LL;\n\ndouble PI = acos(-1);\n\nint dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};\n\nint diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};\n\n#ifdef TESTING\n\n#define DEBUG fprintf(stderr, \"====TESTING====\\n\")\n\n#define VALUE(x) cerr << \"The value of \" << #x << \" is \" << x << endl\n\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n\n#else\n\n#define DEBUG\n\n#define VALUE(x)\n\n#define debug(...)\n\n#endif\n\n#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a))\n\n#define FORN(a, b, c) for (int(a) = (b); (a) <= (c); ++(a))\n\n#define FORD(a, b, c) for (int(a) = (b); (a) >= (c); --(a))\n\n#define FORSQ(a, b, c) for (int(a) = (b); (a) * (a) <= (c); ++(a))\n\n#define FORC(a, b, c) for (char(a) = (b); (a) <= (c); ++(a))\n\n#define FOREACH(a, b) for (auto &(a) : (b))\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define REPN(i, n) FORN(i, 1, n)\n\n#define MAX(a, b) a = max(a, b)\n\n#define MIN(a, b) a = min(a, b)\n\n#define SQR(x) ((LL)(x) * (x))\n\n#define RESET(a, b) memset(a, b, sizeof(a))\n\n#define fi first\n\n#define se second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define ALL(v) v.begin(), v.end()\n\n#define ALLA(arr, sz) arr, arr + sz\n\n#define SIZE(v) (int)v.size()\n\n#define SORT(v) sort(ALL(v))\n\n#define REVERSE(v) reverse(ALL(v))\n\n#define SORTA(arr, sz) sort(ALLA(arr, sz))\n\n#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))\n\n#define PERMUTE next_permutation\n\n#define TC(t) while (t--)\n\ninline string IntToString(LL a) {\n\n  char x[100];\n\n  sprintf(x, \"%lld\", a);\n  string s = x;\n\n  return s;\n}\n\ninline LL StringToInt(string a) {\n\n  char x[100];\n  LL res;\n\n  strcpy(x, a.c_str());\n  sscanf(x, \"%lld\", &res);\n\n  return res;\n}\n\ninline string GetString(void) {\n\n  char x[1000005];\n\n  scanf(\"%s\", x);\n  string s = x;\n\n  return s;\n}\n\ninline string uppercase(string s) {\n\n  int n = SIZE(s);\n\n  REP(i, n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';\n\n  return s;\n}\n\ninline string lowercase(string s) {\n\n  int n = SIZE(s);\n\n  REP(i, n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';\n\n  return s;\n}\n\ninline void OPEN(string s) {\n\n#ifndef TESTING\n\n  freopen((s + \".in\").c_str(), \"r\", stdin);\n\n  freopen((s + \".out\").c_str(), \"w\", stdout);\n\n#endif\n}\n\nint n, m;\n\nvi adj[100005];\n\nint a, b;\n\nbool visited[100005];\n\nLL C(int x)\n\n{\n\n  return (LL)x * (x - 1) / 2;\n}\n\nint dfs(int x)\n\n{\n\n  if (visited[x])\n    return 0;\n\n  visited[x] = 1;\n\n  int ret = 1;\n\n  REP(i, SIZE(adj[x]))\n\n  {\n\n    ret += dfs(adj[x][i]);\n  }\n\n  return ret;\n}\n\nint main()\n\n{\n\n  scanf(\"%d %d\", &n, &m);\n\n  REP(i, m)\n\n  {\n\n    scanf(\"%d %d\", &a, &b);\n\n    adj[a].pb(b);\n\n    adj[b].pb(a);\n  }\n\n  a = dfs(1);\n\n  b = dfs(2);\n\n  if (a < b)\n    swap(a, b);\n\n  LL risan = C(n - b) + C(b) - m;\n\n  printf(\"%lld\\n\", risan);\n\n  return 0;\n}\n","fast_code":"                                                  \n\n \n\n#include <stdio.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <deque>\n\n#include <string>\n\n#include <string.h>\n\n#include <vector>\n\n#include <stack>\n\n#include <queue>\n\n#include <math.h>\n\n#include <stdlib.h>\n\n#include <map>\n\n#include <set>\n\n#include <time.h>\n\n#include <bitset>\n\n#include <list>\n\n#include <assert.h>\n\n#include <time.h>\n\nusing namespace std;\n\n \n\ntypedef long long LL;\n\ntypedef pair<int,int> pii;\n\ntypedef pair<LL,LL> pll;\n\ntypedef pair<string,string> pss;\n\ntypedef vector<int> vi;\n\ntypedef vector<vi> vvi;\n\ntypedef vector<pii> vii;\n\ntypedef vector<LL> vl;\n\ntypedef vector<vl> vvl;\n\n \n\ndouble EPS = 1e-9;\n\nint INF = 1000000005;\n\nlong long INFF = 1000000000000000005LL;\n\ndouble PI = acos(-1);\n\nint dirx[8] = {-1,0,0,1,-1,-1,1,1};\n\nint diry[8] = {0,1,-1,0,-1,1,-1,1};\n\n \n\n#ifdef TESTING\n\n#define DEBUG fprintf(stderr,\"====TESTING====\\n\")\n\n#define VALUE(x) cerr << \"The value of \" << #x << \" is \" << x << endl\n\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n\n#else\n\n#define DEBUG \n\n#define VALUE(x)\n\n#define debug(...)\n\n#endif\n\n \n\n#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))\n\n#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))\n\n#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))\n\n#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))\n\n#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))\n\n#define FOREACH(a,b) for (auto &(a) : (b))\n\n#define REP(i,n) FOR(i,0,n)\n\n#define REPN(i,n) FORN(i,1,n)\n\n#define MAX(a,b) a = max(a,b)\n\n#define MIN(a,b) a = min(a,b)\n\n#define SQR(x) ((LL)(x) * (x))\n\n#define RESET(a,b) memset(a,b,sizeof(a))\n\n#define fi first\n\n#define se second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define ALL(v) v.begin(),v.end()\n\n#define ALLA(arr,sz) arr,arr+sz\n\n#define SIZE(v) (int)v.size()\n\n#define SORT(v) sort(ALL(v))\n\n#define REVERSE(v) reverse(ALL(v))\n\n#define SORTA(arr,sz) sort(ALLA(arr,sz))\n\n#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))\n\n#define PERMUTE next_permutation\n\n#define TC(t) while(t--)\n\n \n\ninline string IntToString(LL a){\n\n  char x[100];\n\n  sprintf(x,\"%lld\",a); string s = x;\n\n  return s;\n\n}\n\n \n\ninline LL StringToInt(string a){\n\n  char x[100]; LL res;\n\n  strcpy(x,a.c_str()); sscanf(x,\"%lld\",&res);\n\n  return res;\n\n}\n\n \n\ninline string GetString(void){\n\n  char x[1000005];\n\n  scanf(\"%s\",x); string s = x;\n\n  return s;\n\n}\n\n \n\ninline string uppercase(string s){\n\n  int n = SIZE(s); \n\n  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';\n\n  return s;\n\n}\n\n \n\ninline string lowercase(string s){\n\n  int n = SIZE(s); \n\n  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';\n\n  return s;\n\n}\n\n \n\ninline void OPEN (string s) {\n\n#ifndef TESTING\n\n  freopen ((s + \".in\").c_str (), \"r\", stdin);\n\n  freopen ((s + \".out\").c_str (), \"w\", stdout);\n\n#endif\n\n}\n\n \n\n                                                \n\n \n\nint n,m;\n\nint sz[100005];\n\nint pt[100005];\n\nint a,b;\n\n \n\nint parent(int x)\n\n{\n\n  if (x == pt[x]) return x;\n\n  return pt[x] = parent(pt[x]);\n\n}\n\n \n\nLL C(int x)\n\n{\n\n  return (LL)x * (x - 1) / 2;\n\n}\n\n \n\nint main()\n\n{\n\n  scanf(\"%d %d\",&n,&m);\n\n  REPN(i,n) \n\n  {\n\n    pt[i] = i;\n\n    sz[i] = 1;\n\n  }\n\n  REP(i,m)\n\n  {\n\n    scanf(\"%d %d\",&a,&b);\n\n    assert(a < b);\n\n    a = parent(a);\n\n    b = parent(b);\n\n    if ( a == b) continue;\n\n    sz[a] += sz[b];\n\n    pt[b] = a;\n\n  }\n\n  a = sz[parent(1)];\n\n  b = sz[parent(2)];\n\n  assert(parent(1) != parent(2));\n\n                          \n\n  if (a < b) swap(a,b);\n\n  LL risan = C(n - b) + C(b) - m;\n\n  printf(\"%lld\\n\",risan);\n\n  return 0;\n\n}"}
{"fast_code_id":"6b94053630044cfaafcced5b7257606c350a94f35542f0b40beee15b369f8e55","fast_id":"7915273535a825f4a005d89bd5b9f6cbe5c01a23465dfd888bbf16abd0e414b4","fast_time":0.1082001123,"language":"cpp","measured_fast_code_id":"7915273535a825f4a005d89bd5b9f6cbe5c01a23465dfd888bbf16abd0e414b4","measured_slow_code_id":"e00e657e5347067075efa79a92173add236e4df8a113717e9f3c295d9360df47","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58847","problem_id":"p02691","slow_code_id":"efa5fa516f6a1ad1f365112baad7376818045eecb6f1f8eae7781b34230831c9","slow_id":"e00e657e5347067075efa79a92173add236e4df8a113717e9f3c295d9360df47","slow_time":0.3049214199,"speedup":2.818124800596903,"stratum":"2-4","sampling_key":"1ac0b4f79a4a273b6ce280e3df9336a03c1765830fce2050abdd3901544f7eba","slow_code":"#include <cstring>\n\n#include <iostream>\n\n#include <vector>\n\n#include <map>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\ntypedef long long int64;\n\nint P[400000];\n\nint M[200000];\n\nint main() {\n\n  memset(P, 0, sizeof(P));\n\n  memset(P, 0, sizeof(M));\n\n  int N;\n\n  cin >> N;\n\n  int tmp;\n\n  int64 ans = 0;\n\n  for (int i = 0; i < N; ++i) {\n\n    cin >> tmp;\n\n    if (tmp < 200000) {\n\n      ++P[i + tmp];\n\n      if (i - tmp > 0)\n        ++M[i - tmp];\n    }\n  }\n\n  for (int i = 1; i < N; ++i) {\n\n    ans += (int64)P[i] * M[i];\n  }\n\n  cout << ans << \"\\n\";\n\n  return 0;\n}\n","fast_code":"#include <cstring>\n\n#include <iostream>\n\n#include <vector>\n\n#include <map>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\ntypedef long long int64;\n\nmap<int, int> P;\n\nmap<int, int> M;\n\nint main() {\n\n  int N;\n\n  cin >> N;\n\n  int tmp;\n\n  int64 ans = 0;\n\n  for (int i = 0; i < N; ++i) {\n\n    cin >> tmp;\n\n    if (i + tmp < 200000)\n      ++P[i + tmp];\n\n    if (i - tmp > 0)\n      ++M[i - tmp];\n  }\n\n  for (int i = 1; i < N; ++i) {\n\n    ans += (int64)P[i] * M[i];\n  }\n\n  cout << ans << \"\\n\";\n\n  return 0;\n}\n"}
{"fast_code_id":"2fa3f7f8e5a126705586931dfdbc5c5ebb0f88afa3456d8d3bd5c271021192e8","fast_id":"154d29823586458ee6dc85bfe8426f554b80be4f1996f5aebe264d49206b36bb","fast_time":0.1058066298,"language":"cpp","measured_fast_code_id":"154d29823586458ee6dc85bfe8426f554b80be4f1996f5aebe264d49206b36bb","measured_slow_code_id":"4a11c514bc968685c331a1c816bdacd8505ef4675175867a83644d53f422ad84","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58858","problem_id":"p03588","slow_code_id":"f3fbfc5d8cf418a0c8ff8a1e36f87bbae6a6944f1acd3b7d2cc275711b85bbc8","slow_id":"4a11c514bc968685c331a1c816bdacd8505ef4675175867a83644d53f422ad84","slow_time":0.6848353615,"speedup":6.4725184309764305,"stratum":"4-8","sampling_key":"b525aac84b9f5ffe0664246d3f32d019c6d00c2f1439645a649c8938af524687","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\n#include <iomanip>\n\n#include <vector>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <utility>\n\n#include <functional>\n\n#include <deque>\n\n#include <cctype>\n\n#include <stack>\n\n#include <bitset>\n\nusing ll = long long;\n\ntypedef unsigned long long ull;\n\ntypedef std::pair<ll, ll> P;\n\nstruct edge {\n  ll to, cost;\n};\n\nstd::vector<edge> v[100010], w[100010];\n\ntypedef std::vector<std::vector<int>> ma;\n\nll min(ll a, ll b) {\n\n  if (a >= b)\n    return b;\n\n  else\n    return a;\n}\n\nll max(ll a, ll b) {\n\n  if (a >= b)\n    return a;\n\n  else\n    return b;\n}\n\nll gcd(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  return gcd(b, a % b);\n}\n\nll lcm(ll a, ll b) {\n\n  ll g = gcd(a, b);\n\n  return a / g * b;\n}\n\nconst ll Z = 1000000007;\n\nconst ll INF = 1 << 30;\n\nconst ll INF2 = 9000000000000000000LL;\n\nbool flag = true;\n\nbool fl = true;\n\nbool f = true;\n\nint dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nstd::string abc = \"abcdefghijklmnopqrstuvwxyz\";\n\nint main() {\n\n  int n, a[100000], b[100000], ans = 0, ma = 0, mi = INF;\n\n  std::cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    std::cin >> a[i] >> b[i];\n\n    mi = min(b[i], mi);\n\n    if (mi == b[i])\n      ma = a[i];\n  }\n\n  std::cout << ma + mi << std::endl;\n}","fast_code":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\ntypedef pair<int, int> Pi;\n\ntypedef pair<long long, long long> P;\n\ntypedef pair<long long, P> PP;\n\ntypedef pair<P, P> PPP;\n\nconst long long MOD = 1e9 + 7;\n\nconst long long INF = 5e18;\n\nconst int di[4] = {1, 0, -1, 0};\n\nconst int dj[4] = {0, 1, 0, -1};\n\n#define fr first\n\n#define sc second\n\n#define pb push_back\n\n#define eb emplace_back\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define ALLR(x) (x).rbegin(), (x).rend()\n\nint n, a, b, mx, le;\n\nvoid input() {\n\n  cin >> n;\n\n  return;\n}\n\nvoid solve() {\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a >> b;\n\n    if (a >= mx)\n      mx = a, le = b;\n  }\n\n  cout << le + mx << endl;\n\n  return;\n}\n\nint main() {\n\n  input();\n\n  solve();\n\n  return 0;\n}"}
{"fast_code_id":"6d758736d667775021d9865496433190f30dd6bb60a4fedd6577f19133f3bed6","fast_id":"d2bcfaa909085159ab91a5c3e9e8abf4da75cad6cd2253294e035994f0160192","fast_time":0.0253534558,"language":"cpp","measured_fast_code_id":"d2bcfaa909085159ab91a5c3e9e8abf4da75cad6cd2253294e035994f0160192","measured_slow_code_id":"10f37b11d7bbd727ea7eaecd8366e032ee85195852885acc13d2aa0baf20ccd8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58942","problem_id":"p02589","slow_code_id":"107a56b54a3192dcc72127b9e5530061c3c9c3fee91b6d984ee9423390c961b8","slow_id":"10f37b11d7bbd727ea7eaecd8366e032ee85195852885acc13d2aa0baf20ccd8","slow_time":0.0727868925,"speedup":2.870886441445194,"stratum":"2-4","sampling_key":"26ca0fb4a152a07832119272e6159277e3c7a4adc547f176853e9eba5b72f144","slow_code":"#pragma GCC optimize(\"O2\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst ll mod = 100000000000000003;\n\nint ne[200001], he[100001];\n\nchar C[1200100];\n\nll num[524300];\n\nint kazu[524300];\n\nconst int ma = (1 << 19) - 1;\n\nint query(ll n) {\n\n  int n2 = (n & ma) + 1;\n\n  while (num[n2]) {\n\n    if (num[n2] == n + 1)\n      return kazu[n2];\n\n    n2 = n2 * 61 % 524287;\n  }\n\n  return 0;\n}\n\nvoid add(ll n, int b) {\n\n  int n2 = (n & ma) + 1;\n\n  while (num[n2]) {\n\n    if (num[n2] == n + 1) {\n\n      kazu[n2] |= b;\n\n      return;\n    }\n\n    n2 = n2 * 61 % 524287;\n  }\n\n  num[n2] = n + 1;\n\n  kazu[n2] = b;\n}\n\nint main() {\n\n  fread(C, 1, 1200100, stdin);\n\n  char *ci = C, c;\n\n  int N = 0;\n\n  while ((c = *ci++) >= '0')\n    N = N * 10 + c - '0';\n\n  ll dekai[10];\n\n  int d = 0;\n\n  char *s[200001];\n\n  rep1(i, N) {\n\n    s[i] = ci;\n\n    while (*ci++ >= '0')\n      ;\n\n    int n = ci - s[i] - 1;\n\n    if (n <= 100000) {\n\n      ne[i] = he[n];\n\n      he[n] = i;\n\n    }\n\n    else {\n\n      dekai[d++] = (ll(n) << 30) + s[i] - C;\n    }\n  }\n\n  ll kotae = 0;\n\n  for (int M = 1; M <= 100000; M++) {\n\n    for (int p = he[M]; p; p = ne[p]) {\n\n      auto S = s[p];\n\n      int k[26] = {};\n\n      ll are = 0;\n\n      for (int i = M - 1; i >= 1; i--) {\n\n        int tmp = query(are);\n\n        if (tmp) {\n\n          rep(j, 26) if ((tmp >> j & 1)) { k[j]++; }\n        }\n\n        kotae += k[S[i] - 'a'];\n\n        k[S[i] - 'a'] = 0;\n\n        are = (are * 30 + S[i] - 'a' + 1) % mod;\n      }\n\n      kotae += k[S[0] - 'a'];\n\n      k[S[0] - 'a'] = 0;\n\n      add(are, 1 << (S[0] - 'a'));\n    }\n  }\n\n  sort(dekai, dekai + d);\n\n  rep(p, d) {\n\n    auto S = C + (dekai[p] & (1 << 21) - 1);\n\n    int k[26] = {};\n\n    ll are = 0;\n\n    for (int i = (dekai[p] >> 30) - 1; i >= 1; i--) {\n\n      int tmp = query(are);\n\n      if (tmp) {\n\n        rep(j, 26) if ((tmp >> j & 1)) { k[j]++; }\n      }\n\n      kotae += k[S[i] - 'a'];\n\n      k[S[i] - 'a'] = 0;\n\n      are = (are * 30 + S[i] - 'a' + 1) % mod;\n    }\n\n    kotae += k[S[0] - 'a'];\n\n    k[S[0] - 'a'] = 0;\n\n    add(are, 1 << (S[0] - 'a'));\n  }\n\n  printf(\"%lld\\n\", kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O2\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst ll mod = 100000000000000003;\n\nint ne[200001], he[10001];\n\nchar C[1200100];\n\nint num[2097153];\n\nint kazu[2097153];\n\nint atta[1000001];\n\nconst int ma = (1 << 21) - 1;\n\nint cnt = 0;\n\nint query(int n) {\n\n  int n2 = (n & ma) + 1;\n\n  while (num[n2]) {\n\n    if (num[n2] == n + 1)\n      return kazu[n2];\n\n    n2 = n2 * 61 % 2097143;\n  }\n\n  num[n2] = n + 1;\n\n  return kazu[n2] = ++cnt;\n}\n\nint main() {\n\n  fread(C, 1, 1200100, stdin);\n\n  char *ci = C, c;\n\n  int N = 0;\n\n  while ((c = *ci++) >= '0')\n    N = N * 10 + c - '0';\n\n  ll dekai[100];\n\n  int d = 0;\n\n  char *s[200001];\n\n  rep1(i, N) {\n\n    s[i] = ci;\n\n    while (*ci++ >= '0')\n      ;\n\n    int n = ci - s[i] - 1;\n\n    if (n <= 100000) {\n\n      ne[i] = he[n];\n\n      he[n] = i;\n\n    }\n\n    else {\n\n      dekai[d++] = (ll(n) << 30) + s[i] - C;\n    }\n  }\n\n  ll kotae = 0;\n\n  for (int M = 1; M <= 10000; M++) {\n\n    for (int p = he[M]; p; p = ne[p]) {\n\n      auto S = s[p];\n\n      int k[26] = {};\n\n      int mae = 0;\n\n      for (int i = M - 1; i >= 1; i--) {\n\n        int tmp = atta[mae];\n\n        if (tmp) {\n\n          rep(j, 26) if ((tmp >> j & 1)) { k[j]++; }\n        }\n\n        int ct = S[i] - 'a';\n\n        mae = query((mae << 5) + ct);\n\n        kotae += k[ct];\n\n        k[ct] = 0;\n      }\n\n      kotae += k[S[0] - 'a'];\n\n      k[S[0] - 'a'] = 0;\n\n      atta[mae] |= 1 << (S[0] - 'a');\n    }\n  }\n\n  sort(dekai, dekai + d);\n\n  rep(p, d) {\n\n    auto S = C + (dekai[p] & ma);\n\n    int k[26] = {};\n\n    int mae = 0;\n\n    for (int i = (dekai[p] >> 30) - 1; i >= 1; i--) {\n\n      int tmp = atta[mae];\n\n      if (tmp) {\n\n        rep(j, 26) if ((tmp >> j & 1)) { k[j]++; }\n      }\n\n      int ct = S[i] - 'a';\n\n      mae = query((mae << 5) + ct);\n\n      kotae += k[ct];\n\n      k[ct] = 0;\n    }\n\n    kotae += k[S[0] - 'a'];\n\n    k[S[0] - 'a'] = 0;\n\n    atta[mae] |= 1 << (S[0] - 'a');\n  }\n\n  printf(\"%lld\\n\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"067edb463cfd3802bc8f76b1384776cb4e7ea5c5a5e3683cf1f61eebc31d2b48","fast_id":"ed91d3ce6eacb26c1ad86846da8cb08bb987d5b0286a68ae3671e2e294f8dfdb","fast_time":0.0147013292,"language":"cpp","measured_fast_code_id":"ed91d3ce6eacb26c1ad86846da8cb08bb987d5b0286a68ae3671e2e294f8dfdb","measured_slow_code_id":"4f83036e62523d9ff561452231c1815fb7cf1b23eabfd25306d8dc63c19807c0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58953","problem_id":"p02371","slow_code_id":"6b03e492ca88374e5ff276d01f51020b5d356f4341ffc4fc090410e8cb980e1c","slow_id":"4f83036e62523d9ff561452231c1815fb7cf1b23eabfd25306d8dc63c19807c0","slow_time":0.2711769134,"speedup":18.44574117828747,"stratum":"8+","sampling_key":"26dc290d942e822bf3904bd5f3524df3d2bf298395107d5d3820e70d06b9ae90","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <string>\n\n#include <vector>\n\n#include <functional>\n\n#include <queue>\n\n#include <stack>\n\n#include <set>\n\n#include <map>\n\n#include <numeric>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <cassert>\n\n#include <sstream>\n\n#define rep(i, a) REP(i, 0, a)\n\n#define REP(i, a, b) for (int i = a; i < b; ++i)\n\n#define rrep(i, a) RREP(i, a, 0)\n\n#define RREP(i, a, b) for (int i = a; i >= b; --i)\n\n#define repll(i, a) REPLL(i, 0, a)\n\n#define REPLL(i, a, b) for (ll i = a; i < b; ++i)\n\n#define rrepll(i, a) RREPLL(i, a, 0)\n\n#define RREPLL(i, a, b) for (ll i = a; i >= b; --i)\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef std::pair<int, int> P;\n\ntypedef std::pair<int, P> PP;\n\nconst double PI = 3.14159265358979323846;\n\nconst double eps = 1e-9;\n\nconst int infi = (int)1e+9 + 7;\n\nconst ll infll = (ll)1e+17 + 7;\n\n#include <time.h>\n\nconst int maxN = 100001;\n\nint n, d;\n\nstd::vector<P> g[maxN];\n\nstd::vector<int> alive;\n\nbool used[maxN];\n\nP dfs(int v) {\n\n  used[v] = true;\n\n  P ret = P(0, v);\n\n  for (int i = 0; i < g[v].size(); i++) {\n\n    int u = g[v][i].first;\n\n    int w = g[v][i].second;\n\n    if (used[u])\n      continue;\n\n    P tmp = dfs(u);\n\n    ret = std::max(ret, P(w + tmp.first, tmp.second));\n  }\n\n  return ret;\n}\n\nint main() {\n\n  std::cin >> n;\n\n  for (int i = 0; i < n - 1; ++i) {\n\n    int a, b, c;\n\n    std::cin >> a >> b >> c;\n\n    g[a].push_back(P(b, c));\n\n    g[b].push_back(P(a, c));\n  }\n\n  int v = dfs(0).second;\n\n  for (int i = 0; i < n; ++i)\n    used[i] = false;\n\n  std::cout << dfs(v).first << std::endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#define MAX_N 100000\n\n#define INF 1000000000\n\ntypedef struct {\n\n  int to, dist;\n\n} P;\n\nP graph[MAX_N][16];\n\nint graphptr[MAX_N];\n\nint n;\n\ntypedef struct {\n\n  int prior;\n\n  P data;\n\n} node_t;\n\ntypedef struct {\n\n  node_t *nodes;\n\n  int len;\n\n  int size;\n\n} heap_t;\n\nvoid push(heap_t *h, int prior, P data) {\n\n  if (h->len + 1 >= h->size) {\n\n    h->size = h->size ? h->size * 2 : 4;\n\n    h->nodes = (node_t *)realloc(h->nodes, h->size * sizeof(node_t));\n  }\n\n  int i = h->len + 1;\n\n  int j = i / 2;\n\n  while (i > 1 && h->nodes[j].prior > prior) {\n\n    h->nodes[i] = h->nodes[j];\n\n    i = j;\n\n    j /= 2;\n  }\n\n  h->nodes[i].prior = prior;\n\n  h->nodes[i].data = data;\n\n  h->len++;\n}\n\nP pop(heap_t *h) {\n\n  int i, j, k;\n\n  if (!h->len) {\n\n    P p;\n\n    p.to = -1;\n    p.dist = -1;\n\n    return p;\n  }\n\n  P data = h->nodes[1].data;\n\n  h->nodes[1] = h->nodes[h->len];\n\n  h->len--;\n\n  i = 1;\n\n  while (true) {\n\n    k = i;\n\n    j = 2 * i;\n\n    if (j <= h->len && h->nodes[j].prior < h->nodes[k].prior)\n      k = j;\n\n    if (j + 1 <= h->len && h->nodes[j + 1].prior < h->nodes[k].prior)\n      k = j + 1;\n\n    if (k == i)\n      break;\n\n    h->nodes[i] = h->nodes[k];\n\n    i = k;\n  }\n\n  h->nodes[i] = h->nodes[h->len + 1];\n\n  return data;\n}\n\nint cost[MAX_N];\n\nvoid dijkstra(int k) {\n\n  heap_t *h = (heap_t *)calloc(1, sizeof(heap_t));\n\n  for (int i = 0; i < n; ++i)\n    cost[i] = INF;\n\n  cost[k] = 0;\n\n  P t;\n\n  t.to = k, t.dist = 0;\n\n  push(h, t.dist, t);\n\n  while (h->len) {\n\n    P p = pop(h);\n\n    int v = p.to;\n\n    if (cost[v] < p.dist)\n      continue;\n\n    for (int i = 0; i < graphptr[v]; ++i) {\n\n      P e = graph[v][i];\n\n      if (cost[e.to] > cost[v] + e.dist) {\n\n        cost[e.to] = cost[v] + e.dist;\n\n        P m;\n\n        m.to = e.to;\n        m.dist = cost[e.to];\n\n        push(h, m.dist, m);\n      }\n    }\n  }\n}\n\nint treeDim_C(P *ret) {\n\n  dijkstra(0);\n\n  int maxV = -INF, maxI;\n\n  for (int i = 0; i < n; ++i) {\n\n    if (cost[i] > maxV)\n      maxV = cost[i], maxI = i;\n  }\n\n  dijkstra(maxI);\n\n  ret->to = maxI;\n\n  maxV = -INF, maxI;\n\n  for (int i = 0; i < n; ++i) {\n\n    if (cost[i] > maxV)\n      maxV = cost[i], maxI = i;\n  }\n\n  ret->dist = maxI;\n\n  return maxV;\n}\n\nint main(void) {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n - 1; ++i) {\n\n    int a, b, c;\n\n    scanf(\"%d%d%d\", &a, &b, &c);\n\n    graph[a][graphptr[a]].to = b;\n\n    graph[a][graphptr[a]++].dist = c;\n\n    graph[b][graphptr[b]].to = a;\n\n    graph[b][graphptr[b]++].dist = c;\n  }\n\n  P p;\n\n  printf(\"%d\\n\", treeDim_C(&p));\n\n  return 0;\n}"}
{"fast_code_id":"64b0ebfa56c09e905cfb969cf6e8b8e5469aa7fa98930553ee08b2b3013d745c","fast_id":"723c1df640435fb8b409277a5e154b92844ba2904fb95031f757b1a8cbdcde59","fast_time":0.0001910028,"language":"cpp","measured_fast_code_id":"723c1df640435fb8b409277a5e154b92844ba2904fb95031f757b1a8cbdcde59","measured_slow_code_id":"d2d48088b4411362fa916d3fb7adffea6313c02b7955968661d704d54ccdbdaf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58977","problem_id":"p03818","slow_code_id":"6b305e8098a1f6e6dd2293d0a3a8e52ec4add3479e63ce9dacf9bff8c3c41253","slow_id":"d2d48088b4411362fa916d3fb7adffea6313c02b7955968661d704d54ccdbdaf","slow_time":0.0015700256,"speedup":8.219908818090627,"stratum":"8+","sampling_key":"4c027ca8acfe272d232e0f81305dfe4727bacadf816ff58dcd28bfe85ba9eaba","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing VS = vector<string>;\nusing LL = long long;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\n\nusing PII = pair<int, int>;\nusing PLL = pair<LL, LL>;\n\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\n\n#define ALL(a) begin((a)), end((a))\n\n#define RALL(a) (a).rbegin(), (a).rend()\n\n#define PB push_back\n\n#define EB emplace_back\n\n#define MP make_pair\n\n#define SZ(a) int((a).size())\n\n#define SORT(c) sort(ALL((c)))\n\n#define RSORT(c) sort(RALL((c)))\n\n#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))\n\n#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)\n\n#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)\n\n#define debug(x) cerr << #x << \": \" << x << endl\n\nconst int INF = 1e9;\nconst LL LINF = 1e16;\n\nconst LL MOD = 1000000007;\nconst double PI = acos(-1.0);\n\nint DX[8] = {0, 0, 1, -1, 1, 1, -1, -1};\nint DY[8] = {1, -1, 0, 0, 1, -1, 1, -1};\n\nLL N;\n\nLL ans = 0LL;\n\nint main() {\n\n  cin.tie(0);\n\n  ios_base::sync_with_stdio(false);\n\n  cin >> N;\n\n  VI a(N);\n\n  VI cnt(100005);\n\n  FOR(i, 0, N) {\n\n    cin >> a[i];\n\n    cnt[a[i]]++;\n  }\n\n  VI pq;\n\n  FOR(i, 0, 100005) {\n\n    if (cnt[i])\n      pq.push_back(cnt[i]);\n  }\n\n  int even = 0;\n\n  FOR(i, 0, SZ(pq)) {\n\n    if (pq[i] % 2 == 0)\n      even++;\n  }\n\n  ans = SZ(pq);\n\n  if (even % 2 == 1)\n    ans--;\n\n  cout << ans << \"\\n\";\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nconst int M = 1e5 + 5;\n\nint arr[M] = {0};\n\nint main() {\n\n  int n, i, j;\n\n  int num1 = 0;\n\n  int num2 = 0;\n\n  int ans = 0;\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++) {\n\n    scanf(\"%d\", &j);\n\n    if (arr[j] == 0) {\n\n      arr[j] = 1;\n\n      num1++;\n\n    }\n\n    else {\n\n      num2++;\n    }\n  }\n\n  if (num2 % 2 == 0)\n    ans = num1;\n\n  else\n    ans = num1 - 1;\n\n  printf(\"%d\", ans);\n}"}
{"fast_code_id":"9bab41e68990387f0f0e2c6ed563e83889632536e07dc2215fdb136314d16eb2","fast_id":"3c53109579b55a2e07560c302f5ad5e901ca7545925e4d40f8a7438c631a3196","fast_time":0.001360178,"language":"cpp","measured_fast_code_id":"3c53109579b55a2e07560c302f5ad5e901ca7545925e4d40f8a7438c631a3196","measured_slow_code_id":"f12521ce25ad525baec4ae17c1ea91e38659a0c4fcb354f1edc4f1598e38b885","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_58998","problem_id":"p00358","slow_code_id":"479489169c279dc764c5147c2a9026142a9be57e996559bbb7848fa5b866d549","slow_id":"f12521ce25ad525baec4ae17c1ea91e38659a0c4fcb354f1edc4f1598e38b885","slow_time":0.0052506689,"speedup":3.8602807132595878,"stratum":"2-4","sampling_key":"97c1d456f3cc140046d65837f54df05ce526af5175f5d489a12778863a74ddfc","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint h, n;\n\nvector<int> b;\n\nint dp[101010][10];\n\nint dfs(int i = 1, int bit = 0) {\n\n  if (i == h) {\n\n    return 0;\n  }\n\n  bit |= b[i];\n\n  int &ret = dp[i][bit];\n\n  if (~ret)\n\n    return ret;\n\n  ret = 0;\n\n  if (bit == 0)\n\n    ret = max(ret, dfs(i + 1, 0b111) + 2);\n\n  if ((bit & (0b100)) == 0)\n\n    ret = max(ret, dfs(i + 1, 0b110) + 1);\n\n  if ((bit & (0b010)) == 0)\n\n    ret = max(ret, dfs(i + 1, 0b111) + 1);\n\n  if ((bit & (0b001)) == 0)\n\n    ret = max(ret, dfs(i + 1, 0b011) + 1);\n\n  ret = max(ret, dfs(i + 1, 0));\n\n  return ret;\n}\n\nint main() {\n\n  memset(dp, -1, sizeof(dp));\n\n  cin >> h >> n;\n\n  int ei[4] = {0b100, 0b110, 0b011, 0b001};\n\n  b.assign(h + 1, 0);\n\n  for (int i = 0; i < n; ++i) {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    b[y + 1] |= ei[x];\n\n    b[y] |= ei[x];\n  }\n\n  cout << dfs() << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define repto(i, n) for (int i = 0; i <= (n); i++)\n\n#define all(c) (c).begin(), (c).end()\n\n#define uniq(c) c.erase(unique(all(c)), (c).end())\n\n#define _1 first\n\n#define _2 second\n\n#define pb push_back\n\n#define INF 1145141919\n\n#define MOD 1000000007\n\n#define DEBUG(x) cout << #x << \": \" << x << endl;\n\n__attribute__((constructor))\n\nvoid initial() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n}\n\nint h, n;\n\nvector<int> b;\n\nint dp[10000][8];\n\nint dfs(int i = 1, int bit = 0) {\n\n  if (i == h) {\n\n    return 0;\n  }\n\n  bit |= b[i];\n\n  int &ret = dp[i][bit];\n\n  if (~ret)\n\n    return ret;\n\n  ret = 0;\n\n  if (bit == 0)\n\n    ret = max(ret, dfs(i + 1, 0b111) + 2);\n\n  if ((bit & (0b100)) == 0)\n\n    ret = max(ret, dfs(i + 1, 0b110) + 1);\n\n  if ((bit & (0b010)) == 0)\n\n    ret = max(ret, dfs(i + 1, 0b111) + 1);\n\n  if ((bit & (0b001)) == 0)\n\n    ret = max(ret, dfs(i + 1, 0b011) + 1);\n\n  ret = max(ret, dfs(i + 1, 0));\n\n  return ret;\n}\n\nint main() {\n\n  memset(dp, -1, sizeof(dp));\n\n  cin >> h >> n;\n\n  int ei[4] = {0b100, 0b110, 0b011, 0b001};\n\n  b.assign(h + 1, 0);\n\n  for (int i = 0; i < n; ++i) {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    b[y + 1] |= ei[x];\n\n    b[y] |= ei[x];\n  }\n\n  cout << dfs() << endl;\n}\n"}
{"fast_code_id":"4bbf1e8ab040930e72c3214609a44db4a56b2fa39eb84bf889b6fbc1246500f3","fast_id":"1fe94f6dd71b9cf8d91dc1d0536f86b6157d592dac6677bb7dbb7056f4334b0b","fast_time":0.0188413794,"language":"cpp","measured_fast_code_id":"1fe94f6dd71b9cf8d91dc1d0536f86b6157d592dac6677bb7dbb7056f4334b0b","measured_slow_code_id":"5d42e98fc0606802e8466189a9d3ff2ccbcdc1efe27cde341d1e709faf0df2f6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59000","problem_id":"p03725","slow_code_id":"1565c78b2c6a5ef8dc114551509e182a349cfb96dd15cf94f817e2452a1db220","slow_id":"5d42e98fc0606802e8466189a9d3ff2ccbcdc1efe27cde341d1e709faf0df2f6","slow_time":0.6260383529,"speedup":33.22677918687843,"stratum":"8+","sampling_key":"aa381d97381c03426b072b8aca81909abc45637adde002a232dd4588877418f7","slow_code":"\n\n#include <bits/stdc++.h>\n\ntypedef long long ll;\n\ntypedef long double ld;\n\ntypedef unsigned int ui;\n\n#define forn(i, n) for (int i = 1; i <= n; i++)\n\n#define pb push_back\n\n#define all(x) x.begin(), x.end()\n\n#define y1 qewr1234\n\nconst double PI = acos(-1.0);\n\nconst int DIR = 4;\n\nconst int X[] = {1, 0, -1, 0};\n\nconst int Y[] = {0, 1, 0, -1};\n\nconst int N = 805;\n\nusing namespace std;\n\nint n, m, k, dp[N][N], nw[N][N];\n\nstring s[N];\n\nbool used[N][N];\n\nbool good(int x, int y)\n\n{\n\n  return x >= 0 && x < n && y >= 0 && y < m;\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie();\n\n  cout.tie();\n\n  cin >> n >> m >> k;\n\n  for (int i = 0; i < n; i++)\n\n    cin >> s[i];\n\n  memset(dp, -1, sizeof(dp));\n\n  memset(nw, -1, sizeof(nw));\n\n  int x1 = -1, y1 = -1;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    for (int j = 0; j < m; j++)\n\n    {\n\n      if (s[i][j] == 'S')\n\n      {\n\n        x1 = i, y1 = j;\n\n        s[i][j] = '.';\n      }\n    }\n  }\n\n  dp[x1][y1] = 0;\n\n  int d = 0;\n\n  vector<pair<int, int> > v;\n\n  v.pb({x1, y1});\n\n  used[x1][y1] = true;\n\n  while (true)\n\n  {\n\n    vector<pair<int, int> > t;\n\n    for (auto it : v)\n\n    {\n\n      int i = it.first, j = it.second;\n\n      if (dp[i][j] == -1)\n\n        continue;\n\n      if (i == 0 || j == 0 || i == n - 1 || j == m - 1)\n\n      {\n\n        cout << (d + k - 1) / k << endl;\n\n        return 0;\n      }\n\n      for (int dir = 0; dir < DIR; dir++)\n\n      {\n\n        int tx = i + X[dir];\n\n        int ty = j + Y[dir];\n\n        if (good(tx, ty) && dp[i][j] >= bool(s[tx][ty] == '#'))\n\n        {\n\n          int ndp = dp[i][j] - bool(s[tx][ty] == '#') + k * bool((d + 1) % k == 0);\n\n          if (!used[tx][ty])\n\n            t.pb({tx, ty}), used[tx][ty] = true;\n\n          nw[tx][ty] = max(nw[tx][ty], ndp);\n        }\n      }\n\n      nw[i][j] = max(nw[i][j], dp[i][j] + bool((d + 1) % k == 0) * k);\n    }\n\n    for (auto it : t)\n\n      v.pb(it);\n\n    for (auto it : v)\n\n    {\n\n      int i = it.first, j = it.second;\n\n      dp[i][j] = nw[i][j];\n\n      nw[i][j] = -1;\n    }\n\n    d++;\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdlib.h>\n\n#include <string.h>\n\n#include <stdio.h>\n\n#define Error(s)                                                               \\\n  {                                                                            \\\n    puts(s);                                                                   \\\n    exit(0);                                                                   \\\n  }\n\n#define INT_MAX (0x3f3f3f3f)\n\ntypedef int QueueItem;\n\ntypedef struct Node *link;\n\nstruct Node {\n\n  QueueItem element;\n\n  link next;\n};\n\nlink NewNode() {\n\n  link p = (link)malloc(sizeof(Node));\n\n  if (p == NULL)\n    Error(\"Exhausted memory.\");\n\n  p->element = 0;\n\n  p->next = NULL;\n\n  return p;\n}\n\ntypedef struct Queue *queue;\n\nstruct Queue {\n\n  link front, rear;\n};\n\nqueue QueueInit() {\n\n  queue Q = (queue)malloc(sizeof(Queue));\n\n  if (Q == NULL)\n    Error(\"Exhausted memory.\");\n\n  Q->front = Q->rear = 0;\n\n  return Q;\n}\n\nint QueueEmpty(queue Q) { return Q->front == NULL; }\n\nint QueueFull(queue Q) {\n\n  link p = (link)malloc(sizeof(Node));\n\n  int res = (p == NULL);\n\n  free(p);\n\n  return res;\n}\n\nQueueItem QueueFirst(queue Q) {\n\n  if (QueueEmpty(Q))\n    Error(\"Queue is empty\");\n\n  return Q->front->element;\n}\n\nvoid EnterQueue(QueueItem x, queue Q) {\n\n  if (QueueFull(Q))\n    Error(\"Queue is full\");\n\n  link p = NewNode();\n\n  p->element = x;\n\n  p->next = NULL;\n\n  if (QueueEmpty(Q))\n    Q->front = p;\n\n  else\n    Q->rear->next = p;\n\n  Q->rear = p;\n}\n\nvoid DeleteQueue(queue Q) {\n\n  if (QueueEmpty(Q))\n    Error(\"Queue is empty\");\n\n  link p = Q->front;\n\n  Q->front = Q->front->next;\n\n  free(p);\n}\n\nint dirx[] = {0, 0, -1, 1};\n\nint diry[] = {1, -1, 0, 0};\n\nint n, m, K;\n\nint **dis;\n\nchar **s;\n\nqueue queuex, queuey;\n\nvoid read()\n\n{\n\n  scanf(\"%d%d%d\", &n, &m, &K);\n\n  s = (char **)malloc((n + 1) * sizeof(char *));\n\n  int i;\n\n  for (i = 1; i <= n; i++)\n\n    s[i] = (char *)malloc((m + 2) * sizeof(char));\n\n  for (i = 1; i <= n; i++)\n\n    scanf(\"%s\", s[i] + 1);\n}\n\nvoid init()\n\n{\n\n  dis = (int **)malloc((n + 1) * sizeof(int *));\n\n  int i, j;\n\n  for (i = 1; i <= n; i++)\n\n    dis[i] = (int *)malloc((m + 1) * sizeof(int));\n\n  for (i = 1; i <= n; i++)\n\n    for (j = 1; j <= m; j++)\n\n      dis[i][j] = INT_MAX;\n\n  queuex = QueueInit();\n\n  queuey = QueueInit();\n\n  for (i = 1; i <= n; i++)\n\n    for (j = 1; j <= m; j++)\n\n      if (s[i][j] == 'S')\n\n      {\n\n        EnterQueue(i, queuex);\n\n        EnterQueue(j, queuey);\n\n        dis[i][j] = 0;\n      }\n}\n\nint min(int x, int y)\n\n{\n\n  return x < y ? x : y;\n}\n\nvoid work()\n\n{\n\n  int ans = INT_MAX;\n\n  while (!QueueEmpty(queuex))\n\n  {\n\n    int x = QueueFirst(queuex);\n\n    int y = QueueFirst(queuey);\n\n    DeleteQueue(queuex);\n\n    DeleteQueue(queuey);\n\n    ans = min(ans,\n\n              1 + (min(min(x - 1, n - x), min(y - 1, m - y)) + K - 1) / K);\n\n    if (dis[x][y] == K)\n      continue;\n\n    int d;\n\n    for (d = 0; d < 4; d++)\n\n    {\n\n      int nx = x + dirx[d];\n\n      int ny = y + diry[d];\n\n      if (1 <= nx && nx <= n && 1 <= ny && ny <= m && s[nx][ny] == '.')\n\n        if (dis[nx][ny] > dis[x][y] + 1)\n\n        {\n\n          dis[nx][ny] = dis[x][y] + 1;\n\n          EnterQueue(nx, queuex);\n\n          EnterQueue(ny, queuey);\n        }\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n}\n\nint main()\n\n{\n\n  read();\n\n  init();\n\n  work();\n\n  return 0;\n}\n"}
{"fast_code_id":"ebc8ed02823878eda24d0a5c6ee14c0a7166e6a6bcb615f080a811f0f73b7b09","fast_id":"cb802d6c6356ce7690b2bb6021d297f4024e8deb9b09dc0fa8706d4fc3ac6b5c","fast_time":0.1041841861,"language":"cpp","measured_fast_code_id":"cb802d6c6356ce7690b2bb6021d297f4024e8deb9b09dc0fa8706d4fc3ac6b5c","measured_slow_code_id":"67bed35ca0ed28ece36511a437e4b30d11eacb34500e3da76115a036731e63a7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59077","problem_id":"p02657","slow_code_id":"b0ca9052bf7ec1283e861e222190a844ec12560caa7f96c39085c03d3f36563a","slow_id":"67bed35ca0ed28ece36511a437e4b30d11eacb34500e3da76115a036731e63a7","slow_time":0.3711549522,"speedup":3.5624883784545873,"stratum":"2-4","sampling_key":"7e4821cd59c79278ab211453a928a780f7cab4e7e3f51615ca86e722f0f1564c","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define endl '\\n'\n\nusing namespace std;\n\n#define N 100007\n\n#define mod 1000000000000000000\n\n#define pb push_back\n\nvector<ll> v[N];\n\n#define FAST                                                                                       \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(NULL);\n\nint main()\n\n{\n\n  ll a, b;\n\n  cin >> a >> b;\n\n  cout << a * b;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define endl '\\n'\n\nusing namespace std;\n\n#define FAST                                                                                       \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(NULL);\n\nint main()\n\n{\n\n  ll a, b;\n\n  cin >> a >> b;\n\n  cout << a * b;\n}"}
{"fast_code_id":"71416383f23438b65325ba19cc71f57e5a0d9c4aa2a55d4acad0a7e1a417d447","fast_id":"bb3e7650f1037926336110044efd5727f80b88f3852c7b6ca6dc7c95f553c715","fast_time":0.0976388279,"language":"cpp","measured_fast_code_id":"bb3e7650f1037926336110044efd5727f80b88f3852c7b6ca6dc7c95f553c715","measured_slow_code_id":"d11e3f3c508a9289460372144b0077eb56b63f84dcf90656ee6e3282d0a51e94","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59093","problem_id":"p03371","slow_code_id":"bc7ee8150f39404076c3817de5bd5ffc40cb6a954a639201e1c6fdc942a300d3","slow_id":"d11e3f3c508a9289460372144b0077eb56b63f84dcf90656ee6e3282d0a51e94","slow_time":0.2209086094,"speedup":2.262507796859778,"stratum":"2-4","sampling_key":"3277bb4aa1969979af26296c7f4e5c2e97851a415bab9698aa6c2a4e94a14864","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int a, b, c, x, y;\n\n  cin >> a >> b >> c >> x >> y;\n\n  vector<long long> dp((int)1e5 + 1);\n\n  for (int i = 0; i <= (int)1e5; i++)\n\n  {\n\n    dp[i] = max(0, x - i) * a + max(0, y - i) * b + i * 2 * c * 1LL;\n  }\n\n  cout << *min_element(dp.begin(), dp.end());\n\n  return 0;\n}","fast_code":"#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int a, b, c, x, y, com, ext, tot = 0;\n\n  scanf(\"%d%d%d%d%d\", &a, &b, &c, &x, &y);\n\n  if (y > x)\n\n  {\n\n    int t = x;\n\n    x = y;\n\n    y = t;\n\n    t = a;\n\n    a = b;\n\n    b = t;\n  }\n\n  com = y;\n  ext = x - y;\n\n  if (2 * c < a + b)\n    tot += com * c * 2;\n  else\n    tot += com * (a + b);\n\n  if (2 * c < a)\n    tot += ext * 2 * c;\n  else\n    tot += ext * a;\n\n  printf(\"%d\", tot);\n\n  return 0;\n}"}
{"fast_code_id":"050af43161f20c7bc51b74a14d244fb4fc3d349f91e1635d8cdb192304dcb2b1","fast_id":"11b9fe4b9b3eac04237c1d2eef36b3f7c573602e513b2c09e10c4bcc25cc01bc","fast_time":0.0036922211,"language":"cpp","measured_fast_code_id":"11b9fe4b9b3eac04237c1d2eef36b3f7c573602e513b2c09e10c4bcc25cc01bc","measured_slow_code_id":"713888be34d68b7a263592dab15f9454d507a0d4a66501167a3aab1b5c1392e7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59135","problem_id":"p03278","slow_code_id":"fe507cfdcfb43168b2f744cfa1df1c534a9aa532cf6458074f5c3685408819c0","slow_id":"713888be34d68b7a263592dab15f9454d507a0d4a66501167a3aab1b5c1392e7","slow_time":0.0241140594,"speedup":6.5310442540941,"stratum":"4-8","sampling_key":"07b4ae43a18dc421d444811f6bb9c4ecf6d874eeea9e3fadda3de546b6a08220","slow_code":"\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <cstdio>\n\n#include <cmath>\n\n#define re register\n\nusing namespace std;\n\ninline int read() {\n\n  int X = 0, w = 1;\n  char c = getchar();\n\n  while (c < '0' || c > '9') {\n    if (c == '-')\n      w = -1;\n    c = getchar();\n  }\n\n  while (c >= '0' && c <= '9')\n    X = X * 10 + c - '0', c = getchar();\n\n  return X * w;\n}\n\nconst int N = 5000 + 10;\n\nconst int mod = 1e9 + 7;\n\nstruct edge {\n  int v, nxt;\n} e[N << 1];\n\nint head[N];\n\ninline void addEdge(int u, int v) {\n\n  static int e_cnt = 0;\n\n  e[++e_cnt] = (edge){v, head[u]}, head[u] = e_cnt;\n}\n\nint n, sz[N];\n\nint f[N][N], g[N], tmp[N];\n\ninline void dfs(int u, int fa) {\n\n  sz[u] = f[u][1] = 1;\n\n  for (re int i = head[u]; i; i = e[i].nxt) {\n\n    int v = e[i].v;\n    if (v == fa)\n      continue;\n\n    dfs(v, u);\n\n    for (re int j = 1; j <= sz[u] + sz[v]; ++j)\n      tmp[j] = 0;\n\n    for (re int j = 1; j <= sz[u]; ++j)\n\n      for (re int k = 0; k <= sz[v]; ++k)\n\n        tmp[j + k] = (tmp[j + k] + 1ll * f[u][j] * f[v][k]) % mod;\n\n    sz[u] += sz[v];\n\n    for (re int j = 1; j <= sz[u]; ++j)\n      f[u][j] = tmp[j];\n  }\n\n  for (re int i = 2; i <= sz[u]; i += 2)\n\n    f[u][0] = (f[u][0] - 1ll * f[u][i] * g[i] % mod + mod) % mod;\n}\n\nint main() {\n\n  n = read();\n\n  for (re int i = 1; i < n; ++i) {\n\n    int u = read(), v = read();\n\n    addEdge(u, v), addEdge(v, u);\n  }\n\n  g[0] = 1;\n\n  for (re int i = 2; i <= n; i += 2)\n    g[i] = 1ll * g[i - 2] * (i - 1) % mod;\n\n  dfs(1, 0);\n  printf(\"%d\\n\", mod - f[1][0]);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#define ll long long\n\nusing namespace std;\n\ninline int read()\n\n{\n\n  int x = 0, f = 1;\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      f = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = (x << 3) + (x << 1) + (ch ^ 48);\n    ch = getchar();\n  }\n\n  return x * f;\n}\n\nconst int N = 5100, mod = 1e9 + 7;\n\nint n, tot, head[N], siz[N];\n\nint f[N][N], g[N], res[N << 1];\n\nstruct node {\n  int nex, to;\n} a[N << 1];\n\nvoid add(int f, int t) {\n  a[++tot].nex = head[f];\n  a[tot].to = t;\n  head[f] = tot;\n}\n\nvoid dfs(int now, int fa)\n\n{\n\n  f[now][siz[now] = 1] = 1;\n\n  for (int i = head[now], to; i; i = a[i].nex)\n\n  {\n\n    to = a[i].to;\n    if (to == fa)\n      continue;\n\n    dfs(to, now);\n\n    for (int j = 1; j <= siz[now] + siz[to]; j++)\n      res[j] = 0;\n\n    for (int j = 1; j <= siz[now]; j++)\n      for (int k = 0; k <= siz[to]; k++)\n        res[j + k] = (res[j + k] + 1ll * f[now][j] * f[to][k] % mod) % mod;\n\n    siz[now] += siz[to];\n    for (int j = 1; j <= siz[now]; j++)\n      f[now][j] = res[j];\n  }\n\n  for (int i = 2; i <= siz[now]; i += 2)\n    f[now][0] = (f[now][0] + mod - 1ll * f[now][i] * g[i] % mod) % mod;\n}\n\nint main()\n\n{\n\n  n = read();\n  for (int i = 1, x, y; i < n; i++) {\n    x = read();\n    y = read();\n    add(x, y);\n    add(y, x);\n  }\n\n  g[0] = 1;\n  for (int i = 2; i <= n; i += 2)\n    g[i] = 1ll * g[i - 2] * (i - 1) % mod;\n\n  dfs(1, 0);\n  cout << mod - f[1][0] << \"\\n\";\n\n  return 0;\n}"}
{"fast_code_id":"06f21757c3099f483e32d2527f7235599b58a3654964bda0d38c6475ce6ef673","fast_id":"9625640a825814aa4d2335674a3f90f455f88266b37bf781950284e77038f775","fast_time":0.0307599595,"language":"cpp","measured_fast_code_id":"9625640a825814aa4d2335674a3f90f455f88266b37bf781950284e77038f775","measured_slow_code_id":"d8c1ffe87c0e86316042b11430a1abac3da14c6f34e4ad7ffba9af44ec58a0a7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59145","problem_id":"p03449","slow_code_id":"cb08b6a9eaaf6f9e7de368ad13e6bd9fa7de9b0fdd5e1dff745361e16c429cb8","slow_id":"d8c1ffe87c0e86316042b11430a1abac3da14c6f34e4ad7ffba9af44ec58a0a7","slow_time":0.1066773288,"speedup":3.468058168282049,"stratum":"2-4","sampling_key":"2a1738b9e535e796657595cef7d56d19703d24fedab7dcc668b8e4bc970f8793","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint n;\n\nint b[3][110], arr[3][110];\n\nint dfs(int x, int y)\n\n{\n\n  int p, q;\n\n  p = arr[x][y];\n\n  q = arr[x][y];\n\n  if (x == 2 && y == n)\n\n  {\n\n    return arr[x][y];\n  }\n\n  if (y + 1 <= n)\n\n  {\n\n    if (b[x][y + 1] > 0)\n\n    {\n\n      p += b[x][y + 1];\n\n    }\n\n    else\n\n    {\n\n      b[x][y + 1] = dfs(x, y + 1);\n\n      p += b[x][y + 1];\n    }\n  }\n\n  if (x + 1 <= 2)\n\n  {\n\n    if (b[x + 1][y] > 0)\n\n    {\n\n      q += b[x + 1][y];\n\n    }\n\n    else\n\n    {\n\n      b[x + 1][y] = dfs(x + 1, y);\n\n      q += b[x + 1][y];\n    }\n  }\n\n  if (p > q)\n\n  {\n\n    b[x][y] = p;\n\n    return b[x][y];\n\n  }\n\n  else\n\n  {\n\n    b[x][y] = q;\n\n    return b[x][y];\n  }\n}\n\nint main()\n\n{\n\n  cin >> n;\n\n  for (int i = 1; i <= 2; i++)\n\n  {\n\n    for (int j = 1; j <= n; j++)\n\n    {\n\n      cin >> arr[i][j];\n    }\n  }\n\n  cout << dfs(1, 1);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\nusing namespace std;\n\nconst int maxn = 1e2 + 10;\n\nint n;\n\nint a[maxn][maxn];\n\nint dp[maxn][maxn];\n\nint max(int a, int b)\n\n{\n\n  return a > b ? a : b;\n}\n\nvoid solve()\n\n{\n\n  dp[1][1] = a[1][1];\n\n  for (int i = 1; i <= 2; i++)\n\n  {\n\n    for (int j = 1; j <= n; j++)\n\n    {\n\n      if (i == 1)\n\n        dp[i][j] = dp[i][j - 1] + a[i][j];\n\n      else\n\n        dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + a[i][j];\n    }\n  }\n}\n\nint main()\n\n{\n\n  while (~scanf(\"%d\", &n))\n\n  {\n\n    memset(a, 0, sizeof(a));\n\n    memset(dp, 0, sizeof(dp));\n\n    for (int i = 1; i <= 2; i++)\n\n    {\n\n      for (int j = 1; j <= n; j++)\n\n      {\n\n        scanf(\"%d\", &a[i][j]);\n      }\n    }\n\n    solve();\n\n    printf(\"%d\\n\", dp[2][n]);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"adae04209542c80f0e84610eb19cb66f86b8176d6dfe4b7cdda6967502c1fe3d","fast_id":"36ee6d5a0f607e8ba92c673deb0898e53e5175332b3e915649742a914c19dcc4","fast_time":0.0225209007,"language":"cpp","measured_fast_code_id":"36ee6d5a0f607e8ba92c673deb0898e53e5175332b3e915649742a914c19dcc4","measured_slow_code_id":"e09ef45f01379ec569a9e1c56fa02e6e242bca4fd20dd88f5f9b1af493a916e3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59177","problem_id":"p03376","slow_code_id":"d2921d0d74106196e75ef9936d816d964afb2dea8a552ac2d58be270a0bef587","slow_id":"e09ef45f01379ec569a9e1c56fa02e6e242bca4fd20dd88f5f9b1af493a916e3","slow_time":0.0679241517,"speedup":3.0160495179484546,"stratum":"2-4","sampling_key":"1e7cf5b48bd70232a3da21247896f4fc4a01b57881704fffe399a7103722aca7","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define int ll\n\nusing namespace std;\n\nll c[55], f[250050], sz[55], fa[55];\n\nstruct node {\n\n  ll cost, value, count;\n\n  node(ll cost = 0, ll value = 0, ll count = 0) {\n    this->cost = cost, this->value = value, this->count = count;\n  }\n\n  inline friend bool operator<(const node a, const node b) {\n    return a.cost * b.value < b.cost * a.value;\n  }\n\n} cs[555];\n\nsigned main() {\n\n  ll n, x, d, ans = 0;\n  cin >> n >> x >> d;\n  cin >> c[1];\n  sz[1] = 1;\n\n  for (int i = 2; i <= n; ++i)\n    cin >> c[i] >> fa[i], sz[i] = 1;\n\n  for (int i = n; i; --i)\n    c[fa[i]] += c[i], sz[fa[i]] += sz[i];\n  memset(f, 0x3f, sizeof f);\n  f[0] = 0;\n\n  for (int i = 1; i <= n; ++i) {\n\n    int T = min(n, d);\n    if (i == 1)\n      T = n;\n\n    for (int bit = 1; bit <= T; T -= bit, bit <<= 1)\n      for (int j = n * n * n; j >= bit * sz[i]; --j)\n        f[j] = min(f[j], f[j - bit * sz[i]] + bit * c[i]);\n\n    for (int j = n * n * n; j >= T * sz[i]; --j)\n      f[j] = min(f[j], f[j - T * sz[i]] + T * c[i]);\n\n    if (i == 1)\n      cs[i] = node(c[i], sz[i], 1e9);\n\n    else\n      cs[i] = node(c[i], sz[i], max(0ll, d - n));\n  }\n\n  sort(cs + 1, cs + n + 1);\n\n  for (int has = 0; has <= n * n * n; ++has)\n    if (f[has] <= x) {\n\n      int las = x - f[has], res = has;\n\n      for (int i = 1; i <= n; ++i) {\n\n        int now = min(cs[i].count, las / cs[i].cost);\n\n        res += now * cs[i].value;\n        las -= now * cs[i].cost;\n      }\n\n      ans = max(ans, res);\n    }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 55;\n\nint n, x, d, fa[N], c[N * N * N];\n\nstruct node\n\n{\n\n  int v, id;\n\n  long long w;\n\n  bool operator<(const node k) const\n\n  {\n\n    return v * k.w > w * k.v;\n  }\n\n} a[N];\n\nlong long dp[N * N * N], ans;\n\nint main()\n\n{\n\n  ios::sync_with_stdio();\n\n  cin >> n >> x >> d;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> a[i].w;\n\n    if (i > 1)\n\n      cin >> fa[i];\n\n    a[i].id = i;\n\n    a[i].v = 1;\n  }\n\n  for (int i = n; i >= 1; i--)\n\n  {\n\n    a[fa[i]].w += a[i].w;\n\n    a[fa[i]].v += a[i].v;\n  }\n\n  sort(a + 1, a + n + 1);\n\n  int m = min(n, d);\n\n  for (int j = 1; j <= n * n * n; j++)\n\n    dp[j] = 1e18;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    for (int j = 0; j <= n * n * n; j++)\n\n      c[j] = 0;\n\n    for (int j = 0; j <= n * n * n; j++)\n\n    {\n\n      if (c[j] == m)\n\n        continue;\n\n      if (dp[j + a[i].v] > dp[j] + a[i].w)\n\n      {\n\n        dp[j + a[i].v] = dp[j] + a[i].w;\n\n        c[j + a[i].v] = c[j] + 1;\n\n      }\n\n      else if (dp[j + a[i].v] == dp[j] + a[i].w && c[j + a[i].v] > c[j] + 1)\n\n        c[j + a[i].v] = c[j] + 1;\n    }\n  }\n\n  for (int i = 0; i <= n * n * n; i++)\n\n  {\n\n    if (dp[i] > x)\n\n      continue;\n\n    long long w = dp[i], v = i;\n\n    for (int j = 1; j <= n; j++)\n\n    {\n\n      if (a[j].id == 1)\n\n      {\n\n        long long zh = (x - w) / a[j].w;\n\n        w += zh * a[j].w, v += zh * a[j].v;\n\n        continue;\n      }\n\n      long long zh = min((long long)d - m, (x - w) / a[j].w);\n\n      w += zh * a[j].w, v += zh * a[j].v;\n    }\n\n    ans = max(ans, v);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"d893d4fc178a8305ae7c18f055616304503cf5a3ae87dd4007310a3d3d3e85d8","fast_id":"98f65eb34a57d01956b40793be88414dc5abb672e22cee61e3a2a6f5eb68c9d4","fast_time":0.0606727699,"language":"cpp","measured_fast_code_id":"98f65eb34a57d01956b40793be88414dc5abb672e22cee61e3a2a6f5eb68c9d4","measured_slow_code_id":"617f5dbb5fda78efe27192df2471b645934e4eaf7ba699c31d335eba8e5bffdc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59244","problem_id":"p03640","slow_code_id":"0423564d7fdb33942f952d3e734e047aa0663d7eaabdae6c86575b9f53a0d790","slow_id":"617f5dbb5fda78efe27192df2471b645934e4eaf7ba699c31d335eba8e5bffdc","slow_time":0.5620113133,"speedup":9.262990864374563,"stratum":"8+","sampling_key":"e0da86ce2ea390c0253443162f4f1757dd78c1e9e334e146d34cf9727c8ea222","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, j, n) for (ll i = j; i < n; i++)\n\n#define all(x) (x).begin(), (x).end()\n\n#define INF (1000000000)\n\n#define MOD (1000000007)\n\n#define MAX (500000)\n\n#define pii pair<int, int>\n\nclass XY {\n\npublic:\n  ll x, y;\n\n  XY() { x = y = 0; }\n\n  XY(ll u, ll v) {\n    x = u;\n    y = v;\n  }\n};\n\nclass e {\n\npublic:\n  ll a, b;\n\n  e() { a = b = -1; }\n\n  e(ll u, ll v) {\n    a = u;\n    b = v;\n  }\n};\n\ntemplate <typename T1, typename T2>\n\nvoid chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2>\n\nvoid chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2>\n\nll mypow(T1 a, T2 n) {\n\n  if (n == 0)\n    return 1;\n\n  if (n == 1)\n    return a;\n\n  if (n % 2)\n    return a * mypow(a, n - 1);\n\n  ll tmp = mypow(a, n / 2);\n\n  return tmp * tmp;\n}\n\ntemplate <typename T>\n\nint BS(vector<T> &V, int left, int right, T key) {\n\n  int mid = (left + right) / 2;\n\n  if (V[mid] <= key)\n    left = mid;\n\n  else\n    right = mid;\n\n  if (right - mid == 1)\n    return left;\n\n  else\n    return BS(V, left, right, key);\n}\n\nll comb(ll n, ll r) {\n\n  ll res = 1;\n\n  rep(i, 0, r) {\n\n    res *= n - i;\n\n    res /= i + 1;\n  }\n\n  return res;\n}\n\ntemplate <typename T>\n\nT euclid(T a, T b) {\n\n  if (b == 0)\n    return a;\n\n  else\n    return euclid(b, a % b);\n}\n\nvector<ll> fact(MAX, 0), fact_inv(MAX, 0);\n\nll pow_mod(ll a, ll b) {\n\n  ll res = 1;\n\n  while (b > 0) {\n\n    if (b & 1)\n      res = res * a % MOD;\n\n    a = a * a % MOD;\n\n    b >>= 1;\n  }\n\n  return res;\n}\n\nvoid prepare_comb_mod(ll n) {\n\n  fact[0] = 1LL;\n\n  for (ll i = 0; i < n; i++)\n    fact[i + 1] = fact[i] * (i + 1) % MOD;\n\n  fact_inv[n] = pow_mod(fact[n], MOD - 2);\n\n  for (ll i = n - 1; i >= 0; i--)\n    fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;\n}\n\nll comb_mod(ll n, ll r) { return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD; }\n\nvoid Main() {\n\n  int H, W, N;\n  cin >> H >> W >> N;\n\n  vector<int> A(N);\n\n  rep(i, 0, N) cin >> A[i];\n\n  vector<vector<int>> res(H, vector<int>(W, 0));\n\n  int cnt = 0;\n\n  rep(i, 0, H) {\n\n    rep(j, 0, W) {\n\n      int k;\n\n      if (i % 2)\n        k = W - j - 1;\n\n      else\n        k = j;\n\n      res[i][k] = cnt + 1;\n\n      A[cnt]--;\n\n      if (A[cnt] == 0)\n        cnt++;\n    }\n  }\n\n  rep(i, 0, H) {\n\n    rep(j, 0, W) {\n\n      cout << res[i][j];\n\n      if (j != W - 1)\n        cout << \" \";\n\n      else\n        cout << endl;\n    }\n  }\n}\n\nint main() {\n\n  cin.tie(nullptr);\n\n  ios_base::sync_with_stdio(false);\n\n  cout << std::fixed << std::setprecision(15);\n\n  Main();\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, j, n) for (int i = j; i < n; i++)\n\n#define all(x) (x).begin(), (x).end()\n\n#define pii pair<int, int>\n\n#define pll pair<ll, ll>\n\n#define vc vector\n\n#define a first\n\n#define b second\n\n#define pb push_back\n\n#define INF (1000000000)\n\n#define MOD (1000000007)\n\n#define MAX (5000000)\n\nclass XY {\n\npublic:\n  ll x, y;\n\n  XY() { x = y = 0; }\n\n  XY(ll u, ll v) {\n    x = u;\n    y = v;\n  }\n};\n\ntemplate <typename T1, typename T2>\n\nvoid chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2>\n\nvoid chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2>\n\nll mypow(T1 a, T2 n) {\n\n  if (n == 0)\n    return 1;\n\n  if (n == 1)\n    return a;\n\n  if (n % 2)\n    return a * mypow(a, n - 1);\n\n  ll tmp = mypow(a, n / 2);\n\n  return tmp * tmp;\n}\n\ntemplate <typename T>\n\nint BS(vector<T> &V, int left, int right, T key) {\n\n  int mid = (left + right) / 2;\n\n  if (V[mid] <= key)\n    left = mid;\n\n  else\n    right = mid;\n\n  if (right - mid == 1)\n    return left;\n\n  else\n    return BS(V, left, right, key);\n}\n\nll comb(ll n, ll r) {\n\n  ll res = 1;\n\n  rep(i, 0, r) {\n\n    res *= n - i;\n\n    res /= i + 1;\n  }\n\n  return res;\n}\n\ntemplate <typename T>\n\nT euclid(T a, T b) {\n\n  if (b == 0)\n    return a;\n\n  else\n    return euclid(b, a % b);\n}\n\ntemplate <class T> struct UFT {\n\n  vector<int> par;\n\n  vector<int> rank;\n\n  vector<T> diff_weight;\n\n  UFT(int n = 1, T w = 0) { init(n, w); }\n\n  void init(int n = 1, T w = 0) {\n\n    par.resize(n);\n\n    rank.resize(n);\n\n    diff_weight.resize(n);\n\n    rep(i, 0, n) {\n\n      par[i] = i;\n\n      rank[i] = 0;\n\n      diff_weight[i] = w;\n    }\n  }\n\n  int root(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n\n    } else {\n\n      int r = root(par[x]);\n\n      diff_weight[x] += diff_weight[par[x]];\n\n      return par[x] = r;\n    }\n  }\n\n  bool unite(int x, int y, int w = 0) {\n\n    w += weight(x);\n    w -= weight(y);\n\n    x = root(x);\n\n    y = root(y);\n\n    if (x == y)\n      return false;\n\n    if (rank[x] < rank[y]) {\n\n      par[x] = y;\n\n      diff_weight[x] = -w;\n\n    } else {\n\n      par[y] = x;\n\n      diff_weight[y] = w;\n\n      if (rank[x] == rank[y])\n        rank[x]++;\n    }\n\n    return true;\n  }\n\n  bool same(int x, int y) { return root(x) == root(y); }\n\n  T weight(int x) {\n\n    root(x);\n\n    return diff_weight[x];\n  }\n\n  T diff(int x, int y) { return weight(y) - weight(x); }\n};\n\nll digit(ll N) { return log10(N) + 1; }\n\nvoid Main() {\n\n  int H, W;\n  cin >> H >> W;\n\n  int N;\n  cin >> N;\n\n  vc<int> A(N);\n\n  rep(i, 0, N) cin >> A[i];\n\n  vc<vc<int>> C(H, vc<int>(W, 0));\n\n  int cur = 0;\n\n  rep(i, 0, H) {\n\n    rep(j, 0, W) {\n\n      int j_ = j;\n\n      if (i % 2 == 1)\n        j_ = W - j - 1;\n\n      C[i][j_] = cur + 1;\n\n      A[cur]--;\n\n      if (A[cur] == 0)\n        cur++;\n    }\n  }\n\n  rep(i, 0, H) {\n\n    rep(j, 0, W) {\n\n      cout << C[i][j];\n\n      if (j != W - 1)\n        cout << \" \";\n    }\n\n    cout << endl;\n  }\n}\n\nint main() {\n\n  cin.tie(nullptr);\n\n  ios_base::sync_with_stdio(false);\n\n  cout << std::fixed << std::setprecision(15);\n\n  Main();\n}\n"}
{"fast_code_id":"49ecd82d15b569d807052c1b9ce5c5b0a25dab47dfde5409259a4f4d7f7bc0d9","fast_id":"9be5e23ca709ac4db403ce7059a960d2f0eb23ef762e509660373d484ae1cdb6","fast_time":0.0518722913,"language":"cpp","measured_fast_code_id":"9be5e23ca709ac4db403ce7059a960d2f0eb23ef762e509660373d484ae1cdb6","measured_slow_code_id":"ea531e46a322a7dc246da7cc1950e478a856dd83e99218309de99b8ebeadd0d9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59256","problem_id":"p03126","slow_code_id":"5d994d3c1b19653b7af3c04c7c0d89e4ab8217ac71193badcc12e621cf861f2b","slow_id":"ea531e46a322a7dc246da7cc1950e478a856dd83e99218309de99b8ebeadd0d9","slow_time":0.4888889937,"speedup":9.424858271105522,"stratum":"8+","sampling_key":"c498748f25a8986606ddbeb9d76e5dc47424ba0ee9bb44bd0eba3e8a221f0b01","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int unsigned long long\n\nsigned main() {\n\n  int a, b, d, w, f = 0;\n\n  int c[1000][1000] = {};\n\n  int e[1000] = {};\n\n  cin >> a >> b;\n\n  w = b;\n\n  for (int i = 0; i < a; i++) {\n\n    cin >> b;\n\n    for (int j = 0; j < b; j++) {\n\n      cin >> d;\n\n      c[i][d] = 1;\n    }\n  }\n\n  for (int i = 0; i <= a; i++) {\n\n    for (int j = 0; j <= w; j++) {\n\n      e[j] += c[i][j];\n    }\n  }\n\n  for (int i = 0; i <= w; i++) {\n\n    if (e[i] == a)\n      f++;\n  }\n\n  cout << f << \"\\n\";\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define mod 1000000007\n\n#define am 998244353\n\n#define INFi 2147483647\n\n#define INFl 9223372036854775807LL\n\n#define fi first\n\n#define se second\n\n#define be begin()\n\n#define en end()\n\nint abs(int a, int b) {\n\n  int c = max(a, b) - min(a, b);\n\n  return c;\n}\n\nint gcd(int a, int b) {\n\n  int c = a % b;\n\n  while (true) {\n\n    if (c == 0)\n      break;\n\n    a = b;\n\n    b = c;\n\n    c = a % b;\n  }\n\n  return b;\n}\n\nbool IsPrime(int num) {\n\n  if (num < 2)\n    return false;\n\n  else if (num == 2)\n    return true;\n\n  else if (num % 2 == 0)\n    return false;\n\n  double sqrtNum = sqrt(num);\n\n  for (int i = 3; i <= sqrtNum; i += 2) {\n\n    if (num % i == 0) {\n\n      return false;\n    }\n  }\n}\n\nint lcm(int a, int b) { return (a * b) / gcd(a, b); }\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int a, b, d, e, q = 0;\n\n  int c[1000] = {};\n\n  cin >> a >> b;\n\n  for (int i = 0; i < a; i++) {\n\n    cin >> d;\n\n    for (int j = 0; j < d; j++) {\n\n      cin >> e;\n\n      c[e]++;\n    }\n  }\n\n  for (int i = 0; i < 50; i++) {\n\n    if (c[i] == a)\n      q++;\n  }\n\n  cout << q << \"\\n\";\n}\n"}
{"fast_code_id":"d64622d422d7816a7b88801e8985fdc6e9b17849e8889d08ae1cf3760cacc6f8","fast_id":"75eda1aa7491b6b3a87a4e7e9c980d52a95951664147c70576120286530e04ab","fast_time":0.0047349505,"language":"cpp","measured_fast_code_id":"75eda1aa7491b6b3a87a4e7e9c980d52a95951664147c70576120286530e04ab","measured_slow_code_id":"d43449ae55d700d0f61029e474bf21a987c3ffbb8a5dfeea0ea6ee0e6cb17beb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59282","problem_id":"p03987","slow_code_id":"97cd564c884612d54be895883feab586311faba6d1fa8495122fee97a011601e","slow_id":"d43449ae55d700d0f61029e474bf21a987c3ffbb8a5dfeea0ea6ee0e6cb17beb","slow_time":0.1036336464,"speedup":21.886954552112005,"stratum":"8+","sampling_key":"92e294e5a1835359386385ac6cada99ebc90885eb15e4acabbcf3fc0c5df939b","slow_code":"#include <iostream>\n\n#include <cstring>\n\nusing namespace std;\n\nlong long a[401000], stack[401000], l[401000], r[401000], s[401000];\n\nint main()\n\n{\n\n  long long n;\n\n  cin >> n;\n\n  for (long long i = 1; i <= n; i++)\n\n  {\n\n    cin >> a[i];\n\n    s[i] = s[i - 1] + a[i];\n  }\n\n  long long top = 0;\n\n  for (long long i = 1; i <= n; i++)\n\n  {\n\n    while (top && a[i] <= a[stack[top]])\n\n    {\n\n      top--;\n    }\n\n    l[i] = stack[top] + 1;\n\n    top++;\n\n    stack[top] = i;\n  }\n\n  memset(stack, 0, sizeof(stack));\n\n  top = 0;\n\n  for (long long i = n; i >= 1; i--)\n\n  {\n\n    while (top && a[i] <= a[stack[top]])\n\n    {\n\n      top--;\n    }\n\n    r[i] = stack[top] - 1;\n\n    top++;\n\n    stack[top] = i;\n  }\n\n  long long ans = 0;\n\n  for (long long i = 1; i <= n; i++)\n\n  {\n\n    long long left = l[i], right = r[i];\n\n    if (right == -1)\n      right = n;\n\n    ans += (i - left + 1) * a[i] * (right - i + 1);\n  }\n\n  cout << ans;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nconst int maxn = 2e5 + 6;\n\n#define read(a) scanf(\"%I64d\", &a)\n\n#define rep(a, b, c) for (int a = b; a <= c; a++)\n\n#define per(a, b, c) for (int a = b; a >= c; a--)\n\n#define ls rt << 1\n\n#define rs rt << 1 | 1\n\n#define mid ((l + r) >> 1)\n\n#define int long long\n\ntemplate <class T> inline T max(T a, T b) { return a > b ? a : b; }\n\ntemplate <class T> inline T min(T a, T b) { return a < b ? a : b; }\n\nint n, a[maxn], lans[maxn], rans[maxn];\n\nstruct Segment_Tree {\n\n  int val[maxn << 2];\n\n  inline void pushup(int rt) { val[rt] = max(val[ls], val[rs]); }\n\n  inline void insert(int rt, int l, int r, int k, int ch) {\n\n    if (l == r)\n      return (void)(val[rt] = ch);\n\n    if (k <= mid)\n      insert(ls, l, mid, k, ch);\n\n    else\n      insert(rs, mid + 1, r, k, ch);\n\n    pushup(rt);\n  }\n\n  inline int query(int rt, int l, int r, int L, int R) {\n\n    if (L <= l && r <= R)\n      return val[rt];\n\n    int ans = 0;\n\n    if (L <= mid)\n      ans = max(ans, query(ls, l, mid, L, R));\n\n    if (R > mid)\n      ans = max(ans, query(rs, mid + 1, r, L, R));\n\n    return ans;\n  }\n\n  inline void build(int rt, int l, int r) {\n\n    val[rt] = 0;\n    if (l == r)\n      return;\n\n    build(ls, l, mid);\n    build(rs, mid + 1, r);\n  }\n\n} t;\n\nstruct Segment_Tree_ {\n\n  int val[maxn << 2];\n\n  inline void pushup(int rt) { val[rt] = min(val[ls], val[rs]); }\n\n  inline void insert(int rt, int l, int r, int k, int ch) {\n\n    if (l == r)\n      return (void)(val[rt] = ch);\n\n    if (k <= mid)\n      insert(ls, l, mid, k, ch);\n\n    else\n      insert(rs, mid + 1, r, k, ch);\n\n    pushup(rt);\n  }\n\n  inline int query(int rt, int l, int r, int L, int R) {\n\n    if (L <= l && r <= R)\n      return val[rt];\n\n    int ans = maxn;\n\n    if (L <= mid)\n      ans = min(ans, query(ls, l, mid, L, R));\n\n    if (R > mid)\n      ans = min(ans, query(rs, mid + 1, r, L, R));\n\n    return ans;\n  }\n\n  inline void build(int rt, int l, int r) {\n\n    val[rt] = n + 1;\n    if (l == r)\n      return;\n\n    build(ls, l, mid);\n    build(rs, mid + 1, r);\n  }\n\n} T;\n\nint ans;\n\nsigned main() {\n\n  read(n);\n\n  rep(i, 1, n) read(a[i]);\n\n  rep(i, 1, n) {\n\n    t.insert(1, 1, n, a[i], i);\n\n    if (a[i] != 1)\n      lans[i] = t.query(1, 1, n, 1, a[i] - 1);\n\n    else\n      lans[i] = 0;\n  }\n\n  T.build(1, 1, n);\n\n  per(i, n, 1) {\n\n    T.insert(1, 1, n, a[i], i);\n\n    if (a[i] != 1)\n      rans[i] = T.query(1, 1, n, 1, a[i] - 1);\n\n    else\n      rans[i] = n + 1;\n  }\n\n  rep(i, 1, n) ans += (i - lans[i]) * (rans[i] - i) * a[i];\n\n  printf(\"%lld\", ans);\n}"}
{"fast_code_id":"a77af9ef3b063adc043940622b454a1bf7a5007349f645e9a37a0e0b669ed17b","fast_id":"2bb14fe5fb0d9196a09f0e2d165fbc20b13f950f80d256e32c10b250eaef77dd","fast_time":0.0193424248,"language":"cpp","measured_fast_code_id":"2bb14fe5fb0d9196a09f0e2d165fbc20b13f950f80d256e32c10b250eaef77dd","measured_slow_code_id":"fcf3104214bbef77ab27825be1db5ef294577ccd827e5293c3958f70ef29f33c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59401","problem_id":"p04038","slow_code_id":"ce8cff63b06b41749c2980cbcf431fc027cc102b38cc7798097c820a6a2a7d96","slow_id":"fcf3104214bbef77ab27825be1db5ef294577ccd827e5293c3958f70ef29f33c","slow_time":0.0885456154,"speedup":4.577792924907739,"stratum":"4-8","sampling_key":"bf17ee99b9ff58632a1a1bcee8829ff4103fd951801d348da7fa440cc19a42b1","slow_code":"#include <bits/stdc++.h>\n\n#define LL long long\n\n#define db double\n\nusing namespace std;\n\nconst int N = 2000 + 10, mod = 1e9 + 7;\n\nint rd()\n\n{\n\n  int x = 0, w = 1;\n  char ch = 0;\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      w = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = x * 10 + (ch ^ 48);\n    ch = getchar();\n  }\n\n  return x * w;\n}\n\nvoid ad(int &x, int y) { x += y, x -= x >= mod ? mod : 0; }\n\nint fpow(int a, int b) {\n  int an = 1;\n  while (b) {\n    if (b & 1)\n      an = 1ll * an * a % mod;\n    a = 1ll * a * a % mod, b >>= 1;\n  }\n  return an;\n}\n\nint ginv(int a) { return fpow(a, mod - 2); }\n\nint n, k, fac[N * N], iac[N * N], f[2][N];\n\nint C(int a, int b) { return b < 0 || a < b ? 0 : 1ll * fac[a] * iac[b] % mod * iac[a - b] % mod; }\n\nint main()\n\n{\n\n  n = rd(), k = rd();\n\n  if (k == 1) {\n    puts(\"1\");\n    exit(0);\n  }\n\n  fac[0] = 1;\n\n  for (int i = 1; i <= n * k; ++i)\n    fac[i] = 1ll * fac[i - 1] * i % mod;\n\n  iac[n * k] = ginv(fac[n * k]);\n\n  for (int i = n * k; i; --i)\n    iac[i - 1] = 1ll * iac[i] * i % mod;\n\n  int nw = 1, la = 0;\n\n  f[la][0] = 1;\n\n  for (int i = 1; i <= n + n; ++i)\n\n  {\n\n    for (int j = 0; j < i && j <= n; ++j)\n\n    {\n\n      if (!f[la][j])\n        continue;\n\n      if (j <= n)\n        ad(f[nw][j + 1], 1ll * f[la][j] * C(i - 1 + (k - 2) * (j + 1), k - 2) % mod);\n\n      if (j >= i - j)\n        ad(f[nw][j], f[la][j]);\n\n      f[la][j] = 0;\n    }\n\n    nw ^= 1, la ^= 1;\n  }\n\n  printf(\"%d\\n\", (int)(1ll * fac[n] * f[la][n] % mod));\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\n#include <memory.h>\n\ntypedef long long ll;\n\nconst ll N = 2e3 + 5;\n\nconst ll P = 1e9 + 7;\n\nll n, k;\n\nll fac[N * N];\n\nll f[N][N];\n\nll read()\n\n{\n\n  ll x = 0, f = 1;\n\n  char ch = getchar();\n\n  while ('0' > ch or ch > '9')\n\n    f = ch == '-' ? -1 : 1, ch = getchar();\n\n  while ('0' <= ch and ch <= '9')\n\n    x = x * 10 + ch - 48, ch = getchar();\n\n  return x * f;\n}\n\nll pow(ll x, ll k)\n\n{\n\n  ll res = 1;\n\n  for (x %= P; k; k >>= 1, x = x * x % P)\n\n    if (k & 1)\n\n      res = res * x % P;\n\n  return res;\n}\n\nll C(ll n, ll m) { return ((fac[n] * pow(fac[m], P - 2)) % P * pow(fac[n - m], P - 2) % P); }\n\nsigned main()\n\n{\n\n  n = read(), k = read();\n\n  if (k == 1)\n\n  {\n\n    puts(\"1\");\n\n    return 0;\n  }\n\n  fac[0] = 1;\n\n  for (ll i = 1; i <= n * k; i++)\n\n    fac[i] = fac[i - 1] * i % P;\n\n  for (ll i = 0; i <= n; i++)\n\n    f[i][0] = 1;\n\n  for (ll i = 1; i <= n; i++)\n\n    for (ll j = 1; j <= i; j++)\n\n      f[i][j] = f[i - 1][j] +\n\n                f[i][j - 1] * (n - j + 1) % P *\n\n                    C(n * k - i - (j - 1) * (k - 1) - 1, k - 2) % P;\n\n  printf(\"%lld\", f[n][n]);\n\n  return 0;\n}"}
{"fast_code_id":"e204911f701cea808ea4d63d989627f4bd71f616d80e08f710a31f3415ee1422","fast_id":"0ff687516dbcfd7771ee0058c046e1fd55bdf7f21a850da19250bdba4f8ef5d3","fast_time":0.1082042133,"language":"cpp","measured_fast_code_id":"0ff687516dbcfd7771ee0058c046e1fd55bdf7f21a850da19250bdba4f8ef5d3","measured_slow_code_id":"5680f89131e29fae01b125dc66102e282960f2731940c770597c2e7356fe3d02","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59479","problem_id":"p04000","slow_code_id":"824a6b351079ab9ae572048dea91bab82491b01c71d0d115dc8464a3579b178d","slow_id":"5680f89131e29fae01b125dc66102e282960f2731940c770597c2e7356fe3d02","slow_time":0.6875390262,"speedup":6.354087380070624,"stratum":"4-8","sampling_key":"39737f05569234c62f2bbe63493abbc718421841d8043987e184fedccbaccb39","slow_code":"\n\n#include <iostream>\n\n#include <math.h>\n\n#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <map>\n\n#include <unordered_map>\n\n#include <set>\n\n#include <deque>\n\n#include <bitset>\n\nlong long mod = 1e9 + 7;\n\nclass Mint {\n\npublic:\n  long long x;\n\n  Mint(){};\n\n  Mint(long long a) {\n\n    x = a % mod;\n\n    while (x < 0) {\n\n      x += mod;\n    }\n  };\n\n  Mint &operator+=(const Mint &a) {\n\n    x += a.x;\n\n    x %= mod;\n\n    return *this;\n  }\n\n  Mint &operator-=(const Mint &a) {\n\n    x += (mod - a.x);\n\n    x %= mod;\n\n    return *this;\n  }\n\n  Mint &operator*=(const Mint &a) {\n\n    x *= a.x;\n\n    x %= mod;\n\n    return *this;\n  }\n\n  Mint pow(Mint a, long long n) const {\n\n    Mint y(1);\n\n    Mint b(a);\n\n    while (n > 0) {\n\n      if (n & 1)\n        y *= b;\n\n      b *= b;\n\n      n >>= 1;\n    }\n\n    return y;\n  }\n\n  Mint modinv(const Mint &a) const { return pow(a, mod - 2); }\n\n  Mint &operator/=(const Mint &a) {\n\n    x *= modinv(a).x;\n\n    x %= mod;\n\n    return *this;\n  }\n\n  Mint operator+(Mint &a) const {\n\n    Mint y(*this);\n\n    y += a;\n\n    return y;\n  }\n\n  Mint operator-(Mint &a) const {\n\n    Mint y(*this);\n\n    y -= a;\n\n    return y;\n  }\n\n  Mint operator*(Mint &a) const {\n\n    Mint y(*this);\n\n    y *= a;\n\n    return y;\n  }\n\n  Mint operator/(Mint &a) const {\n\n    Mint y(*this);\n\n    y /= a;\n\n    return y.x;\n  }\n\n  Mint nCk(Mint &n, const long long k) const {\n\n    Mint y = Mint(1);\n\n    for (Mint i(0); (i.x) < k; i.x++) {\n\n      y *= (n - i);\n\n      y /= i;\n    }\n\n    return y;\n  }\n\n  Mint nPk(Mint &n, long long k) const {\n\n    Mint y(1);\n\n    for (Mint i(0); (i.x) < k; i.x++) {\n\n      y *= (n - i);\n    }\n\n    return y;\n  }\n};\n\nstruct node {\n\n  int v;\n\n  int supply;\n\n  int amari;\n};\n\nclass MyComparison {\n\npublic:\n  bool operator()(node n1, node n2) {\n\n    return (n1.supply != n2.supply) ? (n1.supply > n2.supply) : (n1.amari < n2.amari);\n  }\n};\n\nint main() {\n\n  int H, W, N;\n\n  std::cin >> H >> W >> N;\n\n  std::vector<int> a(N), b(N);\n\n  std::set<int> point[100004];\n\n  std::set<int> row;\n\n  std::map<int, int> indexmap;\n\n  std::set<std::pair<int, int> > square;\n\n  for (int i = 0; i < N; i++) {\n\n    std::cin >> a[i] >> b[i];\n\n    a[i]--;\n\n    b[i]--;\n\n    row.insert(a[i]);\n  }\n\n  int counter = 0;\n\n  for (int s : row) {\n\n    indexmap[s] = counter;\n\n    counter++;\n  }\n\n  for (int i = 0; i < N; i++) {\n\n    point[indexmap[a[i]]].insert(b[i]);\n  }\n\n  std::vector<long long> cnt(10, 0);\n\n  for (int r : row) {\n\n    for (int c : point[indexmap[r]]) {\n\n      for (int rr = std::max(1, r - 1); rr <= std::min(H - 2, r + 1); rr++) {\n\n        for (int cc = std::max(1, c - 1); cc <= std::min(W - 2, c + 1); cc++) {\n\n          square.insert(std::make_pair(rr, cc));\n        }\n      }\n    }\n  }\n\n  for (auto entry : square) {\n\n    int r = entry.first;\n\n    int c = entry.second;\n\n    int num = 0;\n\n    for (int rr = r - 1; rr <= r + 1; rr++) {\n\n      for (int cc = c - 1; cc <= c + 1; cc++) {\n\n        if (row.find(rr) != row.end()) {\n\n          if (point[indexmap[rr]].find(cc) != point[indexmap[rr]].end()) {\n\n            num++;\n          }\n        }\n      }\n    }\n\n    cnt[num]++;\n  }\n\n  long long nonzero_sum = 0;\n\n  for (int i = 1; i <= 9; i++) {\n\n    nonzero_sum += cnt[i];\n  }\n\n  cnt[0] = (long long)(H - 2) * (W - 2) - nonzero_sum;\n\n  for (int i = 0; i <= 9; i++) {\n\n    std::cout << cnt[i] << std::endl;\n  }\n\n  return 0;\n}","fast_code":"\n\n#include <iostream>\n\n#include <math.h>\n\n#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <map>\n\n#include <unordered_map>\n\n#include <set>\n\n#include <deque>\n\n#include <bitset>\n\nlong long mod = 1e9 + 7;\n\nclass Mint {\n\npublic:\n  long long x;\n\n  Mint() {};\n\n  Mint(long long a) {\n\n    x = a % mod;\n\n    while (x < 0) {\n\n      x += mod;\n    }\n  };\n\n  Mint &operator+=(const Mint &a) {\n\n    x += a.x;\n\n    x %= mod;\n\n    return *this;\n  }\n\n  Mint &operator-=(const Mint &a) {\n\n    x += (mod - a.x);\n\n    x %= mod;\n\n    return *this;\n  }\n\n  Mint &operator*=(const Mint &a) {\n\n    x *= a.x;\n\n    x %= mod;\n\n    return *this;\n  }\n\n  Mint pow(Mint a, long long n) const {\n\n    Mint y(1);\n\n    Mint b(a);\n\n    while (n > 0) {\n\n      if (n & 1)\n        y *= b;\n\n      b *= b;\n\n      n >>= 1;\n    }\n\n    return y;\n  }\n\n  Mint modinv(const Mint &a) const { return pow(a, mod - 2); }\n\n  Mint &operator/=(const Mint &a) {\n\n    x *= modinv(a).x;\n\n    x %= mod;\n\n    return *this;\n  }\n\n  Mint operator+(Mint &a) const {\n\n    Mint y(*this);\n\n    y += a;\n\n    return y;\n  }\n\n  Mint operator-(Mint &a) const {\n\n    Mint y(*this);\n\n    y -= a;\n\n    return y;\n  }\n\n  Mint operator*(Mint &a) const {\n\n    Mint y(*this);\n\n    y *= a;\n\n    return y;\n  }\n\n  Mint operator/(Mint &a) const {\n\n    Mint y(*this);\n\n    y /= a;\n\n    return y.x;\n  }\n\n  Mint nCk(Mint &n, const long long k) const {\n\n    Mint y = Mint(1);\n\n    for (Mint i(0); (i.x) < k; i.x++) {\n\n      y *= (n - i);\n\n      y /= i;\n    }\n\n    return y;\n  }\n\n  Mint nPk(Mint &n, long long k) const {\n\n    Mint y(1);\n\n    for (Mint i(0); (i.x) < k; i.x++) {\n\n      y *= (n - i);\n    }\n\n    return y;\n  }\n};\n\nstruct node {\n\n  int v;\n\n  int supply;\n\n  int amari;\n};\n\nclass MyComparison {\n\npublic:\n  bool operator()(node n1, node n2) {\n\n    return (n1.supply != n2.supply) ? (n1.supply > n2.supply)\n                                    : (n1.amari < n2.amari);\n  }\n};\n\nint main() {\n\n  int H, W, N;\n\n  std::cin >> H >> W >> N;\n\n  std::vector<int> a(N), b(N);\n\n  std::vector<std::pair<int, int>> point;\n\n  for (int i = 0; i < N; i++) {\n\n    std::cin >> a[i] >> b[i];\n\n    a[i]--;\n\n    b[i]--;\n\n    for (int j = std::max(1, a[i] - 1); j <= std::min(H - 2, a[i] + 1); j++) {\n\n      for (int k = std::max(1, b[i] - 1); k <= std::min(W - 2, b[i] + 1); k++) {\n\n        point.push_back(std::make_pair(j, k));\n      }\n    }\n  }\n\n  std::vector<long long> cnt(10, 0);\n\n  std::sort(point.begin(), point.end());\n\n  if (point.size() == 0) {\n\n    printf(\"%lld\\n\", (long long)(H - 2) * (W - 2));\n\n    for (int i = 1; i <= 9; i++) {\n\n      printf(\"0\\n\");\n    }\n\n    return 0;\n  }\n\n  int prev1 = point[0].first;\n\n  int prev2 = point[0].second;\n\n  int counter = 0;\n\n  for (auto entry : point) {\n\n    if ((prev1 == entry.first) && (prev2 == entry.second)) {\n\n      counter++;\n\n    } else {\n\n      cnt[counter]++;\n\n      prev1 = entry.first;\n\n      prev2 = entry.second;\n\n      counter = 1;\n    }\n  }\n\n  cnt[counter]++;\n\n  long long nonzero_sum = 0;\n\n  for (int i = 1; i <= 9; i++) {\n\n    nonzero_sum += cnt[i];\n  }\n\n  cnt[0] = (long long)(H - 2) * (W - 2) - nonzero_sum;\n\n  for (int i = 0; i <= 9; i++) {\n\n    std::cout << cnt[i] << std::endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"a5388764d739b862afde98787fe965066c462cc6c0ddf92b0f9104c478a712b2","fast_id":"2efb9b708bf5fc4f477dae3640b08a72b512628fd0f833b0ca97b13869dfd4d5","fast_time":0.0173571921,"language":"cpp","measured_fast_code_id":"2efb9b708bf5fc4f477dae3640b08a72b512628fd0f833b0ca97b13869dfd4d5","measured_slow_code_id":"47d3c6a4cdfcfc1f6436849119a08fb17422a6dc72c76709a0f65397f5caf297","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_596","problem_id":"p03086","slow_code_id":"9bc1284376ca0e9fcc86ac30951f9d30846dfeb8511a04883281f736e8d5e686","slow_id":"47d3c6a4cdfcfc1f6436849119a08fb17422a6dc72c76709a0f65397f5caf297","slow_time":0.1096879684,"speedup":6.319453501929037,"stratum":"4-8","sampling_key":"783742d682245f93b4c42e6cd5676df88e12d6b97e0d79dd6daebbf527b5b44a","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <regex>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  string s;\n\n  cin >> s;\n\n  int res = 0;\n\n  smatch m;\n\n  for (auto it = cbegin(s); regex_search(it, cend(s), m, regex(\"[ACGT]+\"));\n       it = m[0].second)\n\n    res = max<int>(res, m.str().size());\n\n  cout << res << endl;\n}","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  char s[16], d[26];\n\n  scanf(\"%s\", s);\n\n  for (char *p = d, c = 'A'; c <= 'Z'; ++c)\n    if (!strchr(\"ACGT\", c))\n      *p++ = c;\n\n  int res = 0;\n\n  for (char *p = strtok(s, d); p; p = strtok(NULL, d))\n    res = max(res, (int)strlen(p));\n\n  printf(\"%d\\n\", res);\n}"}
{"fast_code_id":"6501e9107e6223e23548922d18d85381381d6f9740743610555df9211c89bcc9","fast_id":"3b360a96a7eb043c8e3662eb1052ff897e927cb86d3345be2d45feb9f658861f","fast_time":0.0198583228,"language":"cpp","measured_fast_code_id":"3b360a96a7eb043c8e3662eb1052ff897e927cb86d3345be2d45feb9f658861f","measured_slow_code_id":"ccddfcb1c438cda8882c625572796ee7fcba33bbd8ea153aeb47bdbada4ec41c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59683","problem_id":"p02258","slow_code_id":"97d0961bb399c05803a587dcbfa183170ccdc36e2bdd265f7bfb39668ba8da73","slow_id":"ccddfcb1c438cda8882c625572796ee7fcba33bbd8ea153aeb47bdbada4ec41c","slow_time":0.1905397666,"speedup":9.594957666817661,"stratum":"8+","sampling_key":"a3b957000e9ba699f386dcc20e7ddff480a0833173eda05f5072a11359d1453f","slow_code":"#include <stdio.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  long int arr[200010] = {0};\n\n  long int arrmin;\n\n  long int dmax;\n\n  int n = 0;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%ld\", &arr[i]);\n\n    if (i == 0) {\n\n      arrmin = arr[0];\n\n      continue;\n    }\n\n    if (i == 1)\n      dmax = arr[1] - arr[0];\n\n    if (arr[i - 1] <= arr[i]) {\n\n      dmax = max(arr[i] - arrmin, dmax);\n\n    } else {\n\n      arrmin = min(arr[i], arrmin);\n    }\n  }\n\n  printf(\"%ld\\n\", dmax);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int minv;\n\n  int dmax = -2000000000;\n\n  int var;\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  scanf(\"%d\", &minv);\n\n  for (int i = 1; i < n; i++) {\n\n    scanf(\"%d\", &var);\n\n    dmax = max(var - minv, dmax);\n\n    minv = min(var, minv);\n  }\n\n  printf(\"%d\\n\", dmax);\n\n  return 0;\n}\n"}
{"fast_code_id":"73b24c9fc2bcf6ecedcb06a7096ebbadff848b44ca4d082421a349a65919726e","fast_id":"8b08109a7159d6dda6237f252fb5564c7f4d64f8af3b96371493f2035ace461f","fast_time":0.1069108887,"language":"cpp","measured_fast_code_id":"8b08109a7159d6dda6237f252fb5564c7f4d64f8af3b96371493f2035ace461f","measured_slow_code_id":"fdc2cf795520741535638c3949499821cb08159f38e9f28c083857ec3def1bcb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59761","problem_id":"p01511","slow_code_id":"2ddcf2f2a3239f827e2bb17b4b697b063374f18026986c14c9875d412fe4d0a1","slow_id":"fdc2cf795520741535638c3949499821cb08159f38e9f28c083857ec3def1bcb","slow_time":0.243252877,"speedup":2.275286268385495,"stratum":"2-4","sampling_key":"fcb9fe57ef80bd4e01d243320596a1f95dca1ab0b903c549568b5d8a0cfe6928","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cstdlib>\n\n#include <cmath>\n\nusing namespace std;\n\n#define MOD 1000000009\n\nlong long w, h, n;\n\nstruct Matrix {\n\n  long long n, m[80][80];\n\n  Matrix operator*(const Matrix &b) const {\n\n    Matrix c;\n\n    memset(c.m, 0, sizeof c.m);\n\n    c.n = n;\n\n    for (int i = 0; i < n; i++)\n\n      for (int j = 0; j < n; j++)\n\n        for (int k = 0; k < n; k++) {\n\n          c.m[i][j] = (c.m[i][j] + (m[i][k] * b.m[k][j]) % MOD) % MOD;\n        }\n\n    return c;\n  }\n};\n\nMatrix ones;\n\nMatrix Pow(const Matrix &a, unsigned long long n) {\n\n  Matrix t = ones, y = a;\n\n  while (n) {\n\n    if (n & 1)\n      t = (t * y);\n\n    y = (y * y);\n\n    n /= 2;\n  }\n\n  return t;\n}\n\nMatrix A;\n\nlong long x[80];\n\nlong long k, p, q;\n\nstruct node {\n\n  long long a, b;\n};\n\nnode Pos[80];\n\nint cmp(node a, node b) { return a.b < b.b; }\n\nvoid get_x(Matrix a) {\n\n  long long y[80];\n\n  memset(y, 0, sizeof y);\n\n  for (int i = 0; i < a.n; i++) {\n\n    for (int j = 0; j < a.n; j++) {\n\n      y[i] = (y[i] + (x[j] * a.m[i][j]) % MOD) % MOD;\n    }\n  }\n\n  for (int i = 0; i < a.n; i++)\n\n    x[i] = y[i];\n}\n\nint main() {\n\n  int i, j;\n\n  int d = 0;\n\n  while (scanf(\"%lld%lld%lld\", &w, &h, &n) != EOF) {\n\n    memset(ones.m, 0, sizeof ones.m);\n\n    for (i = 0; i < w; i++)\n\n      ones.m[i][i] = 1;\n\n    ones.n = w;\n\n    for (i = 0; i < n; i++)\n\n      scanf(\"%lld%lld\", &Pos[i].a, &Pos[i].b);\n\n    sort(Pos, Pos + n, cmp);\n\n    if ((w == 0) && (h == 0) && (n == 0))\n      return 0;\n\n    memset(x, 0, sizeof x);\n\n    x[0] = 1;\n\n    memset(A.m, 0, sizeof A.m);\n\n    A.n = w;\n\n    A.m[0][0] = 1;\n\n    A.m[0][1] = 1;\n\n    for (i = 1; i < w; i++) {\n\n      A.m[i][i] = 1;\n\n      A.m[i][i - 1] = 1;\n\n      A.m[i][i + 1] = 1;\n    }\n\n    k = 0;\n\n    j = 0;\n\n    while (j < n) {\n\n      p = Pos[j].b - 1;\n\n      if (p == k) {\n\n        x[Pos[j].a - 1] = 0;\n\n      }\n\n      else {\n\n        get_x(Pow(A, p - k));\n\n        k = p;\n\n        x[Pos[j].a - 1] = 0;\n      }\n\n      j++;\n    }\n\n    if (k < h - 1) {\n\n      get_x(Pow(A, h - 1 - k));\n    }\n\n    printf(\"Case %d: %lld\\n\", ++d, x[w - 1]);\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n\n#define ALL(x) (x).begin(), (x).end()\n\nusing namespace std;\n\nusing ll = long long;\n\nusing ld = long double;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\n\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\n\ntemplate <int M>\n\nclass Modulo {\n\n  using ll = long long;\n\n  int n;\n\npublic:\n  Modulo() : n(0) { ; }\n\n  Modulo(int m) : n(m) {\n\n    if (n >= M)\n      n %= M;\n\n    else if (n < 0)\n      n = (n % M + M) % M;\n  }\n\n  Modulo(ll m) {\n\n    if (m >= M)\n      m %= M;\n\n    else if (m < 0)\n      m = (m % M + M) % M;\n\n    n = m;\n  }\n\n  explicit operator int() const { return n; }\n\n  explicit operator ll() const { return n; }\n\n  bool operator==(const Modulo &a) const { return n == a.n; }\n\n  Modulo operator+=(const Modulo &a) {\n    n += a.n;\n    if (n >= M)\n      n -= M;\n    return *this;\n  }\n\n  Modulo operator-=(const Modulo &a) {\n    n -= a.n;\n    if (n < 0)\n      n += M;\n    return *this;\n  }\n\n  Modulo operator*=(const Modulo &a) {\n    n = (ll(n) * a.n) % M;\n    return *this;\n  }\n\n  Modulo operator+(const Modulo &a) const {\n    Modulo res = *this;\n    return res += a;\n  }\n\n  Modulo operator-(const Modulo &a) const {\n    Modulo res = *this;\n    return res -= a;\n  }\n\n  Modulo operator*(const Modulo &a) const {\n    Modulo res = *this;\n    return res *= a;\n  }\n};\n\nconst int mod = 1000000009;\n\nusing Mod = Modulo<mod>;\n\ntemplate <typename T> using Matrix = vector<vector<T>>;\n\ntemplate <typename T>\n\nT dot(const vector<T> &a, const vector<T> &b) {\n\n  return inner_product(begin(a), end(a), begin(b), T(0));\n}\n\ntemplate <typename T>\n\nMatrix<T> transpose(const Matrix<T> &A) {\n\n  const int n = A[0].size(), m = A.size();\n\n  Matrix<T> res(n, vector<T>(m, 0));\n\n  for (int i = 0; i < n; ++i)\n\n    for (int j = 0; j < m; ++j)\n\n      res[i][j] = A[j][i];\n\n  return res;\n}\n\ntemplate <typename T>\n\nMatrix<T> operator*(const Matrix<T> &a, Matrix<T> b) {\n\n  b = transpose(b);\n\n  const int n = a.size(), m = b.size();\n\n  assert(a[0].size() == b[0].size());\n\n  Matrix<T> res(n, vector<T>(m));\n\n  for (int i = 0; i < n; ++i)\n\n    for (int j = 0; j < m; ++j)\n\n      res[i][j] = dot(a[i], b[j]);\n\n  return res;\n}\n\ntemplate <typename T>\n\nMatrix<T> powmat(const Matrix<T> &a, ll n) {\n\n  if (n == 0) {\n\n    const int n = a.size();\n\n    Matrix<T> res(n, vector<T>(n, 0));\n\n    REP(i, n) res[i][i] = Mod(1);\n\n    return res;\n\n  }\n\n  else {\n\n    if (n % 2)\n      return powmat(a, n - 1) * a;\n\n    return powmat(a * a, n / 2);\n  }\n}\n\nint main() {\n\n  ll W, H, N;\n\n  for (int cas = 1; cin >> W >> H >> N, W; ++cas) {\n\n    Matrix<Mod> next(W, vector<Mod>(W, 0));\n\n    REP(i, W) REP(j, W) {\n\n      if (abs(i - j) <= 1)\n        next[i][j] = 1;\n    }\n\n    vector<pair<ll, ll>> obstacles;\n\n    REP(i, N) {\n\n      ll x, y;\n\n      cin >> x >> y;\n\n      obstacles.emplace_back(y - 1, x - 1);\n    }\n\n    sort(ALL(obstacles));\n\n    Matrix<Mod> vec(W, vector<Mod>(1, 0));\n\n    vec[0][0] = 1;\n\n    ll prev = 0;\n\n    for (auto p : obstacles) {\n\n      ll y, x;\n\n      tie(y, x) = p;\n\n      vec = powmat(next, y - prev) * vec;\n\n      vec[x][0] = 0;\n\n      prev = y;\n    }\n\n    vec = powmat(next, H - 1 - prev) * vec;\n\n    printf(\"Case %d: %d\\n\", cas, int(vec[W - 1][0]));\n  }\n\n  return 0;\n}"}
{"fast_code_id":"df1df73162c1de03beca6c20976a3f2a50aa6b6eb7b93f75e4795e4484e2af4d","fast_id":"fcf84d21d7787a758c8665c16b6c9bebc46f20a616d4853aa00af1264883e65f","fast_time":0.0110084583,"language":"cpp","measured_fast_code_id":"fcf84d21d7787a758c8665c16b6c9bebc46f20a616d4853aa00af1264883e65f","measured_slow_code_id":"00235776978a9684f311d5105fd60d5abce7b64e4da6d6578b975244fc7034a1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59817","problem_id":"p03680","slow_code_id":"46f4890d71b049dd71608abe40a38ec54d8251a0a03b0ffd94b86b9865b4d65e","slow_id":"00235776978a9684f311d5105fd60d5abce7b64e4da6d6578b975244fc7034a1","slow_time":0.2861044589,"speedup":25.98951198279963,"stratum":"8+","sampling_key":"e2244391e2c0da406c42d48eb5f8babfdcbdd0302bdbff65841d581662e3bd53","slow_code":"#include <iostream>\n\n#include <set>\n\nusing namespace std;\n\nstruct A {\n\n  int is = 0;\n\n  int num;\n\n} pp[500000];\n\nint main() {\n\n  pp[1].is = 1;\n\n  int n, i, y = 0;\n\n  cin >> n;\n\n  for (i = 1; i <= n; i++) {\n\n    cin >> pp[i].num;\n  }\n\n  int Count = 0, t = 1;\n\n  while (pp[2].is != 1) {\n\n    pp[t].is = 1;\n\n    t = pp[t].num;\n\n    Count++;\n\n    if (Count > 200000) {\n\n      cout << -1 << endl;\n\n      y = 1;\n\n      break;\n    }\n  }\n\n  if (!y) {\n\n    cout << Count - 1 << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int N;\n\n  scanf(\"%d\", &N);\n\n  int time = 0;\n\n  int a[100000];\n\n  int i;\n\n  int x = 0;\n\n  for (i = 0; i <= N - 1; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n\n    if (a[i] == 2)\n\n    {\n\n      x = 1;\n    }\n  }\n\n  if (x == 1)\n\n  {\n\n    int t = 0;\n\n    while (t != 1)\n\n    {\n\n      t = a[t] - 1;\n\n      time += 1;\n\n      if (time > N - 1)\n\n      {\n\n        printf(\"-1\");\n\n        return 0;\n      }\n    }\n\n    printf(\"%d\", time);\n\n  }\n\n  else\n\n  {\n\n    printf(\"-1\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"fdfd590e2fd4560e1bb24f8675cb11af0155e262b25396d7a0a9e1285b992aa2","fast_id":"3bb872db2d293784c3c1745b0dba453b006b94c4b54945f125fb05ef18831bbe","fast_time":0.0038556715,"language":"cpp","measured_fast_code_id":"3bb872db2d293784c3c1745b0dba453b006b94c4b54945f125fb05ef18831bbe","measured_slow_code_id":"4cfd9882ffac5ab3a854be335d979622424c1914f757024933e1ece3f67ddb4e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59861","problem_id":"p03458","slow_code_id":"a680825a14e545d5af3a4bc7a480977324bc59eae3032610ac70a0bae4fafcf4","slow_id":"4cfd9882ffac5ab3a854be335d979622424c1914f757024933e1ece3f67ddb4e","slow_time":0.0403839916,"speedup":10.473919160384904,"stratum":"8+","sampling_key":"6f0c430f539e395bc89bf1c2b3e33eb13b69444833b89a6e9c0977db22cdd67c","slow_code":"#include <set>\n\n#include <cstdio>\n\n#include <queue>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nlong long read() {\n\n  long long f = 1, x = 0;\n\n  char c = getchar();\n\n  while (c < '0' || '9' < c) {\n    if (c == '-')\n      f = -1;\n    c = getchar();\n  }\n\n  while ('0' <= c && c <= '9') {\n    x = x * 10 + c - '0';\n    c = getchar();\n  }\n\n  return f * x;\n}\n\n#define MAXN 100000\n\nstruct node {\n\n  int x, y;\n\n  bool color;\n\n} wish[MAXN + 5];\n\nint fit[MAXN + 5], unfit[MAXN + 5];\n\nint main() {\n\n  char c;\n\n  int n = read(), k = read(), tmp, ans = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    wish[i].x = read() % (2 * k), wish[i].y = read() % (2 * k), c = getchar();\n\n    if (c == 'W')\n\n      wish[i].color = 1;\n\n    else\n\n      wish[i].color = 0;\n  }\n\n  for (int x = 0; x <= k; x++)\n\n  {\n\n    tmp = 0;\n\n    memset(fit, 0, sizeof fit);\n\n    memset(unfit, 0, sizeof unfit);\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      int p = (x <= wish[i].x && wish[i].x < x + k),\n\n          q = (0 <= wish[i].y && wish[i].y < k);\n\n      if ((p ^ q) == wish[i].color)\n\n      {\n\n        tmp++;\n\n        fit[wish[i].y]++;\n\n      }\n\n      else\n\n        unfit[wish[i].y]++;\n    }\n\n    for (int i = 0; i <= k; i++)\n\n    {\n\n      if (tmp > ans)\n        ans = tmp;\n\n      if (n - tmp > ans)\n        ans = n - tmp;\n\n      if (i != k)\n\n        tmp = tmp - fit[i] + unfit[i] - fit[i + k] + unfit[i + k];\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define MAXN 100006\n\n#define MAXK 2006\n\nusing namespace std;\n\nint n, k;\n\nchar c;\n\nint map[MAXK][MAXK], a, b, black, maxone, minone = MAXN;\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &k);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d%d %c\", &a, &b, &c);\n\n    black = 0;\n\n    if (c == 'B')\n      black = 1;\n\n    a %= k * 2;\n\n    b %= k * 2;\n\n    if (a >= k)\n\n    {\n\n      a %= k;\n\n      black ^= 1;\n    }\n\n    if (b >= k)\n\n    {\n\n      b %= k;\n\n      black ^= 1;\n    }\n\n    if (black)\n\n    {\n\n      map[a][k - 1] += 1;\n\n      map[k - 1][b - 1] += 1;\n\n      map[a][b - 1] -= 2;\n\n    }\n\n    else\n\n    {\n\n      map[k - 1][k - 1] += 1;\n\n      map[a][k - 1] -= 1;\n\n      map[k - 1][b - 1] -= 1;\n\n      map[a][b - 1] += 2;\n    }\n  }\n\n  for (int i = k - 1; i >= 0; i--)\n\n    for (int j = k - 1; j >= 0; j--)\n\n    {\n\n      map[i][j] += map[i + 1][j] + map[i][j + 1] - map[i + 1][j + 1];\n\n      maxone = max(maxone, map[i][j]);\n\n      minone = min(minone, map[i][j]);\n    }\n\n  printf(\"%d\", max(maxone, (n - minone)));\n}"}
{"fast_code_id":"17ff7c35cf6dbc22027d5b53b61a14ab312ec04d1e9554dbe82a29533d0347c6","fast_id":"e5c16b3e1cc2dfe61d28537c985e4d84cf2444f6314017b094b001134cca199b","fast_time":0.0264001037,"language":"cpp","measured_fast_code_id":"e5c16b3e1cc2dfe61d28537c985e4d84cf2444f6314017b094b001134cca199b","measured_slow_code_id":"cf61077cc48b59595e02dcf3eee8b718acd80a7694b5b3f7cfa983815b5efb81","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59879","problem_id":"p02930","slow_code_id":"e8d649c9ccf2d904436b332a1da74e06ccd9b3fe11341257b1a56222f74accf3","slow_id":"cf61077cc48b59595e02dcf3eee8b718acd80a7694b5b3f7cfa983815b5efb81","slow_time":0.0837349038,"speedup":3.171764200305016,"stratum":"2-4","sampling_key":"93d6d2d817ba75a587ca45e49fbb64fbd8d45ad83031835088d778d481bc4df3","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (a); i < (b); i++)\n\nint G[505][505], n;\n\nvoid solve(int l, int r, int t) {\n\n  if (l + 1 == r)\n    return;\n\n  int m = (l + r) / 2;\n\n  rep(i, l, m) rep(j, m, r) G[i][j] = t;\n\n  solve(l, m, t + 1);\n  solve(m, r, t + 1);\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  solve(0, n, 1);\n\n  rep(i, 0, n) rep(j, i + 1, n) printf(\"%d%c\", G[i][j], j == n - 1 ? '\\n' : ' ');\n}","fast_code":"#include <cstdio>\n\nint n, i;\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (; n--;)\n    for (i = n; i--;)\n      printf(\"%d%c\", __builtin_ffs(n ^ i), i ? ' ' : '\\n');\n}"}
{"fast_code_id":"3a8ab2c1b712bc8bf593bcd29235157b3919b064932fed6db81833ac156acdc4","fast_id":"6844faa5f6ff931b19b6ee44615aaffff97a38610a72a81549956c587f9f358c","fast_time":0.01985609,"language":"cpp","measured_fast_code_id":"6844faa5f6ff931b19b6ee44615aaffff97a38610a72a81549956c587f9f358c","measured_slow_code_id":"8d6fdc74a8484280c14fb215a0f762b4a4e2982d0006fe2015229a1ebfdb4ac2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59887","problem_id":"p02235","slow_code_id":"bc518a86649185fcb2edcedfbff14fc8a934c97fb5e46398726ff7955e27029b","slow_id":"8d6fdc74a8484280c14fb215a0f762b4a4e2982d0006fe2015229a1ebfdb4ac2","slow_time":1.4191927035,"speedup":71.47392580815256,"stratum":"8+","sampling_key":"6f3f029d8c24eadc7611d900daf3dd3513008587c9e3ea556cf8c73136fe7f91","slow_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\nconst int maxn = 1000 + 5;\n\nint dp[maxn][maxn];\n\nchar x[maxn];\n\nchar y[maxn];\n\nint main()\n\n{\n\n  int q;\n\n  scanf(\"%d\", &q);\n\n  while (q--)\n\n  {\n\n    scanf(\"%s %s\", x + 1, y + 1);\n\n    memset(dp, 0, sizeof(dp));\n\n    int m = strlen(x + 1);\n\n    int n = strlen(y + 1);\n\n    for (int i = 1; i <= m; i++)\n\n      for (int j = 1; j <= n; j++)\n\n      {\n\n        if (x[i] == y[j])\n\n          dp[i][j] = dp[i - 1][j - 1] + 1;\n\n        else\n\n          dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n      }\n\n    printf(\"%d\\n\", dp[m][n]);\n  }\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#define N 1010\n\nchar a[N];\n\nchar b[N];\n\nint dp[N][N];\n\nint main() {\n\n  int k;\n\n  scanf(\"%d\", &k);\n\n  while (k--) {\n\n    scanf(\"%s\", a);\n\n    scanf(\"%s\", b);\n\n    int n = strlen(a);\n\n    int m = strlen(b);\n\n    for (int i = n - 1; i >= 0; i--)\n      a[i + 1] = a[i];\n\n    for (int i = m - 1; i >= 0; i--)\n      b[i + 1] = b[i];\n\n    int max = n > m ? n : m;\n\n    for (int i = 0; i <= max; i++)\n      dp[0][i] = dp[i][0] = 0;\n\n    for (int i = 1; i <= n; i++) {\n\n      for (int j = 1; j <= m; j++) {\n\n        if (a[i] == b[j])\n          dp[i][j] = dp[i - 1][j - 1] + 1;\n\n        else {\n\n          dp[i][j] = dp[i - 1][j] > dp[i][j - 1] ? dp[i - 1][j] : dp[i][j - 1];\n        }\n      }\n    }\n\n    printf(\"%d\\n\", dp[n][m]);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"f4c452f3add2d9ae30891664da7181a7f70559914bdf8074295d649147629bfa","fast_id":"9dd9e76caf10e9ebee9bcbd39cca1f0d48f517e35770cb3a23dd2bd9160130e8","fast_time":0.1011779543,"language":"cpp","measured_fast_code_id":"9dd9e76caf10e9ebee9bcbd39cca1f0d48f517e35770cb3a23dd2bd9160130e8","measured_slow_code_id":"cbef41c30a004b23bc2e9d24512054872acab0bd7e6d82984cfe615658bd42d9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59901","problem_id":"p02558","slow_code_id":"2f17680c38c9f34f2bfa24dce217cb1249c25167f14c9c855c8682b2722b9648","slow_id":"cbef41c30a004b23bc2e9d24512054872acab0bd7e6d82984cfe615658bd42d9","slow_time":0.6652785456,"speedup":6.575331061027392,"stratum":"4-8","sampling_key":"493913169a18af5d68fd8ece94ebeb03cae18b27aab52628ef86661ea46213d2","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define pii pair<int, int>\n\n#define pll pair<long long, long long>\n\n#define fi first\n\n#define se second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define DEBUG 1\n\n#define cerr                                                                                       \\\n  if (DEBUG)                                                                                       \\\n  cerr\n\n#define test cerr << \"hi\\n\";\n\n#define INF 0x3f3f3f3f3f3f3f3f\n\n#define MAXN 200005\n\n#define MOD 1000000007LL\n\nint n, m;\n\nvector<pair<pii, int> > games;\n\nint p[MAXN], col[MAXN];\n\nvector<int> v[MAXN];\n\nvoid join(int x, int y, int st) {\n\n  x = p[x], y = p[y];\n\n  if (x == y)\n    return;\n\n  if (v[x].size() < v[y].size())\n\n    swap(x, y);\n\n  int col_shift = col[x] + st + 3 - col[y];\n\n  int src = p[y];\n\n  for (int i = 0; i < v[src].size(); i++) {\n\n    int q = v[src][i];\n\n    p[q] = p[x];\n\n    v[p[x]].pb(q);\n\n    (col[q] += col_shift) %= 3;\n  }\n\n  v[src].clear();\n}\n\nint work(int go) {\n\n  for (int i = 0; i < n; i++) {\n\n    p[i] = i;\n\n    v[i].clear();\n\n    v[i].pb(i);\n\n    col[i] = 0;\n  }\n\n  for (int i = 0; i < m; i++) {\n\n    int u, v, st;\n\n    u = games[i].fi.fi;\n\n    v = games[i].fi.se;\n\n    st = games[i].se;\n\n    if (u == go or v == go)\n\n      continue;\n\n    if (p[u] != p[v]) {\n\n      join(u, v, st);\n\n    }\n\n    else {\n\n      if ((col[u] + st) % 3 != col[v])\n\n        return i;\n    }\n  }\n\n  return -1;\n}\n\nint val[255];\n\nint q;\n\nvoid solve() {\n\n  cin >> n >> q;\n\n  iota(p + 1, p + 1 + n, 1);\n\n  for (int i = 0; i <= n; i++)\n\n    v[i].pb(i);\n\n  while (q--) {\n\n    int t, u, v;\n\n    cin >> t >> u >> v;\n\n    if (t == 0) {\n\n      join(u, v, 0);\n    }\n\n    if (t == 1) {\n\n      cout << (p[u] == p[v]) << '\\n';\n    }\n  }\n}\n\nint main() {\n\n#ifdef LOCAL\n\n  freopen(\"input.txt\", \"r\", stdin);\n\n  auto start_time = clock();\n\n#endif\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  int t = 1;\n\n  for (int no = 1; no <= t; no++) {\n\n    solve();\n  }\n\n#ifdef LOCAL\n\n  cerr << \"TIME ELAPSED: \" << double(clock() - start_time) / CLOCKS_PER_SEC << '\\n';\n\n#endif\n}","fast_code":"#include <iostream>\n\nusing namespace std;\n\nint N, Q;\n\nint root[200005];\n\nint find(int idx) {\n\n  if (idx == root[idx])\n\n    return idx;\n\n  int pidx = root[idx];\n\n  root[idx] = find(pidx);\n\n  return root[idx];\n}\n\nvoid join(int u, int v) {\n\n  int ru = find(u);\n\n  int rv = find(v);\n\n  root[rv] = ru;\n}\n\nint main() {\n\n  scanf(\"%d%d\", &N, &Q);\n\n  for (int i = 0; i <= N; ++i)\n\n    root[i] = i;\n\n  for (int i = 0; i < Q; ++i) {\n\n    int t, u, v;\n\n    scanf(\"%d%d%d\", &t, &u, &v);\n\n    if (t == 0) {\n\n      join(u, v);\n\n    } else {\n\n      int ru = find(u);\n\n      int rv = find(v);\n\n      printf(\"%d\\n\", (ru == rv) ? 1 : 0);\n    }\n  }\n}"}
{"fast_code_id":"def37f99e0aa74c10eccc675cf3a902eb96cc606e5ea43fcfab284c7cca26ca5","fast_id":"8a09b0769513acf5029bc84297f51e6fee0a38e9929c79166440bdffaebc92d3","fast_time":0.043601302,"language":"cpp","measured_fast_code_id":"8a09b0769513acf5029bc84297f51e6fee0a38e9929c79166440bdffaebc92d3","measured_slow_code_id":"16745234bb0c2dcb17356f9924b537ea1ca760141e888886e4a47c7dbe19c122","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59912","problem_id":"p03712","slow_code_id":"b17941c003e71d348caf1cb495d11b58e056f027304a8761340a2b906dcbfe94","slow_id":"16745234bb0c2dcb17356f9924b537ea1ca760141e888886e4a47c7dbe19c122","slow_time":0.3568542792,"speedup":8.184486766014464,"stratum":"8+","sampling_key":"020d638c3bbb60644e01b3587e41452ad348f99e72a9b0f611efd6ed44c349c2","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long int\n\n#define sz 200010\n\nusing namespace std;\n\nstring ss[sz];\n\nint main()\n\n{\n\n  string x = \"\";\n\n  ll h, w, i, j, k, p, a, b;\n\n  cin >> h >> w;\n\n  for (i = 1; i <= h; i++)\n    cin >> ss[i];\n\n  for (i = 1; i <= w + 2; i++)\n    x += \"#\";\n\n  cout << x << endl;\n\n  for (i = 1; i <= h; i++)\n\n  {\n\n    cout << \"#\" << ss[i] << \"#\" << endl;\n  }\n\n  cout << x << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define bye return 0\n\n#define Yes                                                                                        \\\n  cout << \"Yes\"                                                                                    \\\n       << \"\\n\"\n\n#define No                                                                                         \\\n  cout << \"No\"                                                                                     \\\n       << \"\\n\"\n\n#define YES                                                                                        \\\n  cout << \"YES\"                                                                                    \\\n       << \"\\n\"\n\n#define NO                                                                                         \\\n  cout << \"NO\"                                                                                     \\\n       << \"\\n\"\n\nusing namespace std;\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  string s1;\n\n  string s2;\n\n  vector<vector<string> > v;\n\n  int a, b, c, cnt = 0, in = 0;\n\n  cin >> a >> b;\n\n  for (int i = 0; i < a; ++i) {\n\n    vector<string> raw;\n\n    cin >> s1;\n\n    raw.push_back(s1);\n\n    v.push_back(raw);\n  }\n\n  for (int i = 1; i <= b + 2; ++i) {\n\n    cout << \"#\";\n  }\n\n  cout << \"\\n\";\n\n  for (int i = 0; i < v.size(); ++i) {\n\n    for (int j = 0; j < 1; ++j) {\n\n      cout << \"#\" << v[i][j] << \"#\"\n           << \"\\n\";\n    }\n  }\n\n  for (int i = 1; i <= b + 2; ++i) {\n\n    cout << \"#\";\n  }\n\n  cout << \"\\n\";\n\n  bye;\n}\n"}
{"fast_code_id":"55a80e0212216e5d8181b941e45b04a0c2ba6cd584600b848c39b448efcf8240","fast_id":"a7a6191db2b37b1d9cf025019fc0ea7390104e9cf7be8143a0343a008aac5c57","fast_time":0.0851372333,"language":"cpp","measured_fast_code_id":"a7a6191db2b37b1d9cf025019fc0ea7390104e9cf7be8143a0343a008aac5c57","measured_slow_code_id":"ce64481bf45e1e8ce542dde9d99b0689afd4cb71e988ba492bae89f307a04e37","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59954","problem_id":"p02781","slow_code_id":"6c49641e40d5eef6d150578732571d411758e6f7e6cf7985f7c453e35aa16bed","slow_id":"ce64481bf45e1e8ce542dde9d99b0689afd4cb71e988ba492bae89f307a04e37","slow_time":0.8906031872,"speedup":10.460795502500783,"stratum":"8+","sampling_key":"76225c38f84eb1a582eb6c8d39fdfcd1bbe399c794d1e8b3dd934ab283524c8f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, j, k) for (int i = (int)(j); i <= (int)(k); i++)\n\n#define debug(x) cerr << #x << \":\" << x << endl\n\n#define fix cout << fixed << setprecision(20);\n\nconst int maxn = (int)1e6 + 5;\n\nlong long dp[105][105][105];\n\nint L;\nint k;\nstring n;\n\nlong long f(int l, int st, int flag) {\n\n  if (st > k)\n    return 0;\n\n  if (l >= L)\n    return st == k;\n\n  if (dp[l][st][flag] != -1)\n    return dp[l][st][flag];\n\n  int upper = flag ? n[l] - '0' : 9;\n\n  long long ans = 0;\n\n  rep(i, 0, upper) ans += f(l + 1, st + (i != 0), flag && (i == upper));\n\n  return dp[l][st][flag] = ans;\n}\n\nint main() {\n\n  cin >> n;\n\n  cin >> k;\n\n  L = n.length();\n\n  memset(dp, -1, sizeof(dp));\n\n  cout << f(0, 0, 1);\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nusing P = pair<ll, ll>;\n\nusing Graph = vector<vector<ll>>;\n\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n\n#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)\n\n#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)\n\nconst int dx[4] = {1, 0, -1, 0};\n\nconst int dy[4] = {0, 1, 0, -1};\n\nconst int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nconst int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};\n\nconst ll MOD = 1000000007;\n\nconst ll INF = 1000000000000000000L;\n\n#ifdef __DEBUG\n\n#include \"cpp-pyprint/pyprint.h\"\n\n#endif\n\nvoid solve() {\n\n  string S;\n\n  cin >> S;\n\n  ll N, K;\n\n  cin >> K;\n\n  N = S.size();\n\n  vector<vector<vector<ll>>> dp(N + 1,\n                                vector<vector<ll>>(2, vector<ll>(K + 2, 0)));\n\n  dp[0][0][0] = 1;\n\n  rep(i, N) rep(j, 2) {\n\n    ll d = j == 1 ? 9 : S[i] - '0';\n\n    rep(k, K + 1) {\n\n      rep(m, d + 1) { dp[i + 1][j == 1 || m < d][k + (m != 0)] += dp[i][j][k]; }\n    }\n  }\n\n  ll ans = dp[N][0][K] + dp[N][1][K];\n\n  for (int i = 0; i <= N; i++) {\n  }\n\n  cout << ans << '\\n';\n}\n\nint main() {\n\n  cin.tie(nullptr);\n\n  ios::sync_with_stdio(false);\n\n  cout << fixed << setprecision(15);\n\n  solve();\n\n  return 0;\n}\n"}
{"fast_code_id":"e0a3a8245411215f0a23fdb4d0434eefbd1ead5ad88938aba4eec6721ac703d8","fast_id":"ec8d6b6f7f4a8550a6e879f6ceb0a171c9257de961db05182421940a7ef4e1cf","fast_time":0.0877330448,"language":"cpp","measured_fast_code_id":"ec8d6b6f7f4a8550a6e879f6ceb0a171c9257de961db05182421940a7ef4e1cf","measured_slow_code_id":"5ba2fb33cecf297b88f4fc006b9e3d04449b9bcd6ca2da70d40a9b53c132839a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_59957","problem_id":"p03174","slow_code_id":"8c20cc0fa36d3469019147ab59b81b5bca3ab9d456fe0eb795eef9bdd092635f","slow_id":"5ba2fb33cecf297b88f4fc006b9e3d04449b9bcd6ca2da70d40a9b53c132839a","slow_time":0.8559940721,"speedup":9.756803426250173,"stratum":"8+","sampling_key":"1afffb5b030fb52fdf41332178521dc854c705a8f84483d0b0b0a43bf59fd45b","slow_code":"#include <bits/stdc++.h>\n\n#define FIO                                                                                        \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(NULL);                                                                                   \\\n  cout.tie(NULL);\n\n#define PI 3.141592653589793238462643383279502884L\n\n#define make_unique(vec) vec.resize(distance(vec.begin(), unique(vec.begin(), vec.end())))\n\n#define Sort(vec) sort(vec.begin(), vec.end())\n\n#define RSort(vec) sort(vec.rbegin(), vec.rend())\n\n#define endl \"\\n\"\n\n#define show(i)                                                                                    \\\n  ;                                                                                                \\\n  cout << i << \" \";\n\n#define tr1(i)                                                                                     \\\n  ;                                                                                                \\\n  cout << i << endl;\n\n#define tr2(i, j)                                                                                  \\\n  ;                                                                                                \\\n  cout << i << \" \" << j << endl;\n\n#define tr3(i, j, k)                                                                               \\\n  ;                                                                                                \\\n  cout << i << \" \" << j << \" \" << k << endl;\n\n#define vvi vector<vector<int> >\n\n#define vvl vector<vector<lli> >\n\n#define all(st) st.begin(), st.end()\n\n#define vpll vector<pair<lli, lli> >\n\n#define vpii vector<pair<int, int> >\n\n#define pi pair<int, int>\n\n#define pl pair<lli, lli>\n\n#define al vector<list<int> >\n\n#define vs vector<string>\n\n#define vi vector<int>\n\n#define vb vector<bool>\n\n#define vl vector<lli>\n\n#define vc vector<char>\n\n#define rep(i, l, r) for (int i = l; i < r; i++)\n\n#define repit(st) for (auto it = st.begin(); it != st.end(); it++)\n\n#define ulli unsigned long long int\n\n#define eb emplace_back\n\n#define pb push_back\n\n#define lli long long int\n\n#define inf INT_MAX\n\n#define minf INT_MIN\n\n#define f first\n\n#define se second\n\n#define mod 1000000007\n\n#define mx 500001\n\nusing namespace std;\n\nvoid add_me(lli &a, lli b) {\n\n  a += b;\n\n  if (a >= mod)\n    a -= mod;\n}\n\nvoid sub_me(lli &a, lli b) {\n\n  a -= b;\n\n  if (a < 0)\n    a += mod;\n}\n\nbool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {\n\n  if (a.se == b.se)\n    return a.f < b.f;\n\n  return (a.se < b.se);\n}\n\nstruct disjointset {\n\n  int parent[mx];\n\n  disjointset() {\n\n    for (int i = 1; i < mx; i++)\n      parent[i] = i;\n  }\n\n  int find(int x) {\n\n    int par = parent[x];\n\n    if (par == x)\n      return x;\n\n    return parent[x] = find(parent[x]);\n  }\n\n  void union_(int x, int y) {\n\n    int par1 = find(x);\n\n    int par2 = find(y);\n\n    if (par1 == par2)\n      return;\n\n    parent[par2] = par1;\n  }\n};\n\nlli mi(lli n, lli m) {\n\n  lli pw = n;\n\n  lli ex = m - 2;\n\n  lli ans = 1;\n\n  while (ex) {\n\n    if (ex & 1)\n      ans = ans * pw % m;\n\n    pw = pw * pw % m;\n\n    ex >>= 1;\n  }\n\n  return ans % m;\n}\n\nint target;\n\nint n;\n\nvector<vi> vec(21, vi(21));\n\nint dp[1 << 21];\n\nint solve(int p, int mw) {\n\n  if (mw == target)\n    return 1;\n\n  if (dp[mw] != -1)\n    return dp[mw];\n\n  int ans = 0;\n\n  int i, j;\n\n  for (int j = 0; j < n; j++) {\n\n    if ((mw & (1 << j)) == 0 && vec[p][j]) {\n\n      ans += solve(p + 1, (mw | (1 << j)));\n\n      ans %= mod;\n    }\n  }\n\n  return dp[mw] = ans;\n}\n\nint main() {\n\n  FIO;\n\n  cin >> n;\n\n  memset(dp, -1, sizeof(dp));\n\n  rep(i, 0, n) { rep(j, 0, n) cin >> vec[i][j]; }\n\n  target = ((1 << n) - 1);\n\n  int ans = solve(0, 0);\n\n  cout << ans << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\n#define FIO                                                                                        \\\n  ios_base::sync_with_stdio(false);                                                                \\\n  cin.tie(NULL);                                                                                   \\\n  cout.tie(NULL);\n\n#define PI 3.141592653589793238462643383279502884L\n\n#define make_unique(vec) vec.resize(distance(vec.begin(), unique(vec.begin(), vec.end())))\n\n#define Sort(vec) sort(vec.begin(), vec.end())\n\n#define RSort(vec) sort(vec.rbegin(), vec.rend())\n\n#define endl \"\\n\"\n\n#define tr1(i) cout << i << endl;\n\n#define tr2(i, j) cout << i << \" \" << j << endl;\n\n#define tr3(i, j, k) cout << i << \" \" << j << \" \" << k << endl;\n\n#define vvi vector<vector<int> >\n\n#define vvl vector<vector<ll> >\n\n#define all(st) st.begin(), st.end()\n\n#define vpl vector<pair<ll, ll> >\n\n#define vpi vector<pair<int, int> >\n\n#define pi pair<int, int>\n\n#define pl pair<ll, ll>\n\n#define al vector<list<int> >\n\n#define vs vector<string>\n\n#define vb vector<bool>\n\n#define vi vector<int>\n\n#define vl vector<ll>\n\n#define vc vector<char>\n\n#define rep(i, l, r) for (int i = l; i < r; i++)\n\n#define repit(st) for (auto it = st.begin(); it != st.end(); it++)\n\n#define cs(ans)                                                                                    \\\n  ;                                                                                                \\\n  cout << setprecision(6) << fixed << ans << endl;\n\n#define ull unsigned long long int\n\n#define eb emplace_back\n\n#define pb push_back\n\n#define ll long long int\n\n#define minf -(1e16)\n\n#define f first\n\n#define se second\n\nconst ll mod = 1e9 + 7;\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\nll mi(ll n, ll m) {\n  ll pw = n % m;\n  ll ex = m - 2;\n  ll ans = 1;\n  while (ex) {\n    if (ex & 1)\n      ans = ans * pw % m;\n    pw = pw * pw % m;\n    ex >>= 1;\n  }\n  return ans % mod;\n}\n\nll pw(ll a, ll n) {\n  ll pw = a;\n  ll ex = n;\n  ll ans = 1;\n  while (ex) {\n    if (ex & 1)\n      ans = ans * pw;\n    pw = pw * pw;\n    ex >>= 1;\n  }\n  return ans;\n}\n\nll pwm(ll a, ll n) {\n  ll pw = a % mod;\n  ll ex = n;\n  ll ans = 1;\n  while (ex) {\n    if (ex & 1)\n      ans = ans * pw % mod;\n    pw = pw * pw % mod;\n    ex >>= 1;\n  }\n  return ans % mod;\n}\n\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) {\n  for (T &t : v)\n    is >> t;\n  return is;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {\n  for (const T &t : v) {\n    os << t << \" \";\n  }\n  os << '\\n';\n  return os;\n}\n\ntemplate <typename T>\nusing ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n\nll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }\n\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n\nll max(ll a, ll b) { return a > b ? a : b; }\n\nll min(ll a, ll b) { return a < b ? a : b; }\n\nll Abs(ll x) { return x > 0 ? x : (-x); }\n\nll Ceil(ll a, ll b) { return a / b + (a % b != 0); }\n\n#define bs binary_search\n\n#define lb lower_bound\n\n#define ub upper_bound\n\n#define mkp make_pair\n\nint dx[] = {1, 0, -1, 0};\n\nint dy[] = {0, 1, 0, -1};\n\nchar move[] = {'D', 'R', 'U', 'L'};\n\nint X[] = {2, 1, -1, -2, -2, -1, 1, 2};\n\nint Y[] = {1, 2, 2, 1, -1, -2, -2, -1};\n\nstruct comp {\n\n  bool operator()(const pair<int, int> &a, const pair<int, int> &b) const {\n\n    if (a.first > b.first)\n      return true;\n\n    if (a.first < b.first)\n      return false;\n\n    if (a.second < b.second)\n      return true;\n\n    return false;\n  }\n};\n\nvoid solve() {\n\n  int n;\n\n  cin >> n;\n\n  vvi m(n, vi(n));\n\n  rep(i, 0, n) { rep(j, 0, n) cin >> m[i][j]; }\n\n  vector<ll> dp(1 << n);\n\n  dp[0] = 1;\n\n  for (int mask = 0; mask < (1 << n) - 1; mask++) {\n\n    int matched = __builtin_popcount(mask);\n\n    for (int j = 0; j < n; j++) {\n\n      if (m[matched][j] && ((mask & (1 << j)) == 0)) {\n\n        dp[mask | (1 << j)] += dp[mask];\n\n        dp[mask | (1 << j)] %= mod;\n      }\n    }\n  }\n\n  cout << dp[(1 << n) - 1] << endl;\n}\n\nint32_t main() {\n\n  int t = 1;\n\n  while (t--) {\n\n    solve();\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"b6d00f2531e8d78f01f22a158d750243d248a6992dcaba24e0c83bcb474398ee","fast_id":"90554e8a57b83445c7ce094883f5f50376e1b0de5ab85b108a5dad5533eb687b","fast_time":0.0819786199,"language":"cpp","measured_fast_code_id":"90554e8a57b83445c7ce094883f5f50376e1b0de5ab85b108a5dad5533eb687b","measured_slow_code_id":"c44e7dd1905f6bdee96780e7f59692f1a3e51d8ce15088998b125146bcc64b84","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_6008","problem_id":"p03170","slow_code_id":"327be73863c046c87c8f42ce01e57858cc4c139b6be41182ece8a655faad3d21","slow_id":"c44e7dd1905f6bdee96780e7f59692f1a3e51d8ce15088998b125146bcc64b84","slow_time":0.2481392903,"speedup":3.02687811288709,"stratum":"2-4","sampling_key":"4e5912f2e7400e9d30707e2ffd1ec270bfb13be04f20b31eb918d35c03f12ef6","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long int\n\n#define ull unsigned long long\n\n#define ld long double\n\n#define lll __int128\n\n#define vi vector<int>\n\n#define vl vector<ll>\n\n#define vvi vector<vector<int> >\n\n#define pii pair<int, int>\n\n#define piii pair<int, pair<int, int> >\n\n#define pll pair<ll, ll>\n\n#define vii vector<pii>\n\n#define min_pq priority_queue<int, vector<int>, greater<int> >\n\n#define sz(v) ((int)(v).size())\n\n#define all(s) s.begin(), s.end()\n\n#define allr(s) s.rbegin(), s.rend()\n\n#define unq(c) (sort(all(c)), c.resize(distance(c.begin(), unique(all(c)))))\n\n#define get_pos(c, x) (lower_bound(all(c), x) - c.begin())\n\n#define ran(a, b) ((((rand() << 15) ^ rand()) % ((b) - (a) + 1)) + (a))\n\n#define MS0(v) memset((v), 0, sizeof((v)))\n\n#define MS1(v) memset((v), -1, sizeof((v)))\n\n#define LEN(v) strlen(v)\n\n#define MP make_pair\n\n#define pb push_back\n\n#define pob pop_back\n\n#define ff first\n\n#define ss second\n\n#define sc scanf\n\n#define pf printf\n\n#define endl \"\\n\"\n\n#define LL                                                                                         \\\n  ({                                                                                               \\\n    ll __LL;                                                                                       \\\n    scanf(\"%lld\", &__LL);                                                                          \\\n    __LL;                                                                                          \\\n  })\n\n#define II                                                                                         \\\n  ({                                                                                               \\\n    int __II;                                                                                      \\\n    scanf(\"%d\", &__II);                                                                            \\\n    __II;                                                                                          \\\n  })\n\n#define CC                                                                                         \\\n  ({                                                                                               \\\n    char __CC;                                                                                     \\\n    scanf(\"%c\", &__CC);                                                                            \\\n    __CC;                                                                                          \\\n  })\n\n#define DD                                                                                         \\\n  ({                                                                                               \\\n    double __DD;                                                                                   \\\n    scanf(\"%lf\", &__DD);                                                                           \\\n    __DD;                                                                                          \\\n  })\n\n#define intmx INT_MAX\n\n#define llmx 1llu << 61\n\n#define PI 3.14159265358979323846264338327950L\n\n#define MOD 1000000007\n\n#define MAX 100010\n\n#define gcd(a, b) __gcd(a, b)\n\n#define lcm(a, b) ((a) * ((b) / gcd(a, b)))\n\n#define shuffle(v) (random_shuffle(all(v)))\n\n#define min_ele(v) (*min_element(all(v)))\n\n#define max_ele(v) (*max_element(all(v)))\n\n#define is_equal(x, y) (abs(x - y) < eps)\n\n#define cnt_ele(v, x) (count(all(v), x))\n\n#define sum_ele(v) (accumulate(all(v), 0))\n\n#define pro_ele(v) (accumulate(all(v), 1, multiplies<int>()))\n\n#define init_range(v, x) (iota(all(v), x))\n\n#define TEST_CASE                                                                                  \\\n  int ___T;                                                                                        \\\n  scanf(\"%d\", &___T);                                                                              \\\n  for (int cs = 1; cs <= ___T; cs++)\n\n#define PRINT_CASE printf(\"Case %d: \", cs)\n\n#define PRINT_CASEN printf(\"Case %d:\\n\", cs)\n\n#define vpf(v, len)                                                                                \\\n  for (int ix = 0; ix < len; ix++) {                                                               \\\n    pf(\"%d\", v[ix]);                                                                               \\\n    if (ix != len - 1)                                                                             \\\n      pf(\" \");                                                                                     \\\n    else                                                                                           \\\n      pf(\"\\n\");                                                                                    \\\n  }\n\n#define vsc(v, len)                                                                                \\\n  for (int ix = 0; ix < len; ix++)                                                                 \\\n    scanf(\"%d\", &v[ix]);\n\n#define FOR(i, a, b, stp) for (int i = (a); i <= (b); i += stp)\n\n#define ROF(i, a, b, stp) for (int i = (a); i >= (b); i -= stp)\n\ntemplate <class T> inline bool read(T &x) {\n  int c = getchar();\n  int sgn = 1;\n  while (~c && c < '0' || c > '9') {\n    if (c == '-')\n      sgn = -1;\n    c = getchar();\n  }\n  for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar())\n    x = x * 10 + c - '0';\n  x *= sgn;\n  return ~c;\n}\n\ninline ll exp(ll a, ll p) {\n  if (p == 0)\n    return 1;\n  ll x = exp(a, p / 2) % MOD;\n  x = (x * x) % MOD;\n  if (p & 1)\n    x = (x * (a % MOD)) % MOD;\n  return x;\n}\n\ninline int add(int a, int b) {\n  a += b;\n  if (a >= MOD)\n    a -= MOD;\n  return a;\n}\n\ninline int sub(int a, int b) {\n  a -= b;\n  if (a < MOD)\n    a += MOD;\n  return a;\n}\n\ninline int multi(ll a, ll b) {\n  a *= b;\n  if (a >= MOD)\n    a %= MOD;\n  return a;\n}\n\ninline int on_bit(int N, int pos) { return N = N | (1 << pos); }\n\ninline int off_bit(int N, int pos) { return N = N & ~(1 << pos); }\n\ninline bool check_bit(ll N, int pos) { return (bool)(N & (1 << pos)); }\n\n#define on_bit_cnt(x) (__builtin_popcount(x))\n\n#define start_clock clock_t tStart = clock()\n\n#define end_clock printf(\"\\n>>Runtime: %.10fs\\n\", (double)(clock() - tStart) / CLOCKS_PER_SEC)\n\n#define fastio                                                                                     \\\n  ios_base::sync_with_stdio(0);                                                                    \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0)\n\n#define fileio                                                                                     \\\n  freopen(\"in.txt\", \"r\", stdin);                                                                   \\\n  freopen(\"out.txt\", \"w\", stdout)\n\nint n, k;\n\nint ar[105];\n\nint dp[100005][5];\n\nint solve(int stones, int player) {\n\n  if (dp[stones][player] != -1)\n    return dp[stones][player];\n\n  if (player) {\n\n    int ret = 0;\n\n    for (int i = 0; i < n; ++i) {\n\n      if (ar[i] <= stones) {\n\n        if (solve(stones - ar[i], player ^ 1) == 0) {\n\n          ret = 1;\n        }\n      }\n    }\n\n    return dp[stones][player] = ret;\n\n  }\n\n  else {\n\n    int ret = 0;\n\n    for (int i = 0; i < n; ++i) {\n\n      if (ar[i] <= stones) {\n\n        if (solve(stones - ar[i], player ^ 1) == 0) {\n\n          ret = 1;\n        }\n      }\n    }\n\n    return dp[stones][player] = ret;\n  }\n}\n\nint main() {\n\n  cin >> n >> k;\n\n  for (int i = 0; i < n; i++)\n    cin >> ar[i];\n\n  MS1(dp);\n\n  if (solve(k, 1))\n    cout << \"First\\n\";\n\n  else\n    cout << \"Second\\n\";\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long int\n\n#define ull unsigned long long\n\n#define ld long double\n\n#define lll __int128\n\n#define vi vector<int>\n\n#define vl vector<ll>\n\n#define vvi vector<vector<int> >\n\n#define pii pair<int, int>\n\n#define piii pair<int, pair<int, int> >\n\n#define pll pair<ll, ll>\n\n#define vii vector<pii>\n\n#define min_pq priority_queue<int, vector<int>, greater<int> >\n\n#define sz(v) ((int)(v).size())\n\n#define all(s) s.begin(), s.end()\n\n#define allr(s) s.rbegin(), s.rend()\n\n#define unq(c) (sort(all(c)), c.resize(distance(c.begin(), unique(all(c)))))\n\n#define get_pos(c, x) (lower_bound(all(c), x) - c.begin())\n\n#define ran(a, b) ((((rand() << 15) ^ rand()) % ((b) - (a) + 1)) + (a))\n\n#define MS0(v) memset((v), 0, sizeof((v)))\n\n#define MS1(v) memset((v), -1, sizeof((v)))\n\n#define LEN(v) strlen(v)\n\n#define MP make_pair\n\n#define pb push_back\n\n#define pob pop_back\n\n#define ff first\n\n#define ss second\n\n#define sc scanf\n\n#define pf printf\n\n#define endl \"\\n\"\n\n#define LL                                                                                         \\\n  ({                                                                                               \\\n    ll __LL;                                                                                       \\\n    scanf(\"%lld\", &__LL);                                                                          \\\n    __LL;                                                                                          \\\n  })\n\n#define II                                                                                         \\\n  ({                                                                                               \\\n    int __II;                                                                                      \\\n    scanf(\"%d\", &__II);                                                                            \\\n    __II;                                                                                          \\\n  })\n\n#define CC                                                                                         \\\n  ({                                                                                               \\\n    char __CC;                                                                                     \\\n    scanf(\"%c\", &__CC);                                                                            \\\n    __CC;                                                                                          \\\n  })\n\n#define DD                                                                                         \\\n  ({                                                                                               \\\n    double __DD;                                                                                   \\\n    scanf(\"%lf\", &__DD);                                                                           \\\n    __DD;                                                                                          \\\n  })\n\n#define intmx INT_MAX\n\n#define llmx 1llu << 61\n\n#define PI 3.14159265358979323846264338327950L\n\n#define MOD 1000000007\n\n#define MAX 100010\n\n#define gcd(a, b) __gcd(a, b)\n\n#define lcm(a, b) ((a) * ((b) / gcd(a, b)))\n\n#define shuffle(v) (random_shuffle(all(v)))\n\n#define min_ele(v) (*min_element(all(v)))\n\n#define max_ele(v) (*max_element(all(v)))\n\n#define is_equal(x, y) (abs(x - y) < eps)\n\n#define cnt_ele(v, x) (count(all(v), x))\n\n#define sum_ele(v) (accumulate(all(v), 0))\n\n#define pro_ele(v) (accumulate(all(v), 1, multiplies<int>()))\n\n#define init_range(v, x) (iota(all(v), x))\n\n#define TEST_CASE                                                                                  \\\n  int ___T;                                                                                        \\\n  scanf(\"%d\", &___T);                                                                              \\\n  for (int cs = 1; cs <= ___T; cs++)\n\n#define PRINT_CASE printf(\"Case %d: \", cs)\n\n#define PRINT_CASEN printf(\"Case %d:\\n\", cs)\n\n#define vpf(v, len)                                                                                \\\n  for (int ix = 0; ix < len; ix++) {                                                               \\\n    pf(\"%d\", v[ix]);                                                                               \\\n    if (ix != len - 1)                                                                             \\\n      pf(\" \");                                                                                     \\\n    else                                                                                           \\\n      pf(\"\\n\");                                                                                    \\\n  }\n\n#define vsc(v, len)                                                                                \\\n  for (int ix = 0; ix < len; ix++)                                                                 \\\n    scanf(\"%d\", &v[ix]);\n\n#define FOR(i, a, b, stp) for (int i = (a); i <= (b); i += stp)\n\n#define ROF(i, a, b, stp) for (int i = (a); i >= (b); i -= stp)\n\ntemplate <class T> inline bool read(T &x) {\n  int c = getchar();\n  int sgn = 1;\n  while (~c && c < '0' || c > '9') {\n    if (c == '-')\n      sgn = -1;\n    c = getchar();\n  }\n  for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar())\n    x = x * 10 + c - '0';\n  x *= sgn;\n  return ~c;\n}\n\ninline ll exp(ll a, ll p) {\n  if (p == 0)\n    return 1;\n  ll x = exp(a, p / 2) % MOD;\n  x = (x * x) % MOD;\n  if (p & 1)\n    x = (x * (a % MOD)) % MOD;\n  return x;\n}\n\ninline int add(int a, int b) {\n  a += b;\n  if (a >= MOD)\n    a -= MOD;\n  return a;\n}\n\ninline int sub(int a, int b) {\n  a -= b;\n  if (a < MOD)\n    a += MOD;\n  return a;\n}\n\ninline int multi(ll a, ll b) {\n  a *= b;\n  if (a >= MOD)\n    a %= MOD;\n  return a;\n}\n\ninline int on_bit(int N, int pos) { return N = N | (1 << pos); }\n\ninline int off_bit(int N, int pos) { return N = N & ~(1 << pos); }\n\ninline bool check_bit(ll N, int pos) { return (bool)(N & (1 << pos)); }\n\n#define on_bit_cnt(x) (__builtin_popcount(x))\n\n#define start_clock clock_t tStart = clock()\n\n#define end_clock printf(\"\\n>>Runtime: %.10fs\\n\", (double)(clock() - tStart) / CLOCKS_PER_SEC)\n\n#define fastio                                                                                     \\\n  ios_base::sync_with_stdio(0);                                                                    \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0)\n\n#define fileio                                                                                     \\\n  freopen(\"in.txt\", \"r\", stdin);                                                                   \\\n  freopen(\"out.txt\", \"w\", stdout)\n\nint main() {\n\n  int n = II, k = II;\n\n  vi v(n);\n  vsc(v, n);\n\n  vector<bool> dp(k + 1);\n\n  for (int tiles = 0; tiles <= k; ++tiles) {\n\n    for (int x : v) {\n\n      if (x <= tiles && !dp[tiles - x]) {\n\n        dp[tiles] = 1;\n      }\n    }\n  }\n\n  puts(dp[k] ? \"First\" : \"Second\");\n\n  return 0;\n}\n"}
{"fast_code_id":"3a2f2a525ab37370bb66676f9c470367f76ce6c4e489ef3ee993ed76ac0d6194","fast_id":"3c6cd5d94342125ec75680a9aedc0c8c100ba14091c421b9e1c8a995ac7ee03b","fast_time":0.0176178897,"language":"cpp","measured_fast_code_id":"3c6cd5d94342125ec75680a9aedc0c8c100ba14091c421b9e1c8a995ac7ee03b","measured_slow_code_id":"42073ebef8ec4518e14823b1a68ba6f0a8ed0f5a650fd24b43be03421186f8a8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_60115","problem_id":"p03457","slow_code_id":"c77d00f81274416d31dd58781702b2c04b775f63444477d68d072f3d5825e12e","slow_id":"42073ebef8ec4518e14823b1a68ba6f0a8ed0f5a650fd24b43be03421186f8a8","slow_time":0.1331086688,"speedup":7.555312870417165,"stratum":"4-8","sampling_key":"a590223bd3ebb103d019df6ba78ee232a4d5dc6e4ec09cfd2796155f92d46400","slow_code":"#include <cstdio>\n\nint main() {\n\n  int n;\n\n  while (~scanf(\"%d\", &n))\n\n  {\n\n    int jin = 0;\n\n    int ti[100050] = {0};\n\n    int xi[100050] = {0};\n\n    int yi[100050] = {0};\n\n    int i;\n\n    for (i = 1; i <= n; i++)\n\n    {\n\n      scanf(\"%d%d%d\", &ti[i], &xi[i], &yi[i]);\n\n      int sum = xi[i] + yi[i] - xi[i - 1] - yi[i - 1];\n\n      if (jin != 0)\n        continue;\n\n      if (sum < 0) {\n\n        sum = -sum;\n      }\n\n      if (ti[i] >= sum) {\n\n        int l1 = (ti[i] - ti[i - 1]) % 2;\n\n        int l2 = sum % 2;\n\n        if (l1 != l2) {\n\n          jin = 5;\n        }\n\n      } else {\n\n        jin = 5;\n      }\n    }\n\n    if (jin) {\n\n      printf(\"No\\n\");\n\n    } else {\n\n      printf(\"Yes\\n\");\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint s[100005][5];\n\nint main()\n\n{\n\n  int n, first = 0;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= 3; j++)\n\n      scanf(\"%d\", &s[i][j]);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int a, b;\n\n    a = (s[i][2] + s[i][3]) - (s[i - 1][2] + s[i - 1][3]);\n\n    if (a < 0)\n      a = -a;\n\n    b = s[i][1] - s[i - 1][1];\n\n    if (a > b || (a - b) % 2 || a == 0 && (b - 4) % 2) {\n      first = 1;\n      break;\n    }\n  }\n\n  if (first)\n    printf(\"No\");\n\n  else\n    printf(\"Yes\");\n\n  return 0;\n}\n"}
{"fast_code_id":"3d87f90d79ce8cbc07940b986a05478e57724491c6392c639688b81cc17d7b05","fast_id":"02cf6e5501c2fe8d1f5a3b1308f208a7cd98f72d48afa2c01787494c25b06c78","fast_time":0.0793548796,"language":"cpp","measured_fast_code_id":"02cf6e5501c2fe8d1f5a3b1308f208a7cd98f72d48afa2c01787494c25b06c78","measured_slow_code_id":"a79e19c50b7435fb7263abe92168e7f2df9fdd7dc96d9d4e58895c7cbb0d0ecc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_602","problem_id":"p03554","slow_code_id":"9777ad11fce82f1dac79f97f72d1114c3800d99fd1bcc864e1fc92d61f0c455f","slow_id":"a79e19c50b7435fb7263abe92168e7f2df9fdd7dc96d9d4e58895c7cbb0d0ecc","slow_time":0.3089142319,"speedup":3.8928196155942505,"stratum":"2-4","sampling_key":"cdb263fc2984b16107b6f9afbebecdf75da2965fc7f855519b416e46b615d79a","slow_code":"#include <vector>\n\n#include <stdio.h>\n\n#include <string.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#define R register\n\ntypedef long long ll;\n\ninline int read() {\n\n  R int x;\n  R bool f;\n  R char c;\n\n  for (f = 0; (c = getchar()) < '0' || c > '9'; f = c == '-')\n    ;\n\n  for (x = c ^ '0'; (c = getchar()) >= '0' && c <= '9';\n       x = (x << 1) + (x << 3) + (c ^ '0'))\n    ;\n\n  return f ? -x : x;\n}\n\n#define M (1 << 18)\n\n#define MN 200005\n\nint T[M << 1], n, q, cost[MN], cnt;\n\nstd::vector<int> rang[MN];\n\ninline void rw(int k, int v) {\n  for (k += M; k; k >>= 1)\n    if (T[k] <= v)\n      return;\n    else\n      T[k] = v;\n}\n\ninline int query(int l, int r) {\n\n  R int res = 0x3f3f3f3f;\n\n  for (l += M - 1, r += M + 1; l ^ r ^ 1; l >>= 1, r >>= 1) {\n\n    if (~l & 1)\n      res = std::min(T[l ^ 1], res);\n\n    if (r & 1)\n      res = std::min(T[r ^ 1], res);\n  }\n  return res;\n}\n\nint main() {\n\n  n = read();\n  for (R int i = 1; i <= n; ++i)\n\n    cost[i] = read() ? 1 : -1, cnt += (bool)(!(~cost[i]));\n\n  q = read();\n  for (R int i = 1, x, y; i <= q; ++i)\n\n    x = read(), y = read(), rang[x].push_back(y);\n\n  memset(T, 0x3f, sizeof(T));\n  rw(0, 0);\n\n  for (R int i = 1; i <= n; ++i) {\n\n    for (auto j : rang[i]) {\n\n      R int res = T[i + M - 1];\n\n      res = std::min(res, query(std::max(i - 1, 1), j));\n\n      rw(j, res);\n    }\n    rw(i, T[i + M - 1] + cost[i]);\n  }\n  printf(\"%d\\n\", T[n + M] + cnt);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define MN 262150\n\nusing namespace std;\n\nstruct node {\n  int x, y;\n} b[MN];\n\nint t[MN << 1], a[MN];\n\nint MQ, INF, n, m, ans, f0;\n\ninline int read()\n\n{\n\n  int n = 0, f = 1;\n  char c = getchar();\n\n  while (c < '0' || c > '9') {\n    if (c == '-')\n      f = -1;\n    c = getchar();\n  }\n\n  while (c >= '0' && c <= '9') {\n    n = n * 10 + c - '0';\n    c = getchar();\n  }\n\n  return n * f;\n}\n\ninline void grw(int x, int y) {\n  for (x += MQ; x; x >>= 1)\n    if (t[x] > y)\n      t[x] = y;\n    else\n      return;\n}\n\ninline int gmn(int x, int y)\n\n{\n\n  int sm = INF;\n\n  for (x += MQ, y += MQ; x <= y; x >>= 1, y >>= 1)\n\n  {\n\n    if (x & 1)\n      sm = min(sm, t[x++]);\n\n    if (~y & 1)\n      sm = min(sm, t[y--]);\n  }\n\n  return sm;\n}\n\nbool cmp(const node &a, const node &b) {\n  return a.x < b.x || a.x == b.x && a.y > b.y;\n}\n\nint main()\n\n{\n\n  register int i, j;\n\n  n = read();\n  for (i = 1; i <= n; ++i)\n    a[i] = read(), ans += (a[i] == 0), a[i] = a[i] ? 1 : -1;\n\n  m = read();\n  for (i = 1; i <= m; ++i)\n    b[i].x = read(), b[i].y = read();\n\n  sort(b + 1, b + m + 1, cmp);\n  memset(t, 100, sizeof(t));\n  INF = t[0];\n  f0 = 0;\n\n  for (MQ = 1; MQ < n; MQ <<= 1)\n    ;\n  --MQ;\n\n  for (i = j = 1; i <= n; f0 = min(f0 + a[i], t[i + MQ]), ++i)\n\n    for (; j <= m && b[j].x == i; ++j)\n\n      grw(b[j].y, min(gmn(i, b[j].y), f0));\n\n  printf(\"%d\", ans + f0);\n}"}
{"fast_code_id":"7eb8cdf3c78fc1a3584f59034d31d43903af581732ba22f5f9b22712c497c4c2","fast_id":"c4c11b39471fe29425cc5828a9421174f36b835dbe12ffe7d9f4bb8bb2d3f9a3","fast_time":0.01463953,"language":"cpp","measured_fast_code_id":"c4c11b39471fe29425cc5828a9421174f36b835dbe12ffe7d9f4bb8bb2d3f9a3","measured_slow_code_id":"182eaa5be320a16fe5834f8a7631cebecce011ab8ef2f52a59c8f57c870e836a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_60458","problem_id":"p03692","slow_code_id":"1a4ec463eb43af501e928744ece53793f77dbf29c02d4f1af3528a9f46d96d0b","slow_id":"182eaa5be320a16fe5834f8a7631cebecce011ab8ef2f52a59c8f57c870e836a","slow_time":0.0647855774,"speedup":4.4253864297556005,"stratum":"4-8","sampling_key":"ab6a58b07660a48dda6590cb15297b48c18309c00283af71ab7b9e89f136dd23","slow_code":"#include <cstdio>\n\n#include <vector>\n\nconst long long MOD = 1000000007;\n\nint N, M, sg[16], c0[15], c1[15], e[16][16];\n\nstd::vector<int> V[16];\n\nlong long O = 0;\n\nlong long DFS(int k)\n\n{\n\n  if (k <= 2)\n\n  {\n\n    static long long H[15];\n\n    static int T[15];\n\n    H[0] = 1;\n\n    for (int i = 1; H[i - 1] && i <= N - 1; i++)\n\n      H[i] = H[i - 1] * ((1 << c0[i - 1]) - 1) * ((1 << c1[i - 1]) - 1) % MOD;\n\n    T[N - 1] = 0;\n\n    for (int i = N - 2; ~i; i--)\n\n      T[i] = T[i + 1] + c0[i + 1] + c1[i + 1];\n\n    long long O = 0;\n\n    for (int i = 0; i <= N - 1 && H[i]; i++)\n\n      O = (O + (H[i] << T[i])) % MOD;\n\n    return O;\n  }\n\n  static int cnt[16];\n\n  for (int i = 0; i <= N; i++)\n\n    cnt[i] = 0;\n\n  for (int i : V[k])\n\n    cnt[sg[i]]++;\n\n  static long long H[16], T[16];\n\n  H[0] = 1;\n\n  for (int i = 1; i <= N; i++)\n\n    H[i] = H[i - 1] * ((1 << cnt[i - 1]) - 1) % MOD;\n\n  T[N] = 1;\n\n  for (int i = N - 1; ~i; i--)\n\n    T[i] = (T[i + 1] << cnt[i + 1]) % MOD;\n\n  long long U[16], O = 0;\n\n  for (int i = 0; i <= N; i++)\n\n    U[i] = H[i] * T[i] % MOD;\n\n  for (int i = 0; i <= N; i++)\n\n    if (U[i])\n\n    {\n\n      if (e[1][k])\n\n        c0[i]++;\n\n      if (e[2][k])\n\n        c1[i]++;\n\n      sg[k] = i;\n\n      O = (O + U[i] * DFS(k - 1)) % MOD;\n\n      if (e[1][k])\n\n        c0[i]--;\n\n      if (e[2][k])\n\n        c1[i]--;\n    }\n\n  return O;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &N, &M);\n\n  long long BASE = 1;\n\n  for (int i = 1, u, v; i <= M; i++)\n\n  {\n\n    scanf(\"%d%d\", &u, &v);\n\n    BASE = BASE * 2 % MOD;\n\n    if (u != 1 || v != 2)\n\n    {\n\n      V[u].push_back(v);\n\n      e[u][v] = 1;\n    }\n  }\n\n  printf(\"%lld\\n\", (BASE - DFS(N) + MOD) % MOD);\n}\n","fast_code":"#include <cstdio>\n\nconst int MOD = 1000000007;\n\nint N, M, e[15][15], emask[15][32768];\n\nlong long f[8192];\n\nlong long A(int u, int v)\n\n{\n\n  long long W = 1;\n\n  int zero = u - v, nonzero = v | 3 << N - 2;\n\n  for (int i = 0; i < N; i++)\n\n  {\n\n    if (zero >> i & 1)\n\n      W = (W << emask[i][nonzero]) % MOD;\n\n    if (nonzero >> i & 1)\n\n      W = W * ((1 << emask[i][zero]) - 1) % MOD;\n  }\n\n  return W;\n}\n\nlong long B(int u, int v)\n\n{\n\n  long long W = 1;\n\n  int zero = u - v | 3 << N - 2, nonzero = v;\n\n  for (int i = 0; i < N; i++)\n\n  {\n\n    if (zero >> i & 1)\n\n      W = (W << emask[i][nonzero]) % MOD;\n\n    if (nonzero >> i & 1)\n\n      W = (W << emask[i][nonzero]) % MOD * ((1 << emask[i][zero]) - 1) % MOD;\n  }\n\n  return W;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &N, &M);\n\n  long long BA = 1;\n\n  for (int i = 1, u, v; i <= M; i++)\n\n  {\n\n    scanf(\"%d%d\", &u, &v);\n\n    e[N - u][N - v] = 1;\n\n    BA = (BA << 1) % MOD;\n  }\n\n  for (int i = 0; i < N; i++)\n\n    for (int j = 0; j < 1 << N; j++)\n\n      for (int k = 0; k < N; k++)\n\n        if ((j >> k & 1) && e[i][k])\n\n          emask[i][j]++;\n\n  for (int i = 0; i < 1 << N - 2; i++)\n\n  {\n\n    f[i] = B(i, i);\n\n    for (int j = 0; j < i; j = ((j | ~i) + 1) & i)\n\n      f[i] = (f[i] + f[j] * A(i, j) + B(i, j)) % MOD;\n  }\n\n  printf(\"%lld\\n\", (BA - f[(1 << N - 2) - 1] + MOD) % MOD);\n\n  return 0;\n}\n"}
{"fast_code_id":"3fc8ad01195627c67b5694b8c3318396c1bf74276e38bd361f6e76e5f90e5f77","fast_id":"5f23eb4fe7cfca831453a0121d5a7df05cb61eee8b003701415ab4f94638aac1","fast_time":0.0791583481,"language":"cpp","measured_fast_code_id":"5f23eb4fe7cfca831453a0121d5a7df05cb61eee8b003701415ab4f94638aac1","measured_slow_code_id":"666433d7201e9634fcfc632e32756182da7739d9014147910c577ae1c0960c4e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_60461","problem_id":"p00909","slow_code_id":"7c8eba04f54d57e1f37f8256a49701df50c471944683ac049333801d3b25574e","slow_id":"666433d7201e9634fcfc632e32756182da7739d9014147910c577ae1c0960c4e","slow_time":0.2975920828,"speedup":3.7594529186492713,"stratum":"2-4","sampling_key":"2abf4dc0265552e8790c723f9aba914ac862aa222a16ecd497154b307f384684","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long int ll;\n\nconst int S = 100010;\n\nstruct UnionFind {\n\n  vector<int> node;\n\n  vector<ll> weight;\n\n  UnionFind() : node(S, -1), weight(S, 0) {}\n\n  void unite(int u, int v, ll w) {\n\n    int ov = v, ou = u;\n\n    u = find(u), v = find(v);\n\n    int wa = weight[ov], wb = weight[ou];\n\n    if (u == v)\n      return;\n\n    node[u] += node[v];\n\n    node[v] = u;\n\n    weight[v] += w + wb - wa;\n  }\n\n  ll get_weight(int u) {\n\n    ll ret = 0;\n\n    while (node[u] >= 0) {\n\n      ret += weight[u];\n\n      u = node[u];\n    }\n\n    return ret;\n  }\n\n  int find(int u) {\n\n    if (node[u] < 0)\n      return u;\n\n    int par = node[u], root = find(node[u]);\n\n    weight[u] += weight[par];\n\n    return node[u] = root;\n  }\n};\n\nint main() {\n\n  int N, M;\n\n  while (cin >> N >> M, N) {\n\n    UnionFind uf;\n\n    for (int i = 0; i < M; i++) {\n\n      char c;\n      cin >> c;\n\n      if (c == '!') {\n\n        int a, b, d;\n        cin >> a >> b >> d;\n\n        a--;\n        b--;\n\n        uf.unite(a, b, d);\n\n      }\n\n      else {\n\n        int a, b;\n        cin >> a >> b;\n\n        a--;\n        b--;\n\n        if (uf.find(a) != uf.find(b))\n          cout << \"UNKNOWN\" << endl;\n\n        else {\n\n          ll wa = uf.get_weight(a);\n\n          ll wb = uf.get_weight(b);\n\n          cout << wb - wa << endl;\n        }\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <vector>\n\n#include <cassert>\n\n#include <string>\n\nusing namespace std;\n\n\n\nstruct QuickFind {\n\n  int N;\n\n  vector<int> i2g;\n\n  vector< vector<int> > g2i;\n\n  vector<long long int> weight;\n\n\n\n  QuickFind(int N_) {\n\n    N = N_;\n\n    i2g.resize(N);\n\n    g2i.resize(N);\n\n    weight.resize(N);\n\n\n\n    for(int i=0; i<N; i++) {\n\n      i2g[i] = i;\n\n      g2i[i] = vector<int>{i};\n\n    }\n\n  }\n\n\n\n  bool same(int u, int v) {\n\n  return i2g[u] == i2g[v];\n\n  }\n\n\n\n                                    \n\n  void unite(int u, int v, int w) {\n\n    int ru = i2g[u], rv = i2g[v];\n\n    if(ru == rv) return;\n\n\n\n    if(g2i[rv].size() > g2i[ru].size()) {\n\n      swap(ru, rv);\n\n      swap(u, v);\n\n      w = -w;\n\n    }\n\n\n\n    long long int prev = weight[v];\n\n    weight[v] = weight[u] + w;\n\n\n\n    for(auto e : g2i[rv]) {\n\n      i2g[e] = ru;\n\n      long long int diff = weight[e] - prev;\n\n      if(e != v) weight[e] = weight[v] + diff;\n\n    }\n\n\n\n    for(auto e : g2i[rv]) {\n\n      g2i[ru].push_back(e);\n\n    }\n\n    g2i[rv].clear();\n\n  }\n\n\n\n  long long int query(int u, int v) {\n\n    assert(same(u, v));\n\n    return weight[v] - weight[u];\n\n  }\n\n};\n\n\n\nint N, Q;\n\n\n\nint main() {\n\n  while(cin >> N >> Q, N || Q) {\n\n    QuickFind qf(N);\n\n    for(int i=0; i<Q; i++) {\n\n      char query; cin >> query;\n\n      if(query == '!') {\n\n        int u, v, w; cin >> u >> v >> w;\n\n        u--; v--;\n\n        qf.unite(u, v, w);\n\n      }\n\n      else {\n\n        int u, v; cin >> u >> v;\n\n        u--; v--;\n\n        if(qf.same(u, v)) {\n\n          cout << qf.query(u, v) << endl;\n\n        }\n\n        else {\n\n          cout << \"UNKNOWN\" << endl;\n\n        }\n\n      }\n\n    }\n\n  }\n\n  return 0;\n\n}\n"}
{"fast_code_id":"d8919a34d1f2e9943adc6876f4df8d5f9fe17028253f00bced517e5e418ad947","fast_id":"6849e2e0c49b31a81510f0ac5b74437b8791a5ce43ca9646bac29199f03ef2aa","fast_time":0.072733544,"language":"cpp","measured_fast_code_id":"6849e2e0c49b31a81510f0ac5b74437b8791a5ce43ca9646bac29199f03ef2aa","measured_slow_code_id":"0f460787736ba5caee2928df8db5709fd54f3ea29676ebe763fd2aa03a6fc664","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_60472","problem_id":"p03453","slow_code_id":"bb9bbaa117713a1e77a6dc4e16ea39b37033945afd6bb6d6e4cb1871b9424636","slow_id":"0f460787736ba5caee2928df8db5709fd54f3ea29676ebe763fd2aa03a6fc664","slow_time":0.1490366297,"speedup":2.049076966468182,"stratum":"2-4","sampling_key":"9cea0f93376b58e4d75216ef46c4f64bb38ef39ba12c1a0ba75d6cc0b4aad4ef","slow_code":"#include <bits/stdc++.h>\n\n\n\nusing namespace std;\n\n\n\n#define MXN 100005\n\n#define x first\n\n#define y second\n\n                \n\n\n\ntypedef long long int LLI;\n\ntypedef pair<LLI,LLI> PII;\n\n\n\nconst int mod = 1e9+7;\n\n\n\nvector<PII> edges[MXN];\n\nLLI dist[2][MXN], ways[2][MXN];\n\npriority_queue<PII, vector<PII>, greater<PII> > pq;\n\nint u[MXN<<1], v[MXN<<1], d[MXN<<1];\n\nbool meet[MXN];\n\n\n\nvoid djikstra(int w, LLI cur) {\n\n  dist[w][cur] = 0;\n\n  ways[w][cur] = 1;\n\n  pq.push({0LL, cur});\n\n  LLI d;\n\n  while (pq.size()) {\n\n    d = pq.top().x, cur = pq.top().y;\n\n    pq.pop();\n\n    if (d > dist[w][cur]) continue;\n\n    for (PII nxt : edges[cur]) {\n\n      if (dist[w][nxt.x] > dist[w][cur] + nxt.y) {\n\n        dist[w][nxt.x] = dist[w][cur] + nxt.y;\n\n        ways[w][nxt.x] = ways[w][cur];\n\n        pq.push({dist[w][nxt.x], nxt.x});\n\n      } else if (dist[w][nxt.x] == dist[w][cur] + nxt.y) {\n\n        ways[w][nxt.x] += ways[w][cur];\n\n        if (ways[w][nxt.x] >= mod) ways[w][nxt.x] -= mod;\n\n      }\n\n    }\n\n  }\n\n}\n\n\n\ninline LLI sqmod(LLI k) {\n\nreturn (k*k) % mod;\n\n}\n\n\n\nint main() { \n\n  int n, m, s, t;\n\n  while (cin >> n >> m >> s >> t) {\n\n    for (int i = 0; i < m; ++i) {\n\n      cin >> u[i] >> v[i] >> d[i];\n\n      edges[u[i]].emplace_back(v[i], d[i]);\n\n      edges[v[i]].emplace_back(u[i], d[i]);\n\n    }\n\n    memset(dist, 0x3f, sizeof(dist));\n\n    memset(ways, 0, sizeof(ways));\n\n    djikstra(0, s);\n\n    djikstra(1, t);\n\n#ifdef debug\n\n    cout << dist[0][t] << \" \" << ways[0][t] << \"\\n\";\n\n    cout << dist[1][s] << \" \" << ways[1][s] << \"\\n\";\n\n#endif\n\n    assert(dist[0][t] == dist[1][s]);\n\n    assert(ways[0][t] == ways[1][s]);\n\n    LLI tmp, total = sqmod(ways[0][t]);\n\n    memset(meet, 0, sizeof(meet));\n\n    for (int i = 1; i <= n; ++i) {                  \n\n      if (dist[0][i] == dist[1][i] && dist[0][i] + dist[1][i] == dist[0][t]) {\n\n        tmp = (sqmod(ways[0][i]) * sqmod(ways[1][i])) % mod;\n\n        meet[i] = 1;\n\n#ifdef debug\n\n        cout << \"meet at \" << i << \" and subtract \" << tmp << \"\\n\";\n\n#endif\n\n        total -= tmp;\n\n        if (total < 0) total += mod;\n\n      }\n\n    }\n\n    for (int i = 0; i < m; ++i) {               \n\n      if (meet[u[i]] || meet[v[i]]) continue;\n\n      if (dist[0][u[i]] + d[i] + dist[1][v[i]] == dist[0][t]) {               \n\n        if ((dist[0][u[i]]<<1) < dist[0][t] && ((dist[0][u[i]] + d[i])<<1) > dist[0][t] &&\n\n            (dist[1][v[i]]<<1) < dist[0][t] && ((dist[1][v[i]] + d[i])<<1) > dist[0][t]) {\n\n          tmp = (sqmod(ways[0][u[i]]) * sqmod(ways[1][v[i]])) % mod;\n\n#ifdef debug\n\n          cout << \"meet between \" << u[i] << \" and \" << v[i] << \" and subtract \" << tmp << \"\\n\";\n\n#endif\n\n          total -= tmp;\n\n          if (total < 0) total += mod;\n\n        }\n\n      }\n\n      if (dist[1][u[i]] + d[i] + dist[0][v[i]] == dist[0][t]) {\n\n        if ((dist[1][u[i]]<<1) < dist[0][t] && ((dist[1][u[i]] + d[i])<<1) > dist[0][t] &&\n\n            (dist[0][v[i]]<<1) < dist[0][t] && ((dist[0][v[i]] + d[i])<<1) > dist[0][t]) {\n\n          tmp = (sqmod(ways[1][u[i]]) * sqmod(ways[0][v[i]])) % mod;\n\n#ifdef debug\n\n          cout << \"meet between \" << v[i] << \" and \" << u[i] << \" and subtract \" << tmp << \"\\n\";\n\n#endif\n\n          total -= tmp;\n\n          if (total < 0) total += mod;\n\n        }\n\n      }\n\n    }\n\n    total = (total + mod) % mod;\n\n    cout << total << \"\\n\";\n\n    for (int i = 1; i <= n; ++i) edges[i].clear();\n\n  }\n\n\n\n  return 0;\n\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\n#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))\n\n#define all(x) (x).begin(), (x).end()\n\n#define pb push_back\n\n#define fi first\n\n#define se second\n\n#define dbg(x) cout << #x \" = \" << ((x)) << endl\n\ntemplate <class T, class U> ostream &operator<<(ostream &o, const pair<T, U> &p) {\n  o << \"(\" << p.fi << \",\" << p.se << \")\";\n  return o;\n}\n\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &v) {\n  o << \"[\";\n  for (T t : v) {\n    o << t << \",\";\n  }\n  o << \"]\";\n  return o;\n}\n\nconst ll mod = 1e9 + 7;\n\nstruct edge {\n\n  int to;\n\n  ll cost;\n};\n\nconst int N = 100000;\n\nvector<edge> G[N];\n\nconst ll INF = LLONG_MAX / 3;\n\nvector<ll> dijk(int start, int n) {\n\n  vector<ll> d(n, INF);\n\n  d[start] = 0;\n\n  using P = pair<ll, int>;\n\n  priority_queue<P, vector<P>, greater<P>> pq;\n\n  pq.push({0, start});\n\n  while (!pq.empty()) {\n\n    P now = pq.top();\n\n    pq.pop();\n\n    int v = now.se;\n\n    if (now.fi > d[v])\n      continue;\n\n    for (const auto &e : G[v]) {\n\n      if (d[e.to] > d[v] + e.cost) {\n\n        d[e.to] = d[v] + e.cost;\n\n        pq.push({d[e.to], e.to});\n      }\n    }\n  }\n\n  return d;\n}\n\nvector<ll> pat(int start, int n, const vector<ll> &dd) {\n\n  vector<ll> ret(n);\n\n  ret[start] = 1;\n\n  using P = pair<ll, int>;\n\n  priority_queue<P, vector<P>, greater<P>> pq;\n\n  vector<bool> vis(n);\n\n  pq.push({0, start});\n\n  while (!pq.empty()) {\n\n    P now = pq.top();\n\n    pq.pop();\n\n    int v = now.se;\n\n    if (vis[v])\n      continue;\n\n    for (const auto &e : G[v]) {\n\n      if (dd[e.to] == dd[v] + e.cost) {\n\n        (ret[e.to] += ret[v]) %= mod;\n\n        pq.push({dd[e.to], e.to});\n      }\n    }\n\n    vis[v] = true;\n  }\n\n  return ret;\n}\n\nint main() {\n\n  int n, m, s, t;\n\n  cin >> n >> m >> s >> t;\n\n  --s;\n\n  --t;\n\n  vector<int> u(m), v(m);\n\n  vector<ll> d(m);\n\n  rep(i, m) {\n\n    cin >> u[i] >> v[i] >> d[i];\n\n    --u[i];\n\n    --v[i];\n\n    G[u[i]].pb({v[i], d[i]});\n\n    G[v[i]].pb({u[i], d[i]});\n  }\n\n  vector<ll> ds = dijk(s, n), dt = dijk(t, n);\n\n  ll D = ds[t];\n\n  vector<bool> ok(n);\n\n  rep(i, n) ok[i] = (ds[i] + dt[i] == D);\n\n  vector<ll> ps = pat(s, n, ds), pt = pat(t, n, dt);\n\n  ll ans = (ps[t] * ps[t]) % mod;\n\n  rep(i, m) {\n\n    int a = u[i], b = v[i];\n\n    if (!ok[a] || !ok[b])\n      continue;\n\n    if (ds[a] > dt[a] && ds[b] < dt[b])\n      swap(a, b);\n\n    if (ds[a] < dt[a] && ds[b] > dt[b] && ds[a] + d[i] == ds[b]) {\n\n      ll sub = (ps[a] * pt[b]) % mod;\n\n      sub = (sub * sub) % mod;\n\n      ans = (ans - sub + mod) % mod;\n    }\n  }\n\n  rep(i, n) if (ok[i] && ds[i] == dt[i]) {\n\n    ll sub = (ps[i] * pt[i]) % mod;\n\n    sub = (sub * sub) % mod;\n\n    ans = (ans - sub + mod) % mod;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"4c7dc9aac0b284d06510686465f4465035db2238916a03eeb4728336dd9218c6","fast_id":"fad3e166fde14ed5c72a16ad595dfe0c2c52e3d7327a21dcb54e739c7055a42c","fast_time":0.018595464,"language":"cpp","measured_fast_code_id":"fad3e166fde14ed5c72a16ad595dfe0c2c52e3d7327a21dcb54e739c7055a42c","measured_slow_code_id":"87504666c48f978ffe6b5cda5f6684f87f63e5a59231a22dbaa0c0d68e7e17ab","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_60519","problem_id":"p03787","slow_code_id":"9dea83724411cdb088931d60323eb9e75d4d8ed0db4b7bf3b45d98327c04417b","slow_id":"87504666c48f978ffe6b5cda5f6684f87f63e5a59231a22dbaa0c0d68e7e17ab","slow_time":0.4971530824,"speedup":26.735180278373264,"stratum":"8+","sampling_key":"183c371b6c757f78beda6b21c85654acaa61de18c1be3d4a76dfee971f659c90","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 100005, maxm = 400005;\n\nint last[maxn], pre[maxm], other[maxm], t, cal[maxn], vis[maxn], q[maxn], head,\n    tail;\n\nvoid add(int x, int y) {\n  ++t;\n  pre[t] = last[x];\n  last[x] = t;\n  other[t] = y;\n}\n\nint main() {\n\n  int n, m, x, y;\n\n  while (cin >> n >> m) {\n\n    ll I = 0, P = 0, Q = 0;\n\n    memset(last, 0, sizeof(last));\n    t = 0;\n    memset(vis, 0, sizeof(vis));\n\n    memset(pre, 0, sizeof(pre));\n    memset(other, 0, sizeof(other));\n\n    for (int i = 1; i <= m; ++i) {\n\n      scanf(\"%d%d\", &x, &y);\n      add(x, y);\n      add(y, x);\n    }\n\n    for (int i = 1; i <= n; ++i)\n      if (!vis[i]) {\n\n        head = tail = 0;\n        q[++tail] = i;\n        cal[i] = 0;\n        vis[i] = 1;\n\n        bool flag = 1;\n\n        while (head < tail) {\n\n          int u = q[++head];\n\n          for (int j = last[u]; j; j = pre[j]) {\n\n            int v = other[j];\n\n            if (!vis[v]) {\n\n              q[++tail] = v;\n              vis[v] = 1;\n              cal[v] = cal[u] + 1;\n\n            }\n\n            else {\n\n              if ((cal[v] - cal[u]) % 2 == 0)\n                flag = 0;\n            }\n          }\n        }\n\n        if (head == 1) {\n          ++I;\n          continue;\n        }\n\n        if (flag)\n          ++Q;\n\n        else\n          ++P;\n      }\n\n    cout << 2ll * I * n - I * I + P * P + 2ll * P * Q + 2ll * Q * Q << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#define maxn 100005\n\n#define maxm 200005\n\nint n, m, ia, pa, qa;\n\nbool f, val[maxn], vis[maxn];\n\nstruct node {\n  int v;\n  node *nxt;\n} edge[maxm * 2], *head[maxn], *ncnt;\n\nvoid addedge(int u, int v)\n\n{\n\n  ncnt++;\n\n  ncnt->v = v, ncnt->nxt = head[u];\n\n  head[u] = ncnt;\n}\n\nvoid dfs(int u)\n\n{\n\n  vis[u] = true;\n\n  for (node *p = head[u]; p; p = p->nxt)\n\n  {\n\n    int v = p->v;\n\n    if (!vis[v]) {\n      val[v] = val[u] ^ 1;\n      dfs(v);\n    }\n\n    else if (val[u] == val[v])\n      f = true;\n  }\n}\n\nint main()\n\n{\n\n  ncnt = &edge[0];\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    addedge(u, v);\n    addedge(v, u);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (!head[i])\n      ia++;\n\n    else if (!vis[i])\n\n    {\n\n      f = false;\n\n      dfs(i);\n\n      if (f)\n        pa++;\n\n      else\n        qa++;\n    }\n  }\n\n  printf(\"%lld\\n\",\n         1ll * ia * ia + 2ll * ia * (n - ia) + 1ll * pa * pa + 2ll * qa * qa + 2ll * pa * qa);\n}\n"}
{"fast_code_id":"580ad9285048cdd781116870521908975fc4fee52ddca1f8bab85dcb28ea08f7","fast_id":"bd4ed9205be24c7f30ed90e0f0151ef6d42d18dcdc18a4746cda3ebcb7b74df1","fast_time":0.0437589787,"language":"cpp","measured_fast_code_id":"bd4ed9205be24c7f30ed90e0f0151ef6d42d18dcdc18a4746cda3ebcb7b74df1","measured_slow_code_id":"d8a26ca2a62580efbe954d31176fcfd0503762f8678884fa03c6331e87805c6d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_60531","problem_id":"p03315","slow_code_id":"ea25a1d316aabb9228f5e5dceb3bb4834375e63b9f46daafe9b9c2ab275df0bd","slow_id":"d8a26ca2a62580efbe954d31176fcfd0503762f8678884fa03c6331e87805c6d","slow_time":0.4492298439,"speedup":10.266003852142006,"stratum":"8+","sampling_key":"dc0c535a9f254ab32d75879cab6fd88e03eb20abd2f220a4b6ac2070538bfe7e","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <deque>\n\n#include <algorithm>\n\n#include <numeric>\n\n#include <string>\n\n#include <cstring>\n\n#include <list>\n\n#include <unordered_set>\n\n#include <tuple>\n\n#include <cmath>\n\n#include <limits>\n\n#include <type_traits>\n\n#include <iomanip>\n\n#include <unordered_map>\n\nusing namespace std;\n\nnamespace {\n\nusing lint = long long;\n\nusing uli = unsigned long long;\n\nuli gcd(uli a, uli b) {\n\n  while (1) {\n\n    if (a < b)\n      swap(a, b);\n\n    if (!b)\n      break;\n\n    a %= b;\n  }\n\n  return a;\n}\n\nuli lcm(uli a, uli b)\n\n{\n\n  return a / gcd(a, b) * b;\n}\n\nconst uli mod = 1000000007;\n\nconst double pi = 3.141592653589793238462;\n\nconst lint intmax = 9223372036854775807;\n\nuli _PowMod(uli x, uli y, uli _mod)\n\n{\n\n  if (y == 0)\n\n  {\n\n    return 1;\n\n  }\n\n  else if (y == 1)\n\n  {\n\n    return x % _mod;\n\n  }\n\n  else if (y % 2 == 0)\n\n  {\n\n    auto tmp = _PowMod(x, y / 2, _mod);\n\n    return tmp * tmp % _mod;\n\n  }\n\n  else\n\n  {\n\n    auto tmp = _PowMod(x, y / 2, _mod);\n\n    return (tmp * tmp % _mod) * x % _mod;\n  }\n}\n\nuli PowMod(uli x, uli y)\n\n{\n\n  return _PowMod(x, y, mod);\n}\n\nuli getModInv(uli N)\n\n{\n\n  return PowMod(N, mod - 2);\n}\n\nlint nCrMod(lint start, lint n, lint r)\n\n{\n\n  if (n < r)\n\n  {\n\n    return 0;\n  }\n\n  lint a = start;\n\n  for (size_t i = n; i >= n - r + 1; i--)\n\n  {\n\n    a *= i;\n\n    a %= mod;\n  }\n\n  for (size_t i = 1; i <= r; i++)\n\n  {\n\n    a *= getModInv(i);\n\n    a %= mod;\n  }\n\n  return a;\n}\n\nlint nHrMod(lint start, lint n, lint r)\n\n{\n\n  return nCrMod(start, n + r - 1, r);\n}\n\nlint _nCrMod(lint start, lint n, lint r)\n\n{\n\n  if (n <= 0)\n\n  {\n\n    return 0;\n  }\n\n  return nCrMod(start, n, r);\n}\n\nstruct uf\n\n{\n\n  vector<lint> p;\n\n  uf(lint n)\n      : p(n)\n\n  {\n\n    for (size_t i = 0; i < n; i++)\n\n    {\n\n      p[i] = i;\n    }\n  }\n\n  lint rt(lint n)\n\n  {\n\n    return p[n] == n ? n : p[n] = rt(p[n]);\n  }\n\n  void un(lint n, lint m)\n\n  {\n\n    p[rt(n)] = p[rt(m)];\n  }\n\n  bool eq(lint n, lint m)\n\n  {\n\n    return rt(n) == rt(m);\n  }\n};\n\nbool lineCol(lint a1x, lint a1y, lint a2x, lint a2y, lint b1x, lint b1y, lint b2x, lint b2y)\n\n{\n\n  auto ta = (b1x - b2x) * (a1y - b1y) + (b1y - b2y) * (b1x - a1x);\n\n  auto tb = (b1x - b2x) * (a2y - b1y) + (b1y - b2y) * (b1x - a2x);\n\n  auto tc = (a1x - a2x) * (b1y - a1y) + (a1y - a2y) * (a1x - b1x);\n\n  auto td = (a1x - a2x) * (b2y - a1y) + (a1y - a2y) * (a1x - b2x);\n\n  return tc * td < 0 && ta * tb < 0;\n}\n\nlint powInt(lint a, lint b)\n\n{\n\n  if (b == 0)\n\n  {\n\n    return 1;\n  }\n\n  if (b == 1)\n\n  {\n\n    return a;\n  }\n\n  lint tmp = powInt(a, b / 2);\n\n  return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);\n}\n\nlint _sMod(string n, lint mod)\n\n{\n\n  lint k = (n[0] - '0') % mod;\n\n  for (size_t i = 1; i < n.length(); i++)\n\n  {\n\n    k *= 10;\n\n    k += (n[i] - '0');\n\n    k %= mod;\n  }\n\n  return k;\n}\n\n#define vec(name, n) vector<lint> name(n)\n\n#define vec_(name, n, init) vector<lint> name(n, init)\n\n#define vecs(name, n) vector<string> name(n)\n\n#define vect(t, name, n) vector<t> name(n)\n\n#define vec2(name, n, m) vector<vector<lint>> name(n, vector<lint>(m))\n\n#define vec2_(name, n, m, init) vector<vector<lint>> name(n, vector<lint>(m, init))\n\n#define rep(i, n) for (lint i = 0; i < n; i++)\n\n#define repi(i, n, z) for (lint i = z; i < n; i++)\n\n#define mmax(a, b) max((lint)a, (lint)b)\n\n#define mmin(a, b) min((lint)a, (lint)b)\n\ntemplate <typename T>\n\nvoid vsort(vector<T> &v)\n\n{\n\n  sort(v.begin(), v.end());\n}\n\ntemplate <typename T>\n\nvoid vsortr(vector<T> &v)\n\n{\n\n  sort(v.rbegin(), v.rend());\n}\n\nlint div2(lint p, lint q)\n\n{\n\n  return (p + q - 1) / q;\n}\n\nstruct xy\n\n{\n\n  lint x, y;\n\n  xy() : x(0), y(0) {}\n\n  xy(lint _x, lint _y) : x(_x), y(_y) {}\n};\n\ntemplate <class It, class T>\n\nbool exist(It begin, It end, const T &val)\n\n{\n\n  return find(begin, end, val) != end;\n}\n\ntemplate <class It, class Pr>\n\nbool exist_if(It begin, It end, Pr pred)\n\n{\n\n  return find_if(begin, end, pred) != end;\n}\n\nlint n_dig(lint n)\n\n{\n\n  lint ans = 0;\n\n  while (n > 0)\n\n  {\n\n    n /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\ntemplate <class T, class T2>\n\nT2 ler(T val1, T val2, T2 l, T2 e, T2 r)\n\n{\n\n  if (val1 < val2)\n\n    return r;\n\n  if (val1 > val2)\n\n    return l;\n\n  return e;\n}\n\nconst lint alpn = 'z' - 'a' + 1;\n\ntemplate <class T>\n\nT sgn(T val)\n\n{\n\n  if (val == T(0))\n\n    return T(0);\n\n  if (val < 0)\n\n    return T(-1);\n\n  if (val > 0)\n\n    return T(1);\n}\n\ntemplate <class T>\n\nbool between(T val, T l, T r)\n\n{\n\n  return (val >= l) && (val <= r);\n}\n\n#define all(v) v.begin(), v.end()\n\n#define rall(v) v.rbegin(), v.rend()\n\ntemplate <class It>\n\nvector<lint> carr(It begin, It end) {\n\n  vec(c, 0);\n\n  c.push_back(1);\n\n  auto before = *begin;\n\n  for (auto it = begin + 1; it != end; it++) {\n\n    if (before != *it) {\n\n      c.push_back(0);\n\n      before = *it;\n    }\n\n    c.back()++;\n  }\n\n  return c;\n}\n\ntemplate <class T>\n\nstruct nval {\n\n  lint n;\n\n  T val;\n\n  nval() : n(0){};\n\n  nval(lint _n, T _val) : n(_n), val(_val){};\n};\n\ntemplate <class It>\n\nauto carr2(It begin, It end) {\n\n  using T = nval<remove_reference_t<decltype(*begin)>>;\n\n  vect(T, c, 0);\n\n  c.push_back(T(1, *begin));\n\n  auto before = *begin;\n\n  for (auto it = begin + 1; it != end; it++) {\n\n    if (before != *it) {\n\n      c.push_back(T(0, *it));\n\n      before = *it;\n    }\n\n    c.back().n++;\n  }\n\n  return c;\n}\n\nlint sumdig(lint n) {\n\n  lint ans = 0;\n\n  while (n > 0) {\n\n    ans += n % 10;\n\n    n /= 10;\n  }\n\n  return ans;\n}\n\nlint getdig(lint n, lint d) { return (n / powInt(10, d)) % 10; }\n\ntemplate <typename It, typename T>\n\nvoid sort2(It begin, It end, T It::value_type::*p)\n\n{\n\n  using val_t = remove_reference_t<decltype(*begin)>;\n\n  sort(begin, end, [p](val_t a, val_t b) { return a.*p < b.*p; });\n}\n\ntemplate <typename It, typename T, typename T2>\n\nvoid sort3(It begin, It end, T It::value_type::*p, T2 It::value_type::*p2)\n\n{\n\n  using val_t = remove_reference_t<decltype(*begin)>;\n\n  sort(begin, end, [p, p2](val_t a, val_t b) {\n    if (a.*p != b.*p) {\n      return a.*p < b.*p;\n    }\n\n    else {\n      return a.*p2 > b.*p2;\n    }\n  });\n}\n\n}             \n\nvec2(tr, 200010, 0);\n\nvec_(c, 200010, 0);\n\nvec_(ans, 200010, -1);\n\nvoid grt(lint s, lint pos) {\n\n  ans[pos] = s + c[pos];\n\n  rep(i, tr[pos].size()) {\n\n    auto child = tr[pos][i];\n\n    if (ans[child] == -1) {\n\n      grt(ans[pos], child);\n    }\n  }\n}\n\nint main()\n\n{\n\n  string s;\n\n  cin >> s;\n\n  lint p = count(all(s), '+');\n\n  lint m = count(all(s), '-');\n\n  cout << p - m << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <deque>\n\n#include <algorithm>\n\n#include <numeric>\n\n#include <string>\n\n#include <cstring>\n\n#include <list>\n\n#include <unordered_set>\n\n#include <tuple>\n\n#include <cmath>\n\n#include <limits>\n\n#include <type_traits>\n\n#include <iomanip>\n\n#include <unordered_map>\n\n#include <queue>\n\n#include <stack>\n\n#include <set>\n\n#include <bitset>\n\n#include <regex>\n\nusing namespace std;\n\n#define rep(i, n) for (lint i = 0; i < n; i++)\n\n#define repr(i, n) for (lint i = n - 1; i >= 0; i--)\n\n#define repi(i, ini, n) for (lint i = ini; i < n; i++)\n\n#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)\n\n#define repb(i, start, end) for (lint i = start; i <= end; i++)\n\n#define repbr(i, start, end) for (lint i = end; i >= start; i--)\n\n#define bit(n) (1LL << n)\n\n#define brep(i, n) rep(i, bit(n))\n\n#define brepi(i, ini, n) repi(i, ini, bit(n))\n\n#define all(v) v.begin(), v.end()\n\n#define rall(v) v.rbegin(), v.rend()\n\n#define rg(v, n) v.begin(), v.begin() + n\n\n#define rrg(v, n) v.rbegin(), v.rbegin() + n\n\n#define ret return 0;\n\nnamespace {\n\nusing lint = long long;\n\nusing ulint = unsigned long long;\n\nusing ld = long double;\n\nstruct xy\n\n{\n\n  lint x, y;\n\n  xy() : x(0), y(0) {}\n\n  xy(lint _x, lint _y) : x(_x), y(_y) {}\n\n  xy operator+(const xy &p) const\n\n  {\n\n    return xy(x + p.x, y + p.y);\n  }\n\n  bool operator<(xy p) const\n\n  {\n\n    if (y == p.y)\n\n      return x < p.x;\n\n    return y < p.y;\n  }\n};\n\nstruct xyd\n\n{\n\n  ld x, y;\n\n  xyd() : x(0), y(0) {}\n\n  xyd(long double _x, long double _y) : x(_x), y(_y) {}\n};\n\nusing vec = vector<lint>;\n\nusing vecd = vector<ld>;\n\nusing vecs = vector<string>;\n\nusing vecp = vector<xy>;\n\ntemplate <class T> using vect = vector<T>;\n\nclass vec2 : public vector<vector<lint>>\n\n{\n\npublic:\n  vec2() {}\n\n  vec2(lint n) : vector(n) {}\n\n  vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}\n\n  vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}\n};\n\ntemplate <class T> using priq = priority_queue<T>;\n\ntemplate <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;\n\nconst ulint mod = 1000000007;\n\nconst double pi = 3.141592653589793238462;\n\nconst lint intmax = 9223372036854775807;\n\nconst lint inf = 1100100100100100100LL;\n\nconst ld eps = 0.0000001;\n\nconst lint alpn = 'z' - 'a' + 1;\n\ntemplate <class T>\n\nconstexpr auto msum(T arg0)\n\n{\n\n  return arg0;\n}\n\ntemplate <class T, class... Types>\n\nconstexpr auto msum(T arg0, Types... args)\n\n{\n\n  static_assert(sizeof...(args) > 0, \"arg err\");\n\n  return arg0 + msum(args...);\n}\n\ntemplate <class It>\n\nconstexpr typename It::value_type mmax(It begin, It end)\n\n{\n\n  return *max_element(begin, end);\n}\n\ntemplate <class It>\n\nconstexpr typename It::value_type mmin(It begin, It end)\n\n{\n\n  return *min_element(begin, end);\n}\n\ntemplate <class T>\n\nconstexpr auto mmax(T arg)\n\n{\n\n  return arg;\n}\n\ntemplate <class T, class... Types>\n\nconstexpr auto mmax(T arg0, Types... args)\n\n{\n\n  using promote_t = decltype(msum(arg0, args...));\n\n  return max(static_cast<promote_t>(arg0), static_cast<promote_t>(mmax(args...)));\n}\n\ntemplate <class T>\n\nconstexpr auto mmin(T arg)\n\n{\n\n  return arg;\n}\n\ntemplate <class T, class... Types>\n\nconstexpr auto mmin(T arg0, Types... args)\n\n{\n\n  using promote_t = decltype(msum(arg0, args...));\n\n  return min(static_cast<promote_t>(arg0), static_cast<promote_t>(mmin(args...)));\n}\n\ntemplate <class T>\n\nstruct Mplus\n\n{\n\n  T operator()(const T &a, const T &b)\n\n  {\n\n    return a + b;\n  }\n\n  const static T id = T(0);\n};\n\ntemplate <\n\n    class It,\n\n    class T = typename It::value_type,\n\n    class Monoid = Mplus<T>>\n\nT acc(It begin, It end, Monoid f = Mplus<T>())\n\n{\n\n  return accumulate(begin, end, Monoid::id, f);\n}\n\nconstexpr auto clamp(lint val, lint left, lint right)\n\n{\n\n  return mmax(mmin(val, right), left);\n}\n\nconstexpr lint div2(lint p, lint q)\n\n{\n\n  return (p + q - 1) / q;\n}\n\n#if (__cplusplus < 201703L)\n\nlint gcd(lint a, lint b) {\n\n  while (1) {\n\n    if (a < b)\n      swap(a, b);\n\n    if (!b)\n      break;\n\n    a %= b;\n  }\n\n  return a;\n}\n\nlint lcm(lint a, lint b)\n\n{\n\n  return a / gcd(a, b) * b;\n}\n\n#endif\n\nlint powInt(lint a, lint b)\n\n{\n\n  if (b == 0)\n\n  {\n\n    return 1;\n  }\n\n  if (b == 1)\n\n  {\n\n    return a;\n  }\n\n  lint tmp = powInt(a, b / 2);\n\n  return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);\n}\n\ntemplate <class T>\n\nT sgn(T val)\n\n{\n\n  if (val == T(0))\n\n    return T(0);\n\n  if (val < 0)\n\n    return T(-1);\n\n  if (val > 0)\n\n    return T(1);\n}\n\ntemplate <class T>\n\nconstexpr auto modK_belowN(T k, T MOD, T n)\n\n{\n\n  return (n + MOD - k - 1) / MOD;\n}\n\ntemplate <class It, class T>\n\nbool exist(It begin, It end, const T &val)\n\n{\n\n  return find(begin, end, val) != end;\n}\n\ntemplate <class It, class Pr>\n\nbool exist_if(It begin, It end, Pr pred)\n\n{\n\n  return find_if(begin, end, pred) != end;\n}\n\ntemplate <class T>\n\nbool between(T val, T l, T r)\n\n{\n\n  return (val >= l) && (val <= r);\n}\n\ntemplate <class It>\n\nauto carr(It begin, It end) {\n\n  vec c;\n\n  c.push_back(1);\n\n  auto before = *begin;\n\n  for (auto it = begin + 1; it != end; it++) {\n\n    if (before != *it) {\n\n      c.push_back(0);\n\n      before = *it;\n    }\n\n    c.back()++;\n  }\n\n  return c;\n}\n\ntemplate <class T>\n\nstruct nval {\n\n  lint n;\n\n  T val;\n\n  nval() : n(0){};\n\n  nval(lint _n, T _val) : n(_n), val(_val){};\n};\n\ntemplate <class It>\n\nauto carr2(It begin, It end) {\n\n  using T = nval<remove_reference_t<decltype(*begin)>>;\n\n  vect<T> c;\n\n  c.push_back(T(1, *begin));\n\n  auto before = *begin;\n\n  for (auto it = begin + 1; it != end; it++) {\n\n    if (before != *it) {\n\n      c.push_back(T(0, *it));\n\n      before = *it;\n    }\n\n    c.back().n++;\n  }\n\n  return c;\n}\n\ntemplate <class It, class... T>\n\nvoid sort2(It begin, It end, T... p)\n\n{\n\n  using val_t = remove_reference_t<decltype(*begin)>;\n\n  sort(begin, end, [p...](val_t a, val_t b) {\n    bool neq[] = {(a.*p != b.*p)...};\n\n    bool sg[] = {(a.*p < b.*p)...};\n\n    rep(i, sizeof...(p)) {\n\n      if (neq[i])\n\n      {\n\n        return sg[i];\n      }\n    }\n\n    return false;\n  });\n}\n\ntemplate <size_t _K, size_t _N, class... Types, size_t... indices>\n\nauto constexpr __ModKtuple_Impl(index_sequence<indices...>, tuple<Types...> args)\n\n{\n\n  return make_tuple(get<indices * _N + _K>(args)...);\n}\n\ntemplate <size_t K, size_t N, class... Types>\n\nauto constexpr ModKtuple(Types... args)\n\n{\n\n  return __ModKtuple_Impl<K, N>(make_index_sequence<modK_belowN(K, N, sizeof...(args))>{},\n                                forward_as_tuple(args...));\n}\n\ntemplate <class It, class... T, class... Tsg, size_t... indices>\n\nvoid __sort3_Impl(It begin, It end, tuple<T...> p, tuple<Tsg...> sgf, index_sequence<indices...>)\n\n{\n\n  using val_t = remove_reference_t<decltype(*begin)>;\n\n  sort(begin, end, [p, sgf](val_t a, val_t b) {\n    bool neq[] = {(a.*(get<indices>(p)) != b.*(get<indices>(p)))...};\n\n    bool sg[] = {((a.*(get<indices>(p)) < b.*(get<indices>(p))) != (get<indices>(sgf)))...};\n\n    rep(i, sizeof...(indices)) {\n\n      if (neq[i])\n\n      {\n\n        return sg[i];\n      }\n    }\n\n    return false;\n  });\n}\n\ntemplate <class It, class... T>\n\nvoid sort3(It begin, It end, T... p)\n\n{\n\n  using val_t = remove_reference_t<decltype(*begin)>;\n\n  auto p_forward = ModKtuple<0, 2>(p...);\n\n  auto sgf_forward = ModKtuple<1, 2>(p...);\n\n  constexpr auto p_sz = tuple_size<decltype(p_forward)>::value;\n\n  constexpr auto sgf_sz = tuple_size<decltype(sgf_forward)>::value;\n\n  static_assert(p_sz == sgf_sz, \"arg err\");\n\n  __sort3_Impl(begin, end, p_forward, sgf_forward, make_index_sequence<p_sz>{});\n}\n\ntemplate <class It, class It2>\n\nauto spacel(It i, It2 end)\n\n{\n\n  if (i + 1 == end)\n\n  {\n\n    return '\\n';\n\n  }\n\n  else\n\n  {\n\n    return ' ';\n  }\n}\n\ntemplate <class It>\n\nbool next_comb(lint n, It begin, It end)\n\n{\n\n  auto rend = make_reverse_iterator(begin);\n\n  auto rbegin = make_reverse_iterator(end);\n\n  auto rit = rbegin;\n\n  for (; rit != rend; rit++)\n\n  {\n\n    if ((rit == rbegin && (*rit) + 1 != n) ||\n\n        (rit != rbegin && (*rit) + 1 != *(rit - 1)))\n\n    {\n\n      goto found;\n    }\n  }\n\n  return false;\n\nfound:;\n\n  (*rit)++;\n\n  for (auto it = rit.base(); it != end; it++)\n\n  {\n\n    (*it) = (*(it - 1)) + 1;\n  }\n\n  return true;\n}\n\nostream &setp(ostream &ost)\n\n{\n\n  cout << setprecision(60) << fixed;\n\n  return ost;\n}\n\n#ifdef _LOCAL\n\nauto &dbg = cout;\n\n#else\n\nstruct dummy_cout\n\n{\n\n  template <class T>\n\n  dummy_cout &operator<<(T &&op)\n\n  {\n\n    return *this;\n  }\n\n  using endl_t = basic_ostream<char, char_traits<char>>;\n\n  dummy_cout &operator<<(endl_t &(*)(endl_t &))\n\n  {\n\n    return *this;\n  }\n};\n\ndummy_cout dbg;\n\n#endif\n\n};             \n\nint main()\n\n{\n\n  string s;\n\n  cin >> s;\n\n  cout << lint(count(all(s), '+')) - (lint)count(all(s), '-') << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"9e4e11481b628ad865f0bea59eb979a5c72012521054021fd3622b3578453fac","fast_id":"e2d165a261ebfe7d0feed86558f847f866c1ff6fd1d6d1d6d28c6aca8c4e08f9","fast_time":0.0187969167,"language":"cpp","measured_fast_code_id":"e2d165a261ebfe7d0feed86558f847f866c1ff6fd1d6d1d6d28c6aca8c4e08f9","measured_slow_code_id":"c4a024eb9d43967900ec2ae0a8c6c76336c72db8f8036a14556037aade4db120","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_60535","problem_id":"p03007","slow_code_id":"d40dc559b4082e75cc551c340e989c2e32457c796b3939b369efc2276d39be19","slow_id":"c4a024eb9d43967900ec2ae0a8c6c76336c72db8f8036a14556037aade4db120","slow_time":0.1165920167,"speedup":6.2027202950790326,"stratum":"4-8","sampling_key":"f0b406206b17c792c3b85bf31b8f8624b39ad988b56620c7bdba7d9c0e0b71bb","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define maxn 500005\n\n#define INF 0x3f3f3f3f\n\nusing namespace std;\n\nint n;\n\nint a[maxn];\n\nstruct Node {\n\n  int x, y;\n\n  Node() : x(0), y(0) {}\n\n  Node(int xx, int yy) : x(xx), y(yy) {}\n};\n\nvector<Node> ans;\n\nbool vis[maxn];\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  int da = 0, xiao = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%d\", &a[i]);\n\n    if (a[i] >= 0)\n      da++;\n\n    else\n\n      xiao++;\n  }\n\n  if (!xiao) {\n\n    sort(a + 1, a + 1 + n);\n\n    int p = a[1];\n\n    for (int i = 2; i <= n - 1; i++) {\n\n      ans.push_back(Node(p, a[i]));\n\n      p -= a[i];\n    }\n\n    ans.push_back(Node(a[n], p));\n\n    printf(\"%d\\n\", a[n] - p);\n\n  }\n\n  else if (!da) {\n\n    sort(a + 1, a + 1 + n);\n\n    int p = a[n];\n\n    for (int i = n - 1; i >= 2; i--) {\n\n      ans.push_back(Node(p, a[i]));\n\n      p -= a[i];\n    }\n\n    ans.push_back(Node(p, a[1]));\n\n    printf(\"%d\\n\", p - a[1]);\n\n  }\n\n  else {\n\n    int fu = INF, z = INF;\n\n    sort(a + 1, a + 1 + n);\n\n    memset(vis, false, sizeof(vis));\n\n    for (int i = 1; i <= n; i++) {\n\n      if (a[i] < 0 && fu == INF) {\n\n        fu = a[i];\n\n        vis[i] = true;\n\n        break;\n      }\n    }\n\n    for (int i = n; i >= 1; i--) {\n\n      if (a[i] >= 0 && z == INF) {\n\n        z = a[i];\n\n        vis[i] = true;\n\n        break;\n      }\n    }\n\n    for (int i = 1; i <= n; i++) {\n\n      if (!vis[i]) {\n\n        if (a[i] >= 0) {\n\n          ans.push_back(Node(fu, a[i]));\n\n          fu -= a[i];\n\n        }\n\n        else {\n\n          ans.push_back(Node(z, a[i]));\n\n          z -= a[i];\n        }\n      }\n    }\n\n    ans.push_back(Node(z, fu));\n\n    printf(\"%d\\n\", z - fu);\n  }\n\n  for (int i = 0; i < ans.size(); i++) {\n\n    printf(\"%d %d\\n\", ans[i].x, ans[i].y);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int SIZEN = 100010;\n\ntypedef long long LL;\n\nint N;\n\nLL a[SIZEN] = {0};\n\nint main() {\n\n  scanf(\"%d\", &N);\n\n  for (int i = 1; i <= N; i++)\n    scanf(\"%lld\", &a[i]);\n\n  sort(a + 1, a + 1 + N);\n\n  LL ans = 0;\n\n  if (a[1] >= 0) {\n\n    for (int i = 2; i <= N; i++)\n      ans += a[i];\n\n    ans -= a[1];\n\n    printf(\"%lld\\n\", ans);\n\n    for (int i = 2; i < N; i++) {\n\n      printf(\"%lld %lld\\n\", a[1], a[i]);\n\n      a[1] -= a[i];\n    }\n\n    printf(\"%lld %lld\\n\", a[N], a[1]);\n\n  }\n\n  else if (a[N] <= 0) {\n\n    for (int i = 1; i < N; i++)\n      ans += a[i];\n\n    ans = a[N] - ans;\n\n    printf(\"%lld\\n\", ans);\n\n    for (int i = 1; i < N; i++) {\n\n      printf(\"%lld %lld\\n\", a[N], a[i]);\n\n      a[N] -= a[i];\n    }\n\n  }\n\n  else {\n\n    for (int i = 1; i <= N; i++)\n      ans += abs(a[i]);\n\n    printf(\"%lld\\n\", ans);\n\n    for (int i = 2; i < N; i++) {\n\n      if (a[i] < 0)\n        printf(\"%lld %lld\\n\", a[N], a[i]), a[N] -= a[i];\n\n      else\n        printf(\"%lld %lld\\n\", a[1], a[i]), a[1] -= a[i];\n    }\n\n    printf(\"%lld %lld\\n\", a[N], a[1]);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"5c682a3177e44a83fa69734dd10585b0cea3dcc02fa9835d16c53fbf4a6095e0","fast_id":"f6e689d7df35590e2d71d27213e43a8c36b75f5c58028a65ed5a1fa559e02fac","fast_time":0.0233111919,"language":"cpp","measured_fast_code_id":"f6e689d7df35590e2d71d27213e43a8c36b75f5c58028a65ed5a1fa559e02fac","measured_slow_code_id":"de1b37c0c7fe59eb98d8d9f47de1b53b2f373501304126c892cfdb3a4692fd8c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_60539","problem_id":"p01220","slow_code_id":"476afb3a034db72bb6cb79e7b29eb5689149282b8aac0afa967484c01e49b280","slow_id":"de1b37c0c7fe59eb98d8d9f47de1b53b2f373501304126c892cfdb3a4692fd8c","slow_time":0.1061955941,"speedup":4.555562605102144,"stratum":"4-8","sampling_key":"cf2ea99485a0fe775275d82ae1afbc36111bc07d3d2257567deba5d7f20419f8","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <complex>\n\n#include <vector>\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef complex<double> P;\n\nconst double eps = 1.0e-7;\n\nconst double pi = acos(-1);\n\nbool equals(double a, double b) { return abs(a - b) < eps; }\n\nbool equals(P a, P b) { return equals(a.real(), b.real()) && equals(a.imag(), b.imag()); }\n\nnamespace std {\n\nbool operator<(const P &a, const P &b) {\n\n  if (!equals(a.real(), b.real()))\n    return a.real() < b.real();\n\n  if (!equals(a.imag(), b.imag()))\n    return a.imag() < b.imag();\n\n  return false;\n}\n\n}                 \n\nP rotate(P p, double rad) {\n\n  return P(cos(rad) * p.real() - sin(rad) * p.imag(),\n\n           sin(rad) * p.real() + cos(rad) * p.imag());\n}\n\ndouble solve(int N) {\n\n  const static double r2 = 1.0 / (2.0 * (1.0 - cos(pi * 2.0 / 3.0)));\n\n  vector<P> ps;\n\n  vector<P> tri;\n\n  tri.push_back(P(1.0, 0.0));\n\n  tri.push_back(rotate(P(1.0, 0.0), pi * 2.0 / 3.0));\n\n  tri.push_back(rotate(P(1.0, 0.0), -pi * 2.0 / 3.0));\n\n  double d = pi * 2.0 / (double)N;\n\n  for (int i = 0; i < N; ++i) {\n\n    for (int j = 0; j < tri.size(); ++j) {\n\n      ps.push_back(rotate(tri[j], pi * 2.0 * i / (double)N));\n    }\n  }\n\n  sort(ps.begin(), ps.end());\n\n  int n = ps.size();\n\n  for (int i = 1; i < ps.size(); ++i)\n\n    n -= equals(ps[i - 1], ps[i]);\n\n  double rad = pi * 2.0 / (double)n;\n\n  double rad2 = (pi * (n - 2) / (double)n - pi / 3.0) / 2.0;\n\n  double l2 = 2.0 * r2 * (1.0 - cos(rad));\n\n  return r2 * pi - n * ((rad - sin(rad)) * r2 / 2.0 + tan(rad2) * l2 / 4.0);\n}\n\nint main() {\n\n  int n;\n\n  while (scanf(\"%d\", &n) != EOF && n)\n    printf(\"%.6f\\n\", solve(n));\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cmath>\n\nusing namespace std;\n\nconst double eps = 1.0e-7;\n\nconst double pi = acos(-1);\n\nbool equals(double a, double b) { return abs(a - b) < eps; }\n\nint main() {\n\n  const static double rr = 1.0 / (2.0 * (1.0 - cos(pi * 2.0 / 3.0)));\n\n  double N;\n\n  while (scanf(\"%lf\", &N) != EOF && N) {\n\n    double n;\n\n    for (n = 1; n < N && !equals(0, fmod(3 * n, N)); n += 1)\n      ;\n\n    n *= 3;\n\n    printf(\"%.6f\\n\",\n\n           rr * pi - n * ((pi * 2 / n - sin(pi * 2 / n)) * rr / 2.0\n\n                          + tan((pi * (n - 2) / n - pi / 3.0) / 2.0) * 2 * rr *\n                                (1 - cos(pi * 2 / n)) / 4.0));\n  }\n\n  return 0;\n}"}
{"fast_code_id":"bae6c88a06d52929df568bf2a36a147eb8c3ca567a5f8d1d26f453f2f06a7cf3","fast_id":"5b191b959d15e835e97bac8b2f600e65a4760a7a3520a8e194f516535bccc291","fast_time":0.0647481469,"language":"cpp","measured_fast_code_id":"5b191b959d15e835e97bac8b2f600e65a4760a7a3520a8e194f516535bccc291","measured_slow_code_id":"bc70232b5048e6c904a6a60eacf962475e0105c87bd4efabf122bede6bf320fc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_606","problem_id":"p01450","slow_code_id":"0f7ebc807c0fe29f7df0952394e9272849c33f4d4344bfa4a0c59c4a02e647b9","slow_id":"bc70232b5048e6c904a6a60eacf962475e0105c87bd4efabf122bede6bf320fc","slow_time":0.6087644846,"speedup":9.402037181700408,"stratum":"8+","sampling_key":"1995e03ef10227e303f19cca029b43bcaa56576098c4c167a195ab2aa1eba914","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\nconst int MOD = 1000000007;\n\nint main() {\n\n  int N, W;\n\n  static int dp[201][10001];\n\n  while (cin >> N >> W) {\n\n    vector<int> w(N);\n\n    for (int i = 0; i < N; i++)\n      cin >> w[i];\n\n    sort(w.begin(), w.end());\n\n    memset(dp, 0, sizeof(dp));\n\n    dp[N][0] = 1;\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      for (int j = i + 1; j <= N; j++) {\n\n        for (int k = W; k >= 0; k--) {\n\n          dp[i][k] = (dp[i][k] + dp[j][k]) % MOD;\n\n          if (k + w[i] <= W)\n            dp[j][k + w[i]] = (dp[j][k + w[i]] + dp[j][k]) % MOD;\n\n          dp[j][k] = 0;\n        }\n      }\n    }\n\n    int res = 0;\n\n    for (int i = 0; i <= N; i++) {\n\n      for (int j = 0; j <= W; j++) {\n\n        if (i == N || j + w[i] > W)\n          res = (res + dp[i][j]) % MOD;\n      }\n    }\n\n    cout << res << endl;\n  }\n}","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <numeric>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MOD = 1000000007;\n\nint solve(const vector<int> &w, int W) {\n\n  if (w.back() > W || w.size() == 1)\n    return 1;\n\n  int sum = accumulate(w.begin(), w.end(), 0);\n\n  if (sum <= W)\n    return 1;\n\n  vector<int> dp(W + 1, 0);\n\n  dp[0] = 1;\n\n  int res = 0;\n\n  for (int i = 0; i < w.size(); i++) {\n\n    for (int j = W - w[i]; j >= 0; j--) {\n\n      dp[j + w[i]] += dp[j];\n\n      dp[j + w[i]] %= MOD;\n    }\n\n    sum -= w[i];\n\n    for (int j = max(0, W - sum - w[i] + 1);\n         j <= W - sum - (i == w.size() - 1 ? 0 : w[i + 1]); j++) {\n\n      res = (res + dp[j]) % MOD;\n    }\n  }\n\n  return res;\n}\n\nint main() {\n\n  int N, W;\n\n  while (cin >> N >> W) {\n\n    vector<int> w(N);\n\n    for (auto &t : w)\n      cin >> t;\n\n    sort(w.rbegin(), w.rend());\n\n    cout << solve(w, W) << endl;\n  }\n}\n"}
{"fast_code_id":"32144271c951f635f0e6a85eabc0bed9b30f7fccf59ed127520bb25a543cb208","fast_id":"159fcd4c740aca67e326f735051cf0c8aa6c0ff701a73279f3cf9a8bc9f3ad6a","fast_time":0.0750307584,"language":"cpp","measured_fast_code_id":"159fcd4c740aca67e326f735051cf0c8aa6c0ff701a73279f3cf9a8bc9f3ad6a","measured_slow_code_id":"4a827f944b10557c1195b6e05280de15d068b2b16e5afe73390d1a6233798dce","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_60971","problem_id":"p02716","slow_code_id":"14ddcbf0ab76dcd893ac794a3156c3d8bdb2388a10c53ebc5398cbbd93e422ce","slow_id":"4a827f944b10557c1195b6e05280de15d068b2b16e5afe73390d1a6233798dce","slow_time":0.9012636965,"speedup":12.011923052879606,"stratum":"8+","sampling_key":"0bcd11ba4a2a162fc49a5d5c29fed7ef1ef27367c7cc62c00cf4cdbf3aae1850","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <typename Arg1>\n\nvoid __f(const char *name, Arg1 &&arg1) {\n\n  cerr << name << \" : \" << arg1 << \"\\n\";\n}\n\ntemplate <typename Arg1, typename... Args>\n\nvoid __f(const char *na, Arg1 &&arg1, Args &&... args) {\n\n  const char *c = strchr(na + 1, ',');\n\n  cerr.write(na, c - na) << \" : \" << arg1 << \" , \";\n\n  __f(c + 1, args...);\n}\n\n#define endl \"\\n\"\n\n#define all(v) v.begin(), v.end()\n\n#define UNIQUE(v) sort(all(v)), v.erase(unique(all(v)), v.end())\n\ntypedef long long LL;\n\ntypedef pair<int, int> pii;\n\nconst double pi = acos(-1.0);\n\nconst double eps = 1e-8;\n\nconst int mod = 1e9 + 7;\n\nconst int inf = 1e9;\n\nconst LL INF = 1e16;\n\nconst int N = 2e5 + 5;\n\nmap<LL, LL> dp[N];\n\nint n;\n\nLL a[N];\n\nLL solve(int idx, int taken) {\n\n  int need = n / 2 - (n - idx + 1) / 2;\n\n  if (taken < need)\n    return -INF;\n\n  if (idx >= n)\n    return taken == n / 2 ? 0 : -INF;\n\n  if (dp[idx].count(taken))\n    return dp[idx][taken];\n\n  LL ret = -INF;\n\n  ret = max(ret, solve(idx + 2, taken + 1) + a[idx]);\n\n  ret = max(ret, solve(idx + 1, taken));\n\n  return dp[idx][taken] = ret;\n}\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(0);\n  cout.tie(0);\n\n#ifdef LOCAL\n\n  freopen(\"input.txt\", \"r\", stdin);\n\n#endif\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n\n  cout << solve(0, 0) << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long dp[200005], sum[200005], s[200005];\n\nint main()\n\n{\n\n  int n;\n\n  while (cin >> n)\n\n  {\n\n    for (int i = 1; i <= n; i++)\n\n      cin >> s[i];\n\n    for (int i = 1; i <= n; i++)\n\n    {\n\n      if (i == 1)\n\n        sum[i] = s[i];\n\n      else\n\n        sum[i] = sum[i - 2] + s[i];\n    }\n\n    for (int i = 2; i <= n; i++)\n\n    {\n\n      if (i % 2 == 0)\n\n      {\n\n        dp[i] = max(dp[i - 2] + s[i], sum[i - 1]);\n\n      }\n\n      else\n\n      {\n\n        dp[i] = max(dp[i - 2] + s[i], dp[i - 1]);\n      }\n    }\n\n    cout << dp[n] << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"73efd85a0fe981a25238d619f62e0e5b01258f6f92369efe53d10c207525d246","fast_id":"92cfadd4d9c0e0a3776e19628639ee7ab8b980570b119bd9beae020048143f58","fast_time":0.0070534633,"language":"cpp","measured_fast_code_id":"92cfadd4d9c0e0a3776e19628639ee7ab8b980570b119bd9beae020048143f58","measured_slow_code_id":"7e7262672bfa412cdc2ccc01cdcb31e3ce50dda9cb71bf84a6ed22599eef6731","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_61023","problem_id":"p04017","slow_code_id":"fd5a1092b3c50b4e339aac88ad009ebcbfa14411a96e121542a512310b98003f","slow_id":"7e7262672bfa412cdc2ccc01cdcb31e3ce50dda9cb71bf84a6ed22599eef6731","slow_time":0.3149056559,"speedup":44.645536881151706,"stratum":"8+","sampling_key":"1f266985c04a83f13c382647883d0058b944ba82fca248331ec2a5ac8890a16f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define fi first\n\n#define se second\n\n#define pb push_back\n\n#define mp make_pair\n\n#define endl \"\\n\"\n\n#define pque priority_queue\n\nconst int mod = 1000000007, N = 100005;\n\nint a[N], dis[N], b[N], reach[N][18];\n\nsigned main() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  memset(reach, -1, sizeof(reach));\n\n  int n, l, q, x, y;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n\n    if (i != 0)\n      dis[i] = a[i] - a[i - 1];\n  }\n\n  cin >> l >> q;\n\n  int idx = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    while (idx < n && a[idx] - a[i] <= l) {\n\n      idx++;\n    }\n\n    idx--;\n\n    b[i] = idx;\n  }\n\n  for (int j = 0; j < 17; j++) {\n\n    for (int i = 0; i < n; i++) {\n\n      if (j == 0) {\n\n        reach[i][j] = b[i];\n\n      }\n\n      else {\n\n        reach[i][j] = reach[reach[i][j - 1]][j - 1];\n      }\n    }\n  }\n\n  while (q--) {\n\n    cin >> x >> y;\n\n    x--;\n\n    y--;\n\n    if (x == y) {\n\n      cout << 0 << endl;\n\n      continue;\n    }\n\n    if (x > y) {\n\n      swap(x, y);\n    }\n\n    int ans = 0;\n\n    for (int j = 17; j >= 0; j--) {\n\n      if (reach[x][j] < y && reach[x][j] != -1) {\n\n        x = reach[x][j];\n\n        ans += 1 << j;\n      }\n    }\n\n    cout << ans + 1 << endl;\n  }\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nconst int MAXN = 1e5 + 1;\n\nint n, l, q, x[MAXN];\n\nint f[MAXN][31];\n\nvoid prework() {\n\n  for (int i = 1; i <= n; ++i) {\n\n    int pos = std ::upper_bound(x + 1, x + n + 1, x[i] + l) - x - 1;\n\n    f[i][0] = x[i] + l >= x[n] ? n : pos;\n  }\n\n  for (int j = 1; j <= 30; ++j)\n    for (int i = 1; i <= n; ++i)\n      f[i][j] = f[f[i][j - 1]][j - 1];\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; ++i)\n    scanf(\"%d\", &x[i]);\n\n  scanf(\"%d%d\", &l, &q);\n\n  prework();\n\n  while (q--) {\n\n    int a, b;\n    scanf(\"%d%d\", &a, &b);\n\n    if (a > b)\n      std ::swap(a, b);\n\n    int p = a, ans = 0;\n\n    for (int j = 30; ~j; --j)\n      if (f[p][j] < b)\n        ans += (1 << j), p = f[p][j];\n\n    printf(\"%d\\n\", ans + 1);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"c1388c179a9be70f89c77f809d6cb96c24fc4a1c59d4118e63d6b9b32c12f2c8","fast_id":"5127f94adb4cf32978fac54cf611bba1653df43d3494a1d24c4c4ee61a8a490b","fast_time":0.0061348707,"language":"cpp","measured_fast_code_id":"5127f94adb4cf32978fac54cf611bba1653df43d3494a1d24c4c4ee61a8a490b","measured_slow_code_id":"adb65613b81d1c7b772e0f0878c2e43aad36307e6ae51ef2de9a80caf45473e7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_61099","problem_id":"p03367","slow_code_id":"19993a47ff2ce4603e2ec285b0959fb3907e7028829093a60e20dc5335cb3e62","slow_id":"adb65613b81d1c7b772e0f0878c2e43aad36307e6ae51ef2de9a80caf45473e7","slow_time":0.1896005637,"speedup":30.90538871503844,"stratum":"8+","sampling_key":"8642fb81efc96229e37b85430a578e257ca0e7b7dc7db2e9ea4675efa8ea325e","slow_code":"#include <vector>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define fo(i, a, b) for (int i = a; i <= b; i++)\n\n#define fd(i, a, b) for (int i = a; i >= b; i--)\n\nusing namespace std;\n\ntypedef long long ll;\n\nint read() {\n\n  char ch;\n\n  for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())\n    ;\n\n  int x = ch - '0';\n\n  for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())\n    x = x * 10 + ch - '0';\n\n  return x;\n}\n\nconst int N = 2e5 + 5, Mo = 1e9 + 7;\n\nvoid mod(int &x) { x = x >= Mo ? x - Mo : x; }\n\nvoid inc(int &x, int y) { x = x + y >= Mo ? x + y - Mo : x + y; }\n\nint pwr(int x, int y) {\n\n  int z = 1;\n\n  for (; y; y >>= 1, x = (ll)x * x % Mo)\n\n    if (y & 1)\n      z = (ll)z * x % Mo;\n\n  return z;\n}\n\nint n, ql, qr, tmp, a[N], cnt[N], t[N], tag[N << 2], tr[N << 2];\n\nvector<int> p[N];\n\nvoid Ins(int x) {\n  for (; x <= n; x += x & -x)\n    t[x]++;\n}\n\nint Que(int x) {\n  int res = 0;\n  for (; x; x -= x & -x)\n    res += t[x];\n  return res;\n}\n\nvoid mult(int v, int z) {\n\n  tr[v] = (ll)tr[v] * z % Mo;\n\n  tag[v] = (ll)tag[v] * z % Mo;\n}\n\nvoid down(int v) {\n\n  if (tag[v] != 1) {\n\n    mult(v << 1, tag[v]);\n\n    mult(v << 1 | 1, tag[v]);\n\n    tag[v] = 1;\n  }\n}\n\nvoid ins(int v, int l, int r, int x) {\n\n  if (l == r) {\n    tr[v] = tmp;\n    return;\n  }\n\n  int mid = l + r >> 1;\n  down(v);\n\n  if (x <= mid)\n    ins(v << 1, l, mid, x);\n\n  else\n    ins(v << 1 | 1, mid + 1, r, x);\n\n  mod(tr[v] = tr[v << 1] + tr[v << 1 | 1]);\n}\n\nint query(int v, int l, int r) {\n\n  if (ql <= l && r <= qr)\n    return tr[v];\n\n  int mid = l + r >> 1;\n  down(v);\n\n  int sum = 0;\n\n  if (ql <= mid)\n    inc(sum, query(v << 1, l, mid));\n\n  if (qr > mid)\n    inc(sum, query(v << 1 | 1, mid + 1, r));\n\n  return sum;\n}\n\nint main() {\n\n  n = read();\n\n  fo(i, 1, n) {\n\n    a[i] = read();\n\n    cnt[a[i]]++;\n\n    p[a[i]].push_back(i);\n  }\n\n  fd(i, n, 1) cnt[i] += cnt[i + 1];\n\n  int sum = 1, inv = pwr(2, Mo - 2);\n\n  fo(i, 1, n) {\n\n    if (cnt[i] - n + i < 0) {\n      puts(\"0\");\n      return 0;\n    }\n\n    sum = (ll)sum * (cnt[i] - n + i) % Mo;\n  }\n\n  tmp = (ll)sum * inv % Mo;\n\n  fo(i, 1, n << 2) tag[i] = 1;\n\n  int ans = 0;\n\n  fd(i, n, 1) {\n\n    if (!p[i].empty()) {\n\n      int sz = p[i].size();\n\n      fo(j, 0, sz - 1) {\n\n        int x = p[i][j];\n\n        ql = x;\n        qr = n;\n        inc(ans, query(1, 1, n));\n\n        inc(ans, (ll)sum * Que(x) % Mo);\n\n        ql = 1;\n        qr = x;\n        inc(ans, Mo - query(1, 1, n));\n\n        ins(1, 1, n, x);\n        Ins(x);\n      }\n    }\n\n    mult(1, (ll)(cnt[i] - n + i - 1) * pwr(cnt[i] - n + i, Mo - 2) % Mo);\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define fo(i, a, b) for (int i = a; i <= b; i++)\n\n#define fd(i, a, b) for (int i = a; i >= b; i--)\n\nusing namespace std;\n\ntypedef long long ll;\n\nint read() {\n\n  char ch;\n\n  for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())\n    ;\n\n  int x = ch - '0';\n\n  for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())\n    x = x * 10 + ch - '0';\n\n  return x;\n}\n\nconst int N = 2e5 + 5, Mo = 1e9 + 7, i2 = Mo + 1 >> 1;\n\nint pwr(int x, int y) {\n\n  int z = 1;\n\n  for (; y; y >>= 1, x = (ll)x * x % Mo)\n\n    if (y & 1)\n      z = (ll)z * x % Mo;\n\n  return z;\n}\n\nint n, s, a[N], cnt[N], val[N], tr[N], Mx[N], pre[N];\n\nvoid C() { fo(i, 1, n) tr[i] = 0; }\n\nvoid I(int x, int y) {\n  for (; x <= n; x += x & -x)\n    (tr[x] += y) %= Mo;\n}\n\nint Q(int x) {\n  int r = 0;\n  for (; x; x -= x & -x)\n    (r += tr[x]) %= Mo;\n  return r;\n}\n\nint calc(int l, int r) {\n\n  if (Mx[l] == Mx[r] && Mx[l])\n    return (ll)s * pre[r] % Mo * pwr(pre[l - 1], Mo - 2) % Mo;\n\n  return 0;\n}\n\nint main() {\n\n  n = read();\n\n  fo(i, 1, n) cnt[a[i] = read()]++;\n\n  fd(i, n, 1) cnt[i] += cnt[i + 1];\n\n  int ans = 0;\n  s = 1;\n\n  fo(i, 1, n) s = (ll)s * (cnt[i] - n + i) % Mo;\n\n  if (!s) {\n    puts(\"0\");\n    return 0;\n  }\n\n  fo(i, 1, n) val[i] =\n      (ll)(cnt[i] - n + i - 1) * pwr(cnt[i] - n + i, Mo - 2) % Mo;\n\n  int la = n;\n\n  fd(i, n, 1) {\n\n    if (!val[i]) {\n\n      pre[i] = 1;\n\n      fo(j, i + 1, la) pre[j] = (ll)pre[j - 1] * val[j] % Mo;\n\n      la = i - 1;\n\n    } else\n      Mx[i] = la;\n  }\n\n  fd(i, n, 1) {\n\n    (ans += (ll)s * Q(a[i] - 1) % Mo) %= Mo;\n\n    I(a[i], 1);\n  }\n\n  C();\n\n  fo(i, 1, n) {\n\n    if (val[a[i] + 1]) {\n\n      int ret = (Q(Mx[a[i]]) - Q(a[i]) + Mo) % Mo;\n\n      (ans -= (ll)s * ret % Mo * pwr(pre[a[i]], Mo - 2) % Mo * i2 % Mo) %= Mo;\n    }\n\n    I(a[i], pre[a[i]]);\n  }\n\n  C();\n\n  fd(i, n, 1) {\n\n    if (val[a[i] + 1]) {\n\n      int ret = (Q(Mx[a[i]]) - Q(a[i]) + Mo) % Mo;\n\n      (ans += (ll)s * ret % Mo * pwr(pre[a[i]], Mo - 2) % Mo * i2 % Mo) %= Mo;\n    }\n\n    I(a[i], pre[a[i]]);\n  }\n\n  fo(i, 1, n) cnt[i] = 0;\n\n  fo(i, 1, n) cnt[a[i]]++;\n\n  fo(i, 1, n)(ans += (ll)s * cnt[i] % Mo * (cnt[i] - 1) % Mo * i2 % Mo * i2 %\n                     Mo) %= Mo;\n\n  printf(\"%d\\n\", (ans + Mo) % Mo);\n\n  return 0;\n}"}
{"fast_code_id":"e9565952fb27dca486bf93ddf588dc5f2461afe920f278ffd2099e8f4c25609c","fast_id":"2c226a9e405cb50ca7c33d4178b89a4b29d058176c967e67dfac9f332fe7c3e4","fast_time":0.0403087808,"language":"cpp","measured_fast_code_id":"2c226a9e405cb50ca7c33d4178b89a4b29d058176c967e67dfac9f332fe7c3e4","measured_slow_code_id":"26e2159988f11426a6bca311f34a067df6b8ea2329226df9a38a0f77c13c3a1b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_61101","problem_id":"p00750","slow_code_id":"f52d076a31fab596cc3186df4c54e7889aa8b995bf14efdf2cfeb86e9fc02dab","slow_id":"26e2159988f11426a6bca311f34a067df6b8ea2329226df9a38a0f77c13c3a1b","slow_time":0.11185974,"speedup":2.775071281739189,"stratum":"2-4","sampling_key":"0f0369aa8bb8098360ae8ce77d746dd104c1ca903f11be72418bdb9ea2b74db2","slow_code":"#include <cstdlib>\n\n#include <cstring>\n\n#include <functional>\n\n#include <iostream>\n\n#include <queue>\n\n#include <utility>\n\n#include <vector>\n\nusing namespace std;\n\nconst int MAX_LEN = 6;\n\nconst int MAX_N = 40;\n\nconst int LIMIT = MAX_LEN * MAX_N;\n\nconst string INF(LIMIT, 'z');\n\nstruct edge {\n\n  int to;\n\n  string cost;\n\n  edge(int t, const string &c) : to(t), cost(c) {}\n};\n\nbool to_goal[MAX_N];\n\nvector<vector<edge> > es;\n\nstring dijkstra(int s, int g) {\n\n  typedef pair<string, int> P;\n\n  const int n = es.size();\n\n  vector<vector<string> > dist(n, vector<string>(LIMIT + MAX_LEN + 1, INF));\n\n  dist[s][0] = \"\";\n\n  priority_queue<P, vector<P>, greater<P> > que;\n\n  que.push(make_pair(\"\", s));\n\n  while (!que.empty()) {\n\n    const string spell = que.top().first;\n\n    const int v = que.top().second, len = spell.size();\n\n    que.pop();\n\n    if (!to_goal[v] || dist[v][len] != spell)\n\n      continue;\n\n    if (len > LIMIT)\n\n      return \"NO\";\n\n    if (v == g)\n\n      return spell;\n\n    for (int i = 0; i < es[v].size(); ++i) {\n\n      const edge &e = es[v][i];\n\n      if (!to_goal[e.to])\n\n        continue;\n\n      const string next_spell = spell + e.cost;\n\n      const int next_len = next_spell.size();\n\n      if (dist[e.to][next_len] > next_spell) {\n\n        dist[e.to][next_len] = next_spell;\n\n        que.push(make_pair(next_spell, e.to));\n      }\n    }\n  }\n\n  return \"NO\";\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  for (int n, a, s, g; cin >> n >> a >> s >> g, n;) {\n\n    es.clear();\n\n    es.resize(n);\n\n    for (int i = 0; i < a; ++i) {\n\n      int x, y;\n\n      string lab;\n\n      cin >> x >> y >> lab;\n\n      es[x].push_back(edge(y, lab));\n    }\n\n    memset(to_goal, false, sizeof(to_goal));\n\n    to_goal[g] = true;\n\n    for (int i = 0; i < n; ++i) {\n\n      for (int j = 0; j < n; ++j) {\n\n        if (!to_goal[j]) {\n\n          for (int k = 0; k < (int)es[j].size(); ++k) {\n\n            if (to_goal[es[j][k].to]) {\n\n              to_goal[j] = true;\n\n              break;\n            }\n          }\n        }\n      }\n    }\n\n    cout << dijkstra(s, g) << endl;\n  }\n\n  return EXIT_SUCCESS;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconstexpr int MAX_LEN = 6;\n\nconstexpr int MAX_N = 40;\n\nstruct edge {\n\n  int to;\n\n  string cost;\n\n  edge(int to_, const string &cost_) : to(to_), cost(cost_) {}\n\n  edge(int to_, string &&cost_) : to(to_), cost(move(cost_)) {}\n};\n\nvoid dfs(int v, const vector<vector<int>> &G, bitset<MAX_N> &visited) {\n\n  visited[v] = true;\n\n  for (const auto &to : G[v]) {\n\n    if (!visited[to])\n      dfs(to, G, visited);\n  }\n}\n\nstring dijkstra(int s, int g, const vector<vector<edge>> &G, const bitset<MAX_N> &reach) {\n\n  if (!reach[s])\n    return \"NO\";\n\n  typedef pair<string, int> state;\n\n  const int n = G.size();\n\n  const int limit = n * MAX_LEN;\n\n  vector<vector<string>> dist(n, vector<string>(limit + MAX_LEN + 1, \"{\"));\n\n  dist[s][0] = \"\";\n\n  priority_queue<state, vector<state>, greater<state>> que;\n\n  que.push({\"\", s});\n\n  while (!que.empty()) {\n\n    const string d = que.top().first;\n\n    const int v = que.top().second;\n\n    const int l = d.size();\n\n    que.pop();\n\n    if (v == g)\n      return d;\n\n    if (l > limit)\n      return \"NO\";\n\n    if (dist[v][l] > d)\n      continue;\n\n    for (const auto &e : G[v]) {\n\n      if (!reach[e.to])\n        continue;\n\n      const string next_dist = d + e.cost;\n\n      const int next_len = next_dist.size();\n\n      if (dist[e.to][next_len] > next_dist) {\n\n        que.push({next_dist, e.to});\n\n        dist[e.to][next_len] = move(next_dist);\n      }\n    }\n  }\n\n  return \"NO\";\n}\n\nint main() {\n\n  cin.tie(nullptr);\n\n  ios::sync_with_stdio(false);\n\n  for (int n, m, s, g; cin >> n >> m >> s >> g && n;) {\n\n    vector<vector<edge>> G(n);\n\n    vector<vector<int>> rG(n);\n\n    while (m--) {\n\n      int x, y;\n\n      string lab;\n\n      cin >> x >> y >> lab;\n\n      G[x].emplace_back(y, move(lab));\n\n      rG[y].emplace_back(x);\n    }\n\n    bitset<MAX_N> visited;\n\n    dfs(g, rG, visited);\n\n    cout << dijkstra(s, g, G, visited) << endl;\n  }\n\n  return EXIT_SUCCESS;\n}"}
{"fast_code_id":"06ca9dd1e5ac955651a0bff00581910b19de8c9a7be42ad8a86dcb8ab492be3a","fast_id":"a645363763411841bfd26a084c4cc0fb7cca6000da9018d34cf0b6d97056acc0","fast_time":0.0003238184,"language":"cpp","measured_fast_code_id":"a645363763411841bfd26a084c4cc0fb7cca6000da9018d34cf0b6d97056acc0","measured_slow_code_id":"16b53c16f84e5eae65b4f8170fa95367320349a30efec2ea1e6e2cbb69b1ff5b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_61128","problem_id":"p04032","slow_code_id":"611ffdfb61617f307f81b8d6b4d56dd191c2877dab4789d1a02836648b34508d","slow_id":"16b53c16f84e5eae65b4f8170fa95367320349a30efec2ea1e6e2cbb69b1ff5b","slow_time":0.0009434642,"speedup":2.9135595753669343,"stratum":"2-4","sampling_key":"de416ec1a160aae1d48af4ca59c23bc019fe9bd43bde1d56d6dac0fae3b16e24","slow_code":"#include <cstdio>\n\n#include <string>\n\nusing namespace std;\n\nint main() {\n\n  char buf[131072];\n\n  scanf(\"%s\", buf);\n\n  string s(buf);\n\n  size_t ub = s.length();\n\n  s += '$';\n\n  for (size_t i = 0; i < ub; ++i)\n\n    for (size_t j = 1; j <= 2; ++j)\n\n      if (s[i] == s[i + j]) {\n\n        printf(\"%llu %llu\\n\", i + 1, i + j + 1);\n\n        return 0;\n      }\n\n  printf(\"-1 -1\\n\");\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\nint main() {\n\n  char s[131072] = {};\n\n  scanf(\"%s\", s);\n\n  size_t ub = strlen(s);\n\n  s[ub] = '$';\n\n  for (size_t i = 0; i < ub; ++i)\n\n    for (size_t j = 1; j <= 2; ++j)\n\n      if (s[i] == s[i + j]) {\n\n        printf(\"%llu %llu\\n\", i + 1, i + j + 1);\n\n        return 0;\n      }\n\n  printf(\"-1 -1\\n\");\n\n  return 0;\n}\n"}
{"fast_code_id":"71f9e1f66a8d42b27dfcdd5fcdaaf693d8ae79719055c5562c2fc37b031ddce0","fast_id":"3dcfa79b88c9c6fbf9d6cda33ca7f6be08c9bf3980546cf0deaaf099b9afe880","fast_time":0.1038997451,"language":"cpp","measured_fast_code_id":"3dcfa79b88c9c6fbf9d6cda33ca7f6be08c9bf3980546cf0deaaf099b9afe880","measured_slow_code_id":"e88df3fec8006278b3a3cd6d09a16cc54da208360d253ccd240e57c7889f9792","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_61160","problem_id":"p03594","slow_code_id":"d05eb6dd05647cba00b60736e0ae212fe7108741baa5d90c65b1f2e7aa286725","slow_id":"e88df3fec8006278b3a3cd6d09a16cc54da208360d253ccd240e57c7889f9792","slow_time":0.2416924007,"speedup":2.3262078310912044,"stratum":"2-4","sampling_key":"813a9ca58c0c950f88a20c10a3f52ccb349fa96fbc69e7b98c4a102dbb721d60","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define REP(i, n) for (int i = 0; i < n; ++i)\n\n#define SORT(name) sort(name.begin(), name.end())\n\n#define ZERO(p) memset(p, 0, sizeof(p))\n\n#define MINUS(p) memset(p, -1, sizeof(p))\n\n#define MOD 1000000007\n\n#define INF 1000000000\n\nint H, W, d;\n\nint ans[510][510];\n\nchar ret[510][510];\n\nint main()\n\n{\n\n  ZERO(ans);\n\n  ZERO(ret);\n\n  cin >> H >> W >> d;\n\n  if (d % 2 != 0) {\n\n    REP(i, H) {\n\n      char tile1, tile2;\n\n      if (i % 2 == 0) {\n\n        tile1 = 'R';\n\n        tile2 = 'G';\n\n      } else {\n\n        tile1 = 'G';\n\n        tile2 = 'R';\n      }\n\n      REP(j, W) {\n\n        if (j % 2 == 0) {\n          printf(\"%c\", tile1);\n        }\n\n        else {\n          printf(\"%c\", tile2);\n        }\n      }\n\n      printf(\"\\n\");\n    }\n\n  } else {\n\n#if 1\n\n    REP(i, H) {\n\n      char up, down, left, right;\n\n      for (int j = 0; j < W; j += d) {\n\n        if (((i + j) / d) % 2 == 0) {\n\n          up = 'R';\n\n          down = 'G';\n\n          left = 'Y';\n\n          right = 'B';\n\n        } else {\n\n          up = 'G';\n\n          down = 'R';\n\n          left = 'B';\n\n          right = 'Y';\n        }\n\n        int up_n = d - (i % d) * 2;\n\n        if (i % d >= d / 2) {\n          up_n = 0;\n        }\n\n        int down_n = ((i % d) - d / 2) * 2;\n\n        if (i % d <= d / 2) {\n          down_n = 0;\n        }\n\n        int width_n;\n\n        if (i % d <= d / 2) {\n\n          width_n = i % d;\n\n        } else {\n\n          width_n = d - (i % d);\n        }\n\n        int ind = j;\n\n        for (int k = 0; k < width_n && ind < W; k++, ind++) {\n          printf(\"%c\", left);\n        }\n\n        for (int k = 0; k < up_n && ind < W; k++, ind++) {\n          printf(\"%c\", up);\n        }\n\n        for (int k = 0; k < down_n && ind < W; k++, ind++) {\n          printf(\"%c\", down);\n        }\n\n        for (int k = 0; k < width_n && ind < W; k++, ind++) {\n          printf(\"%c\", right);\n        }\n      }\n\n      printf(\"\\n\");\n    }\n\n#else\n\n    for (int i = 0; i < H; i += d) {\n\n      for (int j = 0; j < W; j += d) {\n\n        int h = 1;\n\n        int sign = 1;\n\n        for (int k = j; k < j + d && k < W; ++k) {\n\n          int diff = k - j;\n\n          if (diff >= d / 2 && sign > 0) {\n\n            sign = -1;\n\n            h += (1 * sign);\n          }\n\n          ans[i][k] = h;\n\n          if (i + h < H) {\n            ans[i + h][k] = d - (h * 2 - 1);\n          }\n\n          h += (1 * sign);\n        }\n      }\n    }\n\n    char tile1 = 'R', tile2 = 'Y', tile3 = 'B';\n\n    for (int i = 0; i < H; i += d) {\n\n      if (tile1 == 'G') {\n        tile1 = 'R';\n      }\n\n      else {\n        tile1 = 'G';\n      }\n\n      if (tile2 == 'Y') {\n\n        tile2 = 'B';\n\n        tile3 = 'Y';\n\n      }\n\n      else {\n\n        tile2 = 'Y';\n\n        tile3 = 'B';\n      }\n\n      char tmp1 = tile1;\n\n      char tmp2 = tile2;\n\n      char tmp3 = tile3;\n\n      for (int j = 0; j < W; ++j) {\n\n        if (j % d == 0) {\n\n          if (tmp1 == 'G') {\n            tmp1 = 'R';\n          }\n\n          else {\n            tmp1 = 'G';\n          }\n\n          if (tmp2 == 'Y') {\n\n            tmp2 = 'B';\n\n            tmp3 = 'Y';\n\n          }\n\n          else {\n\n            tmp2 = 'Y';\n\n            tmp3 = 'B';\n          }\n        }\n\n        for (int k = 0; k < ans[i][j]; ++k) {\n\n          if (i + k < H) {\n            ret[i + k][j] = tmp1;\n          }\n\n          if (i - k >= 0) {\n            ret[i - k][j] = tmp1;\n          }\n        }\n\n        if (i + ans[i][j] < H) {\n\n          for (int k = 0; k < ans[i + ans[i][j]][j]; ++k) {\n\n            if (i + 1 + k < H) {\n\n              if (j % d < d / 2) {\n                ret[i + ans[i][j] + k][j] = tmp2;\n              }\n\n              else {\n                ret[i + ans[i][j] + k][j] = tmp3;\n              }\n            }\n          }\n        }\n      }\n    }\n\n    REP(i, H) {\n\n      REP(j, W) { printf(\"%c\", ret[i][j]); }\n\n      printf(\"\\n\");\n    }\n\n#endif\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define REP(i, n) for (int i = 0; i < n; ++i)\n\n#define SORT(name) sort(name.begin(), name.end())\n\n#define ZERO(p) memset(p, 0, sizeof(p))\n\n#define MINUS(p) memset(p, -1, sizeof(p))\n\n#define MOD 1000000007\n\n#define INF 1000000000\n\nint H, W, d;\n\nint main()\n\n{\n\n  cin >> H >> W >> d;\n\n  if (d % 2 != 0) {\n\n    REP(i, H) {\n\n      char tile1, tile2;\n\n      if (i % 2 == 0) {\n\n        tile1 = 'R';\n\n        tile2 = 'G';\n\n      } else {\n\n        tile1 = 'G';\n\n        tile2 = 'R';\n      }\n\n      REP(j, W) {\n\n        if (j % 2 == 0) {\n          printf(\"%c\", tile1);\n        }\n\n        else {\n          printf(\"%c\", tile2);\n        }\n      }\n\n      printf(\"\\n\");\n    }\n\n  } else {\n\n    REP(i, H) {\n\n      char up, down, left, right;\n\n      for (int j = 0; j < W; j += d) {\n\n        if (((i + j) / d) % 2 == 0) {\n\n          up = 'R';\n\n          down = 'G';\n\n          left = 'Y';\n\n          right = 'B';\n\n        } else {\n\n          up = 'G';\n\n          down = 'R';\n\n          left = 'B';\n\n          right = 'Y';\n        }\n\n        int up_n = d - (i % d) * 2;\n\n        if (i % d >= d / 2) {\n          up_n = 0;\n        }\n\n        int down_n = ((i % d) - d / 2) * 2;\n\n        if (i % d <= d / 2) {\n          down_n = 0;\n        }\n\n        int width_n;\n\n        if (i % d <= d / 2) {\n\n          width_n = i % d;\n\n        } else {\n\n          width_n = d - (i % d);\n        }\n\n        int ind = j;\n\n        for (int k = 0; k < width_n && ind < W; k++, ind++) {\n          printf(\"%c\", left);\n        }\n\n        for (int k = 0; k < up_n && ind < W; k++, ind++) {\n          printf(\"%c\", up);\n        }\n\n        for (int k = 0; k < down_n && ind < W; k++, ind++) {\n          printf(\"%c\", down);\n        }\n\n        for (int k = 0; k < width_n && ind < W; k++, ind++) {\n          printf(\"%c\", right);\n        }\n      }\n\n      printf(\"\\n\");\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"80a114a0de9feeaa9d41238c5e3f30f2eeefd616b3f22b57273d3e81bc81cea9","fast_id":"75a64994d48877c0432ff6aceb4dd9c8778a2177dd5eff52a1c1ae4d4142125d","fast_time":0.1075923783,"language":"cpp","measured_fast_code_id":"75a64994d48877c0432ff6aceb4dd9c8778a2177dd5eff52a1c1ae4d4142125d","measured_slow_code_id":"ca8542b041040e2e8d49bd39eafd0e972abbcdf992b2be034fcc377e670f2957","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_61196","problem_id":"p02955","slow_code_id":"5e98d4877ea989192cd33acff967680a24f625ce0d83242fc420592731578c32","slow_id":"ca8542b041040e2e8d49bd39eafd0e972abbcdf992b2be034fcc377e670f2957","slow_time":0.2788182297,"speedup":2.5914310484202763,"stratum":"2-4","sampling_key":"946aef6d8a9615397faf6cf15c64cc4518727a747f098a8d6bd58b572eaf2047","slow_code":"#define _USE_MATH_DEFINES\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rrep(i, a, b) for (int i = (a); i > (b); i--)\n\n#define ALL(v) (v).begin(), (v).end()\n\ntypedef long long int ll;\ntypedef pair<ll, ll> P;\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val) {\n  fill((T *)array, (T *)(array + N), val);\n}\n\nconst int inf = INT_MAX / 2;\nconst ll INF = LLONG_MAX / 2;\n\nconst int mod = 998244353;\n\nstruct Mint {\n\n  int val;\n\n  Mint inv() const {\n\n    int tmp, a = val, b = mod, x = 1, y = 0;\n\n    while (b)\n      tmp = a / b, a -= tmp * b, swap(a, b), x -= tmp * y, swap(x, y);\n\n    return Mint(x);\n  }\n\npublic:\n  Mint() : val(0) {}\n\n  Mint(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {}\n\n  int mtoi() { return this->val; }\n\n  Mint pow(ll t) {\n    Mint res = 1;\n    while (t) {\n      if (t & 1)\n        res *= *this;\n      *this *= *this;\n      t >>= 1;\n    }\n    return res;\n  }\n\n  Mint &operator+=(const Mint &x) {\n    if ((val += x.val) >= mod)\n      val -= mod;\n    return *this;\n  }\n\n  Mint &operator-=(const Mint &x) {\n    if ((val += mod - x.val) >= mod)\n      val -= mod;\n    return *this;\n  }\n\n  Mint &operator*=(const Mint &x) {\n    val = (ll)val * x.val % mod;\n    return *this;\n  }\n\n  Mint &operator/=(const Mint &x) { return *this *= x.inv(); }\n\n  bool operator==(const Mint &x) const { return val == x.val; }\n\n  bool operator!=(const Mint &x) const { return val != x.val; }\n\n  bool operator<(const Mint &x) const { return val < x.val; }\n\n  bool operator<=(const Mint &x) const { return val <= x.val; }\n\n  bool operator>(const Mint &x) const { return val > x.val; }\n\n  bool operator>=(const Mint &x) const { return val >= x.val; }\n\n  Mint operator+(const Mint &x) const { return Mint(*this) += x; }\n\n  Mint operator-(const Mint &x) const { return Mint(*this) -= x; }\n\n  Mint operator*(const Mint &x) const { return Mint(*this) *= x; }\n\n  Mint operator/(const Mint &x) const { return Mint(*this) /= x; }\n};\n\nstruct factorial {\n\n  vector<Mint> Fact, Finv;\n\npublic:\n  factorial(int maxx) {\n\n    Fact.resize(maxx + 1, Mint(1)), Finv.resize(maxx + 1);\n    rep(i, 0, maxx) Fact[i + 1] = Fact[i] * Mint(i + 1);\n\n    Finv[maxx] = Mint(1) / Fact[maxx];\n    rrep(i, maxx, 0) Finv[i - 1] = Finv[i] * Mint(i);\n  }\n\n  Mint fact(int n, bool inv) {\n    if (inv)\n      return Finv[n];\n    else\n      return Fact[n];\n  }\n\n  Mint nPr(int n, int r) {\n    if (n < 0 || n < r || r < 0)\n      return Mint(0);\n    else\n      return Fact[n] * Finv[n - r];\n  }\n\n  Mint nCr(int n, int r) {\n    if (n < 0 || n < r || r < 0)\n      return Mint(0);\n    else\n      return Fact[n] * Finv[r] * Finv[n - r];\n  }\n};\n\nvector<int> di, a;\nint n, k;\n\nbool fl(int x) {\n\n  priority_queue<int> pq;\n\n  ll val = 0, cnt = 0;\n\n  rep(i, 0, n) {\n\n    int y = (a[i] / x * x + x);\n\n    if (y - a[i] == x)\n      y -= x;\n\n    val += y - a[i];\n    cnt += y - a[i];\n\n    pq.push(y - a[i]);\n  }\n\n  int mi = 0;\n\n  while (val != 0) {\n\n    int v = pq.top();\n    pq.pop();\n\n    val -= x;\n    cnt -= v;\n  }\n\n  return cnt <= k;\n}\n\nint main() {\n\n  cin >> n >> k;\n\n  a.resize(n);\n\n  ll sum = 0;\n\n  rep(i, 0, n) cin >> a[i], sum += a[i];\n\n  rep(i, 1, 300010) {\n\n    if (sum % i == 0) {\n\n      di.push_back(i);\n\n      if (sum != i * i)\n        di.push_back(sum / i);\n    }\n  }\n\n  sort(ALL(di));\n\n  int ans = 0;\n\n  rep(i, 0, di.size()) {\n\n    if (fl(di[i]))\n      chmax(ans, i);\n  }\n\n  printf(\"%d\\n\", di[ans]);\n\n  return 0;\n}\n","fast_code":"#define _USE_MATH_DEFINES\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (a); i < (b); i++)\n\n#define rrep(i, a, b) for (int i = (a); i > (b); i--)\n\n#define ALL(v) (v).begin(), (v).end()\n\ntypedef long long int ll;\ntypedef pair<ll, ll> P;\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val) {\n  fill((T *)array, (T *)(array + N), val);\n}\n\nconst int inf = INT_MAX / 2;\nconst ll INF = LLONG_MAX / 2;\n\nconst int mod = 1e9 + 7;\n\nstruct Mint {\n\n  int val;\n\n  Mint inv() const {\n\n    int tmp, a = val, b = mod, x = 1, y = 0;\n\n    while (b)\n      tmp = a / b, a -= tmp * b, swap(a, b), x -= tmp * y, swap(x, y);\n\n    return Mint(x);\n  }\n\npublic:\n  Mint() : val(0) {}\n\n  Mint(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {}\n\n  int mtoi() { return this->val; }\n\n  Mint pow(ll t) {\n    Mint res = 1, b = *this;\n    while (t) {\n      if (t & 1)\n        res *= b;\n      b *= b;\n      t >>= 1;\n    }\n    return res;\n  }\n\n  Mint &operator+=(const Mint &x) {\n    if ((val += x.val) >= mod)\n      val -= mod;\n    return *this;\n  }\n\n  Mint &operator-=(const Mint &x) {\n    if ((val += mod - x.val) >= mod)\n      val -= mod;\n    return *this;\n  }\n\n  Mint &operator*=(const Mint &x) {\n    val = (ll)val * x.val % mod;\n    return *this;\n  }\n\n  Mint &operator/=(const Mint &x) { return *this *= x.inv(); }\n\n  bool operator==(const Mint &x) const { return val == x.val; }\n\n  bool operator!=(const Mint &x) const { return val != x.val; }\n\n  bool operator<(const Mint &x) const { return val < x.val; }\n\n  bool operator<=(const Mint &x) const { return val <= x.val; }\n\n  bool operator>(const Mint &x) const { return val > x.val; }\n\n  bool operator>=(const Mint &x) const { return val >= x.val; }\n\n  Mint operator+(const Mint &x) const { return Mint(*this) += x; }\n\n  Mint operator-(const Mint &x) const { return Mint(*this) -= x; }\n\n  Mint operator*(const Mint &x) const { return Mint(*this) *= x; }\n\n  Mint operator/(const Mint &x) const { return Mint(*this) /= x; }\n};\n\nstruct factorial {\n\n  vector<Mint> Fact, Finv;\n\npublic:\n  factorial(int maxx) {\n\n    Fact.resize(maxx + 1, Mint(1)), Finv.resize(maxx + 1);\n    rep(i, 0, maxx) Fact[i + 1] = Fact[i] * Mint(i + 1);\n\n    Finv[maxx] = Mint(1) / Fact[maxx];\n    rrep(i, maxx, 0) Finv[i - 1] = Finv[i] * Mint(i);\n  }\n\n  Mint fact(int n, bool inv) {\n    if (inv)\n      return Finv[n];\n    else\n      return Fact[n];\n  }\n\n  Mint nPr(int n, int r) {\n    if (n < 0 || n < r || r < 0)\n      return Mint(0);\n    else\n      return Fact[n] * Finv[n - r];\n  }\n\n  Mint nCr(int n, int r) {\n    if (n < 0 || n < r || r < 0)\n      return Mint(0);\n    else\n      return Fact[n] * Finv[r] * Finv[n - r];\n  }\n};\n\nint main() {\n\n  int n, k;\n  scanf(\"%d %d\", &n, &k);\n\n  vector<int> a(n);\n\n  rep(i, 0, n) scanf(\"%d\", &a[i]);\n\n  ll sum = 0;\n\n  rep(i, 0, n) sum += a[i];\n\n  vector<ll> divisor;\n\n  rep(i, 1, sqrt(sum) + 1) {\n\n    if (sum % i == 0) {\n\n      divisor.push_back(i);\n\n      divisor.push_back(sum / i);\n    }\n  }\n\n  sort(ALL(divisor));\n\n  ll ans = 0;\n\n  rep(i, 0, divisor.size()) {\n\n    vector<ll> b;\n\n    rep(j, 0, n) b.push_back(a[j] % divisor[i]);\n\n    sort(ALL(b), greater<ll>());\n\n    int val = 0, cnt = 0;\n\n    rep(j, 0, n) val += b[j];\n\n    cnt = val, val /= divisor[i];\n\n    rep(j, 0, val) cnt -= b[j];\n\n    if (cnt <= k)\n      chmax(ans, divisor[i]);\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"a76984c6c65aabf9bd000b384591b87bf8ccd1184d42662f1f7551330491a408","fast_id":"7b518213ded05dec0db7689a51987314e9a429359bc734d612975ecb692cd34a","fast_time":0.0161320805,"language":"cpp","measured_fast_code_id":"7b518213ded05dec0db7689a51987314e9a429359bc734d612975ecb692cd34a","measured_slow_code_id":"5700fb0ec8b6655ac29b83976c4aa43246daba131fed7aaf612d931902cfdccf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_613","problem_id":"p03357","slow_code_id":"93d13ffae9d083940c403ae43c8950a23dde654607f3f4a8c5de6442394fa923","slow_id":"5700fb0ec8b6655ac29b83976c4aa43246daba131fed7aaf612d931902cfdccf","slow_time":0.2820660737,"speedup":17.484792101056026,"stratum":"8+","sampling_key":"6f3c21118670b7e95b5d9d4b971c60b59c531054cf6d1cb24e77d55033033674","slow_code":"#include <cstdio>\n\n#include <cstring>\n\nchar op[10];\n\nint n, a[4001];\n\nint b[4001][2], bit[4001];\n\nbool c[4001];\n\nint f[2001][2001];\n\nint Min(int a, int b) { return a < b ? a : b; }\n\nvoid Add(int x, int ad) {\n\n  for (int i = x; i <= n + n; i += (i & (-i)))\n    bit[i] += ad;\n}\n\nint query(int x) {\n\n  int sum = 0;\n\n  for (int i = x; i; i -= (i & (-i)))\n    sum += bit[i];\n\n  return sum;\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n + n; i++) {\n\n    scanf(\"%s%d\", op, &a[i]);\n\n    if (op[0] == 'W')\n      c[i] = 0;\n    else\n      c[i] = 1;\n\n    b[a[i]][c[i]] = i;\n  }\n\n  memset(f, 127 / 3, sizeof(f));\n\n  f[0][0] = 0;\n\n  for (int i = 0; i <= n; i++) {\n\n    memset(bit, 0, sizeof(bit));\n\n    for (int j = 1; j <= n + n; j++)\n      Add(j, 1);\n\n    for (int j = 1; j <= i; j++)\n      Add(b[j][0], -1);\n\n    for (int j = 0; j <= n; j++) {\n\n      if (j > 0)\n        Add(b[j][1], -1);\n\n      if (i > 0)\n        f[i][j] = Min(f[i][j], f[i - 1][j] + query(b[i][0]));\n\n      if (j > 0)\n        f[i][j] = Min(f[i][j], f[i][j - 1] + query(b[j][1]));\n    }\n  }\n\n  printf(\"%d\", f[n][n]);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ull;\n\ntypedef pair<int, int> pii;\n\n#define x first\n\n#define y second\n\n#define mp make_pair\n\n#define pb push_back\n\ntemplate <typename TYPE> inline void chkmax(TYPE &x, TYPE y) { x < y ? x = y : TYPE(); }\n\ntemplate <typename TYPE> inline void chkmin(TYPE &x, TYPE y) { y < x ? x = y : TYPE(); }\n\ntemplate <typename TYPE>\nvoid readint(TYPE &x)\n\n{\n\n  x = 0;\n  int f = 1;\n  char c;\n\n  for (c = getchar(); !isdigit(c); c = getchar())\n    if (c == '-')\n      f = -1;\n\n  for (; isdigit(c); c = getchar())\n    x = x * 10 + c - '0';\n\n  x *= f;\n}\n\nconst int MAXN = 2005;\n\nint n, a[MAXN * 2], col[MAXN * 2], pos[2][MAXN], pre[MAXN * 2][2][MAXN], f[MAXN][MAXN];\n\nint main()\n\n{\n\n  char str[2];\n\n  readint(n);\n\n  for (int i = 1; i <= 2 * n; ++i)\n\n    scanf(\"%s\", str), col[i] = (str[0] == 'B'), readint(a[i]), pos[col[i]][a[i]] = i;\n\n  for (int i = 1; i <= 2 * n; ++i)\n\n  {\n\n    for (int j = 1; j <= i; ++j)\n      ++pre[i][col[j]][a[j]];\n\n    for (int k = 0; k <= 1; ++k)\n      for (int j = 1; j <= n; ++j)\n        pre[i][k][j] += pre[i][k][j - 1];\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n    f[i][0] = f[i - 1][0] + pos[0][i] - pre[pos[0][i]][0][i],\n\n    f[0][i] = f[0][i - 1] + pos[1][i] - pre[pos[1][i]][1][i];\n\n  for (int i = 1; i <= n; ++i)\n\n    for (int j = 1; j <= n; ++j)\n\n      f[i][j] = min(f[i - 1][j] + pos[0][i] - pre[pos[0][i]][0][i] - pre[pos[0][i]][1][j],\n\n                    f[i][j - 1] + pos[1][j] - pre[pos[1][j]][0][i] - pre[pos[1][j]][1][j]);\n\n  printf(\"%d\\n\", f[n][n]);\n\n  return 0;\n}"}
{"fast_code_id":"5a2f573ea682cd935b66715f257640075505064ceae7f25cc3c92c62a4940921","fast_id":"e40e10293099c3e7603d97e5c455a17460ecbab1ee8f34d0bab28fa7ed304306","fast_time":0.0195717917,"language":"cpp","measured_fast_code_id":"e40e10293099c3e7603d97e5c455a17460ecbab1ee8f34d0bab28fa7ed304306","measured_slow_code_id":"9b30c5f6a7e4e95365fe85397f0d6fc5884ea11007658977c8e04f87753c1768","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_6149","problem_id":"p03136","slow_code_id":"b691e23eb551d344bfa6626da9fc2366e7b2e528259542c02643a4620df0eea9","slow_id":"9b30c5f6a7e4e95365fe85397f0d6fc5884ea11007658977c8e04f87753c1768","slow_time":0.0709270842,"speedup":3.6239443627432433,"stratum":"2-4","sampling_key":"133abdff8f82b12a63f022e912098a3146491ab8b47ff1af1c6831572068625e","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n, temp, m = 0, sum = 0;\n\n  cin >> n;\n\n  while (n)\n\n  {\n\n    cin >> temp;\n\n    sum += temp;\n\n    m = max(m, temp);\n\n    n--;\n  }\n\n  sum -= m;\n\n  m < sum ? cout << \"Yes\" : cout << \"No\";\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#define size 1000000\n\nint main()\n\n{\n\n  int n, i, c = 0, a[size], b = 0;\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    c += a[i];\n\n    if (a[i] > b)\n\n      b = a[i];\n  }\n\n  if ((c - b) > b)\n    printf(\"Yes\\n\");\n\n  else\n    printf(\"No\\n\");\n\n  return 0;\n}\n"}
{"fast_code_id":"1998845c3e6cefca1d3663d35244ab1cc09a77f24f1f7c46421c25a567ce564e","fast_id":"52bf0a1a7ece26f7d871a7a4008dd018fad5e205a273c398eb0919e073e40e7e","fast_time":0.016800228,"language":"cpp","measured_fast_code_id":"52bf0a1a7ece26f7d871a7a4008dd018fad5e205a273c398eb0919e073e40e7e","measured_slow_code_id":"fb69a547c6acb9071f56bb0df49ee724ab06bc09d8170961649a1f6bb4694e56","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_61883","problem_id":"p03166","slow_code_id":"2b4b9efb481fd80309ab989c7346d7d396b772a583fb08219daa975b46b14226","slow_id":"fb69a547c6acb9071f56bb0df49ee724ab06bc09d8170961649a1f6bb4694e56","slow_time":0.3236350128,"speedup":19.263727420842145,"stratum":"8+","sampling_key":"da9940c21c7d70f728f217e40c452935d817c47855d1b409ad6f4fc9dd644ae4","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint memo[100001];\n\nvector<int> V[100001];\n\nint dfs(int A) {\n\n  if (memo[A] != -1)\n    return memo[A];\n\n  int saidai = 0;\n\n  for (int i : V[A]) {\n\n    saidai = max(saidai, dfs(i));\n  }\n\n  memo[A] = saidai + 1;\n\n  return memo[A];\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, M;\n\n  cin >> N >> M;\n\n  rep(i, M) {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    V[x].pb(y);\n  }\n\n  rep1(i, N) memo[i] = -1;\n\n  int saidai = 0;\n\n  rep1(i, N) { saidai = max(saidai, dfs(i) - 1); }\n\n  co(saidai);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint memo[100001];\n\nint to[100001], ne[100001], he[100001];\n\nint dfs(int A) {\n\n  if (memo[A] != -1)\n    return memo[A];\n\n  int saidai = 0;\n\n  for (int i = he[A]; i; i = ne[i]) {\n\n    chmax(saidai, dfs(to[i]));\n  }\n\n  return memo[A] = saidai + 1;\n}\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  int N = getint(), M = getint();\n\n  rep1(i, M) {\n\n    int x = getint();\n\n    to[i] = getint();\n\n    ne[i] = he[x];\n\n    he[x] = i;\n  }\n\n  rep1(i, N) memo[i] = -1;\n\n  int saidai = 0;\n\n  rep1(i, N) if (memo[i] == -1) chmax(saidai, dfs(i) - 1);\n\n  printf(\"%d\", saidai);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"3935d12fafed918b0a4a65fce5c697b699430a7731cbf33a85548cc5ffacd9eb","fast_id":"b6ec2033590980fabcc81faf23faf11f11ff110d3c0c923d8f423aca9357cc20","fast_time":0.1079977367,"language":"cpp","measured_fast_code_id":"b6ec2033590980fabcc81faf23faf11f11ff110d3c0c923d8f423aca9357cc20","measured_slow_code_id":"c35452fcb212b2b604f2ea0b7049dcba02401fa44ef5fc6e03450746229c595a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_6230","problem_id":"p03959","slow_code_id":"82cc4a4833f02e9de02081078768f525b5a0338aef2ec1817b854387fc4e32dd","slow_id":"c35452fcb212b2b604f2ea0b7049dcba02401fa44ef5fc6e03450746229c595a","slow_time":0.286318225,"speedup":2.651150234706724,"stratum":"2-4","sampling_key":"58be41dcf6cf0f10662d6f140b861fe623e0e65167a4c731f7aa5192c3a0e7c5","slow_code":"#include <iostream>\n\n#include <string.h>\n\n#include <string>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <stack>\n\n#include <queue>\n\n#include <vector>\n\n#include <cmath>\n\n#include <utility>\n\n#include <set>\n\n#define ll long long int\n\n#define ld long double\n\n#define INF 1000000000\n\n#define EPS 0.0000000001\n\n#define MOD 1000000007\n\n#define rep(i, n) for (i = 0; i < n; i++)\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\nint main()\n\n{\n\n  int n;\n\n  ll t[100000];\n\n  ll a[100000];\n\n  pii tr[100000];\n\n  pii ar[100000];\n\n  int i, j;\n\n  ll ans = 1LL;\n\n  cin >> n;\n\n  cin >> t[0];\n\n  tr[0].first = tr[0].second = t[0];\n\n  for (i = 1; i < n; i++) {\n\n    cin >> t[i];\n\n    tr[i].second = t[i];\n\n    if (t[i] > t[i - 1])\n\n      tr[i].first = t[i];\n\n    else\n\n      tr[i].first = 1;\n  }\n\n  rep(i, n) {\n\n    cin >> a[i];\n\n    ar[i].second = a[i];\n  }\n\n  ar[n - 1].first = ar[n - 1].second = a[n - 1];\n\n  for (i = n - 2; i >= 0; i--)\n\n    if (a[i] > a[i + 1])\n\n      ar[i].first = a[i];\n\n    else\n\n      ar[i].first = 1;\n\n  rep(i, n) {\n\n    if (ar[i].first <= tr[i].first && tr[i].second <= ar[i].second)\n\n      ans = (ans * (tr[i].second - tr[i].first + 1)) % MOD;\n\n    else if (tr[i].first <= ar[i].first && ar[i].second <= tr[i].second)\n\n      ans = (ans * (ar[i].second - ar[i].first + 1)) % MOD;\n\n    else if (ar[i].first <= tr[i].first && tr[i].first <= ar[i].second)\n\n      ans = (ans * (ar[i].second - tr[i].first + 1)) % MOD;\n\n    else if (tr[i].first <= ar[i].first && ar[i].first <= tr[i].second)\n\n      ans = (ans * (tr[i].second - ar[i].first + 1)) % MOD;\n\n    else {\n\n      cout << \"0\" << endl;\n\n      return 0;\n    }\n  }\n\n  cout << ans << endl;\n}\n","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <math.h>\n\n#include <string>\n\n#include <string.h>\n\n#include <stack>\n\n#include <queue>\n\n#include <vector>\n\n#include <utility>\n\n#include <set>\n\n#include <map>\n\n#include <stdlib.h>\n\n#include <iomanip>\n\nusing namespace std;\n\n#define ll long long\n\n#define ld long double\n\n#define EPS 0.0000000001\n\n#define INF 1e9\n\n#define MOD 1000000007\n\n#define rep(i, n) for (i = 0; i < n; i++)\n\n#define loop(i, a, n) for (i = a; i < n; i++)\n\n#define all(in) in.begin(), in.end()\n\n#define shosu(x) fixed << setprecision(x)\n\ntypedef vector<int> vi;\n\ntypedef pair<int, int> pii;\n\nint main(void) {\n\n  int i, j;\n\n  int n;\n\n  cin >> n;\n\n  vi a(n), h(n);\n\n  vector<bool> f(n, false);\n\n  rep(i, n) cin >> a[i];\n\n  rep(i, n) {\n\n    h[i] = a[i];\n\n    if (i == 0 || a[i] != a[i - 1])\n      f[i] = true;\n  }\n\n  rep(i, n) cin >> a[i];\n\n  for (i = n - 1; i >= 0; i--) {\n\n    if (f[i]) {\n\n      if (i == n - 1 || a[i] != a[i + 1]) {\n\n        if (h[i] != a[i]) {\n\n          cout << 0 << endl;\n\n          return 0;\n        }\n\n      } else {\n\n        if (h[i] > a[i]) {\n\n          cout << 0 << endl;\n\n          return 0;\n        }\n      }\n\n    } else {\n\n      if (i == n - 1 || a[i] != a[i + 1]) {\n\n        if (h[i] < a[i]) {\n\n          cout << 0 << endl;\n\n          return 0;\n        }\n\n        h[i] = a[i];\n\n        f[i] = true;\n\n      } else {\n\n        if (h[i] > a[i])\n          h[i] = a[i];\n      }\n    }\n  }\n\n  ll ans = 1;\n\n  rep(i, n) if (f[i] == false) ans = (ans * h[i]) % MOD;\n\n  cout << ans << endl;\n}\n"}
{"fast_code_id":"69a0280ad679c8380a697e3516a586cb398892b7ef1aa6a6704f75f5296d4c26","fast_id":"3f670559066d579699dabe4f474e2bd5c9101429b57264b156c05e8bf7f96a9e","fast_time":0.020060995,"language":"cpp","measured_fast_code_id":"3f670559066d579699dabe4f474e2bd5c9101429b57264b156c05e8bf7f96a9e","measured_slow_code_id":"11009f36475a04002dd9b4766654b2c0ec58d9e4a94accd107324333488a3afc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_6231","problem_id":"p03321","slow_code_id":"69024668931443bb053b22eaa61227fc6ce4a1cc31331f8e5726973a3974d4a1","slow_id":"11009f36475a04002dd9b4766654b2c0ec58d9e4a94accd107324333488a3afc","slow_time":0.3202219646,"speedup":15.96241684921411,"stratum":"8+","sampling_key":"62d83d41cfe7f3d97ba649587905b50ebedf1dc7a63b26125fecd23d5aa1bc58","slow_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\n#define sf scanf\n\n#define pf printf\n\n#define pb push_back\n\n#define mp make_pair\n\n#define PI (acos(-1.0))\n\n#define mod 1000000007LL\n\n#define IN freopen(\"C.in\", \"r\", stdin)\n\n#define OUT freopen(\"output.txt\", \"w\", stdout)\n\n#define FOR(i, a, b) for (i = a; i <= b; i++)\n\n#define DBG pf(\"Hi\\n\")\n\n#define MEM(ara, val) memset(ara, val, sizeof(ara))\n\n#define INF 1000000000\n\n#define i64 long long int\n\n#define eps (1e-8)\n\n#define xx first\n\n#define yy second\n\n#define ln 17\n\n#define off 2\n\nusing namespace __gnu_pbds;\n\nusing namespace std;\n\ntypedef tree<i64, null_type, less<i64>, rb_tree_tag,\n             tree_order_statistics_node_update>\n    ordered_set;\n\ntypedef pair<i64, i64> pii;\n\n#define maxn 700\n\nint g[maxn + 5][maxn + 5];\n\nint col[maxn + 5], cnt[2], n;\n\nbool dfs(int u, int c)\n\n{\n\n  int ret = 1;\n\n  cnt[c]++;\n  col[u] = c;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (!g[u][i] || u == i)\n      continue;\n\n    int v = i;\n\n    if (col[v] != -1 && col[v] == c)\n\n    {\n\n      ret = false;\n    }\n\n    if (col[v] == -1)\n      ret &= dfs(v, c ^ 1);\n  }\n\n  return ret;\n}\n\nint dp[705][705];\n\nint main()\n\n{\n\n  MEM(col, -1);\n\n  MEM(g, 1);\n\n  int i, j, k, m;\n\n  scanf(\"%d %d\", &n, &m);\n\n  for (i = 1; i <= m; i++)\n\n  {\n\n    int u, v;\n\n    scanf(\"%d %d\", &u, &v);\n\n    g[u][v] = 0;\n\n    g[v][u] = 0;\n  }\n\n  int yes = 1;\n\n  dp[0][0] = 1;\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    if (col[i] == -1)\n\n    {\n\n      cnt[0] = cnt[1] = 0;\n\n      yes &= dfs(i, 0);\n\n      for (j = 0; j + cnt[0] <= n; j++)\n        dp[i][j + cnt[0]] |= dp[i - 1][j];\n\n      for (j = 0; j + cnt[1] <= n; j++)\n        dp[i][j + cnt[1]] |= dp[i - 1][j];\n\n    }\n\n    else\n      for (j = 0; j <= n; j++)\n        dp[i][j] = dp[i - 1][j];\n  }\n\n  int ans = (n * (n - 1)) / 2;\n\n  for (i = 0; i <= n; i++)\n\n  {\n\n    if (dp[n][i])\n      ans = min(ans, (n * (n - 1)) / 2 - (n - i) * i);\n  }\n\n  if (!yes)\n    printf(\"-1\\n\");\n\n  else\n    printf(\"%d\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 705;\n\nconst int M = 490005;\n\nint n, m, u, v, ans = 0x7fffffff;\n\nbool g[N][N], s[N], t[N];\n\nint col[N], cnt[2];\n\nvoid dfs(int x, int c) {\n\n  col[x] = c;\n\n  cnt[c == 1]++;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (i == x || g[x][i])\n      continue;\n\n    if (!col[i])\n      dfs(i, -c);\n\n    else if (col[i] == c) {\n\n      puts(\"-1\");\n\n      exit(0);\n    }\n  }\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= m; i++) {\n\n    scanf(\"%d%d\", &u, &v);\n\n    g[u][v] = g[v][u] = 1;\n  }\n\n  s[0] = 1;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (col[i])\n      continue;\n\n    cnt[0] = cnt[1] = 0;\n\n    dfs(i, 1);\n\n    memset(t, 0, sizeof t);\n\n    for (int j = 0; j <= n; j++) {\n\n      t[j + cnt[0]] |= s[j];\n\n      t[j + cnt[1]] |= s[j];\n    }\n\n    for (int j = 0; j <= n; j++)\n\n      s[j] = t[j];\n  }\n\n  for (int i = 0; i <= n; i++)\n\n    if (s[i])\n\n      ans = min(ans, i * (i - 1) / 2 + (n - i) * (n - i - 1) / 2);\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"433102814d6d259bb702beba79a1187b37e258ffd40f714cba278bdb10779d58","fast_id":"226c0b3214dc585ec1d1d54bf91381b03ba861f5ed73bb4d0a8134ec1c51c664","fast_time":0.0821185108,"language":"cpp","measured_fast_code_id":"226c0b3214dc585ec1d1d54bf91381b03ba861f5ed73bb4d0a8134ec1c51c664","measured_slow_code_id":"6046afd28d7ba4b03ce584cbe8d129a123b9bc5401ee5b860d1e763b18c97659","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_62895","problem_id":"p02991","slow_code_id":"218b9865a54cddb43367b8728ee2ff7043ed9a28db894a4a2f848cce1671837d","slow_id":"6046afd28d7ba4b03ce584cbe8d129a123b9bc5401ee5b860d1e763b18c97659","slow_time":0.8744044323,"speedup":10.648079510716114,"stratum":"8+","sampling_key":"f107d72b6ff84df9cffedaf22c96185911795590b2efd02996ac7461e585b2e8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstatic const int MAX = 300000;\n\nstatic const int INF = 1e9;\n\nvector<int> G[MAX], d(MAX, INF);\n\nvoid bfs(int s) {\n\n  queue<int> q;\n\n  q.push(s);\n\n  d[s] = 0;\n\n  while (!q.empty()) {\n\n    int u = q.front();\n\n    q.pop();\n\n    for (int v = 0; v < G[u].size(); v++) {\n\n      if (d[G[u][v]] == INF) {\n\n        d[G[u][v]] = d[u] + 1;\n\n        q.push(G[u][v]);\n      }\n    }\n  }\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n, m;\n\n  cin >> n >> m;\n\n  int u, v;\n\n  for (int i = 0; i < m; i++) {\n\n    cin >> u >> v;\n\n    u--;\n\n    v--;\n\n    G[u].emplace_back(v + 100000);\n\n    G[u + 100000].emplace_back(v + 200000);\n\n    G[u + 200000].emplace_back(v);\n  }\n\n  int s, t;\n\n  cin >> s >> t;\n\n  s--;\n\n  t--;\n\n  bfs(s);\n\n  if (d[t] == INF)\n    cout << \"-1\\n\";\n\n  else\n    cout << d[t] / 3 << '\\n';\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n, m;\n\n  cin >> n >> m;\n\n  vector<vector<int>> G(n);\n\n  for (int i = 0; i < m; i++) {\n\n    int u, v;\n\n    cin >> u >> v;\n\n    u--;\n\n    v--;\n\n    G[u].emplace_back(v);\n  }\n\n  int s, t;\n\n  cin >> s >> t;\n\n  s--;\n\n  t--;\n\n  vector<vector<int>> dp(n, vector<int>(3, 1e9));\n\n  dp.at(s).at(0) = 0;\n\n  queue<pair<int, int>> q;\n\n  q.push(make_pair(s, 0));\n\n  while (!q.empty()) {\n\n    pair<int, int> p = q.front();\n\n    q.pop();\n\n    for (int i = 0; i < G[p.first].size(); i++) {\n\n      if (dp.at(G[p.first][i]).at((p.second + 1) % 3) <= dp.at(p.first).at(p.second) + 1)\n        continue;\n\n      dp.at(G[p.first][i]).at((p.second + 1) % 3) = dp.at(p.first).at(p.second) + 1;\n\n      q.push(make_pair(G[p.first][i], (p.second + 1) % 3));\n    }\n  }\n\n  if (dp.at(t).at(0) == 1e9)\n    cout << \"-1\\n\";\n\n  else\n    cout << dp.at(t).at(0) / 3 << '\\n';\n}"}
{"fast_code_id":"1b4bcc0b36ce724fef520b0fe8045ad1d971bda5ad5719bacf2cd725cee2b38a","fast_id":"3a772e2c5ef3085d8c2d3414206c4fc0a977517c0f75861023807bd5f711c3eb","fast_time":0.0219628266,"language":"cpp","measured_fast_code_id":"3a772e2c5ef3085d8c2d3414206c4fc0a977517c0f75861023807bd5f711c3eb","measured_slow_code_id":"3889f1d36766acc643a48a53c07996595e02a4df3716384c9004a85fc168f35a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_63091","problem_id":"p03160","slow_code_id":"498ca7755bb3f50661df8e65ba883216cd8d88c17faecaf1a197afcbb80282ed","slow_id":"3889f1d36766acc643a48a53c07996595e02a4df3716384c9004a85fc168f35a","slow_time":1.0006937624,"speedup":45.563068025132985,"stratum":"8+","sampling_key":"026ff91cd4e0fa115cadeb93565566a07275ad61946e638bc3d797a6fc2d79cc","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define IO ios::sync_with_stdio(false), cin.tie(0)\n\ntypedef long long ll;\n\nconst int maxn = 1e6 + 5;\n\nconst int inf = 0x3f3f3f3f;\n\nll a[maxn];\n\nll dp[maxn];\n\nint main()\n\n{\n\n  IO;\n\n  int n, k = 2;\n\n  cin >> n;\n\n  for (int i = 1; i <= n; ++i)\n\n    cin >> a[i];\n\n  memset(dp, inf, sizeof(dp));\n\n  dp[1] = 0;\n\n  for (int i = 2; i <= n; ++i)\n\n  {\n\n    for (int j = 1; j <= k; ++j)\n\n    {\n\n      dp[i] = min(dp[i], dp[max(i - j, 1)] + abs(a[i] - a[max(i - j, 1)]));\n    }\n  }\n\n  cout << dp[n] << endl;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing std::min;\n\n#define MAXN 100003\n\nint abs(int z)\n\n{\n\n  if (z < 0)\n\n    return -z;\n\n  else\n\n    return z;\n}\n\nint main(void)\n\n{\n\n  int N, i, j;\n\n  int h[MAXN], p[MAXN];\n\n  scanf(\"%d\", &N);\n\n  for (i = 0; i < N; i++)\n\n  {\n\n    scanf(\"%d\", h + i);\n  }\n\n  p[N - 1] = 0;\n\n  p[N - 2] = abs(h[N - 2] - h[N - 1]);\n\n  for (i = N - 3; i >= 0; i--)\n\n  {\n\n    p[i] =\n        min(p[i + 1] + abs(h[i] - h[i + 1]), p[i + 2] + abs(h[i] - h[i + 2]));\n  }\n\n  printf(\"%d\\n\", p[0]);\n\n  return 0;\n}"}
{"fast_code_id":"d9bc41a82141d088ac97843986786ae751b06a497fbc46e8faa2c34a59f59646","fast_id":"e78862e0e1b917cf6ad57829fe6c1517267cb23c9517d53c62985615289a0abb","fast_time":0.0001843682,"language":"cpp","measured_fast_code_id":"e78862e0e1b917cf6ad57829fe6c1517267cb23c9517d53c62985615289a0abb","measured_slow_code_id":"5d295fcd5eed1d08e89abe6d2b11c4e8d794baac04170c9e0c2e1acfaea8af58","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_6782","problem_id":"p03450","slow_code_id":"5a58d4e6bc330677e89ddd40e0efe7d1a2f71e5ed5b55d46863370f83dc184bb","slow_id":"5d295fcd5eed1d08e89abe6d2b11c4e8d794baac04170c9e0c2e1acfaea8af58","slow_time":0.0084465696,"speedup":45.81359258266881,"stratum":"8+","sampling_key":"5f327e5cf41f4e891924ae68d0a235dcb73e8b1b247c227cd44f084e771519dd","slow_code":"#include <bits/stdc++.h>\n\n#define LL long long\n\n#define mp make_pair\n\n#define pb push_back\n\n#define INF (1 << 29)\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\nint n, m;\n\nvector<pii> G[200010];\n\nint col[200010];\n\nint vis[200010];\n\nbool dfs(int x, int co) {\n\n  if (vis[x] != -1)\n    return col[x] == co;\n\n  vis[x] = 1;\n\n  col[x] = co;\n\n  for (pii i : G[x]) {\n\n    if (dfs(i.first, co + i.second) == 0)\n      return false;\n  }\n\n  return true;\n}\n\nint main() {\n\n  cin >> n >> m;\n\n  memset(vis, -1, sizeof(vis));\n\n  if (m == 0) {\n\n    cout << \"Yes\\n\";\n\n    return 0;\n  }\n\n  for (int i = 1; i <= m; i++) {\n\n    int l, r, d;\n\n    cin >> l >> r >> d;\n\n    G[l].pb(mp(r, d));\n\n    G[r].pb(mp(l, -d));\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    if (vis[i] != -1)\n      continue;\n\n    memset(col, 0, sizeof(col));\n\n    if (dfs(i, 0) == 0) {\n\n      cout << \"No\\n\";\n\n      return 0;\n    }\n  }\n\n  cout << \"Yes\\n\";\n\n  return 0;\n}\n","fast_code":"\n\n#include <cstdio>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cmath>\n\n#define re register\n\n#define ll long long\n\n#define il inline\n\n#define rep(i, s, t) for (re int i = (s); i <= (t); i++)\n\n#define rev_rep(i, s, t) for (re int i = (s); i >= (t); i--)\n\n#define each(i, u) for (int i = head[u]; i; i = bow[i].nxt)\n\n#define pt(ch) putchar(ch)\n\n#define pti(x) printf(\"%d\", x)\n\n#define ptll(x) printf(\"%lld\", x)\n\n#define file(s) freopen(s \".in\", \"r\", stdin), freopen(s \".out\", \"w\", stdout)\n\nusing namespace std;\n\nil int ci() {\n\n  re char ch;\n  int f = 1;\n\n  while (!isdigit(ch = getchar()))\n    f = ch == '-' ? -1 : 1;\n\n  re int x = ch ^ '0';\n\n  while (isdigit(ch = getchar()))\n    x = (x * 10) + (ch ^ '0');\n\n  return f * x;\n}\n\nenum { N = 100024 };\n\nint fa[N], dis[N];\n\nvoid fd(int x) {\n\n  if (fa[x] == x)\n    return;\n\n  fd(fa[x]);\n\n  dis[x] += dis[fa[x]];\n\n  fa[x] = fa[fa[x]];\n}\n\nint main() {\n\n  int n = ci(), m = ci();\n\n  rep(i, 1, n) fa[i] = i;\n\n  while (m--) {\n\n    int l = ci(), r = ci(), d = ci();\n\n    fd(l), fd(r);\n\n    if (fa[l] == fa[r]) {\n\n      if (dis[r] - dis[l] != d) {\n\n        puts(\"No\");\n\n        return 0;\n      }\n\n    }\n\n    else {\n\n      int fl = fa[l], fr = fa[r];\n\n      int x = dis[l] + d - dis[r];\n\n      dis[fr] = x;\n\n      fa[fr] = fl;\n    }\n  }\n\n  puts(\"Yes\");\n\n  return 0;\n}"}
{"fast_code_id":"81e8912f1b855f1d53bec75cb59265376ac7983a91221aa4890aeb95caa38ce8","fast_id":"38763beae38e26b9450997b4ea64820b9ea0654d0c17166f6408d52162fa3bb8","fast_time":0.1111383685,"language":"cpp","measured_fast_code_id":"38763beae38e26b9450997b4ea64820b9ea0654d0c17166f6408d52162fa3bb8","measured_slow_code_id":"dd5a537bfc4f6a7e32cadb9f6df1e6b64c83b358d271b5de64124154402a1c2d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_683","problem_id":"p02618","slow_code_id":"6e5aaeb12c6341c672b530cea3279d5fd884ed0055c31df7fe16e5f80cab9188","slow_id":"dd5a537bfc4f6a7e32cadb9f6df1e6b64c83b358d271b5de64124154402a1c2d","slow_time":0.2685173216,"speedup":2.416063194233412,"stratum":"2-4","sampling_key":"1394bfd115d2dfe01d1501779145808485394e06cc4c85a74c81f0ab13aa8414","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long calc(int n, const vector<int> &options, const vector<int> &cost,\n\n               const vector<array<int, 26>> &s, int dd, int nt, int ot) {\n\n  int before(dd - 1), after(dd + 1);\n\n  while (before >= 0 && options[before] != nt)\n    before--;\n\n  while (after < n && options[after] != nt)\n    after++;\n\n  int a(dd - before - 1), b(after - dd - 1), c(after - before - 1);\n\n  int diff = c * (c + 1) / 2 - a * (a + 1) / 2 - b * (b + 1) / 2;\n\n  int before2(dd - 1), after2(dd + 1);\n\n  while (before2 >= 0 && options[before2] != ot)\n    before2--;\n\n  while (after2 < n && options[after2] != ot)\n    after2++;\n\n  int a2(dd - before2 - 1), b2(after2 - dd - 1), c2(after2 - before2 - 1);\n\n  int diff2 = c2 * (c2 + 1) / 2 - a2 * (a2 + 1) / 2 - b2 * (b2 + 1) / 2;\n\n  return -(long long)diff * cost[nt] + (long long)diff2 * cost[ot] + s[dd][nt] - s[dd][ot];\n}\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  vector<int> c(26);\n\n  vector<array<int, 26>> s(n);\n\n  vector<int> last(26, -1);\n\n  for (int i = 0; i < 26; ++i)\n\n    cin >> c[i];\n\n  for (int i = 0; i < n; ++i)\n\n    for (int j = 0; j < 26; ++j)\n\n      cin >> s[i][j];\n\n  long long total(0);\n\n  vector<int> options(n);\n\n  for (int i = 0; i < n; ++i) {\n\n    int neg(0), test(-1);\n\n    for (int j = 0; j < 26; ++j) {\n\n      neg -= c[j] * (i - last[j]);\n    }\n\n    int max_score = -1e9;\n\n    for (int j = 0; j < 26; ++j) {\n\n      int ss = s[i][j] + neg + c[j] * (i - last[j]);\n\n      if (ss > max_score) {\n\n        max_score = ss;\n\n        test = j;\n      }\n    }\n\n    total += max_score;\n\n    options[i] = test;\n\n    last[test] = i;\n  }\n\n  for (int t = 1; t <= 500; ++t) {\n\n    for (int dd = n - 1; dd >= 0; --dd) {\n\n      for (int tt = 25; tt >= 0; --tt) {\n\n        if (tt == options[dd])\n          continue;\n\n        int ot = options[dd];\n\n        long long ns = calc(n, options, c, s, dd, tt, ot);\n\n        if (ns > 0) {\n\n          total += ns;\n\n          options[dd] = tt;\n        }\n      }\n    }\n  }\n\n  for (const int &i : options)\n    cout << i + 1 << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long calc(int n, int c1, int c2, int s1, int s2, const vector<int> &options,\n\n               int d, int nt, int ot) {\n\n  int b1(d - 1), a1(d + 1), b2(d - 1), a2(d + 1);\n\n  while (b1 >= 0 && options[b1] != nt)\n    b1--;\n\n  while (b2 >= 0 && options[b2] != ot)\n    b2--;\n\n  while (a1 < n && options[a1] != nt)\n    a1++;\n\n  while (a2 < n && options[a2] != ot)\n    a2++;\n\n  int x1(d - b1 - 1), y1(a1 - d - 1), z1(a1 - b1 - 1), x2(d - b2 - 1), y2(a2 - d - 1),\n      z2(a2 - b2 - 1);\n\n  int diff1 = z1 * (z1 + 1) / 2 - x1 * (x1 + 1) / 2 - y1 * (y1 + 1) / 2;\n\n  int diff2 = z2 * (z2 + 1) / 2 - x2 * (x2 + 1) / 2 - y2 * (y2 + 1) / 2;\n\n  return (long long)diff1 * c1 - (long long)diff2 * c2 + s1 - s2;\n}\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  vector<int> c(26);\n\n  vector<array<int, 26>> s(n);\n\n  vector<int> last(26, -1);\n\n  for (int i = 0; i < 26; ++i)\n\n    cin >> c[i];\n\n  for (int i = 0; i < n; ++i)\n\n    for (int j = 0; j < 26; ++j)\n\n      cin >> s[i][j];\n\n  long long total(0);\n\n  vector<int> options(n);\n\n  for (int i = 0; i < n; ++i) {\n\n    int neg(0), test(-1);\n\n    for (int j = 0; j < 26; ++j) {\n\n      neg -= c[j] * (i - last[j]);\n    }\n\n    int max_score = -1e9;\n\n    for (int j = 0; j < 26; ++j) {\n\n      int ss = s[i][j] + neg + c[j] * (i - last[j]);\n\n      if (ss > max_score) {\n\n        max_score = ss;\n\n        test = j;\n      }\n    }\n\n    total += max_score;\n\n    options[i] = test;\n\n    last[test] = i;\n  }\n\n  for (int t = 1; t <= 500; ++t) {\n\n    bool entered = false;\n\n    for (int dd = 0; dd < n; ++dd) {\n\n      for (int tt = 0; tt < 26; ++tt) {\n\n        if (tt == options[dd])\n          continue;\n\n        int ot = options[dd];\n\n        long long ns = calc(n, c[tt], c[ot], s[dd][tt], s[dd][ot],\n\n                            options, dd, tt, ot);\n\n        if (ns > 0) {\n\n          entered = true;\n\n          total += ns;\n\n          options[dd] = tt;\n        }\n      }\n    }\n\n    if (!entered)\n      break;\n  }\n\n  for (const int &i : options)\n    cout << i + 1 << endl;\n\n  return 0;\n}"}
{"fast_code_id":"8d902291c7c6b30a6e51f38aacb3776d5972a8aa9f77e5a3d3ad3c85498eb529","fast_id":"f7208ae8ffe36e978421ac3ebae151a3f91118d7c723921283e069597b48eab8","fast_time":0.0243781201,"language":"cpp","measured_fast_code_id":"f7208ae8ffe36e978421ac3ebae151a3f91118d7c723921283e069597b48eab8","measured_slow_code_id":"f6f44edefdbb3bcfc80fbcbd531e60c9450f949a6e6cca4fd982f1f7897a6dac","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_695","problem_id":"p02874","slow_code_id":"53475e6719f1a0a139ffccbf06c26a179126665be7f980a82ea6a14b48654cde","slow_id":"f6f44edefdbb3bcfc80fbcbd531e60c9450f949a6e6cca4fd982f1f7897a6dac","slow_time":0.3017456742,"speedup":12.37772531114899,"stratum":"8+","sampling_key":"445d9fa23dfb19bc462cce4cf7904a6c965f9df2d52cf933685ddf4f7535a277","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int K = 18;\n\nconst int KM = 1 << (K - 1);\n\nint dat[1 << K];\n\nvoid update(int A) {\n\n  dat[A] = min(dat[A * 2], dat[A * 2 + 1]);\n\n  if (A != 1)\n    update(A / 2);\n}\n\nvoid add(int A, int B) {\n\n  int C = A + KM;\n\n  dat[C] = B;\n\n  update(C / 2);\n}\n\nint check(int L, int R, int A, int l, int r) {\n\n  if (L <= l && r <= R)\n    return dat[A];\n\n  if (r <= L || R <= l)\n    return 1e9;\n\n  return min(check(L, R, A * 2, l, (l + r) / 2),\n             check(L, R, A * 2 + 1, (l + r) / 2, r));\n}\n\nint query(int L, int R) { return check(L, R, 1, 0, KM); }\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  pair<int, int> LR[100000];\n\n  int kotae = 0;\n\n  rep(i, N) {\n\n    int l, r;\n\n    cin >> l >> r;\n\n    LR[i] = mp(l, r);\n  }\n\n  sort(LR, LR + N);\n\n  rep(i, 1 << K) dat[i] = 1e9;\n\n  rep(i, N) add(i, LR[i].second);\n\n  rep(i, N) {\n\n    int l1 = LR[i].first;\n\n    int r1 = LR[i].second;\n\n    int lr1 = max(0, r1 - l1 + 1);\n\n    int l2 = (i == N - 1) ? LR[N - 2].first : LR[N - 1].first;\n\n    int r2 = min(query(i + 1, N), query(0, i));\n\n    int lr2 = max(0, r2 - l2 + 1);\n\n    kotae = max(kotae, lr1 + lr2);\n  }\n\n  rep(i, N - 1) {\n\n    int l1 = LR[i].first;\n\n    int r1 = query(0, i + 1);\n\n    int lr1 = max(0, r1 - l1 + 1);\n\n    int l2 = LR[N - 1].first;\n\n    int r2 = query(i + 1, N);\n\n    int lr2 = max(0, r2 - l2 + 1);\n\n    kotae = max(kotae, lr1 + lr2);\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"\n\n#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nvoid pakuri_sort(int N, ll A[]) {\n\n  const int b = 8;\n\n  ll tmp[100001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n  }\n}\n\nint main() {\n\n  int N = getint();\n\n  ll LR[100000];\n\n  rep(i, N) LR[i] = getint() + ((ll)getint() << 32);\n\n  pakuri_sort(N, LR);\n\n  int r1[100000];\n\n  int r2 = 1e9;\n\n  const int m = (1 << 31) - 1;\n\n  r1[0] = LR[0] >> 32;\n\n  rep1(i, N - 1) r1[i] = min(r1[i - 1], (int)(LR[i] >> 32));\n\n  int kotae = (LR[N - 1] >> 32) - (LR[N - 1] & m) +\n              max(-1, r1[N - 2] - (int)(LR[N - 2] & m));\n\n  int lm = (int)(LR[N - 1] & m);\n\n  for (int i = N - 2; i >= 1; i--) {\n\n    chmin(r2, (int)(LR[i + 1] >> 32));\n\n    chmax(kotae, (int)((LR[i] >> 32) - (LR[i] & m) +\n                       max(-1, min(r1[i - 1], r2) - lm)));\n\n    chmax(kotae, max(-1, r1[i] - (int)(LR[i] & m)) + max(-1, (int)(r2 - lm)));\n  }\n\n  chmin(r2, (int)(LR[1] >> 32));\n\n  chmax(kotae, (int)((LR[0] >> 32) - (LR[0] & m) + max(-1, r2 - lm)));\n\n  chmax(kotae, max(-1, r1[0] - (int)(LR[0] & m)) + max(-1, (int)(r2 - lm)));\n\n  printf(\"%d\", kotae + 2);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"46d2adca9aa389dd8f20616d65cabf4af7de20c15c4d984bddd9f75219f0d042","fast_id":"dfc1f341c7875fe161ce5c45e99c19dff4d5075f9f5be6ad858c2bc567ed90e2","fast_time":0.1060894446,"language":"cpp","measured_fast_code_id":"dfc1f341c7875fe161ce5c45e99c19dff4d5075f9f5be6ad858c2bc567ed90e2","measured_slow_code_id":"e737a112642316b46ca2ce09aba26b7c7f9384bc217d92ebaa256c21f12efbeb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_699","problem_id":"p02940","slow_code_id":"d772be3cb1632df82287b5647672f731d04a57da31754ac7c3d1a417248940df","slow_id":"e737a112642316b46ca2ce09aba26b7c7f9384bc217d92ebaa256c21f12efbeb","slow_time":0.2196741902,"speedup":2.0706507704725983,"stratum":"2-4","sampling_key":"a8b69641ac5625c79dae719853d518bb352ccf1ebe05e79a742e57963548db96","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <math.h>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <string>\n\n#include <set>\n\n#include <iomanip>\n\n#include <map>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <vector>\n\n#include <climits>\n\n#include <stack>\n\n#include <queue>\n\n#include <bitset>\n\n#include <deque>\n\n#include <climits>\n\n#include <typeinfo>\n\n#include <utility>\n\nusing namespace std;\n\nusing ll = long long;\n\ntemplate <typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n\nconst ll inf = 1LL << 60;\n\n#define all(x) (x).begin(), (x).end()\n\n#define puts(x) cout << x << endl\n\n#define rep(i, m, n) for (ll i = m; i < n; ++i)\n\n#define pb push_back\n\n#define fore(i, a) for (auto &i : a)\n\n#define rrep(i, m, n) for (ll i = m; i >= n; --i)\n\nll mod = 998244353;\n\nll fact[101010];\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  int N;\n\n  string S;\n\n  cin >> N >> S;\n\n  fact[0] = 1;\n\n  for (ll i = 1; i < 101010; i++) {\n\n    fact[i] = fact[i - 1] * i;\n\n    fact[i] %= mod;\n  }\n\n  ll ans = fact[N];\n\n  map<char, int> mp;\n\n  mp['R'] = 0;\n\n  mp['G'] = 0;\n\n  mp['B'] = 0;\n\n  for (int i = 0; i < 3 * N; i++) {\n\n    char c = S[i];\n\n    vector<pair<int, char>> v;\n\n    fore(x, mp) v.pb({x.second, x.first});\n\n    sort(all(v));\n\n    if (mp[c] == v[0].first) {\n\n      if (v[0].first < v[1].first)\n        ans *= v[1].first - v[0].first;\n\n      else if (v[1].first < v[2].first)\n        ans *= v[2].first - v[0].first;\n\n    }\n\n    else if (mp[c] == v[1].first) {\n\n      if (v[1].first < v[2].first)\n        ans *= v[2].first - v[1].first;\n    }\n\n    mp[c]++;\n\n    ans %= mod;\n  }\n\n  puts(ans);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <math.h>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <string>\n\n#include <set>\n\n#include <iomanip>\n\n#include <map>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <vector>\n\n#include <climits>\n\n#include <stack>\n\n#include <queue>\n\n#include <bitset>\n\n#include <deque>\n\n#include <climits>\n\n#include <typeinfo>\n\n#include <utility>\n\nusing namespace std;\n\nusing ll = long long;\n\ntemplate <typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n\nconst ll inf = 1LL << 60;\n\n#define all(x) (x).begin(), (x).end()\n\n#define puts(x) cout << x << endl\n\n#define rep(i, m, n) for (ll i = m; i < n; ++i)\n\n#define pb push_back\n\n#define fore(i, a) for (auto &i : a)\n\n#define rrep(i, m, n) for (ll i = m; i >= n; --i)\n\nll mod = 998244353;\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  int N;\n\n  string S;\n\n  cin >> N >> S;\n\n  vector<ll> cnt(7);\n\n  cnt[6] = N;\n\n  ll ans = 1;\n\n  for (int i = 0; i < 3 * N; i++) {\n\n    int c = S[i];\n\n    if (c == 'R') {\n\n      if (cnt[2]) {\n\n        ans *= cnt[2];\n\n        cnt[2]--;\n\n      }\n\n      else if (cnt[3]) {\n\n        ans *= cnt[3];\n\n        cnt[3]--;\n\n        cnt[0]++;\n\n      }\n\n      else if (cnt[5]) {\n\n        ans *= cnt[5];\n\n        cnt[5]--;\n\n        cnt[1]++;\n\n      }\n\n      else {\n\n        ans *= cnt[6];\n\n        cnt[6]--;\n\n        cnt[4]++;\n      }\n\n    }\n\n    else if (c == 'G') {\n\n      if (cnt[1]) {\n\n        ans *= cnt[1];\n\n        cnt[1]--;\n\n      }\n\n      else if (cnt[4]) {\n\n        ans *= cnt[4];\n\n        cnt[4]--;\n\n        cnt[0]++;\n\n      }\n\n      else if (cnt[5]) {\n\n        ans *= cnt[5];\n\n        cnt[5]--;\n\n        cnt[2]++;\n\n      }\n\n      else {\n\n        ans *= cnt[6];\n\n        cnt[6]--;\n\n        cnt[3]++;\n      }\n\n    }\n\n    else {\n\n      if (cnt[0]) {\n\n        ans *= cnt[0];\n\n        cnt[0]--;\n\n      }\n\n      else if (cnt[3]) {\n\n        ans *= cnt[3];\n\n        cnt[3]--;\n\n        cnt[2]++;\n\n      }\n\n      else if (cnt[4]) {\n\n        ans *= cnt[4];\n\n        cnt[4]--;\n\n        cnt[1]++;\n\n      }\n\n      else {\n\n        ans *= cnt[6];\n\n        cnt[6]--;\n\n        cnt[5]++;\n      }\n    }\n\n    ans %= mod;\n  }\n\n  puts(ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"b5ee680896c697f5a72da80f0b0d889fb706d55b7c6c642bd948a21dd8ba9028","fast_id":"4b2e5f50560a521c162e2da6334383b893384f610a2c84541612885bbe8aca48","fast_time":0.1073070699,"language":"cpp","measured_fast_code_id":"4b2e5f50560a521c162e2da6334383b893384f610a2c84541612885bbe8aca48","measured_slow_code_id":"d1926e7178e7b61590d15654beee7804c6ddd993f0f742f72e88c1501dd0d27b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_700","problem_id":"p03079","slow_code_id":"2d484c186d9ea9b3183da4b68bcef6f9b1650fa0dfd5297d59f489d55733a445","slow_id":"d1926e7178e7b61590d15654beee7804c6ddd993f0f742f72e88c1501dd0d27b","slow_time":0.5022470244,"speedup":4.68046536792074,"stratum":"4-8","sampling_key":"b62b15b61a7e35f70a483053fd9e0bfc0c4f07b210b0e2e7dcdcb9ef864aff45","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <map>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <set>\n\n#include <stdio.h>\n\n#include <tuple>\n\n#include <bitset>\n\n#include <cfloat>\n\n#include <fstream>\n\n#include <limits.h>\n\n#include <list>\n\n#include <math.h>\n\n#include <random>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <bitset>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <cassert>\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n\n  if (a > b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n\n  if (a < b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\nusing namespace std;\n\n#define int long long\n\n#define ll long long\n\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\n#define P pair<ll, ll>\n\n#define sz(x) (ll) x.size()\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define ALLR(x) (x).rbegin(), (x).rend()\n\n#define VE vector<ll>\n\n#define COUT(x) cout << (x) << endl\n\n#define MA map<ll, ll>\n\n#define SE set<ll>\n\n#define PQ priority_queue<ll>\n\n#define PQR priority_queue<ll, VE, greater<ll>>\n\n#define COUT(x) cout << (x) << endl\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << endl\n\n#define EPS (1e-10)\n\n#define pb push_back\n\nconst long long MOD = 1000000007;\n\nconst long long INF = 1LL << 60;\n\nconst double PI = acos(-1.0);\n\nusing Graph = vector<VE>;\n\nstruct mint {\n\n  ll x;\n\n  mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}\n\n  mint operator-() const { return mint(-x); }\n\n  mint &operator+=(const mint a) {\n\n    if ((x += a.x) >= MOD)\n      x -= MOD;\n\n    return *this;\n  }\n\n  mint &operator-=(const mint a) {\n\n    if ((x += MOD - a.x) >= MOD)\n      x -= MOD;\n\n    return *this;\n  }\n\n  mint &operator*=(const mint a) {\n\n    (x *= a.x) %= MOD;\n\n    return *this;\n  }\n\n  mint operator+(const mint a) const {\n\n    mint res(*this);\n\n    return res += a;\n  }\n\n  mint operator-(const mint a) const {\n\n    mint res(*this);\n\n    return res -= a;\n  }\n\n  mint operator*(const mint a) const {\n\n    mint res(*this);\n\n    return res *= a;\n  }\n\n  mint pow(ll t) const {\n\n    if (!t)\n      return 1;\n\n    mint a = pow(t >> 1);\n\n    a *= a;\n\n    if (t & 1)\n      a *= *this;\n\n    return a;\n  }\n\n  mint inv() const { return pow(MOD - 2); }\n\n  mint &operator/=(const mint a) { return (*this) *= a.inv(); }\n\n  mint operator/(const mint a) const {\n\n    mint res(*this);\n\n    return res /= a;\n  }\n};\n\nstruct combination {\n\n  vector<mint> fact, ifact;\n\n  combination(int n) : fact(n + 1), ifact(n + 1) {\n\n    fact[0] = 1;\n\n    for (int i = 1; i <= n; ++i)\n      fact[i] = fact[i - 1] * i;\n\n    ifact[n] = fact[n].inv();\n\n    for (int i = n; i >= 1; --i)\n      ifact[i - 1] = ifact[i] * i;\n  }\n\n  mint operator()(int n, int k) {\n\n    if (k < 0 || k > n)\n      return 0;\n\n    return fact[n] * ifact[k] * ifact[n - k];\n  }\n\n} com(100010);\n\nstruct edge {\n  ll to, cost;\n};\n\nll gcd(ll a, ll b) {\n\n  if (a < b)\n    swap(a, b);\n\n  if (b == 0)\n    return a;\n\n  unsigned r;\n\n  while ((r = a % b)) {\n\n    a = b;\n\n    b = r;\n  }\n\n  return b;\n}\n\nll lcm(ll a, ll b) {\n\n  ll g = gcd(a, b);\n\n  return a * b / g;\n}\n\nbool prime(ll n) {\n\n  for (ll i = 2; i <= sqrt(n); i++) {\n\n    if (n % i == 0)\n      return false;\n  }\n\n  return n != 1;\n}\n\nmap<ll, ll> prime_factor(ll n) {\n\n  map<ll, ll> ret;\n\n  for (ll i = 2; i * i <= n; i++) {\n\n    while (n % i == 0) {\n\n      ret[i]++;\n\n      n /= i;\n    }\n  }\n\n  if (n != 1)\n    ret[n] = 1;\n\n  return ret;\n}\n\nll modinv(ll a, ll m) {\n\n  ll b = m, u = 1, v = 0;\n\n  while (b) {\n\n    ll t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvector<pair<char, int>> RunLength(string s) {\n\n  if (s.size() == 0)\n    return {};\n\n  vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));\n\n  for (char p : s) {\n\n    if (res.back().first == p) {\n\n      res.back().second++;\n\n    }\n\n    else {\n\n      res.emplace_back(p, 1);\n    }\n  }\n\n  return res;\n}\n\nint GetDigit(int num) { return log10(num) + 1; }\n\nint bit_count(int n) {\n\n  int cnt = 0;\n\n  while (n > 0) {\n\n    if (n % 2 == 1)\n      cnt++;\n\n    n /= 2;\n  }\n\n  return cnt;\n}\n\nmint POW(mint n, int p) {\n\n  if (p == 0)\n    return 1;\n\n  if (p % 2 == 0) {\n\n    mint t = POW(n, p / 2);\n\n    return t * t;\n  }\n\n  return n * POW(n, p - 1);\n}\n\n#define ld long double\n\nconst int dx[6] = {-1, -1, 0, 1, 1, 0};\n\nconst int dy[2][6] = {{-1, 0, 1, 0, -1, -1}, {0, 1, 1, 1, 0, -1}};\n\nint field[200][200];\n\nsigned main() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  int a, b, c;\n  cin >> a >> b >> c;\n\n  if (a == b && b == c)\n    cout << \"Yes\" << endl;\n\n  else\n    cout << \"No\" << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <map>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <set>\n\n#include <stdio.h>\n\n#include <tuple>\n\n#include <bitset>\n\n#include <cfloat>\n\n#include <fstream>\n\n#include <limits.h>\n\n#include <list>\n\n#include <math.h>\n\n#include <random>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <bitset>\n\n#include <numeric>\n\n#include <utility>\n\n#include <sstream>\n\n#include <cassert>\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n\n  if (a > b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n\n  if (a < b) {\n\n    a = b;\n\n    return true;\n  }\n\n  return false;\n}\n\nusing namespace std;\n\n#define int long long\n\n#define ll long long\n\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\n#define P pair<ll, ll>\n\n#define sz(x) (ll) x.size()\n\n#define ALL(x) (x).begin(), (x).end()\n\n#define ALLR(x) (x).rbegin(), (x).rend()\n\n#define VE vector<ll>\n\n#define COUT(x) cout << (x) << endl\n\n#define MA map<ll, ll>\n\n#define SE set<ll>\n\n#define PQ priority_queue<ll>\n\n#define PQR priority_queue<ll, VE, greater<ll>>\n\n#define COUT(x) cout << (x) << endl\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << endl\n\n#define EPS (1e-10)\n\n#define pb push_back\n\nconst long long MOD = 1000000007;\n\nconst long long INF = 1LL << 60;\n\nconst double PI = acos(-1.0);\n\nusing Graph = vector<VE>;\n\nstruct mint {\n\n  ll x;\n\n  mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}\n\n  mint operator-() const { return mint(-x); }\n\n  mint &operator+=(const mint a) {\n\n    if ((x += a.x) >= MOD)\n      x -= MOD;\n\n    return *this;\n  }\n\n  mint &operator-=(const mint a) {\n\n    if ((x += MOD - a.x) >= MOD)\n      x -= MOD;\n\n    return *this;\n  }\n\n  mint &operator*=(const mint a) {\n\n    (x *= a.x) %= MOD;\n\n    return *this;\n  }\n\n  mint operator+(const mint a) const {\n\n    mint res(*this);\n\n    return res += a;\n  }\n\n  mint operator-(const mint a) const {\n\n    mint res(*this);\n\n    return res -= a;\n  }\n\n  mint operator*(const mint a) const {\n\n    mint res(*this);\n\n    return res *= a;\n  }\n\n  mint pow(ll t) const {\n\n    if (!t)\n      return 1;\n\n    mint a = pow(t >> 1);\n\n    a *= a;\n\n    if (t & 1)\n      a *= *this;\n\n    return a;\n  }\n\n  mint inv() const { return pow(MOD - 2); }\n\n  mint &operator/=(const mint a) { return (*this) *= a.inv(); }\n\n  mint operator/(const mint a) const {\n\n    mint res(*this);\n\n    return res /= a;\n  }\n};\n\nstruct combination {\n\n  vector<mint> fact, ifact;\n\n  combination(int n) : fact(n + 1), ifact(n + 1) {\n\n    fact[0] = 1;\n\n    for (int i = 1; i <= n; ++i)\n      fact[i] = fact[i - 1] * i;\n\n    ifact[n] = fact[n].inv();\n\n    for (int i = n; i >= 1; --i)\n      ifact[i - 1] = ifact[i] * i;\n  }\n\n  mint operator()(int n, int k) {\n\n    if (k < 0 || k > n)\n      return 0;\n\n    return fact[n] * ifact[k] * ifact[n - k];\n  }\n\n} com(10);\n\nstruct edge {\n  ll to, cost;\n};\n\nstruct Sieve {\n\n  int n;\n\n  vector<int> f, primes;\n\n  Sieve(int n = 1) : n(n), f(n + 1) {\n\n    f[0] = f[1] = -1;\n\n    for (ll i = 2; i <= n; ++i) {\n\n      if (f[i])\n        continue;\n\n      primes.push_back(i);\n\n      f[i] = i;\n\n      for (ll j = i * i; j <= n; j += i) {\n\n        if (!f[j])\n          f[j] = i;\n      }\n    }\n  }\n\n  bool isPrime(int x) { return f[x] == x; }\n\n  vector<int> factorList(int x) {\n\n    vector<int> res;\n\n    while (x != 1) {\n\n      res.push_back(f[x]);\n\n      x /= f[x];\n    }\n\n    return res;\n  }\n\n  vector<P> factor(int x) {\n\n    vector<int> fl = factorList(x);\n\n    if (fl.size() == 0)\n      return {};\n\n    vector<P> res(1, P(fl[0], 0));\n\n    for (int p : fl) {\n\n      if (res.back().first == p) {\n\n        res.back().second++;\n\n      }\n\n      else {\n\n        res.emplace_back(p, 1);\n      }\n    }\n\n    return res;\n  }\n};\n\nclass UnionFind {\n\npublic:\n  vector<ll> par;\n\n  vector<ll> siz;\n\n  UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {\n\n    for (ll i = 0; i < sz_; ++i)\n      par[i] = i;\n  }\n\n  void init(ll sz_) {\n\n    par.resize(sz_);\n\n    siz.resize(sz_, 1);\n\n    for (ll i = 0; i < sz_; ++i)\n      par[i] = i;\n  }\n\n  ll root(ll x) {\n\n    while (par[x] != x) {\n\n      x = par[x] = par[par[x]];\n    }\n\n    return x;\n  }\n\n  bool merge(ll x, ll y) {\n\n    x = root(x);\n\n    y = root(y);\n\n    if (x == y)\n      return false;\n\n    if (siz[x] < siz[y])\n      swap(x, y);\n\n    siz[x] += siz[y];\n\n    par[y] = x;\n\n    return true;\n  }\n\n  bool issame(ll x, ll y) { return root(x) == root(y); }\n\n  ll size(ll x) { return siz[root(x)]; }\n};\n\nll gcd(ll a, ll b) {\n\n  if (a < b)\n    swap(a, b);\n\n  if (b == 0)\n    return a;\n\n  unsigned r;\n\n  while ((r = a % b)) {\n\n    a = b;\n\n    b = r;\n  }\n\n  return b;\n}\n\nll lcm(ll a, ll b) {\n\n  ll g = gcd(a, b);\n\n  return a * b / g;\n}\n\nbool prime(ll n) {\n\n  for (ll i = 2; i <= sqrt(n); i++) {\n\n    if (n % i == 0)\n      return false;\n  }\n\n  return n != 1;\n}\n\nmap<ll, ll> prime_factor(ll n) {\n\n  map<ll, ll> ret;\n\n  for (ll i = 2; i * i <= n; i++) {\n\n    while (n % i == 0) {\n\n      ret[i]++;\n\n      n /= i;\n    }\n  }\n\n  if (n != 1)\n    ret[n] = 1;\n\n  return ret;\n}\n\nll modinv(ll a, ll m) {\n\n  ll b = m, u = 1, v = 0;\n\n  while (b) {\n\n    ll t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvector<pair<char, int>> RunLength(string s) {\n\n  if (s.size() == 0)\n    return {};\n\n  vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));\n\n  for (char p : s) {\n\n    if (res.back().first == p) {\n\n      res.back().second++;\n\n    }\n\n    else {\n\n      res.emplace_back(p, 1);\n    }\n  }\n\n  return res;\n}\n\nint GetDigit(int num) { return log10(num) + 1; }\n\nint bit_count(int n) {\n\n  int cnt = 0;\n\n  while (n > 0) {\n\n    if (n % 2 == 1)\n      cnt++;\n\n    n /= 2;\n  }\n\n  return cnt;\n}\n\nmint POW(mint n, int p) {\n\n  if (p == 0)\n    return 1;\n\n  if (p % 2 == 0) {\n\n    mint t = POW(n, p / 2);\n\n    return t * t;\n  }\n\n  return n * POW(n, p - 1);\n}\n\n#define ld long double\n\nconst int dx[4] = {1, 0, -1, 0};\n\nconst int dy[4] = {0, 1, 0, -1};\n\nsigned main() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  int a, b, c;\n  cin >> a >> b >> c;\n\n  Yes(a == b && b == c);\n\n  return 0;\n}"}
{"fast_code_id":"9eff682e607dcfce712c05593183e9b928f7fdb065e0ce03bf06ea85572e6a36","fast_id":"4ea8863bf1dcc3a7d9966a8b56d4a2a8bb2df753c558894d0e1c11f03a6b4734","fast_time":0.1071306156,"language":"cpp","measured_fast_code_id":"4ea8863bf1dcc3a7d9966a8b56d4a2a8bb2df753c558894d0e1c11f03a6b4734","measured_slow_code_id":"61ecdf13735da291d29601c29e1716b83f83aa51c5c024990e695d288e223e72","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_70931","problem_id":"p03062","slow_code_id":"84451d088b722b9ac29753f220dee9e15bfbdcdc07620d2f1f4159bb7d6621c4","slow_id":"61ecdf13735da291d29601c29e1716b83f83aa51c5c024990e695d288e223e72","slow_time":0.4504363712,"speedup":4.204553186568266,"stratum":"4-8","sampling_key":"316b9b11c0a7ba85f61d9c699b62f88d526f5fce56df1ac38fab520dfee7c465","slow_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\n#define off                                                                                        \\\n  ios_base::sync_with_stdio(0);                                                                    \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0)\n\n#define pi 3.141592653589793116\n\n#define mod 1e9 + 7\n\ntypedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;\n\nlong long int dp[100001][2][2];\n\nint a[100001];\n\nint n;\n\nlong long go(int i, int curr, int pre1)\n\n{\n\n  if (i == n - 1)\n\n  {\n\n    if (curr == 1)\n\n      return -a[i];\n\n    else\n\n      return a[i];\n  }\n\n  if (dp[i][curr][pre1] != -1)\n\n    return dp[i][curr][pre1];\n\n  else\n\n  {\n    long long ans = 0;\n\n    if (curr == 1)\n\n      ans = max({ans, -a[i] + go(i + 1, 0, curr), a[i] + go(i + 1, 1, curr)});\n\n    else\n\n      ans = max({ans, a[i] + go(i + 1, 0, curr), -a[i] + go(i + 1, 1, curr)});\n\n    dp[i][curr][pre1] = ans;\n\n    return ans;\n  }\n}\n\nint main() {\n\n  off;\n\n  int t;\n\n  t = 1;\n\n  while (t--) {\n\n    cin >> n;\n\n    for (int i = 0; i < n; i++)\n\n      cin >> a[i];\n\n    memset(dp, -1, sizeof(dp));\n\n    long long x = 0;\n\n    x = max(a[0] + go(1, 0, 0), -a[0] + go(1, 1, 1));\n\n    cout << x << '\\n';\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\nusing namespace std;\n\nusing namespace __gnu_pbds;\n\n#define off                                                                                        \\\n  ios_base::sync_with_stdio(0);                                                                    \\\n  cin.tie(0);                                                                                      \\\n  cout.tie(0)\n\n#define pi 3.141592653589793116\n\n#define mod 1e9 + 7\n\ntypedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;\n\nint main() {\n\n  off;\n\n  int t;\n\n  t = 1;\n\n  while (t--) {\n\n    int n;\n\n    cin >> n;\n\n    int a[n], c = 0, min1 = INT_MAX;\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      cin >> a[i];\n\n      if (a[i] < 0)\n\n        ++c;\n\n      min1 = min(min1, abs(a[i]));\n    }\n\n    long long sum = 0;\n\n    for (int i = 0; i < n; i++)\n\n      sum += abs(a[i]);\n\n    if (c % 2 == 0)\n\n    {\n\n      cout << sum << '\\n';\n\n    }\n\n    else\n\n    {\n\n      cout << sum - 2 * min1 << '\\n';\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"3e86b0fefa7a7378a64a2848665aa64efd85b311f5d18e33b1cef069b45475e4","fast_id":"980cd3aa80ef550230bb324a91124fdc40cef4795d55c5e880e89a86fb11ead9","fast_time":0.0915881564,"language":"cpp","measured_fast_code_id":"980cd3aa80ef550230bb324a91124fdc40cef4795d55c5e880e89a86fb11ead9","measured_slow_code_id":"bc1859ad24e982315ee015d2cecaaa2f75fe7636d98c8219a82036ede9abc9a3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_70945","problem_id":"p03077","slow_code_id":"023b94791abdc36e219157a2ca74a58ff3aab3bc307ecefc4f1f0349abb68310","slow_id":"bc1859ad24e982315ee015d2cecaaa2f75fe7636d98c8219a82036ede9abc9a3","slow_time":0.3266453407,"speedup":3.5664583013705036,"stratum":"2-4","sampling_key":"c88a283e3efb71d650c2b4b70f6718e5b22860a85a575ee95cbb4184e7631fd2","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = (int)1e5 + 10;\n\nconst double eps = 1e-8;\n\ntemplate <typename T> inline T gcd(T a, T b) {\n  a = abs(a), b = abs(b);\n  while (b) {\n    a %= b;\n    swap(a, b);\n  }\n  return a;\n}\n\nvector<pair<int, int> > adj[N + 7];\n\nint main() {\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n  cout.tie(0);\n\n  ll n, arr[10];\n\n  ll mn = (ll)1e18;\n\n  cin >> n;\n\n  for (int i = 0; i < 5; ++i) {\n\n    cin >> arr[i];\n\n    mn = min(arr[i], mn);\n  }\n\n  ll ans = 4 + ceil(n * 1.0 / mn * 1.0);\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  long long int n, i, j, min, a[10];\n\n  cin >> n;\n\n  min = 1000000000000009;\n\n  for (i = 0; i < 5; i++)\n\n  {\n\n    cin >> a[i];\n\n    if (a[i] < min)\n\n      min = a[i];\n  }\n\n  if (n % min == 0)\n\n    cout << (n / min) + 4 << endl;\n\n  else\n\n    cout << (n / min) + 5 << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"a8b516308c67f4ebc7958ef8962aff3103ee31e99d6e3d339437509e49309b67","fast_id":"70dcc15d2b2627d63c45a4bf8960b544c4eb2d6de357a88101d5564ef63df714","fast_time":0.0185978484,"language":"cpp","measured_fast_code_id":"70dcc15d2b2627d63c45a4bf8960b544c4eb2d6de357a88101d5564ef63df714","measured_slow_code_id":"61440dab67bb9b20de6878db6c774666f2c15a256d1f62f87f6d893496dbb0a0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_70962","problem_id":"p03678","slow_code_id":"b54779ef30353f93b7d02075fe37658a98c8cde642b4f88d1ecf1cfc7103905f","slow_id":"61440dab67bb9b20de6878db6c774666f2c15a256d1f62f87f6d893496dbb0a0","slow_time":0.0884226655,"speedup":4.754456730596858,"stratum":"4-8","sampling_key":"d951a8f5bf38187f557578203b5016c371b02d656463ec0a841567787d23316e","slow_code":"#pragma GCC optimize(3)\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <stack>\n\n#include <queue>\n\n#include <list>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <string>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#define ll long long\n\n#define db long double\n\n#define inf 200001\n\n#define INF (ll)1e15\n\n#define pi acos(-1)\n\n#define mxbit 30\n\n#define rd(n)                                                                                      \\\n  {                                                                                                \\\n    n = 0;                                                                                         \\\n    char ch;                                                                                       \\\n    int f = 0;                                                                                     \\\n    do {                                                                                           \\\n      ch = getchar();                                                                              \\\n      if (ch == '-') {                                                                             \\\n        f = 1;                                                                                     \\\n      }                                                                                            \\\n    } while (ch < '0' || ch > '9');                                                                \\\n    while ('0' <= ch && ch <= '9') {                                                               \\\n      n = (n << 1) + (n << 3) + ch - 48;                                                           \\\n      ch = getchar();                                                                              \\\n    }                                                                                              \\\n    if (f)                                                                                         \\\n      n = -n;                                                                                      \\\n  }\n\nusing namespace std;\n\nchar str[inf];\n\nint nxt[inf];\n\nll sum[26][inf];\n\nint n, lens;\n\nvoid getnxt(void) {\n\n  int k = 0;\n\n  nxt[0] = 0;\n\n  for (int i = 2; i <= n; i++) {\n\n    while (k && str[k + 1] != str[i]) {\n\n      k = nxt[k];\n    }\n\n    if (str[k + 1] == str[i]) {\n\n      k++;\n    }\n\n    nxt[i] = k;\n  }\n\n  return;\n}\n\nll query(ll x, int p) {\n\n  if (x < n) {\n\n    return sum[p][x];\n  }\n\n  ll a = sum[p][lens], b = sum[p][n];\n\n  ll l1 = lens, l2 = n;\n\n  while (l1 + l2 < x) {\n\n    a += b;\n\n    swap(a, b);\n\n    l1 += l2;\n\n    swap(l1, l2);\n  }\n\n  return b + query(x - l2, p);\n}\n\nint main() {\n\n  scanf(\"%s\", str + 1);\n\n  n = strlen(str + 1) / 2;\n\n  getnxt();\n\n  lens = n - nxt[n];\n\n  for (int i = 0; i < 26; i++) {\n\n    for (int j = 1; j <= n; j++) {\n\n      sum[i][j] = sum[i][j - 1] + (str[j] - 'a' == i);\n    }\n  }\n\n  ll l, r;\n\n  rd(l) rd(r)\n\n      for (int i = 0; i < 26; i++) {\n\n    printf(\"%lld \", query(r, i) - query(l - 1, i));\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int p = 998244353;\n\ntypedef unsigned long long ull;\n\nint n, len, mx;\n\nlong long l, r, siz[110], cnt1[110], cnt2[110], ans[26], sum[110][26];\n\null fhash[200010], bhash[200010], bs[200010];\n\nchar s[200010];\n\nvoid solve(long long m, int type) {\n\n  for (int i = mx; ~i; i--) {\n\n    if (m >= siz[i]) {\n\n      for (int j = 0; j < 26; j++)\n\n        ans[j] += type ? sum[i][j] : -sum[i][j];\n\n      m -= siz[i];\n    }\n  }\n\n  for (int i = 1; i <= m; i++)\n\n    ans[s[i] - 'a'] += type ? 1 : -1;\n\n  return;\n}\n\nint main() {\n\n  scanf(\"%s%lld%lld\", s + 1, &l, &r);\n\n  n = strlen(s + 1);\n\n  bs[0] = 1;\n\n  for (int i = 1; i <= n; i++) {\n\n    fhash[i] = fhash[i - 1] * p + (s[i] - 'a' + 1);\n\n    bs[i] = bs[i - 1] * p;\n  }\n\n  for (int i = n; ~i; i--)\n\n    bhash[i] = bhash[i + 1] + (s[i] - 'a' + 1) * bs[n - i];\n\n  for (int i = n / 2 - 1; ~i; i--)\n\n    if (fhash[i] == bhash[n - i + 1]) {\n\n      len = i;\n\n      break;\n    }\n\n  for (int i = 1; i <= n / 2; i++)\n\n    sum[0][s[i] - 'a']++;\n\n  for (int i = 0; i < 26; i++)\n\n    sum[1][i] = sum[0][i];\n\n  for (int i = 1; i <= n / 2 - len; i++)\n\n    sum[1][s[i] - 'a']++;\n\n  siz[0] = n / 2;\n\n  siz[1] = n - len;\n\n  for (int i = 2; i <= 100; i++) {\n\n    for (int j = 0; j < 26; j++)\n\n      sum[i][j] = sum[i - 1][j] + sum[i - 2][j];\n\n    siz[i] = siz[i - 1] + siz[i - 2];\n\n    if (siz[i] > 1e18) {\n\n      mx = i;\n\n      break;\n    }\n  }\n\n  solve(l - 1, 0);\n\n  solve(r, 1);\n\n  for (int i = 0; i < 26; i++)\n\n    printf(\"%lld \", ans[i]);\n\n  return 0;\n}"}
{"fast_code_id":"5a9b937bd74c565d110547c57bbe53d7fb6a32747c34114ff1c31b5135b26c7f","fast_id":"aeceba5756dce480a990bc4e00590ea782376aa98cbe3110e1b535a026dda632","fast_time":0.0173698582,"language":"cpp","measured_fast_code_id":"aeceba5756dce480a990bc4e00590ea782376aa98cbe3110e1b535a026dda632","measured_slow_code_id":"f5fa69005c863a4b5ce374e0f961e2003a8c4883152ea79e68e6b0201d9c4c7b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_70967","problem_id":"p00654","slow_code_id":"b6428820bf22797c468250ff75fa44817f0f5954789ad0835799235ce9d36daa","slow_id":"f5fa69005c863a4b5ce374e0f961e2003a8c4883152ea79e68e6b0201d9c4c7b","slow_time":0.0822042341,"speedup":4.732579457672256,"stratum":"4-8","sampling_key":"181eb9e67fe42a53c03e93e313bceb613c7eefa7e266f5d2bc235c75a9966ba9","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long LL;\n\n#define M 100005\n\nLL gcd(LL a, LL b) { return a == 0 ? b : gcd(b % a, a); }\n\nLL n, a[M], b[M], c[M], t;\n\nint main() {\n\n  while (scanf(\"%lld\", &n) != EOF) {\n\n    if (!n)\n      break;\n\n    int x = 0, y = 0, m = n * (n + 1) / 2;\n\n    for (int i = 0; i < m; i++) {\n\n      scanf(\"%lld\", &t);\n\n      if (t & 1)\n        a[x++] = t;\n\n      else\n        b[y++] = t;\n    }\n\n    sort(a, a + x);\n\n    sort(b, b + y);\n\n    LL tmp[2] = {b[0], b[1]};\n\n    for (int i = 0; i < 2; i++) {\n\n      LL res = gcd(a[0], tmp[i]);\n\n      tmp[i] /= res;\n\n      a[0] /= res;\n    }\n\n    LL res = (LL)sqrt(1.0 * tmp[0] * tmp[1]);\n\n    printf(\"%lld\\n\", res);\n\n    for (int i = 0; i < y - 1; i++)\n\n      printf(\"%lld \", b[i] / res);\n\n    printf(\"%lld\\n\", b[y - 1] / res);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cmath>\n\ntypedef long long ll;\n\nconst int N = 250 + 10;\n\nll a[N];\n\nint idx;\n\nint n;\n\nvoid work() {\n\n  ll b, mx;\n\n  mx = 0;\n\n  int idx = 0;\n\n  for (int i = 0; i <= n * (n + 1) / 2 - 1; ++i) {\n\n    scanf(\"%lld\", &b);\n\n    if (!(b & 1)) {\n\n      a[idx++] = b;\n\n    } else {\n\n      mx = std::max(mx, b);\n    }\n  }\n\n  ll g = a[0];\n\n  for (int i = 1; i < idx; ++i)\n\n    g = std::__gcd(g, a[i]);\n\n  std::sort(a, a + idx);\n\n  ll z = mx / (a[idx - 1] / g) / (a[idx - 2] / g);\n\n  z = (ll)sqrt((double)z);\n\n  g /= z;\n\n  printf(\"%lld\\n\", g);\n\n  for (int i = 0; i < idx; ++i) {\n\n    if (i)\n      putchar(' ');\n\n    printf(\"%lld\", a[i] / g);\n  }\n\n  puts(\"\");\n}\n\nint main() {\n\n  while (1 == scanf(\"%d\", &n)) {\n\n    if (0 == n)\n      break;\n\n    work();\n  }\n\n  return 0;\n}"}
{"fast_code_id":"6995adb02fd5821e4dad9651eeb0831e32f2a41c108ef5960e5f0f0fa716f07a","fast_id":"d8a9fae01734bb116b818d06cd0da2394edb37012f4db12c81c53e7ae732f25c","fast_time":0.0140142371,"language":"cpp","measured_fast_code_id":"d8a9fae01734bb116b818d06cd0da2394edb37012f4db12c81c53e7ae732f25c","measured_slow_code_id":"c34eefea11ff3de8633f49bcc10681c480fbb7985b97f10611eb55ab35a710cb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71001","problem_id":"p03619","slow_code_id":"8b4804663faadb3beb2efff5927e8d6b6e83a84d4b9a4d9ab31f0cf95f70dc3f","slow_id":"c34eefea11ff3de8633f49bcc10681c480fbb7985b97f10611eb55ab35a710cb","slow_time":0.13680983,"speedup":9.762203181220617,"stratum":"8+","sampling_key":"11daf8fe8050b6e3632c1f89759c5483782436ff036e34ddd094665e6bdd5c1e","slow_code":"#include <bits/stdc++.h>\n\n#define F(i, a, b) for (int i = a; i <= (b); ++i)\n\n#define F2(i, a, b) for (int i = a; i < (b); ++i)\n\n#define dF(i, a, b) for (int i = a; i >= (b); --i)\n\n#define dF2(i, a, b) for (int i = a; i > (b); --i)\n\n#define eF(i, u) for (int i = h[u]; i; i = nxt[i])\n\n#define ll long long\n\n#define ld double\n\nusing namespace std;\n\nll Sx, Sy, Tx, Ty;\n\nll ansi, ansp = 0;\n\nint n, cnt, P[200001], Ans;\n\nll x[200001], y[200001];\n\nll X[200001], Y[200001], tmp[200001];\n\nll t[200001];\n\ninline bool cmp(int p1, int p2) { return X[p1] < X[p2]; }\n\ninline int BS(ll k) {\n\n  int l = 0, r = cnt, mid, ans;\n\n  while (l <= r) {\n\n    mid = l + r >> 1;\n\n    if (tmp[mid] > k)\n      ans = mid, l = mid + 1;\n\n    else\n      r = mid - 1;\n  }\n\n  return ans;\n}\n\nint main() {\n\n  scanf(\"%lld%lld%lld%lld\", &Sx, &Sy, &Tx, &Ty);\n\n  ansi = abs(Sx - Tx) + abs(Sy - Ty);\n  ansi *= 10;\n\n  scanf(\"%d\", &n);\n\n  F(i, 1, n) scanf(\"%lld%lld\", x + i, y + i);\n\n  if (Sx == Tx) {\n\n    if (Sy > Ty)\n      swap(Sy, Ty);\n\n    F(i, 1, n) if (x[i] == Sx && Sy < y[i] && y[i] < Ty) ansi -= 2, ansp += 10;\n\n    printf(\"%.15lf\", 10. * ansi + acos(-1) * ansp);\n    return 0;\n  }\n\n  if (Sy == Ty) {\n\n    if (Sx > Tx)\n      swap(Sx, Tx);\n\n    F(i, 1, n) if (y[i] == Sy && Sx < x[i] && x[i] < Tx) ansi -= 2, ansp += 10;\n\n    printf(\"%.15lf\", 10. * ansi + acos(-1) * ansp);\n    return 0;\n  }\n\n  if (Sx > Tx)\n    swap(Sx, Tx), swap(Sy, Ty);\n\n  if (Sy < Ty)\n\n    F(i, 1, n)\n    if (Sx <= x[i] && x[i] <= Tx && Sy <= y[i] && y[i] <= Ty) X[++cnt] = x[i],\n                                                              Y[cnt] = y[i],\n                                                              P[cnt] = cnt;\n\n  if (Sy > Ty)\n\n    F(i, 1, n)\n    if (Sx <= x[i] && x[i] <= Tx && Ty <= y[i] && y[i] <= Sy) X[++cnt] = x[i],\n                                                              Y[cnt] = y[i],\n                                                              P[cnt] = cnt;\n\n  F(i, 1, cnt) t[i] = Y[i];\n\n  sort(t + 1, t + cnt + 1);\n\n  F(i, 1, cnt) Y[i] = lower_bound(t + 1, t + cnt + 1, Y[i]) - t;\n\n  sort(P + 1, P + cnt + 1, cmp);\n\n  if (Sy < Ty) {\n\n    memset(tmp, 0x3f, sizeof tmp);\n\n    tmp[0] = 0;\n\n    F(i, 1, cnt) {\n\n      int k = lower_bound(tmp, tmp + cnt + 1, Y[P[i]]) - tmp;\n\n      tmp[k] = min(tmp[k], Y[P[i]]);\n\n      Ans = max(Ans, k);\n    }\n\n    if (Ans == min(abs(Sx - Tx), abs(Sy - Ty)) + 1)\n      printf(\"%.15lf\",\n             10. * (ansi - 2 * Ans) + acos(-1) * 5 * Ans + 5 * acos(-1));\n\n    else\n      printf(\"%.15lf\", 10. * (ansi - 2 * Ans) + acos(-1) * 5 * Ans);\n\n  }\n\n  else {\n\n    tmp[0] = 0x3f3f3f3f;\n\n    F(i, 1, cnt) {\n\n      int k = BS(Y[P[i]]);\n\n      tmp[k + 1] = max(tmp[k + 1], Y[P[i]]);\n\n      Ans = max(Ans, k + 1);\n    }\n\n    if (Ans == min(abs(Sx - Tx), abs(Sy - Ty)) + 1)\n      printf(\"%.15lf\",\n             10. * (ansi - 2 * Ans) + acos(-1) * 5 * Ans + 5 * acos(-1));\n\n    else\n      printf(\"%.15lf\", 10. * (ansi - 2 * Ans) + acos(-1) * 5 * Ans);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define MAXN 200010\n\n#define PI 3.1415926535897932384626433832795\n\nstruct node\n\n{\n\n  int x, y;\n\n  bool operator<(const node &a)\n\n  {\n\n    return x < a.x;\n  }\n\n} e[MAXN];\n\nint sx, sy, ex, ey, n;\n\nvoid Pre()\n\n{\n\n  bool f = 0;\n\n  if (sy > ey)\n    swap(sx, ex), swap(sy, ey);\n\n  if (sy == ey && sx > ex)\n    swap(sx, ex);\n\n  if (sx > ex)\n    f = 1, ex = 2 * sx - ex;\n\n  ex -= sx, ey -= sy;\n\n  int x, y, m = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d%d\", &x, &y);\n\n    if (f)\n      x = 2 * sx - x;\n\n    x -= sx, y -= sy;\n\n    if (x < 0 || x > ex || y < 0 || y > ey)\n      continue;\n\n    e[++m].x = x, e[m].y = y;\n  }\n\n  sx = 0, sy = 0;\n\n  n = m;\n}\n\nint a[MAXN], st[MAXN], r;\n\nvoid Solve()\n\n{\n\n  for (int i = 1; i <= n; i++)\n\n    a[i] = e[i].y;\n\n  st[0] = -1;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (a[i] > st[r])\n      st[++r] = a[i];\n\n    else\n\n    {\n\n      int p = upper_bound(st, st + r + 1, a[i]) - st;\n\n      st[p] = a[i];\n    }\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d%d%d%d\", &sx, &sy, &ex, &ey, &n);\n\n  Pre();\n\n  sort(e + 1, e + 1 + n);\n\n  Solve();\n\n  int t = min(ex, ey) + 1;\n\n  double ans = 100LL * (ex + ey);\n\n  if (r == t)\n    ans += (r - 1) * 5LL * PI + 10LL * PI - 20LL * r;\n\n  else\n    ans += r * 5LL * PI - 20LL * r;\n\n  printf(\"%.12lf\\n\", ans);\n}"}
{"fast_code_id":"06f1c7294119fd71ab2a6cc660635d35dd6de46582b2fbd1819508e9f58cca10","fast_id":"0c6ebafaa3c40750939000a35bf340be5a8f738d7aba756f0f6286776336c340","fast_time":0.0010840884,"language":"cpp","measured_fast_code_id":"0c6ebafaa3c40750939000a35bf340be5a8f738d7aba756f0f6286776336c340","measured_slow_code_id":"2e2bba0e68bdcb9b7eb80c4cc17f17a42e2ab1724cc5fe80fd90b5fca2d5cedc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71010","problem_id":"p03923","slow_code_id":"bd74e32bed3c833414a6390220d37538edef78066cccccf057bd8d62b2c8aed7","slow_id":"2e2bba0e68bdcb9b7eb80c4cc17f17a42e2ab1724cc5fe80fd90b5fca2d5cedc","slow_time":0.002174627,"speedup":2.005949883791765,"stratum":"2-4","sampling_key":"6328a5864c4cd04e2879cce4537d953d02846cdb7a365ede6ed59e8507c95e12","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing Int = __int128_t;\n\nInt abs128(Int val) { return val < 0 ? -val : val; }\n\nostream &operator<<(ostream &os, Int val) {\n\n  if (ostream::sentry(os)) {\n\n    __uint128_t tmp = abs128(val);\n\n    char buf[64];\n\n    char *d = end(buf);\n\n    do {\n\n      --d;\n\n      *d = char(tmp % 10 + '0');\n\n      tmp /= 10;\n\n    } while (tmp);\n\n    if (val < 0)\n      *--d = '-';\n\n    Int len = end(buf) - d;\n\n    if (os.rdbuf()->sputn(d, len) != len) {\n\n      os.setstate(ios_base::badbit);\n    }\n  }\n\n  return os;\n}\n\nistream &operator>>(istream &is, Int &val) {\n\n  string s;\n\n  is >> s;\n\n  val = 0;\n\n  for (Int i = 0; i < (Int)s.size(); i++)\n\n    if (isdigit(s[i]))\n      val = val * 10 + s[i] - '0';\n\n  if (s[0] == '-')\n    val *= -1;\n\n  return is;\n}\n\ntemplate <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\nsigned main() {\n\n  Int n, a;\n\n  cin >> n >> a;\n\n  Int ans = n;\n\n  for (Int i = 1; i < 100; i++) {\n\n    auto calc2 = [&](Int x) {\n      vector<Int> v(i, x / i);\n\n      for (Int j = 0; j < x % i; j++)\n        v[j]++;\n\n      Int s = 1;\n\n      for (Int j = 0; j < i; j++) {\n\n        if (s < (n + v[j] - 1) / v[j])\n          s *= v[j];\n\n        else\n          s = n;\n\n        if (s >= n)\n          break;\n      }\n\n      return (n + s - 1) / s;\n    };\n\n    auto calc = [&](Int x) {\n      if (x < 0)\n        return ans;\n\n      return i * a + x + calc2(x);\n    };\n\n    auto best = [&](Int x) {\n      if (x < 0)\n        return x;\n\n      Int l = 0, r = x - 2 * i + 1;\n\n      Int v = calc2(x);\n\n      while (l + 1 < r) {\n\n        Int m = (l + r) >> 1;\n\n        if (v == calc2(x - m))\n          l = m;\n\n        else\n          r = m;\n      }\n\n      return x - l;\n    };\n\n    auto next = [&](Int x) -> Int {\n      if (x < 0)\n        return x;\n\n      Int l = 0, r = 1e18;\n\n      Int v = calc2(x);\n\n      if (v == calc2(x + r))\n        return -1;\n\n      while (l + 1 < r) {\n\n        Int m = (l + r) >> 1;\n\n        if (v == calc2(x + m))\n          l = m;\n\n        else\n          r = m;\n      }\n\n      return x + r;\n    };\n\n    Int l = i * 2, r = 1e18;\n\n    while ((l + 1 < r) && (calc2(r) + 1 < calc2(l))) {\n\n      l = best(l);\n\n      r = best(r);\n\n      chmin(ans, calc(l));\n\n      chmin(ans, calc(r));\n\n      Int m = best((l + r) >> 1);\n\n      Int t = next(m);\n\n      chmin(ans, calc(m));\n\n      chmin(ans, calc(t));\n\n      if (calc2(t) + (t - m) == calc2(m))\n\n        for (Int j = m + 1; calc2(j) < calc2(j - 1); j++)\n          chmin(ans, calc(j));\n\n      if (calc2(t) + (t - m) < calc2(m))\n        l = m;\n\n      else\n        r = m;\n    }\n\n    l = best(l);\n\n    r = best(r);\n\n    chmin(ans, calc(l));\n\n    chmin(ans, calc(r));\n\n    const Int MAX = 0;\n\n    Int pl = l, pr = r;\n\n    for (Int j = 0; j < MAX; j++) {\n\n      if (l == i * 2)\n        break;\n\n      l = best(l - 1);\n\n      chmin(ans, calc(l));\n    }\n\n    for (Int j = 0; j < MAX; j++) {\n\n      if (r == i * 2)\n        break;\n\n      r = best(r - 1);\n\n      chmin(ans, calc(r));\n    }\n\n    l = pl;\n    r = pr;\n\n    for (Int j = 0; j < MAX; j++) {\n\n      l = next(l);\n\n      if (l < 0)\n        break;\n\n      chmin(ans, calc(l));\n    }\n\n    for (Int j = 0; j < MAX; j++) {\n\n      r = next(r);\n\n      if (r < 0)\n        break;\n\n      chmin(ans, calc(r));\n    }\n\n    l = i * 2;\n\n    for (Int j = 0; j < MAX; j++) {\n\n      l = next(l);\n\n      if (l < 0)\n        break;\n\n      chmin(ans, calc(l));\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing Int = __int128_t;\n\nInt abs128(Int val) { return val < 0 ? -val : val; }\n\nostream &operator<<(ostream &os, Int val) {\n\n  if (ostream::sentry(os)) {\n\n    __uint128_t tmp = abs128(val);\n\n    char buf[64];\n\n    char *d = end(buf);\n\n    do {\n\n      --d;\n\n      *d = char(tmp % 10 + '0');\n\n      tmp /= 10;\n\n    } while (tmp);\n\n    if (val < 0)\n      *--d = '-';\n\n    Int len = end(buf) - d;\n\n    if (os.rdbuf()->sputn(d, len) != len) {\n\n      os.setstate(ios_base::badbit);\n    }\n  }\n\n  return os;\n}\n\nistream &operator>>(istream &is, Int &val) {\n\n  string s;\n\n  is >> s;\n\n  val = 0;\n\n  for (Int i = 0; i < (Int)s.size(); i++)\n\n    if (isdigit(s[i]))\n      val = val * 10 + s[i] - '0';\n\n  if (s[0] == '-')\n    val *= -1;\n\n  return is;\n}\n\ntemplate <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\nsigned main() {\n\n  Int n, a;\n\n  cin >> n >> a;\n\n  Int ans = n;\n\n  for (Int i = 1; i < 100; i++) {\n\n    auto calc = [&](Int x) -> Int {\n      vector<Int> v(i, x / i);\n\n      for (Int j = 0; j < x % i; j++)\n        v[j]++;\n\n      Int s = 1;\n\n      for (Int j = 0; j < i; j++) {\n\n        if (s < (n + v[j] - 1) / v[j])\n          s *= v[j];\n\n        else\n          return 1;\n      }\n\n      return s >= n;\n    };\n\n    Int l = i * 2 - 1, r = l + ans;\n\n    while (l + 1 < r) {\n\n      Int m = (l + r) >> 1;\n\n      if (calc(m))\n        r = m;\n\n      else\n        l = m;\n    }\n\n    chmin(ans, (i - 1) * a + r);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"0ed69cf8270287f528debcdd6834c4750e8035d8e13284617718c1c589ec611b","fast_id":"e37aba1bc599665fd33fd49a9450b389d127f6227981c20f1f0065dcfd2a83e1","fast_time":0.1070779836,"language":"cpp","measured_fast_code_id":"e37aba1bc599665fd33fd49a9450b389d127f6227981c20f1f0065dcfd2a83e1","measured_slow_code_id":"57f83fcbf077cd1bc20cc9d7166d72ce944b3678a31d33c371cc6fed2d1aadf2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71019","problem_id":"p03381","slow_code_id":"14c387e8718a4df5f5c943a6cf2e14725d699c85c220d68913eec7661552d04a","slow_id":"57f83fcbf077cd1bc20cc9d7166d72ce944b3678a31d33c371cc6fed2d1aadf2","slow_time":0.63535527,"speedup":5.933575219098541,"stratum":"4-8","sampling_key":"852c520390dca95386bf241dba704bb94fa8ed49035e5292c81aff99973a9be7","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\nconst int N = 2e5 + 10;\n\nint n;\n\nstruct TMP {\n\n  int x, indx, ans;\n\n  TMP() { x = indx = ans = 0; }\n\n} ar[N];\n\nint32_t main() {\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n\n    cin >> ar[i].x, ar[i].indx = i;\n\n  sort(ar, ar + n, [&](TMP a, TMP b) { return a.x < b.x; });\n\n  for (int i = 0; i < n; i++)\n\n    if (i < n / 2)\n\n      ar[i].ans = ar[n / 2].x;\n\n    else\n\n      ar[i].ans = ar[n / 2 - 1].x;\n\n  sort(ar, ar + n, [&](TMP a, TMP b) { return a.indx < b.indx; });\n\n  for (int i = 0; i < n; i++)\n\n    cout << ar[i].ans << '\\n';\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 100;\n\nint n, a[N], b[N];\n\nint main() {\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n\n    b[i] = a[i];\n  }\n\n  sort(b, b + n);\n\n  for (int i = 0; i < n; i++)\n\n    if (a[i] >= b[(n >> 1)])\n\n      cout << b[(n >> 1) - 1] << '\\n';\n\n    else\n\n      cout << b[n >> 1] << '\\n';\n\n  return 0;\n}"}
{"fast_code_id":"b08b6d295b587a3d8496b0ed233c33010da022d7746638a9d989c56580fc5b9a","fast_id":"573484bff0dd8373fe0e84c38d4a2381943ffc33c934a4d1b976ddd87d52d9be","fast_time":0.1067971888,"language":"cpp","measured_fast_code_id":"573484bff0dd8373fe0e84c38d4a2381943ffc33c934a4d1b976ddd87d52d9be","measured_slow_code_id":"27810c7694ea21f81bfecda3e042a18282c0ccbd60bde41cfda19a4b212d44e2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71033","problem_id":"p03232","slow_code_id":"000f2962d4aa70ee7afe294df8958837dde37505f71f13a949b6a95d08f43ccc","slow_id":"27810c7694ea21f81bfecda3e042a18282c0ccbd60bde41cfda19a4b212d44e2","slow_time":0.2497528162,"speedup":2.3385710710767325,"stratum":"2-4","sampling_key":"02fa4c1d10f1f6b01a9c5480cc4a3fa1201ba0aad5b3fbd41603ae04e1054923","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define int long long\n\n#define double long double\n\n#define all(a) a.begin(), a.end()\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nusing namespace std;\n\nconst int mod = 1000000007;\n\nstruct mint {\n\n  int x;\n\n  mint(int x = 0) : x(x % mod) {}\n\n  friend istream &operator>>(istream &s, mint &m) { return s >> m.x; }\n\n  friend ostream &operator<<(ostream &s, mint m) { return s << m.x; }\n\n  inline mint &operator+=(mint a) {\n    if ((x += a.x) >= mod)\n      x -= mod;\n    return *this;\n  }\n\n  inline mint &operator-=(mint a) {\n    if ((x += mod - a.x) >= mod)\n      x -= mod;\n    return *this;\n  }\n\n  inline mint &operator*=(mint a) {\n    (x *= a.x) %= mod;\n    return *this;\n  }\n\n  inline mint &operator/=(mint a) { return (*this) *= a.inv(); }\n\n  inline mint operator+(mint a) {\n    mint res(*this);\n    return res += a;\n  }\n\n  inline mint operator-(mint a) {\n    mint res(*this);\n    return res -= a;\n  }\n\n  inline mint operator*(mint a) {\n    mint res(*this);\n    return res *= a;\n  }\n\n  inline mint operator/(mint a) {\n    mint res(*this);\n    return res /= a;\n  }\n\n  inline bool operator==(mint a) { return x == a.x; }\n\n  inline bool operator!=(mint a) { return x != a.x; }\n\n  inline bool operator<(mint a) { return x < a.x; }\n\n  inline bool operator>(mint a) { return x > a.x; }\n\n  inline bool operator<=(mint a) { return x <= a.x; }\n\n  inline bool operator>=(mint a) { return x >= a.x; }\n\n  inline void takemod() { x = ((x % mod) + mod) % mod; }\n\n  mint inv() { return pow(mod - 2); }\n\n  mint pow(int p) {\n\n    mint res(1), tmp(x);\n\n    for (; p; p >>= 1) {\n      if (p & 1)\n        res *= tmp;\n      tmp *= tmp;\n    }\n\n    return res;\n  }\n};\n\nstruct mfact {\n\n  vector<mint> fact;\n\n  mfact(int size = 200010) {\n\n    fact = vector<mint>(size + 1);\n    fact[0] = 1;\n\n    rep(i, size) fact[i + 1] = fact[i] * (i + 1);\n  }\n\n  inline mint operator[](int i) { return fact[i]; }\n\n  inline mint nPr(int n, int r) { return fact[n] / fact[r]; }\n\n  inline mint nCr(int n, int r) { return fact[n] / (fact[n - r] * fact[r]); }\n};\n\nsigned main(void) {\n\n  int N;\n  cin >> N;\n\n  vector<int> a(N);\n\n  rep(i, N) cin >> a[i];\n\n  vector<mint> vec(N + 1);\n\n  rep(i, N) { vec[i + 1] = vec[i] + mint(i + 1).inv(); }\n\n  mint fact = mfact(100010).fact[N];\n\n  mint ans(0);\n\n  rep(i, N) {\n\n    mint tmp = (vec[i + 1] + vec[N - i] - mint(1));\n\n    ans += tmp * mint(a[i]) * fact;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <vector>\n\n#include <numeric>\n\n#include <tuple>\n\n#include <type_traits>\n\ntemplate <class T, class U>\n\ninline bool chmin(T &lhs, const U &rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return true;\n  }\n\n  return false;\n}\n\ntemplate <class T, class U>\n\ninline bool chmax(T &lhs, const U &rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return true;\n  }\n\n  return false;\n}\n\nstruct range {\n\n  struct itr {\n\n    int i;\n\n    constexpr itr(int i_) : i(i_) {}\n\n    constexpr void operator++() { ++i; }\n\n    constexpr int operator*() const { return i; }\n\n    constexpr bool operator!=(itr x) const { return i != x.i; }\n  };\n\n  const itr l, r;\n\n  constexpr range(int l_, int r_) : l(l_), r(std::max<int>(l_, r_)) {}\n\n  constexpr itr begin() const { return l; }\n\n  constexpr itr end() const { return r; }\n};\n\nstruct revrange {\n\n  struct itr {\n\n    int i;\n\n    constexpr itr(int i_) : i(i_) {}\n\n    constexpr void operator++() { --i; }\n\n    constexpr int operator*() const { return i; }\n\n    constexpr bool operator!=(itr x) const { return i != x.i; }\n  };\n\n  const itr r, l;\n\n  constexpr revrange(int l_, int r_)\n      : l(l_ - 1), r(std::max<int>(l_, r_) - 1) {}\n\n  constexpr itr begin() const { return r; }\n\n  constexpr itr end() const { return l; }\n};\n\ntemplate <class T>\n\ninline T scan() {\n\n  T res;\n\n  std::cin >> res;\n\n  return res;\n}\n\ntemplate <class T>\n\nclass modulo_int {\n\npublic:\n  static constexpr int mod = T::value;\n\n  static_assert(mod > 0, \"mod must be positive\");\n\nprivate:\n  long long value;\n\n  constexpr void normalize() {\n\n    value %= mod;\n\n    if (value < 0)\n      value += mod;\n  }\n\npublic:\n  constexpr modulo_int(long long value_ = 0) : value(value_) { normalize(); }\n\n  constexpr modulo_int operator-() const { return modulo_int(mod - value); }\n\n  constexpr modulo_int operator~() const { return power(mod - 2); }\n\n  constexpr long long operator()() const { return value; }\n\n  constexpr modulo_int operator+(const modulo_int &rhs) const {\n    return modulo_int(*this) += rhs;\n  }\n\n  constexpr modulo_int &operator+=(const modulo_int &rhs) {\n\n    if ((value += rhs.value) >= mod)\n      value -= mod;\n\n    return (*this);\n  }\n\n  constexpr modulo_int operator-(const modulo_int &rhs) const {\n    return modulo_int(*this) -= rhs;\n  }\n\n  constexpr modulo_int &operator-=(const modulo_int &rhs) {\n\n    if ((value += mod - rhs.value) >= mod)\n      value -= mod;\n\n    return (*this);\n  }\n\n  constexpr modulo_int operator*(const modulo_int &rhs) const {\n    return modulo_int(*this) *= rhs;\n  }\n\n  constexpr modulo_int &operator*=(const modulo_int &rhs) {\n\n    (value *= rhs.value) %= mod;\n\n    return (*this);\n  }\n\n  constexpr modulo_int operator/(const modulo_int &rhs) const {\n    return modulo_int(*this) /= rhs;\n  }\n\n  constexpr modulo_int &operator/=(const modulo_int &rhs) {\n\n    return (*this) *= ~rhs;\n  }\n\n  constexpr modulo_int power(unsigned long long pow) const {\n\n    modulo_int result(1), mult(*this);\n\n    while (pow > 0) {\n\n      if (pow & 1)\n        result *= mult;\n\n      mult *= mult;\n\n      pow >>= 1;\n    }\n\n    return result;\n  }\n\n  friend std::istream &operator>>(std::istream &stream, modulo_int &lhs) {\n\n    stream >> lhs.value;\n\n    lhs.normalize();\n\n    return stream;\n  }\n\n  friend std::ostream &operator<<(std::ostream &stream, const modulo_int &rhs) {\n\n    return stream << rhs.value;\n  }\n};\n\nusing modint = modulo_int<std::integral_constant<int, 1000000007>>;\n\nint main() {\n\n  const int N = scan<int>();\n\n  std::vector<int> A(N);\n\n  for (auto &x : A) {\n\n    std::cin >> x;\n  }\n\n  std::vector<modint> sum(N + 1);\n\n  for (int i : range(1, N + 1)) {\n\n    sum[i] += sum[i - 1] + ~modint(i);\n  }\n\n  modint ans;\n\n  for (int i : range(0, N)) {\n\n    ans += (sum[i + 1] + sum[N - i] - modint(1)) * modint(A[i]);\n  }\n\n  for (int i : range(1, N + 1)) {\n\n    ans *= modint(i);\n  }\n\n  std::cout << ans << '\\n';\n\n  return 0;\n}\n"}
{"fast_code_id":"ad88dcf97d4e3ca01c470a91a28bd96c0c2a5468cbe48fc2030d31b1b955f2a9","fast_id":"f3646a35a89f49c5ba7b71db13cf23795c06824f206733888f121d7248d762e8","fast_time":0.0070841865,"language":"cpp","measured_fast_code_id":"f3646a35a89f49c5ba7b71db13cf23795c06824f206733888f121d7248d762e8","measured_slow_code_id":"0dc2ae1957234d9cda7d343345b9662097680f93b55ff5dc7ff629bea7d3f2c8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71035","problem_id":"p02840","slow_code_id":"b5a67b3bc7d9c7f0f708ce790a40e3a98b348d74b03cd11ab599dad0d0618513","slow_id":"0dc2ae1957234d9cda7d343345b9662097680f93b55ff5dc7ff629bea7d3f2c8","slow_time":0.0373797799,"speedup":5.276509857553863,"stratum":"4-8","sampling_key":"117359a3a0087e428ec741c2d4fd8f54e84c37aca09cbb38630e3f6cb89e9383","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nll maeA[200001], maeB[200001];\n\nint main() {\n\n  ll N, X, D;\n\n  cin >> N >> X >> D;\n\n  if (D == 0) {\n\n    if (X == 0)\n      printf(\"1\");\n\n    else\n      printf(\"%lld\", N + 1);\n\n    return 0;\n  }\n\n  if (D < 0) {\n\n    D *= -1;\n\n    X *= -1;\n  }\n\n  ll R = (X ? D / __gcd(abs(X), D) : 1);\n\n  ll Z = (X ? X / __gcd(abs(X), D) : 0);\n\n  int r = 0;\n\n  ll zure = 0;\n\n  ll a = 0;\n\n  ll b = 0;\n\n  ll kotae = 0;\n\n  rep(i, min(N + 1, R)) {\n\n    maeA[i] = a + zure;\n\n    maeB[i] = b + zure;\n\n    kotae += maeB[i] - maeA[i] + 1;\n\n    a += i;\n\n    b += N - i - 1;\n\n    r++;\n  }\n\n  r = 0;\n\n  zure += Z;\n\n  for (int i = min(N + 1, R); i <= N; i++) {\n\n    ll A = a + zure;\n\n    ll B = b + zure;\n\n    if (maeA[r] >= A && maeB[r] <= B) {\n\n      kotae += B + maeA[r] - A - maeB[r];\n\n    }\n\n    else if (maeA[r] <= A && maeB[r] >= B) {\n\n      break;\n\n    }\n\n    else if (maeA[r] <= A) {\n\n      kotae += B - max(maeB[r] + 1, A) + 1;\n\n    }\n\n    else {\n\n      kotae += min(maeA[r] - 1, B) - A + 1;\n    }\n\n    maeA[r] = A;\n\n    maeB[r] = B;\n\n    a += i;\n\n    b += N - i - 1;\n\n    r++;\n\n    if (r >= R) {\n\n      r = 0;\n\n      zure += Z;\n    }\n  }\n\n  printf(\"%lld\", kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nll maeA[100001], maeB[100001];\n\nint main() {\n\n  ll N, X, D;\n\n  scanf(\"%lld %lld %lld\", &N, &X, &D);\n\n  if (D == 0) {\n\n    if (X == 0)\n      printf(\"1\");\n\n    else\n      printf(\"%lld\", N + 1);\n\n    return 0;\n  }\n\n  if (D < 0) {\n\n    D *= -1;\n\n    X *= -1;\n  }\n\n  ll R = (X ? D / __gcd(abs(X), D) : 1);\n\n  ll Z = (X ? X / __gcd(abs(X), D) : 0);\n\n  ll kininaru = max(0ll, min(N + 1 - R, R));\n\n  int r = 0;\n\n  ll a = 0;\n\n  ll b = 0;\n\n  ll kotae = 0;\n\n  rep(i, kininaru) {\n\n    maeA[i] = a;\n\n    maeB[i] = b;\n\n    kotae += b - a + 1;\n\n    a += i;\n\n    b += N - i - 1;\n  }\n\n  for (int i = kininaru; i < min(N + 1, R); i++) {\n\n    kotae += b - a + 1;\n\n    a += i;\n\n    b += N - i - 1;\n  }\n\n  ll zure = Z;\n\n  for (int i = min(N + 1, R); i <= N; i++) {\n\n    ll A = a + zure;\n\n    ll B = b + zure;\n\n    if (maeA[r] >= A && maeB[r] <= B) {\n\n      kotae += B + maeA[r] - A - maeB[r];\n\n    }\n\n    else if (maeA[r] <= A && maeB[r] >= B) {\n\n      break;\n\n    }\n\n    else if (maeA[r] <= A) {\n\n      kotae += B - max(maeB[r] + 1, A) + 1;\n\n    }\n\n    else {\n\n      kotae += min(maeA[r] - 1, B) - A + 1;\n    }\n\n    maeA[r] = A;\n\n    maeB[r] = B;\n\n    a += i;\n\n    b += N - i - 1;\n\n    if (++r >= R) {\n\n      r = 0;\n\n      zure += Z;\n    }\n  }\n\n  printf(\"%lld\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"53142ba720a4cf64ff2d290b359fba48d011dfb8e8bf57a221d462222e68ef35","fast_id":"f10e9c359190475f9760acad6c8f06525b9d6b8d03fca59a16d57a7899a66a47","fast_time":0.2503938649,"language":"cpp","measured_fast_code_id":"f10e9c359190475f9760acad6c8f06525b9d6b8d03fca59a16d57a7899a66a47","measured_slow_code_id":"fa2a693df90da6d1a7dc78fbb9d4ef2564991bf978f6516ac7c7f84d1154cbdb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71043","problem_id":"p03253","slow_code_id":"3f0a64980e10d1a36195df587ed2eb6122dbb27a1302a76c3212c04a3d7c4c30","slow_id":"fa2a693df90da6d1a7dc78fbb9d4ef2564991bf978f6516ac7c7f84d1154cbdb","slow_time":0.5069702512,"speedup":2.024691185634557,"stratum":"2-4","sampling_key":"053466bd6697df1d90bf37c49003f47a7da7b74cebd266bf2f4719ff14086de4","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\nconst ll N = 20, P = 1e9 + 7;\n\nll n, m, ans = 1, a[1 << N] = {1};\n\ninline ll read()\n\n{\n\n  ll sum = 0, flag = 1;\n\n  char c;\n\n  for (; c < '0' || c > '9'; c = getchar())\n    if (c == '-')\n      flag = -1;\n\n  for (; c >= '0' && c <= '9'; c = getchar())\n    sum = (sum << 1) + (sum << 3) + c - '0';\n\n  return sum * flag;\n}\n\ninline ll pow(ll x, ll y)\n\n{\n\n  ll k = 1;\n\n  while (y)\n\n  {\n\n    if (y & 1)\n\n    {\n\n      k *= x;\n\n      k %= P;\n    }\n\n    y >>= 1;\n\n    x *= x;\n\n    x %= P;\n  }\n\n  return k;\n}\n\nint main()\n\n{\n\n  n = read();\n\n  m = read();\n\n  for (int i = 1; i <= 1 << (N - 1); ++i)\n\n  {\n\n    a[i] = a[i - 1] * i % P;\n  }\n\n  for (ll i = 2; i * i <= m; ++i)\n\n  {\n\n    if (!(m % i))\n\n    {\n\n      ll k = 0;\n\n      while (!(m % i))\n\n      {\n\n        ++k;\n\n        m /= i;\n      }\n\n      ans *= a[n + k - 1] % P * pow(a[n - 1], P - 2) % P * pow(a[k], P - 2) % P;\n\n      ans %= P;\n    }\n  }\n\n  if (m > 1)\n\n  {\n\n    ans *= n;\n\n    ans %= P;\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define LL long long\n\n#define maxn 201900\n\n#define mod 1000000007\n\nusing namespace std;\n\nLL fun[maxn], ans = 1;\n\nLL power(LL a, int k)\n\n{\n\n  LL ans = 1, y = a;\n\n  while (k)\n\n  {\n\n    if (k % 2)\n\n      ans = ans * y % mod;\n\n    y = y * y % mod, k = k / 2;\n  }\n\n  return ans;\n}\n\nint main()\n\n{\n\n  long long n, m;\n\n  scanf(\"%lld%lld\", &n, &m);\n\n  fun[0] = 1;\n\n  for (int i = 1; i < maxn; i++)\n\n    fun[i] = fun[i - 1] * i % mod;\n\n  for (int i = 2; i * i <= m; i++)\n\n  {\n\n    if (m % i == 0)\n\n    {\n\n      long long s = 0;\n\n      while (m % i == 0)\n\n      {\n\n        m = m / i;\n\n        s++;\n      }\n\n      ans = ans * fun[n + s - 1] % mod * power(fun[n - 1], mod - 2) % mod * power(fun[s], mod - 2) %\n            mod;\n    }\n  }\n\n  if (m > 1)\n\n    ans = ans * n % mod;\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"decac1a09ffea3e885fee291f4aaa295761b78363a4a7821a930631f1b008553","fast_id":"25ff35dcfad38b869b6c9fe5e226c8835dc685be6b9062183dffb561c973c462","fast_time":0.0378577525,"language":"cpp","measured_fast_code_id":"25ff35dcfad38b869b6c9fe5e226c8835dc685be6b9062183dffb561c973c462","measured_slow_code_id":"12c3d1155cc08fdf6123e8f08b7905f6214cd07719646c94e7fbe19cbb5d61b9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71081","problem_id":"p02671","slow_code_id":"cb84a03322877c2f944a2e772aba9e2cbbdc5b8e52c4944b4095b079a3f3f3aa","slow_id":"12c3d1155cc08fdf6123e8f08b7905f6214cd07719646c94e7fbe19cbb5d61b9","slow_time":0.1063689776,"speedup":2.809701331319127,"stratum":"2-4","sampling_key":"499e587d2984b28f7cfa1c746dd6d03d2ce94273ab9330d0341ba5f42d530a3e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\n\nint N, ans[531441];\n\nstatic inline void OUT(int x) {\n  if (x >= 10)\n    OUT(x / 10);\n  putchar(x % 10 + 48);\n}\n\nstatic inline int Pow(int a, int b) { return b ? Pow(a * a, b >> 1) * (b & 1 ? a : 1) : 1; }\n\nstring reduce(string T)\n\n{\n\n  string res = \"\";\n\n  for (auto ch : T) {\n    if (res.size() && res.back() == 'S' && ch == 'S')\n      res.pop_back();\n    else\n      res += ch;\n  }\n\n  return res;\n}\n\nvoid solve(int m, string T, int i, int p)\n\n{\n\n  if (m == N) {\n    ans[i] = p;\n    return;\n  }\n\n  rep(d, 3)\n\n  {\n\n    string nextT = \"\";\n    int x = d;\n\n    for (auto ch : T) {\n      if (ch == 'S') {\n        x = (3 - x) % 3;\n        nextT += 'S';\n      } else {\n        x = (x + 1) % 3;\n        if (x == 0)\n          nextT += 'R';\n      }\n    }\n\n    solve(m + 1, reduce(nextT), i + d * Pow(3, m), p + x * Pow(3, m));\n  }\n}\n\nint main() {\n  string T;\n  cin >> N >> T;\n  solve(0, reduce(T), 0, 0);\n  rep(i, Pow(3, N)) { OUT(ans[i]), putchar(' '); }\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\n\nconst int pw[13] = {1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049, 177147, 531441};\n\nstatic inline void OUT(int x) {\n  if (x < 0)\n    putchar('-'), x = -x;\n  if (x >= 10)\n    OUT(x / 10);\n  putchar(x % 10 + 48);\n}\n\nint main(void)\n\n{\n\n  int N, len = 0, carry[200000], temp[531441], A[531441], add[531441];\n  char T[200001];\n\n  if (scanf(\"%d %s\", &N, T) != 0)\n    len = strlen(T);\n\n  rep(i, N)\n\n  {\n\n    int flip = 0;\n\n    memset(add, 0, pw[i] * sizeof(int));\n\n    rep(j, len)\n\n    {\n\n      if (T[j] == 'S') {\n        flip ^= 1;\n      }\n\n      else\n\n      {\n\n        int x = carry[j];\n\n        add[x] = (add[x] + (flip ? 2 : 1)) % 3;\n\n        carry[j] += (3 - add[x]) % 3 * pw[i];\n      }\n    }\n\n    memcpy(temp, A, pw[i] * sizeof(int));\n\n    rep(c, 3) {\n      rep(j, pw[i]) A[c * pw[i] + j] = temp[j] + (flip ? 2 : 1) * (c + add[j]) % 3 * pw[i];\n    }\n  }\n\n  rep(i, pw[N]) OUT(A[i]), putchar(' ');\n}"}
{"fast_code_id":"4bed06a914868b45b1575afb031f4b9c70f9783a2432f3ebbf49f8b013b60d27","fast_id":"46bea6a3a02e47425e5755ee78d5ef63bd607f6b868fe30e7a5e0eb5a9f98afb","fast_time":0.0006722719,"language":"cpp","measured_fast_code_id":"46bea6a3a02e47425e5755ee78d5ef63bd607f6b868fe30e7a5e0eb5a9f98afb","measured_slow_code_id":"e07d5677de136267135365b3e0dc510a4a6f585c6545c0615e5e7fe4dd7d7f99","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_7116","problem_id":"p03394","slow_code_id":"eac9c2966b3e5dc594463257d2015d01d0cba0a8b5cd42a5ae41beeee6143cae","slow_id":"e07d5677de136267135365b3e0dc510a4a6f585c6545c0615e5e7fe4dd7d7f99","slow_time":0.0030416663,"speedup":4.524458481754183,"stratum":"4-8","sampling_key":"2bb40bbbd999a0f793430713d1e91cc88ff423d7145f162981a9ac315568da6f","slow_code":"#include <bits/stdc++.h>\n\n\n\n#define fr first\n\n#define sc second\n\n#define mk make_pair\n\n#define pb push_back\n\n#define sz(s) (int)s.size()\n\n#define all(s) s.begin(), s.end()\n\n#define int long long\n\n\n\nusing namespace std;\n\n\n\nconst int N = 30005;\n\n\n\nint n, u[N], sum = 0, m;\n\n\n\nvector <int> ans;\n\n\n\nmain()\n\n{\n\n  cin >> n;\n\n  m = n;\n\n  if (n == 3)\n\n  {\n\n    puts(\"2 5 63\");\n\n    return 0;\n\n  }\n\n  ans.push_back(2);\n\n  sum = 2;\n\n  u[2] = 1;\n\n  n--;\n\n  for (int i = 30000; ; i -= 2)\n\n  {\n\n    if (n == 2)\n\n    {\n\n      sum -= ans.back();\n\n      i = ans.back();\n\n      u[i] = 0;\n\n      ans.pop_back();\n\n      while (u[i] || (sum + i) % 30 != 0)\n\n        i -= 2;\n\n\n\n      sum += i;\n\n      u[i] = 1;\n\n      ans.push_back(i);\n\n      break;\n\n    }\n\n    sum += i;\n\n    ans.pb(i);\n\n    u[i] = 1;\n\n    n--;\n\n\n\n    if (i < 100 && n % 10 == 0)\n\n    {\n\n      sum -= ans.back();\n\n      i = ans.back();\n\n      u[i] = 0;\n\n      ans.pop_back();\n\n      while (u[i] || (sum + i) % 30 != 0)\n\n        i -= 2;\n\n      sum += i;\n\n      u[i] = 1;\n\n      ans.push_back(i);\n\n      break;\n\n    }\n\n  }\n\n         \n\n  sum = 0;\n\n  for (int i = 30000; ; i -= 3)\n\n  {\n\n    if (u[i] || i % 2 == 0) continue;\n\n\n\n    if (n == 0)\n\n    {\n\n      sum -= ans.back();\n\n      i = ans.back();\n\n      u[i] = 0;\n\n      ans.pop_back();\n\n      while (u[i] || (sum + i) % 30 != 0)\n\n        i -= 3;\n\n\n\n      sum += i;\n\n      u[i] = 1;\n\n      ans.push_back(i);\n\n      break;\n\n    }\n\n    sum += i;\n\n    ans.pb(i);\n\n    u[i] = 1;\n\n    n--;\n\n\n\n    if (i < 500 && n % 6 == 0)\n\n    {\n\n      sum -= ans.back();\n\n      i = ans.back();\n\n      u[i] = 0;\n\n      ans.pop_back();\n\n      while (u[i] || (sum + i) % 30 != 0)\n\n        i -= 3;\n\n\n\n      sum += i;\n\n      u[i] = 1;\n\n      ans.push_back(i);\n\n      break;\n\n    }\n\n  }\n\n         \n\n  sum = 0;\n\n  for (int i = 30000; ; i -= 5)\n\n  {\n\n    if (u[i]) continue;\n\n\n\n    if (n == 0)\n\n    {\n\n      sum -= ans.back();\n\n      i = ans.back();\n\n      u[i] = 0;\n\n      ans.pop_back();\n\n      while (u[i] || (sum + i) % 30 != 0)\n\n        i -= 5;\n\n\n\n      sum += i;\n\n      u[i] = 1;\n\n      ans.push_back(i);\n\n      break;\n\n    }\n\n    sum += i;\n\n    ans.pb(i);\n\n    u[i] = 1;\n\n    n--;\n\n  }\n\n  int gcd = 0;\n\n  sum = 0;\n\n  assert(ans.size() == m);\n\n\n\n  for (auto to : ans) sum += to, gcd = __gcd(to, gcd);\n\n\n\n  assert( gcd == 1 );\n\n  for (auto to : ans)\n\n  {\n\n    assert( __gcd( to, sum - to ) != 1 );\n\n  }\n\n\n\n  for (auto to : ans)\n\n    cout << to << \" \";\n\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define MN 30000\n\nusing namespace std;\n\ninline int in() {\n\n  int x = 0;\n  bool f = 0;\n  char c;\n\n  for (; (c = getchar()) < '0' || c > '9'; f = c == '-')\n    ;\n\n  for (x = c - '0'; (c = getchar()) >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0')\n    ;\n\n  return f ? -x : x;\n}\n\nint odd[MN + 5], evn[3][MN + 5], n, tot, cnt;\n\nint main()\n\n{\n\n  n = in();\n\n  if (n == 3) {\n    printf(\"2 5 63\");\n    return 0;\n  }\n\n  for (int i = 1; i <= MN; ++i) {\n\n    if (i & 1) {\n\n      if (!(i % 3))\n        odd[++cnt] = i;\n\n    } else {\n\n      evn[i % 3][++evn[i % 3][0]] = i;\n    }\n  }\n  tot = n;\n\n  if (n & 1) {\n\n    for (int i = 2; i <= 5000 && tot > 3; i += 2) {\n\n      tot -= 2;\n      printf(\"%d %d \", odd[i - 1], odd[i]);\n    }\n\n    for (int i = 1; i <= 5000 && tot >= 2; ++i) {\n\n      tot -= 2;\n      printf(\"%d %d \", evn[1][i], evn[2][i]);\n    }\n\n    for (int i = 1; i <= 5000 && tot; ++i) {\n\n      --tot;\n      printf(\"%d \", evn[0][i]);\n    }\n\n  } else {\n\n    for (int i = 2; i <= 5000 && tot > 2; i += 2) {\n\n      tot -= 2;\n      printf(\"%d %d \", odd[i - 1], odd[i]);\n    }\n\n    for (int i = 1; i <= 5000 && tot >= 2; ++i) {\n\n      tot -= 2;\n      printf(\"%d %d \", evn[1][i], evn[2][i]);\n    }\n\n    for (int i = 1; i <= 5000 && tot; ++i) {\n\n      --tot;\n      printf(\"%d \", evn[0][i]);\n    }\n  }\n  return 0;\n}"}
{"fast_code_id":"57970f8e5efb483021fbf4f060e9456479801af5fe9630da9a3eda3109550e26","fast_id":"7add5d51de0f325c711887b0c4d364de7caaf162fa7f440f1e259368bdd922ef","fast_time":0.1143510462,"language":"cpp","measured_fast_code_id":"7add5d51de0f325c711887b0c4d364de7caaf162fa7f440f1e259368bdd922ef","measured_slow_code_id":"6e1025bb59cd7718279b7c02acf322597c2379bac2971a48ce941784831a43ee","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_7123","problem_id":"p03616","slow_code_id":"7d573997b1fc1926200a0889fe416d036efa3ef515cd3de9c30d136da8880973","slow_id":"6e1025bb59cd7718279b7c02acf322597c2379bac2971a48ce941784831a43ee","slow_time":0.2890002701,"speedup":2.5273076172345506,"stratum":"2-4","sampling_key":"8c414ada407533647795201611b34cc1fc04571ab0c9ef7ab3f190d08fb15ee1","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <string>\n\n#include <cmath>\n\n#include <bitset>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\n#include <deque>\n\n#include <algorithm>\n\n#include <complex>\n\n#include <unordered_map>\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<ll, ll> P;\n\nint main()\n\n{\n\n  ll x;\n  int k;\n\n  cin >> x >> k;\n\n  ll r[100001], ra[100001];\n\n  r[0] = 0;\n  ra[0] = 0;\n\n  for (int i = 1; i <= k; i++) {\n\n    cin >> r[i];\n\n    if (i % 2)\n      ra[i] = ra[i - 1] + r[i] - r[i - 1];\n\n    else\n      ra[i] = ra[i - 1] - r[i] + r[i - 1];\n  }\n\n  int q;\n\n  cin >> q;\n\n  ll a[100000], ans[100000];\n\n  P ti[100000];\n\n  for (int i = 0; i < q; i++) {\n\n    ll t;\n\n    cin >> t >> a[i];\n\n    ti[i] = P(t, i);\n  }\n\n  sort(ti, ti + q);\n\n  ll x1 = 0, x2 = x;\n\n  int e = -1;\n\n  ll ans0 = 0;\n\n  int j = 0;\n\n  for (int i = 0; i <= k; i++) {\n\n    while (j < q && (i == k || ti[j].first < r[i + 1])) {\n\n      int i1 = ti[j].second;\n\n      ll t1 = ti[j].first - r[i];\n\n      if (e >= 0) {\n\n        if (i % 2)\n          ans[i1] = min(x, ans0 + t1);\n\n        else\n          ans[i1] = max(0ll, ans0 - t1);\n\n      } else if (x1 > a[i1]) {\n\n        if (i % 2)\n          ans[i1] = min(x, x1 - ra[i] + t1);\n\n        else\n          ans[i1] = max(0ll, x1 - ra[i] - t1);\n\n      } else if (x2 < a[i1]) {\n\n        if (i % 2)\n          ans[i1] = min(x, x2 - ra[i] + t1);\n\n        else\n          ans[i1] = max(0ll, x2 - ra[i] - t1);\n\n      } else {\n\n        if (i % 2)\n          ans[i1] = min(x, a[i1] - ra[i] + t1);\n\n        else\n          ans[i1] = max(0ll, a[i1] - ra[i] - t1);\n      }\n\n      j++;\n    }\n\n    if (i == k)\n      break;\n\n    if (e >= 0) {\n\n      if (i % 2)\n        ans0 = min(x, ans0 + r[i + 1] - r[i]);\n\n      else\n        ans0 = max(0ll, ans0 - r[i + 1] + r[i]);\n\n    } else if (i % 2) {\n\n      if (x + ra[i + 1] < x2) {\n\n        x2 = x + ra[i + 1];\n      }\n\n      if (x1 >= x2) {\n\n        e = i + 1;\n        ans0 = x;\n      }\n\n    } else {\n\n      if (ra[i + 1] > x1) {\n\n        x1 = ra[i + 1];\n      }\n\n      if (x1 >= x2) {\n\n        e = i + 1;\n        ans0 = 0;\n      }\n    }\n  }\n\n  for (int i = 0; i < q; i++)\n    cout << ans[i] << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <string>\n\n#include <cmath>\n\n#include <bitset>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <queue>\n\n#include <deque>\n\n#include <algorithm>\n\n#include <complex>\n\n#include <unordered_map>\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<ll, ll> P;\n\nint main()\n\n{\n\n  ll x;\n  int k;\n\n  cin >> x >> k;\n\n  ll r[100001], ra[100001];\n\n  r[0] = 0;\n  ra[0] = 0;\n\n  for (int i = 1; i <= k; i++) {\n\n    cin >> r[i];\n\n    if (i % 2)\n      ra[i] = ra[i - 1] + r[i] - r[i - 1];\n\n    else\n      ra[i] = ra[i - 1] - r[i] + r[i - 1];\n  }\n\n  int q;\n\n  cin >> q;\n\n  ll a[100000];\n\n  ll t[100000];\n\n  for (int i = 0; i < q; i++) {\n\n    cin >> t[i] >> a[i];\n  }\n\n  ll x1 = 0, x2 = x;\n\n  ll ans0 = -1;\n\n  int j = 0;\n\n  for (int i = 0; i <= k; i++) {\n\n    while (j < q && (i == k || t[j] < r[i + 1])) {\n\n      ll t1 = t[j] - r[i], ans;\n\n      if (ans0 >= 0) {\n\n        if (i % 2)\n          ans = min(x, ans0 + t1);\n\n        else\n          ans = max(0ll, ans0 - t1);\n\n      } else if (x1 > a[j]) {\n\n        if (i % 2)\n          ans = min(x, x1 - ra[i] + t1);\n\n        else\n          ans = max(0ll, x1 - ra[i] - t1);\n\n      } else if (x2 < a[j]) {\n\n        if (i % 2)\n          ans = min(x, x2 - ra[i] + t1);\n\n        else\n          ans = max(0ll, x2 - ra[i] - t1);\n\n      } else {\n\n        if (i % 2)\n          ans = min(x, a[j] - ra[i] + t1);\n\n        else\n          ans = max(0ll, a[j] - ra[i] - t1);\n      }\n\n      cout << ans << endl;\n\n      j++;\n    }\n\n    if (i == k)\n      break;\n\n    if (ans0 >= 0) {\n\n      if (i % 2)\n        ans0 = min(x, ans0 + r[i + 1] - r[i]);\n\n      else\n        ans0 = max(0ll, ans0 - r[i + 1] + r[i]);\n\n    } else if (i % 2) {\n\n      if (x + ra[i + 1] < x2) {\n\n        x2 = x + ra[i + 1];\n      }\n\n      if (x1 >= x2) {\n\n        ans0 = x;\n      }\n\n    } else {\n\n      if (ra[i + 1] > x1) {\n\n        x1 = ra[i + 1];\n      }\n\n      if (x1 >= x2) {\n\n        ans0 = 0;\n      }\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"68ea7aba259e42a8f37b5f3c8c35c1409c5a69fe985051eb7eed572bfaec565b","fast_id":"9b8d124e0233d94cd9145cdb7720832cd7d704058d3df612ff234719ef55541d","fast_time":0.0201182825,"language":"cpp","measured_fast_code_id":"9b8d124e0233d94cd9145cdb7720832cd7d704058d3df612ff234719ef55541d","measured_slow_code_id":"386321001866695aebe1919af8107d6e13786c00b76b272a543da2ff5fcb8df3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71369","problem_id":"p02658","slow_code_id":"adcde9b67154e5385aa84425f11ca7254b04bd4781b547617c2ff4967b8765b8","slow_id":"386321001866695aebe1919af8107d6e13786c00b76b272a543da2ff5fcb8df3","slow_time":0.9285281448,"speedup":46.15344996770972,"stratum":"8+","sampling_key":"08b04193628ffb95572b0aa256daf64aa611d924badc0506a72872d41ba6c749","slow_code":"#include <stdio.h>\n\nint main() {\n\n  int i;\n\n  int brpkali;\n\n  long long hasil = 1;\n\n  unsigned long long Data = 1000000000000000000u;\n\n  scanf(\"%d\", &brpkali);\n\n  long long arr[1000000] = {};\n\n  for (i = 0; i < brpkali; i++)\n\n  {\n\n    scanf(\"%lld\", &arr[i]);\n  }\n\n  for (i = 0; i < brpkali; i++)\n\n  {\n\n    if (arr[i] == 0) {\n\n      printf(\"0\\n\");\n\n      return 0;\n    }\n  }\n\n  for (i = 0; i < brpkali; i++)\n\n  {\n\n    if (arr[i] <= (Data / hasil))\n\n    {\n\n      hasil *= arr[i];\n\n    }\n\n    else\n\n    {\n\n      printf(\"-1\\n\");\n\n      return 0;\n    }\n  }\n\n  printf(\"%lld\\n\", hasil);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  long long int arr[n], max = 1e18, prod = 1, flag = 0, zero = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%lld\", &arr[i]);\n\n    flag = (arr[i] > max) ? 1 : flag;\n\n    prod *= arr[i];\n\n    (arr[i]) ? max /= arr[i] : zero = 1;\n  }\n\n  (zero) ? puts(\"0\") : ((flag) ? puts(\"-1\") : printf(\"%lld\\n\", prod));\n\n  return 0;\n}"}
{"fast_code_id":"80d4812483286173212b6662887840766ba05c31deaba9dd4a728836699e3514","fast_id":"63a367dc64cc37945657e611207e62229b4356ed9d67980b0d63c65feb28d4b0","fast_time":0.009107092,"language":"cpp","measured_fast_code_id":"63a367dc64cc37945657e611207e62229b4356ed9d67980b0d63c65feb28d4b0","measured_slow_code_id":"40e2ebf0f01e24983556e315d5bff90b86debf3849ad6a2191ab61eb0e9f0582","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71592","problem_id":"p00859","slow_code_id":"a5515b034cbfcd6047c3170553f22372e500e602770cfa658dfe377282b2b6d2","slow_id":"40e2ebf0f01e24983556e315d5bff90b86debf3849ad6a2191ab61eb0e9f0582","slow_time":0.0428342074,"speedup":4.703390215010455,"stratum":"4-8","sampling_key":"7be4658fe1f28ad6fb0f7b867e91d36088d8c639dcad5cca4c28dd426e421385","slow_code":"#include <iostream>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define MAX 100\n\n#define INFTY (1 << 21)\n\nint n, m, G[MAX][MAX], E[MAX * MAX];\n\nint eprim(int base) {\n\n  int d[MAX];\n\n  bool visited[MAX];\n\n  rep(i, n) {\n\n    d[i] = INFTY;\n\n    visited[i] = false;\n  }\n\n  d[0] = 0;\n\n  int cnt = 0;\n\n  int ans = 0;\n\n  while (1) {\n\n    int minv = INFTY;\n\n    int u;\n\n    rep(i, n) {\n\n      if (!visited[i] && minv > d[i]) {\n\n        minv = d[i];\n        u = i;\n      }\n    }\n\n    if (minv == INFTY)\n      break;\n\n    if (u != 0 && ans < minv)\n      ans = minv;\n\n    cnt++;\n\n    visited[u] = true;\n\n    rep(v, n) {\n\n      if (visited[v] || G[u][v] == INFTY)\n        continue;\n\n      if (base > G[u][v])\n        continue;\n\n      if (d[v] > G[u][v] - base) {\n\n        d[v] = G[u][v] - base;\n      }\n    }\n  }\n\n  if (cnt != n)\n    return INFTY;\n\n  return ans;\n}\n\nvoid compute() {\n\n  int minv = INFTY;\n\n  rep(i, m) { minv = min(minv, eprim(E[i])); }\n\n  if (minv == INFTY)\n    cout << -1 << endl;\n\n  else\n    cout << minv << endl;\n}\n\nmain() {\n\n  int s, t, e;\n\n  while (cin >> n >> m) {\n\n    if (n == 0 && m == 0)\n      break;\n\n    rep(i, n) rep(j, n) G[i][j] = INFTY;\n\n    rep(i, m) {\n\n      cin >> s >> t >> e;\n      s--;\n      t--;\n\n      G[s][t] = G[t][s] = E[i] = e;\n    }\n\n    compute();\n  }\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define MAX 100\n\n#define INFTY (1 << 21)\n\nint n, m, G[MAX][MAX], E[MAX * MAX];\n\nint eprim(int base) {\n\n  int d[MAX];\n\n  bool visited[MAX];\n\n  rep(i, n) {\n    d[i] = INFTY;\n    visited[i] = false;\n  }\n\n  d[0] = 0;\n\n  int cnt = 0, ans = 0;\n\n  while (1) {\n\n    int u, minv = INFTY;\n\n    rep(i, n) {\n\n      if (!visited[i] && minv > d[i]) {\n\n        minv = d[i];\n        u = i;\n      }\n    }\n\n    if (minv == INFTY)\n      break;\n\n    if (u != 0 && ans < minv)\n      ans = minv;\n\n    cnt++;\n\n    visited[u] = true;\n\n    rep(v, n) {\n\n      if (visited[v] || G[u][v] == INFTY || base > G[u][v])\n        continue;\n\n      d[v] = min(d[v], G[u][v] - base);\n    }\n  }\n\n  return (cnt != n) ? INFTY : ans;\n}\n\nvoid compute() {\n\n  int minv = INFTY;\n\n  rep(i, m) minv = min(minv, eprim(E[i]));\n\n  printf(\"%d\\n\", (minv == INFTY) ? -1 : minv);\n}\n\nmain() {\n\n  int s, t, e;\n\n  while (1) {\n\n    scanf(\"%d %d\", &n, &m);\n\n    if (n == 0 && m == 0)\n      break;\n\n    rep(i, n) rep(j, n) G[i][j] = INFTY;\n\n    rep(i, m) {\n\n      scanf(\"%d %d %d\", &s, &t, &e);\n      s--;\n      t--;\n\n      G[s][t] = G[t][s] = E[i] = e;\n    }\n\n    compute();\n  }\n}"}
{"fast_code_id":"399dd2d4005bcfda0f0059e7d4da48ed59b43b5cb2e360252a6007fee3dc7e48","fast_id":"41ac93f2b1982d3036f3882bb360d9f9b862f6c3a4b1eb524d427a8d17df994c","fast_time":0.1084336911,"language":"cpp","measured_fast_code_id":"41ac93f2b1982d3036f3882bb360d9f9b862f6c3a4b1eb524d427a8d17df994c","measured_slow_code_id":"6d027ff40a47f1570b57b05aa2ed10e291eec5995e19f44136132a1d7686f5b7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71602","problem_id":"p02572","slow_code_id":"cbbdbe9007a733c6de38817fc936809ef2b41381464a3de84e33a3f2e4e9c4d2","slow_id":"6d027ff40a47f1570b57b05aa2ed10e291eec5995e19f44136132a1d7686f5b7","slow_time":0.8967975545,"speedup":8.270469679695337,"stratum":"8+","sampling_key":"477c6aa4dacebf555a0122a81bd7d3dd1af4873b9d30ebf7493af426f65fc456","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstatic const long long MOD = 1000000007;\n\n#include <boost/multiprecision/cpp_dec_float.hpp>\n\n#include <boost/multiprecision/cpp_int.hpp>\n\nnamespace mp = boost::multiprecision;\n\nusing Bint = mp::cpp_int;\n\nusing Real = mp::number<mp::cpp_dec_float<1024>>;\n\nint main() {\n\n  long long N;\n\n  cin >> N;\n\n  Bint A[200010];\n\n  Bint sum = 0;\n\n  for (long long i = 0; i < N; i++) {\n\n    cin >> A[i];\n\n    sum += A[i];\n  }\n\n  Bint ans = 0;\n\n  sum -= A[0];\n\n  for (long long i = 0; i < N - 1; i++) {\n\n    ans += A[i] * sum;\n\n    ans %= MOD;\n\n    sum -= A[i + 1];\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstatic const long long MOD = 1000000007;\n\nint main() {\n\n  long long N;\n\n  cin >> N;\n\n  long long A[200010];\n\n  long long sum = 0;\n\n  for (long long i = 0; i < N; i++) {\n\n    cin >> A[i];\n\n    sum += A[i];\n  }\n\n  sum %= 1000000007;\n\n  long long ans = 0;\n\n  sum -= A[0];\n\n  if (sum < 0) {\n\n    sum += MOD;\n  }\n\n  for (long long i = 0; i < N - 1; i++) {\n\n    ans += A[i] * sum;\n\n    ans %= 1000000007;\n\n    sum -= A[i + 1];\n\n    if (sum < 0) {\n\n      sum += MOD;\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"870d40d72171d36da1f79c22823f3a2002297c63e99549b711e7c47a9220a89f","fast_id":"caa2db331d10693c7e92cd38bb4d4d3c37066bac85aee98dc8060ffdb754e03e","fast_time":0.0996549016,"language":"cpp","measured_fast_code_id":"caa2db331d10693c7e92cd38bb4d4d3c37066bac85aee98dc8060ffdb754e03e","measured_slow_code_id":"694a8018b03d502ad303cd92e80194d04afd86bf785c9bfabdf2d58493161df3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71630","problem_id":"p00998","slow_code_id":"fa7e4f6884a7e86edce6d10c1ec4ccf592e596914cc99d6a7d08cfd6db343df3","slow_id":"694a8018b03d502ad303cd92e80194d04afd86bf785c9bfabdf2d58493161df3","slow_time":1.4174022019,"speedup":14.223105729302132,"stratum":"8+","sampling_key":"1f1859b8f4c9c239e8bc5233c096e3adfc64cf89a2b0d196f9f233e087a92920","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int PMAX = 1e6;\n\nstruct RMQ {\n\n  using type = int;\n\n  static type id() { return INT_MAX; }\n\n  static type op(type l, type r) { return min(l, r); }\n};\n\ntemplate <typename M>\n\nclass avl_tree {\n\n  using T = typename M::type;\n\n  struct node {\n\n    T val, all;\n\n    node *ch[2];\n\n    int dep, size;\n\n    node() : node(M::id()) {}\n\n    node(T v, node *l = nullptr, node *r = nullptr)\n\n        : val(v), all(v), ch{l, r}, dep(1), size(1) {}\n\n    void *operator new(size_t) {\n\n      static int p = 0;\n\n      static node pool[400100];\n\n      return pool + p++;\n    }\n  };\n\n  int depth(node *t) const { return t ? t->dep : 0; }\n\n  int count(node *t) const { return t ? t->size : 0; }\n\n  T que(node *t) const { return t ? t->all : M::id(); }\n\n  node *update(node *t) {\n\n    t->dep = max(depth(t->ch[0]), depth(t->ch[1])) + 1;\n\n    t->size = count(t->ch[0]) + 1 + count(t->ch[1]);\n\n    t->all = M::op(que(t->ch[0]), M::op(t->val, que(t->ch[1])));\n\n    return t;\n  }\n\n  node *rotate(node *t, int b) {\n\n    node *s = t->ch[1 - b];\n\n    t->ch[1 - b] = s->ch[b];\n\n    s->ch[b] = t;\n\n    update(t);\n\n    return update(s);\n  }\n\n  node *fix(node *t) {\n\n    if (!t)\n      return t;\n\n    if (depth(t->ch[0]) - depth(t->ch[1]) == 2) {\n\n      if (depth(t->ch[0]->ch[1]) > depth(t->ch[0]->ch[0])) {\n\n        t->ch[0] = rotate(t->ch[0], 0);\n      }\n\n      t = rotate(t, 1);\n\n    }\n\n    else if (depth(t->ch[0]) - depth(t->ch[1]) == -2) {\n\n      if (depth(t->ch[1]->ch[0]) > depth(t->ch[1]->ch[1])) {\n\n        t->ch[1] = rotate(t->ch[1], 1);\n      }\n\n      t = rotate(t, 0);\n    }\n\n    return t;\n  }\n\n  node *insert(node *t, int k, T v) {\n\n    if (!t)\n      return new node(v);\n\n    int c = count(t->ch[0]);\n\n    if (k <= c)\n\n      t->ch[0] = insert(t->ch[0], k, v);\n\n    else\n\n      t->ch[1] = insert(t->ch[1], k - (c + 1), v);\n\n    return fix(update(t));\n  }\n\n  node *erase(node *t) {\n\n    if (!t)\n      return t;\n\n    if (!t->ch[0] && !t->ch[1])\n      return nullptr;\n\n    if (!t->ch[0] || !t->ch[1])\n      return t->ch[t->ch[0] == nullptr];\n\n    return fix(update(new node(find(t->ch[1], 0)->val, t->ch[0], erase(t->ch[1], 0))));\n  }\n\n  node *erase(node *t, int k) {\n\n    if (!t)\n      return t;\n\n    int c = count(t->ch[0]);\n\n    if (k < c) {\n\n      t->ch[0] = erase(t->ch[0], k);\n\n      update(t);\n\n    }\n\n    else if (k > c) {\n\n      t->ch[1] = erase(t->ch[1], k - (c + 1));\n\n      update(t);\n\n    }\n\n    else {\n\n      t = erase(t);\n    }\n\n    return fix(t);\n  }\n\n  node *find(node *t, int k) const {\n\n    if (!t)\n      return t;\n\n    int c = count(t->ch[0]);\n\n    return k < c ? find(t->ch[0], k) : k == c ? t : find(t->ch[1], k - (c + 1));\n  }\n\n  T find(node *t, int l, int r) const {\n\n    if (!t || r <= 0 || t->size <= l)\n      return M::id();\n\n    if (l <= 0 && t->size <= r)\n      return t->all;\n\n    int c = count(t->ch[0]);\n\n    return M::op(find(t->ch[0], l, r), M::op((l <= c && c < r ? t->val : M::id()),\n                                             find(t->ch[1], l - (c + 1), r - (c + 1))));\n  }\n\n  node *root;\n\npublic:\n  avl_tree() : root(nullptr) {}\n\n  int size() const { return count(root); }\n\n  void insert(int k, T b) { root = insert(root, k, b); }\n\n  void erase(int k) { root = erase(root, k); }\n\n  T find(int k) const { return find(root, k)->val; }\n\n  T find(int l, int r) const { return find(root, l, r); }\n};\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  int n, q;\n\n  cin >> n >> q;\n\n  avl_tree<RMQ> tree;\n\n  for (int i = 0; i < n; i++) {\n\n    int a;\n\n    cin >> a;\n\n    tree.insert(i, a);\n  }\n\n  while (q--) {\n\n    int x, y, z;\n\n    cin >> x >> y >> z;\n\n    if (x == 0) {\n\n      int val = tree.find(z);\n\n      tree.erase(z);\n\n      tree.insert(y, val);\n\n    }\n\n    else if (x == 1) {\n\n      printf(\"%d\\n\", tree.find(y, z + 1));\n\n    }\n\n    else {\n\n      tree.erase(y);\n\n      tree.insert(y, z);\n    }\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n\n\nusing T = int;\n\nconst T id = INT_MAX;\n\nT op(T l, T r) {\n\nreturn min(l, r);\n\n}\n\n\n\nstruct node;\n\nnode *update(node *t);\n\n\n\nstruct node {\n\n  T val, all;\n\n  node *ch[2];\n\n  int dep, size;\n\n  node() {}\n\n  void init(T v) {\n\n    val = all = v;\n\n    dep = size = 1;\n\n    ch[0] = ch[1] = nullptr;\n\n  }\n\n  void init(node* l, node* r) {\n\n    val = id;\n\n    ch[0] = l, ch[1] = r;\n\n    update(this);\n\n  }\n\n};\n\n\n\nconst int pmax = 1e6;\n\nnode pool[pmax];\n\nqueue<int> deleted;\n\nint it = 0;\n\n\n\nint depth(node *t) { return t ? t->dep : 0; }\n\nint count(node *t) { return t ? t->size : 0; }\n\nint que(node *t) { return t ? t->all : id; }\n\n\n\nnode *new_leaf(T v) {\n\n  if (!deleted.empty()) {\n\n    auto pos = deleted.front(); deleted.pop();\n\n    pool[pos].init(v);\n\n    return pool + pos;\n\n  }\n\n  assert(it < pmax);\n\n  pool[it].init(v);\n\n  return pool + it++;\n\n}\n\n\n\nnode *new_node(node *l, node *r) {\n\n  if (!deleted.empty()) {\n\n    auto pos = deleted.front(); deleted.pop();\n\n    pool[pos].init(l, r);\n\n    return pool + pos;\n\n  }\n\n  assert(it < pmax);\n\n  pool[it].init(l, r);\n\n  return pool + it++;\n\n}\n\n\n\nvoid delete_node(node* t) {\n\ndeleted.push(t - pool);\n\n}\n\n\n\nnode *update(node *t) {\n\n  t->dep = max(depth(t->ch[0]), depth(t->ch[1])) + 1;\n\n  t->all = op(que(t->ch[0]), op(t->val, que(t->ch[1])));\n\n  t->size = count(t->ch[0]) + count(t->ch[1]) + (!t->ch[0] || !t->ch[1]);\n\n  return t;\n\n}\n\n\n\nnode *rotate(node *t, int b) {\n\n  node *s = t->ch[1 - b];\n\n  t->ch[1 - b] = s->ch[b];\n\n  s->ch[b] = t;\n\n  t = update(t);\n\n  s = update(s);\n\n  return s;\n\n}\n\n\n\nnode *fix(node *t) {\n\n  if (!t) return t;\n\n  int dd = depth(t->ch[0]) - depth(t->ch[1]);\n\n  if (abs(dd) < 2) return t;\n\n  int b = dd < 0;\n\n  if (depth(t->ch[b]->ch[!b]) > depth(t->ch[b]->ch[b])) {\n\n    t->ch[b] = rotate(t->ch[b], b);\n\n  }\n\n  return rotate(t, !b);\n\n}\n\n\n\nnode *submerge(node *l, node *r) {\n\n  if (l->dep == r->dep) return new_node(l, r);\n\n  if (l->dep < r->dep) {\n\n    r->ch[0] = submerge(l, r->ch[0]);\n\n    return fix(update(r));\n\n  }\n\n  l->ch[1] = submerge(l->ch[1], r);\n\n  return fix(update(l));\n\n}\n\n\n\nnode *merge(node *l, node *r) {\n\n  if (!l) return r;\n\n  if (!r) return l;\n\n  return submerge(l, r);\n\n}\n\n\n\npair<node*, node*> split(node *t, int k) {\n\n  if (!t) return make_pair(nullptr, nullptr);\n\n  if (k == 0) return make_pair(nullptr, t);\n\n  if (k >= count(t)) return make_pair(t, nullptr);\n\n  int c = count(t->ch[0]);\n\n  node *l = t->ch[0], *r = t->ch[1];\n\n  delete_node(t);\n\n  if (k < c) {\n\n    pair<node*, node*> p = split(l, k);\n\n    return make_pair(p.first, merge(p.second, r));\n\n  }\n\n  if (k > c) {\n\n    pair<node*, node*> p = split(r, k - c);\n\n    return make_pair(merge(l, p.first), p.second);\n\n  }\n\n  return make_pair(l, r);\n\n}\n\n\n\nnode *insert(node *t, int k, T v) {\n\n  pair<node*, node*> s = split(t, k);\n\n  return merge(merge(s.first, new_leaf(v)), s.second);\n\n}\n\n\n\nnode *erase(node *t, int k) {\n\n  pair<node*, node*> s1 = split(t, k), s2 = split(s1.second, 1);\n\n  return merge(s1.first, s2.second);\n\n}\n\n\n\nnode *find(node *t, int k) {\n\n  if (!t) return t;\n\n  int c = count(t->ch[0]), b = (!t->ch[0] || !t->ch[1]);\n\n  return c == 0 && b ? t : k < c ? find(t->ch[0], k) : find(t->ch[1], k - c - b);\n\n}\n\n\n\nT find(node *t, int l, int r) {\n\n  if (!t) return id;\n\n  if (r < 0 || l >= count(t)) return id;\n\n  if (l <= 0 && r >= t->size) return t->all;\n\n  int c = count(t->ch[0]), d = c + (!t->ch[0] || !t->ch[1]);\n\n  return op(!t->ch[0] ? id : find(t->ch[0], l, r), op(l <= c && c < r ? t->val : id, !t->ch[1] ? id : find(t->ch[1], l - d, r - d)));\n\n}\n\n\n\nvoid update(node *t, int k, T val) {\n\n  if (!t) return;\n\n  int c = count(t->ch[0]), b = (!t->ch[0] || !t->ch[1]);\n\n  if (c == 0 && b) {\n\n    t->val = val;\n\n  }\n\n  else if (k < c) {\n\n    update(t->ch[0], k, val);\n\n  }\n\n  else {\n\n    update(t->ch[1], k - c - b, val);\n\n  }\n\n  update(t);\n\n}\n\n\n\nnode* build(const vector<T>& a, int lb, int ub) {\n\n  if (ub - lb == 1) return new_leaf(a[lb]);\n\n  int m = (lb + ub) >> 1;\n\n  return merge(build(a, lb, m), build(a, m, ub));\n\n}\n\n\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  int n, q;\n\n  cin >> n >> q;\n\n  vector<T> a(n);\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n\n  }\n\n  node* root = build(a, 0, n);\n\n  while (q--) {\n\n    int x, y, z;\n\n    cin >> x >> y >> z;\n\n    if (x == 0) {\n\n      int val = find(root, z)->val;\n\n      root = insert(erase(root, z), y, val);\n\n    }\n\n    else if (x == 1) {\n\n      printf(\"%d\\n\", find(root, y, z + 1));\n\n    }\n\n    else {\n\n      update(root, y, z);\n\n    }\n\n  }\n\n  return 0;\n\n}\n\n\n"}
{"fast_code_id":"60594c69e2171cd0f83c2880d90f45f91c6347fdc89e6c7fb807c27596b9c3b6","fast_id":"fb9080472bdede2892053007bd74e6f9e73993d0830bcbbd510c1fd255f6c36f","fast_time":0.0010384903,"language":"cpp","measured_fast_code_id":"fb9080472bdede2892053007bd74e6f9e73993d0830bcbbd510c1fd255f6c36f","measured_slow_code_id":"4723b73b500e2ec3ef0933c6aad1da820db2b8ebb2d26dd1655ba67a4509ef24","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71661","problem_id":"p03716","slow_code_id":"5f4f68842de83187bc4cc79dd1168ff294153019896fa13deef17660def0193c","slow_id":"4723b73b500e2ec3ef0933c6aad1da820db2b8ebb2d26dd1655ba67a4509ef24","slow_time":0.0112609079,"speedup":10.843536911225844,"stratum":"8+","sampling_key":"22f31f6cb74f0721ad9d6586c1f18b35e8a054f7dc1c0131ff69b286710f2a76","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 300003;\n\nconst long long infll = 1000000000000000000;\n\nint arr[N];\n\nlong long lef[N], righ[N];\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < 3 * n; i++)\n\n    scanf(\"%d\", &arr[i]);\n\n  for (int i = 0; i < N; i++)\n\n    lef[i] = -infll, righ[i] = infll;\n\n  long long sum = 0;\n\n  multiset<int> s;\n\n  for (int i = 0; i < 3 * n; i++) {\n\n    s.insert(arr[i]);\n\n    sum += arr[i];\n\n    if (s.size() == n) {\n\n      lef[i] = sum;\n\n    } else if (s.size() > n) {\n\n      sum -= *s.begin();\n\n      s.erase(s.begin());\n\n      lef[i] = sum;\n    }\n  }\n\n  s.clear();\n\n  sum = 0;\n\n  for (int i = 3 * n - 1; i >= 0; i--) {\n\n    sum += arr[i];\n\n    s.insert(arr[i] * -1);\n\n    if (s.size() == n) {\n\n      righ[i] = sum;\n\n    } else if (s.size() > n) {\n\n      sum -= *(s.begin()) * -1;\n\n      s.erase(s.begin());\n\n      righ[i] = sum;\n    }\n  }\n\n  for (int i = 1; i < N; i++)\n\n    lef[i] = max(lef[i], lef[i - 1]);\n\n  for (int i = N - 2; i >= 0; i--)\n\n    righ[i] = min(righ[i], righ[i + 1]);\n\n  long long ans = -infll;\n\n  for (int i = 0; i < 3 * n; i++)\n\n    ans = max(ans, lef[i] - righ[i + 1]);\n\n  printf(\"%lld\", ans);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <fstream>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <algorithm>\n\n#include <numeric>\n\n#include <vector>\n\n#include <string>\n\n#include <set>\n\n#include <map>\n\n#include <queue>\n\n#include <stack>\n\n#include <climits>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <unordered_set>\n\n#include <unordered_map>\n\nusing namespace std;\n\n#define pb push_back\n\n#define fst first\n\n#define snd second\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntemplate <typename T> using min_queue = priority_queue<T, vector<T>, greater<T>>;\n\nconst ll MOD = 1e9 + 7;\n\nint N;\n\nll a[300100];\n\nll mx[300100];\n\nll mn[300100];\n\nint main() {\n\n  ios::sync_with_stdio(0);\n  cin.tie(0);\n\n  cin >> N;\n\n  for (int i = 0; i < 3 * N; i++)\n    cin >> a[i];\n\n  {\n\n    min_queue<ll> q;\n\n    ll s = 0;\n\n    for (int i = 0; i < 2 * N; i++) {\n\n      q.push(a[i]), s += a[i];\n\n      if (q.size() > N)\n        s -= q.top(), q.pop();\n\n      if (i >= N - 1)\n        mx[i] = s;\n    }\n  }\n\n  {\n\n    priority_queue<ll> q;\n\n    ll s = 0;\n\n    for (int i = 3 * N - 1; i >= N; i--) {\n\n      q.push(a[i]), s += a[i];\n\n      if (q.size() > N)\n        s -= q.top(), q.pop();\n\n      if (i <= 2 * N)\n        mn[i] = s;\n    }\n  }\n\n  ll res = -1e18;\n\n  for (int i = N - 1; i < 2 * N; i++)\n    res = max(res, mx[i] - mn[i + 1]);\n\n  cout << res << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"5d09d8cd758cbd52813f9a177044265bb9e6aeb77e786617a1e0f6e51032b30b","fast_id":"f38df8741b2f024787d70d825e4c276ad331eba4ca950502c1a2af669e173831","fast_time":0.0963684648,"language":"cpp","measured_fast_code_id":"f38df8741b2f024787d70d825e4c276ad331eba4ca950502c1a2af669e173831","measured_slow_code_id":"171fbc10327873417b773cdf02b705f7a4ababe348a5e285a72821ca1d1e99f1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71665","problem_id":"p02983","slow_code_id":"7a48f31b31276768f088fa4588334c29c8b5dd01a5a1dd1b93c115382d233351","slow_id":"171fbc10327873417b773cdf02b705f7a4ababe348a5e285a72821ca1d1e99f1","slow_time":0.8027691738,"speedup":8.330206104933199,"stratum":"8+","sampling_key":"95d1132b89ef0a971ec6ac19e9f67ca9c18e5d40a10606da2c609cb13c07b0f4","slow_code":"#include <cstdio>\n\n#include <queue>\n\n#include <iostream>\n\n#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\ntypedef long long int ll;\n\nusing namespace std;\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int i, j, k;\n\n  long n, m, tmp;\n\n  long l, r;\n\n  int min = 2018;\n\n  string s[200000];\n\n  cin >> l;\n\n  cin >> r;\n\n  if (abs(l - r) > 2019) {\n\n    cout << '0' << endl;\n\n  } else {\n\n    l = l % 2019;\n\n    r = r % 2019;\n\n    for (int i = l; i <= r; i++) {\n\n      for (int j = i + 1; j <= r; j++) {\n\n        if (i * j % 2019 < min) {\n\n          min = i * j % 2019;\n        }\n      }\n    }\n\n    cout << min << endl;\n  }\n\n  return 0;\n}","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define mod 1000000007\n\n#define INF 1001001001\n\n#define ll long long\n\n#define ln cout << endl\n\n#define Yes cout << \"Yes\" << endl\n\n#define No cout << \"No\" << endl\n\n#define double long double\n\n#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)\n\n#define rep(i, n) REP(i, 0, n)\n\n#define rep1(i, n) REP(i, 1, n + 1)\n\nusing namespace std;\n\nbool my_compare(pair<ll, ll> a, pair<ll, ll> b) {\n\n  if (a.first != b.first) {\n\n    return a.first < b.first;\n  }\n\n  if (a.second != b.second) {\n\n    return a.second > b.second;\n\n  } else {\n\n    return true;\n  }\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  ll a, b, m, n, maxi = 0, f = 0, mini = INF, sum = 0;\n\n  string str, sub;\n\n  ll h, w;\n\n  string str1;\n\n  cin >> h >> w;\n\n  if (w < h) {\n\n    mini = 0;\n  }\n\n  if (h == 0 || w == 0)\n    mini = 0;\n\n  for (ll i = h; i < w; i++) {\n\n    for (ll j = i + 1; j <= w; j++) {\n\n      mini = min(mini, (i * j) % 2019);\n\n      if (mini == 0) {\n\n        cout << 0 << endl;\n\n        return 0;\n      }\n    }\n  }\n\n  cout << mini << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"ae9ab8204dc6ffa76181b6f85cbc4a0c05aa5a3d13f84cd185f4ce3e540f62bc","fast_id":"d097b55c045d9312d0a88f847a1620917c8c9e829dfbc56c90dbe7f598a4646d","fast_time":0.0292757182,"language":"cpp","measured_fast_code_id":"d097b55c045d9312d0a88f847a1620917c8c9e829dfbc56c90dbe7f598a4646d","measured_slow_code_id":"0c43df2953518e332441b8d9956fda8f44611dbc5a116fe13f3e0059dcf53ea0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71727","problem_id":"p02262","slow_code_id":"b915513e5bb853648a6b712f1a3153aef018fda9dc940495468c24c2e7ad1dad","slow_id":"0c43df2953518e332441b8d9956fda8f44611dbc5a116fe13f3e0059dcf53ea0","slow_time":0.1145595302,"speedup":3.913124501929384,"stratum":"2-4","sampling_key":"5f6948fbf1503745e270e0a56c922b50c0c5b5492a4c7205d29c4d7cd46d4ffa","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint cnt;\n\nvoid insertionSort(int *a, int n, int g) {\n\n  int i, j, v;\n\n  for (i = g; i < n; i++) {\n\n    v = a[i];\n\n    j = i - g;\n\n    while ((j >= 0) && (a[j] > v)) {\n\n      a[j + g] = a[j];\n\n      j = j - g;\n\n      cnt++;\n    };\n\n    a[j + g] = v;\n  }\n}\n\nvoid shellsort(int *a, int n)\n\n{\n\n  cnt = 0;\n\n  int i, p;\n\n  int m;\n\n  int G[15];\n\n  p = 1;\n\n  for (i = 1; i < 20; i++) {\n\n    p = p * 3;\n\n    if (p - 1 > 2 * n)\n      break;\n  }\n\n  if (i > 1)\n    i = i - 1;\n\n  m = i;\n\n  p = 1;\n\n  for (i = 0; i < m; i++) {\n\n    p = p * 3;\n\n    G[m - 1 - i] = (p - 1) / 2;\n  }\n\n  cout << m << endl;\n\n  for (i = 0; i < m - 1; i++)\n    cout << G[i] << \" \";\n\n  cout << G[m - 1] << endl;\n\n  for (int i = 0; i < m; i++) {\n\n    insertionSort(a, n, G[i]);\n  }\n}\n\nint main()\n\n{\n\n  int i, A[1000000], n;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n    cin >> A[i];\n\n  shellsort(A, n);\n\n  cout << cnt << endl;\n\n  for (i = 0; i < n; i++)\n    cout << A[i] << endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint cnt;\n\nvoid insertionSort(int *a, int n, int g) {\n\n  int i, j, v;\n\n  for (i = g; i < n; i++) {\n\n    v = a[i];\n\n    j = i - g;\n\n    while ((j >= 0) && (a[j] > v)) {\n\n      a[j + g] = a[j];\n\n      j = j - g;\n\n      cnt++;\n    };\n\n    a[j + g] = v;\n  }\n}\n\nvoid shellsort(int *a, int n)\n\n{\n\n  cnt = 0;\n\n  int i, p;\n\n  int m;\n\n  int G[15];\n\n  p = 1;\n\n  for (i = 1; i < 20; i++) {\n\n    p = p * 3;\n\n    if (p - 1 > 2 * n)\n      break;\n  }\n\n  if (i > 1)\n    i = i - 1;\n\n  m = i;\n\n  p = 1;\n\n  for (i = 0; i < m; i++) {\n\n    p = p * 3;\n\n    G[m - 1 - i] = (p - 1) / 2;\n  }\n\n  printf(\"%d\\n\", m);\n\n  for (i = 0; i < m - 1; i++)\n    printf(\"%d \", G[i]);\n\n  printf(\"%d\\n\", G[m - 1]);\n\n  for (int i = 0; i < m; i++) {\n\n    insertionSort(a, n, G[i]);\n  }\n}\n\nint main()\n\n{\n\n  int i, A[1000000], n;\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n\n  shellsort(A, n);\n\n  printf(\"%d\\n\", cnt);\n\n  for (i = 0; i < n; i++)\n    printf(\"%d\\n\", A[i]);\n\n  return 0;\n}"}
{"fast_code_id":"3d3642c6a3929cc9712a8a50c0a0f4fc788487bac4d2e84c59aa12f0614f74ca","fast_id":"29ee8bbc062de9246fbba909f816818c0b18c3bf7c2a004f29071d65fb256ef8","fast_time":0.0377939573,"language":"cpp","measured_fast_code_id":"29ee8bbc062de9246fbba909f816818c0b18c3bf7c2a004f29071d65fb256ef8","measured_slow_code_id":"b4a1a50617e2b90827d599270a8a7604e3efbf8d436e6e4425e4bee635de650d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71731","problem_id":"p03039","slow_code_id":"9d3d0bdc238e80e11abaa74b9ee1743a57b35d306e9af167eb28f45823966fcc","slow_id":"b4a1a50617e2b90827d599270a8a7604e3efbf8d436e6e4425e4bee635de650d","slow_time":0.2456344471,"speedup":6.499304773781918,"stratum":"4-8","sampling_key":"0cd74a3e340216f45fac325baddded6e3fedec25a6a3e4728d7c7ba4366d8436","slow_code":"#include <iostream>\n\n#include <stdio.h>\n\n#include <vector>\n\n#define lld long long\n\nusing namespace std;\n\nconst lld MODULO = 1e9 + 7;\n\nconst int N = 2e5 + 5;\n\nint n, m, t;\n\nlld d[N], s[N], k[N], res;\n\nvector<lld> F[N];\n\nlld gcd, x, y;\n\nvoid gener() {\n\n  for (int i = 1; i <= max(m, n); i++) {\n\n    k[i] = (k[i - 1] + (i - 1)) % MODULO;\n\n    d[i] = (k[i] + d[i - 1]) % MODULO;\n\n    s[i] = (s[i - 1] + k[i] * 2) % MODULO;\n  }\n}\n\nvoid Clear() {\n\n  for (int i = 0; i <= n; i++)\n\n    for (int j = 0; j <= m; j++)\n\n      F[i].push_back(0);\n\n  for (int i = 1; i <= m; i++)\n\n    F[1][i] = d[i];\n\n  for (int i = 1; i <= n; i++)\n\n    F[i][1] = d[i];\n}\n\nvoid print() {\n\n  for (int i = 0; i <= n; i++) {\n\n    for (int j = 0; j <= m; j++)\n\n      cout << F[i][j] << ' ';\n\n    cout << '\\n';\n  }\n}\n\nvoid prepa() {\n\n  gener();\n\n  Clear();\n\n  for (int i = 2; i <= n; i++)\n\n    for (int j = 2; j <= m; j++) {\n\n      lld temp = ((d[i] * j * j) % MODULO + (s[j] * k[i]) % MODULO + (d[j] * i) % MODULO) % MODULO;\n\n      F[i][j] = temp;\n    }\n}\n\nvoid extendedEuclid(lld A, lld B)\n\n{\n\n  if (B == 0)\n\n  {\n\n    gcd = A;\n\n    x = 1;\n\n    y = 0;\n\n  }\n\n  else\n\n  {\n\n    extendedEuclid(B, A % B);\n\n    lld temp = x;\n\n    x = y;\n\n    y = temp - (A / B) * y;\n  }\n}\n\nvoid solve()\n\n{\n\n  int q = t - 2;\n\n  int p = n * m - 2;\n\n  lld ngt = 1, n_k = 1, kgt = 1;\n\n  for (int i = 1; i <= p; i++)\n\n    ngt = (ngt * i) % MODULO;\n\n  for (int i = 1; i <= q; i++)\n\n    kgt = (kgt * i) % MODULO;\n\n  for (int i = 1; i <= p - q; i++)\n\n    n_k = (n_k * i) % MODULO;\n\n  extendedEuclid(kgt, MODULO);\n  kgt = x;\n\n  extendedEuclid(n_k, MODULO);\n  n_k = x;\n\n  kgt = (kgt % MODULO + MODULO) % MODULO;\n\n  n_k = (n_k % MODULO + MODULO) % MODULO;\n\n  res = ((ngt * kgt % MODULO) * n_k % MODULO) * F[n][m] % MODULO;\n\n  printf(\"%lld\", res);\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d%d\", &n, &m, &t);\n\n  prepa();\n\n  solve();\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <stdio.h>\n\nusing namespace std;\n\nconst int MX = 200005, MOD = 1E9 + 7;\n\nint m, n, k;\n\nlong long ans = 0;\n\nlong long ngt[MX];\n\nlong long ive[MX];\n\nlong long kgt[MX];\n\nlong long d[MX];\n\nlong long c[MX];\n\nvoid gener()\n\n{\n\n  ngt[0] = kgt[0] = 1;\n\n  ngt[1] = kgt[1] = ive[1] = 1;\n\n  for (int i = 2; i <= m * n; i++)\n\n  {\n\n    ngt[i] = ngt[i - 1] * i % MOD;\n\n    ive[i] = MOD - MOD / i * ive[MOD % i] % MOD;\n\n    kgt[i] = kgt[i - 1] * ive[i] % MOD;\n  }\n}\n\nvoid solve()\n\n{\n\n  for (int i = 1; i <= max(m, n); i++)\n\n  {\n\n    c[i] = (c[i - 1] + (i - 1)) % MOD;\n\n    d[i] = (c[i] + d[i - 1]) % MOD;\n  }\n\n  ans += d[m] * n % MOD * n % MOD;\n\n  ans += d[n] * m % MOD * m % MOD;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d%d\", &n, &m, &k);\n\n  gener();\n\n  solve();\n\n  cout << ans * ngt[m * n - 2] % MOD * kgt[k - 2] % MOD * kgt[m * n - k] % MOD;\n}\n"}
{"fast_code_id":"23f37e056f50d7caf454f450f081d0fdf25ef2f96a05dafa9144225825342320","fast_id":"d8c0743b60a5d92ce9e24423877a1f82fef6aca8b8250ee12cbcb3834051dcfc","fast_time":0.0097301459,"language":"cpp","measured_fast_code_id":"d8c0743b60a5d92ce9e24423877a1f82fef6aca8b8250ee12cbcb3834051dcfc","measured_slow_code_id":"a686d17ee92570697e13ed0a0a946ceedc62436472bf1e2bd48d511368b7bc2e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71737","problem_id":"p00463","slow_code_id":"817f9b114f079960adb997b2a60943ced18725276ce2ba30cf0f585c99a34f58","slow_id":"a686d17ee92570697e13ed0a0a946ceedc62436472bf1e2bd48d511368b7bc2e","slow_time":0.1670167691,"speedup":17.16487818543399,"stratum":"8+","sampling_key":"527a04af52c8c3bbe98c4f881aa780f92ed848590412cae95a9fb1eedefd4189","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <map>\n\n#include <algorithm>\n\nusing namespace std;\n\nstruct Side {\n\n  int h, w, ul, ur, dl, dr;\n\n  Side(int h = 0, int w = 0, int ul = -1, int ur = -1, int dl = -1, int dr = -1)\n      : h(h), w(w), ul(ul), ur(ur), dl(dl), dr(dr) {}\n\n  bool operator<(const Side &a) const { return h < a.h; }\n};\n\nconst int INF = 1 << 30;\n\nint N, M, H, K;\n\nSide ss[100005];\n\nint s[1024], l[1024];\n\nmap<int, int> m;\n\nint main() {\n\n  while (scanf(\"%d%d%d%d\", &N, &M, &H, &K) && N || M || H || K) {\n\n    m.clear();\n\n    for (int i = 0; i < N; i++)\n      scanf(\"%d\", &s[i]);\n\n    for (int i = 0; i < M; i++) {\n\n      int a, b;\n\n      scanf(\"%d%d\", &a, &b);\n      a--;\n\n      ss[i] = Side(b, a);\n    }\n\n    for (int i = 0; i < N; i++)\n      l[i] = i;\n\n    sort(ss, ss + M);\n\n    for (int i = 0; i < M; i++) {\n\n      Side &sd = ss[i];\n\n      sd.ul = l[sd.w];\n      sd.ur = l[sd.w + 1];\n\n      swap(l[sd.w], l[sd.w + 1]);\n\n      sd.dl = l[sd.w];\n      sd.dr = l[sd.w + 1];\n    }\n\n    for (int i = 0; i < N; i++)\n      m[l[i]] = i;\n\n    for (int i = 0; i < M; i++) {\n\n      Side &sd = ss[i];\n\n      sd.dl = m[sd.dl];\n      sd.dr = m[sd.dr];\n    }\n\n    int sum = 0;\n\n    for (int i = 0; i < K; i++)\n      sum += s[m[i]];\n\n    int res = sum;\n\n    for (int i = 0; i < M; i++) {\n\n      Side sd = ss[i];\n\n      int diff = 0;\n\n      int l = 0, r = 0;\n\n      if (0 <= sd.ul && sd.ul < K)\n        l = 1;\n\n      if (0 <= sd.ur && sd.ur < K)\n        r = 1;\n\n      if (!l && r)\n        diff = s[sd.dr] - s[sd.dl];\n\n      else if (l && !r)\n        diff = s[sd.dl] - s[sd.dr];\n\n      res = min(res, sum + diff);\n    }\n\n    printf(\"%d\\n\", res);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nstruct Line {\n\n  int h, s, ur, ul, lr, ll;\n\n  Line() {}\n\n  Line(int h, int s, int ur = 0, int ul = 0, int lr = 0, int ll = 0)\n      : h(h), s(s), ur(ur), ul(ul), lr(lr), ll(ll) {}\n\n  bool operator<(const Line &r) const { return h < r.h; }\n};\n\nint N, M, H, K;\n\nint s[1024], p[1024], st[1024];\n\nLine L[100005];\n\nint main() {\n\n  while (scanf(\"%d%d%d%d\", &N, &M, &H, &K) && N || M || H || K) {\n\n    for (int i = 0; i < N; i++)\n      scanf(\"%d\", &s[i]);\n\n    for (int i = 0; i < N; i++)\n      st[i] = i;\n\n    for (int i = 0; i < M; i++) {\n\n      int a, b;\n      scanf(\"%d%d\", &a, &b);\n      a--;\n\n      L[i] = Line(b, a);\n    }\n\n    sort(L, L + M);\n\n    for (int i = 0; i < M; i++) {\n\n      Line &li = L[i];\n\n      li.ul = st[li.s];\n      li.ur = st[li.s + 1];\n\n      swap(st[li.s], st[li.s + 1]);\n\n      li.ll = st[li.s];\n      li.lr = st[li.s + 1];\n    }\n\n    for (int i = 0; i < N; i++)\n      p[st[i]] = i;\n\n    int sum = 0;\n\n    for (int i = 0; i < K; i++)\n      sum += s[p[i]];\n\n    int res = sum;\n\n    for (int i = 0; i < M; i++) {\n\n      Line li = L[i];\n\n      if (0 <= li.ul && li.ul < K && 0 <= li.ur && li.ur < K)\n        continue;\n\n      if (K <= li.ur && K <= li.ul)\n        continue;\n\n      if (0 <= li.ul && li.ul < K) {\n\n        res = min(res, sum - s[p[li.ul]] + s[p[li.ur]]);\n\n      } else {\n\n        res = min(res, sum - s[p[li.ur]] + s[p[li.ul]]);\n      }\n    }\n\n    printf(\"%d\\n\", res);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"18d243b74f8ef6d98aedbfcfed8064894d45638c3ccee59bb3d2aa433ad0fd09","fast_id":"2e1f32cbb7e4de7197301bf8de76171a75dc0ea390384fded340a9385d646b94","fast_time":0.1104900511,"language":"cpp","measured_fast_code_id":"2e1f32cbb7e4de7197301bf8de76171a75dc0ea390384fded340a9385d646b94","measured_slow_code_id":"b8f3513b904834911bed0e2d6f293c20e8a5d4bceee778b537998fbcd7adbc18","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71749","problem_id":"p02863","slow_code_id":"4ce1805745b7a3e5fcae36653f4f70c2fff8d098aa1e09fd832ba1c11f5fcf24","slow_id":"b8f3513b904834911bed0e2d6f293c20e8a5d4bceee778b537998fbcd7adbc18","slow_time":0.2425788402,"speedup":2.1954812925233593,"stratum":"2-4","sampling_key":"12b2654f12cc740a8b2a9184522526403034a89582ab08ef55d649eb5fe3cbde","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\n#include <map>\n\n#include <iomanip>\n\n#include <limits>\n\n#include <unordered_set>\n\n#include <cmath>\n\nusing namespace std;\n\nlong long p = 1000000007;\n\n#define int long long\n\n#define vel vector<long long>\n\n#define vvel vector<vel>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define sor(v) sort(v.begin(), v.end())\n\n#define mmax(a, b) a = max(a, b)\n\n#define mmin(a, b) a = min(a, b)\n\n#define mkp make_pair\n\n#define pin pair<int, int>\n\n#define qin pair<pin, int>\n\n#define V vector\n\n#define Endl endl\n\n#define veb vector<bool>\n\n#define fcout cout << fixed << setprecision(15)\n\n#define rev(s) reverse(s.begin(), s.end())\n\n#define lower(h, val) lower_bound(h.begin(), h.end(), val) - h.begin()\n\n#define upper(h, val) upper_bound(h.begin(), h.end(), val) - h.begin()\n\nint max_kai = 150000;\n\nvel kai(max_kai, 1);\n\nvel inv_kai;\n\nint rui(int a, int n, int mod) {\n\n  if (n == 0) {\n    return 1 % mod;\n  }\n\n  int x = rui(a, n / 2, mod);\n\n  x *= x;\n  x %= mod;\n\n  if (n % 2 == 1) {\n    x *= a;\n    x %= mod;\n  }\n\n  return x;\n}\n\nvel pa;\n\nint root(int x) {\n\n  if (pa[x] == -1) {\n    return x;\n  }\n\n  int ans = root(pa[x]);\n  pa[x] = ans;\n\n  return ans;\n}\n\nvoid marge(int x, int y) {\n\n  x = root(x);\n\n  y = root(y);\n\n  if (x != y) {\n    pa[x] = y;\n  }\n}\n\nint gcd(int x, int y) {\n\n  if (x < y) {\n    return gcd(y, x);\n  }\n\n  if (y == 0) {\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nlong long modinv(long long a, long long m) {\n\n  long long b = m, u = 1, v = 0;\n\n  while (b) {\n\n    long long t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvel uni(vel x) {\n\n  if (x.size() == 0) {\n    return x;\n  }\n\n  sor(x);\n\n  int n = x.size();\n\n  vel ans(1, x[0]);\n\n  for (int j = 1; j < n; j++) {\n\n    if (x[j - 1] != x[j]) {\n      ans.push_back(x[j]);\n    }\n  }\n\n  x = ans;\n\n  return x;\n}\n\nvoid pr(vel &v) {\n\n  int n = v.size();\n\n  if (n != 0) {\n\n    cout << v[0];\n\n    rep(i, n - 1) { cout << \" \" << v[i + 1]; }\n\n    cout << endl;\n  }\n}\n\nsigned main() {\n\n  int n, t;\n  cin >> n >> t;\n\n  vvel dp0(n + 1, vel(t, 0));\n\n  vvel dp1(n + 1, vel(t, 0));\n\n  rep(i, n) {\n\n    int a, b;\n    cin >> a >> b;\n\n    rep(j, t) {\n\n      mmax(dp0[i + 1][j], dp0[i][j]);\n\n      mmax(dp1[i + 1][j], dp1[i][j]);\n\n      if (j + a < t) {\n\n        mmax(dp0[i + 1][j + a], dp0[i][j] + b);\n\n        mmax(dp1[i + 1][j + a], dp1[i][j] + b);\n      }\n\n      mmax(dp1[i + 1][j], dp0[i][j] + b);\n    }\n  }\n\n  int ans = 0;\n\n  rep(j, t) { mmax(ans, max(dp0[n][j], dp1[n][j])); }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\n#include <map>\n\n#include <iomanip>\n\n#include <limits>\n\n#include <unordered_set>\n\n#include <cmath>\n\n#include <numeric>\n\n#include <array>\n\n#include <utility>\n\n#include <complex>\n\n#define M_PI 3.141592653589793238\n\nusing namespace std;\n\nlong long p = 1000000007;\n\n#define int long long\n\n#define ll long long\n\n#define vel vector<ll>\n\n#define vvel vector<vel>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define sor(v) sort(v.begin(), v.end())\n\n#define mmax(a, b) a = max(a, b)\n\n#define mmin(a, b) a = min(a, b)\n\n#define mkp(a, b) make_pair(a, b)\n\n#define pin pair<ll, ll>\n\n#define qin pair<pin, int>\n\n#define V vector\n\n#define Endl endl\n\n#define veb vector<bool>\n\n#define fcout cout << fixed << setprecision(15)\n\n#define rev(s) reverse(s.begin(), s.end())\n\n#define lower(h, val) (lower_bound(h.begin(), h.end(), val) - h.begin())\n\n#define upper(h, val) (upper_bound(h.begin(), h.end(), val) - h.begin())\n\n#define vveb V<veb>\n\n#define omajinai                                                                                   \\\n  cin.tie(0);                                                                                      \\\n  ios::sync_with_stdio(false);\n\n#define endl \"\\n\"\n\n#define pb push_back\n\nvel kai;\n\nvel inv_kai;\n\nint root(int x, vel &pa) {\n\n  if (pa[x] == -1) {\n    return x;\n  }\n\n  int ans = root(pa[x], pa);\n  pa[x] = ans;\n\n  return ans;\n}\n\nbool mar(int x, int y, vel &pa) {\n\n  x = root(x, pa);\n\n  y = root(y, pa);\n\n  if (x != y) {\n    pa[x] = y;\n  }\n\n  return (x != y);\n}\n\nint gcd(int x, int y) {\n\n  if (x < y) {\n    return gcd(y, x);\n  }\n\n  if (y == 0) {\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint lcm(ll x, ll y) {\n\n  x = abs(x);\n  y = abs(y);\n\n  return x * (y / gcd(x, y));\n}\n\nlong long modinv(long long a, long long m) {\n\n  long long b = m, u = 1, v = 0;\n\n  while (b) {\n\n    long long t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvoid make_kai(int max_kai, int p) {\n\n  kai = vel(max_kai, 1);\n\n  inv_kai = kai;\n\n  rep(i, max_kai - 1) {\n\n    kai[i + 1] = kai[i] * (i + 1);\n    kai[i + 1] %= p;\n\n    inv_kai[i + 1] = modinv(kai[i + 1], p);\n  }\n}\n\nint com(int n, int r) {\n\n  if ((n < 0) || (r < 0) || (r > n)) {\n    return 0;\n  }\n\n  int ans = (kai[n] * inv_kai[r]) % p;\n\n  return (ans * inv_kai[n - r]) % p;\n}\n\nvel uni(vel x) {\n\n  if (x.size() == 0) {\n    return x;\n  }\n\n  sor(x);\n\n  int n = x.size();\n\n  vel ans(1, x[0]);\n\n  for (int j = 1; j < n; j++) {\n\n    if (x[j - 1] != x[j]) {\n      ans.push_back(x[j]);\n    }\n  }\n\n  x = ans;\n\n  return x;\n}\n\nvel dijk(V<V<pin>> &way, int st, int inf) {\n\n  int n = way.size();\n\n  vel dist(n, inf);\n  dist[st] = 0;\n\n  priority_queue<pin, vector<pin>, greater<pin>> pq;\n\n  pq.push(mkp(0, st));\n\n  veb is_checked(n, false);\n\n  while (!pq.empty()) {\n\n    pin x = pq.top();\n    pq.pop();\n\n    int pot = x.second;\n\n    if (!is_checked[pot]) {\n\n      is_checked[pot] = true;\n\n      for (auto y : way[pot]) {\n\n        int nex_dist = x.first + y.second;\n\n        int nex_pot = y.first;\n\n        if (dist[nex_pot] > nex_dist) {\n\n          dist[nex_pot] = nex_dist;\n\n          pq.push(mkp(nex_dist, y.first));\n        }\n      }\n    }\n  }\n\n  return dist;\n}\n\nvoid make_tree(vvel &chi, vel &par, int n) {\n\n  V<V<pin>> way(n);\n\n  rep(i, n - 1) {\n\n    int a, b;\n    cin >> a >> b;\n    a--;\n    b--;\n\n    way[a].push_back(mkp(b, 1));\n\n    way[b].push_back(mkp(a, 1));\n  }\n\n  vel dist = dijk(way, 0, n + 1);\n\n  par = vel(n, -1);\n\n  chi = vvel(n);\n\n  rep(i, n) {\n\n    for (auto nex : way[i]) {\n\n      int pot = nex.first;\n\n      if (dist[pot] > dist[i]) {\n        chi[i].push_back(pot);\n      }\n\n      else {\n        par[i] = pot;\n      }\n    }\n  }\n}\n\n#define bs bitset<50>\n\n#define upperbound(v, val) upper_bound(v.begin(), v.end(), val) - v.begin()\n\n#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val) - v.begin()\n\nvoid pri(vel &v) {\n\n  if (v.size() == 0) {\n    return;\n  }\n\n  cout << v[0];\n\n  rep(i, v.size() - 1) { cout << \" \" << v[i + 1]; }\n\n  cout << endl;\n\n  return;\n}\n\nint modpow(int a, int n, int p) {\n\n  if (n == 0) {\n    return 1;\n  }\n\n  int m = n / 2;\n\n  int x = modpow(a, n / 2, p);\n\n  x *= x;\n  x %= p;\n\n  if (n % 2 == 1) {\n    x *= a;\n    x %= p;\n  }\n\n  return x;\n}\n\nsigned main() {\n\n  int n, t;\n  cin >> n >> t;\n\n  vel a(n), b(n);\n  vvel qa(n);\n\n  rep(i, n) {\n    cin >> a[i] >> b[i];\n    qa[i] = {a[i], b[i]};\n  }\n\n  sor(qa);\n\n  rep(i, n) {\n    a[i] = qa[i][0];\n    b[i] = qa[i][1];\n  }\n\n  vvel dp(n + 1, vel(t, 0));\n\n  rep(i, n) {\n\n    rep(j, t - a[i]) { mmax(dp[i + 1][j + a[i]], dp[i][j] + b[i]); }\n\n    rep(j, t) { mmax(dp[i + 1][j], dp[i][j]); }\n  }\n\n  int ans = 0;\n\n  rep(i, n + 1) {\n\n    rep(j, t) {\n\n      mmax(ans, dp[i][j]);\n\n      if (i != n) {\n        mmax(ans, dp[i][j] + b[i]);\n      }\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"d7dbc3ebf502bebfff6528e8beedb4f9eb1446558d85a6e2b26764f613f67d5b","fast_id":"a0b0f64e7db37d25e043c308866d746e1bab36007b60bdfd350eb03535e74968","fast_time":0.0197154944,"language":"cpp","measured_fast_code_id":"a0b0f64e7db37d25e043c308866d746e1bab36007b60bdfd350eb03535e74968","measured_slow_code_id":"82d3186693f5c362bee078d83a2ba1768cbe99fe63e2093e18973f53606de898","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71909","problem_id":"p03808","slow_code_id":"058d82b4da1657c057d0401908ca2eefd942104abb07688430ede812eabcee73","slow_id":"82d3186693f5c362bee078d83a2ba1768cbe99fe63e2093e18973f53606de898","slow_time":0.1916727118,"speedup":9.72193280631096,"stratum":"8+","sampling_key":"6723f944c6b2d4988503d30b665d4ed9df0d6b15d25ed11d29e54b6b18f70204","slow_code":"#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <string>\n\n#include <cstring>\n\n#include <deque>\n\n#include <list>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <utility>\n\n#include <algorithm>\n\n#include <map>\n\n#include <set>\n\n#include <complex>\n\n#include <cmath>\n\n#include <limits>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <ctime>\n\n#include <cassert>\n\nusing namespace std;\n\n#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)\n\n#define repq(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)\n\n#define repr(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)\n\n#define all(v) begin(v), end(v)\n\n#define pb(a) push_back(a)\n\n#define fr first\n\n#define sc second\n\n#define INF 2000000000\n\n#define int long long int\n\n#define X real()\n\n#define Y imag()\n\n#define EPS (1e-10)\n\n#define EQ(a, b) (abs((a) - (b)) < EPS)\n\n#define EQV(a, b) (EQ((a).X, (b).X) && EQ((a).Y, (b).Y))\n\n#define LE(n, m) ((n) < (m) + EPS)\n\n#define LEQ(n, m) ((n) <= (m) + EPS)\n\n#define GE(n, m) ((n) + EPS > (m))\n\n#define GEQ(n, m) ((n) + EPS >= (m))\n\ntypedef vector<int> VI;\n\ntypedef vector<VI> MAT;\n\ntypedef pair<int, int> pii;\n\ntypedef long long ll;\n\ntypedef complex<double> P;\n\ntypedef pair<P, P> L;\n\ntypedef pair<P, double> C;\n\nint dy[] = {0, 0, 1, -1};\n\nint dx[] = {1, -1, 0, 0};\n\nint const MOD = 1000000007;\n\nnamespace std {\n\nbool operator<(const P &a, const P &b) { return a.X != b.X ? a.X < b.X : a.Y < b.Y; }\n\n}                 \n\nsigned main() {\n\n  int n;\n  cin >> n;\n\n  int a[100010] = {};\n\n  int sum = 0;\n\n  rep(i, 0, n) {\n\n    cin >> a[i];\n\n    sum += a[i];\n  }\n\n  int cs[100010] = {};\n\n  int ret[100010] = {};\n\n  int cntnum = 0;\n\n  if (sum % (n * (n + 1) / 2))\n    cout << \"NO\" << endl;\n\n  else {\n\n    cntnum = sum / (n * (n + 1) / 2);\n\n    rep(i, 0, n) {\n\n      int prev = (i - 1 + n) % n;\n\n      int s = a[prev] - a[i];\n\n      if ((s + cntnum) % n != 0 || (s + cntnum) / n < 0) {\n\n        cout << \"NO\" << endl;\n\n        return 0;\n      }\n\n      cs[i] += (s + cntnum) / n;\n    }\n\n    cout << \"YES\" << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nlong long int N, A[100010];\n\nint main() {\n\n  scanf(\"%lld\", &N);\n\n  long long int sum = 0, div = N * (N + 1) / 2;\n\n  for (int i = 0; i < N; i++) {\n\n    scanf(\"%lld\", &A[i]);\n\n    sum += A[i];\n  }\n\n  bool ok = (sum % div == 0);\n\n  long long int sum_op = sum / div;\n\n  for (int i = 0; i < N; i++) {\n\n    long long int val = A[i] - A[(i + 1) % N] + sum_op;\n\n    ok &= (val >= 0 && val % N == 0);\n  }\n\n  printf(\"%s\\n\", ok ? \"YES\" : \"NO\");\n\n  return 0;\n}"}
{"fast_code_id":"d5059b6cceb3a0e450abaeb55aadd3bd0d73ac47fd37bf125a94452feddd1d06","fast_id":"1676b3062407c6a10d0e895ff7f8200f1df99fc42882133b25995a8a7734c630","fast_time":0.0840939828,"language":"cpp","measured_fast_code_id":"1676b3062407c6a10d0e895ff7f8200f1df99fc42882133b25995a8a7734c630","measured_slow_code_id":"6e87d52d57625dd48fadf4ebfd72c2422671c0fd0882a60996f79bd11eccd1bf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71928","problem_id":"p03651","slow_code_id":"93615c9a2dc500d23844e67c4908a1bc56f66768d101838cb1234e61a33bbc45","slow_id":"6e87d52d57625dd48fadf4ebfd72c2422671c0fd0882a60996f79bd11eccd1bf","slow_time":0.5486804741,"speedup":6.524610392219406,"stratum":"4-8","sampling_key":"bfd47ab58ef86a48ffbda5fcf9d5e68d50cefb24c2374818ccbe855116d9d5c1","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <numeric>\n\n#include <climits>\n\n#include <iterator>\n\n#include <iomanip>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\nusing namespace std;\n\nconst constexpr int INF = 1e9;\n\ntypedef long long ll;\n\ntypedef vector<int> VI;\n\nvector<pair<int, int> > vp;\n\nstruct Less {\n\n  bool operator()(const pair<int, int> &x, const pair<int, int> &y) const {\n\n    return x.first > y.first;\n  }\n};\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\nll GCD(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  return GCD(b, a % b);\n}\n\nVI g[200010];\n\nint h[100010];\n\nll N, K;\n\nstring s;\n\nll a[100010];\n\nint main(void) {\n\n  cin >> N >> K;\n\n  REP(i, N) cin >> a[i];\n\n  ll gcd = a[0];\n\n  ll maxV = 0;\n\n  REP(i, N) maxV = max(maxV, a[i]);\n\n  for (int i = 1; i < N; ++i) {\n\n    gcd = GCD(gcd, a[i]);\n  }\n\n  if (K % gcd == 0 && maxV >= K)\n    cout << \"POSSIBLE\" << endl;\n\n  else\n    cout << \"IMPOSSIBLE\" << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <string>\n\n#include <queue>\n\nusing namespace std;\n\nusing ll = long long;\n\n#define INF 1LL << 59\n\nll a[201000];\n\nll N, K;\n\nll GCD(ll a, ll b)\n\n{\n\n  if (a < b)\n\n    swap(a, b);\n\n  if (b == 0)\n\n    return a;\n\n  return GCD(b, a % b);\n}\n\nint main()\n\n{\n\n  cin >> N >> K;\n\n  ll maxV = 0;\n\n  for (int i = 0; i < N; ++i)\n\n  {\n\n    cin >> a[i];\n\n    maxV = max(maxV, a[i]);\n  }\n\n  if (N == 1)\n\n  {\n\n    if (a[0] == K)\n\n      cout << \"POSSIBLE\" << endl;\n\n    else\n\n      cout << \"IMPOSSIBLE\" << endl;\n\n    return 0;\n  }\n\n  ll d = GCD(a[0], a[1]);\n\n  for (int i = 2; i < N; ++i)\n\n  {\n\n    d = GCD(d, a[i]);\n  }\n\n  if (K % d == 0 && maxV >= K)\n\n    cout << \"POSSIBLE\" << endl;\n\n  else\n\n    cout << \"IMPOSSIBLE\" << endl;\n\n  return 0;\n}"}
{"fast_code_id":"f085a8308aae5f5c5be4ade670604905c35768473e1777d2ccd7d342dad317b3","fast_id":"bf9d762b9bad143728c60e66b7213f65cc482c3a5a7bd3f2be844c9145eb4d94","fast_time":0.0989610754,"language":"cpp","measured_fast_code_id":"bf9d762b9bad143728c60e66b7213f65cc482c3a5a7bd3f2be844c9145eb4d94","measured_slow_code_id":"6bdd9da85537302137e638a15b7591ee17996412bfb7d09a7fe42d2f5fd98607","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71936","problem_id":"p02797","slow_code_id":"9ded2ed94504b9bf921830e16cde98f9aa7b143ac694a078c852a731ebbac8bf","slow_id":"6bdd9da85537302137e638a15b7591ee17996412bfb7d09a7fe42d2f5fd98607","slow_time":0.350546794,"speedup":3.5422694487008375,"stratum":"2-4","sampling_key":"0e253719716e852143515babffd5eaa30face00be98c8a2df056e0bc4597c43a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define max(x, y) ((x) > (y) ? (x) : (y))\n\n#define min(x, y) ((x) < (y) ? (x) : (y))\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\nconst int maxn = 1010;\n\nmap<int, int> cnt, tmp;\n\nvector<int> gt[100001];\n\nstruct req {\n  long long x;\n  long long d;\n};\n\ndeque<req> q;\n\nint n, a, b, i, j, m, c, d, k;\n\nint fac[8] = {1, 1, 2, 6, 24, 120, 720, 5040};\n\nvector<string> prim;\nstring cur;\n\nvector<int> fin = {2, 3, 5, 7};\n\nint p(int x)\n\n{\n\n  int a = sqrt(x);\n\n  for (int i = 2; i <= a; i++)\n    if (x % i)\n      ;\n    else\n      return 0;\n\n  return 1;\n}\n\nint cmp(string a, string b)\n\n{\n\n  if (a.length() - b.length())\n    return (a.length() < b.length());\n\n  return (a < b);\n}\n\nint expect(string a)\n\n{\n\n  int n = a.length(), cnt1 = 0, cnt3 = 0, cnt7 = 0, cnt9 = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    if (a[i] == '1')\n      cnt1++;\n\n    if (a[i] == '3')\n      cnt3++;\n\n    if (a[i] == '7')\n      cnt7++;\n\n    if (a[i] == '9')\n      cnt9++;\n  }\n\n  return fac[n] / fac[cnt1] / fac[cnt3] / fac[cnt7] / fac[cnt9];\n}\n\nint conv(string a)\n\n{\n\n  int n = a.length(), res = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    res *= 10;\n\n    res += a[i] - 48;\n  }\n\n  return res;\n}\n\nvoid build(int i)\n\n{\n\n  if ((i >= 2) and (p(c))) {\n    sort(cur.begin(), cur.end());\n    prim.push_back(cur);\n  }\n\n  if (i < 7)\n\n  {\n\n    cur.push_back('1');\n\n    c *= 10;\n\n    c += 1;\n\n    build(i + 1);\n\n    cur.pop_back();\n\n    cur.push_back('3');\n\n    c -= 1;\n\n    c += 3;\n\n    build(i + 1);\n\n    cur.pop_back();\n\n    cur.push_back('7');\n\n    c -= 3;\n\n    c += 7;\n\n    build(i + 1);\n\n    cur.pop_back();\n\n    cur.push_back('9');\n\n    c -= 7;\n\n    c += 9;\n\n    build(i + 1);\n\n    cur.pop_back();\n\n    c -= 9;\n\n    c /= 10;\n  }\n}\n\nint main()\n\n{\n\n#define endl \"\\n\"\n\n  ios_base::sync_with_stdio(0);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n  int n, k, s;\n\n  cin >> n >> k >> s;\n\n  {\n\n    for (i = 0; i < n; i++)\n      if (i < k)\n        cout << s << ' ';\n      else if (s < 1e9)\n        cout << s + 1 << ' ';\n      else\n        cout << s - 1 << ' ';\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\n#define _for(i, a, b) for (int i = (a); i < (b); ++i)\n\n#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)\n\n#define ll long long\n\nusing namespace std;\n\nint main() {\n\n  ios::sync_with_stdio(0);\n\n  ll n, m, sum;\n\n  cin >> n >> m >> sum;\n\n  _for(i, 0, m) { cout << sum << \" \"; }\n\n  _for(i, 0, n - m) {\n\n    if (sum != 1000000000) {\n\n      cout << sum + 1 << \" \";\n\n    }\n\n    else\n\n    {\n\n      cout << sum - 1 << \" \";\n    }\n  }\n\n  cout << endl;\n\n  return 0;\n}"}
{"fast_code_id":"5816c5e342505e20e7c684aefda7bc69834685ef2e0a8c396d0bd8cb22e2ad47","fast_id":"d33fdb77fabed748662fef5963f7146c0aacfdf0930ec4758adbc0571e50bc80","fast_time":0.1047778692,"language":"cpp","measured_fast_code_id":"d33fdb77fabed748662fef5963f7146c0aacfdf0930ec4758adbc0571e50bc80","measured_slow_code_id":"2446d9c4513d9b589205fe84e0ee873171dfd4e29be12cdfb7f936d7b7fa36ca","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71957","problem_id":"p02631","slow_code_id":"2654075c0e8caaca9cf97dc74d487c87bd57f8917385179eadbaabdd62f83094","slow_id":"2446d9c4513d9b589205fe84e0ee873171dfd4e29be12cdfb7f936d7b7fa36ca","slow_time":0.8694895629,"speedup":8.298408524039731,"stratum":"8+","sampling_key":"013799475e91d3c0c82c2e99285706ae2840f2ebb000da991ee1e39f093df6bd","slow_code":"\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <cmath>\n\n#include <complex>\n\n#include <deque>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <iostream>\n\n#include <iterator>\n\n#include <map>\n\n#include <numeric>\n\n#include <queue>\n\n#include <set>\n\n#include <stack>\n\n#include <string>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <utility>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)\n\n#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)\n\n#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)\n\n#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)\n\n#define ALL(x) x.begin(), x.end()\n\n#define SIZE(x) ll(x.size())\n\n#define INF 1000000000000\n\n#define MOD 1000000007\n\n#define MAXR 100000\n\n#define PB push_back\n\n#define MP make_pair\n\n#define F first\n\n#define S second\n\n#define Umap unordered_map\n\n#define Uset unordered_set\n\nll a[200000];\nstring ans[200000];\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  ll n;\n  cin >> n;\n\n  REP(i, n) cin >> a[i];\n\n  ll b = 0;\n  REP(i, n) b ^= a[i];\n\n  string ans = \"\";\n\n  REP(i, n) {\n    ans += to_string(a[i] ^ b);\n    ans += \" \";\n  }\n\n  cout << ans << endl;\n}","fast_code":"#pragma GCC optimize(\"Ofast\")\n\n#include <iostream>\n\n#include <string>\n\nusing namespace std;\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n\nint a[200000];\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  int n;\n  cin >> n;\n\n  REP(i, n) cin >> a[i];\n\n  int b = 0;\n  REP(i, n) b ^= a[i];\n\n  REP(i, n) { cout << (a[i] ^ b) << \"\\n\"; }\n\n  return 0;\n}\n"}
{"fast_code_id":"83ded98c33236a3e70e3f43e0a8e1be982f19a8e51aa1bd56fde9a24d26c2153","fast_id":"1a6492cb57d862d61a028a842e658b0a9a25e7a6eb9ed607a0ac7bcdd27896fb","fast_time":0.0002366516,"language":"cpp","measured_fast_code_id":"1a6492cb57d862d61a028a842e658b0a9a25e7a6eb9ed607a0ac7bcdd27896fb","measured_slow_code_id":"3c51523529d064903ce7bab1be88aa5611ecd6c3f555f80ae41b9cc40a5f9362","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_71989","problem_id":"p03682","slow_code_id":"5d0144f0c64855775e6c75380ce95ed1bb22cbaef383959dee001b4def18e894","slow_id":"3c51523529d064903ce7bab1be88aa5611ecd6c3f555f80ae41b9cc40a5f9362","slow_time":0.0027065238,"speedup":11.436744142021436,"stratum":"8+","sampling_key":"a30ea0ef08d2bb5347bacb6a46eb728f1c5d08b39c1dec0ac171d02d59e5151e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint P[100001];\n\nint Find(int A) {\n\n  if (P[A] == A)\n    return A;\n\n  else\n    return P[A] = Find(P[A]);\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  pair<int, int> X[100001], Y[100001];\n\n  rep1(i, N) {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    X[i] = mp(x, i);\n\n    Y[i] = mp(y, i);\n  }\n\n  sort(X + 1, X + N + 1);\n\n  sort(Y + 1, Y + N + 1);\n\n  vector<pair<int, pair<int, int>>> eda;\n\n  rep1(i, N - 1) {\n\n    eda.pb(mp(abs(X[i + 1].first - X[i].first), mp(X[i].second, X[i + 1].second)));\n\n    eda.pb(mp(abs(Y[i + 1].first - Y[i].first), mp(Y[i].second, Y[i + 1].second)));\n  }\n\n  sort(eda.begin(), eda.end());\n\n  rep1(i, N) P[i] = i;\n\n  ll kotae = 0;\n\n  for (auto itr : eda) {\n\n    int a = Find(itr.second.first);\n\n    int b = Find(itr.second.second);\n\n    if (a != b) {\n\n      P[a] = b;\n\n      kotae += itr.first;\n    }\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nvoid pakuripair_sort(int N, int A[], int B[]) {\n\n  const int b = 8;\n\n  int tmp[200001], tmp2[200001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n      tmp2[kazu[A[i] >> k * b & ((1 << b) - 1)]] = B[i];\n    }\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--) {\n\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n\n      B[kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp2[i];\n    }\n  }\n}\n\nint X[200001], Y[100001], K[200001];\n\nint x[200001], y[200001];\n\nint Find(int A) {\n\n  if (Y[A] < 0)\n    return A;\n\n  return Y[A] = Find(Y[A]);\n}\n\nint main() {\n\n  int N = getint();\n\n  rep(i, N) {\n\n    X[i] = getint();\n\n    Y[i] = getint();\n\n    K[i] = i;\n  }\n\n  pakuripair_sort(N, X, K);\n\n  rep(i, N - 1) {\n\n    X[i] = X[i + 1] - X[i];\n\n    x[i] = K[i];\n\n    y[i] = K[i + 1];\n\n    K[i] = i;\n  }\n\n  K[N - 1] = N - 1;\n\n  pakuripair_sort(N, Y, K);\n\n  for (int i = N - 1; i < N + N - 2; i++) {\n\n    X[i] = Y[i - N + 2] - Y[i - N + 1];\n\n    x[i] = K[i - N + 1];\n\n    y[i] = K[i - N + 2];\n  }\n\n  rep(i, N + N - 2) K[i] = i;\n\n  pakuripair_sort(N + N - 2, X, K);\n\n  rep(i, N) Y[i] = -1;\n\n  ll kotae = 0;\n\n  rep(i, N + N - 2) {\n\n    int a = Find(x[K[i]]);\n\n    int b = Find(y[K[i]]);\n\n    if (a != b) {\n\n      if (Y[a] > Y[b])\n        swap(a, b);\n\n      Y[a] += Y[b];\n\n      Y[b] = a;\n\n      kotae += X[i];\n    }\n  }\n\n  printf(\"%lld\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"8bc89235ba75fceedb299213cdeb0e2404bbc9ac0994ad97f0aa4afa649a8865","fast_id":"05e251f76d77ddd8fd7f5e0251068e1e436072e182fe93a7bca8ff0c705333cf","fast_time":0.0498450473,"language":"cpp","measured_fast_code_id":"05e251f76d77ddd8fd7f5e0251068e1e436072e182fe93a7bca8ff0c705333cf","measured_slow_code_id":"6aff7ab47170456ecd70b2ea9b643cdcf29c4efdf4a6c42d7b404017e092f359","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72024","problem_id":"p03140","slow_code_id":"3f4e2767896ff0c3851b1a05ffa2d47a824feaa528313af98eb6d6b180dbe835","slow_id":"6aff7ab47170456ecd70b2ea9b643cdcf29c4efdf4a6c42d7b404017e092f359","slow_time":0.6558873235,"speedup":13.158525450932816,"stratum":"8+","sampling_key":"55df647ca393d77ac6e49d8a4d95e3a815b3cf1e3d0f5f772aa4cc9393c3c763","slow_code":"           \n\n                               \n\n                                                        \n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n            \n\nstruct initon {\n\n  initon() {\n\n    cin.tie(0);\n\n    ios::sync_with_stdio(false);\n\n    cout.setf(ios::fixed);\n\n    cout.precision(16);\n\n  };\n\n} __initon;\n\n\n\n               \n\nstruct T {\n\n  int f, s, t;\n\n  T() { f = -1, s = -1, t = -1; }\n\n  T(int f, int s, int t) : f(f), s(s), t(t) {}\n\n  bool operator<(const T &r) const {\n\n  return f != r.f ? f < r.f : s != r.s ? s < r.s : t < r.t;\n\n                                                                                \n\n  }\n\n  bool operator>(const T &r) const {\n\n  return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t;\n\n                                                                                \n\n  }\n\n  int operator[](int i) {\n\n    assert(i < 3);\n\n    return i == 0 ? f : i == 1 ? s : t;\n\n  }\n\n};\n\n\n\n                                \n\n\n\n#define int long long\n\n#define ll long long\n\n#define double long double\n\n#define ull unsigned long long\n\nusing dou = double;\n\nusing itn = int;\n\nusing str = string;\n\nusing bo= bool;\n\nusing P = pair<int, int>;\n\n#define F first\n\n#define S second\n\n#define vec vector\n\n#define con continue\n\n#define bre break\n\n#define brk break\n\n#define is ==\n\n#define rs resize\n\n\n\n                                 \n\nusing vi = vector<int>;\n\n#define vvi(a, b, c) vec<vi> a(b,vi(c))\n\nusing vb = vector<bool>;\n\n#define vvb(a, b, c) vec<vb> a(b,vb(c))\n\nusing vs = vector<string>;\n\n#define vvs(a, b, c) vec<vs> a(b,vs(c))\n\nusing vl = vector<ll>;\n\n#define vvl(a, b, c) vec<vl> a(b,vl(c))\n\nusing vd = vector<double>;\n\n#define vvd(a, b, c) vec<vd> a(b,vd(c))\n\nusing vc=vector<char>;\n\n#define vvc(a, b, c) vec<vc> a(b,vc(c))\n\nusing vp = vector<P>;\n\n#define vvp(a, b, c) vec<vp> a(b,vp(c))\n\nusing vt = vector<T>;\n\n#define vvt(a, b, c) vec<vt> a(b,vt(c))\n\n#define v3i(a, b, c, d) vector<vector<vi>> a(b, vector<vi>(c, vi(d)))\n\n#define v3d(a, b, c, d) vector<vector<vd>> a(b, vector<vd>(c, vd(d)))\n\n#define v3m(a, b, c, d) vector<vector<vm>> a(b, vector<vm>(c, vm(d)))\n\n#define PQ priority_queue<ll, vector<ll>, greater<ll> >\n\nusing seti = set<int>;\n\n#define uset unordered_set\n\n#define mset multiset\n\n#define umap unordered_map\n\n#define mmap multimap\n\n\n\n                        \n\n#define _overloadrep(_1, _2, _3, name, ...) name\n\n# define _rep(i, n) for(int i = 0; i < n ; i++)\n\n#define repi(i, m, n) for(int i = m; i < n ; i++)\n\n#define rep(...) _overloadrep(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)\n\n#define _rer(i, n) for(int i = n; i >= 0 ; i--)\n\n#define reri(i, m, n) for(int i = m; i >= n ; i--)\n\n#define rer(...) _overloadrep(__VA_ARGS__,reri,_rer,)(__VA_ARGS__)\n\n#define fora(a, b) for(auto&& a : b)\n\n#define forg(gi, ve) for (int gi = 0, f = ve[gi].from, t = ve[gi].to, c = ve[gi].cost; gi < ve.size(); gi++,f = ve[gi].from, t = ve[gi].to, c = ve[gi].cost)\n\n\n\n                  \n\n#define k4 10101\n\n#define k5 101010\n\n#define k6 1010101\n\n#define k7 10101010\n\nconst int inf = (int) 1e9 + 100;\n\nconst ll linf = (ll) 1e18 + 100;\n\nconst double eps = 1e-9;\n\nconst int y4[] = {-1, 1, 0, 0};\n\nconst int x4[] = {0, 0, -1, 1};\n\nconst int y8[] = {0, 1, 0, -1, -1, 1, 1, -1};\n\nconst int x8[] = {1, 0, -1, 0, 1, -1, 1, -1};\n\n\n\n                              \n\n#define arsz(a) (sizeof(a)/sizeof(a[0]))\n\n#define sz(a) (a.size())\n\n#define mp make_pair\n\n#define pb push_back\n\n#define pf push_front\n\n#define eb emplace_back\n\n#define all(a) (a).begin(),(a).end()\n\n#define rall(a) (a).rbegin(),(a).rend()\n\n\n\n                                                 \n\n\n\n                                                                           \n\n                                 \n\nnamespace std_vector_bounds_checking {\n\nusing namespace std;\n\ntemplate<class T, class A = std::allocator<T>> struct vector : std::vector<T, A> {\n\n  using std::vector<T, A>::vector;\n\n  typename std::vector<T>::reference operator[](typename std::vector<T>::size_type n) {\n\n    return this->at(n);\n\n  }\n\n};\n\n}\n\nnamespace std {\n\ntemplate<> class hash<std::pair<signed, signed>> {\n\npublic:\n\n  size_t operator()(const std::pair<signed, signed> &x) const {\n\n    return hash<ll>()(((ll) x.first << 32) + x.second);\n\n  }\n\n};\n\ntemplate<> class hash<std::pair<ll, ll>> {\n\npublic:\n\n  size_t operator()(const std::pair<ll, ll> &x) const {\n\n    return hash<ll>()(((ll) x.first << 32) + x.second);\n\n  }\n\n};\n\n}\n\ntemplate<typename T> istream &operator>>(istream &iss, vector<T> &vec) {\n\n  for (T &x: vec) iss >> x;\n\n  return iss;\n\n}\n\ntemplate<typename T> ostream &operator<<(ostream &os, vector <T> &vec) {\n\n  for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n\n  return os;\n\n}\n\ntemplate<typename V, typename H> void resize(vector<V> &vec, const H head) {                                                                                              \n\nvec.resize(head);\n\n}\n\ntemplate<typename V, typename H, typename ... T> void resize(vector<V> &vec, const H &head, const T ... tail) {\n\n  vec.resize(head);\n\n  for (auto &v: vec) resize(v, tail...);\n\n}\n\ntemplate<class T> T pop(set<T> &set) {\n\n  T res = *set.begin();\n\n  set.erase(set.find(res));\n\n  return res;\n\n}\n\ntemplate<class T> T pop(mset<T> &set) {\n\n  T res = *set.begin();\n\n  set.erase(set.find(res));\n\n  return res;\n\n}\n\ntemplate<class T> T popBack(set<T> &set) {\n\n  T res = *set.rbegin();\n\n  set.erase(set.find(res));\n\n  return res;\n\n}\n\ntemplate<class T> T popBack(mset<T> &set) {\n\n  T res = *set.rbegin();\n\n  set.erase(set.find(res));\n\n  return res;\n\n}\n\ntemplate<class T> inline void sort(vector<T> &a) { sort(a.begin(), a.end()); };\n\ntemplate<class T> inline void rsort(vector<T> &a) { sort(a.begin(), a.end(), greater<T>()); };\n\ntemplate<class T> inline void sort(vector<T> &a, int len) { sort(a.begin(), a.begin() + len); };\n\ntemplate<class T> inline void rsort(vector<T> &a, int len) { sort(a.begin(), a.begin() + len, greater<T>()); };\n\ntemplate<class T> inline void sort2(vector<vector<T>> &a) { for (int i = 0, n = a.size(); i < n; i++)sort(a[i]); }\n\ntemplate<class T> inline void rsort2(vector<vector<T>> &a) { for (int i = 0, n = a.size(); i < n; i++)rsort(a[i]); }\n\ntemplate<typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) { rep(i, N)a[i] = v; }\n\ntemplate<typename A, size_t N, size_t O, typename T> void fill(A (&a)[N][O], const T &v) { rep(i, N)rep(j, O)a[i][j] = v; }\n\ntemplate<typename A, size_t N, size_t O, size_t P, typename T> void fill(A (&a)[N][O][P], const T &v) { rep(i, N)rep(j, O)rep(k, P)a[i][j][k] = v; }\n\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, typename T> void fill(A (&a)[N][O][P][Q], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)a[i][j][k][l] = v; }\n\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, typename T> void fill(A (&a)[N][O][P][Q][R], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)a[i][j][k][l][m] = v; }\n\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S, typename T> void fill(A (&a)[N][O][P][Q][R][S], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)rep(n, S)a[i][j][k][l][m][n] = v; }\n\ntemplate<typename V, typename T> void fill(V &x, const T &val) { x = val; }\n\ntemplate<typename V, typename T> void fill(vector<V> &vect, const T &val) { for (auto &v: vect) fill(v, val); }\n\n                            \n\ntemplate<typename T = int> T in() {\n\n  T x;\n\n  cin >> x;\n\n  return (x);\n\n}\n\nstring sin() { return in<string>(); }\n\ndouble din() { return in<double>(); }\n\nll lin() { return in<ll>(); }\n\n#define na(a, n) rep(i,n) cin >> a[i];\n\n#define nad(a, n) rep(i,n) cin >> a[i], a[i]--;\n\n#define na3(a, b, c, n) rep(i, n)cin >> a[i] >> b[i] >> c[i];\n\n#define add2(a, b, n) rep(i, n)a.pb(in()),b.pb(in());\n\n#define add2d(a, b, n) rep(i, n)a.pb(in()-1),b.pb(in()-1);\n\n#define add3(a, b, c, n) rep(i, n)a.pb(in()),b.pb(in()),c.pb(in());\n\n#define add3d(a, b, c, n) rep(i, n)a.pb(in()-1),b.pb(in()-1),c.pb(in());\n\n#define na2(a, b, n) rep(i, n)cin >> a[i] >> b[i];\n\n#define nt(a, h, w) rep(hi,h)rep(wi,w) cin >> a[hi][wi];\n\n#define ntd(a, h, w) rep(hi,h)rep(wi,w) cin >> a[hi][wi], a[hi][wi]--;\n\n#define ntp(a, h, w) fill(a,'#');rep(hi,1,h+1)rep(wi,1,w+1) cin >> a[hi][wi];\n\n#define addn(a, n) a.resize(n);na(a,n);\n\n#define addnd(a, n) a.resize(n);na(a,n);rep(i,n)a[i]--;\n\n\n\n\n\n                           \n\ntemplate<class T> void out(T x) { typeid(x) == typeid(double) ? cout << fixed << setprecision(10) << x << endl : cout << x << endl; }\n\n              \n\n#define debug(x) cerr << x << \" \" << \"(L:\" << __LINE__ << \")\" << '\\n';\n\n                                   \n\nclass UnionFind {\n\npublic:\n\n  vi par, rank, sizes;\n\n  int n, trees;\n\n  UnionFind(int n) : n(n), trees(n) {\n\n    par.resize(n), rank.resize(n), sizes.resize(n);\n\n    rep(i, n)par[i] = i, sizes[i] = 1;\n\n  }\n\n  int root(int x) {\n\n    if (par[x] == x)return x;\n\n    else return par[x] = root(par[x]);\n\n  }\n\n  void unite(int x, int y) {\n\n    x = root(x);\n\n    y = root(y);\n\n    if (x == y)return;\n\n    if (rank[x] < rank[y])swap(x, y);\n\n    trees--;\n\n    par[y] = x;\n\n    sizes[x] += sizes[y];\n\n    if (rank[x] == rank[y])rank[x]++;\n\n  }\n\n  bool same(int x, int y) { return root(x) == root(y); }\n\n  int size(int x) { return sizes[root(x)]; }\n\n                             \n\n  vec<vi> sets() {\n\n    vec<vi> res(trees);\n\n    umap<int, vi> map;\n\n    rep(i, n) map[root(i)].push_back(i);\n\n    int i = 0;\n\n    for (auto &&p:map) {\n\n      int r = p.F;\n\n      res[i].push_back(r);\n\n      for (auto &&v:p.S) {\n\n        if (r == v)continue;\n\n        res[i].push_back(v);\n\n      }\n\n      i++;\n\n    }\n\n    return res;\n\n  }\n\n};\n\n\n\n           \n\nll MOD = (int) 1e9 + 7;\n\nint mpow(int v, ll a) {\n\n  ll x = v, n = a, res = 1;\n\n  while (n) {\n\n    if (n & 1)res = (res * x) % MOD;\n\n    x = (x * x) % MOD;\n\n    n >>= 1;\n\n  }\n\n  return res;\n\n}\n\nclass mint {\n\nprivate:\n\n  ll v;\n\npublic:\n\n  static ll mod(ll a) { return (a % MOD + MOD) % MOD; }\n\n  mint(ll a = 0) { this->v = mod(a); };\n\n  mint(const mint &a) { v = a.v; }\n\n  mint operator+(const mint &a) { return mint(v + a.v); }\n\n  mint operator+(const ll a) { return mint(v + a % MOD); }\n\n  mint operator+(const signed a) { return mint(v + a % MOD); }\n\n  friend mint operator+(const ll a, const mint &b) { return mint(a % MOD + b.v); }\n\n  void operator+=(const mint &a) { v = (v + a.v) % MOD; }\n\n  void operator+=(const ll a) { v = mod(v + a % MOD); }\n\n  void operator+=(const signed a) { v = mod(v + a % MOD); }\n\n  friend void operator+=(ll &a, const mint &b) { a = mod(a % MOD + b.v); }\n\n  mint operator-(const mint &a) { return mint(v - a.v); }\n\n  mint operator-(const ll a) { return mint(v - a % MOD); }\n\n  mint operator-(const signed a) { return mint(v - a % MOD); }\n\n  friend mint operator-(const ll a, const mint &b) { return mint(a % MOD - b.v); }\n\n  void operator-=(const mint &a) { v = mod(v - a.v); }\n\n  void operator-=(const ll a) { v = mod(v - a % MOD); }\n\n  void operator-=(const signed a) { v = mod(v - a % MOD); }\n\n  friend void operator-=(ll &a, const mint &b) { a = mod(a % MOD - b.v); }\n\n  mint operator*(const mint &a) { return mint(v * a.v); }\n\n  mint operator*(const ll a) { return mint(v * (a % MOD)); }\n\n  mint operator*(const signed a) { return mint(v * (a % MOD)); }\n\n  friend mint operator*(const ll a, const mint &b) { return mint(a % MOD * b.v); }\n\n  void operator*=(const mint &a) { v = (v * a.v) % MOD; }\n\n  void operator*=(const ll a) { v = mod(v * (a % MOD)); }\n\n  void operator*=(const signed a) { v = mod(v * (a % MOD)); }\n\n  friend void operator*=(ll &a, const mint &b) { a = mod(a % MOD * b.v); }\n\n  mint operator/(const mint &a);\n\n  mint operator/(const ll a);\n\n  mint operator/(const signed a);\n\n  friend mint operator/(const ll a, const mint &b);\n\n  void operator/=(const mint &a);\n\n  void operator/=(const ll a);\n\n  void operator/=(const signed a);\n\n  friend void operator/=(ll &a, const mint &b);\n\n  mint operator^(const mint &a) { return mpow(v, a.v); };\n\n  mint operator^(const ll a) { return mpow(v, a); };\n\n  mint operator^(const signed a) { return mpow(v, a); };\n\n  friend mint operator^(const ll a, const mint &b) { return mpow(a, b.v); };\n\n  void operator^=(const mint &a) { v = mpow(v, a.v); }\n\n  void operator^=(const ll a) { v = mpow(v, a); }\n\n  void operator^=(const signed a) { v = mpow(v, a); }\n\n                     \n\n  mint operator+() { return *this; }\n\n  mint operator++() {\n\n    v++;\n\n    return *this;\n\n  }\n\n  mint operator++(signed d) {\n\n    mint res = *this;\n\n    v++;\n\n    return res;\n\n  }\n\n  mint operator-() { return operator*(-1); }\n\n  mint operator--() {\n\n    v++;\n\n    return *this;\n\n  }\n\n  void operator--(signed d) {\n\n    mint res = *this;\n\n    v++;\n\n  }\n\n  bool operator==(mint &a) { return v == a.v; }\n\n  bool operator==(signed a) { return v == a; }\n\n  friend bool operator==(signed a, mint &b) { return a == b.v; }\n\n  bool operator!=(mint &a) { return v != a.v; }\n\n  bool operator!=(signed a) { return v != a; }\n\n  friend bool operator!=(signed a, mint &b) { return a != b.v; }\n\n  operator int() { return v; }\n\n};\n\nconst int setModMax = 510000;\n\nmint fac[setModMax], finv[setModMax], inv[setModMax];\n\nvoid setMod() {\n\n  fac[0] = fac[1] = 1;\n\n  finv[0] = finv[1] = 1;\n\n  inv[1] = 1;\n\n  for (int i = 2; i < setModMax; i++) {\n\n    fac[i] = fac[i - 1] * i % MOD;\n\n    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n\n    finv[i] = finv[i - 1] * inv[i] % MOD;\n\n  }\n\n}\n\n\n\nmint minv(ll a) {\n\n  if (fac[0] == 0)setMod();\n\n  if (a < setModMax) return inv[a];\n\n  a %= MOD;\n\n  ll b = MOD, x = 1, y = 0;\n\n  while (b) {\n\n    ll t = a / b;\n\n    a -= t * b;\n\n    swap(a, b);\n\n    x -= t * y;\n\n    swap(x, y);\n\n  }\n\n  return (x % MOD + MOD) % MOD;\n\n}\n\nmint mint::operator/(const mint &a) { return mint(v * minv(a.v)); }\n\nmint mint::operator/(const ll a) { return mint(v * minv(a)); }\n\nmint mint::operator/(const signed a) { return mint(v * minv(a)); }\n\nmint operator/(const ll a, const mint &b) { return mint(a % MOD * minv(b.v)); }\n\nvoid mint::operator/=(const mint &a) { v = (v * minv(a.v)) % MOD; }\n\nvoid mint::operator/=(const ll a) { v = mod(v * minv(a)); }\n\nvoid mint::operator/=(const signed a) { v = mod(v * minv(a)); }\n\nvoid operator/=(ll &a, const mint &b) { a = mint::mod(a % MOD * minv(b.v)); }\n\nusing vm=vector<mint>;\n\n#define vvm(a, b, c) vec<vm> a(b,vm(c))\n\nbool isPrime[4010101];\n\nvi primes;\n\n\n\nvoid setPrime() {\n\n  fill(isPrime, true);\n\n  int len = sizeof(isPrime) / sizeof(isPrime[0]);\n\n  isPrime[0] = isPrime[1] = false;\n\n  for (int i = 2; i <= sqrt(len) + 5; ++i) {\n\n    if (!isPrime[i])continue;\n\n    for (int j = 2; i * j < len; ++j) {\n\n      isPrime[i * j] = false;\n\n    }\n\n  }\n\n  rep(i, len)if (isPrime[i])primes.pb(i);\n\n}\n\n\n\nmint com(ll n, ll r) {\n\n  if (n < r || n < 0 || r < 0)return 0;\n\n  if (fac[0] == 0)setMod();\n\n  return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;\n\n}\n\n\n\n              \n\nvoid ole() {\n\n  string a = \"a\";\n\n  rep(i, 30)a += a;\n\n  rep(i, 1 << 17)cout << a << endl;\n\n  cout << \"OLE 出力長制限超過\" << endl;\n\n  exit(0);\n\n}\n\nvoid tle() { while (inf)cout << inf << endl; }\n\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\n\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n\nbool equal(double a, double b) { return fabs(a - b) < eps; }\n\nll reverse(ll a) {\n\n  ll res = 0;\n\n  while (a) {\n\n    res *= 10;\n\n    res += a % 10;\n\n    a /= 10;\n\n  }\n\n  return res;\n\n}\n\nll ceil(ll a, ll b) {\n\n  if (b == 0) {\n\n    ole();\n\n    return -1;\n\n  } else return (a + b - 1) / b;\n\n}\n\nll sqrt(ll a) {\n\n  if (a < 0)ole();\n\n  ll res = (ll) std::sqrt(a);\n\n  while (res * res < a)res++;\n\n  return res;\n\n}\n\ndouble log(double e, double x) { return log(x) / log(e); }\n\nll sig(ll t) { return (1 + t) * t / 2; }\n\nll sig(ll s, ll t) { return (s + t) * (t - s + 1) / 2; }\n\n\n\nvi divisors(int v) {\n\n  vi res;\n\n  for (int i = 1; i <= sqrt(v); ++i) {\n\n    if (v % i == 0) {\n\n      res.pb(i);\n\n      if (i != v / i)res.pb(v / i);\n\n    }\n\n  }\n\n  return res;\n\n}\n\n\n\nvi factorization(int v) {\n\n  int tv = v;\n\n  vi res;\n\n  if (!isPrime[2])setPrime();\n\n  for (auto &&p :primes) {\n\n    if (v % p == 0)res.push_back(p);\n\n    while (v % p == 0) {\n\n      v /= p;\n\n    }\n\n    if (v == 1 || p * p > tv)break;\n\n  }\n\n  if (v > 1)res.pb(v);\n\n  return res;\n\n}\n\n\n\nunordered_map<int, int> factorizationMap(int v) {\n\n  int tv = v;\n\n  unordered_map<int, int> res;\n\n  if (!isPrime[2])setPrime();\n\n  for (auto &&p :primes) {\n\n    while (v % p == 0) {\n\n      res[p]++;\n\n      v /= p;\n\n    }\n\n    if (v == 1 || p * p > tv)break;\n\n  }\n\n  if (v > 1)res[v]++;\n\n  return res;\n\n}\n\nint get(int a, int keta) { return (a / (int) pow(10, keta)) % 10; }\n\nint keta(int v) {\n\n  int cou = 0;\n\n  while (v) { cou++, v %= 10; }\n\n  return cou;\n\n}\n\n\n\ntemplate<class T> void imo(vector<T> &v) {\n\n  int n = v.size();\n\n  rep(i, n - 1)v[i + 1] += v[i];\n\n}\n\n\n\n           \n\ntemplate<class T, class U> vector<U> keys(map<T, U> a) {\n\n  vector<U> res;\n\n  for (auto &&k :a)res.pb(k.F);\n\n  return res;\n\n}\n\n\n\ntemplate<class T, class U> vector<U> keys(umap<T, U> a) {\n\n  vector<U> res;\n\n  for (auto &&k :a)res.pb(k.F);\n\n  return res;\n\n}\n\n\n\ntemplate<class T, class U> vector<T> values(map<T, U> a) {\n\n  vector<T> res;\n\n  for (auto &&k :a)res.pb(k.S);\n\n  return res;\n\n}\n\n\n\ntemplate<class T, class U> vector<T> values(umap<T, U> a) {\n\n  vector<T> res;\n\n  for (auto &&k :a)res.pb(k.S);\n\n  return res;\n\n}\n\n\n\nvi list(int a) {\n\n  vi res;\n\n  while (a) {\n\n    res.insert(res.begin(), a % 10);\n\n    a /= 10;\n\n  }\n\n  return res;\n\n}\n\n\n\ntemplate<class T, class U> bool chmax(T &a, const U &b) {\n\n  if (a < b) {\n\n    a = b;\n\n    return true;\n\n  }\n\n  return false;\n\n}\n\n\n\ntemplate<class T, class U> bool chmin(T &a, const U &b) {\n\n  if (b < a) {\n\n    a = b;\n\n    return true;\n\n  }\n\n  return false;\n\n}\n\n\n\ntemplate<class T> T min(T a, signed b) {\n\nreturn a < b ? a : b;\n\n}\n\n\n\ntemplate<class T> T max(T a, signed b) {\n\nreturn a < b ? b : a;\n\n}\n\n\n\ntemplate<class T> T min(vector<T> a) {\n\nreturn *min_element(all(a));\n\n}\n\n\n\ntemplate<class T> T max(vector<T> a) {\n\nreturn *max_element(all(a));\n\n}\n\n\n\ntemplate<class T> T min(T a[]) {\n\n  T res = a[0];\n\n  rep(i, arsz(a))chmin(res, a[i]);\n\n  return res;\n\n}\n\n\n\ntemplate<class T> T max(T a[]) {\n\n  T res = a[0];\n\n  rep(i, arsz(a))chmax(res, a[i]);\n\n  return res;\n\n}\n\ntemplate<class T> T sum(vector<T> &v, int len = -1) {\n\n  if (len == -1)len = v.size();\n\n  T res = 0;\n\n  chmin(len, v.size());\n\n  rep(i, len)res += v[i];\n\n  return res;\n\n}\n\n\n\ntemplate<class T> T sum(vector<vector<T>> &v, int h = -1, int w = -1) {\n\n  if (h == -1)h = v.size();\n\n  if (w == -1)w = v[0].size();\n\n  T res = 0;\n\n  chmin(h, v.size());\n\n  chmin(w, v[0].size());\n\n  rep(i, h)rep(j, w)res += v[i][j];\n\n  return res;\n\n}\n\n\n\nP sump(vp &v, int len = -1) {\n\n  if (len == -1)len = v.size();\n\n  P res = {0, 0};\n\n  chmin(len, v.size());\n\n  rep(i, len) {\n\n    res.F += v[i].F;\n\n    res.S += v[i].S;\n\n  }\n\n  return res;\n\n}\n\n\n\n                                          \n\ntemplate<class T> T mul(vector<T> &v, int len = -1) {\n\n  if (len == -1)len = v.size();\n\n  T res = 1;\n\n  chmin(len, v.size());\n\n  rep(i, len)res *= v[i];\n\n  return res;\n\n}\n\nvoid clear(PQ &q) { while (q.size())q.pop(); }\n\ntemplate<class T> void clear(queue<T> &q) { while (q.size())q.pop(); }\n\ntemplate<class T> T *negarr(int size) {\n\n  T *body = (T *) malloc((size * 2 + 1) * sizeof(T));\n\n  return body + size;\n\n}\n\ntemplate<class T> T *negarr2(int h, int w) {\n\n  double **dummy1 = new double *[2 * h + 1];\n\n  double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];\n\n  dummy1[0] = dummy2 + w;\n\n  for (int i = 1; i <= 2 * h + 1; i++) {\n\n    dummy1[i] = dummy1[i - 1] + 2 * w + 1;\n\n  }\n\n  double **a = dummy1 + h;\n\n}\n\n\n\ntemplate<class T> vector<T> ruiv(vector<T> &a) {\n\n  vector<T> res(a.size() + 1);\n\n  rep(i, a.size())res[i + 1] = res[i] + a[i];\n\n  return res;\n\n}\n\n\n\ntemplate<class T> vector<T> ruim(vector<T> &a) {\n\n  vector<T> res(a.size() + 1, 1);\n\n  rep(i, a.size())res[i + 1] = res[i] * a[i];\n\n  return res;\n\n}\n\n                                                  \n\ntemplate<class T> T *rrui(vector<T> &a) {\n\n  int len = a.size();\n\n  T *body = (T *) malloc((len + 1) * sizeof(T));\n\n  T *res = body + 1;\n\n  rer(i, len - 1)res[i - 1] = res[i] + a[i];\n\n  return res;\n\n}\n\n           \n\ntemplate<class T> T *rruim(vector<T> &a) {\n\n  int len = a.size();\n\n  T *body = (T *) malloc((len + 1) * sizeof(T));\n\n  T *res = body + 1;\n\n  res[len - 1] = 1;\n\n  rer(i, len - 1)res[i - 1] = res[i] * a[i];\n\n  return res;\n\n}\n\ntemplate<class T> void plus(vector<T> &a, T v = 1) { for (auto &&u :a)u += v; }\n\ntemplate<class T> void minu(vector<T> &a, T v = 1) { for (auto &&u :a)u -= v; }\n\ntemplate<class T> void minus(vector<T> &a, T v = 1) { for (auto &&u :a)u -= v; }\n\ninline bool inside(int y, int x, int H, int W) { return y >= 0 && x >= 0 && y < H && x < W; }\n\nll u(ll a) { return a < 0 ? 0 : a; }\n\n#define MIN(a) numeric_limits<a>::min()\n\n#define MAX(a) numeric_limits<a>::max()\n\ntemplate<class T> T min(vector<vector<T>> &a) {\n\n  T res = MAX(T);\n\n  rep(i, a.size())chmin(res, *min_element(all(a[i])));\n\n  return res;\n\n}\n\ntemplate<class T> T max(vector<vector<T>> &a) {\n\n  T res = MIN(T);\n\n  rep(i, a.size())chmax(res, *max_element(all(a[i])));\n\n  return res;\n\n}\n\nbool bget(ll m, int keta) { return (m >> keta) & 1; }\n\nint bget(ll m, int keta, int sinsuu) {\n\n  m /= (ll) pow(sinsuu, keta);\n\n  return m % sinsuu;\n\n}\n\ninline ll bit(int n) { return (1LL << (n)); }\n\ninline ll bit(int n, int sinsuu) { return (ll) pow(sinsuu, n); }\n\nint bcou(ll m) { return __builtin_popcount(m & 0xFFFFFFFF) + __builtin_popcount(m >> 32); }\n\n                        \n\nll nextComb(ll &mask, int n, int r) {\n\n  if (!mask)return mask = (1LL << r) - 1;\n\n  ll x = mask & -mask;                \n\n  ll y = mask + x;                                              \n\n  ll res = ((mask & ~y) / x >> 1) | y;\n\n  if (bget(res, n))return mask = 0;\n\n  else return mask = res;\n\n}\n\n\n\n                                                                      \n\nvl bitCombList(int n, int r) {\n\n  vl res;\n\n  int m = 0;\n\n  while (nextComb(m, n, r)) {\n\n    res.pb(m);\n\n  }\n\n  return res;\n\n}\n\n\n\nint altoi(char c) {\n\n  if ('A' <= c && c <= 'Z')return c - 'A';\n\n  return c - 'a' + 26;\n\n}\n\nchar itoal(int i) {\n\n  if (i < 26)return 'A' + i;\n\n  return 'a' + i - 26;\n\n}\n\nint ctoi(char c) { return c - '0'; }\n\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\n\n\nvoid compress(vi &a) {\n\n  vi b;\n\n  int len = a.size();\n\n  for (int i = 0; i < len; ++i) {\n\n    b.push_back(a[i]);\n\n  }\n\n  sort(b);\n\n  UNIQUE(b);\n\n  for (int i = 0; i < len; ++i) {\n\n    a[i] = lower_bound(all(b), a[i]) - b.begin();\n\n  }\n\n}\n\n\n\nvoid compress(int a[], int len) {\n\n  vi b;\n\n  for (int i = 0; i < len; ++i) {\n\n    b.push_back(a[i]);\n\n  }\n\n  sort(b);\n\n  UNIQUE(b);\n\n  for (int i = 0; i < len; ++i) {\n\n    a[i] = lower_bound(all(b), a[i]) - b.begin();\n\n  }\n\n}\n\n                                                  \n\n#define binarySearch(a, v) (binary_search(all(a),v))\n\n#define lowerIndex(a, v) (lower_bound(all(a),v)-a.begin())\n\n#define lowerBound(a, v) (*lower_bound(all(a),v))\n\n#define upperIndex(a, v) (upper_bound(all(a),v)-a.begin())\n\n#define upperBound(a, v) (*upper_bound(all(a),v))\n\n#define ans(a) cout<<a<<endl;continue;\n\n#define poll(a) q.front();q.pop()\n\n#define dpoll(a) q.front();q.pop_front()\n\n#define pollLast(a) q.back();q.pop_back()\n\n#define pollBack(a) q.back();q.pop_back()\n\ntemplate<class T> inline void fin(T s) { cout << s << endl, exit(0); }\n\n\n\ntemplate<class T> struct edge {\n\n  int from, to;\n\n  T cost;\n\n  int id;\n\n  int type;\n\n  edge(int f, int t, T c = 1, int id = -1, int ty = -1) : from(f), to(t), cost(c), id(id), type(ty) {}\n\n  bool operator<(const edge &b) const { return cost < b.cost; }\n\n  bool operator>(const edge &b) const { return cost > b.cost; }\n\n};\n\n\n\ntemplate<typename T> class graph {\n\nprotected:\n\n  vector<bool> _used;\n\npublic :\n\n  vector<vector<edge<T>>> g;\n\n  vector<edge<T>> edges;\n\n  int n, root = -1;\n\n  graph(int n) : n(n) { g.resize(n), _used.resize(n); }\n\n  void clear() { g.clear(), edges.clear(); }\n\n  void resize(int n) {\n\n    this->n = n;\n\n    g.resize(n);\n\n    _used.resize(n);\n\n  }\n\n  int size() { return g.size(); }\n\n  bool isleaf(int v) {\n\n    assert(root != -1);\n\n    return g[v].size() == 1 && g[v][0].from != root;\n\n  }\n\n  vector<edge<T> > &operator[](int i) { return g[i]; }\n\n  virtual void add(int from, int to, T cost, int ty) = 0;\n\n  virtual bool used(edge<T> &e) = 0;\n\n  virtual bool used(int id) = 0;\n\n  virtual void del(edge<T> &e) = 0;\n\n  virtual void del(int id) = 0;\n\n};\n\n\n\ntemplate<class T=int> class undigraph : public graph<T> {\n\npublic:\n\n  using graph<T>::g;\n\n  using graph<T>::n;\n\n  using graph<T>::edges;\n\n  using graph<T>::_used;\n\n  undigraph(int n) : graph<T>(n) {\n\n  }\n\n  void add(int f, int t, T cost = 1, int ty = -1) {\n\n    if (!(0 <= f && f < n && 0 <= t && t < n))ole();\n\n    int id = edges.size();\n\n    g[f].emplace_back(f, t, cost, id, ty);\n\n    g[t].emplace_back(t, f, cost, id + 1, ty);\n\n    edges.emplace_back(f, t, cost, id, ty);\n\n    edges.emplace_back(t, f, cost, id + 1, ty);\n\n  }\n\n  void add(edge<T> &e) {\n\n    int f = e.from, t = e.to, ty = e.type;\n\n    T cost = e.cost;\n\n    add(f, t, cost, ty);\n\n  }\n\n  bool used(edge<T> &e) { return _used[e.id]; }\n\n  bool used(int id) { return _used[id]; }\n\n  void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }\n\n  void del(int id) { _used[id] = _used[id ^ 1] = 1; }\n\n};\n\n\n\ntemplate<typename T =ll> class digraph : public graph<T> {\n\npublic:\n\n  using graph<T>::g;\n\n  using graph<T>::n;\n\n  using graph<T>::edges;\n\n  using graph<T>::_used;\n\n\n\n  digraph(int n) : graph<T>(n) {}\n\n  void add(int f, int t, T cost = 1, int ty = -1) {\n\n    if (!(0 <= f && f < n && 0 <= t && t < n))ole();\n\n    int id = edges.size();\n\n    g[f].emplace_back(f, t, cost, ty, id);\n\n    edges.emplace_back(f, t, cost, ty, id);\n\n  }\n\n  bool used(edge<T> &e) { return _used[e.id]; }\n\n  bool used(int id) { return _used[id]; }\n\n  void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }\n\n  void del(int id) { _used[id] = _used[id ^ 1] = 1; }\n\n};\n\n\n\ntemplate<class T> bool nibu(const graph<T> &g) {\n\n  UnionFind uf(g.n * 2);\n\n  for (auto &&e :g.edges)uf.unite(e.f, e.t + g.n), uf.unite(e.f + g.n, e.t);\n\n  return !uf.same(0, g.n);\n\n}\n\n\n\ntemplate<class T> vector<T> &dijkstra(const graph<T> &g, int s) {\n\n  if (!(0 <= s && s < g.n))ole();\n\n  T initValue = MAX(T);\n\n  vector<T> dis(g.n, initValue);\n\n  priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> q;\n\n  dis[s] = 0;\n\n  q.emplace(0, s);\n\n  while (q.size()) {\n\n    T nowc = q.top().F;\n\n    int i = q.top().S;\n\n    q.pop();\n\n    if (dis[i] != nowc)continue;\n\n    for (auto &&e  : g.g[i]) {\n\n      int to = e.to;\n\n      T cost = nowc + e.cost;\n\n      if (dis[to] > cost) {\n\n        dis[to] = cost;\n\n        q.emplace(dis[to], to);\n\n      }\n\n    }\n\n  }\n\n                                   \n\n  for (auto &&d :dis) if (d == initValue)d = -1;\n\n  return dis;\n\n}\n\n\n\n              \n\ntemplate<typename T> void remove(vector<T> &v, unsigned int i) { v.erase(v.begin() + i); }\n\n\n\ntemplate<typename T> void remove(vector<T> &v, unsigned int s, unsigned int e) {\n\n  v.erase(v.begin() + s, v.begin() + e);\n\n}\n\n\n\ntemplate<typename T> void removen(vector<T> &v, unsigned int s, unsigned int n) {\n\n  v.erase(v.begin() + s, v.begin() + s + n);\n\n}\n\n\n\ntemplate<typename T> void erase(vector<T> &v, unsigned int i) { v.erase(v.begin() + i); }\n\n\n\ntemplate<typename T> void erase(vector<T> &v, unsigned int s, unsigned int e) {\n\n  v.erase(v.begin() + s, v.begin() + e);\n\n}\n\n\n\ntemplate<typename T> void erasen(vector<T> &v, unsigned int s, unsigned int n) {\n\n  v.erase(v.begin() + s, v.begin() + s + n);\n\n}\n\n\n\ntemplate<typename T> void insert(vector<T> &v, unsigned int i, T t) { v.insert(v.begin() + i, t); }\n\n\n\ntemplate<typename T> void insert(vector<T> &v, unsigned int i, vector<T> list) {\n\n  for (auto &&va :list)v.insert(v.begin() + i++, va);\n\n}\n\n\n\ntemplate<typename T> void insert(vector<T> &v, unsigned int i, initializer_list<T> list) {\n\n  for (auto &&va :list)v.insert(v.begin() + i++, va);\n\n}\n\n\n\ntemplate<typename T> void insert(set<T> &v, vector<T> list) {\n\n  for (auto &&va :list)v.insert(va);\n\n}\n\n\n\ntemplate<typename T> void insert(set<T> &v, initializer_list<T> list) {\n\n  for (auto &&va :list)v.insert(va);\n\n}\n\n\n\nint mod(int a, int m) {\n\nreturn (a % m + m) % m;\n\n}\n\n\n\nll ma = numeric_limits<ll>::min();\n\nll mi = numeric_limits<ll>::max();\n\n\n\n                           \n\nbool topo(vi &res, digraph<int> g) {\n\n  int n = g.g.size();\n\n  vi nyu(n);\n\n  rep(i, n)for (auto &&e :g[i])nyu[e.to]++;\n\n  queue<int> st;\n\n  rep(i, n)if (nyu[i] == 0)st.push(i);\n\n  while (st.size()) {\n\n    int v = st.front();\n\n    st.pop();\n\n    res.pb(v);\n\n    fora(e, g[v]) if (--nyu[e.to] == 0)st.push(e.to);\n\n  }\n\n  return res.size() == n;\n\n}\n\n\n\n                                            \n\nbool topos(vi &res, digraph<int> g) {\n\n  int n = g.g.size();\n\n  vi nyu(n);\n\n  rep(i, n)for (auto &&e :g[i])nyu[e.to]++;\n\n  set<int> st;\n\n  rep(i, n)if (nyu[i] == 0)st.insert(i);\n\n  while (st.size()) {\n\n    int i = *st.begin();\n\n    st.erase(st.begin());\n\n    res.pb(i);\n\n    fora(e, g[i])if (--nyu[e.to] == 0)st.insert(e.to);\n\n  }\n\n  return res.size() == n;\n\n}\n\n\n\nvector<string> split(const string a, const char deli) {\n\n  string b = a + deli;\n\n  int l = 0, r = 0, n = b.size();\n\n  vector<string> res;\n\n  rep(i, n) {\n\n    if (b[i] == deli) {\n\n      r = i;\n\n      if (l < r)res.push_back(b.substr(l, r - l));\n\n      l = i + 1;\n\n    }\n\n  }\n\n  return res;\n\n}\n\n\n\nvector<string> split(const string a, const string deli) {\n\n  string b = a + deli;\n\n  int l = 0, r = 0, n = b.size(), dn = deli.size();\n\n  vector<string> res;\n\n  rep(i, n) {\n\n    if (i + dn <= n && b.substr(i, i + dn) == deli) {\n\n      r = i;\n\n      if (l < r)res.push_back(b.substr(l, r - l));\n\n      i += dn - 1;\n\n      l = i + 1;\n\n    }\n\n  }\n\n  return res;\n\n}\n\n\n\n\n\nint n, k, m, h, w, x, y, q;\n\nint cou;\n\n\n\nsigned main() {\n\n  str a, b, c;\n\n  cin >> n >> a >> b >> c;\n\n  rep(i, n) {\n\n    set<char> se;\n\n    se.insert(a[i]);\n\n    se.insert(b[i]);\n\n    se.insert(c[i]);\n\n    cou+=se.size()-1;\n\n  }\n\n  cout << cou << endl;\n\n  return 0;\n\n}\n\n\n","fast_code":"       \n\n\n\n               \n\n                               \n\n                                   \n\n                                                                               \n\n\n\n#include <bits/stdc++.h>\n\n\n\n             \n\n             \n\n             \n\n             \n\n             \n\n             \n\n             \n\n             \n\n             \n\n             \n\n             \n\n             \n\n             \n\n             \n\n\n\n                                                 \n\n#define use_pbds\n\n#ifdef use_pbds\n\n#include <ext/pb_ds/assoc_container.hpp>\n\n#include <ext/pb_ds/tree_policy.hpp>\n\ntemplate<class T, class U, class W, class X> auto count(__gnu_pbds::gp_hash_table<T, U, W> &a, X k) { return a.find(k) != a.end(); }\n\n#endif\n\n\n\nusing namespace std;\n\nusing namespace std::chrono;\n\n\n\n                  \n\n#ifndef _DEBUG\n\n#include <boost/multiprecision/cpp_int.hpp>\n\n#include <boost/multiprecision/cpp_dec_float.hpp>\n\nnamespace cmp = boost::multiprecision;\n\nusing cint = cmp :: cpp_int;\n\nusing bdou = cmp::cpp_dec_float_100;\n\n#endif\n\n#define ll long long\n\nusing sig_dou = double;\n\n\n\ntemplate<class T,class U> auto max(T a, U b){return a>b ? a: b;}\n\ntemplate<class T,class U> auto min(T a, U b){return a<b ? a: b;}\n\n\n\nnamespace helper {\n\ntemplate<class T>T s_decl2(const vector<T>& A){return (T)0;}\n\ntemplate<class T>T s_decl2(const vector<vector<T> >& A){return (T)0;}\n\ntemplate<class T>T s_decl2(const vector<vector<vector<T> > >& A){return (T)0;}\n\ntemplate<class T>T s_decl2(const vector<vector<vector<vector<T> > > >& A){return (T)0;}\n\ntemplate<class T>T s_decl2(const vector<vector<vector<vector<vector<T> > > > >& A){return (T)0;}\n\ntemplate<class T>T s_decl2(const vector<vector<vector<vector<vector<vector<T> > > > > >& A){return (T)0;}\n\n                                         \n\n#define decl2(a) decltype(helper::s_decl2(a))\n\n}\n\n\n\n#define int long long                                                                  \n\nauto start_time = system_clock::now();\n\nauto past_time = system_clock::now();\n\n\n\n#define debugName(VariableName) # VariableName\n\n                  \n\n#define over2(o1, o2, name, ...) name\n\n#define over3(o1, o2, o3, name, ...) name\n\n#define over4(o1, o2, o3, o4, name, ...) name\n\n#define over5(o1, o2, o3, o4, o5, name, ...) name\n\n#define over6(o1, o2, o3, o4, o5, o6, name, ...) name\n\n#define over7(o1, o2, o3, o4, o5, o6, o7, name, ...) name\n\n#define over8(o1, o2, o3, o4, o5, o6, o7, o8, name, ...) name\n\n#define over9(o1, o2, o3, o4, o5, o6, o7, o8, o9, name, ...) name\n\n#define over10(o1, o2, o3, o4, o5, o6, o7, o8, o9, o10, name, ...) name\n\n\n\n\n\n\n\n\n\n\n\n\n\n#ifdef _DEBUG\n\nstring message;\n\nstring res_mes;\n\n                    \n\n\n\n#ifdef use_debtor\n\n                                                                    \n\ntemplate<class T, class A = std::allocator<T>> struct debtor : std::vector<T, A> {\n\n  using std::vector<T, A>::vector;\n\n  template<class U> int deb_v(U a, int v) { return v; }\n\n  template<class U> int deb_v(debtor<U> &a, int v = 0) {        cerr << a.size() << \" \";        return deb_v(a.at(0), v + 1);    }\n\n  template<class U> void deb_o(U a) { cerr << a << \" \"; }\n\n  template<class U> void deb_o(debtor<U> &a) {        for (int i = 0; i < min((int) a.size(), 15ll); i++) { deb_o(a[i]); }        if ((int) a.size() > 15) { cerr << \"...\"; }        cerr << endl;    }\n\n  typename std::vector<T>::reference my_at(typename std::vector<T>::size_type n, vector<int> &ind) {        if (n < 0 || n >= (int) this->size()) {            int siz = (int) this->size();            cerr << \"vector size = \";            int dim = deb_v((*this));            cerr << endl;            ind.push_back(n);            cerr << \"out index at  \";            for (auto &&i: ind) {                cerr << i << \" \";            }            cerr << endl;            cerr << endl;            if (dim <= 2) { deb_o((*this)); }            exit(0);        }        return this->at(n);    }\n\n  typename std::vector<T>::reference operator[](typename std::vector<T>::size_type n) {        if (n < 0 || n >= (int) this->size()) {            int siz = (int) this->size();            cerr << \"vector size = \";            int dim = deb_v((*this));            cerr << endl;            cerr << \"out index at  \" << n << endl;            cerr << endl;            if (dim <= 2) { deb_o((*this)); }            exit(0);        }        return this->at(n);    }\n\n};\n\n#define vector debtor\n\n#endif\n\n#ifdef use_pbds\n\ntemplate<class T> struct my_pbds_tree {    set<T> s;    auto begin() { return s.begin(); }    auto end() { return s.end(); }    auto rbegin() { return s.rbegin(); }    auto rend() { return s.rend(); }    auto empty() { return s.empty(); }    auto size() { return s.size(); }    void clear() { s.clear(); }    template<class U> void insert(U v) { s.insert(v); }template<class U> void operator+=(U v) { insert(v); }    template<class F> auto erase(F v) { return s.erase(v); }    template<class U> auto find(U v) { return s.find(v); }    template<class U> auto lower_bound(U v) { return s.lower_bound(v); }    template<class U> auto upper_bound(U v) { return s.upper_bound(v); }    auto find_by_order(ll k) {        auto it = s.begin();        for (ll i = 0; i < k; i++)it++;        return it;    }    auto order_of_key(ll v) {        auto it = s.begin();        ll i=0;        for (;it != s.end() && *it <v ; i++)it++;        return i;    }};\n\n#define pbds(T) my_pbds_tree<T>\n\n#endif\n\n\n\n                             \n\n                                                           \n\ntemplate<class T, class U> struct my_unordered_map { unordered_map<T, U> m; my_unordered_map() {}; auto begin() { return m.begin(); } auto end() { return m.end(); } auto cbegin() { return m.cbegin(); } auto cend() { return m.cend(); } template<class V> auto erase(V v) { return m.erase(v); } void clear() { m.clear(); }                                                                      template<class V> auto find(V v) { return m.find(v); } template<class V> auto &operator[](V n) { return m[n]; }};\n\n#define unordered_map my_unordered_map\n\n#define umapi unordered_map<ll,ll>\n\n#define umapp unordered_map<P,ll>\n\n#define umapu unordered_map<uint64_t,ll>\n\n#define umapip unordered_map<ll,P>\n\ntemplate<class T, class U, class X> auto count(unordered_map<T, U> &a, X k) { return a.find(k) != a.end(); }\n\n#else\n\n#define endl '\\n'\n\n                              \n\n                       \n\n\n\n                                               \n\n                                                  \n\n#define pbds(U) __gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>\n\n\n\n#define umapi __gnu_pbds::gp_hash_table<ll,ll,xorshift>\n\n#define umapp __gnu_pbds::gp_hash_table<P,ll,xorshift>\n\n#define umapu __gnu_pbds::gp_hash_table<uint64_t,ll,xorshift>\n\n#define umapip __gnu_pbds::gp_hash_table<ll,P,xorshift>\n\n#endif\n\n\n\n\n\nstruct xorshift {\n\n  static uint64_t splitmix64(uint64_t x) {        x += 0x9e3779b97f4a7c15;        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;        return x ^ (x >> 31);    }\n\n  size_t operator()(uint64_t x) const {        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();        return splitmix64(x + FIXED_RANDOM);    }\n\n  size_t operator()(std::pair<ll, ll> x) const {        ll v = ((x.first) << 32) | x.second;        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();        return splitmix64(v + FIXED_RANDOM);    }\n\n};\n\n#ifdef use_pbds\n\ntemplate<class U, class L> void operator+=(__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> &s, L v) { s.insert(v); }\n\n#endif\n\n              \n\n#define ws ws_\n\n\n\ntemplate<class A, class B, class C> struct T2 { A f;B s;C t;T2() { f = 0, s = 0, t = 0; }T2(A f, B s, C t) : f(f), s(s), t(t) {}bool operator<(const T2 &r) const { return f != r.f ? f < r.f : s != r.s ? s < r.s : t < r.t;                                                                                       } bool operator>(const T2 &r) const { return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t;                                                                                      } bool operator==(const T2 &r) const { return f == r.f && s == r.s && t == r.t; } bool operator!=(const T2 &r) const { return f != r.f || s != r.s || t != r.t; }};\n\ntemplate<class A, class B, class C, class D> struct F2 {    A a;    B b;    C c;    D d;    F2() { a = 0, b = 0, c = 0, d = 0; }    F2(A a, B b, C c, D d) : a(a), b(b), c(c), d(d) {}    bool operator<(const F2 &r) const { return a != r.a ? a < r.a : b != r.b ? b < r.b : c != r.c ? c < r.c : d < r.d;                                                                                              }    bool operator>(const F2 &r) const { return a != r.a ? a > r.a : b != r.b ? b > r.b : c != r.c ? c > r.c : d > r.d;                                                                                              }    bool operator==(const F2 &r) const { return a == r.a && b == r.b && c == r.c && d == r.d; }    bool operator!=(const F2 &r) const { return a != r.a || b != r.b || c != r.c || d != r.d; }    ll operator[](ll i) {        assert(i < 4);        return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;    }};\n\ntypedef T2<ll, ll, ll> T;\n\ntypedef F2<ll, ll, ll, ll> F;\n\nT mt(ll a, ll b, ll c) { return T(a, b, c); }\n\nF mf(ll a, ll b, ll c, ll d) { return F(a, b, c, d); }\n\n\n\n\n\ntemplate<class T, class U> bool chma(T &a, const U &b) {    if (a < b) {        a = b;        return true;    }    return false;}\n\ntemplate<class T, class U> bool chmi(T &a, const U &b) {    if (b < a) {        a = b;        return true;    }    return false;}\n\n\n\n                          \n\n                    \n\nvoid pr_set_lr(int &l, int &r, int n) {                 if (!(~r)) {        if(!(~l)){            l = 0;            r = n;        }else {            r = l;            l = 0;        }    }}\n\n                                \n\n                                                  \n\n#define double_big\n\n\n\n#ifdef double_big\n\n#define double long double\n\n#define pow powl\n\n#endif\n\nusing dou = double;\n\ntemplate<class T> T MAX() { return numeric_limits<T>::max(); }\n\ntemplate<class T> T MIN() { return numeric_limits<T>::min(); }\n\nconstexpr ll inf = (ll) 1e9 + 100;\n\nconstexpr ll linf = (ll) 1e18 + 100;\n\nconstexpr dou dinf = (dou) linf * linf;\n\nconstexpr char infc = '{';\n\nconst string infs = \"{\";\n\n\n\ntemplate<class T> T INF(){return MAX<T>() / 2;}\n\ntemplate<> signed INF(){return inf;}\n\ntemplate<> ll INF(){return linf;}\n\ntemplate<> double INF(){return dinf;}\n\ntemplate<> char INF(){return infc;}\n\ntemplate<> string INF(){return infs;}\n\n\n\nconst double eps = 1e-9;\n\n\n\n                    \n\n#ifdef use_epsdou\n\n                             \n\nstruct epsdou {    double v;    epsdou(double v = 0) : v(v) {}    template<class T> epsdou &operator+=(T b) {        v += (double) b;        return (*this);    }    template<class T> epsdou &operator-=(T b) {        v -= (double) b;        return (*this);    }    template<class T> epsdou &operator*=(T b) {        v *= (double) b;        return (*this);    }    template<class T> epsdou &operator/=(T b) {        v /= (double) b;        return (*this);    }    epsdou operator+(epsdou b) { return v + (double) b; }    epsdou operator-(epsdou b) { return v - (double) b; }    epsdou operator*(epsdou b) { return v * (double) b; }    epsdou operator/(epsdou b) { return v / (double) b; }    epsdou operator-() const { return epsdou(-v); }    template<class T> bool operator<(T b) { return v < (double) b; }    template<class T> bool operator>(T b) {auto r = (double)b;        return v > (double) b; }    template<class T> bool operator==(T b) { return fabs(v - (double) b) <= eps; }    template<class T> bool operator<=(T b) { return v < (double) b || fabs(v - b) <= eps; }    template<class T> bool operator>=(T b) { return v > (double) b || fabs(v - b) <= eps; }    operator double() { return v; }};\n\ntemplate<>epsdou MAX(){return MAX<double>();}\n\ntemplate<>epsdou MIN(){return MIN<double>();}\n\n                                        \n\nbool operator<(const epsdou &a, const epsdou &b) {return a.v < b.v;}\n\nbool operator>(const epsdou &a, const epsdou &b) {return a.v > b.v;}\n\nistream &operator>>(istream &iss, epsdou &a) {iss >> a.v;return iss;}\n\nostream &operator<<(ostream &os, epsdou &a) {os << a.v;return os;}\n\n#define eps_conr_t(o) template<class T> epsdou operator o(T a, epsdou b) {return (dou) a o b.v;}\n\n#define eps_conl_t(o) template<class T> epsdou operator o(epsdou a, T b) {return a.v o (dou) b;}\n\neps_conl_t(+)eps_conl_t(-)eps_conl_t(*)eps_conl_t(/)eps_conr_t(+)eps_conr_t(-)eps_conr_t(*)eps_conr_t(/)\n\n                                                                     \n\n                                                                     \n\n                                                                     \n\n                                                                     \n\n#undef double\n\n#define double epsdou\n\n#undef dou\n\n#define dou epsdou\n\n#endif\n\n\n\n\n\n#define ull unsigned long long\n\n        using itn = int;\n\nusing str = string;\n\nusing bo= bool;\n\n#define au auto\n\nusing P = pair<ll, ll>;\n\n\n\n#define fi first\n\n#define se second\n\n#define beg begin\n\n#define rbeg rbegin\n\n#define con continue\n\n#define bre break\n\n#define brk break\n\n#define is ==\n\n#define el else\n\n#define elf else if\n\n#define upd update\n\n#define sstream stringstream\n\n\n\n#define maxq 1\n\n#define minq -1\n\n\n\n#define ZERO(a) memset(a,0,sizeof(a))\n\n#define MINUS(a) memset(a,0xff,sizeof(a))\n\n#define MALLOC(type, len) (type*)malloc((len) * sizeof(type))\n\n#define lam1(ret) [&](auto& v){return ret;}\n\n#define lam2(v, ret) [&](auto& v){return ret;}\n\n#define lam(...) over2(__VA_ARGS__,lam2,lam1)(__VA_ARGS__)\n\n#define lamr(right) [&](auto& p){return p right;}\n\n#define unique(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\n\n\n                                 \n\nusing vi = vector<ll>;\n\nusing vb = vector<bool>;\n\nusing vs = vector<string>;\n\nusing vd = vector<double>;\n\nusing vc = vector<char>;\n\nusing vp = vector<P>;\n\nusing vt = vector<T>;\n\n\n\n                  \n\n#define vvt0(t) vector<vector<t>>\n\n#define vvt1(t, a) vector<vector<t>>a\n\n#define vvt2(t, a, b) vector<vector<t>>a(b)\n\n#define vvt3(t, a, b, c) vector<vector<t>> a(b,vector<t>(c))\n\n#define vvt4(t, a, b, c, d) vector<vector<t>> a(b,vector<t>(c,d))\n\n\n\n#define vvi(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(ll,__VA_ARGS__)\n\n#define vvb(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(bool,__VA_ARGS__)\n\n#define vvs(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(string,__VA_ARGS__)\n\n#define vvd(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(double,__VA_ARGS__)\n\n#define vvc(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(char,__VA_ARGS__)\n\n#define vvp(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(P,__VA_ARGS__)\n\n#define vvt(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(T,__VA_ARGS__)\n\n#define vv(type, ...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(type,__VA_ARGS__)\n\n\n\ntemplate<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }\n\ntemplate<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }\n\n#define vni(name, ...) auto name = make_v<ll>(__VA_ARGS__)\n\n#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)\n\n#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)\n\n#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)\n\n#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)\n\n#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)\n\n#define vn(type, name, ...) auto name = make_v<type>(__VA_ARGS__)\n\n\n\n#define PQ priority_queue<ll, vector<ll>, greater<ll> >\n\n#define tos to_string\n\nusing mapi = map<ll, ll>;\n\nusing mapp = map<P, ll>;\n\nusing mapd = map<dou, ll>;\n\nusing mapc = map<char, ll>;\n\nusing maps = map<str, ll>;\n\nusing seti = set<ll>;\n\nusing setp = set<P>;\n\nusing setd = set<dou>;\n\nusing setc = set<char>;\n\nusing sets = set<str>;\n\nusing qui = queue<ll>;\n\n#define uset unordered_set\n\n#define useti unordered_set<ll,xorshift>\n\n#define mset multiset\n\n#define mseti multiset<ll>\n\n#define umap unordered_map\n\n#define mmap multimap\n\n                                                               \n\nint index_, v1_, v2_, v3_;\n\n\n\n                                      \n\n                                                                                                   \n\ntemplate<class T> struct pq {\n\n  priority_queue<T, vector<T>, greater<T> > q;                    T su = 0;\n\n  int max_size;\n\n  pq(int max_size=1e9):max_size(max_size){}\n\n  void clear() {        q = priority_queue<T, vector<T>, greater<T> >();        su = 0;    }\n\n  void operator+=(T v) {        su += v;        q.push(v);        if (sz(q) > max_size)pop();    }\n\n  T sum() { return su; }\n\n  T top() { return q.top(); }\n\n  void pop() {        su -= q.top();        q.pop();    }\n\n  T poll() {        T ret = q.top();        su -= ret;        q.pop();        return ret;    }\n\n  ll size() { return q.size(); }\n\n};\n\ntemplate<class T> struct pqg {\n\n  priority_queue<T> q;                    T su = 0;\n\n  int max_size;\n\n  pqg(int max_size=1e9):max_size(max_size){}\n\n  void clear() {        q = priority_queue<T>();        su = 0;    }\n\n  void operator+=(T v) {        su += v;        q.push(v);        if(sz(q) > max_size)pop();    }\n\n  T sum() { return su; }\n\n  T top() { return q.top(); }\n\n  void pop() {su -= q.top();q.pop();}\n\n  T poll() {        T ret = q.top();        su -= ret;        q.pop();        return ret;    }\n\n  ll size() { return q.size(); }\n\n};\n\n#define pqi pq<ll>\n\n#define pqgi pqg<ll>\n\n                        \n\n                                 \n\n\n\n#define rep1(n) for(ll rep1i = 0,rep1lim=n; rep1i < rep1lim ; ++rep1i)\n\n#define rep2(i, n) for(ll i = 0,rep2lim=n; i < rep2lim ; ++i)\n\n#define rep3(i, m, n) for(ll i = m,rep3lim=n; i < rep3lim ; ++i)\n\n#define rep4(i, m, n, ad) for(ll i = m,rep4lim=n; i < rep4lim ; i+= ad)\n\n                  \n\n#define rer2(i, n) for(ll i = n; i >= 0 ; i--)\n\n#define rer3(i, m, n) for(ll i = m,rer3lim=n; i >= rer3lim ; i--)\n\n#define rer4(i, m, n, dec) for(ll i = m,rer4lim=n; i >= rer4lim ; i-=dec)\n\n                                                                                \n\n#define nex_ind1(i) i++\n\n#define nex_ind2(i, j, J) i = (j + 1 == J) ? i + 1 : i, j = (j + 1 == J ? 0 : j + 1)\n\n#define nex_ind3(i, j, k, J, K)i = (j + 1 == J && k + 1 == K) ? i + 1 : i, j = (k + 1 == K) ? (j + 1 == J ? 0 : j + 1) : j, k = (k + 1 == K ? 0 : k + 1)\n\n#define nex_ind4(i, j, k, l, J, K, L) i = (j + 1 == J && k + 1 == K && l + 1 == L) ? i + 1 : i, j = (k + 1 == K && l + 1 == L) ? (j + 1 == J ? 0 : j + 1) : j, k = (l + 1 == L ?(k + 1 == K ? 0 : k + 1) : k), l = l + 1 == L ? 0 : l + 1\n\n#define nex_ind5(i, j, k, l, m, J, K, L, M) i = (j + 1 == J && k + 1 == K && l + 1 == L && m + 1 == M) ? i + 1 : i, j = (k + 1 == K && l + 1 == L && m + 1 == M) ? (j + 1 == J ? 0 : j + 1) : j, k = (l + 1 == L && m + 1 == M ?(k + 1 == K ? 0 : k + 1) : k), l =  m + 1 == M ? l+1 == L ? 0 : l+1 : l,  m = m + 1 == M ? 0 : m + 1\n\n\n\n#define repss2(i, I) for (int i = 0; i < I; i++)\n\n#define repss4(i, j, I, J) for (int i = (J ? 0 : I), j = 0; i < I; nex_ind2(i, j, J))\n\n#define repss6(i, j, k, I, J, K) for (int i = (J && K ? 0 : I), j = 0, k = 0; i < I; nex_ind3(i, j, k, J, K))\n\n#define repss8(i, j, k, l, I, J, K, L) for (int i = (J && K && L ? 0 : I), j = 0, k = 0, l = 0; i < I; nex_ind4(i, j, k, l, J, K, L))\n\n#define repss10(i, j, k, l, m, I, J, K, L, M)for (int i = (J && K && L && M ? 0 : I), j = 0, k = 0, l = 0, m = 0; i < I; nex_ind5(i, j, k, l, m, J, K, L, M))\n\n\n\n                          \n\n#define reps2(i, n) repss2(i, n)\n\n#define reps3(i, j, n) repss4(i, j, n, n)\n\n#define reps4(i, j, k, n) repss6(i, j, k, n, n, n)\n\n#define reps5(i, j, k, l, n) repss8(i, j, k, l, n, n, n, n)\n\n\n\ntemplate<class T> void nex_repv2(int &i, int &j, int &I, int &J, vector<vector<T>> &s) {    while (1) {        j++;        if (j >= J) {            j = 0;            i++;            if (i < I) { J = (int) s[i].size(); }        }        if (i >= I || J) return;    }}\n\ntemplate<class T> void nex_repv3(int &i, int &j, int &k, int &I, int &J, int &K, vector<vector<vector<T>>> &s) {    while (1) {        k++;        if (k >= K) {            k = 0;            j++;            if (j >= J) {                j = 0;                i++;                if (i >= I)return;            }        }        J = (int) s[i].size();        K = (int) s[i][j].size();        if (J && K) return;    }}\n\n\n\n#define repv_2(i, a) repss2(i, sz(a))\n\n                                   \n\n                                            \n\n#define repv_3(i, j, a) for (int repvI = (int)a.size(), repvJ = (int)a[0].size(), i = 0, j = 0; i < repvI; nex_repv2(i,j,repvI,repvJ,a))\n\n                                                                                           \n\n#define repv_4(i, j, k, a) for (int repvI = (int)a.size(), repvJ = (int)a[0].size(), repvK =(int)a[0][0].size(), i = 0, j = 0, k=0; i < repvI; nex_repv3(i,j,k,repvI,repvJ,repvK,a))\n\n#define repv_5(i, j, k, l, a) repss8(i, j, k, l, sz(a), sz(a[0]), sz(a[0][0]), sz(a[0][0][0]))\n\n#define repv_6(i, j, k, l, m, a) repss10(i, j, k, l, m, sz(a), sz(a[0]), sz(a[0][0]), sz(a[0][0][0]), sz(a[0][0][0][0]))\n\n\n\ntemplate<typename T> struct has_rbegin_rend { private:template<typename U> static auto check(U &&obj) -> decltype(std::rbegin(obj), std::rend(obj), std::true_type{});static std::false_type check(...);public:static constexpr bool value = decltype(check(std::declval<T>()))::value; };\n\ntemplate<typename T> constexpr bool has_rbegin_rend_v = has_rbegin_rend<T>::value;\n\ntemplate<typename Iterator> class Range { public:Range(Iterator &&begin, Iterator &&end) noexcept: m_begin(std::forward<Iterator>(begin)), m_end(std::forward<Iterator>(end)) {}Iterator begin() const noexcept { return m_begin; }Iterator end() const noexcept { return m_end; }private:const Iterator m_begin;const Iterator m_end; };\n\ntemplate<typename Iterator> static inline Range<Iterator> makeRange(Iterator &&begin, Iterator &&end) noexcept { return Range<Iterator>{std::forward<Iterator>(begin), std::forward<Iterator>(end)}; }\n\ntemplate<typename T> static inline decltype(auto) makeReversedRange(const std::initializer_list<T> &iniList) noexcept { return makeRange(std::rbegin(iniList), std::rend(iniList)); }\n\ntemplate<typename T, typename std::enable_if_t<has_rbegin_rend_v<T>, std::nullptr_t> = nullptr> static inline decltype(auto) makeReversedRange(T &&c) noexcept { return makeRange(std::rbegin(c), std::rend(c)); }                                                                                                                     template<typename T, typename std::enable_if<!has_rbegin_rend<T>::value, std::nullptr_t>::type = nullptr> static inline void makeReversedRange(T &&) noexcept { static_assert(has_rbegin_rend<T>::value, \"Specified argument doesn't have reverse iterator.\"); }\n\n\n\n                 \n\n\n\n#define form1(st) for (auto &&form_it = st.begin(); form_it != st.end(); ++form_it)\n\n#define form3(k, v, st) for (auto &&form_it = st.begin(); form_it != st.end(); ++form_it)\n\n#define form4(k, v, st, r) for (auto &&form_it = st.begin(); form_it != st.end() && (*form_it).fi < r; ++form_it)\n\n#define form5(k, v, st, l, r) for (auto &&form_it = st.lower_bound(l); form_it != st.end() && (*form_it).fi < r; ++form_it)\n\n\n\n#define forrm1(st) for (auto &&forrm_it = st.rbegin(); forrm_it != st.rend(); ++forrm_it)\n\n#define forrm3(k, v, st) for (auto &&forrm_it = st.rbegin(); forrm_it != st.rend(); ++forrm_it)\n\n\n\n                 \n\n                                     \n\n#define fors1(st) for (auto &&it = st.begin(); it != st.end(); )\n\n#define fors2(v, st) for (auto &&it = st.begin(); it != st.end(); )\n\n#define fors3(v, st, r) for (auto &&it = st.begin(); it != st.end() && (*it) < r; )\n\n#define fors4(v, st, l, r) for (auto &&it = st.lower_bound(l); it != st.end() && (*it) < r; )\n\n\n\n#ifdef use_for\n\n#define forslr3(st, a, b) for (auto &&forslr_it = st.begin(); forslr_it != st.end(); ++forslr_it)\n\n#define forslr4(v, st, a, b) for (auto &&forslr_it = st.begin(); forslr_it != st.end(); ++forslr_it)\n\n#define forslr5(v, st, r, a, b) for (auto &&forslr_it = st.begin(); forslr_it != st.end() && (*forslr_it) < r; ++forslr_it)\n\n#define forslr6(v, st, l, r, a, b) for (auto &&forslr_it = st.lower_bound(l); forslr_it != st.end() && (*forslr_it) < r; ++forslr_it)\n\n#endif\n\n\n\n#define fora_init_2(a, A) ;\n\n#define fora_init_3(fora_i, a, A) auto &&a = A[fora_i];\n\n#define fora_init_4(a, b, A, B) auto &&a = A[fora_i]; auto &&b = B[fora_i];\n\n#define fora_init_5(fora_i, a, b, A, B) auto &&a = A[fora_i]; auto &&b = B[fora_i];\n\n#define fora_init_6(a, b, c, A, B, C) auto &&a = A[fora_i]; auto &&b = B[fora_i]; auto &&c = C[fora_i];\n\n#define fora_init_7(fora_i, a, b, c, A, B, C) auto &&a = A[fora_i]; auto &&b = B[fora_i]; auto &&c = C[fora_i];\n\n#define fora_init_8(a, b, c, d, A, B, C, D) auto &&a = A[fora_i]; auto &&b = B[fora_i]; auto &&c = C[fora_i]; auto && d = D[fora_i];\n\n#define fora_init_9(fora_i, a, b, c, d, A, B, C, D) auto &&a = A[fora_i]; auto &&b = B[fora_i]; auto &&c = C[fora_i]; auto && d = D[fora_i];\n\n#define fora_init(...) over9(__VA_ARGS__,fora_init_9, fora_init_8, fora_init_7, fora_init_6, fora_init_5, fora_init_4, fora_init_3, fora_init_2)(__VA_ARGS__)\n\n\n\n#ifdef use_for\n\n#define forr_init_2(a, A) auto &&a = A[forr_i];\n\n#define forr_init_3(forr_i, a, A) auto &&a = A[forr_i];\n\n#define forr_init_4(a, b, A, B) auto &&a = A[forr_i]; auto &&b = B[forr_i];\n\n#define forr_init_5(forr_i, a, b, A, B) auto &&a = A[forr_i]; auto &&b = B[forr_i];\n\n#define forr_init_6(a, b, c, A, B, C) auto &&a = A[forr_i]; auto &&b = B[forr_i]; auto &&c = C[forr_i];\n\n#define forr_init_7(forr_i, a, b, c, A, B, C) auto &&a = A[forr_i]; auto &&b = B[forr_i]; auto &&c = C[forr_i];\n\n#define forr_init_8(a, b, c, d, A, B, C, D) auto &&a = A[forr_i]; auto &&b = B[forr_i]; auto &&c = C[forr_i]; auto && d = D[forr_i];\n\n#define forr_init_9(forr_i, a, b, c, d, A, B, C, D) auto &&a = A[forr_i]; auto &&b = B[forr_i]; auto &&c = C[forr_i]; auto && d = D[forr_i];\n\n#define forr_init(...) over9(__VA_ARGS__, forr_init_9, forr_init_8, forr_init_7, forr_init_6, forr_init_5, forr_init_4, forr_init_3, forr_init_2)(__VA_ARGS__)\n\n\n\n#define forp_init3(k, v, S) auto &&k = S[forp_i].first;auto &&v = S[forp_i].second;\n\n#define forp_init4(forp_i, k, v, S) auto &&k = S[forp_i].first;auto &&v = S[forp_i].second;\n\n#define forp_init(...) over4(__VA_ARGS__,forp_init4,forp_init3,forp_init2,forp_init1)(__VA_ARGS__)\n\n\n\n#define form_init(k, v, ...) auto &&k = (*form_it).fi;auto &&v = (*form_it).se;\n\n#define forrm_init(k, v, ...) auto &&k = (*forrm_it).fi;auto &&v = (*forrm_it).se;\n\n#endif\n\n#define fors_init(v, ...) auto &&v = (*it);\n\n\n\n#ifdef use_for\n\n#define forlr_init(a, A, ngl, ngr) auto a = A[forlr_i]; auto prev = forlr_i ? A[forlr_i-1] : ngl;auto next = forlr_i+1< rep2lim? A[forlr_i+1] : ngr;\n\n#define forslr_init4(a, A, ngl, ngr) auto a = (*forslr_it); auto prev = (forslr_it!=A.begin())? (*std::prev(forslr_it)) : ngl;auto next = (forslr_it!=std::prev(A.end()))? (*std::next(forslr_it)) : ngr;\n\n#define forslr_init5(a, A, r, ngl, ngr) auto a = (*forslr_it); auto prev = (forslr_it!=A.begin())? (*std::prev(forslr_it)) : ngl;auto next = (forslr_it!=std::prev(A.end()))? (*std::next(forslr_it)) : ngr;\n\n#define forslr_init6(a, A, l, r, ngl, ngr) auto a = (*forslr_it); auto prev = (forslr_it!=A.begin())? (*std::prev(forslr_it)) : ngl;auto next = (forslr_it!=std::prev(A.end()))? (*std::next(forslr_it)) : ngr;\n\n#define forslr_init(...)  over6(__VA_ARGS__,forslr_init6,forslr_init5,forslr_init4)(__VA_ARGS__);\n\n#endif\n\n\n\n#define fora_2(a, A) for(auto&& a : A)\n\n#define fora_3(fora_i, a, A) rep(fora_i, sz(A))\n\n#define fora_4(a, b, A, B) rep(fora_i, sz(A))\n\n#define fora_5(fora_i, a, b, A, B) rep(fora_i, sz(A))\n\n#define fora_6(a, b, c, A, B, C) rep(fora_i, sz(A))\n\n#define fora_7(fora_i, a, b, c, A, B, C) rep(fora_i, sz(A))\n\n#define fora_8(a, b, c, d, A, B, C, D) rep(fora_i, sz(A))\n\n#define fora_9(fora_i, a, b, c, d, A, B, C, D) rep(fora_i, sz(A))\n\n\n\n#ifdef use_for\n\n#define forr_2(a, A) rer(forr_i, sz(A)-1)\n\n#define forr_3(forr_i, a, A) rer(forr_i, sz(A)-1)\n\n#define forr_4(a, b, A, B) rer(forr_i, sz(A)-1)\n\n#define forr_5(forr_i, a, b, A, B) rer(forr_i, sz(A)-1)\n\n#define forr_6(a, b, c, A, B, C) rer(forr_i, sz(A)-1)\n\n#define forr_7(forr_i, a, b, c, A, B, C) rer(forr_i, sz(A)-1)\n\n#define forr_8(a, b, c, d, A, B, C, D) rer(forr_i, sz(A)-1)\n\n#define forr_9(forr_i, a, b, c, d, A, B, C, D) rer(forr_i, sz(A)-1)\n\n#endif\n\n                                 \n\n\n\n                                               \n\n#define rep(...) over4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n\n#define rer(...) over4(__VA_ARGS__,rer4,rer3,rer2,)(__VA_ARGS__)\n\n               \n\n#define repc(i, m, n) for(char i = m,repc3lim=n; i < repc3lim ; ++i)\n\n                          \n\n#define reps(...) over5(__VA_ARGS__,reps5,reps4,reps3,reps2,)(__VA_ARGS__)\n\n#define repss(...) over10(__VA_ARGS__, repss10, a, repss8, a, repss6, a, repss4, a, repss2) (__VA_ARGS__)\n\n                               \n\n               \n\n#define repv(...) over6(__VA_ARGS__,repv_6,repv_5,repv_4,repv_3,repv_2,)(__VA_ARGS__)\n\n#define rerv(i, A) for (int i = sz(A)-1; i >= 0 ; i--)\n\n                      \n\n#define repv1(a) repv(i, a)\n\n#define repv2(a) repv(i, j, a)\n\n#define repv3(a) repv(i, j, k, a)\n\n#define repv4(a) repv(i, j, k, l, a)\n\n\n\n#define fora(...) over9(__VA_ARGS__, fora_9, fora_8, fora_7, fora_6, fora_5, fora_4, fora_3, fora_2)(__VA_ARGS__)\n\n#define forr(...) over9(__VA_ARGS__, forr_9, forr_8, forr_7, forr_6, forr_5, forr_4, forr_3, forr_2)(__VA_ARGS__)\n\n                   \n\n\n\n#define forar_init(v, rv, A) auto &&v = A[forar_i]; auto && rv = A[forar_i+1];\n\n#define forar(v, rv, A) rep(forar_i, sz(A) - 1)\n\n\n\n                                                         \n\n                       \n\n#ifdef use_for\n\ntemplate<class U> vector<U> to1d(vector<U> &a) { return a; }template<class U> auto to1d(vector<vector<U>> &a) {    vector<U> res;    for (auto &&a1 : a)for (auto &&a2 : a1)res.push_back(a2);    return res;}template<class U> vector<U> to1d(vector<vector<vector<U>>> &a) {    vector<U> res;    for (auto &&a1 : a)for (auto &&a2 : a1)for (auto &&a3 : a2) res.push_back(a3);    return res;}template<class U> vector<U> to1d(vector<vector<vector<vector<U>>>> &a) {    vector<U> res;    for (auto &&a1 : a)for (auto &&a2 : a1)for (auto &&a3 : a2) for (auto &&a4 : a3)res.push_back(a4);    return res;}template<class U> vector<U> to1d(vector<vector<vector<vector<vector<U>>>>> &a) {    vector<U> res;    for (auto &&a1 : a)for (auto &&a2 : a1)for (auto &&a3 : a2) for (auto &&a4 : a3)for (auto &&a5 : a4)res.push_back(a5);    return res;}template<class U> vector<U> to1d(vector<vector<vector<vector<vector<vector<U>>>>>> &a) {    vector<U> res;    for (auto &&a1 : a)for (auto &&a2 : a1)for (auto &&a3 : a2) for (auto &&a4 : a3)for (auto &&a5 : a4)for (auto &&a6 : a5)res.push_back(a6);    return res;}\n\n#define forv(a, b) for(auto a : to1d(b))\n\n                                            \n\n#define ring(i, s, len) for (int i = s, prev = (s == 0) ? len - 1 : s - 1, next = (s == len - 1) ? 0 : s + 1, cou = 0; cou < len; cou++, prev = i, i = next, next = (next == len - 1) ? 0 : next + 1)\n\n                       \n\n#define ringv(v, d) index_=0;for (auto prev = d[sz(d)-1],next= (int)d.size()>1?d[1]:d[0],v = d[0]; index_ < sz(d); index_++, prev = v, v = next, next = (index_>=sz(d)-1?d[0]:d[index_+1]))\n\n                                                 \n\n#define forlr(v, d, banpei_l, banpei_r) rep(forlr_i,sz(d))\n\n#endif\n\n\n\n#define form(...) over5(__VA_ARGS__,form5,form4,form3,form2,form1)(__VA_ARGS__)\n\n#define forrm(...) over5(__VA_ARGS__,forrm5,forrm4,forrm3,forrm2,forrm1)(__VA_ARGS__)\n\n#define fors(...) over4(__VA_ARGS__,fors4,fors3,fors2,fors1)(__VA_ARGS__)\n\n#define forslr(...) over6(__VA_ARGS__,forslr6,forslr5,forslr4,forslr3)(__VA_ARGS__)\n\n#define forp3(k, v, st)  rep(forp_i,sz(st))\n\n#define forp4(forp_i, k, v, st) rep(forp_i,sz(st))\n\n#define forp(...) over4(__VA_ARGS__,forp4,forp3)(__VA_ARGS__)\n\n\n\n\n\n                  \n\n#define k3 1010\n\n#define k4 10101\n\n#define k5 101010\n\n#define k6 1010101\n\n#define k7 10101010\n\n\n\nconst double PI = 3.1415926535897932384626433832795029L;\n\n\n\n                              \n\n#define arsz(a) (sizeof(a)/sizeof(a[0]))\n\n#define sz(a) ((ll)(a).size())\n\n#define mp make_pair\n\n#define pb pop_back\n\n#define pf push_front\n\n#define eb emplace_back\n\n#define all(a) (a).begin(),(a).end()\n\n#define rall(a) (a).rbegin(),(a).rend()\n\n\n\nconstexpr bool ev(ll a) { return !(a & 1); }\n\nconstexpr bool od(ll a) { return (a & 1); }\n\n                                                 \n\n\n\n                                                                           \n\nnamespace std {\n\ntemplate<> class hash<std::pair<signed, signed>> { public:size_t operator()(const std::pair<signed, signed> &x) const { return hash<ll>()(((ll) x.first << 32) | x.second); }};\n\ntemplate<> class hash<std::pair<ll, ll>> { public:                                                                                                             size_t operator()(const std::pair<ll, ll> &x) const { return hash<ll>()(((ll) x.first << 32) | x.second); }};\n\n}\n\n                  \n\nistream &operator>>(istream &iss, P &a) {    iss >> a.first >> a.second;    return iss;}template<typename T> istream &operator>>(istream &iss, vector<T> &vec_) {    for (T &x: vec_) iss >> x;    return iss;}template<class T, class U> ostream &operator<<(ostream &os, pair<T, U> p) {    os << p.fi << \" \" << p.se;    return os;}ostream &operator<<(ostream &os, T p) {    os << p.f << \" \" << p.s << \" \" << p.t;    return os;}ostream &operator<<(ostream &os, F p) {    os << p.a << \" \" << p.b << \" \" << p.c << \" \" << p.d;    return os;}template<typename T> ostream &operator<<(ostream &os, vector<T> &vec_) {    for (ll i = 0; i < vec_.size(); ++i)os << vec_[i] << (i + 1 == vec_.size() ? \"\" : \" \");    return os;}template<typename T> ostream &operator<<(ostream &os, vector<vector<T>> &vec_) {    for (ll i = 0; i < vec_.size(); ++i) {        for (ll j = 0; j < vec_[i].size(); ++j) { os << vec_[i][j] << \" \"; }        os << endl;    }    return os;}template<typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &m) {    os << endl;    for (auto &&v:m) os << v << endl;    return os;}template<class T> ostream &operator<<(ostream &os, set<T> s) {    fora(v, s) { os << v << \" \"; }    return os;}template<class T> ostream &operator<<(ostream &os, mset<T> s) {    fora(v, s) { os << v << \" \"; }    return os;}template<class T> ostream &operator<<(ostream &os, deque<T> a) {    fora(v, a)os << v << \" \";    return os;}ostream &operator<<(ostream &os, vector<vector<char>> &vec_) {    rep(h, sz(vec_)) {        rep(w, sz(vec_[0])) { os << vec_[h][w]; }        os << endl;    }    return os;}\n\n                                                                                                                   \n\ntemplate<typename W, typename H> void resize(W &vec_, const H head) { vec_.resize(head); }\n\ntemplate<typename W, typename H, typename ... T> void resize(W &vec_, const H &head, const T ... tail) {vec_.resize(head);for (auto &v: vec_)resize(v, tail...);}\n\n#define use_for_each                                                                                             \n\n#ifdef use_for_each\n\ntemplate<typename T, typename F> bool all_of2(T &v, F f) { return f(v); }\n\ntemplate<typename T, typename F> bool all_of2(const vector<T> &v, F f) {rep(i, sz(v)) { if (!all_of2(v[i], f))return false; }return true;}\n\ntemplate<typename T, typename F> bool any_of2(T &v, F f) { return f(v); }\n\ntemplate<typename T, typename F> bool any_of2(const vector<T> &v, F f) {    rep(i, sz(v)) { if (any_of2(v[i], f))return true; }    return false;}\n\ntemplate<typename T, typename F> bool none_of2(T &v, F f) { return f(v); }\n\ntemplate<typename T, typename F> bool none_of2(const vector<T> &v, F f) {    rep(i, sz(v)) { if (none_of2(v[i], f))return false; }    return true;}\n\ntemplate<typename T, typename F> bool find_if2(T &v, F f) { return f(v); }\n\ntemplate<typename T, typename F> ll find_if2(const vector<T> &v, F f) {    rep(i, sz(v)) { if (find_if2(v[i], f))return i; }    return sz(v);}\n\ntemplate<typename T, typename F> bool rfind_if2(T &v, F f) { return f(v); }\n\ntemplate<typename T, typename F> ll rfind_if2(const vector<T> &v, F f) {    rer(i, sz(v) - 1) { if (rfind_if2(v[i], f))return i; }    return -1;}\n\ntemplate<class T> bool contains(string &s, const T &v) { return s.find(v) != string::npos; }\n\ntemplate<typename T> bool contains(const vector<T> &v, const T &val) { return std::find(v.begin(), v.end(), val) != v.end(); }\n\ntemplate<typename T, typename F> bool contains_if2(const vector<T> &v, F f) { return find_if(v.begin(), v.end(), f) != v.end(); }\n\ntemplate<typename T, typename F> ll count_if2(T &v, F f) { return f(v); }\n\ntemplate<typename T, typename F> ll count_if2(const vector<T> &vec_, F f) {    ll ret = 0;    fora(v, vec_)ret += count_if2(v, f);    return ret;}\n\n                                                                      \n\n                                                                                                         \n\ntemplate<typename T, typename F> void for_each2(vector<T> &a, F f) { rep(i, sz(a))f(a[i]); }\n\ntemplate<typename T, typename F> void for_each2(vector<vector<T> > &a, F f) { rep(i, sz(a))rep(j, sz(a[i]))f(a[i][j]); }\n\ntemplate<typename T, typename F> void for_each2(vector<vector<vector<T> > > &a, F f) { rep(i, sz(a))rep(j, sz(a[i]))rep(k, sz(a[i][j]))f(a[i][j][k]); }\n\n\n\ntemplate<typename W> ll count_od(const vector<W> &a) { return count_if2(a, [](ll v) { return v & 1; }); }\n\ntemplate<typename W> ll count_ev(const vector<W> &a) { return count_if2(a, [](ll v) { return !(v & 1); }); }\n\n                                   \n\ntemplate<typename T, typename F> vector<T> erase_if2(const vector<T> &v, F f) {    vector<T> nv;    rep(i, sz(v)) { if (!f(v[i])) { nv.push_back(v[i]); }}    return nv;}\n\ntemplate<typename T, typename F> vector<vector<T>> erase_if2(const vector<vector<T>> &v, F f) {    vector<vector<T>> res;    rep(i, sz(v)) { res[i] = erase_if2(v[i], f); }    return res;}\n\ntemplate<typename T, typename F> vector<T> l_erase_if2(const vector<T> &v, F f) {    vector<T> nv;    rep(i, sz(v)) { if (!f(v[i])) { nv.push_back(v[i]); }}    return nv;}\n\n\n\ntemplate<typename T, typename F> ll l_rfind_if(const vector<T> &v, F f) {    rer(i, sz(v) - 1) { if (f(v[i]))return i; }    return -1;}\n\ntemplate<typename T, typename F> bool l_contains_if(const vector<T> &v, F f) {    rer(i, sz(v) - 1) { if (f(v[i]))return true; }    return false;}\n\ntemplate<class A, class B, class C> auto t_all_of(A a, B b, C c) { return std::all_of(a, b, c); }\n\ntemplate<class A, class B, class C> auto t_any_of(A a, B b, C c) { return std::any_of(a, b, c); }\n\ntemplate<class A, class B, class C> auto t_none_of(A a, B b, C c) { return std::none_of(a, b, c); }\n\ntemplate<class A, class B, class C> auto t_find_if(A a, B b, C c) { return std::find_if(a, b, c); }\n\ntemplate<class A, class B, class C> auto t_count_if(A a, B b, C c) { return std::count_if(a, b, c); }\n\n\n\n#define all_of_s__2(a, right) (t_all_of(all(a),lamr(right)))\n\n#define all_of_s__3(a, v, siki) (t_all_of(all(a),[&](auto v){return siki;}))\n\n#define all_of_s(...) over3(__VA_ARGS__,all_of_s__3,all_of_s__2)(__VA_ARGS__)\n\n\n\n                \n\n                    \n\n#define all_of__2(a, right) all_of2(a,lamr(right))\n\n#define all_of__3(a, v, siki) all_of2(a,[&](auto v){return siki;})\n\n#define all_of(...) over3(__VA_ARGS__,all_of__3,all_of__2)(__VA_ARGS__)\n\n#define all_of_f(a, f) all_of2(a,f)\n\n\n\n#define any_of_s__2(a, right) (t_any_of(all(a),lamr(right)))\n\n#define any_of_s__3(a, v, siki) (t_any_of(all(a),[&](auto v){return siki;}))\n\n#define any_of_s(...) over3(__VA_ARGS__,any_of_s__3,any_of_s__2)(__VA_ARGS__)\n\n\n\n#define any_of__2(a, right) any_of2(a,lamr(right))\n\n#define any_of__3(a, v, siki) any_of2(a,[&](auto v){return siki;})\n\n#define any_of(...) over3(__VA_ARGS__,any_of__3,any_of__2)(__VA_ARGS__)\n\n#define any_of_f(a, f) any_of2(a,f)\n\n\n\n#define none_of_s__2(a, right) (t_none_of(all(a),lamr(right)))\n\n#define none_of_s__3(a, v, siki) (t_none_of(all(a),[&](auto v){return siki;}))\n\n#define none_of_s(...) over3(__VA_ARGS__,none_of_s__3,none_of_s__2)(__VA_ARGS__)\n\n\n\n#define none_of__2(a, right) none_of2(a,lamr(right))\n\n#define none_of__3(a, v, siki) none_of2(a,[&](auto v){return siki;})\n\n#define none_of(...) over3(__VA_ARGS__,none_of__3,none_of__2)(__VA_ARGS__)\n\n#define none_of_f(a, f) none_of2(a,f)\n\n\n\n#define find_if_s__2(a, right) (t_find_if(all(a),lamr(right))-a.begin())\n\n#define find_if_s__3(a, v, siki) (t_find_if(all(a),[&](auto v){return siki;})-a.begin())\n\n#define find_if_s(...) over3(__VA_ARGS__,find_if_s__3,find_if_s__2)(__VA_ARGS__)\n\n\n\n#define find_if__2(a, right) find_if2(a,lamr(right))\n\n#define find_if__3(a, v, siki) find_if2(a,[&](auto v){return siki;})\n\n#define find_if(...) over3(__VA_ARGS__,find_if__3,find_if__2)(__VA_ARGS__)\n\n#define find_if_f(a, f) find_if2(a,f)\n\n\n\n#define rfind_if_s__2(a, right) l_rfind_if(a, lamr(right))\n\n#define rfind_if_s__3(a, v, siki) l_rfind_if(a, [&](auto v){return siki;})\n\n#define rfind_if_s(...) over3(__VA_ARGS__,rfind_if_s__3,rfind_if_s__2)(__VA_ARGS__)\n\n\n\n#define rfind_if__2(a, right) rfind_if2(a,lamr(right))\n\n#define rfind_if__3(a, v, siki) rfind_if2(a,[&](auto v){return siki;})\n\n#define rfind_if(...) over3(__VA_ARGS__,rfind_if__3,rfind_if__2)(__VA_ARGS__)\n\n#define rfind_if_f(a, f) rfind_if2(a,f)\n\n\n\n#define contains_if_s__2(a, right) l_contains_if(a, lamr(right))\n\n#define contains_if_s__3(a, v, siki) l_contains_if(a, [&](auto v){return siki;})\n\n#define contains_if_s(...) over3(__VA_ARGS__,contains_if_s__3,contains_if_s__2)(__VA_ARGS__)\n\n\n\n#define contains_if__2(a, right) contains_if2(a,lamr(right))\n\n#define contains_if__3(a, v, siki) contains_if2(a,[&](auto v){return siki;})\n\n#define contains_if(...) over3(__VA_ARGS__,contains_if__3,contains_if__2)(__VA_ARGS__)\n\n#define contains_if_f(a, f) contains_if2(a,f)\n\n\n\n#define count_if_s__2(a, right) (t_count_if(all(a),lamr(right)))\n\n#define count_if_s__3(a, v, siki) (t_count_if(all(a),[&](auto v){return siki;}))\n\n#define count_if_s(...) over3(__VA_ARGS__,count_if_s__3,count_if_s__2)(__VA_ARGS__)\n\n\n\n#define count_if__2(a, right) count_if2(a,lamr(right))\n\n#define count_if__3(a, v, siki) count_if2(a,[&](auto v){return siki;})\n\n#define count_if(...) over3(__VA_ARGS__,count_if__3,count_if__2)(__VA_ARGS__)\n\n#define count_if_f(a, f) count_if2(a,f)\n\n\n\n                                      \n\n#define for_each_s__2(a, right) do{fora(v,a){v right;}}while(0)\n\n#define for_each_s__3(a, v, shori) do{fora(v,a){shori;}}while(0)\n\n#define for_each_s(...) over3(__VA_ARGS__,for_each_s__3,for_each_s__2)(__VA_ARGS__)\n\n\n\n                                       \n\n#define for_each__2(a, right) for_each2(a,lamr(right))\n\n#define for_each__3(a, v, shori) for_each2(a,[&](auto& v){shori;})\n\n#define for_each(...) over3(__VA_ARGS__,for_each__3,for_each__2)(__VA_ARGS__)\n\n#define for_each_f(a, f) for_each2(a, f);\n\n\n\n#define for_eached__2(a, right) [&](auto a) {auto b = a;for_each(b, right);return b; }(a)\n\n#define for_eached__3(a, v, shori) [&](auto a) {auto b = a;for_each(b, v, shori);return b; }(a)\n\n#define for_eached(...) over3(__VA_ARGS__,for_eached__3,for_eached__2)(__VA_ARGS__)\n\n#define for_eached_f(a, f) for_eached2(a, f);\n\n\n\n\n\n#define erase_if_s__2(a, right) l_erase_if2(a,lamr(right))\n\n#define erase_if_s__3(a, v, siki) l_erase_if2(a,[&](auto v){return siki;})\n\n#define erase_if_s(...) over3(__VA_ARGS__,erase_if_s__3,erase_if_s__2)(__VA_ARGS__)\n\n\n\n\n\n#define erase_if__2(a, right) erase_if2(a,lamr(right))\n\n#define erase_if__3(a, v, siki) erase_if2(a,[&](auto v){return siki;})\n\n#define erase_if(...) over3(__VA_ARGS__,erase_if__3,erase_if__2)(__VA_ARGS__)\n\n#define erase_if_f(a, f) erase_if2(a,f)\n\n\n\n#define entry_if_s__2(a, right) l_entry_if2(a,lamr(right))\n\n#define entry_if_s__3(a, v, siki) l_entry_if2(a,[&](auto v){return siki;})\n\n#define entry_if_s(...) over3(__VA_ARGS__,entry_if_s__3,entry_if_s__2)(__VA_ARGS__)\n\n\n\n\n\n#define entry_if__2(a, right) entry_if2(a,lamr(right))\n\n#define entry_if__3(a, v, siki) entry_if2(a,[&](auto v){return siki;})\n\n#define entry_if(...) over3(__VA_ARGS__,entry_if__3,entry_if__2)(__VA_ARGS__)\n\n#define entry_if_f(a, f) entry_if2(a,f)\n\n\n\n#endif\n\n\n\ntemplate<class T, class U, class W> void replace(vector<W> &a, T key, U v) { rep(i, sz(a))if (a[i] == key)a[i] = v; }\n\ntemplate<class T, class U, class W> void replace(vector<vector<W>> &A, T key, U v) { rep(i, sz(A))replace(A[i], key, v); }\n\nvoid replace(str &a, char key, str v) { if (v == \"\")a.erase(remove(all(a), key), a.end()); }\n\nvoid replace(str &a, char key, char v) { replace(all(a), key, v); }\n\n                                              \n\ntemplate<class T, class U> void replace(vector<T> &a, U k) { rep(i, sz(a)) a[i] = a[i] == k; }\n\ntemplate<class T, class U> void replace(vector<vector<T >> &a, U k) { rep(i, sz(a))rep(j, sz(a[0])) a[i][j] = a[i][j] == k; }\n\n                                                           \n\nvoid replace(str &a) {    int dec = 0;    if ('a' <= a[0] && a[0] <= 'z')dec = 'a';    if ('A' <= a[0] && a[0] <= 'Z')dec = 'A';    fora(v, a)v -= dec;}\n\nvoid replace(str &a, str key, str v) {    stringstream t;    ll kn = sz(key);    std::string::size_type Pos(a.find(key));    ll l = 0;    while (Pos != std::string::npos) {        t << a.substr(l, Pos - l);        t << v;        l = Pos + kn;        Pos = a.find(key, Pos + kn);    }    t << a.substr(l, sz(a) - l);    a = t.str();}\n\n\n\ntemplate<class T> bool includes(vector<T> &a, vector<T> &b) {    vi c = a;    vi d = b;    sort(all(c));    sort(all(d));    return includes(all(c), all(d));}\n\ntemplate<class T> bool is_permutation(vector<T> &a, vector<T> &b) { return is_permutation(all(a), all(b)); }\n\ntemplate<class T> bool next_permutation(vector<T> &a) { return next_permutation(all(a)); }\n\nvoid iota(vector<ll> &ve, ll s, ll n) {    ve.resize(n);    iota(all(ve), s);}\n\nvi iota(ll s, ll len) {    vi ve(len);    iota(all(ve), s);    return ve;}\n\ntemplate<class A, class B> auto vtop(vector<A> &a, vector<B> &b) {    assert(sz(a) == sz(b));                                              vector<pair<A, B>> res;    rep(i, sz(a))res.eb(a[i], b[i]);    return res;}\n\ntemplate<class A, class B> void ptov(vector<pair<A, B>> &p, vector<A> &a, vector<B> &b) {    a.resize(sz(p)), b.resize(sz(p));    rep(i, sz(p))a[i] = p[i].fi, b[i] = p[i].se;}\n\ntemplate<class A, class B, class C> auto vtot(vector<A> &a, vector<B> &b, vector<C> &c) {    assert(sz(a) == sz(b) && sz(b) == sz(c));    vector<T2<A, B, C>> res;    rep(i, sz(a))res.eb(a[i], b[i], c[i]);    return res;}\n\ntemplate<class A, class B, class C, class D> auto vtof(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {    assert(sz(a) == sz(b) && sz(b) == sz(c) && sz(c) == sz(d));    vector<F2<A, B, C, D>> res;    rep(i, sz(a))res.eb(a[i], b[i], c[i], d[i]);    return res;}\n\n\n\ntemplate<class T> void sort(vector<T> &a) { sort(all(a)); }\n\ntemplate<class T> void rsort(vector<T> &a) { sort(all(a), greater<T>()); };\n\ntemplate<class A, class B> void sortp(vector<A> &a, vector<B> &b) {    auto c = vtop(a, b);    sort(c);    rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;}\n\ntemplate<class A, class B> void rsortp(vector<A> &a, vector<B> &b) {    auto c = vtop(a, b);    rsort(c);    rep(i, sz(a))a[i] = c[i].first, b[i] = c[i].second;}\n\ntemplate<class A, class B, class C> void sortt(vector<A> &a, vector<B> &b, vector<C> &c) {    auto d = vtot(a, b, c);    sort(d);    rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;}\n\ntemplate<class A, class B, class C> void rsortt(vector<A> &a, vector<B> &b, vector<C> &c) {    auto d = vtot(a, b, c);    rsort(d);    rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;}\n\ntemplate<class... T, class U> auto sorted(U head, T... a) {    sort(head, a...);    return head;}\n\ntemplate<class... T, class U> auto rsorted(U head, T... a) {    rsort(head, a...);    return head;}\n\n                                             \n\ntemplate<class T> vi sorti(vector<T> &a) {    auto b = a;    vi ind = iota(0, sz(a));    sortp(b, ind);    return ind;}\n\n                  \n\n#ifdef use_sort\n\nenum pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd };\n\nenum tcomparator {    fisiti,    fisitd,    fisdti,    fisdtd,    fdsiti,    fdsitd,    fdsdti,    fdsdtd,    fitisi,    fitisd,    fitdsi,    fitdsd,    fdtisi,    fdtisd,    fdtdsi,    fdtdsd,    sifiti,    sifitd,    sifdti,    sifdtd,    sdfiti,    sdfitd,    sdfdti,    sdfdtd,    sitifi,    sitifd,    sitdfi,    sitdfd,    sdtifi,    sdtifd,    sdtdfi,    sdfdfd,    tifisi,    tifisd,    tifdsi,    tifdsd,    tdfisi,    tdfisd,    tdfdsi,    tdfdsd,    tisifi,    tisifd,    tisdfi,    tisdfd,    tdsifi,    tdsifd,    tdsdfi,    tdsdfd};\n\ntemplate<class A, class B> void sort(vector<pair<A, B>> &a, pcomparator type) {    typedef pair<A, B> U;    if (type == fisi) sort(all(a), [&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; }); else if (type == fisd) sort(all(a), [&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; }); else if (type == fdsi) sort(all(a), [&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; }); else if (type == fdsd) sort(all(a), [&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; }); else if (type == sifi) sort(all(a), [&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; }); else if (type == sifd) sort(all(a), [&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; }); else if (type == sdfi) sort(all(a), [&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; }); else if (type == sdfd) sort(all(a), [&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });};\n\ntemplate<class U> void sort(vector<U> &a, pcomparator type) { if (type == fisi) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s < r.s; }); else if (type == fisd) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s > r.s; }); else if (type == fdsi) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s < r.s; }); else if (type == fdsd) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s > r.s; }); else if (type == sifi) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f < r.f; }); else if (type == sifd) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f > r.f; }); else if (type == sdfi) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f < r.f; }); else if (type == sdfd) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f > r.f; }); };\n\ntemplate<class A, class B, class C, class D> void sort(vector<F2<A, B, C, D> > &a, pcomparator type) {    typedef F2<A, B, C, D> U;    if (type == fisi) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b < r.b; }); else if (type == fisd) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b > r.b; }); else if (type == fdsi) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b < r.b; }); else if (type == fdsd) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b > r.b; }); else if (type == sifi) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a < r.a; }); else if (type == sifd) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a > r.a; }); else if (type == sdfi) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a < r.a; }); else if (type == sdfd) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a > r.a; });};\n\ntemplate<class U> void sort(vector<U> &a, tcomparator type) {    if (type == 0) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t < r.t; });    else if (type == 1) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t > r.t; });    else if (type == 2) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t < r.t; });    else if (type == 3) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t > r.t; });    else if (type == 4) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t < r.t; });    else if (type == 5) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t > r.t; });    else if (type == 6) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t < r.t; });    else if (type == 7) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t > r.t; });    else if (type == 8) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s < r.s; });    else if (type == 9) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s > r.s; });    else if (type == 10) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s < r.s; });    else if (type == 11) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s > r.s; });    else if (type == 12) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s < r.s; });    else if (type == 13) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s > r.s; });    else if (type == 14) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s < r.s; });    else if (type == 15) sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s > r.s; });    else if (type == 16) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t < r.t; });    else if (type == 17) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t > r.t; });    else if (type == 18) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t < r.t; });    else if (type == 19) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t > r.t; });    else if (type == 20) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t < r.t; });    else if (type == 21) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t > r.t; });    else if (type == 22) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t < r.t; });    else if (type == 23) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t > r.t; });    else if (type == 24) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f < r.f; });    else if (type == 25) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f > r.f; });    else if (type == 26) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f < r.f; });    else if (type == 27) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f > r.f; });    else if (type == 28) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f < r.f; });    else if (type == 29) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f > r.f; });    else if (type == 30) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f < r.f; });    else if (type == 31) sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f > r.f; });    else if (type == 32) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s < r.s; });    else if (type == 33) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s > r.s; });    else if (type == 34) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s < r.s; });    else if (type == 35) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s > r.s; });    else if (type == 36) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s < r.s; });    else if (type == 37) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s > r.s; });    else if (type == 38) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s < r.s; });    else if (type == 39) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s > r.s; });    else if (type == 40) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f < r.f; }); else if (type == 41) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f > r.f; }); else if (type == 42) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f < r.f; }); else if (type == 43) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f > r.f; }); else if (type == 44) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f < r.f; }); else if (type == 45) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f > r.f; }); else if (type == 46) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f < r.f; }); else if (type == 47) sort(all(a), [&](U l, U r) { return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f > r.f; });}\n\ntemplate<class A, class B, class C, class D> void sort(vector<F2<A, B, C, D>> &a, tcomparator type) {    typedef F2<A, B, C, D> U;    if (type == 0) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c < r.c; });    else if (type == 1) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c > r.c; });    else if (type == 2) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c < r.c; });    else if (type == 3) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c > r.c; });    else if (type == 4) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c < r.c; });    else if (type == 5) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c > r.c; });    else if (type == 6) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c < r.c; });    else if (type == 7) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c > r.c; });    else if (type == 8) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b < r.b; });    else if (type == 9) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b > r.b; });    else if (type == 10) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b < r.b; });    else if (type == 11) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b > r.b; });    else if (type == 12) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b < r.b; });    else if (type == 13) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b > r.b; });    else if (type == 14) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b < r.b; });    else if (type == 15) sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b > r.b; });    else if (type == 16) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c < r.c; });    else if (type == 17) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c > r.c; });    else if (type == 18) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c < r.c; });    else if (type == 19) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c > r.c; });    else if (type == 20) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c < r.c; });    else if (type == 21) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c > r.c; });    else if (type == 22) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c < r.c; });    else if (type == 23) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c > r.c; });    else if (type == 24) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a < r.a; });    else if (type == 25) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a > r.a; });    else if (type == 26) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a < r.a; });    else if (type == 27) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a > r.a; });    else if (type == 28) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a < r.a; });    else if (type == 29) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a > r.a; });    else if (type == 30) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a < r.a; });    else if (type == 31) sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a > r.a; });    else if (type == 32) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b < r.b; });    else if (type == 33) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b > r.b; });    else if (type == 34) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b < r.b; });    else if (type == 35) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b > r.b; });    else if (type == 36) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b < r.b; });    else if (type == 37) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b > r.b; });    else if (type == 38) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b < r.b; });    else if (type == 39) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b > r.b; });    else if (type == 40) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a < r.a; }); else if (type == 41) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a > r.a; }); else if (type == 42) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a < r.a; }); else if (type == 43) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a > r.a; }); else if (type == 44) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a < r.a; }); else if (type == 45) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a > r.a; }); else if (type == 46) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a < r.a; }); else if (type == 47) sort(all(a), [&](U l, U r) { return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a > r.a; });}\n\n\n\nvoid sort(string &a) { sort(all(a)); }\n\nvoid sort(int &a, int &b) { if (a > b)swap(a, b); }\n\nvoid sort(int &a, int &b, int &c) {    sort(a, b);    sort(a, c);    sort(b, c);}\n\nvoid rsort(int &a, int &b) { if (a < b)swap(a, b); }\n\nvoid rsort(int &a, int &b, int &c) {    rsort(a, b);    rsort(a, c);    rsort(b, c);}\n\n                                  \n\ntemplate<class U, class F> void sort(vector<U> &a, F f) { sort(all(a), [&](U l, U r) { return f(l) < f(r); }); };\n\ntemplate<class U, class F> void rsort(vector<U> &a, F f) { sort(all(a), [&](U l, U r) { return f(l) > f(r); }); };\n\n\n\n          \n\n                              \n\ntemplate<class A, class B, class F> void sortp(vector<A> &a, vector<B> &b, F f) {    auto c = vtop(a, b);    sort(c, f);    rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;}\n\ntemplate<class A, class B, class F> void rsortp(vector<A> &a, vector<B> &b, F f) {    auto c = vtop(a, b);    rsort(c, f);    rep(i, sz(a))a[i] = c[i].first, b[i] = c[i].second;}\n\ntemplate<class A, class B, class C, class F> void sortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {    auto d = vtot(a, b, c);    sort(d, f);    rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;}\n\ntemplate<class A, class B, class C, class F> void rsortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {    auto d = vtot(a, b, c);    rsort(d, f);    rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;}\n\ntemplate<class A, class B, class C, class D> void sortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {    auto e = vtof(a, b, c, d);    sort(e);    rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;}\n\ntemplate<class A, class B, class C, class D> void rsortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {    auto e = vtof(a, b, c, d);    rsort(e);    rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;}\n\n                                                           \n\ntemplate<class T> vi sorti(vector<T> &a, pcomparator f) {    auto b = a;    vi ind = iota(0, sz(a));    sortp(b, ind, f);    return ind;}\n\ntemplate<class T, class F> vi sorti(vector<T> &a, F f) {    vi ind = iota(0, sz(a));    sort(all(ind), [&](ll x, ll y) { return f(a[x]) < f(a[y]); });    return ind;}\n\ntemplate<class T> vi rsorti(vector<T> &a) {    auto b = a;    vi ind = iota(0, sz(a));    rsortp(b, ind);    return ind;}\n\ntemplate<class T, class F> vi rsorti(vector<T> &a, F f) {    vi ind = iota(0, sz(a));    sort(all(ind), [&](ll x, ll y) { return f(a[x]) > f(a[y]); });    return ind;}\n\ntemplate<class A, class B, class F> vi sortpi(vector<A> &a, vector<B> &b, F f) {    auto c = vtop(a, b);    vi ind = iota(0, sz(a));    sort(all(ind), [&](ll x, ll y) { return f(c[x]) < f(c[y]); });    return ind;}\n\ntemplate<class A, class B> vi sortpi(vector<A> &a, vector<B> &b, pcomparator f) {    vi ind = iota(0, sz(a));    auto c = a;    auto d = b;    sortt(c, d, ind, f);    return ind;}\n\ntemplate<class A, class B> vi sortpi(vector<A> &a, vector<B> &b) { return sortpi(a, b, fisi); };\n\ntemplate<class A, class B, class F> vi rsortpi(vector<A> &a, vector<B> &b, F f) {    auto c = vtop(a, b);    vi ind = iota(0, sz(a));    sort(all(ind), [&](ll x, ll y) { return f(c[x]) > f(c[y]); });    return ind;}\n\ntemplate<class A, class B> vi rsortpi(vector<A> &a, vector<B> &b) { return sortpi(a, b, fdsd); };\n\ntemplate<class A, class B, class C, class F> vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {    auto d = vtot(a, b, c);    vi ind = iota(0, sz(a));    sort(all(ind), [&](ll x, ll y) { return f(d[x]) < f(d[y]); });    return ind;}\n\ntemplate<class A, class B, class C> vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, pcomparator f) {    vi ind = iota(0, sz(a));    auto d = vtof(a, b, c, ind);    sort(d, f);    rep(i, sz(a))ind[i] = d[i].d;    return ind;}\n\ntemplate<class A, class B, class C> vi sortti(vector<A> &a, vector<B> &b, vector<C> &c) {    vi ind = iota(0, sz(a));    sort(all(ind), [&](ll x, ll y) { if (a[x] == a[y]) { if (b[x] == b[y])return c[x] < c[y]; else return b[x] < b[y]; } else { return a[x] < a[y]; }});    return ind;}\n\ntemplate<class A, class B, class C, class F> vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {    auto d = vtot(a, b, c);    vi ind = iota(0, sz(a));    sort(all(ind), [&](ll x, ll y) { return f(d[x]) > f(d[y]); });    return ind;}\n\ntemplate<class A, class B, class C> vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c) {    vi ind = iota(0, sz(a));    sort(all(ind), [&](ll x, ll y) { if (a[x] == a[y]) { if (b[x] == b[y])return c[x] > c[y]; else return b[x] > b[y]; } else { return a[x] > a[y]; }});    return ind;}\n\ntemplate<class T> void sort2(vector<vector<T >> &a) { for (ll i = 0, n = a.size(); i < n; ++i)sort(a[i]); }\n\ntemplate<class T> void rsort2(vector<vector<T >> &a) { for (ll i = 0, n = a.size(); i < n; ++i)rsort(a[i]); }\n\n\n\n#endif\n\ntemplate<typename W, typename T> void fill(W &xx, const T vall) { xx = vall; }\n\ntemplate<typename W, typename T> void fill(vector<W> &vecc, const T vall) { for (auto &&vx     : vecc)fill(vx, vall); }\n\ntemplate<typename W, typename T> void fill(vector<W> &xx, const T v, ll len) { rep(i, len)xx[i] = v; }\n\ntemplate<typename W, typename T> void fill(vector<W> &xx,const T v, int s, ll t) { rep(i, s, t)xx[i] = v; }\n\ntemplate<typename W, typename T> void fill(vector<vector<W>> &xx, T v, int sh, int th, int sw, int tw) { rep(h, sh, th)rep(w, sw, tw)xx[h][w] = v; }\n\n                                          \n\n#ifdef use_fill\n\ntemplate<typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) { rep(i, N)a[i] = v; }\n\ntemplate<typename A, size_t N, size_t O, typename T> void fill(A (&a)[N][O], const T &v) { rep(i, N)rep(j, O)a[i][j] = v; }\n\ntemplate<typename A, size_t N, size_t O, size_t P, typename T> void fill(A (&a)[N][O][P], const T &v) { rep(i, N)rep(j, O)rep(k, P)a[i][j][k] = v; }\n\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, typename T> void fill(A (&a)[N][O][P][Q], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)a[i][j][k][l] = v; }\n\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, typename T> void fill(A (&a)[N][O][P][Q][R], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)a[i][j][k][l][m] = v; }\n\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S, typename T> void fill(A (&a)[N][O][P][Q][R][S], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)rep(n, S)a[i][j][k][l][m][n] = v; }\n\ntemplate<class T, class U> void fill(vector<T> &a, const vi &ind, U val) { fora(v, ind)a[v] = val; }\n\ntemplate<typename A, size_t N> A sum(A (&a)[N]) {    A res = 0;    rep(i, N)res += a[i];    return res;}\n\ntemplate<typename A, size_t N, size_t O> A sum(A (&a)[N][O]) {    A res = 0;    rep(i, N)rep(j, O)res += a[i][j];    return res;}\n\ntemplate<typename A, size_t N, size_t O, size_t P> A sum(A (&a)[N][O][P]) {    A res = 0;    rep(i, N)rep(j, O)rep(k, P)res += a[i][j][k];    return res;}\n\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q> A sum(A (&a)[N][O][P][Q]) {    A res = 0;    rep(i, N)rep(j, O)rep(k, P)rep(l, Q)res += a[i][j][k][l];    return res;}\n\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R> A sum(A (&a)[N][O][P][Q][R]) {    A res = 0;    rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)res += a[i][j][k][l][m];    return res;}\n\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S> A sum(A (&a)[N][O][P][Q][R][S]) {    A res = 0;    rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)rep(n, S)res += a[i][j][k][l][m][n];    return res;}\n\n\n\ntemplate<typename A, size_t N> A max(A (&a)[N]) {    A res = a[0];    rep(i, N)res = max(res, a[i]);    return res;}template<typename A, size_t N, size_t O> A max(A (&a)[N][O]) {    A res = max(a[0]);    rep(i, N)res = max(res, max(a[i]));    return res;}template<typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {    A res = max(a[0]);    rep(i, N)res = max(res, max(a[i]));    return res;}template<typename A, size_t N, size_t O, size_t P, size_t Q> A max(A (&a)[N][O][P][Q], const T &v) {    A res = max(a[0]);    rep(i, N)res = max(res, max(a[i]));    return res;}template<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R> A max(A (&a)[N][O][P][Q][R]) {    A res = max(a[0]);    rep(i, N)res = max(res, max(a[i]));    return res;}template<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S> A max(A (&a)[N][O][P][Q][R][S]) {    A res = max(a[0]);    rep(i, N)res = max(res, max(a[i]));    return res;}\n\ntemplate<typename A, size_t N> A min(A (&a)[N]) {    A res = a[0];    rep(i, N)res = min(res, a[i]);    return res;}template<typename A, size_t N, size_t O> A min(A (&a)[N][O]) {    A res = min(a[0]);    rep(i, N)res = min(res, min(a[i]));    return res;}template<typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {    A res = min(a[0]);    rep(i, N)res = min(res, min(a[i]));    return res;}template<typename A, size_t N, size_t O, size_t P, size_t Q> A min(A (&a)[N][O][P][Q], const T &v) {    A res = min(a[0]);    rep(i, N)res = min(res, min(a[i]));    return res;}template<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R> A min(A (&a)[N][O][P][Q][R]) {    A res = min(a[0]);    rep(i, N)res = min(res, min(a[i]));    return res;}template<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S> A min(A (&a)[N][O][P][Q][R][S]) {    A res = min(a[0]);    rep(i, N)res = min(res, min(a[i]));    return res;}\n\n#endif\n\n\n\n                            \n\nll in() {    ll ret;    cin >> ret;    return ret;}\n\ntemplate<class T> T in() {    T ret;    cin >> ret;    return ret;}\n\nstring sin() {    string ret;    cin >> ret;    return ret;}\n\ntemplate<class T> void in(T &head) { cin >> head; }\n\ntemplate<class T, class... U> void in(T &head, U &... tail) {    cin >> head;    in(tail...);}\n\n#define din_t2(type, a) type a;cin>>a\n\n#define din_t3(type, a, b) type a,b;cin>>a>> b\n\n#define din_t4(type, a, b, c) type a,b,c;cin>>a>>b>>c\n\n#define din_t5(type, a, b, c, d) type a,b,c,d;cin>>a>>b>>c>>d\n\n#define din_t6(type, a, b, c, d, e) type a,b,c,d,e;cin>>a>>b>>c>>d>>e\n\n#define din_t7(type, a, b, c, d, e, f) type a,b,c,d,e,f;cin>>a>>b>>c>>d>>e>>f\n\n#define din_t(...) over7(__VA_ARGS__,din_t7,din_t6,din_t5,din_t4,din_t3 ,din_t2)(__VA_ARGS__)\n\n\n\n#define din(...) din_t(int,__VA_ARGS__)\n\n#define d_in\n\n#define dsig(...) din_t(signed,__VA_ARGS__)\n\n\n\n#define dst(...) din_t(string,__VA_ARGS__)\n\n#define dstr dst\n\n#define d_str dst\n\n\n\n#define dcha(...) din_t(char,__VA_ARGS__)\n\n#define dchar dcha\n\n\n\n#define ddou(...) din_t(double,__VA_ARGS__)\n\n\n\n\n\n#define din1d(a) din_t2(int, a);a--\n\n#define din2d(a, b) din_t3(int, a,b);a--,b--\n\n#define din3d(a, b, c) din_t4(int, a,b,c);a--,b--,c--\n\n#define din4d(a, b, c, d) din_t5(int, a,b,c,d);a--,b--,c--,d--\n\n#define dind(...) over4(__VA_ARGS__,din4d,din3d,din2d ,din1d)(__VA_ARGS__)\n\n\n\n\n\n#ifdef _DEBUG\n\ntemplate<class T> void err2(T &&head) { cerr << head; }\n\ntemplate<class T, class... U> void err2(T &&head, U &&... tail) {    cerr << head << \" \";    err2(tail...);}\n\ntemplate<class T, class... U> void err(T &&head, U &&... tail) {    cerr << head << \" \";    err2(tail...);    cerr << \"\" << endl;}\n\ntemplate<class T> void err(T &&head) { cerr << head << endl; }\n\nvoid err() { cerr << \"\" << endl; }\n\ntemplate<class T> string out_m2(vector<T> &a, ll W = inf) {    stringstream ss;    if (W == inf)W = min(sz(a), 20ll);    if (sz(a) == 0)return ss.str();    rep(i, W) {        ss << a[i];        if (typeid(a[i]) == typeid(P)) { ss << endl; } else { ss << \" \"; }    }    return ss.str();}\n\ntemplate<class T> string out_m2(vector<vector<T> > &a, vi H, vi W, int key = -1) {    stringstream ss;    ss << endl;    vi lens(sz(W));    fora(h, H) {        rep(wi, sz(W)) {            int v = a[h][W[wi]];            str s = tos(v);            if (abs(v) == inf || abs(v) == INF<T>())s = \"e\";            lens[wi] = max(lens[wi], sz(s) + 1);            lens[wi] = max(lens[wi], sz(tos(W[wi])) + 1);        }    }    if (key == -1)ss << \" *|\"; else ss << \" \" << key << \"|\";    int wi = 0;    fora(w, W) {        ss << std::right << std::setw(lens[wi]) << w;        wi++;    }    ss << \"\" << endl;    rep(i, sz(W))rep(lens[i])ss << \"_\";    rep(i, 3)ss << \"_\";    ss << \"\" << endl;    fora(h, H) {        ss << std::right << std::setw(2) << h << \"|\";        int wi = 0;        fora(w, W) {            str s = tos(a[h][w]);            if (abs(a[h][w]) == inf || abs(a[h][w]) == INF<T>())s = \"e\";            ss << std::right << std::setw(lens[wi]) << s;            wi++;        }        ss << \"\" << endl;    }    return ss.str();}\n\ntemplate<class T> string out_m2(vector<vector<T> > &a, ll H = inf, ll W = inf, int key = -1) {    H = (H != inf) ? H : min({H, sz(a), 12ll});    W = min({W, sz(a[0]), 12ll});    vi hs, ws;    rep(h, H) { hs.push_back(h); }    rep(w, W) { ws.push_back(w); }    return out_m2(a, hs, ws, key);}\n\ntemplate<class T> string out_m2(vector<set<T> > &a, ll H = inf, ll W = inf, int key = -1) {    vector<vector<T> > b(sz(a));    rep(i, sz(a)) { fora(v, a[i]) { b[i].push_back(v); }}    return out_m2(b, H, W, key);}\n\ntemplate<class T> string out_m2(vector<vector<vector<T> > > &a, ll H = inf, ll W = inf, ll U = inf) {    stringstream ss;    if (H == inf)H = 12;    H = min(H, sz(a));    rep(i, H) {        ss << endl;        ss << out_m2(a[i], W, U, i);    }    return ss.str();}\n\ntemplate<class T, size_t N> string out_m2(T (&a)[N]) {    vector<T> b;    resize(b, N);    rep(i, N) { b[i] = a[i]; }    return out_m2(b);}\n\ntemplate<class T, size_t N, size_t M> string out_m2(T (&a)[N][M]) {    vector<vector<T>> b;    resize(b, N, M);    rep(i, N) { rep(j, M) { b[i][j] = a[i][j]; }}    return out_m2(b);}\n\ntemplate<class T, size_t N, size_t M, size_t O> string out_m2(T (&a)[N][M][O]) {    vector<vector<vector<T>>> b;    resize(b, N, M, O);    rep(i, N) { rep(j, M) { rep(k, O) { b[i][j][k] = a[i][j][k]; }}}    return out_m2(b);}\n\nstring out_m2(int a) {    stringstream ss;    ss << a;    return ss.str();}\n\ntemplate<class T> string out_m2(T &a) {    stringstream ss;    ss << a;    return ss.str();}\n\ntemplate<class T> string out_m(vector<T> &a, ll W = inf) {    stringstream ss;    if (W == inf)W = min(sz(a), 12ll);    if (sz(a) == 0)return ss.str();    rep(i, W) { ss << a[i] << \" \"; }    ss << \"\" << endl;    return ss.str();}\n\ntemplate<class T> string out_m(vector<vector<T> > &a, ll H = inf, ll W = inf, int key = -1) {    H = min({H, sz(a), 12ll});    W = min({W, sz(a[0]), 12ll});    stringstream ss;    ss << endl;    if (key == -1)ss << \" *|\"; else ss << \" \" << key << \"|\";    rep(w, W)ss << std::right << std::setw(4) << w;    ss << \"\" << endl;    rep(w, W * 4 + 3)ss << \"_\";    ss << \"\" << endl;    rep(h, H) {        ss << std::right << std::setw(2) << h << \"|\";        rep(w, min(sz(a[h]), 12ll)) { if (abs(a[h][w]) == INF<T>()) ss << \"   e\" << \"\"; else ss << std::right << std::setw(4) << a[h][w]; }        ss << \"\" << endl;    }    ss << endl;    return ss.str();}\n\ntemplate<class T> string out_m(vector<vector<vector<T> > > &a, ll H = inf, ll W = inf, ll U = inf) {    stringstream ss;    if (H == inf)H = 5;    H = min(H, sz(a));    rep(i, H) {        ss << endl;        ss << out_m(a[i], W, U, i);    }    ss << endl;    return ss.str();}\n\nstring out_m(int a) {    stringstream ss;    ss << a << endl;    return ss.str();}\n\ntemplate<class T> string out_m(T &a) {    stringstream ss;    ss << a << endl;    return ss.str();}\n\ntemplate<class T> void outv(vector<T> &a, ll W = inf) { cout << out_m(a, W) << endl; }\n\ntemplate<class T> void outv(vector<vector<T> > &a, ll H = linf, ll W = linf, int key = -1) { cout << out_m(a, H, W, key) << endl; }\n\ntemplate<class T> void outv(vector<vector<vector<T> > > &a, ll H = linf, ll W = linf, ll U = linf) { cout << out_m(a, H, W, U) << endl; }\n\n\n\ntemplate<class T> void out2(T head) {    cout << head;    res_mes += out_m2(head);}\n\ntemplate<class T, class... U> void out2(T head, U ... tail) {    cout << head << \" \";    res_mes += out_m2(head) + \" \";    out2(tail...);}\n\ntemplate<class T, class... U> void out(T head, U ... tail) {    cout << head << \" \";    res_mes += out_m2(head) + \" \";    out2(tail...);    cout << \"\" << endl;    res_mes += \"\\n\";}\n\ntemplate<class T> void out(T head) {    cout << head << endl;    res_mes += out_m2(head) + \"\\n\";}\n\nvoid out() { cout << \"\" << endl; }\n\n\n\n#else\n\ntemplate<class T> void outv(vector<T> &a, ll W = inf) {    rep(i, min(W, sz(a))) { cout << a[i] << \" \"; }    cout << \"\" << endl;}\n\ntemplate<class T> void outv(vector<vector<T> > &a, ll H = linf, ll W = linf, int key = -1) { rep(i, min(H, sz(a))) { outv(a[i], W); }}\n\ntemplate<class T> void outv(vector<vector<vector<T> > > &a, ll H = linf, ll W = linf, ll U = linf) { ; }\n\n#define err(...);\n\n\n\ntemplate<class T> void out2(T &&head) { cout << head; }\n\ntemplate<class T, class... U> void out2(T &&head, U &&... tail) {    cout << head << \" \";    out2(tail...);}\n\ntemplate<class T, class... U> void out(T &&head, U &&... tail) {    cout << head << \" \";    out2(tail...);    cout << \"\" << endl;}\n\ntemplate<class T> void out(T &&head) {    cout << head  << endl;}\n\nvoid out() {    cout << \"\"  << endl;}\n\n\n\n#endif\n\n\n\n\n\n\n\ntemplate<class T> void outl(vector<T> &a, int n = inf) { rep(i, min(n, sz(a)))cout << a[i] << endl; }\n\n                                            \n\ntemplate<class T> void outt(vector<vector<T>> &a) {rep(i, sz(a)) {rep(j, sz(a[i])) { cout << a[i][j]; }cout << endl;}}\n\n                             \n\nvoid outb(int a) { cout << bitset<20>(a) << endl; }\n\ntemplate<class T> void na(vector<T> &a, ll n) {a.resize(n);rep(i, n)cin >> a[i];}\n\ntemplate<class T> void na(set<T> &a, ll n) { rep(i, n)a.insert(in()); }\n\n#define dna(a, n) vi a; na(a, n);                                                          \n\n#define dnad(a, n) vi a; nad(a, n);\n\ntemplate<class T> void nao(vector<T> &a, ll n) {a.resize(n + 1);a[0] = 0;rep(i, n)cin >> a[i + 1];}\n\ntemplate<class T> void naod(vector<T> &a, ll n) {a.resize(n + 1);a[0] = 0;rep(i, n)cin >> a[i + 1], a[i + 1]--;}\n\ntemplate<class T> void nad(vector<T> &a, ll n) {a.resize(n);rep(i, n)cin >> a[i], a[i]--;}\n\ntemplate<class T> void nad(set<T> &a, ll n) { rep(i, n)a.insert(in() - 1); }\n\ntemplate<class T, class U> void na2(vector<T> &a, vector<U> &b, ll n) {a.resize(n);b.resize(n);rep(i, n)cin >> a[i] >> b[i];}\n\ntemplate<class T, class U> void na2(set<T> &a, set<U> &b, ll n) {rep(i, n) {a.insert(in());b.insert(in());}}\n\n#define dna2(a, b, n) vi a,b; na2(a,b,n);\n\ntemplate<class T, class U> void nao2(vector<T> &a, vector<U> &b, ll n) {a.resize(n + 1);b.resize(n + 1);a[0] = b[0] = 0;rep(i, n)cin >> a[i + 1] >> b[i + 1];}\n\ntemplate<class T, class U> void na2d(vector<T> &a, vector<U> &b, ll n) {a.resize(n);b.resize(n);rep(i, n)cin >> a[i] >> b[i], a[i]--, b[i]--;}\n\n#define dna2d(a, b, n) vi a,b; na2d(a,b,n);\n\ntemplate<class T, class U, class W> void na3(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {a.resize(n);b.resize(n);c.resize(n);rep(i, n)cin >> a[i] >> b[i] >> c[i];}\n\n#define dna3(a, b, c, n) vi a,b,c; na3(a,b,c,n);\n\ntemplate<class T, class U, class W> void na3d(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {a.resize(n);b.resize(n);c.resize(n);rep(i, n)cin >> a[i] >> b[i] >> c[i], a[i]--, b[i]--, c[i]--;}\n\n#define dna3d(a, b, c, n) vi a,b,c; na3d(a,b,c,n);\n\ntemplate<class T, class U, class W, class X> void na4(vector<T> &a, vector<U> &b, vector<W> &c, vector<X> &d, ll n) {a.resize(n);b.resize(n);c.resize(n);d.resize(n);rep(i, n)cin >> a[i] >> b[i] >> c[i] >> d[i];}\n\n#define dna4(a, b, c, d, n)  vi a,b,c,d; na4(a,b,c,d,n);\n\n#define dna4d(a, b, c, d, n)  vi a,b,c,d; na4d(a,b,c,d,n);\n\n#define nt(a, h, w) resize(a,h,w);rep(nthi,h)rep(ntwi,w) cin >> a[nthi][ntwi];\n\n#define ntd(a, h, w) resize(a,h,w);rep(ntdhi,h)rep(ntdwi,w) cin >> a[ntdhi][ntdwi], a[ntdhi][ntdwi]--;\n\n#define ntp(a, h, w) resize(a,h+2,w+2);fill(a,'#');rep(ntphi,1,h+1)rep(ntpwi,1,w+1) cin >> a[ntphi][ntpwi];\n\n#define dnt(S, h, w) vvi(S,h,w);nt(S,h,w);\n\n#define dntc(S, h, w) vvc(S,h,w);nt(S,h,w);\n\n#define dnts(S, h, w) vvs(S,h,w);nt(S,h,w);\n\n\n\n              \n\n#define sp << \" \" <<\n\n\n\n#define deb1(x)  debugName(x)<<\" = \"<<out_m2(x)\n\n#define deb_2(x, ...) deb1(x) <<\", \"<< deb1(__VA_ARGS__)\n\n#define deb_3(x, ...) deb1(x) <<\", \"<< deb_2(__VA_ARGS__)\n\n#define deb_4(x, ...) deb1(x) <<\", \"<< deb_3(__VA_ARGS__)\n\n#define deb5(x, ...) deb1(x) <<\", \"<< deb_4(__VA_ARGS__)\n\n#define deb6(x, ...) deb1(x) <<\", \"<< deb5(__VA_ARGS__)\n\n#define deb7(x, ...) deb1(x) <<\", \"<< deb6(__VA_ARGS__)\n\n#define deb8(x, ...) deb1(x) <<\", \"<< deb7(__VA_ARGS__)\n\n#define deb9(x, ...) deb1(x) <<\", \"<< deb8(__VA_ARGS__)\n\n#define deb10(x, ...) deb1(x) <<\", \"<< deb9(__VA_ARGS__)\n\n\n\n\n\n#ifdef _DEBUG\n\nbool was_deb = false;\n\n#define deb(...)  do{was_deb=true;cerr<< over10(__VA_ARGS__,deb10,deb9,deb8,deb7,deb6,deb5,deb_4,deb_3,deb_2,deb1)(__VA_ARGS__) <<endl;}while(0)\n\n\n\n#define base_keta 8\n\nvoid print_n_base(int x, int base) { cerr << bitset<base_keta>(x) << endl; }\n\ntemplate<class T> void print_n_base(vector<T> X, int base) {cerr << endl;for (auto &&x:X) { print_n_base(x, base); }cerr << endl;}\n\n\n\n         \n\n#define deb2(x) was_deb=true;cerr<<debugName(x)<<\" = \";print_n_base(x, 2);\n\n#define deb3(x) was_deb=true;cerr<<debugName(x)<<\" = \";print_n_base(x, 3);\n\n#define deb4(x) was_deb=true;cerr<<debugName(x)<<\" = \";print_n_base(x, 4);\n\n\n\n#define deb_ex_deb(x, len)  debugName(x)<<\" = \"<<out_m2(x, len)\n\n#define call_deb_ex_deb(x, len) deb_ex_deb(x, len)\n\n                                           \n\n#define deb_ex(v) do {int N = sz(v);int s = N;int t = 0;rep(i, N) {if (sz(v[i])) {chmi(s, i);chma(t, i);}}auto ex_v = sub(v, s, N);str S = out_m2(ex_v, sz(ex_v));debugName(v);cerr<<\" = \"<<endl;cerr << S << endl;} while (0);\n\ntemplate<class T, class F> string out_m2_f(vector<vector<T> > &a, F f, int key = -1) {    vi hs, ws_;    int H = sz(a), W = sz(a[0]);    vi exh(H), exw(W);    rep(h, H) {        rep(w, W) {            if (f(a[h][w])) {                exh[h] = true;                exw[w] = true;            }        }    }    rep(h, H) if (exh[h])hs.push_back(h);    rep(w, W) if (exw[w])ws_.push_back(w);    return out_m2(a, hs, ws_, key);}\n\ntemplate<class T, class F> string out_m2_f(vector<vector<vector<T>>> &a, F f) {    stringstream ss;    int H = sz(a);    if (sz(a) == 0)return ss.str();    rep(i, H) { ss << out_m2_f(a[i], f, i); }    ss << \"\" << endl;    return ss.str();}\n\n#define debf_normal(tab, f) do{cerr<<debugName(tab)<<\" = \"<<endl;cerr<< out_m2_f(tab, f)<<endl;}while(0);\n\n#define debf2(tab, siki_r) debf_normal(tab, lamr(siki_r))\n\n#define debf3(tab, v, siki)  debf_normal(tab, lam(siki))\n\n          \n\n            \n\n#define debf(...) over3(__VA_ARGS__,debf3,debf2,debf1)(__VA_ARGS__)\n\n\n\n#else\n\n#define deb(...) ;\n\n#define deb2(...) ;\n\n#define deb3(...) ;\n\n#define deb4(...) ;\n\n#define deb_ex(...) ;\n\n#define debf(...) ;\n\n#endif\n\n\n\n\n\n#define debugline(x) cerr << x << \" \" << \"(L:\" << __LINE__ << \")\" << '\\n'\n\n\n\n\n\nusing u32 = unsigned;\n\nusing u64 = unsigned long long;\n\nusing u128 = __uint128_t;\n\n\n\nusing bint =__int128;\n\nstd::ostream &operator<<(std::ostream &dest, __int128_t value) {    std::ostream::sentry s(dest);    if (s) {        __uint128_t tmp = value < 0 ? -value : value;        char buffer[128];        char *d = std::end(buffer);        do {            --d;            *d = \"0123456789\"[tmp % 10];            tmp /= 10;        }        while (tmp != 0);        if (value < 0) {            --d;            *d = '-';        }        ll len = std::end(buffer) - d;        if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); }    }    return dest;}\n\n__int128 to_bint(string &s) {    __int128 ret = 0;    for (ll i = 0; i < s.length(); ++i) if ('0' <= s[i] && s[i] <= '9') ret = 10 * ret + s[i] - '0';    return ret;}\n\nvoid operator>>(istream &iss, bint &v) {    string S;    iss >> S;    v = 0;    rep(i, sz(S)) {        v *= 10;        v += S[i] - '0';    }}\n\n           \n\nvoid ole() {\n\n#ifdef _DEBUG\n\n  debugline(\"ole\");exit(0);\n\n#endif\n\n  string a = \"a\";rep(i, 30)a += a;rep(i, 1 << 17)cout << a << endl;cout << \"OLE 出力長制限超過\" << endl;exit(0);\n\n}\n\nvoid re(string s=\"\") {cerr<<s<<endl;assert(0 == 1);exit(0);}\n\nvoid tle() { while (inf)cout << inf << endl; }\n\n\n\n              \n\n\n\n              \n\n#define rand xor128_\n\nunsigned long xor128_(void) {    static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;    unsigned long t;    t = (x ^ (x << 11));    x = y;    y = z;    z = w;    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));}\n\nchar ranc() { return (char) ('a' + rand() % 26); }\n\nll rand(ll min, ll max) {    assert(min <= max);    if (min >= 0 && max >= 0) { return rand() % (max + 1 - min) + min; } else if (max < 0) { return -rand(-max, -min); } else { if (rand() % 2) { return rand(0, max); } else { return -rand(0, -min); }}}\n\nll rand(ll max) { return rand(0, max); }\n\ntemplate<class T> T rand(vector<T> &A) { return A[rand(sz(A) - 1)]; }\n\n                             \n\ntemplate<class T> vector<T> ranv(vector<T>& A, int N){vector<T>ret(N);rep(i,N){ret[i]=rand(A);}return ret;}\n\ntemplate<class T> vector<T> ranv_unique(vector<T>& A, int N){    vector<T> ret(N);    umapi was;    rep(j,N){        int i;        while(1){            i = rand(sz(A)-1);            if(was.find(i) == was.end())break;        }        ret[j] = A[i];was[i]=1;    }    return ret;}\n\nvi ranv(ll n, ll min, ll max) {    vi v(n);    rep(i, n)v[i] = rand(min, max);    return v;}\n\n\n\n#ifdef _DEBUG\n\nbool timeup(int time){\n\n  static bool never = true;\n\n  if(never)message += \"may timeup, because slow\";\n\n  never = false;\n\n\n\n  auto end_time = system_clock::now();\n\n  auto part = duration_cast<milliseconds>(end_time - start_time);\n\n  auto lim = milliseconds(time);\n\n  return part >= lim;\n\n}\n\n#else\n\nbool timeup(int time) {\n\n  auto end_time = system_clock::now();\n\n  auto part = duration_cast<milliseconds>(end_time - start_time);\n\n  auto lim = milliseconds(time);\n\n  return part >= lim;\n\n}\n\n\n\n#endif\n\nvoid set_time() { past_time = system_clock::now(); }\n\n                              \n\n                                  \n\nauto calc_time_milli() {    auto now = system_clock::now();    auto part = duration_cast<milliseconds>(now - past_time);    return part;}\n\nauto calc_time_micro() {    auto now = system_clock::now();    auto part = duration_cast<microseconds>(now - past_time);    return part;}\n\nauto calc_time_nano() {    auto now = system_clock::now();    auto part = duration_cast<nanoseconds>(now - past_time);    return part;}\n\nbool calc_time(int zikan) { return calc_time_micro() >= microseconds(zikan); }\n\nusing MS=std::chrono::microseconds;\n\nint div(microseconds a, microseconds b) { return a / b; }\n\nint div(nanoseconds a, nanoseconds b) {    if (b < nanoseconds(1)) { return a / nanoseconds(1); }    int v = a / b;    return v;}\n\n             \n\n                 \n\n\n\n                     \n\n                          \n\n                                                                                              \n\nint time_nanbai(int milli) {\n\n  auto dec = duration_cast<nanoseconds>(past_time - start_time);\n\n  auto part = calc_time_nano();\n\n  auto can_time = nanoseconds(milli * 1000 * 1000);\n\n  can_time -= part;\n\n  can_time -= dec;\n\n  return div(can_time, part);\n\n}\n\n\n\n                  \n\n#ifdef use_rand\n\nstr ransu(ll n) {    str s;    rep(i, n)s += (char) rand('A', 'Z');    return s;}\n\nstr ransl(ll n) {    str s;    rep(i, n)s += (char) rand('a', 'z');    return s;}\n\n              \n\nvi ranvinc(ll n, ll min, ll max) {    vi v(n);    bool bad = 1;    while (bad) {        bad = 0;        v.resize(n);        rep(i, n) {            if (i && min > max - v[i - 1]) {                bad = 1;                break;            }            if (i)v[i] = v[i - 1] + rand(min, max - v[i - 1]); else v[i] = rand(min, max);        }    }    return v;}\n\n               \n\n#endif\n\n\n\nvoid ranvlr(ll n, ll min, ll max, vi &l, vi &r) {    l.resize(n);    r.resize(n);    rep(i, n) {        l[i] = rand(min, max);        r[i] = l[i] + rand(0, max - l[i]);    }}\n\ntemplate<class T> vector<pair<T, int>> run_length(vector<T> &a) {    vector<pair<T, int>> ret;    ret.eb(a[0], 1);    rep(i, 1, sz(a)) { if (ret.back().fi == a[i]) { ret.back().se++; } else { ret.eb(a[i], 1); }}    return ret;}\n\nvector<pair<char, ll>> run_length(const string &a) {    vector<pair<char, ll>> ret;    ret.eb(a[0], 1);    rep(i, 1, sz(a)) { if (ret.back().fi == a[i]) { ret.back().se++; } else { ret.eb(a[i], 1); }}    return ret;}\n\n                                 \n\n#ifdef use_mgr\n\ntemplate<class T, class F> T mgr(T ok, T ng, F f, int deb_ = 0) {    bool han = true;    if (deb_) {        if (ok < ng)            while (ng - ok > 1) {                T mid = (ok + ng) >> 1;                if (f(mid))ok = mid, han = true; else ng = mid, han = false;                deb(mid, han);            }        else            while (ok - ng > 1) {                T mid = (ok + ng) >> 1;                if (f(mid))ok = mid, han = true; else ng = mid, han = false;                deb(mid, han);            }    }    else {        if (ok < ng)            while (ng - ok > 1) {                T mid = (ok + ng) >> 1;                if (f(mid))ok = mid, han = true; else ng = mid, han = false;            }        else            while (ok - ng > 1) {                T mid = (ok + ng) >> 1;                if (f(mid))ok = mid, han = true; else ng = mid, han = false;            }    }    return ok;}\n\ntemplate<class T, class F> T mgr(signed ok, T ng, F f) { return mgr((T) ok, ng, f); }\n\ntemplate<class T, class F> T mgr(T ok, signed ng, F f) { return mgr(ok, (T) ng, f); }\n\ntemplate<class F> int mgr(signed ok, signed ng, F f) { return mgr((ll) ok, (ll) ng, f); }\n\n                                                                                \n\ntemplate<class F> P mgr(int l, int r, F f, int ok) {    if (f(ok) == 0) {        out(\"f(ok) must true\");        re();    }    return mp(mgr(ok, l - 1, f), mgr(ok, r, f) + 1);}\n\n\n\ntemplate<class F> dou mgrd(dou ok, dou ng, F f, int kai = 100) {    bool han = true;    if (ok < ng)        rep(i, kai) {            dou mid = (ok + ng) / 2;            if (f(mid))ok = mid, han = true; else ng = mid, han = false;            deb(mid, han);        }    else        rep(i, kai) {            dou mid = (ok + ng) / 2;            if (f(mid))ok = mid, han = true; else ng = mid, han = false;            deb(mid, han);        }    return ok;}\n\n\n\ntemplate<class F> dou mgrd_time(dou ok, dou ng, F f,int time = 1980) {\n\n  bool han = true;\n\n  if (ok < ng)\n\n    while(1) {\n\n      dou mid = (ok + ng) /2;\n\n      if (f(mid))ok = mid, han = true; else ng = mid, han = false;\n\n      deb(mid,han);\n\n      if(timeup(time)){\n\n        break;\n\n      }\n\n    }\n\n  else\n\n    while(1) {\n\n      dou mid = (ok + ng) /2;\n\n      if (f(mid))ok = mid, han = true; else ng = mid, han = false;\n\n      deb(mid,han);\n\n      if(timeup(time)){\n\n        break;\n\n      }\n\n    }\n\n  return ok;\n\n}\n\n\n\n\n\n                    \n\ntemplate<class F> ll goldd_l(ll left, ll right, F calc) {    double GRATIO = 1.6180339887498948482045868343656;    ll lm = left + (ll) ((right - left) / (GRATIO + 1.0));    ll rm = lm + (ll) ((right - lm) / (GRATIO + 1.0));    ll fl = calc(lm);    ll fr = calc(rm);    while (right - left > 10) {        if (fl < fr) {            right = rm;            rm = lm;            fr = fl;            lm = left + (ll) ((right - left) / (GRATIO + 1.0));            fl = calc(lm);        }        else {            left = lm;            lm = rm;            fl = fr;            rm = lm + (ll) ((right - lm) / (GRATIO + 1.0));            fr = calc(rm);        }    }    ll minScore = MAX<ll>();    ll resIndex = left;    for (ll i = left; i < right + 1; ++i) {        ll score = calc(i);        if (minScore > score) {            minScore = score;            resIndex = i;        }    }    return resIndex;}\n\ntemplate<class F> ll goldt_l(ll left, ll right, F calc) {    double GRATIO = 1.6180339887498948482045868343656;    ll lm = left + (ll) ((right - left) / (GRATIO + 1.0));    ll rm = lm + (ll) ((right - lm) / (GRATIO + 1.0));    ll fl = calc(lm);    ll fr = calc(rm);    while (right - left > 10) {        if (fl > fr) {            right = rm;            rm = lm;            fr = fl;            lm = left + (ll) ((right - left) / (GRATIO + 1.0));            fl = calc(lm);        }        else {            left = lm;            lm = rm;            fl = fr;            rm = lm + (ll) ((right - lm) / (GRATIO + 1.0));            fr = calc(rm);        }    }    if (left > right) {        ll l = left;        left = right;        right = l;    }    ll maxScore = MIN<ll>();    ll resIndex = left;    for (ll i = left; i < right + 1; ++i) {        ll score = calc(i);        if (maxScore < score) {            maxScore = score;            resIndex = i;        }    }    return resIndex;}\n\n                                                                  \n\ntemplate<class F> dou goldd_d(dou left, dou right, F calc, ll loop = 200) {    dou GRATIO = 1.6180339887498948482045868343656;    dou lm = left + ((right - left) / (GRATIO + 1.0));    dou rm = lm + ((right - lm) / (GRATIO + 1.0));    dou fl = calc(lm);    dou fr = calc(rm);                                                                          ll k = 141;    loop++;    while (--loop) {        if (fl < fr) {            right = rm;            rm = lm;            fr = fl;            lm = left + ((right - left) / (GRATIO + 1.0));            fl = calc(lm);        }        else {            left = lm;            lm = rm;            fl = fr;            rm = lm + ((right - lm) / (GRATIO + 1.0));            fr = calc(rm);        }    }    return left;}\n\ntemplate<class F> dou goldt_d(dou left, dou right, F calc, ll loop = 200) {    double GRATIO = 1.6180339887498948482045868343656;    dou lm = left + ((right - left) / (GRATIO + 1.0));    dou rm = lm + ((right - lm) / (GRATIO + 1.0));    dou fl = calc(lm);    dou fr = calc(rm);    loop++;    while (--loop) {        if (fl > fr) {            right = rm;            rm = lm;            fr = fl;            lm = left + ((right - left) / (GRATIO + 1.0));            fl = calc(lm);        }        else {            left = lm;            lm = rm;            fl = fr;            rm = lm + ((right - lm) / (GRATIO + 1.0));            fr = calc(rm);        }    }    return left;}\n\n                                                                                           \n\ntemplate<class F> ll goldd_ls(ll l, ll r, F calc, ll time = 2000) {    auto lim = milliseconds(time - 20);    ll mini = 0, minv = MAX<ll>();                                  rep(k, 1, inf) {        auto s = system_clock::now();        ll haba = (r - l + k) / k;                              ll nl = l;        ll nr = l + haba;        rep(i, k) {            ll ni = goldd_l(nl, nr, calc);            if (chmi(minv, calc(ni))) mini = ni;            nl = nr;            nr = nl + haba;        }        auto end = system_clock::now();        auto part = duration_cast<milliseconds>(end - s);        auto elapsed = duration_cast<milliseconds>(end - start_time);        if (elapsed + part * 2 >= lim) { break; }    }    return mini;}\n\ntemplate<class F> ll goldt_ls(ll l, ll r, F calc, ll time = 2000) {    auto lim = milliseconds(time - 20);    ll maxi = 0, maxv = MIN<ll>();                                  rep(k, 1, inf) {        auto s = system_clock::now();        ll haba = (r - l + k) / k;                              ll nl = l;        ll nr = l + haba;        rep(i, k) {            ll ni = goldt_l(nl, nr, calc);            if (chma(maxv, calc(ni))) maxi = ni;            nl = nr;            nr = nl + haba;        }        auto end = system_clock::now();        auto part = duration_cast<milliseconds>(end - s);        auto elapsed = duration_cast<milliseconds>(end - start_time);        if (elapsed + part * 2 >= lim) { break; }    }    return maxi;}\n\ntemplate<class F> dou goldd_d_s(dou l, dou r, F calc, ll time = 2000) {                               auto lim = milliseconds(time - 20);    dou mini = 0, minv = MAX<dou>();                                  rep(k, 1, inf) {        auto s = system_clock::now();        dou haba = (r - l) / k;        dou nl = l;        dou nr = l + haba;        rep(i, k) {            dou ni = goldd_d(nl, nr, calc);            if (chmi(minv, calc(ni))) mini = ni;            nl = nr;            nr = nl + haba;        }        auto end = system_clock::now();        auto part = duration_cast<milliseconds>(end - s);        auto elapsed = duration_cast<milliseconds>(end - start_time);        if (elapsed + part * 2 >= lim) { break; }    }    return mini;}\n\ntemplate<class F> dou goldt_d_s(dou l, dou r, F calc, ll time = 2000) {                                        auto lim = milliseconds(time - 20);    dou maxi = 0, maxv = MIN<dou>();                                  rep(k, 1, inf) {        auto s = system_clock::now();        dou haba = (r - l) / k;        dou nl = l;        dou nr = l + haba;        rep(i, k) {            dou ni = goldt_d(nl, nr, calc);            if (chma(maxv, calc(ni))) maxi = ni;            nl = nr;            nr = nl + haba;        }        auto end = system_clock::now();        auto part = duration_cast<milliseconds>(end - s);        auto elapsed = duration_cast<milliseconds>(end - start_time);        if (elapsed + part * 2 >= lim) { break; }    }    return maxi;}\n\n\n\n#endif\n\n\n\n                             \n\nstring smax(str &a, str b) { if (sz(a) < sz(b)) { return b; } else if (sz(a) > sz(b)) { return a; } else if (a < b)return b; else return a; }\n\n                             \n\nstring smin(str &a, str b) { if (sz(a) > sz(b)) { return b; } else if (sz(a) < sz(b)) { return a; } else if (a > b)return b; else return a; }\n\n             \n\ntemplate<typename W, typename T> ll find(vector<W> &a, int l, const T key) {rep(i, l, sz(a))if (a[i] == key)return i;return -1;}\n\ntemplate<typename W, typename T> ll find(vector<W> &a, const T key) {rep(i, sz(a))if (a[i] == key)return i;return -1;}\n\ntemplate<typename W, typename T> P find(vector<vector<W >> &a, const T key) {rep(i, sz(a))rep(j, sz(a[0]))if (a[i][j] == key)return mp(i, j);return mp(-1, -1);}\n\n                                         \n\ntemplate<typename W, typename T> int findi(vector<vector<W >> &a, const T key) {rep(i, sz(a))rep(j, sz(a[0]))if (a[i][j] == key)return i * sz(a[0]) + j;return -1;}\n\ntemplate<typename W, typename U> T find(vector<vector<vector<W >>> &a, const U key) {rep(i, sz(a))rep(j, sz(a[0]))rep(k, sz(a[0][0]))if (a[i][j][k] == key)return mt(i, j, k);return mt(-1, -1, -1);}\n\n                \n\nint find(string &s, const string key) {    int klen = sz(key);    rep(i, sz(s) - klen + 1) {        if (s[i] != key[0])continue;        if (s.substr(i, klen) == key) { return i; }    }return -1;}\n\nint find(string &s, int l, const string key) {    int klen = sz(key);    rep(i, l, sz(s) - klen + 1) {        if (s[i] != key[0])continue;        if (s.substr(i, klen) == key) { return i; }    }    return -1;}\n\nint find(string &s, const char key) {    rep(i, sz(s)) { if (s[i] == key)return i; }    return -1;}\n\nint find(string &s, int l, const char key) {    rep(i, l, sz(s)) { if (s[i] == key)return i; }    return -1;}\n\n                                                \n\ntemplate<typename W, typename T> vi finds(const W &a, const T& key) {    int n = sz(a);    vi rpos(n, -1);    rer(i, n-1){        if(i<n-1){            rpos[i] = rpos[i+1];        }        if(a[i]==key)rpos[i] = i;    }    return rpos;}\n\ntemplate<typename W, typename T> vi rfinds(const W &a, const T& key) {    int n = sz(a);    vi lpos(n, -1);    rep(i, n){        if(i> 0){            lpos[i] = lpos[i-1];        }        if(a[i]==key)lpos[i] = i;    }    return lpos;}\n\ntemplate<typename W, typename T> ll count2(W &a, const T k) { return a == k; }\n\ntemplate<typename W, typename T> ll count2(vector<W> &a, const T k) {    ll ret = 0;    fora(v, a)ret += count2(v, k);    return ret;}\n\ntemplate<typename W, typename T> ll count(vector<W> &a, const T k) {    ll ret = 0;    fora(v, a)ret += count2(v, k);    return ret;}\n\nvi count(vi &a) {    int ma = 0;    fora(v, a) { if (ma < v)ma = v; }    vi res(ma + 1);    fora(v, a) { res[v]++; }    return res;}\n\nll count(str &a, str k) {    ll ret = 0, len = k.length();    auto pos = a.find(k);    while (pos != string::npos)pos = a.find(k, pos + len), ++ret;    return ret;}\n\nll count(const str &a, char k){    int cou=0;    for(auto && c :a ){        cou += c==k;    }    return cou;}\n\n                                                                  \n\nvi count(str &a, int l, int r) {    vi cou(26);    char c = 'a';    if ('A' <= a[l] && a[l] <= 'Z')c = 'A';    if ('a' <= a[l] && a[l] <= 'z') c = 'a'; else c = 0;    rep(i, l, r)++cou[a[i] - c];    return cou;}\n\n#define couif count_if\n\n           \n\nll rev(ll a) {    ll res = 0;    while (a) {        res *= 10;        res += a % 10;        a /= 10;    }    return res;}\n\ntemplate<class T> auto rev(vector<T> &a) {    auto b = a;    reverse(all(b));    return b;}\n\ntemplate<class U>\n\nauto rev(vector<vector<U>> &a) {    vector<vector<U> > b(sz(a[0]), vector<U>(sz(a)));    rep(h, sz(a)) rep(w, sz(a[0]))b[w][h] = a[h][w];    return b;}\n\ntemplate<class U>\n\nauto revw(vector<vector<U>> &a) {    vector<vector<U> > b(sz(a), vector<U>(sz(a[0])));    int W = sz(a[0]);    rep(h, sz(a)) rep(w, sz(a[0])) { b[h][W - 1 - w] = a[h][w]; }    return b;}\n\n\n\ntemplate<class U>\n\nauto revh(vector<vector<U>> &a) {    vector<vector<U> > b(sz(a), vector<U>(sz(a[0])));    int H = sz(a);    rep(h, sz(a)) rep(w, sz(a[0])) { b[H - 1 - h][w] = a[h][w]; }    return b;}\n\n\n\ntemplate<class U>\n\nauto revr(vector<vector<U>> &a) {    vector<vector<U> > b(sz(a[0]), vector<U>(sz(a)));    int H = sz(a);    int W = sz(a[0]);    rep(h, sz(a)) rep(w, sz(a[0]))b[w][h] = a[H - 1 - h][W - 1 - w];    return b;}\n\n\n\nauto rev(const string &a) {    string b = a;    reverse(all(b));    return b;}\n\nconstexpr ll p10[] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000, 10000000000ll, 100000000000ll, 1000000000000ll, 10000000000000ll, 100000000000000ll, 1000000000000000ll, 10000000000000000ll, 100000000000000000ll, 1000000000000000000ll};\n\n\n\n          \n\nll keta(ll v) { if (v < p10[9]) { if (v < p10[4]) { if (v < p10[2]) { if (v < p10[1]) { if (v < p10[0])return 0; else return 1; } else return 2; } else { if (v < p10[3]) return 3; else return 4; }} else { if (v < p10[7]) { if (v < p10[5]) return 5; else if (v < p10[6])return 6; else return 7; } else { if (v < p10[8])return 8; else return 9; }}} else { if (v < p10[13]) { if (v < p10[11]) { if (v < p10[10]) return 10; else return 11; } else { if (v < p10[12]) return 12; else return 13; }} else { if (v < p10[15]) { if (v < p10[14]) return 14; else return 15; } else { if (v < p10[17]) { if (v < p10[16]) return 16; else return 17; } else { if (v < p10[18])return 18; else return 19; }}}}}\n\nll getr(ll a, ll keta) { return (a / (ll) pow(10, keta)) % 10; }\n\n                       \n\nll getl(ll a, ll ket) {int sketa = keta(a);return getr(a, sketa - 1 - ket);}\n\nll dsum(ll v, ll sin = 10) {ll ret = 0;for (; v; v /= sin)ret += v % sin;return ret;}\n\n\n\nll mask10(ll v) { return p10[v] - 1; }\n\n           \n\n                                           \n\n                         \n\ntemplate<class T> auto keys(const T& a) {    vector<decltype((a.begin())->fi)> res;    for (auto &&k :a)res.push_back(k.fi);    return res;}\n\ntemplate<class T> auto values(const T& a) {    vector<decltype((a.begin())->se)> res;    for (auto &&k :a)res.push_back(k.se);    return res;}\n\ntemplate<class T> constexpr T min(T a, T b, T c) { return a >= b ? b >= c ? c : b : a >= c ? c : a; }\n\ntemplate<class T> constexpr T max(T a, T b, T c) { return a <= b ? b <= c ? c : b : a <= c ? c : a; }\n\ntemplate<class T> T min(vector<T> &a, ll s = -1, ll n = -1) { pr_set_lr(s, n, sz(a)); return *min_element(a.begin() + s, a.begin() + min(n, sz(a))); }\n\ntemplate<class T> T max(vector<T> &a, ll s = -1, ll n = -1) { pr_set_lr(s, n,sz(a)); return *max_element(a.begin() + s, a.begin() + min(n, sz(a))); }\n\ntemplate<class T> T mini(vector<T> &a) { return min_element(all(a)) - a.begin(); }\n\ntemplate<class T> T maxi(vector<T> &a) { return max_element(all(a)) - a.begin(); }\n\n\n\ntemplate<class T> T sum(const vector<T>& A, int l = -1, int r = -1){T s=0;pr_set_lr(l, r, sz(A));rep(i, l, r)s+=A[i];return s;}\n\ntemplate<class T> auto sum(const vector<vector<T>>& A ){decl2(A) s=0;rep(i, sz(A))s+=sum(A[i]);return s;}\n\ntemplate<class T> T min(const vector<T>& A, int l = -1, int r = -1 ){T s=MAX<T>();pr_set_lr(l, r, sz(A));rep(i, l, r)s=min(s, A[i]);return s;}\n\ntemplate<class T> auto min(const vector<vector<T>>& A ){using S =decl2(A);S s=MAX<S>();rep(i, sz(A))s=min(s, A[i]);return s;}\n\ntemplate<class T> T max(const vector<T>& A, int l = -1, int r = -1 ){T s=MIN<T>();pr_set_lr(l, r, sz(A));rep(i, l, r); rep(i, l, r)s=max(s, A[i]);return s;}\n\ntemplate<class T> auto max(const vector<vector<T>>& A ){using S =decl2(A);S s=MIN<S>();rep(i, sz(A))s=max(s, A[i]);return s;}\n\ntemplate<class T> T mul(vector<T> &v, ll t = inf) {    T ret = v[0];    rep(i, 1, min(t, sz(v)))ret *= v[i];    return ret;}\n\n\n\n                                                                                                                                                                                                 \n\n                               \n\nvi inds_(vi &a) {    int n = max(a) + 1;    vi ret(n, -1);    rep(i, sz(a)) { assert(ret[a[i]] ==-1);ret[a[i]] = i; }    return ret;}\n\nvoid clear(PQ &q) { q = PQ(); }\n\nvoid clear(priority_queue<int> &q) { q = priority_queue<int>(); }\n\ntemplate<class T> void clear(queue<T> &q) { while (q.size())q.pop(); }\n\n                                                                                                                       \n\n                                                                                                                                                                                                                                                                                                            \n\n\n\n\n\ntemplate<class T> struct ruiC {\n\n  vector<T> rui;\n\n  ruiC(vector<T> &ru) : rui(ru) {}\n\n               \n\n  ruiC() : rui(1, 0) {}\n\n  T operator()(ll l, ll r) {        if (l > r) {            cerr << \"ruic \";            deb(l, r);            assert(0);        }        return rui[r] - rui[l];    }\n\n  T operator()(int r = inf) { return operator()(0, min(r, sz(rui) - 1)); }\n\n                                                                                        \n\n                                                                                                \n\n                                                        \n\n  T operator[](ll i) { return rui[i]; }\n\n                                                   \n\n  void operator+=(T v) { rui.push_back(rui.back() + v); }\n\n  void add(int i, T v) {if (sz(rui) - 1 != i)ole();operator+=(v);}\n\n  T back() { return rui.back(); }\n\n  ll size() { return rui.size(); }\n\n  auto begin() { return rui.begin(); }\n\n  auto end() { return rui.end(); }\n\n};\n\ntemplate<class T> ostream &operator<<(ostream &os, ruiC<T> a) {    fora(v, a.rui)os << v << \" \";    return os;}\n\ntemplate<class T> vector<T> ruiv(vector<T> &a) {    vector<T> ret(a.size() + 1);    rep(i, a.size())ret[i + 1] = ret[i] + a[i];    return ret;}\n\ntemplate<class T> ruiC<T> ruic(vector<T> &a) {    vector<T> ret = ruiv(a);    return ruiC<T>(ret);}\n\ntemplate<class T> ruiC<T> ruic() { return ruiC<T>(); }\n\n                 \n\n                 \n\ntemplate<class T> vector<T> imo(vector<T> &v) {    vector<T> ret = v;    rep(i, sz(ret) - 1)ret[i + 1] += ret[i];    return ret;}\n\n\n\n                                    \n\n#ifdef use_rui\n\n                        \n\ntemplate<class T, class U> vi imo(const vector<T> &a, U k) {    vi equ(sz(a));    rep(i, sz(a)){        equ[i] = a[i]==k;    }    return imo(equ);}\n\ntemplate<class T> vector<T> imox(vector<T> &v) {    vector<T> ret = v;    rep(i, sz(ret) - 1)ret[i + 1] ^= ret[i];    return ret;}\n\n                             \n\ntemplate<class T> vector<T> imi(vector<T> &v) {    vector<T> ret = v;    rep(i, sz(ret) - 1)chmi(ret[i + 1], ret[i]);    return ret;}\n\ntemplate<class T> vector<T> ima(vector<T> &v) {    vector<T> ret = v;    rep(i, sz(ret) - 1)chma(ret[i + 1], ret[i]);    return ret;}\n\ntemplate<class T> vector<T> rimi(vector<T> &v) {    vector<T> ret = v;    rer(i, sz(ret) - 1, 1)chmi(ret[i - 1], ret[i]);    return ret;}\n\ntemplate<class T> vector<T> rima(vector<T> &v) {    vector<T> ret = v;    rer(i, sz(ret) - 1, 1)chma(ret[i - 1], ret[i]);    return ret;}\n\ntemplate<class T> struct ruimax {\n\n  template<typename Monoid> struct SegmentTree {                                 int sz;        vector<Monoid> seg;        const Monoid M1 = mp(MIN<T>(), -1);        Monoid f(Monoid a, Monoid b) { return max(a, b); }        void build(vector<T> &a) {            int n = sz(a);            sz = 1;            while (sz < n) sz <<= 1;            seg.assign(2 * sz, M1);            rep(i, n) { seg[i + sz] = mp(a[i], i); }            for (int k = sz - 1; k > 0; k--) { seg[k] = f(seg[k << 1], seg[(k << 1) | 1]); }        }        Monoid query(int a, int b) {            Monoid L = M1, R = M1;            for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {                if (a & 1) L = f(L, seg[a++]);                if (b & 1) R = f(seg[--b], R);            }            return f(L, R);        }        Monoid operator[](const int &k) const { return seg[k + sz]; }    };\n\nprivate:\n\n  vector<T> ve;\n\n  SegmentTree<pair<T, int>> seg;\n\n  vector<T> rv;\n\n  vector<int> ri;\n\n  bool build = false;\n\npublic:\n\n  int n;\n\n  ruimax(vector<T> &a) : ve(a), n(sz(a)) {        int index = -1;        T ma = MIN<T>();        rv.resize(n + 1);        ri.resize(n + 1);        rv[0] = -INF<T>;        ri[0] = -1;        rep(i, n) {            if (chma(ma, a[i])) { index = i; }            rv[i + 1] = ma;            ri[i + 1] = index;        }    }\n\n  T operator()(int l, int r) {        if (!(l <= r && 0 <= l && r <= n)) {            deb(l, r, n);            assert(0);        }        if (l == 0) { return rv[r]; }        else {            if (!build)seg.build(ve), build = true;            return seg.query(l, r).first;        }    }\n\n  T operator()(int r = inf) { return operator()(0, min(r, n)); }\n\n  T operator[](int r) { return operator()(0, r); }\n\n  T getv(int l, int r) { return operator()(l, r); }\n\n  T getv(int r = inf) { return getv(0, min(r, n)); };\n\n  int geti(int l, int r) {        assert(l <= r && 0 <= l && r <= n);        if (l == 0) { return ri[r]; }        else {            if (!build)seg.build(ve), build = true;            return seg.query(l, r).second;        }    }\n\n  int geti(int r = inf) { return geti(0, min(r, n)); };\n\n  auto begin() { return rv.begin(); }\n\n  auto end() { return rv.end(); }\n\n};\n\ntemplate<class T> struct ruimin {\n\n  template<typename Monoid> struct SegmentTree {                            int sz;vector<Monoid> seg;        const Monoid M1 = mp(MAX<T>(), -1);        Monoid f(Monoid a, Monoid b) { return min(a, b); }        void build(vector<T> &a) {            int n = sz(a);            sz = 1;            while (sz < n) sz <<= 1;            seg.assign(2 * sz, M1);            rep(i, n) { seg[i + sz] = mp(a[i], i); }            for (int k = sz - 1; k > 0; k--) { seg[k] = f(seg[k << 1], seg[(k << 1) | 1]); }        }        Monoid query(int a, int b) {            Monoid L = M1, R = M1;            for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {                if (a & 1) L = f(L, seg[a++]);                if (b & 1) R = f(seg[--b], R);            }            return f(L, R);        }        Monoid operator[](const int &k) const { return seg[k + sz]; }    };\n\nprivate:\n\n  vector<T> ve;\n\n  SegmentTree<pair<T, int>> seg;\n\n  vector<T> rv;\n\n  vector<int> ri;\n\n  bool build = false;\n\n  int n;\n\npublic:\n\n  ruimin(vector<T> &a) : ve(a), n(sz(a)) {        int index = -1;        T mi = MAX<T>();        rv.resize(n + 1);        ri.resize(n + 1);        rv[0] = INF<T>;        ri[0] = -1;        rep(i, n) {            if (chmi(mi, a[i])) { index = i; }            rv[i + 1] = mi;            ri[i + 1] = index;        }    }\n\n  T operator()(int l, int r) {        assert(l <= r && 0 <= l && r <= n);        if (l == 0) { return rv[r]; }        else {            if (!build)seg.build(ve), build = true;            return seg.query(l, r).first;        }    }\n\n  T operator()(int r = inf) { return operator()(0, min(r, n)); }\n\n  T operator[](int r) { return operator()(0, r); }\n\n  T getv(int l, int r) { return operator()(l, r); }\n\n  T getv(int r = inf) { return getv(0, min(r, n)); };\n\n  int geti(int l, int r) {        {            assert(l <= r && 0 <= l && r <= n);            if (l == 0) { return ri[r]; }            else {                if (!build)seg.build(ve), build = true;                return seg.query(l, r).second;            }        }        assert(l <= r && 0 <= l && r <= n);        if (l == 0) { return ri[r]; }        else {            if (!build)seg.build(ve), build = true;            return seg.query(l, r).second;        }    }\n\n  int geti(int r = inf) { return geti(0, min(r, n)); };\n\n  auto begin() { return rv.begin(); }\n\n  auto end() { return rv.end(); }\n\n};                  \n\n\n\nvvi() ruib(vi &a) {    vvi(res, 61, sz(a) + 1);    rep(k, 61) { rep(i, sz(a)) { res[k][i + 1] = res[k][i] + ((a[i] >> k) & 1); }}    return res;}\n\nvector<ruiC<int>> ruibc(vi &a) {vector<ruiC<int>> ret(61);    vvi(res, 61, sz(a));    rep(k, 61) {        rep(i, sz(a)) { res[k][i] = (a[i] >> k) & 1; }        ret[k] = ruic(res[k]);    }    return ret;}\n\nvector<ll> ruiv(string &a) {    if (sz(a) == 0)return vi(1);    ll dec = ('0' <= a[0] && a[0] <= '9') ? '0' : 0;    vector<ll> ret(a.size() + 1);    rep(i, a.size())ret[i + 1] = ret[i] + a[i] - dec;    return ret;}\n\nruiC<ll> ruic(string &a) {    vector<ll> ret = ruiv(a);    return ruiC<ll>(ret);}\n\n                        \n\ntemplate<class T, class U> vi ruiv(T &a, U k) {    vi ret(a.size() + 1);    rep(i, a.size())ret[i + 1] = ret[i] + (a[i] == k);    return ret;}\n\ntemplate<class T, class U> ruiC<ll> ruic(T &a, U k) {    vi ret = ruiv(a, k);    return ruiC<ll>(ret);}\n\ntemplate<class T> struct ruiC2 {\n\n  int H;\n\n  vector<ruiC<T>> rui;\n\n  ruiC2(vector<vector<T>> &ru) : rui(sz(ru)), H(sz(ru)) { for (int h = 0; h < H; h++) { rui[h] = ruic(ru[h]); }}\n\n                             \n\n  vector<T> operator()(ll l, ll r) {        if (l > r) {            cerr << \"ruic \";            deb(l, r);            assert(0);        }        vector<T> res(H);        for (int h = 0; h < H; h++)res[h] = rui[h](l, r);        return res;    }\n\n                             \n\n  ruiC<T> &operator[](ll h) {        assert(h < H);        return rui[h];    }\n\n                                                                  \n\n                                                                                        \n\n                                                                                                \n\n                                                        \n\n                                                   \n\n                                     \n\n                                      \n\n                                       \n\n                                   \n\n};\n\n\n\n                     \n\n                                                            \n\n                         \n\nruiC2<ll> ruicou(str &a) {    str s = a;    replace(s);    vector<ruiC<ll>> res(26);    vvi(cou, 26, sz(s));    rep(i, sz(s)) { cou[s[i]][i] = 1; }    return ruiC2<ll>(cou);}\n\nruiC2<ll> ruicou(vi &a) {    int H = max(a) + 1;    vector<ruiC<ll>> res(H);    vvi(cou, H, sz(a));    rep(i, sz(a)) { cou[a[i]][i] = 1; }    return ruiC2<ll>(cou);}\n\ntemplate<class T, class U> ruiC<ll> ruicou(vector<T> &a, U b) {    vi cou(sz(a));    rep(i, sz(a)) { cou[i] = a[i] == b; }    return ruic(cou);}\n\n         \n\ntemplate<class T> vector<T> imoh(vector<vector<T>> &v, int w) {    vector<T> ret(sz(v));    rep(h, sz(ret)) { ret[h] = v[h][w]; }    rep(i, sz(ret) - 1) { ret[i + 1] += ret[i]; }    return ret;}\n\ntemplate<class T> vector<T> ruih(vector<vector<T>> &v, int w) {    vector<T> ret(sz(v) + 1);    rep(h, sz(v)) { ret[h + 1] = v[h][w]; }    rep(i, sz(v)) { ret[i + 1] += ret[i]; }    return ret;}\n\ntemplate<class T> ruiC<T> ruihc(vector<vector<T>> &a, int w) {    vector<T> ret = ruih(a, w);    return ruiC<T>(ret);}\n\n\n\n     \n\ntemplate<class T> struct ruixC {\n\n  vector<T> rui;\n\n  ruixC(vector<T> &ru) : rui(ru) {}\n\n  T operator()(ll l, ll r) {        if (l > r) {            cerr << \"ruiXc \";            deb(l, r);            assert(0);        }        return rui[r] ^ rui[l];    }\n\n  T operator[](ll i) { return rui[i]; }\n\n  T back() { return rui.back(); }\n\n  ll size() { return rui.size(); }\n\n};\n\ntemplate<class T> vector<T> ruix(vector<T> &a) {    vector<T> ret(a.size() + 1);    rep(i, a.size())ret[i + 1] = ret[i] ^ a[i];    return ret;}\n\ntemplate<class T> ruixC<ll> ruixc(vector<T> &a) {    vi ret = ruix(a);    return ruixC<ll>(ret);}\n\n                                                 \n\n           \n\n               \n\n                                   \n\n                                                                               \n\nvi ruix_diff(vi &A) {    int N = sz(A);    assert(N);    vi res(N + 1);    res[0] = A[0];    rep(i, 1, N) { res[i] = A[i - 1] ^ A[i]; }    res[N] = A[N - 1];    return res;}\n\n\n\ntemplate<class T> vector<T> ruim(vector<T> &a) {    vector<T> res(a.size() + 1, 1);    rep(i, a.size())res[i + 1] = res[i] * a[i];    return res;}\n\n                                      \n\ntemplate<class T> vector<T> ruimi(vector<T> &a) {ll n = sz(a);    vector<T> ret(n + 1);    rep(i, 1, n) {        ret[i] = a[i - 1];        chmi(ret[i + 1], ret[i]);    }    return ret;}\n\n                                           \n\n                                                  \n\ntemplate<class T> struct rruiC {\n\n  vector<T> rui;\n\n  int n;\n\n  rruiC(vector<T> &a) : n(sz(a)) {        rui.resize(n + 1);        rer(i, n - 1) { rui[i] = rui[i + 1] + a[i]; }    }\n\n             \n\n  T operator()(int r, int l) {        r++;        l++;        assert(l <= r && l >= 0 && r <= n);        return rui[l] - rui[r];    }\n\n  T operator()(int l) { return operator()(n - 1, l); }\n\n  T operator[](int i) { return operator()(i); }\n\n};\n\ntemplate<class T> ostream &operator<<(ostream &os, rruiC<T> a) {    fora(v, a.rui)os << v << \" \";    return os;}\n\n\n\n#define rrui rruic\n\ntemplate<class T> rruiC<T> rruic(vector<T> &a) { return rruiC<T>(a); }\n\n\n\n           \n\ntemplate<class T> struct ruimulC {\n\n  vector<T> rv;\n\n  int n;\n\n  ruimulC(vector<T> &a) : rv(a), n(sz(a)) {        rv.resize(n + 1);        rv[0] = 1;        rep(i, n) { rv[i + 1] = a[i] * rv[i]; }    }\n\n  ruimulC() : n(0) {        rv.resize(n + 1);        rv[0] = 1;    }\n\n  void operator+=(T v) {        rv.push_back(rv.back() * v);        n++;    }\n\n  T operator()(int l, int r) {        assert(l <= r && 0 <= l && r <= n);        return rv[r] / rv[l];    }\n\n  T operator()(int r = inf) { return operator()(0, min(r, n)); }\n\n  T operator[](int r) { return operator()(0, r); }\n\n  auto begin() { return rv.begin(); }\n\n  auto end() { return rv.end(); }\n\n};\n\ntemplate<class T> ruimulC<T> ruimul(vector<T> &a) { return ruimulC<T>(a); }\n\ntemplate<class T> ruimulC<T> ruimul() {    vector<T> a;    return ruimulC<T>(a);}\n\ntemplate<class T> T *rruim(vector<T> &a) {    ll len = a.size();    T *body = (T *) malloc((len + 1) * sizeof(T));    T *res = body + 1;    res[len - 1] = 1;    rer(i, len - 1)res[i - 1] = res[i] * a[i];    return res;}\n\ntemplate<class T, class U, class W> T lowerBound(ruiC <T> &a, U v, W banpei) { return lowerBound(a.rui, v, banpei); }\n\ntemplate<class T, class U, class W> T upperBound(ruiC <T> &a, U v, W banpei) { return upperBound(a.rui, v, banpei); }\n\ntemplate<class T, class U, class W> T rlowerBound(ruiC <T> &a, U v, W banpei) { return rlowerBound(a.rui, v, banpei); }\n\ntemplate<class T, class U, class W> T rupperBound(ruiC <T> &a, U v, W banpei) { return rupperBound(a.rui, v, banpei); }\n\n#endif\n\n\n\ntemplate<class T, class U> void inc(pair<T, U> &a, U v = 1) { a.first += v, a.second += v; }\n\ntemplate<class T, class U> void inc(T &a, U v = 1) { a += v; }\n\ntemplate<class T, class U = int> void inc(vector<T> &a, U v = 1) { for (auto &u:a)inc(u, v); }\n\ntemplate<class T, class U> void dec(T &a, U v = 1) { a -= v; }\n\ntemplate<class T, class U = int> void dec(vector<T> &a, U v = 1) { for (auto &u :a)dec(u, v); }\n\ntemplate<class U> void dec(string &a, U v = 1) { for (auto &u :a)dec(u, v); }\n\ntemplate<class T, class U, class W> void dec(vector<T> &a, vector<U> &b, W v = 1) {    for (auto &u :a)dec(u, v);    for (auto &u :b)dec(u, v);}\n\ntemplate<class T, class U, class W> void dec(vector<T> &a, vector<U> &b, vector<W> &c) {    for (auto &u :a)dec(u, 1);    for (auto &u :b)dec(u, 1);    for (auto &u :c)dec(u, 1);}\n\nbool ins(ll h, ll w, ll H, ll W) { return h >= 0 && w >= 0 && h < H && w < W; }\n\nbool san(ll l, ll v, ll r) { return l <= v && v < r; }\n\ntemplate<class T> bool ins(vector<T> &a, ll i, ll j = 0) { return san(0, i, sz(a)) && san(0, j, sz(a)); }\n\n#define inside ins\n\nll u0(ll a) { return a < 0 ? 0 : a; }\n\ntemplate<class T> vector<T> u0(vector<T> &a) {    vector<T> ret = a;    fora(v, ret)v = u(v);    return ret;}\n\n             \n\nbool d_(int a, int b) {    if (b == 0)return false;    return (a % b) == 0;}\n\n\n\n\n\n                    \n\n                           \n\n                         \n\n                                                          \n\n#ifdef _DEBUG\n\n                                                                                                \n\nauto my_powl(ll a, ll k) { return powl(a, k); }\n\nauto pow(ll a, ll k) {    static bool was = 1;    if (was) { message += \"if integer use *powi* it's very fast\\n\"; }    was = 0;    return my_powl(a, k);}\n\n                                               \n\nauto pow(signed a, ll k) { return pow((ll) a, k); }\n\nauto pow(signed a, signed k) { return pow((ll) a, (ll) k); }\n\n#endif\n\n\n\n                 \n\nint powi(int a, int k) {    if (a == 2)return 1ll << k;    int res = 1;    int x = a;    while (k) {        if (k & 1)res *= x;        x *= x;        k >>= 1;    }    return res;}\n\n                                                  \n\nbint pow(bint a, ll k) {    bint res = 1;    bint x = a;    while (k) {        if (k & 1)res *= x;        x *= x;        k >>= 1;    }    return res;}\n\nbint pow(bint a, signed k) { return pow(a, (ll) k); }\n\nbint powb(int a, int b) { return pow((bint) a, b); }\n\nconstexpr bool bget(ll m, ll keta) {\n\n#ifdef _DEBUG\n\n  assert(keta <= 62);                                                    \n\n#endif\n\n  return (m >> keta) & 1;\n\n}\n\n               \n\n                                            \n\nvector<vi> bget2(vi &a, int keta_size) {    vvi(res, keta_size, sz(a));    rep(k, keta_size) { rep(i, sz(a)) { res[k][i] = bget(a[i], k); }}    return res;}\n\nvi bget1(vi &a, int keta) {    vi res(sz(a));    rep(i, sz(a)) { res[i] = bget(a[i], keta); }    return res;}\n\nll bget(ll m, ll keta, ll sinsuu) {    m /= (ll) pow(sinsuu, keta);    return m % sinsuu;}\n\nconstexpr ll bit(ll n) {\n\n#ifdef _DEBUG\n\n  assert(n <= 62);                                                    \n\n#endif\n\n  return (1LL << (n));\n\n}\n\nll bit(ll n, ll sinsuu) { return (ll) pow(sinsuu, n); }\n\nll mask(ll n) { return (1ll << n) - 1; }\n\n                           \n\n               \n\nll bit(vi &a) {    int m = 0;    for (auto &&v:a) m |= bit(v);    return m;}\n\n\n\n                  \n\n                                                                             \n\nll bit_bool(vi &a) {    int m = 0;    rep(i, sz(a)) if (a[i])m |= bit(i);    return m;}\n\n#define bcou __builtin_popcountll\n\n                    \n\nll lbit(ll n) { assert(n);return n & -n; }\n\nll lbiti(ll n) { assert(n);return log2(n & -n); }\n\n                    \n\nll hbit(ll n) {    assert(n);n |= (n >> 1);    n |= (n >> 2);    n |= (n >> 4);    n |= (n >> 8);    n |= (n >> 16);    n |= (n >> 32);    return n - (n >> 1);}\n\nll hbiti(ll n) { assert(n);return log2(hbit(n)); }\n\n                                                                                                                                                        \n\n                        \n\nll nextComb(ll &mask, ll n, ll r) {    if (!mask)return mask = (1LL << r) - 1;    ll x = mask & -mask;                      ll y = mask + x;                                                    ll res = ((mask & ~y) / x >> 1) | y;    if (bget(res, n))return mask = 0; else return mask = res;}\n\n                                                                      \n\nvi bitCombList(ll n, ll r) {    vi res;    ll m = 0;    while (nextComb(m, n, r)) { res.push_back(m); }    return res;}\n\n#define forbit1_2(i, mas) for (int forbitj = lbit(mas), forbitm = mas, i = log2(forbitj); forbitm; forbitm = forbitj ? forbitm ^ forbitj : 0, forbitj = lbit(forbitm), i = log2(forbitj))\n\n#define forbit1_3(i, N, mas) for (int forbitj = lbit(mas), forbitm = mas, i = log2(forbitj); forbitm && i < N; forbitm = forbitj ? forbitm ^ forbitj : 0, forbitj = lbit(forbitm), i = log2(forbitj))\n\n                                  \n\n                           \n\n#define forbit1(...) over3(__VA_ARGS__, forbit1_3, forbit1_2)(__VA_ARGS__)\n\n                                        \n\n                         \n\n#define forbit0(i, N, mas) forbit1(i, mask(N) & (~(mas)))\n\n\n\n                                      \n\n                                                       \n\n#define forsub_all(m, M) for (int m = M; m != -1; m = m == 0 ? -1 : (m - 1) & M)\n\n\n\n\n\n                               \n\nvb bool_(vi a, int n) {    vb ret(max(max(a) + 1, n));    rep(i, sz(a))ret[a[i]] = true;    return ret;}\n\n\n\nchar itoal(ll i) { return 'a' + i; }\n\nchar itoaL(ll i) { return 'A' + i; }\n\nll altoi(char c) {    if ('A' <= c && c <= 'Z')return c - 'A';    return c - 'a';}\n\nll ctoi(char c) { return c - '0'; }\n\nchar itoc(ll i) { return i + '0'; }\n\nll vtoi(vi &v) {    ll res = 0;    if (sz(v) > 18) {        debugline(\"vtoi\");        deb(sz(v));        ole();    }    rep(i, sz(v)) {        res *= 10;        res += v[i];    }    return res;}\n\nvi itov(ll i) {    vi res;    while (i) {        res.push_back(i % 10);        i /= 10;    }    res = rev(res);    return res;}\n\nvi stov(string &a) {    ll n = sz(a);    vi ret(n);    rep(i, n) { ret[i] = a[i] - '0'; }    return ret;}\n\n                                             \n\nvi stov(string &a, char one) {    ll n = sz(a);    vi ret(n);    rep(i, n)ret[i] = a[i] == one;    return ret;}\n\nvector<vector<ll>> ctoi(vector<vector<char>> s, char c) {    ll n = sz(s), m = sz(s[0]);    vector<vector<ll>> res(n, vector<ll>(m));    rep(i, n)rep(j, m)res[i][j] = s[i][j] == c;    return res;}\n\n                      \n\n                   \n\n                                   \n\nvi compress(vi &a) {    vi b;    ll len = a.size();    for (ll i = 0; i < len; ++i) { b.push_back(a[i]); }    sort(b);    unique(b);    for (ll i = 0; i < len; ++i) { a[i] = lower_bound(all(b), a[i]) - b.begin(); }    ll blen = sz(b);    vi ret(blen);    rep(i, blen) { ret[i] = b[i]; }    return ret;}\n\n#ifdef use_compress\n\nvi compress(vi &a, umap<ll, ll> &map) {    vi b;    ll len = a.size();    for (ll i = 0; i < len; ++i) { b.push_back(a[i]); }    sort(b);    unique(b);    for (ll i = 0; i < len; ++i) {        ll v = a[i];        a[i] = lower_bound(all(b), a[i]) - b.begin();        map[v] = a[i];    }    ll blen = sz(b);    vi ret(blen);    rep(i, blen) { ret[i] = b[i]; }    return ret;}\n\nvi compress(vi &a, vi &r) {    vi b;    ll len = a.size();    fora(v, a)b.push_back(v);    fora(v, r)b.push_back(v);    sort(b);    unique(b);    for (ll i = 0; i < len; ++i) a[i] = lower_bound(all(b), a[i]) - b.begin();    for (ll i = 0; i < sz(r); ++i) r[i] = lower_bound(all(b), r[i]) - b.begin();    ll blen = sz(b);    vi ret(blen);    rep(i, blen) { ret[i] = b[i]; }    return ret;}\n\nvi compress(vi &a, vi &r, vi &s) {    vi b;    ll len = a.size();    fora(v, a)b.push_back(v);    fora(v, r)b.push_back(v);    fora(v, s)b.push_back(v);    sort(b);    unique(b);    for (ll i = 0; i < len; ++i) a[i] = lower_bound(all(b), a[i]) - b.begin();    for (ll i = 0; i < sz(r); ++i) r[i] = lower_bound(all(b), r[i]) - b.begin();    for (ll i = 0; i < sz(s); ++i) r[i] = lower_bound(all(b), s[i]) - b.begin();    ll blen = sz(b);    vi ret(blen);    rep(i, blen) { ret[i] = b[i]; }    return ret;}\n\nvi compress(vector<vi> &a) {    vi b;    fora(vv, a)fora(v, vv)b.push_back(v);    sort(b);    unique(b);    fora(vv, a)fora(v, vv)v = lower_bound(all(b), v) - b.begin();    ll blen = sz(b);    vi ret(blen);    rep(i, blen) { ret[i] = b[i]; }    return ret;}\n\nvi compress(vector<vector<vi >> &a) {    vi b;    fora(vvv, a)fora(vv, vvv)fora(v, vv)b.push_back(v);    sort(b);    unique(b);    fora(vvv, a)fora(vv, vvv)fora(v, vv)v = lower_bound(all(b), v) - b.begin();    ll blen = sz(b);    vi ret(blen);    rep(i, blen) { ret[i] = b[i]; }    return ret;}\n\nvoid compress(ll a[], ll len) {    vi b;    for (ll i = 0; i < len; ++i) { b.push_back(a[i]); }    sort(b);    unique(b);    for (ll i = 0; i < len; ++i) { a[i] = lower_bound(all(b), a[i]) - b.begin(); }}\n\n#endif\n\n                                                  \n\n#define binarySearch(a, v) (binary_search(all(a),v))\n\n#define lowerIndex(a, v) (lower_bound(all(a),v)-a.begin())\n\n#define upperIndex(a, v) (upper_bound(all(a),v)-a.begin())\n\n#define rlowerIndex(a, v) (upper_bound(all(a),v)-a.begin()-1)\n\n#define rupperIndex(a, v) (lower_bound(all(a),v)-a.begin()-1)\n\n\n\ntemplate<class T, class U, class W> T lowerBound(vector<T> &a, U v, W banpei) {    auto it = lower_bound(a.begin(), a.end(), v);    if (it == a.end())return banpei; else return *it;}\n\ntemplate<class T, class U, class W> T upperBound(vector<T> &a, U v, W banpei) {    auto it = upper_bound(a.begin(), a.end(), v);    if (it == a.end())return banpei; else return *it;}\n\ntemplate<class T, class U, class W> T rlowerBound(vector<T> &a, U v, W banpei) {    auto it = upper_bound(a.begin(), a.end(), v);    if (it == a.begin())return banpei; else { return *(--it); }}\n\ntemplate<class T, class U, class W> T rupperBound(vector<T> &a, U v, W banpei) {    auto it = lower_bound(a.begin(), a.end(), v);    if (it == a.begin())return banpei; else { return *(--it); }}\n\n\n\ntemplate<class T, class U, class W> T lowerBound(set<T> &a, U v, W banpei) {    auto it = a.lower_bound(v);    if (it == a.end())return banpei; else return *it;}\n\ntemplate<class T, class U, class W> T upperBound(set<T> &a, U v, W banpei) {    auto it = a.upper_bound(v);    if (it == a.end())return banpei; else return *it;}\n\ntemplate<class T, class U, class W> T rlowerBound(set<T> &a, U v, W banpei) {    auto it = a.upper_bound(v);    if (it == a.begin())return banpei; else { return *(--it); }}\n\ntemplate<class T, class U, class W> T rupperBound(set<T> &a, U v, W banpei) {auto it = a.lower_bound(v);if (it == a.begin())return banpei; else { return *(--it); }}\n\n\n\ntemplate<class T, class U, class W> T lowerBound(mset<T> &a, U v, W banpei) {    auto it = a.lower_bound(v);    if (it == a.end())return banpei; else return *it;}\n\ntemplate<class T, class U, class W> T upperBound(mset<T> &a, U v, W banpei) {    auto it = a.upper_bound(v);    if (it == a.end())return banpei; else return *it;}\n\ntemplate<class T, class U, class W> T rlowerBound(mset<T> &a, U v, W banpei) {    auto it = a.upper_bound(v);    if (it == a.begin())return banpei; else { return *(--it); }}\n\ntemplate<class T, class U, class W> T rupperBound(mset<T> &a, U v, W banpei) {auto it = a.lower_bound(v);if (it == a.begin())return banpei; else { return *(--it); }}\n\n#define next2(a) next(next(a))\n\n#define prev2(a) prev(prev(a))\n\n\n\n                                          \n\ntemplate<class T> int lis(vector<T> &a) {    int n = sz(a);    vi tail(n + 1, MAX<T>());    rep(i, n) {        int id = lowerIndex(tail, a[i]);            tail[id] = a[i];    }    return lowerIndex(tail, MAX<T>());}\n\ntemplate<class T> int lis_eq(vector<T> &a) {    int n = sz(a);    vi tail(n + 1, MAX<T>());    rep(i, n) {        int id = upperIndex(tail, a[i]);            tail[id] = a[i];    }    return lowerIndex(tail, MAX<T>());}\n\n\n\n                   \n\n                                                          \n\n                                         \n\ntemplate<class T, class U, class V> auto lower_map(map<T, U> &m, V k) {    auto ret = m.lower_bound(k);    while (ret != m.end() && (*ret).second == 0) {        ret = m.erase(ret);    }    return ret;}\n\ntemplate<class T, class U, class V> auto upper_map(map<T, U> &m, V k) {    auto ret = m.upper_bound(k);    while (ret != m.end() && (*ret).second == 0) {        ret = m.erase(ret);    }    return ret;}\n\n                                \n\ntemplate<class T, class U, class V> auto rlower_map(map<T, U> &m, V k) {    auto ret = upper_map(m, k);    assert(ret != m.begin());    ret--;    while (1) {        if ((*ret).second != 0)break;        assert(ret != m.begin());        auto next = ret;        --next;        m.erase(ret);        ret = next;    }    return ret;}\n\ntemplate<class T, class U, class V> auto rupper_map(map<T, U> &m, V k) {    auto ret = lower_map(m, k);    assert(ret != m.begin());    ret--;    while (1) {        if ((*ret).second != 0)break;        assert(ret != m.begin());        auto next = ret;        --next;        m.erase(ret);        ret = next;    }    return ret;}\n\n\n\ntemplate<class... T> void fin(T... s) {out(s...); exit(0); }\n\n\n\n                    \n\n             \n\nbool subset(int sub, int top) {return (sub & top) == sub;}\n\n                   \n\ndouble atand(double h, double w) {return atan2(h, w) / PI * 180;}\n\n                                             \n\nll mod(ll a, ll m) {if (m < 0) m *= -1;return (a % m + m) % m;}\n\nll pow(ll a) { return a * a; };\n\nll fact(ll v) { return v <= 1 ? 1 : v * fact(v - 1); }\n\ndou factd(int v){static vd fact(2,1);    if(sz(fact)<=v){        rep(i,sz(fact),v+1){            fact.push_back(fact.back()*i);        }    }    return fact[v];}\n\n\n\nll comi(ll n, ll r) {    assert(n < 100);    static vvi(pas, 100, 100);    if (pas[0][0])return pas[n][r];    pas[0][0] = 1;    rep(i, 1, 100) {        pas[i][0] = 1;        rep(j, 1, i + 1)pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];    }    return pas[n][r];}\n\n                                \n\nint com_mod2(int n,int r){return n == ( r | (n - r) );}\n\ndouble comd2(ll n, ll r) {    static vvd(comb, 2020, 2020);    if (comb[0][0] == 0) {        comb[0][0] = 1;        rep(i, 2000) {            comb[i + 1][0] = 1;            rep(j, 1, i + 2) { comb[i + 1][j] = comb[i][j] + comb[i][j - 1]; }        }    }    return comb[n][r];}\n\ndouble comd(int n, int r) {    if (r < 0 || r > n) return 0;    if (n < 2020)return comd2(n, r);    static vd fact(2, 1);    if (sz(fact) <= n) { rep(i, sz(fact), n + 1) { fact.push_back(fact.back() * i); }}    return fact[n] / fact[n - r] / fact[r];}\n\n\n\nll gcd(ll a, ll b) {while (b) a %= b, swap(a, b);return abs(a);}\n\nll gcd(vi b) {ll res = b[0];rep(i, 1, sz(b))res = gcd(b[i], res);return res;}\n\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n\nll lcm(vi a) {ll res = a[0];rep(i, 1, sz(a))res = lcm(a[i], res);return res;}\n\nll ceil(ll a, ll b) {if (b == 0) {debugline(\"ceil\");deb(a, b);ole();return -1;} else if (a < 0) { return 0; } else { return (a + b - 1) / b; }}\n\n\n\nll sig0(int t) { return t <= 0 ? 0 : ((1 + t) * t) >> 1; }\n\nbint sig0(bint t) {return t <= 0 ? 0 : ((1 + t) * t) >> 1; }\n\n                                                             \n\nll sig(ll s, ll t) {if (s > t)swap(s, t);return sig0(t - s) + s * (t - s + 1);}\n\n\n\n#define tousa_i tosa_i\n\n#define lower_tousa_i lower_tosa_i\n\n#define upper_tousa upper_tosa\n\n#define upper_tousa_i upper_tosa_i\n\nll tosa_i(ll st, ll ad, ll v) {    assert(((v - st) % ad) == 0);    return (v - st) / ad;}\n\nll tosa_s(ll st, ll ad, ll len) {    return st * len + sig0(len - 1) * ad;}\n\n\n\n                                                                                            \n\nll lower_tosa(ll st, ll ad, ll v) {    if (st >= v) return st;    return (v - st + ad - 1) / ad * ad + st;}\n\n              \n\nll lower_tosa_i(ll st, ll ad, ll v) {    if (st >= v) return 0;    return (v - st + ad - 1) / ad;}\n\nll upper_tosa(ll st, ll ad, ll v) { return lower_tosa(st, ad, v + 1); }\n\nll upper_tosa_i(ll st, ll ad, ll v) { return lower_tosa_i(st, ad, v + 1); }\n\n\n\n                                              \n\nP drange_ika(int a, int b) {    P null_p = mp(linf, linf);    if (b == 0) {        if (a >= 0) {            return mp(-linf, linf + 1)          ;        } else {            return null_p          ;        }    } else {        if (a >= 0) {            if (b > 0) {                return mp(-linf, a / b + 1);            } else {                return mp(-(a / -b), linf + 1);            }        } else {            if (b > 0) {                return mp(-linf, -ceil(-a, b) + 1);            } else {                return mp(ceil(-a, -b), linf + 1);            }        }    }}\n\n\n\n                                        \n\nll sqrt(ll a) {    if (a < 0) {        debugline(\"sqrt\");        deb(a);        ole();    }    ll res = (ll) std::sqrt(a);    while (res * res < a)++res;    return res;}\n\ndouble log(double e, double x) { return log(x) / log(e); }\n\n\n\n\n\n                  \n\n\n\n              \n\n#define dtie(a, b) int a, b; tie(a, b)\n\ntemplate<class T, class U> string to_string(T a, U b) {    string res = \"\";    res += a;    res += b;    return res;}\n\ntemplate<class T, class U, class V> string to_string(T a, U b, V c) {    string res = \"\";    res += a;    res += b;    res += c;    return res;}\n\ntemplate<class T, class U, class V, class W> string to_string(T a, U b, V c, W d) {    string res = \"\";    res += a;    res += b;    res += c;    res += d;    return res;}\n\ntemplate<class T, class U, class V, class W, class X> string to_string(T a, U b, V c, W d, X e) {    string res = \"\";    res += a;    res += b;    res += c;    res += d;    res += e;    return res;}\n\n\n\ntemplate<class T> vector<T> sub(const vector<T> &A, int l, int r) {    assert(0 <= l && l <= r && r <= sz(A));    vector<T> ret(r - l);    std::copy(A.begin() + l, A.begin() + r, ret.begin());    return ret;}\n\ntemplate<class T> vector<T> sub(const vector<T> &A, int r) { return sub(A, 0, r); }\n\ntemplate<class T> vector<T> subn(const vector<T> &A, int l, int len) { return sub(A, l, l + len); }\n\nstring sub(string &A, int l, int r) {    assert(0 <= l && l <= r && r <= sz(A));    return A.substr(l, r - l);}\n\n\n\n\n\nconstexpr int bsetlen = k5 * 2;\n\n                               \n\n#define bset bitset<bsetlen>\n\nbool operator<(bitset<bsetlen> &a, bitset<bsetlen> &b) {rer(i, bsetlen - 1) {if (a[i] < b[i])return true;if (a[i] > b[i])return false;}return false;}\n\nbool operator>(bitset<bsetlen> &a, bitset<bsetlen> &b) {rer(i, bsetlen - 1) {if (a[i] > b[i])return true;if (a[i] < b[i])return false;}return false;}\n\nbool operator<=(bitset<bsetlen> &a, bitset<bsetlen> &b) {rer(i, bsetlen - 1) {if (a[i] < b[i])return true;if (a[i] > b[i])return false;}return true;}\n\nbool operator>=(bitset<bsetlen> &a, bitset<bsetlen> &b) {rer(i, bsetlen - 1) {if (a[i] > b[i])return true;if (a[i] < b[i])return false;}return true;}\n\nstring operator~(string &a) {string res = a;for (auto &&c:res) {if (c == '0')c = '1';else if (c == '1')c = '0';else {cerr << \"cant ~\" << a << \"must bit\" << endl;exit(0);}}return res;}\n\nostream &operator<<(ostream &os, bset& a) {    bitset<10> b;    vi list;    rep(i,bsetlen){        if(a[i])list.push_back(i),b[i]=1;    }    os<<b<<\", \"<<list;    return os;}\n\nint hbiti(bset&a){rer(i,bsetlen){if(a[i])return i;}return -1;}\n\n#define hk(a, b, c) (a <= b && b < c)\n\n\n\n         \n\nbset nap(bset &a, int v) {bset r = a | a << v;return r;}\n\nbset nap(bset &a, bset &v) {bset r = a;rep(i, bsetlen) {if (v[i])r |= a << i;}return r;}\n\n\n\ntemplate<class T> int count(set<T> &S, T l, T r) {    assert(l < r);    auto it = S.lower_bound(l);    return it != S.end() && (*it) < r;}\n\n\n\ntemplate<class T> void seth(vector<vector<T>> &S, int w, vector<T> &v) {assert(sz(S) == sz(v));assert(w < sz(S[0]));rep(h, sz(S)) { S[h][w] = v[h]; }}\n\n\n\ntemplate<class T, class U> void operator+=(pair<T,U> &a, pair<T,U> & b) {a.fi+=b.fi;a.se+=b.se;}\n\ntemplate<class T, class U> pair<T,U> operator+(pair<T,U> &a, pair<T,U> & b) {return pair<T,U>(a.fi+b.fi,a.se+b.se);}\n\ntemplate<typename CharT, typename Traits, typename Alloc> basic_string<CharT, Traits, Alloc> operator+(const basic_string<CharT, Traits, Alloc> &lhs, const int rv) {\n\n#ifdef _DEBUG\n\n  static bool was = false;if (!was)message += \"str += 65  is  'A'  not \\\"65\\\" \";was = true;\n\n#endif\n\n  return lhs + (char) rv;\n\n}\n\ntemplate<typename CharT, typename Traits, typename Alloc> void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const int rv) {    lhs = lhs + rv;}\n\ntemplate<typename CharT, typename Traits, typename Alloc> basic_string<CharT, Traits, Alloc> operator+(const basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {    const int rv2 = rv;    return lhs + rv2;}\n\ntemplate<typename CharT, typename Traits, typename Alloc> void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {const int v = rv; lhs += v; }\n\ntemplate<typename CharT, typename Traits, typename Alloc> void operator*=(basic_string<CharT, Traits, Alloc> &s, int num) {    auto bek = s;    s = \"\";    for (; num; num >>= 1) {        if (num & 1) { s += bek; }        bek += bek;    }}\n\ntemplate<class T, class U> void operator+=(queue<T> &a, U v) { a.push(v); }template<class T, class U> void operator+=(deque<T> &a, U v) { a.push_back(v); }template<class T> priority_queue<T, vector<T>, greater<T> > &operator+=(priority_queue<T, vector<T>, greater<T> > &a, vector<T> &v) {    fora(d, v)a.push(d);    return a;}template<class T, class U> priority_queue<T, vector<T>, greater<T> > &operator+=(priority_queue<T, vector<T>, greater<T> > &a, U v) {    a.push(v);    return a;}template<class T, class U> priority_queue<T> &operator+=(priority_queue<T> &a, U v) {    a.push(v);    return a;}template<class T> set<T> &operator+=(set<T> &a, vector<T> v) {    fora(d, v)a.insert(d);    return a;}template<class T, class U> auto operator+=(set<T> &a, U v) { return a.insert(v); }template<class T, class U> auto operator-=(set<T> &a, U v) { return a.erase(v); }template<class T, class U> auto operator+=(mset<T> &a, U v) { return a.insert(v); }template<class T, class U> set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {    a.insert(v);    return a;}template<class T, class U> vector<T> &operator+=(vector<T> &a, U v) {    a.push_back(v);    return a;}template<class T, class U> vector<T> operator+(vector<T> &a, U v) {    vector<T> ret = a;    ret += v;    return ret;}template<class T, class U> vector<T> operator+(U v,const vector<T> &a) {    vector<T> ret = a;    ret.insert(ret.begin(), v);    return ret;}template<class T> vector<T> operator+(const vector<T>& a, const vector<T>& b) {    vector<T> ret;    ret = a;    fora(v, b)ret += v;    return ret;}template<class T> vector<T> &operator+=(vector<T> &a,const vector<T> &b) {    rep(i, sz(b)) {                                                                      a.push_back(b[i]); }    return a;}template<class T, class U> map<T, U> &operator+=(map<T, U> &a, map<T, U> &b) {    fora(bv, b) { a[bv.first] += bv.second; }    return a;}\n\ntemplate<class T> vector<T> operator%(vector<T>& a, int v){    vi ret(sz(a));    rep(i,sz(a)){        ret[i] = a[i] % v;    }    return ret;}\n\ntemplate<class T> vector<T> operator%=(vector<T>& a, int v){    rep(i,sz(a)){        a[i] %= v;    }    return a;}\n\nvi operator&(vi& a, vi& b){    assert(sz(a)==sz(b));    vi ret(sz(a));    rep(i,sz(a)){        ret[i] = min(a[i],b[i]);    }    return ret;}\n\ntemplate<class T> void operator+=(mset<T> &a, vector<T>& v) { for(auto&& u : v)a.insert(u); }\n\ntemplate<class T> void operator+=(set<T> &a, vector<T>& v) { for(auto&& u : v)a.insert(u); }\n\ntemplate<class T> void operator+=(vector<T> &a, set<T>& v) { for(auto&& u : v)a.emplace_back(u); }\n\ntemplate<class T> void operator+=(vector<T> &a, mset<T>& v) { for(auto&& u : v)a.emplace_back(u); }\n\ntemplate<class T> vector<T> &operator-=(vector<T> &a, vector <T> &b) {    if (sz(a) != sz(b)) {        debugline(\"vector<T> operator-=\");        deb(a);        deb(b);        exit(0);    }    rep(i, sz(a))a[i] -= b[i];    return a;}\n\ntemplate<class T> vector<T> operator-(vector<T> &a, vector<T> &b) {    if (sz(a) != sz(b)) {        debugline(\"vector<T> operator-\");        deb(a);        deb(b);        ole();    }    vector<T> res(sz(a));    rep(i, sz(a))res[i] = a[i] - b[i];    return res;}\n\n                                                                                                                       \n\ntemplate<typename T> void erase(vector<T> &v, unsigned ll i) { v.erase(v.begin() + i); }\n\ntemplate<typename T> void erase(vector<T> &v, unsigned ll s, unsigned ll e) { v.erase(v.begin() + s, v.begin() + e); }\n\ntemplate<typename T> void pop_front(vector<T> &v) { erase(v, 0); }\n\ntemplate<typename T> void entry(vector<T> &v, unsigned ll s, unsigned ll e) { erase(v, e, sz(v));erase(v,0,s);}\n\n\n\ntemplate<class T, class U> void erase(map<T, U> &m, ll okl, ll ngr) { m.erase(m.lower_bound(okl), m.lower_bound(ngr)); }\n\ntemplate<class T> void erase(set<T> &m, ll okl, ll ngr) { m.erase(m.lower_bound(okl), m.lower_bound(ngr)); }\n\ntemplate<typename T> void erasen(vector<T> &v, unsigned ll s, unsigned ll n) { v.erase(v.begin() + s, v.begin() + s + n); }\n\ntemplate<typename T, typename U> void insert(vector<T> &v, unsigned ll i, U t) { v.insert(v.begin() + i, t); }\n\ntemplate<typename T, typename U> void push_front(vector<T> &v, U t) { v.insert(v.begin(), t); }\n\ntemplate<typename T, typename U> void insert(vector<T> &v, unsigned ll i, vector<T> list) { for (auto &&va:list)v.insert(v.begin() + i++, va); }\n\ntemplate<typename T> void insert(set<T> &v, vector<T> list) { for (auto &&va :list)v.insert(va); }\n\ntemplate<class T> T poll(set<T>& S){T ret = *S.begin();S.erase(S.begin());return ret;}\n\ntemplate<class T> T poll(mset<T>& S){T ret = *S.begin();S.erase(S.begin());return ret;}\n\ntemplate<class T> T poll_back(set<T>& S){T ret = *S.rbegin();S.erase(S.rbegin());return ret;}\n\ntemplate<class T> T poll_back(mset<T>& S){T ret = *S.rbegin();S.erase(S.rbegin());return ret;}\n\ntemplate<class T> T peek(set<T>& S){T ret = *S.begin();return ret;}\n\ntemplate<class T> T peek(mset<T>& S){T ret = *S.begin();return ret;}\n\ntemplate<class T> T peek_back(set<T>& S){T ret = *S.rbegin();return ret;}\n\ntemplate<class T> T peek_back(mset<T>& S){T ret = *S.rbegin();return ret;}\n\nvector<string> split(const string a, const char deli) {    string b = a + deli;    ll l = 0, r = 0, n = b.size();    vector<string> res;    rep(i, n) {        if (b[i] == deli) {            r = i;            if (l < r)res.push_back(b.substr(l, r - l));            l = i + 1;        }    }    return res;}\n\nvector<string> split(const string a, const string deli) {    vector<string> res;    ll kn = sz(deli);    std::string::size_type Pos(a.find(deli));    ll l = 0;    while (Pos != std::string::npos) {        if (Pos - l)res.push_back(a.substr(l, Pos - l));        l = Pos + kn;        Pos = a.find(deli, Pos + kn);    }    if (sz(a) - l)res.push_back(a.substr(l, sz(a) - l));    return res;}\n\nll stoi(string& s){return stol(s);}\n\n#define assert_yn(yn_v, v); assert(yn_v == 0 || yn_v == v);yn_v = v;\n\n                                                   \n\nint yn_v = 0;\n\nvoid yn(bool a) { assert_yn(yn_v, 1);if (a)cout << \"yes\" << endl; else cout << \"no\" << endl; }\n\nvoid fyn(bool a) {    assert_yn(yn_v, 1);yn(a);    exit(0);}\n\n\n\nvoid Yn(bool a) { assert_yn(yn_v, 2);if (a)cout << \"Yes\" << endl; else cout << \"No\" << endl; }\n\nvoid fYn(bool a) {    assert_yn(yn_v, 2);Yn(a);    exit(0);}\n\n\n\nvoid YN(bool a) { assert_yn(yn_v, 3);if (a)cout << \"YES\" << endl; else cout << \"NO\" << endl; }\n\nvoid fYN(bool a) {    assert_yn(yn_v, 3);YN(a);    exit(0);}\n\nint ab_v = 0;\n\nvoid fAb(bool a) { assert_yn(ab_v, 1);if(a)cout<<\"Alice\"<<endl;else cout<<\"Bob\";}\n\nvoid fAB(bool a) { assert_yn(yn_v, 2);if(a)cout<<\"ALICE\"<<endl;else cout<<\"BOB\";}\n\nint pos_v = 0;\n\nvoid Possible(bool a) {    assert_yn(pos_v, 1);if (a)cout << \"Possible\" << endl; else cout << \"Impossible\" << endl;    exit(0);}\n\nvoid POSSIBLE(bool a) {    assert_yn(pos_v, 2);if (a)cout << \"POSSIBLE\" << endl; else cout << \"IMPOSSIBLE\" << endl;    exit(0);}\n\nvoid fPossible(bool a) {    assert_yn(pos_v, 1)Possible(a);exit(0);}\n\nvoid fPOSSIBLE(bool a) {    assert_yn(pos_v, 2)POSSIBLE(a);exit(0);}\n\ntemplate<typename T> class fixed_point        : T {public:    explicit constexpr fixed_point(T &&t) noexcept: T(std::forward<T>(t)) {}    template<typename... Args> constexpr decltype(auto) operator()(Args &&... args) const { return T::operator()(*this, std::forward<Args>(args)...); }};template<typename T> static inline constexpr decltype(auto) fix(T &&t) noexcept { return fixed_point<T>{std::forward<T>(t)}; }\n\n\n\n\n\n           \n\n                                                    \n\ntemplate<class T> auto irekae(vector<vector<vector<T> > > &A, int x, int y, int z) {\n\n#define irekae_resize_loop(a, b, c) resize(res,a,b,c);rep(i,a)rep(j,b)rep(k,c)\n\n  vector<vector<vector<T> > > res;    if (x == 0 && y == 1 && z == 2) {        res = A;    } else if (x == 0 && y == 2 && z == 1) {        irekae_resize_loop(sz(A), sz(A[0][0]), sz(A[0])) {                    res[i][j][k] = A[i][k][j];                }    } else if (x == 1 && y == 0 && z == 2) {        irekae_resize_loop(sz(A[0]), sz(A), sz(A[0][0])) {                    res[i][j][k] = A[j][i][k];                }    } else if (x == 1 && y == 2 && z == 0) {        irekae_resize_loop(sz(A[0]), sz(A[0][0]), sz(A)) {                    res[i][j][k] = A[k][i][j];                }    } else if (x == 2 && y == 0 && z == 1) {        irekae_resize_loop(sz(A[0][0]), sz(A), sz(A[0])) {                    res[i][j][k] = A[j][k][i];                }    } else if (x == 2 && y == 1 && z == 0) {        irekae_resize_loop(sz(A[0][0]), sz(A[0]), sz(A)) {                    res[i][j][k] = A[k][j][i];                }    }    return res;\n\n#undef irekae_resize_loop\n\n}\n\ntemplate<class T> auto irekae(vector<vector<T>>&A,int i=1,int j=0){    vvt(res,sz(A[0]),sz(A));    rep(i,sz(A)){        rep(j,sz(A[0])){            res[j][i]=A[i][j];        }    }    return res;}\n\n                 \n\ntemplate<typename T> vector<vector<T>> cut(vector<T> &a, int tou = 2) {    int N = sz(a);    vector<vector<T>> res(tou);    int hab = N / tou;    vi lens(tou, hab);    rep(i, N % tou) { lens[tou - 1 - i]++; }    int l = 0;    rep(i, tou) {        int len = lens[i];        int r = l + len;        res[i].resize(len);        std::copy(a.begin() + l, a.begin() + r, res[i].begin());        l = r;    }    return res;}\n\n                           \n\ntemplate<typename T> vector<vector<T>> cutn(vector<T> &a, int len) {    int N = sz(a);    vector<vector<T>> res(ceil(N, len));    vi lens(N / len, len);    if (N % len)lens.push_back(N % len);    int l = 0;    rep(i, sz(lens)) {        int len = lens[i];        int r = l + len;        res[i].resize(len);        std::copy(a.begin() + l, a.begin() + r, res[i].begin());        l = r;    }    return res;}\n\n              \n\nvi& geth(vvi()& a, int w){    static vi ret; ret.resize(sz(a));   rep(i,sz(a)){        ret[i] = a[i][w];    }    return ret;}\n\n\n\n            \n\nstruct initon {\n\n  initon() {\n\n    cin.tie(0);\n\n    ios::sync_with_stdio(false);\n\n    cout.setf(ios::fixed);\n\n    cout.precision(16);\n\n    srand((unsigned) clock() + (unsigned) time(NULL));\n\n  };\n\n} initonv;\n\n#define pre prev\n\n#define nex next\n\n\n\n            \n\n              \n\nconst string udlr = \"udlr\";\n\nstring UDLR = \"UDLR\";                                     \n\nvc atoz = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x','y', 'z'};\n\nvc AtoZ = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X','Y', 'Z'};\n\n                 \n\nconstexpr ll h4[] = {1, -1, 0, 0};\n\nconstexpr ll w4[] = {0, 0, -1, 1};\n\nconstexpr ll h8[] = {0, 1, 0, -1, -1, 1, 1, -1};\n\nconstexpr ll w8[] = {1, 0, -1, 0, 1, -1, 1, -1};\n\nint mei_inc(int h, int w, int H, int W, int i) {while (++i < 4) { if (inside(h + h4[i], w + w4[i], H, W))return i; }return i;}\n\n#define mei(nh, nw, h, w) for (int i = mei_inc(h, w, H, W, -1), nh = i<4? h + h4[i] : 0, nw = i<4? w + w4[i] : 0; i < 4; i=mei_inc(h,w,H,W,i), nh = h+h4[i], nw = w+w4[i])\n\nint mei_inc8(int h, int w, int H, int W, int i) {    while (++i < 8) {        if (inside(h + h8[i], w + w8[i], H, W))return i;    }    return i;}\n\n#define mei8(nh, nw, h, w) for (int i = mei_inc8(h, w, H, W, -1), nh = i<8? h + h8[i] : 0, nw = i<8? w + w8[i] : 0; i < 8; i=mei_inc8(h,w,H,W,i), nh = h+h8[i], nw = w+w8[i])\n\nint mei_incv(int h, int w, int H, int W, int i, vp &p) {    while (++i < sz(p)) { if (inside(h + p[i].fi, w + p[i].se, H, W))return i; }    return i;}\n\n#define meiv(nh, nw, h, w, p) for (int i = mei_incv(h, w, H, W, -1, p), nh = i<sz(p)? h + p[i].fi : 0, nw = i<sz(p)? w + p[i].se : 0; i < sz(p); i=mei_incv(h,w,H,W,i,p), nh = h+p[i].fi, nw = w+p[i].se)\n\n\n\n                                            \n\n        \n\nvector<vp> naname_list_ne(int H, int W) {    vector<vp> res(H + W - 1);    rep(sh, H) {        int sw = 0;        res[sh] += mp(sh, sw);        int nh = sh;        int nw = sw;        while (1) {            nh--;            nw++;            if (0 <= nh && nw < W) {                res[sh] += mp(nh, nw);            }else{                break;            }        }    }    rep(sw, 1, W) {        int sh = H - 1;        res[H + sw - 1] += mp(sh, sw);        int nh = sh;        int nw = sw;        while (1) {            nh--;            nw++;            if (0 <= nh && nw < W) {                res[H + sw-1] += mp(nh, nw);            }else{                break;            }        }    }    return res;}\n\n        \n\nvector<vp> naname_list_se(int H, int W) {    vector<vp> res(H + W - 1);    rep(sh, H) {        int sw = 0;        res[sh] += mp(sh, sw);        int nh = sh;        int nw = sw;        while (1) {            nh++;            nw++;            if (0 <= nh && nh< H && nw < W) { res[sh] += mp(nh, nw); } else { break; }        }    }    rep(sw, 1, W) {        int sh = 0;        res[H + sw - 1] += mp(sh, sw);        int nh = sh;        int nw = sw;        while (1) {            nh++;            nw++;            if (0 <= nh && nh < H && nw < W) { res[H + sw - 1] += mp(nh, nw); } else { break; }        }    }    return res;}\n\n\n\n                              \n\n                                                                                      \n\n#define getid_2(h, w) ((h) * (W) + (w))\n\n#define getid_1(p) ((p).first * W + (p).second)\n\n#define getid(...) over2(__VA_ARGS__, getid_2, getid_1) (__VA_ARGS__)\n\n#define getp(id) mp(id / W, id % W)\n\n                                                                                   \n\n                                                                  \n\n                                                \n\nvb bit_bool(int v, int len) {    assert(bit(len) > v);    vb ret(len);    rep(i, len) { ret[i] = bget(v, i); }    return ret;}\n\nvi &range(int l, int r) {static vi ret;ret.resize(r - l);rep(v, l, r) {ret[v - l] = v;}return ret;}\n\nvi &range(int r) {return range(0, r);}\n\nvi tov(vb& a){    vi ret;    rep(i,sz(a)){        if(a[i])ret.push_back(i);    }    return ret;}\n\nbool kaibun(const str& S){return S==rev(S);}\n\n                 \n\ntemplate<class T> vector<T> repeat(const vector<T> &A, int kaisu) {\n\n  vector<T> ret;\n\n  while (kaisu--) {\n\n    ret += A;\n\n  }\n\n  return ret;\n\n}\n\n                  \n\n#define rge range\n\n#define upd update\n\n                       \n\n                 \n\n                             \n\n                   \n\n                  \n\n                  \n\n                                             \n\n                       \n\n#define VEC vector\n\nvvc (ba);\n\nll N, M, H, W;\n\nvi A, B, C;\n\n\n\n\n\nvoid solve() {\n\n  in(N);\n\n  vs S;\n\n  na(S, 3);\n\n  int cou = 0;\n\n  rep(i, N) {\n\n    setc s;\n\n    s += S[0][i];\n\n    s += S[1][i];\n\n    s += S[2][i];\n\n    cou += sz(s) - 1;\n\n  }\n\n  out(cou);\n\n\n\n}\n\n\n\nauto my(ll n, vi &a) {\n\nreturn 0;\n\n}\n\n\n\nauto sister(ll n, vi &a) {\n\n  ll ret = 0;\n\n  return ret;\n\n}\n\n\n\nsigned main() {\n\n  solve();\n\n\n\n#define arg n,a\n\n#ifdef _DEBUG\n\n\n\n  bool bad = 0;\n\n  for (ll i = 0, ok = 1; i < k5 && ok; ++i) {\n\n    ll n = rand(1, 8);\n\n    vi a = ranv(n, 1, 10);\n\n    auto myres = my(arg);\n\n    auto res = sister(arg);\n\n    ok = myres == res;\n\n    if (!ok) {\n\n      out(arg);\n\n      cerr << \"AC : \" << res << endl;\n\n      cerr << \"MY  : \" << myres << endl;\n\n      bad = 1;\n\n\n\n\n\n      break;\n\n    }\n\n  }\n\n  if (!bad) {\n\n                                                             \n\n                                                                            \n\n                                                                   \n\n  }\n\n  if (was_deb && sz(res_mes)) {\n\n    cerr << \"result = \" << endl << res_mes << endl;\n\n  }\n\n  if (sz(message)) {\n\n    cerr << \"****************************\" << endl;\n\n    cerr << \"Note.\" << endl;\n\n    cerr << message << endl;\n\n    cerr << \"****************************\" << endl;\n\n  }\n\n#endif\n\n  return 0;\n\n};\n"}
{"fast_code_id":"3feaea1a6ca4e6ab48ae30a801b6c33aa64f4685b7781ed2c67710ed0cbd9097","fast_id":"7fcfaad0bb5308f6436398c2745cc8a47bc7d2f66cbfe3ef6f7f141577718f82","fast_time":0.0196799929,"language":"cpp","measured_fast_code_id":"7fcfaad0bb5308f6436398c2745cc8a47bc7d2f66cbfe3ef6f7f141577718f82","measured_slow_code_id":"630b06400e4f0f004f566c4c1f9447cc2f76f4bf04f7820d79f9befb81f9fa6c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72056","problem_id":"p03807","slow_code_id":"a33884a0cfab447b7755e81ec65dff9f9f360d55169ce81b3a83acc4d0fad032","slow_id":"630b06400e4f0f004f566c4c1f9447cc2f76f4bf04f7820d79f9befb81f9fa6c","slow_time":0.1898288821,"speedup":9.645780009402342,"stratum":"8+","sampling_key":"96d757626c1bc9957580bd13ffd6fa59a5e213de09ca68406c3f0ef07e45ff6e","slow_code":"#include <iostream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <string>\n\n#include <cstring>\n\n#include <deque>\n\n#include <list>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <utility>\n\n#include <algorithm>\n\n#include <map>\n\n#include <set>\n\n#include <complex>\n\n#include <cmath>\n\n#include <limits>\n\n#include <cfloat>\n\n#include <climits>\n\n#include <ctime>\n\n#include <cassert>\n\nusing namespace std;\n\n#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)\n\n#define repq(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)\n\n#define repr(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)\n\n#define all(v) begin(v), end(v)\n\n#define pb(a) push_back(a)\n\n#define fr first\n\n#define sc second\n\n#define INF 2000000000\n\n#define int long long int\n\n#define X real()\n\n#define Y imag()\n\n#define EPS (1e-10)\n\n#define EQ(a, b) (abs((a) - (b)) < EPS)\n\n#define EQV(a, b) (EQ((a).X, (b).X) && EQ((a).Y, (b).Y))\n\n#define LE(n, m) ((n) < (m) + EPS)\n\n#define LEQ(n, m) ((n) <= (m) + EPS)\n\n#define GE(n, m) ((n) + EPS > (m))\n\n#define GEQ(n, m) ((n) + EPS >= (m))\n\ntypedef vector<int> VI;\n\ntypedef vector<VI> MAT;\n\ntypedef pair<int, int> pii;\n\ntypedef long long ll;\n\ntypedef complex<double> P;\n\ntypedef pair<P, P> L;\n\ntypedef pair<P, double> C;\n\nint dy[] = {0, 0, 1, -1};\n\nint dx[] = {1, -1, 0, 0};\n\nint const MOD = 1000000007;\n\nnamespace std {\n\nbool operator<(const P &a, const P &b) { return a.X != b.X ? a.X < b.X : a.Y < b.Y; }\n\n}                 \n\nsigned main() {\n\n  int n;\n  cin >> n;\n\n  int a[100010] = {};\n\n  int even = 0, odd = 0;\n\n  rep(i, 0, n) {\n\n    cin >> a[i];\n\n    if (a[i] % 2)\n      odd++;\n\n    else\n      even++;\n  }\n\n  int e = odd / 2;\n\n  even += e;\n\n  odd -= e * 2;\n\n  if (odd == 0)\n    cout << \"YES\" << endl;\n\n  else\n    cout << \"NO\" << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nint main() {\n\n  int N, cnt = 0;\n  scanf(\"%d\", &N);\n\n  for (int i = 0; i < N; i++) {\n\n    int p;\n    scanf(\"%d\", &p);\n\n    cnt += (p % 2);\n  }\n\n  printf(\"%s\\n\", (cnt % 2) ? \"NO\" : \"YES\");\n\n  return 0;\n}"}
{"fast_code_id":"2ad08c5461518ddad126f6f9ee67aabec7383abdc25a0fefc7ec2ec09773ca01","fast_id":"e8a68c5d364b6fcf1771f6ccdcec4eaec4f67af397e37e7e16dbe60874a7fa6b","fast_time":0.047612891,"language":"cpp","measured_fast_code_id":"e8a68c5d364b6fcf1771f6ccdcec4eaec4f67af397e37e7e16dbe60874a7fa6b","measured_slow_code_id":"a4a33c4ad4880ff149959ccd9bae11ed5dbfb5facadfe99079a1dd9c9096d2c0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72139","problem_id":"p01250","slow_code_id":"d7e010d0524fd84fea415d824033db8d6b124fa3da3bbf04bb50c8e2459e62a1","slow_id":"a4a33c4ad4880ff149959ccd9bae11ed5dbfb5facadfe99079a1dd9c9096d2c0","slow_time":0.1554371756,"speedup":3.264602764826862,"stratum":"2-4","sampling_key":"19ae45eb745c56c03c43c4df0a7f3da35637e32e0c4320985cb7c4569411a490","slow_code":"#include <iostream>\n\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n\n  double r;\n\n  while (cin >> r, r != 0.0) {\n\n    pair<int, int> a(9999999, 999999);\n\n    double pi = M_PI;\n\n    for (int i = 1; i < 100000; i++) {\n\n      for (int k = -1; k < 2; k += 2) {\n\n        for (int j = 0; j < 2; j++) {\n\n          int nu = (int)((pi + r * k) * i) + j;\n\n          if (abs(nu - pi * i) <= r * i) {\n\n            a = min(a, make_pair(i, nu));\n          }\n        }\n      }\n    }\n\n    cout << a.second << \"/\" << a.first << endl;\n  }\n}","fast_code":"#include <iostream>\n\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n\n  double r;\n\n  while (cin >> r, r != 0.0) {\n\n    double pi = M_PI;\n\n    for (int i = 1;; i++) {\n\n      for (int k = -1; k < 2; k += 2) {\n\n        for (int j = 0; j < 2; j++) {\n\n          int nu = (int)((pi + r * k) * i) + j;\n\n          if (abs(nu - pi * i) <= r * i) {\n\n            cout << nu << \"/\" << i << endl;\n\n            goto exit;\n          }\n        }\n      }\n    }\n\n  exit:;\n  }\n}"}
{"fast_code_id":"b5f16bf2000a3ec2c4268e6c5085b7f1d39ff5399bc93db698476cda141bd9c0","fast_id":"f3da20538518d577909ef2c054907119c301e101a12f105aaf64cc2f48c928dc","fast_time":0.0167407709,"language":"cpp","measured_fast_code_id":"f3da20538518d577909ef2c054907119c301e101a12f105aaf64cc2f48c928dc","measured_slow_code_id":"3ec15d4349be7632d1498e1cdb680554e219a2257a638c927a3c4f40fbe5cd92","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72140","problem_id":"p02943","slow_code_id":"f86a3308875db918311bc247aef6b7b69bb609d3e0a493e77435d117668450ef","slow_id":"3ec15d4349be7632d1498e1cdb680554e219a2257a638c927a3c4f40fbe5cd92","slow_time":0.0889530462,"speedup":5.313557346394364,"stratum":"4-8","sampling_key":"9106b82026fd881effa181a60b42e1df6ce82eb801ac525ddf6316c6b358f1d0","slow_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <iostream>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cassert>\n\nusing namespace std;\n\nvoid read(int &x) {\n\n  int f = 1;\n\n  x = 0;\n\n  char s = getchar();\n\n  while (s < '0' || s > '9') {\n\n    if (s == '-')\n      f = -1;\n\n    s = getchar();\n  }\n\n  while (s >= '0' && s <= '9') {\n\n    x = x * 10 + s - '0';\n\n    s = getchar();\n  }\n\n  x *= f;\n}\n\nconst int N = 5000;\n\nchar a[N + 3];\n\nchar ans[N + 3][N + 3];\n\nchar mnc;\n\nint n, m, num;\n\nbool cmp(int x, int y) {\n\n  for (int i = 1; i <= n; i++) {\n\n    if (ans[x][i] < ans[y][i]) {\n\n      return 1;\n    }\n\n    if (ans[x][i] > ans[y][i]) {\n\n      return 0;\n    }\n  }\n\n  return 0;\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n\n  scanf(\"%s\", a + 1);\n\n  mnc = 'z';\n\n  for (int i = 1; i <= n; i++) {\n\n    mnc = min(mnc, a[i]);\n  }\n\n  if (m >= 14) {\n\n    for (int i = 1; i <= n; i++) {\n\n      printf(\"%c\", mnc);\n    }\n\n    return 0;\n  }\n\n  int len = 0, mxl = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (a[i] != mnc) {\n\n      len = 0;\n\n    }\n\n    else {\n\n      len++;\n    }\n\n    if (len > mxl) {\n\n      mxl = len;\n    }\n  }\n\n  len = 0;\n\n  num = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (a[i] != mnc) {\n\n      len = 0;\n\n    }\n\n    else {\n\n      len++;\n    }\n\n    if (i == n) {\n\n      num++;\n\n      int tmp = min(n, len * (1 << m));\n\n      for (int j = 1; j <= tmp; j++) {\n\n        ans[num][j] = mnc;\n      }\n\n      for (int j = tmp + 1, k = n - len; j <= n; j++, k--) {\n\n        ans[num][j] = a[k];\n      }\n    }\n\n    if (len == mxl) {\n\n      num++;\n\n      int tmp = min(n, len * (1 << m - 1));\n\n      for (int j = 1; j <= tmp; j++) {\n\n        ans[num][j] = mnc;\n      }\n\n      for (int j = tmp + 1, k = i + 1; j <= n; j++, k++) {\n\n        ans[num][j] = a[k <= n ? k : 2 * n + 1 - k];\n      }\n    }\n  }\n\n  int fans = 1;\n\n  for (int i = 1; i <= num; i++) {\n\n    if (cmp(i, fans)) {\n\n      fans = i;\n    }\n  }\n\n  for (int j = 1; j <= n; j++) {\n\n    printf(\"%c\", ans[fans][j]);\n  }\n\n  puts(\"\");\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\nconst int Maxn = 10000;\n\nchar s[Maxn + 5];\n\nint n, k;\n\nchar *ans;\n\nbool check(char *a, char *b) {\n\n  for (int i = 1; i <= n; i++) {\n\n    if (a[i] < b[i]) {\n\n      return 1;\n    }\n\n    if (a[i] > b[i]) {\n\n      return 0;\n    }\n  }\n\n  return 0;\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &k);\n\n  scanf(\"%s\", s + 1);\n\n  while (s[++n] != '\\0')\n    ;\n\n  n--;\n\n  for (int i = 1; i <= n; i++) {\n\n    s[(n << 1) - i + 1] = s[i];\n  }\n\n  ans = s;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (check(s + i - 1, ans)) {\n\n      ans = s + i - 1;\n    }\n  }\n\n  int len = 1;\n\n  while (len <= n && ans[++len] == ans[1])\n    ;\n\n  len--;\n\n  if (k >= 15 || (len * (1 << (k - 1)) >= n)) {\n\n    for (int i = 1; i <= n; i++) {\n\n      putchar(ans[1]);\n    }\n\n    puts(\"\");\n\n  }\n\n  else {\n\n    int now = n - (len * (1 << (k - 1)));\n\n    for (int i = 1; i <= (len * (1 << (k - 1))); i++) {\n\n      putchar(ans[1]);\n    }\n\n    for (int i = 1; i <= now; i++) {\n\n      putchar(ans[i + len]);\n    }\n\n    puts(\"\");\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"5d31ea235727d76f91c0f74f5fbb15ec7e8bf683a47036baf53fc4d09f7bb7aa","fast_id":"be03b4354f86893c217d246895266892c89aac994efabd117aa252a41acb7f02","fast_time":0.1006518304,"language":"cpp","measured_fast_code_id":"be03b4354f86893c217d246895266892c89aac994efabd117aa252a41acb7f02","measured_slow_code_id":"a2364eb0d9348705348f1d427afabd7db0c324aa81ae12730eab8a1bbfad4332","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72141","problem_id":"p00360","slow_code_id":"d8301843aa100bf825a517ff35decc995c2965e01c4f08bb50b0883b444304c7","slow_id":"a2364eb0d9348705348f1d427afabd7db0c324aa81ae12730eab8a1bbfad4332","slow_time":1.4629063638,"speedup":14.534324492523087,"stratum":"8+","sampling_key":"20ad0a84e41dfa05aebf31982b5e3cb6bd88ff38a5969e8c5202c17d87d01cb7","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\n#ifndef MAX\n\n#define MAX 800000\n\n#endif\n\ntemplate <class T>\n\nclass RUQ_RMQ {\n\npublic:\n  int n;\n\n  T dat[MAX], lazy[MAX], DEFAULT;\n\n  bool (*cmp)(T, T);\n\n  void init(\n      int n_,\n\n      bool (*c)(T, T) = [](int a, int b) { return a < b; }, T d = INT_MAX) {\n\n    cmp = c;\n\n    DEFAULT = d;\n\n    n = 1;\n    while (n < n_)\n      n <<= 1;\n\n    for (int i = 0; i < 2 * n - 1; i++) {\n\n      dat[i] = lazy[i] = DEFAULT;\n    }\n  }\n\n  inline void push(int k) {\n\n    if (lazy[k] == DEFAULT)\n      return;\n\n    dat[k] = lazy[k];\n\n    if (k < n - 1) {\n\n      lazy[k * 2 + 1] = lazy[k];\n\n      lazy[k * 2 + 2] = lazy[k];\n    }\n\n    lazy[k] = DEFAULT;\n  }\n\n  inline void update_node(int k) {\n\n    if (cmp(dat[k * 2 + 1], dat[k * 2 + 2]))\n      dat[k] = dat[k * 2 + 1];\n\n    else\n      dat[k] = dat[k * 2 + 2];\n  }\n\n  inline void update(int a, int b, T x, int k, int l, int r) {\n\n    push(k);\n\n    if (r <= a || b <= l)\n      return;\n\n    if (a <= l && r <= b) {\n\n      lazy[k] = x;\n      push(k);\n      return;\n    }\n\n    update(a, b, x, k * 2 + 1, l, (l + r) / 2);\n\n    update(a, b, x, k * 2 + 2, (l + r) / 2, r);\n\n    update_node(k);\n  }\n\n  inline T query(int a, int b, int k, int l, int r) {\n\n    push(k);\n\n    if (r <= a || b <= l)\n      return DEFAULT;\n\n    if (a <= l && r <= b)\n      return dat[k];\n\n    T lb = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\n    T rb = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\n    update_node(k);\n\n    if (cmp(lb, rb))\n      return lb;\n\n    return rb;\n  }\n\n  inline void update(int a, int b, T x) { update(a, b, x, 0, 0, n); }\n\n  inline void update(int a, T x) { update(a, a + 1, x); }\n\n  inline T query(int a, int b) { return query(a, b, 0, 0, n); }\n\n  inline T query(int a) { return query(a, a + 1); }\n};\n\nint bit[300000];\n\nvoid add(int k, int x) {\n\n  k++;\n\n  while (k < 300000) {\n\n    bit[k] += x;\n\n    k += k & -k;\n  }\n}\n\nint sum(int k) {\n\n  k++;\n\n  int ans = 0;\n\n  while (k) {\n\n    ans += bit[k];\n\n    k -= k & -k;\n  }\n\n  return ans;\n}\n\nRUQ_RMQ<P> tree;\n\nint main() {\n\n  string s;\n  int k;\n  cin >> s >> k;\n\n  rep(i, s.size() - 1) add(i + 1, 1);\n\n  tree.init(\n      s.size(), [](P a, P b) { return a < b; }, P(INT_MAX, INT_MAX));\n\n  rep(i, s.size()) tree.update(i, P(s[i], i));\n\n  string ans;\n\n  int a = k;\n\n  rep(i, s.size()) {\n\n    int l = 1, r = s.size();\n\n    while (l != r) {\n\n      int t = (l + r) / 2;\n\n      if (r - l == 1)\n        t = r;\n\n      if (sum(t - 1) <= k)\n        l = t;\n\n      else\n        r = t - 1;\n    }\n\n    P p = tree.query(0, l);\n\n    ans += p.first;\n\n    k -= sum(p.second);\n\n    a += sum(p.second);\n\n    add(p.second + 1, -1);\n\n    tree.update(p.second, P(INT_MAX, i));\n\n    P pp = tree.query(p.second);\n  }\n\n  cout << ans << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\n#define MAX 800000\n\nP dat[MAX];\n\nint N;\n\nvoid init(int n) {\n\n  N = 1;\n  while (N < n)\n    N <<= 1;\n}\n\nvoid update(int k, P x) {\n\n  k += N - 1;\n\n  dat[k] = x;\n\n  while (k) {\n\n    k = (k - 1) / 2;\n\n    dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);\n  }\n}\n\nP query(int a, int b, int k, int l, int r) {\n\n  if (b <= l || r <= a)\n    return P(INT_MAX, INT_MAX);\n\n  if (a <= l && r <= b)\n    return dat[k];\n\n  return min(query(a, b, k * 2 + 1, l, (l + r) / 2),\n             query(a, b, k * 2 + 2, (l + r) / 2, r));\n}\n\nint bit[300000];\n\nvoid add(int k, int x) {\n\n  k++;\n\n  while (k < 300000) {\n\n    bit[k] += x;\n\n    k += k & -k;\n  }\n}\n\nint sum(int k) {\n\n  k++;\n\n  int ans = 0;\n\n  while (k) {\n\n    ans += bit[k];\n\n    k -= k & -k;\n  }\n\n  return ans;\n}\n\nint main() {\n\n  string s;\n  int k;\n  cin >> s >> k;\n\n  rep(i, s.size() - 1) add(i + 1, 1);\n\n  init(s.size());\n\n  rep(i, s.size()) update(i, P(s[i], i));\n\n  string ans;\n\n  rep(i, s.size()) {\n\n    int l = 1, r = s.size();\n\n    while (l != r) {\n\n      int t = (l + r) / 2;\n\n      if (r - l == 1)\n        t = r;\n\n      if (sum(t - 1) <= k)\n        l = t;\n\n      else\n        r = t - 1;\n    }\n\n    P p = query(0, l, 0, 0, N);\n\n    ans += p.first;\n\n    k -= sum(p.second);\n\n    add(p.second + 1, -1);\n\n    update(p.second, P(INT_MAX, i));\n  }\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"8d8b8c717ae8bd1aed22085957ed29e2890f95cf67161022c1bb006d2cc4e1b8","fast_id":"7bd3f806ab2ce89a35a0a8dce52e87e49e805d5c7bd04eb9390bbabf5891c2e8","fast_time":0.0010117404,"language":"cpp","measured_fast_code_id":"7bd3f806ab2ce89a35a0a8dce52e87e49e805d5c7bd04eb9390bbabf5891c2e8","measured_slow_code_id":"432a451bce496aa24fdcb4f78ec9b18d2e52e15a69ff917578af1f6c884dd033","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72146","problem_id":"p03868","slow_code_id":"013d57bdd7bd28a191b0bd716d6ada5ed1bddbd375d6802c4e7e2f0ffcb7892e","slow_id":"432a451bce496aa24fdcb4f78ec9b18d2e52e15a69ff917578af1f6c884dd033","slow_time":0.0029569955,"speedup":2.922682043733748,"stratum":"2-4","sampling_key":"5a29acfa8107772e8ccc338918ffca80a287985cc820a2e99627042e609e01ba","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <stack>\n\n#include <string>\n\n#include <utility>\n\n#include <vector>\n\n#include <array>\n\n#include <unordered_map>\n\n#include <complex>\n\n#include <deque>\n\n#include <cassert>\n\n#include <cmath>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <chrono>\n\n#include <random>\n\n#include <numeric>\n\n#include <tuple>\n\n#include <cstring>\n\nusing namespace std;\n\n\n\n#define forr(x,arr) for(auto&& x:arr)\n\n#define _overload3(_1,_2,_3,name,...) name\n\n#define _rep2(i,n) _rep3(i,0,n)\n\n#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)\n\n#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)\n\n#define _rrep2(i,n) _rrep3(i,0,n)\n\n#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\n\n#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n\n#define bit(n) (1LL<<(n))\n\n#define sz(x) ((int)(x).size())\n\n#define TEN(n) ((ll)(1e##n))\n\n#define fst first\n\n#define snd second\n\n\n\nstring DBG_DLM(int &i){return(i++==0?\"\":\", \");}\n\n#define DBG_B(exp){int i=0;os<<\"{\";{exp;}os<<\"}\";return os;}\n\ntemplate<class T>ostream&operator<<(ostream&os,vector<T>v);\n\ntemplate<class T>ostream&operator<<(ostream&os,set<T>v);\n\ntemplate<class T>ostream&operator<<(ostream&os,queue<T>q);\n\ntemplate<class T>ostream&operator<<(ostream&os,priority_queue<T>q);\n\ntemplate<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);\n\ntemplate<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);\n\ntemplate<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);\n\ntemplate<int I,class TPL>void DBG(ostream&os,TPL t){}\n\ntemplate<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?\"\":\", \")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}\n\ntemplate<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<\"(\"<<p.first<<delim<<p.second<<\")\";}\n\ntemplate<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<\"(\";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<\")\";return os;}\n\ntemplate<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,\", \");return os;}\n\ntemplate<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}\n\ntemplate<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}\n\ntemplate<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}\n\ntemplate<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}\n\ntemplate<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,\"->\");});}\n\ntemplate<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,\"->\");});}\n\n#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name\n\n#define DBG_LINE(){char s[99];sprintf(s,\"line:%3d | \",__LINE__);cerr<<s;}\n\n#define DBG_OUTPUT(v){cerr<<(#v)<<\"=\"<<(v);}\n\n#define DBG1(v,...){DBG_OUTPUT(v);}\n\n#define DBG2(v,...){DBG_OUTPUT(v);cerr<<\", \";DBG1(__VA_ARGS__);}\n\n#define DBG3(v,...){DBG_OUTPUT(v);cerr<<\", \";DBG2(__VA_ARGS__);}\n\n#define DBG4(v,...){DBG_OUTPUT(v);cerr<<\", \";DBG3(__VA_ARGS__);}\n\n#define DBG5(v,...){DBG_OUTPUT(v);cerr<<\", \";DBG4(__VA_ARGS__);}\n\n#define DBG6(v,...){DBG_OUTPUT(v);cerr<<\", \";DBG5(__VA_ARGS__);}\n\n#define DEBUG0(){DBG_LINE();cerr<<endl;}\n\n#ifdef LOCAL\n\n#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}\n\n#else\n\n#define out(...)\n\n#endif\n\n\n\nusing ll=long long;\n\nusing pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;\n\nusing vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;\n\nusing vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;\n\nusing vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;\n\nusing vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;\n\nusing vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;\n\nusing vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;\n\ntemplate<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}\n\ntemplate<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}\n\nll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}\n\n\n\nconst int mod = 1e9+7;\n\n\n\ntemplate<int MOD> struct Mint {\n\n  int x;\n\n  Mint() : x(0) {}\n\n  Mint(int y) : x(y >= 0 ? y % MOD : MOD - (-y) % MOD) {}\n\n  Mint(int64_t sll) : x(sll % MOD) { if (x < 0) x += MOD; }\n\n  Mint &operator+=(const Mint &rhs){ if((x += rhs.x) >= MOD) x -= MOD; return *this; }\n\n  Mint &operator-=(const Mint &rhs){ if((x += MOD - rhs.x) >= MOD) x -= MOD; return *this; }\n\n  Mint &operator*=(const Mint &rhs){ x = 1LL*x*rhs.x % MOD; return *this; }\n\n  Mint &operator/=(const Mint &rhs){ x = (1LL*x*rhs.inv().x) % MOD; return *this; }\n\n  Mint operator-() const { return Mint(-x); }\n\n  Mint operator+(const Mint &rhs) const { return Mint(*this) += rhs; }\n\n  Mint operator-(const Mint &rhs) const { return Mint(*this) -= rhs; }\n\n  Mint operator*(const Mint &rhs) const { return Mint(*this) *= rhs; }\n\n  Mint operator/(const Mint &rhs) const { return Mint(*this) /= rhs; }\n\n  bool operator<(const Mint &rhs) const { return x < rhs.x; }\n\n  Mint inv() const {\n\n    assert(x != 0);\n\n    signed a = x, b = MOD, u = 1, v = 0, t;\n\n    while (b) { t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); }\n\n    return Mint(u);\n\n  }\n\n  Mint operator^(uint64_t t) const {\n\n    Mint e = *this, res = 1;\n\n    for(; t; e *= e, t>>=1) if (t & 1) res *= e;\n\n    return res;\n\n  }\n\n};\n\ntemplate<int MOD> ostream &operator<<(ostream &os, const Mint<MOD> &rhs) { return os << rhs.x; }\n\ntemplate<int MOD> istream &operator>>(istream &is, Mint<MOD> &rhs) { int64_t s; is >> s; rhs = Mint<MOD>(s); return is; };\n\n\n\nusing mint = Mint<mod>;\n\nusing vm=vector<mint>;using vvm=vector<vm>;using vvvm=vector<vvm>;\n\n\n\ntemplate <typename T> struct BinaryIndexedTree0 {\n\n  const int N;\n\n  vector<T> val;\n\n\n\n  BinaryIndexedTree0(int N) : N(N), val(N) {}\n\n\n\n  T sum(int i) const {\n\n    T s = 0;\n\n    --i;\n\n    if (i >= N) i = N - 1;\n\n    for (; i >= 0; i = (i & (i + 1)) - 1) s += val[i];\n\n    return s;\n\n  }\n\n\n\n  T sum(int l, int r) const {\n\n  return sum(r) - sum(l);\n\n  }\n\n\n\n  void add(int i, T x) {\n\n    for (; i < N; i |= i + 1) val[i] += x;\n\n  }\n\n};\n\n\n\nint64_t powMod(int64_t x, int64_t y, int64_t mod) {\n\n  int64_t r = 1, a = x % mod;\n\n  while (y) {\n\n    if (y & 1) r = (r * a) % mod;\n\n    a = a * a % mod;\n\n    y /= 2;\n\n  }\n\n  return r;\n\n}\n\n\n\nconst int SET_FACT_MAX = 100005;\n\nmint fact[SET_FACT_MAX];\n\nmint revFact[SET_FACT_MAX];\n\n\n\nvoid setFact() {\n\n  const int N = SET_FACT_MAX;\n\n  fact[0] = 1;\n\n  for (int i = 1; i < N; i++) {\n\n    fact[i] = fact[i - 1] * i;\n\n  }\n\n  revFact[N - 1] = fact[N - 1] ^ (mod - 2);\n\n  for (int i = N - 2; i >= 0; i--) {\n\n    revFact[i] = revFact[i + 1] * (i + 1);\n\n  }\n\n}\n\n\n\nmint solve() {\n\n  int n = ri();\n\n  setFact();\n\n\n\n  vector<int> A(n);\n\n  rep(i, n) A[i] = ri();\n\n\n\n  vector<int> B(n);\n\n  rep(i, n) B[i] = ri();\n\n\n\n  sort(all(A));\n\n  sort(all(B));\n\n\n\n  sort(all(A));\n\n  sort(all(B));\n\n \n\n  {\n\n    A.emplace_back(2e9);\n\n    B.emplace_back(2e9);\n\n    int i = 0;\n\n    int p = 0, q = 0;\n\n    while (1) {\n\n      if (A[p] < B[q]) {\n\n        A[p++] = i++;\n\n      }\n\n      else if (A[p] > B[q]) {\n\n        B[q++] = i++;\n\n      }\n\n      else {\n\n        A.pop_back();\n\n        B.pop_back();\n\n        break;\n\n      }\n\n    }\n\n  }\n\n \n\n  out(A);\n\n  out(B);\n\n\n\n  BinaryIndexedTree0<int> ftA(n*2), ftB(n*2);\n\n  forr(a, A) ftA.add(a, 1);\n\n  forr(b, B) ftB.add(b, 1);\n\n\n\n  mint ans = 1;\n\n\n\n  rep(i, n) {\n\n    int a = A[i];\n\n    int b = B[i];\n\n    out(i, a, b);\n\n    int j = i;\n\n    if (a < b) {\n\n      for (; j < n && A[j] < B[j]; j++) {\n\n        int cnt = ftA.sum(A[i], B[j]);\n\n        out(i,j,A[i],B[j],cnt);\n\n        cnt -= (j-i);\n\n        ans *= cnt;\n\n      }\n\n    }\n\n    else {\n\n      for (; j < n && A[j] > B[j]; j++) {\n\n        int cnt = ftB.sum(B[i], A[j]);\n\n        out(i,j,B[i],A[j],cnt);\n\n        cnt -= (j-i);\n\n        ans *= cnt;\n\n      }\n\n    }\n\n    i = j-1;\n\n  }\n\n\n\n  return ans;\n\n}\n\n\n\nvoid Main() {\n\ncout << solve() << endl;\n\n}\n\n\n\nsigned main() {\n\n  cin.tie(nullptr);\n\n  ios::sync_with_stdio(false);\n\n  Main();\n\n  return 0;\n\n}\n","fast_code":"\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <map>\n\n#include <queue>\n\n#include <set>\n\n#include <stack>\n\n#include <string>\n\n#include <utility>\n\n#include <vector>\n\n#include <array>\n\n#include <unordered_map>\n\n#include <complex>\n\n#include <deque>\n\n#include <cassert>\n\n#include <cmath>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <chrono>\n\n#include <random>\n\n#include <numeric>\n\n#include <tuple>\n\n#include <cstring>\n\nusing namespace std;\n\n#define forr(x, arr) for (auto &&x : arr)\n\n#define _overload3(_1, _2, _3, name, ...) name\n\n#define _rep2(i, n) _rep3(i, 0, n)\n\n#define _rep3(i, a, b) for (int i = int(a); i < int(b); ++i)\n\n#define rep(...) _overload3(__VA_ARGS__, _rep3, _rep2, )(__VA_ARGS__)\n\n#define _rrep2(i, n) _rrep3(i, 0, n)\n\n#define _rrep3(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)\n\n#define rrep(...) _overload3(__VA_ARGS__, _rrep3, _rrep2, )(__VA_ARGS__)\n\n#define all(x) (x).begin(), (x).end()\n\n#define bit(n) (1LL << (n))\n\n#define sz(x) ((int)(x).size())\n\n#define TEN(n) ((ll)(1e##n))\n\n#define fst first\n\n#define snd second\n\nstring DBG_DLM(int &i) { return (i++ == 0 ? \"\" : \", \"); }\n\n#define DBG_B(exp)                                                                                 \\\n  {                                                                                                \\\n    int i = 0;                                                                                     \\\n    os << \"{\";                                                                                     \\\n    { exp; }                                                                                       \\\n    os << \"}\";                                                                                     \\\n    return os;                                                                                     \\\n  }\n\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> v);\n\ntemplate <class T> ostream &operator<<(ostream &os, set<T> v);\n\ntemplate <class T> ostream &operator<<(ostream &os, queue<T> q);\n\ntemplate <class T> ostream &operator<<(ostream &os, priority_queue<T> q);\n\ntemplate <class T, class K> ostream &operator<<(ostream &os, pair<T, K> p);\n\ntemplate <class T, class K> ostream &operator<<(ostream &os, map<T, K> mp);\n\ntemplate <class T, class K> ostream &operator<<(ostream &os, unordered_map<T, K> mp);\n\ntemplate <int I, class TPL> void DBG(ostream &os, TPL t) {}\n\ntemplate <int I, class TPL, class H, class... Ts> void DBG(ostream &os, TPL t) {\n  os << (I == 0 ? \"\" : \", \") << get<I>(t);\n  DBG<I + 1, TPL, Ts...>(os, t);\n}\n\ntemplate <class T, class K> void DBG(ostream &os, pair<T, K> p, string delim) {\n  os << \"(\" << p.first << delim << p.second << \")\";\n}\n\ntemplate <class... Ts> ostream &operator<<(ostream &os, tuple<Ts...> t) {\n  os << \"(\";\n  DBG<0, tuple<Ts...>, Ts...>(os, t);\n  os << \")\";\n  return os;\n}\n\ntemplate <class T, class K> ostream &operator<<(ostream &os, pair<T, K> p) {\n  DBG(os, p, \", \");\n  return os;\n}\n\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> v) {\n  DBG_B(forr(t, v) { os << DBG_DLM(i) << t; });\n}\n\ntemplate <class T> ostream &operator<<(ostream &os, set<T> s) {\n  DBG_B(forr(t, s) { os << DBG_DLM(i) << t; });\n}\n\ntemplate <class T> ostream &operator<<(ostream &os, queue<T> q) {\n  DBG_B(for (; q.size(); q.pop()) { os << DBG_DLM(i) << q.front(); });\n}\n\ntemplate <class T> ostream &operator<<(ostream &os, priority_queue<T> q) {\n  DBG_B(for (; q.size(); q.pop()) { os << DBG_DLM(i) << q.top(); });\n}\n\ntemplate <class T, class K> ostream &operator<<(ostream &os, map<T, K> m) {\n  DBG_B(forr(p, m) {\n    os << DBG_DLM(i);\n    DBG(os, p, \"->\");\n  });\n}\n\ntemplate <class T, class K> ostream &operator<<(ostream &os, unordered_map<T, K> m) {\n  DBG_B(forr(p, m) {\n    os << DBG_DLM(i);\n    DBG(os, p, \"->\");\n  });\n}\n\n#define DBG_OVERLOAD(_1, _2, _3, _4, _5, _6, macro_name, ...) macro_name\n\n#define DBG_LINE()                                                                                 \\\n  {                                                                                                \\\n    char s[99];                                                                                    \\\n    sprintf(s, \"line:%3d | \", __LINE__);                                                           \\\n    cerr << s;                                                                                     \\\n  }\n\n#define DBG_OUTPUT(v)                                                                              \\\n  { cerr << (#v) << \"=\" << (v); }\n\n#define DBG1(v, ...)                                                                               \\\n  { DBG_OUTPUT(v); }\n\n#define DBG2(v, ...)                                                                               \\\n  {                                                                                                \\\n    DBG_OUTPUT(v);                                                                                 \\\n    cerr << \", \";                                                                                  \\\n    DBG1(__VA_ARGS__);                                                                             \\\n  }\n\n#define DBG3(v, ...)                                                                               \\\n  {                                                                                                \\\n    DBG_OUTPUT(v);                                                                                 \\\n    cerr << \", \";                                                                                  \\\n    DBG2(__VA_ARGS__);                                                                             \\\n  }\n\n#define DBG4(v, ...)                                                                               \\\n  {                                                                                                \\\n    DBG_OUTPUT(v);                                                                                 \\\n    cerr << \", \";                                                                                  \\\n    DBG3(__VA_ARGS__);                                                                             \\\n  }\n\n#define DBG5(v, ...)                                                                               \\\n  {                                                                                                \\\n    DBG_OUTPUT(v);                                                                                 \\\n    cerr << \", \";                                                                                  \\\n    DBG4(__VA_ARGS__);                                                                             \\\n  }\n\n#define DBG6(v, ...)                                                                               \\\n  {                                                                                                \\\n    DBG_OUTPUT(v);                                                                                 \\\n    cerr << \", \";                                                                                  \\\n    DBG5(__VA_ARGS__);                                                                             \\\n  }\n\n#define DEBUG0()                                                                                   \\\n  {                                                                                                \\\n    DBG_LINE();                                                                                    \\\n    cerr << endl;                                                                                  \\\n  }\n\n#ifdef LOCAL\n\n#define out(...)                                                                                   \\\n  {                                                                                                \\\n    DBG_LINE();                                                                                    \\\n    DBG_OVERLOAD(__VA_ARGS__, DBG6, DBG5, DBG4, DBG3, DBG2, DBG1)(__VA_ARGS__);                    \\\n    cerr << endl;                                                                                  \\\n  }\n\n#else\n\n#define out(...)\n\n#endif\n\nusing ll = long long;\n\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pil = pair<int, ll>;\nusing pli = pair<ll, int>;\n\nusing vs = vector<string>;\nusing vvs = vector<vs>;\nusing vvvs = vector<vvs>;\n\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\n\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\n\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing vvvl = vector<vvl>;\n\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\n\nusing vpii = vector<pii>;\nusing vvpii = vector<vpii>;\nusing vvvpii = vector<vvpii>;\n\ntemplate <class A, class B> bool amax(A &a, const B &b) { return b > a ? a = b, 1 : 0; }\n\ntemplate <class A, class B> bool amin(A &a, const B &b) { return b < a ? a = b, 1 : 0; }\n\nll ri() {\n  ll l;\n  cin >> l;\n  return l;\n}\nstring rs() {\n  string s;\n  cin >> s;\n  return s;\n}\n\nconst int mod = 1e9 + 7;\n\npii P[200005];\n\nint C[2];\n\nvoid rd(int &x) {\n\n  int k;\n\n  x = 0;\n\n  for (;;) {\n\n    k = getchar_unlocked();\n\n    if ('0' <= k && k <= '9') {\n\n      x = k - '0';\n\n      break;\n    }\n  }\n\n  for (;;) {\n\n    k = getchar_unlocked();\n\n    if (k < '0' || k > '9') {\n\n      break;\n    }\n\n    x = x * 10 + k - '0';\n  }\n}\n\nint main() {\n\n  int n;\n\n  rd(n);\n\n  rep(i, n) rd(P[i].fst), P[i].snd = 0;\n\n  rep(i, n) rd(P[n + i].fst), P[n + i].snd = 1;\n\n  sort(P, P + 2 * n);\n\n  ll ans = 1;\n\n  for (int i = 0; i < 2 * n; i++) {\n\n    int t = P[i].snd;\n\n    if (C[1 - t] == 0) {\n\n      C[t]++;\n\n    }\n\n    else {\n\n      (ans *= C[1 - t]) %= mod;\n\n      C[1 - t]--;\n    }\n  }\n\n  printf(\"%lld\\n\", ans);\n}\n"}
{"fast_code_id":"05bc5e3bb34247f27fd2c4c9d5091624fc72430ab30a5fdb3aa2825a13e5e4a9","fast_id":"1dd73297db347f209772b26ce9f8bcb2c27e082220783ecf2340f339d6a2e8fc","fast_time":0.0082735061,"language":"cpp","measured_fast_code_id":"1dd73297db347f209772b26ce9f8bcb2c27e082220783ecf2340f339d6a2e8fc","measured_slow_code_id":"94e04830648b32d3f8bb2ae137949299ca268271ce66fb5dd03b7861d73f7c52","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72150","problem_id":"p02995","slow_code_id":"bf581d11f6f66fb9bbdc2c70175ea8612bbfc90c8b47134b906da90927ebece7","slow_id":"94e04830648b32d3f8bb2ae137949299ca268271ce66fb5dd03b7861d73f7c52","slow_time":0.0432926248,"speedup":5.232681801008161,"stratum":"4-8","sampling_key":"25c8d7f2d3c704b6a28442616ba9b46a92595e1619169a93ab56ddc1470100bf","slow_code":"#include <iostream>\n\n#include <sstream>\n\n#include <string>\n\n#include <string.h>\n\n#include <algorithm>\n\n#include <stdio.h>\n\n#include <math.h>\n\n#include <vector>\n\n#include <queue>\n\n#include <map>\n\n#include <set>\n\n#include <stack>\n\n#define debug(a) cout << \"*\" << a << \"*\" << endl\n\nusing namespace std;\n\ntypedef long long ll;\n\nll a, b, c, d, mx;\n\nll gcd(ll a, ll b)\n\n{\n\n  return b == 0 ? a : gcd(b, a % b);\n}\n\nint main()\n\n{\n\n  while (~scanf(\"%lld%lld%lld%lld\", &a, &b, &c, &d))\n\n  {\n\n    mx = c * d / gcd(max(c, d), min(c, d));\n\n    a--;\n\n    printf(\"%lld\\n\", b - a - b / c - b / d + a / c + a / d + b / (mx)-a / (mx));\n  }\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nlong long gcd(long long x, long long y)\n\n{\n\n  if (!y)\n    return x;\n\n  return gcd(y, x % y);\n}\n\nint main()\n\n{\n\n  long long a, b, c, d;\n\n  scanf(\"%lld %lld %lld %lld\", &a, &b, &c, &d);\n\n  long long e = c * d / gcd(c, d);\n  a--;\n\n  long long ans = (b - a + 1) - ((b - (b % c)) - (a - (a % c))) / c - 1 -\n                  ((b - (b % d)) - (a - (a % d))) / d - 1 + ((b - (b % e)) - (a - (a % e))) / e + 1;\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"ca51817ab23088ec6d5e1a9aa48710da8ffc9a52b2bded805f346cefa638a106","fast_id":"0ce09533e6cc4f7ca722becf84ac717064e7ef84b7d718af3350624dbc9793cf","fast_time":0.0010035863,"language":"cpp","measured_fast_code_id":"0ce09533e6cc4f7ca722becf84ac717064e7ef84b7d718af3350624dbc9793cf","measured_slow_code_id":"5cc9d4acd3a575c3ba251b0c1fd10c19cac80af5a4d48c8a7c007bb1bb0ba6cb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72178","problem_id":"p02068","slow_code_id":"8c83c3e021bba647fbe0d3345f50ac2933a90d3c113785dbf01894f84bf13f9c","slow_id":"5cc9d4acd3a575c3ba251b0c1fd10c19cac80af5a4d48c8a7c007bb1bb0ba6cb","slow_time":0.0025318854,"speedup":2.522837746987977,"stratum":"2-4","sampling_key":"772ff7c829b1d5b1f55011ca3487068c857798afac052c0d903eb470a1d30d30","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\nconst int N = 1009;\n\nconst int M = 100009;\n\nint n;\nll a[N], pri[M];\n\nint f[M], tot;\n\nvoid init() {\n\n  memset(f, 0, sizeof(f));\n  f[1] = 1;\n\n  for (int i = 2; i <= M - 9; i++) {\n\n    if (!f[i])\n      pri[++tot] = i;\n\n    for (int j = 1; j <= tot && pri[j] * i <= M - 9; j++) {\n\n      f[pri[j] * i] = 1;\n\n      if (i % pri[j] == 0)\n        break;\n    }\n  }\n\n  return;\n}\n\nint main() {\n\n  init();\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n    scanf(\"%lld\", &a[i]);\n\n  for (int i = 1; i <= n; i++) {\n\n    ll t = a[i];\n\n    for (int j = 1; j <= tot; j++)\n\n      if (t % pri[j] == 0) {\n\n        while (!(t % pri[j]))\n          t /= pri[j];\n\n        if (t < M - 9)\n          break;\n      }\n\n    if (t > M - 9)\n      pri[++tot] = t;\n  }\n\n  ll ans = 0;\n\n  for (int i = 1; i <= tot; i++) {\n\n    ll area = 0;\n\n    for (int j = 1; j <= n; j++)\n\n      if (a[j] % pri[i] == 0)\n        area += a[j];\n\n    ans = max(ans, area);\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n;\n\nint a[1009];\n\nbool p[40009];\n\nint x[40009], lx;\n\nlong long ans;\n\nbool cmp(int x, int y) { return x < y; }\n\nvoid pd(int x) {\n\n  if (x == 1)\n    return;\n\n  long long sum = 0;\n\n  for (int j = 1; j <= n; j++)\n\n    if (a[j] % x == 0)\n      sum += a[j];\n\n  ans = max(ans, sum);\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int j = 1; j <= n; j++)\n\n    scanf(\"%d\", &a[j]);\n\n  sort(a + 1, a + n + 1, cmp);\n\n  for (int j = 2; j * j <= a[n]; j++) {\n\n    if (p[j] == 0) {\n\n      x[++lx] = j;\n\n      pd(j);\n    }\n\n    for (int i = 1; i <= lx; i++) {\n\n      if (j * x[i] > 40000)\n        continue;\n\n      p[j * x[i]] = 1;\n\n      if (j % x[i] == 0)\n        break;\n    }\n  }\n\n  for (int j = 1; j <= n; j++)\n\n    pd(a[j]);\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"164a408a1e4664a1c190fbc2d6f3f7419a4b65b280489e9853373af0966e7c43","fast_id":"4a4c3ce0334d3f62aeaa029eaab5ee9a376c40573d15f0d820ad4d57e7c5ff1d","fast_time":0.012190325,"language":"cpp","measured_fast_code_id":"4a4c3ce0334d3f62aeaa029eaab5ee9a376c40573d15f0d820ad4d57e7c5ff1d","measured_slow_code_id":"21e1b3d2221bab813d5ca4f9a3537de69d550a873f43c3a365db873e6fe65414","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72213","problem_id":"p04023","slow_code_id":"256da3962a99599ab14985f7b743e06255969f575b2aa9848cc6d6aab38e123c","slow_id":"21e1b3d2221bab813d5ca4f9a3537de69d550a873f43c3a365db873e6fe65414","slow_time":0.2303579827,"speedup":18.896787632815368,"stratum":"8+","sampling_key":"7ba8055624e007784a2ba9ce89a605c1f0f877a8db142b96b49916393eab313a","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst ll maxn = 100010;\n\nll n, q, top, tn;\n\nll a[maxn], S[maxn], tong[maxn], ci[maxn], sum[maxn];\n\nvector<pair<ll, ll> > V[maxn];\n\nll find(ll x)\n\n{\n\n  ll l = 1, r = top, res = 1;\n\n  while (l <= r)\n\n  {\n\n    ll mid = (l + r) >> 1;\n\n    if (S[mid] <= x)\n\n    {\n\n      res = mid;\n\n      l = mid + 1;\n\n    }\n\n    else\n\n      r = mid - 1;\n  }\n\n  return res;\n}\n\nint main()\n\n{\n\n  scanf(\"%lld%lld\", &n, &q);\n\n  tn = n;\n\n  for (ll i = 1; i <= q; i++)\n\n    scanf(\"%lld\", &a[i]);\n\n  S[++top] = n;\n\n  for (ll i = 1; i <= q; i++)\n\n  {\n\n    while (top && S[top] >= a[i])\n\n      top--;\n\n    S[++top] = a[i];\n  }\n\n  n = S[1];\n\n  V[1].push_back(make_pair(-n, 1));\n\n  for (ll i = 2; i <= top; i++)\n\n  {\n\n    ll x = S[i];\n\n    ll cur = i - 1;\n\n    while (x > n)\n\n    {\n\n      ll temp = x / S[cur];\n\n      V[i].push_back(make_pair(cur, temp));\n\n      x %= S[cur];\n\n      cur = find(x);\n    }\n\n    if (x > 0 && x <= n)\n\n      V[i].push_back(make_pair(-x, 1));\n  }\n\n  ci[top] = 1;\n\n  for (ll i = top; i >= 1; i--)\n\n    for (ll j = 0; j < V[i].size(); j++)\n\n    {\n\n      ll u = V[i][j].first, v = V[i][j].second;\n\n      if (u < 0)\n\n        tong[-u] += v * ci[i];\n\n      else\n\n        ci[u] += v * ci[i];\n    }\n\n  for (ll i = 1; i <= n; i++)\n\n    if (tong[i])\n\n    {\n\n      sum[1] += tong[i];\n\n      sum[i + 1] -= tong[i];\n    }\n\n  for (ll i = 1; i <= n; i++)\n\n    sum[i] += sum[i - 1];\n\n  for (ll i = 1; i <= n; i++)\n\n    printf(\"%lld\\n\", sum[i]);\n\n  for (ll i = n + 1; i <= tn; i++)\n\n    puts(\"0\");\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define int long long\n\n#define maxn (100010)\n\nint n, m, top, s[maxn], cnt[maxn], sum[maxn];\n\ninline int read() {\n\n  int x = 0, f = 1;\n\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9')\n\n    ch == '-' ? f = -1, ch = getchar() : ch = getchar();\n\n  while (ch >= '0' && ch <= '9')\n\n    x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();\n\n  return x * f;\n}\n\nvoid sol(int x, int del) {\n\n  if (!x)\n    return;\n\n  int pos = upper_bound(s + 1, s + top + 1, x) - s - 1;\n\n  if (!pos)\n    sum[1] += del, sum[x + 1] -= del;\n\n  else\n    cnt[pos] += (x / s[pos]) * del, sol(x % s[pos], del);\n}\n\nsigned main() {\n\n  n = read(), m = read();\n\n  s[++top] = n;\n\n  int x;\n\n  for (int i = 1; i <= m; ++i) {\n\n    x = read();\n\n    while (top && s[top] >= x)\n      --top;\n\n    s[++top] = x;\n  }\n\n  cnt[top] = 1;\n\n  for (int i = top; i >= 2; --i) {\n\n    cnt[i - 1] += (s[i] / s[i - 1]) * cnt[i];\n\n    sol(s[i] % s[i - 1], cnt[i]);\n  }\n\n  sum[1] += cnt[1], sum[s[1] + 1] -= cnt[1];\n\n  for (int i = 1; i <= n; ++i)\n    sum[i] += sum[i - 1];\n\n  for (int i = 1; i <= n; ++i)\n    printf(\"%lld\\n\", sum[i]);\n\n  return 0;\n}\n"}
{"fast_code_id":"8b05226b47ac787be4330288a8dae6a2a205c031ea6a75f40a489187d11e527b","fast_id":"b582ce7f4f55e74c934709c31e9f8d685eb565bed0055e1d7542ea31859641da","fast_time":0.0184963304,"language":"cpp","measured_fast_code_id":"b582ce7f4f55e74c934709c31e9f8d685eb565bed0055e1d7542ea31859641da","measured_slow_code_id":"4e3a4d627c97541459039a8e5ed839640ddc7a28c26176d689707bc389e6a868","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72218","problem_id":"p02598","slow_code_id":"bb3c8e57a66dd859be2494329937deee5b363b5e43ca2854e6ee077159c73866","slow_id":"4e3a4d627c97541459039a8e5ed839640ddc7a28c26176d689707bc389e6a868","slow_time":0.1030890898,"speedup":5.573488771588985,"stratum":"4-8","sampling_key":"1c491c8ed8e6e1ccaba78e2568459123348febff67c0c6b58abb2f53eacebaea","slow_code":"#pragma GCC optimize(\"O2\")\n\n#pragma GCC target(\"avx2\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, K;\n\n  cin >> N >> K;\n\n  int A[200000];\n\n  rep(i, N) cin >> A[i];\n\n  int L = 0, R = 1000000000;\n\n  while (L + 1 < R) {\n\n    int H = (L + R) / 2;\n\n    ll k = 0;\n\n    rep(i, N) { k += (A[i] - 1) / H; }\n\n    if (k <= K)\n      R = H;\n\n    else\n      L = H;\n  }\n\n  co(R);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O2\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int CM = 1 << 17, CL = 12;\n\nchar cn[CM + CL], *ci = cn + CM + CL, *owa = cn + CM, ct;\n\nconst ll ma0 = 1157442765409226768;\n\nconst ll ma1 = 1085102592571150095;\n\nconst ll ma2 = 71777214294589695;\n\nconst ll ma3 = 281470681808895;\n\nconst ll ma4 = 4294967295;\n\ninline int getint() {\n\n  if (ci - owa > 0) {\n\n    memcpy(cn, owa, CL);\n\n    ci -= CM;\n\n    fread(cn + CL, 1, CM, stdin);\n  }\n\n  ll tmp = *(ll *)ci;\n\n  if ((tmp & ma0) ^ ma0) {\n\n    int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);\n\n    tmp = tmp << dig & ma1;\n\n    tmp = tmp * 10 + (tmp >> 8) & ma2;\n\n    tmp = tmp * 100 + (tmp >> 16) & ma3;\n\n    tmp = tmp * 10000 + (tmp >> 32) & ma4;\n\n    ci += (72 - dig >> 3);\n\n  }\n\n  else {\n\n    tmp = tmp & ma1;\n\n    tmp = tmp * 10 + (tmp >> 8) & ma2;\n\n    tmp = tmp * 100 + (tmp >> 16) & ma3;\n\n    tmp = tmp * 10000 + (tmp >> 32) & ma4;\n\n    ci += 8;\n\n    if ((ct = *ci++) >= '0') {\n\n      tmp = tmp * 10 + ct - '0';\n\n      if (*ci++ == '0') {\n\n        tmp = tmp * 10;\n\n        ci++;\n      }\n    }\n  }\n\n  return tmp;\n}\n\nint A[200000];\n\nint main() {\n\n  int N = getint(), K = getint();\n\n  rep(i, N) A[i] = getint() - 1;\n\n  int L = 0, R = 1000000000;\n\n  while (L + 1 < R) {\n\n    int H = (L + R) / 2;\n\n    ll k = 0;\n\n    rep(i, N) k += A[i] / H;\n\n    if (k <= K)\n      R = H;\n\n    else\n      L = H;\n  }\n\n  printf(\"%d\\n\", R);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"90cf4d0cdbcd7a2dc6024b431dcddd5a10ca3d3f5485c6c277a566a800d5f481","fast_id":"f45fac40a05e14008e0ca3d9aa26744d7800d4d22ac72aade43dcff03104d092","fast_time":0.1083200124,"language":"cpp","measured_fast_code_id":"f45fac40a05e14008e0ca3d9aa26744d7800d4d22ac72aade43dcff03104d092","measured_slow_code_id":"7fd2641eee4667091dc71e7de2275e7d05f4f0cd2ec9b8914158d92d6a1dc726","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72236","problem_id":"p03553","slow_code_id":"6dc1edd92b48a514e0ad0758a8cc2d117b696dd6cdfcc70d57537aec381f9ef5","slow_id":"7fd2641eee4667091dc71e7de2275e7d05f4f0cd2ec9b8914158d92d6a1dc726","slow_time":1.0513015115,"speedup":9.705515058637493,"stratum":"8+","sampling_key":"193bafe05464d2d85a7a355f94f0c761a762392a1713e937b13f9bac34cf1992","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long signed int LL;\n\ntypedef long long unsigned int LU;\n\n#define incID(i, l, r) for (int i = (l); i < (r); i++)\n\n#define incII(i, l, r) for (int i = (l); i <= (r); i++)\n\n#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)\n\n#define decII(i, l, r) for (int i = (r); i >= (l); i--)\n\n#define inc(i, n) incID(i, 0, n)\n\n#define inc1(i, n) incII(i, 1, n)\n\n#define dec(i, n) decID(i, 0, n)\n\n#define dec1(i, n) decII(i, 1, n)\n\n#define inII(v, l, r) ((l) <= (v) && (v) <= (r))\n\n#define inID(v, l, r) ((l) <= (v) && (v) < (r))\n\n#define PB push_back\n\n#define EB emplace_back\n\n#define MP make_pair\n\n#define FI first\n\n#define SE second\n\n#define PQ priority_queue\n\n#define ALL(v) v.begin(), v.end()\n\n#define RALL(v) v.rbegin(), v.rend()\n\n#define FOR(it, v) for (auto it = v.begin(); it != v.end(); ++it)\n\n#define RFOR(it, v) for (auto it = v.rbegin(); it != v.rend(); ++it)\n\ntemplate <typename T> bool setmin(T &a, T b) {\n  if (b < a) {\n    a = b;\n    return true;\n  } else {\n    return false;\n  }\n}\n\ntemplate <typename T> bool setmax(T &a, T b) {\n  if (b > a) {\n    a = b;\n    return true;\n  } else {\n    return false;\n  }\n}\n\ntemplate <typename T> bool setmineq(T &a, T b) {\n  if (b <= a) {\n    a = b;\n    return true;\n  } else {\n    return false;\n  }\n}\n\ntemplate <typename T> bool setmaxeq(T &a, T b) {\n  if (b >= a) {\n    a = b;\n    return true;\n  } else {\n    return false;\n  }\n}\n\ntemplate <typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }\n\ntemplate <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }\n\nconst int V = 300002;\n\nstruct E {\n  int t;\n  LL c;\n  int r;\n};\n\nvector<E> g[V];\n\nbool used[V];\n\nconst LL INF = 1e12;\n\nvoid add(int f, int t, LL c) {\n\n  int gt = g[t].size();\n\n  int gf = g[f].size();\n\n  g[f].PB({t, c, gt});\n\n  g[t].PB({f, 0, gf});\n}\n\nLL dfs(int v, int t, LL f) {\n\n  if (v == t) {\n    return f;\n  }\n\n  used[v] = true;\n\n  inc(i, g[v].size()) {\n\n    E &e = g[v][i];\n\n    if (!used[e.t] && e.c > 0) {\n\n      LL d = dfs(e.t, t, min(f, e.c));\n\n      if (d > 0) {\n\n        e.c -= d;\n\n        g[e.t][e.r].c += d;\n\n        return d;\n      }\n    }\n  }\n\n  return 0;\n}\n\nLL flow(int S, int T) {\n\n  LL ans = 0;\n\n  while (true) {\n\n    inc(i, V) { used[i] = false; }\n\n    LL f = dfs(S, T, INF);\n\n    ans += f;\n\n    if (f == 0) {\n      break;\n    }\n  }\n\n  return ans;\n}\n\nLL n, a[101];\n\nint main() {\n\n  cin >> n;\n\n  inc1(i, n) { cin >> a[i]; }\n\n  int S = 0;\n\n  int T = 1;\n\n  inc1(i, n) {\n\n    add(S, i * 3 - 1, INF);\n\n    add(i * 3 - 1, i * 3 + 0, max(a[i], 0LL) - a[i]);\n\n    add(i * 3 + 0, i * 3 + 1, max(a[i], 0LL) - 0LL);\n\n    add(i * 3 + 1, T, INF);\n  }\n\n  inc1(i, n) {\n\n    for (int j = i * 2; j <= n; j += i) {\n      add(i * 3, j * 3, INF);\n    }\n  }\n\n  LL ans = -flow(S, T);\n\n  inc1(i, n) { ans += max(a[i], 0LL); }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n\n\ntypedef long long   signed int LL;\n\ntypedef long long unsigned int LU;\n\n\n\n#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)\n\n#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)\n\n#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)\n\n#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)\n\n#define  inc(i, n) incID(i, 0, n)\n\n#define inc1(i, n) incII(i, 1, n)\n\n#define  dec(i, n) decID(i, 0, n)\n\n#define dec1(i, n) decII(i, 1, n)\n\n\n\n#define inII(v, l, r) ((l) <= (v) && (v) <= (r))\n\n#define inID(v, l, r) ((l) <= (v) && (v) <  (r))\n\n\n\n#define PB push_back\n\n#define EB emplace_back\n\n#define MP make_pair\n\n#define FI first\n\n#define SE second\n\n#define PQ priority_queue\n\n\n\n#define  ALL(v)  v.begin(),  v.end()\n\n#define RALL(v) v.rbegin(), v.rend()\n\n#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)\n\n#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)\n\n\n\ntemplate<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }\n\ntemplate<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }\n\ntemplate<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }\n\n\n\n            \n\n\n\ntemplate<typename C> struct Flow {\n\n  int V;\n\n  C INF;\n\n  struct E { int t, r; C c; };\n\n  vector<vector<E>> g;\n\n  vector<bool> used;\n\n\t\n\n  Flow() { }\n\n  Flow(int v, C inf) { init(v, inf); }\n\n  void init(int v, C inf) {\n\n    V = v;\n\n    INF = inf;\n\n    g.resize(V);\n\n    used.resize(V);\n\n  }\n\n\t\n\n  void add(int f, int t, C c) {\n\n    assert(inID(f, 0, V));\n\n    assert(inID(t, 0, V));\n\n    int gt = g[t].size();\n\n    int gf = g[f].size();\n\n    g[f].PB({ t, gt, c });\n\n    g[t].PB({ f, gf, 0 });\n\n  }\n\n\t\n\n  C dfs(int f, int t, C c) {\n\n    if(f == t) { return c; }\n\n    used[f] = true;\n\n    inc(i, g[f].size()) {\n\n      E & e = g[f][i];\n\n      if(used[e.t] || e.c <= 0) { continue; }\n\n      C v = dfs(e.t, t, min(c, e.c));\n\n      if(v > 0) {\n\n        e.c -= v;\n\n        g[e.t][e.r].c += v;\n\n        return v;\n\n      }\n\n    }\n\n    return 0;\n\n  }\n\n\t\n\n  C max_flow(int S, int T) {\n\n    assert(inID(S, 0, V));\n\n    assert(inID(T, 0, V));\n\n    C ans = 0;\n\n    while(true) {\n\n      inc(i, V) { used[i] = false; }\n\n      C f = dfs(S, T, INF);\n\n      ans += f;\n\n      if(f == 0) { break; }\n\n    }\n\n    return ans;\n\n  }\n\n};\n\n\n\n       \n\n\n\nLL n, a[101];\n\n\n\nint main() {\n\n  cin >> n;\n\n  inc1(i, n) { cin >> a[i]; }\n\n\t\n\n  Flow<LL> f(n * 3 + 2, 1e12);\n\n\t\n\n  int S = 0;\n\n  int T = 1;\n\n  inc1(i, n) {\n\n    f.add(        S, i * 3 - 1, f.INF);\n\n    f.add(i * 3 - 1, i * 3 + 0, max(a[i], 0LL) - a[i]);\n\n    f.add(i * 3 + 0, i * 3 + 1, max(a[i], 0LL) -  0LL);\n\n    f.add(i * 3 + 1,         T, f.INF);\n\n  }\n\n  inc1(i, n) {\n\n    for(int j = i * 2; j <= n; j += i) { f.add(i * 3, j * 3, f.INF); }\n\n  }\n\n\t\n\n  LL ans = -f.max_flow(S, T);\n\n\t\n\n  inc1(i, n) { ans += max(a[i], 0LL); }\n\n\t\n\n  cout << ans << endl;\n\n\t\n\n  return 0;\n\n}\n"}
{"fast_code_id":"b7b76073cc55f7523d4af6fdb728785fed8ffac6bbd916d87b980c4bfbdfde1c","fast_id":"65c06b2c359742bf68245c2c0640102d876a2aec2db217cc27a982eed337ef9a","fast_time":0.0181013504,"language":"cpp","measured_fast_code_id":"65c06b2c359742bf68245c2c0640102d876a2aec2db217cc27a982eed337ef9a","measured_slow_code_id":"d095e6e63ce215d7a06af20a3982a798a8d64f3400fcfd56928b1ce91c89877c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72254","problem_id":"p03358","slow_code_id":"77edcc1de4aabf7db8fdbb54370ecc5575bfb2dac3e510182009ecd29411e6e2","slow_id":"d095e6e63ce215d7a06af20a3982a798a8d64f3400fcfd56928b1ce91c89877c","slow_time":0.3280938647,"speedup":18.125380562767294,"stratum":"8+","sampling_key":"505dc09956a0c62d247f7d88bedb50893dd017464e432febe8ac75d2d389e494","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 100005;\n\nint n, s, u, md, f[N];\n\nchar c[N];\n\nvector<int> e[N];\n\nint dfs(int x, int fa)\n\n{\n\n  int ret = (c[x] == 'W');\n  int deg = fa > 0;\n\n  for (int i = 0; i < e[x].size(); i++)\n\n  {\n\n    int y = e[x][i];\n\n    if (y != fa && dfs(y, x))\n\n      ret = 1, s += 2, deg++;\n  }\n\n  if (ret)\n\n  {\n\n    f[x] = (deg & 1) != (c[x] == 'W');\n\n    s += f[x];\n    f[x] *= 2;\n\n  }\n\n  else\n\n    f[x] = -1;\n\n  return ret;\n}\n\nvoid dfs2(int x, int fa, int d)\n\n{\n\n  d += f[x];\n  if (d >= md)\n    md = d, u = x;\n\n  for (int i = 0; i < e[x].size(); i++)\n\n  {\n\n    if (e[x][i] != fa && f[e[x][i]] != -1)\n\n      dfs2(e[x][i], x, d);\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    int x, y;\n\n    scanf(\"%d%d\", &x, &y);\n\n    e[x].push_back(y);\n\n    e[y].push_back(x);\n  }\n\n  scanf(\"%s\", c + 1);\n\n  for (int i = 1; i <= n; i++)\n\n    if (c[i] == 'W')\n\n    {\n\n      dfs(i, 0);\n      md = -N;\n\n      dfs2(i, 0, 0);\n      md = -N;\n\n      dfs2(u, 0, 0);\n\n      printf(\"%d\\n\", s > 1 ? s - md : 1);\n\n      return 0;\n    }\n\n  printf(\"0\\n\");\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint n, tot, sum, a[2100000], f[2100000], deg[2100000], dp[2100000][2];\n\nbool w[2100000];\nchar s[2100000];\n\nint edgenum, vet[4100000], Next[4100000], Head[2100000];\n\nvoid addedge(int u, int v) {\n\n  vet[++edgenum] = v;\n  deg[v] ^= 1;\n\n  Next[edgenum] = Head[u];\n\n  Head[u] = edgenum;\n}\n\nvoid dfs(int u, int fa) {\n\n  if (s[u] == 'W')\n    w[u] = true;\n\n  for (int e = Head[u]; e; e = Next[e])\n\n    if (vet[e] != fa) {\n\n      dfs(vet[e], u);\n\n      if (!w[vet[e]]) {\n\n        deg[u] ^= 1;\n\n        deg[vet[e]] ^= 1;\n      }\n\n      w[u] |= w[vet[e]];\n    }\n\n  if (w[u])\n    tot++;\n}\n\nvoid dfs2(int u, int fa) {\n\n  f[u] = (tot - 1) * 2 + sum;\n\n  dp[u][0] = a[u] ? -1 : 1;\n\n  for (int e = Head[u]; e; e = Next[e])\n\n    if (vet[e] != fa && w[vet[e]]) {\n\n      dfs2(vet[e], u);\n\n      f[u] = min(f[u], f[vet[e]]);\n\n      f[u] = min(f[u], (tot - 1) * 2 + sum - dp[u][0] - dp[vet[e]][1] - 1);\n\n      f[u] = min(f[u], (tot - 1) * 2 + sum - dp[u][1] - dp[vet[e]][0] - 1);\n\n      dp[u][0] = max(dp[u][0], dp[vet[e]][0] + 1 + (a[u] ? -1 : 1));\n\n      dp[u][1] = max(dp[u][1], dp[vet[e]][1] + 1 + (a[u] ? -1 : 1));\n    }\n}\n\nint main() {\n\n  scanf(\"%d\", &n);\n  int u, v;\n\n  for (int i = 1; i < n; i++) {\n\n    scanf(\"%d%d\", &u, &v);\n\n    addedge(u, v);\n    addedge(v, u);\n  }\n\n  scanf(\"%s\", s + 1);\n  int rt = 0;\n\n  for (int i = 1; i <= n; i++)\n\n    if (s[i] == 'W')\n      rt = i;\n\n  if (!rt) {\n\n    puts(\"0\");\n\n    return 0;\n  }\n\n  dfs(rt, 0);\n\n  for (int i = 1; i <= n; i++)\n\n    if (w[i]) {\n\n      a[i] = (s[i] == 'B') ^ deg[i];\n\n      sum += !a[i];\n    }\n\n  dfs2(rt, 0);\n\n  printf(\"%d\\n\", f[rt]);\n\n  return 0;\n}\n"}
{"fast_code_id":"b42ae227361fa9e5ab2895989e438f83cc0c33477aa13defdb2536bd8ae6ac71","fast_id":"4c4849c780ceb59309c5e33f5734f51e644caa919e74d08078cb2b81a78d5bd8","fast_time":0.0125236065,"language":"cpp","measured_fast_code_id":"4c4849c780ceb59309c5e33f5734f51e644caa919e74d08078cb2b81a78d5bd8","measured_slow_code_id":"74ce5c999ec0c7e1e017dce1fab2040dfcf0714c0a35109faab93d449e38c144","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72261","problem_id":"p03617","slow_code_id":"b38bfd1b48daa979f618a023ec276d8d8ccf609931d6ca5f5d969bd692e0ca5e","slow_id":"74ce5c999ec0c7e1e017dce1fab2040dfcf0714c0a35109faab93d449e38c144","slow_time":0.0654802892,"speedup":5.228548916799646,"stratum":"4-8","sampling_key":"b800c78950a56c38c80055e4bae97445f5ec00e3ef652fe5fdff04fda1666a2d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(void)\n\n{\n\n  int64_t n;\n\n  int a[4];\n\n  pair<int, int> b[4];\n\n  for (int i = 0; i < 4; i++) {\n\n    scanf(\"%d\", &a[i]);\n\n    b[i].first = a[i] << (3 - i);\n\n    b[i].second = i;\n  }\n\n  sort(b, b + 4);\n\n  scanf(\"%lld\", &n);\n\n  n *= 4;\n\n  int64_t ans = 0;\n\n  while (n) {\n\n    if (n <= 4 && b[0].second == 3) {\n\n      ans += a[b[1].second];\n\n      n -= 1 << b[1].second;\n\n    }\n\n    else {\n\n      int div = 1 << b[0].second;\n\n      ans += n / div * a[b[0].second];\n\n      n %= div;\n    }\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint min(int a, int b)\n\n{\n\n  return a < b ? a : b;\n}\n\nint main(void)\n\n{\n\n  long long q, h, s, d, n;\n\n  scanf(\"%lld%lld%lld%lld%lld\", &q, &h, &s, &d, &n);\n\n  s = min(s, min(q * 4, h * 2));\n\n  d = min(d, s * 2);\n\n  long long ans = n / 2 * d + n % 2 * s;\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"02d70f0bdf7fde28278ed3289410cf7ed04aad014db7b70d02a12752f888199f","fast_id":"2d1dc3297f93b8c265d83146d8c4c38d274f337e07edef158b92b4e429452582","fast_time":0.1055713127,"language":"cpp","measured_fast_code_id":"2d1dc3297f93b8c265d83146d8c4c38d274f337e07edef158b92b4e429452582","measured_slow_code_id":"01d02d4e26f89eb2913b8df8e6ed5f2c3c96db3484ff9e34ef2be86bf7f1069f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72333","problem_id":"p03061","slow_code_id":"f8a42219002116bdf1c547de70a354ffe77ffeee772479065fc9421d9c452f31","slow_id":"01d02d4e26f89eb2913b8df8e6ed5f2c3c96db3484ff9e34ef2be86bf7f1069f","slow_time":0.2285759402,"speedup":2.165133068388947,"stratum":"2-4","sampling_key":"201e84dc44e792ef51cf792d9b4d30732073e532b924711edca1dd484de33489","slow_code":"#include <iostream>\n\n#include <math.h>\n\n#include <stdlib.h>\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define INF (1 << 30)\n\nint n;\n\nint a[100001];\n\nint dp[100001][2];\n\nint dpsolve() {\n\n  random_shuffle(a, a + n);\n\n  fill_n(*dp, 100001 * 2, -1);\n\n  for (int d = n - 1; d != -1; d--) {\n\n    for (int skip = 0; skip < 2; skip++) {\n\n      if (d == n - 1) {\n\n        dp[d][skip] = a[d];\n\n        continue;\n      }\n\n      int ans = 0;\n\n      ans = max(ans, __gcd(dp[d + 1][skip], a[d]));\n\n      if (skip == 0) {\n\n        ans = max(ans, dp[d + 1][1]);\n      }\n\n      dp[d][skip] = ans;\n    }\n  }\n\n  return dp[0][0];\n}\n\nint main() {\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i < 5; i++) {\n\n    ans = max(ans, dpsolve());\n  }\n\n  cout << ans << endl;\n}","fast_code":"#include <iostream>\n\n#include <math.h>\n\n#include <stdlib.h>\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define INF (1 << 30)\n\nint n;\n\nint a[100001];\n\nint gcdl[100001];\n\nint gcdr[100001];\n\nint main() {\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n  }\n\n  gcdl[0] = 0;\n\n  gcdr[0] = 0;\n\n  for (int i = 1; i < n; i++) {\n\n    gcdl[i] = __gcd(gcdl[i - 1], a[i - 1]);\n\n    gcdr[i] = __gcd(gcdr[i - 1], a[n - i]);\n  }\n\n  int ans = 1;\n\n  for (int i = 0; i < n; i++) {\n\n    int now = __gcd(gcdl[i], gcdr[n - i - 1]);\n\n    ans = max(ans, now);\n  }\n\n  cout << ans << endl;\n}"}
{"fast_code_id":"7a90522d4b0ddf59e9118330e57d4a3d9661ed788d5d43db6712ac006754b205","fast_id":"a1295a63ce8f122e8a95bcc5d47403a36c50c2cc069d973a628fe3612ddf6fff","fast_time":0.0201941377,"language":"cpp","measured_fast_code_id":"a1295a63ce8f122e8a95bcc5d47403a36c50c2cc069d973a628fe3612ddf6fff","measured_slow_code_id":"52288971f3b7a7fe6754b8ae656e2c13e242b300d739277e877de96945d612c1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72431","problem_id":"p02918","slow_code_id":"4327f9a7125c6e3643791ecf5f4e0f0b063c559175d8d922b0d10b40c721def5","slow_id":"52288971f3b7a7fe6754b8ae656e2c13e242b300d739277e877de96945d612c1","slow_time":0.1174221228,"speedup":5.8146638665339,"stratum":"4-8","sampling_key":"086cd715a52704fe8b6b733da7ce84cd7bfe89fc16a09261a6c22e7f0a412ad4","slow_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  int n, k, c = 0, an, i;\n\n  char s[100005] = {'\\0'};\n\n  cin >> n >> k;\n\n  for (i = 0; i < n; i++) {\n\n    cin >> s[i];\n  }\n\n  int count = 0;\n\n  i = 0;\n\n  if (s[i] == 'R' && s[i + 1] == 'R')\n    count++;\n\n  for (i = 1; i < n - 1; i++) {\n\n    if (s[i] == 'L' && s[i - 1] == 'L')\n      count++;\n\n    if (s[i] == 'R' && s[i + 1] == 'R')\n      count++;\n  }\n\n  if (s[i] == 'L' && s[i - 1] == 'L')\n    count++;\n\n  an = min((count + 2 * k), (n - 1));\n\n  cout << an;\n\n  system(\"pause\");\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nchar ren[1000000];\n\nint main()\n\n{\n\n  int n, k;\n\n  scanf(\"%d %d\", &n, &k);\n\n  int xf = 0;\n\n  int j2 = 0;\n\n  scanf(\"%s\", &ren);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    if (ren[i] == ren[i - 1])\n\n      xf++;\n  }\n\n  if (xf + 2 * k > n - 1)\n\n    xf = n - 1;\n\n  else\n\n    xf = xf + 2 * k;\n\n  printf(\"%d\", xf);\n}"}
{"fast_code_id":"66f39b380e408b74c1690adfb9efb00d38d2a190f6373972fef4a63bb58ba514","fast_id":"21f1ac6f02c44263062476c379a464f12599c08aadce7125011f360fac0f156f","fast_time":0.0362328098,"language":"cpp","measured_fast_code_id":"21f1ac6f02c44263062476c379a464f12599c08aadce7125011f360fac0f156f","measured_slow_code_id":"d8968a3ce2e071c5de1a053f7fe4828289b833c6264952c932c18cf4c555b250","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72448","problem_id":"p03432","slow_code_id":"0e65a65acb53bb7ee559081077b32a351c6bbe73d350afe21dc29f775345952b","slow_id":"d8968a3ce2e071c5de1a053f7fe4828289b833c6264952c932c18cf4c555b250","slow_time":0.0926927198,"speedup":2.5582537018699556,"stratum":"2-4","sampling_key":"f9094def4841ce9e068677cd8088274a6be89515a03d651194a0dfd71b0d5f10","slow_code":"#include <cstdio>\n\nusing namespace std;\n\n#define N 16400\n\n#define M 204\n\n#define mod 998244353\n\nint dp[M][N], n, m, fr[N], ifr[N], rev[N], a[N], b[N], ntt[N];\n\nint pw(int a, int p) {\n  int as = 1;\n  while (p) {\n    if (p & 1)\n      as = 1ll * as * a % mod;\n    a = 1ll * a * a % mod;\n    p >>= 1;\n  }\n  return as;\n}\n\nint c(int a, int b) {\n  if (a < b)\n    return 0;\n  return 1ll * fr[a] * ifr[b] % mod * ifr[a - b] % mod;\n}\n\nvoid dft(int s, int *a, int t)\n\n{\n\n  for (int i = 0; i < s; i++)\n    rev[i] = (rev[i >> 1] >> 1) | (i & 1 ? s >> 1 : 0), ntt[rev[i]] = a[i];\n\n  for (int i = 2; i <= s; i <<= 1)\n\n  {\n\n    int st = pw(3, (mod - 1) / i);\n\n    if (t == -1)\n      st = pw(st, mod - 2);\n\n    for (int j = 0; j < s; j += i)\n\n      for (int k = j, t = 1; k < j + (i >> 1); k++, t = 1ll * t * st % mod)\n\n      {\n\n        int v1 = ntt[k], v2 = 1ll * ntt[k + (i >> 1)] * t % mod;\n\n        ntt[k] = (v1 + v2) % mod;\n        ntt[k + (i >> 1)] = (v1 - v2 + mod) % mod;\n      }\n  }\n\n  int inv = t == -1 ? pw(s, mod - 2) : 1;\n\n  for (int i = 0; i < s; i++)\n    a[i] = 1ll * ntt[i] * inv % mod;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  dp[0][0] = 1;\n\n  fr[0] = ifr[0] = 1;\n  for (int i = 1; i <= 8020; i++)\n    fr[i] = 1ll * fr[i - 1] * i % mod, ifr[i] = pw(fr[i], mod - 2);\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int l = 1;\n    while (l <= n * 2)\n      l <<= 1;\n    for (int j = 0; j < l; j++)\n      a[j] = b[j] = 0;\n\n    for (int j = 0; j <= n; j++)\n      a[j] = 1ll * dp[i - 1][j] * ifr[j] % mod;\n\n    for (int j = 1; j <= n; j++)\n      b[j] = ifr[j + 2];\n\n    dft(l, a, 1);\n    dft(l, b, 1);\n    for (int j = 0; j < l; j++)\n      a[j] = 1ll * a[j] * b[j] % mod;\n    dft(l, a, -1);\n\n    for (int j = 0; j <= n; j++)\n      dp[i][j] = (1ll * a[j] * fr[j + 2] +\n                  1ll * (1ll * j * (j - 1) % mod * 499122177 % mod + j + 1) %\n                      mod * dp[i - 1][j]) %\n                 mod;\n  }\n\n  int as = 0;\n\n  for (int j = 0; j <= n; j++)\n    as = (as + 1ll * dp[m][j] * c(n, j)) % mod;\n\n  printf(\"%d\\n\", as);\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nnamespace TYC\n\n{\n\ntypedef long long ll;\n\nconst int N = 8005, M = 205, MAXN = 1 << 15 | 5, mod = 998244353, INV2 = (mod + 1) >> 1;\n\nint F[M][N], Fac[N], Inv[N], A[MAXN], B[MAXN], w[MAXN], rev[MAXN];\n\ninline int qpow(int x, int tim)\n\n{\n\n  int ans = 1;\n\n  for (; tim; tim >>= 1, x = (ll)x * x % mod)\n\n    if (tim & 1)\n\n      ans = (ll)ans * x % mod;\n\n  return ans;\n}\n\nvoid init(const int n)\n\n{\n\n  for (int i = 0; i < n; i++)\n\n    rev[i] = (rev[i >> 1] >> 1) | ((i & 1) * (n >> 1));\n\n  w[0] = 1, w[1] = qpow(3, (mod - 1) / n);\n\n  for (int i = 2; i < n; i++)\n\n    w[i] = (ll)w[i - 1] * w[1] % mod;\n}\n\nvoid NTT(int *a, const int n, const int type)\n\n{\n\n  for (int i = 0; i < n; i++)\n\n    if (i < rev[i])\n\n      swap(a[i], a[rev[i]]);\n\n  if (type)\n\n    reverse(w + 1, w + n);\n\n  for (int len = 1; len < n; len <<= 1)\n\n    for (int i = 0; i < n; i += len << 1)\n\n      for (int k = 0; k < len; k++)\n\n      {\n\n        int x = a[i + k], y = (ll)w[n / (len << 1) * k] * a[i + len + k] % mod;\n\n        a[i + k] = (x + y) % mod;\n\n        a[i + len + k] = (x - y + mod) % mod;\n      }\n\n  if (type)\n\n  {\n\n    reverse(w + 1, w + n);\n\n    for (int i = 0, t = qpow(n, mod - 2); i < n; i++)\n\n      a[i] = (ll)a[i] * t % mod;\n  }\n}\n\ninline int C(const int x, const int y)\n\n{\n  return x < y ? 0 : (ll)Fac[x] * Inv[x - y] % mod * Inv[y] % mod;\n}\n\nvoid work()\n\n{\n\n  int n, m;\n\n  scanf(\"%d%d\", &n, &m);\n\n  int t = max(n++, m) + 2;\n\n  Fac[0] = 1;\n\n  for (int i = 1; i <= t; i++)\n\n    Fac[i] = (ll)Fac[i - 1] * i % mod;\n\n  Inv[t] = qpow(Fac[t], mod - 2);\n\n  for (int i = t; i; i--)\n\n    Inv[i - 1] = (ll)Inv[i] * i % mod;\n\n  int len;\n\n  for (len = 1; len < (n << 1); len <<= 1)\n    ;\n\n  init(len);\n\n  F[0][0] = 1;\n\n  for (int j = 1; j <= m; j++)\n\n  {\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      A[i] = (ll)F[j - 1][i] * Inv[i] % mod;\n\n      B[i] = Inv[i + 2];\n    }\n\n    B[0] = 0;\n\n    memset(A + n, 0, sizeof(int[len - n]));\n\n    memset(B + n, 0, sizeof(int[len - n]));\n\n    NTT(A, len, 0);\n\n    NTT(B, len, 0);\n\n    for (int i = 0; i < len; i++)\n\n      A[i] = (ll)A[i] * B[i] % mod;\n\n    NTT(A, len, 1);\n\n    for (int i = 0; i < n; i++)\n\n      F[j][i] =\n          (((ll)i * (i + 1) / 2 + 1) % mod * F[j - 1][i] % mod + (ll)A[i] * Fac[i + 2] % mod) % mod;\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i < n; i++)\n\n    ans = (ans + (ll)F[m][i] * C(n - 1, i)) % mod;\n\n  printf(\"%d\\n\", ans);\n}\n\n}                 \n\nint main()\n\n{\n\n  TYC::work();\n\n  return 0;\n}"}
{"fast_code_id":"c8e78498de05afee3182accbf1e4071267f249363258507839d46b289d15cda8","fast_id":"5db1334d9737ab7d8de2e7df3e1923d0ea18aa6d15313129cd3528b2eebf3288","fast_time":0.0249305045,"language":"cpp","measured_fast_code_id":"5db1334d9737ab7d8de2e7df3e1923d0ea18aa6d15313129cd3528b2eebf3288","measured_slow_code_id":"de2bb43d4738e5ffed96ab8f46530e74ac1cccb878a2b721ffb3dd769d7b4ae4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72467","problem_id":"p02557","slow_code_id":"8d2f0fc8685170e3cc9b7e355045da15833531274c64bb308ff0dc347552ebdf","slow_id":"de2bb43d4738e5ffed96ab8f46530e74ac1cccb878a2b721ffb3dd769d7b4ae4","slow_time":0.2008265777,"speedup":8.055455825212041,"stratum":"8+","sampling_key":"15a8d73a92c8a8b563c3736c4bb71bd1eb3b2a000c41f97332c50d4a05c1f928","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 7;\n\nint n;\n\nvector<int> pos[N];\n\nint cnt[N], res[N];\n\nset<int> have_a, have_b;\n\nset<pair<int, int>> st;\n\nint get(int i) { return (int)pos[i].size() + cnt[i]; }\n\nvoid pairup(int i, int j) {\n\n  res[pos[i].back()] = j;\n\n  pos[i].pop_back();\n\n  --cnt[j];\n}\n\nvoid add(int i) {\n\n  if (get(i) > 0)\n    st.insert({get(i), i});\n\n  if (!pos[i].empty())\n    have_a.insert(i);\n\n  if (cnt[i] > 0)\n    have_b.insert(i);\n}\n\nvoid del(int i) {\n\n  if (get(i) > 0)\n    st.erase({get(i), i});\n\n  if (!pos[i].empty())\n    have_a.erase(i);\n\n  if (cnt[i] > 0)\n    have_b.erase(i);\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cin >> n;\n\n  for (int i = 0; i < n; ++i) {\n\n    int a;\n\n    cin >> a;\n\n    pos[a].push_back(i);\n  }\n\n  for (int i = 0; i < n; ++i) {\n\n    int b;\n\n    cin >> b;\n\n    ++cnt[b];\n  }\n\n  for (int i = 0; i < N; ++i) {\n\n    if (get(i) > n) {\n\n      cout << \"No\\n\";\n\n      return 0;\n    }\n\n    add(i);\n  }\n\n  int cur_n = n;\n\n  while (!st.empty()) {\n\n    int cur = st.rbegin()->second;\n\n    del(cur);\n\n    if (!st.empty() && st.rbegin()->first == cur_n) {\n\n      int who = st.rbegin()->second;\n\n      del(who);\n\n      if (!pos[cur].empty() && cnt[who] > 0)\n        pairup(cur, who);\n      else\n        pairup(who, cur);\n\n      add(who);\n\n    } else {\n\n      if (!pos[cur].empty() && !have_b.empty()) {\n\n        int who = *have_b.begin();\n\n        del(who);\n\n        pairup(cur, who);\n\n        add(who);\n\n      } else {\n\n        int who = *have_a.begin();\n\n        del(who);\n\n        pairup(who, cur);\n\n        add(who);\n      }\n    }\n\n    add(cur);\n\n    --cur_n;\n  }\n\n  cout << \"Yes\\n\";\n\n  for (int i = 0; i < n; ++i)\n    cout << res[i] << \" \";\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\nconst int N = 2e5 + 7;\n\nint n, a[N], b[N];\n\nvoid out() {\n\n  cout << \"Yes\\n\";\n\n  for (int i = 0; i < n; ++i)\n\n    cout << b[i] << \" \";\n\n  exit(0);\n}\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cin >> n;\n\n  for (int i = 0; i < n; ++i)\n\n    cin >> a[i];\n\n  for (int i = 0; i < n; ++i)\n\n    cin >> b[i];\n\n  reverse(b, b + n);\n\n  int bad = -1;\n\n  for (int i = 0; i < n; ++i) {\n\n    if (a[i] == b[i])\n\n      bad = b[i];\n  }\n\n  vector<int> arr;\n\n  for (int i = 0; i < n; ++i) {\n\n    if (a[i] != bad && b[i] != bad)\n\n      arr.push_back(i);\n  }\n\n  int pos = 0;\n\n  for (int i = 0; i < n; ++i) {\n\n    if (a[i] == b[i]) {\n\n      if (pos == arr.size()) {\n\n        cout << \"No\\n\";\n\n        return 0;\n      }\n\n      swap(b[arr[pos++]], b[i]);\n    }\n  }\n\n  out();\n\n  return 0;\n}\n"}
{"fast_code_id":"26e23fb34df576ee6eaa642aae14ad9b83fe1c3d58552977720ec97d85e7b94b","fast_id":"f7fd4d399740c0a176368142a2dc800550176e55b1a6ed6d2b971b57cf5d814b","fast_time":0.0311569527,"language":"cpp","measured_fast_code_id":"f7fd4d399740c0a176368142a2dc800550176e55b1a6ed6d2b971b57cf5d814b","measured_slow_code_id":"460684fa3dc861cde4e351426981e4e79fef4f07c5cbdaf11662e8baef4469f7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72479","problem_id":"p03213","slow_code_id":"9ec7f47c5b18cf0e017627b0e8e59e7826dcf31299ad563f950cc37f5820b45f","slow_id":"460684fa3dc861cde4e351426981e4e79fef4f07c5cbdaf11662e8baef4469f7","slow_time":0.0929008629,"speedup":2.98170568201941,"stratum":"2-4","sampling_key":"1042e7ce30499fdc1dc9a204b598f9ea1893c4f3549a7f9ecf014f58b8db8280","slow_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < int(n); i++)\n\n#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)\n\n#define reps(i, n) for (int i = 1; i <= int(n); i++)\n\n#define rreps(i, n) for (int i = int(n); i >= 1; i--)\n\n#define repc(i, n) for (int i = 0; i <= int(n); i++)\n\n#define rrepc(i, n) for (int i = int(n); i >= 0; i--)\n\n#define repi(i, a, b) for (int i = int(a); i < int(b); i++)\n\n#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)\n\n#define each(x, y) for (auto &x : y)\n\n#define all(a) (a).begin(), (a).end()\n\n#define bit32(x) (1 << (x))\n\n#define bit64(x) (1ll << (x))\n\n#define sz(v) ((int)v.size())\n\nusing namespace std;\n\nusing i64 = long long;\n\nusing f80 = long double;\n\nusing vi32 = vector<int>;\n\nusing vi64 = vector<i64>;\n\nusing vf80 = vector<f80>;\n\nusing vstr = vector<string>;\n\ninline void yes() {\n  cout << \"Yes\" << endl;\n  exit(0);\n}\n\ninline void no() {\n  cout << \"No\" << endl;\n  exit(0);\n}\n\ntemplate <typename T>\nclass pqasc : public priority_queue<T, vector<T>, greater<T>> {};\n\ntemplate <typename T>\nclass pqdesc : public priority_queue<T, vector<T>, less<T>> {};\n\ntemplate <typename T> inline void amax(T &x, T y) { x = max(x, y); }\n\ntemplate <typename T> inline void amin(T &x, T y) { x = min(x, y); }\n\ntemplate <typename T> inline T exp(T x, i64 n, T e = 1) {\n  T r = e;\n  while (n > 0) {\n    if (n & 1)\n      r *= x;\n    x *= x;\n    n >>= 1;\n  }\n  return r;\n}\n\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) {\n  each(x, v) is >> x;\n  return is;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> &v) {\n  rep(i, v.size()) {\n    if (i)\n      os << ' ';\n    os << v[i];\n  }\n  return os;\n}\n\nvoid solve();\nint main() {\n  ios::sync_with_stdio(0);\n  cin.tie(0);\n  cout << fixed << setprecision(16);\n  solve();\n  return 0;\n}\n\nstruct Prime {\n\n  int n;\n\n  vector<int> pri;\n\n  Prime() : n(0) {}\n\n  Prime(int n) : n(n) {\n\n    vector<bool> f(n, true);\n\n    f[0] = f[1] = false;\n\n    for (int i = 2; i < n; i++) {\n\n      if (!f[i])\n        continue;\n\n      pri.push_back(i);\n\n      for (int j = i * 2; j < n; j += i) {\n\n        f[j] = false;\n      }\n    }\n  }\n\n  bool is(int x) {\n\n    if (n > x) {\n\n      return binary_search(pri.begin(), pri.end(), x);\n    }\n\n    if (x < 2)\n      return 0;\n\n    for (int i = 2; i * i <= x; i++) {\n\n      if (x % i == 0)\n        return false;\n    }\n\n    return true;\n  }\n\n  map<int, int> factor(int k) {\n\n    map<int, int> so;\n\n    for (auto p : pri) {\n\n      while (k % p == 0)\n        k /= p, so[p]++;\n    }\n\n    if (k != 1)\n      so[k] = 1;\n\n    return so;\n  }\n};\n\nauto prime = Prime(1000);\n\nvoid solve() {\n\n  int len = 0;\n\n  each(p, prime.pri) {\n\n    if (p >= 100)\n      break;\n\n    len++;\n  }\n\n  vi32 cnt(len);\n\n  int n;\n\n  cin >> n;\n\n  reps(i, n) {\n\n    int x = i;\n\n    rep(j, len) {\n\n      int p = prime.pri[j];\n\n      while (x % p == 0)\n        cnt[j]++, x /= p;\n    }\n  }\n\n  int ans = 0;\n\n  rep(i, len) {\n\n    if (cnt[i] >= 74)\n      ans++;\n  }\n\n  rep(i, len) rep(j, len) {\n\n    if (i == j)\n      continue;\n\n    if (cnt[i] >= 24 && cnt[j] >= 2)\n      ans++;\n  }\n\n  rep(i, len) rep(j, len) {\n\n    if (i == j)\n      continue;\n\n    if (cnt[i] >= 14 && cnt[j] >= 4)\n      ans++;\n  }\n\n  set<tuple<int, int, int>> se;\n\n  rep(i, len) rep(j, len) rep(k, len) {\n\n    if (i == j || j == k || k == i)\n      continue;\n\n    if (se.count(make_tuple(min(i, j), max(i, j), k)) >= 1)\n      continue;\n\n    if (cnt[i] >= 4 && cnt[j] >= 4 && cnt[k] >= 2)\n      ans++;\n\n    se.insert(make_tuple(min(i, j), max(i, j), k));\n  }\n\n  cout << ans << endl;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < int(n); i++)\n\n#define reps(i, n) for (int i = 1; i <= int(n); i++)\n\n#define repc(i, n) for (int i = 0; i <= int(n); i++)\n\nusing namespace std;\n\nvector<int> primes = {\n\n    2,  3,  5,  7,  11, 13, 17, 19, 23, 29, 31, 37, 41,\n    43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97\n\n};\n\nint L = 25;\n\nint dp[26][76];\n\nint main() {\n\n  vector<int> cnt(L);\n\n  int N;\n\n  cin >> N;\n\n  reps(i, N) {\n\n    int x = i;\n\n    rep(j, L) {\n\n      int p = primes[j];\n\n      while (x % p == 0)\n        cnt[j]++, x /= p;\n    }\n  }\n\n  dp[0][1] = 1;\n\n  rep(i, L) repc(j, 75) repc(k, cnt[i]) {\n\n    if (j * (k + 1) > 75)\n      continue;\n\n    dp[i + 1][j * (k + 1)] += dp[i][j];\n  }\n\n  cout << dp[L][75] << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"deb509f8e215587e212557008789549116e2389fcd9bf4c8ac2e2bfb852d98a9","fast_id":"c8cc13c22ced14cf8b8a8b2365f0208a6ec31d7286cdc51a684c9851212a689d","fast_time":0.0767609008,"language":"cpp","measured_fast_code_id":"c8cc13c22ced14cf8b8a8b2365f0208a6ec31d7286cdc51a684c9851212a689d","measured_slow_code_id":"ac4c54398140cfd3ecc76975342387ddb82f9c98d97165e6514fe0d48f298f3b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72513","problem_id":"p03456","slow_code_id":"4c3ecfa750903bed3fac8c8e4b851115ff21bf9ab24e8070541c016570fc7e64","slow_id":"ac4c54398140cfd3ecc76975342387ddb82f9c98d97165e6514fe0d48f298f3b","slow_time":0.18146812,"speedup":2.364069703569711,"stratum":"2-4","sampling_key":"3829efdab5717a8bc4a5339fd226551caaf872f3574837945551d310839be7fb","slow_code":"#include <bits/stdc++.h>\n\n#define INF (1 << 31)\n\n#define MOD 1000000007\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\nint main(int argc, char *argv[])\n\n{\n\n  std::string a, b;\n\n  std::cin >> a >> b;\n\n  bool flag = false;\n\n  int num = std::stoi(a + b);\n\n  for (int i = 1; i < 1000000; i++) {\n\n    if (i * i == num) {\n\n      flag = true;\n\n    } else {\n\n      ;\n    }\n  }\n\n  if (flag) {\n\n    std::cout << \"Yes\" << std::endl;\n\n  } else {\n\n    std::cout << \"No\" << std::endl;\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define YES cout << \"YES\" << endl;\n\n#define NO cout << \"NO\" << endl;\n\n#define Yes cout << \"Yes\" << endl;\n\n#define No cout << \"No\" << endl;\n\n#define INF INT_MAX\n\n#define MOD 1000000007\n\n#define PI acos(-1)\n\nusing ll = long long;\n\nusing ull = unsigned long long;\n\nusing Pii = pair<int, int>;\n\nusing Pll = pair<ll, ll>;\n\n#define rep(i, n) for (ll i = 0; i < n; i++)\n\nint main(int argc, char *argv[])\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  string a, b;\n\n  cin >> a >> b;\n\n  ll c = stol(a + b);\n\n  rep(i, 1000) {\n\n    if (i * i == c) {\n\n      Yes;\n\n      return 0;\n    }\n  }\n\n  No;\n\n  return 0;\n}"}
{"fast_code_id":"b9614339365fda10beba65dbc91f6840548bb85de87e63d4c914202182bd8803","fast_id":"3b91da7c87f88144acb6be3d226a4f526efde7682a1b11aa54da69285afc3889","fast_time":0.0555725988,"language":"cpp","measured_fast_code_id":"3b91da7c87f88144acb6be3d226a4f526efde7682a1b11aa54da69285afc3889","measured_slow_code_id":"77c02e4b4da32393f81aca2582a5e0417c1dff61e21267d7a7c09620eac5f501","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72524","problem_id":"p01719","slow_code_id":"62bbf1ecc111b42adc77e51723457e098302a8842b35be3d016df27834ab0833","slow_id":"77c02e4b4da32393f81aca2582a5e0417c1dff61e21267d7a7c09620eac5f501","slow_time":0.1575432982,"speedup":2.8349096785446712,"stratum":"2-4","sampling_key":"d13c27f0c6b30036dde7c59062383a4aa4a89dd0e6d053154843a412ec08cd49","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nint main()\n\n{\n\n  cin.sync_with_stdio(false);\n\n  int n, d, x;\n\n  cin >> n >> d >> x;\n\n  vector<vector<ll>> p(d, vector<ll>(n));\n\n  for (int i = 0; i < d; i++) {\n\n    for (int j = 0; j < n; j++) {\n\n      cin >> p[i][j];\n    }\n  }\n\n  for (int i = 1; i < d; i++) {\n\n    vector<ll> dp(100001, -1);\n\n    dp[x] = x;\n\n    for (int j = 0; j < n; j++) {\n\n      for (int k = 0; k <= 100000 - p[i][j]; k++) {\n\n        if (dp[k] >= p[i - 1][j]) {\n\n          dp[k + p[i][j] - p[i - 1][j]] =\n              max(dp[k + p[i][j] - p[i - 1][j]], dp[k] - p[i - 1][j]);\n        }\n      }\n    }\n\n    int ma = 0;\n\n    for (int k = 0; k <= 100000; k++) {\n\n      if (dp[k] >= 0) {\n\n        ma = k;\n      }\n    }\n\n    x = ma;\n  }\n\n  cout << x << endl;\n\n  return 0;\n}","fast_code":"#include <vector>\n\n#include <iostream>\n\n#include <set>\n\n#include <algorithm>\n\n#include <map>\n\n#include <string>\n\n#include <cmath>\n\n#include <tuple>\n\n#include <queue>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef tuple<ll, ll, ll> T;\n\nint main() {\n\n  ll n, d, x;\n\n  cin >> n >> d >> x;\n\n  vector<vector<ll>> p(d, vector<ll>(n));\n\n  for (int i = 0; i < d; i++) {\n\n    for (int j = 0; j < n; j++)\n\n      cin >> p[i][j];\n  }\n\n  ll ans = x;\n\n  for (int t = 0; t < d - 1; t++) {\n\n    vector<ll> dp(ans + 1);\n\n    for (int i = 0; i < n; i++) {\n\n      for (int now = 0; now + p[t][i] <= ans; now++) {\n\n        dp[now + p[t][i]] = max(dp[now] + p[t + 1][i], dp[now + p[t][i]]);\n      }\n    }\n\n    ll next = 0;\n\n    for (int i = 0; i <= ans; i++) {\n\n      next = max(dp[i] + ans - i, next);\n    }\n\n    ans = next;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"ca14e341eaaf0a5b2d3899ddebecb9b2a9a9ea51b2b082099c4f5e75fff00824","fast_id":"e2a041ec9c5afccd8768f6c795dd8802e132b6657b7399852ab551a69e569c87","fast_time":0.0190798822,"language":"cpp","measured_fast_code_id":"e2a041ec9c5afccd8768f6c795dd8802e132b6657b7399852ab551a69e569c87","measured_slow_code_id":"410bb3d2a63f398343700892d9f1551a38e12fa637ce735cc2c863f9829e3632","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72528","problem_id":"p00005","slow_code_id":"d05690e8bd8fefecf5ea74fa2924eea67f6c8a9daece3b25924319020b6eecb0","slow_id":"410bb3d2a63f398343700892d9f1551a38e12fa637ce735cc2c863f9829e3632","slow_time":0.1006943475,"speedup":5.277514108551467,"stratum":"4-8","sampling_key":"0724d8a31be8f068d3b69241b4cf8ba64aec422283ddca94ee87d4fa58b3b9b8","slow_code":"#include <cstdio>\n\n#include <iostream>\n\nusing namespace std;\n\nlong long GCD(long long a, long long b)\n\n{\n\n  if (a == 0 && b == 0)\n\n    return 0;\n\n  if (a == 0)\n    return 1;\n\n  if (b == 0)\n    return a;\n\n  else\n    return GCD(b, a % b);\n}\n\nint main()\n\n{\n\n  long long x, y;\n\n  while (cin >> x >> y)\n\n  {\n\n    long long ans1 = GCD(x, y);\n\n    long long ans2 = (x * y) / ans1;\n\n    cout << ans1 << \" \" << ans2 << \"\\n\";\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nint gcd(int a, int b)\n\n{\n\n  return b ? gcd(b, a % b) : a;\n}\n\nmain()\n\n{\n\n  int a, b;\n\n  while (scanf(\"%d%d\", &a, &b) != EOF)\n\n  {\n\n    int d = gcd(a, b);\n\n    int lc = a / d * b;\n\n    printf(\"%d %d\\n\", d, lc);\n  }\n}"}
{"fast_code_id":"3cdddec0f29e0857fcc434adef7237d7cd6e2f94ed919844b295ea8d862fef97","fast_id":"3ca8d3285f36ca512f54f09a608cc215513dd69faa067987830cbb1b7094b8e8","fast_time":0.1044673947,"language":"cpp","measured_fast_code_id":"3ca8d3285f36ca512f54f09a608cc215513dd69faa067987830cbb1b7094b8e8","measured_slow_code_id":"ea178a6190e7f4b14652f7bed6c3b6f8a3544a47b14cb9f6a292453bab3aabd1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_7253","problem_id":"p03844","slow_code_id":"60baece64c0391388528117e30ca3acdf4bd60239711ede071419306d349ba7a","slow_id":"ea178a6190e7f4b14652f7bed6c3b6f8a3544a47b14cb9f6a292453bab3aabd1","slow_time":0.6809809132,"speedup":6.518597646237654,"stratum":"4-8","sampling_key":"43646e4145238ddaa082b906d972c13f10cb1c53716462c411f448dea82d184e","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 200005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nint main()\n\n{\n\n  char a;\n\n  int b, c;\n\n  cin >> b >> a >> c;\n\n  if (a == '+')\n    cout << b + c;\n\n  else\n    cout << b - c;\n}\n","fast_code":"#include <iostream>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int a, b;\n\n  char c;\n\n  cin >> a >> c >> b;\n\n  if (c == '+')\n\n    cout << a + b;\n\n  else\n\n    cout << a - b;\n\n  return 0;\n}\n"}
{"fast_code_id":"2df4bfc810aa020520e1a4e049e2e6aa66430ba931e54473d3ead5dd25b7011f","fast_id":"4664f9bcaabfaecf8e51a85c18dc9d27bd1f43d874e6b6059acdf56e402d2e2b","fast_time":0.0001864877,"language":"cpp","measured_fast_code_id":"4664f9bcaabfaecf8e51a85c18dc9d27bd1f43d874e6b6059acdf56e402d2e2b","measured_slow_code_id":"8bc0d31414437b8d5397a876bf747a16f633e3cf8d4acd77b1aaab23af41a0fd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72577","problem_id":"p02866","slow_code_id":"cb0aae22d916bef1cb23d3f20a5d9161360ad2028408586df44014381df53cfb","slow_id":"8bc0d31414437b8d5397a876bf747a16f633e3cf8d4acd77b1aaab23af41a0fd","slow_time":0.0018817178,"speedup":10.090305151492565,"stratum":"8+","sampling_key":"bea38727227c143a5c22e1558ec905c15f4048643bf141607dc9eedb90f63423","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst ll mod = 998244353;\n\nll modpow(ll A, ll B) {\n\n  ll kotae = 1;\n\n  while (B > 0) {\n\n    if (B & 1)\n      kotae = kotae * A % mod;\n\n    A = A * A % mod;\n\n    B >>= 1;\n  }\n\n  return kotae;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int D[200000];\n\n  rep(i, N) cin >> D[i];\n\n  if (D[0] != 0) {\n\n    co(0);\n\n    return 0;\n  }\n\n  sort(D, D + N);\n\n  int saidai = D[N - 1];\n\n  int kazu[200001] = {};\n\n  rep(i, N) kazu[D[i]]++;\n\n  ll kotae = 1;\n\n  if (kazu[0] != 1) {\n\n    co(0);\n\n    return 0;\n  }\n\n  if (saidai > N - 1) {\n\n    co(0);\n\n    return 0;\n  }\n\n  int mae = 1;\n\n  rep1(i, saidai) {\n\n    if (kazu[i] == 0)\n      kotae = 0;\n\n    rep(j, kazu[i]) kotae = kotae * mae % mod;\n\n    mae = kazu[i];\n  }\n\n  co(kotae);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst ll mod = 998244353;\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint kazu[100001];\n\nint main() {\n\n  int N = getint();\n\n  if (getint() != 0) {\n\n    printf(\"0\");\n\n    return 0;\n  }\n\n  int saidai = 0;\n  ;\n\n  rep(i, N - 1) {\n\n    int d = getint();\n\n    if (!d) {\n\n      printf(\"0\");\n\n      return 0;\n    }\n\n    kazu[d]++;\n\n    chmax(saidai, d);\n  }\n\n  ll kotae = 1;\n\n  int mae = 1;\n\n  rep1(i, saidai) {\n\n    rep(j, kazu[i]) kotae = kotae * mae % mod;\n\n    mae = kazu[i];\n  }\n\n  printf(\"%d\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"6445a9f9ae83367fa7f8c58d4ae393bd8c40d3a5e94119a7c42636be5862ce62","fast_id":"b153f729ec985d03876e9989e167781931b307954e93f0c16edfed5ec62fd040","fast_time":0.1087368622,"language":"cpp","measured_fast_code_id":"b153f729ec985d03876e9989e167781931b307954e93f0c16edfed5ec62fd040","measured_slow_code_id":"6067ea8d89c6f6813eae6928e2becdfd72385721738f1b45bfbc1175a073dd96","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72604","problem_id":"p02890","slow_code_id":"a30e6756526f76544ae9103772511f0e04d9ed3142c1720249b0ef1ecc5412b0","slow_id":"6067ea8d89c6f6813eae6928e2becdfd72385721738f1b45bfbc1175a073dd96","slow_time":0.7816376348,"speedup":7.188340908369526,"stratum":"4-8","sampling_key":"1ad6b14a35e2fac0856fd7238297398a7e263a3380e041a7785654ea6b4f5b27","slow_code":"#include <bits/stdc++.h>\n\n#define int long long\n\n#define inf 1000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<double, double>\n\n#define ppap pair<pa, int>\n\n#define PI 3.14159265358979323846\n\n#define paa pair<int, char>\n\n#define mp make_pair\n\n#define pb push_back\n\n#define EPS (1e-8)\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};\n\nusing namespace std;\n\nclass pa3 {\n\npublic:\n  int x;\n\n  int y, z;\n\n  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n\n  bool operator<(const pa3 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    return z < p.z;\n  }\n\n  bool operator>(const pa3 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    return z > p.z;\n  }\n\n  bool operator==(const pa3 &p) const { return x == p.x && y == p.y && z == p.z; }\n\n  bool operator!=(const pa3 &p) const { return !(x == p.x && y == p.y && z == p.z); }\n};\n\nclass pa4 {\n\npublic:\n  int x;\n\n  int y, z, w;\n\n  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n\n  bool operator<(const pa4 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    if (z != p.z)\n      return z < p.z;\n\n    return w < p.w;\n  }\n\n  bool operator>(const pa4 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    if (z != p.z)\n      return z > p.z;\n\n    return w > p.w;\n  }\n\n  bool operator==(const pa4 &p) const { return x == p.x && y == p.y && z == p.z && w == p.w; }\n};\n\nclass pa2 {\n\npublic:\n  int x, y;\n\n  pa2(int x = 0, int y = 0) : x(x), y(y) {}\n\n  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n\n  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n\n  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }\n\n  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const pa2 &p) const { return abs(x - p.x) == 0 && abs(y - p.y) == 0; }\n\n  bool operator!=(const pa2 &p) const { return !(abs(x - p.x) == 0 && abs(y - p.y) == 0); }\n};\n\nstring itos(int i) {\n\n  ostringstream s;\n\n  s << i;\n\n  return s.str();\n}\n\nint gcd(int v, int b) {\n\n  if (v > b)\n    return gcd(b, v);\n\n  if (v == b)\n    return b;\n\n  if (b % v == 0)\n    return v;\n\n  return gcd(v, b % v);\n}\n\nint mod;\n\nint extgcd(int a, int b, int &x, int &y) {\n\n  if (b == 0) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n  }\n\n  int d = extgcd(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\npa operator+(const pa &l, const pa &r) { return {l.first + r.first, l.second + r.second}; }\n\npa operator-(const pa &l, const pa &r) { return {l.first - r.first, l.second - r.second}; }\n\nint pr[1000010];\n\nint inv[1000010];\n\nint beki(int wa, int rr, int warukazu) {\n\n  if (rr == 0)\n    return 1 % warukazu;\n\n  if (rr == 1)\n    return wa % warukazu;\n\n  wa %= warukazu;\n\n  if (rr % 2 == 1)\n    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;\n\n  ll zx = beki(wa, rr / 2, warukazu);\n\n  return (zx * zx) % warukazu;\n}\n\nint comb(int nn, int rr) {\n\n  if (rr < 0 || rr > nn || nn < 0)\n    return 0;\n\n  int r = pr[nn] * inv[rr];\n\n  r %= mod;\n\n  r *= inv[nn - rr];\n\n  r %= mod;\n\n  return r;\n}\n\nvoid gya(int ert) {\n\n  pr[0] = 1;\n\n  for (int i = 1; i <= ert; i++) {\n\n    pr[i] = (pr[i - 1] * i) % mod;\n  }\n\n  inv[ert] = beki(pr[ert], mod - 2, mod);\n\n  for (int i = ert - 1; i >= 0; i--) {\n\n    inv[i] = inv[i + 1] * (i + 1) % mod;\n  }\n}\n\nint cnt[320000] = {};\n\nint imo[400020] = {};\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    int y;\n\n    cin >> y;\n\n    cnt[y]++;\n  }\n\n  vector<int> ve;\n\n  for (int i = 1; i <= n; i++)\n    if (cnt[i])\n      ve.pb(cnt[i]);\n\n  for (auto v : ve) {\n\n    imo[1] += 1;\n\n    imo[v] -= 1;\n  }\n\n  for (int i = 1; i <= 400020; i++)\n    imo[i] += imo[i - 1];\n\n  for (auto v : ve) {\n\n    imo[v]++;\n  }\n\n  for (int i = 1; i <= 400020; i++)\n    imo[i] += imo[i - 1];\n\n  for (int c = 1; c <= n; c++) {\n\n    int si = 0, ue = n + 10, me;\n\n    while (ue - si > 1) {\n\n      me = (ue + si) / 2;\n\n      if (imo[me] >= c * me)\n        si = me;\n\n      else\n        ue = me;\n    }\n\n    cout << si << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define inf 1000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<double, double>\n\n#define ppap pair<pa, int>\n\n#define PI 3.14159265358979323846\n\n#define paa pair<int, char>\n\n#define mp make_pair\n\n#define pb push_back\n\n#define EPS (1e-8)\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};\n\nusing namespace std;\n\nclass pa3 {\n\npublic:\n  int x;\n\n  int y, z;\n\n  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n\n  bool operator<(const pa3 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    return z < p.z;\n  }\n\n  bool operator>(const pa3 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    return z > p.z;\n  }\n\n  bool operator==(const pa3 &p) const { return x == p.x && y == p.y && z == p.z; }\n\n  bool operator!=(const pa3 &p) const { return !(x == p.x && y == p.y && z == p.z); }\n};\n\nclass pa4 {\n\npublic:\n  int x;\n\n  int y, z, w;\n\n  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n\n  bool operator<(const pa4 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    if (z != p.z)\n      return z < p.z;\n\n    return w < p.w;\n  }\n\n  bool operator>(const pa4 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    if (z != p.z)\n      return z > p.z;\n\n    return w > p.w;\n  }\n\n  bool operator==(const pa4 &p) const { return x == p.x && y == p.y && z == p.z && w == p.w; }\n};\n\nclass pa2 {\n\npublic:\n  int x, y;\n\n  pa2(int x = 0, int y = 0) : x(x), y(y) {}\n\n  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n\n  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n\n  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }\n\n  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const pa2 &p) const { return abs(x - p.x) == 0 && abs(y - p.y) == 0; }\n\n  bool operator!=(const pa2 &p) const { return !(abs(x - p.x) == 0 && abs(y - p.y) == 0); }\n};\n\nstring itos(int i) {\n\n  ostringstream s;\n\n  s << i;\n\n  return s.str();\n}\n\nint gcd(int v, int b) {\n\n  if (v > b)\n    return gcd(b, v);\n\n  if (v == b)\n    return b;\n\n  if (b % v == 0)\n    return v;\n\n  return gcd(v, b % v);\n}\n\nint mod;\n\nint extgcd(int a, int b, int &x, int &y) {\n\n  if (b == 0) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n  }\n\n  int d = extgcd(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\npa operator+(const pa &l, const pa &r) { return {l.first + r.first, l.second + r.second}; }\n\npa operator-(const pa &l, const pa &r) { return {l.first - r.first, l.second - r.second}; }\n\nint pr[1000010];\n\nint inv[1000010];\n\nint beki(int wa, int rr, int warukazu) {\n\n  if (rr == 0)\n    return 1 % warukazu;\n\n  if (rr == 1)\n    return wa % warukazu;\n\n  wa %= warukazu;\n\n  if (rr % 2 == 1)\n    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;\n\n  ll zx = beki(wa, rr / 2, warukazu);\n\n  return (zx * zx) % warukazu;\n}\n\nint comb(int nn, int rr) {\n\n  if (rr < 0 || rr > nn || nn < 0)\n    return 0;\n\n  int r = pr[nn] * inv[rr];\n\n  r %= mod;\n\n  r *= inv[nn - rr];\n\n  r %= mod;\n\n  return r;\n}\n\nvoid gya(int ert) {\n\n  pr[0] = 1;\n\n  for (int i = 1; i <= ert; i++) {\n\n    pr[i] = (pr[i - 1] * i) % mod;\n  }\n\n  inv[ert] = beki(pr[ert], mod - 2, mod);\n\n  for (int i = ert - 1; i >= 0; i--) {\n\n    inv[i] = inv[i + 1] * (i + 1) % mod;\n  }\n}\n\nint cnt[320000] = {};\n\nint imo[310020] = {};\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    int y;\n\n    cin >> y;\n\n    cnt[y]++;\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    imo[1] += 1;\n\n    imo[cnt[i] + 1] -= 1;\n  }\n\n  for (int i = 1; i <= n + 15; i++)\n    imo[i] += imo[i - 1];\n\n  for (int i = 1; i <= n + 15; i++)\n    imo[i] += imo[i - 1];\n\n  int ima = 1;\n\n  for (int i = n; i >= 0; i--) {\n\n    while (imo[i] >= ima * i) {\n\n      cout << i << \"\\n\";\n\n      ima++;\n\n      if (ima == n + 1)\n        return 0;\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"9828ff2bf4e0efd42535c536e4719c98cbaf7e00ba47d56278f44455f258f0e2","fast_id":"b95560648ea466ca29fa40a6d21954134161ab1d8d25a8d9315736a6099072c4","fast_time":0.1059147109,"language":"cpp","measured_fast_code_id":"b95560648ea466ca29fa40a6d21954134161ab1d8d25a8d9315736a6099072c4","measured_slow_code_id":"e12176571b559c81e95932703e6827d574e09f5d2649a1045dd7878373d76084","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72617","problem_id":"p03030","slow_code_id":"ecd56069769c307c798b7c974773f4bc47d5e4ee24ca76b1d04b8faeb898f505","slow_id":"e12176571b559c81e95932703e6827d574e09f5d2649a1045dd7878373d76084","slow_time":1.0653079386,"speedup":10.058167836626744,"stratum":"8+","sampling_key":"a03754edef13a0bcbdc3934e7b644ffafd3ce8acf1830de3c2c2d81d19d91618","slow_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <string>\n\n#include <algorithm>\n\nusing namespace std;\n\nint n;\n\nstruct node {\n\n  string nm;\n  int sc, id;\n\n  bool operator<(const node &j) const {\n\n    return nm < j.nm || (nm == j.nm && sc > j.sc);\n  }\n\n} re[200010];\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; ++i) {\n\n    cin >> re[i].nm >> re[i].sc;\n\n    re[i].id = i;\n  }\n\n  sort(re + 1, re + n + 1);\n\n  for (int i = 1; i <= n; ++i) {\n\n    cout << re[i].id << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <string.h>\n\nusing namespace std;\n\ntypedef struct {\n\n  char str[101];\n\n  int pri;\n\n  int no;\n\n} node;\n\nnode p[101];\n\nbool cmp(node a, node b)\n\n{\n\n  if (a.str != b.str)\n\n    return strcmp(a.str, b.str) < 0;\n\n  else\n\n    return a.pri < b.pri;\n}\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%s\", &p[i].str);\n\n    cin >> p[i].pri;\n\n    p[i].no = i + 1;\n  }\n\n  sort(p, p + n, cmp);\n\n  for (int i = 0; i < n; i++)\n\n    for (int j = 0; j < n - i - 1; j++) {\n\n      if (strcmp(p[j].str, p[j + 1].str) == 0 && p[j].pri < p[j + 1].pri)\n\n        swap(p[j], p[j + 1]);\n    }\n\n  for (int i = 0; i < n; i++)\n\n    cout << p[i].no << endl;\n\n  return 0;\n}"}
{"fast_code_id":"1e90ff5fe5cb614af2e07d55f9aa2a864eab50d75d95a48ba998053f82a1f026","fast_id":"a319d328425f786aef7bcef37dd336bbfa9b48fdbca457b7a37fdc67c5552187","fast_time":0.0211362414,"language":"cpp","measured_fast_code_id":"a319d328425f786aef7bcef37dd336bbfa9b48fdbca457b7a37fdc67c5552187","measured_slow_code_id":"50fc3567a6385276699602c07b99e289fa1954c626ea7bc12366b8275e86041b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72631","problem_id":"p01420","slow_code_id":"fc8f0fe485088b489ceeed4250e345cace116b1619b18889750fab70e4443aa3","slow_id":"50fc3567a6385276699602c07b99e289fa1954c626ea7bc12366b8275e86041b","slow_time":0.0763057063,"speedup":3.610183327107534,"stratum":"2-4","sampling_key":"05f1acfb9bec5c65aa606e646f35a5a751c4a5ae80c83abe2fec1a2bd3128f7f","slow_code":"#include <stdio.h>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <string>\n\nusing namespace std;\n\nconst double eps = 1e-12;\n\n#define REP(i, x) for (int i = 0; i < x; i++)\n\ndouble tmp[107][107];\n\ndouble rest[107][107], rsum[107][107];\n\nint N, M, L;\n\nint p[107], t[107], v[107];\n\ndouble pp[107];\n\nint main()\n\n{\n\n  while (scanf(\"%d%d%d\", &N, &M, &L) != EOF)\n\n  {\n\n    REP(i, N) scanf(\"%d%d%d\", &p[i], &t[i], &v[i]);\n\n    REP(i, N) pp[i] = p[i] / 100.0;\n\n    REP(i, N)\n\n    {\n\n      REP(j, M + 1) REP(k, M + 1) tmp[j][k] = 0;\n\n      tmp[0][0] = 1.00;\n\n      for (int j = 1; j <= M; ++j)\n\n        for (int k = 0; k <= j; ++k)\n\n        {\n\n          tmp[j][k] = tmp[j - 1][k] * (1 - pp[i]);\n\n          if (k)\n            tmp[j][k] += tmp[j - 1][k - 1] * pp[i];\n        }\n\n      for (int j = M; j >= 0; --j)\n\n      {\n\n        rest[i][j] = tmp[M][j];\n\n        rsum[i][j] = tmp[M][j];\n\n        if (j != M)\n          rsum[i][j] += rsum[i][j + 1];\n      }\n    }\n\n    REP(i, N)\n\n    {\n\n      double ans = 0;\n\n      for (int times = 0; times <= M && v[i] != 0; ++times)\n\n      {\n\n        double part = 1.00;\n\n        double use = L / (double)v[i] + t[i] * times;\n\n        for (int k = 0; k < N; ++k)\n\n          if (k != i)\n\n          {\n\n            if (v[k] == 0)\n              continue;\n\n            int l = 0, r = M;\n\n            while (l < r)\n\n            {\n\n              int mid = (l + r) >> 1;\n\n              double total = L / (double)v[k] + t[k] * mid;\n\n              if (total <= use)\n\n                l = mid + 1;\n\n              else\n                r = mid;\n            }\n\n            double total = L / (double)v[k] + t[k] * l;\n\n            if (total <= use)\n\n            {\n\n              part = 0.00;\n\n              break;\n\n            } else\n\n              part *= rsum[k][l];\n          }\n\n        ans += rest[i][times] * part;\n      }\n\n      printf(\"%.8f\\n\", ans);\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\n#include <math.h>\n\nusing namespace std;\n\nconst double eps = 1e-7;\n\nconst int maxn = 110;\n\nconst int maxm = 110;\n\ndouble lin[maxm][maxm], tmp[maxm][maxm], c[maxm][maxm], ans[maxm], p[maxm], v[maxm], t[maxm];\n\nint main()\n\n{\n\n  for (int i = 0; i < maxm; i++)\n\n  {\n\n    c[i][0] = c[i][i] = 1;\n\n    for (int j = 1; j < i; j++)\n      c[i][j] = c[i - 1][j] + c[i - 1][j - 1];\n  }\n\n  int n, m;\n\n  double l;\n\n  while (scanf(\"%d%d%lf\", &n, &m, &l) != EOF)\n\n  {\n\n    for (int i = 0; i < n; i++)\n      scanf(\"%lf%lf%lf\", &p[i], &t[i], &v[i]);\n\n    for (int i = 0; i < n; i++)\n      p[i] /= 100;\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      for (int j = 0; j <= m; j++)\n\n      {\n\n        tmp[i][j] = l / v[i] + j * t[i];\n\n        lin[i][j] = pow(p[i], j) * pow((1 - p[i]), m - j) * c[m][j];\n      }\n\n      for (int j = m - 1; j >= 0; j--)\n        lin[i][j] += lin[i][j + 1];\n\n      lin[i][m + 1] = 0;\n    }\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      for (int k = 0; k <= m; k++)\n        ans[k] = pow(p[i], k) * pow((1 - p[i]), m - k) * c[m][k];\n\n      for (int j = 0; j < n; j++)\n\n        if (j != i)\n\n        {\n\n          int q = m;\n\n          for (int p = m; p >= 0; p--)\n\n          {\n\n            while (q >= 0 && tmp[i][q] >= tmp[j][p] - eps)\n\n            {\n\n              ans[q] *= lin[j][p + 1];\n\n              q--;\n            }\n\n            if (q == -1)\n              break;\n          }\n        }\n\n      double sum = 0;\n\n      for (int k = 0; k <= m; k++)\n        sum += ans[k];\n\n      printf(\"%.9f\\n\", sum);\n    }\n  }\n}"}
{"fast_code_id":"87f6a553d19454b3039864c383313d243d6f249379cb2134bcbb4dbc7f52cbf1","fast_id":"308e7c80e06b5122dd1cb2092a74dd9eae6bedb0fead3620132a3e602aae6725","fast_time":0.1052798553,"language":"cpp","measured_fast_code_id":"308e7c80e06b5122dd1cb2092a74dd9eae6bedb0fead3620132a3e602aae6725","measured_slow_code_id":"667dd1fa7003f0cfa17e3c0e692bf3b80ed336c26767dfd475de0d28c9423b62","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72672","problem_id":"p02726","slow_code_id":"a761ad9ea3682bdf9e3fd0be6140ef1e74445d32e1283eb81ecdac7e1ed85fe3","slow_id":"667dd1fa7003f0cfa17e3c0e692bf3b80ed336c26767dfd475de0d28c9423b62","slow_time":0.9422849599,"speedup":8.95028737658229,"stratum":"8+","sampling_key":"1fd97124f33c4c1784d7e007de9beb4ea0c885ad0572d431dd778d80e8c17407","slow_code":"\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <stack>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <functional>\n\n#include <locale>\n\n#include <cctype>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <queue>\n\n#include <bitset>\n\n#include <numeric>\n\n#include <random>\n\n#include <climits>\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef pair<LL, LL> P;\n\ntypedef vector<int> VI;\n\ntypedef vector<VI> VVI;\n\ntypedef vector<LL> VL;\n\ntypedef vector<VL> VVL;\n\ntypedef vector<pair<LL, LL> > VP;\n\ntypedef vector<string> VS;\n\ntypedef map<int, int> MAPII;\n\ntypedef multimap<int, char, greater<int> > MuMAPIC;\n\ntypedef multimap<int, string, greater<int> > MuMIS;\n\ntypedef pair<LL, pair<P, P> > PP;\n\n#define INF 999999999999999997\n\n#define MP make_pair\n\n#define FAST_IO                                                                                    \\\n  cin.tie(0);                                                                                      \\\n  ios::sync_with_stdio(false);\n\n#define FOR(i, a, b) for (LL i = (a); i < (b); i++)\n\n#define FOR_REV(i, a, b) for (int i = (a); i >= (b); i--)\n\n#define FOR_ITR(d) for (auto itr = d.begin(), d_end = d.end(); itr != d_end; ++itr)\n\n#define O(s) cout << s << endl;\n\n#define SORTVL(v) sort(v.begin(), v.end());\n\n#define SORTVL_GR(v) sort(v.begin(), v.end(), greater<LL>());\n\n#define DUMP_VVI(b)                                                                                \\\n  if (dbgF) {                                                                                      \\\n    FOR(i, 0, b.size()) {                                                                          \\\n      FOR(j, 0, b[i].size()) printf(\"%d \", b[i][j]);                                               \\\n      puts(\"\");                                                                                    \\\n    }                                                                                              \\\n  }\n\n#define D_OUT(str, value)                                                                          \\\n  if (dbgF) {                                                                                      \\\n    cout << str << \" : \" << value << endl;                                                         \\\n  }\n\ntemplate <class T> T IN() {\n  T d;\n  cin >> d;\n  return d;\n}\n\nLL gcd(LL a, LL b) { return (b > 0) ? gcd(b, a % b) : a; }\n\nLL lcm(LL a, LL b) { return a / gcd(a, b) * b; }\n\nbool uruu(LL Y) { return (((Y % 4 == 0 && Y % 100 != 0) || Y % 400 == 0) ? true : false); }\n\nstring Replace(string S, string from, string to) {\n  auto p = S.find(from);\n  while (p != string::npos) {\n    S.replace(p, from.size(), to);\n    p = S.find(from, p + to.size());\n  }\n  return S;\n}\n\nLL Ketawa_s(string s) {\n  LL a = 0;\n  FOR(i, 0, s.length()) a += s[i] - '0';\n  return a;\n}\n\nLL CeilLastNumber(LL n) { return ((n + (10 - 1)) / 10) * 10; }\n\nbool InMap(LL x, LL y, LL h, LL w) {\n  if (x >= 0 && x < h && y >= 0 && y < w)\n    return true;\n  return false;\n}\n\nbool InMap(P p, LL h, LL w) { return InMap(p.first, p.second, h, w); }\n\nconst LL MAX = 510000, p = 998244353;\nLL fac[MAX], finv[MAX], inv[MAX];\n\nvoid COM_init() {\n  fac[0] = fac[1] = 1;\n  finv[0] = finv[1] = 1;\n  inv[1] = 1;\n  FOR(i, 2, MAX) {\n    fac[i] = fac[i - 1] * i % p;\n    inv[i] = p - inv[p % i] * (p / i) % p;\n    finv[i] = finv[i - 1] * inv[i] % p;\n  }\n}\n\nLL COM(int n, int k) {\n  if (n < k)\n    return 0;\n  if (n < 0 || k < 0)\n    return 0;\n  return fac[n] * (finv[k] * finv[n - k] % p) % p;\n}\n\nint dx[4] = {0, 1, 0, -1};\n\nint dy[4] = {1, 0, -1, 0};\n\nint dxx[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nint dyy[8] = {1, 1, 0, -1, -1, -1, 0, 1};\n\nint main() {\n\n  FAST_IO;\n\n  bool dbgF = true;\n\n  LL N, X, Y;\n\n  cin >> N >> X >> Y;\n\n  vector<VP> graph(N);\n\n  FOR(i, 0, N - 1) {\n\n    graph[i].push_back(MP(i + 1, 1));\n\n    graph[i + 1].push_back(MP(i, 1));\n  }\n\n  graph[X - 1].push_back(MP(Y - 1, 1));\n\n  graph[Y - 1].push_back(MP(X - 1, 1));\n\n  VVL distance(N, VL(N, INF));\n\n  FOR(i, 0, N) {\n\n    priority_queue<P, VP, greater<P>> q;\n\n    q.push(MP(0, i));\n\n    distance[i][i] = 0;\n\n    while (!q.empty()) {\n\n      LL pos = q.top().second;\n\n      q.pop();\n\n      FOR(j, 0, graph[pos].size()) {\n\n        LL to = graph[pos][j].first;\n\n        LL cost = graph[pos][j].second;\n\n        if (distance[i][to] > distance[i][pos] + cost) {\n\n          distance[i][to] = distance[i][pos] + cost;\n\n          q.push(MP(distance[i][to], to));\n        }\n      }\n    }\n  }\n\n  VL distanceList(1000000, 0);\n\n  FOR(i, 0, distance.size()) {\n\n    FOR(j, i + 1, distance.size()) { distanceList[distance[i][j]]++; }\n  }\n\n  FOR(i, 0, N - 1) { O(distanceList[i + 1]); }\n\n  return 0;\n}","fast_code":"\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <stack>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <functional>\n\n#include <locale>\n\n#include <cctype>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <queue>\n\n#include <bitset>\n\n#include <numeric>\n\n#include <random>\n\n#include <climits>\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef vector<LL> VL;\n\ntypedef vector<VL> VVL;\n\ntypedef pair<LL, LL> P;\n\ntypedef vector<P> VP;\n\ntypedef vector<VP> VVP;\n\ntypedef vector<string> VS;\n\ntypedef map<LL, LL> MLL;\n\ntypedef pair<LL, pair<P, P> > PP;\n\n#define INF 999999999999999997\n\n#define MP make_pair\n\n#define FAST_IO                                                                                    \\\n  cin.tie(0);                                                                                      \\\n  ios::sync_with_stdio(false);\n\n#define FOR(i, a, b) for (LL i = (a); i < (b); i++)\n\n#define FOR_REV(i, a, b) for (int i = (a); i >= (b); i--)\n\n#define FOR_ITR(d) for (auto itr = d.begin(), d_end = d.end(); itr != d_end; ++itr)\n\n#define O(s) cout << s << endl;\n\n#define SORTVL(v) sort(v.begin(), v.end());\n\n#define SORTVL_GR(v) sort(v.begin(), v.end(), greater<LL>());\n\n#define DUMP_VVI(b)                                                                                \\\n  if (dbgF) {                                                                                      \\\n    FOR(i, 0, b.size()) {                                                                          \\\n      FOR(j, 0, b[i].size()) printf(\"%d \", b[i][j]);                                               \\\n      puts(\"\");                                                                                    \\\n    }                                                                                              \\\n  }\n\n#define D_OUT(str, value)                                                                          \\\n  if (dbgF) {                                                                                      \\\n    cout << str << \" : \" << value << endl;                                                         \\\n  }\n\ntemplate <class T> T IN() {\n  T d;\n  cin >> d;\n  return d;\n}\n\nLL gcd(LL a, LL b) { return (b > 0) ? gcd(b, a % b) : a; }\n\nLL lcm(LL a, LL b) { return a / gcd(a, b) * b; }\n\nbool uruu(LL Y) { return (((Y % 4 == 0 && Y % 100 != 0) || Y % 400 == 0) ? true : false); }\n\nstring Replace(string S, string from, string to) {\n  auto p = S.find(from);\n  while (p != string::npos) {\n    S.replace(p, from.size(), to);\n    p = S.find(from, p + to.size());\n  }\n  return S;\n}\n\nLL Ketawa_s(string s) {\n  LL a = 0;\n  FOR(i, 0, s.length()) a += s[i] - '0';\n  return a;\n}\n\nLL CeilLastNumber(LL n) { return ((n + (10 - 1)) / 10) * 10; }\n\nbool InMap(LL x, LL y, LL h, LL w) {\n  if (x >= 0 && x < h && y >= 0 && y < w)\n    return true;\n  return false;\n}\n\nbool InMap(P p, LL h, LL w) { return InMap(p.first, p.second, h, w); }\n\nconst LL MAX = 510000, p = 998244353;\nLL fac[MAX], finv[MAX], inv[MAX];\n\nvoid COM_init() {\n  fac[0] = fac[1] = 1;\n  finv[0] = finv[1] = 1;\n  inv[1] = 1;\n  FOR(i, 2, MAX) {\n    fac[i] = fac[i - 1] * i % p;\n    inv[i] = p - inv[p % i] * (p / i) % p;\n    finv[i] = finv[i - 1] * inv[i] % p;\n  }\n}\n\nLL COM(int n, int k) {\n  if (n < k)\n    return 0;\n  if (n < 0 || k < 0)\n    return 0;\n  return fac[n] * (finv[k] * finv[n - k] % p) % p;\n}\n\nint dx[4] = {0, 1, 0, -1};\n\nint dy[4] = {1, 0, -1, 0};\n\nint dxx[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nint dyy[8] = {1, 1, 0, -1, -1, -1, 0, 1};\n\nint main() {\n\n  FAST_IO;\n\n  bool dbgF = true;\n\n  LL N, X, Y;\n\n  cin >> N >> X >> Y;\n\n  VVP graph(N);\n\n  FOR(i, 0, N - 1) {\n\n    graph[i].push_back(MP(i + 1, 1));\n\n    graph[i + 1].push_back(MP(i, 1));\n  }\n\n  graph[X - 1].push_back(MP(Y - 1, 1));\n\n  graph[Y - 1].push_back(MP(X - 1, 1));\n\n  VVL distance(N, VL(N, INF));\n\n  FOR(i, 0, N) {\n\n    priority_queue<P, VP, greater<P>> q;\n\n    distance[i][i] = 0;\n\n    q.push(MP(0, i));\n\n    while (!q.empty()) {\n\n      P nowVertex = q.top();\n\n      q.pop();\n\n      LL nowVertexNumber = nowVertex.second;\n\n      LL nowVertexCost = nowVertex.first;\n\n      FOR(j, 0, graph[nowVertexNumber].size()) {\n\n        LL nextVertexNumber = graph[nowVertexNumber][j].first;\n\n        LL fromNowToNextCost = graph[nowVertexNumber][j].second;\n\n        if (distance[i][nextVertexNumber] > distance[i][nowVertexNumber] + fromNowToNextCost) {\n\n          distance[i][nextVertexNumber] = distance[i][nowVertexNumber] + fromNowToNextCost;\n\n          q.push(MP(distance[i][nextVertexNumber], nextVertexNumber));\n        }\n      }\n    }\n  }\n\n  VL ans(2 * pow(10, 3) + 1, 0);\n\n  FOR(i, 0, distance.size()) {\n\n    FOR(j, i + 1, distance[i].size()) { ans[distance[i][j]]++; }\n  }\n\n  FOR(i, 0, N - 1) { O(ans[i + 1]); }\n\n  return 0;\n}"}
{"fast_code_id":"9b28f04233fff9255785674c0b4c03507ee12e44a3d28372a6a654361d8092db","fast_id":"a674ad6cd5ac3a715f628f1ef65b669521f33b26949b5e95bc30c18b7dcbea27","fast_time":0.0192077371,"language":"cpp","measured_fast_code_id":"a674ad6cd5ac3a715f628f1ef65b669521f33b26949b5e95bc30c18b7dcbea27","measured_slow_code_id":"0a447418510b1287f527c41daa0156314379f996e1dd87a11d8ed2f5ea22d741","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_7272","problem_id":"p00457","slow_code_id":"0ab5cdbaa8adf822876fd9c4978d33c0502ac4b45eced9600a71336f58fe0d05","slow_id":"0a447418510b1287f527c41daa0156314379f996e1dd87a11d8ed2f5ea22d741","slow_time":0.1273100377,"speedup":6.628060194555661,"stratum":"4-8","sampling_key":"d2a2e33f8b96d3d6b717569b621ff02fd46240304e49be68f1fb2c9f22a783c9","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <iostream>\n\nusing namespace std;\n\nint chain(int idx, int col);\n\nint model[10002];\n\nint n;\n\nint main(void) {\n\n  while (scanf(\"%d\", &n), n) {\n\n    int mi = n;\n\n    memset(model, 0, sizeof(model));\n\n    for (int i = 0; i < n; i++) {\n\n      scanf(\"%d\", &model[i]);\n    }\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = 1; j <= 3; j++) {\n\n        mi = min(mi, chain(i, j));\n      }\n    }\n\n    printf(\"%d\\n\", mi);\n  }\n\n  return 0;\n}\n\nint chain(int idx, int col) {\n\n  if (model[idx] == col)\n    return n;\n\n  int c[10002];\n\n  int f[10002] = {0};\n\n  for (int i = 0; i < n; i++) {\n\n    if (idx == i)\n\n      c[i] = col;\n\n    else\n      c[i] = model[i];\n  }\n\n  c[n] = 100;\n\n  while (1) {\n\n    int flag = 0;\n\n    int curr = c[0], cnt = 1;\n\n    for (int i = 1; i <= n; i++) {\n\n      if (c[i] == 0)\n        continue;\n\n      if (c[i] == curr)\n        cnt++;\n\n      else {\n\n        curr = c[i];\n\n        if (cnt >= 4) {\n\n          flag = 1;\n\n          for (int j = 0; j < cnt; j++) {\n\n            if (f[i - 1 - j] == 1)\n              cnt++;\n\n            f[i - 1 - j] = 1;\n\n            c[i - 1 - j] = 0;\n          }\n\n          break;\n        }\n\n        cnt = 1;\n      }\n    }\n\n    if (flag == 0)\n      break;\n  }\n\n  int cnt = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    if (f[i] == 0)\n      cnt++;\n  }\n\n  return cnt;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nint check(char block[], int idx, int size);\n\nint main(void) {\n\n  int n;\n\n  while (scanf(\"%d\", &n), n) {\n\n    int mi = 10001;\n\n    char block[10001];\n\n    for (int i = 0; i < n; i++) {\n      scanf(\"%s\", &block[i]);\n      block[i] -= '0';\n    }\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = 0; j < 3; j++) {\n\n        char _block[10001];\n\n        strcpy(_block, block);\n\n        _block[i] = (char)(j + 1);\n\n        mi = min(mi, check(_block, i, n));\n      }\n    }\n\n    printf(\"%d\\n\", mi);\n  }\n\n  return 0;\n}\n\nint check(char block[], int idx, int size) {\n\n  while (size > 3) {\n\n    int upper = idx;\n\n    int low = idx;\n\n    int low_cnt = 0, upper_cnt = 0;\n\n    for (int i = idx - 1; i >= 0; i--) {\n\n      if (block[i] == block[idx]) {\n        low_cnt++;\n      }\n\n      else\n        break;\n    }\n\n    for (int i = idx + 1; i < size; i++) {\n\n      if (block[i] == block[idx])\n        upper_cnt++;\n\n      else\n        break;\n    }\n\n    int cnt = low_cnt + upper_cnt + 1;\n\n    if (cnt < 4) {\n\n      return size;\n    }\n\n    for (int i = 0; i < size - (idx + upper_cnt); i++) {\n\n      block[idx - low_cnt + i] = block[idx + upper_cnt + i + 1];\n    }\n\n    size -= cnt;\n\n    idx -= low_cnt;\n  }\n\n  return size;\n}"}
{"fast_code_id":"127ff6ec2de71e9cd036bb99d6e2ba87c5ce6fc3e6ababc0add8e1d27f73c358","fast_id":"6a9d3910b881a24e5ad4c1008254fc03f492ac623f2a650630bff1d598570b4a","fast_time":0.0010673097,"language":"cpp","measured_fast_code_id":"6a9d3910b881a24e5ad4c1008254fc03f492ac623f2a650630bff1d598570b4a","measured_slow_code_id":"35b4a27ae4284836338e3ab3b28a91a15dc08ad7f5fd7b9f3713dd0b6bc8bb3b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_7275","problem_id":"p03754","slow_code_id":"3f74c2ac3f3774b8d9b56dd260ed0f4e103fcac72c774242dfd0b282ca461601","slow_id":"35b4a27ae4284836338e3ab3b28a91a15dc08ad7f5fd7b9f3713dd0b6bc8bb3b","slow_time":0.0051129381,"speedup":4.790491550859136,"stratum":"4-8","sampling_key":"162d698c3d7d2abb2c5fc97d72a5afca05c3d681125d81b8769bc8639ccfb96e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nconst int N = 150000;\n\nvector<int> g[N];\n\ndouble dp[N];\n\ndouble dp1[N];\n\ndouble dp2[N];\n\ndouble ans[N];\n\nvoid dfs(int i, int p = -1) {\n\n  int sz = (g[i].size() - (p != -1));\n\n  for (int j : g[i])\n    if (j != p) {\n\n      dfs(j, i);\n\n      dp[i] += (1 + dp1[j]);\n\n      dp1[i] += (1 + dp1[j]) / sz;\n    }\n}\n\nvoid dfs2(int i, int p = -1) {\n\n  ans[i] = dp[i] + (p != -1 ? dp2[i] : 0);\n\n  for (int j : g[i])\n    if (j != p) {\n\n      dp2[j] = 1 + (ans[i] - (1 + dp1[j])) / (g[i].size() - 1);\n\n      dfs2(j, i);\n    }\n\n  ans[i] /= g[i].size();\n}\n\nint main() {\n\n  ios::sync_with_stdio(false), cin.tie(0);\n\n  int n;\n\n  cin >> n;\n\n  if (n == 1) {\n\n    cout << 0.0 << endl;\n\n    return 0;\n  }\n\n  if (n == 2) {\n\n    cout << 1.0 << endl;\n\n    cout << 1.0 << endl;\n\n    return 0;\n  }\n\n  for (int i = 0; i < n - 1; i++) {\n\n    int a, b;\n    cin >> a >> b;\n    a--;\n    b--;\n\n    g[a].emplace_back(b);\n\n    g[b].emplace_back(a);\n  }\n\n  int t = 0;\n\n  for (int i = 0; i < n; i++)\n    if (g[i].size() >= 2)\n      t = i;\n\n  dfs(t);\n\n  dfs2(t);\n\n  cout << fixed << setprecision(7);\n\n  for (int i = 0; i < n; i++)\n    cout << ans[i] << endl;\n}\n","fast_code":"               \n\n                     \n\n                    \n\n                      \n\n                   \n\n                  \n\n                  \n\n                \n\n                \n\n                  \n\n                  \n\n                   \n\n                    \n\n                   \n\n                    \n\n                  \n\n                     \n\n                    \n\n                          \n\n      \n\n                       \n\n                        \n\n\n\n                         \n\n\n\n#include <cassert>\n\n#include <functional>\n\n#include <queue>\n\n#include <stack>\n\n#include <tuple>\n\n#include <utility>\n\n#include <vector>\n\ntemplate < class Monoid >\n\nstruct ReRooting {\n\n  using size_type = std::size_t;\n\n  using edge_type = std::tuple< size_type, size_type, size_type >;\n\n  using graph_type = std::vector< std::vector< edge_type > >;\n\n  using T = typename Monoid::T;\n\n  using dig_f_type =\n\n      std::function< T(T, size_type edge_id, size_type from, size_type to) >;\n\n  using after_f_type =\n\n      std::function< T(T, size_type vertex_id, size_type degree_of_this) >;\n\n  using vector_bool_type = std::vector< int >;\n\n  graph_type graph;\n\n\n\n  size_type n;\n\n\n\n  std::vector< size_type > start;\n\n  std::vector< T > dp;\n\n  vector_bool_type did;\n\n  std::vector< T > L;\n\n  std::vector< T > R;\n\n\n\n  dig_f_type dig;\n\n  after_f_type after;\n\n  static T default_dig(const T &a, ...) { return a; }\n\n  static T default_after(const T &a, ...) { return a; }\n\n\n\n  bool built;\n\n\n\n  ReRooting() {}\n\n  ReRooting(size_type n, dig_f_type dig = default_dig, after_f_type after = default_after)\n\n      : dig(dig), after(after) {\n\n    clear(n);\n\n  }\n\n  ReRooting(std::vector< std::vector< int > > graph, dig_f_type dig = default_dig,\n\n            after_f_type after = default_after)\n\n      : ReRooting(graph.size(), dig, after) {\n\n    for(size_type from = 0; from < n; from++) {\n\n      for(auto to : graph[from])\n\n        if(static_cast< size_type >(to) < from) {\n\n          add_edge(from, to);\n\n        }\n\n    }\n\n  }\n\n\n\n  void clear() { clear(n); }\n\n\n\n  void clear(size_type n) {\n\n    this->n = n;\n\n    graph.resize(3 * n);\n\n    dp.resize(3 * n);\n\n    did.resize(3 * n);\n\n    did.assign(3 * n, 0);\n\n    L.resize(3 * n);\n\n    R.resize(3 * n);\n\n    start.resize(n);\n\n    built = 0;\n\n  }\n\n\n\n  size_type added = 0;\n\n  void add_edge(size_type a, size_type b, size_type id = static_cast< size_type >(-1)) {\n\n    assert(!built);\n\n    assert(a < n && b < n && a != b);\n\n    if(id == static_cast< size_type >(-1)) id = added;\n\n    graph[a].emplace_back(b, graph[b].size(), id);\n\n    graph[b].emplace_back(a, graph[a].size() - 1, id);\n\n    added++;\n\n  }\n\n\n\n  void set_dig(dig_f_type dig = default_dig) { this->dig = dig; }\n\n\n\n  void set_after(after_f_type after = default_after) { this->after = after; }\n\n\n\n  void build() {\n\n    assert(!built);\n\n    built = 1;\n\n    if(n == 0) return;\n\n\n\n    assert(added == n - 1);\n\n    for(size_type i = 0; i + 1 < n; i++) {\n\n      start[i + 1] = start[i] + graph[i].size() + 1;\n\n    }\n\n    dfs_first(0, graph[0].size());\n\n  }\n\n\n\npublic:\n\n  T dfs(size_type i) {\n\n  return dfs(i, graph[i].size());\n\n  }\n\n\n\n  T dfs_from(size_type i, size_type j) {\n\n    assert(built);\n\n    assert(j < n);\n\n                           \n\n                          \n\n  }\n\n\n\nprivate:\n\n  T proceed_root(size_type i) {\n\n    for(size_type x = 0; x < graph[i].size(); x++) {\n\n      auto to = graph[i][x];\n\n      size_type j, rev, edge_id;\n\n      std::tie(j, rev, edge_id) = to;\n\n      R[start[i] + x] = L[start[i] + x] = dig(dp[start[j] + rev], edge_id, i, j);\n\n    }\n\n    for(int x = 1; x < static_cast<int>(graph[i].size()); x++) L[start[i] + x] = Monoid::op(L[start[i] + x - 1], L[start[i] + x]);\n\n    for(int x = static_cast<int>(graph[i].size()) - 2; x >= 0; x--) R[start[i] + x] = Monoid::op(R[start[i] + x], R[start[i] + x + 1]);\n\n    return L[start[i] + graph[i].size() - 1];\n\n  }\n\n\n\n  void dfs_first(size_type i0, size_type p0) {\n\n    std::vector< std::tuple< size_type, size_type, bool > > stk;\n\n    stk.reserve(n);\n\n    stk.emplace_back(i0, p0, 0);\n\n    while(stk.size()) {\n\n      size_type i, p;\n\n      bool up;\n\n      std::tie(i, p, up) = stk.back();\n\n      stk.pop_back();\n\n      int deg = graph[i].size() - (p != graph[i].size() ? 1 : 0);\n\n      if(up) {\n\n        did[start[i] + p] = 1;\n\n        T res = Monoid::identity();\n\n        if(p == graph[i].size()) {\n\n          res = proceed_root(i);\n\n        } else {\n\n          for(size_type x = 0; x < graph[i].size(); x++)\n\n            if(x != p) {\n\n              size_type j, rev, edge_id;\n\n              std::tie(j, rev, edge_id) = graph[i][x];\n\n              res = Monoid::op(res, dig(dp[start[j] + rev], edge_id, i, j));\n\n            }\n\n        }\n\n        dp[start[i] + p] = after(res, i, deg);\n\n      } else {\n\n        stk.emplace_back(i, p, 1);\n\n        for(size_type x = 0; x < graph[i].size(); x++)\n\n          if(x != p) {\n\n            size_type j, rev, edge_id;\n\n            std::tie(j, rev, edge_id) = graph[i][x];\n\n            stk.emplace_back(j, rev, 0);\n\n          }\n\n      }\n\n    }\n\n  }\n\n\n\n  T dfs(size_type i0, size_type p0) {\n\n    assert(built);\n\n    assert(i0 < n);\n\n    assert(p0 <= graph[i0].size());\n\n    if(did[start[i0] + p0]) return dp[start[i0] + p0];\n\n\n\n    std::vector< std::tuple< size_type, size_type, bool > > stk;\n\n    stk.reserve(n);\n\n    stk.emplace_back(i0, p0, 0);\n\n    while(stk.size()) {\n\n      size_type i, p;\n\n      bool up;\n\n      std::tie(i, p, up) = stk.back();\n\n      stk.pop_back();\n\n      if(up) {\n\n        int deg = graph[i].size() - (p != graph[i].size() ? 1 : 0);\n\n        did[start[i] + p] = 1;\n\n        T res = Monoid::identity();\n\n        if(p == graph[i].size()) {\n\n          res = proceed_root(i);\n\n        } else {\n\n          res = Monoid::op(p >= 1 ? L[start[i] + p - 1] : Monoid::identity(),\n\n                           p + 1 < graph[i].size() ? R[start[i] + p + 1] : Monoid::identity());\n\n        }\n\n        dp[start[i] + p] = after(res, i, deg);\n\n      } else {\n\n        stk.emplace_back(i, p, 1);\n\n        if(p == graph[i].size()) {\n\n          for(size_type x = 0; x < graph[i].size(); x++) {\n\n            size_type j, rev, edge_id;\n\n            std::tie(j, rev, edge_id) = graph[i][x];\n\n            if(!did[start[j] + rev]) stk.emplace_back(j, rev, 0);\n\n          }\n\n        } else {\n\n          if(!did[start[i] + graph[i].size()]) {\n\n            stk.emplace_back(i, graph[i].size(), 0);\n\n          }\n\n        }\n\n      }\n\n    }\n\n    return dp[start[i0] + p0];\n\n  }\n\n};\n\n\n\n               \n\n\n\n\n\n               \n\n#include <algorithm>\n\n#include <bitset>\n\n#include <cassert>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <iomanip>\n\n#include <iostream>\n\n#include <map>\n\n#include <queue>\n\n#include <random>\n\n#include <set>\n\n#include <stack>\n\n#include <tuple>\n\n#include <vector>\n\n                  \n\n                     \n\n                    \n\n                          \n\n      \n\nusing namespace std;\n\nusing ll = long long;\n\n\n\n                       \n\nstruct MyMonoid {\n\n  using T = double;\n\n  static T op(const T &a, const T &b) { return a + b; }\n\n  static constexpr T identity() { return 0; }\n\n};\n\n      \n\n\n\nusing rerooting = ReRooting< MyMonoid >;\n\nusing T = rerooting::T;\n\n\n\nT dig(T a, int id, int from, int to) { return a + 1; }\n\n\n\nT after(T a, int i, int deg) {\n\n  if(deg == 0) return a;\n\n  return a / deg;\n\n}\n\n\n\nconst int N = 1e5;\n\nstd::vector< std::vector< int > > g;\n\nint n;\n\nint main() {\n\n  std::ios::sync_with_stdio(false), std::cin.tie(0);\n\n  cin >> n;\n\n  g.resize(n);\n\n  for(int i = 0; i < n - 1; i++) {\n\n    int a, b;\n\n    std::cin >> a >> b;\n\n    a--;\n\n    b--;\n\n    g[a].emplace_back(b);\n\n    g[b].emplace_back(a);\n\n  }\n\n  rerooting rr(g, dig, after);\n\n  rr.build();\n\n  cout << fixed << setprecision(8);\n\n  for(int i = 0; i < n; i++) cout << rr.dfs(i) << \"\\n\";\n\n  return 0;\n\n}\n"}
{"fast_code_id":"ddb67f4a8bb907c72d97e8aa51f4930288e4e91bab78b5f45d43ad9bd74531d0","fast_id":"91b5589d78562a1b4ffe6ee791fead94751bfdf1e0eda3f5a00c9b83ac8871e0","fast_time":0.1063553391,"language":"cpp","measured_fast_code_id":"91b5589d78562a1b4ffe6ee791fead94751bfdf1e0eda3f5a00c9b83ac8871e0","measured_slow_code_id":"55a9375d7dc44bf0ae9bf599c193a6ebce18473ba52847b6e592505795da22cd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72775","problem_id":"p03112","slow_code_id":"e1ed1fff0d8b64e4684bce5eeb37801a0a02efc9278d2ad3d9d7431848cf28d1","slow_id":"55a9375d7dc44bf0ae9bf599c193a6ebce18473ba52847b6e592505795da22cd","slow_time":0.7272234049,"speedup":6.837676519617246,"stratum":"4-8","sampling_key":"c176eb64a6bad696639b9fc1e00ba9fb8411423a899832ad36ef641f173d4b3d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<ll> vll;\n\ntypedef pair<int, int> P;\n\nconst int INF = 0x3f3f3f3f;\n\nconst int MAXN = 200000;\n\nint N, M;\n\nstruct Edge {\n\n  int to;\n\n  int weight;\n\n  int next;\n};\n\nvector<Edge> edges(MAXN);\n\nvector<int> head(MAXN, -1);\n\nvector<int> matchingx(MAXN, -1);\n\nvector<int> matchingy(MAXN, -1);\n\nvector<bool> check(MAXN);\n\nvector<int> dis(MAXN);\n\nvector<bool> vis(MAXN, false);\n\nint cnt = 1;\n\nvoid addEdge(int from, int to, int weight) {\n\n  edges[cnt].to = to;\n\n  edges[cnt].weight = weight;\n\n  edges[cnt].next = head[from];\n\n  head[from] = cnt++;\n}\n\nbool dfs(int u) {\n\n  for (int i = head[u]; i != -1; i = edges[i].next) {\n\n    int v = edges[i].to;\n\n    if (!check[v]) {\n\n      check[v] = true;\n\n      if (matchingy[v] == -1 || dfs(matchingy[v])) {\n\n        matchingy[v] = u;\n\n        matchingx[u] = v;\n\n        return true;\n      }\n    }\n  }\n\n  return false;\n}\n\nint hungarian() {\n\n  int ans = 0;\n\n  fill(matchingx.begin(), matchingx.end(), -1);\n\n  fill(matchingy.begin(), matchingy.end(), -1);\n\n  for (int u = 1; u <= N; ++u) {\n\n    {\n\n      fill(check.begin(), check.end(), false);\n\n      if (dfs(u)) {\n\n        ++ans;\n      }\n    }\n  }\n\n  return ans;\n}\n\nvoid dijkstra(int s) {\n\n  priority_queue<P, vector<P>, greater<>> que;\n\n  fill(dis.begin(), dis.end(), INF);\n\n  dis[s] = 0;\n\n  que.push(P(0, s));\n\n  while (!que.empty()) {\n\n    P p = que.top();\n\n    que.pop();\n\n    int u = p.second;\n\n    if (vis[u])\n      continue;\n\n    vis[u] = true;\n\n    for (int i = head[u]; i != -1; i = edges[i].next) {\n\n      int v = edges[i].to;\n\n      if (dis[v] > dis[u] + edges[i].weight && !vis[v]) {\n\n        dis[v] = dis[u] + edges[i].weight;\n\n        que.push(P(dis[v], v));\n      }\n    }\n  }\n}\n\nstruct TreeNode {\n\n  int val;\n\n  TreeNode *left = nullptr;\n\n  TreeNode *right = nullptr;\n\n  TreeNode(int val_) : val(val_) {}\n};\n\nint main() {\n\n  ll A, B, Q;\n\n  cin >> A >> B >> Q;\n\n  vll numsA(A);\n\n  vll numsB(B);\n\n  for (int i = 0; i < A; ++i) {\n\n    cin >> numsA[i];\n  }\n\n  numsA.push_back(-100000000000LL);\n\n  numsA.push_back(100000000000LL);\n\n  for (int i = 0; i < B; ++i) {\n\n    cin >> numsB[i];\n  }\n\n  numsB.push_back(-100000000000LL);\n\n  numsB.push_back(100000000000LL);\n\n  sort(numsA.begin(), numsA.end());\n\n  sort(numsB.begin(), numsB.end());\n\n  ll x;\n\n  for (int i = 0; i < Q; ++i) {\n\n    cin >> x;\n\n    auto uba = upper_bound(numsA.begin(), numsA.end(), x);\n\n    auto ubb = upper_bound(numsB.begin(), numsB.end(), x);\n\n    auto lba = uba - 1;\n\n    auto lbb = ubb - 1;\n\n    vll tmpA = {*lba, *uba};\n\n    vll tmpB = {*lbb, *ubb};\n\n    ll ans = 0;\n\n    ans = tmpA[1] - tmpB[0] + min(tmpA[1] - x, x - tmpB[0]);\n\n    ans = min(ans, tmpB[1] - tmpA[0] + min(tmpB[1] - x, x - tmpA[0]));\n\n    ans = min(ans, x - min(tmpA[0], tmpB[0]));\n\n    ans = min(ans, max(tmpA[1], tmpB[1]) - x);\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<ll> vll;\n\ntypedef pair<int, int> P;\n\nconst int INF = 0x3f3f3f3f;\n\nconst int MAXN = 200000;\n\nint main() {\n\n  ll A, B, Q;\n\n  cin >> A >> B >> Q;\n\n  vll numsA(A);\n\n  vll numsB(B);\n\n  for (int i = 0; i < A; ++i) {\n\n    cin >> numsA[i];\n  }\n\n  numsA.push_back(-100000000000LL);\n\n  numsA.push_back(100000000000LL);\n\n  for (int i = 0; i < B; ++i) {\n\n    cin >> numsB[i];\n  }\n\n  numsB.push_back(-100000000000LL);\n\n  numsB.push_back(100000000000LL);\n\n  sort(numsA.begin(), numsA.end());\n\n  sort(numsB.begin(), numsB.end());\n\n  ll x;\n\n  for (int i = 0; i < Q; ++i) {\n\n    cin >> x;\n\n    auto uba = upper_bound(numsA.begin(), numsA.end(), x);\n\n    auto ubb = upper_bound(numsB.begin(), numsB.end(), x);\n\n    auto lba = uba - 1;\n\n    auto lbb = ubb - 1;\n\n    vll tmpA = {*lba, *uba};\n\n    vll tmpB = {*lbb, *ubb};\n\n    ll ans = 0;\n\n    ans = tmpA[1] - tmpB[0] + min(tmpA[1] - x, x - tmpB[0]);\n\n    ans = min(ans, tmpB[1] - tmpA[0] + min(tmpB[1] - x, x - tmpA[0]));\n\n    ans = min(ans, x - min(tmpA[0], tmpB[0]));\n\n    ans = min(ans, max(tmpA[1], tmpB[1]) - x);\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"041f8a9a69b21962743c183f6b97c68f011df8fc1cb682a11e3bfcfbf5e5c7d3","fast_id":"8ac14aef09bfe7274d0d5965172ccbc902a5425d3dd30b0c42b073f5570ee882","fast_time":0.0211891425,"language":"cpp","measured_fast_code_id":"8ac14aef09bfe7274d0d5965172ccbc902a5425d3dd30b0c42b073f5570ee882","measured_slow_code_id":"89bc7a02ba87ae88592b07cbd6ca41390dd33e7a9202de1e561d322d4c7829b5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_72779","problem_id":"p01648","slow_code_id":"4866bba0032d174280df7a1bba5d1fbcf1b6cb8122ff926b5a82eff90bedc4a6","slow_id":"89bc7a02ba87ae88592b07cbd6ca41390dd33e7a9202de1e561d322d4c7829b5","slow_time":0.097240189,"speedup":4.589151684642264,"stratum":"4-8","sampling_key":"4fe4e4e5c65b7bc3f0dac0163a229fced93bdeade518a33ee62492b15e81669a","slow_code":"#include <cstdio>\n\n#include <vector>\n\n#include <cstdlib>\n\n#include <algorithm>\n\nusing namespace std;\n\nstruct edge {\n\n  int u, v, w;\n\n  edge(int _u = 0, int _v = 0, int _w = 0) : u(_u), v(_v), w(_w) {}\n\n  bool operator<(const edge &o) const { return w < o.w; }\n};\n\nint fa[1005];\n\nint root(int x) { return fa[x] = (x == fa[x] ? x : root(fa[x])); }\n\nint n, m;\n\nvector<edge> e;\n\nint main() {\n\n  while (scanf(\"%d%d\", &n, &m) && n) {\n\n    e.clear();\n\n    for (int i = 0; i <= n; ++i) {\n\n      fa[i] = i;\n    }\n\n    int u, v, w;\n\n    for (int i = 0; i < m; ++i) {\n\n      scanf(\"%d%d%d\", &u, &v, &w);\n\n      e.push_back(edge(u, v, w));\n    }\n\n    sort(e.begin(), e.end());\n\n    int cnt = 0;\n\n    for (int i = 0; i < m; ++i) {\n\n      int fa1 = root(e[i].u);\n\n      int fa2 = root(e[i].v);\n\n      if (fa1 != fa2) {\n\n        fa[fa1] = fa2;\n\n        if (++cnt == (n + 1) / 2) {\n\n          printf(\"%d\\n\", e[i].w);\n\n          break;\n        }\n      }\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAXN = 100000;\n\nstruct node {\n\n  int u, v, dist;\n\n} a[MAXN + 10];\n\nint n, m;\n\nint fa[MAXN + 10];\n\nint cnt;\n\nint num[MAXN + 10];\n\nint tot;\n\nbool cmp(const node &x, const node &y) { return x.dist < y.dist; }\n\nint find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }\n\nint main() {\n\n  while (scanf(\"%d%d\", &n, &m) == 2 && n && m) {\n\n    cnt = 0;\n\n    tot = 0;\n\n    for (int i = 1; i <= m; i++) {\n\n      int u, v, dist;\n\n      scanf(\"%d%d%d\", &u, &v, &dist);\n\n      a[++cnt].u = u;\n\n      a[cnt].v = v;\n\n      a[cnt].dist = dist;\n\n      a[++cnt].v = u;\n\n      a[cnt].u = v;\n\n      a[cnt].dist = dist;\n    }\n\n    for (int i = 1; i <= n; i++)\n\n      fa[i] = i;\n\n    sort(a + 1, a + cnt + 1, cmp);\n\n    for (int i = 1; i <= cnt; i++) {\n\n      int x = find(a[i].u);\n\n      int y = find(a[i].v);\n\n      if (x == y)\n\n        continue;\n\n      num[++tot] = a[i].dist;\n\n      fa[x] = y;\n    }\n\n    printf(\"%d\\n\", num[(tot + 1) / 2]);\n  }\n}"}
{"fast_code_id":"c6dceece586b1a5d928cd92a97d5e00fbfbe13c91b39449c67efd62915843159","fast_id":"c3e7022abd0e1d70c5adc983e72ed780647a39303aa2b4692d407242a7b5c56e","fast_time":0.0850067813,"language":"cpp","measured_fast_code_id":"c3e7022abd0e1d70c5adc983e72ed780647a39303aa2b4692d407242a7b5c56e","measured_slow_code_id":"7552e4dea4ddc3db63fd7c3451175bad5cd4f624ed8f7bece63d8a2864134c0c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_7278","problem_id":"p01347","slow_code_id":"d4873434414e2d716947f9b8c5b249dfb0ab3c563bdc99cc6691b9644daae233","slow_id":"7552e4dea4ddc3db63fd7c3451175bad5cd4f624ed8f7bece63d8a2864134c0c","slow_time":1.062105914,"speedup":12.49436689352688,"stratum":"8+","sampling_key":"26f4fefd4e837003b8ace9895765ae7f10d215c1188cece6be20918e01c71262","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <algorithm>\n\n#define add(a, b, c) (e[i] = b, pre[i] = last[a], last[a] = i, w[i] = c)\n\n#define prec 1e-6\n\n#define inf 1e9\n\nusing namespace std;\n\nstruct edge\n\n{\n  int u, v, w;\n\n  edge(int u = 0, int v = 0, int w = 0) : u(u), v(v), w(w) {}\n};\n\nstruct simplex\n\n{\n  double v;\n\n  double a[1205][1205];\n\n  double b[1205];\n\n  double c[1205];\n\n  int basic[1205];\n\n  int nbasic[105];\n\n  void pivot(int l, int e);\n\n  double opt();\n\n  void output();\n};\n\nint fcmp(double x)\n\n{\n  if (fabs(x) < prec)\n\n    return 0;\n\n  return x > 0 ? 1 : -1;\n}\n\nedge ed[1005];\n\nint last[1005];\n\nint pre[2005];\n\nint deg[105];\n\nint e[2005];\n\nint w[2005];\n\nint f[105];\n\nint n, m;\n\nsimplex lp;\n\nvoid simplex::output()\n\n{\n  int i, j;\n\n  for (i = 1; i <= m; ++i)\n\n  {\n    printf(\"x[%d]=%.2f-\", basic[i], b[basic[i]]);\n\n    for (j = 1; j <= n; ++j)\n\n      printf(\"%c%.2fx[%d]\", j == 1 ? '(' : '+', a[basic[i]][nbasic[j]],\n             nbasic[j]);\n\n    printf(\")\\n\");\n  }\n\n  printf(\"maximize \");\n\n  printf(\"%.2f\", v);\n\n  for (i = 1; i <= n; ++i)\n\n    printf(\"+%.2fx[%d]\", c[nbasic[i]], nbasic[i]);\n\n  printf(\"\\n\\n\");\n}\n\nvoid simplex::pivot(int l, int e)\n\n{\n  static double ta[1205][1205];\n\n  static double tb[1205];\n\n  static double tc[1205];\n\n  int i, j;\n\n  memset(ta, 0, sizeof(ta));\n\n  memset(tb, 0, sizeof(tb));\n\n  memset(tc, 0, sizeof(tc));\n\n  tb[e] = b[l] / a[l][e];\n\n  ta[e][l] = 1.0 / a[l][e];\n\n  for (i = 1; i <= n; ++i)\n\n    if (nbasic[i] != e)\n\n      ta[e][nbasic[i]] = a[l][nbasic[i]] / a[l][e];\n\n  for (i = 1; i <= m; ++i)\n\n  {\n    tb[basic[i]] = b[basic[i]] - a[basic[i]][e] * tb[e];\n\n    ta[basic[i]][l] = -a[basic[i]][e] * ta[e][l];\n\n    for (j = 1; j <= n; ++j)\n\n      if (nbasic[j] != e)\n\n        ta[basic[i]][nbasic[j]] =\n            a[basic[i]][nbasic[j]] - a[basic[i]][e] * ta[e][nbasic[j]];\n  }\n\n  v = v + tb[e] * c[e];\n\n  tc[l] = -ta[e][l] * c[e];\n\n  for (i = 1; i <= n; ++i)\n\n    if (nbasic[i] != e)\n\n      tc[nbasic[i]] = c[nbasic[i]] - c[e] * ta[e][nbasic[i]];\n\n  for (i = 1; i <= n; ++i)\n\n    if (nbasic[i] == e)\n\n      nbasic[i] = l;\n\n  for (i = 1; i <= m; ++i)\n\n    if (basic[i] == l)\n\n      basic[i] = e;\n\n  for (i = 1; i <= m; ++i)\n\n  {\n    for (j = 1; j <= n; ++j)\n\n      a[basic[i]][nbasic[j]] = ta[basic[i]][nbasic[j]];\n\n    b[basic[i]] = tb[basic[i]];\n  }\n\n  for (i = 1; i <= n; ++i)\n\n    c[nbasic[i]] = tc[nbasic[i]];\n}\n\ndouble simplex::opt()\n\n{\n  double delta;\n\n  int i, l, e;\n\n  while (1)\n\n  {\n    e = n + m + 2;\n\n    for (i = 1; i <= n; ++i)\n\n      if (fcmp(c[nbasic[i]]) > 0 && nbasic[i] < e)\n\n        e = nbasic[i];\n\n    if (e == n + m + 2)\n\n      return v;\n\n    delta = -1;\n\n    l = n + m + 2;\n\n    for (i = 1; i <= m; ++i)\n\n      if (fcmp(a[basic[i]][e]) > 0)\n\n      {\n        double t = b[basic[i]] / a[basic[i]][e];\n\n        if (l == n + m + 2 || fcmp(t - delta) < 0 ||\n            (fcmp(t - delta) == 0 && basic[i] < l))\n\n        {\n          delta = t;\n\n          l = basic[i];\n        }\n      }\n\n    if (l == n + m + 2)\n\n      return inf;\n\n    else\n      pivot(l, e);\n  }\n}\n\nint longest_path()\n\n{\n  int q[105];\n\n  int i, h, t;\n\n  q[h = t = 1] = 1;\n\n  while (h <= t)\n\n  {\n    for (i = last[q[h]]; i != 0; i = pre[i])\n\n    {\n      f[e[i]] = max(f[e[i]], f[q[h]] + w[i]);\n\n      --deg[e[i]];\n\n      if (deg[e[i]] == 0)\n\n        q[++t] = e[i];\n    }\n\n    ++h;\n  }\n\n  return f[n];\n}\n\nvoid buildlp()\n\n{\n  int i, j;\n\n  for (i = 1; i <= n; ++i)\n\n    lp.nbasic[i] = i;\n\n  for (i = 1; i <= m; ++i)\n\n  {\n    ++lp.c[ed[i].v];\n\n    --lp.c[ed[i].u];\n\n    lp.v += f[ed[i].v] - f[ed[i].u] - ed[i].w;\n  }\n\n  for (i = 1; i <= m; ++i)\n\n  {\n    lp.a[n + i][ed[i].v] = -1;\n\n    lp.a[n + i][ed[i].u] = 1;\n\n    lp.b[n + i] = f[ed[i].v] - f[ed[i].u] - ed[i].w;\n\n    lp.basic[i] = n + i;\n  }\n\n  for (i = 1; i < n; ++i)\n\n  {\n    lp.a[n + m + i][i] = -1;\n\n    lp.basic[m + i] = n + m + i;\n  }\n\n  lp.a[n + m + n][n] = 1;\n\n  lp.basic[m + n] = n + m + n;\n\n  m += n;\n}\n\nint main()\n\n{\n  int i, a, b, c;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (i = 1; i <= m; ++i)\n\n  {\n    scanf(\"%d%d%d\", &a, &b, &c);\n\n    ++a, ++b;\n\n    ++deg[b];\n\n    ed[i] = edge(a, b, c);\n\n    add(a, b, c);\n  }\n\n  longest_path();\n\n  buildlp();\n\n  printf(\"%d\\n\", (int)lp.opt());\n\n  fclose(stdin);\n\n  fclose(stdout);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <string>\n\n#include <algorithm>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <map>\n\n#include <queue>\n\n#include <stack>\n\n#include <vector>\n\n#include <bitset>\n\n#include <functional>\n\nusing namespace std;\n\n#define MAX_V 100 + 2\n\nint indegree[MAX_V], outdegree[MAX_V];\n\nint n, m, s, t;\n\n#define INF 0x3f3f3f3f\n\ntypedef pair<int, int> P;\n\nstruct edge\n\n{\n\n  int to;\n\n  int cap;\n\n  int cost;\n\n  int rev;\n\n  edge(int to, int cap, int cost, int rev) : to(to), cap(cap), cost(cost), rev(rev) {}\n};\n\nint V;\n\nvector<edge> G[MAX_V];\n\nint h[MAX_V];\n\nint dist[MAX_V];\n\nint prevv[MAX_V];\n\nint preve[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost)\n\n{\n\n  G[from].push_back(edge(to, cap, cost, G[to].size()));\n\n  G[to].push_back(edge(from, 0, -cost, G[from].size() - 1));\n}\n\nint min_cost_flow(int s, int t, int f)\n\n{\n\n  int res = 0;\n\n  memset(h, 0, sizeof(h));\n\n  while (f > 0)\n\n  {\n\n    priority_queue<P, vector<P>, greater<P> > que;\n\n    memset(dist, INF, sizeof(dist));\n\n    dist[s] = 0;\n\n    que.push(P(0, s));\n\n    while (!que.empty())\n\n    {\n\n      P p = que.top();\n      que.pop();\n\n      int v = p.second;\n\n      if (dist[v] < p.first)\n        continue;\n\n      for (int i = 0; i < G[v].size(); ++i)\n\n      {\n\n        edge &e = G[v][i];\n\n        if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to])\n\n        {\n\n          dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\n          prevv[e.to] = v;\n\n          preve[e.to] = i;\n\n          que.push(P(dist[e.to], e.to));\n        }\n      }\n    }\n\n    if (dist[t] == INF)\n\n    {\n\n      return -1;\n    }\n\n    for (int v = 0; v < V; ++v)\n\n    {\n\n      h[v] += dist[v];\n    }\n\n    int d = f;\n\n    for (int v = t; v != s; v = prevv[v])\n\n    {\n\n      d = min(d, G[prevv[v]][preve[v]].cap);\n    }\n\n    f -= d;\n\n    res += d * h[t];\n\n    for (int v = t; v != s; v = prevv[v])\n\n    {\n\n      edge &e = G[prevv[v]][preve[v]];\n\n      e.cap -= d;\n\n      G[v][e.rev].cap += d;\n    }\n  }\n\n  return res;\n}\n\nvoid clear()\n\n{\n\n  for (int i = 0; i < V; ++i)\n\n  {\n\n    G[i].clear();\n  }\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  V = n + 2;\n\n  t = V - 1;\n\n  s = 0;\n\n  int total = 0;\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int x, y, z;\n\n    scanf(\"%d%d%d\", &x, &y, &z);\n\n    x++, y++;\n\n    add_edge(x, y, INF, -z);\n\n    outdegree[x]++, indegree[y]++;\n\n    total += z;\n  }\n\n  int max_f = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (indegree[i] > outdegree[i])\n\n    {\n\n      add_edge(s, i, indegree[i] - outdegree[i], 0);\n\n      max_f += indegree[i] - outdegree[i];\n\n    }\n\n    else\n\n    {\n\n      add_edge(i, t, outdegree[i] - indegree[i], 0);\n    }\n  }\n\n  min_cost_flow(1, n, 1);\n\n  add_edge(n, 1, INF, -dist[n]);\n\n  int ans = min_cost_flow(s, t, max_f);\n\n  printf(\"%d\\n\", ans - total);\n\n  return 0;\n}"}
{"fast_code_id":"f2d6c8afe92ad1f25fa5c034ce565c98b568fdafa636f5314428b975c0acbf17","fast_id":"5ad8dada0d533b9d7297aa3b10daee64ac9c7f38b48ff5f3969c6f5da610b04f","fast_time":0.0143156677,"language":"cpp","measured_fast_code_id":"5ad8dada0d533b9d7297aa3b10daee64ac9c7f38b48ff5f3969c6f5da610b04f","measured_slow_code_id":"4b6edaa78aea8ca030c46e41c03ec2c481af40967babf4ad0380987bd4c678e2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73089","problem_id":"p03949","slow_code_id":"849a049182330a22259ca8aed30331da66be005c2d21f0611e71a3f42c7da6ca","slow_id":"4b6edaa78aea8ca030c46e41c03ec2c481af40967babf4ad0380987bd4c678e2","slow_time":0.5418382341,"speedup":37.84931624949635,"stratum":"8+","sampling_key":"6a40850ef33caa456fd788e1439c2d415acdee092a6c97a7d6d7cfbbfcf4f382","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <cassert>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\n\n\ntypedef long long LL;\n\nconst int INF = 100000000;\n\nconst int MAXN = 111111 * 2;\n\nint val[MAXN], l[MAXN], r[MAXN], odd[MAXN];\n\nint n, K;\n\nvector<int> adj[MAXN];\n\n\n\ninline bool dfs(int u, int fa) {\n\n                                          \n\n  if (val[u] == INF) {\n\n    l[u] = -INF, r[u] = INF;\n\n    odd[u] = -1;\n\n  } else {\n\n    l[u] = r[u] = val[u];\n\n    odd[u] = val[u] & 1;\n\n  }\n\n  for (int i = 0; i < adj[u].size(); ++i) {\n\n    int v = adj[u][i];\n\n                                         \n\n    if (v != fa) {\n\n      if (!dfs(v, u)) {\n\n        return false;\n\n      }\n\n      int ll = l[v] - 1, rr = r[v] + 1;\n\n      int o = odd[v] == -1 ? -1 : odd[v] ^ 1;\n\n      l[u] = max(l[u], ll);\n\n      r[u] = min(r[u], rr);\n\n      if (l[u] > r[u]) {\n\n        return false;\n\n      }\n\n      if (o == -1) {\n\n        continue;\n\n      }\n\n      if (odd[u] == -1) {\n\n        odd[u] = o;\n\n      } else {\n\n        if (o != odd[u]) {\n\n          return false;\n\n        }\n\n      }\n\n                                                                   \n\n      if (odd[u] != -1) {\n\n        int t1 = l[u], t2 = min(l[u] + 1, r[u]);\n\n        if (((t1 % 2) + 2) % 2 != odd[u] && ((t2 % 2) + 2) % 2 != odd[u]) {\n\n                     \n\n          return false;\n\n        }\n\n      }\n\n    }\n\n  }\n\n                                                                   \n\n  return true;\n\n}\n\n\n\ninline bool check_in(int x, int l, int r, int o) {\n\n  if (x < l || x > r) {\n\n    return false;\n\n  }\n\n  return o == -1 || ((x % 2) + 2) % 2 == o;\n\n}\n\n\n\ninline void solve(int u, int fa) {\n\n                                                  \n\n  for (int i = 0; i < adj[u].size(); ++i) {\n\n    int v = adj[u][i];\n\n    if (v == fa) {\n\n      continue;\n\n    }\n\n    int t1 = val[u] - 1, t2 = t1 + 2;\n\n    if (check_in(t1, l[v], r[v], odd[v])) {\n\n      val[v] = t1;\n\n    } else {\n\n      if (check_in(t2, l[v], r[v], odd[v])) {\n\n        val[v] = t2;\n\n      } else {\n\n        assert(false);\n\n      }\n\n    }\n\n    solve(v, u);\n\n  }\t\n\n}\n\n\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout.tie(0);\n\n\t\n\n  cin >> n;\n\n  for (int i = 1; i <= n; ++i) {\n\n    adj[i].clear();\n\n    val[i] = INF;\n\n  }\n\n  for (int i = 1; i < n; ++i) {\n\n    int u, v;\n\n    cin >> u >> v;\n\n    adj[u].push_back(v);\n\n    adj[v].push_back(u);\n\n  }\n\n  cin >> K;\n\n  for (int i = 1; i <= n; ++i) {\n\n    int u, value; \n\n    cin >> u >> value;\n\n    val[u] = value;\n\n  }\n\n\t\n\n  if (!dfs(1, 0)) {\n\n    cout << \"No\" << endl;\n\n    return 0;\n\n  } else {\n\n    if (odd[1] == -1 || ((l[1] % 2) + 2) % 2 == odd[1]) {\n\n      val[1] = l[1];\n\n    } else {\n\n      val[1] = l[1] + 1;\n\n    }\n\n    solve(1, 0);\n\n\t\t\n\n    cout << \"Yes\" << endl;\n\n    for (int i = 1; i <= n; ++i) {\n\n      cout << val[i] << endl;\n\n    }\n\n  } \n\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <queue>\n\nusing namespace std;\n\nint n;\n\nstruct edge\n\n{\n\n  int e, nxt;\n};\n\nedge a[200200];\nint m;\n\nint sp[100100];\n\nint minv[100100], maxv[100100];\n\nint dep[100100], par[100100];\n\nconst int inf = 1000000000;\n\nint q[100100], hd, tl;\n\nint val[100100];\n\nint main()\n\n{\n\n  int i;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    a[++m].e = v;\n    a[m].nxt = sp[u];\n    sp[u] = m;\n\n    a[++m].e = u;\n    a[m].nxt = sp[v];\n    sp[v] = m;\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    minv[i] = -inf;\n    maxv[i] = inf;\n  }\n\n  par[1] = -1;\n  dep[1] = 0;\n\n  hd = 1;\n  tl = 2;\n\n  q[1] = 1;\n\n  while (hd < tl)\n\n  {\n\n    int cur = q[hd++];\n\n    for (int j = sp[cur]; j; j = a[j].nxt)\n\n    {\n\n      if (par[a[j].e])\n        continue;\n\n      par[a[j].e] = cur;\n\n      dep[a[j].e] = dep[cur] + 1;\n\n      q[tl++] = a[j].e;\n    }\n  }\n\n  scanf(\"%d\", &m);\n\n  bool parity_flags[2][2] = {{false, false}, {false, false}};\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int v, p;\n\n    scanf(\"%d%d\", &v, &p);\n\n    minv[v] = maxv[v] = p;\n\n    parity_flags[dep[v] & 1][p & 1] = true;\n  }\n\n  if ((parity_flags[0][0] && parity_flags[0][1])\n\n      || (parity_flags[1][0] && parity_flags[1][1])\n\n      || (parity_flags[0][0] && parity_flags[1][0])\n\n      || (parity_flags[0][1] && parity_flags[1][1]))\n\n  {\n\n    printf(\"No\\n\");\n\n    return 0;\n  }\n\n  for (int i = n; i > 1; i--)\n\n  {\n\n    int cur = q[i];\n\n    if (minv[cur] > maxv[cur])\n\n    {\n\n      printf(\"No\\n\");\n\n      return 0;\n    }\n\n    if (minv[cur] != -inf)\n\n      minv[par[cur]] = max(minv[par[cur]], minv[cur] - 1);\n\n    if (maxv[cur] != inf)\n\n      maxv[par[cur]] = min(maxv[par[cur]], maxv[cur] + 1);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int cur = q[i];\n\n    if (minv[cur] > maxv[cur])\n\n    {\n\n      printf(\"No\\n\");\n\n      return 0;\n    }\n\n    val[cur] = minv[cur];\n\n    for (int j = sp[cur]; j; j = a[j].nxt)\n\n    {\n\n      if (a[j].e == par[cur])\n        continue;\n\n      minv[a[j].e] = max(minv[a[j].e], val[cur] - 1);\n\n      maxv[a[j].e] = min(maxv[a[j].e], val[cur] + 1);\n    }\n  }\n\n  printf(\"Yes\\n\");\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%d\\n\", val[i]);\n\n  return 0;\n}\n"}
{"fast_code_id":"c2cfe15971c71601c3701ebf1cdaec14dbd5b1eb42cb1485f1c3a97c7695ba47","fast_id":"e27eba325d9275da1ef731e6772d2b954abfcd683e481192ac5748bcd0f3f88a","fast_time":0.0862579709,"language":"cpp","measured_fast_code_id":"e27eba325d9275da1ef731e6772d2b954abfcd683e481192ac5748bcd0f3f88a","measured_slow_code_id":"bd952adcbc2d45c7542ec1153a298708aa3cc54059eac06b96990301f11d52ce","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73400","problem_id":"p02843","slow_code_id":"7172349d227e88481ce85beee0a7fb7355c4740f2b359f5a0f9285047e97c414","slow_id":"bd952adcbc2d45c7542ec1153a298708aa3cc54059eac06b96990301f11d52ce","slow_time":0.2501080974,"speedup":2.8995360636288745,"stratum":"2-4","sampling_key":"88b0e9b17d4ba3d79f86f249a18988c33868f222d9432f9cc9f3e0a82076d0d6","slow_code":"#include <iostream>\n\n#include <iomanip>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <set>\n\n#include <cassert>\n\n#include <random>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nusing namespace std;\n\ntypedef long long int ll;\n\nconst ll INF = 1000000000;\n\nconst double PI = acos(-1);\n\nconst int mod = 1000000007;\n\nint main()\n\n{\n\n  int x;\n\n  cin >> x;\n\n  for (int n = 1; n <= 1000; n++) {\n\n    for (int i = 100 * n; i <= 105 * n; i++) {\n\n      if (i == x) {\n\n        cout << 1 << endl;\n\n        return 0;\n      }\n    }\n  }\n\n  cout << 0 << endl;\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <iomanip>\n\n#include <string>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <map>\n\n#include <cmath>\n\n#include <queue>\n\n#include <set>\n\n#include <cassert>\n\n#include <random>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nusing namespace std;\n\ntypedef long long int ll;\n\nconst ll INF = 1000000000;\n\nconst double PI = acos(-1);\n\nconst int mod = 1000000007;\n\nint dp[100001] = {0};\n\nint main()\n\n{\n\n  int x;\n\n  cin >> x;\n\n  dp[0] = 1;\n\n  for (int i = 100; i <= 105; i++) {\n\n    dp[i] = 1;\n  }\n\n  for (int i = 200; i <= x; i++) {\n\n    if (dp[i - 100] || dp[i - 101] || dp[i - 102] || dp[i - 103] ||\n        dp[i - 104] || dp[i - 105]) {\n\n      dp[i] = 1;\n    }\n  }\n\n  cout << dp[x] << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"2fcb2cf82963c2c6a960ac6318df6a63313cffeb768e52e649a923a1239f0e9d","fast_id":"3d1b27a4efe4e96ca05788628ece5a01e83596d75471a101e9cb1e5d43c3c771","fast_time":0.0244795697,"language":"cpp","measured_fast_code_id":"3d1b27a4efe4e96ca05788628ece5a01e83596d75471a101e9cb1e5d43c3c771","measured_slow_code_id":"f983dd780b9e80a53ea3a77959e4b1631d202eaa4272782f22e106d79e315716","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73434","problem_id":"p03188","slow_code_id":"5c1b3787d1ff4ebf8b381a0a7fe376dfa4ff32af8f2bb1e7f4643e8c164518f6","slow_id":"f983dd780b9e80a53ea3a77959e4b1631d202eaa4272782f22e106d79e315716","slow_time":0.0918186046,"speedup":3.750825922401733,"stratum":"2-4","sampling_key":"2dcee29035f334f54fcb7be435deac5a81ea6641077773a68f44902ef4887a46","slow_code":"#import <iostream>\n\nint main() {\n  int K, n, i = -1, j, k;\n  std::cin >> K;\n  std::cout << (n = (K + 3) / 4 * 2);\n  while (++i < n) {\n    std::cout << '\\n';\n    j = -1;\n    while (++j < n)\n      std::cout << ((k = i % 2 * n + (i + j) % n) >= K ? (k - n) % K : k) + 1\n                << ' ';\n  }\n  return 0;\n}","fast_code":"#import <cstdio>\n\nint main() {\n  int K, n, i = -1, j, k;\n  scanf(\"%d\", &K);\n  printf(\"%d\", n = (K + 3) / 4 * 2);\n  while (++i < n) {\n    puts(\"\");\n    j = -1;\n    while (++j < n)\n      printf(\"%d \", ((k = i % 2 * n + (i + j) % n) >= K ? k - n : k) % K + 1);\n  }\n}"}
{"fast_code_id":"66765fe6440162dd1b53950ef6387a59b328451dfe172b70e5ea59c86fbd8fb0","fast_id":"074aeaaa6925e6d63a9d289832885c1a0620411f0c18336f372106bc8535d927","fast_time":0.0375415369,"language":"cpp","measured_fast_code_id":"074aeaaa6925e6d63a9d289832885c1a0620411f0c18336f372106bc8535d927","measured_slow_code_id":"6fe0868808e7a85037cdf3e77b2a3c204d7c6b3cdfa20bc1aaf42d47a5768045","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73441","problem_id":"p01558","slow_code_id":"f0d85b62c63eacc4828756cd4e95b8f08acc5c57ae14d8c3fce60449474bc5bb","slow_id":"6fe0868808e7a85037cdf3e77b2a3c204d7c6b3cdfa20bc1aaf42d47a5768045","slow_time":0.1287322368,"speedup":3.4290614458035154,"stratum":"2-4","sampling_key":"612e49445ec930fd1788b047bac5d4a2ca99c88119a8ace0aae52bdd3ee3e16d","slow_code":"#include <iostream>\n\n#include <set>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cassert>\n\n#include <climits>\n\n#define REP(i, s, n) for (int i = s; i < n; i++)\n\n#define rep(i, n) REP(i, 0, n)\n\n#define inf (1 << 29)\n\n#define MAX 300002\n\nusing namespace std;\n\ntypedef unsigned long long ull;\n\null extgcd(ull a, ull b, ull &x, ull &y)\n\n{\n\n  ull d = a;\n\n  if (b != 0) {\n\n    d = extgcd(b, a % b, y, x);\n\n    y -= (a / b) * x;\n\n  }\n\n  else\n\n    x = 1, y = 0;\n\n  return d;\n}\n\null mod_inv(ull a, ull m)\n\n{\n\n  ull x, y;\n\n  extgcd(a, m, x, y);\n\n  return (m + x % m) % m;\n}\n\nint n, m, L, R, keta;\n\nchar s[MAX], o[5];\n\nset<ull> ans;\n\nconst ull B = 9973ULL;\n\nconst ull inv = 9063375710536127837ULL;\n\null H, Bmax[MAX];\n\nint main()\n\n{\n\n  Bmax[0] = 1ULL;\n\n  REP(i, 1, MAX) Bmax[i] = Bmax[i - 1] * B;\n\n  L = R = keta = 0;\n\n  scanf(\"%d %d\", &n, &m);\n\n  scanf(\"%s\", &s[0]);\n\n  H = s[0];\n\n  rep(_, m)\n\n  {\n\n    scanf(\"%s\", &o[0]);\n\n    if (o[0] == 'R')\n\n    {\n\n      if (o[1] == '+')\n\n      {\n\n        H = H * B + s[++R];\n\n      }\n\n      else\n\n      {\n\n        H = (H - s[R--]) * inv;\n      }\n\n    }\n\n    else\n\n    {\n\n      if (o[1] == '+')\n\n      {\n\n        H = H - Bmax[R - L] * s[L++];\n\n      }\n\n      else\n\n      {\n\n        H = H + Bmax[R + 1 - L] * s[L - 1];\n\n        L--;\n      }\n    }\n\n    ans.insert(H);\n  }\n\n  cout << ans.size() << endl;\n\n  return 0;\n}","fast_code":"\n\n#include <iostream>\n\n#include <set>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstdio>\n\n#include <cassert>\n\n#define REP(i, s, n) for (int i = s; i < n; i++)\n\n#define rep(i, n) REP(i, 0, n)\n\n#define inf (1 << 29)\n\n#define MAX 300001\n\nusing namespace std;\n\ntypedef unsigned long long ull;\n\nint n, m, L, R;\n\nchar s[MAX], o[5];\n\nset<ull> ans;\n\nconst ull B = 9973ULL;\n\nconst ull inv = 9063375710536127837ULL;\n\null H, Bmax;\n\nint main()\n\n{\n\n  Bmax = 1;\n\n  L = R = 0;\n\n  scanf(\"%d %d\", &n, &m);\n\n  scanf(\"%s\", &s[0]);\n\n  H = s[0];\n\n  rep(_, m)\n\n  {\n\n    scanf(\"%s\", &o[0]);\n\n    if (o[0] == 'R')\n\n    {\n\n      if (o[1] == '+')\n\n      {\n\n        R++;\n\n        Bmax *= B;\n\n        H = H + s[R] * Bmax;\n\n      }\n\n      else\n\n      {\n\n        H = H - s[R] * Bmax;\n\n        Bmax = Bmax * inv;\n\n        R--;\n      }\n\n    }\n\n    else\n\n    {\n\n      if (o[1] == '+')\n\n      {\n\n        H = (H - s[L]) * inv;\n\n        Bmax *= inv;\n\n        L++;\n\n      }\n\n      else\n\n      {\n\n        L--;\n\n        H = H * B + s[L];\n\n        Bmax *= B;\n      }\n    }\n\n    ans.insert(H);\n  }\n\n  cout << ans.size() << endl;\n\n  return 0;\n}"}
{"fast_code_id":"cee261e1de94a55a874a3942c770d3d9452a09bbe5cb108b99ee968600b16ff9","fast_id":"a248cadfa4a4689645b8bff8af596181d890ae626c355fa9abf2bdc43132babd","fast_time":0.1053607243,"language":"cpp","measured_fast_code_id":"a248cadfa4a4689645b8bff8af596181d890ae626c355fa9abf2bdc43132babd","measured_slow_code_id":"66da1ca3bb56b3b0d93baefcba1a11b3020411ea9c12270abce36e04802bcf6f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73458","problem_id":"p03504","slow_code_id":"41c173e7207d843317d07bd94d919399093b6189c82b7f37aaae21f05d0eb765","slow_id":"66da1ca3bb56b3b0d93baefcba1a11b3020411ea9c12270abce36e04802bcf6f","slow_time":0.3052449972,"speedup":2.897142167804934,"stratum":"2-4","sampling_key":"f859e5a245c8f4d7ccd403ea9b64d9a5904823c3c61d5e1557459c56eda900bc","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\nusing namespace std;\n\nusing pii = pair<int, int>;\n\nusing vi = vector<int>;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define IN(v)                                                                  \\\n  int v;                                                                       \\\n  cin >> v;\n\n#define OUT(v) cout << v << endl\n\nint main() {\n\n  IN(N);\n  IN(C);\n\n  vector<vector<pii>> program(C, vector<pii>());\n\n  REP(i, N) {\n\n    IN(s);\n    IN(t);\n    IN(c);\n\n    program[c - 1].push_back(make_pair(s, t));\n  }\n\n  REP(c, C) {\n\n    priority_queue<pii, vector<pii>, greater<pii>> q;\n\n    for (const auto &e : program[c])\n\n      q.push(e);\n\n    program[c].clear();\n\n    while (!q.empty()) {\n\n      pii p = q.top();\n      q.pop();\n\n      if (p.second == q.top().first) {\n\n        pii p2 = q.top();\n        q.pop();\n\n        q.push(make_pair(p.first, p2.second));\n\n      } else {\n\n        program[c].push_back(p);\n      }\n    }\n  }\n\n  vi indexes(C);\n\n  int res = 0;\n\n  REP(s, 200002) {\n\n    int count = 0;\n\n    REP(c, C) {\n\n      if (program[c].size() == indexes[c])\n\n        continue;\n\n      if (2 * program[c][indexes[c]].first - 1 <= s &&\n          s < 2 * program[c][indexes[c]].second)\n\n        ++count;\n\n      else if (2 * program[c][indexes[c]].second <= s)\n\n        ++indexes[c];\n    }\n\n    res = max(res, count);\n  }\n\n  OUT(res);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <queue>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0, _i = (n); i < _i; ++i)\n\nstruct Program {\n\n  int s, t, c;\n\n  Program(int s, int t, int c) : s(s), t(t), c(c) {};\n\n  bool operator<(const Program &rhs) const {\n    return s == rhs.s ? t < rhs.t : s < rhs.s;\n  }\n\n  bool operator>(const Program &rhs) const {\n    return s == rhs.s ? t > rhs.t : s > rhs.s;\n  }\n};\n\ntemplate <class T>\nusing priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\n\nint main() {\n\n  int N, C;\n  cin >> N >> C;\n\n  vector<priority_queue_rev<Program>> q(30);\n\n  rep(i, N) {\n\n    int s, t, c;\n    cin >> s >> t >> c;\n\n    --c;\n\n    q[c].emplace(s, t, c);\n  }\n\n  rep(i, 30) {\n\n    queue<Program> tmp_q;\n\n    while (!q[i].empty()) {\n\n      if (q[i].size() == 1) {\n\n        tmp_q.push(q[i].top());\n\n        q[i].pop();\n\n        break;\n      }\n\n      Program p1 = q[i].top();\n      q[i].pop();\n\n      Program p2 = q[i].top();\n      q[i].pop();\n\n      if (p1.t == p2.s)\n\n        q[i].emplace(p1.s, p2.t, p1.c);\n\n      else {\n\n        tmp_q.push(p1);\n        tmp_q.push(p2);\n      }\n    }\n\n    while (!tmp_q.empty()) {\n\n      q[i].push(tmp_q.front());\n      tmp_q.pop();\n    }\n  }\n\n  priority_queue_rev<pair<int, int>> tv;\n\n  int ans = 0;\n\n  rep(t, 1e5 + 1) {\n\n    int min_idx = -1;\n\n    rep(i, 30) {\n\n      if (q[i].empty())\n\n        continue;\n\n      if (min_idx == -1 || q[i].top() < q[min_idx].top())\n\n        min_idx = i;\n    }\n\n    if (min_idx == -1)\n\n      break;\n\n    Program p = q[min_idx].top();\n    q[min_idx].pop();\n\n    if (tv.empty())\n\n      tv.emplace(p.t, p.c);\n\n    else {\n\n      if (tv.top().first < p.s ||\n          tv.top().first <= p.s && tv.top().second == p.c) {\n\n        tv.pop();\n\n        tv.emplace(p.t, p.c);\n\n      } else\n\n        tv.emplace(p.t, p.c);\n    }\n\n    ans = max(ans, (int)tv.size());\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"04c6193fd1a4fe84a3fcb7f22f517b6f3247007df62faa77c57b90bb4248b26e","fast_id":"7b9fc863786f36b7a908d15881d36e6b7b26cac38c72dae56687cc3f243a6db4","fast_time":0.0131039792,"language":"cpp","measured_fast_code_id":"7b9fc863786f36b7a908d15881d36e6b7b26cac38c72dae56687cc3f243a6db4","measured_slow_code_id":"889f7f197a9f21d3d06f5a621c28d3b4d6bce3a9952108d85fe06ad00c32ad64","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73477","problem_id":"p01132","slow_code_id":"7e6810ee504813daabf4a7492a74aea208fe379da8ac3bb6d499eef91df96f34","slow_id":"889f7f197a9f21d3d06f5a621c28d3b4d6bce3a9952108d85fe06ad00c32ad64","slow_time":0.0689394157,"speedup":5.260952772269358,"stratum":"4-8","sampling_key":"c3b34a6e08a70b735e6baa54d94ac82ee319b4786b22d4ca56dc4a839301dc6b","slow_code":"#include <algorithm>\n\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  int N;\n\n  int coin[4] = {10, 50, 100, 500};\n\n  bool first = true;\n\n  while (cin >> N && N) {\n\n    int budget[4], used[4] = {};\n\n    cin >> budget[0] >> budget[1] >> budget[2] >> budget[3];\n\n    int res = 20 * 20 * 20 * 20;\n\n    for (int i = 0; i <= budget[0]; i++) {\n\n      int t0 = coin[0] * i;\n\n      for (int j = 0; j <= budget[1]; j++) {\n\n        int t1 = coin[1] * j;\n\n        for (int k = 0; k <= budget[2]; k++) {\n\n          int t2 = coin[2] * k;\n\n          for (int l = 0; l <= budget[3]; l++) {\n\n            int t3 = coin[3] * l;\n\n            int charge = (t0 + t1 + t2 + t3) - N;\n\n            if (charge < 0)\n              continue;\n\n            int num = 0;\n\n            for (int m = 3; m >= 0; m--) {\n\n              while (charge >= coin[m]) {\n\n                num++;\n\n                charge -= coin[m];\n              }\n            }\n\n            if (res > budget[0] - i + budget[1] - j + budget[2] - k + budget[3] - l + num) {\n\n              res = budget[0] - i + budget[1] - j + budget[2] - k + budget[3] - l + num;\n\n              used[0] = i;\n\n              used[1] = j;\n\n              used[2] = k;\n\n              used[3] = l;\n            }\n          }\n        }\n      }\n    }\n\n    if (first)\n      first = false;\n\n    else\n      cout << endl;\n\n    for (int i = 0; i < 4; i++) {\n\n      if (used[i] > 0)\n\n        cout << coin[i] << ' ' << used[i] << endl;\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nint main() {\n\n  bool first = true;\n\n  while (true) {\n\n    int p;\n\n    scanf(\"%d\", &p);\n\n    if (p == 0)\n      break;\n\n    int n10, n50, n100, n500;\n\n    scanf(\"%d %d %d %d\", &n10, &n50, &n100, &n500);\n\n    int rest = n10 * 10 + n50 * 50 + n100 * 100 + n500 * 500 - p;\n\n    n500 -= rest / 500;\n\n    rest %= 500;\n\n    n100 -= rest / 100;\n\n    rest %= 100;\n\n    n50 -= rest / 50;\n\n    rest %= 50;\n\n    n10 -= rest / 10;\n\n    if (!first)\n      putchar('\\n');\n\n    first = false;\n\n    if (n10 > 0)\n      printf(\"%d %d\\n\", 10, n10);\n\n    if (n50 > 0)\n      printf(\"%d %d\\n\", 50, n50);\n\n    if (n100 > 0)\n      printf(\"%d %d\\n\", 100, n100);\n\n    if (n500 > 0)\n      printf(\"%d %d\\n\", 500, n500);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"f474fd86132ecc8126fc4d6dd7897581c2adf53205a0ba77cce74f6e21982e8c","fast_id":"caae80211a76a193f34d301fa00530f1d0d9d3a110c312e4647dda1dc577a793","fast_time":0.0053023448,"language":"cpp","measured_fast_code_id":"caae80211a76a193f34d301fa00530f1d0d9d3a110c312e4647dda1dc577a793","measured_slow_code_id":"9b40f685657c153559545ad3b0625383e4b1433eaba7be8fdd3cbfbeee8d0a0c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73480","problem_id":"p04010","slow_code_id":"08b0c41926310c7d0afef99102a7b4e9c6d3b2d69b97160a74adbfa01e2dbd29","slow_id":"9b40f685657c153559545ad3b0625383e4b1433eaba7be8fdd3cbfbeee8d0a0c","slow_time":0.0897572948,"speedup":16.927849505373548,"stratum":"8+","sampling_key":"35405e3e783b6dca133cf60fb8e3d89e8c14b1e6f069ad94b88f519a358aac0d","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAXN 100000\n\n#define ll long long\n\n#define rint register int\n\n#define gc() getchar()\n\ninline int read(int r = 0, int s = 0, int c = gc()) {\n  for (; c < 48 || c > 57; s = c, c = gc())\n    ;\n  for (; c >= 48 && c <= 57; (r *= 10) += c - 48, c = gc())\n    ;\n  return s ^ '-' ? r : -r;\n}\n\nstruct D {\n  int a, b;\n  D() {}\n  D(int _a, int _b) { a = _a, b = _b; }\n  inline D operator+(D x) { return D(a + x.a, b + x.b); }\n} w[MAXN + 5];\n\nint a[MAXN + 5], q[MAXN + 5], in[MAXN + 5], n, m, k, h, t, S, T;\nll Ans;\nbool book[MAXN + 5];\nvector<int> e[MAXN + 5];\n\nvoid DFS(int p, int c, int fa) {\n  k += c, w[p] = D(0, 1 - (c << 1));\n  for (auto v : e[p])\n    if (v ^ fa && (p ^ S || v ^ T) && (p ^ T || v ^ S))\n      DFS(v, c ^ 1, p);\n}\n\nvoid DFS_s(int p, int fa) {\n  for (auto v : e[p])\n    if (v ^ fa && (p ^ S || v ^ T) && (p ^ T || v ^ S))\n      DFS_s(v, p), w[p] = w[p] + w[v];\n}\n\nint main()\n\n{\n\n  n = read();\n  if (n & 1)\n    return puts(\"-1\"), 0;\n  m = read();\n  for (rint i = 1, a, b; i <= m; a = read(), b = read(), e[a].push_back(b),\n            e[b].push_back(a), ++in[a], ++in[b], i++)\n    ;\n\n  if (m == n) {\n    for (rint i = 1; i <= n; in[i] <= 1 ? book[q[++t] = i] = true : 0, i++)\n      ;\n    h = 1;\n    for (; h <= t;)\n      for (auto v : e[q[h++]])\n        --in[v] == 1 ? book[q[++t] = v] = true : 0;\n  } else\n    t = n;\n\n  if (t < n) {\n    for (rint i = 1; i <= n; i++)\n      if (!book[i])\n        for (auto v : e[S = i])\n          if (!book[v]) {\n            T = v;\n            goto out;\n          }\n  } else\n    S = 1;\n  ;\nout:;\n  DFS(S, 0, 0);\n  if (m < n && k ^ (n - k))\n    return puts(\"-1\"), 0;\n\n  if ((n - t) & 1)\n    w[S].b -= (n >> 1) - k, w[T].b -= (n >> 1) - k, Ans += abs((n >> 1) - k);\n  if (t < n && ~(n - t) & 1) {\n    if (k ^ (n - k))\n      return puts(\"-1\"), 0;\n    --w[S].a, ++w[T].a;\n  }\n\n  DFS_s(S, 0);\n  if (m < n || (n - t) & 1) {\n    for (rint i = 1; i <= n; Ans += abs(w[i].b), i++)\n      ;\n    return printf(\"%lld\\n\", Ans), 0;\n  }\n\n  a[k = 1] = 0;\n  for (rint i = 1; i <= n;\n       w[i].a ? a[++k] = w[i].a > 0 ? w[i].b : -w[i].b : Ans += abs(w[i].b),\n            i++)\n    ;\n\n  sort(a + 1, a + k + 1);\n  for (rint i = 1; i <= k; Ans += abs(a[i] - a[-~k >> 1]), i++)\n    ;\n  return printf(\"%lld\\n\", Ans), 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cmath>\n\n#define MAXN 100000\n\nusing namespace std;\n\ntypedef long long LL;\n\nstruct node\n\n{\n\n  int to;\n\n  node *nxt;\n\n} edges[MAXN * 2 + 5];\n\nnode *ncnt, *Adj[MAXN + 5];\n\nint N, M, spx, spy;\n\nLL sum[MAXN + 5];\n\nLL cirlen, dist[MAXN + 5], xs[MAXN + 5];\n\nLL stk[MAXN + 5], t;\n\nbool vis[MAXN + 5];\n\nvoid Init()\n\n{\n\n  ncnt = &edges[0];\n}\n\nvoid AddEdge(int u, int v)\n\n{\n\n  node *p = ++ncnt;\n\n  p->to = v;\n\n  p->nxt = Adj[u];\n\n  Adj[u] = p;\n\n  node *q = ++ncnt;\n\n  q->to = u;\n\n  q->nxt = Adj[v];\n\n  Adj[v] = q;\n}\n\nvoid DFS(int u, int fa)\n\n{\n\n  vis[u] = true;\n\n  for (node *p = Adj[u]; p != NULL; p = p->nxt)\n\n  {\n\n    int v = p->to;\n\n    if (v == fa)\n\n      continue;\n\n    if (vis[v] == true)\n\n    {\n\n      spx = u, spy = v;\n\n      cirlen = dist[v] - dist[u] + 1;\n\n      continue;\n    }\n\n    dist[v] = dist[u] + 1;\n\n    DFS(v, u);\n  }\n}\n\nvoid GetXs(int u, int fa)\n\n{\n\n  vis[u] = true;\n\n  for (node *p = Adj[u]; p != NULL; p = p->nxt)\n\n  {\n\n    int v = p->to;\n\n    if (v == fa || vis[v] == true)\n\n      continue;\n\n    GetXs(v, u);\n\n    xs[u] += xs[v];\n\n    sum[u] += sum[v];\n  }\n}\n\nint main()\n\n{\n\n  Init();\n\n  scanf(\"%d %d\", &N, &M);\n\n  int u, v;\n\n  for (int i = 1; i <= M; i++)\n\n  {\n\n    scanf(\"%d %d\", &u, &v);\n\n    AddEdge(u, v);\n  }\n\n  dist[1] = 0;\n\n  DFS(1, -1);\n\n  LL ans = 0, tot = 0;\n\n  for (int i = 1; i <= N; i++)\n\n  {\n\n    if (dist[i] % 2 == 0)\n\n      sum[i] = 1LL;\n\n    else\n\n      sum[i] = -1LL;\n\n    tot += sum[i];\n  }\n\n  if (N - 1 == M)\n\n  {\n\n    if (tot != 0)\n\n    {\n\n      printf(\"-1\\n\");\n\n      return 0;\n    }\n\n  }\n\n  else\n\n  {\n\n    if (cirlen % 2 == 1)\n\n    {\n\n      if (tot % 2 == 1)\n\n      {\n\n        printf(\"-1\\n\");\n\n        return 0;\n      }\n\n      sum[spx] -= tot / 2;\n\n      sum[spy] -= tot / 2;\n\n      ans += abs(tot) / 2;\n\n    }\n\n    else\n\n    {\n\n      if (tot != 0)\n\n      {\n\n        printf(\"-1\\n\");\n\n        return 0;\n      }\n\n      xs[spx] = 1LL;\n\n      xs[spy] = -1LL;\n    }\n  }\n\n  memset(vis, 0, sizeof(vis));\n\n  GetXs(1, -1);\n\n  for (int i = 1; i <= N; i++)\n\n  {\n\n    if (xs[i] == 0)\n      ans += abs(sum[i]);\n\n    else\n\n    {\n\n      if (xs[i] == 1)\n\n        sum[i] = -sum[i];\n\n      stk[++t] = sum[i];\n    }\n  }\n\n  stk[++t] = 0;\n\n  sort(stk + 1, stk + 1 + t);\n\n  LL k = stk[(t + 1) / 2];\n\n  for (int i = 1; i <= t; i++)\n\n    ans += 1LL * abs(stk[i] - k);\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"692f694fa99f78057a3c46b0b677740e7048bc56882698b7bfa6dfca5875c823","fast_id":"bf25dccbedf1c5b1868249e91f24f8edfd201f947a9f3cb26b0e7932f6586b10","fast_time":0.0524988604,"language":"cpp","measured_fast_code_id":"bf25dccbedf1c5b1868249e91f24f8edfd201f947a9f3cb26b0e7932f6586b10","measured_slow_code_id":"bcb89e523e9e396d6cb41fb3f61fd6e4481514b18008da5a4c67f03700d80eab","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73571","problem_id":"p02752","slow_code_id":"8a3d66db5484284fb7d90da9e5bd3db760134b09234d9aa012ac040f2aa04884","slow_id":"bcb89e523e9e396d6cb41fb3f61fd6e4481514b18008da5a4c67f03700d80eab","slow_time":0.4963324855,"speedup":9.454157323003528,"stratum":"8+","sampling_key":"a0c4a4f5b42f8b9de57d2e52f1244a52c0b85e8c6e551e17206de69bbd35c21b","slow_code":"#include <cctype>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <cstring>\n\nconst int N = 300007, P = 998244353, i2 = P - P / 2;\n\nint m, root, len, fa[N], dia[N], f[N][3][3], g[3][3];\nstd::vector<int> e[N];\n\nvoid inc(int &a, int b) { a += b - P, a += a >> 31 & P; }\n\nint mul(int a, int b) { return 1ll * a * b % P; }\n\nint read() {\n  int x = 0, c = getchar();\n  while (isspace(c))\n    c = getchar();\n  while (isdigit(c))\n    (x *= 10) += c & 15, c = getchar();\n  return x;\n}\n\nvoid dfs(int u, int dep)\n\n{\n\n  if (dep > len)\n    len = dep, root = u;\n\n  for (int v : e[u])\n    if (v ^ fa[u])\n      fa[v] = u, dfs(v, dep + 1);\n}\n\nvoid dp(int u, int fa, int d)\n\n{\n\n  (d == m / 2 ? f[u][1][1] : f[u][0][0]) = 1;\n\n  for (int v : e[u])\n\n  {\n\n    if (v == fa)\n      continue;\n\n    dp(v, u, d + 1), memset(g, 0, 36);\n\n    for (int x = 0; x < 3; ++x)\n      for (int y = 0; y < 3; ++y)\n        for (int p = 0; p < 3; ++p)\n          for (int q = 0; q < 3; ++q)\n            for (int k = 0, r, t; k < 3; ++k)\n              r = std::min(2, x + p * (k == 1)), t = std::min(2, y + q * (k == 2)),\n              inc(g[r][t], mul(f[u][x][y], f[v][p][q]));\n\n    memcpy(f[u], g, 36);\n  }\n}\n\nint main()\n\n{\n\n  int n = read(), p, q;\n\n  for (int i = 1, u, v; i < n; ++i)\n    u = read(), v = read(), e[u].push_back(v), e[v].push_back(u);\n\n  dfs(1, 1), memset(fa + 1, 0, n << 2), len = 0, dfs(root, 1);\n\n  for (int i = root; i; i = fa[i])\n    dia[++m] = i;\n\n  if (m & 1)\n    p = dia[m / 2 + 1], dp(p, 0, 0), printf(\"%d\", mul(i2, f[p][1][1]));\n\n  else\n    p = dia[m / 2], q = dia[m / 2 + 1], dp(p, q, 1), dp(q, p, 1),\n    printf(\"%d\", mul((1ll * f[p][1][0] + f[p][1][1] + f[p][1][2]) % P,\n                     (1ll * f[q][1][0] + f[q][1][1] + f[q][1][2]) % P));\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int maxn = 2e5 + 5, mod = 998244353;\n\ninline int gi()\n\n{\n\n  char c = getchar();\n\n  while (c < '0' || c > '9')\n    c = getchar();\n\n  int sum = 0;\n\n  while ('0' <= c && c <= '9')\n    sum = sum * 10 + c - 48, c = getchar();\n\n  return sum;\n}\n\ninline void inc(int &a, int b) {\n  a += b;\n  if (a >= mod)\n    a -= mod;\n}\n\nint n, rt, len, fa[maxn], ch[maxn];\n\nstruct edge\n\n{\n\n  int to, next;\n\n} e[maxn * 2];\n\nint h[maxn], tot;\n\nint md[maxn], f[maxn][3][3], g[3][3];\n\ninline void add(int u, int v)\n\n{\n\n  e[++tot] = (edge){v, h[u]};\n  h[u] = tot;\n\n  e[++tot] = (edge){u, h[v]};\n  h[v] = tot;\n}\n\nvoid dfs1(int u, int d)\n\n{\n\n  if (d > len)\n    rt = u, len = d;\n\n  md[u] = d;\n\n  for (int i = h[u], v; v = e[i].to, i; i = e[i].next)\n\n    if (v != fa[u])\n      fa[v] = u, dfs1(v, d + 1), md[u] = max(md[u], md[v]);\n}\n\nvoid dfs2(int u, int d)\n\n{\n\n  (md[u] == d ? f[u][1][1] : f[u][0][0]) = 1;\n\n  for (int i = h[u], v; v = e[i].to, i; i = e[i].next)\n\n    if (v != fa[u]) {\n\n      fa[v] = u;\n      dfs2(v, d + 1);\n\n      memset(g, 0, sizeof(g));\n\n      for (int a = 0; a <= 2; ++a)\n\n        for (int b = 0; b <= 2; ++b)\n\n          if (f[u][a][b])\n\n            for (int c = 0; c <= 2; ++c)\n\n              for (int d = 0; d <= 2; ++d)\n\n                if (f[v][c][d])\n\n                  for (int t = -1; t <= 1; ++t)\n\n                    inc(g[min(2, a + (md[v] == md[u] && t == 1) * c)]\n                         [min(2, b + (md[v] == md[u] && t == -1) * d)],\n                        (ll)f[u][a][b] * f[v][c][d] % mod);\n\n      memcpy(f[u], g, sizeof(f[u]));\n    }\n}\n\nint main()\n\n{\n\n  n = gi();\n\n  for (int i = 1; i < n; ++i)\n    add(gi(), gi());\n\n  dfs1(1, 0);\n\n  fa[rt] = 0;\n  len = 0;\n  dfs1(rt, 0);\n\n  for (int i = 0, x = rt; x; x = fa[x])\n    ch[i++] = x;\n\n  if (~len & 1) {\n\n    int x = ch[len >> 1];\n\n    fa[x] = 0, dfs1(x, 0);\n\n    dfs2(x, 0);\n\n    printf(\"%lld\\n\", (ll)f[x][1][1] * (mod + 1) / 2 % mod);\n\n  }\n\n  else {\n\n    int x = ch[len >> 1], y = ch[len + 1 >> 1];\n\n    fa[x] = y;\n    fa[y] = x;\n\n    dfs1(x, 0);\n    dfs2(x, 0);\n\n    dfs1(y, 0);\n    dfs2(y, 0);\n\n    printf(\"%lld\\n\", ((ll)f[x][1][0] + f[x][1][1] + f[x][1][2]) *\n                         ((ll)f[y][1][0] + f[y][1][1] + f[y][1][2]) % mod);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"b50bf33ee66f601430f82d4cbe2381481118f9d5c9dd59d96c054155f49536eb","fast_id":"1c19980f686cf4df2ebf6047698ae71e800e02d17b930d3c4bb31b577144d776","fast_time":0.000192093,"language":"cpp","measured_fast_code_id":"1c19980f686cf4df2ebf6047698ae71e800e02d17b930d3c4bb31b577144d776","measured_slow_code_id":"f1a524ed403fcedae1b4fb2d9b045848ec7f4c5411f7f1661f2ab2fe52bb0ae1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73590","problem_id":"p03661","slow_code_id":"c09c68e41370732de5a99c91633fd4a64c9d14a96bb2223d7dd5888ee1e6852f","slow_id":"f1a524ed403fcedae1b4fb2d9b045848ec7f4c5411f7f1661f2ab2fe52bb0ae1","slow_time":0.0027040757,"speedup":14.076909101320714,"stratum":"8+","sampling_key":"47c3abdbba6ad5ae51a45abaeadf8dd482d69ec0de9332ae49b21593b3f64669","slow_code":"#include <iostream>\n\n#include <stdio.h>\n\nusing namespace std;\n\ntypedef long ll;\n\nint main() {\n\n  int length;\n\n  ll arr[200000];\n\n  ll res[200000] = {0};\n\n  ll temp = 0;\n\n  ll m = 2147483647;\n\n  scanf(\"%d\", &length);\n\n  for (int i = 0; i < length; ++i) {\n\n    scanf(\"%ld\", &arr[i]);\n  }\n\n  res[0] = arr[0];\n\n  for (int i = 1; i < length; ++i) {\n\n    res[i] += res[i - 1] + arr[i];\n  }\n\n  for (int i = 1; i < length; ++i) {\n\n    temp = abs(res[length - 1] - res[i - 1] * 2);\n\n    m = min(temp, m);\n  }\n\n  printf(\"%ld\\n\", m);\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define ll long long\n\nconst int N = 2e5 + 10;\n\nll a[N];\n\nint main()\n\n{\n\n  ll n, m, i, j, k, s, t, sum, l, r;\n\n  scanf(\"%lld\", &n);\n\n  {\n\n    sum = 0;\n\n    for (i = 1; i <= n; i++)\n\n      scanf(\"%lld\", &a[i]), sum += a[i];\n\n    l = 0;\n\n    m = 1e15;\n\n    for (i = 1; i < n; i++)\n\n    {\n\n      l += a[i];\n\n      r = sum - l;\n\n      m = min(m, llabs(l - r));\n    }\n\n    printf(\"%lld\\n\", m);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"81b2cb46ffb726562fab3d5cca79d92456e4ce6e868c4c35754849e6506519b3","fast_id":"20cba542463c94821a4a4fb3cbac21d7d030c701d5970e6eb36691abae408039","fast_time":0.025787808,"language":"cpp","measured_fast_code_id":"20cba542463c94821a4a4fb3cbac21d7d030c701d5970e6eb36691abae408039","measured_slow_code_id":"a1377077d8ba1d0760286ec21e1dd5f0fc36e6f6e43bd4033ed327095d47da33","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73708","problem_id":"p00880","slow_code_id":"b1c95940eeafdcd7954f9b264fd38cc7f1582f79a8ab0598e2b555522fbbccc4","slow_id":"a1377077d8ba1d0760286ec21e1dd5f0fc36e6f6e43bd4033ed327095d47da33","slow_time":0.1758998161,"speedup":6.821045670108914,"stratum":"4-8","sampling_key":"8619d9254fb5960fa9eace4c2c95e308f1e878ef1643771f82cd853352ca2d64","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef complex<double> point;\n\npoint p[5], q[5];\n\nconst double eps = 1.0e-8;\n\nnamespace std {\n\nbool operator==(const point &a, const point &b) { return abs(a - b) < eps; }\n\n}                 \n\nstruct line : public vector<point> {\n\n  line() {}\n\n  line(const point &a, const point &b) {\n    push_back(a);\n    push_back(b);\n  }\n};\n\nstruct Circle {\n\n  point center;\n\n  double radius;\n\n  Circle(const point &c, const double &r) : center(c), radius(r) {}\n};\n\npoint unit(const point &v) { return v / abs(v); }\n\npoint ortho(const point &v) { return v * point(0, 1); }\n\npoint spin(const point &v, const double &angle) { return v * point(cos(angle), sin(angle)); }\n\ninline point vec(const line &l) { return l[1] - l[0]; }\n\ninline double dot(const point &a, const point &b) { return (a * conj(b)).real(); }\n\ninline double cross(const point &a, const point &b) { return (conj(a) * b).imag(); }\n\npoint crosspoint(const line &l, const line &m) {\n\n  double A = cross(vec(l), vec(m));\n\n  double B = cross(vec(l), l[1] - m[0]);\n\n  if (abs(A) < eps) {\n\n    return m[0];\n  }\n\n  return m[0] + B / A * vec(m);\n}\n\npoint O;\n\nint cmp(const point &a, const point &b) { return arg(a - O) < arg(b - O); }\n\npoint solve(const point &x, const double &R, const double &angle, const line &p) {\n\n  double l = 0, r = 1, mid;\n\n  point ret;\n\n  while (l + eps < r) {\n\n    mid = (l + r) / 2.0;\n\n    double radius = abs(vec(p)) * mid * sin(angle);\n\n    point X = p[0] + abs(vec(p)) * mid * unit(vec(p));\n\n    if (abs(X - x) > R + radius)\n      l = mid;\n\n    else\n      r = mid;\n\n    ret = X;\n  }\n\n  return ret;\n}\n\nint main() {\n\n  point A, B, C;\n\n  int ax, ay, bx, by, cx, cy;\n\n  while (cin >> ax >> ay >> bx >> by >> cx >> cy && (ax || ay || bx || by || cx || cy)) {\n\n    A = point(ax, ay);\n    B = point(bx, by);\n    C = point(cx, cy);\n\n    O = (A + B + C) / (double)3.0;\n\n    p[0] = A;\n    p[1] = B;\n    p[2] = C;\n\n    q[0] = A;\n    q[1] = B;\n    q[2] = C;\n\n    sort(p, p + 3, cmp);\n\n    A = p[0], B = p[1], C = p[2];\n\n    line AB(A, B), BA(B, A), BC(B, C), CB(C, B), CA(C, A), AC(A, C);\n\n    double a, b, c;\n\n    double sa, sb, sc;\n\n    sa = abs(B - C), sb = abs(A - C), sc = abs(A - B);\n\n    a = acos((sb * sb + sc * sc - sa * sa) / (2 * sb * sc));\n\n    b = acos((sa * sa + sc * sc - sb * sb) / (2 * sa * sc));\n\n    c = acos((sb * sb + sa * sa - sc * sc) / (2 * sb * sa));\n\n    line AP(A, A + spin(vec(AB), a / 2)), BP(B, B + spin(vec(BC), b / 2)),\n        CP(C, C + spin(vec(CA), c / 2));\n\n    point P = crosspoint(AP, BP);\n\n    AP = line(A, P);\n    BP = line(B, P);\n    CP = line(C, P);\n\n    point lap = vec(AP);\n\n    double l, r, mid;\n\n    double ansx, ansy, ansz;\n\n    double ans[5], ret[5];\n\n    l = 0, r = 1;\n\n    double vy, vz;\n\n    while (l + eps < r) {\n\n      mid = (l + r) / 2.0;\n\n      point X = A + abs(lap) * mid * unit(lap);\n\n      double radiusX = abs(lap) * mid * sin(a / 2);\n\n      Circle CX = Circle(X, radiusX);\n\n      point Y, Z, Z2;\n\n      Y = solve(X, radiusX, b / 2, BP);\n\n      Z = solve(X, radiusX, c / 2, CP);\n\n      double radiusY = abs(B - Y) * sin(b / 2);\n\n      Z2 = solve(Y, radiusY, c / 2, CP);\n\n      if (abs(Z2 - C) < abs(Z - C)) {\n\n        Z = Z2;\n\n        l = mid;\n\n      }\n\n      else {\n\n        r = mid;\n      }\n\n      double radiusZ = abs(C - Z) * sin(c / 2);\n\n      ansx = radiusX;\n\n      ansy = radiusY;\n\n      ansz = radiusZ;\n    }\n\n    ans[0] = ansx, ans[1] = ansy, ans[2] = ansz;\n\n    for (int i = 0; i < 3; i++) {\n\n      if (p[i] == q[0]) {\n\n        ret[0] = ans[i];\n\n      }\n\n      else if (p[i] == q[1]) {\n\n        ret[1] = ans[i];\n\n      }\n\n      else if (p[i] == q[2]) {\n\n        ret[2] = ans[i];\n      }\n    }\n\n    printf(\"%f %f %f\\n\", ret[0], ret[1], ret[2]);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cmath>\n\nint main() {\n\n  double x1, x2, x3;\n\n  double y1, y2, y3;\n\n  double a, b, c;\n\n  double r1, r2, r3;\n\n  double d, e, f;\n\n  double r, s;\n\n  double ix, iy;\n\n  scanf(\"%lf %lf\", &x1, &y1);\n\n  scanf(\"%lf %lf\", &x2, &y2);\n\n  scanf(\"%lf %lf\", &x3, &y3);\n\n  while (x1 != 0 || x2 != 0 || x3 != 0 ||\n\n         y1 != 0 || y2 != 0 || y3 != 0) {\n\n    c = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n\n    a = sqrt((x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3));\n\n    b = sqrt((x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1));\n\n    s = (a + b + c) / 2;\n\n    ix = (a * x1 + b * x2 + c * x3) / (a + b + c);\n\n    iy = (a * y1 + b * y2 + c * y3) / (a + b + c);\n\n    d = sqrt((ix - x1) * (ix - x1) + (iy - y1) * (iy - y1));\n\n    e = sqrt((ix - x2) * (ix - x2) + (iy - y2) * (iy - y2));\n\n    f = sqrt((ix - x3) * (ix - x3) + (iy - y3) * (iy - y3));\n\n    r = sqrt(s * (s - a) * (s - b) * (s - c)) / s;\n\n    r1 = r * (s - r + d - e - f) / (2 * (s - a));\n\n    r2 = r * (s - r - d + e - f) / (2 * (s - b));\n\n    r3 = r * (s - r - d - e + f) / (2 * (s - c));\n\n    printf(\"%lf %lf %lf\\n\", r1, r2, r3);\n\n    scanf(\"%lf %lf\", &x1, &y1);\n\n    scanf(\"%lf %lf\", &x2, &y2);\n\n    scanf(\"%lf %lf\", &x3, &y3);\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"27a7d9aef74180f2e7776c594dc6dee08c878a8e4866f3dc4cac1c756f3a3e01","fast_id":"fb181858ebc128a49a357c6c1e773e0dca26edfdd514ec031517584bb34665ad","fast_time":0.0010486427,"language":"cpp","measured_fast_code_id":"fb181858ebc128a49a357c6c1e773e0dca26edfdd514ec031517584bb34665ad","measured_slow_code_id":"365b988883df553a07eae4e1b85e5dc4fa82ce76da8a46d921a9398318a8c5f3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73726","problem_id":"p02813","slow_code_id":"a47b563ae26b4630c7ed0b88d41b35e5822fc8cc6a5b08749bcbb06d9d77db42","slow_id":"365b988883df553a07eae4e1b85e5dc4fa82ce76da8a46d921a9398318a8c5f3","slow_time":0.0036160227,"speedup":3.4482886306269998,"stratum":"2-4","sampling_key":"c07310141f226540988b52e6ad725f0556c9721abf0ce142988328443cc1d53e","slow_code":"#include <stdio.h>\n\n#include <sstream>\n\n#include <string.h>\n\n#include <vector>\n\n#include <map>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <set>\n\n#include <cctype>\n\n#include <queue>\n\n#include <stack>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <deque>\n\n#include <limits>\n\n#include <iomanip>\n\n#include <ctype.h>\n\n#include <unordered_map>\n\n#include <random>\n\n#include <numeric>\n\n#include <iostream>\n\n#include <array>\n\n#define _USE_MATH_DEFINES\n\n#include <iostream>\n\n#include <math.h>\n\nusing namespace std;\n\n#define REP(x, n) for (int x = 0; x < n; x++)\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<int, char> pic;\n\nint dx[] = {-1, 0, 1, 0};\n\nint dy[] = {0, -1, 0, 1};\n\n#define bit(x, v) ((ll)x << v)\n\nconst ll INF = 1000000007;\n\nconst int MAX = 1000010;\n\nconst int MOD = 1000000007;\n\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid COMinit() {\n\n  fac[0] = fac[1] = 1;\n\n  finv[0] = finv[1] = 1;\n\n  inv[1] = 1;\n\n  for (int i = 2; i < MAX; i++) {\n\n    fac[i] = fac[i - 1] * i % MOD;\n\n    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n\n    finv[i] = finv[i - 1] * inv[i] % MOD;\n  }\n}\n\nlong long COM(int n, int k) {\n\n  if (n < k)\n    return 0;\n\n  if (n < 0 || k < 0)\n    return 0;\n\n  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nll gcd(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  return gcd(b, a % b);\n}\n\nint pr[100010];\n\nvoid uini(int n) {\n\n  for (size_t i = 0; i <= n; i++)\n\n  {\n\n    pr[i] = i;\n  }\n}\n\nint parent(int x) {\n\n  if (x == pr[x])\n    return x;\n\n  return pr[x] = parent(pr[x]);\n}\n\nint same(int x, int y) { return parent(x) == parent(y); }\n\nbool unit(int x, int y) {\n\n  int px = parent(x);\n\n  int py = parent(y);\n\n  if (px == py)\n    return false;\n\n  if (px < py) {\n\n    pr[py] = px;\n\n  }\n\n  else {\n\n    pr[px] = py;\n  }\n\n  return true;\n}\n\nll bit[200010];\n\nint max_n = 200000;\n\nint pm = 0;\n\nvoid add(int x) {\n\n  while (max_n >= x)\n\n  {\n\n    bit[x]++;\n\n    x += x & -x;\n  }\n}\n\nvoid sub(int x) {\n\n  while (max_n >= x)\n\n  {\n\n    bit[x]--;\n\n    x += x & -x;\n  }\n}\n\nll merge(ll *a, int left, int mid, int right) {\n\n  ll n1 = mid - left;\n\n  ll n2 = right - mid;\n\n  vector<int> L(n1 + 1);\n\n  vector<int> R(n2 + 1);\n\n  for (size_t i = 0; i < n1; i++)\n\n  {\n\n    L[i] = a[left + i];\n  }\n\n  for (size_t i = 0; i < n2; i++)\n\n  {\n\n    R[i] = a[mid + i];\n  }\n\n  L[n1] = INF;\n\n  R[n2] = INF;\n\n  ll i = 0;\n\n  ll j = 0;\n\n  ll r = 0;\n\n  for (size_t k = left; k < right; k++)\n\n  {\n\n    if (L[i] <= R[j]) {\n\n      a[k] = L[i];\n\n      i++;\n\n    }\n\n    else {\n\n      a[k] = R[j];\n\n      r += n1 - i;\n\n      j++;\n    }\n  }\n\n  return r;\n}\n\nll merge2(pair<int, char> *a, int left, int mid, int right) {\n\n  ll n1 = mid - left;\n\n  ll n2 = right - mid;\n\n  vector<pair<int, char>> L(n1 + 1);\n\n  vector<pair<int, char>> R(n2 + 1);\n\n  for (size_t i = 0; i < n1; i++)\n\n  {\n\n    L[i] = a[left + i];\n  }\n\n  for (size_t i = 0; i < n2; i++)\n\n  {\n\n    R[i] = a[mid + i];\n  }\n\n  L[n1] = make_pair(INF, ' ');\n\n  R[n2] = make_pair(INF, ' ');\n\n  ll i = 0;\n\n  ll j = 0;\n\n  ll r = 0;\n\n  for (size_t k = left; k < right; k++)\n\n  {\n\n    if (L[i].first <= R[j].first) {\n\n      a[k] = L[i];\n\n      i++;\n\n    }\n\n    else {\n\n      a[k] = R[j];\n\n      r += n1 - i;\n\n      j++;\n    }\n  }\n\n  return r;\n}\n\nll mergeSort2(pair<int, char> *a, int left, int right) {\n\n  ll res = 0;\n\n  if (left + 1 < right) {\n\n    int mid = (left + right) / 2;\n\n    res = mergeSort2(a, left, mid);\n\n    res += mergeSort2(a, mid, right);\n\n    res += merge2(a, left, mid, right);\n  }\n\n  return res;\n}\n\nll mergeSort(ll *a, int left, int right) {\n\n  ll res = 0;\n\n  if (left + 1 < right) {\n\n    int mid = (left + right) / 2;\n\n    res = mergeSort(a, left, mid);\n\n    res += mergeSort(a, mid, right);\n\n    res += merge(a, left, mid, right);\n  }\n\n  return res;\n}\n\nint partition(pair<int, char> *a, int p, int r) {\n\n  pair<int, char> x = a[r];\n\n  int i = p - 1;\n\n  for (size_t j = p; j < r; j++)\n\n  {\n\n    if (a[j].first <= x.first) {\n\n      i++;\n\n      swap(a[i], a[j]);\n    }\n  }\n\n  swap(a[i + 1], a[r]);\n\n  return i + 1;\n}\n\nvoid quick(pair<int, char> *a, int p, int r) {\n\n  if (p < r) {\n\n    int q = partition(a, p, r);\n\n    quick(a, p, q - 1);\n\n    quick(a, q + 1, r);\n  }\n}\n\nll n;\n\nint ci = 0;\n\nll P[1000010];\n\nstruct Node {\n\n  int key;\n\n  int priority;\n\n  Node *parent, *left, *right;\n\n  Node(int key, int priority);\n\n  Node() {}\n};\n\nNode NIL;\n\nNode::Node(int key, int priority) : key(key), priority(priority) {\n\n  left = &NIL;\n\n  right = &NIL;\n}\n\nNode *root = new Node();\n\nvoid cenrec(Node *k) {\n\n  if (k->key == NIL.key)\n    return;\n\n  cenrec(k->left);\n\n  cout << \" \" << k->key;\n\n  cenrec(k->right);\n}\n\nvoid fastrec(Node *k)\n\n{\n\n  if (k->key == NIL.key)\n    return;\n\n  cout << \" \" << k->key;\n\n  fastrec(k->left);\n\n  fastrec(k->right);\n}\n\nvoid insert(Node *v) {\n\n  Node *y = &NIL;\n\n  Node *x = root;\n\n  while (x->key != NIL.key)\n\n  {\n\n    y = x;\n\n    if (v->key < x->key) {\n\n      x = x->left;\n\n    }\n\n    else {\n\n      x = x->right;\n    }\n  }\n\n  v->parent = y;\n\n  if (y->key == NIL.key) {\n\n    root = v;\n\n  }\n\n  else if (v->key < y->key) {\n\n    y->left = v;\n\n  }\n\n  else {\n\n    y->right = v;\n  }\n}\n\nNode *find(Node *k, ll v)\n\n{\n\n  if (k->key == NIL.key)\n    return &NIL;\n\n  if (k->key == v)\n    return k;\n\n  if (v < k->key)\n    return find(k->left, v);\n\n  return find(k->right, v);\n}\n\nvoid delp12(Node *x) {\n\n  if (x->key == NIL.key)\n    return;\n\n  Node *l = x->left;\n\n  Node *r = x->right;\n\n  Node *pr = x->parent;\n\n  if (l->key == NIL.key\n\n      && r->key == NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = &NIL;\n\n    }\n\n    else\n      pr->right = &NIL;\n\n  }\n\n  else if (l->key != NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = l;\n\n    }\n\n    else\n      pr->right = l;\n\n    l->parent = pr;\n\n  }\n\n  else if (r->key != NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = r;\n\n    }\n\n    else\n      pr->right = r;\n\n    r->parent = pr;\n  }\n}\n\nNode *get_next(Node *k) {\n\n  if (k->key == NIL.key)\n    return &NIL;\n\n  Node *res = get_next(k->left);\n\n  if (res->key != NIL.key)\n    return res;\n\n  return k;\n}\n\nvoid del(Node *x) {\n\n  if (x->key == NIL.key)\n    return;\n\n  Node *l = x->left;\n\n  Node *r = x->right;\n\n  Node *pr = x->parent;\n\n  if (l->key != NIL.key && r->key != NIL.key) {\n\n    Node *nex = get_next(r);\n\n    x->key = nex->key;\n\n    delp12(nex);\n\n  }\n\n  else {\n\n    delp12(x);\n  }\n}\n\nNode *rightRotate(Node *t) {\n\n  Node *s = t->left;\n\n  t->left = s->right;\n\n  s->right = t;\n\n  return s;\n}\n\nNode *leftRotate(Node *t) {\n\n  Node *s = t->right;\n\n  t->right = s->left;\n\n  s->left = t;\n\n  return s;\n}\n\nNode *_insert(Node *t, int key, int priority) {\n\n  if (t->key == NIL.key) {\n\n    return new Node(key, priority);\n  }\n\n  if (key == t->key) {\n\n    return t;\n  }\n\n  if (key < t->key) {\n\n    t->left = _insert(t->left, key, priority);\n\n    if (t->priority < t->left->priority) {\n\n      t = rightRotate(t);\n    }\n\n  }\n\n  else {\n\n    t->right = _insert(t->right, key, priority);\n\n    if (t->priority < t->right->priority) {\n\n      t = leftRotate(t);\n    }\n  }\n\n  return t;\n}\n\nNode *delete1(Node *t, int key);\n\nNode *_delete(Node *t, int key) {\n\n  if (t->left->key == NIL.key && t->right->key == NIL.key) {\n\n    return &NIL;\n\n  }\n\n  else if (t->left->key == NIL.key) {\n\n    t = leftRotate(t);\n\n  }\n\n  else if (t->right->key == NIL.key) {\n\n    t = rightRotate(t);\n\n  }\n\n  else\n\n  {\n\n    if (t->left->priority > t->right->priority) {\n\n      t = rightRotate(t);\n\n    }\n\n    else\n\n      t = leftRotate(t);\n  }\n\n  return delete1(t, key);\n}\n\nNode *delete1(Node *t, int key) {\n\n  if (t->key == NIL.key) {\n\n    return &NIL;\n  }\n\n  if (key < t->key) {\n\n    t->left = delete1(t->left, key);\n\n  }\n\n  else if (key > t->key) {\n\n    t->right = delete1(t->right, key);\n\n  }\n\n  else\n    return _delete(t, key);\n\n  return t;\n}\n\nint H;\n\nint left(int i) { return i * 2 + 1; }\n\nint right(int i) { return i * 2 + 2; }\n\nstruct edge {\n\n  int from, to;\n\n  ll val;\n\n  edge(int from, int to, ll val) : from(from), to(to), val(val) {}\n};\n\nint k;\n\nint _rank[1010];\n\nint temp[1010];\n\nbool compare_sa(int i, int j) {\n\n  if (_rank[i] != _rank[j])\n    return _rank[i] < _rank[j];\n\n  else {\n\n    int ri = i + k <= n ? _rank[i + k] : -1;\n\n    int rj = j + k <= n ? _rank[j + k] : -1;\n\n    return ri < rj;\n  }\n}\n\nvoid construct_sa(string S, int *sa) {\n\n  n = S.length();\n\n  for (size_t i = 0; i <= n; i++)\n\n  {\n\n    sa[i] = i;\n\n    _rank[i] = i < n ? S[i] : -1;\n  }\n\n  for (k = 1; k <= n; k *= 2)\n\n  {\n\n    sort(sa, sa + n + 1, compare_sa);\n\n    temp[sa[0]] = 0;\n\n    for (size_t i = 1; i <= n; i++)\n\n    {\n\n      temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\n    }\n\n    for (size_t i = 0; i <= n; i++)\n\n    {\n\n      _rank[i] = temp[i];\n    }\n  }\n}\n\nbool contain(string S, int *sa, string T) {\n\n  int a = 0, b = S.length();\n\n  while (b - a > 1) {\n\n    int c = (a + b) / 2;\n\n    if (S.compare(sa[c], T.length(), T) < 0)\n      a = c;\n\n    else\n      b = c;\n  }\n\n  return S.compare(sa[b], T.length(), T) == 0;\n}\n\n#define bit(x, v) ((ll)x << v)\n\nclass BIT {\n\n  static const int MAX_N = 400010;\n\npublic:\n  BIT() { memset(bit, 0, sizeof(bit)); }\n\n  ll bit[MAX_N + 1], n;\n\n  ll sum(int i) {\n\n    ll s = 0;\n\n    while (i > 0)\n\n    {\n\n      s += bit[i];\n\n      i -= i & -i;\n    }\n\n    return s;\n  }\n\n  void add(int i, int x) {\n\n    while (i <= n)\n\n    {\n\n      bit[i] += x;\n\n      i += i & -i;\n    }\n  }\n};\n\nstruct UnionFind {\n\n  vector<int> A;\n\n  UnionFind(int n) : A(n, -1) {}\n\n  int find(int x) {\n\n    if (A[x] < 0)\n      return x;\n\n    return A[x] = find(A[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x), y = find(y);\n\n    if (x == y)\n      return;\n\n    if (A[x] > A[y])\n      swap(x, y);\n\n    A[x] += A[y];\n\n    A[y] = x;\n  }\n\n  int ngroups() {\n\n    int ans = 0;\n\n    for (auto a : A)\n      if (a < 0)\n        ans++;\n\n    return ans;\n  }\n};\n\nvoid yes() {\n  cout << \"Yes\\n\";\n  exit(0);\n}\n\nvoid no() {\n  cout << \"No\\n\";\n  exit(0);\n}\n\nvector<int> es[100010];\n\nvoid dij(vector<int> &d, int x) {\n\n  fill(d.begin(), d.end(), INF);\n\n  priority_queue<pii, vector<pii>, greater<pii>> q;\n\n  q.push(make_pair(0, x));\n\n  while (!q.empty())\n\n  {\n\n    auto p = q.top();\n\n    q.pop();\n\n    int frm = p.second;\n\n    int co = p.first;\n\n    if (d[frm] <= co)\n      continue;\n\n    d[frm] = co;\n\n    for (auto v : es[frm]) {\n\n      if (d[v] > co + 1)\n\n        q.push(make_pair(co + 1, v));\n    }\n  }\n}\n\nll r, s, p;\n\nll score(char a) {\n\n  if (a == 'r')\n    return p;\n\n  if (a == 's')\n    return r;\n\n  if (a == 'p')\n    return s;\n\n  return 0;\n}\n\nvoid solv() {\n\n  cin >> n;\n\n  ll p[9], q[9];\n\n  for (size_t i = 0; i < n; i++)\n\n  {\n\n    cin >> p[i];\n  }\n\n  for (size_t i = 0; i < n; i++)\n\n  {\n\n    cin >> q[i];\n  }\n\n  ll u = 1;\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    u *= i;\n  }\n\n  ll a = 0;\n\n  ll rp[10];\n\n  memset(rp, 0, sizeof(rp));\n\n  ll b = 0;\n\n  ll rq[10];\n\n  memset(rq, 0, sizeof(rq));\n\n  int t = 0;\n\n  for (ll i = n - 1; i >= 1; i--, t++)\n\n  {\n\n    int cn = 0;\n\n    for (size_t j = 1; j <= n; j++)\n\n    {\n\n      if (j == p[t]) {\n\n        rp[j] = 1;\n        break;\n      }\n\n      if (rp[j] == 0)\n        cn++;\n    }\n\n    a += u * cn;\n\n    int cn2 = 0;\n\n    for (size_t j = 1; j <= n; j++)\n\n    {\n\n      if (j == q[t]) {\n\n        rq[j] = 1;\n        break;\n      }\n\n      if (rq[j] == 0)\n        cn2++;\n    }\n\n    b += u * cn2;\n\n    u /= i;\n  }\n\n  cout << abs(a - b) << endl;\n}\n\nint main() {\n\n  solv();\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <sstream>\n\n#include <iostream>\n\n#include <fstream>\n\n#include <string.h>\n\n#include <vector>\n\n#include <map>\n\n#include <algorithm>\n\n#include <utility>\n\n#include <set>\n\n#include <cctype>\n\n#include <queue>\n\n#include <stack>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <deque>\n\n#include <limits>\n\n#include <iomanip>\n\n#include <ctype.h>\n\n#include <unordered_map>\n\n#include <random>\n\n#include <bitset>\n\n#define _USE_MATH_DEFINES\n\n#include <iostream>\n\n#include <math.h>\n\n#include <complex>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntypedef pair<ll, double> pld;\n\ntypedef pair<double, double> pdd;\n\ntypedef pair<double, ll> pdl;\n\ntypedef pair<int, char> pic;\n\ntypedef vector<ll> vl;\n\ntypedef vector<int> vi;\n\ntypedef complex<double> Point;\n\ntypedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;\n\ntypedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;\n\ntypedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>, greater<pair<ll, pll>>> plpllgreaterq;\n\ntypedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;\n\ntypedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;\n\n#define bit(x, v) ((ll)x << v)\n\n#define rep(x, v) for (int x = 0; x < v; x++)\n\n#define rep2(x, f, v) for (int x = f; x < v; x++)\n\n#define EPS (1e-10)\n\n#define EQ(a, b) (abs((a) - (b)) < EPS)\n\n#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))\n\nconst ll INF = 1000000007;\n\nconst int MAX = 2000010;\n\nconst int MOD = 1000000007;\n\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid COMinit() {\n\n  fac[0] = fac[1] = 1;\n\n  finv[0] = finv[1] = 1;\n\n  inv[1] = 1;\n\n  for (int i = 2; i < MAX; i++) {\n\n    fac[i] = fac[i - 1] * i % MOD;\n\n    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n\n    finv[i] = finv[i - 1] * inv[i] % MOD;\n  }\n}\n\nlong long COM(int n, int k) {\n\n  if (n < k)\n    return 0;\n\n  if (n < 0 || k < 0)\n    return 0;\n\n  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nll gcd(ll a, ll b) {\n\n  if (b == 0)\n    return a;\n\n  return gcd(b, a % b);\n}\n\nint pr[200010];\n\nint lank[200010];\n\nvoid uini(int n) {\n\n  for (size_t i = 0; i <= n; i++)\n\n  {\n\n    pr[i] = i;\n  }\n}\n\nint parent(int x) {\n\n  if (x == pr[x])\n    return x;\n\n  return pr[x] = parent(pr[x]);\n}\n\nint same(int x, int y) { return parent(x) == parent(y); }\n\nbool unit(int x, int y) {\n\n  int px = parent(x);\n\n  int py = parent(y);\n\n  if (px == py)\n    return false;\n\n  if (lank[px] < lank[py]) {\n\n    pr[py] = px;\n\n    lank[px] += lank[py] + 1;\n\n  }\n\n  else {\n\n    pr[px] = py;\n\n    lank[py] += lank[px] + 1;\n  }\n\n  return true;\n}\n\nll bit[200010];\n\nint max_n = 200000;\n\nint pm = 0;\n\nvoid add(int x) {\n\n  while (max_n >= x)\n\n  {\n\n    bit[x]++;\n\n    x += x & -x;\n  }\n}\n\nvoid sub(int x) {\n\n  while (max_n >= x)\n\n  {\n\n    bit[x]--;\n\n    x += x & -x;\n  }\n}\n\nll merge(ll *a, int left, int mid, int right) {\n\n  ll n1 = mid - left;\n\n  ll n2 = right - mid;\n\n  vector<int> L(n1 + 1);\n\n  vector<int> R(n2 + 1);\n\n  for (size_t i = 0; i < n1; i++)\n\n  {\n\n    L[i] = a[left + i];\n  }\n\n  for (size_t i = 0; i < n2; i++)\n\n  {\n\n    R[i] = a[mid + i];\n  }\n\n  L[n1] = INF;\n\n  R[n2] = INF;\n\n  ll i = 0;\n\n  ll j = 0;\n\n  ll r = 0;\n\n  for (size_t k = left; k < right; k++)\n\n  {\n\n    if (L[i] <= R[j]) {\n\n      a[k] = L[i];\n\n      i++;\n\n    }\n\n    else {\n\n      a[k] = R[j];\n\n      r += n1 - i;\n\n      j++;\n    }\n  }\n\n  return r;\n}\n\nll merge2(pair<int, char> *a, int left, int mid, int right) {\n\n  ll n1 = mid - left;\n\n  ll n2 = right - mid;\n\n  vector<pair<int, char>> L(n1 + 1);\n\n  vector<pair<int, char>> R(n2 + 1);\n\n  for (size_t i = 0; i < n1; i++)\n\n  {\n\n    L[i] = a[left + i];\n  }\n\n  for (size_t i = 0; i < n2; i++)\n\n  {\n\n    R[i] = a[mid + i];\n  }\n\n  L[n1] = make_pair(INF, ' ');\n\n  R[n2] = make_pair(INF, ' ');\n\n  ll i = 0;\n\n  ll j = 0;\n\n  ll r = 0;\n\n  for (size_t k = left; k < right; k++)\n\n  {\n\n    if (L[i].first <= R[j].first) {\n\n      a[k] = L[i];\n\n      i++;\n\n    }\n\n    else {\n\n      a[k] = R[j];\n\n      r += n1 - i;\n\n      j++;\n    }\n  }\n\n  return r;\n}\n\nll mergeSort2(pair<int, char> *a, int left, int right) {\n\n  ll res = 0;\n\n  if (left + 1 < right) {\n\n    int mid = (left + right) / 2;\n\n    res = mergeSort2(a, left, mid);\n\n    res += mergeSort2(a, mid, right);\n\n    res += merge2(a, left, mid, right);\n  }\n\n  return res;\n}\n\nll mergeSort(ll *a, int left, int right) {\n\n  ll res = 0;\n\n  if (left + 1 < right) {\n\n    int mid = (left + right) / 2;\n\n    res = mergeSort(a, left, mid);\n\n    res += mergeSort(a, mid, right);\n\n    res += merge(a, left, mid, right);\n  }\n\n  return res;\n}\n\nint partition(pair<int, char> *a, int p, int r) {\n\n  pair<int, char> x = a[r];\n\n  int i = p - 1;\n\n  for (size_t j = p; j < r; j++)\n\n  {\n\n    if (a[j].first <= x.first) {\n\n      i++;\n\n      swap(a[i], a[j]);\n    }\n  }\n\n  swap(a[i + 1], a[r]);\n\n  return i + 1;\n}\n\nvoid quick(pair<int, char> *a, int p, int r) {\n\n  if (p < r) {\n\n    int q = partition(a, p, r);\n\n    quick(a, p, q - 1);\n\n    quick(a, q + 1, r);\n  }\n}\n\nll n;\n\nint ci = 0;\n\nll P[1000010];\n\nstruct Node {\n\n  int key;\n\n  int priority;\n\n  Node *parent, *left, *right;\n\n  Node(int key, int priority);\n\n  Node() {}\n};\n\nNode NIL;\n\nNode::Node(int key, int priority) : key(key), priority(priority) {\n\n  left = &NIL;\n\n  right = &NIL;\n}\n\nNode *root = new Node();\n\nvoid cenrec(Node *k) {\n\n  if (k->key == NIL.key)\n    return;\n\n  cenrec(k->left);\n\n  cout << \" \" << k->key;\n\n  cenrec(k->right);\n}\n\nvoid fastrec(Node *k)\n\n{\n\n  if (k->key == NIL.key)\n    return;\n\n  cout << \" \" << k->key;\n\n  fastrec(k->left);\n\n  fastrec(k->right);\n}\n\nvoid insert(Node *v) {\n\n  Node *y = &NIL;\n\n  Node *x = root;\n\n  while (x->key != NIL.key)\n\n  {\n\n    y = x;\n\n    if (v->key < x->key) {\n\n      x = x->left;\n\n    }\n\n    else {\n\n      x = x->right;\n    }\n  }\n\n  v->parent = y;\n\n  if (y->key == NIL.key) {\n\n    root = v;\n\n  }\n\n  else if (v->key < y->key) {\n\n    y->left = v;\n\n  }\n\n  else {\n\n    y->right = v;\n  }\n}\n\nNode *find(Node *k, ll v)\n\n{\n\n  if (k->key == NIL.key)\n    return &NIL;\n\n  if (k->key == v)\n    return k;\n\n  if (v < k->key)\n    return find(k->left, v);\n\n  return find(k->right, v);\n}\n\nvoid delp12(Node *x) {\n\n  if (x->key == NIL.key)\n    return;\n\n  Node *l = x->left;\n\n  Node *r = x->right;\n\n  Node *pr = x->parent;\n\n  if (l->key == NIL.key\n\n      && r->key == NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = &NIL;\n\n    }\n\n    else\n      pr->right = &NIL;\n\n  }\n\n  else if (l->key != NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = l;\n\n    }\n\n    else\n      pr->right = l;\n\n    l->parent = pr;\n\n  }\n\n  else if (r->key != NIL.key) {\n\n    if (pr->left == x) {\n\n      pr->left = r;\n\n    }\n\n    else\n      pr->right = r;\n\n    r->parent = pr;\n  }\n}\n\nNode *get_next(Node *k) {\n\n  if (k->key == NIL.key)\n    return &NIL;\n\n  Node *res = get_next(k->left);\n\n  if (res->key != NIL.key)\n    return res;\n\n  return k;\n}\n\nvoid del(Node *x) {\n\n  if (x->key == NIL.key)\n    return;\n\n  Node *l = x->left;\n\n  Node *r = x->right;\n\n  Node *pr = x->parent;\n\n  if (l->key != NIL.key && r->key != NIL.key) {\n\n    Node *nex = get_next(r);\n\n    x->key = nex->key;\n\n    delp12(nex);\n\n  }\n\n  else {\n\n    delp12(x);\n  }\n}\n\nNode *rightRotate(Node *t) {\n\n  Node *s = t->left;\n\n  t->left = s->right;\n\n  s->right = t;\n\n  return s;\n}\n\nNode *leftRotate(Node *t) {\n\n  Node *s = t->right;\n\n  t->right = s->left;\n\n  s->left = t;\n\n  return s;\n}\n\nNode *_insert(Node *t, int key, int priority) {\n\n  if (t->key == NIL.key) {\n\n    return new Node(key, priority);\n  }\n\n  if (key == t->key) {\n\n    return t;\n  }\n\n  if (key < t->key) {\n\n    t->left = _insert(t->left, key, priority);\n\n    if (t->priority < t->left->priority) {\n\n      t = rightRotate(t);\n    }\n\n  }\n\n  else {\n\n    t->right = _insert(t->right, key, priority);\n\n    if (t->priority < t->right->priority) {\n\n      t = leftRotate(t);\n    }\n  }\n\n  return t;\n}\n\nNode *delete1(Node *t, int key);\n\nNode *_delete(Node *t, int key) {\n\n  if (t->left->key == NIL.key && t->right->key == NIL.key) {\n\n    return &NIL;\n\n  }\n\n  else if (t->left->key == NIL.key) {\n\n    t = leftRotate(t);\n\n  }\n\n  else if (t->right->key == NIL.key) {\n\n    t = rightRotate(t);\n\n  }\n\n  else\n\n  {\n\n    if (t->left->priority > t->right->priority) {\n\n      t = rightRotate(t);\n\n    }\n\n    else\n\n      t = leftRotate(t);\n  }\n\n  return delete1(t, key);\n}\n\nNode *delete1(Node *t, int key) {\n\n  if (t->key == NIL.key) {\n\n    return &NIL;\n  }\n\n  if (key < t->key) {\n\n    t->left = delete1(t->left, key);\n\n  }\n\n  else if (key > t->key) {\n\n    t->right = delete1(t->right, key);\n\n  }\n\n  else\n    return _delete(t, key);\n\n  return t;\n}\n\nint H;\n\nint left(int i) { return i * 2 + 1; }\n\nint right(int i) { return i * 2 + 2; }\n\ndouble dot(Point a, Point b) { return (a.real() * b.real() + a.imag() * b.imag()); }\n\ndouble cross(Point a, Point b) { return (a.real() * b.imag() - a.imag() * b.real()); }\n\nint is_orthogonal(Point a1, Point a2, Point b1, Point b2) { return EQ(dot(a1 - a2, b1 - b2), 0.0); }\n\nint is_parallel(Point a1, Point a2, Point b1, Point b2) { return EQ(cross(a1 - a2, b1 - b2), 0.0); }\n\nint is_point_on_line(Point a, Point b, Point c) { return EQ(cross(b - a, c - a), 0.0); }\n\nint is_point_on_line1(Point a, Point b, Point c) {\n\n  return EQ(cross(b - a, c - a), 0.0) &&\n\n         (dot(b - a, c - a) > -EPS) &&\n\n         (dot(a - b, c - b) > -EPS);\n}\n\nint is_point_on_line2(Point a, Point b, Point c) {\n\n  return (abs(a - c) + abs(c - b) < abs(a - b) + EPS);\n}\n\ndouble distance_l_p(Point a, Point b, Point c) { return abs(cross(b - a, c - a)) / abs(b - a); }\n\ndouble distance_ls_p(Point a, Point b, Point c) {\n\n  if (dot(b - a, c - a) < EPS)\n    return abs(c - a);\n\n  if (dot(a - b, c - b) < EPS)\n    return abs(c - b);\n\n  return abs(cross(b - a, c - a)) / abs(b - a);\n}\n\nint is_intersected_ls(Point a1, Point a2, Point b1, Point b2) {\n\n  return (cross(a2 - a1, b1 - a1) * cross(a2 - a1, b2 - a1) < EPS) &&\n\n         (cross(b2 - b1, a1 - b1) * cross(b2 - b1, a2 - b1) < EPS);\n}\n\nPoint intersection_ls(Point a1, Point a2, Point b1, Point b2) {\n\n  Point b = b2 - b1;\n\n  double d1 = abs(cross(b, a1 - b1));\n\n  double d2 = abs(cross(b, a2 - b1));\n\n  double t = d1 / (d1 + d2);\n\n  return a1 + (a2 - a1) * t;\n}\n\nint is_intersected_l(Point a1, Point a2, Point b1, Point b2) {\n\n  return !EQ(cross(a1 - a2, b1 - b2), 0.0);\n}\n\nPoint intersection_l(Point a1, Point a2, Point b1, Point b2) {\n\n  Point a = a2 - a1;\n  Point b = b2 - b1;\n\n  return a1 + a * cross(b, b1 - a1) / cross(b, a);\n}\n\npair<Point, Point> intersection_circle(Point p1, Point p2, double r1, double r2) {\n\n  double d = abs(p2 - p1);\n\n  double th = acos((d * d + r1 * r1 - r2 * r2) / (2 * d * r1));\n\n  return make_pair(p1 + polar(r1, arg(p2 - p1) + th), polar(r1, arg(p2 - p1) - th));\n}\n\nll heap[2000010];\n\nvoid maxHeapify(int i) {\n\n  int l = left(i);\n\n  int r = right(i);\n\n  int largest = 0;\n\n  if (l < H && heap[l] > heap[i])\n\n    largest = l;\n\n  else\n\n    largest = i;\n\n  if (r < H && heap[r] > heap[largest])\n\n    largest = r;\n\n  if (largest != i) {\n\n    swap(heap[i], heap[largest]);\n\n    maxHeapify(largest);\n  }\n}\n\nint pare(int i) { return (i - 1) / 2; }\n\nvoid raise(int i) {\n\n  int l = pare(i);\n\n  if (l < 0)\n    return;\n\n  if (heap[l] < heap[i]) {\n\n    swap(heap[i], heap[l]);\n\n    raise(l);\n  }\n}\n\nvoid minHeapify(int i) {\n\n  int l = left(i);\n\n  int r = right(i);\n\n  int minimam = 0;\n\n  if (l < H && heap[l] < heap[i])\n\n    minimam = l;\n\n  else\n\n    minimam = i;\n\n  if (r < H && heap[r] < heap[minimam])\n\n    minimam = r;\n\n  if (minimam != i) {\n\n    swap(heap[i], heap[minimam]);\n\n    minHeapify(minimam);\n  }\n}\n\nvoid buildMaxHeap() {\n\n  for (int i = H / 2; i >= 0; i--)\n\n  {\n\n    maxHeapify(i);\n  }\n}\n\nint dx[] = {-1, 0, 1, 0};\n\nint dy[] = {0, -1, 0, 1};\n\nstd::vector<int> find_all(const std::string str, const std::string subStr) {\n\n  std::vector<int> result;\n\n  int subStrSize = subStr.size();\n\n  int pos = str.find(subStr);\n\n  while (pos != std::string::npos) {\n\n    result.push_back(pos);\n\n    pos = str.find(subStr, pos + 1);\n  }\n\n  return result;\n}\n\n#define bit(x, v) ((ll)x << v)\n\nclass BIT {\n\n  static const int MAX_N = 1000010;\n\npublic:\n  BIT() { memset(bit, 0, sizeof(bit)); }\n\n  int bit[MAX_N + 1], n;\n\n  int sum(int i) {\n\n    int s = 0;\n\n    while (i > 0)\n\n    {\n\n      s += bit[i];\n\n      i -= i & -i;\n    }\n\n    return s;\n  }\n\n  void add(int i, int x) {\n\n    while (i <= n)\n\n    {\n\n      bit[i] += x;\n\n      i += i & -i;\n    }\n  }\n\n  void clear() { memset(bit, 0, sizeof(bit)); }\n\n  int a[MAX_N];\n\n  void bable_swap_count() {\n\n    ll ans = 0;\n\n    for (size_t j = 0; j < n; j++)\n\n    {\n\n      ans += j - sum(a[j]);\n\n      add(a[j], 1);\n    }\n\n    printf(\"%lld\\n\", ans);\n  }\n\n  int search(int s, int x) {\n\n    ll half = (s + x) / 2;\n\n    ll sh = sum(x);\n\n    ll sl = sum(half);\n\n    ll st = sum(s);\n\n    if (sh - sl == 0) {\n\n      return x;\n    }\n\n    if (sh - sl < x - half) {\n\n      return search(half, x);\n    }\n\n    if (sl - st == 0) {\n\n      return half;\n    }\n\n    if (sl - st < half - s) {\n\n      return search(s, half);\n    }\n\n    return -1;\n  }\n\n  int lankSearch(int lank) { return lankSearch(lank, 0, MAX_N); }\n\n  int lankSearch(int lank, int s, int t) {\n\n    ll half = (s + t) / 2;\n\n    ll v = sum(half);\n\n    ll v1 = sum(t);\n\n    ll v2 = sum(s);\n\n    if (lank == 1) {\n\n      if (s + 1 >= t)\n        return t;\n\n      else if (v - v2 > 0) {\n\n        return lankSearch(lank, s, half);\n\n      }\n\n      else\n        return lankSearch(lank, half, t);\n    }\n\n    if ((v - v2) < lank) {\n\n      return lankSearch(lank - (v - v2), half, t);\n    }\n\n    if ((v - v2) >= lank) {\n\n      return lankSearch(lank, s, half);\n    }\n\n    return -1;\n  }\n};\n\nclass BIT2 {\n\n  static const int MAX_N = 1000010;\n\npublic:\n  BIT2() { memset(bit, 0, sizeof(bit)); }\n\n  ll bit[MAX_N + 1], n;\n\n  ll gmax(int i) {\n\n    ll s = 0;\n\n    while (i > 0)\n\n    {\n\n      s = max(bit[i], s);\n\n      i -= i & -i;\n    }\n\n    return s;\n  }\n\n  void add(int i, ll x) {\n\n    while (i <= n)\n\n    {\n\n      bit[i] = max(bit[i], x);\n\n      i += i & -i;\n    }\n  }\n\n  void clear() { memset(bit, 0, sizeof(bit)); }\n};\n\nvector<ll> getp(ll n) {\n\n  vector<ll> res;\n\n  ll a = 2;\n\n  if (n % 2 == 0) {\n\n    res.push_back(2);\n\n    while (n % 2 == 0)\n      n /= 2;\n  }\n\n  for (ll i = 3; i * i <= n; i += 2)\n\n  {\n\n    if (n % i == 0) {\n\n      res.push_back(i);\n\n      while (n % i == 0)\n        n /= i;\n    }\n  }\n\n  if (n != 1)\n    res.push_back(n);\n\n  return res;\n}\n\nvector<ll> getp2(ll n) {\n\n  vector<ll> res;\n\n  ll a = 2;\n\n  if (n % 2 == 0) {\n\n    while (n % 2 == 0) {\n      n /= 2;\n      res.push_back(2);\n    }\n  }\n\n  for (ll i = 3; i * i <= n; i += 2)\n\n  {\n\n    if (n % i == 0) {\n\n      while (n % i == 0) {\n        n /= i;\n        res.push_back(i);\n      }\n    }\n  }\n\n  if (n != 1)\n    res.push_back(n);\n\n  return res;\n}\n\nvector<pll> getp3(ll n) {\n\n  vector<pll> res;\n\n  ll a = 2;\n\n  int cnt = 0;\n\n  if (n % 2 == 0) {\n\n    res.push_back(make_pair(2, 0));\n\n    while (n % 2 == 0) {\n      n /= 2;\n      res[cnt].second++;\n    }\n\n    cnt++;\n  }\n\n  for (ll i = 3; i * i <= n; i += 2)\n\n  {\n\n    if (n % i == 0) {\n\n      res.push_back(make_pair(n, 0));\n\n      while (n % i == 0) {\n        n /= i;\n        res[cnt].second++;\n      }\n\n      cnt++;\n    }\n  }\n\n  if (n != 1)\n    res.push_back(make_pair(n, 1));\n\n  return res;\n}\n\nvector<ll> getDivisors(ll n) {\n\n  vector<ll> res;\n\n  ll a = 2;\n\n  res.push_back(1);\n\n  for (ll i = 2; i * i <= n; i++)\n\n  {\n\n    if (n % i == 0) {\n\n      res.push_back(i);\n\n      if (n / i != i)\n\n        res.push_back(n / i);\n    }\n  }\n\n  return res;\n}\n\nstruct ve {\n\npublic:\n  vector<ve> child;\n\n  int _t = INF;\n\n  ve(int t) : _t(t) {}\n\n  ve(ve _left, ve _right) {\n\n    _t = _left._t + _right._t;\n\n    child.push_back(_left);\n\n    child.push_back(_right);\n  }\n\n  bool operator<(const ve &t) const { return _t > t._t; }\n};\n\nvector<bool> elas(ll n) {\n\n  vector<bool> r(n);\n\n  for (ll i = 3; i < n; i += 2)\n\n  {\n\n    r[i] = 1;\n  }\n\n  r[0] = 0;\n\n  r[1] = 0;\n\n  r[2] = 1;\n\n  for (ll i = 3; i * i < n; i += 2)\n\n  {\n\n    if (!r[i])\n      continue;\n\n    ll ti = i * 2;\n\n    while (ti < n)\n\n    {\n\n      r[ti] = false;\n\n      ti += i;\n    }\n  }\n\n  return r;\n}\n\nbool isprime(ll v) {\n\n  for (ll i = 2; i * i <= v; i++)\n\n  {\n\n    if (v % i == 0)\n      return false;\n  }\n\n  return true;\n}\n\nll lcm(vector<ll> v) {\n\n  if (v.size() == 0)\n    return 0;\n\n  ll t = v[0];\n\n  for (size_t i = 1; i < v.size(); i++)\n\n  {\n\n    t = v[i] * t / gcd(v[i], t);\n  }\n\n  return t;\n}\n\nll eulerphi(ll n) {\n\n  auto p = getp(n);\n\n  double u = n;\n\n  for (auto v : p) {\n\n    u *= (double)(v - 1) / (double)v;\n  }\n\n  return u;\n}\n\ndouble revs(double x) {\n\n  ll dig = 0;\n\n  stringstream st;\n\n  st << std::fixed << setprecision(0) << x;\n\n  string v = st.str();\n\n  reverse(v.begin(), v.end());\n\n  return stod(v);\n}\n\nbool chkparindrome(double x) {\n\n  stringstream st;\n\n  st << std::fixed << setprecision(0) << x;\n\n  string p = st.str();\n\n  for (size_t i = 0; i < p.size() / 2; i++)\n\n  {\n\n    if (p[i] != p[p.size() - i - 1]) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\nll digitC(double x) {\n\n  stringstream st;\n\n  st << fixed << setprecision(0) << x;\n\n  return st.str().size();\n}\n\nll digitSum(double x) {\n\n  stringstream st;\n\n  st << std::fixed << x;\n\n  string p = st.str();\n\n  ll rs = 0;\n\n  for (size_t i = 0; i < p.size(); i++)\n\n  {\n\n    if (p[i] == '.')\n      break;\n\n    rs += p[i] - '0';\n  }\n\n  return rs;\n}\n\npdd recs(int x) {\n\n  if (x == 0)\n    return make_pair(1, 2);\n\n  pdd d = recs(x - 1);\n\n  auto nu = d.second * 2.0 + d.first;\n\n  auto de = d.second;\n\n  return make_pair(de, nu);\n}\n\nll caldig(ll a) {\n\n  ll r = 0;\n\n  while (a > 0) {\n    a /= 10;\n    r++;\n  }\n\n  return r;\n}\n\nint chav(char v) {\n\n  if (v <= 'Z')\n    return v - 'A';\n\n  return v - 'a' + 26;\n}\n\nchar itoch(int i) {\n\n  if (i < 26)\n    return i + 'A';\n\n  return (i - 26) + 'a';\n}\n\nint crmp[1000][1000];\n\nint countR(ll base, ll x, ll y, int deep) {\n\n  if (~crmp[x][y]) {\n\n    return deep - crmp[x][y];\n  }\n\n  crmp[x][y] = deep;\n\n  double nu = sqrt(base) + x;\n\n  double de = (base - (x * x)) / y;\n\n  ll u = nu / de;\n\n  ll nx = x - (u * de);\n\n  return countR(base, -nx, de, deep + 1);\n}\n\nbool isPermutation(ll x, ll y) {\n\n  int c1[10];\n\n  int c2[10];\n\n  memset(c1, 0, sizeof(c1));\n\n  memset(c2, 0, sizeof(c2));\n\n  while (x > 0)\n\n  {\n\n    c1[x % 10]++;\n\n    x /= 10;\n  }\n\n  while (y > 0)\n\n  {\n\n    c2[y % 10]++;\n\n    y /= 10;\n  }\n\n  for (size_t i = 0; i < 10; i++)\n\n  {\n\n    if (c1[i] != c2[i])\n      return false;\n  }\n\n  return true;\n}\n\ndouble heron(ll a, ll b, ll c) {\n\n  double s = (double)(a + b + c) / 2.0;\n\n  return sqrt(s * (s - a) * (s - b) * (s - c));\n}\n\ndouble calcThreePS(double x1, double y1, double x2, double y2, double x3, double y3) {\n\n  return abs((x1 * y2 + x2 * y3 + x3 * y1 - y1 * x2 - y2 * x3 - y3 * x1) / 2.0);\n}\n\ntypedef vector<vl> mat;\n\nclass Matrix1 {\n\npublic:\n  static const int M = INF;\n\n  int n;\n\n  mat mul(mat &A, mat &B) {\n\n    mat C(A.size(), vl(B[0].size()));\n\n    for (size_t i = 0; i < A.size(); i++)\n\n    {\n\n      for (size_t k = 0; k < B.size(); k++)\n\n      {\n\n        for (size_t j = 0; j < B[0].size(); j++)\n\n        {\n\n          C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % M;\n        }\n      }\n    }\n\n    return C;\n  }\n\n  mat pow(mat A, ll n) {\n\n    mat B(A.size(), vl(A.size()));\n\n    for (size_t i = 0; i < A.size(); i++)\n\n    {\n\n      B[i][i] = 1;\n    }\n\n    while (n > 0) {\n\n      if (n & 1)\n        B = mul(B, A);\n\n      A = mul(A, A);\n\n      n >>= 1;\n    }\n\n    return B;\n  }\n};\n\nll m;\n\nll stringDivRm(string s, ll k) {\n\n  ll v = 0;\n\n  for (size_t i = 0; i < s.size(); i++)\n\n  {\n\n    v *= 10;\n\n    v += s[i] - '0';\n\n    v %= k;\n  }\n\n  return v;\n}\n\nll repPow(ll b, ll x) {\n\n  ll res = 1;\n\n  ll v = b;\n\n  while (x > 0)\n\n  {\n\n    if (x & 1) {\n\n      res *= v;\n\n      res %= INF;\n    }\n\n    v *= v;\n\n    v %= INF;\n\n    x >>= 1;\n  }\n\n  return res;\n}\n\nvoid solv() {\n\n  cin >> n;\n\n  int p[10], q[10];\n\n  for (size_t i = 0; i < n; i++)\n\n  {\n\n    cin >> p[i];\n  }\n\n  for (size_t i = 0; i < n; i++)\n\n  {\n\n    cin >> q[i];\n  }\n\n  int tr[10];\n\n  for (size_t i = 0; i < n; i++)\n\n  {\n\n    tr[i] = i + 1;\n  }\n\n  int a = 0;\n\n  int b = 0;\n\n  int u = 1;\n\n  do {\n\n    bool ok = true;\n\n    for (size_t i = 0; i < n && ok; i++)\n\n    {\n\n      if (tr[i] != p[i])\n        ok = false;\n    }\n\n    if (ok)\n      a = u;\n\n    ok = true;\n\n    for (size_t i = 0; i < n && ok; i++)\n\n    {\n\n      if (tr[i] != q[i])\n        ok = false;\n    }\n\n    if (ok)\n      b = u;\n\n    u++;\n\n  } while (next_permutation(tr, tr + n));\n\n  cout << abs(a - b) << endl;\n}\n\nint main() {\n\n  solv();\n\n  return 0;\n}\n"}
{"fast_code_id":"b34db9fa2454328439117da7c7e12c9e2d42fd90c1e345908aca062ad2c6b468","fast_id":"9e6aa86dd8ee78f7aefb5350c28cfc46c5083ad71498c3a7e9914ba28ba5c77d","fast_time":0.0002330414,"language":"cpp","measured_fast_code_id":"9e6aa86dd8ee78f7aefb5350c28cfc46c5083ad71498c3a7e9914ba28ba5c77d","measured_slow_code_id":"a67f9eaddfcd18e87a0d642badb97a27d343c01695c245a0fe9759b95cf68e71","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73727","problem_id":"p00911","slow_code_id":"a6b3fa7010be5c022f82c311ef14091bdc13a1787ff4372ce3303ad57e38b77a","slow_id":"a67f9eaddfcd18e87a0d642badb97a27d343c01695c245a0fe9759b95cf68e71","slow_time":0.0010232994,"speedup":4.391062703880083,"stratum":"4-8","sampling_key":"b6042dd0875b5200ced56d871da76e13f387cbabe46fb557d2ab868ab81ce261","slow_code":"#include <cstring>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string>\n\n#include <iostream>\n\nusing namespace std;\n\nconst int MAXN = 1e4 + 10;\n\nconst int MAXG = 110;\n\nint n, m;\n\nint x[MAXN], op[MAXN], y[MAXN];\n\nint f[MAXG][MAXG], g[MAXG][MAXG];\n\nbool vis[MAXG];\n\nvoid dfs(int u) {\n\n  int i, k;\n\n  vis[u] = 1;\n\n  for (i = 1; i <= n; i++)\n\n    if (g[u][i]) {\n\n      if (!vis[i])\n        dfs(i);\n\n      for (k = 1; k <= n; k++)\n\n        if (f[i][k])\n\n          f[u][k] = f[k][u] = 1;\n    }\n}\n\nbool check(int mid) {\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n      f[i][j] = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    for (int j = 1; j <= n; j++)\n      g[i][j] = 0;\n\n    g[i][i] = 1;\n  }\n\n  for (int Q = 1; Q <= mid; Q++) {\n\n    int i = x[Q], j = y[Q], ope = op[Q];\n\n    if (ope == 1)\n      g[i][j] = 1;\n\n    else if (ope == 2)\n      g[i][j] = g[j][i] = 1;\n\n    else if (ope == 4)\n      f[i][j] = f[j][i] = 1;\n  }\n\n  for (int k = 1; k <= n; k++)\n\n    for (int i = 1; i <= n; i++)\n\n      for (int j = 1; j <= n; j++)\n\n        if (g[i][k] && g[k][j])\n          g[i][j] = 1;\n\n  memset(vis, 0, sizeof(vis));\n\n  for (int i = 1; i <= n; i++)\n\n    if (!vis[i])\n      dfs(i);\n\n  for (int Q = 1; Q <= mid; Q++) {\n\n    int i = x[Q], j = y[Q], ope = op[Q];\n\n    if (ope == 3) {\n\n      if (f[i][i] && f[j][j])\n        return false;\n\n      if (g[i][j] && g[j][i])\n        return false;\n\n    } else if (ope == 5) {\n\n      if (f[i][j] || f[j][i] || f[i][i] || f[j][j])\n        return false;\n    }\n  }\n\n  return true;\n}\n\nint main() {\n\n  while (~scanf(\"%d%d\", &n, &m) && (n + m)) {\n\n    for (int i = 1; i <= m; i++)\n      scanf(\"%d%d%d\", &op[i], &x[i], &y[i]);\n\n    int l = 1, r = m, ans = 0;\n\n    while (l <= r) {\n\n      int mid = l + r >> 1;\n\n      if (check(mid)) {\n\n        ans = mid;\n\n        l = mid + 1;\n\n      } else\n        r = mid - 1;\n    }\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <cctype>\n\nusing namespace std;\n\n#define N 105\n\nint n, m;\n\nstruct query\n\n{\n\n  int id, x, y;\n\n} q[N * N];\n\nbool g[N][N], f[N][N];\n\nbool Q(int x, int y)\n\n{\n\n  for (int i = 1; i <= n; ++i)\n\n    if (g[x][i] && f[y][i] || g[y][i] && f[x][i])\n\n      return 1;\n\n  return 0;\n}\n\nbool check(int V)\n\n{\n\n  int i, j, k, x, y;\n\n  memset(f, 0, sizeof(f));\n\n  memset(g, 0, sizeof(g));\n\n  for (i = 1; i <= n; ++i)\n\n    g[i][i] = 1;\n\n  for (i = 1; i <= V; ++i)\n\n    if (q[i].id <= 2)\n\n    {\n\n      x = q[i].x, y = q[i].y;\n\n      g[x][y] = 1;\n\n      if (q[i].id == 2)\n\n        g[y][x] = 1;\n    }\n\n  for (k = 1; k <= n; ++k)\n\n    for (i = 1; i <= n; ++i)\n      if (g[i][k])\n\n        for (j = 1; j <= n; ++j)\n          if (g[k][j])\n\n            g[i][j] = 1;\n\n  for (i = 1; i <= V; ++i)\n\n    if (q[i].id == 4)\n\n    {\n\n      x = q[i].x, y = q[i].y;\n\n      for (j = 1; j <= n; ++j)\n        if (g[j][x])\n\n          f[j][y] = 1;\n\n      for (j = 1; j <= n; ++j)\n        if (g[j][y])\n\n          f[j][x] = 1;\n    }\n\n  for (i = 1; i <= n; i++)\n    for (j = 1; j <= n; j++)\n      f[i][j] |= f[j][i];\n\n  for (i = 1; i <= V; ++i)\n\n  {\n\n    x = q[i].x, y = q[i].y;\n\n    if (q[i].id == 3)\n\n    {\n\n      if (g[x][y] && g[y][x])\n\n        return 0;\n\n      if (Q(x, x) && Q(y, y))\n\n        return 0;\n\n    }\n\n    else if (q[i].id == 5)\n\n    {\n\n      if (Q(x, x) || Q(y, y) || Q(x, y) || Q(y, x))\n\n        return 0;\n    }\n  }\n\n  return 1;\n}\n\nint main()\n\n{\n\n  while (scanf(\"%d%d\", &n, &m))\n\n  {\n\n    if (n == 0 && m == 0)\n      break;\n\n    for (int i = 1; i <= m; ++i)\n\n      scanf(\"%d%d%d\", &q[i].id, &q[i].x, &q[i].y);\n\n    int top = 1, bot = m, mid;\n\n    while (top < bot)\n\n    {\n\n      mid = top + bot + 1 >> 1;\n\n      if (check(mid))\n\n        top = mid;\n\n      else\n\n        bot = mid - 1;\n    }\n\n    printf(\"%d\\n\", top);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"3661d624afccb033e4f6767e33a54682e02a513af2ec56cd33f9f18e63fe3c7e","fast_id":"0dafea2c5ecc25f1d36f9a6b605927d9c97db3d129c290dc62664d74bbf124b5","fast_time":0.0076870628,"language":"cpp","measured_fast_code_id":"0dafea2c5ecc25f1d36f9a6b605927d9c97db3d129c290dc62664d74bbf124b5","measured_slow_code_id":"818cfb0f59220bc0533ed4d63bbf8b79a14396f90552af4e7fbee72b9a948827","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73733","problem_id":"p00189","slow_code_id":"0c31260072dc4a8162755e4900048dbd32d16595ac63f425aed06ffbe5c6aba0","slow_id":"818cfb0f59220bc0533ed4d63bbf8b79a14396f90552af4e7fbee72b9a948827","slow_time":0.2272481943,"speedup":29.5624219825549,"stratum":"8+","sampling_key":"53cf6215ae2151a83e8d073a9dec3002b55dead86018706965ee7824bed40eab","slow_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\n#define INF 0xfffffff\n\nusing namespace std;\n\nint map[1100][1100];\n\nint main()\n\n{\n\n  int n, m, k, i, j, a, b, c, sum1;\n\n  while (scanf(\"%d\", &n), n)\n\n  {\n\n    for (i = 0; i < 1100; i++)\n\n      for (j = 0; j < 1100; j++)\n\n      {\n\n        map[i][j] = INF;\n\n        map[i][i] = 0;\n      }\n\n    int Max = 0;\n\n    for (i = 0; i < n; i++)\n\n    {\n\n      scanf(\"%d%d%d\", &a, &b, &c);\n\n      Max = max(Max, a);\n\n      Max = max(Max, b);\n\n      map[a][b] = c;\n\n      map[b][a] = c;\n    }\n\n    for (k = 0; k <= Max; k++)\n\n      for (i = 0; i <= Max; i++)\n\n        for (j = 0; j <= Max; j++)\n\n        {\n\n          if (map[i][j] > map[i][k] + map[k][j])\n\n            map[i][j] = map[i][k] + map[k][j];\n        }\n\n    int sum = INF;\n\n    int ans = 0;\n\n    for (i = 0; i <= Max; i++)\n\n    {\n\n      sum1 = 0;\n\n      for (j = 0; j <= Max; j++)\n\n      {\n\n        sum1 += map[i][j];\n      }\n\n      if (sum1 < sum)\n\n      {\n\n        sum = sum1;\n\n        ans = i;\n      }\n    }\n\n    printf(\"%d %d\\n\", ans, sum);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <string.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int t, map[12][12], sum, ans, s, i, j, k, max0, a, b, c;\n\n  while (scanf(\"%d\", &t) && t)\n\n  {\n\n    memset(map, 1, sizeof(map));\n\n    max0 = 0;\n\n    for (i = 0; i < t; i++)\n\n    {\n\n      scanf(\"%d %d %d\", &a, &b, &c);\n\n      map[a][b] = map[b][a] = c;\n\n      max0 = max(max0, max(a, b));\n    }\n\n    for (k = 0; k <= max0; k++)\n\n    {\n\n      for (i = 0; i <= max0; i++)\n\n      {\n\n        for (j = 0; j <= max0; j++)\n\n        {\n\n          map[i][j] = min(map[i][j], map[i][k] + map[k][j]);\n        }\n      }\n    }\n\n    sum = 10000000, ans = 0;\n\n    for (i = 0; i <= max0; i++)\n\n    {\n\n      s = 0;\n\n      for (j = 0; j <= max0; j++)\n\n      {\n\n        if (i != j)\n\n        {\n\n          s += map[i][j];\n        }\n      }\n\n      if (s < sum)\n\n      {\n\n        sum = s;\n\n        ans = i;\n      }\n    }\n\n    printf(\"%d %d\\n\", ans, sum);\n  }\n}"}
{"fast_code_id":"d1ed754ea4b5b3e33ca625a63c0353bb9d609bc69aa0d287d94df190a0d1e278","fast_id":"eaf529c15dfeb2b4ee52530d94f13d98da3017c2a544662041c204370cdad95a","fast_time":0.1067596376,"language":"cpp","measured_fast_code_id":"eaf529c15dfeb2b4ee52530d94f13d98da3017c2a544662041c204370cdad95a","measured_slow_code_id":"1516c8dc046f04c31c09a94a86c4ced81508b0eb41bdd7cfa8b02c59f28364f0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73760","problem_id":"p02860","slow_code_id":"754dd3ac4c793fd1c3f487f1c7d4ede3ea58edfc5acc316d47ab46df566f6c18","slow_id":"1516c8dc046f04c31c09a94a86c4ced81508b0eb41bdd7cfa8b02c59f28364f0","slow_time":1.0053911888,"speedup":9.417334222947943,"stratum":"8+","sampling_key":"2865e778c42e9a68e2ad2523f584547bca4d32e4b3e0affe5bc22dcbe0c31c72","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define mod 1000000007\n\n#define first f\n\n#define second s\n\n#define N 1000000\n\nvector<ll> v(N);\n\nll l, m, n, sum, ans, maximum, minimum, mahakal, a, b, c, t, i, j, k;\n\nll cnt, cnt1, cnt2, cnt3;\n\nstring str, str1, str2;\n\nll arr[N];\n\nint main() {\n\n  cin >> n;\n\n  cin >> str;\n\n  if (n & 1) {\n\n    cout << \"No\" << endl;\n\n    return 0;\n  }\n\n  str1 = str.substr(0, n / 2);\n\n  str2 = str.substr(n / 2, n / 2);\n\n  if (str1 == str2) {\n\n    cout << \"Yes\" << endl;\n\n  }\n\n  else {\n\n    cout << \"No\" << endl;\n  }\n\n  return 0;\n}","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define mod 1000000007\n\n#define fast                                                                   \\\n  ios_base::sync_with_stdio(false);                                            \\\n  cin.tie(NULL);                                                               \\\n  cout.tie(NULL);\n\n#define _it iterator\n\n#define all(_x) _x.begin(), _x.end()\n\n#define f first\n\n#define s second\n\n#define pb push_back\n\nvoid mahakal() {\n\n#ifndef ONLINE_JUDGE\n\n  freopen(\"input.txt\", \"r\", stdin);\n\n  freopen(\"output.txt\", \"w\", stdout);\n\n  freopen(\"error.txt\", \"w\", stderr);\n\n#endif\n}\n\nint main() {\n\n  ll n;\n\n  cin >> n;\n\n  string str;\n\n  cin >> str;\n\n  ll l = 0, r = n - 1;\n\n  if (n == 1 || n % 2 == 1) {\n\n    cout << \"No\" << endl;\n\n    return 0;\n  }\n\n  for (ll i = 0, j = ceil(n / 2.0); j < n; i++, j++) {\n\n    if (str[i] != str[j]) {\n\n      cout << \"No\" << endl;\n\n      return 0;\n    }\n  }\n\n  cout << \"Yes\" << endl;\n\n  return 0;\n}"}
{"fast_code_id":"eb4040db16ba9187d7a44d709699c6f9af4b1c476ec3ae781aa1a52da3a437c9","fast_id":"aa08973ededc58a970c5ba2db7a8e0a18c522b9a65a423ecfe62114f11e2e528","fast_time":0.0355243657,"language":"cpp","measured_fast_code_id":"aa08973ededc58a970c5ba2db7a8e0a18c522b9a65a423ecfe62114f11e2e528","measured_slow_code_id":"db88dc37729b5e57259c9bcd6c3c1d0a60ca3eaa7c4cb15e0805e7ad606b3246","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73856","problem_id":"p03043","slow_code_id":"ffefdec6fcaab1cff6238f44c47e575993fd01eff324de0a5da0a66e3680abc6","slow_id":"db88dc37729b5e57259c9bcd6c3c1d0a60ca3eaa7c4cb15e0805e7ad606b3246","slow_time":0.1667882205,"speedup":4.695037257202879,"stratum":"4-8","sampling_key":"3ba1e01df583381451356f05452bedd34b3d7e5a5435c45899843ae100d21838","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <set>\n\n#include <cmath>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\nusing ll = long long;\n\ntypedef long double ld;\n\nconst long double eps = 1e-12;\n\nconst int maxn = (int)1e5 + 10;\n\nld p[maxn];\n\nvoid mypow() {\n\n  p[0] = 1;\n\n  for (int i = 1; i < maxn; i++) {\n\n    p[i] = p[i - 1] * 0.5;\n  }\n}\n\nint main()\n\n{\n\n  int n, m;\n\n  ld sum;\n\n  mypow();\n\n  while (scanf(\"%d%d\", &n, &m) != EOF) {\n\n    sum = 0;\n\n    for (ll i = 1; i <= n; i++) {\n\n      ll cnt = 0, r = i;\n\n      while (r < m)\n        r *= 2, cnt++;\n\n      sum += (ld)((1.0 / n) * p[cnt]);\n    }\n\n    printf(\"%.12Lf\", sum);\n  }\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <string>\n\n#include <set>\n\n#include <cmath>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\nusing ll = long long;\n\ntypedef long double ld;\n\nconst long double eps = 1e-12;\n\nld mypow(ld a, ll i) {\n\n  if (i == 0)\n    return 1;\n\n  ld t = mypow(a, i >> 1);\n\n  t *= t;\n\n  if (i & 1)\n    t = (ld)(t * a);\n\n  return t;\n}\n\nint main()\n\n{\n\n  int n, m;\n\n  ld sum;\n\n  while (scanf(\"%d%d\", &n, &m) != EOF) {\n\n    sum = 0;\n\n    for (ll i = 1; i <= n; i++) {\n\n      ll r = i, cnt = 0;\n\n      while (r < m)\n        r *= 2, cnt++;\n\n      sum += (ld)((1.0 / n) * mypow(1.0 / 2, cnt));\n    }\n\n    printf(\"%.12Lf\", sum);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"5c7f273ad7f0b28068bef831a0609e27afa334dda905f7ee9aae049cd538456e","fast_id":"9b5cb056c7462713ae4fc49e9ef1bb4043dffb3b6cb6182b018019e968521821","fast_time":0.001028897,"language":"cpp","measured_fast_code_id":"9b5cb056c7462713ae4fc49e9ef1bb4043dffb3b6cb6182b018019e968521821","measured_slow_code_id":"6a3bcbf679a1ad9cb6a6656160c456282e2a87487a28f1736fd703857c960dff","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73873","problem_id":"p03732","slow_code_id":"d53c4427fa82317e169f4a73df44bfa6c677ec23b9719439aa5c68a3d0b16e3f","slow_id":"6a3bcbf679a1ad9cb6a6656160c456282e2a87487a28f1736fd703857c960dff","slow_time":0.01563021,"speedup":15.191229054025815,"stratum":"8+","sampling_key":"f6549a129a17ab9948fd4f50441e79004ef22fa17dbb342442c1bcaf39d19ca2","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <vector>\n\n#include <iomanip>\n\n#define sqr(x) (x) * (x)\n\n#define fz1(i, n) for (i = 1; i <= n; i++)\n\n#define fd1(i, n) for (i = n; i >= 1; i--)\n\n#define fz0g(i, n) for (i = 0; i <= n; i++)\n\n#define fd0g(i, n) for (i = n; i >= 0; i--)\n\n#define fz0k(i, n) for (i = 0; i < n; i++)\n\n#define fd0k(i, n) for (i = (long long)(n - 1); i >= 0; i--)\n\n#define fz(i, x, y) for (i = x; i <= y; i++)\n\n#define fd(i, y, x) for (i = y; i >= x; i--)\n\n#define ff(c, itr)                                                             \\\n  for (__typeof((c).begin()) itr = (c).begin(); itr != (c).end(); itr++)\n\n#define rdst(st, len)                                                          \\\n  {                                                                            \\\n    char ss[len];                                                              \\\n    scanf(\"%s\", ss);                                                           \\\n    (st) = ss;                                                                 \\\n  }\n\nusing namespace std;\n\nint n, m, i, j, k, dp[105][105][305], v[105], w[105], ans;\n\nint main()\n\n{\n\n  memset(dp, -120, sizeof(dp));\n\n  cin >> n >> m;\n\n  fz1(i, n)\n\n  {\n\n    cin >> w[i] >> v[i];\n  }\n\n  dp[0][0][0] = 0;\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    for (j = 0; j <= i; j++)\n\n    {\n\n      for (k = 0; k <= 300; k++)\n\n      {\n\n        if (1ll * j * w[1] + k > 1ll * m)\n          continue;\n\n        dp[i + 1][j + 1][k + w[i + 1] - w[1]] =\n            max(dp[i + 1][j + 1][k + w[i + 1] - w[1]], dp[i][j][k] + v[i + 1]);\n\n        dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]);\n      }\n    }\n  }\n\n  for (i = 0; i <= n; i++)\n\n  {\n\n    for (j = 0; j <= 300; j++)\n\n    {\n\n      if (1ll * i * w[1] + j > 1ll * m)\n        continue;\n\n      ans = max(ans, dp[n][i][j]);\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"\n\n#pragma GCC optimize(1)\n\n#pragma G++ optimize(1)\n\n#pragma GCC optimize(2)\n\n#pragma G++ optimize(2)\n\n#pragma GCC optimize(3)\n\n#pragma G++ optimize(3)\n\n#pragma GCC optimize(4)\n\n#pragma G++ optimize(4)\n\n#pragma GCC optimize(5)\n\n#pragma G++ optimize(5)\n\n#pragma GCC optimize(6)\n\n#pragma G++ optimize(6)\n\n#pragma GCC optimize(7)\n\n#pragma G++ optimize(7)\n\n#pragma GCC optimize(8)\n\n#pragma G++ optimize(8)\n\n#pragma GCC optimize(9)\n\n#pragma G++ optimize(9)\n\n#pragma GCC optimize(\"-funsafe-loop-optimizations\")\n\n#pragma GCC optimize(\"-funroll-loops\")\n\n#pragma GCC optimize(\"-fwhole-program\")\n\n#pragma GCC optimize(\"Ofast,no-stack-protector\")\n\n#pragma GCC optimize(\"-fthread-jumps\")\n\n#pragma GCC optimize(\"-falign-functions\")\n\n#pragma GCC optimize(\"-falign-jumps\")\n\n#pragma GCC optimize(\"-falign-loops\")\n\n#pragma GCC optimize(\"-falign-labels\")\n\n#pragma GCC optimize(\"-fcaller-saves\")\n\n#pragma GCC optimize(\"-fcrossjumping\")\n\n#pragma GCC optimize(\"-fcse-follow-jumps\")\n\n#pragma GCC optimize(\"-fcse-skip-blocks\")\n\n#pragma GCC optimize(\"-fdelete-null-pointer-checks\")\n\n#pragma GCC optimize(\"-fdevirtualize\")\n\n#pragma GCC optimize(\"-fexpensive-optimizations\")\n\n#pragma GCC optimize(\"-fgcse\")\n\n#pragma GCC optimize(\"-fgcse-lm\")\n\n#pragma GCC optimize(\"-fhoist-adjacent-loads\")\n\n#pragma GCC optimize(\"-finline-small-functions\")\n\n#pragma GCC optimize(\"-findirect-inlining\")\n\n#pragma GCC optimize(\"-fipa-sra\")\n\n#pragma GCC optimize(\"-foptimize-sibling-calls\")\n\n#pragma GCC optimize(\"-fpartial-inlining\")\n\n#pragma GCC optimize(\"-fpeephole2\")\n\n#pragma GCC optimize(\"-freorder-blocks\")\n\n#pragma GCC optimize(\"-freorder-functions\")\n\n#pragma GCC optimize(\"-frerun-cse-after-loop\")\n\n#pragma GCC optimize(\"-fsched-interblock\")\n\n#pragma GCC optimize(\"-fsched-spec\")\n\n#pragma GCC optimize(\"-fschedule-insns\")\n\n#pragma GCC optimize(\"-fschedule-insns2\")\n\n#pragma GCC optimize(\"-fstrict-aliasing\")\n\n#pragma GCC optimize(\"-fstrict-overflow\")\n\n#pragma GCC optimize(\"-ftree-switch-conversion\")\n\n#pragma GCC optimize(\"-ftree-tail-merge\")\n\n#pragma GCC optimize(\"-ftree-pre\")\n\n#pragma GCC optimize(\"-ftree-vrp\")\n\n#include <map>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <set>\n\n#include <cmath>\n\n#include <stdio.h>\n\n#include <fstream>\n\n#include <assert.h>\n\n#include <time.h>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <list>\n\n#include <sstream>\n\n#include <string.h>\n\n#define mp make_pair\n\n#define ll long long\n\n#define all(v) v.begin(), v.end()\n\n#define memset(a, b) memset(a, b, sizeof(a))\n\nusing namespace std;\n\nconst int INF = 1e9;\n\nconst int maxn = 10005;\n\nstruct bign {\n\n  int d[maxn], len;\n\n  inline void clean() {\n    while (len > 1 && !d[len - 1])\n      len--;\n  }\n\n  inline bign() {\n    memset(d, 0);\n    len = 1;\n  }\n\n  inline bign(int num) { *this = num; }\n\n  inline bign(char *num) { *this = num; }\n\n  inline bign operator=(const char *num) {\n\n    memset(d, 0);\n    len = strlen(num);\n\n    for (int i = 0; i < len; i++)\n      d[i] = num[len - 1 - i] - '0';\n\n    clean();\n\n    return *this;\n  }\n\n  inline bign operator=(int num) {\n\n    char s[20];\n    sprintf(s, \"%d\", num);\n\n    *this = s;\n\n    return *this;\n  }\n\n  inline bign operator+(const bign &b) {\n\n    bign c = *this;\n    int i;\n\n    for (i = 0; i < b.len; i++) {\n\n      c.d[i] += b.d[i];\n\n      if (c.d[i] > 9)\n        c.d[i] %= 10, c.d[i + 1]++;\n    }\n\n    while (c.d[i] > 9)\n      c.d[i++] %= 10, c.d[i]++;\n\n    c.len = max(len, b.len);\n\n    if (c.d[i] && c.len <= i)\n      c.len = i + 1;\n\n    return c;\n  }\n\n  inline bign operator-(const bign &b) {\n\n    bign c = *this;\n    int i;\n\n    for (i = 0; i < b.len; i++) {\n\n      c.d[i] -= b.d[i];\n\n      if (c.d[i] < 0)\n        c.d[i] += 10, c.d[i + 1]--;\n    }\n\n    while (c.d[i] < 0)\n      c.d[i++] += 10, c.d[i]--;\n\n    for (i = c.len - 1; i > 0; i--)\n      if (c.d[i] != 0)\n        break;\n\n    c.len = i + 1;\n\n    return c;\n  }\n\n  inline bign operator*(const bign &b) const {\n\n    int i, j;\n    bign c;\n    c.len = len + b.len;\n\n    for (j = 0; j < b.len; j++)\n      for (i = 0; i < len; i++)\n\n        c.d[i + j] += d[i] * b.d[j];\n\n    for (i = 0; i < c.len - 1; i++)\n\n      c.d[i + 1] += c.d[i] / 10, c.d[i] %= 10;\n\n    c.clean();\n\n    return c;\n  }\n\n  inline bign operator/(const bign &b) {\n\n    int i, j;\n\n    bign c = *this, a = 0;\n\n    for (i = len - 1; i >= 0; i--)\n\n    {\n\n      a = a * 10 + d[i];\n\n      for (j = 0; j < 10; j++)\n        if (a < b * (j + 1))\n          break;\n\n      c.d[i] = j;\n\n      a = a - b * j;\n    }\n\n    c.clean();\n\n    return c;\n  }\n\n  inline bign operator%(const bign &b) {\n\n    int i, j;\n\n    bign a = 0;\n\n    for (i = len - 1; i >= 0; i--) {\n\n      a = a * 10 + d[i];\n\n      for (j = 0; j < 10; j++)\n        if (a < b * (j + 1))\n          break;\n\n      a = a - b * j;\n    }\n\n    return a;\n  }\n\n  inline bign operator+=(const bign &b) {\n\n    *this = *this + b;\n\n    return *this;\n  }\n\n  inline bign operator*=(const bign &b) {\n\n    *this = *this * b;\n\n    return *this;\n  }\n\n  inline bign operator-=(const bign &b) {\n\n    *this = *this - b;\n\n    return *this;\n  }\n\n  inline bign operator/=(const bign &b) {\n\n    *this = *this / b;\n\n    return *this;\n  }\n\n  inline bool operator<(const bign &b) const {\n\n    if (len != b.len)\n      return len < b.len;\n\n    for (int i = len - 1; i >= 0; i--)\n\n      if (d[i] != b.d[i])\n        return d[i] < b.d[i];\n\n    return false;\n  }\n\n  inline bool operator>(const bign &b) const { return b < *this; }\n\n  inline bool operator<=(const bign &b) const { return !(b < *this); }\n\n  inline bool operator>=(const bign &b) const { return !(*this < b); }\n\n  inline bool operator!=(const bign &b) const { return b < *this || *this < b; }\n\n  inline bool operator==(const bign &b) const {\n    return !(b < *this) && !(b > *this);\n  }\n\n  inline string str() const {\n\n    char s[maxn] = {};\n\n    for (int i = 0; i < len; i++)\n      s[len - 1 - i] = d[i] + '0';\n\n    return s;\n  }\n};\n\ninline istream &operator>>(istream &in, bign &x)\n\n{\n\n  string s;\n\n  in >> s;\n\n  x = s.c_str();\n\n  return in;\n}\n\ninline ostream &operator<<(ostream &out, const bign &x)\n\n{\n\n  out << x.str();\n\n  return out;\n}\n\ninline void write(ll x) {\n\n  if (x < 0)\n    putchar('-'), x = -x;\n\n  if (x > 9)\n    write(x / 10);\n\n  putchar(x % 10 + '0');\n}\n\ninline int pt(int a[], int l, int r) {\n\n  int p, i, j;\n\n  p = a[l];\n\n  i = l;\n\n  j = r + 1;\n\n  for (;;) {\n\n    while (a[++i] < p)\n      if (i >= r)\n        break;\n\n    while (a[--j] > p)\n      if (j <= l)\n        break;\n\n    if (i >= j)\n      break;\n\n    else\n      swap(a[i], a[j]);\n  }\n\n  if (j == l)\n    return j;\n\n  swap(a[l], a[j]);\n\n  return j;\n}\n\ninline void q_sort(int a[], int l, int r) {\n\n  int q;\n\n  if (r > l) {\n\n    q = pt(a, l, r);\n\n    q_sort(a, l, q - 1);\n\n    q_sort(a, q + 1, r);\n  }\n}\n\ninline void write(int x) {\n\n  if (x < 0)\n    putchar('-'), x = -x;\n\n  if (x > 9)\n    write(x / 10);\n\n  putchar(x % 10 + '0');\n}\n\ninline void rd(long long &val) {\n\n  long long x = 0;\n\n  int f = 1;\n\n  char ch = getchar();\n\n  while ((ch < '0' || ch > '9') && ch != '-')\n    ch = getchar();\n\n  if (ch == '-') {\n\n    f = -1;\n\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n\n    x = x * 10 + ch - '0';\n\n    ch = getchar();\n  }\n\n  val = x * f;\n}\n\ninline void rd(int &val) {\n\n  int x = 0;\n\n  int f = 1;\n\n  char ch = getchar();\n\n  while ((ch < '0' || ch > '9') && ch != '-')\n    ch = getchar();\n\n  if (ch == '-') {\n\n    f = -1;\n\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n\n    x = x * 10 + ch - '0';\n\n    ch = getchar();\n  }\n\n  val = x * f;\n}\n\ninline void print(int x) {\n\n  write(x);\n\n  putchar('\\n');\n}\n\nll dp[101][101][301], v[101];\n\nll n, m;\n\nll W[101], w[101], t, sum, b;\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  int i, j, k;\n\n  cin >> n >> m;\n\n  for (i = 0; i < n; i++)\n    cin >> W[i] >> v[i];\n\n  t = W[0];\n\n  for (i = 0; i < n; i++)\n    w[i] = W[i] - t;\n\n  for (i = 0; i < n; i++) {\n\n    for (j = 0; j <= i; j++) {\n\n      for (k = 0; k <= 3 * j; k++) {\n\n        dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]);\n\n        dp[i + 1][j + 1][k + w[i]] =\n            max(dp[i + 1][j + 1][k + w[i]], dp[i][j][k] + v[i]);\n      }\n    }\n  }\n\n  ll ans = 0;\n\n  for (i = 0; i <= n; i++)\n    for (j = 0; j <= 3 * i; j++)\n      if (m >= t * i + j)\n        ans = max(ans, dp[n][i][j]);\n\n  cout << ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"d7d661572f4b056e8d50428b5d879586579fe3dffffe2d722c8b640c6fa9d0bd","fast_id":"01ab9de7e2bff90539ab9bdd8a79efdc062989d4d41753643d57d7c057e6cf34","fast_time":0.0198837596,"language":"cpp","measured_fast_code_id":"01ab9de7e2bff90539ab9bdd8a79efdc062989d4d41753643d57d7c057e6cf34","measured_slow_code_id":"44cef2aaf3561ae34df707419c7e2afb70874e68575f15bad94d74dc81b5bd42","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73892","problem_id":"p02264","slow_code_id":"476ec15c41141663e97a0a6c44a7112a0eb8050cb39afcff1dcacb04cd2e33ff","slow_id":"44cef2aaf3561ae34df707419c7e2afb70874e68575f15bad94d74dc81b5bd42","slow_time":0.5598654275,"speedup":28.156919956928068,"stratum":"8+","sampling_key":"4cbc11fa8e15c0472119d6e43f021e9fb5713913f220bb8ef26bd317d3542d12","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAXN = 100000 + 5;\n\nstruct process {\n\n  string name;\n\n  int time;\n};\n\nprocess Q[MAXN];\n\nint head, tail;\n\nint n, q, total_time = 0;\n\nvoid enqueue(process x) {\n\n  Q[tail] = x;\n\n  tail++;\n\n  tail %= MAXN;\n}\n\nprocess dequeue() {\n\n  process x = Q[head];\n\n  head++;\n\n  head %= MAXN;\n\n  return x;\n}\n\nbool isEmpty() { return head == tail; }\n\nint main() {\n\n  cin >> n >> q;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> Q[i].name >> Q[i].time;\n  }\n\n  head = 0, tail = n;\n\n  while (!isEmpty()) {\n\n    process crt = dequeue();\n\n    int need = min(crt.time, q);\n\n    crt.time -= need;\n\n    total_time += need;\n\n    if (crt.time == 0) {\n\n      cout << crt.name << \" \" << total_time << endl;\n\n    } else {\n\n      enqueue(crt);\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#define MAXN 100010\n\nint n, q;\n\ntypedef struct p {\n\n  char name[10];\n\n  int time;\n\n} P;\n\nP que[MAXN];\n\nint head, tail, tot;\n\nvoid get_input() {\n\n  scanf(\"%d %d\", &n, &q);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%s %d\", que[i].name, &que[i].time);\n  }\n\n  tail = n;\n}\n\nvoid solve() {\n\n  P item;\n\n  while (head != tail) {\n\n    item = que[head];\n\n    head = (head + 1) % (n + 1);\n\n    if (item.time > q) {\n\n      item.time -= q;\n\n      tot += q;\n\n      que[tail] = item;\n\n      tail = (tail + 1) % (n + 1);\n\n    } else {\n\n      tot += item.time;\n\n      printf(\"%s %d\\n\", item.name, tot);\n    }\n  }\n}\n\nvoid display_output() {}\n\nint main() {\n\n#ifdef debug\n\n  freopen(\"in.txt\", \"r\", stdin);\n\n#endif\n\n  get_input();\n\n  solve();\n\n  display_output();\n}"}
{"fast_code_id":"069a5b30ddf9a0454e800166d7321cd12f0e8c29e0c8203f1d1562f88d212bdb","fast_id":"e72f41d6b11ab269bb1fc2abd3a1d22e9ec1cdead4ae40703da1e804e5271849","fast_time":0.0611399186,"language":"cpp","measured_fast_code_id":"e72f41d6b11ab269bb1fc2abd3a1d22e9ec1cdead4ae40703da1e804e5271849","measured_slow_code_id":"d75bea89e6ef8cf5d26509d8106ce9611c5d7507efcbc0268898f6668e95f270","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73942","problem_id":"p02902","slow_code_id":"e1bb4f0df1ff9b3a6af0d5ff6190dc63d6b04be96bb16818dc76040c3abae0ec","slow_id":"d75bea89e6ef8cf5d26509d8106ce9611c5d7507efcbc0268898f6668e95f270","slow_time":0.1347849145,"speedup":2.204532122160856,"stratum":"2-4","sampling_key":"7d20f59bf4ace1f5b751adb23dce683dac423fec6e44b5e6de9866784d545dcc","slow_code":"#include <iostream>\n\n#include <sstream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <ctime>\n\n#include <cstring>\n\n#include <string>\n\n#include <vector>\n\n#include <stack>\n\n#include <queue>\n\n#include <deque>\n\n#include <map>\n\n#include <set>\n\n#include <bitset>\n\n#include <numeric>\n\n#include <utility>\n\n#include <iomanip>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <unordered_map>\n\nusing namespace std;\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }\n\ntemplate <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {\n\n  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\n}\n\ntemplate <class T, class V>\n\ntypename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {\n\n  t = v;\n}\n\ntemplate <class T, class V>\n\ntypename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v) {\n\n  for (auto &e : t)\n    fill(e, v);\n}\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n\ntemplate <class T1, class T2>\nostream &operator<<(ostream &s, pair<T1, T2> P)\n\n{\n  return s << '<' << P.first << \", \" << P.second << '>';\n}\n\ntemplate <class T>\nostream &operator<<(ostream &s, vector<T> P)\n\n{\n  for (int i = 0; i < P.size(); ++i) {\n    if (i > 0) {\n      s << \" \";\n    }\n    s << P[i] + 1;\n  }\n  return s;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &s, vector<vector<T> > P)\n\n{\n  for (int i = 0; i < P.size(); ++i) {\n    s << endl << P[i];\n  }\n  return s << endl;\n}\n\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n\ntemplate <class T>\nostream &operator<<(ostream &s, set<T> P)\n\n{\n  EACH(it, P) { s << \"<\" << *it << \"> \"; }\n  return s << endl;\n}\n\ntemplate <class T1, class T2>\nostream &operator<<(ostream &s, map<T1, T2> P)\n\n{\n  EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; }\n  return s << endl;\n}\n\nusing Graph = vector<vector<int> >;\n\nvector<bool> seen, finished;\n\nint pos = -1;\n\nvector<int> hist;\n\nvoid dfs(const Graph &G, int v) {\n\n  seen[v] = true;\n\n  hist.push_back(v);\n\n  for (auto nv : G[v]) {\n\n    if (finished[nv])\n      continue;\n\n    if (seen[nv] && !finished[nv]) {\n\n      pos = nv;\n\n      return;\n    }\n\n    dfs(G, nv);\n\n    if (pos != -1)\n      return;\n  }\n\n  hist.pop_back();\n\n  finished[v] = true;\n}\n\nbool gr[1100][1100];\n\nint main() {\n\n  int N, M;\n  cin >> N >> M;\n\n  memset(gr, 0, sizeof(gr));\n\n  Graph G(N);\n\n  for (int i = 0; i < M; ++i) {\n\n    int a, b;\n    cin >> a >> b;\n    --a, --b;\n\n    G[a].push_back(b);\n\n    gr[a][b] = true;\n  }\n\n  seen.assign(N, false), finished.assign(N, false);\n\n  pos = -1;\n\n  for (int v = 0; v < N; ++v) {\n\n    pos = -1;\n\n    dfs(G, v);\n\n    if (pos != -1)\n      break;\n  }\n\n  if (pos == -1) {\n\n    cout << -1 << endl;\n\n    return 0;\n  }\n\n  vector<int> cycle;\n\n  while (!hist.empty()) {\n\n    int t = hist.back();\n\n    cycle.push_back(t);\n\n    hist.pop_back();\n\n    if (t == pos)\n      break;\n  }\n\n  reverse(cycle.begin(), cycle.end());\n\n  while (true) {\n\n    int from = -1, to = -1;\n\n    vector<int> ord(N, -1);\n\n    for (int i = 0; i < cycle.size(); ++i)\n      ord[cycle[i]] = i;\n\n    for (int i = 0; i < cycle.size(); ++i) {\n\n      for (auto nv : G[cycle[i]]) {\n\n        if (nv != cycle[(i + 1) % cycle.size()] && ord[nv] != -1) {\n\n          from = i, to = ord[nv];\n        }\n      }\n    }\n\n    if (from == -1)\n      break;\n\n    vector<int> ncycle;\n\n    ncycle.push_back(cycle[from]);\n\n    int id = to;\n\n    while (id != from) {\n\n      ncycle.push_back(cycle[id]);\n\n      id = (id + 1) % cycle.size();\n    }\n\n    cycle = ncycle;\n  }\n\n  cout << cycle.size() << endl;\n\n  for (auto v : cycle)\n    cout << v + 1 << endl;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\nusing Graph = vector<vector<int> >;\n\nvector<bool> seen, finished;\n\nint pos = -1;\n\nvector<int> hist;\n\nvoid dfs(const Graph &G, int v) {\n\n  seen[v] = true;\n\n  hist.push_back(v);\n\n  for (auto nv : G[v]) {\n\n    if (finished[nv])\n      continue;\n\n    if (seen[nv] && !finished[nv]) {\n\n      pos = nv;\n\n      return;\n    }\n\n    dfs(G, nv);\n\n    if (pos != -1)\n      return;\n  }\n\n  hist.pop_back();\n\n  finished[v] = true;\n}\n\nint main() {\n\n  int N, M;\n  cin >> N >> M;\n\n  Graph G(N);\n\n  for (int i = 0; i < M; ++i) {\n\n    int a, b;\n    cin >> a >> b;\n    --a, --b;\n\n    G[a].push_back(b);\n  }\n\n  seen.assign(N, false), finished.assign(N, false);\n\n  pos = -1;\n\n  for (int v = 0; v < N; ++v) {\n\n    pos = -1;\n\n    dfs(G, v);\n\n    if (pos != -1)\n      break;\n  }\n\n  if (pos == -1) {\n\n    cout << -1 << endl;\n\n    return 0;\n  }\n\n  vector<int> cycle;\n\n  while (!hist.empty()) {\n\n    int t = hist.back();\n\n    cycle.push_back(t);\n\n    hist.pop_back();\n\n    if (t == pos)\n      break;\n  }\n\n  reverse(cycle.begin(), cycle.end());\n\n  while (true) {\n\n    int from = -1, to = -1;\n\n    vector<int> ord(N, -1);\n\n    for (int i = 0; i < cycle.size(); ++i)\n      ord[cycle[i]] = i;\n\n    for (int i = 0; i < cycle.size(); ++i) {\n\n      for (auto nv : G[cycle[i]]) {\n\n        if (nv != cycle[(i + 1) % cycle.size()] && ord[nv] != -1) {\n\n          from = i, to = ord[nv];\n        }\n      }\n    }\n\n    if (from == -1)\n      break;\n\n    vector<int> ncycle;\n\n    ncycle.push_back(cycle[from]);\n\n    int id = to;\n\n    while (id != from) {\n\n      ncycle.push_back(cycle[id]);\n\n      id = (id + 1) % cycle.size();\n    }\n\n    cycle = ncycle;\n  }\n\n  cout << cycle.size() << endl;\n\n  for (auto v : cycle)\n    cout << v + 1 << endl;\n}\n"}
{"fast_code_id":"de245c4443a14401c63766008d9299d3f55102d2a5b355f7be406aff27c011c4","fast_id":"3cac44b7bf5f1b92e52e5c15cd1a4418868b2a429fb7dbe4039f07683b71eb82","fast_time":0.0538924086,"language":"cpp","measured_fast_code_id":"3cac44b7bf5f1b92e52e5c15cd1a4418868b2a429fb7dbe4039f07683b71eb82","measured_slow_code_id":"d0a3ccb19dfaae10c69a3a60d812d49209e9d81854f880ce80b5493071ab47d5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_73949","problem_id":"p00486","slow_code_id":"ed71ff2ceac9c3ba13f1255876e2fb11ba15dd5a900760799006228b383a83c0","slow_id":"d0a3ccb19dfaae10c69a3a60d812d49209e9d81854f880ce80b5493071ab47d5","slow_time":0.5000164395,"speedup":9.278049589715312,"stratum":"8+","sampling_key":"a18aa9a44d8f3fa65e3a00c4a61542775c1e94a89fa948201486e7ac584ba610","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cmath>\n\nusing namespace std;\n\n#define MAX_N 1000000\n\n#define INF 1145141145141919810LL;\n\nlong long x[MAX_N], y[MAX_N], lx[MAX_N], ly[MAX_N], d[MAX_N], n, h, w, sx, sy, c, mx, my, sum, minx,\n    dx, dy;\n\nvector<long long> X, Y, BX, BY;\n\nint main() {\n\n  cin >> h >> w >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> x[i] >> y[i];\n\n    lx[i] = x[i];\n    ly[i] = y[i];\n\n    sx += x[i];\n\n    sy += y[i];\n  }\n\n  sort(x, x + n);\n\n  sort(y, y + n);\n\n  mx = INF;\n  my = INF;\n  minx = INF;\n\n  for (int i = 0; i < n; i++) {\n\n    if (i == 0) {\n      c = x[0];\n    }\n\n    else {\n      c = x[i] - x[i - 1];\n    }\n\n    sx += (-n + i * 2) * c;\n\n    if (mx == sx) {\n      X.push_back(x[i]);\n    }\n\n    if (mx > sx) {\n      mx = sx;\n      X.clear();\n      X.push_back(x[i]);\n    }\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    if (i == 0) {\n      c = y[0];\n    }\n\n    else {\n      c = y[i] - y[i - 1];\n    }\n\n    sy += (-n + i * 2) * c;\n\n    if (my == sy) {\n      Y.push_back(y[i]);\n    }\n\n    if (my > sy) {\n      my = sy;\n      Y.clear();\n      Y.push_back(y[i]);\n    }\n  }\n\n  for (int i = 0; i < X.size(); i++) {\n\n    if (i < 10) {\n      BX.push_back(X[i]);\n    }\n\n    else {\n      if (X[i] != X[i - 10]) {\n        BX.push_back(X[i]);\n      }\n    }\n  }\n\n  for (int i = 0; i < Y.size(); i++) {\n\n    if (i < 10) {\n      BY.push_back(Y[i]);\n    }\n\n    else {\n      if (Y[i] != Y[i - 10]) {\n        BY.push_back(Y[i]);\n      }\n    }\n  }\n\n  for (int i = 0; i < BX.size(); i++) {\n\n    for (int j = 0; j < BY.size(); j++) {\n\n      memset(d, 0, sizeof(d));\n\n      sum = 0;\n\n      for (int k = 0; k < n; k++) {\n\n        d[k] = abs(BX[i] - lx[k]) + abs(BY[j] - ly[k]);\n\n        sum += d[k] * 2;\n      }\n\n      sort(d, d + n);\n\n      sum -= d[n - 1];\n\n      if (minx > sum) {\n\n        minx = sum;\n\n        dx = BX[i];\n\n        dy = BY[j];\n      }\n    }\n  }\n\n  cout << minx << endl << dx << ' ' << dy << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\nlong long x[200000], y[200000], n, H, W;\n\nvector<long long> X, Y;\nvector<pair<long long, long long>> candidate;\n\nlong long dists(long long px, long long py) {\n\n  vector<long long> RR;\n  long long sum = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    long long TT = abs(px - x[i]) + abs(py - y[i]);\n\n    RR.push_back(TT);\n    sum += TT;\n  }\n\n  sort(RR.begin(), RR.end());\n\n  return sum * 2 - RR[RR.size() - 1];\n}\n\nint main() {\n\n  cin >> H >> W >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> x[i] >> y[i];\n    X.push_back(x[i]);\n    Y.push_back(y[i]);\n  }\n\n  sort(X.begin(), X.end());\n  sort(Y.begin(), Y.end());\n\n  vector<long long> HH, WW;\n\n  if (n % 2 == 1) {\n    HH.push_back(X[X.size() / 2]);\n    WW.push_back(Y[Y.size() / 2]);\n  }\n\n  if (n % 2 == 0) {\n\n    HH.push_back(X[X.size() / 2 - 1]);\n    HH.push_back(X[X.size() / 2]);\n\n    WW.push_back(Y[Y.size() / 2 - 1]);\n    WW.push_back(Y[Y.size() / 2]);\n  }\n\n  unique(X.begin(), X.end());\n  unique(Y.begin(), Y.end());\n\n  int pos1 = lower_bound(X.begin(), X.end(), HH[0]) - X.begin();\n\n  int pos2 = lower_bound(Y.begin(), Y.end(), WW[0]) - Y.begin();\n\n  int pos3 = 0, pos4 = 0;\n\n  if (n % 2 == 0) {\n\n    int pos1 = lower_bound(X.begin(), X.end(), HH[1]) - X.begin();\n\n    int pos2 = lower_bound(Y.begin(), Y.end(), WW[1]) - Y.begin();\n  }\n\n  if (pos1 >= 1) {\n    HH.push_back(X[pos1 - 1]);\n  }\n\n  if (pos1 < X.size() - 1 && n % 2 == 1) {\n    HH.push_back(X[pos1 + 1]);\n  }\n\n  if (pos3 < X.size() - 1 && n % 2 == 0) {\n    HH.push_back(X[pos3 + 1]);\n  }\n\n  if (pos2 >= 1) {\n    WW.push_back(Y[pos2 - 1]);\n  }\n\n  if (pos2 < Y.size() - 1 && n % 2 == 1) {\n    WW.push_back(Y[pos2 + 1]);\n  }\n\n  if (pos4 < Y.size() - 1 && n % 2 == 0) {\n    WW.push_back(Y[pos4 + 1]);\n  }\n\n  for (int i = 0; i < HH.size(); i++) {\n    for (int j = 0; j < WW.size(); j++)\n      candidate.push_back(make_pair(HH[i], WW[j]));\n  }\n\n  long long minx = 999999999999999999LL, mx = 0, my = 0;\n  sort(candidate.begin(), candidate.end());\n\n  for (int i = 0; i < candidate.size(); i++) {\n\n    long long UU = dists(candidate[i].first, candidate[i].second);\n\n    if (minx > UU) {\n      minx = UU;\n      mx = candidate[i].first;\n      my = candidate[i].second;\n    }\n  }\n\n  cout << minx << endl << mx << ' ' << my << endl;\n\n  return 0;\n}"}
{"fast_code_id":"5cf15af9321c7815109a54bb1189c1c6f6cbbccb09264c26ede782c6a8da5c07","fast_id":"f2ad297448499f6e46a4961a397b4817b635150572a41798b0cd2227ee5b1650","fast_time":0.000186881,"language":"cpp","measured_fast_code_id":"f2ad297448499f6e46a4961a397b4817b635150572a41798b0cd2227ee5b1650","measured_slow_code_id":"d7a26c8bb21815cf8ce5f284408f6e43691326a354006786b9619574e1c142a2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74035","problem_id":"p03495","slow_code_id":"f7b752fbb9626692cfac2af0f7b4602435c0bd132f54e1fa23404cf96b6bcecd","slow_id":"d7a26c8bb21815cf8ce5f284408f6e43691326a354006786b9619574e1c142a2","slow_time":0.0018201601,"speedup":9.739674445235204,"stratum":"8+","sampling_key":"388d1e1a2fd4c7ee8a2253220a4a5e68ad9fb6817974fed77b1d9944b03ae08f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 200005;\n\nint cnt[N], aux[N];\n\nint main() {\n\n  int n, k;\n\n  cin >> n >> k;\n\n  map<int, int> mp;\n\n  for (int i = 0; i < n; i++) {\n\n    int x;\n\n    cin >> x;\n\n    cnt[x]++;\n  }\n\n  int sz = 0;\n\n  for (int i = 1; i < N; i++) {\n\n    if (cnt[i]) {\n\n      aux[sz++] = cnt[i];\n    }\n  }\n\n  sort(aux, aux + sz);\n\n  int res = 0;\n\n  for (int i = 0; i < sz - k; i++) {\n\n    res += aux[i];\n  }\n\n  cout << res;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#define N 200002\n\nint a[N] = {0}, b[N] = {0};\n\nint read()\n\n{\n\n  char c;\n\n  while ((c = getchar()) < 48 || c > 57)\n    ;\n\n  int x = c - 48;\n\n  while ((c = getchar()) > 47 && c < 58)\n    x = x * 10 + c - 48;\n\n  return x;\n}\n\nint main()\n\n{\n\n  int n, k, i, c = 0, t, ans = 0;\n\n  n = read(), k = read();\n\n  for (i = 0; i < n; i++) {\n\n    a[read()]++;\n  }\n\n  for (i = 1; i <= n; i++) {\n\n    if (t = a[i])\n      b[t]++, c++;\n  }\n\n  if (c <= k)\n    puts(\"0\");\n\n  else {\n\n    c -= k;\n\n    for (i = 1; i <= n; i++) {\n\n      if (t = b[i]) {\n\n        if (c > t)\n          c -= t, ans += t * i;\n\n        else {\n\n          ans += c * i;\n\n          c = 0;\n\n          break;\n        }\n      }\n    }\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"e91b2b511caf1e299e7cf6c3ef9c472d5d94fe7bc62cd2a5fbea1f02d6afb637","fast_id":"6f95f28e07ec6da3c73a1d650ce126932881036f9f568f8b7a6f1f8db0ebc543","fast_time":0.0058583728,"language":"cpp","measured_fast_code_id":"6f95f28e07ec6da3c73a1d650ce126932881036f9f568f8b7a6f1f8db0ebc543","measured_slow_code_id":"f7e179428c0e665205d64950b4c36e4dbfc9fb648cd6e7b68995c8476a918051","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74052","problem_id":"p02963","slow_code_id":"71e44018bd0c59e6da52d4d9e95f589074cae534e655f143fabf98f1828b7c26","slow_id":"f7e179428c0e665205d64950b4c36e4dbfc9fb648cd6e7b68995c8476a918051","slow_time":0.0281719364,"speedup":4.808832991987127,"stratum":"4-8","sampling_key":"00e80f59f92a3c9db025a6c761dc86f0e2dcf59aa3a6efa4592bc3df1b624061","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\nusing namespace std;\n\n#define INF 1000000000\n\nlong long int a, b, c, d, s;\n\nint main() {\n\n  scanf(\"%lld\", &s);\n\n  if (s % INF)\n\n    printf(\"0 0 %lld %lld %lld %lld\\n\", 1, s / INF + 1, INF, INF - s % INF);\n\n  else\n\n    printf(\"0 0 %lld %lld %lld %lld\\n\", 1, s / INF, INF, 0);\n}","fast_code":"#include <cstdio>\n\n#include <cmath>\n\n#define ll long long\n\nusing namespace std;\n\nint main() {\n\n  ll i;\n\n  ll s, t;\n\n  ll root;\n\n  scanf(\"%lld\", &s);\n\n  root = (ll)sqrt(s);\n\n  if (root * root == s) {\n\n    printf(\"0 0 %lld 0 0 %lld\\n\", root, root);\n\n    return 0;\n  }\n\n  t = (root + 1) * (root + 1) - s;\n\n  for (i = 1;; i++) {\n\n    if (t % i == 0) {\n\n      printf(\"0 0 %lld %lld %lld %lld\\n\", root + 1, i, t / i, root + 1);\n\n      return 0;\n    }\n  }\n}\n"}
{"fast_code_id":"d711585143c39310dfaee7448f56d8e86ba5ae4e87bbfc6c7d4108d233286f46","fast_id":"241713b27cd34464cc6435b0aed2ab09340c8636a6f6f1827a6843cae6df1287","fast_time":0.0259946507,"language":"cpp","measured_fast_code_id":"241713b27cd34464cc6435b0aed2ab09340c8636a6f6f1827a6843cae6df1287","measured_slow_code_id":"8ccfe78f5151bca177320e780afc5d671812345f3092dac260406bf25d17ae20","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74066","problem_id":"p02352","slow_code_id":"edeef3fe13d857812cb26757b54a6c3716491a8fefc2c2ed3b9af0f7d61c21f0","slow_id":"8ccfe78f5151bca177320e780afc5d671812345f3092dac260406bf25d17ae20","slow_time":0.1504206587,"speedup":5.786600498540262,"stratum":"4-8","sampling_key":"89cd6d2fa8213220f36d4f62aca67b562d087e28d43ac1789483b2003bd8e8b1","slow_code":"#include <cstdio>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int SIZE = 1 << 17;\n\ntemplate <typename T>\n\nstruct lazysegtree {\n\n  T node[2 * SIZE], lazy[2 * SIZE], I_upd, I_qry;\n\n  bool need_upd[2 * SIZE];\n\n  T (*upd_f)(T, T, int, int), (*qry_f)(T, T);\n\n  lazysegtree(T (*op1)(T, T, int, int), T (*op2)(T, T), T X_upd, T X_qry) {\n\n    upd_f = op1;\n    qry_f = op2;\n\n    I_upd = X_upd, I_qry = X_qry;\n\n    fill(lazy, lazy + 2 * SIZE, I_upd);\n\n    fill(node, node + 2 * SIZE, I_qry);\n\n    fill(need_upd, need_upd + 2 * SIZE, false);\n  }\n\n  void init(vector<T> vec) {\n\n    int N = (int)vec.size();\n\n    for (int i = 0; i < N; i++) {\n\n      node[SIZE - 1 + i] = vec[i];\n    }\n\n    for (int i = SIZE - 2; i >= 0; i--) {\n\n      node[i] = qry_f(node[2 * i + 1], node[2 * i + 2]);\n    }\n  }\n\n  void lazy_eval(int k, int l, int r) {\n\n    if (!need_upd[k])\n      return;\n\n    node[k] = upd_f(node[k], lazy[k], l, r);\n\n    if (r - l > 1) {\n\n      lazy[2 * k + 1] = upd_f(lazy[2 * k + 1], lazy[k], 0, 1);\n\n      lazy[2 * k + 2] = upd_f(lazy[2 * k + 2], lazy[k], 0, 1);\n\n      need_upd[2 * k + 1] = need_upd[2 * k + 2] = true;\n    }\n\n    lazy[k] = I_upd;\n\n    need_upd[k] = false;\n  }\n\n  void update(int a, int b, T val, int l = 0, int r = SIZE, int k = 0) {\n\n    lazy_eval(k, l, r);\n\n    if (b <= l || r <= a)\n      return;\n\n    if (a <= l && r <= b) {\n\n      lazy[k] = upd_f(lazy[k], val, 0, 1);\n\n      need_upd[k] = true;\n\n      lazy_eval(k, l, r);\n\n    }\n\n    else {\n\n      int mid = (l + r) / 2;\n\n      update(a, b, val, l, mid, 2 * k + 1);\n\n      update(a, b, val, mid, r, 2 * k + 2);\n\n      node[k] = qry_f(node[2 * k + 1], node[2 * k + 2]);\n    }\n  }\n\n  T query(int a, int b, int l = 0, int r = SIZE, int k = 0) {\n\n    lazy_eval(k, l, r);\n\n    if (b <= l || r <= a)\n      return I_qry;\n\n    if (a <= l && r <= b)\n      return node[k];\n\n    int mid = (l + r) / 2;\n\n    T vl = query(a, b, l, mid, 2 * k + 1);\n\n    T vr = query(a, b, mid, r, 2 * k + 2);\n\n    return qry_f(vl, vr);\n  }\n};\n\ntypedef long long int ll;\n\nconst ll INF = 1LL << 60;\n\nll upd(ll a, ll b, int l, int r) { return a + b; }\n\nll fnd(ll a, ll b) { return min(a, b); }\n\nlazysegtree<ll> seg(upd, fnd, 0, INF);\n\nint main() {\n\n  int N, Q;\n  scanf(\"%d%d\", &N, &Q);\n\n  seg.init(vector<ll>(N, 0));\n\n  for (int i = 0; i < Q; i++) {\n\n    int query;\n    scanf(\"%d\", &query);\n\n    if (query == 0) {\n\n      int s, t, x;\n      scanf(\"%d%d%d\", &s, &t, &x);\n\n      seg.update(s, t + 1, x);\n    }\n\n    if (query == 1) {\n\n      int s, t;\n      scanf(\"%d%d\", &s, &t);\n\n      printf(\"%lld\\n\", seg.query(s, t + 1));\n    }\n  }\n}\n","fast_code":"#include <vector>\n\n#include <functional>\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <climits>\n\nusing namespace std;\n\ntemplate <typename MonoidType, typename OperatorType, class SegFunc>\n\nstruct LazySegmentTree {\n\n  int n;\n\n  vector<MonoidType> node;\n\n  vector<OperatorType> lazy;\n\n  vector<bool> need_update;\n\n  MonoidType E0;\n\n  OperatorType E1;\n\n  void build(int m, const vector<MonoidType> &v = vector<MonoidType>()) {\n\n    if (v != vector<MonoidType>())\n      m = v.size();\n\n    n = 1;\n    while (n < m)\n      n *= 2;\n\n    node = vector<MonoidType>(2 * n - 1, E0);\n\n    lazy = vector<OperatorType>(2 * n - 1, E1);\n\n    need_update = vector<bool>(2 * n - 1, false);\n\n    if (v != vector<MonoidType>()) {\n\n      for (int i = 0; i < m; i++) {\n\n        node[n - 1 + i] = v[i];\n      }\n\n      for (int i = n - 2; i >= 0; i--) {\n\n        node[i] = SegFunc::combine(node[2 * i + 1], node[2 * i + 2]);\n      }\n    }\n  }\n\n  LazySegmentTree() {}\n\n  LazySegmentTree(int n_, MonoidType E0_, OperatorType E1_,\n\n                  vector<MonoidType> v = vector<MonoidType>())\n      :\n\n        E0(E0_), E1(E1_) {\n\n    build(n_, v);\n  }\n\n  void eval(int k, int l, int r) {\n\n    if (!need_update[k])\n      return;\n\n    node[k] = SegFunc::update(node[k], SegFunc::accumulate(lazy[k], r - l));\n\n    if (r - l > 1) {\n\n      lazy[2 * k + 1] = SegFunc::lazy_update(lazy[2 * k + 1], lazy[k]);\n\n      lazy[2 * k + 2] = SegFunc::lazy_update(lazy[2 * k + 2], lazy[k]);\n\n      need_update[2 * k + 1] = need_update[2 * k + 2] = true;\n    }\n\n    lazy[k] = E1;\n\n    need_update[k] = false;\n  }\n\n  void update(int a, int b, OperatorType x, int l, int r, int k) {\n\n    eval(k, l, r);\n\n    if (b <= l or r <= a)\n      return;\n\n    if (a <= l and r <= b) {\n\n      lazy[k] = SegFunc::lazy_update(lazy[k], x);\n\n      need_update[k] = true;\n\n      eval(k, l, r);\n\n    }\n\n    else {\n\n      int mid = (l + r) / 2;\n\n      update(a, b, x, l, mid, 2 * k + 1);\n\n      update(a, b, x, mid, r, 2 * k + 2);\n\n      node[k] = SegFunc::combine(node[2 * k + 1], node[2 * k + 2]);\n    }\n  }\n\n  MonoidType query(int a, int b, int l, int r, int k) {\n\n    if (b <= l or r <= a)\n      return E0;\n\n    eval(k, l, r);\n\n    if (a <= l and r <= b)\n      return node[k];\n\n    int mid = (l + r) / 2;\n\n    MonoidType vl = query(a, b, l, mid, 2 * k + 1);\n\n    MonoidType vr = query(a, b, mid, r, 2 * k + 2);\n\n    return SegFunc::combine(vl, vr);\n  }\n\n  void update(int a, int b, OperatorType x) { update(a, b, x, 0, n, 0); }\n\n  MonoidType query(int a, int b) { return query(a, b, 0, n, 0); }\n\n  void dump() {\n\n    fprintf(stderr, \"[lazy]\\n\");\n\n    for (int i = 0; i < 2 * n - 1; i++) {\n\n      if (i == n - 1)\n        fprintf(stderr, \"xxx \");\n\n      if (lazy[i] == E1)\n        fprintf(stderr, \"  E \");\n\n      else\n        fprintf(stderr, \"%3d \", lazy[i]);\n    }\n\n    fprintf(stderr, \"\\n\");\n\n    fprintf(stderr, \"[node]\\n\");\n\n    for (int i = 0; i < 2 * n - 1; i++) {\n\n      if (i == n - 1)\n        fprintf(stderr, \"xxx \");\n\n      if (node[i] == E0)\n        fprintf(stderr, \"  E \");\n\n      else\n        fprintf(stderr, \"%3d \", node[i]);\n    }\n\n    fprintf(stderr, \"\\n\");\n  }\n};\n\nvoid DSL_2_D() {\n\n  struct SegFunc {\n\n    static int update(int a, int b) { return b; }\n\n    static int combine(int a, int b) { return min(a, b); }\n\n    static int lazy_update(int a, int b) { return b; }\n\n    static int accumulate(int a, int b) { return a; }\n  };\n\n  int N, Q;\n  cin >> N >> Q;\n\n  LazySegmentTree<int, int, SegFunc> seg(N, INT_MAX, INT_MAX);\n\n  int indexed = 0;\n\n  for (int i = 0; i < Q; i++) {\n\n    int query_type;\n    cin >> query_type;\n\n    if (query_type == 0) {\n\n      int s, t, x;\n      cin >> s >> t >> x;\n      t++;\n\n      s -= indexed, t -= indexed;\n\n      seg.update(s, t, x);\n    }\n\n    if (query_type == 1) {\n\n      int s;\n      cin >> s;\n\n      s -= indexed;\n\n      cout << seg.query(s, s + 1) << endl;\n    }\n  }\n}\n\nvoid DSL_2_E() {\n\n  struct SegFunc {\n\n    static int update(int a, int b) { return a + b; }\n\n    static int combine(int a, int b) { return a + b; }\n\n    static int lazy_update(int a, int b) { return a + b; }\n\n    static int accumulate(int a, int x) { return a * x; }\n  };\n\n  int N, Q;\n  cin >> N >> Q;\n\n  LazySegmentTree<int, int, SegFunc> seg(N, 0, 0);\n\n  int indexed = 1;\n\n  for (int i = 0; i < Q; i++) {\n\n    int query_type;\n    cin >> query_type;\n\n    if (query_type == 0) {\n\n      int s, t, x;\n      cin >> s >> t >> x;\n      t++;\n\n      s -= indexed, t -= indexed;\n\n      seg.update(s, t, x);\n    }\n\n    if (query_type == 1) {\n\n      int s;\n      cin >> s;\n\n      s -= indexed;\n\n      cout << seg.query(s, s + 1) << endl;\n    }\n  }\n}\n\nvoid DSL_2_F() {\n\n  struct SegFunc {\n\n    static int update(int a, int b) { return b; }\n\n    static int combine(int a, int b) { return min(a, b); }\n\n    static int lazy_update(int a, int b) { return b; }\n\n    static int accumulate(int a, int x) { return a; }\n  };\n\n  int N, Q;\n  cin >> N >> Q;\n\n  LazySegmentTree<int, int, SegFunc> seg(N, INT_MAX, 0);\n\n  int indexed = 0;\n\n  for (int i = 0; i < Q; i++) {\n\n    int query_type;\n    cin >> query_type;\n\n    if (query_type == 0) {\n\n      int s, t, x;\n      cin >> s >> t >> x;\n      t++;\n\n      s -= indexed, t -= indexed;\n\n      seg.update(s, t, x);\n    }\n\n    if (query_type == 1) {\n\n      int s, t;\n      cin >> s >> t;\n      t++;\n\n      s -= indexed;\n      t -= indexed;\n\n      cout << seg.query(s, t) << endl;\n    }\n  }\n}\n\nvoid DSL_2_G() {\n\n  using ll = long long int;\n\n  struct SegFunc {\n\n    static ll update(ll a, ll b) { return a + b; }\n\n    static ll combine(ll a, ll b) { return a + b; }\n\n    static ll lazy_update(ll a, ll b) { return a + b; }\n\n    static ll accumulate(ll a, ll x) { return a * x; }\n  };\n\n  int N, Q;\n  cin >> N >> Q;\n\n  LazySegmentTree<ll, ll, SegFunc> seg(N, 0, 0);\n\n  int indexed = 1;\n\n  for (int i = 0; i < Q; i++) {\n\n    int query_type;\n    cin >> query_type;\n\n    if (query_type == 0) {\n\n      int s, t, x;\n      cin >> s >> t >> x;\n      t++;\n\n      s -= indexed, t -= indexed;\n\n      seg.update(s, t, x);\n    }\n\n    if (query_type == 1) {\n\n      int s, t;\n      cin >> s >> t;\n      t++;\n\n      s -= indexed;\n      t -= indexed;\n\n      cout << seg.query(s, t) << endl;\n    }\n  }\n}\n\nvoid DSL_2_H() {\n\n  int N, Q;\n  cin >> N >> Q;\n\n  using ll = long long int;\n\n  struct SegFunc {\n\n    static ll update(ll a, ll b) { return a + b; }\n\n    static ll combine(ll a, ll b) { return min(a, b); }\n\n    static ll lazy_update(ll a, ll b) { return a + b; }\n\n    static ll accumulate(ll a, ll x) { return a; }\n  };\n\n  LazySegmentTree<ll, ll, SegFunc> seg(N, INT_MAX, 0, vector<ll>(N));\n\n  int indexed = 0;\n\n  for (int i = 0; i < Q; i++) {\n\n    int query_type;\n    cin >> query_type;\n\n    if (query_type == 0) {\n\n      int s, t, x;\n      cin >> s >> t >> x;\n      t++;\n\n      s -= indexed, t -= indexed;\n\n      seg.update(s, t, x);\n    }\n\n    if (query_type == 1) {\n\n      int s, t;\n      cin >> s >> t;\n      t++;\n\n      s -= indexed;\n      t -= indexed;\n\n      cout << seg.query(s, t) << endl;\n    }\n  }\n}\n\nint main() {\n\n  DSL_2_H();\n\n  return 0;\n}\n"}
{"fast_code_id":"d5f1f4d71cda58f29a061b209d404947a2f3a579968a349bff1a5597c9849368","fast_id":"419a812c409bd92118ab24b280b92ed41b62701f06acfb464b02385e50aba8c4","fast_time":0.0542706204,"language":"cpp","measured_fast_code_id":"419a812c409bd92118ab24b280b92ed41b62701f06acfb464b02385e50aba8c4","measured_slow_code_id":"844f45092cd4c68dbb1c9d3a1ff19d2a7376fdbdb0e0f6620307dd7c1345026d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74093","problem_id":"p03148","slow_code_id":"2dea321f9f3db31f968a10a44ccb1b39117313f0ee85384a5d5c1ee52f2b8b4a","slow_id":"844f45092cd4c68dbb1c9d3a1ff19d2a7376fdbdb0e0f6620307dd7c1345026d","slow_time":0.2171463228,"speedup":4.001176349183582,"stratum":"4-8","sampling_key":"da0b69220eb98157cd3976b6f5b06db0523fde85fe6ec1b45f254fae0c2b6190","slow_code":"#include <bits/stdc++.h>\n\n#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)\n\n#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)\n\n#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)\n\n#define all(c) (c).begin(), (c).end()\n\n#define sz(v) (int)(v).size()\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef pair<int, int> pii;\n\nvoid dbg() { cerr << \"\\n\"; }\ntemplate <typename T, typename... T2> void dbg(const T &fst, const T2 &... rst) {\n  cerr << fst << \": \";\n  dbg(rst...);\n}\n\ntemplate <class T> void amin(T &a, T b) { a = min(a, b); }\n\ntemplate <class T> void amax(T &a, T b) { a = max(a, b); }\n\nint main()\n\n{\n\n  int k, n;\n\n  cin >> n >> k;\n\n  VI d(n), t(n);\n\n  rep(i, n) cin >> t[i] >> d[i];\n\n  vector<VI> dt(100050);\n\n  {\n\n    vector<pii> vp(n);\n\n    rep(i, n) vp[i] = pii(d[i], t[i]);\n\n    sort(vp.rbegin(), vp.rend());\n\n    rep(i, n) {\n\n      tie(d[i], t[i]) = vp[i];\n\n      dt[t[i]].push_back(i);\n    }\n  }\n\n  vector<bool> usd(100050), uss(100050);\n\n  VI dels, tsp;\n\n  ll cnd = 0;\n  set<int> br;\n\n  rep(i, k) {\n\n    cnd += d[i];\n\n    uss[t[i]] = usd[i] = 1;\n\n    if (dt[t[i]][0] != i)\n      dels.push_back(i);\n  }\n\n  ll zz = 0;\n\n  rep(i, 100050) zz += uss[i] == 1;\n\n  cnd += (ll)zz * zz;\n\n  ll ans = cnd;\n\n  sort(all(dels), [&d](int a, int b) { return d[a] < d[b]; });\n\n  rep(i, 100050) if (sz(dt[i]) > 0) tsp.push_back(dt[i][0]);\n\n  sort(all(tsp), [&d](int a, int b) { return d[a] > d[b]; });\n\n  int dlc = -1, adc = -1;\n\n  while (1) {\n\n    bool ck = 0;\n\n    rep2(i, dlc + 1, sz(dels)) if (usd[dels[i]]) {\n      dlc = i;\n      ck = 1;\n      break;\n    }\n\n    if (!ck)\n      break;\n\n    ck = 0;\n\n    rep2(i, adc + 1, sz(tsp)) if (usd[tsp[i]] == 0 && uss[t[tsp[i]]] == 0) {\n\n      adc = i;\n      ck = 1;\n      break;\n    }\n\n    if (!ck)\n      break;\n\n    cnd -= d[dels[dlc]];\n    usd[dels[dlc]] = 0;\n\n    cnd += d[tsp[adc]];\n    usd[tsp[adc]] = 1;\n\n    cnd -= zz * zz;\n\n    zz++;\n    cnd += zz * zz;\n\n    ans = max(ans, cnd);\n  }\n\n  cout << ans << \"\\n\";\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)\n\n#define rep(x, to) for (int x = 0; x < (to); x++)\n\n#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)\n\n#define all(c) c.begin(), c.end()\n\n#define sz(v) (int)v.size()\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef pair<ll, int> pii;\n\ntypedef vector<ll> VL;\nconst int MD = (int)1e9 + 7;\n\nvoid dbg() { cerr << \"\\n\"; }\ntemplate <typename T, typename... T2> void dbg(const T &fst, const T2 &... rst) {\n  cerr << fst << \": \";\n  dbg(rst...);\n}\n\ntemplate <class T, class T2> void amax(T &a, T2 b) {\n  if (a < b)\n    a = b;\n}\n\nint main()\n\n{\n\n  cin.tie(0);\n  ios_base::sync_with_stdio(false);\n\n  int n, k;\n\n  cin >> n >> k;\n\n  vector<pii> td(n);\n\n  for (auto &x : td) {\n    cin >> x.second >> x.first;\n    x.second--;\n  }\n\n  sort(td.rbegin(), td.rend());\n\n  ll sm = 0, psu = 0;\n\n  VI cnt(n);\n\n  rep(i, k) {\n\n    sm += td[i].first;\n\n    cnt[td[i].second]++;\n  }\n\n  rep(i, n) if (cnt[i] > 0) psu++;\n\n  sm += psu * psu;\n\n  ll ans = sm;\n\n  int p = k - 1, j = k;\n\n  repr(i, p, 0) if (cnt[td[i].second] >= 2) {\n\n    for (; j < n; j++)\n      if (cnt[td[j].second] == 0) {\n\n        sm -= td[i].first + psu * psu;\n\n        cnt[td[i].second]--;\n\n        psu++;\n\n        sm += td[j].first + psu * psu;\n        ;\n\n        cnt[td[j].second]++;\n\n        ans = max(ans, sm);\n\n        break;\n      }\n  }\n\n  cout << ans << \"\\n\";\n\n  return 0;\n}\n"}
{"fast_code_id":"8daec369198855e4e4be2663d01510f579b2ece5859d2d6bccb10b16abe1af7a","fast_id":"9d0612acdb7487b68ba1e63fa1edead7f29ec5e6fd89dd717736ac0220d96db3","fast_time":0.0195414279,"language":"cpp","measured_fast_code_id":"9d0612acdb7487b68ba1e63fa1edead7f29ec5e6fd89dd717736ac0220d96db3","measured_slow_code_id":"732dc480349df145fd9bf0dcce9b6002d8be674141ad86c9b9445db6f45b56c2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74153","problem_id":"p02952","slow_code_id":"7c93c7c9520af6b878d77ccc4f874c4df88b6781ae6f54706ddf7a3c5e553146","slow_id":"732dc480349df145fd9bf0dcce9b6002d8be674141ad86c9b9445db6f45b56c2","slow_time":0.1170922201,"speedup":5.991999187531224,"stratum":"4-8","sampling_key":"79b1034c5ca73c5e77fdc07c66623eb8c8fd93f32a8fbf811ef6d68e13b0f785","slow_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define SORT(c) sort((c).begin(), (c).end());\n\n#define pb push_back\n\n#define MP make_pair\n\n#define pii pair<int, int>\n\n#define pcc pair<char, char>\n\n#define pic pair<int, char>\n\n#define pci pair<char, int>\n\n#define VS vector<string>\n\n#define VI vector<int>\n\n#define MIN(a, b) (a > b ? b : a)\n\n#define MAX(a, b) (a > b ? a : b)\n\n#define pi 3.141592653589793\n\n#define in scanf\n\n#define out printf\n\n#define ll long long\n\n#define ull unsigned long long\n\n#define w(x)                                                                   \\\n  int x;                                                                       \\\n  cin >> x;                                                                    \\\n  while (x--)\n\n#define fast ios_base::sync_with_stdio(0)\n\n#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)\n\n#define DOW(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)\n\n#define sz size()\n\ntypedef unsigned long long UL;\n\ntemplate <typename T>\ninline T S(T a)\n\n{\n\n  return a * a;\n}\n\ntemplate <class T>\ninline string tostring(T a)\n\n{\n\n  ostringstream os(\"\");\n\n  os << a;\n\n  return os.str();\n}\n\ntemplate <typename T>\ninline ll tolong(T a)\n\n{\n\n  ll res;\n\n  istringstream os(a);\n\n  os >> res;\n\n  return res;\n}\n\ntemplate <typename T>\ninline T gcd(T a, T b)\n\n{\n\n  if (b == 0)\n    return a;\n\n  else\n    return gcd(b, a % b);\n}\n\ntemplate <typename T>\ninline T bigmod(T a, T b, T m)\n\n{\n\n  if (b == 0)\n    return 1;\n\n  else if (b % 2 == 0)\n    return S(bigmod(a, b / 2, m)) % m;\n\n  else\n    return (a % m * bigmod(a, b - 1, m)) % m;\n}\n\nconst int inf = (int)1e9 + 5;\n\nconst ll linf = (ll)1e16 + 5;\n\nconst ll mod = (ll)1e9 + 7;\n\n#define N 20000009\n\nbool prime[N];\n\nvector<ll> prm;\n\nvoid seive()\n\n{\n\n  memset(prime, true, sizeof(prime));\n\n  for (ll i = 2; i * i <= N; i++)\n\n  {\n\n    if (prime[i] == true)\n\n    {\n\n      prm.pb(i);\n\n      for (ll j = i * i; j <= N; j += i)\n\n        prime[j] = false;\n    }\n  }\n}\n\nvoid pr(int f)\n\n{\n\n  if (f == 1)\n\n    cout << \"Yes\\n\";\n\n  else\n\n    cout << \"No\\n\";\n}\n\nmap<int, int> mp;\n\nset<int> s;\n\nint vis[111];\n\nint main()\n\n{\n\n  fast;\n\n  ll n, c = 0;\n\n  cin >> n;\n\n  for (ll i = 1; i <= n; i++)\n\n  {\n\n    string x = tostring(i);\n\n    if ((x.sz) % 2)\n      c++;\n  }\n\n  cout << c << endl;\n}\n","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  int n, i, j, count1, count2 = 0, d;\n\n  scanf(\"%d\", &n);\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    d = i;\n\n    count1 = 0;\n\n    while (d > 0)\n\n    {\n\n      d /= 10;\n\n      count1++;\n    }\n\n    if (count1 % 2 != 0)\n      count2++;\n  }\n\n  printf(\"%d\", count2);\n}\n"}
{"fast_code_id":"41cedfbd3634709ea493417abca241b46eef37e2e1b53ad5dbfe38980b974497","fast_id":"c47cdbd95d9becf0458906d888c249e9da53a6dc9cd654de27c7668c4e21167c","fast_time":0.0001917521,"language":"cpp","measured_fast_code_id":"c47cdbd95d9becf0458906d888c249e9da53a6dc9cd654de27c7668c4e21167c","measured_slow_code_id":"784ff1a3d58ad694e1cc2156ad116cad7be0f84b008988a52a1786d514217a15","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74212","problem_id":"p04046","slow_code_id":"f378a89b9850e2f049f5392c519a911886a38eea69f59b9e5218403df457615c","slow_id":"784ff1a3d58ad694e1cc2156ad116cad7be0f84b008988a52a1786d514217a15","slow_time":0.0043141673,"speedup":22.498670418733354,"stratum":"8+","sampling_key":"14ff34fdbadf9b7b2339e6f8a5fa03fe31a27f5565c94e13f4613e330a22b46a","slow_code":"#include <iostream>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <cstring>\n\ntypedef long long ll;\n\n#define rep(i, s, t) for (ll i = s; i < t; ++i)\n\n#define mod 1000000007\n\n#define maxn 200005\n\nusing namespace std;\n\nll fac[maxn], inv[maxn];\n\nint f(ll a, ll b)\n\n{\n\n  ll ans = 1;\n\n  while (b)\n\n  {\n\n    if (b % 2)\n\n      ans = ans * a % mod;\n\n    a = a * a % mod;\n\n    b /= 2;\n  }\n\n  return ans;\n}\n\nvoid init()\n\n{\n\n  fac[0] = 1;\n\n  rep(i, 1, maxn)\n\n      fac[i] = fac[i - 1] * i % mod;\n\n  inv[maxn - 1] = f(fac[maxn - 1], mod - 2);\n\n  for (ll i = maxn - 2; i >= 0; --i)\n\n    inv[i] = inv[i + 1] * (i + 1) % mod;\n}\n\nint main()\n\n{\n\n  init();\n\n  int h, w, a, b;\n\n  cin >> h >> w >> a >> b;\n\n  ll ans = 0;\n\n  for (int i = b + 1; i <= w; i++)\n\n  {\n\n    int sum = h - a + i - 2;\n\n    ll cmp1 = fac[sum] * inv[i - 1] % mod;\n\n    cmp1 = cmp1 * inv[h - a - 1] % mod;\n\n    sum = a + w - i - 1;\n\n    ll cmp2 = fac[sum] * inv[a - 1] % mod;\n\n    cmp2 = cmp2 * inv[w - i] % mod;\n\n    cmp1 = cmp1 * cmp2 % mod;\n\n    ans = (ans + cmp1) % mod;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define MOD 1000000007\n\n#define MAXN 200005\n\n#define LL long long\n\nLL inv[MAXN], s[MAXN];\n\nint N;\n\nint H, W, A, B;\n\nLL Pow(LL a, int b)\n\n{\n\n  LL ans = 1;\n\n  while (b)\n\n  {\n\n    if (b & 1)\n      ans = ans * a % MOD;\n\n    a = a * a % MOD;\n\n    b >>= 1;\n  }\n\n  return ans;\n}\n\nvoid Pre()\n\n{\n\n  s[0] = 1;\n\n  for (int i = 1; i <= N; i++)\n\n    s[i] = s[i - 1] * i % MOD;\n\n  inv[0] = 1;\n\n  inv[N] = Pow(s[N], MOD - 2);\n\n  for (int i = N - 1; i > 0; i--)\n\n    inv[i] = inv[i + 1] * (i + 1) % MOD;\n}\n\nLL C(int a, int b)\n\n{\n\n  if (a < 0 || b < 0)\n    return 1;\n\n  return s[a] * inv[b] % MOD * inv[a - b] % MOD;\n}\n\nint main()\n\n{\n\n  scanf(\"%d %d %d %d\", &H, &W, &A, &B);\n\n  N = H + W - 2;\n\n  Pre();\n\n  LL ans = C(H + W - 2, H - 1);\n\n  for (int i = 1; i <= B; i++)\n\n  {\n\n    ans -= C(H - A + i - 2, H - A - 1) * C(A - 1 + W - i, A - 1) % MOD;\n\n    ans = (ans % MOD + MOD) % MOD;\n  }\n\n  printf(\"%lld\\n\", ans);\n}\n"}
{"fast_code_id":"8216382cb8734fe48f6ba53393e068159a0e16aa6ad1c34d7b5e561cc36a3daf","fast_id":"2f211e07250c9c6e7ef7b3d6c7c5dd9c19a202c6ed044c3f77daf7c6e8370bed","fast_time":0.108119853,"language":"cpp","measured_fast_code_id":"2f211e07250c9c6e7ef7b3d6c7c5dd9c19a202c6ed044c3f77daf7c6e8370bed","measured_slow_code_id":"00ca9e9e2b8097784b555c2ceb46505c07706cdbe32174ed94c282d8e9bb7462","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74329","problem_id":"p03141","slow_code_id":"5b91657682b31ca077e7c22d9d693a9d08edb79d7c66e509c28662e23f296db6","slow_id":"00ca9e9e2b8097784b555c2ceb46505c07706cdbe32174ed94c282d8e9bb7462","slow_time":0.3764553487,"speedup":3.481833708190484,"stratum":"2-4","sampling_key":"cfe63d5cc3eb51330aeb8dc122775def9302c9c0c3cb7c1e32516e7933003ad8","slow_code":"\n\n#ifndef _GLIBCXX_NO_ASSERT\n\n#include <cassert>\n\n#endif\n\n#include <cctype>\n\n#include <cerrno>\n\n#include <cfloat>\n\n#include <ciso646>\n\n#include <climits>\n\n#include <clocale>\n\n#include <cmath>\n\n#include <csetjmp>\n\n#include <csignal>\n\n#include <cstdarg>\n\n#include <cstddef>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <ctime>\n\n#if __cplusplus >= 201103L\n\n#include <ccomplex>\n\n#include <cfenv>\n\n#include <cinttypes>\n\n#include <cstdbool>\n\n#include <cstdint>\n\n#include <ctgmath>\n\n#include <cwchar>\n\n#include <cwctype>\n\n#endif\n\n#include <algorithm>\n\n#include <bitset>\n\n#include <complex>\n\n#include <deque>\n\n#include <exception>\n\n#include <fstream>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <ios>\n\n#include <iosfwd>\n\n#include <iostream>\n\n#include <istream>\n\n#include <iterator>\n\n#include <limits>\n\n#include <list>\n\n#include <locale>\n\n#include <map>\n\n#include <memory>\n\n#include <new>\n\n#include <numeric>\n\n#include <ostream>\n\n#include <queue>\n\n#include <set>\n\n#include <sstream>\n\n#include <stack>\n\n#include <stdexcept>\n\n#include <streambuf>\n\n#include <string>\n\n#include <typeinfo>\n\n#include <utility>\n\n#include <valarray>\n\n#include <vector>\n\n#if __cplusplus >= 201103L\n\n#include <array>\n\n#include <atomic>\n\n#include <chrono>\n\n#include <condition_variable>\n\n#include <forward_list>\n\n#include <future>\n\n#include <initializer_list>\n\n#include <mutex>\n\n#include <random>\n\n#include <ratio>\n\n#include <regex>\n\n#include <scoped_allocator>\n\n#include <system_error>\n\n#include <thread>\n\n#include <tuple>\n\n#include <typeindex>\n\n#include <type_traits>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#endif\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)(1000000007)\n\n#define intt long long\n\nusing namespace std;\n\nint modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % mod;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ndouble kyori(pair<int, int> f, pair<int, int> s) {\n\n  double ans = 0;\n\n  double t = fabs(f.first - s.first);\n\n  double y = fabs(f.second - s.second);\n\n  ans = sqrt(t * t + y * y);\n\n  return ans;\n}\n\nint gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nvector<int> v[100004];\n\nbool went[100004];\n\nvoid dfs(int x) {\n\n  went[x] = true;\n\n  for (int i = 0; i < (int)v[x].size(); i++) {\n\n    if (!went[v[x][i]]) {\n\n      dfs(v[x][i]);\n    }\n  }\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\nint lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\nint fukugen(vector<int> l) {\n\n  int ans = 0;\n\n  for (int i = 0; i < (int)l.size(); i++) {\n\n    ans *= 10;\n\n    ans += l[i];\n  }\n\n  return ans;\n}\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nint n, sum, a, b;\n\npriority_queue<int> p;\n\nsigned main() {\n\n  cin >> n;\n\n  rep(i, n) {\n\n    cin >> a >> b;\n\n    sum -= b;\n\n    p.push(a + b);\n  }\n\n  for (int i = 1; i <= n; i++) {\n\n    if (i & 1) {\n\n      sum += p.top();\n    }\n\n    p.pop();\n  }\n\n  cout << sum << endl;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\n#define f(i, n) for (int i = 0; i < (n); i++)\n\n#define inf (int)(3e18)\n\n#define int long long\n\n#define mod (int)((1e9) + 7)\n\n#define intt long long\n\n#define itn long long\n\n#define P pair<int, int>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define REP(i, n) for (int i = 1; i <= n; i++)\n\n#define ALL(v) v.begin(), v.end()\n\nusing namespace std;\n\ninline int modpow(int x, int y, int m = mod) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n\n      res %= m;\n    }\n\n    x = x * x % m;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nint mypow(int x, int y) {\n\n  int res = 1;\n\n  while (y) {\n\n    if (y % 2) {\n\n      res *= x;\n    }\n\n    x = x * x;\n\n    y /= 2;\n  }\n\n  return res;\n}\n\nbool prime(int x) {\n\n  for (int i = 2; i * i <= x; i++) {\n\n    if (!(x % i)) {\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\ninline int gcd(int x, int y) {\n\n  if (!y) {\n\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint keta(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    x /= 10;\n\n    ans++;\n  }\n\n  return ans;\n}\n\nint ketasum(int x) {\n\n  int ans = 0;\n\n  while (x) {\n\n    ans += x % 10;\n\n    x /= 10;\n  }\n\n  return ans;\n}\n\ninline int lcm(int x, int y) {\n\n  int ans = x / gcd(x, y) * y;\n\n  return ans;\n}\n\nint twobeki(int x) {\n\n  int ans = 0;\n\n  while (1) {\n\n    if (!(x & 1)) {\n\n      ans++;\n\n      x /= 2;\n\n    }\n\n    else {\n\n      break;\n    }\n  }\n\n  return ans;\n}\n\ntemplate <class T, class U>\n\ninline bool chmax(T &lhs, const U &rhs) {\n\n  if (lhs < rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\ntemplate <class T, class U>\n\ninline bool chmin(T &lhs, const U &rhs) {\n\n  if (lhs > rhs) {\n\n    lhs = rhs;\n\n    return 1;\n  }\n\n  return 0;\n}\n\nvoid Yes() { cout << \"Yes\" << endl; }\n\nvoid No() { cout << \"No\" << endl; }\n\nvoid YES() { cout << \"YES\" << endl; }\n\nvoid NO() { cout << \"NO\" << endl; }\n\n#define fin(i) scanf(\"%lld\", &i)\n\n#define fout(i) printf(\"%lld\", i)\n\n#define fendl printf(\"\\n\")\n\nint kai(int x, int y) {\n\n  int res = 1;\n\n  for (int i = x - y + 1; i <= x; i++) {\n\n    res *= i;\n    res %= mod;\n  }\n\n  return res;\n}\n\nint comb(int x, int y) {\n\n  if (y > x)\n    return 0;\n\n  return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;\n}\n\n#define vecin(v)                                                                                   \\\n  for (int i = 0; i < v.size(); i++)                                                               \\\n    scanf(\"%lld\", &v[i]);\n\n#define vecout(v)                                                                                  \\\n  {                                                                                                \\\n    for (int i = 0; i < (int)v.size(); i++)                                                        \\\n      printf(\"%lld \", v[i]);                                                                       \\\n    printf(\"\\n\");                                                                                  \\\n  }\n\ntemplate <class T>\n\nclass SegTree {\n\n  int n;\n\n  vector<T> data;\n\n  T def;\n\n  function<T(T, T)> operation;\n\n  function<T(T, T)> update;\n\n  T _query(int a, int b, int k, int l, int r) {\n\n    if (r <= a || b <= l)\n      return def;\n\n    if (a <= l && r <= b)\n\n      return data[k];\n\n    else {\n\n      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);\n\n      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);\n\n      return operation(c1, c2);\n    }\n  }\n\npublic:\n  SegTree(size_t _n, T _def, function<T(T, T)> _operation,\n\n          function<T(T, T)> _update)\n\n      : def(_def), operation(_operation), update(_update) {\n\n    n = 1;\n\n    while (n < _n) {\n\n      n *= 2;\n    }\n\n    data = vector<T>(2 * n - 1, def);\n  }\n\n  void change(int i, T x) {\n\n    i += n - 1;\n\n    data[i] = update(data[i], x);\n\n    while (i > 0) {\n\n      i = (i - 1) / 2;\n\n      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);\n    }\n  }\n\n  T query(int a, int b) { return _query(a, b, 0, 0, n); }\n\n  T operator[](int i) { return data[i + n - 1]; }\n};\n\n#define R_MIN ([](long long a, long long b) { return min(a, b); })\n\n#define R_MAX ([](long long a, long long b) { return max(a, b); })\n\n#define R_SUM ([](long long a, long long b) { return a + b; })\n\n#define NORMAL_UPDATE ([](long long a, long long b) { return b; })\n\n#define ADD_UPDATE ([](long long a, long long b) { return a + b; })\n\n#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }\n\nclass Union_Find {\n\n  vector<int> par;\n\n  vector<int> rankmy;\n\n  vector<int> ookisa;\n\npublic:\n  Union_Find(int size) {\n\n    par = vector<int>(size);\n\n    rankmy = vector<int>(size);\n\n    ookisa = vector<int>(size);\n\n    for (int i = 0; i < size; i++) {\n\n      par[i] = i;\n\n      ookisa[i] = 1;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x) {\n\n      return x;\n    }\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y) {\n\n      return;\n    }\n\n    if (rankmy[x] < rankmy[y]) {\n\n      par[x] = y;\n\n      ookisa[y] += ookisa[x];\n\n      ookisa[x] = 0;\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      ookisa[x] += ookisa[y];\n\n      ookisa[y] = 0;\n\n      if (rankmy[x] == rankmy[y]) {\n\n        rankmy[x]++;\n      }\n    }\n  }\n\n  int size(int i) {\n\n    i = find(i);\n\n    return ookisa[i];\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\n#define endl \"\\n\"\n\nint perm[1000005];\n\nvoid init_perm() {\n\n  perm[0] = 1;\n\n  REP(i, 1000000) { perm[i] = perm[i - 1] * i % mod; }\n}\n\nint nCk(int x, int y) {\n\n  return perm[x] * modpow(perm[x - y], mod - 2) % mod * modpow(perm[y], mod - 2) % mod;\n}\n\nint n, a[100004], b[100004], cnt, cnt2;\n\nvector<P> v, v2;\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  std::cin.tie(nullptr);\n\n  cin >> n;\n\n  rep(i, n) {\n\n    cin >> a[i] >> b[i];\n\n    v.emplace_back(a[i] + b[i], i);\n  }\n\n  sort(ALL(v));\n\n  rep(i, n) {\n\n    if (i & 1) {\n\n      cnt2 += b[v.back().second];\n\n    } else {\n\n      cnt += a[v.back().second];\n    }\n\n    v.pop_back();\n  }\n\n  cout << cnt - cnt2 << endl;\n}\n"}
{"fast_code_id":"46adfc6e6be3dc6e1763c27be97bcfb54843486495812a9f8e635c74942e90d1","fast_id":"b82a0fc3aa8e171ec68e3c65a2dbcf2b57615834856ec141014faabad6afa052","fast_time":0.0116265504,"language":"cpp","measured_fast_code_id":"b82a0fc3aa8e171ec68e3c65a2dbcf2b57615834856ec141014faabad6afa052","measured_slow_code_id":"1b2d2120bd135beeaddcfc7e438107640ca497f70df4e188e5f23ffbe089c2ed","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74332","problem_id":"p02908","slow_code_id":"9cf9fe371616c875ca58dc9915b0c9ed86f51a584d10266035b25a1aee404bfe","slow_id":"1b2d2120bd135beeaddcfc7e438107640ca497f70df4e188e5f23ffbe089c2ed","slow_time":0.0399499257,"speedup":3.436094484224659,"stratum":"2-4","sampling_key":"45127cd93008a415cfb582a37cb38dca1b419c2c733b91afd96dd25c48663e5c","slow_code":"#include <bits/stdc++.h>\n\n#define fi first\n\n#define se second\n\nconst int N = 100100;\n\nusing namespace std;\n\nstruct edge {\n\n  int a, b, c, flow;\n};\n\nconst int MAXN = 200200;\n\nconst int inf_int = 1e9;\n\nstruct Flow {\n\n  vector<int> g[MAXN];\n\n  vector<edge> e;\n\n  inline int add_edge(int a, int b, int c) {\n\n    edge e1 = {a, b, c, 0};\n\n    edge e2 = {b, a, 0, 0};\n\n    int id = e.size();\n\n    g[a].push_back(id);\n\n    e.push_back(e1);\n\n    g[b].push_back(id + 1);\n\n    e.push_back(e2);\n\n    return id;\n  }\n\n  int s, t, n;\n\n  int ptr[MAXN], dis[MAXN], q[MAXN];\n\n  void init(int S, int T, int N) {\n\n    s = S;\n\n    t = T;\n\n    n = N;\n  }\n\n  bool bfs() {\n\n    fill(dis, dis + n, inf_int);\n\n    dis[s] = 0;\n\n    int qh = 0, qt = 1;\n\n    q[0] = s;\n\n    while (qh < qt) {\n\n      int v = q[qh++];\n\n      for (int id : g[v]) {\n\n        edge &r = e[id];\n\n        int to = r.b;\n\n        if (r.c > r.flow && dis[to] > dis[v] + 1) {\n\n          dis[to] = dis[v] + 1;\n\n          q[qt++] = to;\n        }\n      }\n    }\n\n    return dis[t] != inf_int;\n  }\n\n  int dfs(int v, int flow) {\n\n    if (v == t)\n\n      return flow;\n\n    for (; ptr[v] < g[v].size(); ++ptr[v]) {\n\n      int id = g[v][ptr[v]];\n\n      edge &r = e[id];\n\n      if (r.c > r.flow && dis[r.b] == dis[v] + 1) {\n\n        int pushed = dfs(r.b, min(flow, r.c - r.flow));\n\n        if (pushed) {\n\n          e[id].flow += pushed;\n\n          e[id ^ 1].flow -= pushed;\n\n          return pushed;\n        }\n      }\n    }\n\n    return 0;\n  }\n\n  void delete_all() {\n\n    e.clear();\n\n    for (int i = 0; i < n; ++i) {\n\n      g[i].clear();\n    }\n  }\n\n  void clear() {\n\n    int m = e.size();\n\n    for (int i = 0; i < m; ++i) {\n\n      e[i].flow = 0;\n    }\n  }\n\n  int flow() {\n\n    int res = 0;\n\n    while (bfs()) {\n\n      fill(ptr, ptr + n, 0);\n\n      while (int pushed = dfs(s, inf_int)) {\n\n        res += pushed;\n      }\n    }\n\n    return res;\n  }\n\n} flow;\n\nint n;\n\nint p[N];\n\nint q[N];\n\nint A[N];\n\nint B[N];\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(0);\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> p[i];\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> q[i];\n  }\n\n  int G = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    if (A[i] == 0) {\n\n      G += 1;\n\n      A[i] = G;\n\n      int j = p[i];\n\n      while (j != i) {\n\n        A[j] = G;\n\n        j = p[j];\n      }\n    }\n\n    if (B[i] == 0) {\n\n      G += 1;\n\n      B[i] = G;\n\n      int j = q[i];\n\n      while (j != i) {\n\n        B[j] = G;\n\n        j = q[j];\n      }\n    }\n  }\n\n  G += 1;\n\n  flow.init(0, G, G + 1);\n\n  int res = n;\n\n  for (int i = 0; i < n; i++) {\n\n    if (p[i] == i && q[i] == i) {\n\n      res -= 1;\n\n    } else if (p[i] == i) {\n\n      flow.add_edge(B[i], G, 1);\n\n    } else if (q[i] == i) {\n\n      flow.add_edge(0, A[i], 1);\n\n    } else {\n\n      flow.add_edge(B[i], A[i], 1);\n\n      if (p[i] == q[i]) {\n\n        flow.add_edge(A[i], B[i], 1);\n      }\n    }\n  }\n\n  res -= flow.flow();\n\n  cout << res << '\\n';\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define fi first\n\n#define se second\n\nconst int N = 100100;\n\nusing namespace std;\n\nnamespace Dinic {\n\nusing F = int;\n\nconst F INF = 1e9 + 1e8;\n\nconst int N = 220000;\n\nconst int M = 1100000;\n\nint fst[N], nxt[M], to[M];\n\nF cap[M];\n\nint dis[N], q[N], ptr[N];\n\nint E;\n\nvoid init() {\n\n  memset(fst, -1, sizeof fst);\n\n  E = 0;\n}\n\ninline void add_edge(int u, int v, F c) {\n\n  to[E] = v, cap[E] = c, nxt[E] = fst[u], fst[u] = E++;\n\n  to[E] = u, cap[E] = 0, nxt[E] = fst[v], fst[v] = E++;\n}\n\ninline bool bfs(int S, int T, int n) {\n\n  memset(dis, -1, sizeof(int) * n);\n\n  int h = 0, t = 0;\n\n  dis[S] = 0, q[t++] = S;\n\n  while (h < t) {\n\n    int u = q[h++];\n\n    for (int e = fst[u]; ~e; e = nxt[e])\n      if (cap[e] > 0 && dis[to[e]] == -1) {\n\n        dis[to[e]] = dis[u] + 1, q[t++] = to[e];\n\n        if (to[e] == T)\n          return 1;\n      }\n  }\n\n  return (dis[T] != -1);\n}\n\nF dfs(int u, int T, F f) {\n\n  if (u == T)\n    return f;\n\n  for (int &e = ptr[u]; ~e; e = nxt[e])\n    if (cap[e] > 0 && dis[to[e]] > dis[u]) {\n\n      F ret = dfs(to[e], T, min(f, cap[e]));\n\n      if (ret > 0) {\n\n        cap[e] -= ret, cap[e ^ 1] += ret;\n\n        return ret;\n      }\n    }\n\n  return 0;\n}\n\nF max_flow(int S, int T, int n) {\n\n  F ret = 0;\n\n  while (bfs(S, T, n)) {\n\n    memcpy(ptr, fst, sizeof(int) * n);\n\n    for (F cur; (cur = dfs(S, T, INF)) > 0; ret += cur)\n      ;\n  }\n\n  return ret;\n}\n\n};                   \n\nint n;\n\nint p[N];\n\nint q[N];\n\nint A[N];\n\nint B[N];\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(0);\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> p[i];\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> q[i];\n  }\n\n  int G = 0;\n\n  for (int i = 0; i < n; i++) {\n\n    if (A[i] == 0) {\n\n      G += 1;\n\n      A[i] = G;\n\n      int j = p[i];\n\n      while (j != i) {\n\n        A[j] = G;\n\n        j = p[j];\n      }\n    }\n\n    if (B[i] == 0) {\n\n      G += 1;\n\n      B[i] = G;\n\n      int j = q[i];\n\n      while (j != i) {\n\n        B[j] = G;\n\n        j = q[j];\n      }\n    }\n  }\n\n  G += 1;\n\n  Dinic::init();\n\n  int res = n;\n\n  for (int i = 0; i < n; i++) {\n\n    if (p[i] == i && q[i] == i) {\n\n      res -= 1;\n\n    } else if (p[i] == i) {\n\n      Dinic::add_edge(B[i], G, 1);\n\n    } else if (q[i] == i) {\n\n      Dinic::add_edge(0, A[i], 1);\n\n    } else {\n\n      Dinic::add_edge(B[i], A[i], 1);\n\n      if (p[i] == q[i]) {\n\n        Dinic::add_edge(A[i], B[i], 1);\n      }\n    }\n  }\n\n  res -= Dinic::max_flow(0, G, G + 1);\n\n  cout << res << '\\n';\n}\n"}
{"fast_code_id":"12d09c5f6f6e7cb5572271041f4e051d17d192da64875d419cc22b6bd8370366","fast_id":"47fe4941654ad2079982c2cb5428a04cf81e76d7c5b1416c6b2646f57cf47c00","fast_time":0.0114670713,"language":"cpp","measured_fast_code_id":"47fe4941654ad2079982c2cb5428a04cf81e76d7c5b1416c6b2646f57cf47c00","measured_slow_code_id":"b16eeecd72d5e477375c119c8bb22a1ef8cb21a0bc58f607db32794b20e1977e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74345","problem_id":"p02793","slow_code_id":"0a2da038879731f91b29903e2513c4fdcaf421655c5451fd22da6249981ca4f9","slow_id":"b16eeecd72d5e477375c119c8bb22a1ef8cb21a0bc58f607db32794b20e1977e","slow_time":0.3030319046,"speedup":26.42626845792788,"stratum":"8+","sampling_key":"51ab14554d7e87f09afcff1edc279d6fd187f0ebd40ad0cb5b737274b5e38e01","slow_code":"#include <stdio.h>\n\n#pragma GCC optimize(\"Os\")\n\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\n\nconst int MOD = 1e9 + 7, MAX = 1e6;\n\nint A[10000];\n\nstatic inline char CH()\n\n{\n\n  static char buf[100000], *ptr1 = buf, *ptr2 = buf;\n\n  return ptr1 == ptr2 && (ptr2 = (ptr1 = buf) + fread(buf, 1, 100000, stdin),\n                          ptr1 == ptr2)\n             ? EOF\n             : *ptr1++;\n}\n\nstatic inline int IN(void)\n\n{\n\n  int x = 0, f = 0, c = CH();\n  while (c < 48 || c > 57) {\n    f ^= c == 45, c = CH();\n  }\n\n  while (c > 47 && c < 58) {\n    x = x * 10 + c - 48, c = CH();\n  }\n  return f ? -x : x;\n}\n\ntypedef struct {\n  int SPF[1000001];\n  int Primes[168];\n  int sz;\n} Template;\n\nTemplate P;\n\nstatic inline int MPow(int a, int b) {\n  return b ? 1l * MPow(1l * a * a % MOD, b >> 1) * (b & 1 ? a : 1) % MOD : 1;\n}\n\nstatic inline void ready(void)\n\n{\n\n  *P.SPF = 1, *P.Primes = 2, P.sz = 1;\n\n  rep(i, MAX / 2) P.SPF[2 * (i + 1)] = 2,\n                                 P.SPF[2 * (i + 1) - 1] = 2 * (i + 1) - 1;\n\n  rep(i, MAX / 2 - 1)\n\n  {\n\n    int x = 2 * (i + 1) + 1;\n    if (P.SPF[x] == x) {\n      P.Primes[P.sz++] = x;\n    }\n    if (x * x > MAX)\n      break;\n\n    rep(j, P.sz) {\n      if (P.Primes[j] <= P.SPF[x] && x * P.Primes[j] <= MAX)\n        P.SPF[x * P.Primes[j]] = P.Primes[j];\n      else\n        break;\n    }\n  }\n}\n\nstatic inline int count(const int prime, const int sz)\n\n{\n\n  int max = 0;\n  rep(i, sz) {\n    int now = 0;\n    while (A[i] % prime == 0) {\n      now++;\n      A[i] /= prime;\n    }\n    if (max < now)\n      max = now;\n  }\n  return max;\n}\n\nint main(void)\n\n{\n\n  int N = IN(), x = 0;\n  ready();\n\n  rep(i, N) {\n    A[i] = IN();\n    x = (x + 1l * MPow(A[i], MOD - 2)) % MOD;\n  }\n\n  rep(i, 168) x = 1l * x * MPow(P.Primes[i], count(P.Primes[i], N)) % MOD;\n\n  rep(i, N) {\n    if (A[i] > 1) {\n      rep(j, N - 1 - i) {\n        if (A[i] == A[i + j + 1]) {\n          A[i + j + 1] = 1;\n        }\n      }\n      x = 1l * x * A[i] % MOD;\n    }\n  }\n\n  return printf(\"%d\\n\", x), 0;\n}","fast_code":"#include <stdio.h>\n\n#pragma GCC optimize(\"Os\")\n\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\n\nconst int MOD = 1e9 + 7, MAX = 1e6,\n          Primes[168] =\n\n              {2,   3,   5,   7,   11,  13,  17,  19,  23,  29,\n               31,  37,  41,  43,  47,  53,  59,  61,  67,  71,\n\n               73,  79,  83,  89,  97,  101, 103, 107, 109, 113,\n               127, 131, 137, 139, 149, 151, 157, 163, 167, 173,\n\n               179, 181, 191, 193, 197, 199, 211, 223, 227, 229,\n               233, 239, 241, 251, 257, 263, 269, 271, 277, 281,\n\n               283, 293, 307, 311, 313, 317, 331, 337, 347, 349,\n               353, 359, 367, 373, 379, 383, 389, 397, 401, 409,\n\n               419, 421, 431, 433, 439, 443, 449, 457, 461, 463,\n               467, 479, 487, 491, 499, 503, 509, 521, 523, 541,\n\n               547, 557, 563, 569, 571, 577, 587, 593, 599, 601,\n               607, 613, 617, 619, 631, 641, 643, 647, 653, 659,\n\n               661, 673, 677, 683, 691, 701, 709, 719, 727, 733,\n               739, 743, 751, 757, 761, 769, 773, 787, 797, 809,\n\n               811, 821, 823, 827, 829, 839, 853, 857, 859, 863,\n               877, 881, 883, 887, 907, 911, 919, 929, 937, 941,\n\n               947, 953, 967, 971, 977, 983, 991, 997};\n\nint A[10000];\n\nstatic inline char CH()\n\n{\n\n  static char buf[100000], *ptr1 = buf, *ptr2 = buf;\n\n  return ptr1 == ptr2 && (ptr2 = (ptr1 = buf) + fread(buf, 1, 100000, stdin),\n                          ptr1 == ptr2)\n             ? EOF\n             : *ptr1++;\n}\n\nstatic inline int IN(void)\n\n{\n\n  int x = 0, f = 0, c = CH();\n  while (c < 48 || c > 57) {\n    f ^= c == 45, c = CH();\n  }\n\n  while (c > 47 && c < 58) {\n    x = x * 10 + c - 48, c = CH();\n  }\n  return f ? -x : x;\n}\n\nstatic inline int MPow(int a, int b) {\n  return b ? 1l * MPow(1l * a * a % MOD, b >> 1) * (b & 1 ? a : 1) % MOD : 1;\n}\n\nstatic inline int count(const int prime, const int sz)\n\n{\n\n  int max = 0;\n  rep(i, sz) {\n    int now = 0;\n    while (A[i] % prime == 0) {\n      now++;\n      A[i] /= prime;\n    }\n    if (max < now)\n      max = now;\n  }\n  return max;\n}\n\nint main(void)\n\n{\n\n  int N = IN(), x = 0;\n\n  rep(i, N) {\n    A[i] = IN();\n    x = (x + 1l * MPow(A[i], MOD - 2)) % MOD;\n  }\n\n  rep(i, 168) x = 1l * x * MPow(Primes[i], count(Primes[i], N)) % MOD;\n\n  rep(i, N) {\n    if (A[i] > 1) {\n      rep(j, N - 1 - i) {\n        if (A[i] == A[i + j + 1]) {\n          A[i + j + 1] = 1;\n        }\n      }\n      x = 1l * x * A[i] % MOD;\n    }\n  }\n\n  return printf(\"%d\\n\", x), 0;\n}"}
{"fast_code_id":"8609f9af91334a1bee7cc28c3431978ec9c4ed31964800e3c780a9c21d386f7b","fast_id":"72bb64e3920a1de9f57752fd6d99f7bac2bf71f454930121826a7d92cd0449ff","fast_time":0.0681199673,"language":"cpp","measured_fast_code_id":"72bb64e3920a1de9f57752fd6d99f7bac2bf71f454930121826a7d92cd0449ff","measured_slow_code_id":"df8cd8325ac3e65e60dcd5fa59e0dc9d8def94951b9f93e0203a3e1f6da806ab","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74356","problem_id":"p00719","slow_code_id":"c91e126735271ac4dc0654f25332f12f7f2a444e55a12e6735a755c89de43292","slow_id":"df8cd8325ac3e65e60dcd5fa59e0dc9d8def94951b9f93e0203a3e1f6da806ab","slow_time":0.220687743,"speedup":3.239692438901097,"stratum":"2-4","sampling_key":"bddf53ec3acaf0a4012d340f0df1a2c3f8791f344cd905a3ccc3d4a687892a69","slow_code":"#include <iostream>\n\n#include <vector>\n\n#include <queue>\n\n#include <cstdio>\n\n#include <map>\n\n#define INF (1 << 24)\n\n#define MASK (1 << 10) - 1\n\n#define fr first\n\n#define sc second\n\nusing namespace std;\n\ntypedef pair<double, double> S;\n\ntypedef pair<S, int> P;\n\nstruct edge {\n\n  double to, time;\n  edge() {}\n\n  edge(double to, double time) : to(to), time(time) {}\n};\n\ndouble n, m, p, a, b, timed[101][1500];\n\nvector<double> ti(11);\n\nvector<vector<edge> > info(101);\n\nvoid init() {\n\n  for (int i = 0; i < 101; i++) {\n\n    for (int j = 0; j < 1500; j++)\n      timed[i][j] = INF;\n  }\n\n  info.resize(0);\n  info.resize(101);\n\n  ti.resize(0);\n  ti.resize(11);\n}\n\nvoid add_info() {\n\n  double x, y, z;\n\n  cin >> x >> y >> z;\n\n  info[(int)x].push_back(edge(y, z));\n\n  info[(int)y].push_back(edge(x, z));\n}\n\ndouble Dijkstra() {\n\n  priority_queue<P, vector<P>, greater<P> > que;\n\n  que.push(P(S(0, a), MASK));\n\n  timed[(int)a][MASK] = 0;\n\n  while (!que.empty()) {\n\n    P p = que.top();\n    que.pop();\n\n    double now = p.fr.sc, t = p.fr.fr;\n\n    int bit = p.sc;\n\n    if (now == b)\n      return t;\n\n    for (int i = 0; i < info[(int)now].size(); i++) {\n\n      edge e = info[(int)now][i];\n\n      for (int j = 0; j < n; j++) {\n\n        if (bit >> j & 1) {\n\n          if (e.time / ti[j] + t < timed[(int)e.to][bit & ~(1 << j)]) {\n\n            que.push(P(S(e.time / ti[j] + t, e.to), bit & ~(1 << j)));\n\n            timed[(int)e.to][bit & ~(1 << j)] = e.time / ti[j] + t;\n          }\n        }\n      }\n    }\n  }\n\n  return -1;\n}\n\nint main() {\n\n  while (cin >> n >> m >> p >> a >> b, n || m || p || a || b) {\n\n    init();\n\n    for (int i = 0; i < n; i++)\n      cin >> ti[i];\n\n    for (int i = 0; i < p; i++)\n      add_info();\n\n    double d = Dijkstra();\n\n    if (d != -1)\n      printf(\"%.3f\\n\", d);\n\n    else\n      cout << \"Impossible\" << endl;\n  }\n}","fast_code":"#include <iostream>\n\n#include <queue>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define INF 1000000000\n\nstruct edge {\n\n  int to;\n\n  double dis;\n\n  edge(int to, double dis) : to(to), dis(dis) {}\n};\n\ntypedef pair<int, int> iP;\n\ntypedef pair<double, iP> iiP;\n\nint n, m, p, a, b;\n\nint t[8];\n\nvector<vector<edge> > graph;\n\ndouble dijkstra() {\n\n  double dist[31][1 << 8];\n\n  priority_queue<iiP, vector<iiP>, greater<iiP> > que;\n\n  fill_n(*dist, 31 * (1 << 8), INF);\n\n  que.push(iiP(0.0, iP(a, (1 << n) - 1)));\n\n  dist[a][1 << n - 1] = 0.0;\n\n  while (!que.empty()) {\n\n    iiP p = que.top();\n    que.pop();\n\n    int now = p.second.first, tt = p.second.second;\n\n    double dis = p.first;\n\n    if (now == b)\n      return dis;\n\n    for (int i = 0; i < graph[now].size(); i++) {\n\n      edge &e = graph[now][i];\n\n      for (int j = 0; j < n; j++) {\n\n        if (tt & (1 << j)) {\n\n          int next_bit = tt & ~(1 << j);\n\n          if (dis + e.dis / t[j] < dist[e.to][next_bit]) {\n\n            que.push(iiP(dis + e.dis / t[j], iP(e.to, next_bit)));\n\n            dist[e.to][next_bit] = dis + e.dis / t[j];\n          }\n        }\n      }\n    }\n  }\n\n  return -1;\n}\n\nint main() {\n\n  while (cin >> n >> m >> p >> a >> b, n) {\n\n    graph.resize(m + 1);\n\n    for (int i = 0; i < n; i++)\n\n      cin >> t[i];\n\n    for (int i = 0; i < p; i++) {\n\n      int x, y;\n      double dis;\n\n      cin >> x >> y >> dis;\n\n      graph[x].push_back(edge(y, dis));\n\n      graph[y].push_back(edge(x, dis));\n    }\n\n    double ans = dijkstra();\n\n    if (ans != -1) {\n\n      cout << ans << endl;\n\n    } else {\n\n      cout << \"Impossible\" << endl;\n    }\n\n    for (int i = 0; i <= m; i++) {\n\n      graph[i].clear();\n    }\n    graph.clear();\n  }\n}"}
{"fast_code_id":"e93a63bb372f3a80d28dbb7311c7731f7c7265ddd1b41f6b172438dad3755de0","fast_id":"d2739ec06357c074f70027a9bdc25c2bf01ec32a43f5cdeaf75a21bbc3e7aeb1","fast_time":0.0039991125,"language":"cpp","measured_fast_code_id":"d2739ec06357c074f70027a9bdc25c2bf01ec32a43f5cdeaf75a21bbc3e7aeb1","measured_slow_code_id":"7aeeb6b4ae48d159109b60d4d48cb83b07afab1358faa80ad4624f082dc41cfa","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74379","problem_id":"p03718","slow_code_id":"f1dcd12b3f42919b50ee3ae1309e5b47f7910ea7c15c8d586f4800f8e9fb0696","slow_id":"7aeeb6b4ae48d159109b60d4d48cb83b07afab1358faa80ad4624f082dc41cfa","slow_time":0.0226866446,"speedup":5.672919829087079,"stratum":"4-8","sampling_key":"a6edd6568521381b14bd5e954aabc27e8af4b30f7cc6351ea514b41926dff908","slow_code":"#include <bits/stdc++.h>\n\n#define INF 0x7fffffff\n\nusing namespace std;\n\nstruct Edge {\n  int to, capa, flow, next;\n} e[4000000];\n\nint h[20010], sum = -1, n, m, S, T;\n\nint mp[110][110], tot = 0;\n\nbool vis[20010];\n\nint d[20010], cur[20010];\n\nvoid AddEdge(int u, int v, int w)\n\n{\n\n  e[++sum].to = v;\n\n  e[sum].capa = w;\n\n  e[sum].flow = 0;\n\n  e[sum].next = h[u];\n\n  h[u] = sum;\n}\n\nvoid add_edge(int u, int v, int w)\n\n{\n\n  AddEdge(u, v, w);\n\n  AddEdge(v, u, 0);\n}\n\nbool BFS()\n\n{\n\n  memset(vis, 0, sizeof(vis));\n\n  queue<int> q;\n\n  vis[S] = 1;\n  d[S] = 0;\n\n  q.push(S);\n\n  while (!q.empty())\n\n  {\n\n    int u = q.front();\n\n    for (int tmp = h[u]; ~tmp; tmp = e[tmp].next)\n\n      if (!vis[e[tmp].to] && e[tmp].capa > e[tmp].flow)\n\n      {\n\n        d[e[tmp].to] = d[u] + 1;\n\n        vis[e[tmp].to] = 1;\n\n        q.push(e[tmp].to);\n      }\n\n    q.pop();\n  }\n\n  return vis[T + tot];\n}\n\nint DFS(int u, int a)\n\n{\n\n  if (u == T + tot || a == 0)\n    return a;\n\n  int flow = 0, f;\n\n  for (int &tmp = cur[u]; ~tmp; tmp = e[tmp].next)\n\n    if (d[e[tmp].to] == d[u] + 1)\n\n    {\n\n      f = DFS(e[tmp].to, min(a, e[tmp].capa - e[tmp].flow));\n\n      if (f > 0)\n\n      {\n\n        flow += f;\n        a -= f;\n\n        e[tmp].flow += f;\n\n        e[tmp ^ 1].flow -= f;\n\n        if (a == 0)\n          break;\n      }\n    }\n\n  return flow;\n}\n\nint Dinic()\n\n{\n\n  int flow = 0;\n\n  while (BFS())\n\n  {\n\n    for (int i = 1; i <= 2 * tot; i++)\n      cur[i] = h[i];\n\n    flow += DFS(S, INF);\n  }\n\n  return flow == INF ? -1 : flow;\n}\n\nint main()\n\n{\n\n  static char s[110];\n\n  scanf(\"%d%d\", &n, &m);\n\n  memset(h, -1, sizeof(h));\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%s\", s + 1);\n\n    for (int j = 1; j <= m; j++)\n\n    {\n\n      if (s[j] != '.')\n        mp[i][j] = ++tot;\n\n      if (s[j] == 'S')\n        S = tot;\n\n      if (s[j] == 'T')\n        T = tot;\n    }\n  }\n\n  for (int i = 1; i <= tot; i++)\n\n    if (i != S && i != T)\n      add_edge(i, i + tot, 1);\n\n  add_edge(S, S + tot, INF);\n\n  add_edge(T, T + tot, INF);\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= m; j++)\n\n    {\n\n      int u = mp[i][j];\n\n      if (!u)\n        continue;\n\n      for (int k = 1; k <= n; k++)\n\n        if (k != i && mp[k][j])\n\n          add_edge(u + tot, mp[k][j], INF);\n\n      for (int k = 1; k <= m; k++)\n\n        if (k != j && mp[i][k])\n\n          add_edge(u + tot, mp[i][k], INF);\n    }\n\n  printf(\"%d\\n\", Dinic());\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\nnamespace MF {\n\n#define MAXN 50000\n\n#define MAXM 500000\n\n#define wint int\n\nconst wint wEPS = 0;\n\nconst wint wINF = 1001001001;\n\nint n, m, ptr[MAXN], next[MAXM], zu[MAXM];\n\nwint capa[MAXM], tof;\n\nint lev[MAXN], see[MAXN], que[MAXN], *qb, *qe;\n\nvoid init(int _n) {\n\n  n = _n;\n  m = 0;\n  memset(ptr, ~0, n * 4);\n}\n\nvoid ae(int u, int v, wint w0, wint w1 = 0) {\n\n  next[m] = ptr[u];\n  ptr[u] = m;\n  zu[m] = v;\n  capa[m] = w0;\n  ++m;\n\n  next[m] = ptr[v];\n  ptr[v] = m;\n  zu[m] = u;\n  capa[m] = w1;\n  ++m;\n}\n\nwint augment(int src, int ink, wint flo) {\n\n  if (src == ink)\n    return flo;\n\n  wint f;\n\n  for (int &i = see[src]; ~i; i = next[i])\n    if (capa[i] > wEPS && lev[src] < lev[zu[i]]) {\n\n      if ((f = augment(zu[i], ink, min(flo, capa[i]))) > wEPS) {\n\n        capa[i] -= f;\n        capa[i ^ 1] += f;\n        return f;\n      }\n    }\n\n  return 0;\n}\n\nbool solve(int src, int ink, wint flo = wINF) {\n\n  wint f;\n\n  int i, u, v;\n\n  for (tof = 0; tof + wEPS < flo;) {\n\n    qb = qe = que;\n\n    memset(lev, ~0, n * 4);\n\n    for (lev[ *qe++ = src] = 0, see[src] = ptr[src]; qb != qe;) {\n\n      for (i = ptr[u = *qb++]; ~i; i = next[i])\n        if (capa[i] > wEPS && !~lev[v = zu[i]]) {\n\n          lev[ *qe++ = v] = lev[u] + 1;\n          see[v] = ptr[v];\n\n          if (v == ink)\n            goto au;\n        }\n    }\n\n    return 0;\n\n  au:\n    for (; (f = augment(src, ink, flo - tof)) > wEPS; tof += f)\n      ;\n  }\n\n  return 1;\n}\n\n}                \n\nint H, W;\n\nchar A[110][110];\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &H, &W);\n\n  for (int i = 0; i < H; ++i) {\n\n    scanf(\"%s\", A[i]);\n  }\n\n  int s, t;\n\n  MF::init(H * W * 2 + H + W);\n\n  for (int i = 0; i < H; ++i) {\n\n    for (int j = 0; j < W; ++j) {\n\n      int id = i * W + j;\n\n      if (A[i][j] == 'S')\n        s = id;\n\n      if (A[i][j] == 'T')\n        t = id;\n\n      if (A[i][j] != '.') {\n\n        MF::ae(id * 2, id * 2 + 1, 1, 0);\n\n        MF::ae(id * 2 + 1, H * W * 2 + j, 1000);\n\n        MF::ae(id * 2 + 1, H * W * 2 + W + i, 1000);\n\n        MF::ae(H * W * 2 + j, id * 2, 1000);\n\n        MF::ae(H * W * 2 + W + i, id * 2, 1000);\n      }\n    }\n  }\n\n  MF::solve(s * 2 + 1, t * 2);\n\n  int ret = MF::tof;\n\n  if (ret > 200)\n    ret = -1;\n\n  printf(\"%d\\n\", ret);\n}"}
{"fast_code_id":"b15b63509da7426b5cecc4b7d051c37dc0384cb0f6a5bd05431e8084e6de318b","fast_id":"26185d4d685430b6c37b5e19ea30e82d7333aef63739e3aa7248a7e4e7005f03","fast_time":0.058156797,"language":"cpp","measured_fast_code_id":"26185d4d685430b6c37b5e19ea30e82d7333aef63739e3aa7248a7e4e7005f03","measured_slow_code_id":"4483a85c1f3051bb2c23177ef484fd8bfcb0e9e8a95dc443e8c2548ec676445d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74397","problem_id":"p02362","slow_code_id":"f5795da2eaebe6128cf865d2864e6df3e6c49dff853d8955d0523c41a2dca1f8","slow_id":"4483a85c1f3051bb2c23177ef484fd8bfcb0e9e8a95dc443e8c2548ec676445d","slow_time":0.19920016,"speedup":3.425225773695893,"stratum":"2-4","sampling_key":"818ee10e26789d39d2cff08d30a1f29fd12c52a9a24cdae7dc8ad943028c07cc","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst ll inf = 0x3f3f3f3f3f3f3f3f;\n\nconst int mx = 100005;\n\nll dist[mx];\n\nvector<pair<ll, int> > adj[mx];\n\nbitset<mx> inq;\n\nint v, e, r;\n\nint q[mx], qh, qt, ct = 0;\n\nint qpop() {\n\n  int v = q[qh++];\n\n  if (qh > mx)\n    qh = 0;\n\n  return v;\n}\n\nvoid qpush(int v) {\n\n  ct++;\n\n  q[qt++] = v;\n\n  if (qt > mx)\n    qt = 0;\n}\n\nint main() {\n\n  qh = qt = 0;\n\n  cin >> v >> e >> r;\n\n  for (int i = 0; i < v; i++)\n\n    dist[i] = inf;\n\n  for (int i = 0; i < e; i++) {\n\n    int s, t, d;\n    cin >> s >> t >> d;\n\n    adj[s].push_back({d, t});\n  }\n\n  dist[r] = 0;\n\n  qpush(r);\n\n  while (qh != qt) {\n\n    if (ct > 2 * v * e + 5) {\n\n      cout << \"NEGATIVE CYCLE\" << endl;\n\n      return 0;\n    }\n\n    int p = qpop();\n\n    inq[p] = false;\n\n    for (auto h : adj[p]) {\n\n      int t = h.second;\n\n      ll d = h.first + dist[p];\n\n      if (d < dist[t]) {\n\n        dist[t] = d;\n\n        if (!inq[t])\n\n          inq[t] = true, qpush(t);\n      }\n    }\n  }\n\n  for (int i = 0; i < v; i++) {\n\n    if (dist[i] < inf / 2)\n      cout << dist[i] << endl;\n\n    else\n      cout << \"INF\" << endl;\n  }\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int maxv = 1005, maxe = 2005;\n\nint md[maxv], pt[maxv];\n\nint q[maxv], qh = 0, qt = 0;\n\nbool inq[maxv];\n\nvector<pair<int, int>> G[maxv];\n\nbool empty() { return qh == qt; }\n\nvoid push(int v) {\n\n  if (inq[v])\n    return;\n\n  inq[v] = true;\n\n  q[qt] = v;\n\n  qt++;\n\n  if (qt >= maxv)\n    qt -= maxv;\n}\n\nint pop() {\n\n  int v = q[qh++];\n\n  inq[v] = false;\n\n  if (qh >= maxv)\n    qh -= maxv;\n\n  return v;\n}\n\nint main() {\n\n  int v, e, r;\n  cin >> v >> e >> r;\n\n  for (int i = 0; i < e; i++) {\n\n    int s, t, d;\n    cin >> s >> t >> d;\n\n    G[s].push_back({t, d});\n  }\n\n  bool ok = true;\n\n  fill(md, md + maxv, 0x3f3f3f3f);\n\n  md[r] = 0;\n\n  push(r);\n\n  while (!empty()) {\n\n    int t = pop();\n\n    pt[t]++;\n\n    if (pt[t] > maxe) {\n\n      ok = false;\n\n      break;\n    }\n\n    for (pair<int, int> p : G[t]) {\n\n      if (md[t] + p.second < md[p.first]) {\n\n        md[p.first] = md[t] + p.second;\n\n        push(p.first);\n      }\n    }\n  }\n\n  if (!ok) {\n\n    cout << \"NEGATIVE CYCLE\" << endl;\n\n  } else {\n\n    for (int i = 0; i < v; i++) {\n\n      if (md[i] >= 0x3f3f3f3f) {\n\n        cout << \"INF\" << endl;\n\n      } else {\n\n        cout << md[i] << endl;\n      }\n    }\n  }\n}\n"}
{"fast_code_id":"1542de4ae5fa1f4cd447e86154827e800324dc2808cbb57d21b98411c27d4c4d","fast_id":"4fc2f71311aded8b601a925676a2f9e875c75ccd060dfb918c4995f42050c457","fast_time":0.0191659788,"language":"cpp","measured_fast_code_id":"4fc2f71311aded8b601a925676a2f9e875c75ccd060dfb918c4995f42050c457","measured_slow_code_id":"8cea14813aac45deb1c7468c68efb4ba123ddd8fed118415847076ec7cc85e39","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74411","problem_id":"p03142","slow_code_id":"9cc92f33071a3da5e7d77e69447d6be56dcf24e0fe0e2a6afd677162f26a1e2e","slow_id":"8cea14813aac45deb1c7468c68efb4ba123ddd8fed118415847076ec7cc85e39","slow_time":0.4217694544,"speedup":22.00615261037438,"stratum":"8+","sampling_key":"2d577ecf5513cd9105ced167a25180ade974f1a46e8407b6984a1918361a03b1","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, M;\n\n  cin >> N >> M;\n\n  vector<int> IE[100001];\n\n  int num = 1;\n\n  int topo[100001], jisuu[100001] = {};\n\n  rep(i, N + M - 1) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    IE[b].pb(a);\n\n    jisuu[a]++;\n  }\n\n  vector<int> V;\n\n  rep1(i, N) {\n\n    if (!jisuu[i])\n      V.pb(i);\n  }\n\n  while (V.size()) {\n\n    int k = V.back();\n\n    V.pop_back();\n\n    topo[k] = num++;\n\n    for (int u : IE[k]) {\n\n      jisuu[u]--;\n\n      if (!jisuu[u])\n        V.pb(u);\n    }\n  }\n\n  rep1(i, N) {\n\n    int kotae = 0;\n\n    int saishou = 1e9;\n\n    if (topo[i] == N)\n      kotae = 0;\n\n    else {\n\n      for (int u : IE[i]) {\n\n        if (saishou > topo[u]) {\n\n          saishou = topo[u];\n\n          kotae = u;\n        }\n      }\n    }\n\n    co(kotae);\n  }\n\n  Would you please return 0;\n}","fast_code":"\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint D[100001];\n\nint P[100001];\n\nint to[100001], ne[100001], he[100001];\n\nint sagasu(int A) {\n\n  if (D[A])\n    return D[A];\n\n  int ret = 1;\n\n  for (int i = he[A]; i; i = ne[i]) {\n\n    int u = to[i];\n\n    int kari = sagasu(u) + 1;\n\n    if (ret < kari) {\n\n      ret = kari;\n\n      P[A] = u;\n    }\n  }\n\n  return D[A] = ret;\n}\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nconst int dm = 1 << 20;\n\nchar dn[dm], *di = dn;\n\ninline void putint(int X) {\n\n  if (X == 0) {\n\n    *di++ = '0';\n\n    *di++ = '\\n';\n\n    return;\n  }\n\n  int keta = 0;\n\n  char C[10];\n\n  while (X) {\n\n    *(C + keta) = '0' + X % 10;\n\n    X /= 10;\n\n    keta++;\n  }\n\n  for (int i = keta - 1; i >= 0; i--)\n    *di++ = (*(C + i));\n\n  *di++ = '\\n';\n}\n\nint main() {\n\n  int N = getint(), M = getint();\n\n  rep1(i, N + M - 1) {\n\n    int a = getint(), b = getint();\n\n    to[i] = a;\n\n    ne[i] = he[b];\n\n    he[b] = i;\n  }\n\n  rep1(i, N) {\n\n    sagasu(i);\n\n    putint(P[i]);\n  }\n\n  fwrite(dn, 1, di - dn, stdout);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"2952fc79707864f3587e001345da02e4b0c9bbd7c9f9634bef21c5354abab129","fast_id":"7b18b3710c2a3b20afa7513bb879579b0088b80f33a52a059ed11e16ac5b09da","fast_time":0.0001919889,"language":"cpp","measured_fast_code_id":"7b18b3710c2a3b20afa7513bb879579b0088b80f33a52a059ed11e16ac5b09da","measured_slow_code_id":"27107f73a800fd84c0c1a317421bb039baa0cdffb03b595d3805d07082267cf2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74475","problem_id":"p03527","slow_code_id":"5f83995ea81b9c3923016361e393bd094e13d3d94db24a248bf9f2bbd5f70a55","slow_id":"27107f73a800fd84c0c1a317421bb039baa0cdffb03b595d3805d07082267cf2","slow_time":0.0125490431,"speedup":65.36337829947462,"stratum":"8+","sampling_key":"1e4511464f9d50a2eff08faeab5608f6a3b8fbd6dee2587d0924e91dc28279aa","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <vector>\n\nusing namespace std;\n\nconst int N = 400002;\n\nint n, m, i, a, b, c[N], vis[N], sum, tmp;\n\nchar s[N];\n\nvector<int> e[N];\n\nvoid Link(int x, int y) {\n\n  e[x].push_back(y);\n\n  e[y].push_back(x);\n}\n\nvoid init() {\n\n  scanf(\"%s%d\", s + 1, &m);\n\n  n = strlen(s + 1);\n\n  for (i = 0; i <= n; i++)\n\n    c[i] = s[i + 1] - s[i];\n\n  for (i = 0; i < n - i; i++)\n\n    Link(i, n - i);\n\n  while (m--) {\n\n    scanf(\"%d%d\", &a, &b);\n\n    Link(a - 1, b);\n  }\n}\n\nvoid dfs(int i) {\n\n  vis[i] = 1;\n\n  sum += c[i];\n\n  for (int j = 0; j < e[i].size(); j++)\n\n    if (!vis[e[i][j]])\n\n      dfs(e[i][j]);\n}\n\nvoid work() {\n\n  tmp = 1;\n\n  dfs(0);\n\n  sum = 0;\n\n  for (i = 1; i < n; i++)\n\n    if (!vis[i]) {\n\n      dfs(i);\n\n      if (sum % 26)\n\n        tmp = 0;\n    }\n\n  printf(\"%s\\n\", tmp ? \"YES\" : \"NO\");\n}\n\nint main() {\n\n  init();\n\n  work();\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\nconst int N = 400002;\n\nchar s[N];\n\nint n, m, c[N], a, b, i, j, k, p;\n\nint h[N], t[N], v[N], vis[N];\n\nvoid add(int a, int b) {\n\n  t[++k] = h[a];\n  h[a] = k;\n  v[k] = b;\n\n  t[++k] = h[b];\n  h[b] = k;\n  v[k] = a;\n}\n\nvoid init() {\n\n  scanf(\"%s\", s + 1);\n\n  while (s[n + 1])\n    n++;\n\n  for (i = 1; i <= n + 1; i++)\n\n    c[i] = s[i] - s[i - 1];\n\n  for (i = 1, j = n + 1; i < j; i++, j--)\n\n    add(i, j);\n\n  scanf(\"%d\", &m);\n\n  while (m--) {\n\n    scanf(\"%d%d\", &a, &b);\n\n    add(a, b + 1);\n  }\n}\n\nvoid dfs(int i) {\n\n  vis[i] = 1;\n\n  p += c[i];\n\n  for (int j = h[i]; j; j = t[j])\n\n    if (!vis[v[j]])\n\n      dfs(v[j]);\n}\n\nvoid work() {\n\n  for (i = 1; i <= n; i++)\n\n    if (!vis[i]) {\n\n      p = 0;\n\n      dfs(i);\n\n      if (p % 26 != 0) {\n\n        printf(\"NO\\n\");\n\n        return;\n      }\n    }\n\n  printf(\"YES\\n\");\n}\n\nint main() {\n\n  init();\n\n  work();\n\n  return 0;\n}"}
{"fast_code_id":"9398c38256b4b429b006587d8f49df2f42cf133f802f372bf75ac1348bafb859","fast_id":"a9bbd12b39a76a746884aa18fc3d4fba84531dd08ba8951874996beaed597652","fast_time":0.0670960954,"language":"cpp","measured_fast_code_id":"a9bbd12b39a76a746884aa18fc3d4fba84531dd08ba8951874996beaed597652","measured_slow_code_id":"dcd7d866e587b9ab754cc82e3bcdcda5b638b3240fb4a97f1f56e9df44e778d8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74502","problem_id":"p02766","slow_code_id":"705f60b4e5381087fcb8b7fbbe7633dc5585798334c04f85c667d53b99b6cb34","slow_id":"dcd7d866e587b9ab754cc82e3bcdcda5b638b3240fb4a97f1f56e9df44e778d8","slow_time":0.633940418,"speedup":9.448246045029917,"stratum":"8+","sampling_key":"be0482c35b64f8b9b1f1392f4c539558703b27d0a4975feee984d8c27601943e","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long int ar[1000000];\n\nint main()\n\n{\n\n  long long int x, y, rem, temp, i, j, total, f = 0;\n\n  cin >> x >> y;\n\n  temp = x;\n\n  for (i = 0; i < 1000000; i++)\n\n    ar[i] = -1;\n\n  i = 0;\n\n  while (temp >= 1)\n\n  {\n\n    rem = temp % y;\n\n    temp = temp / y;\n\n    ar[i] = rem;\n\n    i++;\n  }\n\n  for (j = 0; j < i; j++)\n\n  {\n\n    total = ar[j] % 10;\n\n    f++;\n  }\n\n  cout << f << endl;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  long long int a, b, count = 0;\n\n  cin >> a >> b;\n\n  while (a != 0)\n\n  {\n\n    a = a / b;\n\n    count++;\n  }\n\n  cout << count << endl;\n\n  return 0;\n}"}
{"fast_code_id":"0bfc9228e94a8d86f7725332ad2efabb1c5af833ec9287ad592649f18c7bedff","fast_id":"1fede49dd9d9a4ba677f2b988f61217e8dc51518319c654322b1fff4ad194440","fast_time":0.0218155486,"language":"cpp","measured_fast_code_id":"1fede49dd9d9a4ba677f2b988f61217e8dc51518319c654322b1fff4ad194440","measured_slow_code_id":"dbf30b8c82f175a4fd15d7d34657611084025bede96c49421493f2cdded0fec4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74511","problem_id":"p03388","slow_code_id":"3dbffa30a7d2f1fda4a59ce8173cb9b283ca1b70ddc103cfffa259dd886e051e","slow_id":"dbf30b8c82f175a4fd15d7d34657611084025bede96c49421493f2cdded0fec4","slow_time":0.1033240116,"speedup":4.736255479726968,"stratum":"4-8","sampling_key":"7f365a23a79db4114f046320efeb8a454551588f5486e95bac363f4a5711dfc5","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  ll a, b, pr, sqq;\n\n  ll ans;\n\n  while (n--)\n\n  {\n\n    scanf(\"%lld%lld\", &a, &b);\n\n    pr = a * b;\n\n    sqq = sqrt(pr);\n\n    ans = sqq * 2;\n\n    if (sqq * sqq == pr) {\n\n      if (a == sqq && b == a) {\n\n        ans -= 2;\n\n      }\n\n      else {\n\n        ans -= 3;\n      }\n\n    }\n\n    else {\n\n      if ((pr - 1) / sqq == sqq) {\n\n        ans--;\n      }\n\n      ans--;\n    }\n\n    printf(\"%lld\\n\", ans);\n  }\n\n  return 0;\n}\n","fast_code":"#include <cmath>\n\n#include <cstdio>\n\nusing namespace std;\n\nint main() {\n\n  int Q;\n\n  scanf(\"%d\", &Q);\n\n  for (int i = 1; i <= Q; i++) {\n\n    long long a, b;\n\n    scanf(\"%lld %lld\", &a, &b);\n\n    long long pr = a * b;\n\n    long long t = sqrt(pr), ans;\n\n    if (t * (t + 1) < pr)\n\n      ans = t * 2 - 1;\n\n    else if (t * t == pr) {\n\n      ans = (t - 1) * 2;\n\n      if (a != b)\n        ans--;\n\n    } else\n\n      ans = (t - 1) * 2;\n\n    printf(\"%lld\\n\", ans);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"382a9544705de113f223f02a52ebae8266677533c67131992bfd31c13de55edc","fast_id":"c747951e3bb66e70e6ded68a68980b0635bea6351f99a34ad4a2b21b04745439","fast_time":0.0793153252,"language":"cpp","measured_fast_code_id":"c747951e3bb66e70e6ded68a68980b0635bea6351f99a34ad4a2b21b04745439","measured_slow_code_id":"acc9bcf77cee236c83930bd44c7322edd9d28a5d615e341b4fd8008475269276","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74544","problem_id":"p02947","slow_code_id":"84e47520ca5cea745e467aa45391d12117ec064434ae9723918b3d7158653bb2","slow_id":"acc9bcf77cee236c83930bd44c7322edd9d28a5d615e341b4fd8008475269276","slow_time":0.7966580041,"speedup":10.044187577762084,"stratum":"8+","sampling_key":"28a096b7f12c3467e44e7bd37819474459821b05788763c65d582635152d7bd2","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 5;\n\nstring A[N];\n\nint n;\n\nlong long sum, mem[N];\n\nlong long fact(int i) {\n\n  if (!i)\n    return 1;\n\n  if (mem[i] != -1)\n    return mem[i];\n\n  return mem[i] = fact(i - 1) * i * 1ll;\n}\n\nlong long ans(int i) {\n\n  if (i <= 1)\n    return 0;\n\n  if (i == 2)\n    return 1;\n\n  return fact(i) / (fact(i - 2) * 2);\n}\n\nlong long spdAns(int i) {\n\n  if (i <= 1)\n    return 0;\n\n  if (i == 2)\n    return 1;\n\n  long long ret = 1;\n\n  ret = 1ll * i * (i - 1) / 2;\n\n  return ret;\n}\n\nmap<string, int> mp;\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n\n  memset(mem, -1, sizeof mem);\n\n  cin >> n;\n\n  for (int i = 0; i < n; ++i) {\n\n    cin >> A[i];\n\n    sort(A[i].begin(), A[i].end());\n\n    mp[A[i]]++;\n  }\n\n  long long ze = 0;\n\n  map<string, int>::iterator it = mp.begin();\n\n  while (it != mp.end()) {\n\n    ze += spdAns(it->second);\n\n    it++;\n  }\n\n  cout << ze << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define MAX 11000\n\n#define ll long int\n\nusing namespace std;\n\nint main() {\n\n  map<string, int> mp;\n\n  string s;\n\n  ll i, j, n, count = 0, sum = 0;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n\n  {\n\n    cin >> s;\n\n    sort(s.rbegin(), s.rend(), greater<char>());\n\n    count += mp[s]++;\n  }\n\n  cout << count;\n}"}
{"fast_code_id":"6433c733c2c5780d9e5ebafda295b4004100ef80d22c9fb9048699bdaec27a6e","fast_id":"b0105f25d09559dbae096f4584b70b279bd4a790ebd823156d7cea4c40ef1b1b","fast_time":0.0667528362,"language":"cpp","measured_fast_code_id":"b0105f25d09559dbae096f4584b70b279bd4a790ebd823156d7cea4c40ef1b1b","measured_slow_code_id":"94a83af193d02231e90f2688bfbaa0f1154fbb531977f4a52bb91a501494b51b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74646","problem_id":"p00503","slow_code_id":"97a04f2d38fe9ce0db8bdeb0a9f969fc24630a43d1ee73eab5e1db9d68992644","slow_id":"94a83af193d02231e90f2688bfbaa0f1154fbb531977f4a52bb91a501494b51b","slow_time":0.1822260715,"speedup":2.7298626076954617,"stratum":"2-4","sampling_key":"5b1944b6191db1628807a3b4450d58c0495db289e49e087c71eb5a71d2100efb","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\n#define MAX_M 120\n\n#define MAX_N 60\n\nint x[MAX_N][6];\n\nint y[MAX_N][6];\n\nint z[MAX_M][3];\n\nlong long int a[MAX_M][MAX_M][MAX_M];\n\nbool b[MAX_M][MAX_M][MAX_M];\n\nint main() {\n\n  memset(b, false, sizeof(b));\n\n  int n, m;\n\n  int MAXX[3] = {0, 0, 0};\n\n  int SUMX[3] = {0, 0, 0};\n\n  cin >> n >> m;\n\n  for (int i = 0; i < n; i++) {\n\n    for (int j = 0; j < 6; j++) {\n\n      cin >> x[i][j];\n\n      MAXX[j % 3] = max(MAXX[j % 3], x[i][j]);\n    }\n  }\n\n  for (int i = 0; i < 3; i++) {\n\n    for (int j = 0; j <= MAXX[i]; j++) {\n\n      for (int k = 0; k < n; k++) {\n\n        if (x[k][i] == j) {\n\n          y[k][i] = SUMX[i];\n\n          z[SUMX[i]][i] = j;\n\n          SUMX[i] += 1;\n        }\n\n        if (x[k][i + 3] == j) {\n\n          y[k][i + 3] = SUMX[i];\n\n          z[SUMX[i]][i] = j;\n\n          SUMX[i] += 1;\n        }\n      }\n    }\n  }\n\n  for (int i = 0; i < SUMX[0]; i++) {\n\n    for (int j = 0; j < SUMX[1]; j++) {\n\n      for (int k = 0; k < SUMX[2]; k++) {\n\n        a[i][j][k] = z[i + 1][0] - z[i][0];\n\n        a[i][j][k] *= z[j + 1][1] - z[j][1];\n\n        a[i][j][k] *= z[k + 1][2] - z[k][2];\n      }\n    }\n  }\n\n  int p;\n\n  long long int sum = 0;\n\n  for (int i = 0; i < SUMX[0]; i++) {\n\n    for (int j = 0; j < SUMX[1]; j++) {\n\n      for (int k = 0; k < SUMX[2]; k++) {\n\n        p = 0;\n\n        for (int l = 0; l < n; l++) {\n\n          if (((y[l][0] <= i && y[l][3] > i) &&\n               (y[l][1] <= j && y[l][4] > j)) &&\n              (y[l][2] <= k && y[l][5] > k)) {\n\n            p++;\n          }\n        }\n\n        if (p >= m) {\n\n          sum += a[i][j][k];\n\n          b[i][j][k] = true;\n        }\n      }\n    }\n  }\n\n  cout << sum << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <algorithm>\n\nusing namespace std;\n\nvector<long long> X, Y, Z;\n\nlong long ax[100], ay[100], az[100], bx[100], by[100], bz[100], n, q,\n    r[100][100][100], sum;\n\nint main() {\n\n  cin >> n >> q;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> ax[i] >> ay[i] >> az[i] >> bx[i] >> by[i] >> bz[i];\n\n    X.push_back(ax[i]);\n    X.push_back(bx[i]);\n\n    Y.push_back(ay[i]);\n    Y.push_back(by[i]);\n\n    Z.push_back(az[i]);\n    Z.push_back(bz[i]);\n  }\n\n  sort(X.begin(), X.end());\n  sort(Y.begin(), Y.end());\n  sort(Z.begin(), Z.end());\n\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j < X.size(); j++) {\n      if (ax[i] == X[j])\n        ax[i] = j;\n      if (bx[i] == X[j])\n        bx[i] = j;\n    }\n  }\n\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j < Y.size(); j++) {\n      if (ay[i] == Y[j])\n        ay[i] = j;\n      if (by[i] == Y[j])\n        by[i] = j;\n    }\n  }\n\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j < Z.size(); j++) {\n      if (az[i] == Z[j])\n        az[i] = j;\n      if (bz[i] == Z[j])\n        bz[i] = j;\n    }\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    for (int j = ax[i]; j < bx[i]; j++) {\n      for (int k = ay[i]; k < by[i]; k++) {\n        for (int l = az[i]; l < bz[i]; l++)\n          r[j][k][l]++;\n      }\n    }\n  }\n\n  for (int i = 0; i < X.size(); i++) {\n\n    for (int j = 0; j < Y.size(); j++) {\n\n      for (int k = 0; k < Z.size(); k++) {\n\n        if (r[i][j][k] >= q) {\n\n          sum += (X[i + 1] - X[i]) * (Y[j + 1] - Y[j]) * (Z[k + 1] - Z[k]);\n        }\n      }\n    }\n  }\n\n  cout << sum << endl;\n\n  return 0;\n}"}
{"fast_code_id":"d85dde0a4b0cce0e0acba0efb06ecfb1b68350ad18f0aab1f525cba8980787b0","fast_id":"f0d75d04eee9504ba53284b62f9eda74584d826a29cf6f49448c632db8004244","fast_time":0.074474837,"language":"cpp","measured_fast_code_id":"f0d75d04eee9504ba53284b62f9eda74584d826a29cf6f49448c632db8004244","measured_slow_code_id":"4643c39585c845153430035078666978f3b63f64d38bee7c3fc31ef29af3c169","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74650","problem_id":"p03368","slow_code_id":"3b1de9c8e988508911937adde70d0d77268bbb779a4d6b6b900c282fae665341","slow_id":"4643c39585c845153430035078666978f3b63f64d38bee7c3fc31ef29af3c169","slow_time":0.3214694214,"speedup":4.316483719192296,"stratum":"4-8","sampling_key":"61ba2d924841e4ef34b923b318af63f57d31f275d9e34c75a0026f16768e230c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long lint;\n\ntypedef long double louble;\n\ntemplate <typename T1, typename T2> inline T1 max(T1 a, T2 b) { return a < b ? b : a; }\n\ntemplate <typename T1, typename T2> inline T1 min(T1 a, T2 b) { return a < b ? a : b; }\n\nconst char lf = '\\n';\n\nnamespace ae86\n\n{\n\nconst int bufl = 1 << 15;\n\nchar buf[bufl], *s = buf, *t = buf;\n\ninline int fetch()\n\n{\n\n  if (s == t) {\n    t = (s = buf) + fread(buf, 1, bufl, stdin);\n    if (s == t)\n      return EOF;\n  }\n\n  return *s++;\n}\n\ninline int ty()\n\n{\n\n  int a = 0;\n  int b = 1, c = fetch();\n\n  while (!isdigit(c))\n    b ^= c == '-', c = fetch();\n\n  while (isdigit(c))\n    a = a * 10 + c - 48, c = fetch();\n\n  return b ? a : -a;\n}\n\n}                  \n\nusing ae86::ty;\n\nconst int _ = 200007;\n\nstruct cxk\n\n{\n\n  lint c0, c1;\n\n  cxk(lint c0_ = 0, lint c1_ = 0) { c0 = c0_, c1 = c1_; }\n\n  friend cxk operator+(cxk a, cxk b) { return cxk(a.c0 + b.c0, a.c1 + b.c1); }\n\n  friend int operator<(cxk a, cxk b) { return a.c1 * b.c0 < a.c0 * b.c1; }\n\n} ps[_];\n\nint n, fa[_] = {0}, bfa[_] = {0}, val[_], bval[_] = {0};\n\nint findbfa(int x)\n\n{\n\n  return x == bfa[x] ? x : bfa[x] = findbfa(bfa[x]);\n}\n\nset<pair<cxk, int>> s;\n\nint main()\n\n{\n\n  ios::sync_with_stdio(0), cout.tie(nullptr);\n\n  n = ty();\n\n  for (int i = 2; i <= n; i++)\n    fa[i] = ty();\n\n  for (int i = 1; i <= n; i++)\n    val[i] = ty();\n\n  for (int i = 1; i <= n; i++)\n    bfa[i] = i, ps[i] = cxk(val[i] == 0, val[i] == 1), s.emplace(ps[i], i);\n\n  lint ans = 0;\n\n  while (!s.empty())\n\n  {\n\n    int a = (*s.begin()).second;\n\n    s.erase(s.begin());\n\n    if (a == 1)\n      continue;\n\n    int aa = findbfa(fa[a]);\n\n    bfa[a] = aa, ans += ps[aa].c1 * ps[a].c0, s.erase(make_pair(ps[aa], aa));\n\n    ps[aa] = ps[aa] + ps[a], s.emplace(ps[aa], aa);\n  }\n\n  cout << ans << lf;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\n#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; i++)\n\n#define DREP(i, a, b) for (int i = (a), _end_ = (b); i >= _end_; i--)\n\n#define EREP(i, u) for (int i = start[u]; i; i = e[i].next)\n\n#define fi first\n\n#define se second\n\n#define mkr(a, b) make_pair(a, b)\n\n#define SZ(A) ((int)A.size())\n\ntemplate <class T> inline void chkmin(T &a, T b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <class T> inline void chkmax(T &a, T b) {\n  if (a < b)\n    a = b;\n}\n\ninline void myassert(bool a, string s) {\n  if (!a)\n    cerr << s << endl, exit(0);\n}\n\ninline int read()\n\n{\n\n  int s = 0, f = 1;\n  char ch = getchar();\n\n  while (!isdigit(ch) && ch != '-')\n    ch = getchar();\n\n  if (ch == '-')\n    ch = getchar(), f = -1;\n\n  while (isdigit(ch))\n    s = s * 10 + ch - '0', ch = getchar();\n\n  return ~f ? s : -s;\n}\n\nconst int maxn = 2e5 + 20;\n\nint n, fa[maxn], v[maxn];\n\nint ff[maxn];\n\nstruct node {\n\n  int num1, num0, id;\n};\n\ninline bool operator<(node a, node b)\n\n{\n\n  ll A = 1ll * a.num1 * b.num0, B = 1ll * b.num1 * a.num0;\n\n  return A != B ? A < B : a.id < b.id;\n}\n\nset<node> s;\n\nint num[maxn][2];\n\nint fin(int x) { return x == ff[x] ? x : ff[x] = fin(ff[x]); }\n\ninline void init()\n\n{\n\n  n = read();\n\n  REP(i, 2, n) fa[i] = read();\n\n  REP(i, 1, n) ff[i] = i;\n\n  REP(i, 1, n) num[i][v[i] = read()]++;\n\n  REP(i, 2, n)\n\n  {\n\n    node x = (node){num[i][1], num[i][0], i};\n\n    s.insert(x);\n  }\n}\n\nll ans;\n\ninline void doing()\n\n{\n\n  while (!s.empty())\n\n  {\n\n    node t = *s.begin();\n    s.erase(t);\n\n    int x = t.id, fat = fin(fa[x]);\n\n    if (fat > 1)\n      s.erase((node){num[fat][1], num[fat][0], fat});\n\n    ans += 1ll * num[fat][1] * num[x][0];\n\n    REP(op, 0, 1) num[fat][op] += num[x][op];\n\n    ff[x] = fat;\n\n    if (fat > 1)\n      s.insert((node){num[fat][1], num[fat][0], fat});\n  }\n\n  printf(\"%lld\\n\", ans);\n}\n\nint main()\n\n{\n\n  init();\n\n  doing();\n\n  return 0;\n}\n"}
{"fast_code_id":"33c822fa2ce2e9598f2e8ea1817c238845ff4c2d99b23b8e7ea36a3dd261b926","fast_id":"7611b55cb4042d76eebf9984d6f3f4265c5725ee18e1ab82f4d0b717b939d135","fast_time":0.0151817529,"language":"cpp","measured_fast_code_id":"7611b55cb4042d76eebf9984d6f3f4265c5725ee18e1ab82f4d0b717b939d135","measured_slow_code_id":"b24295f4dae7cef22a2539c0f7734f1f6139474586fbf442c0570dc226d8c9dd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74692","problem_id":"p02268","slow_code_id":"ef72d2356e4e172b9506b85ad6dc33f21393451508610ff25209a63f9a30935c","slow_id":"b24295f4dae7cef22a2539c0f7734f1f6139474586fbf442c0570dc226d8c9dd","slow_time":0.053243301,"speedup":3.507058858796207,"stratum":"2-4","sampling_key":"ba108e7bb442a27ce290a4d73717417ca96432b56434f453b53c39fb53014b15","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint binarysearch(int *S, int size, int key)\n\n{\n\n  int left = 0, right = size;\n\n  int mid;\n\n  while (left < right) {\n\n    mid = (left + right) / 2;\n\n    if (S[mid] == key) {\n\n      return mid;\n\n    } else if (key < S[mid]) {\n\n      right = mid;\n\n    } else if (key < S[mid + 1]) {\n\n      return size;\n\n    } else {\n\n      left = mid + 1;\n    }\n  };\n\n  return size;\n}\n\nint main()\n\n{\n\n  int i, n, q, S[1000000], T[500000], C;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n    cin >> S[i];\n\n  cin >> q;\n\n  for (i = 0; i < q; i++)\n    cin >> T[i];\n\n  C = 0;\n\n  for (int i = 0; i < q; i++) {\n\n    if (binarysearch(S, n, T[i]) < n)\n      C++;\n  }\n\n  cout << C << endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint binarysearch(int *S, int size, int key)\n\n{\n\n  int left = 0, right = size;\n\n  int mid;\n\n  while (left < right) {\n\n    mid = (left + right) / 2;\n\n    if (S[mid] == key) {\n\n      return mid;\n\n    } else if (key < S[mid]) {\n\n      right = mid;\n\n    } else if (key < S[mid + 1]) {\n\n      return size;\n\n    } else {\n\n      left = mid + 1;\n    }\n  };\n\n  return size;\n}\n\nint main()\n\n{\n\n  int i, n, q, S[1000000], T[500000], C;\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &S[i]);\n\n  scanf(\"%d\", &q);\n\n  for (i = 0; i < q; i++)\n    scanf(\"%d\", &T[i]);\n\n  C = 0;\n\n  for (int i = 0; i < q; i++) {\n\n    if (binarysearch(S, n, T[i]) < n)\n      C++;\n  }\n\n  printf(\"%d\\n\", C);\n\n  return 0;\n}"}
{"fast_code_id":"303ecfdf6e01320a9544e0b308dd8359f93be93ffe4bc10b7cbeaade50528bd3","fast_id":"8812ba570397b63ae6d6391f6f02e4518920bcb8f2b1f5908f028a724a636133","fast_time":0.0010277436,"language":"cpp","measured_fast_code_id":"8812ba570397b63ae6d6391f6f02e4518920bcb8f2b1f5908f028a724a636133","measured_slow_code_id":"2b47466ec3132534d970aecc3b1365b15e1305c28d48231617ba03df6ed05633","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74703","problem_id":"p03372","slow_code_id":"a1c9d60658c0b1009d70a453406cb42b9d3c248ad7edaad54729acce4abde8f8","slow_id":"2b47466ec3132534d970aecc3b1365b15e1305c28d48231617ba03df6ed05633","slow_time":0.0043137826,"speedup":4.197333459434824,"stratum":"4-8","sampling_key":"cc31cb321f3413dc0321dcb3ad3b247a3b3402d2ae88361f22008c5e61323b87","slow_code":"#include <iostream>\n\n#include <string.h>\n\n#include <stdio.h>\n\n#include <map>\n\n#include <vector>\n\n#include <math.h>\n\nusing namespace std;\n\n#define rep(i, a) for (int i = 0; i < a; i++)\n\n#define rrep(i, a) for (int i = a; i >= 0; i--)\n\n#define loop3(i, j, k, a)                                                                          \\\n  for (int i = 0; i < a; i++)                                                                      \\\n    for (int j = 0; j < a; j++)                                                                    \\\n      if (i != j)                                                                                  \\\n        for (int k = 0; k < a; k++)                                                                \\\n          if (i != k && j != k)\n\n#define loop4(i, j, k, l, a)                                                                       \\\n  for (int i = 0; i < a; i++)                                                                      \\\n    for (int j = 0; j < a; j++)                                                                    \\\n      if (i != j)                                                                                  \\\n        for (int k = 0; k < a; k++)                                                                \\\n          if (i != k && j != k)                                                                    \\\n            for (int l = 0; l < a; l++)                                                            \\\n              if (i != l && j != l && k != l)\n\n#define rep1(i, a) for (int i = 1; i <= a; i++)\n\n#define scnd1(a) scanf(\"%d\", &a)\n\n#define scnd2(a, b) scanf(\"%d%d\", &a, &b)\n\n#define scnd3(a, b, c) scanf(\"%d%d%d\", &a, &b, &c)\n\n#define scnd4(a, b, c, d) scanf(\"%d%d%d%d\", &a, &b, &c, &d)\n\n#define prtd1(a) printf(\"%d\\n\", a)\n\n#define prtd2(a, b) printf(\"%d %d\\n\", a, b)\n\n#define prtd3(a, b, c) printf(\"%d %d %d\\n\", a, b, c)\n\n#define prtd4(a, b, c, d) printf(\"%d %d %d %d\\n\", a, b, c, d)\n\n#define mem(a, n) memset(a, n, sizeof(a))\n\ntypedef long long ll;\n\nll N, C, dist[100009], cal[100009], turnL[100009][2], turnR[100009][2];\n\nint main() {\n\n  cin >> N >> C;\n\n  mem(turnL, 0);\n  mem(turnR, 0);\n\n  rep(i, N) cin >> dist[i] >> cal[i];\n\n  ll sumcal = 0;\n\n  rep(i, N) {\n\n    sumcal += cal[i];\n\n    if (i == 0 && cal[i] - dist[i] > 0) {\n\n      turnR[i][0] = sumcal - dist[i];\n\n      turnR[i][1] = dist[i];\n\n    } else {\n\n      if (sumcal - dist[i] <= turnR[i - 1][0]) {\n\n        turnR[i][0] = turnR[i - 1][0];\n\n        turnR[i][1] = turnR[i - 1][1];\n\n      } else {\n\n        turnR[i][0] = sumcal - dist[i];\n\n        turnR[i][1] = dist[i];\n      }\n    }\n  }\n\n  sumcal = 0;\n\n  rrep(i, N - 1) {\n\n    sumcal += cal[i];\n\n    if (i == N - 1) {\n\n      if (cal[i] - (C - dist[i]) > 0) {\n\n        turnL[i][0] = sumcal - (C - dist[i]);\n\n        turnL[i][1] = (C - dist[i]);\n      }\n\n    } else {\n\n      if (sumcal - (C - dist[i]) <= turnL[i + 1][0]) {\n\n        turnL[i][0] = turnL[i + 1][0];\n\n        turnL[i][1] = turnL[i + 1][1];\n\n      } else {\n\n        turnL[i][0] = sumcal - (C - dist[i]);\n\n        turnL[i][1] = (C - dist[i]);\n      }\n    }\n  }\n\n  ll maxcal = max(turnR[N - 1][0], turnL[0][0]);\n\n  for (int i = 1; i < N; i++) {\n\n    maxcal = max(maxcal, turnL[i + 1][0] - turnL[i + 1][1] + turnR[i][0]);\n  }\n\n  for (int i = 1; i < N; i++) {\n\n    maxcal = max(maxcal, turnR[i - 1][0] - turnR[i - 1][1] + turnL[i][0]);\n  }\n\n  cout << maxcal << endl;\n}","fast_code":"#include \"bits/stdc++.h\"\n\n#include <iostream>\n\n#include <string.h>\n\n#include <stdio.h>\n\n#include <map>\n\n#include <vector>\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <queue>\n\n#include <set>\n\n#include <tuple>\n\nusing namespace std;\n\n#define FOR(i, init, a) for (int i = init; i < a; i++)\n\n#define rep(i, a) FOR(i, 0, a)\n\n#define rrep(i, a) for (int i = a; i >= 0; i--)\n\n#define rep1(i, a) for (int i = 1; i <= a; i++)\n\n#define cout1(a) cout << a << endl;\n\n#define cout2(a, b) cout << a << \" \" << b << endl;\n\n#define cout3(a, b, c) cout << a << \" \" << b << \" \" << c << endl;\n\n#define cout4(a, b, c, d) cout << a << \" \" << b << \" \" << c << \" \" << d << endl;\n\n#define mem(a, n) memset(a, n, sizeof(a))\n\n#define all(a) a.begin(), a.end()\n\n#define chmin(a, b) a = min(a, b);\n\n#define chmax(a, b) a = max(a, b);\n\ntypedef long long ll;\n\ntypedef long double ld;\n\ntypedef pair<int, int> pii;\n\nconst int INF = 1e9;\n\nconst int MOD = 1e9 + 7;\n\nconst ll LLINF = 1e18;\n\nstatic const double pi = 3.141592653589793;\n\nll N, C;\n\nll X[100009], V[100009];\n\nll turnL[100009], turnR[100009];\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> N >> C;\n\n  rep(i, N) cin >> X[i] >> V[i];\n\n  ll sum = 0, mx = 0;\n\n  rep(i, N) {\n\n    sum += V[i];\n\n    chmax(mx, sum - X[i]);\n\n    turnL[i] = mx;\n  }\n\n  sum = 0, mx = 0;\n\n  rrep(i, N - 1) {\n\n    sum += V[i];\n\n    chmax(mx, sum - (C - X[i]));\n\n    turnR[i] = mx;\n  }\n\n  ll ans = 0;\n\n  rep(i, N) {\n\n    ll tmp = turnL[i];\n\n    if (i < N - 1)\n      tmp += max(0ll, turnR[i + 1] - X[i]);\n\n    chmax(ans, tmp);\n  }\n\n  rrep(i, N - 1) {\n\n    ll tmp = turnR[i];\n\n    if (i)\n      tmp += max(0ll, turnL[i - 1] - (C - X[i]));\n\n    chmax(ans, tmp);\n  }\n\n  cout1(ans)\n}"}
{"fast_code_id":"a0c16672f6f24bb30c082ac97aa687d1df4372abacc53ed4c8555e9e8f0ba935","fast_id":"1f399c33907ffbad8fa94568ab3b4580cd42ec8a1ef99d9109ca2802766a43ef","fast_time":0.0138327412,"language":"cpp","measured_fast_code_id":"1f399c33907ffbad8fa94568ab3b4580cd42ec8a1ef99d9109ca2802766a43ef","measured_slow_code_id":"3304b146e26a2a2e9a97cdf1be5fa550e47ef266e26b2665e92c6036d4a338cd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74719","problem_id":"p02275","slow_code_id":"e4bef3ec17bf001205a230d253a2eb8cb2fec637e5027f1b31bc28425dfe6b40","slow_id":"3304b146e26a2a2e9a97cdf1be5fa550e47ef266e26b2665e92c6036d4a338cd","slow_time":0.1108512402,"speedup":8.013685689427922,"stratum":"8+","sampling_key":"03db8dbce5ba3066c448c7ea5c0241d4dc846fc214233a6986bd01c9655f3099","slow_code":"#include <cstdio>\n\n#include <iostream>\n\n#include <cmath>\n\n#include <cstring>\n\nusing namespace std;\n\nint arr[2000100], c[100001], ans[2000100];\n\nint main()\n\n{\n\n  int i, n;\n\n  scanf(\"%d\", &n);\n\n  memset(c, 0, sizeof(c));\n\n  for (i = 1; i <= n; ++i)\n\n  {\n\n    scanf(\"%d\", &arr[i]);\n\n    ++c[arr[i]];\n  }\n\n  for (i = 1; i < 100001; ++i)\n\n    c[i] = c[i] + c[i - 1];\n\n  for (i = n; i > 0; --i)\n\n  {\n\n    ans[c[arr[i]]] = arr[i];\n\n    --c[arr[i]];\n  }\n\n  for (i = 1; i < n; ++i)\n\n    printf(\"%d \", ans[i]);\n\n  printf(\"%d\\n\", ans[n]);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <fstream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint a[2000005];\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n  }\n\n  sort(a, a + n);\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    if (i)\n      printf(\" \");\n\n    printf(\"%d\", a[i]);\n  }\n\n  printf(\"\\n\");\n\n  return 0;\n}"}
{"fast_code_id":"650475b4d7f1c3402d3fd59c6f8b1d6719b85f1a1116767a46b1ff154309b9e3","fast_id":"8c918d56228a43688e715be39f8d7746791d8898f0ea88d782a6ba351f693cb8","fast_time":0.0231625222,"language":"cpp","measured_fast_code_id":"8c918d56228a43688e715be39f8d7746791d8898f0ea88d782a6ba351f693cb8","measured_slow_code_id":"fca9b3085e26c495ee9ac7aadb02d4e818df887789353c7080c007bf2fa5ecea","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74769","problem_id":"p02661","slow_code_id":"8435dc6134798c3a1f9afbd17599a791897344a508919524c0973ad71a6340eb","slow_id":"fca9b3085e26c495ee9ac7aadb02d4e818df887789353c7080c007bf2fa5ecea","slow_time":0.1100569436,"speedup":4.751509470760485,"stratum":"4-8","sampling_key":"06476b943f9144d0b211b60ac5e886bc24a62feadaa0a7f4bb8c9704fcb41ad4","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx2\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  int A[200000], B[200000];\n\n  rep(i, N) { cin >> A[i] >> B[i]; }\n\n  sort(A, A + N);\n\n  sort(B, B + N);\n\n  if (N % 2) {\n\n    int a = A[(N - 1) / 2];\n\n    int b = B[(N - 1) / 2];\n\n    co(b - a + 1);\n\n  }\n\n  else {\n\n    int a = A[N / 2] + A[N / 2 - 1];\n\n    int b = B[N / 2] + B[N / 2 - 1];\n\n    co(b - a + 1);\n  }\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx2\")\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int CM = 1 << 17, CL = 12;\n\nchar cn[CM + CL], *ci = cn + CM + CL, *owa = cn + CM, ct;\n\nconst ll ma0 = 1157442765409226768;\n\nconst ll ma1 = 1085102592571150095;\n\nconst ll ma2 = 71777214294589695;\n\nconst ll ma3 = 281470681808895;\n\nconst ll ma4 = 4294967295;\n\ninline int getint() {\n\n  if (ci - owa > 0) {\n\n    memcpy(cn, owa, CL);\n\n    ci -= CM;\n\n    fread(cn + CL, 1, CM, stdin);\n  }\n\n  ll tmp = *(ll *)ci;\n\n  int dig = ((tmp & ma0) ^ ma0) ? 68 - __builtin_ctzll((tmp & ma0) ^ ma0) : 0;\n\n  tmp = tmp << dig & ma1;\n\n  tmp = tmp * 10 + (tmp >> 8) & ma2;\n\n  tmp = tmp * 100 + (tmp >> 16) & ma3;\n\n  tmp = tmp * 10000 + (tmp >> 32) & ma4;\n\n  ci += (64 - dig >> 3);\n\n  while ((ct = *ci++) >= '0')\n    tmp = tmp * 10 + ct - '0';\n\n  return tmp;\n}\n\nint main() {\n\n  int A[200000], B[200000];\n\n  int N = getint();\n\n  rep(i, N) {\n\n    A[i] = getint();\n\n    B[i] = getint();\n  }\n\n  nth_element(A, A + N / 2, A + N);\n\n  nth_element(B, B + N / 2, B + N);\n\n  if (N % 2) {\n\n    printf(\"%d\\n\", B[N / 2] - A[N / 2] + 1);\n\n  }\n\n  else {\n\n    int a = *max_element(A, A + N / 2);\n\n    int b = *max_element(B, B + N / 2);\n\n    printf(\"%d\\n\", b + B[N / 2] - a - A[N / 2] + 1);\n  }\n\n  Would you please return 0;\n}"}
{"fast_code_id":"be993297d665ebc75897a7f954511114afc0db074215991bf412410cc043f391","fast_id":"2881389a29ea4ff7b22bbfc1200b8d3ffd788594403dbd106f58bf18a656d234","fast_time":0.0001919789,"language":"cpp","measured_fast_code_id":"2881389a29ea4ff7b22bbfc1200b8d3ffd788594403dbd106f58bf18a656d234","measured_slow_code_id":"f875211639061640b2448ecb76d6b69e78984c9892cee012ba2dd37c33712992","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74794","problem_id":"p02315","slow_code_id":"cb017d15433bc38eb535f799dde5e21bfcbaa922d3d61e8117634e5b965849fd","slow_id":"f875211639061640b2448ecb76d6b69e78984c9892cee012ba2dd37c33712992","slow_time":0.004400392,"speedup":22.921227280706372,"stratum":"8+","sampling_key":"d7fb0c71ea2147bbb4fcad21186446f8e8904c67e90492eacd8942e64e10294c","slow_code":"#include <stdio.h>\n\n#include <algorithm>\n\n#include <string.h>\n\nusing namespace std;\n\nconst int MAX_N = 100;\n\nconst int MAX_W = 10000;\n\nint w[MAX_N];\n\nint v[MAX_N];\n\nint dp[MAX_N + 1][MAX_W + 1];\n\nint n, W;\n\nint rec(int i, int j) {\n\n  if (dp[i][j] >= 0) {\n\n    return dp[i][j];\n  }\n\n  int res;\n\n  if (i == n) {\n\n    res = 0;\n\n  }\n\n  else if (j < w[i]) {\n\n    res = rec(i + 1, j);\n\n  }\n\n  else {\n\n    res = max(rec(i + 1, j), rec(i + 1, j - w[i]) + v[i]);\n  }\n\n  return dp[i][j] = res;\n}\n\nint main() {\n\n  scanf(\"%d %d\", &n, &W);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d %d\", &v[i], &w[i]);\n  }\n\n  memset(dp, -1, sizeof(dp));\n\n  printf(\"%d\\n\", rec(0, W));\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int MAX_N = 100;\n\nconst int MAX_W = 10000;\n\nint n, W;\n\nint v[MAX_N];\n\nint w[MAX_N];\n\nint dp[MAX_N + 1][MAX_W + 1];\n\nvoid solve() {\n\n  for (int i = 0; i < n; i++) {\n\n    for (int j = 0; j <= W; j++) {\n\n      if (j < w[i]) {\n\n        dp[i + 1][j] = dp[i][j];\n\n      }\n\n      else {\n\n        dp[i + 1][j] = max(dp[i][j], dp[i][j - w[i]] + v[i]);\n      }\n    }\n  }\n}\n\nint main() {\n\n  scanf(\"%d%d\", &n, &W);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d%d\", &v[i], &w[i]);\n\n    dp[i][0] = 0;\n  }\n\n  solve();\n\n  printf(\"%d\\n\", dp[n][W]);\n\n  return 0;\n}"}
{"fast_code_id":"eecdf7ad13ef0056a37dd4fdca8bd60b1c862f713ac3fc268b10b3baa8de5a4e","fast_id":"a6aaa2bbc608283d67deacbba31826422cfcb75635271db37bea9a3f3bf1dc27","fast_time":0.0696444692,"language":"cpp","measured_fast_code_id":"a6aaa2bbc608283d67deacbba31826422cfcb75635271db37bea9a3f3bf1dc27","measured_slow_code_id":"0863579159595d4f37b4d401decb3ef54cbc1a872c60053af0b735e6158d5129","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74813","problem_id":"p03532","slow_code_id":"bf07a9bfd64ea9514e472368c9c3eff16d46ab69f15a83c4d760764d5e7c92d9","slow_id":"0863579159595d4f37b4d401decb3ef54cbc1a872c60053af0b735e6158d5129","slow_time":0.4505758586,"speedup":6.469657444097513,"stratum":"4-8","sampling_key":"e0e12174c2c73dc9a64709072fe6c1aafe4fa783fcde36b9b06fe3ec8c52216a","slow_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <cstring>\n\n#define SIZE 200005\n\n#define INF 10000000000000000LL\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<int, int> P;\n\ntypedef pair<ll, P> PP;\n\nstruct edge\n\n{\n\n  int to;\n\n  ll cost;\n\n  edge(int to = 0, ll cost = 0) : to(to), cost(cost) {}\n};\n\nstruct UF\n\n{\n\n  int par[SIZE], rank[SIZE];\n\n  void init(int n)\n\n  {\n\n    for (int i = 0; i < n; i++)\n\n    {\n\n      par[i] = i;\n\n      rank[i] = 0;\n    }\n  }\n\n  int find(int x)\n\n  {\n\n    if (par[x] == x)\n      return x;\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y)\n\n  {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x == y)\n      return;\n\n    if (rank[x] < rank[y])\n      par[x] = y;\n\n    else\n\n    {\n\n      par[y] = x;\n\n      if (rank[x] == rank[y])\n        rank[x]++;\n    }\n  }\n\n  bool same(int x, int y)\n\n  {\n\n    return find(x) == find(y);\n  }\n};\n\nUF uf;\n\nvector<edge> vec[SIZE];\n\nll X[SIZE];\n\nint v1[SIZE], v2[SIZE];\n\nll d1[SIZE], d2[SIZE];\n\nint id[SIZE], ch[SIZE];\n\nint now_id;\n\nvoid dfs(int v = 0, int p = -1)\n\n{\n\n  id[v] = now_id++;\n\n  d1[v] = d2[v] = INF;\n\n  v1[v] = v2[v] = -1;\n\n  for (int i = 0; i < vec[v].size(); i++)\n\n  {\n\n    edge e = vec[v][i];\n\n    if (e.to != p)\n\n    {\n\n      dfs(e.to, v);\n\n      ll vl = d1[e.to] + e.cost;\n\n      int vv = v1[e.to];\n\n      if (vl > e.cost + X[e.to])\n\n      {\n\n        vl = e.cost + X[e.to];\n\n        vv = e.to;\n      }\n\n      if (vl < d1[v])\n\n      {\n\n        swap(vl, d1[v]);\n\n        swap(vv, v1[v]);\n      }\n    }\n  }\n\n  ch[v] = now_id;\n}\n\nvoid make(int v = 0, int p = -1)\n\n{\n\n  for (int i = 0; i < vec[v].size(); i++)\n\n  {\n\n    edge e = vec[v][i];\n\n    if (e.to != p)\n\n    {\n\n      ll vl = d1[v] + e.cost;\n\n      int vv = v1[v];\n\n      if (id[e.to] <= id[vv] && id[vv] < ch[e.to])\n\n      {\n\n        vl = d2[v] + e.cost;\n\n        vv = v2[v];\n      }\n\n      if (vl > e.cost + X[v])\n\n      {\n\n        vl = e.cost + X[v];\n\n        vv = v;\n      }\n\n      if (vl < d1[e.to])\n\n      {\n\n        swap(vl, d1[e.to]);\n\n        swap(vv, v1[e.to]);\n      }\n\n      make(e.to, v);\n    }\n  }\n}\n\nint A[SIZE], B[SIZE];\n\nll C[SIZE];\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n    scanf(\"%lld\", &X[i]);\n\n  for (int i = 0; i < n - 1; i++)\n\n  {\n\n    int a, b;\n\n    ll c;\n\n    scanf(\"%d %d %lld\", &a, &b, &c);\n    a--, b--;\n\n    vec[a].push_back(edge(b, c));\n\n    vec[b].push_back(edge(a, c));\n\n    A[i] = a, B[i] = b, C[i] = c;\n  }\n\n  dfs();\n\n  make();\n\n  uf.init(n + 2);\n\n  ll ret = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    if (v1[v1[i]] == i && i < v1[i])\n      continue;\n\n    ret += d1[i] + X[i];\n\n    uf.unite(i, v1[i]);\n  }\n\n  for (int i = 0; i < n - 1; i++)\n\n  {\n\n    if (!uf.same(A[i], B[i]))\n\n    {\n\n      ret += min(X[A[i]], d1[A[i]]);\n\n      ret += min(X[B[i]], d1[B[i]]);\n\n      ret += C[i];\n    }\n  }\n\n  printf(\"%lld\\n\", ret);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#define N 300010\n\n#define inf 1000000000000000ll\n\nusing namespace std;\n\ntypedef long long ll;\n\ninline int read()\n\n{\n\n  int x = 0, f = 1;\n  char ch = getchar();\n\n  while (ch < '0' || ch > '9') {\n    if (ch == '-')\n      f = -1;\n    ch = getchar();\n  }\n\n  while (ch >= '0' && ch <= '9') {\n    x = x * 10 + ch - '0';\n    ch = getchar();\n  }\n\n  return x * f;\n}\n\nstruct edge\n\n{\n\n  int u, v, next;\n\n  ll w;\n\n} vs[N << 1];\n\nint n, ee, st[N], bg[N], ed[N], las;\n\nint V1[N], V2[N];\n\nll F1[N], F2[N], vl[N];\n\ninline void addedge(int u, int v, int w)\n\n{\n\n  vs[++ee].v = v;\n\n  vs[ee].w = w;\n  vs[ee].u = u;\n\n  vs[ee].next = st[u];\n  st[u] = ee;\n}\n\ninline void dfs(int rt, int pr)\n\n{\n\n  bg[rt] = las++;\n\n  V1[rt] = V2[rt] = -1;\n\n  F1[rt] = F2[rt] = inf;\n\n  for (int i = st[rt]; i; i = vs[i].next)\n\n  {\n\n    if (vs[i].v == pr)\n      continue;\n\n    dfs(vs[i].v, rt);\n\n    int xx = V1[vs[i].v];\n    ll yy = F1[vs[i].v] + vs[i].w;\n\n    if (yy > vl[vs[i].v] + vs[i].w)\n\n      yy = vl[vs[i].v] + vs[i].w,\n\n      xx = vs[i].v;\n\n    if (F1[rt] > yy)\n      swap(yy, F1[rt]), swap(xx, V1[rt]);\n\n    if (F2[rt] > yy)\n      swap(yy, F2[rt]), swap(xx, V2[rt]);\n  }\n\n  ed[rt] = las;\n}\n\ninline void DFS(int rt, int pr)\n\n{\n\n  for (int i = st[rt]; i; i = vs[i].next)\n\n  {\n\n    if (vs[i].v == pr)\n      continue;\n\n    int xx = V1[rt];\n    ll yy = F1[rt] + vs[i].w;\n\n    if (bg[vs[i].v] <= bg[xx] && bg[xx] < ed[vs[i].v])\n\n    {\n\n      xx = V2[rt];\n      yy = F2[rt] + vs[i].w;\n    }\n\n    if (yy > vs[i].w + vl[rt])\n\n      yy = vl[rt] + vs[i].w,\n\n      xx = rt;\n\n    if (F1[vs[i].v] > yy)\n      swap(yy, F1[vs[i].v]), swap(xx, V1[vs[i].v]);\n\n    if (F2[vs[i].v] > yy)\n      swap(yy, F2[vs[i].v]), swap(xx, V2[vs[i].v]);\n\n    DFS(vs[i].v, rt);\n  }\n}\n\nint fa[N];\n\ninline int getfa(int x)\n\n{\n\n  return fa[x] == x ? x : fa[x] = getfa(fa[x]);\n}\n\nint main()\n\n{\n\n  n = read();\n  for (int i = 1; i <= n; i++)\n\n    vl[i] = read();\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    int u = read(), v = read(), w = read();\n\n    addedge(u, v, w);\n    addedge(v, u, w);\n  }\n  dfs(1, 0);\n  DFS(1, 0);\n\n  for (int i = 1; i <= n; i++)\n    fa[i] = i;\n\n  ll Ans = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (V1[V1[i]] == i && i > V1[i])\n      continue;\n\n    Ans += F1[i] + vl[i];\n\n    int f1 = getfa(i), f2 = getfa(V1[i]);\n\n    fa[f1] = f2;\n  }\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    if (getfa(vs[i << 1].u) == getfa(vs[i << 1].v))\n      continue;\n\n    Ans += min(vl[vs[i << 1].u], F1[vs[i << 1].u]);\n\n    Ans += min(vl[vs[i << 1].v], F1[vs[i << 1].v]);\n\n    Ans += vs[i << 1].w;\n  }\n\n  cout << Ans << endl;\n\n  return 0;\n}"}
{"fast_code_id":"797e84ba3f9118412078f2b25621263b7e335556ccc17afdfa21be34faee9467","fast_id":"3f577496a389b327217c89d94ecef277ca2c5c67b92b9d8c3c333b9b46d63c6e","fast_time":0.0775631768,"language":"cpp","measured_fast_code_id":"3f577496a389b327217c89d94ecef277ca2c5c67b92b9d8c3c333b9b46d63c6e","measured_slow_code_id":"b5c4f6ca6c38e489ca20db68c9524f0712d4de5619652ff92a2bd4e3390cb5d1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74850","problem_id":"p03608","slow_code_id":"a60efb1761915d4f7a202d7780b1a1400b53995ebbb965e091f75182239ed39e","slow_id":"b5c4f6ca6c38e489ca20db68c9524f0712d4de5619652ff92a2bd4e3390cb5d1","slow_time":0.2819454953,"speedup":3.6350431600681943,"stratum":"2-4","sampling_key":"27d4410e0d4cf551aa8620bdd837def590a613b0af61ac6b3fdab6bea7f6c084","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <climits>\n\n#include <cstring>\n\n#include <vector>\n\n#include <queue>\n\n#include <utility>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define rep1(i, n) for (int i = 1; i <= n; i++)\n\n#define scan(arg) cin >> arg\n\n#define prin(arg) cout << arg << \"\\n\"\n\n#define prin2(arg1, arg2) cout << arg1 << \" \" << arg2 << \"\\n\"\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int NMAX = 1 << 17;\n\ntypedef pair<ll, int> pi;\n\nconst ll INF = 1000000000;\n\nint n, m, R;\n\nll r[9], a[100000], b[100000], c[100000];\n\nll cutg[10][10];\n\nstruct edge {\n\n  ll to, cost;\n};\n\nint V, E;\n\nvector<edge> g[100000];\n\nll d[210];\n\nvoid dijkstra(int s) {\n\n  priority_queue<pi, vector<pi>, greater<pi> > q;\n\n  for (int i = 0; i < V; i++)\n    d[i] = INF;\n\n  d[s] = 0;\n\n  q.push(pi(0, s));\n\n  while (!q.empty()) {\n\n    pi p = q.top();\n    q.pop();\n\n    int w = p.second;\n\n    if (d[w] < p.first)\n      continue;\n\n    for (int i = 0; i < g[w].size(); i++) {\n\n      int t = g[w][i].to;\n\n      ll c = g[w][i].cost;\n\n      if (d[t] > d[w] + c) {\n\n        d[t] = d[w] + c;\n\n        q.push(pi(d[t], t));\n      }\n    }\n  }\n}\n\nll dp[1 << 10][10];\n\nll rec(int S, int v, int go) {\n\n  if (dp[S][v] >= 0)\n    return dp[S][v];\n\n  if (S == (1 << R) - 1 && v == go)\n    return dp[S][v] = 0;\n\n  ll res = 1e+12;\n\n  rep(u, R) {\n\n    if (!(S >> u & 1)) {\n\n      res = min(res, rec(S | 1 << u, u, go) + cutg[v][u]);\n    }\n  }\n\n  return dp[S][v] = res;\n}\n\nint main() {\n\n  scan(n);\n  scan(m);\n  scan(R);\n\n  rep(i, R) { scan(r[i]); }\n\n  rep(i, m) {\n\n    scan(a[i]);\n    scan(b[i]);\n    scan(c[i]);\n  }\n\n  rep(i, m) {\n\n    edge e;\n\n    e.to = b[i] - 1;\n    e.cost = c[i];\n\n    g[a[i] - 1].push_back(e);\n\n    e.to = a[i] - 1;\n\n    g[b[i] - 1].push_back(e);\n  }\n\n  V = n;\n\n  rep(i, R) {\n\n    dijkstra(r[i] - 1);\n\n    rep(j, R) { cutg[i][j] = d[r[j] - 1]; }\n  }\n\n  ll res = 1e+12;\n\n  rep(i, R) {\n\n    rep(j, R) {\n\n      memset(dp, -1, sizeof(dp));\n\n      res = min(res, rec(1 << i, i, j));\n    }\n  }\n\n  prin(res);\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\n#define rep1(i, n) for (int i = 1; i <= n; ++i)\n\nusing namespace std;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> bool chmin(T &a, const T &b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <typename X>\n\nstruct Edge {\n\n  int from;\n\n  int to;\n\n  X cost;\n\n  Edge() = default;\n\n  Edge(int from, int to, X cost) : from(from), to(to), cost(cost) {}\n};\n\ntemplate <typename X>\n\nstruct Node {\n\n  int idx;\n\n  X dist;\n\n  vector<Edge<X>> edge;\n\n  Node() = default;\n\n  explicit Node(int idx) : idx(idx) {}\n};\n\ntemplate <typename X = int>\n\nstruct Status {\n\n  int idx;\n\n  X dist;\n\n  Status() = default;\n\n  Status(int idx, X dist) : idx(idx), dist(dist) {}\n\n  bool operator==(const Status &r) const {\n\n    return (idx == r.idx && dist == r.dist);\n  }\n\n  bool operator!=(const Status &r) const { return !(*this == r); }\n\n  bool operator<(const Status &r) const { return dist > r.dist; }\n\n  bool operator>(const Status &r) const { return dist < r.dist; }\n};\n\ntemplate <typename X>\n\nclass Graph {\n\nprivate:\n  int n;\n\n  int m;\n\n  vector<Node<X>> node;\n\n  const X inf = 1e+9;\n\n  void Init_Node() { rep(i, n) node.emplace_back(i); }\n\npublic:\n  explicit Graph(int n) : n(n) { Init_Node(); }\n\n  Graph(int n, int m, vector<int> from, vector<int> to) : n(n), m(m) {\n\n    Init_Node();\n\n    rep(i, m) {\n\n      add_edge(from[i], to[i]);\n\n      add_edge(to[i], from[i]);\n    }\n  }\n\n  Graph(int n, int m, vector<int> from, vector<int> to, vector<X> cost)\n      : n(n), m(m) {\n\n    Init_Node();\n\n    rep(i, m) {\n\n      add_edge(from[i], to[i], cost[i]);\n\n      add_edge(to[i], from[i], cost[i]);\n    }\n  }\n\n  void add_edge(int from, int to, X cost = 1) {\n\n    node[from].edge.emplace_back(from, to, cost);\n  }\n\n  void dijkstra(int s) {\n\n    rep(i, n) node[i].dist = inf;\n\n    node[s].dist = 0;\n\n    priority_queue<Status<X>> pq;\n\n    pq.emplace(s, 0);\n\n    while (!pq.empty()) {\n\n      Status<X> now = pq.top();\n      pq.pop();\n\n      int v = now.idx;\n\n      X dis = now.dist;\n\n      if (node[v].dist < dis)\n        continue;\n\n      for (auto next : node[v].edge) {\n\n        int w = next.to;\n\n        X cos = next.cost;\n\n        if (chmin(node[w].dist, node[v].dist + cos)) {\n\n          pq.emplace(w, node[w].dist);\n        }\n      }\n    }\n  }\n\n  X Get_d(int v) { return node[v].dist; }\n\n  X Get_inf() { return inf; }\n};\n\nint main()\n\n{\n\n  int n, m, r;\n\n  cin >> n >> m >> r;\n\n  vector<int> x(r);\n\n  rep(i, r) {\n\n    cin >> x[i];\n\n    x[i]--;\n  }\n\n  vector<int> a(m), b(m), c(m);\n\n  rep(i, m) {\n\n    cin >> a[i] >> b[i] >> c[i];\n\n    a[i]--;\n    b[i]--;\n  }\n\n  Graph<int> gp(n, m, a, b, c);\n\n  vector<vector<int>> cost(r, vector<int>(r));\n\n  rep(i, r) {\n\n    gp.dijkstra(x[i]);\n\n    rep(j, r) { cost[i][j] = gp.Get_d(x[j]); }\n  }\n\n  int inf = 1e+9;\n\n  vector<vector<int>> dp(r, vector<int>((1 << r), inf));\n\n  rep(i, r) { dp[i][(1 << i)] = 0; }\n\n  rep1(mask, (1 << r) - 1) {\n\n    rep(i, r) {\n\n      if (!((mask >> i) & 1))\n        continue;\n\n      rep(j, r) {\n\n        if (!((mask >> j) & 1)) {\n\n          chmin(dp[j][mask | (1 << j)], dp[i][mask] + cost[i][j]);\n        }\n      }\n    }\n  }\n\n  int res = 1e+9;\n\n  rep(i, r) chmin(res, dp[i][(1 << r) - 1]);\n\n  cout << res << \"\\n\";\n\n  return 0;\n}\n"}
{"fast_code_id":"0be4fb8ca4c46d719a3a4a9496b6b711de853685c29de1b0d8ad97bb048396cc","fast_id":"04d9d0835cf4ef91066ea3d1183fff7a4f005101388a7709d37a693204c4efb1","fast_time":0.0556893137,"language":"cpp","measured_fast_code_id":"04d9d0835cf4ef91066ea3d1183fff7a4f005101388a7709d37a693204c4efb1","measured_slow_code_id":"6ae7098eb7f14fbeb3979bcc2c1735902903eb84f7db85ca8e87ed43b5f64130","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74882","problem_id":"p03157","slow_code_id":"195500d81cc7f9f49d48116fe19787517b8f987855b483cb3616902ea959a868","slow_id":"6ae7098eb7f14fbeb3979bcc2c1735902903eb84f7db85ca8e87ed43b5f64130","slow_time":0.1285321197,"speedup":2.308021255072497,"stratum":"2-4","sampling_key":"f03e8f6ebad23cdefb83388588f22efef28710250ab4af0546fded184c6ca3d9","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <map>\n\nusing namespace std;\n\nstruct UF {\n\n  int par[200000];\n\n  int rank[200000];\n\n  void init(int n) {\n\n    for (int i = 0; i < n; i++) {\n\n      par[i] = i;\n\n      rank[i] = 0;\n    }\n  }\n\n  int find(int x) {\n\n    if (par[x] == x)\n      return x;\n\n    return par[x] = find(par[x]);\n  }\n\n  void unite(int x, int y) {\n\n    x = find(x);\n\n    y = find(y);\n\n    if (x != y) {\n\n      if (rank[x] < rank[y]) {\n\n        par[x] = y;\n\n      } else {\n\n        par[y] = x;\n\n        if (rank[x] == rank[y])\n          rank[x]++;\n      }\n    }\n  }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n};\n\nint main(void) {\n\n  int h, w;\n\n  long long t = 0;\n\n  string s[404];\n\n  UF u;\n\n  map<int, long long> a, b;\n\n  cin >> h >> w;\n\n  u.init(160008);\n\n  for (int i = 0; i < h; i++) {\n\n    cin >> s[i];\n  }\n\n  for (int i = 0; i < h; i++) {\n\n    for (int j = 0; j < w; j++) {\n\n      if (j < w - 1) {\n\n        if (s[i][j] != s[i][j + 1]) {\n\n          u.unite(i * 400 + j, i * 400 + j + 1);\n        }\n      }\n\n      if (i < h - 1) {\n\n        if (s[i][j] != s[i + 1][j]) {\n\n          u.unite(i * 400 + j, (i + 1) * 400 + j);\n        }\n      }\n    }\n  }\n\n  for (int i = 0; i < h; i++) {\n\n    for (int j = 0; j < w; j++) {\n\n      int m = i * 400 + j, l;\n\n      l = u.find(m);\n\n      if (s[i][j] == '#') {\n\n        a[l]++;\n\n      } else {\n\n        b[l]++;\n      }\n    }\n  }\n\n  for (auto x = a.begin(); x != a.end(); x++) {\n\n    int k = x->first;\n\n    t += a[k] * b[k];\n  }\n\n  cout << t << endl;\n}\n","fast_code":"#include <iostream>\n\n#include <string>\n\nusing namespace std;\n\ntypedef pair<long long, long long> P;\n\nint dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nint h, w;\n\nstring s[400];\n\nbool b[400][400];\n\nP f(int y, int x) {\n\n  long long c = 0, d = 0;\n\n  b[y][x] = true;\n\n  if (s[y][x] == '#') {\n\n    c++;\n\n  } else {\n\n    d++;\n  }\n\n  for (int i = 0; i < 4; i++) {\n\n    int nx = x + dx[i], ny = y + dy[i];\n\n    if (ny >= 0 && ny < h && nx >= 0 && nx < w) {\n\n      if (!b[ny][nx] && s[y][x] != s[ny][nx]) {\n\n        P p = f(ny, nx);\n\n        c += p.first;\n\n        d += p.second;\n      }\n    }\n  }\n\n  return P(c, d);\n}\n\nint main(void) {\n\n  long long t = 0;\n\n  cin >> h >> w;\n\n  for (int i = 0; i < h; i++) {\n\n    cin >> s[i];\n\n    for (int j = 0; j < w; j++) {\n\n      b[i][j] = false;\n    }\n  }\n\n  for (int i = 0; i < h; i++) {\n\n    for (int j = 0; j < w; j++) {\n\n      if (!b[i][j]) {\n\n        P p = f(i, j);\n\n        t += p.first * p.second;\n      }\n    }\n  }\n\n  cout << t << endl;\n}\n"}
{"fast_code_id":"94150ac2e8e47f08910a3526c2c2978ca792a7c37624400617df70e728e890f9","fast_id":"a95dd73b71b71785ab5ad479095a9554eaf02dac1b7bf0619bfbdc6c8a7fa158","fast_time":0.006014699,"language":"cpp","measured_fast_code_id":"a95dd73b71b71785ab5ad479095a9554eaf02dac1b7bf0619bfbdc6c8a7fa158","measured_slow_code_id":"3c3e592a45408504b419172272fafeec6b930ce5e62f77abbe19dd45e06e0c2e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74896","problem_id":"p02794","slow_code_id":"f3136deeb2785515f634e444477be2f41e1480abea464b8c5c9dfed1c2f6ff9a","slow_id":"3c3e592a45408504b419172272fafeec6b930ce5e62f77abbe19dd45e06e0c2e","slow_time":0.0322992687,"speedup":5.370055708523402,"stratum":"4-8","sampling_key":"5f211dc08cc11f7bb02ac8a0d63402bc3121057d9cd797bf69123d3cfd6cd89b","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nll dp[1 << 20];\n\nvector<int> V[51];\n\nvector<pair<int, int>> E[51];\n\nvoid dfs(int p, vector<int> v, int mae) {\n\n  V[p] = v;\n\n  for (auto pr : E[p]) {\n\n    int to = pr.first;\n\n    if (mae != to) {\n\n      v.pb(pr.second);\n\n      dfs(to, v, p);\n\n      v.pop_back();\n    }\n  }\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  rep(i, N - 1) {\n\n    int a, b;\n\n    cin >> a >> b;\n\n    E[a].pb(mp(b, i));\n\n    E[b].pb(mp(a, i));\n  }\n\n  vector<int> kari;\n\n  dfs(1, kari, 0);\n\n  int M;\n\n  cin >> M;\n\n  int list[51] = {};\n\n  rep(i, M) {\n\n    int u, v;\n\n    cin >> u >> v;\n\n    for (int j : V[u])\n      list[j] ^= 1 << i;\n\n    for (int j : V[v])\n      list[j] ^= 1 << i;\n  }\n\n  dp[0] = 1;\n\n  rep(i, N - 1) {\n\n    for (int j = (1 << M) - 1; j >= 0; j--) {\n\n      dp[j | list[i]] += dp[j];\n    }\n  }\n\n  co(dp[(1 << M) - 1]);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nll V[51];\n\nint to[102], ne[102], he[51];\n\nvoid dfs(int p, ll v, int mae) {\n\n  V[p] = v >> 1;\n\n  for (int q = he[p]; q; q = ne[q]) {\n\n    int To = to[q];\n\n    if (mae != To) {\n\n      v ^= 1ll << (q >> 1);\n\n      dfs(To, v, p);\n\n      v ^= 1ll << (q >> 1);\n    }\n  }\n}\n\nint N, M;\n\nint kazoeru[51];\n\nll seiyaku[20];\n\nvoid keisan(int i, bool k, ll are) {\n\n  if (i == M) {\n\n    kazoeru[__builtin_popcountll(are)] += 1 - k * 2;\n\n  }\n\n  else {\n\n    keisan(i + 1, k, are);\n\n    keisan(i + 1, !k, are | seiyaku[i]);\n  }\n}\n\nint main() {\n\n  scanf(\"%d\", &N);\n\n  int kari = 2;\n\n  rep(i, N - 1) {\n\n    int a, b;\n\n    scanf(\"%d %d\", &a, &b);\n\n    to[kari] = b;\n\n    ne[kari] = he[a];\n\n    he[a] = kari++;\n\n    to[kari] = a;\n\n    ne[kari] = he[b];\n\n    he[b] = kari++;\n  }\n\n  dfs(1, 0, 0);\n\n  scanf(\"%d\", &M);\n\n  rep(i, M) {\n\n    int u, v;\n\n    scanf(\"%d %d\", &u, &v);\n\n    seiyaku[i] = V[u] ^ V[v];\n  }\n\n  keisan(0, 1, 0);\n\n  ll kotae = 0;\n\n  rep1(i, N) {\n\n    ll tmp = (1ll << N - 1) - (1ll << (N - i - 1));\n\n    kotae += tmp * kazoeru[i];\n  }\n\n  printf(\"%lld\", kotae);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"125820d2d9427d74e410ed83482e314d1115ca5e32cffa4d339d7df87b6f6ffc","fast_id":"8e23bdc588ec3255b80eb7f0e985fd5e235924ace47673ede32a67cad4ee8ace","fast_time":0.0323218364,"language":"cpp","measured_fast_code_id":"8e23bdc588ec3255b80eb7f0e985fd5e235924ace47673ede32a67cad4ee8ace","measured_slow_code_id":"ec8b1349d01709d2652201ce0c1b0fa217562def5394876602b610401f8a5fe5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74909","problem_id":"p02901","slow_code_id":"091936f0d94992099fe72463785f2e4b35c462b5830e3566e0e27fab171171f3","slow_id":"ec8b1349d01709d2652201ce0c1b0fa217562def5394876602b610401f8a5fe5","slow_time":0.3716440659,"speedup":11.498234855863574,"stratum":"8+","sampling_key":"2d02560640048d39b679f9d1f9d770a598b6375fb8760278ce1a49da580b80b4","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\nconst int N = 1e5 + 10;\n\ntypedef long long LL;\n\nvector<int> v[N];\n\nint a[N];\n\nint b[N];\n\nint dp[1 << 15];\n\nint main()\n\n{\n\n  int n, m;\n\n  cin >> n >> m;\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    cin >> a[i];\n\n    int c;\n\n    cin >> c;\n\n    for (int j = 1; j <= c; j++)\n\n    {\n\n      int u;\n\n      cin >> u;\n\n      u--;\n\n      b[i] |= (1 << u);\n    }\n  }\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int u = b[i];\n\n    for (int j = 0; j < (1 << n); j++)\n\n    {\n\n      if (j == 0 || dp[j])\n\n      {\n\n        if (dp[u | j])\n\n        {\n\n          dp[u | j] = min(dp[u | j], dp[j] + a[i]);\n\n        }\n\n        else\n\n        {\n\n          dp[u | j] = dp[j] + a[i];\n        }\n      }\n    }\n  }\n\n  if (dp[(1 << n) - 1])\n\n    cout << dp[(1 << n) - 1] << endl;\n\n  else\n\n    cout << -1 << endl;\n}","fast_code":"#include <cstring>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#define N 10005\n\n#define INF 0x3f3f3f3f\n\nusing namespace std;\n\nlong long int d[N];\n\nlong long int a[1005];\n\nint v[15];\n\nint s[10005];\n\nint b[1005];\n\nint c[15];\n\nint n;\n\nint m;\n\nint tar;\n\nlong long int ans = INF;\n\nint main() {\n\n  scanf(\"%d%d\", &n, &m);\n\n  memset(d, 0x3f, sizeof(d));\n\n  memset(v, 0, sizeof(v));\n\n  memset(s, 0, sizeof(s));\n\n  for (int i = 1; i <= m; i++) {\n\n    int x, y;\n\n    scanf(\"%lld%d\", &a[i], &y);\n\n    int st = 0;\n\n    for (int j = 1; j <= y; j++) {\n\n      scanf(\"%d\", &c[j]);\n\n      v[c[j]]++;\n\n      st += (1 << (c[j] - 1));\n    }\n\n    b[i] = st;\n  }\n\n  tar = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    tar += (1 << (i - 1));\n\n    if (v[i] == 0) {\n\n      printf(\"-1\");\n\n      return 0;\n    }\n  }\n\n  d[0] = 0;\n\n  for (int i = 0; i <= tar; i++) {\n\n    for (int j = 1; j <= m; j++) {\n\n      if (d[i | b[j]] > d[i] + a[j]) {\n\n        d[i | b[j]] = d[i] + a[j];\n      }\n    }\n  }\n\n  printf(\"%lld\", d[tar]);\n}"}
{"fast_code_id":"a6b63fd1c85799e323afd6d7e2b2ea7a289dc7eab37cb886e5ee2b719b2c70f4","fast_id":"8e52005cf8b2654c03ce7c8a144ff89c7d97ea8088b44f41e057bd884b6ab366","fast_time":0.0249535277,"language":"cpp","measured_fast_code_id":"8e52005cf8b2654c03ce7c8a144ff89c7d97ea8088b44f41e057bd884b6ab366","measured_slow_code_id":"22727c1e77952afcc59878e47ce273d0fb0dcc4973d5a0767e37dc2b782d3dd9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74981","problem_id":"p00274","slow_code_id":"cf5dfc55a96ac00f4a598af5c0cf47c5801a9c1b51d0a925e084fa1decee81f9","slow_id":"22727c1e77952afcc59878e47ce273d0fb0dcc4973d5a0767e37dc2b782d3dd9","slow_time":0.0957019169,"speedup":3.8352059095836784,"stratum":"2-4","sampling_key":"fe3686da7abb602be26bbc99f4fdd6a368d9eb92eaabb383b79b944e0d893548","slow_code":"#include <stdio.h>\n\nint main(void)\n\n{\n\n  int N, i, c;\n\n  int *k, *kk;\n\n  while (1) {\n\n    scanf(\"%d\", &N);\n\n    if (N == 0)\n      break;\n\n    k = new int[N];\n\n    kk = new int[N];\n\n    for (i = 0; i < N; i++)\n\n      kk[i] = 0;\n\n    for (i = 0; i < N; i++)\n\n      scanf(\"%d\", &k[i]);\n\n    i = 0, c = 0;\n\n    while (1) {\n\n      if (k[i % N] > 0) {\n\n        k[i % N]--;\n\n        kk[i % N]++;\n\n        c++;\n      }\n\n      if (kk[i % N] == 2) {\n\n        printf(\"%d\\n\", c);\n\n        break;\n      }\n\n      if (i > N * 2) {\n\n        printf(\"NA\\n\");\n\n        break;\n      }\n\n      i++;\n    }\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint k[10000];\n\nint main()\n\n{\n\n  int N, cnt, same, Not;\n\n  while (1) {\n\n    cnt = 0;\n\n    same = 0;\n\n    Not = 0;\n\n    for (int i = 0; i < 10000; i++)\n      k[i] = 0;\n\n    scanf(\"%d\", &N);\n\n    if (N == 0)\n      break;\n\n    for (int i = 0; i < N; i++) {\n\n      scanf(\"%d\", &k[i]);\n\n      if (k[i] > 1)\n        same++;\n\n      else if (k[i] == 0)\n        Not++;\n    }\n\n    if (N == 1 && k[0] >= 2) {\n\n      printf(\"2\\n\");\n\n      continue;\n\n    }\n\n    else if (same == 0) {\n\n      printf(\"NA\\n\");\n\n      continue;\n    }\n\n    printf(\"%d\\n\", N + 1 - Not);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"5f0b394612db4e896e11ac7f6295e60b4bf4602dc7812e30bd7e78ffd35742b1","fast_id":"a371661406432806e5d96a809c8ad2a47310e6bd2338a955ab08e952a084b01a","fast_time":0.0218350361,"language":"cpp","measured_fast_code_id":"a371661406432806e5d96a809c8ad2a47310e6bd2338a955ab08e952a084b01a","measured_slow_code_id":"20e2771e70a0cc4e0e9a1fa6f1ae12493c7957df66cd841722665716aa24322c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_74992","problem_id":"p03545","slow_code_id":"25c79508745f95cdb2adc5ba3134dd15f856937dbef63cb9c68950b494100a77","slow_id":"20e2771e70a0cc4e0e9a1fa6f1ae12493c7957df66cd841722665716aa24322c","slow_time":0.1056853495,"speedup":4.840172877021256,"stratum":"4-8","sampling_key":"697b72940333e0006a7e4fe2497937698c362d9e8e25928efa322d433dace96a","slow_code":"\n\n#include <iostream>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <cstdio>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int e;\n\n  int a, b, c, d;\n\n  cin >> e;\n\n  d = e % 10;\n\n  c = (e / 10) % 10;\n\n  b = (e / 100) % 10;\n\n  a = (e / 1000);\n\n  if ((a + b + c + d) == 7)\n\n  {\n\n    cout << a << \"+\" << b << \"+\" << c << \"+\" << d << \"=7\";\n\n  }\n\n  else if ((a + b + c - d) == 7)\n\n  {\n\n    cout << a << \"+\" << b << \"+\" << c << \"-\" << d << \"=7\";\n\n  }\n\n  else if ((a + b - c + d) == 7)\n\n  {\n\n    cout << a << \"+\" << b << \"-\" << c << \"+\" << d << \"=7\";\n\n  }\n\n  else if ((a - b + c + d) == 7)\n\n  {\n\n    cout << a << \"-\" << b << \"+\" << c << \"+\" << d << \"=7\";\n\n  }\n\n  else if ((a + b - c - d) == 7)\n\n  {\n\n    cout << a << \"+\" << b << \"-\" << c << \"-\" << d << \"=7\";\n\n  }\n\n  else if ((a - b - c + d) == 7)\n\n  {\n\n    cout << a << \"-\" << b << \"-\" << c << \"+\" << d << \"=7\";\n\n  }\n\n  else if ((a - b + c - d) == 7)\n\n  {\n\n    cout << a << \"-\" << b << \"+\" << c << \"-\" << d << \"=7\";\n\n  }\n\n  else if ((a - b - c - d) == 7)\n\n  {\n\n    cout << a << \"-\" << b << \"-\" << c << \"-\" << d << \"=7\";\n  }\n}\n","fast_code":"#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <math.h>\n\nint main()\n\n{\n\n  int a[4], b[3], i, m[3];\n\n  char num[5];\n\n  scanf(\"%s\", num);\n\n  for (i = 0; i < 4; i++)\n\n  {\n\n    a[i] = num[i] - '0';\n  }\n\n  for (i = 0; i < 8; i++)\n\n  {\n\n    m[0] = i % 2;\n\n    m[1] = i / 2 % 2;\n\n    m[2] = i / 4 % 2;\n\n    b[0] = pow(-1, m[0]) * a[1];\n\n    b[1] = pow(-1, m[1]) * a[2];\n\n    b[2] = pow(-1, m[2]) * a[3];\n\n    if (a[0] + b[0] + b[1] + b[2] == 7)\n      break;\n  }\n\n  printf(\"%d\", a[0]);\n\n  for (i = 0; i < 3; i++)\n\n  {\n\n    if (m[i])\n      printf(\"-\");\n\n    else\n      printf(\"+\");\n\n    printf(\"%d\", a[i + 1]);\n  }\n\n  printf(\"=7\");\n\n  return 0;\n}\n"}
{"fast_code_id":"e5e3c8ba5323504c22d90b22e2ce592932fe236bcecb6695719b392b3f3505f3","fast_id":"e409b4f138f434464d26c08118dcc544a291ba2de6578a5c0070bec4f2ec376a","fast_time":0.0185910016,"language":"cpp","measured_fast_code_id":"e409b4f138f434464d26c08118dcc544a291ba2de6578a5c0070bec4f2ec376a","measured_slow_code_id":"ffcd92d3deb59ccc1b4c544cb34ad36597b3ae3d1c6f934ec7c5fed6b5710201","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75030","problem_id":"p03950","slow_code_id":"314f44031bff9e71075d817be00c71010ae0a983123c95c30b012bf44b0f7711","slow_id":"ffcd92d3deb59ccc1b4c544cb34ad36597b3ae3d1c6f934ec7c5fed6b5710201","slow_time":0.3418074471,"speedup":18.385639163196025,"stratum":"8+","sampling_key":"3159b74a175b7ca7e81fd7577a8d727c293f4a8d6474adc2ccdf7363bedff559","slow_code":"#include <algorithm>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <stack>\n\nusing namespace std;\n\nconst int maxn = 300010, inf = 1 << 29;\n\nint W, H, N, ans, tree[maxn * 4], tag[maxn * 4];\n\ninline int gi()\n\n{\n\n  char ch;\n  int ret = 0, f = 1;\n\n  do\n    ch = getchar();\n  while (!(ch >= '0' && ch <= '9') && ch != '-');\n\n  if (ch == '-')\n    f = -1, ch = getchar();\n\n  do\n    ret = ret * 10 + ch - '0', ch = getchar();\n  while (ch >= '0' && ch <= '9');\n\n  return ret * f;\n}\n\nstruct node\n\n{\n\n  int x, y;\n\n  inline node(int _x = 0, int _y = 0) : x(_x), y(_y) {}\n\n  inline void read() {\n    x = gi();\n    y = gi();\n  }\n\n  friend inline bool operator<(const node &a, const node &b) {\n    return a.x < b.x;\n  }\n\n} P[maxn];\n\ninline void build(int now, int l, int r)\n\n{\n\n  tree[now] = -inf;\n  tag[now] = 0;\n  if (l == r)\n    return;\n\n  int mid = (l + r) >> 1;\n\n  build(now << 1, l, mid);\n  build(now << 1 | 1, mid + 1, r);\n}\n\ninline void pushdown(int now, int l, int r)\n\n{\n\n  if (l != r)\n\n  {\n\n    tree[now << 1] += tag[now];\n    tag[now << 1] += tag[now];\n\n    tree[now << 1 | 1] += tag[now];\n    tag[now << 1 | 1] += tag[now];\n  }\n\n  tag[now] = 0;\n}\n\ninline void modify(int now, int l, int r, int ql, int qr, int key)\n\n{\n\n  if (tag[now])\n    pushdown(now, l, r);\n\n  if (l == ql && r == qr) {\n    tree[now] += key;\n    tag[now] = key;\n    return;\n  }\n\n  int mid = (l + r) >> 1;\n\n  if (qr <= mid)\n    modify(now << 1, l, mid, ql, qr, key);\n\n  else if (ql > mid)\n    modify(now << 1 | 1, mid + 1, r, ql, qr, key);\n\n  else\n    modify(now << 1, l, mid, ql, mid, key),\n        modify(now << 1 | 1, mid + 1, r, mid + 1, qr, key);\n\n  tree[now] = max(tree[now << 1], tree[now << 1 | 1]);\n}\n\ninline void change(int now, int l, int r, int pos, int key)\n\n{\n\n  if (tag[now])\n    pushdown(now, l, r);\n\n  if (l == r) {\n    tree[now] = key;\n    return;\n  }\n\n  int mid = (l + r) >> 1;\n\n  if (pos <= mid)\n    change(now << 1, l, mid, pos, key);\n\n  else\n    change(now << 1 | 1, mid + 1, r, pos, key);\n\n  tree[now] = max(tree[now << 1], tree[now << 1 | 1]);\n}\n\ninline void work()\n\n{\n\n  sort(P + 1, P + N + 1);\n  build(1, 1, N + 1);\n\n  stack<node> S1, S2;\n  int mid = H >> 1;\n\n  change(1, 1, N + 1, 1, H);\n  S1.push(node(mid, 0));\n  S2.push(node(H - mid, 0));\n\n  for (int i = 1; i <= N; ++i)\n\n  {\n\n    ans = max(ans, (P[i].x + tree[1]) << 1);\n    int h, last;\n\n    if (P[i].y <= mid)\n\n    {\n\n      for (h = mid, last = i; !S1.empty() && mid - P[i].y < (S1.top()).x;\n           h = (S1.top()).x, last = (S1.top()).y, S1.pop())\n\n        modify(1, 1, N + 1, (S1.top()).y + 1, last, mid - P[i].y - h);\n\n      if (S1.empty())\n        S1.push(node(mid - P[i].y, 0));\n\n      else\n        modify(1, 1, N + 1, (S1.top()).y + 1, last, mid - P[i].y - h);\n\n      S1.push(node(mid - P[i].y, i));\n\n    }\n\n    else\n\n    {\n\n      for (h = H - mid, last = i; !S2.empty() && P[i].y - mid < (S2.top()).x;\n           h = (S2.top()).x, last = (S2.top()).y, S2.pop())\n\n        modify(1, 1, N + 1, (S2.top()).y + 1, last, P[i].y - mid - h);\n\n      if (S2.empty())\n        S2.push(node(P[i].y - mid, 0));\n\n      else\n        modify(1, 1, N + 1, (S2.top()).y + 1, last, P[i].y - mid - h);\n\n      S2.push(node(P[i].y - mid, i));\n    }\n\n    change(1, 1, N + 1, i + 1, H - P[i].x);\n  }\n\n  ans = max(ans, (W + tree[1]) << 1);\n}\n\nint main()\n\n{\n\n  W = gi();\n  H = gi();\n  N = gi();\n\n  for (int i = 1; i <= N; ++i)\n    P[i].read();\n\n  ans = max((H + 1) << 1, (W + 1) << 1);\n\n  work();\n\n  for (int i = 1; i <= N; ++i)\n    swap(P[i].x, P[i].y);\n  swap(H, W);\n\n  work();\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\ntemplate <class _Tp> _Tp max(_Tp a, _Tp b) {\n  if (a > b)\n    return a;\n  return b;\n}\n\ntemplate <class _Tp> _Tp min(_Tp a, _Tp b) {\n  if (a < b)\n    return a;\n  return b;\n}\n\ntemplate <class _Tp> void ckmax(_Tp &a, _Tp b) {\n  if (a < b)\n    a = b;\n}\n\ntemplate <class _Tp> void ckmin(_Tp &a, _Tp b) {\n  if (a > b)\n    a = b;\n}\n\ntemplate <class _Tp> void sswap(_Tp &a, _Tp &b) {\n  _Tp c = a;\n  a = b;\n  b = c;\n}\n\nint read() {\n\n  char ch = getchar();\n  bool f = 1;\n  int x = 0;\n\n  while ((ch < '0' || ch > '9') && ch != '-')\n    ch = getchar();\n\n  if (ch == '-')\n    f = 0, ch = getchar();\n\n  while (ch >= '0' && ch <= '9') {\n    x = x * 10 + (ch & 15);\n    ch = getchar();\n  }\n\n  return f ? x : -x;\n}\n\n#define N 300010\n\nclass Point {\n\npublic:\n  int x, y;\n\n  bool friend operator<(Point a, Point b) { return a.x < b.x; }\n\n} p[N];\n\nclass tree {\n\npublic:\n  int l, r, w, tag;\n\n} t[N * 4];\n\n#define ls (x << 1)\n\n#define rs ((x << 1) | 1)\n\nvoid pushu(int x) {\n\n  if (t[x].l == t[x].r)\n    return;\n\n  t[x].w = max(t[ls].w, t[rs].w);\n}\n\nvoid pushd(int x) {\n\n  int tag = t[x].tag;\n\n  t[ls].tag += tag;\n  t[ls].w += tag;\n\n  t[rs].tag += tag;\n  t[rs].w += tag;\n\n  t[x].tag = 0;\n}\n\nvoid build(int x, int l, int r) {\n\n  t[x].l = l;\n  t[x].r = r;\n\n  t[x].tag = 0;\n  t[x].w = 0;\n\n  if (l == r)\n    return;\n\n  int mid = (l + r) / 2;\n\n  build(ls, l, mid);\n\n  build(rs, mid + 1, r);\n}\n\nvoid update(int x, int l, int r, int val) {\n\n  if (l <= t[x].l && t[x].r <= r) {\n\n    t[x].tag += val;\n\n    t[x].w += val;\n\n    return;\n  }\n\n  if (t[x].tag && t[x].l != t[x].r)\n    pushd(x);\n\n  if (l <= t[ls].r)\n    update(ls, l, r, val);\n\n  if (r >= t[rs].l)\n    update(rs, l, r, val);\n\n  pushu(x);\n}\n\nint stk[2][N], top0, top1, ans, w, h, n;\n\nvoid solve() {\n\n  build(1, 1, n);\n\n  std::sort(p + 2, p + n + 1);\n\n  top0 = top1 = 0;\n\n  stk[0][0] = stk[1][0] = 1;\n\n  update(1, 1, n, h * 2);\n\n  for (int i = 2; i <= n; ++i) {\n\n    update(1, 1, i - 1, (p[i].x - p[i - 1].x) * 2);\n\n    ckmax(ans, t[1].w);\n\n    if (p[i].y * 2 >= h) {\n\n      update(1, stk[0][top0], i - 1, (p[i].y - h) * 2);\n\n      while (top0 && p[stk[0][top0]].y >= p[i].y) {\n\n        update(1, stk[0][top0 - 1], stk[0][top0] - 1, (p[i].y - p[stk[0][top0]].y) * 2);\n\n        top0--;\n      }\n      ++top0;\n\n      stk[0][top0] = i;\n\n    } else {\n\n      update(1, stk[1][top1], i - 1, -p[i].y * 2);\n\n      while (top1 && p[stk[1][top1]].y <= p[i].y) {\n\n        update(1, stk[1][top1 - 1], stk[1][top1] - 1, (p[stk[1][top1]].y - p[i].y) * 2);\n\n        top1--;\n      }\n      ++top1;\n\n      stk[1][top1] = i;\n    }\n  }\n}\n\nint main() {\n\n  w = read();\n  h = read();\n  n = read() + 2;\n\n  for (int i = 2; i < n; ++i)\n\n    p[i].x = read(), p[i].y = read();\n\n  p[n].x = w;\n  p[n].y = h;\n\n  solve();\n\n  sswap(w, h);\n\n  for (int i = 2; i <= n; ++i)\n\n    sswap(p[i].x, p[i].y);\n\n  solve();\n\n  printf(\"%d\\n\", ans);\n}"}
{"fast_code_id":"156c6c6c45dd5b9d7aaea4e518d4cbf0b0300be5a4e4062199fe9b1bbe74194b","fast_id":"97a7444ac7c332c10d6cd0847130273e1c970810e0b9ba91dc53eacb47177f8a","fast_time":0.0445732201,"language":"cpp","measured_fast_code_id":"97a7444ac7c332c10d6cd0847130273e1c970810e0b9ba91dc53eacb47177f8a","measured_slow_code_id":"118b7b242d125e2f917354604a5926232d641a1e1a9f8d8c95f9789e32244ad7","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75040","problem_id":"p03344","slow_code_id":"cefa6aad36e91ef78f3e41bd99696e5fac5bdda13bd7c964adf7af809e1e2f14","slow_id":"118b7b242d125e2f917354604a5926232d641a1e1a9f8d8c95f9789e32244ad7","slow_time":0.0988691793,"speedup":2.2181296096218097,"stratum":"2-4","sampling_key":"0024af4914744297223fd4ed8594064dd23e3134e18d428fd8281675b2933c59","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\nconst int maxn = 1e5 + 7;\n\nbool vis[maxn];\n\nint a[maxn], b[maxn], p[maxn], fa[maxn];\n\nll c[maxn];\n\nll dp[maxn], sum[maxn];\n\nstruct Edge {\n\n  int nxt, to;\n\n} G[maxn << 1], T[maxn << 1];\n\nint bG = 0, hG[maxn], bT = 0, hT[maxn << 1];\n\nvoid addG(int x, int y) {\n\n  G[bG].nxt = hG[x];\n  G[bG].to = y;\n  hG[x] = bG++;\n\n  G[bG].nxt = hG[y];\n  G[bG].to = x;\n  hG[y] = bG++;\n}\n\nvoid addT(int x, int y) {\n\n  T[bT].nxt = hT[x];\n  T[bT].to = y;\n  hT[x] = bT++;\n\n  T[bT].nxt = hT[y];\n  T[bT].to = x;\n  hT[y] = bT++;\n}\n\nbool cmp(int x, int y) { return c[x] < c[y]; }\n\nvoid dfs(int v, int p) {\n\n  sum[v] = b[v];\n\n  for (int i = hT[v]; i != -1; i = T[i].nxt) {\n\n    int u = T[i].to;\n\n    if (u == p)\n      continue;\n\n    dfs(u, v);\n\n    sum[v] += sum[u];\n  }\n\n  dp[v] = sum[v] + c[v];\n\n  for (int i = hT[v]; i != -1; i = T[i].nxt) {\n\n    int u = T[i].to;\n\n    if (u == p)\n      continue;\n\n    dp[v] = min(dp[v], sum[v] - sum[u] + max(dp[u], c[v]));\n  }\n}\n\nint Get(int x) {\n\n  if (fa[x] == x)\n    return x;\n\n  fa[x] = Get(fa[x]);\n  return fa[x];\n}\n\nint main() {\n\n  memset(hG, -1, sizeof(hG));\n\n  memset(hT, -1, sizeof(hT));\n\n  int n, m;\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d%d\", a + i, b + i);\n\n    c[i] = max(a[i] - b[i], 0);\n\n    p[i] = i;\n    fa[i] = i;\n  }\n\n  for (int i = 0; i < m; i++) {\n\n    int u, v;\n    scanf(\"%d%d\", &u, &v);\n    u--;\n    v--;\n    addG(u, v);\n  }\n\n  sort(p, p + n, cmp);\n\n  for (int i = 0; i < n; i++) {\n\n    int v = p[i];\n\n    vis[v] = true;\n\n    for (int e = hG[v]; e != -1; e = G[e].nxt) {\n\n      int u = G[e].to;\n\n      int fu = Get(u);\n\n      if (vis[u] && v != fu) {\n\n        fa[fu] = v;\n\n        addT(fu, v);\n      }\n    }\n  }\n\n  dfs(p[n - 1], -1);\n\n  printf(\"%lld\\n\", dp[p[n - 1]]);\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\ntypedef long long LL;\n\nusing namespace std;\n\nconst int N = 1e5 + 5;\n\nint n, m, fa[N], p[N];\n\nLL sum[N], f[N], a[N], b[N];\n\nint head[N], ce;\n\nbool vis[N];\n\nstruct edge {\n  int to, nxt;\n} e[N << 1];\n\nbool cmp(int x, int y) { return a[x] < a[y]; }\n\nvoid adde(int x, int y) { e[++ce].to = y, e[ce].nxt = head[x], head[x] = ce; }\n\nint find(int x)\n\n{\n\n  if (x == fa[x])\n    return x;\n\n  return fa[x] = find(fa[x]);\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    scanf(\"%lld%lld\", &a[i], &b[i]);\n\n    a[i] = max(a[i] - b[i], 0ll);\n\n    p[i] = fa[i] = i, f[i] = a[i], sum[i] = b[i];\n  }\n\n  for (int i = 1; i <= m; ++i)\n\n  {\n\n    int x, y;\n\n    scanf(\"%d%d\", &x, &y);\n\n    adde(x, y);\n    adde(y, x);\n  }\n\n  sort(p + 1, p + n + 1, cmp);\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    int u = p[i];\n    vis[u] = 1;\n\n    for (int j = head[u]; j; j = e[j].nxt)\n\n    {\n\n      int v = e[j].to;\n\n      if (!vis[v])\n        continue;\n\n      int x = find(u), y = find(v);\n\n      if (x != y)\n\n      {\n\n        fa[y] = x, sum[x] += sum[y];\n\n        f[x] = min(f[x], max(f[y], a[x] - sum[y]));\n      }\n    }\n  }\n\n  printf(\"%lld\", f[find(1)] + sum[find(1)]);\n\n  return 0;\n}"}
{"fast_code_id":"fad3df89256b55d012db83fa6c18f49fa69bdbc17de01557c683aa4863ef0d5a","fast_id":"067cf971ded1838ef09956721a24ed93e35266d26092441536be59bdf730f698","fast_time":0.0546976553,"language":"cpp","measured_fast_code_id":"067cf971ded1838ef09956721a24ed93e35266d26092441536be59bdf730f698","measured_slow_code_id":"842d779b454e75fada779e8d38ea2619d8e496c6fcfc4238caaceb1364c095f9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75063","problem_id":"p03128","slow_code_id":"ca1f43476389a0765e5175e75c950d1e732736a80d30fd83b0a708a60f27bb02","slow_id":"842d779b454e75fada779e8d38ea2619d8e496c6fcfc4238caaceb1364c095f9","slow_time":0.1634611161,"speedup":2.9884483201970085,"stratum":"2-4","sampling_key":"77e5ebaaa080e14d250f401b9dfeaf4c1d8c188c69b9e9983426b91d778ef66f","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define debug(x) cerr << #x << \":\" << (x) << endl\n\nstring dp[101010];\n\nint cost[9] = {2, 5, 5, 4, 5, 6, 3, 7, 6};\n\nint main() {\n\n  int n, m;\n  cin >> n >> m;\n\n  vector<int> a(m);\n\n  for (int i = 0; i < m; ++i)\n    cin >> a[i];\n\n  sort(ALL(a));\n\n  reverse(ALL(a));\n\n  fill_n(dp, n, \"0\");\n\n  dp[0] = \"\";\n\n  int sm = 0;\n\n  for (int i = 0; i <= n; ++i) {\n\n    for (auto &&ai : a) {\n\n      if (i - cost[ai - 1] < 0)\n        continue;\n\n      if (dp[i - cost[ai - 1]] == \"0\")\n        continue;\n\n      string tmp = to_string(ai) + dp[i - cost[ai - 1]];\n\n      if (dp[i].size() > tmp.size())\n        continue;\n\n      if (dp[i].size() == tmp.size()) {\n\n        if (dp[i] > tmp)\n          continue;\n      }\n\n      dp[i] = tmp;\n    }\n  }\n\n  string ans = dp[n];\n\n  sort(ALL(ans));\n\n  reverse(ALL(ans));\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\n\n#define int int64\n\nstring dp[10101];\n\nint cost[10] = {10101010101, 2, 5, 5, 4, 5, 6, 3, 7, 6};\n\nsigned main() {\n\n  int n, m;\n  cin >> n >> m;\n\n  vector<int> a(m);\n\n  for (int i = 0; i < m; ++i) {\n\n    cin >> a[i];\n  }\n\n  sort(a.begin(), a.end());\n\n  reverse(a.begin(), a.end());\n\n  auto check = [&](string p, string q) {\n    if (p.size() == q.size()) {\n\n      return p > q;\n    }\n\n    return p.size() > q.size();\n  };\n\n  fill_n(dp, 10101, \"0\");\n\n  dp[0] = \"\";\n\n  for (int i = 0; i <= n; ++i) {\n\n    for (int j = 0; j < m; ++j) {\n\n      if (i - cost[a[j]] >= 0) {\n\n        if (dp[i - cost[a[j]]] == \"0\")\n          continue;\n\n        string tmp = to_string(a[j]) + dp[i - cost[a[j]]];\n\n        if (check(tmp, dp[i])) {\n\n          dp[i] = tmp;\n        }\n      }\n    }\n  }\n\n  string ans = dp[n];\n\n  sort(ans.begin(), ans.end());\n\n  reverse(ans.begin(), ans.end());\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"82f39b930a110ac82eac48095210d1c95dcff0aaf37c961f335e9b448c19af34","fast_id":"2884129cc39b17b7d8777fd75da366d4dc802de4b511ad14c71c2e3bdfec9d8a","fast_time":0.000196369,"language":"cpp","measured_fast_code_id":"2884129cc39b17b7d8777fd75da366d4dc802de4b511ad14c71c2e3bdfec9d8a","measured_slow_code_id":"b9fbb8b8ccda1fec59676dc39a45a103aa568347665220c1e1a3bc55cb6359db","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75269","problem_id":"p03855","slow_code_id":"9430c86d15d8a6b9d881b43d84de0654da723b10f9ed888b268f23b6b0755add","slow_id":"b9fbb8b8ccda1fec59676dc39a45a103aa568347665220c1e1a3bc55cb6359db","slow_time":0.0123039814,"speedup":62.657453060309926,"stratum":"8+","sampling_key":"8d4c81e9e7b3df9784bf1f8240de5881f4c059b6540bbc52cd6abd200a301ffc","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 10;\n\nint fa1[N], fa2[N];\n\nint findroot1(int u)\n\n{\n\n  return fa1[u] == u ? u : fa1[u] = findroot1(fa1[u]);\n}\n\nint findroot2(int u)\n\n{\n\n  return fa2[u] == u ? u : fa2[u] = findroot2(fa2[u]);\n}\n\nset<int> s2[N];\n\nint ans[N];\n\nint main()\n\n{\n\n  int n, k, l;\n\n  int u, v;\n\n  scanf(\"%d%d%d\", &n, &k, &l);\n\n  for (int i = 1; i <= n; i++)\n    fa1[i] = fa2[i] = i;\n\n  for (int i = 1; i <= k; i++)\n\n  {\n\n    scanf(\"%d%d\", &u, &v);\n\n    int uu = findroot1(u);\n\n    int vv = findroot1(v);\n\n    if (uu == vv)\n      continue;\n\n    else\n      fa1[vv] = uu;\n  }\n\n  for (int i = 1; i <= l; i++)\n\n  {\n\n    scanf(\"%d%d\", &u, &v);\n\n    int uu = findroot2(u);\n\n    int vv = findroot2(v);\n\n    if (uu == vv)\n      continue;\n\n    else\n      fa2[vv] = uu;\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    v = findroot2(i);\n\n    s2[v].insert(i);\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    if (!s2[i].empty())\n\n    {\n\n      map<int, int> mp;\n\n      for (auto it : s2[i])\n\n      {\n\n        int uu = findroot1(it);\n\n        mp[uu]++;\n      }\n\n      for (auto it : s2[i])\n\n      {\n\n        int uu = findroot1(it);\n\n        ans[it] = mp[uu];\n      }\n    }\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    printf(\"%d\", ans[i]);\n\n    if (i != n)\n      printf(\" \");\n\n    else\n      printf(\"\\n\");\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nstruct abc {\n\n  int aa, bb, cc;\n\n  bool operator<(const abc &T) const {\n\n    return (aa < T.aa || (aa == T.aa && bb < T.bb) ||\n            (aa == T.aa && bb == T.bb && cc < T.cc));\n  }\n\n  bool operator==(const abc &T) const { return (aa == T.aa && bb == T.bb); }\n\n} ans[200005];\n\nusing namespace std;\n\nint N, KK, LL, i, j, k, l, m, n, pt1[200005], pt2[200005], s1[200005],\n    s2[200005], z;\n\nint sz[200005], ans2[200005];\n\nint find1(int aa) {\n\n  if (pt1[aa] != aa)\n\n    pt1[aa] = find1(pt1[aa]);\n\n  return (pt1[aa]);\n}\n\nint find2(int bb) {\n\n  if (pt2[bb] != bb)\n\n    pt2[bb] = find2(pt2[bb]);\n\n  return (pt2[bb]);\n}\n\nint main() {\n\n  scanf(\"%d%d%d\", &N, &KK, &LL);\n\n  for (i = 1; i <= N; i++) {\n\n    pt1[i] = i;\n\n    pt2[i] = i;\n\n    s1[i] = 1;\n\n    s2[i] = 1;\n  }\n\n  for (i = 0; i < KK; i++) {\n\n    scanf(\"%d%d\", &j, &l);\n\n    if (find1(j) == find1(l))\n      continue;\n\n    s1[find1(l)] += s1[find1(j)];\n\n    pt1[find1(j)] = find1(l);\n  }\n\n  for (i = 0; i < LL; i++) {\n\n    scanf(\"%d%d\", &j, &l);\n\n    if (find2(j) == find2(l))\n      continue;\n\n    s2[find2(l)] += s2[find2(j)];\n\n    pt2[find2(j)] = find2(l);\n  }\n\n  for (i = 1; i <= N; i++) {\n\n    pt1[i] = find1(i);\n\n    pt2[i] = find2(i);\n\n    ans[i].aa = pt1[i];\n\n    ans[i].bb = pt2[i];\n\n    ans[i].cc = i;\n  }\n\n  sort(ans + 1, ans + N + 1);\n\n  sz[1] = 1;\n\n  for (i = 2; i <= N; i++)\n    if (ans[i] == ans[i - 1]) {\n\n      sz[i] = sz[i - 1] + 1;\n\n    } else {\n\n      sz[i] = 1;\n    }\n\n  for (i = N - 1; i >= 1; i--)\n\n    if (ans[i] == ans[i + 1])\n      sz[i] = sz[i + 1];\n\n  for (i = 1; i <= N; i++)\n    ans2[ans[i].cc] = sz[i];\n\n  for (i = 1; i < N; i++)\n    printf(\"%d \", ans2[i]);\n\n  printf(\"%d\\n\", ans2[N]);\n}"}
{"fast_code_id":"11a9a9e4597e9f3c52da69f2e5505923bd0ab0a39adfe16502eccca52752915d","fast_id":"68b268fb617bfb7da5b5cb3aeb8cb995ae4d635397fd105c0c701f1c184c18f3","fast_time":0.0981232687,"language":"cpp","measured_fast_code_id":"68b268fb617bfb7da5b5cb3aeb8cb995ae4d635397fd105c0c701f1c184c18f3","measured_slow_code_id":"63b4f7dacab4475fd63f24bff0acb32899250fca1657b0494738a89fc11add04","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75316","problem_id":"p02347","slow_code_id":"76d244a6f2840ffba2a2fa8dfc5348ffdb0ce76ad618eeb9bd7f39111aedfd37","slow_id":"63b4f7dacab4475fd63f24bff0acb32899250fca1657b0494738a89fc11add04","slow_time":1.3459493711,"speedup":13.71692350786924,"stratum":"8+","sampling_key":"e428e631ffd0259a8ad01344333e30995386c75db0f3a90e6328d99018ddeddc","slow_code":"#include <stdio.h>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <cfloat>\n\n#include <stack>\n\n#include <queue>\n\n#include <vector>\n\n#include <string>\n\n#include <iostream>\n\n#include <set>\n\n#include <map>\n\ntypedef long long int ll;\n\ntypedef unsigned long long int ull;\n\n#define BIG_NUM 2000000000\n\n#define MOD 1000000007\n\n#define EPS 0.000000001\n\nusing namespace std;\n\nstruct Node {\n\n  int location;\n\n  int p, left, right;\n};\n\nstruct Point {\n\n  Point() { id = x = y = 0; }\n\n  Point(int arg_id, int arg_x, int arg_y) {\n\n    id = arg_id;\n\n    x = arg_x;\n\n    y = arg_y;\n  }\n\n  bool operator<(const Point &arg) const { return id < arg.id; }\n\n  void print() { printf(\"%d\\n\", id); }\n\n  int id, x, y;\n};\n\nstatic const int MAX = 1000000;\n\nstatic const int NIL = -1;\n\nint N;\n\nPoint P[MAX];\n\nNode T[MAX];\n\nint number;\n\nbool lessX(const Point &p1, const Point &p2) { return p1.x < p2.x; }\n\nbool lessY(const Point &p1, const Point &p2) { return p1.y < p2.y; }\n\nint makeKDTree(int left, int right, int depth) {\n\n  if (!(left < right))\n    return NIL;\n\n  int mid = (left + right) / 2;\n\n  int node_id = number++;\n\n  if (depth % 2 == 0) {\n\n    sort(P + left, P + right, lessX);\n\n  } else {\n\n    sort(P + left, P + right, lessY);\n  }\n\n  T[node_id].location = mid;\n\n  T[node_id].left = makeKDTree(left, mid, depth + 1);\n\n  T[node_id].right = makeKDTree(mid + 1, right, depth + 1);\n\n  return node_id;\n}\n\nvoid find(int node_id, int sx, int tx, int sy, int ty, int depth, vector<Point> &ans) {\n\n  int x = P[T[node_id].location].x;\n\n  int y = P[T[node_id].location].y;\n\n  if (sx <= x && x <= tx && sy <= y && y <= ty) {\n\n    ans.push_back(P[T[node_id].location]);\n  }\n\n  if (depth % 2 == 0) {\n\n    if (T[node_id].left != NIL) {\n\n      if (sx <= x)\n        find(T[node_id].left, sx, tx, sy, ty, depth + 1, ans);\n    }\n\n    if (T[node_id].right != NIL) {\n\n      if (x <= tx)\n        find(T[node_id].right, sx, tx, sy, ty, depth + 1, ans);\n    }\n\n  } else {\n\n    if (T[node_id].left != NIL) {\n\n      if (sy <= y)\n        find(T[node_id].left, sx, tx, sy, ty, depth + 1, ans);\n    }\n\n    if (T[node_id].right != NIL) {\n\n      if (y <= ty)\n        find(T[node_id].right, sx, tx, sy, ty, depth + 1, ans);\n    }\n  }\n}\n\nint main() {\n\n  int x, y;\n\n  scanf(\"%d\", &N);\n\n  for (int i = 0; i < N; i++) {\n\n    scanf(\"%d %d\", &x, &y);\n\n    P[i] = Point(i, x, y);\n\n    T[i].left = T[i].right = T[i].p = NIL;\n  }\n\n  number = 0;\n\n  int root = makeKDTree(0, N, 0);\n\n  int q;\n\n  scanf(\"%d\", &q);\n\n  int sx, tx, sy, ty;\n\n  vector<Point> ans;\n\n  for (int i = 0; i < q; i++) {\n\n    scanf(\"%d %d %d %d\", &sx, &tx, &sy, &ty);\n\n    ans.clear();\n\n    find(root, sx, tx, sy, ty, 0, ans);\n\n    sort(ans.begin(), ans.end());\n\n    for (int j = 0; j < ans.size(); j++) {\n\n      ans[j].print();\n    }\n\n    printf(\"\\n\");\n  }\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nstruct Point {\n\n  int x, y, i;\n\n  bool operator<(const Point &that) const { return i < that.i; }\n\n  void print() { printf(\"%d\\n\", i); }\n};\n\nbool lessX(const Point &p1, const Point &p2) { return p1.x < p2.x; }\n\nbool lessY(const Point &p1, const Point &p2) { return p1.y < p2.y; }\n\nstruct Node {\n\n  int ld_id, ru_id;\n\n  int p_id;\n};\n\nstatic const int MAX_N = 500000;\n\nPoint pts[MAX_N];\n\nNode ns[MAX_N];\n\nint tindex;\n\nint makeKdTreeNode(int i, int n, int i1);\n\nvoid queryRect(int sx, int sy, int tx, int ty, int nodeId, int depth, vector<Point> &inPts);\n\nint main() {\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; ++i) {\n\n    Point &p = pts[i];\n\n    p.i = i;\n\n    scanf(\"%d %d\", &p.x, &p.y);\n  }\n\n  tindex = 0;\n\n  int rootNodeId = makeKdTreeNode(0, n, 0);\n\n  int q;\n\n  scanf(\"%d\", &q);\n\n  vector<Point> inPts;\n\n  for (int i = 0; i < q; i++) {\n\n    int sx, tx, sy, ty;\n\n    scanf(\"%d %d %d %d\", &sx, &tx, &sy, &ty);\n\n    inPts.clear();\n\n    queryRect(sx, sy, tx, ty, rootNodeId, 0, inPts);\n\n    sort(inPts.begin(), inPts.end());\n\n    for (Point p : inPts) {\n\n      p.print();\n    }\n\n    printf(\"\\n\");\n  }\n\n  return 0;\n}\n\nint makeKdTreeNode(int left, int right, int depth) {\n\n  if (left >= right) {\n\n    return -1;\n  }\n\n  int curNodeIndex = tindex++;\n\n  if (depth % 2 == 0) {\n\n    sort(pts + left, pts + right, lessX);\n\n  } else {\n\n    sort(pts + left, pts + right, lessY);\n  }\n\n  int mid = (left + right) / 2;\n\n  ns[curNodeIndex].p_id = mid;\n\n  ns[curNodeIndex].ld_id = makeKdTreeNode(left, mid, depth + 1);\n\n  ns[curNodeIndex].ru_id = makeKdTreeNode(mid + 1, right, depth + 1);\n\n  return curNodeIndex;\n}\n\nvoid queryRect(int sx, int sy, int tx, int ty, int nodeId, int depth, vector<Point> &inPts) {\n\n  Point &p = pts[ns[nodeId].p_id];\n\n  int x = p.x, y = p.y;\n\n  if ((sx <= x && tx >= x && sy <= y && ty >= y)) {\n\n    inPts.push_back(p);\n  }\n\n  if (depth % 2 == 0) {\n\n    if (ns[nodeId].ru_id != -1 && tx >= x)\n\n      queryRect(sx, sy, tx, ty, ns[nodeId].ru_id, depth + 1, inPts);\n\n    if (ns[nodeId].ld_id != -1 && sx <= x)\n\n      queryRect(sx, sy, tx, ty, ns[nodeId].ld_id, depth + 1, inPts);\n\n  }\n\n  else {\n\n    if (ns[nodeId].ru_id != -1 && ty >= y)\n\n      queryRect(sx, sy, tx, ty, ns[nodeId].ru_id, depth + 1, inPts);\n\n    if (ns[nodeId].ld_id != -1 && sy <= y)\n\n      queryRect(sx, sy, tx, ty, ns[nodeId].ld_id, depth + 1, inPts);\n  }\n}\n"}
{"fast_code_id":"7e4b6184dc1b7cad08498f611eaa0d511c859ba9c8aa98ddbb67ebc1d8e463a4","fast_id":"0ed1d2738958dd2c061496e7dc0c7f18ba1145a85bf29f670dcbfe5a2d311766","fast_time":0.0123598055,"language":"cpp","measured_fast_code_id":"0ed1d2738958dd2c061496e7dc0c7f18ba1145a85bf29f670dcbfe5a2d311766","measured_slow_code_id":"e0259489dc06a207fe3d4f0254533645150795b53c8d912993d6a03c15a6bed3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75347","problem_id":"p03717","slow_code_id":"4d7e4771fd6ce9eb814963b0804a8765f0d30bd7b22b2e8ebd4a9b45605f02af","slow_id":"e0259489dc06a207fe3d4f0254533645150795b53c8d912993d6a03c15a6bed3","slow_time":0.0628969533,"speedup":5.088830346076239,"stratum":"4-8","sampling_key":"4d6c09298c6f22a092e7a3abb0cb7b92587427091ca7802fc78b1557bc3f0872","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint dp[301][301];\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, M;\n\n  cin >> N >> M;\n\n  int xm[301][4], xM[301][4];\n\n  rep1(i, N) {\n\n    xm[i][1] = 1000;\n\n    xm[i][2] = 1000;\n\n    xM[i][2] = -1;\n\n    xM[i][3] = -1;\n  }\n\n  rep(i, M) {\n\n    int l, r, x;\n\n    cin >> l >> r >> x;\n\n    chmin(xm[r][x], l);\n\n    chmax(xM[r][x], l);\n  }\n\n  const int mod = 1e9 + 7;\n\n  dp[0][0] = 1;\n\n  rep1(i, N) {\n\n    for (int j = i - 1; j >= 0; j--)\n      for (int k = i - 1; k >= j; k--) {\n\n        int tmp = dp[j][k];\n\n        dp[j][k] = 0;\n\n        int jj = j;\n\n        int kk = k;\n\n        int OK = 1;\n\n        if (xm[i][1] < kk)\n          OK = 0;\n\n        if (xm[i][2] < jj)\n          OK = 0;\n\n        if (xM[i][2] >= kk)\n          OK = 0;\n\n        if (xM[i][3] >= jj)\n          OK = 0;\n\n        if (OK)\n          dp[jj][kk] = tmp;\n\n        jj = j;\n\n        kk = i;\n\n        OK = 1;\n\n        if (xm[i][1] < kk)\n          OK = 0;\n\n        if (xm[i][2] < jj)\n          OK = 0;\n\n        if (xM[i][2] >= kk)\n          OK = 0;\n\n        if (xM[i][3] >= jj)\n          OK = 0;\n\n        if (OK) {\n\n          dp[jj][kk] += tmp;\n\n          if (dp[jj][kk] >= mod)\n            dp[jj][kk] -= mod;\n        }\n\n        jj = k;\n\n        kk = i;\n\n        OK = 1;\n\n        if (xm[i][1] < kk)\n          OK = 0;\n\n        if (xm[i][2] < jj)\n          OK = 0;\n\n        if (xM[i][2] >= kk)\n          OK = 0;\n\n        if (xM[i][3] >= jj)\n          OK = 0;\n\n        if (OK) {\n\n          dp[jj][kk] += tmp;\n\n          if (dp[jj][kk] >= mod)\n            dp[jj][kk] -= mod;\n        }\n      }\n  }\n\n  ll kotae = 0;\n\n  rep(j, N + 1) rep(k, N + 1) { kotae += dp[j][k]; }\n\n  co(kotae % mod);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nunsigned long long dp[301][301];\n\nconst int cm = 1 << 12;\n\nchar cn[cm], *ci = cn, ct;\n\nint main() {\n\n  fread(cn, 1, cm, stdin);\n\n  int N = 0, M = 0;\n\n  while ((ct = *ci++) >= '0')\n    N = N * 10 + ct - '0';\n\n  while ((ct = *ci++) >= '0')\n    M = M * 10 + ct - '0';\n\n  int xm[301][4], xM[301][4];\n\n  rep1(i, N) {\n\n    xm[i][1] = N;\n\n    xm[i][2] = N;\n\n    xM[i][2] = -1;\n\n    xM[i][3] = -1;\n  }\n\n  rep(i, M) {\n\n    int l = 0, r = 0;\n\n    while ((ct = *ci++) >= '0')\n      l = l * 10 + ct - '0';\n\n    while ((ct = *ci++) >= '0')\n      r = r * 10 + ct - '0';\n\n    int x = *ci++ - '0';\n\n    +ci++;\n\n    chmin(xm[r][x], l);\n\n    chmax(xM[r][x], l);\n  }\n\n  const int mod = 1e9 + 7;\n\n  dp[0][0] = 1;\n\n  int mj = 0;\n\n  int mk = 0;\n\n  unsigned long long yabai = 1;\n\n  rep1(i, N) {\n\n    for (int j = i - 1; j >= mj; j--) {\n\n      auto dpj = dp[j];\n\n      for (int k = i - 1; k >= max(j, mk); k--) {\n\n        dpj[i] += dpj[k];\n\n        dp[k][i] += dpj[k];\n      }\n    }\n\n    yabai *= i + 1;\n\n    bool yaba = (yabai > 18446744073709551615 / (i + 1));\n\n    for (int j = i; j > max(xm[i][2], mj - 1); j--) {\n\n      for (int k = i; k >= max(j, mk); k--)\n        dp[j][k] = 0;\n    }\n\n    for (int j = xm[i][2]; j > max(xM[i][3], mj - 1); j--) {\n\n      for (int k = i; k > max(max(xm[i][1], mk - 1), j - 1); k--)\n        dp[j][k] = 0;\n\n      if (yaba) {\n\n        for (int k = min(i, xm[i][1]); k > max(max(xM[i][2], mk - 1), j - 1); k--) {\n\n          dp[j][k] %= mod;\n        }\n      }\n\n      for (int k = xM[i][2]; k >= max(j, mk); k--)\n        dp[j][k] = 0;\n    }\n\n    for (int j = xM[i][3]; j >= mj; j--) {\n\n      for (int k = i; k >= max(j, mk); k--)\n        dp[j][k] = 0;\n    }\n\n    if (yaba)\n      yabai = mod;\n\n    if (mj <= xM[i][3])\n      mj = xM[i][3] + 1;\n\n    if (mk <= xM[i][2])\n      mk = xM[i][2] + 1;\n  }\n\n  ll kotae = 0;\n\n  for (int j = mj; j <= N; j++)\n    for (int k = max(mk, j); k <= N; k++) {\n\n      kotae += dp[j][k] % mod;\n    }\n\n  printf(\"%lld\", kotae % mod);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"81d1819c00ec2745498389b6d58240933e6ae725a190985b78f1726e1d1b308e","fast_id":"d5f65520ef65574147e6437d59741dd68d8e7cc5b1e3cd70057f2eaa1c350608","fast_time":0.0201867755,"language":"cpp","measured_fast_code_id":"d5f65520ef65574147e6437d59741dd68d8e7cc5b1e3cd70057f2eaa1c350608","measured_slow_code_id":"b0ddf7b836f61ac73228dd5e10ff886f66bbc70f9e3c7fd5a352c72912158b17","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75353","problem_id":"p00022","slow_code_id":"ac527984f5defd16669fe0ffd008f4b7b7b8ddad569fa9e3d9ff9947f048d794","slow_id":"b0ddf7b836f61ac73228dd5e10ff886f66bbc70f9e3c7fd5a352c72912158b17","slow_time":0.1046434269,"speedup":5.183761363968208,"stratum":"4-8","sampling_key":"07e8a5b83d573c4ba89056673ce1b2ef98746e214f67b5348c56bbc17c30e6f8","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  int n;\n\n  int a[5000];\n\n  int tmp;\n\n  int ans;\n\n  while (1) {\n\n    cin >> n;\n\n    if (!n)\n      break;\n\n    for (int i = 0; i < n; i++) {\n\n      cin >> a[i];\n    }\n\n    ans = a[0];\n\n    for (int i = 0; i < n; i++) {\n\n      for (int j = i; j < n; j++) {\n\n        if (i == j)\n          tmp = a[i];\n\n        else\n          tmp += a[j];\n\n        ans = max(tmp, ans);\n      }\n    }\n\n    cout << ans << endl;\n  }\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\n  int n, tmp, ans;\n\n  int a[5000];\n\n  while (scanf(\"%d\", &n) && n) {\n\n    for (int i = 0; i < n; i++)\n      scanf(\"%d\", &a[i]);\n\n    ans = a[0];\n\n    for (int i = 0; i < n; i++)\n\n      for (int j = i; j < n; j++) {\n\n        if (i == j)\n          tmp = a[i];\n\n        else\n          tmp += a[j];\n\n        ans = max(tmp, ans);\n      }\n\n    printf(\"%d\\n\", ans);\n  }\n}"}
{"fast_code_id":"2d23d25873014515cc88aaa3c6c92e5e14926bf8d1eddde004b52b71f541c3db","fast_id":"05cbf54bf56ffb677e1c4bdc92d07fe973788a77d65e8732e2cda58498f0d045","fast_time":0.1490356439,"language":"cpp","measured_fast_code_id":"05cbf54bf56ffb677e1c4bdc92d07fe973788a77d65e8732e2cda58498f0d045","measured_slow_code_id":"c3623d1381179c4023d47da70955fe4766a8c48129e600c34b6b8db9d7b265a4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75530","problem_id":"p00744","slow_code_id":"05ba12cf2f2e407f6c55013213d8f3c50eef822680799bd5894f8d4186326de6","slow_id":"c3623d1381179c4023d47da70955fe4766a8c48129e600c34b6b8db9d7b265a4","slow_time":0.3156908091,"speedup":2.1182235392750903,"stratum":"2-4","sampling_key":"08a9c64a8cdbafc5d6c28a5790d5a7d74b1b7937c446adf72b963885d0765f34","slow_code":"#include <bits/stdc++.h>\n\n\n\nusing namespace std;\n\n\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\n\n\n#define each(i,a) for (auto&& i : a)\n\n#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)\n\n#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)\n\n#define REP(i,n) FOR(i,0,n)\n\n#define RREP(i,n) RFOR(i,0,n)\n\n#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME\n\n#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)\n\n#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)\n\n#define pb push_back\n\n#define all(a) (a).begin(),(a).end()\n\n#define chmin(x,v) x = min(x, v)\n\n#define chmax(x,v) x = max(x, v)\n\n\n\nconst ll linf = 1e18;\n\nconst int inf = 1e9;\n\nconst double eps = 1e-12;\n\nconst double pi = acos(-1);\n\n\n\ntemplate<typename T>\n\nistream& operator>>(istream& is, vector<T>& vec) {\n\n  each(x,vec) is >> x;\n\n  return is;\n\n}\n\ntemplate<typename T>\n\nostream& operator<<(ostream& os, const vector<T>& vec) {\n\n  rep(i,vec.size()) {\n\n    if (i) os << \" \";\n\n    os << vec[i];\n\n  }\n\n  return os;\n\n}\n\ntemplate<typename T>\n\nostream& operator<<(ostream& os, const vector< vector<T> >& vec) {\n\n  rep(i,vec.size()) {\n\n    if (i) os << endl;\n\n    os << vec[i];\n\n  }\n\n  return os;\n\n}\n\nclass MaxFlow {\n\npublic:\n\n  struct Edge {\n\n    ll to, cap, rev;\n\n  };\n\n  vector<vector<Edge>> G;\n\n  vector<ll> iter;\n\nprivate:\n\n  bool is_debug;\n\n  ll V;\n\n  vector<ll> bfs(ll s) {\n\n    vector<ll> dist(V, linf);\n\n    dist[s] = 0;\n\n    queue<ll> Q; Q.push(s);\n\n    while ( !Q.empty() ) {\n\n      ll v = Q.front(); Q.pop();\n\n      each(e, G[v]) {\n\n        if (e.cap > 0 && dist[e.to] == linf) {\n\n          dist[e.to] = dist[v]+1;\n\n          Q.push(e.to);\n\n        }\n\n      }\n\n    }\n\n    return dist;\n\n  }\n\n  ll dfs(ll v, ll t, ll f, const vector<ll>& dist, vector<bool>& used) {\n\n    if (v == t) return f;\n\n    if (used[v]) return 0;\n\n    used[v] = true;\n\n    for (ll i = iter[v]; i < G[v].size(); ++i) {\n\n      Edge& e = G[v][i];\n\n      if (e.cap > 0 && dist[e.to] == dist[v]+1) {\n\n        ll d = dfs(e.to, t, min(f, e.cap), dist, used);\n\n        if (d > 0) {\n\n          e.cap -= d;\n\n          G[e.to][e.rev].cap += d;\n\n          return d;\n\n        }\n\n      }\n\n    }\n\n    return 0;\n\n  }\n\npublic:\n\n  const vector<vector<Edge>> Graph() {\n\n  return G;\n\n  }\n\n  MaxFlow(ll V, bool is_debug=false) : V(V), G(V), is_debug(is_debug) {}\n\n  void init(ll n) {\n\n    V = n;\n\n    G.assign(V, vector<Edge>());\n\n  }\n\n  void add(ll from, ll to, ll cap) {\n\n    if (is_debug) cout << \"ADD: \" << from << \" \" << to << \" \" << cap << endl;\n\n    assert(V > 0);\n\n    G[from].pb({to, cap, (ll)G[to].size()});\n\n    G[to].pb({from, 0, (ll)G[from].size()-1});\n\n  }\n\n                                           \n\n  void add(ll from, ll to, ll min_flow, ll cap, ll S, ll T) {\n\n    if (is_debug) cout << endl << \"ADD_MIN:\" << from << \" \" << to << \" \" << min_flow << \" \" << cap << endl;\n\n    add(from, to, cap-min_flow);\n\n    add(S, to, min_flow);\n\n    add(from, T, cap);\n\n    if (is_debug) cout << endl;\n\n  }\n\n  ll flow(ll s, ll t, ll f=linf) {\n\n    ll res = 0;\n\n    while (f > 0) {\n\n      vector<ll> dist = bfs(s);\n\n      if (dist[t] == linf) break;\n\n      iter.assign(G.size(), 0);\n\n      while (f > 0) {\n\n        vector<bool> used(V, false);\n\n        ll df = dfs(s, t, f, dist, used);\n\n        if (df == 0) break;\n\n        f -= df;\n\n        res += df;\n\n      }\n\n    }\n\n    return res;\n\n  }\n\n};\n\nvector<ll> primes;\n\nvector<bool> is_prime;\n\nvoid init_primes() {\n\n  const ll mx = 1e4;\n\n  is_prime.assign(mx+1, true);\n\n  is_prime[0] = is_prime[1] = false;\n\n  rep(i, mx+1) {\n\n    if (!is_prime[i]) continue;\n\n    primes.pb(i);\n\n    for (ll j = i*2; j <= mx; j += i) {\n\n      is_prime[j] = false;\n\n    }\n\n  }\n\n}\n\nvector<ll> prime_divisors(ll n) {\n\n  vector<ll> res;\n\n  for (ll i = 0; primes[i]*primes[i] <= n; ++i) {\n\n    if (n % primes[i] == 0) {\n\n      ll a = primes[i], b = n/primes[i];\n\n      res.pb(a);\n\n      if (b < is_prime.size() && !is_prime[b]) continue;\n\n      if (a != b) res.pb(b);\n\n    }\n\n  }\n\n  sort(all(res));\n\n  return res;\n\n}\n\nll gcd(ll a, ll b) {\n\nreturn b == 0 ? a : gcd(b, a%b);\n\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  ll n, m;\n\n  init_primes();\n\n  while (cin >> n >> m, n || m) {\n\n    vector<ll> a(n), b(m); cin >> a >> b;\n\n    ll s = n+m, t = s+1;\n\n    MaxFlow mf(t+1);\n\n    rep(i, n) rep(j, m) {\n\n      if (gcd(a[i], b[j]) > 1) {\n\n        mf.add(i, n+j, 1);\n\n      }\n\n    }\n\n    rep(i, n) mf.add(s, i, 1);\n\n    rep(i, m) mf.add(n+i, t, 1);\n\n                                           \n\n                         \n\n                                                  \n\n                                                  \n\n                                          \n\n                                          \n\n                      \n\n                                        \n\n                        \n\n                                   \n\n                           \n\n                                     \n\n                                       \n\n                                                            \n\n                                                              \n\n    cout << mf.flow(s, t) << endl;\n\n  }\n\n}","fast_code":"#include <bits/stdc++.h>\n\n\n\nusing namespace std;\n\n\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\n\n\n#define each(i,a) for (auto&& i : a)\n\n#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)\n\n#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)\n\n#define REP(i,n) FOR(i,0,n)\n\n#define RREP(i,n) RFOR(i,0,n)\n\n#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME\n\n#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)\n\n#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)\n\n#define pb push_back\n\n#define all(a) (a).begin(),(a).end()\n\n#define chmin(x,v) x = min(x, v)\n\n#define chmax(x,v) x = max(x, v)\n\n\n\nconst ll linf = 1e18;\n\nconst int inf = 1e9;\n\nconst double eps = 1e-12;\n\nconst double pi = acos(-1);\n\n\n\ntemplate<typename T>\n\nistream& operator>>(istream& is, vector<T>& vec) {\n\n  each(x,vec) is >> x;\n\n  return is;\n\n}\n\ntemplate<typename T>\n\nostream& operator<<(ostream& os, const vector<T>& vec) {\n\n  rep(i,vec.size()) {\n\n    if (i) os << \" \";\n\n    os << vec[i];\n\n  }\n\n  return os;\n\n}\n\ntemplate<typename T>\n\nostream& operator<<(ostream& os, const vector< vector<T> >& vec) {\n\n  rep(i,vec.size()) {\n\n    if (i) os << endl;\n\n    os << vec[i];\n\n  }\n\n  return os;\n\n}\n\nclass MaxFlow {\n\npublic:\n\n  struct Edge {\n\n    ll to, cap, rev;\n\n  };\n\n  vector<vector<Edge>> G;\n\n  vector<ll> iter;\n\nprivate:\n\n  bool is_debug;\n\n  ll V;\n\n  vector<ll> bfs(ll s) {\n\n    vector<ll> dist(V, linf);\n\n    dist[s] = 0;\n\n    queue<ll> Q; Q.push(s);\n\n    while ( !Q.empty() ) {\n\n      ll v = Q.front(); Q.pop();\n\n      each(e, G[v]) {\n\n        if (e.cap > 0 && dist[e.to] == linf) {\n\n          dist[e.to] = dist[v]+1;\n\n          Q.push(e.to);\n\n        }\n\n      }\n\n    }\n\n    return dist;\n\n  }\n\n  ll dfs(ll v, ll t, ll f, const vector<ll>& dist, vector<bool>& used) {\n\n    if (v == t) return f;\n\n    if (used[v]) return 0;\n\n    used[v] = true;\n\n    for (ll& i = iter[v]; i < G[v].size(); ++i) {\n\n      Edge& e = G[v][i];\n\n      if (e.cap > 0 && dist[e.to] == dist[v]+1) {\n\n        ll d = dfs(e.to, t, min(f, e.cap), dist, used);\n\n        if (d > 0) {\n\n          e.cap -= d;\n\n          G[e.to][e.rev].cap += d;\n\n          return d;\n\n        }\n\n      }\n\n    }\n\n    return 0;\n\n  }\n\npublic:\n\n  const vector<vector<Edge>> Graph() {\n\n  return G;\n\n  }\n\n  MaxFlow(ll V, bool is_debug=false) : V(V), G(V), is_debug(is_debug) {}\n\n  void init(ll n) {\n\n    V = n;\n\n    G.assign(V, vector<Edge>());\n\n  }\n\n  void add(ll from, ll to, ll cap) {\n\n    if (is_debug) cout << \"ADD: \" << from << \" \" << to << \" \" << cap << endl;\n\n    assert(V > 0);\n\n    G[from].pb({to, cap, (ll)G[to].size()});\n\n    G[to].pb({from, 0, (ll)G[from].size()-1});\n\n  }\n\n                                           \n\n  void add(ll from, ll to, ll min_flow, ll cap, ll S, ll T) {\n\n    if (is_debug) cout << endl << \"ADD_MIN:\" << from << \" \" << to << \" \" << min_flow << \" \" << cap << endl;\n\n    add(from, to, cap-min_flow);\n\n    add(S, to, min_flow);\n\n    add(from, T, cap);\n\n    if (is_debug) cout << endl;\n\n  }\n\n  ll flow(ll s, ll t, ll f=linf) {\n\n    ll res = 0;\n\n    while (f > 0) {\n\n      vector<ll> dist = bfs(s);\n\n      if (dist[t] == linf) break;\n\n      iter.assign(G.size(), 0);\n\n      while (f > 0) {\n\n        vector<bool> used(V, false);\n\n        ll df = dfs(s, t, f, dist, used);\n\n        if (df == 0) break;\n\n        f -= df;\n\n        res += df;\n\n      }\n\n    }\n\n    return res;\n\n  }\n\n};\n\nvector<ll> prime_divisors(ll n) {\n\n  vector<ll> res;\n\n  for (ll i = 2; i*i <= n; ++i) {\n\n    if (n % i != 0) continue;\n\n    res.pb(i);\n\n    while (n % i == 0) n /= i;\n\n  }\n\n  if (n > 1) res.pb(n);\n\n  sort(all(res));\n\n  return res;\n\n}\n\nll gcd(ll a, ll b) {\n\nreturn b == 0 ? a : gcd(b, a%b);\n\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  ll n, m;\n\n  while (cin >> n >> m, n || m) {\n\n    vector<ll> a(n), b(m); cin >> a >> b;\n\n                               \n\n                           \n\n                                \n\n                                         \n\n                                     \n\n                \n\n            \n\n                                     \n\n                                       \n\n    vector<vector<ll>> ad(n), bd(m);\n\n    map<ll,ll> id;\n\n    rep(i, n) ad[i] = prime_divisors(a[i]);\n\n    rep(i, m) bd[i] = prime_divisors(b[i]);\n\n    rep(i, n) each(x, ad[i]) id[x];\n\n    rep(i, m) each(x, bd[i]) id[x];\n\n    ll lid = 0;\n\n    each(p, id) p.second = lid++;\n\n    ll ids = lid;\n\n    ll s = n+m+ids, t = s+1;\n\n    MaxFlow mf(t+1);\n\n    rep(i, n) mf.add(s, i, 1);\n\n    rep(i, m) mf.add(n+i, t, 1);\n\n    rep(i, n) each(x, ad[i]) mf.add(i, n+m+id[x], 1);\n\n    rep(i, m) each(x, bd[i]) mf.add(n+m+id[x], n+i, 1);\n\n    cout << mf.flow(s, t) << endl;\n\n  }\n\n}"}
{"fast_code_id":"b2850bac683048ffe7a228eb01a7dc87b9900234b515fa62cd85fc1e89254722","fast_id":"d0c604c6893d214dfec37cd38123671524e1198d8767f22f51a8de5df9574635","fast_time":0.0195099327,"language":"cpp","measured_fast_code_id":"d0c604c6893d214dfec37cd38123671524e1198d8767f22f51a8de5df9574635","measured_slow_code_id":"afa743314cbc8b2e7d7c0a3e3ebdcf0d9ad04529177318c71857dee30578eda4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75597","problem_id":"p03175","slow_code_id":"6dcee71711a9a854a4c837fc03a7c8b62f4a7cbf95709fa116472fae851ac339","slow_id":"afa743314cbc8b2e7d7c0a3e3ebdcf0d9ad04529177318c71857dee30578eda4","slow_time":0.3785100313,"speedup":19.400888620184734,"stratum":"8+","sampling_key":"a467b8f3e74b043ce50c066dd9886941fa78fbfc8e232dc9f526ca2fcdb1e1b6","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint N;\n\nvector<int> V[100001];\n\nint D[100001];\n\nll mod = 1e9 + 7;\n\npair<ll, ll> dfs(int A) {\n\n  if (D[A])\n    return mp(0, 1);\n\n  D[A] = 1;\n\n  ll kuro = 1;\n\n  ll siro = 1;\n\n  for (int i : V[A]) {\n\n    auto k = dfs(i);\n\n    kuro = (kuro * k.second) % mod;\n\n    siro = (siro * (k.first + k.second)) % mod;\n  }\n\n  return mp(kuro, siro);\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> N;\n\n  rep(i, N - 1) {\n\n    int x, y;\n\n    cin >> x >> y;\n\n    V[x].pb(y);\n\n    V[y].pb(x);\n  }\n\n  auto M = dfs(1);\n\n  co((M.first + M.second) % mod);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint N;\n\nint to[200001], ne[200001], he[100001];\n\nconst ll mod = 1e9 + 7;\n\npair<ll, ll> dfs(int A, int prev) {\n\n  ll kuro = 1;\n\n  ll siro = 1;\n\n  for (int i = he[A]; i; i = ne[i]) {\n\n    int To = to[i];\n\n    if (To != prev) {\n\n      auto k = dfs(To, A);\n\n      kuro = (kuro * k.second) % mod;\n\n      siro = (siro * k.first) % mod;\n    }\n  }\n\n  return mp(kuro + siro, siro);\n}\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  if (ci - cn + 16 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  N = getint();\n\n  int k = 1;\n\n  rep(i, N - 1) {\n\n    int x = getint(), y = getint();\n\n    to[k] = y;\n\n    ne[k] = he[x];\n\n    he[x] = k++;\n\n    to[k] = x;\n\n    ne[k] = he[y];\n\n    he[y] = k++;\n  }\n\n  auto M = dfs(1, 0);\n\n  printf(\"%lld\", M.first % mod);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"2509c3f530e87adebb37be951dbb78150082c32bd1a4c9c1a17d62854c07486f","fast_id":"fc424df993ae5bbdf4f2f9558952752ed26a547f8ec57e392094d4d1320ce94c","fast_time":0.0579793735,"language":"cpp","measured_fast_code_id":"fc424df993ae5bbdf4f2f9558952752ed26a547f8ec57e392094d4d1320ce94c","measured_slow_code_id":"2c54f3ab8ae8fd8f248ffb1bbc4b74d20529f46a82e49e338fc1676f4cd2a9bb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75697","problem_id":"p02832","slow_code_id":"bc196e1dda627c562b6986dcb79238ea5daaa3ad391cf0ae9ff3b1b779be1dbf","slow_id":"2c54f3ab8ae8fd8f248ffb1bbc4b74d20529f46a82e49e338fc1676f4cd2a9bb","slow_time":0.37733234,"speedup":6.508044451359931,"stratum":"4-8","sampling_key":"4b46b2bc4ca2ab33926f915c59c7b9076a83291f7f77ac9034929265655ce838","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 2e5 + 3;\n\nint n, a[N];\n\nvector<int> occ[N];\n\nint main() {\n\n  cin >> n;\n\n  for (int i = 0; i < n; ++i) {\n\n    cin >> a[i];\n\n    occ[a[i]].push_back(i);\n  }\n\n  int prev = -1, taken = 0;\n\n  for (int val = 1; val <= n; ++val) {\n\n    bool found = false;\n\n    for (auto idx : occ[val]) {\n\n      if (idx > prev) {\n\n        prev = idx;\n\n        taken++;\n\n        found = true;\n\n        break;\n      }\n    }\n\n    if (!found)\n\n      break;\n  }\n\n  if (taken == 0)\n\n    cout << -1 << endl;\n\n  else\n\n    cout << n - taken << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  int a[n];\n\n  for (int i = 0; i < n; i++)\n\n    cin >> a[i];\n\n  int ans = 0;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    if (a[i] == ans + 1)\n\n    {\n\n      ans++;\n    }\n  }\n\n  if (ans == 0)\n\n    cout << -1 << endl;\n\n  else\n\n    cout << n - ans << endl;\n}"}
{"fast_code_id":"912d85e31e3a96611d70fadbb90fef2ec79ab4bcfbd643c4a98e55d62256c764","fast_id":"df025730c32444a17b762b0b5efb1c0295d8ee33291647bb381b140c8919c7cd","fast_time":0.1118670236,"language":"cpp","measured_fast_code_id":"df025730c32444a17b762b0b5efb1c0295d8ee33291647bb381b140c8919c7cd","measured_slow_code_id":"6bebb217d92663d43754678f6248d9ecae9e86b12081950a7e473d1740ff8513","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_75738","problem_id":"p00884","slow_code_id":"38606c29dbeb80ea0dd659e8add8e561796a898e5518350d40f9e7b780db72f9","slow_id":"6bebb217d92663d43754678f6248d9ecae9e86b12081950a7e473d1740ff8513","slow_time":0.6586376691,"speedup":5.887683858069502,"stratum":"4-8","sampling_key":"a4b37d37e0688bbf767c8fb7ad9800aa10dc148d7f7f1ed55c65b0ca2e6fddf2","slow_code":"#include<stdio.h>\n\n#include <iostream>\n\n#include <math.h>\n\n#include <numeric>\n\n#include <vector>\n\n#include <map>\n\n#include <functional>\n\n#include <stdio.h>\n\n#include <array>\n\n#include <algorithm>\n\n#include <string>\n\n#include <string.h>\n\n#include <assert.h>\n\n#include <stdio.h>\n\n#include <queue>\n\n#include<iomanip>\n\n#include<bitset>\n\n#include<stack>\n\n#include<set>\n\n#include<limits>\n\n#include <complex>\n\n#include<cstdlib>\n\nusing namespace std;\n\n\n\nbool isso(long long int a) {\n\n  if (a == 1||a==0)return false;\n\n  for (long long int i = 2; i*i <= a; ++i) {\n\n    if ((a%i)) {\n\n    }\n\n    else {\n\n      return false;\n\n    }\n\n  }\n\n  return true;\n\n}\n\n\n\n\n\n\n\nlong long int powint(long long int a, long long int b) {\n\n  assert(b >= 0);\n\n  if (b == 0)return 1;\n\n  if (b == 1)return a;\n\n  long long int ans = 1;\n\n  long long int aa = powint(a, b / 2);\n\n  ans *= aa*aa;\n\n  if (b % 2)ans *= a;\n\n  return ans;\n\n}\n\n\n\nstruct edge {\n\n  int from;\n\n  int to;\n\n  int cost;\n\n};\n\n\n\nstruct aa {\n\n  int now;\n\n  int fuel;\n\n  int cost;\n\n};\n\n\n\nclass Compare {\n\npublic:\n\n\t                         \n\n  bool operator()(const aa&l, const aa&r) {\n\n  return l.cost> r.cost;\n\n  }\n\n};\n\n\n\nvector<vector<int>>involve;\n\n\n\n\n\nvector<int> dfs2(const int now, vector<bool>&used) {\n\n  if (used[now])return vector<int>(0);\n\n  else {\n\n    used[now] = true;\n\n  }\n\n  vector<int>ans;\n\n  for (auto i : involve[now]) {\n\n    if (involve[i].size()) {\n\n      vector<int>a(dfs2(i,used));\n\n      ans.insert(ans.end(), a.begin(), a.end());\n\n    }\n\n    else {\n\n      ans.push_back(i);\n\n    }\n\n  }\n\n  return ans;\n\n}\n\n\n\n\n\nint main() {\n\n  while (1) {\n\n    int num = 0;\n\n    map<string,int>mp;\n\n    set<int>ed;\n\n    int N; cin >> N;\n\n    if (!N)break;\n\n    involve.clear();\n\n    involve.resize(100000);\n\n    for (int i = 0; i < N; ++i) {\n\n      string st; cin >> st;\n\n      string groupname;\n\n      vector<string> membername;\n\n      int pre;\n\n      for (int j = 0; j < st.size(); ++j) {\n\n        if (st[j] == ':') {\n\n          groupname = st.substr(0, j);\n\n          pre = j;\n\n        }\n\n        else if (st[j] == ','||st[j]=='.') {\n\n          membername.push_back(st.substr(pre + 1, j - pre - 1));\n\n          pre = j;\n\n        }\n\n      }\n\n      if (!mp.count(groupname)) {\n\n        mp[groupname] = num++;\n\n      }\n\n      for (int i = 0; i < membername.size(); ++i) {\n\n        if (!(mp.count(membername[i]))) {\n\n          mp[membername[i]] = num++;\n\n        }\n\n      }\n\n      for (int i = 0; i < membername.size(); ++i) {\n\n        involve[mp[groupname]].push_back(mp[membername[i]]);\n\n        ed.emplace(mp[membername[i]]);\n\n      }\n\n    }\n\n    vector<bool>used(100001, false);\n\n    vector<int>allnames(dfs2(0,used));\n\n    sort(allnames.begin(), allnames.end());\n\n    const int ans(unique(allnames.begin(), allnames.end()) - allnames.begin());\n\n    cout << ans << endl;\n\n\n\n  }\n\n  return 0;\n\n}","fast_code":"#include \"bits/stdc++.h\"\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#pragma warning(disable : 4996)\n\nusing namespace std;\n\nusing ld = long double;\n\nconst ld eps = 1e-9;\n\nset<string> memo;\n\nvector<string> dfs(string now, map<string, vector<string>> mp) {\n\n  if (memo.find(now) != memo.end())\n    return vector<string>();\n\n  else\n    memo.emplace(now);\n\n  if (mp.find(now) == mp.end())\n    return vector<string>(1, now);\n\n  else {\n\n    vector<string> ans;\n\n    for (auto child : mp[now]) {\n\n      auto sts = dfs(child, mp);\n\n      ans.insert(ans.end(), sts.begin(), sts.end());\n\n      sort(ans.begin(), ans.end());\n\n      ans.erase(unique(ans.begin(), ans.end()), ans.end());\n    }\n\n    return ans;\n  }\n}\n\nint main() {\n\n  while (1) {\n\n    memo.clear();\n\n    int N;\n    cin >> N;\n\n    if (!N)\n      break;\n\n    map<string, vector<string>> mp;\n\n    string start;\n\n    for (int i = 0; i < N; ++i) {\n\n      string st;\n      cin >> st;\n\n      int a = st.find(':');\n\n      string parent = st.substr(0, a);\n\n      if (!i)\n        start = parent;\n\n      vector<string> children;\n\n      int from = a + 1;\n\n      while (1) {\n\n        int r = st.find(',', from);\n\n        if (r == string::npos) {\n\n          children.push_back(st.substr(from, st.find('.') - from));\n\n          break;\n\n        }\n\n        else {\n\n          children.push_back(st.substr(from, r - from));\n\n          from = r + 1;\n        }\n      }\n\n      mp[parent] = children;\n    }\n\n    auto anss = dfs(start, mp);\n\n    cout << anss.size() << endl;\n  }\n\n  return 0;\n}"}
{"fast_code_id":"e38a7b82909d751ca5f59a044cf5a6c35c5ec2b2e2cf696c88c48c5ddcda7e6e","fast_id":"c229378ab27c61f38fbc59b82a64a09224cdc3d2383781ba5d2cf3045ee0d611","fast_time":0.0101487146,"language":"cpp","measured_fast_code_id":"c229378ab27c61f38fbc59b82a64a09224cdc3d2383781ba5d2cf3045ee0d611","measured_slow_code_id":"a9ce576f80cf0d484db8430233bacfa6f64f378705e79ec0a758f8b150f7c039","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76430","problem_id":"p02711","slow_code_id":"cfbb4e05ddef3a8fb33cefb0cf73cf1fe0834483b11080f4c2df21716ec55e5a","slow_id":"a9ce576f80cf0d484db8430233bacfa6f64f378705e79ec0a758f8b150f7c039","slow_time":0.0729782722,"speedup":7.19088821356746,"stratum":"4-8","sampling_key":"1b5e4ff4da0bc07bbf95479cd261b6d1a5578947517f023bf31a1fe0603a1c6b","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <iomanip>\n\n#include <algorithm>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <vector>\n\n#include <map>\n\nusing namespace std;\n\nstring s[10005];\n\nint main()\n\n{\n\n  int n;\n\n  cin >> n;\n\n  int flag = 0;\n\n  while (n != 0)\n\n  {\n\n    int m = n % 10;\n\n    if (m == 7)\n\n    {\n\n      flag = 1;\n\n      break;\n    }\n\n    n = n / 10;\n  }\n\n  if (flag)\n\n    cout << \"Yes\" << endl;\n\n  else\n\n    cout << \"No\" << endl;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint main() {\n\n  int angka, digitBelakang, digitTengah, digitAwal;\n\n  scanf(\"%d\", &angka);\n\n  digitBelakang = angka % 10;\n\n  digitTengah = (angka - digitBelakang) / 10 % 10;\n\n  digitAwal = (angka - digitBelakang) / 100 % 10;\n\n  if (digitBelakang == 7) {\n\n    puts(\"Yes\");\n\n  }\n\n  else if (digitTengah == 7) {\n\n    puts(\"Yes\");\n\n  }\n\n  else if (digitAwal == 7) {\n\n    puts(\"Yes\");\n\n  }\n\n  else {\n\n    puts(\"No\");\n  }\n\n  return 0;\n}"}
{"fast_code_id":"1c67bf1c9859918b6337fdb3aef700f2fab1f7f806f7406e11fc94ff1c01ebfb","fast_id":"9731bba2de37d82fcb0cf34d3492864b380c1d406bfa104795b3aa4ccd459a51","fast_time":0.1082202273,"language":"cpp","measured_fast_code_id":"9731bba2de37d82fcb0cf34d3492864b380c1d406bfa104795b3aa4ccd459a51","measured_slow_code_id":"13f284258a86962cc11d4c75758ede81fa5cd486b2bc9effb26e77d795cb7dcd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76619","problem_id":"p02816","slow_code_id":"119d5507a4e159980fed6f457be6005771e01de03c6b14288916928db7384d98","slow_id":"13f284258a86962cc11d4c75758ede81fa5cd486b2bc9effb26e77d795cb7dcd","slow_time":0.221989039,"speedup":2.051271232175651,"stratum":"2-4","sampling_key":"5b21dd4074162186199340757d26dbac263cf8a83d3dd8eae753ca874584c0b8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nbool isprime(ll val) {\n\n  if (val <= 1)\n    return false;\n\n  for (ll i = 2; i * i <= val; i++) {\n\n    if (val % i == 0LL)\n      return false;\n  }\n\n  return true;\n}\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout << fixed << setprecision(20);\n\n  ll n;\n\n  cin >> n;\n\n  ll a[n], b[n + n];\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> b[i];\n  }\n\n  for (int i = 0; i < n; i++) {\n\n    b[i + n] = b[i];\n  }\n\n  vector<ll> mod;\n\n  for (ll i = 1e9 + 7; i < 1e9 + 30; i++) {\n\n    if (isprime(i))\n      mod.push_back(i);\n  }\n\n  ll mul[3];\n\n  mul[0] = 10007, mul[1] = 10009, mul[2] = 1007;\n\n  ll h[3] = {}, base[3] = {1, 1, 1};\n\n  ll x[3] = {};\n\n  for (int i = 1; i < n; i++) {\n\n    for (int j = 0; j < 3; j++) {\n\n      if (i > 1)\n        base[j] = (base[j] * mul[j]) % mod[j];\n\n      h[j] = (h[j] * mul[j] + (a[i] ^ a[i - 1])) % mod[j];\n\n      x[j] = (x[j] * mul[j] + (b[i] ^ b[i - 1])) % mod[j];\n    }\n  }\n\n  bool pos = true;\n\n  for (int j = 0; j < 3; j++) {\n\n    if (h[j] != x[j])\n      pos = false;\n  }\n\n  vector<pair<ll, ll>> ans;\n\n  if (pos) {\n\n    cout << 0 << \" \" << (a[0] ^ b[0]) << \"\\n\";\n  }\n\n  for (int i = 1; i < n; i++) {\n\n    bool pos = true;\n\n    for (int j = 0; j < 3; j++) {\n\n      x[j] += mod[j] - (base[j] * (b[i] ^ b[i - 1])) % mod[j];\n\n      x[j] %= mod[j];\n\n      x[j] = (x[j] * mul[j] + (b[n - 1 + i] ^ b[n - 2 + i])) % mod[j];\n\n      if (x[j] != h[j])\n        pos = false;\n    }\n\n    if (pos) {\n\n      ans.push_back({n - i, (a[0] ^ b[i])});\n    }\n  }\n\n  sort(ans.begin(), ans.end());\n\n  for (auto i : ans) {\n\n    cout << i.first << \" \" << i.second << \"\\n\";\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntemplate <typename T1, typename T2> bool chmin(T1 &a, T2 b) {\n  if (a <= b)\n    return 0;\n  a = b;\n  return 1;\n}\n\ntemplate <typename T1, typename T2> bool chmax(T1 &a, T2 b) {\n  if (a >= b)\n    return 0;\n  a = b;\n  return 1;\n}\n\nlong double dx[4] = {0, 1, -1, 0};\n\nlong double dy[4] = {1, 0, 0, -1};\n\nlong double eps = 1e-6;\n\nlong double pi = acos(-1);\n\ntemplate <int mod = 1000000007>\n\nstruct ModInt {\n\n  int x;\n\n  ModInt() : x(0) {}\n\n  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n  ModInt &operator+=(const ModInt &p) {\n\n    if ((x += p.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  ModInt &operator-=(const ModInt &p) {\n\n    if ((x += mod - p.x) >= mod)\n      x -= mod;\n\n    return *this;\n  }\n\n  ModInt &operator*=(const ModInt &p) {\n\n    x = (int)(1LL * x * p.x % mod);\n\n    return *this;\n  }\n\n  ModInt &operator/=(const ModInt &p) {\n\n    *this *= p.inverse();\n\n    return *this;\n  }\n\n  ModInt operator-() const { return ModInt(-x); }\n\n  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\n  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\n  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\n  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\n  bool operator==(const ModInt &p) const { return x == p.x; }\n\n  bool operator!=(const ModInt &p) const { return x != p.x; }\n\n  ModInt inverse() const {\n\n    int a = x, b = mod, u = 1, v = 0, t;\n\n    while (b > 0) {\n\n      t = a / b;\n\n      swap(a -= t * b, b);\n\n      swap(u -= t * v, v);\n    }\n\n    return ModInt(u);\n  }\n\n  ModInt pow(int64_t n) const {\n\n    ModInt ret(1), mul(x);\n\n    while (n > 0) {\n\n      if (n & 1)\n        ret *= mul;\n\n      mul *= mul;\n\n      n >>= 1;\n    }\n\n    return ret;\n  }\n\n  friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\n\n  friend istream &operator>>(istream &is, ModInt &a) {\n\n    int64_t t;\n\n    is >> t;\n\n    a = ModInt<mod>(t);\n\n    return (is);\n  }\n\n  static int get_mod() { return mod; }\n};\n\nconst int mod1 = 1000000103;\n\nconst int mod2 = 1000000483;\n\nusing mint1 = ModInt<mod1>;\n\nusing mint2 = ModInt<mod2>;\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  cout << fixed << setprecision(30);\n\n  int n;\n\n  cin >> n;\n\n  ll x[n];\n\n  ll y[n];\n\n  ll a[n], b[n];\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> x[i];\n\n    y[i] = x[i];\n\n    if (i)\n      a[i - 1] = x[i] ^ x[i - 1];\n  }\n\n  a[n - 1] = x[n - 1] ^ x[0];\n\n  ModInt<1000000103> ret1 = 0, mul1 = 10009;\n\n  ModInt<1000000483> ret2 = 0, mul2 = 10007;\n\n  for (int i = 0; i < n; i++) {\n\n    cin >> x[i];\n\n    if (i)\n      b[i - 1] = x[i] ^ x[i - 1];\n  }\n\n  b[n - 1] = x[n - 1] ^ x[0];\n\n  for (int i = 0; i < n; i++) {\n\n    ret1 = ret1 * mul1 + mint1(b[i]);\n\n    ret2 = ret2 * mul2 + mint2(b[i]);\n  }\n\n  mint1 h1 = 0;\n\n  mint2 h2 = 0;\n\n  vector<array<ll, 2>> v;\n\n  for (int i = 0; i < n; i++) {\n\n    h1 = h1 * mul1 + mint1(a[i]);\n\n    h2 = h2 * mul2 + mint2(a[i]);\n  }\n\n  mint1 p1 = mint1(mul1).pow(n - 1);\n\n  mint2 p2 = mint2(mul2).pow(n - 1);\n\n  for (int i = 0; i < n; i++) {\n\n    if (h1 == ret1 && h2 == ret2) {\n\n      v.push_back({i, x[0] ^ y[i]});\n    }\n\n    h1 -= mint1(a[i]) * p1;\n\n    h2 -= mint2(a[i]) * p2;\n\n    h1 = h1 * mul1 + mint1(a[i]);\n\n    h2 = h2 * mul2 + mint2(a[i]);\n  }\n\n  for (auto i : v) {\n\n    cout << i[0] << \" \" << i[1] << \"\\n\";\n  }\n}"}
{"fast_code_id":"5cf779d853cc85163d06b5a8f07df24412881127d0eaec3c758967471f744518","fast_id":"534a8ab4ad31c08ee0a0aa52b35e0cd66ae8f450aba75b06a4dfa8a5b376cf69","fast_time":0.0382575199,"language":"cpp","measured_fast_code_id":"534a8ab4ad31c08ee0a0aa52b35e0cd66ae8f450aba75b06a4dfa8a5b376cf69","measured_slow_code_id":"46f741bc8ddab7997d8a1dcadb50aed893885a0a9e565cf42290617f28b42b8c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76636","problem_id":"p01487","slow_code_id":"2c085fef0267289b89467857605dc5e0f12c8f73df2e4a9c52ebb797895058a3","slow_id":"46f741bc8ddab7997d8a1dcadb50aed893885a0a9e565cf42290617f28b42b8c","slow_time":0.1653600551,"speedup":4.322288939069466,"stratum":"4-8","sampling_key":"973a1ba3865e590c4effecb07b5c399f8f254e06a9451970970fec860f90bc3c","slow_code":"#include <iostream>\n\n#include <sstream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <ctime>\n\n#include <cstring>\n\n#include <string>\n\n#include <vector>\n\n#include <stack>\n\n#include <queue>\n\n#include <deque>\n\n#include <map>\n\n#include <set>\n\n#include <bitset>\n\n#include <numeric>\n\n#include <utility>\n\n#include <iomanip>\n\n#include <algorithm>\n\n#include <functional>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<int> vint;\n\ntypedef vector<ll> vll;\n\ntypedef pair<int, int> pint;\n\ntypedef pair<ll, ll> pll;\n\n#define FI first\n\n#define SE second\n\n#define PB push_back\n\n#define MP make_pair\n\n#define ALL(s) (s).begin(), (s).end()\n\n#define REP(i, n) for (int i = 0; i < (int)(n); ++i)\n\n#define EACH(i, s)                                                             \\\n  for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n\ntemplate <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {\n  return s << '<' << P.first << \", \" << P.second << '>';\n}\n\ntemplate <class T> ostream &operator<<(ostream &s, vector<T> P) {\n  s << \"{ \";\n  for (int i = 0; i < P.size(); ++i) {\n    if (i > 0)\n      s << \", \";\n    s << P[i];\n  }\n  return s << \" }\" << endl;\n}\n\ntemplate <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {\n  s << \"{ \";\n  for (__typeof__(P.begin()) it = P.begin(); it != P.end(); ++it) {\n    if (it != P.begin())\n      s << \", \";\n    s << '<' << it->first << \"->\" << it->second << '>';\n  }\n  return s << \" }\" << endl;\n}\n\nconst int INF = 1 << 29;\n\nconst int MAX_V = 100100;\n\nstruct Graph {\n\n  int V;\n\n  vector<int> list[MAX_V];\n\n  Graph(int n = 0) : V(n) {}\n\n  void init(int n = 0) {\n    V = n;\n    for (int i = 0; i < MAX_V; ++i)\n      list[i].clear();\n  }\n\n  inline vector<int> &operator[](int i) { return list[i]; }\n\n  void connect(int f, int t) {\n\n    list[f].push_back(t);\n\n    list[t].push_back(f);\n  }\n\n} G;\n\nmap<ll, int> ma;\n\nvector<pll> item;\n\nint color[MAX_V];\n\nbool bidfs(Graph &G, int v, int c, vector<int> &left, vector<int> &right) {\n\n  color[v] = c;\n\n  if (c == 1)\n    left.push_back(v);\n\n  else\n    right.push_back(v);\n\n  for (int i = 0; i < G[v].size(); ++i) {\n\n    if (color[G[v][i]] == c)\n      return false;\n\n    if (color[G[v][i]] == 0) {\n\n      if (!bidfs(G, G[v][i], -c, left, right))\n        return false;\n    }\n  }\n\n  return true;\n}\n\nbool Isbipartite(Graph &G, vector<int> &left, vector<int> &right) {\n\n  memset(color, 0, sizeof(color));\n\n  left.clear();\n  right.clear();\n\n  for (int i = 0; i < G.V; ++i) {\n\n    if (color[i] == 0) {\n\n      if (!bidfs(G, i, 1, left, right))\n        return false;\n\n      else {\n\n        int num = abs((int)left.size() - (int)right.size());\n\n        ma[num]++;\n\n        left.clear();\n        right.clear();\n      }\n    }\n  }\n\n  return true;\n}\n\nll V, E, from, to;\n\nll dp[MAX_V * 2], tdp[MAX_V * 2];\n\nll solve() {\n\n  vint left, right;\n\n  if (!Isbipartite(G, left, right))\n    return -1;\n\n  EACH(it, ma) if (it->FI != 0) item.PB(MP(it->FI, it->SE));\n\n  int n = item.size();\n\n  for (int i = 0; i < MAX_V * 2; ++i)\n    dp[i] = tdp[i] = INF;\n\n  dp[MAX_V] = 0;\n\n  for (int i = 0; i <= n; ++i) {\n\n    for (int j = 0; j < MAX_V * 2; ++j) {\n    }\n\n    if (i == n)\n      break;\n\n    ll sub = item[i].FI * item[i].SE;\n\n    for (int j = 0; j < MAX_V * 2; ++j) {\n\n      if (j >= sub && dp[j] < INF)\n        tdp[j - sub] = 0;\n    }\n\n    for (int j = 0; j < MAX_V * 2; ++j) {\n\n      if (j >= item[i].FI * 2) {\n\n        if (tdp[j - item[i].FI * 2] < item[i].SE)\n\n          tdp[j] = min(tdp[j], tdp[j - item[i].FI * 2] + 1);\n      }\n    }\n\n    for (int j = 0; j < MAX_V * 2; ++j) {\n\n      dp[j] = tdp[j], tdp[j] = INF;\n    }\n  }\n\n  ll res = INF;\n\n  for (int i = 0; i < MAX_V * 2; ++i) {\n\n    if (dp[i] < INF) {\n\n      res = min(res, (ll)abs(i - MAX_V));\n    }\n  }\n\n  ll a = (V + res) / 2, b = (V - res) / 2;\n\n  return a * b - E;\n}\n\nint main() {\n\n  while (cin >> V >> E) {\n\n    ma.clear();\n    item.clear();\n\n    G.init(V);\n\n    for (int i = 0; i < E; ++i) {\n\n      scanf(\"%d %d\", &from, &to);\n\n      --from;\n      --to;\n\n      G.connect(from, to);\n    }\n\n    cout << solve() << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <iostream>\n\n#include <vector>\n\n#include <map>\n\nusing namespace std;\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n  if (a < b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n  if (a > b) {\n    a = b;\n    return 1;\n  }\n  return 0;\n}\n\nusing pint = pair<int, int>;\n\nusing Graph = vector<vector<int> >;\n\nbool dfs(const Graph &G, int v, int vdir, pint &num, vector<int> &dir) {\n\n  bool res = true;\n\n  dir[v] = vdir;\n\n  if (vdir == 1)\n    ++num.first;\n\n  else if (vdir == -1)\n    ++num.second;\n\n  for (auto nv : G[v]) {\n\n    if (dir[nv] == 0) {\n\n      if (!dfs(G, nv, -vdir, num, dir))\n        res = false;\n\n    }\n\n    else if (dir[nv] != -vdir)\n      res = false;\n  }\n\n  return res;\n}\n\nbool isbipartite(const Graph &G, vector<pint> &nums) {\n\n  bool res = true;\n\n  int N = (int)G.size();\n\n  vector<int> dir(N, 0);\n\n  for (int v = 0; v < N; ++v) {\n\n    if (dir[v] != 0)\n      continue;\n\n    pint num = {0, 0};\n\n    if (!dfs(G, v, 1, num, dir))\n      res = false;\n\n    nums.push_back(num);\n  }\n\n  return res;\n}\n\nconst int INF = 1 << 29;\n\nint main() {\n\n  int V, E;\n  cin >> V >> E;\n\n  Graph G(V);\n\n  for (int i = 0; i < E; ++i) {\n\n    int a, b;\n    cin >> a >> b;\n    --a, --b;\n\n    G[a].push_back(b);\n\n    G[b].push_back(a);\n  }\n\n  vector<pint> nums;\n\n  if (!isbipartite(G, nums)) {\n\n    cout << -1 << endl;\n\n    return 0;\n  }\n\n  map<int, int> ma;\n\n  for (auto p : nums)\n    ma[abs(p.first - p.second)]++;\n\n  int geta = 0;\n\n  vector<int> dp(V * 2 + 10, INF);\n\n  dp[0] = 0;\n\n  for (auto it = ma.begin(); it != ma.end(); ++it) {\n\n    int diff = it->first;\n\n    geta += diff * it->second;\n\n    for (int v = 0; v <= V * 2; ++v) {\n\n      if (dp[v] < INF)\n        dp[v] = 0;\n    }\n\n    for (int v = 0; v <= V * 2; ++v) {\n\n      if (v + diff * 2 <= V * 2 && dp[v] < it->second)\n        chmin(dp[v + diff * 2], dp[v] + 1);\n    }\n  }\n\n  int diff = V;\n\n  for (int v = 0; v <= V * 2; ++v) {\n\n    if (dp[v] < INF)\n      diff = min(diff, abs(v - geta));\n  }\n\n  long long a = (V + diff) / 2, b = (V - diff) / 2;\n\n  cout << a * b - E << endl;\n}\n"}
{"fast_code_id":"576bc18f3c5d726b54bc122cb9bed13905be68b817ffbb3b3bb6a85c45c3a536","fast_id":"3e52322b48a8905a842865fe6d58fe9023915e567e1c2c2dccfc8e10684219ba","fast_time":0.0063036253,"language":"cpp","measured_fast_code_id":"3e52322b48a8905a842865fe6d58fe9023915e567e1c2c2dccfc8e10684219ba","measured_slow_code_id":"5ea23345762296b715b0175a12dc689e489879a657d0e42df21434b4af7ae2c6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76645","problem_id":"p02670","slow_code_id":"c9aa326cfaeb102a879ca78e916743989c54c27329c027a1d4f408681f2c5e5a","slow_id":"5ea23345762296b715b0175a12dc689e489879a657d0e42df21434b4af7ae2c6","slow_time":0.0580540134,"speedup":9.209623135436049,"stratum":"8+","sampling_key":"63e6d0edb608b7c5fadfb1adf6fca8cdcb0cc4932a241a5eae0d830348a8b319","slow_code":"#include <bits/stdc++.h>\n\n#define int long long\n\n#define inf 1000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<double, double>\n\n#define ppap pair<pa, int>\n\n#define PI 3.14159265358979323846\n\n#define paa pair<int, char>\n\n#define mp make_pair\n\n#define pb push_back\n\n#define EPS (1e-8)\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};\n\nusing namespace std;\n\nclass pa3 {\n\npublic:\n  int x;\n\n  int y, z;\n\n  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n\n  bool operator<(const pa3 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    return z < p.z;\n  }\n\n  bool operator>(const pa3 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    return z > p.z;\n  }\n\n  bool operator==(const pa3 &p) const { return x == p.x && y == p.y && z == p.z; }\n\n  bool operator!=(const pa3 &p) const { return !(x == p.x && y == p.y && z == p.z); }\n};\n\nclass pa4 {\n\npublic:\n  int x;\n\n  int y, z, w;\n\n  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n\n  bool operator<(const pa4 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    if (z != p.z)\n      return z < p.z;\n\n    return w < p.w;\n  }\n\n  bool operator>(const pa4 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    if (z != p.z)\n      return z > p.z;\n\n    return w > p.w;\n  }\n\n  bool operator==(const pa4 &p) const { return x == p.x && y == p.y && z == p.z && w == p.w; }\n};\n\nclass pa2 {\n\npublic:\n  int x, y;\n\n  pa2(int x = 0, int y = 0) : x(x), y(y) {}\n\n  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n\n  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n\n  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }\n\n  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const pa2 &p) const { return abs(x - p.x) == 0 && abs(y - p.y) == 0; }\n\n  bool operator!=(const pa2 &p) const { return !(abs(x - p.x) == 0 && abs(y - p.y) == 0); }\n};\n\nstring itos(int i) {\n\n  ostringstream s;\n\n  s << i;\n\n  return s.str();\n}\n\nint gcd(int v, int b) {\n\n  if (v == 0)\n    return b;\n\n  if (b == 0)\n    return v;\n\n  if (v > b)\n    return gcd(b, v);\n\n  if (v == b)\n    return b;\n\n  if (b % v == 0)\n    return v;\n\n  return gcd(v, b % v);\n}\n\nint mod;\n\nint extgcd(int a, int b, int &x, int &y) {\n\n  if (b == 0) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n  }\n\n  int d = extgcd(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\npa operator+(const pa &l, const pa &r) { return {l.first + r.first, l.second + r.second}; }\n\npa operator-(const pa &l, const pa &r) { return {l.first - r.first, l.second - r.second}; }\n\nint beki(int wa, int rr, int warukazu) {\n\n  if (rr == 0)\n    return 1 % warukazu;\n\n  if (rr == 1)\n    return wa % warukazu;\n\n  wa %= warukazu;\n\n  if (rr % 2 == 1)\n    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;\n\n  ll zx = beki(wa, rr / 2, warukazu);\n\n  return (zx * zx) % warukazu;\n}\n\nint pr[1000100];\n\nint inv[1000010];\n\nint comb(int nn, int rr) {\n\n  if (rr < 0 || rr > nn || nn < 0)\n    return 0;\n\n  int r = pr[nn] * inv[rr];\n\n  r %= mod;\n\n  r *= inv[nn - rr];\n\n  r %= mod;\n\n  return r;\n}\n\nvoid gya(int ert) {\n\n  pr[0] = 1;\n\n  for (int i = 1; i <= ert; i++) {\n\n    pr[i] = ((ll)pr[i - 1] * i) % mod;\n  }\n\n  inv[ert] = beki(pr[ert], mod - 2, mod);\n\n  for (int i = ert - 1; i >= 0; i--) {\n\n    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;\n  }\n}\n\nvector<pa> hoge[300000];\n\nint n;\n\nstruct unionfind {\n\nprivate:\npublic:\n  vector<int> par, ranks, kosuu;\n\n  void shoki(int N) {\n\n    par.resize(N + 1, 0);\n\n    ranks.resize(N + 1, 0);\n\n    kosuu.resize(N + 1, 1);\n\n    for (int i = 0; i <= N; i++) {\n\n      par[i] = i;\n\n      hoge[i].pb(mp(i / (n + 2), i % (n + 2)));\n    }\n  }\n\n  int root(int x) { return par[x] == x ? x : par[x] = root(par[x]); }\n\n  bool same(int x, int y) { return root(x) == root(y); }\n\n  bool is_root(int x) { return x == root(x); }\n\n  void unite(int x, int y) {\n\n    x = root(x);\n\n    y = root(y);\n\n    int xx = kosuu[x], yy = kosuu[y];\n\n    if (x == y)\n      return;\n\n    if (ranks[x] < ranks[y]) {\n\n      par[x] = y;\n\n      kosuu[y] = yy + xx;\n\n      while (hoge[x].size()) {\n\n        hoge[y].pb(hoge[x].back());\n\n        hoge[x].pop_back();\n      }\n\n    }\n\n    else {\n\n      par[y] = x;\n\n      if (ranks[x] == ranks[y])\n        ranks[x] = ranks[x] + 1;\n\n      kosuu[x] = yy + xx;\n\n      while (hoge[y].size()) {\n\n        hoge[x].pb(hoge[y].back());\n\n        hoge[y].pop_back();\n      }\n    }\n\n    return;\n  }\n};\n\nunionfind uf;\n\nint a[510][510] = {};\n\nint dis[510][510] = {};\n\nint ch(int x, int y) { return (n + 2) * x + y; }\n\nint sumi[300000] = {};\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cin >> n;\n\n  vector<int> P(n * n);\n\n  for (int i = 0; i < n * n; i++)\n    cin >> P[i];\n\n  for (int i = 1; i <= n; i++)\n    for (int j = 1; j <= n; j++)\n      a[i][j] = 1;\n\n  for (int i = 0; i <= n + 1; i++)\n    for (int j = 0; j <= n + 1; j++) {\n\n      dis[i][j] = min({i, j, n + 1 - i, n + 1 - j});\n    }\n\n  int ans = 0;\n\n  for (int i = 1; i <= n * n; i++) {\n\n    int r = P[i - 1];\n\n    int x = (r - 1) / n + 1;\n\n    int y = (r - 1) % n + 1;\n\n    a[x][y] = 0;\n\n    queue<pa> qu;\n\n    dis[x][y]--;\n\n    int ne = dis[x][y];\n\n    for (int t = 0; t < 4; t++) {\n\n      int X = x + dx[t];\n\n      int Y = y + dy[t];\n\n      if (X > 0 && Y > 0 && X <= n && Y <= n)\n        if (a[X][Y] == 0) {\n\n          ne = min(ne, dis[X][Y]);\n        }\n    }\n\n    qu.push(mp(ch(x, y), ne));\n\n    int cnt = 0;\n\n    while (qu.size()) {\n\n      pa z = qu.front();\n\n      qu.pop();\n\n      if (sumi[z.first] == i)\n        continue;\n\n      sumi[z.first] = i;\n\n      pa v = mp(z.first / (n + 2), z.first % (n + 2));\n\n      dis[v.first][v.second] = z.second;\n\n      {\n\n        for (int t = 0; t < 4; t++) {\n\n          int X = dx[t] + v.first;\n\n          int Y = dy[t] + v.second;\n\n          if (X > 0 && Y > 0 && X <= n && Y <= n)\n            if (dis[X][Y] > z.second + a[X][Y]) {\n\n              qu.push(mp(ch(X, Y), z.second + a[X][Y]));\n            }\n        }\n      }\n    }\n\n    ans += dis[x][y];\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define int long long\n\n#define inf 1000000007\n\n#define pa pair<int, int>\n\n#define ll long long\n\n#define pal pair<double, double>\n\n#define ppap pair<pa, int>\n\n#define PI 3.14159265358979323846\n\n#define paa pair<int, char>\n\n#define mp make_pair\n\n#define pb push_back\n\n#define EPS (1e-8)\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};\n\nusing namespace std;\n\nclass pa3 {\n\npublic:\n  int x;\n\n  int y, z;\n\n  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n\n  bool operator<(const pa3 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    return z < p.z;\n  }\n\n  bool operator>(const pa3 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    return z > p.z;\n  }\n\n  bool operator==(const pa3 &p) const { return x == p.x && y == p.y && z == p.z; }\n\n  bool operator!=(const pa3 &p) const { return !(x == p.x && y == p.y && z == p.z); }\n};\n\nclass pa4 {\n\npublic:\n  int x;\n\n  int y, z, w;\n\n  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n\n  bool operator<(const pa4 &p) const {\n\n    if (x != p.x)\n      return x < p.x;\n\n    if (y != p.y)\n      return y < p.y;\n\n    if (z != p.z)\n      return z < p.z;\n\n    return w < p.w;\n  }\n\n  bool operator>(const pa4 &p) const {\n\n    if (x != p.x)\n      return x > p.x;\n\n    if (y != p.y)\n      return y > p.y;\n\n    if (z != p.z)\n      return z > p.z;\n\n    return w > p.w;\n  }\n\n  bool operator==(const pa4 &p) const { return x == p.x && y == p.y && z == p.z && w == p.w; }\n};\n\nclass pa2 {\n\npublic:\n  int x, y;\n\n  pa2(int x = 0, int y = 0) : x(x), y(y) {}\n\n  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n\n  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n\n  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }\n\n  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n\n  bool operator==(const pa2 &p) const { return abs(x - p.x) == 0 && abs(y - p.y) == 0; }\n\n  bool operator!=(const pa2 &p) const { return !(abs(x - p.x) == 0 && abs(y - p.y) == 0); }\n};\n\nstring itos(int i) {\n\n  ostringstream s;\n\n  s << i;\n\n  return s.str();\n}\n\nint Gcd(int v, int b) {\n\n  if (v == 0)\n    return b;\n\n  if (b == 0)\n    return v;\n\n  if (v > b)\n    return Gcd(b, v);\n\n  if (v == b)\n    return b;\n\n  if (b % v == 0)\n    return v;\n\n  return Gcd(v, b % v);\n}\n\nint mod;\n\nint extgcd(int a, int b, int &x, int &y) {\n\n  if (b == 0) {\n\n    x = 1;\n\n    y = 0;\n\n    return a;\n  }\n\n  int d = extgcd(b, a % b, y, x);\n\n  y -= a / b * x;\n\n  return d;\n}\n\npa operator+(const pa &l, const pa &r) { return {l.first + r.first, l.second + r.second}; }\n\npa operator-(const pa &l, const pa &r) { return {l.first - r.first, l.second - r.second}; }\n\nint beki(int wa, int rr, int warukazu) {\n\n  if (rr == 0)\n    return 1 % warukazu;\n\n  if (rr == 1)\n    return wa % warukazu;\n\n  wa %= warukazu;\n\n  if (rr % 2 == 1)\n    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;\n\n  ll zx = beki(wa, rr / 2, warukazu);\n\n  return (zx * zx) % warukazu;\n}\n\nint pr[100000];\n\nint inv[100000];\n\nint comb(int nn, int rr) {\n\n  if (rr < 0 || rr > nn || nn < 0)\n    return 0;\n\n  int r = pr[nn] * inv[rr];\n\n  r %= mod;\n\n  r *= inv[nn - rr];\n\n  r %= mod;\n\n  return r;\n}\n\nvoid gya(int ert) {\n\n  pr[0] = 1;\n\n  for (int i = 1; i <= ert; i++) {\n\n    pr[i] = ((ll)pr[i - 1] * i) % mod;\n  }\n\n  inv[ert] = beki(pr[ert], mod - 2, mod);\n\n  for (int i = ert - 1; i >= 0; i--) {\n\n    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;\n  }\n}\n\nint a[510][510] = {};\n\nint ban[510][510] = {};\n\npa moto[504][510];\n\nvoid solve() {\n\n  int n;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n    for (int j = 0; j < n; j++) {\n\n      a[i][j] = min({i + 1, j + 1, n - i, n - j});\n\n      ban[i][j] = 1;\n    }\n\n  int ans = 0;\n\n  queue<pa3> qu;\n\n  for (int er = 0; er < n * n; er++) {\n\n    int yy;\n\n    cin >> yy;\n\n    yy--;\n\n    int x = yy / n;\n\n    int y = yy % n;\n\n    ans += a[x][y] - 1;\n\n    qu.push((pa3){x, y, a[x][y] - 1});\n\n    ban[x][y] = 0;\n\n    while (qu.size()) {\n\n      pa3 z = qu.front();\n\n      qu.pop();\n\n      x = z.x;\n\n      y = z.y;\n\n      int w = z.z;\n\n      if (a[x][y] <= w)\n        continue;\n\n      a[x][y] = w;\n\n      for (int r = 0; r < 4; r++) {\n\n        int X = x + dx[r], Y = y + dy[r];\n\n        if (X < 0 || Y < 0 || X >= n || Y >= n)\n          continue;\n\n        int g = w + ban[X][Y];\n\n        if (a[X][Y] > g)\n          qu.push((pa3){X, Y, g});\n      }\n    }\n  }\n\n  cout << ans << endl;\n}\n\nsigned main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n = 1;\n\n  for (int i = 0; i < n; i++)\n    solve();\n\n  return 0;\n}\n"}
{"fast_code_id":"575300e93a15f654424a5fefdc02631fb8fda275bf0ba486334e5e2fe41da60a","fast_id":"34c1ea76e54698f78b7881b6d324baab347654c031b784cef911ab54930f47dc","fast_time":0.1090456779,"language":"cpp","measured_fast_code_id":"34c1ea76e54698f78b7881b6d324baab347654c031b784cef911ab54930f47dc","measured_slow_code_id":"0495d334ab9f89d4c8d22b75de5e99ff8e0972978f8e5f47543fc59d2a0bea45","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76647","problem_id":"p03520","slow_code_id":"adc2a776f476e31b7e838b004d71dede4fcfc3837e7699a424dba20ba0dd66a3","slow_id":"0495d334ab9f89d4c8d22b75de5e99ff8e0972978f8e5f47543fc59d2a0bea45","slow_time":0.6898900609,"speedup":6.326615361432863,"stratum":"4-8","sampling_key":"21dd3e659df23bf75901242fa2bdbb703e8e441598f1be7ea0fe15605821c325","slow_code":"#include <string>\n\n#include <vector>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nstruct edge {\n  int to, id;\n};\n\nint n, vc, a[200009], b[200009], c[200009];\nlong long sd, ans[200009], s[200009], dist[200009];\nvector<edge> g[200009];\n\nvoid dfs(int pos, int pre) {\n\n  c[pos] = 1;\n\n  for (edge e : g[pos]) {\n\n    if (e.to != pre) {\n\n      dfs(e.to, pos);\n\n      c[pos] += c[e.to];\n\n      if (n - c[e.to] * 2 != 0) {\n\n        ans[e.id] = (s[e.to] - s[pos]) / (n - c[e.to] * 2);\n      }\n    }\n  }\n}\n\nvoid dfs2(int pos, int pre, int flag) {\n\n  if (flag)\n    vc++;\n  sd += dist[pos];\n\n  for (edge e : g[pos]) {\n\n    if (e.to != pre) {\n\n      dist[e.to] = dist[pos];\n\n      if (ans[e.id] != -1)\n        dist[e.to] += ans[e.id];\n\n      dfs2(e.to, pos, (flag | (ans[e.id] == -1 ? 1 : 0)));\n    }\n  }\n}\n\nint main() {\n\n  cin >> n;\n\n  for (int i = 0; i < n - 1; i++) {\n\n    cin >> a[i] >> b[i];\n    a[i]--, b[i]--;\n\n    g[a[i]].push_back(edge{b[i], i});\n\n    g[b[i]].push_back(edge{a[i], i});\n  }\n\n  for (int i = 0; i < n; i++)\n    cin >> s[i];\n\n  fill(ans, ans + n - 1, -1);\n\n  dfs(0, -1);\n\n  int zp = -1;\n\n  for (int i = 0; i < n - 1; i++) {\n\n    if (ans[i] == -1)\n      zp = i;\n  }\n\n  if (zp != -1) {\n\n    dfs2(0, -1, 0);\n\n    ans[zp] = (s[0] - sd) / vc;\n  }\n\n  for (int i = 0; i < n - 1; i++)\n    cout << ans[i] << endl;\n\n  return 0;\n}","fast_code":"#include <vector>\n\n#include <iostream>\n\n#include <functional>\n\nusing namespace std;\n\nint main() {\n\n  cin.tie(0);\n\n  ios_base::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  vector<int> A(N - 1), B(N - 1);\n\n  vector<vector<int> > G(N);\n\n  for (int i = 0; i < N - 1; ++i) {\n\n    cin >> A[i] >> B[i];\n    --A[i], --B[i];\n\n    G[A[i]].push_back(B[i]);\n\n    G[B[i]].push_back(A[i]);\n  }\n\n  vector<long long> S(N);\n\n  for (int i = 0; i < N; ++i) {\n\n    cin >> S[i];\n  }\n\n  vector<int> sub(N, 1);\n\n  function<void(int, int)> dfs = [&](int pos, int pre) {\n    for (int i : G[pos]) {\n\n      if (i != pre) {\n\n        dfs(i, pos);\n\n        sub[pos] += sub[i];\n      }\n    }\n  };\n\n  dfs(0, -1);\n\n  vector<long long> ans(N - 1);\n\n  int equal_ptr = -1;\n\n  long long sum = 0;\n\n  for (int i = 0; i < N - 1; ++i) {\n\n    if (sub[A[i]] < sub[B[i]]) {\n\n      swap(A[i], B[i]);\n    }\n\n    if (sub[B[i]] * 2 == N) {\n\n      equal_ptr = i;\n\n    }\n\n    else {\n\n      ans[i] = (S[A[i]] - S[B[i]]) / (2 * sub[B[i]] - N);\n\n      sum += ans[i] * sub[B[i]];\n    }\n  }\n\n  if (equal_ptr != -1) {\n\n    ans[equal_ptr] = (S[0] - sum) / (N / 2);\n  }\n\n  for (int i = 0; i < N - 1; ++i) {\n\n    cout << ans[i] << '\\n';\n  }\n\n  return 0;\n}"}
{"fast_code_id":"5a09c9ba807b7e3ffc8ee592cf8f747ec6690c35fe6401b7fa277f67184bb062","fast_id":"298973bcb396f003844f1427a28a8d0d5b9191dfb35b6af6d91bba916a4b8de2","fast_time":0.0076358391,"language":"cpp","measured_fast_code_id":"298973bcb396f003844f1427a28a8d0d5b9191dfb35b6af6d91bba916a4b8de2","measured_slow_code_id":"2e46272ce462cd0e95168f48b275543120dc8c25ddaaee060f8dba547b4ef772","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76660","problem_id":"p03448","slow_code_id":"56e24f308b6a11a2e80b24a0cd82f04337e5f4803776e945445b9653dc305168","slow_id":"2e46272ce462cd0e95168f48b275543120dc8c25ddaaee060f8dba547b4ef772","slow_time":0.0534254049,"speedup":6.996664570891757,"stratum":"4-8","sampling_key":"0b38938bfe5af0b0f592b1ef4a3f1078b40d61f623dc5432f63a12381e3343f3","slow_code":"#include <iostream>\n\n#include <string.h>\n\n#include <stdlib.h>\n\n#include <stdio.h>\n\n#include <bitset>\n\n#include <algorithm>\n\n#include <cstdio>\n\n#include <time.h>\n\n#include <queue>\n\n#include <set>\n\n#include <map>\n\n#include <stack>\n\n#include <math.h>\n\n#define ll long long\n\n#define int64 long long\n\n#define mem(x, y) memset(x, y, sizeof(x))\n\n#define ull unsigned long long\n\n#define pb push_back\n\n#define INF 0x7f7f7f7f\n\n#define lson l, mid, rt << 1\n\n#define rson mid + 1, r, rt << 1 | 1\n\n#define pi 3.141592653589793238462\n\n#define stdio std::ios::sync_with_stdio(false)\n\n#define zero(x) (((x) > 0 ? (x) : -(x)) < eps)\n\nusing namespace std;\n\ninline bool nextDouble(double &num) {\n\n  char in;\n\n  double Dec = 0.1;\n\n  bool IsN = false, IsD = false;\n\n  in = getchar();\n\n  if (in == EOF)\n    return false;\n\n  while (in != '-' && in != '.' && (in < '0' || in > '9'))\n\n    in = getchar();\n\n  if (in == '-') {\n\n    IsN = true;\n\n    num = 0;\n\n  } else if (in == '.') {\n\n    IsD = true;\n\n    num = 0;\n\n  } else\n    num = in - '0';\n\n  if (!IsD) {\n\n    while (in = getchar(), in >= '0' && in <= '9') {\n\n      num *= 10;\n\n      num += in - '0';\n    }\n  }\n\n  if (in != '.') {\n\n    if (IsN)\n      num = -num;\n\n    return true;\n\n  } else {\n\n    while (in = getchar(), in >= '0' && in <= '9') {\n\n      num += Dec * (in - '0');\n\n      Dec *= 0.1;\n    }\n  }\n\n  if (IsN)\n    num = -num;\n\n  return true;\n}\n\ninline bool nextLongDouble(long double &num) {\n\n  char in;\n\n  long double Dec = 0.1;\n\n  bool IsN = false, IsD = false;\n\n  in = getchar();\n\n  if (in == EOF)\n    return false;\n\n  while (in != '-' && in != '.' && (in < '0' || in > '9'))\n\n    in = getchar();\n\n  if (in == '-') {\n\n    IsN = true;\n\n    num = 0;\n\n  } else if (in == '.') {\n\n    IsD = true;\n\n    num = 0;\n\n  } else\n    num = in - '0';\n\n  if (!IsD) {\n\n    while (in = getchar(), in >= '0' && in <= '9') {\n\n      num *= 10;\n\n      num += in - '0';\n    }\n  }\n\n  if (in != '.') {\n\n    if (IsN)\n      num = -num;\n\n    return true;\n\n  } else {\n\n    while (in = getchar(), in >= '0' && in <= '9') {\n\n      num += Dec * (in - '0');\n\n      Dec *= 0.1;\n    }\n  }\n\n  if (IsN)\n    num = -num;\n\n  return true;\n}\n\ninline bool nextInt(int &num) {\n\n  char in;\n\n  bool IsN = false;\n\n  in = getchar();\n\n  if (in == EOF)\n    return false;\n\n  while (in != '-' && (in < '0' || in > '9'))\n    in = getchar();\n\n  if (in == '-') {\n\n    IsN = true;\n\n    num = 0;\n\n  } else\n    num = in - '0';\n\n  while (in = getchar(), in >= '0' && in <= '9') {\n\n    num *= 10, num += in - '0';\n  }\n\n  if (IsN)\n    num = -num;\n\n  return true;\n}\n\ninline bool nextLong(ll &num) {\n\n  char in;\n\n  bool IsN = false;\n\n  in = getchar();\n\n  if (in == EOF)\n    return false;\n\n  while (in != '-' && (in < '0' || in > '9'))\n    in = getchar();\n\n  if (in == '-') {\n\n    IsN = true;\n\n    num = 0;\n\n  } else\n    num = in - '0';\n\n  while (in = getchar(), in >= '0' && in <= '9') {\n\n    num *= 10, num += in - '0';\n  }\n\n  if (IsN)\n    num = -num;\n\n  return true;\n}\n\ninline bool blank(char ch) { return ch == ' ' || ch == '\\n' || ch == '\\r' || ch == '\\t'; }\n\ninline void read(char *s) {\n\n  char ch = getchar();\n\n  for (; blank(ch); ch = getchar())\n    ;\n\n  for (; !blank(ch); ch = getchar())\n    *s++ = ch;\n\n  *s = 0;\n}\n\nconst int maxn = 1e2 + 5;\n\nconst int maxm = 2e6 + 5;\n\nconst int mod = 1e9;\n\nconst int seed = 10007;\n\nconst double eps = 1e-6;\n\nint a[4], x, c[4];\n\nint dp[4][20005];\n\nint main() {\n\n  for (int i = 1; i <= 3; scanf(\"%d\", &a[i++]))\n    ;\n\n  c[1] = 500, c[2] = 100, c[3] = 50;\n\n  scanf(\"%d\", &x);\n\n  mem(dp, 0);\n\n  dp[0][0] = 1;\n\n  for (int i = 1; i <= 3; i++) {\n\n    for (int j = 0; j <= x; j++) {\n\n      int num = j / c[i];\n\n      num = min(num, a[i]);\n\n      for (int k = 0; k <= num; k++) {\n\n        dp[i][j] += dp[i - 1][j - k * c[i]];\n      }\n    }\n  }\n\n  printf(\"%d\\n\", dp[3][x]);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nint A, B, C;\n\nint X;\n\nint solve() {\n\n  int result = 0;\n\n  for (int i = 0; i <= A; ++i) {\n\n    for (int j = 0; j <= B; ++j) {\n\n      for (int k = 0; k <= C; ++k) {\n\n        int tmp = i * 500 + j * 100 + k * 50;\n\n        if (tmp == X)\n          result++;\n      }\n    }\n  }\n\n  return result;\n}\n\nint main() {\n\n  scanf(\"%d%d%d%d\", &A, &B, &C, &X);\n\n  int result = solve();\n\n  printf(\"%d\\n\", result);\n\n  return 0;\n}"}
{"fast_code_id":"04404a9f3a4c8db5fa497dffd29d18f6931eb290a4390ea9512e42b69f4768a4","fast_id":"16b20c4d05f9c2a9e9661c0a963133160c932bab23d375a83ba8e3ebe668f47c","fast_time":0.0197834525,"language":"cpp","measured_fast_code_id":"16b20c4d05f9c2a9e9661c0a963133160c932bab23d375a83ba8e3ebe668f47c","measured_slow_code_id":"a59d757dfc805203f04283c1fc7dc21ce22fb97f6285f291b87b2a95c6e375c2","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76700","problem_id":"p03707","slow_code_id":"68561dc6dd219514f913636fb761b37006154ee7cb5a7632a05ef24bb2ab2880","slow_id":"a59d757dfc805203f04283c1fc7dc21ce22fb97f6285f291b87b2a95c6e375c2","slow_time":0.1119319922,"speedup":5.657859375152037,"stratum":"4-8","sampling_key":"1af2af056982b39c983253fc781967ad4c6498d64d384f8b3c0b026d86bae8a8","slow_code":"#define _CRT_SECURE_NO_WARNINGS\n\n#include <iostream>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <vector>\n\n#include <list>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <algorithm>\n\n#include <iterator>\n\n#include <bitset>\n\n#include <ctime>\n\n#include <complex>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); i--)\n\n#define ITER(it, a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int)a.size()\n\n#define ALL(a) a.begin(), a.end()\n\n#define PB push_back\n\n#define MP make_pair\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\n\nconst int INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = INF * (LL)INF;\n\nconst int MAX = 2 * 1000 + 47;\n\nconst int MOD = 1000 * 1000 * 1000 + 7;\n\nstring A[MAX];\n\nint P1[MAX][MAX];\n\nint P2[MAX][MAX];\n\nint P3[MAX][MAX];\n\nvoid recalc(int i, int j, int P1[MAX][MAX])\n\n{\n\n  if (i)\n    P1[i][j] += P1[i - 1][j];\n\n  if (j)\n    P1[i][j] += P1[i][j - 1];\n\n  if (i && j)\n    P1[i][j] -= P1[i - 1][j - 1];\n}\n\nint get1(int x1, int y1, int x2, int y2)\n\n{\n\n  int res = P1[x2][y2];\n\n  if (x1)\n    res -= P1[x1 - 1][y2];\n\n  if (y1)\n    res -= P1[x2][y1 - 1];\n\n  if (x1 && y1)\n    res += P1[x1 - 1][y1 - 1];\n\n  return res;\n}\n\nint get2(int x1, int y1, int x2, int y2)\n\n{\n\n  int res = P2[x2][y2];\n\n  if (x1)\n    res -= P2[x1 - 1][y2];\n\n  res -= P2[x2][y1];\n\n  if (x1)\n    res += P2[x1 - 1][y1];\n\n  return res;\n}\n\nint get3(int x1, int y1, int x2, int y2)\n\n{\n\n  int res = P3[x2][y2];\n\n  res -= P3[x1][y2];\n\n  if (y1)\n    res -= P3[x2][y1 - 1];\n\n  if (y1)\n    res += P3[x1][y1 - 1];\n\n  return res;\n}\n\nvoid print(int n, int m, int P[MAX][MAX])\n\n{\n\n  FOR(i, 0, n)\n\n  {\n\n    FOR(j, 0, m) cout << P[i][j] << \" \";\n\n    cout << endl;\n  }\n}\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false);\n  cin.tie(0);\n\n  int n, m, q;\n\n  cin >> n >> m >> q;\n\n  FOR(i, 0, n)\n\n  {\n\n    cin >> A[i];\n  }\n\n  FOR(i, 0, n)\n\n  {\n\n    FOR(j, 0, m)\n\n    {\n\n      P1[i][j] = A[i][j] == '1';\n\n      recalc(i, j, P1);\n    }\n  }\n\n  FOR(i, 0, n)\n\n  {\n\n    FOR(j, 0, m)\n\n    {\n\n      if (j && A[i][j] == A[i][j - 1] && A[i][j] == '1')\n\n      {\n\n        P2[i][j] = 1;\n      }\n\n      recalc(i, j, P2);\n    }\n  }\n\n  FOR(i, 0, n)\n\n  {\n\n    FOR(j, 0, m)\n\n    {\n\n      if (i && A[i][j] == A[i - 1][j] && A[i][j] == '1')\n\n      {\n\n        P3[i][j] = 1;\n      }\n\n      recalc(i, j, P3);\n    }\n  }\n\n  FOR(i, 0, q)\n\n  {\n\n    int x1, y1, x2, y2;\n\n    cin >> x1 >> y1 >> x2 >> y2;\n\n    x1--;\n\n    y1--;\n\n    x2--;\n\n    y2--;\n\n    int p1 = get1(x1, y1, x2, y2);\n\n    int p2 = get2(x1, y1, x2, y2);\n\n    int p3 = get3(x1, y1, x2, y2);\n\n    cout << p1 - (p2 + p3) << endl;\n  }\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define MN 2005\n\nusing namespace std;\n\ninline int in() {\n\n  int x = 0;\n  bool f = 0;\n  char c;\n\n  for (; (c = getchar()) < '0' || c > '9'; f = c == '-')\n    ;\n\n  for (x = c - '0'; (c = getchar()) >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0')\n    ;\n\n  return f ? -x : x;\n}\n\nbool s[MN][MN];\n\nchar ch[MN];\n\nint s1[MN][MN], s2[MN][MN], f[MN][MN], sum[MN][MN];\n\nint n, m, q, xa, ya, xb, yb, res;\n\nint main()\n\n{\n\n  n = in();\n  m = in();\n  q = in();\n\n  for (int i = 1; i <= n; ++i) {\n\n    scanf(\"%s\", ch);\n\n    for (int j = 0; j < m; ++j)\n      s[i][j + 1] = ch[j] - '0';\n  }\n\n  for (int i = 1; i <= n; ++i) {\n\n    for (int j = 1; j <= m; ++j) {\n\n      s1[i][j] = s1[i][j - 1] + (s[i][j] && s[i - 1][j]);\n\n      s2[i][j] = s2[i - 1][j] + (s[i][j] && s[i][j - 1]);\n\n      f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1] + (s[i][j] && s[i - 1][j]) +\n                (s[i][j] && s[i][j - 1]);\n\n      sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (s[i][j]);\n    }\n  }\n\n  for (int i = 1; i <= q; ++i) {\n\n    xa = in();\n    ya = in();\n    xb = in();\n    yb = in();\n\n    res = sum[xb][yb] - sum[xa - 1][yb] - sum[xb][ya - 1] + sum[xa - 1][ya - 1];\n\n    res -= f[xb][yb] - f[xa - 1][yb] - f[xb][ya - 1] + f[xa - 1][ya - 1];\n\n    res += s1[xa][yb] + s2[xb][ya] - s1[xa][ya - 1] - s2[xa - 1][ya];\n    printf(\"%d\\n\", res);\n  }\n\n  return 0;\n}"}
{"fast_code_id":"8bb0213bc735720136bc13e6dda7f4392971cf0dee1f765af9697d678e6d4157","fast_id":"97ac95a7d4c6e0a96845db130a2ecf4b24db507828329368bae129bf5f2cbbad","fast_time":0.0265153912,"language":"cpp","measured_fast_code_id":"97ac95a7d4c6e0a96845db130a2ecf4b24db507828329368bae129bf5f2cbbad","measured_slow_code_id":"aeb5da5cc5540ba84b036796360b677114ad59c84c9cfdad47b86e661278e84d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76729","problem_id":"p02774","slow_code_id":"e621d252d410a92313ef38877f3f3c625bca26ffe76e34ce01779744102a691d","slow_id":"aeb5da5cc5540ba84b036796360b677114ad59c84c9cfdad47b86e661278e84d","slow_time":0.1123896251,"speedup":4.238656116829232,"stratum":"4-8","sampling_key":"0569c3fcb27cf87dff698e75e3909958f4413f947af547a907508199706383a1","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  ll K;\n\n  cin >> K;\n\n  int sei[200000], fu[200000];\n\n  int seik = 0, fuk = 0;\n\n  int zero = 0;\n\n  rep(i, N) {\n\n    int a;\n\n    cin >> a;\n\n    if (a > 0)\n      sei[seik++] = a;\n\n    else if (a < 0)\n      fu[fuk++] = -a;\n\n    else\n      zero++;\n  }\n\n  sort(sei, sei + seik);\n\n  sort(fu, fu + fuk);\n\n  ll k0 = ll(seik) * fuk + ll(zero) * (zero - 1) / 2 + ll(zero) * (N - zero);\n\n  ll L = -1000000000000000001, R = 1000000000000000000;\n\n  while (L + 1 < R) {\n\n    ll M = (L + R) / 2;\n\n    ll k = 0;\n\n    if (M >= 0) {\n\n      k += k0;\n\n      int i = 1;\n\n      while (i < seik) {\n\n        if (ll(sei[i]) * sei[i - 1] > M)\n          break;\n\n        k += i;\n\n        i++;\n      }\n\n      int j = i - 1;\n\n      while (i < seik) {\n\n        while (j >= 1 && ll(sei[i]) * sei[j - 1] > M)\n          j--;\n\n        k += j;\n\n        i++;\n      }\n\n      i = 1;\n\n      while (i < fuk) {\n\n        if (ll(fu[i]) * fu[i - 1] > M)\n          break;\n\n        k += i;\n\n        i++;\n      }\n\n      j = i - 1;\n\n      while (i < fuk) {\n\n        while (j >= 1 && ll(fu[i]) * fu[j - 1] > M)\n          j--;\n\n        k += j;\n\n        i++;\n      }\n\n    }\n\n    else {\n\n      int j = 0;\n\n      rep(i, seik) {\n\n        while (j < fuk && ll(sei[i]) * fu[fuk - j - 1] >= -M)\n          j++;\n\n        k += j;\n      }\n    }\n\n    if (k >= K)\n      R = M;\n\n    else\n      L = M;\n  }\n\n  co(R);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline int getint() {\n\n  int A = 0;\n\n  int pn = 1;\n\n  if (ci - cn + 16 > cm) {\n\n    if ((ct = getcha()) == '-') {\n      pn = -1;\n      ct = getcha();\n    }\n\n    A = ct - '0';\n\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n    ;\n\n    return pn * A;\n\n  }\n\n  else {\n\n    if ((ct = *ci++) == '-') {\n      pn = -1;\n      ct = *ci++;\n    }\n\n    A = ct - '0';\n\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n    ;\n\n    return pn * A;\n  }\n}\n\nvoid pakuri_sort(int N, int A[]) {\n\n  const int b = 8;\n\n  int tmp[200001];\n\n  rep(k, 4) {\n\n    int kazu[1 << b] = {}, kazu2[1 << b] = {};\n\n    rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];\n\n    k++;\n\n    rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;\n\n    rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];\n\n    for (int i = N - 1; i >= 0; i--)\n      A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];\n  }\n}\n\nint main() {\n\n  int N = getint();\n\n  ll K = 0;\n\n  while ((ct = *ci++) >= '0')\n    K = K * 10 + ct - '0';\n\n  int sei[200000], fu[200000];\n\n  int seik = 0, fuk = 0;\n\n  int zero = 0;\n\n  rep(i, N) {\n\n    int a = getint();\n\n    if (a > 0)\n      sei[seik++] = a;\n\n    else if (a < 0)\n      fu[fuk++] = -a;\n\n    else\n      zero++;\n  }\n\n  pakuri_sort(seik, sei);\n\n  pakuri_sort(fuk, fu);\n\n  ll k0 = ll(seik) * fuk + ll(zero) * (zero - 1) / 2 + ll(zero) * (N - zero);\n\n  ll L = -1000000000000000001, R = 1000000000000000000;\n\n  while (L + 1 < R) {\n\n    ll M = (L + R) / 2;\n\n    ll k = 0;\n\n    if (M >= 0) {\n\n      k += k0;\n\n      if (k >= K) {\n        R = M;\n        continue;\n      }\n\n      int i = 0;\n\n      int j = seik - 1;\n\n      while (i < seik) {\n\n        while (j > i && ll(sei[i]) * sei[j] > M)\n          j--;\n\n        if (i == j)\n          break;\n\n        k += j - i;\n\n        i++;\n      }\n\n      if (k >= K) {\n        R = M;\n        continue;\n      }\n\n      i = 0;\n\n      j = fuk - 1;\n\n      while (i < fuk) {\n\n        while (j > i && ll(fu[i]) * fu[j] > M)\n          j--;\n\n        if (i == j)\n          break;\n\n        k += j - i;\n\n        i++;\n      }\n\n    }\n\n    else {\n\n      int j = 0;\n\n      rep(i, seik) {\n\n        while (j < fuk && ll(sei[i]) * fu[fuk - j - 1] >= -M)\n          j++;\n\n        k += j;\n      }\n    }\n\n    if (k >= K)\n      R = M;\n\n    else\n      L = M;\n  }\n\n  printf(\"%lld\\n\", R);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"8f035ca3ef9e97584ceca9c55d77d47a5447b35ca5967e8ae19442711998efef","fast_id":"767f9e04ac1a103fd20e1fb9ddcfd80aa7b8e0c4643f30ef324efd9747db1f7d","fast_time":0.0925615885,"language":"cpp","measured_fast_code_id":"767f9e04ac1a103fd20e1fb9ddcfd80aa7b8e0c4643f30ef324efd9747db1f7d","measured_slow_code_id":"291dc28d92d0269006ea9ad5c4f09229cae36e230932a0a7cc247063844c5ccf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76962","problem_id":"p00997","slow_code_id":"f43ba315d3d10a9c78ad595ab1cfa39410bc3a68238989d57579cc9df1088d5f","slow_id":"291dc28d92d0269006ea9ad5c4f09229cae36e230932a0a7cc247063844c5ccf","slow_time":1.0831859235,"speedup":11.70232642993157,"stratum":"8+","sampling_key":"ff90fdd61c1db971e46751759ea720b2423b34c6761a42bc003641359822453e","slow_code":"#include <bits/stdc++.h>\n\n#define N 200001\n\n#define f first\n\n#define s second\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<ll, P> PP;\n\nvector<P> G[N];\n\nll n;\n\nll par[N];\n\nll Rank[N];\n\nll Cnt[N];\n\nvoid init(int n) {\n\n  for (int i = 0; i < n; i++) {\n\n    par[i] = i;\n\n    Rank[i] = 0;\n\n    Cnt[i] = 1;\n  }\n}\n\nll find(int x) {\n\n  if (par[x] == x)\n    return x;\n\n  return par[x] = find(par[x]);\n}\n\nvoid unite(int x, int y) {\n\n  x = find(x);\n\n  y = find(y);\n\n  if (x == y)\n    return;\n\n  if (Rank[x] < Rank[y]) {\n\n    par[x] = y;\n\n    Cnt[y] += Cnt[x];\n\n    Cnt[x] = 0;\n\n  }\n\n  else {\n\n    par[y] = x;\n\n    Cnt[x] += Cnt[y];\n\n    Cnt[y] = 0;\n\n    if (Rank[x] == Rank[y])\n      Rank[x]++;\n  }\n}\n\nbool same(int x, int y) { return find(x) == find(y); }\n\nvector<PP> path;\n\nll solve() {\n\n  ll res = 0;\n\n  for (int i = 0; i < n; i++)\n\n    for (int j = 0; j < G[i].size(); j++)\n\n      path.push_back(PP(G[i][j].f, P(i, G[i][j].s)));\n\n  sort(path.begin(), path.end());\n\n  for (int i = 0; i < path.size(); i++) {\n\n    int a = path[i].s.f;\n\n    int b = path[i].s.s;\n\n    int c = path[i].f;\n\n    if (same(a, b))\n      continue;\n\n    res += (Cnt[find(a)] * Cnt[find(b)]) * c;\n\n    unite(a, b);\n  }\n\n  return res;\n}\n\nint main() {\n\n  init(N);\n\n  cin >> n;\n\n  for (int i = 1, a, b, c; i < n; i++) {\n\n    cin >> a >> b >> c;\n\n    G[a].push_back(P(c, b));\n\n    G[b].push_back(P(c, a));\n  }\n\n  cout << solve() << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\nstruct UF {\n\n  vector<int> data;\n\n  UF(int n) : data(n, -1) {}\n\n  int find(int x) {\n\n    if (data[x] < 0)\n      return x;\n\n    return data[x] = find(data[x]);\n  }\n\n  int size(int x) { return -data[find(x)]; }\n\n  bool same(int x, int y) { return find(x) == find(y); }\n\n  void unite(int x, int y) {\n\n    x = find(x), y = find(y);\n\n    if (x == y)\n      return;\n\n    if (data[x] > data[y])\n      swap(x, y);\n\n    data[x] += data[y];\n\n    data[y] = x;\n  }\n};\n\nstruct edge {\n\n  int u, v, w;\n\n  edge() {}\n\n  edge(int u, int v, int w) : u(u), v(v), w(w) {}\n\n  bool operator<(const edge &e) const { return w < e.w; }\n};\n\nsigned main() {\n\n  int n;\n\n  cin >> n;\n\n  vector<edge> es;\n\n  for (int i = 0; i < n - 1; ++i) {\n\n    int a, b, c;\n\n    cin >> a >> b >> c;\n\n    es.emplace_back(a, b, c);\n  }\n\n  sort(es.begin(), es.end());\n\n  UF uf(n);\n\n  int ans = 0;\n\n  for (edge &e : es) {\n\n    int x = uf.find(e.u), y = uf.find(e.v);\n\n    if (x == y)\n      continue;\n\n    ans += e.w * uf.size(x) * uf.size(y);\n\n    uf.unite(x, y);\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"5cf1fbe45421442af8b702176d41dbe2aaba5cbf43c4e3bfa5601b79bca7f4ad","fast_id":"ef13dcbb192ded215153f2a7c68203afa867bfa26eec12722321aa2e0047897d","fast_time":0.0010271576,"language":"cpp","measured_fast_code_id":"ef13dcbb192ded215153f2a7c68203afa867bfa26eec12722321aa2e0047897d","measured_slow_code_id":"1422ef5c5f3e58d9b69c0e0a0409bfb8cac621fd35a3cc3a776f7c8d4a6ea5e6","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76966","problem_id":"p03196","slow_code_id":"3690199cf7f682bff5f9b297eb6c7adb74e31847706f2eeb3f8205661eed8d44","slow_id":"1422ef5c5f3e58d9b69c0e0a0409bfb8cac621fd35a3cc3a776f7c8d4a6ea5e6","slow_time":0.0066046712,"speedup":6.430046567342733,"stratum":"4-8","sampling_key":"e3002ae5b69a1b59813565962b96c31687be51fe7305d2b8e99cb8e89eb9cc5c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long l;\n\nl o = 0, ans = 1;\n\nbool ok = 0, w[5000005];\n\nint main()\n\n{\n\n  l n, k;\n\n  cin >> n >> k;\n\n  if (n == 1)\n\n  {\n\n    cout << k << endl;\n\n    return 0;\n  }\n\n  for (int i = 2; ok == 0; i++)\n\n  {\n\n    if (i * i > k)\n\n      break;\n\n    if (w[i] == 1)\n\n      continue;\n\n    o = 1;\n\n    for (int c = 0; c < n; c++)\n\n    {\n\n      o = o * i;\n\n      if (o > k)\n\n      {\n\n        ok = 1;\n\n        break;\n      }\n    }\n\n    if (k % o == 0)\n\n      ans = i;\n\n    else\n\n      for (l d = i; d < 5000005; d += i)\n\n        w[d] = 1;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <sstream>\n\n#include <fstream>\n\n#include <string>\n\n#include <vector>\n\n#include <deque>\n\n#include <queue>\n\n#include <stack>\n\n#include <set>\n\n#include <map>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <utility>\n\n#include <bitset>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <ctime>\n\n#include <cstdio>\n\n#include <string.h>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define forn(i, a, b) for (int i = a; i <= b; i++)\n\n#define INF 2147483647\n\n#define LLINF 9223372036854775807\n\nusing namespace std;\n\nmap<long long, long long> mp;\n\nint main() {\n\n  long long n, p;\n\n  cin >> n >> p;\n\n  set<long long> s;\n\n  long long P = p;\n\n  vector<long long> v;\n\n  for (long long i = 2; i * i <= P; i++) {\n\n    if (P % i == 0) {\n\n      while (p && p % i == 0) {\n\n        p /= i;\n\n        s.insert(i);\n\n        mp[i]++;\n      }\n\n      v.push_back(P / i);\n    }\n  }\n\n  for (int i = 0; i < v.size(); i++) {\n\n    while (p && p % v[i] == 0) {\n\n      p /= v[i];\n\n      s.insert(v[i]);\n\n      mp[v[i]]++;\n    }\n  }\n\n  if (s.size() == 0) {\n\n    s.insert(P);\n\n    mp[P]++;\n  }\n\n  long long cnt = 1;\n\n  for (set<long long>::iterator it = s.begin(); it != s.end(); it++) {\n\n    if (mp[*it] >= n) {\n\n      for (int j = 0; j < mp[*it] / n; j++)\n        cnt *= *it;\n    }\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}"}
{"fast_code_id":"2c21d93f9c0edc79a2b7af8e04a9517694b05e5e176ea7eb383eaed2df8a5fe6","fast_id":"e25c97937e24a2fc62c9ac865aec761209ae391a7f4eb673d5763a4cf9d94d62","fast_time":0.069043703,"language":"cpp","measured_fast_code_id":"e25c97937e24a2fc62c9ac865aec761209ae391a7f4eb673d5763a4cf9d94d62","measured_slow_code_id":"7a0f625a1a70b60abcac7f013a45a30e1b9c5ce1932397fd7872eef7ca06536f","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76973","problem_id":"p00706","slow_code_id":"b40264d8d61ecdc9e9bcd716f271ee298c26ee35971277890ea014f6274e61fd","slow_id":"7a0f625a1a70b60abcac7f013a45a30e1b9c5ce1932397fd7872eef7ca06536f","slow_time":0.1829622157,"speedup":2.6499478989416314,"stratum":"2-4","sampling_key":"41a060967f340efc5fcb7370acdb2f85caba665e03ddac415b1e94c2eb7f950b","slow_code":"#include <iostream>\n\n#include <algorithm>\n\nusing namespace std;\n\nint dp[501][501];\n\nbool field[501][501];\n\nint main() {\n\n  for (int N; cin >> N, N;) {\n\n    fill(dp[0], dp[501], 0);\n\n    fill(field[0], field[501], 0);\n\n    int W, H;\n    cin >> W >> H;\n\n    while (N--) {\n\n      int X, Y;\n      cin >> X >> Y;\n\n      field[Y][X] = true;\n    }\n\n    for (int x = 1; x <= W; x++) {\n\n      for (int y = 1; y <= H; y++) {\n\n        dp[y][x] = dp[y - 1][x] + dp[y][x - 1] - dp[y - 1][x - 1] + field[y][x];\n      }\n    }\n\n    int S, T;\n    cin >> S >> T;\n\n    int res = 0;\n\n    for (int x = S; x <= W; x++) {\n\n      for (int y = T; y <= H; y++) {\n\n        res = max(res, dp[y][x] - dp[y - T][x] - dp[y][x - S] + dp[y - T][x - S]);\n      }\n    }\n\n    cout << res << endl;\n  }\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <cstring>\n\nusing namespace std;\n\nint main() {\n\n  while (true) {\n\n    int N;\n    cin >> N;\n\n    if (N == 0)\n      break;\n\n    int W, H;\n    cin >> W >> H;\n\n    int F[W][H];\n\n    memset(F, 0, sizeof(F));\n\n    for (int i = 0; i < N; ++i) {\n\n      int x, y;\n      cin >> x >> y;\n\n      x--, y--;\n\n      F[x][y] = 1;\n    }\n\n    int S, T;\n    cin >> S >> T;\n\n    int G[W + 1][H + 1];\n\n    memset(G, 0, sizeof(G));\n\n    for (int y = 1; y <= H; ++y) {\n\n      for (int x = 1; x <= W; ++x) {\n\n        G[x][y] = G[x - 1][y] + G[x][y - 1] - G[x - 1][y - 1] + F[x - 1][y - 1];\n      }\n    }\n\n    int ans = 0;\n\n    for (int y = T; y <= H; ++y) {\n\n      for (int x = S; x <= W; ++x) {\n\n        ans = max(ans, G[x][y] - G[x - S][y] - G[x][y - T] + G[x - S][y - T]);\n      }\n    }\n\n    cout << ans << endl;\n  }\n}"}
{"fast_code_id":"d7931185340b62c6b46e2eceacecce91f299fbbd5cc452be1deb570c5a06b6f4","fast_id":"5613a8953807478354391cb648e1ec2ce54a3641c86088ff65f33ac8b568e5e7","fast_time":0.0498871296,"language":"cpp","measured_fast_code_id":"5613a8953807478354391cb648e1ec2ce54a3641c86088ff65f33ac8b568e5e7","measured_slow_code_id":"785a909b76b6acf839e326941d0cf8e498d28395d045e6610518797d11b968b0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76974","problem_id":"p03958","slow_code_id":"a710cf30762cd4c995416842059b2d71ecdee6aa632e4919f9b7c8e31fbcd4b2","slow_id":"785a909b76b6acf839e326941d0cf8e498d28395d045e6610518797d11b968b0","slow_time":0.1781384582,"speedup":3.5708299841729114,"stratum":"2-4","sampling_key":"5851c430b3c04898f677da5fa1466d26c72cb853a2d2c149dbfef233ebf67998","slow_code":"#include <bits/stdc++.h>\n\n#define pb push_back\n\nusing namespace std;\n\nvoid debug_out() { cerr << '\\n'; }\n\ntemplate <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {\n  cerr << \" \" << H;\n  debug_out(T...);\n}\n\n#define dbg(...) cerr << #__VA_ARGS__ << \" ->\", debug_out(__VA_ARGS__)\n\n#define dbg_v(x, n)                                                                                \\\n  do {                                                                                             \\\n    cerr << #x \"[]: \";                                                                             \\\n    for (int _ = 0; _ < n; ++_)                                                                    \\\n      cerr << x[_] << \" \";                                                                         \\\n    cerr << '\\n';                                                                                  \\\n  } while (0)\n\n#define dbg_ok cerr << \"OK!\\n\"\n\ntypedef pair<int, int> pii;\n\ntypedef long long int ll;\n\ntypedef long double ld;\n\ninline int two(int n) { return 1 << n; }\n\ninline int test(int n, int pos) { return (bool)(n & two(pos)); }\n\ninline void set_bit(int &n, int b) { n |= two(b); }\n\ninline void unset_bit(int &n, int b) { n &= ~two(b); }\n\ninline int last_bit(int n) { return n & (-n); }\n\nconst int DMAX = 1e5 + 10;\n\nvector<int> vec;\n\nvector<int> arb[DMAX];\n\nstruct nume {\n\n  int node, val;\n};\n\nint V[DMAX];\n\npriority_queue<nume> heap;\n\nint n, ans;\n\ninline bool operator<(nume x, nume y) { return x.val < y.val; }\n\nint main() {\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int t, i, j, k, ant, cate;\n\n  cin >> k >> n;\n\n  for (i = 1; i <= n; i++) {\n\n    cin >> V[i];\n\n    heap.push({i, V[i]});\n  }\n\n  ant = 0;\n\n  nume var, var2;\n\n  cate = ans = 1;\n\n  while (!heap.empty()) {\n\n    var = heap.top();\n\n    heap.pop();\n\n    if (var.node != ant) {\n\n      ant = var.node;\n\n      if (var.val > 1)\n\n        heap.push({var.node, var.val - 1});\n\n      cate = 1;\n\n      continue;\n    }\n\n    if (heap.empty()) {\n\n      cate++;\n\n      ans = max(cate, ans);\n\n      if (var.val > 1)\n\n        heap.push({var.node, var.val - 1});\n\n      continue;\n    }\n\n    var2 = heap.top();\n\n    heap.pop();\n\n    ant = var.node;\n\n    cate = 1;\n\n    if (var2.val > 1)\n\n      heap.push({var2.node, var2.val - 1});\n\n    if (var.val > 1)\n\n      heap.push({var.node, var.val - 1});\n  }\n\n  cout << ans - 1 << '\\n';\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\n#define NMAX 1009\n\nusing namespace std;\n\nstruct tip {\n  int val;\n  int t;\n};\n\npriority_queue<tip> H;\n\nbool operator<(tip a, tip b)\n\n{\n\n  return a.val < b.val;\n}\n\nint i, n, h;\n\nint a[NMAX];\n\nint main()\n\n{\n  cin >> n >> h;\n\n  for (i = 1; i <= h; i++)\n\n  {\n\n    int x;\n\n    cin >> x;\n\n    H.push({x, i});\n  }\n\n  while (H.size() >= 2)\n\n  {\n\n    tip x, y;\n\n    x = H.top();\n\n    H.pop();\n\n    y = H.top();\n\n    H.pop();\n\n    if (n <= 2 * y.val)\n\n    {\n      cout << 0;\n      return 0;\n    }\n\n    else\n\n    {\n      n -= 2 * y.val;\n\n      x.val -= y.val;\n\n      if (x.val)\n\n        H.push(x);\n    }\n  }\n\n  if (H.size())\n\n    cout << H.top().val - 1;\n\n  else\n\n    cout << 0;\n\n  return 0;\n}\n"}
{"fast_code_id":"2df5c9b2d03cacf1221e48f296fa6d4d41ba54344f1cbdc80de2ecb3f2aa1f83","fast_id":"59e077185b3bb3eeab8147d48d5cf93ec7aeffe77df0b656be3c8282b58233d3","fast_time":0.1077726467,"language":"cpp","measured_fast_code_id":"59e077185b3bb3eeab8147d48d5cf93ec7aeffe77df0b656be3c8282b58233d3","measured_slow_code_id":"910c3bfa5c946d71b26c891259770be7ac1166784923274ecae9e562276763a9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_76993","problem_id":"p03165","slow_code_id":"48021726e18b9d0aa498f490a9a0bdcdaecf171004de4b56531235907d9003ee","slow_id":"910c3bfa5c946d71b26c891259770be7ac1166784923274ecae9e562276763a9","slow_time":0.6917132682,"speedup":6.418263718858823,"stratum":"4-8","sampling_key":"21674803055d7fd411e92c0d7ccb579f618ae6f053ba194e153bf57e4c4e0ce7","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define f first\n\n#define s second\n\n#define pb push_back\n\n#define mp make_pair\n\n#define ll long long int\n\ntypedef pair<int, int> pii;\n\nvector<int> v;\n\nmap<int, int> op;\n\n#define MAX 200005\n\nbool visited[MAX];\n\nvector<int> adj[MAX];\n\nconst int M = 1e9 + 7;\n\nint n, m;\n\nconst ll INF = 1LL << 60;\n\nstring lcs(string a, string b)\n\n{\n\n  int al = a.length(), bl = b.length();\n\n  int dp[al + 1][bl + 1];\n\n  for (int i = 0; i <= al; i++)\n\n  {\n\n    for (int j = 0; j <= bl; j++)\n\n    {\n\n      if (i == 0 || j == 0)\n\n        dp[i][j] = 0;\n\n      else if (a[i - 1] == b[j - 1])\n\n        dp[i][j] = dp[i - 1][j - 1] + 1;\n\n      else\n\n        dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n    }\n  }\n\n  int index = dp[al][bl];\n\n  string l = \"\";\n\n  int i = al, j = bl;\n\n  while (i > 0 && j > 0)\n\n  {\n\n    if (a[i - 1] == b[j - 1])\n\n    {\n\n      l += a[i - 1];\n\n      i--, j--, index--;\n\n    }\n\n    else if (dp[i - 1][j] > dp[i][j - 1]) {\n\n      i--;\n\n    }\n\n    else\n\n      j--;\n  }\n\n  reverse(l.begin(), l.end());\n\n  return l;\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n  cin.tie(NULL);\n\n  string a, b;\n\n  cin >> a >> b;\n\n  cout << lcs(a, b) << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define f first\n\n#define s second\n\n#define pb push_back\n\n#define ll long long\n\n#define MAX 200005\n\n#define mp make_pair\n\nconst int M = 1e9 + 7;\n\nconst int mod = 998244353;\n\ntypedef double ld;\n\nbool visited[MAX];\n\nll qpow(ll x, ll k, ll m) {\n  return k == 0 ? 1\n                : 1ll * qpow(1ll * x * x % m, k >> 1, m) * (k & 1 ? x : 1) % m;\n}\n\nll modinv(ll a, ll m) {\n  ll g = __gcd(a, m);\n  return (g == 1) ? qpow(a, m - 2, m) : -1;\n}\n\nstring lcs(string a, string b)\n\n{\n\n  int n = a.size(), m = b.size();\n\n  int dp[n + 1][m + 1];\n\n  for (int i = 0; i <= n; i++)\n\n  {\n\n    for (int j = 0; j <= m; j++)\n\n    {\n\n      if (i == 0 || j == 0)\n\n        dp[i][j] = 0;\n\n      else if (a[i - 1] == b[j - 1])\n\n        dp[i][j] = dp[i - 1][j - 1] + 1;\n\n      else\n\n        dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n    }\n  }\n\n  string ans = \"\";\n\n  int i = n, j = m;\n\n  while (i > 0 && j > 0)\n\n  {\n\n    if (a[i - 1] == b[j - 1])\n\n    {\n\n      ans += a[i - 1];\n\n      i--, j--;\n\n    }\n\n    else\n\n    {\n\n      if (dp[i][j - 1] > dp[i - 1][j])\n\n        j--;\n\n      else\n\n        i--;\n    }\n  }\n\n  reverse(ans.begin(), ans.end());\n\n  return ans;\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n  cin.tie(NULL);\n\n  string a, b;\n\n  cin >> a >> b;\n\n  cout << lcs(a, b) << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"920b0e9f15d541d6b3f3bc5a308755e49b93f1919dee119b54d6977d93dc2065","fast_id":"0afff6ad14fe13442b71e6c0728a49e454412fab181ed51d0a54114208bbeed0","fast_time":0.1037237421,"language":"cpp","measured_fast_code_id":"0afff6ad14fe13442b71e6c0728a49e454412fab181ed51d0a54114208bbeed0","measured_slow_code_id":"12199f213ed1f9c5eb82fe9add6a61be6586b9e9bab1548115e4b49f73f5c7a5","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77047","problem_id":"p02556","slow_code_id":"e7b2c0f8f28b2f0ba4e3fecbd43f4d89164583c19784c96a1d892b4ec8b8ddf6","slow_id":"12199f213ed1f9c5eb82fe9add6a61be6586b9e9bab1548115e4b49f73f5c7a5","slow_time":0.7958659437,"speedup":7.67293897797002,"stratum":"4-8","sampling_key":"edb5cfb1fe0c1cbf96a2a4162d7f608fc6832085e19d0871f9dab50a2ba31110","slow_code":"#include <bits/stdc++.h>\n\n\n\nusing namespace std;\n\nconst int mod = 1e9+7;\n\nint add(int a, int b) {\n\nreturn a + b < mod ? a + b : a + b - mod;\n\n}\n\nint mul(int a, int b) {\n\nreturn int(1LL * a * b % mod);\n\n}\n\nint fexp(int b, int e = mod - 2) {\n\n  int ans = 1;\n\n  while(e) {\n\n    if(e & 1) ans = mul(ans, b);\n\n    b = mul(b, b);\n\n    e /= 2;\n\n  }\n\n  return ans;\n\n}\n\n\n\nusing ll = long long;\n\nconst ll oo = 1e18;\n\n\n\nconst int N = 200005;\n\n\n\nstruct Segtree {\n\n  ll st[2 * N];\n\n  int n;\n\n\n\n  ll query(int l, int r){          \n\n    ll ans = -oo;\n\n    for(l += n, r += n+1; l < r; l >>= 1, r >>= 1){\n\n      if(l & 1) ans = max(ans, st[l++]);\n\n      if(r & 1) ans = max(ans, st[--r]);\n\n    }\n\n    return ans;\n\n  }\n\n\n\n  void build() {\n\n    for(int i = 0; i < 2 * N; i++) st[i] = -oo;\n\n  }\n\n\n\n  void update(int p, ll val){\n\n    p += n;\n\n    st[p] = max(st[p], val);\n\n    while(p >>= 1) st[p] = max(st[2*p], st[2*p+1]);\n\n  }\n\n} up, down;\n\n\n\nint n;\n\nll x[N], y[N];\n\nll compr[N];\n\n\n\nint gety(ll val) {\n\nreturn int(lower_bound(compr, compr + n, val) - compr);\n\n}\n\nint id[N];\n\n\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  up.n = down.n = n;\n\n  up.build(), down.build();\n\n\n\n  for(int i = 0; i < n; i++) {\n\n    scanf(\"%lld %lld\", x + i, y + i);\n\n    compr[i] = y[i];\n\n    id[i] = i;\n\n  }\n\n  sort(compr, compr + n);\n\n\n\n  sort(id, id + n, [](int i, int j) {\n\n    if(x[i] != x[j]) return x[i] < x[j];\n\n    return y[i] < y[j];\n\n  });\n\n\t\n\n  ll ans = 0;\n\n\n\n  for(int w = 0; w < n; w++) {\n\n    int i = id[w];\n\n\n\n    int me = gety(y[i]);\n\n\n\n    ans = max(ans, up.query(me, n - 1) + x[i] - y[i]);\n\n    ans = max(ans, down.query(0, me) + x[i] + y[i]);\n\n\n\n    up.update(me, y[i] - x[i]);\n\n    down.update(me, -y[i] - x[i]);\n\n  }\n\n\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n\n\n\n  for(int i = 0; i < n; i++) for(int j = i + 1; j < n; j++) {\n\n      ll tmp = abs(x[i] - x[j]) + abs(y[i] - y[j]);\n\n      if(tmp > ans) {\n\n        printf(\"%d(%lld %lld) %d(%lld %lld)\\n\", i, x[i], y[i], j, x[j], y[j]);\n\n        assert(0);\n\n      }\n\n    }\n\n\n\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 200005;\n\nstruct vec {\n\n  int x, y;\n\n  int operator*(const vec &o) const { return x * o.x + y * o.y; }\n\n  int dist(const vec &o) const { return abs(x - o.x) + abs(y - o.y); }\n\n} pt[N];\n\nint n;\n\nint main() {\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++) {\n\n    scanf(\"%d %d\", &pt[i].x, &pt[i].y);\n  }\n\n  array<vec, 4> best{pt[0], pt[0], pt[0], pt[0]};\n\n  for (int i = 0; i < n; i++) {\n\n    int id = 0;\n\n    for (int j : {-1, 1})\n      for (int k : {-1, 1}) {\n\n        vec tmp{j, k};\n\n        if (tmp * pt[i] > tmp * best[id])\n          best[id] = pt[i];\n\n        id++;\n      }\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i < 4; i++)\n    for (int j = i + 1; j < 4; j++) {\n\n      ans = max(ans, best[i].dist(best[j]));\n    }\n\n  printf(\"%d\\n\", ans);\n}\n"}
{"fast_code_id":"4a7155c18f5fabf4737cf5a0b25f463607cbf485bf50f6052bcae3b62ac75745","fast_id":"8f58eeb493a50c6db880e65cba8b121caf7425760f2f630e0bac6e2e1c62a1bc","fast_time":0.0826210451,"language":"cpp","measured_fast_code_id":"8f58eeb493a50c6db880e65cba8b121caf7425760f2f630e0bac6e2e1c62a1bc","measured_slow_code_id":"26b864cd0dba1f6c7cdbe7479e3266352f5e0a0776317568673787225c7e4c80","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77063","problem_id":"p02868","slow_code_id":"a673e07899818d10bf407d268dbac74be86c615ebc4ecc7d4f992dc1f46a3d73","slow_id":"26b864cd0dba1f6c7cdbe7479e3266352f5e0a0776317568673787225c7e4c80","slow_time":0.5773456861,"speedup":6.987876822439275,"stratum":"4-8","sampling_key":"5409ad194936a687af2e6dffee53f6740e5e26b0bf60d0c203123aba533382a6","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 110000;\n\nconst long long INF = 1LL << 60;\n\nint L[N], R[N], C[N];\n\nlong long val[N];\n\nvector<int> st[N], en[N];\n\nset<pair<long long, int>> S;\n\nint main() {\n\n  ios::sync_with_stdio(0);\n\n  cin.tie(0), cout.tie(0);\n\n  int n, m;\n  cin >> n >> m;\n\n  for (int i = 1; i <= m; i++) {\n\n    cin >> L[i] >> R[i] >> C[i];\n\n    st[L[i]].push_back(i);\n\n    en[R[i]].push_back(i);\n  }\n\n  for (int i = 1; i <= n; i++)\n    val[i] = INF;\n\n  val[1] = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    if (S.size())\n      val[i] = min(val[i], S.begin()->first);\n\n    for (auto it : st[i])\n      S.emplace(val[L[it]] + C[it], it);\n\n    for (auto it : en[i])\n      S.erase(make_pair(val[L[it]] + C[it], it));\n  }\n\n  if (val[n] == INF)\n    cout << \"-1\\n\";\n\n  else\n    cout << val[n] << \"\\n\";\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntypedef pair<ll, int> li;\n\ntypedef pair<int, ll> il;\n\ntypedef vector<il> vil;\n\ntypedef vector<int> vi;\n\ntypedef pair<int, int> ii;\n\ntypedef vector<ii> vii;\n\nvector<vil> graph;\n\nvector<ll> dist;\n\nvoid dijkstra()\n\n{\n\n  dist[1] = 0ll;\n\n  priority_queue<li, vector<li>, greater<li> > pq;\n\n  pq.push(li(0ll, 1));\n\n  while (!pq.empty())\n\n  {\n\n    li x = pq.top();\n    pq.pop();\n\n    ll a = x.first;\n\n    int b = x.second;\n\n    if (dist[b] == a)\n\n    {\n\n      for (int i = 0; i < graph[b].size(); ++i)\n\n      {\n\n        il c = graph[b][i];\n\n        if (dist[c.first] == -1 || dist[c.first] > dist[b] + c.second)\n\n        {\n\n          dist[c.first] = dist[b] + c.second;\n\n          pq.push(li(dist[c.first], c.first));\n        }\n      }\n    }\n  }\n}\n\nint main()\n\n{\n\n  int n, m, i, x, y;\n\n  ll w;\n\n  cin >> n >> m;\n\n  graph.assign(n + 1, vil());\n\n  dist.assign(n + 1, -1);\n\n  for (i = 1; i <= n; ++i)\n\n  {\n\n    graph[i].push_back(il(i - 1, 0ll));\n  }\n\n  for (i = 1; i <= m; ++i)\n\n  {\n\n    cin >> x >> y >> w;\n\n    graph[x].push_back(il(y, w));\n\n    graph[y].push_back(il(x, w));\n  }\n\n  dijkstra();\n\n  printf(\"%lld\", dist[n]);\n}"}
{"fast_code_id":"656754dba3234fb8c2a96a84889dbba0829cb618974927ab4254092add6f384d","fast_id":"36f19a08f34e80fbf6b425402c8aec535033a01fabcb9b9512888c1350bb3b86","fast_time":0.0184122699,"language":"cpp","measured_fast_code_id":"36f19a08f34e80fbf6b425402c8aec535033a01fabcb9b9512888c1350bb3b86","measured_slow_code_id":"18c44b609b6fbd196941921e21a0f2ce38f86053e80b6c7e01c1a85fb09d4d1b","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77129","problem_id":"p02683","slow_code_id":"59507fea336c38b9702ee6f6bd50157e7baa29fe189542b260334eaca0933cf1","slow_id":"18c44b609b6fbd196941921e21a0f2ce38f86053e80b6c7e01c1a85fb09d4d1b","slow_time":0.8706323632,"speedup":47.28544432210393,"stratum":"8+","sampling_key":"69389cf14b59df3683057e5934ea4ecf2c2fc82fc1f482404bd3694fd79cd1a6","slow_code":"#include <iostream>\n\n#include <string>\n\n#include <cstdio>\n\n#include <vector>\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <iomanip>\n\n#include <queue>\n\n#include <ciso646>\n\n#include <random>\n\n#include <map>\n\n#include <set>\n\n#include <bitset>\n\n#include <stack>\n\n#include <unordered_map>\n\n#include <utility>\n\n#include <cassert>\n\n#include <complex>\n\n#include <numeric>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ul;\n\ntypedef unsigned int ui;\n\nconstexpr ll mod = 998244353;\n\nconst ll INF = mod * mod;\n\ntypedef pair<int, int> P;\n\n#define stop                                                                   \\\n  char nyaa;                                                                   \\\n  cin >> nyaa;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define per(i, n) for (int i = n - 1; i >= 0; i--)\n\n#define Rep(i, sta, n) for (int i = sta; i < n; i++)\n\n#define rep1(i, n) for (int i = 1; i <= n; i++)\n\n#define per1(i, n) for (int i = n; i >= 1; i--)\n\n#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)\n\n#define all(v) (v).begin(), (v).end()\n\ntypedef pair<ll, ll> LP;\n\ntypedef long double ld;\n\ntypedef pair<ld, ld> LDP;\n\nconst ld eps = 1e-12;\n\nconst ld pi = acos(-1.0);\n\nstruct modint {\n\n  ll n;\n\n  modint() : n(0) { ; }\n\n  modint(ll m) : n(m) {\n\n    if (n >= mod)\n      n %= mod;\n\n    else if (n < 0)\n      n = (n % mod + mod) % mod;\n  }\n\n  operator int() { return n; }\n};\n\nbool operator==(modint a, modint b) { return a.n == b.n; }\n\nmodint operator+=(modint &a, modint b) {\n  a.n += b.n;\n  if (a.n >= mod)\n    a.n -= mod;\n  return a;\n}\n\nmodint operator-=(modint &a, modint b) {\n  a.n -= b.n;\n  if (a.n < 0)\n    a.n += mod;\n  return a;\n}\n\nmodint operator*=(modint &a, modint b) {\n  a.n = ((ll)a.n * b.n) % mod;\n  return a;\n}\n\nmodint operator+(modint a, modint b) { return a += b; }\n\nmodint operator-(modint a, modint b) { return a -= b; }\n\nmodint operator*(modint a, modint b) { return a *= b; }\n\nmodint operator^(modint a, int n) {\n\n  if (n == 0)\n    return modint(1);\n\n  modint res = (a * a) ^ (n / 2);\n\n  if (n % 2)\n    res = res * a;\n\n  return res;\n}\n\nll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }\n\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\nconst int max_n = 1 << 19;\n\nmodint fact[max_n], factinv[max_n];\n\nvoid init_f() {\n\n  fact[0] = modint(1);\n\n  for (int i = 0; i < max_n - 1; i++) {\n\n    fact[i + 1] = fact[i] * modint(i + 1);\n  }\n\n  factinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\n  for (int i = max_n - 2; i >= 0; i--) {\n\n    factinv[i] = factinv[i + 1] * modint(i + 1);\n  }\n}\n\nmodint comb(int a, int b) {\n\n  if (a < 0 || b < 0 || a < b)\n    return 0;\n\n  return fact[a] * factinv[b] * factinv[a - b];\n}\n\nvoid solve() {\n\n  int n, m;\n  cin >> n >> m;\n\n  vector<vector<int>> a(n, vector<int>(m));\n\n  vector<int> c(n);\n\n  int x;\n  cin >> x;\n\n  rep(i, n) {\n\n    cin >> c[i];\n\n    rep(j, m) cin >> a[i][j];\n  }\n\n  int ans = mod;\n\n  rep(i, (1 << n)) {\n\n    int cost = 0;\n\n    rep(j, n) if (i & (1 << j)) cost += c[j];\n\n    vector<int> s(m);\n\n    rep(j, n) rep(k, m) {\n\n      if (i & (1 << j)) {\n\n        s[k] += a[j][k];\n      }\n    }\n\n    bool valid = true;\n\n    rep(k, m) if (s[k] < x) valid = false;\n\n    if (valid) {\n\n      ans = min(ans, cost);\n    }\n  }\n\n  if (ans == mod)\n    ans = -1;\n\n  cout << ans << \"\\n\";\n}\n\nsigned main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  solve();\n\n  stop\n\n      return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nint n, m, x;\n\nint c[15], a[15][15], b[15], d[15], len, sum = 100000000, cost;\n\nvoid dfs(int step) {\n\n  int i, j, k;\n\n  if (step == len + 1) {\n\n    for (k = 1; k <= m; k++)\n      d[k] = 0;\n\n    for (j = 1; j <= len; j++)\n\n      for (k = 1; k <= m; k++)\n\n        d[k] += a[b[j]][k];\n\n    for (k = 1; k <= m; k++)\n\n      if (d[k] < x)\n        return;\n\n    cost = 0;\n\n    for (j = 1; j <= len; j++)\n      cost += c[b[j]];\n\n    sum = min(sum, cost);\n\n    return;\n  }\n\n  for (i = b[step - 1] + 1; i <= n; i++)\n\n    b[step] = i, dfs(step + 1);\n}\n\nint main() {\n\n  int i, j;\n\n  scanf(\"%d%d%d\", &n, &m, &x);\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &c[i]);\n\n    for (j = 1; j <= m; j++)\n\n      scanf(\"%d\", &a[i][j]);\n  }\n\n  for (len = 1; len <= n; len++)\n\n    b[0] = 0, dfs(1);\n\n  if (sum == 100000000)\n    printf(\"-1\\n\");\n\n  else\n    printf(\"%d\\n\", sum);\n\n  return 0;\n}"}
{"fast_code_id":"f096ccdabe9d8ee650a1727965f3d4ebe70fe8f2c66a68e05004fc62e08c74b2","fast_id":"c9df809d382400ccf6202a1e72db1330d5d4d2e495b133736dcaff447f792ce5","fast_time":0.1008669782,"language":"cpp","measured_fast_code_id":"c9df809d382400ccf6202a1e72db1330d5d4d2e495b133736dcaff447f792ce5","measured_slow_code_id":"db0a04cf71d56ae55cf730dc2d7d9863170db48de1e8ad34e57f662879ba6719","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77138","problem_id":"p03944","slow_code_id":"d87cce48d74034ac89af42bce25586ce4098387a08dc1f51803f81cf2cdd4128","slow_id":"db0a04cf71d56ae55cf730dc2d7d9863170db48de1e8ad34e57f662879ba6719","slow_time":0.6480837,"speedup":6.425132501887521,"stratum":"4-8","sampling_key":"831c68f59c0a0a3ecd2e954af41badeed9dd3409bc5bb82d5946c1b322baae44","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 200005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nint main()\n\n{\n\n  int x1, y1, x2, y2, n, a, b, c;\n\n  x1 = 0, y1 = 0;\n\n  cin >> x2 >> y2;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    cin >> a >> b >> c;\n\n    if (c == 1)\n\n    {\n\n      if (a > x1)\n\n      {\n\n        x1 = a;\n      }\n\n    }\n\n    else if (c == 2)\n\n    {\n\n      if (a < x2)\n\n      {\n\n        x2 = a;\n      }\n\n    }\n\n    else if (c == 3)\n\n    {\n\n      if (b > y1)\n\n      {\n\n        y1 = b;\n      }\n\n    }\n\n    else if (c == 4)\n\n    {\n\n      if (b < y2)\n\n      {\n\n        y2 = b;\n      }\n    }\n  }\n\n  int p = x2 - x1;\n\n  int q = y2 - y1;\n\n  if (p <= 0 || q <= 0)\n    cout << 0;\n\n  else\n    cout << p * q;\n}\n","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<long long, long long> pll;\n\n#define ff first\n\n#define ss second\n\n#define mp make_pair\n\n#define pb push_back\n\n#define all(x) (x).begin(), (x).end()\n\n#define FastIO                                                                 \\\n  ios_base::sync_with_stdio(false);                                            \\\n  cin.tie(0);                                                                  \\\n  cout.tie(0);\n\n#define reset(x) memset(x, -1, sizeof(x))\n\n#define CheckBit(a, b) (a & (1ll << b))\n\n#define SetBit(a, b) a = (a | (1ll << b))\n\n#define UnSetBit(a, b) a = (a & (~(1ll << b)))\n\n#define maxx 10000006\n\n#define PI 2 * acos(0.0)\n\nconst long long INF = 2000000000000000000LL;\n\nconst int inf = 0x3f3f3f3f;\n\nconst long double EPS = 1e-9;\n\ninline ll mulmod(ll a, ll b, ll c) {\n\n  ll ret = 0, cur = a % c;\n\n  while (b) {\n    if (b % 2)\n      ret = (ret + cur) % c;\n    cur = (cur << 1) % c;\n    b = b >> 1;\n  }\n\n  return ret % c;\n}\n\ninline ll bigmod(ll b, ll p, ll m) {\n\n  ll ret = 1, cur = b % m;\n\n  while (p) {\n    if (p & 1)\n      ret = (ret * cur) % m;\n    cur = (cur * cur) % m;\n    p = p >> 1;\n  }\n\n  return ret;\n}\n\ninline ll modulo(ll a, ll b, ll c) {\n\n  ll ret = 1, cur = a % c;\n\n  while (b) {\n    if (b % 2)\n      ret = mulmod(ret, cur, c);\n    cur = mulmod(cur, cur, c);\n    b = b >> 1;\n  }\n\n  return ret % c;\n}\n\ninline ll power(ll b, ll p) {\n\n  ll ret = 1, cur = b;\n\n  while (p) {\n    if (p & 1)\n      ret = (ret * cur);\n    cur = (cur * cur);\n    p = p >> 1;\n  }\n\n  return ret;\n}\n\nll lcm(ll a, ll b)\n\n{\n\n  return (a / __gcd(a, b)) * b;\n}\n\nll gcd(ll a, ll b)\n\n{\n\n  return __gcd(a, b);\n}\n\nll matrix[200][200];\n\nvoid Dufaux()\n\n{\n\n  ll w, h, n;\n\n  cin >> w >> h >> n;\n\n  for (int i = 1; i <= n; i++) {\n\n    ll x, y, a;\n\n    cin >> x >> y >> a;\n\n    if (a == 1) {\n\n      for (int i = 0; i <= x; i++) {\n\n        for (int j = 0; j <= h; j++) {\n\n          matrix[i][j] = 1;\n        }\n      }\n\n    }\n\n    else if (a == 2) {\n\n      for (int i = x + 1; i <= w; i++) {\n\n        for (int j = 0; j <= h; j++) {\n\n          matrix[i][j] = 1;\n        }\n      }\n\n    }\n\n    else if (a == 3) {\n\n      for (int i = 0; i <= w; i++) {\n\n        for (int j = 0; j <= y; j++) {\n\n          matrix[i][j] = 1;\n        }\n      }\n\n    }\n\n    else {\n\n      for (int i = 0; i <= w; i++) {\n\n        for (int j = y + 1; j <= h; j++) {\n\n          matrix[i][j] = 1;\n        }\n      }\n    }\n  }\n\n  ll cnt = 0;\n\n  for (int i = 1; i <= w; i++) {\n\n    for (int j = 1; j <= h; j++) {\n\n      if (matrix[i][j] == 0)\n        cnt++;\n    }\n  }\n\n  cout << cnt << endl;\n}\n\nint main()\n\n{\n\n  FastIO;\n\n  int test = 1;\n\n  while (test--) {\n\n    Dufaux();\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"1d3e2a1c2042d4891633f6d4389020d174e1b6ed8995798cc69cca7b44c70403","fast_id":"dc6438d709e788d64fea1028f412f1b53e6e4924163a59224792e19a887e8c1d","fast_time":0.0001919663,"language":"cpp","measured_fast_code_id":"dc6438d709e788d64fea1028f412f1b53e6e4924163a59224792e19a887e8c1d","measured_slow_code_id":"4b882b9d8f461d44d4d0a73720e1d534339d0885f973f2368fc9754558e9c2dc","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77144","problem_id":"p03276","slow_code_id":"f25da6ae7e5b6e2660fc8fcfe59497310ffedce4301fbca3114d5502fd24d603","slow_id":"4b882b9d8f461d44d4d0a73720e1d534339d0885f973f2368fc9754558e9c2dc","slow_time":0.0010077021,"speedup":5.2493698112637475,"stratum":"4-8","sampling_key":"0a8e6d99b299dd57c1e7350ba78cb5913684253fa2a672e50e7a04bb02b366b6","slow_code":"#include <bits/stdc++.h>\n\ntypedef long long ll;\n\nusing namespace std;\n\nconst int N = 1e5 + 7;\n\nconst ll mod = 1e9 + 7;\n\nint a[N];\n\nint n, k, ans, now;\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &k);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%d\", &a[i]);\n\n  if (a[n] <= 0) {\n\n    ans = -a[n + 1 - k];\n\n  }\n\n  else if (a[1] >= 0) {\n\n    ans = a[k];\n\n  }\n\n  else {\n\n    ans = 1e9;\n\n    int m;\n\n    for (int i = 1; i <= n; i++) {\n\n      if (a[i] >= 0) {\n\n        m = i;\n        break;\n      }\n    }\n\n    for (int i = max(1, m - k); i <= min(m, n + 1 - k); i++) {\n\n      now = a[i + k - 1] - a[i];\n\n      if (a[i + k - 1] <= 0) {\n\n        ans = min(ans, now - a[i + k - 1]);\n\n      }\n\n      else if (a[i] >= 0) {\n\n        ans = min(ans, now + a[i]);\n\n      }\n\n      else {\n\n        ans = min(ans, now - a[i]);\n\n        ans = min(ans, now + a[i + k - 1]);\n      }\n    }\n  }\n\n  printf(\"%d\\n\", ans);\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\nconst int maxn = 1e5 + 7;\n\nint a[maxn];\n\nint main() {\n\n  int n, k;\n\n  scanf(\"%d%d\", &n, &k);\n\n  int cnt = -1;\n\n  for (int i = 0; i < n; ++i) {\n\n    scanf(\"%d\", &a[i]);\n\n    if (a[i] >= 0 && cnt == -1) {\n\n      cnt = i;\n    }\n  }\n\n  if (cnt == -1) {\n\n    printf(\"%d\\n\", -a[n - k]);\n\n    return 0;\n\n  }\n\n  else if (cnt == 0) {\n\n    printf(\"%d\\n\", a[k - 1]);\n\n    return 0;\n  }\n\n  int ans = 2e9;\n\n  if (cnt - k >= 0) {\n\n    ans = min(ans, -a[cnt - k]);\n  }\n\n  if (cnt + k - 1 < n) {\n\n    ans = min(ans, a[cnt + k - 1]);\n  }\n\n  for (int i = 1; i < k; ++i) {\n\n    if (cnt - i < 0 || cnt + k - i - 1 >= n)\n\n      continue;\n\n    ans = min(ans, -2 * a[cnt - i] + a[cnt + k - i - 1]);\n  }\n\n  for (int i = 1; i < k; ++i) {\n\n    if (cnt + i - 1 >= n || cnt - k + i < 0)\n\n      continue;\n\n    ans = min(ans, 2 * a[cnt + i - 1] - a[cnt - k + i]);\n  }\n\n  printf(\"%d\\n\", ans);\n}\n"}
{"fast_code_id":"52d43f27ccd711df3db96ef77ab97c88090224c4015067a64081d8ed7f087493","fast_id":"71817fe5bdd8bfe0cb83cc54cb5c1fad68eb02dd1e81518858fa5b80ff59c049","fast_time":0.0181061183,"language":"cpp","measured_fast_code_id":"71817fe5bdd8bfe0cb83cc54cb5c1fad68eb02dd1e81518858fa5b80ff59c049","measured_slow_code_id":"920a569e023b952c75d474e2846f7b1ddcf2344d9d8773535550706e8071ff45","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77150","problem_id":"p00958","slow_code_id":"f4ca05e4ffda0ed37138a52d96d46aefd03a3b449fd188bf82d6282202834b2d","slow_id":"920a569e023b952c75d474e2846f7b1ddcf2344d9d8773535550706e8071ff45","slow_time":0.0972277598,"speedup":5.369884267242416,"stratum":"4-8","sampling_key":"5db981433873748311396b01a63a6cea752bd3476b607401a333e740ab2b3b49","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <stack>\n\n#include <cstring>\n\n#include <queue>\n\n#include <set>\n\nusing namespace std;\n\nconst int maxN = 110;\n\n#define FORU(i, l, r) for (int i = l; i <= r; ++i)\n\n#define FORD(i, r, l) for (int i = r; i >= l; --i)\n\n#define REPU(i, r) for (int i = 0; i < r; ++i)\n\n#define F first\n\n#define S second\n\n#define PB push_back\n\n#define LL long long\n\n#define BIT(x, i) ((x >> i) & 1)\n\nint res, m, x[maxN], y[maxN];\n\nvector<int> idx1, idx2, idx;\n\nset<int> mset;\n\ndouble get_slope(int i, int j) {\n\n  return (x[i] == x[j] ? -1 : (1.0 * (y[i] - y[j])) / (x[i] - x[j]));\n}\n\nint cmp_slope(int i, int j) {\n\n  if (x[idx1[i]] == x[idx2[i]] &&\n\n      x[idx1[j]] == x[idx2[j]])\n    return 0;\n\n  if (x[idx1[i]] == x[idx2[i]])\n    return -1;\n\n  if (x[idx1[j]] == x[idx2[j]])\n    return 1;\n\n  int dxi = x[idx1[i]] - x[idx2[i]], dyi = y[idx1[i]] - y[idx2[i]];\n\n  int dxj = x[idx1[j]] - x[idx2[j]], dyj = y[idx1[j]] - y[idx2[j]];\n\n  if (dxi < 0)\n    dxi *= (-1), dyi *= (-1);\n\n  if (dxj < 0)\n    dxj *= (-1), dyj *= (-1);\n\n  if (dyi * dxj == dyj * dxi)\n    return 0;\n\n  if (dyi * dxj < dyj * dxi)\n    return -1;\n\n  return 1;\n}\n\nbool cmp(int i, int j) { return (cmp_slope(i, j) == -1); }\n\nvoid solve(int t) {\n\n  if (t > (m / 2)) {\n\n    idx.clear();\n\n    REPU(i, idx1.size()) idx.PB(i);\n\n    sort(idx.begin(), idx.end(), cmp);\n\n    int num = 0, tmp = 0;\n\n    REPU(t, idx.size()) {\n\n      if (t && cmp_slope(idx[t], idx[t - 1]) != 0) {\n\n        tmp += (num * (num - 1)) / 2;\n\n        num = 0;\n      }\n\n      ++num;\n    }\n\n    tmp += (num * (num - 1)) / 2;\n\n    res = max(res, tmp);\n\n    return;\n  }\n\n  vector<int> arr;\n  arr.clear();\n\n  for (auto i : mset)\n    arr.PB(i);\n\n  idx1.PB(arr[0]);\n\n  mset.erase(arr[0]);\n\n  FORU(i, 1, arr.size() - 1) {\n\n    idx2.PB(arr[i]);\n\n    mset.erase(arr[i]);\n\n    solve(t + 1);\n\n    mset.insert(arr[i]);\n\n    idx2.pop_back();\n  }\n\n  mset.insert(arr[0]);\n\n  idx1.pop_back();\n}\n\nint main() {\n\n  cin >> m;\n\n  FORU(i, 1, m) {\n\n    cin >> x[i] >> y[i];\n\n    mset.insert(i);\n  }\n\n  solve(1);\n\n  cout << res << endl;\n}\n","fast_code":"#include <cstdio>\n\n#define LL long long\n\nusing namespace std;\n\nint m, cnt;\n\nint ans;\n\nstruct poi {\n\n  int x, y;\n\n  poi() {}\n\n  poi(int xx, int yy) {\n\n    x = xx;\n\n    y = yy;\n  }\n\n  void read() { scanf(\"%d%d\", &x, &y); }\n\n  friend poi operator-(poi a, poi b) { return poi(a.x - b.x, a.y - b.y); }\n\n  friend int operator^(poi a, poi b) { return a.x * b.y - a.y * b.x; }\n\n} p[20], s[10];\n\nbool flag[20];\n\nvoid work() {\n\n  int fst = 0;\n\n  for (fst = 1; fst <= m; fst++)\n    if (flag[fst] == 0) {\n\n      flag[fst] = 1;\n\n      break;\n    }\n\n  if (fst > m) {\n\n    int res = 0;\n\n    for (int i = 1; i <= m / 2; i++)\n      for (int j = i + 1; j <= m / 2; j++) {\n\n        if ((s[i] ^ s[j]) == 0)\n          res++;\n\n        if (res > ans)\n          ans = res;\n      }\n\n    return;\n  }\n\n  for (int i = fst + 1; i <= m; i++)\n    if (!flag[i]) {\n\n      s[++cnt] = p[i] - p[fst];\n\n      flag[i] = 1;\n\n      work();\n\n      flag[i] = 0;\n\n      cnt--;\n    }\n\n  flag[fst] = 0;\n}\n\nint main() {\n\n  scanf(\"%d\", &m);\n\n  for (int i = 1; i <= m; i++)\n    p[i].read();\n\n  work();\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"d0eecd5a37487ca7843f313f6a5b81f8ca1d0ec1c613d9f3fdb339e68058097e","fast_id":"fa9577e02b739b39607c1c2fc9439a706974b2fcf73499645b1713529e3f6509","fast_time":0.0113117141,"language":"cpp","measured_fast_code_id":"fa9577e02b739b39607c1c2fc9439a706974b2fcf73499645b1713529e3f6509","measured_slow_code_id":"37b8cf82240219b7ebbe46f539126f5df404a5516bba7cada44b2e97197b2dfb","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77160","problem_id":"p03859","slow_code_id":"56ac9baae880e396d32fbc5488fda32e81695f096fc6264f90b9976bbfc1f9ac","slow_id":"37b8cf82240219b7ebbe46f539126f5df404a5516bba7cada44b2e97197b2dfb","slow_time":0.0551394283,"speedup":4.874542249967226,"stratum":"4-8","sampling_key":"42720e65a00a22eeaac9429af326837b06c190f945e47e2c701ab42024d2181a","slow_code":"#include <cctype>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define rep(i, x, y) for (int i = x; i <= y; ++i)\n\n#define repd(i, x, y) for (int i = x; i >= y; --i)\n\nint get()\n\n{\n\n  char c;\n\n  while (!isdigit(c = getchar()))\n    ;\n\n  int k = c - '0';\n\n  for (; isdigit(c = getchar()); k = k * 10 + c - '0')\n    ;\n\n  return k;\n}\n\nusing namespace std;\n\nconst int N = 1e5 + 10, mod = 1e9 + 7;\n\nchar s[N];\n\nint n, m, ans, fac[N], ifac[N], l[N], r[N], f[2][N], a[N];\n\nint inv(int x)\n\n{\n\n  return x > 1 ? 1ll * (mod - mod / x) * inv(mod % x) % mod : 1;\n}\n\nint c(int n, int m)\n\n{\n\n  return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod;\n}\n\nint main()\n\n{\n\n  n = get(), m = get();\n\n  fac[0] = 1;\n\n  rep(i, 1, n)\n\n      fac[i] = 1ll * fac[i - 1] * i % mod;\n\n  ifac[n] = inv(fac[n]);\n\n  repd(i, n, 1)\n\n      ifac[i - 1] = 1ll * ifac[i] * i % mod;\n\n  scanf(\"%s\", s + 1);\n\n  rep(i, 1, n)\n\n      a[i] = a[i - 1] + s[i] - 48;\n\n  int t = 0;\n\n  rep(i, 1, m)\n\n  {\n\n    int x = get(), y = get();\n\n    if (x == l[t])\n\n      r[t] = max(r[t], y);\n\n    else if (y > r[t])\n\n      ++t, l[t] = x, r[t] = y;\n  }\n\n  m = t, l[m + 1] = n + 1, f[0][0] = 1;\n\n  rep(i, 1, m)\n\n  {\n\n    int w = a[r[i]] - a[max(l[i] - 1, r[i - 1])];\n\n    int s = min(r[i], l[i + 1] - 1) - l[i] + 1;\n\n    int mx = r[i] - l[i] + 1 - s;\n\n    memset(f[i & 1], 0, sizeof(f[i & 1]));\n\n    rep(j, 0, s)\n\n        rep(k, max(0, w - j), mx)\n\n            f[i & 1][k] = (f[i & 1][k] + 1ll * f[(i & 1) ^ 1][j + k - w] * c(s, j)) % mod;\n  }\n\n  rep(i, 0, n)\n\n      ans = (ans + f[m & 1][i]) % mod;\n\n  printf(\"%d\", ans);\n\n  return 0;\n}","fast_code":"#include <cctype>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#define rep(i, x, y) for (int i = x; i <= y; ++i)\n\n#define repd(i, x, y) for (int i = x; i >= y; --i)\n\nint get()\n\n{\n\n  char c;\n\n  while (!isdigit(c = getchar()))\n    ;\n\n  int k = c - '0';\n\n  for (; isdigit(c = getchar()); k = k * 10 + c - '0')\n    ;\n\n  return k;\n}\n\nusing namespace std;\n\nconst int N = 3010, mod = 1e9 + 7;\n\nchar s[N];\n\nint n, m, ans, c[N][N], l[N], r[N], lb[N], rb[N], f[N][N], a[N];\n\nint main()\n\n{\n\n  n = get(), m = get();\n\n  rep(i, 0, n)\n\n  {\n\n    c[i][0] = 1;\n\n    rep(j, 1, i)\n\n        c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;\n  }\n\n  scanf(\"%s\", s + 1);\n\n  rep(i, 1, n)\n\n      a[i] = a[i - 1] + s[i] - 48;\n\n  int t = 0;\n\n  rep(i, 1, m)\n\n  {\n\n    int x = get(), y = get();\n\n    if (x == l[t])\n\n      r[t] = max(r[t], y);\n\n    else if (y > r[t])\n\n      ++t, l[t] = x, r[t] = y;\n  }\n\n  m = t, l[m + 1] = n + 1, f[0][0] = 1;\n\n  rep(i, 1, m)\n\n  {\n\n    int w = a[r[i]] - a[max(l[i] - 1, r[i - 1])];\n\n    int s = min(r[i], l[i + 1] - 1) - l[i] + 1;\n\n    int mx = r[i] - l[i] + 1 - s;\n\n    lb[i] = max(0, lb[i - 1] + w - s), rb[i] = min(mx, rb[i - 1] + w);\n\n    rep(j, lb[i], rb[i])\n\n        rep(k, max(j - w, lb[i - 1]), min(s + j - w, rb[i - 1]))\n\n            f[i][j] = (f[i][j] + 1ll * f[i - 1][k] * c[s][k + w - j]) % mod;\n  }\n\n  rep(i, lb[m], rb[m])\n\n      ans = (ans + f[m][i]) % mod;\n\n  printf(\"%d\", ans);\n\n  return 0;\n}"}
{"fast_code_id":"814799500d02068236943f010c98c3bd1f78972cf742bc2f5becfeb49451da68","fast_id":"dcf0cffe3dd70787383303733ed343b4ccae400e831f20a1b2eafcd7e8d5654b","fast_time":0.0197132701,"language":"cpp","measured_fast_code_id":"dcf0cffe3dd70787383303733ed343b4ccae400e831f20a1b2eafcd7e8d5654b","measured_slow_code_id":"21114f09375fa087fd9d4354b6a02c80d753948ce4ab96ec46bd638c9b829295","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77171","problem_id":"p02838","slow_code_id":"48ea2aaa5c350cdece80b2537a1b969f3817921437dc829f86604b437ee5f5fb","slow_id":"21114f09375fa087fd9d4354b6a02c80d753948ce4ab96ec46bd638c9b829295","slow_time":0.1136974173,"speedup":5.767557423159337,"stratum":"4-8","sampling_key":"102392cef022dc3b9eaabcc353e7548b3407d20c53fd0f9df6fc5e42e8305e45","slow_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst ll mod = 1e9 + 7;\n\nll modpow(ll A, ll B) {\n\n  ll kotae = 1;\n\n  while (B > 0) {\n\n    if (B & 1)\n      kotae = kotae * A % mod;\n\n    A = A * A % mod;\n\n    B >>= 1;\n  }\n\n  return kotae;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N;\n\n  cin >> N;\n\n  ll A[300000];\n\n  rep(i, N) cin >> A[i];\n\n  int kazu[60] = {};\n\n  rep(i, N) {\n\n    rep(j, 60) { kazu[j] += A[i] >> j & 1; }\n  }\n\n  ll kotae[60] = {};\n\n  rep(i, N) {\n\n    rep(j, 60) { kazu[j] -= A[i] >> j & 1; }\n\n    rep(j, 60) {\n\n      if (A[i] >> j & 1) {\n\n        kotae[j] += N - 1 - kazu[j];\n\n      }\n\n      else {\n\n        kotae[j] += kazu[j];\n      }\n    }\n\n    rep(j, 60) { kazu[j] += A[i] >> j & 1; }\n  }\n\n  ll ans = 0;\n\n  rep(i, 60) {\n\n    kotae[i] %= mod;\n\n    ll tmp = (1ll << i) % mod;\n\n    ans += kotae[i] * tmp % mod;\n  }\n\n  ans %= mod;\n\n  co(ans * modpow(2, mod - 2) % mod);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 17;\n\nchar cn[cm], *ci = cn + cm, ct;\n\ninline char getcha() {\n\n  if (ci - cn == cm) {\n    fread_unlocked(cn, 1, cm, stdin);\n    ci = cn;\n  }\n\n  return *ci++;\n}\n\ninline ll getint() {\n\n  ll A = 0;\n\n  if (ci - cn + 24 > cm)\n    while ((ct = getcha()) >= '0')\n      A = A * 10 + ct - '0';\n\n  else\n    while ((ct = *ci++) >= '0')\n      A = A * 10 + ct - '0';\n\n  return A;\n}\n\nint main() {\n\n  int N = getint();\n\n  ll kazu[20] = {};\n\n  const int mod = 1e9 + 7;\n\n  const ll m = 1 + (1 << 20) + (1ll << 40);\n\n  rep(i, N / 2) {\n\n    ll a = getint();\n\n    ll b = getint();\n\n    rep(j, 20) {\n\n      kazu[j] += a >> j & m;\n\n      kazu[j] += b >> j & m;\n    }\n  }\n\n  rep(i, N % 2) {\n\n    ll a = getint();\n\n    rep(j, 20) kazu[j] += a >> j & m;\n  }\n\n  ll kotae = 0;\n\n  const ll m2 = (1 << 20) - 1;\n\n  rep(j, 20) {\n\n    ll tmp = (1ll << j) % mod;\n\n    ll tmpk = (kazu[j] & m2);\n\n    tmpk = tmpk * (N - tmpk) % mod;\n\n    kotae += tmp * tmpk % mod;\n\n    tmp = (1ll << (j + 20)) % mod;\n\n    tmpk = (kazu[j] >> 20 & m2);\n\n    tmpk = tmpk * (N - tmpk) % mod;\n\n    kotae += tmp * tmpk % mod;\n\n    tmp = (1ll << (j + 40)) % mod;\n\n    tmpk = (kazu[j] >> 40 & m2);\n\n    tmpk = tmpk * (N - tmpk) % mod;\n\n    kotae += tmp * tmpk % mod;\n  }\n\n  printf(\"%lld\", kotae % mod);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"04b5bbaac7b8ea44e8d35ee134b251ea42d88ebc10fe4e7cd35cd40c0c6732aa","fast_id":"aece78fc3e4195465d1b53422a73315da68f960f3f3de16df02bb0dc1a7ca7aa","fast_time":0.0290684368,"language":"cpp","measured_fast_code_id":"aece78fc3e4195465d1b53422a73315da68f960f3f3de16df02bb0dc1a7ca7aa","measured_slow_code_id":"205424f62640257cbaaa51111bd173916130e2fdc60f9e3775b4002b76d3a5b9","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77221","problem_id":"p02732","slow_code_id":"7edb1970df1ceb5b0ee6f2b48f2f6c3493765d03bbab9ae9e940ad8d89262d74","slow_id":"205424f62640257cbaaa51111bd173916130e2fdc60f9e3775b4002b76d3a5b9","slow_time":0.3942244858,"speedup":13.561943096988278,"stratum":"8+","sampling_key":"f8a92a34162db1ce1dfdd5ca05060c01d00071c8366b1bfe359261cb8e3a9460","slow_code":"#include <bits/stdc++.h>\n\n#include <iostream>\n\n#include <set>\n\n#include <vector>\n\n#include <algorithm>\n\n#define fr(i, b, e) for (int i = (b); i < (e); ++i)\n\n#define rp(i, e) for (int i = 0; i < (e); ++i)\n\n#define all(x) (x).begin(), (x).end()\n\nusing namespace std;\n\ntypedef long int li;\n\ntypedef long long ll;\n\nconst int INF = 1000000;\n\nvector<int> a(1e6);\n\nvector<ll> cnt(1e6);\n\nint main(void) {\n\n  int n;\n\n  cin >> n;\n\n  rp(i, n) {\n\n    cin >> a[i];\n\n    ++cnt[a[i] - 1];\n  }\n\n  ll sum = 0;\n\n  rp(i, n) { sum += cnt[i] * (cnt[i] - 1); }\n\n  sum = sum >> 1;\n\n  rp(i, n) { cout << sum - cnt[a[i] - 1] + 1 << '\\n'; }\n}","fast_code":"#include <bits/stdc++.h>\n\n#include <iostream>\n\n#include <set>\n\n#include <vector>\n\n#include <algorithm>\n\n#define fr(i, b, e) for (int i = (b); i < (e); ++i)\n\n#define rp(i, e) for (int i = 0; i < (e); ++i)\n\n#define all(x) (x).begin(), (x).end()\n\nusing namespace std;\n\ntypedef long int li;\n\ntypedef long long ll;\n\nconst int INF = 1000000;\n\nint main(void) {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  int n;\n\n  cin >> n;\n\n  vector<int> a(n);\n\n  vector<ll> cnt(n);\n\n  rp(i, n) {\n\n    cin >> a[i];\n\n    ++cnt[a[i] - 1];\n  }\n\n  ll sum = 0;\n\n  rp(i, n) { sum += cnt[i] * (cnt[i] - 1); }\n\n  sum = sum >> 1;\n\n  rp(i, n) { cout << sum - cnt[a[i] - 1] + 1 << '\\n'; }\n}"}
{"fast_code_id":"e278a2802d8a5a5a2156329d55d2f36cc5fed1683f5b30729b77cec58f84c6d1","fast_id":"5a6c3df6ae5dbbe71abb41f5b48bbcb961c6127c529d48216ae6efda139cead7","fast_time":0.0879980021,"language":"cpp","measured_fast_code_id":"5a6c3df6ae5dbbe71abb41f5b48bbcb961c6127c529d48216ae6efda139cead7","measured_slow_code_id":"82660f40d5b6f43dfce608935288ece1578d33ef9746c1546697d2bd2dd0e2e0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77293","problem_id":"p02715","slow_code_id":"23bc687133e8cc1f1874b0f105eff56e4a0ae405e543741bf1079869872a6108","slow_id":"82660f40d5b6f43dfce608935288ece1578d33ef9746c1546697d2bd2dd0e2e0","slow_time":0.1873570976,"speedup":2.129106265243265,"stratum":"2-4","sampling_key":"5b55d91acf3265a6c0edb1a97706dcd4bd41562586b89ab1e5a9c932373d0aa8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst long long int MOD = 1e9 + 7;\n\nvector<long long int> prime;\n\nlong long int mypow(long long int x, long long int n)\n\n{\n\n  long long int res = 1;\n\n  while (n > 0)\n\n  {\n\n    if (n % 2 == 1)\n\n    {\n\n      res = ((res % MOD) * (x % MOD) % MOD);\n\n      res %= MOD;\n    }\n\n    x = ((x % MOD) * (x % MOD) % MOD);\n\n    x %= MOD;\n\n    n /= 2;\n  }\n\n  return res;\n}\n\nvoid eratos(void)\n\n{\n\n  bool isprime[100001];\n\n  memset(isprime, true, sizeof(isprime));\n\n  for (int i = 2; i <= 100000; i++)\n\n  {\n\n    if (isprime[i])\n\n    {\n\n      prime.push_back(i);\n\n      for (int j = 2 * i; j <= 100000; j += i)\n\n      {\n\n        isprime[j] = false;\n      }\n    }\n  }\n}\n\nlong long int phi(long long int a)\n\n{\n\n  map<long long int, long long int> cnt;\n\n  long long int tot = 1;\n\n  for (int j = 0; j < prime.size(); j++)\n\n  {\n\n    if (a == 1)\n\n    {\n\n      break;\n    }\n\n    while (1)\n\n    {\n\n      if (a % prime[j] != 0)\n\n      {\n\n        break;\n      }\n\n      a /= prime[j];\n\n      cnt[prime[j]]++;\n    }\n  }\n\n  if (a != 1)\n\n  {\n\n    cnt[a]++;\n  }\n\n  for (auto it : cnt)\n\n  {\n\n    long long int val = mypow(it.first, it.second) - mypow(it.first, it.second - 1);\n\n    val %= MOD;\n\n    if (val < 0)\n\n    {\n\n      val += MOD;\n    }\n\n    tot *= val;\n\n    tot %= MOD;\n  }\n\n  return tot;\n}\n\nint main(void)\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  long long int k, n;\n\n  cin >> n >> k;\n\n  eratos();\n\n  long long int res = 0;\n\n  for (long long int g = k; g >= 1; g--)\n\n  {\n\n    long long int num = mypow(k / g, n);\n\n    num = ((num % MOD) * (phi(g) % MOD) % MOD);\n\n    res = ((res % MOD) + (num % MOD) % MOD);\n\n    res %= MOD;\n  }\n\n  cout << res << '\\n';\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst long long int MOD = 1e9 + 7;\n\nlong long int mypow(long long int x, long long int n)\n\n{\n\n  long long int res = 1;\n\n  while (n > 0)\n\n  {\n\n    if (n % 2 == 1)\n\n    {\n\n      res = ((res % MOD) * (x % MOD) % MOD);\n\n      res %= MOD;\n    }\n\n    x = ((x % MOD) * (x % MOD) % MOD);\n\n    x %= MOD;\n\n    n /= 2;\n  }\n\n  return res;\n}\n\nlong long int dp[100001];\n\nint main(void)\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int n, k;\n\n  cin >> k >> n;\n\n  long long int res = 0;\n\n  for (int i = n; i >= 1; i--)\n\n  {\n\n    dp[i] = mypow(n / i, k);\n\n    for (int j = 2 * i; j <= n; j += i)\n\n    {\n\n      dp[i] -= dp[j];\n\n      if (dp[i] < 0)\n\n      {\n\n        dp[i] += MOD;\n      }\n    }\n\n    res = ((res % MOD) + ((i % MOD) * (dp[i] % MOD) % MOD) % MOD);\n\n    res %= MOD;\n  }\n\n  cout << res << '\\n';\n\n  return 0;\n}"}
{"fast_code_id":"6cefba615671fa8fcb937e4e1f4e092bb487e156d99fe72d536860d3a31e9990","fast_id":"8c712b82f903337bfecacbee21b72a9d3ebcfdde8a735d1ddc1f91d7f73d88fa","fast_time":0.1076792159,"language":"cpp","measured_fast_code_id":"8c712b82f903337bfecacbee21b72a9d3ebcfdde8a735d1ddc1f91d7f73d88fa","measured_slow_code_id":"8974ff2c14b5c6af592001b963dfb3cac201a0160e8a3467e9c5a2ff07c152d3","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77350","problem_id":"p02990","slow_code_id":"f3304a1ae8d16b6898eb5bf270962be132b15da9a9e1997fdbb7762ec7ecae5f","slow_id":"8974ff2c14b5c6af592001b963dfb3cac201a0160e8a3467e9c5a2ff07c152d3","slow_time":0.2854607845,"speedup":2.6510295614067525,"stratum":"2-4","sampling_key":"bdd0c3d5d7a95697080a0b14a94c5d04bfe37fefb0537a6cb64e7c56ae1c6100","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\nconst ll mod = 1e9 + 7;\n\nconst int maxn = 2e5 + 10;\n\nll inv[maxn];\n\nll fac[maxn];\n\nll power(ll base, ll n)\n\n{\n\n  ll r = 1;\n\n  while (n)\n\n  {\n\n    if (n & 1)\n      r = r * base % mod;\n\n    base = base * base % mod;\n\n    n /= 2;\n  }\n\n  return r;\n}\n\nvoid init()\n\n{\n\n  fac[0] = 1;\n\n  for (int i = 1; i <= 2e5; i++)\n\n  {\n\n    fac[i] = fac[i - 1] * i % mod;\n  }\n\n  inv[200000] = power(fac[200000], mod - 2);\n\n  for (int i = 2e5; i >= 1; i--)\n\n  {\n\n    inv[i - 1] = inv[i] * i % mod;\n  }\n}\n\nll C(ll m, ll n)\n\n{\n\n  return fac[n] * inv[m] % mod * inv[n - m] % mod;\n}\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(0);\n\n  ll n, k;\n\n  cin >> n >> k;\n\n  init();\n\n  ll red = n - k;\n\n  for (ll i = 1; i <= k; i++)\n\n  {\n\n    if (i > red + 1)\n\n    {\n\n      cout << 0 << '\\n';\n\n      continue;\n    }\n\n    ll ans = (C(i, red + 1) * C(i - 1, k - 1)) % mod;\n\n    cout << ans << '\\n';\n  }\n}\n","fast_code":"#include <iostream>\n\nusing namespace std;\n\n#define mod 1000000007\n\ntypedef long long ll;\n\nll fact[1000006], inv[1000006];\n\nll fp(ll base, ll exp)\n\n{\n\n  if (exp == 0)\n\n    return 1;\n\n  ll ans = fp(base, exp / 2);\n\n  ans = (ans * ans) % mod;\n\n  if (exp % 2 != 0)\n\n    ans = (ans * (base % mod)) % mod;\n\n  return ans;\n}\n\nvoid facninv(ll n)\n\n{\n\n  fact[0] = inv[0] = 1;\n\n  for (ll i = 1; i <= n; i++)\n\n  {\n\n    fact[i] = (i * fact[i - 1]) % mod;\n\n    inv[i] = fp(fact[i], mod - 2);\n  }\n}\n\nll ncr(ll n, ll r)\n\n{\n\n  return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;\n}\n\nint main()\n\n{\n  int n, k;\n\n  ll ans;\n\n  facninv(2001);\n\n  cin >> n >> k;\n\n  int r = n - k;\n\n  for (int i = 1; i <= k; i++) {\n\n    if (r + 1 >= i)\n\n      ans = (ncr(r + 1, i) * ncr(k - 1, i - 1)) % mod;\n\n    else\n      ans = 0;\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"9b8ecb68f89f3cd2241aedb16645a21b38640c8ee3cbc2f745a27156f93b891e","fast_id":"c4d35698086bc14b5bb9b1eec8dba887ed3e1fab5fab7b5bcc7ed71df8ffc7e5","fast_time":0.0198237768,"language":"cpp","measured_fast_code_id":"c4d35698086bc14b5bb9b1eec8dba887ed3e1fab5fab7b5bcc7ed71df8ffc7e5","measured_slow_code_id":"cd82ff23b814e7a00b21dd05df2a37eab90c81b298c846c4bb7fc51294c66838","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77361","problem_id":"p02954","slow_code_id":"2314e21c500d2d7f8830c8cb5dc5816210642484924e36d58bd3089ebf817174","slow_id":"cd82ff23b814e7a00b21dd05df2a37eab90c81b298c846c4bb7fc51294c66838","slow_time":0.1487140069,"speedup":7.5017999042442804,"stratum":"4-8","sampling_key":"8e47f73f8d9069281694c61eb22f17c7f89b4ce55ed1c6d4ff241fb57b845eb7","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int g, nt, re[100007] = {0};\n\n  string q;\n\n  cin >> q;\n\n  for (g = nt = 0; q[g]; g++) {\n\n    if (q[g] == 'R')\n      nt++;\n\n    else if (nt)\n      re[g - 1] = (nt + 1) / 2, re[g] = nt / 2, nt = 0;\n  }\n\n  for (g = q.length() - 1, nt = 0; g >= 0; g--) {\n\n    if (q[g] == 'L')\n      nt++;\n\n    else if (nt)\n      re[g + 1] += (nt + 1) / 2, re[g] += nt / 2, nt = 0;\n  }\n\n  for (g = 0; g < q.length() - 1; g++)\n\n    printf(\"%d \", re[g]);\n\n  printf(\"%d\\n\", re[g]);\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <string.h>\n\nchar a[100005];\n\nint b[100005] = {0};\n\nint main()\n\n{\n\n  int len, count = 0, max = 0, i, j, flag, x, y;\n\n  char b = 0;\n\n  scanf(\"%s\", a);\n\n  len = strlen(a);\n\n  for (i = 0; i < len; i++)\n\n  {\n\n    if (a[i] == 'R' && a[i + 1] == 'L')\n\n    {\n\n      j = i - 1;\n\n      flag = 1;\n\n      x = y = 1;\n\n      while (j >= 0 && a[j] == 'R')\n\n      {\n\n        if (flag == 1)\n\n          y++;\n\n        else\n          x++;\n\n        flag = 1 - flag;\n\n        j--;\n      }\n\n      flag = 1;\n\n      j = i + 2;\n\n      while (j < len && a[j] == 'L')\n\n      {\n\n        if (flag == 1)\n\n          x++;\n\n        else\n          y++;\n\n        flag = 1 - flag;\n\n        j++;\n      }\n\n      printf(\"%d %d \", x, y);\n\n      i++;\n\n    }\n\n    else\n      printf(\"0 \");\n  }\n}"}
{"fast_code_id":"4fc740be6d7fd11774f4a332592a1dc76c51b76889a0be100559502c884887cd","fast_id":"1953481c9b196189134954f69ca1b8c0c4398e5a5b0cb6910e693c1d83833311","fast_time":0.0649388554,"language":"cpp","measured_fast_code_id":"1953481c9b196189134954f69ca1b8c0c4398e5a5b0cb6910e693c1d83833311","measured_slow_code_id":"18aa7e39240eed654ffe9baaa5ae835e18789f0c8e18952b38a3efa679f84faa","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77396","problem_id":"p03838","slow_code_id":"0718b301227ce7d03edd8beaae11ec9b4601695194414f805a09e64ce801ed20","slow_id":"18aa7e39240eed654ffe9baaa5ae835e18789f0c8e18952b38a3efa679f84faa","slow_time":0.4122458709,"speedup":6.348215846440682,"stratum":"4-8","sampling_key":"e616083ef380d33f3b4c0e50275c35b79f2f842cfdb1eec479e2b9885d8d6215","slow_code":"#include <iostream>\n\n#include <climits>\n\n#include <stack>\n\n#include <queue>\n\n#include <string>\n\n#include <random>\n\n#include <utility>\n\n#include <cmath>\n\n#include <set>\n\n#include <map>\n\n#include <math.h>\n\n#include <string.h>\n\n#include <iomanip>\n\n#include <stdlib.h>\n\n#include <algorithm>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\nlong long int INF = 1e18;\n\ndouble Pi = 3.141592653589;\n\nconst int mod = 1000000007;\n\nvector<int> G[100005];\n\nstd::vector<P> tree[100010];\n\nint dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\n\nint dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};\n\nll i, j, k;\n\nll n, m;\n\nll a[100005], b[100005];\n\nll ans = 0;\n\nint main() {\n\n  cin >> n >> m;\n\n  if (n * m > 0) {\n\n    if (m > n)\n      ans = m - n;\n\n    else\n      ans = n - m + 2;\n\n  } else if (n * m < 0) {\n\n    ans = abs(abs(m) - abs(n)) + 1;\n\n  } else {\n\n    if (n == 0 && m > 0)\n      ans = m;\n\n    else if (n == 0 && m < 0)\n      ans = 1 - m;\n\n    else if (m == 0 && n > 0)\n      ans = 1 + n;\n\n    else\n      ans = -1 * n;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\n#include <unistd.h>\n\n#include <sys/time.h>\n\n#include <stdlib.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<ll, ll> P;\n\ntypedef pair<P, ll> T;\n\nlong long int INF = 2e18;\n\nconst ll fact_table = 1200008;\n\ndouble Pi = 3.1415926535897932384626;\n\npriority_queue<ll> pql;\n\npriority_queue<P> pqp;\n\npriority_queue<P> bag;\n\npriority_queue<ll, vector<ll>, greater<ll> > pqls;\n\npriority_queue<P, vector<P>, greater<P> > pqps;\n\nll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\n\nll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};\n\nchar dir[] = \"DRUL\";\n\n#define endl \"\\n\"\n\n#ifdef ENJAPMA\n\n#undef endl\n\n#endif\n\n#define p(x) cout << x << endl;\n\n#define el cout << endl;\n\n#define pe(x) cout << x << \" \";\n\n#define ps(x) cout << fixed << setprecision(25) << x << endl;\n\n#define pu(x) cout << (x);\n\n#define pb push_back\n\n#define lb lower_bound\n\n#define ub upper_bound\n\n#define CLEAR(a) a = decltype(a)();\n\n#define pc(x) cout << x << \",\";\n\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\nconst ll mod = 998244353ll;\n\nll mypow(ll number1, ll number2, ll mod) {\n\n  if (number2 == 0) {\n\n    return 1ll;\n\n  } else {\n\n    ll number3 = mypow(number1, number2 / 2, mod);\n\n    number3 *= number3;\n\n    number3 %= mod;\n\n    if (number2 % 2 == 1) {\n\n      number3 *= number1;\n\n      number3 %= mod;\n    }\n\n    return number3;\n  }\n}\n\nvoid YES(bool condition) {\n\n  if (condition) {\n    p(\"YES\");\n  } else {\n    p(\"NO\");\n  }\n\n  return;\n}\n\nvoid Yes(bool condition) {\n\n  if (condition) {\n\n    p(\"Yes\");\n\n  } else {\n\n    p(\"No\");\n  }\n\n  return;\n}\n\nll mygcd(ll a, ll b) {\n\n  if (b > a)\n    swap(a, b);\n\n  if (a == b || b == 0)\n    return a;\n\n  return mygcd(b, a % b);\n}\n\nbool multicase = false;\n\nll n, m, num, a, b, c, d, e, q, w, ans;\n\nll x[500005], y[500005];\n\nll r, k;\n\nstring s;\n\nll calc(ll a, ll b) {\n\n  if (a > b)\n    return INF;\n\n  return b - a;\n}\n\nvoid solve() {\n\n  cin >> a >> b;\n\n  ans = INF;\n\n  ans = min(ans, calc(-a, b) + 1);\n\n  ans = min(ans, calc(a, -b) + 1);\n\n  ans = min(ans, calc(a, b));\n\n  ans = min(ans, calc(-a, -b) + 2);\n\n  p(ans);\n\n  return;\n}\n\nint main() {\n\n  ios::sync_with_stdio(false);\n\n  cin.tie(nullptr);\n\n  ll q, testcase = 1;\n\n  if (multicase) {\n\n    cin >> q;\n\n  } else {\n\n    q = 1;\n  }\n\n  while (q--) {\n\n    solve();\n\n    testcase++;\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"8ef64a028694927f72ff3465d5416823b36ad706d6f0f53d1630f96bb61477af","fast_id":"e14a68bd3831d46ee0075017fc8c5f8e2d06ce4a941f61d37ffeaa1409673dd5","fast_time":0.0460532175,"language":"cpp","measured_fast_code_id":"e14a68bd3831d46ee0075017fc8c5f8e2d06ce4a941f61d37ffeaa1409673dd5","measured_slow_code_id":"fe0dba6e7c6631f09fa1d163166006269711a9de3389b954bbbc7d59d26b5c68","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77399","problem_id":"p01273","slow_code_id":"26aa4c5642aacfdf468687d44f1bcc8a3ceb465d3a0ea594edece45bdc1248fc","slow_id":"fe0dba6e7c6631f09fa1d163166006269711a9de3389b954bbbc7d59d26b5c68","slow_time":0.1144567413,"speedup":2.4853147622096112,"stratum":"2-4","sampling_key":"0ae263f6651d063a175836c9bcec86539730c3e85009857c756f4615d81dbda3","slow_code":"#include <cstdio>\n\n#include <vector>\n\n#include <algorithm>\n\n#define mp make_pair\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nusing namespace std;\n\ntypedef vector<int> vi;\n\ntypedef pair<int, int> pii;\n\nclass UnionFind {\n\n  vi a;\n\n  int root(int x) { return ~a[x] ? a[x] = root(a[x]) : x; }\n\npublic:\n  UnionFind(int n) : a(n, -1) {}\n\n  bool find(int x, int y) { return root(x) == root(y); }\n\n  bool unite(int x, int y) { return find(x, y) ? 0 : (a[root(y)] = root(x), 1); }\n};\n\nint main() {\n\n  for (int m, n; scanf(\"%d%d\", &n, &m), n;) {\n\n    pair<int, pii> packet[20000];\n\n    rep(i, m) scanf(\"%d%d%d\", &packet[i].first, &packet[i].second.first, &packet[i].second.second);\n\n    sort(packet, packet + m);\n\n    int ans = 1;\n\n    UnionFind link(n + 1);\n\n    rep(i, m) {\n\n      int src = packet[i].second.first, dst = packet[i].second.second;\n\n      if (link.find(1, src))\n        ans += link.unite(src, dst);\n    }\n\n    printf(\"%d\\n\", ans);\n  }\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\n#define mp make_pair\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\nint main() {\n\n  for (int m, n; scanf(\"%d%d\", &n, &m), n;) {\n\n    pair<int, pii> packet[20000];\n\n    rep(i, m) scanf(\"%d%d%d\", &packet[i].first, &packet[i].second.first, &packet[i].second.second);\n\n    sort(packet, packet + m);\n\n    bool flg[20000] = {};\n    flg[0] = true;\n\n    rep(i, m) {\n\n      int src = packet[i].second.first - 1, dst = packet[i].second.second - 1;\n\n      flg[dst] |= flg[src];\n    }\n\n    printf(\"%d\\n\", count(flg, flg + n, true));\n  }\n\n  return 0;\n}"}
{"fast_code_id":"de23c983d8ba20aa7bcd5b1f7861e2becf7ab406f99af0ba29ec637e694c802c","fast_id":"c6fc340182288cdb9ad1641fe53782d8fc04660ee8bf70f6ba146e87967b00c2","fast_time":0.1047516913,"language":"cpp","measured_fast_code_id":"c6fc340182288cdb9ad1641fe53782d8fc04660ee8bf70f6ba146e87967b00c2","measured_slow_code_id":"92a0d433ec9f8502bd877a1048af938df8ed3075e2b6de18de46cb307a05300c","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77497","problem_id":"p03786","slow_code_id":"8bfd2f48f8ecae51853317d817ee56c20e5d9a2ad9eaeb01f10bfc2c8df44b1f","slow_id":"92a0d433ec9f8502bd877a1048af938df8ed3075e2b6de18de46cb307a05300c","slow_time":0.2793508189,"speedup":2.6667905351519607,"stratum":"2-4","sampling_key":"b68836108bae0f5de4184e4dc391c513906cc548c37b023c3bb92eab681f7a55","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <queue>\n\n#include <cmath>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <stack>\n\n#include <vector>\n\n#define mt(a) memset(a, 0, sizeof(a))\n\n#define ll long long\n\nconst ll INF = 0x3f3f3f3f;\n\nusing namespace std;\n\nint main(void)\n\n{\n\n  int n;\n\n  ll a[100050];\n\n  ll p[100050];\n\n  mt(a);\n\n  mt(p);\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++)\n\n    cin >> a[i], p[i] = a[i];\n\n  sort(a + 1, a + 1 + n);\n\n  sort(p + 1, p + 1 + n);\n\n  ll x = 0;\n\n  for (int i = 1; i <= n - 1; i++)\n\n  {\n\n    p[i] += x;\n\n    x = p[i];\n  }\n\n  int l = 0;\n\n  int r = n;\n\n  int cnt = INF;\n\n  while (l <= r)\n\n  {\n\n    int mid = (l + r) / 2;\n\n    if (2 * p[mid] >= a[n])\n\n    {\n\n      cnt = min(mid, cnt);\n\n      r = mid - 1;\n\n    }\n\n    else\n\n    {\n\n      for (int j = mid + 1; j <= n - 1; j++)\n\n      {\n\n        if (2 * p[mid] >= a[j])\n\n        {\n\n          p[mid] += a[j];\n\n          if (2 * p[mid] >= a[n])\n\n            break;\n\n        }\n\n        else\n\n          break;\n      }\n\n      if (2 * p[mid] >= a[n])\n\n      {\n\n        cnt = min(mid, cnt);\n\n        r = mid - 1;\n\n      }\n\n      else\n\n        l = mid + 1;\n    }\n  }\n\n  cout << n - cnt + 1 << endl;\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <stack>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <iostream>\n\n#define ll long long\n\nusing namespace std;\n\n#define max(a, b) (a) > (b) ? (a) : (b)\n\n#define min(a, b) (a) < (b) ? (a) : (b)\n\n#define s(i) scanf(\"%d\", &(i))\n\n#define ss(i) scanf(\"%s\", (i))\n\n#define p(i) printf(\"%d\", i)\n\n#define ps(i) printf(\"%s\", (i))\n\n#define pc(i) printf(\"%c\", (i))\n\n#define end printf(\"\\n\")\n\n#define f(i, n) for (i = 1; i <= n; i++)\n\n#define w(i) while (i--)\n\nint a[100010];\n\nll b[100010];\n\nint main()\n\n{\n\n  int n, m, i, j;\n\n  s(n);\n\n  f(i, n)\n\n      s(a[i]);\n\n  sort(a + 1, a + n + 1);\n\n  f(i, n)\n\n      b[i] = b[i - 1] + a[i];\n\n  for (i = n - 1; i >= 1; i--)\n\n  {\n\n    if (b[i] * 2 < a[i + 1])\n\n      break;\n  }\n\n  p(n - i);\n\n  end;\n\n  return 0;\n}\n"}
{"fast_code_id":"0380ab599140cb130ac6381cda5688f3a9a1cdedf7ae863d7f6c72f5066a01e9","fast_id":"47dd08a1601c762c61c28d0e695217f993426d1330f31b256058057d1e4f3d47","fast_time":0.0452286154,"language":"cpp","measured_fast_code_id":"47dd08a1601c762c61c28d0e695217f993426d1330f31b256058057d1e4f3d47","measured_slow_code_id":"63bc4d2f5af78a5f9f5045122e90e838f52b7a86e170a10bd9054357ed0711fa","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77525","problem_id":"p02555","slow_code_id":"b4d59fef9172ed63d54527f6587228bebcdb95f3509c0fe2402131086f85e7b0","slow_id":"63bc4d2f5af78a5f9f5045122e90e838f52b7a86e170a10bd9054357ed0711fa","slow_time":0.5795209328,"speedup":12.813147775467831,"stratum":"8+","sampling_key":"03c4f812008a6a1582f35cc3449458d83f72a44975639d91d32a0d085ef46c24","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int mod = 1e9 + 7;\n\nlong long dp[700][2002];\n\nlong long DP(int cur, long long sum)\n\n{\n\n  if (sum == 0)\n    return dp[cur][0] = 1;\n\n  if (sum < 3)\n    return dp[cur][sum] = 0;\n\n  long long &ans = dp[cur][sum];\n\n  if (ans > -1)\n    return ans;\n\n  ans = 0;\n\n  for (int i = 3; i <= sum; i++)\n    ans = (ans + DP(cur + 1, sum - i)) % mod;\n\n  return ans;\n}\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n  cout.tie(NULL);\n\n  int n;\n\n  memset(dp, -1, sizeof(dp));\n\n  cin >> n;\n\n  cout << DP(1, n);\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int mod = 1e9 + 7;\n\nlong long dp[2002];\n\nint main()\n\n{\n\n  ios_base::sync_with_stdio(false);\n\n  cin.tie(NULL);\n  cout.tie(NULL);\n\n  int i, j, n;\n\n  cin >> n;\n\n  dp[0] = 1;\n\n  for (i = 1; i <= n; i++)\n\n  {\n\n    for (j = 3; j <= i; j++)\n\n    {\n\n      dp[i] += dp[i - j];\n\n      dp[i] %= mod;\n    }\n  }\n\n  cout << dp[n];\n\n  return 0;\n}\n"}
{"fast_code_id":"7a7bde9c8f66a749018a55a1325178684413752476dc3642b19c6a628c537013","fast_id":"6209f20aa64136d9e60b4b221736bbe2faa56d566bd12490b6656220a1fc96aa","fast_time":0.0062199246,"language":"cpp","measured_fast_code_id":"6209f20aa64136d9e60b4b221736bbe2faa56d566bd12490b6656220a1fc96aa","measured_slow_code_id":"159de52afe92ee22a85ca535a8350d1f67c287a14c011d7bbeae48760223b360","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77549","problem_id":"p03516","slow_code_id":"bf841b5240edd93f050f6607954fa784138724e461970a0ae625ee086e023ef5","slow_id":"159de52afe92ee22a85ca535a8350d1f67c287a14c011d7bbeae48760223b360","slow_time":0.0324307458,"speedup":5.21400947529171,"stratum":"4-8","sampling_key":"b420322046c7fee3114397827e6b7a15c6e9e57e64a39ff564f7715214389f22","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define ll long long\n\n#define mem(Arr, x) memset(Arr, x, sizeof(Arr))\n\nconst int maxN = 320;\n\nconst int Mod = 1e9 + 7;\n\nconst int inf = 2147483647;\n\nint n, D[maxN];\n\nint F[maxN][maxN][2];\n\nint Fac[maxN], Ifc[maxN];\n\nint QPow(int x, int cnt);\n\nint main() {\n\n  Fac[0] = Ifc[0] = 1;\n  for (int i = 1; i < maxN; i++)\n    Fac[i] = 1ll * Fac[i - 1] * i % Mod;\n\n  Ifc[maxN - 1] = QPow(Fac[maxN - 1], Mod - 2);\n  for (int i = maxN - 2; i >= 1; i--)\n    Ifc[i] = 1ll * Ifc[i + 1] * (i + 1) % Mod;\n\n  bool fullring = 1;\n\n  scanf(\"%d\", &n);\n  for (int i = 1; i <= n; i++)\n    scanf(\"%d\", &D[i]), fullring &= (D[i] == 2);\n\n  if (fullring) {\n\n    printf(\"%lld\\n\", 1ll * Fac[n - 1] * Ifc[2] % Mod);\n    return 0;\n  }\n\n  F[0][0][0] = 1;\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 0; j <= i; j++)\n\n      for (int k = 0; k <= 1; k++) {\n\n        F[i][j][k] = F[i - 1][j][k];\n\n        if ((D[i] >= 2) && (j > 0))\n          F[i][j][k] = (1ll * F[i - 1][j - 1][k] * (D[i] - 1) % Mod + F[i][j][k]) % Mod;\n\n        if ((D[i] >= 3) && (j > 0) && (k == 1))\n          F[i][j][k] =\n              (1ll * F[i - 1][j - 1][0] * (D[i] - 1) % Mod * (D[i] - 2) % Mod + F[i][j][k]) % Mod;\n      }\n\n  int Ans = 0;\n\n  for (int i = 3; i <= n; i++)\n    Ans = (Ans + 1ll * F[n][i][1] * Fac[i - 1] % Mod * Ifc[2] % Mod * Fac[n - i - 1] % Mod) % Mod;\n\n  for (int i = 1; i <= n; i++)\n    Ans = 1ll * Ans * Ifc[D[i] - 1] % Mod;\n\n  printf(\"%d\\n\", Ans);\n  return 0;\n}\n\nint QPow(int x, int cnt) {\n\n  int ret = 1;\n\n  while (cnt) {\n\n    if (cnt & 1)\n      ret = 1ll * ret * x % Mod;\n\n    x = 1ll * x * x % Mod;\n    cnt >>= 1;\n  }\n\n  return ret;\n}\n","fast_code":"\n\n#include <cstdio>\n\nconst int N = 5004, mod = 1000000007;\n\nint n, ans, inv[N], fac[N], ifac[N], F[N][2];\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  fac[0] = fac[1] = ifac[0] = ifac[1] = inv[1] = 1;\n\n  for (int i = 2; i <= n; ++i)\n\n  {\n\n    fac[i] = 1ll * i * fac[i - 1] % mod;\n\n    inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;\n\n    ifac[i] = 1ll * ifac[i - 1] * inv[i] % mod;\n  }\n\n  F[0][0] = 1;\n\n  for (int i = 1, d; i <= n; ++i)\n\n  {\n\n    scanf(\"%d\", &d);\n\n    for (int j = i - 1; ~j; --j)\n\n    {\n\n      if (d >= 2)\n\n        F[j + 1][0] = (F[j + 1][0] + 1ll * F[j][0] * ifac[d - 2]) % mod,\n\n              F[j + 1][1] = (F[j + 1][1] + 1ll * F[j][1] * ifac[d - 2]) % mod;\n\n      if (d >= 3)\n\n        F[j + 1][1] = (F[j + 1][1] + 1ll * F[j][0] * ifac[d - 3]) % mod;\n\n      F[j][0] = 1ll * F[j][0] * ifac[d - 1] % mod;\n\n      F[j][1] = 1ll * F[j][1] * ifac[d - 1] % mod;\n    }\n  }\n\n  if (!F[1][1])\n\n    ans = 1ll * fac[n - 1] * inv[2] % mod;\n\n  else\n    for (int j = 3; j < n; ++j)\n\n      ans = (ans + 1ll * F[j][1] * fac[n - j - 1] % mod * fac[j - 1] % mod * inv[2]) % mod;\n\n  printf(\"%d\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"253c2f7968e4dd92f36709a0e247385c6c2e60873154097742c87fcbe53c0b79","fast_id":"d7dd9940fd584e49db3e6d0dfeb4713f8392019d30bf9e6e4a40a5955d9c4444","fast_time":0.0929951219,"language":"cpp","measured_fast_code_id":"d7dd9940fd584e49db3e6d0dfeb4713f8392019d30bf9e6e4a40a5955d9c4444","measured_slow_code_id":"e69dba5afb7cf1de43c7a4575456c08a4fdcb42f96e0f76d15b649bd05137208","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77576","problem_id":"p03690","slow_code_id":"6eddc4af8719a1434b09ce1826de8211b712992a924333a2712cd5a6fe536352","slow_id":"e69dba5afb7cf1de43c7a4575456c08a4fdcb42f96e0f76d15b649bd05137208","slow_time":0.6577755247,"speedup":7.073226114024804,"stratum":"4-8","sampling_key":"39d5a8335a299686e042254ef13e9440ecf928ec3983ef77a3582dc11e5e568b","slow_code":"#define _CRT_SECURE_NO_WARNINGS\n\n#include <iostream>\n\n#include <sstream>\n\n#include <iomanip>\n\n#include <cstdio>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <cctype>\n\n#include <cstring>\n\n#include <vector>\n\n#include <list>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <map>\n\n#include <set>\n\n#include <algorithm>\n\n#include <iterator>\n\n#include <bitset>\n\n#include <ctime>\n\n#include <complex>\n\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n\n#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); i--)\n\n#define ITER(it, a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int)a.size()\n\n#define ALL(a) a.begin(), a.end()\n\n#define PB push_back\n\n#define MP make_pair\n\ntypedef long long LL;\n\ntypedef vector<int> VI;\n\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\n\nconst int INF = 1000 * 1000 * 1000 + 7;\n\nconst LL LINF = INF * (LL)INF;\n\nconst int MAX = 2 * 1000 * 100 + 47;\n\nint A[MAX];\n\nint B[MAX];\n\nint A1[MAX];\n\nint B1[MAX];\n\nint L[MAX * 2];\n\nint sz;\n\nvector<int> g[MAX];\n\nint IN[MAX];\n\nint OUT[MAX];\n\nint U[MAX];\n\nint val = 0;\n\nvoid dfs(int v)\n\n{\n\n  if (U[v])\n    return;\n\n  U[v] = 1;\n\n  if (OUT[v] > IN[v])\n    val += OUT[v] - IN[v];\n\n  FOR(i, 0, SZ(g[v]))\n\n  {\n\n    int to = g[v][i];\n\n    dfs(to);\n  }\n}\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false);\n  cin.tie(0);\n\n  int n;\n\n  cin >> n;\n\n  FOR(i, 0, n) cin >> A[i];\n\n  FOR(i, 0, n) cin >> B[i];\n\n  int y = 0;\n\n  int x = 0;\n\n  FOR(i, 0, n)\n\n  {\n\n    x ^= A[i];\n\n    y ^= B[i];\n\n    A1[i] = A[i];\n\n    B1[i] = B[i];\n  }\n\n  A1[n] = x;\n\n  B1[n] = y;\n\n  sort(A1, A1 + n + 1);\n\n  sort(B1, B1 + n + 1);\n\n  bool ok = true;\n\n  FOR(i, 0, n + 1)\n\n  {\n\n    if (A1[i] != B1[i])\n\n    {\n\n      ok = false;\n\n      break;\n    }\n  }\n\n  if (!ok)\n\n  {\n\n    cout << -1 << endl;\n\n    return 0;\n  }\n\n  int ans = 0;\n\n  FOR(i, 0, n)\n\n  {\n\n    if (A[i] != B[i])\n      ans++;\n\n    L[sz++] = A[i];\n\n    L[sz++] = B[i];\n  }\n\n  L[sz++] = x;\n\n  sort(L, L + sz);\n\n  sz = unique(L, L + sz) - L;\n\n  FOR(i, 0, n)\n\n  {\n\n    A[i] = lower_bound(L, L + sz, A[i]) - L;\n\n    B[i] = lower_bound(L, L + sz, B[i]) - L;\n  }\n\n  x = lower_bound(L, L + sz, x) - L;\n\n  FOR(i, 0, n)\n\n  {\n\n    int a = A[i];\n\n    int b = B[i];\n\n    if (a == b)\n      continue;\n\n    g[a].push_back(b);\n\n    g[b].push_back(a);\n\n    OUT[b]++;\n\n    IN[a]++;\n  }\n\n  val = 0;\n\n  dfs(x);\n\n  if (val != 0 && OUT[x] > IN[x])\n    val--;\n\n  ans += val;\n\n  FOR(i, 0, n)\n\n  {\n\n    if (U[i] || SZ(g[i]) == 0)\n      continue;\n\n    val = 0;\n\n    dfs(i);\n\n    if (val == 0)\n      val++;\n\n    ans += val;\n  }\n\n  cout << ans << endl;\n}","fast_code":"#include <cstdio>\n\n#include <map>\n\n#define maxn 100005\n\nusing namespace std;\n\nint n, a[maxn], b[maxn], fa[maxn], siz[maxn], cnt, ans;\n\nmap<int, int> mp, val;\n\nint find(int x)\n\n{\n\n  if (fa[x] == x)\n    return x;\n\n  return fa[x] = find(fa[x]);\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  int x = 0;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &a[i]);\n\n    mp[a[i]]++;\n    x ^= a[i];\n\n    if (!val[a[i]])\n      val[a[i]] = ++cnt;\n  }\n\n  mp[x]++;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &b[i]);\n\n    if (!mp[b[i]]) {\n      printf(\"-1\\n\");\n      return 0;\n    }\n\n    mp[b[i]]--;\n\n    if (!val[b[i]])\n      val[b[i]] = ++cnt;\n  }\n\n  for (int i = 1; i <= cnt; i++)\n    fa[i] = i, siz[i] = 1;\n\n  for (int i = 1; i <= n; i++)\n\n    if (a[i] != b[i])\n\n    {\n\n      int r1 = find(val[a[i]]), r2 = find(val[b[i]]);\n\n      if (r1 != r2)\n        fa[r1] = r2, siz[r2] += siz[r1];\n\n      ans++;\n    }\n\n  bool f = true;\n\n  for (int i = 1; i <= n; i++)\n\n    if (a[i] != b[i]) {\n      f = false;\n      break;\n    }\n\n  if (f) {\n    printf(\"0\\n\");\n    return 0;\n  }\n\n  if (!val[x])\n    ans++;\n\n  for (int i = 1; i <= cnt; i++)\n\n    if (find(i) == i && siz[i] > 1)\n      ans++;\n\n  printf(\"%d\\n\", ans - 1);\n}"}
{"fast_code_id":"6206b4d0bb6bf48e331b2bcd1905a740e4e840060250000d86bdf32190f948cb","fast_id":"ac6aee933e717fc6931764c76564a8d2481fd68be5095405f1b62484b1911505","fast_time":0.0089371528,"language":"cpp","measured_fast_code_id":"ac6aee933e717fc6931764c76564a8d2481fd68be5095405f1b62484b1911505","measured_slow_code_id":"1616ea05eff277aec877523316397881cca5d80752941be7284f2a317326309d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77687","problem_id":"p04007","slow_code_id":"077f9391f5290e089d5ea8fe52ca6420490adbc32d4744b97f6edf902e2c522e","slow_id":"1616ea05eff277aec877523316397881cca5d80752941be7284f2a317326309d","slow_time":0.0962443127,"speedup":10.76901277776072,"stratum":"8+","sampling_key":"02be08cfd9edc8b3b37befb1f1796a3bf9421b573c384129f027dcd1c4312bac","slow_code":"#include <bits/stdc++.h>\n\n#define N 100020\n\n#define ll long long\n\nusing namespace std;\n\ninline int read() {\n\n  int x = 0, f = 1;\n  char ch = getchar();\n\n  while (ch > '9' || ch < '0')\n    ch == '-' && (f = 0) || (ch = getchar());\n\n  while (ch <= '9' && ch >= '0')\n    x = (x << 3) + (x << 1) + ch - '0', ch = getchar();\n\n  return f ? x : -x;\n}\n\nchar ch[520][520], chr[520][520], chb[520][520];\n\nint main(int argc, char const *argv[]) {\n\n  int n = read(), m = read();\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%s\", ch[i] + 1);\n\n  memcpy(chb, ch, sizeof ch);\n\n  memcpy(chr, ch, sizeof ch);\n\n  for (int i = 1; i <= m; i++)\n\n    chr[1][i] = chb[n][i] = '#';\n\n  for (int i = 2; i < n; i++)\n\n    chr[i][m] = chb[i][1] = '#';\n\n  for (int i = 2; i < n; i += 2)\n\n    for (int j = 2; j < m; j++)\n\n      chr[i][j] = '#';\n\n  for (int i = 3; i < n; i += 2)\n\n    for (int j = 2; j < m; j++)\n\n      chb[i][j] = '#';\n\n  for (int i = 1; i <= n; i++)\n\n    printf(\"%s\\n\", chr[i] + 1);\n\n  puts(\"\");\n\n  for (int i = 1; i <= n; i++)\n\n    printf(\"%s\\n\", chb[i] + 1);\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#define maxn 505\n\nint n, m;\n\nchar s[3][maxn][maxn];\n\nint main()\n\n{\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++)\n    scanf(\"%s\", s[2][i] + 1);\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= m; j++)\n\n      s[i & 1][i][j] = '#', s[(i & 1) ^ 1][i][j] = '.';\n\n  for (int i = 1; i <= n; i++)\n    s[0][i][1] = s[1][i][m] = '#', s[0][i][m] = s[1][i][1] = '.';\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= m; j++)\n\n      if (s[2][i][j] == '#')\n        s[0][i][j] = s[1][i][j] = '#';\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%s\\n\", s[0][i] + 1);\n\n  printf(\"\\n\");\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%s\\n\", s[1][i] + 1);\n}"}
{"fast_code_id":"ff3c44d9b3dea2ac89434fec2caa9dbd48dbda2e8a62b4f166d525562366e4cc","fast_id":"7582df3ce5c1a412b280297b06353c7f2e74952e5f5bd0eccf18bf4d252a9926","fast_time":0.0555325685,"language":"cpp","measured_fast_code_id":"7582df3ce5c1a412b280297b06353c7f2e74952e5f5bd0eccf18bf4d252a9926","measured_slow_code_id":"da8a3b64eff4c8f8c6399c3f3fc4e8ca30cb809afcf22357d269b1b61038e396","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77709","problem_id":"p02700","slow_code_id":"768890ed8575a6f7e6cf7817717729ca2ebc9d8bcb709b89b46ae12f24bfafa5","slow_id":"da8a3b64eff4c8f8c6399c3f3fc4e8ca30cb809afcf22357d269b1b61038e396","slow_time":0.4675195145,"speedup":8.418834696976065,"stratum":"8+","sampling_key":"10dadd3ab372ea92727f6565e9092de4865c9141b7943185683fffd1b16fda78","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstring s[200005];\n\nint main()\n\n{\n\n  ios::sync_with_stdio(false);\n\n  int a, b, c, d, count1 = 0;\n\n  cin >> a >> b >> c >> d;\n\n  while (a > 0 && c > 0)\n\n  {\n\n    if (count1 % 2)\n\n    {\n\n      a -= d;\n\n      if (a <= 0)\n\n      {\n\n        cout << \"No\" << endl;\n\n        return 0;\n      }\n\n    }\n\n    else\n\n    {\n\n      c -= b;\n\n      if (c <= 0)\n\n      {\n\n        cout << \"Yes\" << endl;\n\n        return 0;\n      }\n    }\n\n    count1++;\n  }\n}\n","fast_code":"#include <iostream>\n\n#include <cstdlib>\n\nusing namespace std;\n\nint a, b, c, d;\n\nint main() {\n\n  cin >> a >> b >> c >> d;\n\n  while (a > 0 && c > 0) {\n\n    c -= b;\n\n    if (c <= 0) {\n      cout << \"Yes\" << endl;\n      exit(0);\n    }\n\n    a -= d;\n\n    if (a <= 0) {\n      cout << \"No\" << endl;\n      exit(0);\n    }\n  }\n\n  return 0;\n}"}
{"fast_code_id":"d4a8e69cf5d5af5a7e69caa7a300f75ae43c87bb0bd1faaaee8fa6d358404ebc","fast_id":"6b01003f0ad4bdc8489bcd1713661fe00cdc1b48f27633c12176969148e05519","fast_time":0.0138628988,"language":"cpp","measured_fast_code_id":"6b01003f0ad4bdc8489bcd1713661fe00cdc1b48f27633c12176969148e05519","measured_slow_code_id":"f7c65f0e732b4aa56897c76f2de7ec824cb9979efcefbbb7eb897495d74905e0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77713","problem_id":"p02689","slow_code_id":"9f7c8a5b46e32d85242e2918bd332a797db641b79ba343487696da1917a8a3e9","slow_id":"f7c65f0e732b4aa56897c76f2de7ec824cb9979efcefbbb7eb897495d74905e0","slow_time":0.4784458802,"speedup":34.51268649526605,"stratum":"8+","sampling_key":"a15168a26694c4865da109cfc47ce462e213b186c272007ccd3e69b9b36461aa","slow_code":"#include <bits/stdc++.h>\n\n#define p_ pair<int, int>\n\n#define mp_ make_pair\n\n#define ll long long\n\n#define pb push_back\n\n#define fi first\n\n#define se second\n\n#define rep(i, a, b) for (int i = a; i <= b; i++)\n\n#define show1(a) cout << #a << \" = \" << a << endl\n\n#define show2(a, b) cout << #a << \" = \" << a << \"; \" << #b << \" = \" << b << endl\n\nusing namespace std;\n\nconst ll INF = 1LL << 60;\n\nconst int inf = 1 << 30;\n\nconst int maxn = 2e5 + 5;\n\ninline void fastio() {\n  ios::sync_with_stdio(false);\n  cin.tie(0);\n  cout.tie(0);\n}\n\nint n, m, a[maxn];\n\nvector<int> g[maxn];\n\nint main()\n\n{\n\n  fastio();\n\n  cin >> n >> m;\n\n  rep(i, 1, n) cin >> a[i];\n\n  rep(i, 1, m) {\n    int u, v;\n    cin >> u >> v;\n    g[u].pb(v), g[v].pb(u);\n  }\n\n  int ans = 0;\n\n  rep(i, 1, n) {\n\n    int sz = g[i].size();\n\n    int flag = 1;\n\n    for (int v : g[i])\n      if (a[v] >= a[i]) {\n        flag = 0;\n        break;\n      }\n\n    if (flag)\n      ans++;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nconst int maxn = 1e5 + 5;\n\nint a[maxn];\n\nint can[maxn];\n\nint main()\n\n{\n\n  int n, m;\n\n  scanf(\"%d%d\", &n, &m);\n\n  for (int i = 1; i <= n; i++) {\n    scanf(\"%d\", &a[i]);\n    can[i] = 1;\n  }\n\n  for (int i = 1; i <= m; i++)\n\n  {\n\n    int u, v;\n\n    scanf(\"%d%d\", &u, &v);\n\n    if (a[u] >= a[v])\n      can[v] = 0;\n\n    if (a[v] >= a[u])\n      can[u] = 0;\n  }\n\n  int ans = 0;\n\n  for (int i = 1; i <= n; i++)\n    if (can[i])\n      ans++;\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"07e0a0e86176e378fd05ce4431fd20cbc40cce20a4ea39fe4cf2ea1f93f34273","fast_id":"2106e15186cf6fcc1e593eaee3c7da4281030ba3db260cb2cf1abc856048b1b5","fast_time":0.0279733889,"language":"cpp","measured_fast_code_id":"2106e15186cf6fcc1e593eaee3c7da4281030ba3db260cb2cf1abc856048b1b5","measured_slow_code_id":"e0f514e83f7812b2e20e5ed5720641b0e76d49a468c85b94384c185bcdc54b05","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77743","problem_id":"p00473","slow_code_id":"a2737a095c6d136902965941dd3d903764dddb58d5a1223972c887379ed918d0","slow_id":"e0f514e83f7812b2e20e5ed5720641b0e76d49a468c85b94384c185bcdc54b05","slow_time":0.1136745152,"speedup":4.063666208136834,"stratum":"4-8","sampling_key":"3507a4b043e41e400940c85b04ac8e3ae63f6bcebf41f203eb6c8501cd7a321c","slow_code":"\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <cstdlib>\n\n#include <cmath>\n\n#include <ctime>\n\n#include <cassert>\n\n#include <string>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <queue>\n\n#include <stack>\n\n#include <functional>\n\n#include <iostream>\n\n#include <map>\n\n#include <set>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\ntypedef pair<int, P> P1;\n\ntypedef pair<P, P> P2;\n\ntypedef long long ll;\n\n#define pu push\n\n#define pb push_back\n\n#define mp make_pair\n\n#define eps 1e-7\n\n#define INF 2000000000\n\n#define f first\n\n#define s second\n\n#define rep(i, x) for (int i = 0; i < x; i++)\n\nint cut[10005];\n\nint dp[2][5005][2];\n\nint main()\n\n{\n\n  srand((unsigned int)time(NULL));\n\n  int n;\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n    scanf(\"%d\", &cut[i]);\n\n  for (int i = 0; i < 2; i++)\n    for (int j = 0; j < 5005; j++)\n      for (int k = 0; k < 2; k++)\n        dp[i][j][k] = 1e8;\n\n  dp[0][1][0] = 0;\n  int cur = 0, nxt = 1;\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    for (int j = 0; j < 5005; j++)\n      for (int k = 0; k < 2; k++)\n        dp[nxt][j][k] = 1e8;\n\n    for (int j = 0; j <= n / 2; j++)\n\n    {\n\n      dp[nxt][j + 1][0] = min(dp[nxt][j + 1][0], dp[cur][j][0]);\n\n      dp[nxt][j][1] = min(dp[nxt][j][1], dp[cur][j][0] + cut[i]);\n\n      dp[nxt][j][1] = min(dp[nxt][j][1], dp[cur][j][1]);\n\n      dp[nxt][j + 1][0] = min(dp[nxt][j + 1][0], dp[cur][j][1] + cut[i]);\n    }\n\n    swap(cur, nxt);\n  }\n\n  printf(\"%d\\n\", min(dp[cur][n / 2][0], dp[cur][n / 2][1]));\n}","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define x 10001\n\nint dp[x][2], num[x];\n\nint main()\n\n{\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    scanf(\"%d\", &num[i]);\n  }\n\n  for (int i = 0; i < x; i++)\n\n  {\n\n    dp[i][0] = x * x;\n\n    dp[i][1] = x * x;\n  }\n\n  dp[1][0] = 0;\n\n  for (int i = 1; i < n; i++)\n\n  {\n\n    for (int j = n / 2; j >= 1; j--)\n\n    {\n\n      dp[j][1] = min(dp[j][1], dp[j][0] + num[i]);\n\n      dp[j][0] = min(dp[j - 1][0], dp[j - 1][1] + num[i]);\n    }\n  }\n\n  printf(\"%d\\n\", min(dp[n / 2][0], dp[n / 2][1]));\n\n  return 0;\n}"}
{"fast_code_id":"6990d8d9ef6f46eafd19b5f02a112870f59db2089251063f68e042c3c18660b2","fast_id":"a45d130791729610d5de5019357efe04d4233d661fac119cf1aa099caab0e5f9","fast_time":0.0089720562,"language":"cpp","measured_fast_code_id":"a45d130791729610d5de5019357efe04d4233d661fac119cf1aa099caab0e5f9","measured_slow_code_id":"02901148da4ee4e39fb46c59cb93eb8e922eb078f341bb1bded0d2f06365b372","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77750","problem_id":"p03837","slow_code_id":"e131fcccdfb9e7a42e4a99ae2d48fa03a061ca15fe4b5858993e4d66179e7f9d","slow_id":"02901148da4ee4e39fb46c59cb93eb8e922eb078f341bb1bded0d2f06365b372","slow_time":0.0530883439,"speedup":5.9170766117136,"stratum":"4-8","sampling_key":"52bb11dca050824f0330afc9b6e6c44fc7a90e0b9323e0c5066ef5f6715369a1","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define Would\n\n#define you\n\n#define please\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int N, M;\n\n  cin >> N >> M;\n\n  int A[101][101] = {};\n\n  rep1(i, 100) {\n\n    rep1(ii, 100) {\n\n      if (i != ii)\n        A[i][ii] = 10000000;\n    }\n  }\n\n  rep(i, M) {\n\n    int a, b, c;\n\n    cin >> a >> b >> c;\n\n    A[a][b] = c;\n\n    A[b][a] = c;\n  }\n\n  int B[101][101] = {};\n\n  rep1(k, N) {\n\n    rep1(i, N) {\n\n      rep1(j, N) {\n\n        if (A[i][k] + A[k][j] < A[i][j]) {\n\n          B[i][j] = 1;\n\n          A[i][j] = A[i][k] + A[k][j];\n        }\n      }\n    }\n  }\n\n  int goukei = 0;\n\n  rep1(i, N) {\n\n    rep1(ii, N) {\n\n      if (B[i][ii])\n        goukei++;\n    }\n  }\n\n  int hennmax = N * (N - 1) / 2;\n\n  co(goukei / 2 + M - hennmax);\n\n  Would you please return 0;\n}","fast_code":"#pragma GCC optimize(\"O3\")\n\n#pragma GCC target(\"avx\")\n\n#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define rep1(i, n) for (int i = 1; i <= (n); i++)\n\n#define co(x) cout << (x) << \"\\n\"\n\n#define cosp(x) cout << (x) << \" \"\n\n#define ce(x) cerr << (x) << \"\\n\"\n\n#define cesp(x) cerr << (x) << \" \"\n\n#define pb push_back\n\n#define mp make_pair\n\n#define chmin(x, y) x = min(x, y)\n\n#define chmax(x, y) x = max(x, y)\n\n#define Would\n\n#define you\n\n#define please\n\nconst int cm = 1 << 15, inf = 1e9;\n\nchar cn[cm], *ci = cn, ct;\n\nbool kotae[100][100];\n\nint main() {\n\n  fread(cn, 1, cm, stdin);\n\n  int N = 0, M = 0;\n\n  while ((ct = *ci++) >= '0')\n    N = N * 10 + ct - '0';\n\n  while ((ct = *ci++) >= '0')\n    M = M * 10 + ct - '0';\n\n  int E[100][100];\n\n  rep(j, N) rep(i, j) E[i][j] = inf;\n\n  rep(i, M) {\n\n    int a = 0, b = 0, c = 0;\n\n    while ((ct = *ci++) >= '0')\n      a = a * 10 + ct - '0';\n\n    while ((ct = *ci++) >= '0')\n      b = b * 10 + ct - '0';\n\n    while ((ct = *ci++) >= '0')\n      c = c * 10 + ct - '0';\n\n    a--;\n\n    b--;\n\n    E[a][b] = c;\n\n    E[b][a] = c;\n  }\n\n  rep(k, N) {\n\n    rep(j, k) {\n\n      rep(i, j) {\n\n        if (E[i][j] > E[i][k] + E[j][k]) {\n\n          E[i][j] = E[i][k] + E[j][k];\n\n          kotae[i][j] = 1;\n        }\n      }\n    }\n\n    for (int j = k + 1; j < N; j++) {\n\n      rep(i, k) {\n\n        if (E[i][j] > E[i][k] + E[k][j]) {\n\n          E[i][j] = E[i][k] + E[k][j];\n\n          kotae[i][j] = 1;\n        }\n      }\n\n      for (int i = k + 1; i < j; i++) {\n\n        if (E[i][j] > E[k][i] + E[k][j]) {\n\n          E[i][j] = E[k][i] + E[k][j];\n\n          kotae[i][j] = 1;\n        }\n      }\n    }\n  }\n\n  int kazu = 0;\n\n  rep(j, N) rep(i, N) kazu += kotae[i][j];\n\n  printf(\"%d\", kazu - N * (N - 1) / 2 + M);\n\n  Would you please return 0;\n}"}
{"fast_code_id":"353ec20bbf0b4ae92722a15e5ff55e5ecf8cb22a20bbbf8af37716615fa539a6","fast_id":"ff6118010a6a4db2cf3ceb6b4570442d4616614cf2f983df6d526d0006970c3b","fast_time":0.0956755691,"language":"cpp","measured_fast_code_id":"ff6118010a6a4db2cf3ceb6b4570442d4616614cf2f983df6d526d0006970c3b","measured_slow_code_id":"50ca9a673533981eea82e7f3a865cc67ef5d21c39d9da41ac18464cd63795a96","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77767","problem_id":"p02814","slow_code_id":"f69f71d6789188440f0927069d7a2e2a3237cccf449ff2613ecac77c64888501","slow_id":"50ca9a673533981eea82e7f3a865cc67ef5d21c39d9da41ac18464cd63795a96","slow_time":0.5701257322,"speedup":5.958947906587367,"stratum":"4-8","sampling_key":"d7481e062b7dd8673e034c29c7ec860710c5a2c4ad7a0ed99772a20da2c2f7fe","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\n#include <map>\n\n#include <iomanip>\n\n#include <limits>\n\n#include <unordered_set>\n\n#include <cmath>\n\n#include <numeric>\n\n#include <array>\n\n#include <complex>\n\nusing namespace std;\n\nlong long p = 1000000007;\n\n#define int long long\n\n#define vel vector<long long>\n\n#define vvel vector<vel>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define sor(v) sort(v.begin(), v.end())\n\n#define mmax(a, b) a = max(a, b)\n\n#define mmin(a, b) a = min(a, b)\n\n#define mkp make_pair\n\n#define pin pair<int, int>\n\n#define qin pair<pin, int>\n\n#define V vector\n\n#define Endl endl\n\n#define veb vector<bool>\n\n#define fcout cout << fixed << setprecision(15)\n\n#define rev(s) reverse(s.begin(), s.end())\n\n#define lower(h, val) lower_bound(h.begin(), h.end(), val) - h.begin()\n\n#define upper(h, val) upper_bound(h.begin(), h.end(), val) - h.begin()\n\nint max_kai = 300000;\n\nvel kai(max_kai, 1);\n\nvel inv_kai(max_kai, 1);\n\nint rui(int a, int n, int mod) {\n\n  if (n == 0) {\n    return 1 % mod;\n  }\n\n  int x = rui(a, n / 2, mod);\n\n  x *= x;\n  x %= mod;\n\n  if (n % 2 == 1) {\n    x *= a;\n    x %= mod;\n  }\n\n  return x;\n}\n\nint root(int x, vel &pa) {\n\n  if (pa[x] == -1) {\n    return x;\n  }\n\n  int ans = root(pa[x], pa);\n  pa[x] = ans;\n\n  return ans;\n}\n\nbool mar(int x, int y, vel &pa) {\n\n  x = root(x, pa);\n\n  y = root(y, pa);\n\n  if (x != y) {\n    pa[x] = y;\n  }\n\n  return (x != y);\n}\n\nint gcd(int x, int y) {\n\n  if (x < y) {\n    return gcd(y, x);\n  }\n\n  if (y == 0) {\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint lcm(int x, int y) {\n\n  x = abs(x);\n  y = abs(y);\n\n  return x * y / gcd(x, y);\n}\n\nlong long modinv(long long a, long long m) {\n\n  long long b = m, u = 1, v = 0;\n\n  while (b) {\n\n    long long t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvoid make_kai() {\n\n  rep(i, max_kai - 1) {\n\n    kai[i + 1] = kai[i] * (i + 1);\n    kai[i + 1] %= p;\n\n    inv_kai[i + 1] = modinv(kai[i + 1], p);\n  }\n}\n\nint com(int n, int r) {\n\n  if ((n < 0) || (r < 0) || (r > n)) {\n    return 0;\n  }\n\n  int ans = (kai[n] * inv_kai[r]) % p;\n\n  return (ans * inv_kai[n - r]) % p;\n}\n\nvel uni(vel x) {\n\n  if (x.size() == 0) {\n    return x;\n  }\n\n  sor(x);\n\n  int n = x.size();\n\n  vel ans(1, x[0]);\n\n  for (int j = 1; j < n; j++) {\n\n    if (x[j - 1] != x[j]) {\n      ans.push_back(x[j]);\n    }\n  }\n\n  x = ans;\n\n  return x;\n}\n\nvoid pr(vel &v) {\n\n  int n = v.size();\n\n  if (n != 0) {\n\n    cout << v[0];\n\n    rep(i, n - 1) { cout << \" \" << v[i + 1]; }\n\n    cout << endl;\n  }\n}\n\nvel dijk(V<V<pin>> &way, int st, int inf) {\n\n  int n = way.size();\n\n  vel dist(n, inf);\n  dist[st] = 0;\n\n  priority_queue<pin, vector<pin>, greater<pin>> pq;\n\n  pq.push(mkp(0, st));\n\n  veb is_checked(n, false);\n\n  while (!pq.empty()) {\n\n    pin x = pq.top();\n    pq.pop();\n\n    int pot = x.second;\n\n    if (!is_checked[pot]) {\n\n      is_checked[pot] = true;\n\n      for (auto y : way[pot]) {\n\n        int nex_dist = x.first + y.second;\n\n        int nex_pot = y.first;\n\n        if (dist[nex_pot] > nex_dist) {\n\n          dist[nex_pot] = nex_dist;\n\n          pq.push(mkp(nex_dist, y.first));\n        }\n      }\n    }\n  }\n\n  return dist;\n}\n\ntemplate <typename Monoid>\n\nstruct SegmentTree {\n\n  using F = function<Monoid(Monoid, Monoid)>;\n\n  int sz;\n\n  vector<Monoid> seg;\n\n  const F f;\n\n  const Monoid M1;\n\n  SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {\n\n    sz = 1;\n\n    while (sz < n)\n      sz <<= 1;\n\n    seg.assign(2 * sz, M1);\n  }\n\n  void set(int k, const Monoid &x) { seg[k + sz] = x; }\n\n  void build() {\n\n    for (int k = sz - 1; k > 0; k--) {\n\n      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n    }\n  }\n\n  void update(int k, const Monoid &x) {\n\n    k += sz;\n\n    seg[k] = x;\n\n    while (k >>= 1) {\n\n      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n    }\n  }\n\n  Monoid query(int a, int b) {\n\n    Monoid L = M1, R = M1;\n\n    for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n\n      if (a & 1)\n        L = f(L, seg[a++]);\n\n      if (b & 1)\n        R = f(seg[--b], R);\n    }\n\n    return f(L, R);\n  }\n\n  Monoid operator[](const int &k) const { return seg[k + sz]; }\n\n  template <typename C>\n\n  int find_subtree(int a, const C &check, Monoid &M, bool type) {\n\n    while (a < sz) {\n\n      Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);\n\n      if (check(nxt))\n        a = 2 * a + type;\n\n      else\n        M = nxt, a = 2 * a + 1 - type;\n    }\n\n    return a - sz;\n  }\n\n  template <typename C>\n\n  int find_first(int a, const C &check) {\n\n    Monoid L = M1;\n\n    if (a <= 0) {\n\n      if (check(f(L, seg[1])))\n        return find_subtree(1, check, L, false);\n\n      return -1;\n    }\n\n    int b = sz;\n\n    for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n\n      if (a & 1) {\n\n        Monoid nxt = f(L, seg[a]);\n\n        if (check(nxt))\n          return find_subtree(a, check, L, false);\n\n        L = nxt;\n\n        ++a;\n      }\n    }\n\n    return -1;\n  }\n\n  template <typename C>\n\n  int find_last(int b, const C &check) {\n\n    Monoid R = M1;\n\n    if (b >= sz) {\n\n      if (check(f(seg[1], R)))\n        return find_subtree(1, check, R, true);\n\n      return -1;\n    }\n\n    int a = sz;\n\n    for (b += sz; a < b; a >>= 1, b >>= 1) {\n\n      if (b & 1) {\n\n        Monoid nxt = f(seg[--b], R);\n\n        if (check(nxt))\n          return find_subtree(b, check, R, true);\n\n        R = nxt;\n      }\n    }\n\n    return -1;\n  }\n};\n\nvel mul(vel &a, vel &b) {\n\n  int n = a.size();\n\n  int m = b.size();\n\n  vel ans(n + m - 1, 0);\n\n  rep(i, n) {\n\n    rep(j, m) {\n\n      ans[i + j] += a[i] * b[j];\n\n      ans[i + j] %= p;\n    }\n  }\n\n  return ans;\n}\n\nint rui_p(int &a, int n) {\n\n  if (n == 0) {\n    return 1;\n  }\n\n  int qans = rui_p(a, n / 2);\n\n  qans = qans * qans;\n\n  qans %= p;\n\n  if (n % 2 == 1) {\n\n    qans = qans * a;\n    qans %= p;\n  }\n\n  return qans;\n}\n\nvvel disj_min(vel &v) {\n\n  int n = v.size();\n\n  vvel ret(22, vel(n));\n\n  ret[0] = v;\n\n  rep(i, 21) {\n\n    rep(j, n) {\n\n      int nex = j + (1 << i);\n\n      if (nex < n) {\n\n        ret[i + 1][j] = min(ret[i][j], ret[i][nex]);\n\n      }\n\n      else {\n\n        ret[i + 1][j] = ret[i][j];\n      }\n    }\n  }\n\n  return ret;\n}\n\nvvel disj_max(vel &v) {\n\n  int n = v.size();\n\n  vvel ret(20, vel(n));\n\n  ret[0] = v;\n\n  rep(i, 19) {\n\n    rep(j, n) {\n\n      int nex = j + (1 << i);\n\n      if (nex < n) {\n\n        ret[i + 1][j] = max(ret[i][j], ret[i][nex]);\n\n      }\n\n      else {\n\n        ret[i + 1][j] = ret[i][j];\n      }\n    }\n  }\n\n  return ret;\n}\n\nint find_min(vvel &dv, int l, int r) {\n\n  int i = 19;\n\n  while (l + (1 << i) > r) {\n\n    i--;\n  }\n\n  return min(dv[i][l], dv[i][r - (1 << i)]);\n}\n\nint find_max(vvel &dv, int l, int r) {\n\n  int i = 19;\n\n  while (l + (1 << i) > r) {\n\n    i--;\n  }\n\n  return max(dv[i][l], dv[i][r - (1 << i)]);\n}\n\nbool is_prime(int n) {\n\n  if (n == 0 || n == 1) {\n    return false;\n  }\n\n  for (int i = 2; i * i <= n; i++) {\n\n    if (n % i == 0) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nsigned main() {\n\n  int n, m;\n  cin >> n >> m;\n\n  int lc1 = 1;\n\n  vel a(n);\n\n  rep(i, n) {\n\n    int ai;\n    cin >> ai;\n    ai /= 2;\n\n    lc1 = lcm(lc1, ai);\n\n    if (lc1 > m) {\n      cout << 0 << endl;\n      return 0;\n    }\n\n    a[i] = ai;\n  }\n\n  rep(i, n) {\n\n    if ((lc1 / a[i]) % 2 == 0) {\n      cout << 0 << endl;\n      return 0;\n    }\n  }\n\n  int ans = m / lc1;\n\n  ans = (ans + 1) / 2;\n\n  cout << ans << endl;\n\n  return 0;\n}","fast_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <string>\n\n#include <set>\n\n#include <queue>\n\n#include <stack>\n\n#include <bitset>\n\n#include <functional>\n\n#include <map>\n\n#include <iomanip>\n\n#include <limits>\n\n#include <unordered_set>\n\n#include <cmath>\n\n#include <numeric>\n\n#include <array>\n\n#include <utility>\n\n#include <complex>\n\n#define M_PI 3.141592653589793238\n\nusing namespace std;\n\nlong long p = 1000000007;\n\n#define upperbound(v, val) upper_bound(v.begin(), v.end(), val) - v.begin()\n\n#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val) - v.begin()\n\n#define int long long\n\n#define ll long long\n\n#define vel vector<ll>\n\n#define vvel vector<vel>\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n\n#define sor(v) sort(v.begin(), v.end())\n\n#define mmax(a, b) a = max(a, b)\n\n#define mmin(a, b) a = min(a, b)\n\n#define mkp(a, b) make_pair(a, b)\n\n#define pin pair<ll, ll>\n\n#define qin pair<pin, int>\n\n#define V vector\n\n#define Endl endl\n\n#define veb vector<bool>\n\n#define fcout cout << fixed << setprecision(15)\n\n#define rev(s) reverse(s.begin(), s.end())\n\n#define lower(h, val) (lower_bound(h.begin(), h.end(), val) - h.begin())\n\n#define upper(h, val) (upper_bound(h.begin(), h.end(), val) - h.begin())\n\n#define vveb V<veb>\n\n#define omajinai                                                               \\\n  cin.tie(0);                                                                  \\\n  ios::sync_with_stdio(false);\n\n#define endl \"\\n\"\n\n#define pb push_back\n\nvel kai;\n\nvel inv_kai;\n\nint root(int x, vel &pa) {\n\n  if (pa[x] == -1) {\n    return x;\n  }\n\n  int ans = root(pa[x], pa);\n  pa[x] = ans;\n\n  return ans;\n}\n\nbool mar(int x, int y, vel &pa) {\n\n  x = root(x, pa);\n\n  y = root(y, pa);\n\n  if (x != y) {\n    pa[x] = y;\n  }\n\n  return (x != y);\n}\n\nint gcd(int x, int y) {\n\n  if (x < y) {\n    return gcd(y, x);\n  }\n\n  if (y == 0) {\n    return x;\n  }\n\n  return gcd(y, x % y);\n}\n\nint lcm(ll x, ll y) {\n\n  x = abs(x);\n  y = abs(y);\n\n  return x * (y / gcd(x, y));\n}\n\nlong long modinv(long long a, long long m) {\n\n  long long b = m, u = 1, v = 0;\n\n  while (b) {\n\n    long long t = a / b;\n\n    a -= t * b;\n    swap(a, b);\n\n    u -= t * v;\n    swap(u, v);\n  }\n\n  u %= m;\n\n  if (u < 0)\n    u += m;\n\n  return u;\n}\n\nvoid make_kai(int max_kai, int p) {\n\n  kai = vel(max_kai, 1);\n\n  inv_kai = kai;\n\n  rep(i, max_kai - 1) {\n\n    kai[i + 1] = kai[i] * (i + 1);\n    kai[i + 1] %= p;\n\n    inv_kai[i + 1] = modinv(kai[i + 1], p);\n  }\n}\n\nint com(int n, int r) {\n\n  if ((n < 0) || (r < 0) || (r > n)) {\n    return 0;\n  }\n\n  int ans = (kai[n] * inv_kai[r]) % p;\n\n  return (ans * inv_kai[n - r]) % p;\n}\n\nvel uni(vel x) {\n\n  if (x.size() == 0) {\n    return x;\n  }\n\n  sor(x);\n\n  int n = x.size();\n\n  vel ans(1, x[0]);\n\n  for (int j = 1; j < n; j++) {\n\n    if (x[j - 1] != x[j]) {\n      ans.push_back(x[j]);\n    }\n  }\n\n  x = ans;\n\n  return x;\n}\n\nvel dijk(V<V<pin>> &way, int st, int inf) {\n\n  int n = way.size();\n\n  vel dist(n, inf);\n  dist[st] = 0;\n\n  priority_queue<pin, vector<pin>, greater<pin>> pq;\n\n  pq.push(mkp(0, st));\n\n  veb is_checked(n, false);\n\n  while (!pq.empty()) {\n\n    pin x = pq.top();\n    pq.pop();\n\n    int pot = x.second;\n\n    if (!is_checked[pot]) {\n\n      is_checked[pot] = true;\n\n      for (auto y : way[pot]) {\n\n        int nex_dist = x.first + y.second;\n\n        int nex_pot = y.first;\n\n        if (dist[nex_pot] > nex_dist) {\n\n          dist[nex_pot] = nex_dist;\n\n          pq.push(mkp(nex_dist, y.first));\n        }\n      }\n    }\n  }\n\n  return dist;\n}\n\nvoid make_tree(vvel &chi, vel &par, int n) {\n\n  V<V<pin>> way(n);\n\n  rep(i, n - 1) {\n\n    int a, b;\n    cin >> a >> b;\n    a--;\n    b--;\n\n    way[a].push_back(mkp(b, 1));\n\n    way[b].push_back(mkp(a, 1));\n  }\n\n  vel dist = dijk(way, 0, n + 1);\n\n  par = vel(n, -1);\n\n  chi = vvel(n);\n\n  rep(i, n) {\n\n    for (auto nex : way[i]) {\n\n      int pot = nex.first;\n\n      if (dist[pot] > dist[i]) {\n        chi[i].push_back(pot);\n      }\n\n      else {\n        par[i] = pot;\n      }\n    }\n  }\n}\n\nvoid pri(vel &v) {\n\n  if (v.size() == 0) {\n    return;\n  }\n\n  cout << v[0];\n\n  rep(i, v.size() - 1) { cout << \" \" << v[i + 1]; }\n\n  cout << endl;\n\n  return;\n}\n\nint modpow(int a, int n, int p) {\n\n  if (n == 0) {\n    return 1;\n  }\n\n  int m = n / 2;\n\n  int x = modpow(a, n / 2, p);\n\n  x *= x;\n  x %= p;\n\n  if (n % 2 == 1) {\n    x *= a;\n    x %= p;\n  }\n\n  return x;\n}\n\nint solve(int n, int x, vel &a, vel &b) {\n\n  if (n == 0) {\n\n    return x;\n  }\n\n  if (x == 0) {\n    return 0;\n  }\n\n  if (x <= a[n - 1] + 1) {\n    return solve(n - 1, x - 1, a, b);\n  }\n\n  return b[n - 1] + 1 + solve(n - 1, min(x - a[n - 1] - 2, a[n - 1]), a, b);\n}\n\nsigned main() {\n\n  int n, m;\n  cin >> n >> m;\n\n  vel a(n);\n\n  rep(i, n) {\n    cin >> a[i];\n    a[i] /= 2;\n  }\n\n  vel b = a;\n\n  while (true) {\n\n    int cnt = 0;\n\n    rep(i, n) {\n\n      if (b[i] % 2 == 0) {\n        cnt++;\n        b[i] /= 2;\n      }\n    }\n\n    if (cnt == 0) {\n      break;\n    }\n\n    if (cnt < n) {\n      cout << 0 << endl;\n      return 0;\n    }\n  }\n\n  int lc = 1;\n\n  rep(i, n) {\n\n    lc = lcm(lc, a[i]);\n\n    if (lc > m) {\n      cout << 0 << endl;\n      return 0;\n    }\n  }\n\n  int ans = m / lc;\n\n  cout << (ans + 1) / 2 << endl;\n\n  return 0;\n}"}
{"fast_code_id":"eadf61fa72846163f8c41bb96f574e82263f48ff7fdcbea86223d717369c3947","fast_id":"64a6c360e187ab70ed59a5e148cf5fcf93f5fa56480da32301c554ec17852f6e","fast_time":0.0193564494,"language":"cpp","measured_fast_code_id":"64a6c360e187ab70ed59a5e148cf5fcf93f5fa56480da32301c554ec17852f6e","measured_slow_code_id":"cf3587bed6e299180512d7ac5daf65707b84694de5a2d5fca07129888b8d4581","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77828","problem_id":"p03777","slow_code_id":"55728bfb548fc2873adfb4e1f8f33164735026a7d80aec23bf4810abfd66e591","slow_id":"cf3587bed6e299180512d7ac5daf65707b84694de5a2d5fca07129888b8d4581","slow_time":0.1097046768,"speedup":5.667603315719669,"stratum":"4-8","sampling_key":"8fd984ebcd5ed73b798d520fefb8e4e594705879f6d88798af0fde512bb1242c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  char a[1000000], b[1000000];\n\n  int n;\n\n  cin >> a >> b;\n\n  n = strcmp(a, b);\n\n  if (n == 0)\n    cout << \"H\";\n\n  else\n    cout << \"D\";\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  char a, b, t;\n\n  scanf(\"%c%c%c\", &a, &t, &b);\n\n  if (a == b)\n\n    printf(\"H\\n\");\n\n  else\n\n    printf(\"D\\n\");\n\n  return 0;\n}"}
{"fast_code_id":"24b0d8ca40f0ee3f146001366a85f515b3f9004bee8aef61aaa223f1889c92fa","fast_id":"79f20b1263b1e6152a86ef522681706e034d780c15da860fb170f49a24b59c8b","fast_time":0.0001912408,"language":"cpp","measured_fast_code_id":"79f20b1263b1e6152a86ef522681706e034d780c15da860fb170f49a24b59c8b","measured_slow_code_id":"c50e627bdb69f22e71aa808e3ea49242625ce9c33b394d9b04828b6a3ab9a4d1","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77855","problem_id":"p03493","slow_code_id":"c04c268400d8df89b01eff58644e111ed315fa5dca1877205f8ed3e6aabdd03a","slow_id":"c50e627bdb69f22e71aa808e3ea49242625ce9c33b394d9b04828b6a3ab9a4d1","slow_time":0.0010099441,"speedup":5.281007504674736,"stratum":"4-8","sampling_key":"b4078e8fcec1fe7e1934d4e4edc741ccca259803a95f7297a2cd5ce810dec935","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  int n, m;\n\n  int a, b;\n\n  char c;\n\n  int ans = 0;\n\n  for (int i = 0; i < 3; i++) {\n\n    cin >> c;\n\n    if (c == '1')\n\n      ans++;\n  }\n\n  cout << ans << endl;\n\n  return (0);\n}","fast_code":"#include <cstdio>\n\nusing namespace std;\n\nint main()\n\n{\n\n  int s;\n\n  int ans = 0;\n\n  for (int i = 0; i < 3; i++) {\n\n    scanf(\"%1d\", &s);\n\n    ans += s;\n  }\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}\n"}
{"fast_code_id":"f9b13808ca5c715cf35a2039e5a37bd8bf4562b5ebbb40d51f1e108b47ff58b0","fast_id":"34c7dbed74896bbf131c7f6be28905d996aa34bdacb335040d6f0f8395c7dd16","fast_time":0.0151909529,"language":"cpp","measured_fast_code_id":"34c7dbed74896bbf131c7f6be28905d996aa34bdacb335040d6f0f8395c7dd16","measured_slow_code_id":"1267ebd6b2a60b96f7a59542472884edf1941d56128e0f18e5dd9409f2d6dd7a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77884","problem_id":"p03841","slow_code_id":"73903eb621ec0d6eedc8d75ab8331cdbabbe855d5cd2a3407e590a506f43774a","slow_id":"1267ebd6b2a60b96f7a59542472884edf1941d56128e0f18e5dd9409f2d6dd7a","slow_time":0.1611896795,"speedup":10.610899827093794,"stratum":"8+","sampling_key":"7bde0b6e3babad1f1ecc87fa9ac001d3d2563ebb1208b99fe6c3da6da00d65c0","slow_code":"#include <bits/stdc++.h>\n\n#define ll long long\n\n#define pb push_back\n\n#define mp make_pair\n\nint cnt[501];\n\nbool was[501];\n\nusing namespace std;\n\nint N;\n\nbool can = true;\n\nint a[250001];\n\nint pos[500];\n\nvector<pair<int, int> > g;\n\nint main()\n\n{\n\n  memset(a, -1, sizeof a);\n\n  scanf(\"%d\", &N);\n\n  for (int i = 1; i <= N; i++)\n\n  {\n\n    cnt[i] = 1;\n\n    int x;\n\n    scanf(\"%d\", &x);\n\n    pos[i] = x;\n\n    a[x] = i;\n\n    g.pb(mp(x, i));\n  }\n\n  sort(g.begin(), g.end());\n\n  for (int i = 0; i < g.size(); i++)\n\n  {\n\n    int curPos = g[i].first;\n\n    int x = g[i].second;\n\n    int cur = x;\n\n    for (int i = 1; i < curPos; i++)\n\n    {\n\n      if (a[i] != -1)\n\n        continue;\n\n      if (cnt[cur] < cur)\n\n      {\n\n        a[i] = cur;\n\n        cnt[cur]++;\n      }\n    }\n\n    if (cnt[cur] != cur)\n\n    {\n\n      printf(\"No\");\n\n      return 0;\n    }\n  }\n\n  for (int i = 1; i <= N; i++)\n\n  {\n\n    for (int j = pos[i] + 1; j <= N * N; j++)\n\n    {\n\n      if (a[j] != -1)\n\n        continue;\n\n      if (cnt[i] < N)\n\n      {\n\n        a[j] = i;\n\n        cnt[i]++;\n      }\n    }\n\n    if (cnt[i] < N)\n\n    {\n\n      printf(\"No\");\n\n      return 0;\n    }\n  }\n\n  if (!can)\n\n  {\n\n    printf(\"No\");\n\n    return 0;\n  }\n\n  printf(\"Yes\\n\");\n\n  for (int i = 1; i <= N * N; i++)\n\n    printf(\"%d \", a[i]);\n}\n","fast_code":"#include <cstdio>\n\n#include <algorithm>\n\nusing namespace std;\n\n#define MAXN 510\n\n#define MAXM 250010\n\nint a[MAXM], f[MAXN], x[MAXN], n, ls = 1;\n\nbool cmp(int a, int b)\n\n{\n\n  return x[a] < x[b];\n}\n\nint main()\n\n{\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    scanf(\"%d\", &x[i]);\n\n    a[x[i]] = i;\n\n    f[i] = i;\n  }\n\n  sort(f + 1, f + 1 + n, cmp);\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int k = f[i];\n\n    for (int j = 1; j < k; j++)\n\n    {\n\n      while (a[ls])\n        ls++;\n\n      if (ls > x[k])\n\n      {\n\n        printf(\"No\\n\");\n\n        return 0;\n      }\n\n      a[ls] = k;\n    }\n  }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    int k = f[i];\n\n    for (int j = 1; j <= n - k; j++)\n\n    {\n\n      while (a[ls])\n        ls++;\n\n      if (ls < x[k] || ls > n * n)\n\n      {\n\n        printf(\"No\\n\");\n\n        return 0;\n      }\n\n      a[ls] = k;\n    }\n  }\n\n  printf(\"Yes\\n\");\n\n  for (int i = 1; i <= n * n; i++)\n\n    printf(\"%d \", a[i]);\n}"}
{"fast_code_id":"affcd6c63b84a83004d8c9433526d04e096ba63391c0084563aff0d3e1f2dfc0","fast_id":"376767d5b5890d221580f4453e2d73f02be429abe9bce20aa7b5d7a019b32d19","fast_time":0.1074956723,"language":"cpp","measured_fast_code_id":"376767d5b5890d221580f4453e2d73f02be429abe9bce20aa7b5d7a019b32d19","measured_slow_code_id":"e08c258d8d9a4f55db6e31da31240aa7172880b23cf0f9b1a3d0533e19542dbd","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77925","problem_id":"p02701","slow_code_id":"6433f78888b68fcecfee7d8db35e73c5cb264fedb4751096f72dedbbb9fc719e","slow_id":"e08c258d8d9a4f55db6e31da31240aa7172880b23cf0f9b1a3d0533e19542dbd","slow_time":0.8831707053,"speedup":8.215872196559117,"stratum":"8+","sampling_key":"039eee1e338022678b8d0d8f4f72e2fea23d7704b572fc8e0aa14b6e706c4fed","slow_code":"#include <iostream>\n\n#include <algorithm>\n\n#include <string>\n\nusing namespace std;\n\nint n, i, s;\n\nstring a[200001];\n\nint main() {\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n    cin >> a[i];\n\n  sort(a, a + n);\n\n  s = 1;\n\n  for (i = 1; i < n; i++) {\n\n    if (a[i] != a[i - 1])\n      s++;\n  }\n\n  cout << s << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  int N;\n\n  cin >> N;\n\n  int Size = ceil(sqrt(N));\n\n  vector<string> table[Size];\n\n  int sum = 0;\n\n  while (N-- > 0) {\n\n    string S;\n\n    cin >> S;\n\n    int temp = 0;\n\n    for (int a = 0; a < S.size(); a++) {\n\n      temp += S[a] - 'a' + 1;\n\n      temp *= 26;\n\n      temp %= Size;\n    }\n\n    int found = false;\n\n    for (int a = 0; a < table[temp].size(); a++) {\n\n      if (S.compare(table[temp][a]) == 0) {\n\n        found = true;\n\n        break;\n      }\n    }\n\n    if (!found) {\n\n      sum++;\n\n      table[temp].push_back(S);\n    }\n  }\n\n  cout << sum << endl;\n\n  return 0;\n}\n"}
{"fast_code_id":"791721c26f5304517168e82f1edba15e3bbf3186f26a7f54e8725217c52e5764","fast_id":"1b49e8b29e6d15f698bf87047e0dca4d064ffb4255cb90fbf6f844cbf5a8f28a","fast_time":0.0613586002,"language":"cpp","measured_fast_code_id":"1b49e8b29e6d15f698bf87047e0dca4d064ffb4255cb90fbf6f844cbf5a8f28a","measured_slow_code_id":"7df8b647df7694522c8467a1156e3c4d669d3cbc2d22377bd22d7e30056a65b8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77934","problem_id":"p01257","slow_code_id":"b6a5fba2d7c531f710707b7b40afb6df2618e229b7a4798a5f6e4de5d971d9c4","slow_id":"7df8b647df7694522c8467a1156e3c4d669d3cbc2d22377bd22d7e30056a65b8","slow_time":0.1608375846,"speedup":2.6212720641563787,"stratum":"2-4","sampling_key":"dc4827eef55c2376c18934518ba49317f5257848089d231cd3a8465d92f0bdc9","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\n\nint A[10];\n\nint dp[100001];\n\nbool Check(int k)\n\n{\n\n  fill_n(dp, 100001, -1);\n\n  dp[0] = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    for (int j = 0; j <= M; j++) {\n\n      if (dp[j] >= 0) {\n\n        dp[j] = k;\n\n      } else if (j < A[i] || dp[j - A[i]] <= 0) {\n\n        dp[j] = -1;\n\n      } else {\n\n        dp[j] = dp[j - A[i]] - 1;\n      }\n    }\n  }\n\n  return (dp[M] >= 0);\n}\n\nint main()\n\n{\n\n  while (cin >> N >> M, N) {\n\n    for (int i = 0; i < N; i++) {\n\n      cin >> A[i];\n    }\n\n    sort(A, A + N, greater<int>());\n\n    int low = 0, high = M;\n\n    while (high - low > 0) {\n\n      int mid = (low + high) >> 1;\n\n      if (Check(mid))\n        high = mid;\n\n      else\n        low = mid + 1;\n    }\n\n    cout << low << endl;\n  }\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\n\nint A[10];\n\nint dp[100001];\n\nbool Check(int k)\n\n{\n\n  memset(dp, -1, sizeof(int) * (M + 1));\n\n  dp[0] = 0;\n\n  for (int i = 0; i < N; i++) {\n\n    for (int j = 0; j <= M; j++) {\n\n      if (dp[j] >= 0) {\n\n        dp[j] = k;\n\n      } else if (j < A[i] || dp[j - A[i]] <= 0) {\n\n        dp[j] = -1;\n\n      } else {\n\n        dp[j] = dp[j - A[i]] - 1;\n      }\n    }\n  }\n\n  return (dp[M] >= 0);\n}\n\nint main()\n\n{\n\n  while (cin >> N >> M, N) {\n\n    for (int i = 0; i < N; i++) {\n\n      cin >> A[i];\n    }\n\n    int low = 0, high = M / *min_element(A, A + N);\n\n    while (high - low > 0) {\n\n      int mid = (low + high) >> 1;\n\n      if (Check(mid))\n        high = mid;\n\n      else\n        low = mid + 1;\n    }\n\n    cout << low << endl;\n  }\n}"}
{"fast_code_id":"7bc1a971d61000287201ad4f8616a31b0f7bf597c61959f8f777b9d4b9c6911c","fast_id":"89af44362287011399c48b1424cc400e039830ce5c82662f68cad6d180df2383","fast_time":0.108160455,"language":"cpp","measured_fast_code_id":"89af44362287011399c48b1424cc400e039830ce5c82662f68cad6d180df2383","measured_slow_code_id":"a42fec86621bde2acbbf633e17d9451982ecafa934ae3215a0193be82268e9d8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_77966","problem_id":"p03866","slow_code_id":"1a97a3f55cae2fede5f4549bc190bf43b71b9f7c4739a92e2fd83ede525d08be","slow_id":"a42fec86621bde2acbbf633e17d9451982ecafa934ae3215a0193be82268e9d8","slow_time":0.9251973039,"speedup":8.553933171786305,"stratum":"8+","sampling_key":"69cf9ac447b44e47348504edacc87282e569072eee65434c95f6c5c441669d5d","slow_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\n#include <cmath>\n\n#define MAXN 1000\n\nusing namespace std;\n\ndouble sx, sy, tx, ty;\n\nstruct Circle\n\n{\n\n  double x, y, r;\n\n} C[MAXN + 5];\n\nbool vis[MAXN + 5];\n\ndouble G[MAXN + 5][MAXN + 5];\n\nvoid Init()\n\n{\n\n  for (int i = 0; i <= MAXN + 3; i++)\n\n    for (int j = 0; j <= MAXN + 3; j++)\n\n      G[i][j] = -1.0;\n}\n\ndouble Getlen(double x1, double y1, double x2, double y2)\n\n{\n\n  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n}\n\nbool Intersect(int a, int b)\n\n{\n\n  double len = Getlen(C[a].x, C[a].y, C[b].x, C[b].y);\n\n  double totr = C[a].r + C[b].r;\n\n  if (len <= totr)\n\n    return true;\n\n  return false;\n}\n\nint n;\n\ndouble dist[MAXN + 5];\n\ndouble Dijkstra(int s)\n\n{\n\n  memset(vis, 0, sizeof(vis));\n\n  for (int i = 0; i <= MAXN + 3; i++)\n\n    dist[i] = -1;\n\n  dist[s] = 0;\n\n  vis[s] = true;\n\n  int u = s, nu, cnt = 1;\n\n  for (int i = 1; i <= n + 2; i++)\n\n  {\n\n    double mindist = -1;\n\n    for (int v = 0; v <= n; v++)\n\n    {\n\n      if (G[u][v] == -1)\n\n        continue;\n\n      if (dist[v] > dist[u] + G[u][v] || dist[v] == -1)\n\n        dist[v] = dist[u] + G[u][v];\n\n      if ((mindist == -1 || dist[v] < mindist) && vis[v] == false)\n\n      {\n\n        mindist = dist[v];\n\n        nu = v;\n      }\n    }\n\n    vis[nu] = true;\n\n    u = nu;\n  }\n\n  return dist[n];\n}\n\nint main()\n\n{\n\n  Init();\n\n  scanf(\"%lf %lf %lf %lf\", &sx, &sy, &tx, &ty);\n\n  scanf(\"%d\", &n);\n\n  for (int i = 1; i <= n; i++)\n\n    scanf(\"%lf %lf %lf\", &C[i].x, &C[i].y, &C[i].r);\n\n  for (int i = 1; i <= n; i++)\n\n    for (int j = 1; j <= n; j++)\n\n    {\n\n      double len =\n          max(Getlen(C[i].x, C[i].y, C[j].x, C[j].y) - C[i].r - C[j].r, 0.0);\n\n      if (G[i][j] == -1 || len < G[i][j])\n\n        G[i][j] = len;\n    }\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    double len = max(Getlen(sx, sy, C[i].x, C[i].y) - C[i].r, 0.0);\n\n    if (G[i][0] == -1 || len < G[0][i])\n\n      G[i][0] = G[0][i] = len;\n\n    len = max(Getlen(tx, ty, C[i].x, C[i].y) - C[i].r, 0.0);\n\n    if (G[i][n + 1] == -1 || len < G[i][n + 1])\n\n      G[i][n + 1] = G[n + 1][i] = len;\n  }\n\n  n++;\n\n  G[0][n] = G[n][0] = Getlen(sx, sy, tx, ty);\n\n  double ans = Dijkstra(0);\n\n  printf(\"%.10lf\\n\", ans);\n\n  return 0;\n}","fast_code":"\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rall(x) x.rbegin(), x.rend()\n\n#define all(x) x.begin(), x.end()\n\n#define fi first\n\n#define se second\n\n#define pb push_back\n\nusing ll = long long;\n\nusing ii = pair<int, int>;\n\nusing di = pair<double, int>;\n\nusing minHeap = priority_queue<di, vector<di>, greater<di>>;\n\nvoid in(int &x);\n\nconst double INF = 1e18;\n\nconst int N = 1050;\n\n#define singleCase\n\nint xs, ys, xf, yf, n;\n\ndouble dist[N][N], x[N], y[N], r[N], d[N];\n\nbool vis[N];\n\ndouble distBetweenPoints(double x1, double y1, double x2, double y2) {\n\n  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n}\n\ndouble getDist(int u, int v) {\n\n  double shortestPath = distBetweenPoints(x[u], y[u], x[v], y[v]);\n\n  return max(0.0, shortestPath - r[u] - r[v]);\n}\n\nvoid work() {\n\n  scanf(\"%d%d%d%d%d\", &xs, &ys, &xf, &yf, &n);\n\n  x[0] = xs, y[0] = ys, r[0] = 0;\n\n  x[n + 1] = xf, y[n + 1] = yf, r[n + 1] = 0;\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%lf%lf%lf\", &x[i], &y[i], &r[i]);\n  }\n\n  fill(d, d + N, INF);\n\n  for (int i = 0; i <= n + 1; i++) {\n\n    for (int j = 1 + i; j <= n + 1; j++) {\n\n      dist[i][j] = getDist(i, j);\n\n      dist[j][i] = dist[i][j];\n    }\n  }\n\n  minHeap pq;\n\n  pq.push({0, 0});\n\n  double sol = -1;\n\n  while (pq.size()) {\n\n    di cur = pq.top();\n    pq.pop();\n\n    double cd = cur.fi;\n\n    int u = cur.se;\n\n    if (vis[u])\n      continue;\n\n    vis[u] = 1, d[u] = cd;\n\n    if (u == n + 1) {\n\n      sol = cd;\n\n      break;\n    }\n\n    for (int v = 0; v <= n + 1; v++) {\n\n      if (d[v] > cd + dist[u][v]) {\n\n        pq.push({cd + dist[u][v], v});\n      }\n    }\n  }\n\n  printf(\"%.10lf\\n\", sol);\n\n  return;\n}\n\nint main() {\n\n#ifdef multipleCase\n\n  int nQ;\n  in(nQ);\n\n  while (nQ--)\n\n    work();\n\n#endif\n\n#ifdef singleCase\n\n  work();\n\n#endif\n\n  return 0;\n}\n\nvoid in(int &x) {\n\n  bool neg = false;\n\n  register int c;\n\n  x = 0;\n\n  c = getchar();\n\n  if (c == '-') {\n\n    neg = true;\n\n    c = getchar();\n  }\n\n  for (; c > 47 && c < 58; c = getchar())\n\n    x = (x << 1) + (x << 3) + c - 48;\n\n  if (neg)\n    x *= -1;\n}\n"}
{"fast_code_id":"0916f0a89d043d75e165dad8217cbf477a1cb52b4c66ffb034dfaa5b393e8132","fast_id":"08b24bbf41c6339ba597dc334d96732a09de63520e4f8e2c35838c94f5d7cfc7","fast_time":0.0195172732,"language":"cpp","measured_fast_code_id":"08b24bbf41c6339ba597dc334d96732a09de63520e4f8e2c35838c94f5d7cfc7","measured_slow_code_id":"af513232ae77e113e137fe02d65ef61b256a9750d7ad2cc82aae324034a2f0a0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_787","problem_id":"p03863","slow_code_id":"26d3ed914b79c7670f54c7d48f73230a5aebb778837813ef532bf6314b211ba1","slow_id":"af513232ae77e113e137fe02d65ef61b256a9750d7ad2cc82aae324034a2f0a0","slow_time":0.1372839231,"speedup":7.033970457512477,"stratum":"4-8","sampling_key":"75609940890066588e6a0ff3619b66ecd775bafc0c0efa4912c03b91975885ef","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <algorithm>\n\n#include <vector>\n\n#include <stack>\n\n#include <queue>\n\n#include <map>\n\n#include <set>\n\n#include <string>\n\n#include <cstring>\n\n#define ll long long\n\n#define rep(x, n) for (ll(x) = 0; (x) < n; (x)++)\n\n#define rep1(x, n) for (ll(x) = 1; (x) <= n; (x)++)\n\nusing namespace std;\n\nchar s[300005], book[300005];\n\nint main()\n\n{\n\n#ifdef LOCAL\n\n  freopen(\"B_data\", \"r\", stdin);\n\n#endif\n\n  while (cin >> s)\n\n  {\n\n    ll len = strlen(s), cnt = 0, l = 0, r = 2;\n\n    memset(book, 0, sizeof(book));\n\n    rep(i, len)\n\n    {\n\n      if (!i || i == (len - 1) || book[i])\n        continue;\n\n      while (l && book[l])\n        l--;\n\n      while (r <= i || (r < len && book[r]))\n        r++;\n\n      if (s[l] != s[r])\n\n      {\n\n        cnt++, book[i] = 1;\n\n        i -= 2;\n      }\n    }\n\n    if (cnt % 2)\n      cout << \"First\" << endl;\n\n    else\n      cout << \"Second\" << endl;\n  }\n\n  return 0;\n}\n","fast_code":"#include <cstdio>\n\n#include <cstring>\n\n#include <algorithm>\n\nusing namespace std;\n\nchar st[104014];\n\nint main() {\n\n  while (~scanf(\"%s\", st)) {\n\n    int len = strlen(st);\n\n    if (st[0] != st[len - 1]) {\n\n      if (len & 1)\n        printf(\"First\\n\");\n\n      else\n        printf(\"Second\\n\");\n\n    }\n\n    else {\n\n      if (len & 1)\n        printf(\"Second\\n\");\n\n      else\n        printf(\"First\\n\");\n    }\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"5ed2140e850d54c7111944775f3d34b6e72dc6f23493a803b049550ff24211ec","fast_id":"f76855de3afa551213304cbfea7dde6359993a4073c8825555f73c70e273d843","fast_time":0.0193235053,"language":"cpp","measured_fast_code_id":"f76855de3afa551213304cbfea7dde6359993a4073c8825555f73c70e273d843","measured_slow_code_id":"3102c348b7cca60113e9b4312f24eb2fc4b4d62830fccfef4b6e247f0904a598","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_8113","problem_id":"p02801","slow_code_id":"1cd4a711970ad5f2c8e381ca4e96bd491bb94fbe8dd20c72c402a95739dd9d67","slow_id":"3102c348b7cca60113e9b4312f24eb2fc4b4d62830fccfef4b6e247f0904a598","slow_time":0.1033810664,"speedup":5.350016200218084,"stratum":"4-8","sampling_key":"00412002d26df3d5416369bfad873ca51978467529b63be5de48365d3c4d94b8","slow_code":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  char a;\n\n  cin >> a;\n\n  cout << (char)(a + 1);\n}","fast_code":"#include <stdio.h>\n\nint main()\n\n{\n\n  char x;\n\n  scanf(\"%c\", &x);\n\n  printf(\"%c\", x + 1);\n\n  return 0;\n}"}
{"fast_code_id":"d41d31530b3d3075ebee3cdd8789000bb12916e13b93df02c36877cc59277365","fast_id":"69667000a228ae0fa78f2ebff33119b7c26b31e99430ad5057927e1dabce745b","fast_time":0.0136548632,"language":"cpp","measured_fast_code_id":"69667000a228ae0fa78f2ebff33119b7c26b31e99430ad5057927e1dabce745b","measured_slow_code_id":"75dd2bbe3661e9c9a96c5733a02028610aaa4334a137f8ba29299fc34f661ddf","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_8141","problem_id":"p02856","slow_code_id":"786bf5a1b6984b4b19f8794f2368c90c8f9ef75f06301560c68d4fe76ff031ec","slow_id":"75dd2bbe3661e9c9a96c5733a02028610aaa4334a137f8ba29299fc34f661ddf","slow_time":0.0528740678,"speedup":3.872178507068456,"stratum":"2-4","sampling_key":"75cec85897bfb52c8ad61ac8f2a62d9f3ce5ae452efa4058b2ca1ecd10ab8367","slow_code":"#include <iostream>\n\nusing namespace std;\n\nlong long s, sum, n, a[1000001], b[1000001], cnt, ans;\n\nlong long f(long long x, long long y)\n\n{\n\n  if (x * y % 9 != 0)\n\n    return x * y % 9;\n\n  if (x == 0)\n\n    return 0;\n\n  return 9;\n}\n\nint main()\n\n{\n\n  cin >> n;\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    cin >> a[i] >> b[i];\n\n    ans += b[i];\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    cnt = 0;\n\n    for (int j = 0; j <= 8; ++j)\n\n      if (f(a[i], j) + a[i] > 9)\n\n        cnt++;\n\n    cnt *= (b[i] / 9);\n\n    for (int j = 0; j <= b[i] % 9 - 1; ++j)\n\n      if (f(a[i], j) + a[i] > 9)\n\n        cnt++;\n\n    if (f(a[i], 0) + a[i] > 9)\n\n      cnt--;\n\n    ans += cnt;\n  }\n\n  for (int i = 1; i <= n; ++i)\n\n    a[i] = f(a[i], b[i]);\n\n  for (int i = 1; i <= n; ++i)\n\n  {\n\n    sum += a[i];\n\n    if (sum > 9)\n\n    {\n\n      sum -= 9;\n\n      ans++;\n    }\n  }\n\n  cout << ans - 1 << endl;\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\nint main() {\n\n  long long t = 0, sum = 0, n, k[200010], s[200010];\n\n  scanf(\"%lld\", &n);\n\n  for (int i = 1; i <= n; i++) {\n\n    scanf(\"%lld%lld\", &k[i], &s[i]);\n\n    sum += k[i] * s[i];\n\n    t += s[i];\n  }\n\n  if (sum % 9 == 0)\n    printf(\"%lld\", sum / 9 + t - 2);\n\n  else\n    printf(\"%lld\", sum / 9 + t - 1);\n\n  return 0;\n}"}
{"fast_code_id":"685bc8b1d62499eba777c71302126caff276b170cbea259c47c1dd157e556d76","fast_id":"b0f07f666c481efc84ae88dc520074df7ca7ace313cdbc41432d554ad1b7170c","fast_time":0.020160535,"language":"cpp","measured_fast_code_id":"b0f07f666c481efc84ae88dc520074df7ca7ace313cdbc41432d554ad1b7170c","measured_slow_code_id":"dd4f90e9c40cbce9c94c27230758eb9c873a72114b328a59de80ddf176d0553a","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_8168","problem_id":"p03179","slow_code_id":"e406dbaa25e5b0316287c44e6f1456e04c33eef6eec4742065880e118b782f5e","slow_id":"dd4f90e9c40cbce9c94c27230758eb9c873a72114b328a59de80ddf176d0553a","slow_time":0.1146220478,"speedup":5.6854665711996235,"stratum":"4-8","sampling_key":"49a31d10caa4ed8645317277cbe9214b0befd5d305290eaa7ce5cbb3e6367af8","slow_code":"#pragma GCC optimize(\"Ofast\")\n\n#pragma GCC optimize(\"inline\")\n\n#pragma comment(linker, \"/STACK:1024000000,1024000000\")\n\n#undef __STRICT_ANSI__\n\n#include <cstdio>\n\n#include <cmath>\n\n#include <cstdlib>\n\n#include <string>\n\n#include <cstring>\n\n#include <cctype>\n\n#include <sstream>\n\n#include <cfloat>\n\n#include <complex>\n\n#include <climits>\n\n#include <new>\n\n#include <memory>\n\n#include <cerrno>\n\n#include <cassert>\n\n#include <ctime>\n\n#include <set>\n\n#include <map>\n\n#include <list>\n\n#include <queue>\n\n#include <deque>\n\n#include <stack>\n\n#include <vector>\n\n#include <bitset>\n\n#include <utility>\n\n#include <iterator>\n\n#include <iostream>\n\n#include <fstream>\n\n#include <iomanip>\n\n#include <numeric>\n\n#include <algorithm>\n\n#include <functional>\n\n#include <unordered_map>\n\n#include <unordered_set>\n\n#include <streambuf>\n\n#include <cfenv>\n\n#include <tuple>\n\n#include <cstdint>\n\n#include <random>\n\n#include <regex>\n\n#define lc c[0]\n\n#define rc c[1]\n\n#define fir first\n\n#define sec second\n\n#define lson x << 1\n\n#define rson x << 1 | 1\n\n#define PB push_back\n\n#define PF push_front\n\n#define MP make_pair\n\n#define MT make_tuple\n\n#define EB emplace_back\n\n#define Lson l, m, lson\n\n#define Rson m + 1, r, rson\n\n#define LB lower_bound\n\n#define UB upper_bound\n\n#define npos string::npos\n\n#define FF fflush(stdout)\n\n#define PQ priority_queue\n\n#define rint register int\n\n#define sqr(X) ((X) * (X))\n\n#define cbr(X) ((X) * (X) * (X))\n\n#define LBT(X) ((X) & (-(X)))\n\n#define SZ(X) (int)(X).size()\n\n#define ALL(X) (X).begin(), (X).end()\n\n#define INS(X) inserter((X), (X).begin())\n\n#define CPY(X, Y) memcpy((X), (Y), sizeof((Y)))\n\n#define MEM(X, Y) memset((X), (Y), sizeof((X)))\n\n#define POS(X, Y, Z) lower_bound((X), (Y), (Z)) - (X) + 1\n\n#define SC(X) while (scanf(\"%s\", (X)), !strlen((X)))\n\n#define SU(X, Y, Z) sort((X), (Y)), (Z) = unique((X), (Y)) - (X)\n\n#define NUM(X, Y, L, R) UB((X), (Y), (R)) - LB((X), (Y), (L))\n\n#define INF 0x3f3f3f3f\n\n#define NNF 0xc0c0c0c0\n\n#define INF64 0x3f3f3f3f3f3f3f3f\n\n#define NNF64 0xc0c0c0c0c0c0c0c0\n\n#define ALP 0.75\n\n#define P 131\n\nusing namespace std;\n\ntypedef long long LL;\n\ntypedef long double LD;\n\ntypedef unsigned int UI;\n\ntypedef unsigned long long ULL;\n\ntypedef pair<LL, LL> PLL;\n\ntypedef pair<int, LL> PIL;\n\ntypedef pair<LL, int> PLI;\n\ntypedef pair<int, int> PII;\n\ntypedef pair<char, int> PCI;\n\ntypedef pair<int, string> PIS;\n\ntypedef pair<string, int> PSI;\n\ntypedef pair<double, int> PDI;\n\ntypedef pair<double, double> PDD;\n\ntypedef pair<string, string> PSS;\n\ntypedef tuple<LL, LL, LL> PLLL;\n\ntypedef tuple<LL, LL, int> PLLI;\n\ntypedef tuple<int, LL, LL> PILL;\n\ntypedef tuple<LL, int, int> PLII;\n\ntypedef tuple<int, int, LL> PIIL;\n\ntypedef tuple<int, int, int> PIII;\n\ntypedef tuple<LL, LL, LL, LL> PLLLL;\n\ntypedef tuple<int, int, int, int> PIIII;\n\ntypedef tuple<double, double, int> PDDI;\n\ntypedef tuple<double, double, double> PDDD;\n\ntypedef tuple<double, double, double, int> PDDDI;\n\ntypedef set<LL> SL;\n\ntypedef set<int> SI;\n\ntypedef set<PII> SPII;\n\ntypedef set<PIL> SPIL;\n\ntypedef set<PLI> SPLI;\n\ntypedef set<PLL> SPLL;\n\ntypedef set<PIII> SPIII;\n\ntypedef set<PLLL> SPLLL;\n\ntypedef set<string> SS;\n\ntypedef queue<int> QI;\n\ntypedef queue<PII> QPII;\n\ntypedef queue<PIL> QPIL;\n\ntypedef queue<PLI> QPLI;\n\ntypedef queue<PLL> QPLL;\n\ntypedef deque<int> DI;\n\ntypedef deque<PII> DPII;\n\ntypedef deque<PIL> DPIL;\n\ntypedef deque<PLI> DPLI;\n\ntypedef deque<PLL> DPLL;\n\ntypedef complex<LL> CL;\n\ntypedef complex<int> CI;\n\ntypedef complex<double> CD;\n\ntypedef map<LL, LL> MLL;\n\ntypedef map<int, LL> MIL;\n\ntypedef map<LL, int> MLI;\n\ntypedef map<int, int> MII;\n\ntypedef map<PII, int> MPIII;\n\ntypedef map<PLL, int> MPLLI;\n\ntypedef map<int, double> MID;\n\ntypedef map<string, int> MSI;\n\ntypedef vector<LL> VL;\n\ntypedef vector<int> VI;\n\ntypedef vector<VI> VVI;\n\ntypedef vector<VL> VVL;\n\ntypedef vector<PII> VPII;\n\ntypedef vector<PIL> VPIL;\n\ntypedef vector<PLI> VPLI;\n\ntypedef vector<PLL> VPLL;\n\ntypedef vector<string> VS;\n\ntypedef vector<PIII> VPIII;\n\ntypedef vector<PIIL> VPIIL;\n\ntypedef vector<PILL> VPILL;\n\ntypedef vector<PLLL> VPLLL;\n\ntypedef vector<PLII> VPLII;\n\ntypedef vector<PLLI> VPLLI;\n\ntypedef vector<PIIII> VPIIII;\n\ntypedef vector<PLLLL> VPLLLL;\n\ntemplate <class T> inline T gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\n\ntemplate <class T> inline T lcm(T x, T y) { return x / gcd(x, y) * y; }\n\ntemplate <class T> inline void adm(T &x, T y, T z) {\n  x = x + y;\n  if (x >= z)\n    x = x - z;\n}\n\ntemplate <class T> inline void adj(T &x, T y) {\n  if (x >= y || x <= -y)\n    x = x % y;\n  if (x < 0)\n    x = x + y;\n}\n\ntemplate <class T> inline T qpow(T x, LL y, T z) {\n  for (; y; y >>= 1, x = x * x)\n    if (y & 1)\n      z = z * x;\n  return z;\n}\n\ntemplate <class T> inline T mpow(LL w, T x, LL y, T z) {\n  for (; y; y >>= 1, x = x * x, x = x % w)\n    if (y & 1)\n      z = z * x, z = z % w;\n  return z;\n}\n\ntemplate <class T> inline T exgcd(T a, T b, T &x, T &y) {\n  T t = a;\n  b ? (t = exgcd(b, a % b, y, x), y = y - (a / b) * x) : (x = 1, y = 0);\n  return t;\n}\n\nconst double EPS = 1e-10;\n\nconst LL MOD = 1000000007LL;\n\nconst int M = 5000005;\n\nconst int N = 3001;\n\nint n, cur;\n\nLL dp[2][N], ans;\n\nchar ch;\n\nint main()\n\n{\n\n  scanf(\"%d\\n\", &n);\n\n  dp[0][1] = 1LL;\n\n  for (rint i = 2; i <= n; i++, cur ^= 1)\n\n  {\n\n    scanf(\"%c\", &ch);\n\n    MEM(dp[cur ^ 1], 0);\n\n    if (ch == '<')\n\n    {\n\n      for (rint j = 2; j <= i; j++)\n\n      {\n\n        adm(dp[cur ^ 1][j], dp[cur ^ 1][j - 1], MOD);\n\n        adm(dp[cur ^ 1][j], dp[cur][j - 1], MOD);\n      }\n\n    }\n\n    else\n\n    {\n\n      for (rint j = i - 1; j >= 1; j--)\n\n      {\n\n        adm(dp[cur ^ 1][j], dp[cur ^ 1][j + 1], MOD);\n\n        adm(dp[cur ^ 1][j], dp[cur][j], MOD);\n      }\n    }\n  }\n\n  for (rint i = 1; i <= n; i++)\n    ans += dp[cur][i];\n\n  printf(\"%lld\\n\", ans % MOD);\n\n  return 0;\n}\n","fast_code":"#pragma GCC optimize(\"Ofast\")\n\n#include <cstdio>\n\n#define rint register int\n\nusing namespace std;\n\nconst int MOD = 1000000007;\n\nconst int N = 3001;\n\nint n, cur;\n\nlong long dp[2][N];\n\nchar ch;\n\ninline void adj(long long &x) {\n  if (x >= MOD)\n    x -= MOD;\n}\n\nint main()\n\n{\n\n  scanf(\"%d\\n\", &n);\n\n  dp[0][1] = 1LL;\n\n  for (rint i = 2; i <= n; i++, cur ^= 1)\n\n  {\n\n    scanf(\"%c\", &ch);\n\n    if (ch == '<')\n\n    {\n\n      dp[cur ^ 1][1] = 0LL;\n\n      for (rint j = 2; j <= i; j++)\n\n      {\n\n        dp[cur ^ 1][j] = dp[cur ^ 1][j - 1] + dp[cur][j - 1];\n\n        adj(dp[cur ^ 1][j]);\n      }\n\n    }\n\n    else\n\n    {\n\n      dp[cur ^ 1][i] = 0LL;\n\n      for (rint j = i - 1; j >= 1; j--)\n\n      {\n\n        dp[cur ^ 1][j] = dp[cur ^ 1][j + 1] + dp[cur][j];\n\n        adj(dp[cur ^ 1][j]);\n      }\n    }\n  }\n\n  for (rint i = 1; i < n; i++)\n    dp[cur][n] += dp[cur][i];\n\n  printf(\"%lld\\n\", dp[cur][n] % MOD);\n\n  return 0;\n}\n"}
{"fast_code_id":"7ec0a07dc22fc24d290dda3b8627d8eb96d5290be0b2ce504c707c855a31303e","fast_id":"052ad6d1808fb51530b4e0fff3021fc12b958c96ed0b077c0d69704fd9539dee","fast_time":0.0056082272,"language":"cpp","measured_fast_code_id":"052ad6d1808fb51530b4e0fff3021fc12b958c96ed0b077c0d69704fd9539dee","measured_slow_code_id":"f344da19535c0f1fe9c1b675c92e4c72844e35bec86b6e028e4cfdb60e952b4d","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_8170","problem_id":"p02273","slow_code_id":"5ac9f4aa7885e704c840d8e9456742b3d83fb9e1b1fcba2fc02816338bda99d1","slow_id":"f344da19535c0f1fe9c1b675c92e4c72844e35bec86b6e028e4cfdb60e952b4d","slow_time":0.0119287534,"speedup":2.127009654673049,"stratum":"2-4","sampling_key":"01bfce39a038844531e61ad0dcc07bf3b90158a962cf12a099b4b9ac6a5030ab","slow_code":"#include <cstdio>\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <cmath>\n\n#include <climits>\n\n#include <iostream>\n\n#include <sstream>\n\n#include <utility>\n\n#include <map>\n\n#include <vector>\n\n#include <queue>\n\n#include <algorithm>\n\n#include <set>\n\n#include <stack>\n\n#define PI 3.14159265358\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef pair<double, double> P;\n\nqueue<P> S;\n\nP s, t;\n\nint N;\n\nint main()\n\n{\n\n  scanf(\"%d\", &N);\n\n  S.push(make_pair(0, 0));\n\n  S.push(make_pair(100.0, 0));\n\n  for (; N--;)\n\n  {\n\n    s = S.front();\n    S.pop();\n\n    queue<P> T;\n\n    do\n\n    {\n\n      t = S.front();\n      S.pop();\n\n      P s1 = make_pair(s.first + (t.first - s.first) / 3, s.second + (t.second - s.second) / 3);\n\n      P s2 = make_pair(s.first + (t.first - s.first) / 3 * 2,\n                       s.second + (t.second - s.second) / 3 * 2);\n\n      T.push(s);\n\n      T.push(s1);\n\n      T.push(make_pair(s1.first + (s2.first - s1.first) * cos(PI / 3.0) -\n                           (s2.second - s1.second) * sin(PI / 3.0),\n\n                       s1.second + (s2.first - s1.first) * sin(PI / 3.0) +\n                           (s2.second - s1.second) * cos(PI / 3.0)));\n\n      T.push(s2);\n\n      s = t;\n\n    } while (!S.empty());\n\n    T.push(t);\n\n    S = T;\n  }\n\n  for (; !S.empty();)\n\n  {\n\n    printf(\"%lf %lf\\n\", S.front().first, S.front().second);\n\n    S.pop();\n  }\n\n  return 0;\n}","fast_code":"#include <stdio.h>\n\n#include <math.h>\n\nusing namespace std;\n\nstruct Point {\n  double x, y;\n};\n\nvoid koch(int n, Point a, Point b) {\n\n  if (n == 0)\n    return;\n\n  Point s, t, u;\n\n  double th = M_PI * 60.0 / 180.0;\n\n  s.x = (2.0 * a.x + 1.0 * b.x) / 3.0;\n\n  s.y = (2.0 * a.y + 1.0 * b.y) / 3.0;\n\n  t.x = (1.0 * a.x + 2.0 * b.x) / 3.0;\n\n  t.y = (1.0 * a.y + 2.0 * b.y) / 3.0;\n\n  u.x = (t.x - s.x) * cos(th) - (t.y - s.y) * sin(th) + s.x;\n\n  u.y = (t.x - s.x) * sin(th) + (t.y - s.y) * cos(th) + s.y;\n\n  koch(n - 1, a, s);\n\n  printf(\"%.8f %.8f\\n\", s.x, s.y);\n\n  koch(n - 1, s, u);\n\n  printf(\"%.8f %.8f\\n\", u.x, u.y);\n\n  koch(n - 1, u, t);\n\n  printf(\"%.8f %.8f\\n\", t.x, t.y);\n\n  koch(n - 1, t, b);\n}\n\nint main() {\n\n  Point a, b;\n\n  int n;\n\n  scanf(\"%d\", &n);\n\n  a.x = 0;\n\n  a.y = 0;\n\n  b.x = 100;\n\n  b.y = 0;\n\n  printf(\"%.8f %.8f\\n\", a.x, a.y);\n\n  koch(n, a, b);\n\n  printf(\"%.8f %.8f\\n\", b.x, b.y);\n\n  return 0;\n}"}
{"fast_code_id":"219c7f092ff98b0484f0c1b25abbbf3567f6e763564be8aa0bbd90116042d835","fast_id":"467dc819d8b1301c5cefcdb840c1a3b36cd9eae465eb4fab59251d8c0c634002","fast_time":0.0272536662,"language":"cpp","measured_fast_code_id":"467dc819d8b1301c5cefcdb840c1a3b36cd9eae465eb4fab59251d8c0c634002","measured_slow_code_id":"f521e04cb24221763301ddd20c06c8753485913542cacbf8768618291ac3b8b0","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_8181","problem_id":"p03268","slow_code_id":"d3f3b47166e3baa2a9beb78b26fa0345ac8254deb6a97d6e40f5f5f05ff4f2a2","slow_id":"f521e04cb24221763301ddd20c06c8753485913542cacbf8768618291ac3b8b0","slow_time":0.069723914,"speedup":2.5583315466012424,"stratum":"2-4","sampling_key":"9a810b0d67083fbeabdad18d40be98b71efd1f18b9bf1fac8a7cd0cf2fd1ce20","slow_code":"#include <iostream>\n\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\nll solve(ll N, ll K) {\n\n  ll ans = 0;\n\n  vector<ll> cnt(200001);\n\n  for (ll i = 1; i <= N; i++) {\n\n    cnt[i % K]++;\n  }\n\n  for (ll b = 1; b <= N; b++) {\n\n    ll m = (K - b) % K;\n\n    if (m < 0) {\n\n      m += K * (-m / K) + K;\n\n      m %= K;\n    }\n\n    if ((2 * m) % K == 0) {\n\n      ans += cnt[m] * cnt[m];\n    }\n  }\n\n  return ans;\n}\n\nint main() {\n\n  ll N, K;\n\n  cin >> N >> K;\n\n  cout << solve(N, K) << endl;\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define all(x) (x).begin(), (x).end()\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\n#define endl \"\\n\"\n\ntypedef long long ll;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<ll, ll> pll;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n  os << \"[\";\n  for (const auto &v : vec) {\n    os << v << \",\";\n  }\n  os << \"]\";\n  return os;\n}\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n  os << \"(\" << p.first << \", \" << p.second << \")\";\n  return os;\n}\n\nvoid solve() {\n\n  int N, K;\n\n  cin >> N >> K;\n\n  vector<ll> cnt(K);\n\n  for (int i = 1; i <= N; i++)\n    cnt[i % K]++;\n\n  ll ans = 0;\n\n  for (int b = 0; b < K; b++) {\n\n    int a = (K - b) % K;\n\n    int c = (K - b) % K;\n\n    if ((a + c) % K != 0)\n      continue;\n\n    ans += cnt[a] * cnt[b] * cnt[c];\n  }\n\n  cout << ans << endl;\n}\n\nint main() {\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  cout.setf(ios::fixed);\n\n  cout.precision(16);\n\n  solve();\n\n  return 0;\n}"}
{"fast_code_id":"aff6ab2349e8ef90abe573017b4294de4accbdc0662c56b2f1a9c147a28ea8f3","fast_id":"d5c6a3f0e8507464103d14d139e8151cf0585d60b5a9a2cda4b6529ccd94ddab","fast_time":0.1048082687,"language":"cpp","measured_fast_code_id":"d5c6a3f0e8507464103d14d139e8151cf0585d60b5a9a2cda4b6529ccd94ddab","measured_slow_code_id":"074bba713667cdc5a33550d5b90886967150c2b01773e617a969eaeccd033b51","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_8184","problem_id":"p01924","slow_code_id":"b672db546cdc71f1ccafc43c9210ddedaa98340e4387955c194c31c7281c7986","slow_id":"074bba713667cdc5a33550d5b90886967150c2b01773e617a969eaeccd033b51","slow_time":0.4113021167,"speedup":3.924328889329321,"stratum":"2-4","sampling_key":"6dfcc270ff6f1f2827fed6531ee4fe38ba0d0528fa3471e1374907905b2565e8","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<int> vi;\n\ntypedef vector<ll> vll;\n\n#define pu push\n\n#define pb push_back\n\n#define mp make_pair\n\n#define eps 1e-7\n\n#define INF 1000000000\n\n#define sz(x) ((int)(x).size())\n\n#define sq(x) ((x) * (x))\n\n#define fi first\n\n#define sec second\n\n#define SORT(x) sort((x).begin(), (x).end())\n\n#define all(x) (x).begin(), (x).end()\n\n#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)\n\n#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)\n\n#define EQ(a, b) (abs((a) - (b)) < eps)\n\nint solve() {\n\n  int T, D, L;\n\n  cin >> T >> D >> L;\n\n  if (T + D + L == 0)\n    return 1;\n\n  vector<int> x(T);\n\n  vector<int> rui(200100);\n\n  for (int i = 0; i < T; i++) {\n\n    cin >> x[i];\n\n    if (x[i] >= L) {\n\n      rui[i]++;\n\n      rui[i + D]--;\n    }\n  }\n\n  for (int i = 1; i < 200100; i++)\n    rui[i] += rui[i - 1];\n\n  int ans = 0;\n\n  for (int i = 0; i < T - 1; i++)\n    if (rui[i])\n      ans++;\n\n  cout << ans << endl;\n\n  return 0;\n}\n\nint main() {\n\n  while (!solve()) {\n  }\n\n  return 0;\n}","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nll t, d, l;\n\nll x[100005];\n\nll i;\n\nll ans;\n\nbool solve() {\n\n  cin >> t >> d >> l;\n\n  if (t == 0) {\n\n    return false;\n  }\n\n  for (i = 0; i < t; i++) {\n\n    cin >> x[i];\n  }\n\n  ll value = 0;\n\n  ans = 0;\n\n  for (i = 0; i < t - 1; i++) {\n\n    if (x[i] >= l)\n      value = d;\n\n    if (value >= 1) {\n\n      ans++;\n\n      value--;\n    }\n  }\n\n  cout << ans << endl;\n\n  return true;\n}\n\nint main() {\n\n  while (solve()) {\n  }\n\n  return 0;\n}\n"}
{"fast_code_id":"df2d046efaf2feaf388757fac4498962ca43d17aa2bf8a6f415e117109020414","fast_id":"7c68234f62b7ba00e486933ad143994e74e412f840439bcec73c96472a4b4bff","fast_time":0.0044003065,"language":"cpp","measured_fast_code_id":"7c68234f62b7ba00e486933ad143994e74e412f840439bcec73c96472a4b4bff","measured_slow_code_id":"f18e6d269b60638a98494bcd2d4286cec7dc48dfc8a47d5b59cb50907e70deee","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_9217","problem_id":"p02899","slow_code_id":"a96596b5febefd3d014a5cbfbece44e036bb98ab9729dede70126ec0ec26eb67","slow_id":"f18e6d269b60638a98494bcd2d4286cec7dc48dfc8a47d5b59cb50907e70deee","slow_time":0.0328446947,"speedup":7.464183392679578,"stratum":"4-8","sampling_key":"369606aa99dc548af5e1d2896135427173f851f58c2702a467e985d444bb1254","slow_code":"#include <iostream>\n\n#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\nconst int maxn = 1e5 + 10;\n\nint a[maxn];\n\nint main()\n\n{\n\n  memset(a, 0, sizeof(a));\n\n  int n, tmp;\n\n  cin >> n;\n\n  for (int i = 1; i <= n; i++)\n\n  {\n\n    cin >> tmp;\n\n    a[tmp] = i;\n  }\n\n  for (int i = 1; i < n; i++)\n\n    cout << a[i] << \" \";\n\n  cout << a[n] << endl;\n\n  return 0;\n}\n","fast_code":"#include <stdio.h>\n\nint nums[100000 + 1];\n\nint main()\n\n{\n\n  int num, n;\n\n  scanf(\"%d\", &n);\n\n  for (int i = 0; i < n; i++)\n\n  {\n\n    scanf(\"%d\", &num);\n\n    nums[num] = i + 1;\n  }\n\n  for (int i = 1; i <= n; i++)\n    printf(\"%d \", nums[i]);\n}"}
{"fast_code_id":"eba233bc1a282755b377c4b055cdef398644120af49aee282976b4c2077a4c12","fast_id":"948bb83d1e494fff5437d3953079a0cec4776f0f85201ec470eed9036b5afa4c","fast_time":0.1042901748,"language":"cpp","measured_fast_code_id":"948bb83d1e494fff5437d3953079a0cec4776f0f85201ec470eed9036b5afa4c","measured_slow_code_id":"386c2502523f9bb34dddfe58e9b21a223be9c72b39a761a6b3b395f861d8cb74","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_929","problem_id":"p03962","slow_code_id":"4ab5098866dbcbf039e80d8ff9ed46209e535a04ce93c3872b1dfbf183cd949c","slow_id":"386c2502523f9bb34dddfe58e9b21a223be9c72b39a761a6b3b395f861d8cb74","slow_time":0.6818753313,"speedup":6.5382509196829925,"stratum":"4-8","sampling_key":"040d568c8400c5debc872c2704ac210ebf614d79d880a3d00ac585b56b265384","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 200005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nint main()\n\n{\n\n  set<int> st;\n\n  int a, b, c;\n\n  cin >> a >> b >> c;\n\n  st.insert(a);\n\n  st.insert(b);\n\n  st.insert(c);\n\n  cout << st.size();\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  int a, b, c;\n  cin >> a >> b >> c;\n\n  int cnt = 0;\n\n  if (a != b)\n    cnt++;\n\n  if (a != c)\n    cnt++;\n\n  if (b != c)\n    cnt++;\n\n  if (cnt != 0)\n    cout << cnt;\n\n  else\n    cout << 1;\n}"}
{"fast_code_id":"c8505423df14e30483210a8242c8033b999cad01effd72cb96b76745b141e9e2","fast_id":"95fe5311bfd34306920c85be11abe0b4577e38af2ac7c604d3e091cabb2d859b","fast_time":0.0201927343,"language":"cpp","measured_fast_code_id":"95fe5311bfd34306920c85be11abe0b4577e38af2ac7c604d3e091cabb2d859b","measured_slow_code_id":"4da8d67755ed9de37e262945222506708a626330b6dd1224b5edd5f5e9f1f2e4","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_944","problem_id":"p03622","slow_code_id":"ece93be774a8460feb83973ab57686bba29cbe4d5fdc8bb26a053f1c61b48671","slow_id":"4da8d67755ed9de37e262945222506708a626330b6dd1224b5edd5f5e9f1f2e4","slow_time":0.1070484149,"speedup":5.301333306802338,"stratum":"4-8","sampling_key":"3573da91108144616f1255dd92c2894909e5e35f416d062b8a8a0eefc6491e41","slow_code":"#include <bits/stdc++.h>\n\n#define N 1000005\n\n#define p 998244353\n\n#define int long long\n\nusing namespace std;\n\ninline void rd(int &x) {\n\n  x = 0;\n  char ch = 0;\n  int w = 0;\n\n  while (!isdigit(ch))\n    ch = getchar(), w |= ch == '-';\n\n  while (isdigit(ch))\n    x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();\n\n  x = w ? -x : x;\n}\n\nint n, m, ans;\n\nint f[N], inv[N];\n\ninline int POW(int a, int b = p - 2, int ans = 1) {\n\n  for (; b; b >>= 1, a = a * a % p)\n\n    if (b & 1)\n      ans = ans * a % p;\n\n  return ans;\n}\n\ninline int C(int n, int m) { return f[n] * inv[m] % p * inv[n - m] % p; }\n\nsigned main() {\n\n  cin >> n >> m;\n  if (n < m)\n    swap(n, m);\n\n  for (int i = f[0] = inv[0] = 1; i <= n + m; i++)\n\n    f[i] = f[i - 1] * i % p, inv[i] = POW(f[i]);\n\n  for (int i = 1; i <= m; i++)\n\n    ans = (ans + C(i << 1, i) * C(n - i + m - i, n - i)) % p;\n\n  ans = ans * inv[2] % p * POW(C(n + m, n)) % p;\n\n  cout << (ans + n) % p;\n}","fast_code":"\n\n#include <cstdio>\n\ntypedef long long ll;\n\n#define ri register int\n\n#pragma GCC optimize(1)\n\n#pragma GCC optimize(2)\n\n#pragma GCC optimize(3)\n\n#pragma GCC optimize(\"Ofast\")\n\nconst int N = 1000005, mod = 998244353;\n\nint fac[N], inv[N];\n\ninline int C(ri n, ri m) { return (ll)fac[n] * inv[m] % mod * inv[n - m] % mod; }\n\ninline int max(ri x, ri y) { return x > y ? x : y; }\n\ninline int min(ri x, ri y) { return x < y ? x : y; }\n\ninline void add(int &x, ri y) {\n\n  x += y;\n\n  if (x >= mod)\n    x -= mod;\n}\n\ninline int Pow(ri a, ri b) {\n\n  ri ans = 1;\n\n  for (; b; b >>= 1, a = (ll)a * a % mod)\n\n    if (b & 1)\n      ans = (ll)ans * a % mod;\n\n  return ans;\n}\n\nint main() {\n\n  ri n, m, i, sum, yes;\n\n  scanf(\"%d%d\", &n, &m);\n\n  sum = n + m;\n\n  fac[0] = inv[0] = 1;\n\n  for (i = 1; i <= sum; ++i)\n    fac[i] = (ll)fac[i - 1] * i % mod;\n\n  inv[sum] = Pow(fac[sum], mod - 2);\n\n  for (i = sum - 1; i; --i)\n    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;\n\n  yes = 0;\n\n  for (i = min(n, m); i; --i)\n    add(yes, (ll)C(2 * i, i) * C(n - i + m - i, n - i) % mod);\n\n  yes = (ll)yes * Pow(C(n + m, n), mod - 2) % mod * inv[2] % mod;\n\n  add(yes, max(n, m));\n\n  printf(\"%d\\n\", yes);\n\n  return 0;\n}"}
{"fast_code_id":"be7a38a2fc503abda76e0bea233bba7bdceca9be3716d089cc9d2acd6025738f","fast_id":"f2aa80e5df84a6430639cdea415d4be701f2550bd1f2007a0d71e0e718c5bd32","fast_time":0.1056384615,"language":"cpp","measured_fast_code_id":"f2aa80e5df84a6430639cdea415d4be701f2550bd1f2007a0d71e0e718c5bd32","measured_slow_code_id":"e175c60763073ad8a2362c8b2877018196b8056e5f17317feb735ab1442f0b99","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_9745","problem_id":"p03803","slow_code_id":"9dce74be206827953568a154da8d8233b2f940a4037ebbb6928b8cc3209c8583","slow_id":"e175c60763073ad8a2362c8b2877018196b8056e5f17317feb735ab1442f0b99","slow_time":0.3743074378,"speedup":3.543287477733666,"stratum":"2-4","sampling_key":"27a5029758e76dcd9fb1fe7c5d9a12fe59c96c96d73e333c575240da6623fce0","slow_code":"\n\n#include <bits/stdc++.h>\n\n#define lln long long int\n\n#define llu unsigned lln\n\n#define sc(n) scanf(\"%d\", &n);\n\n#define scl(n) scanf(\"%lld\", &n);\n\n#define scd(n) scanf(\"%lf\", &n);\n\n#define pf(res) printf(\"%d\\n\", res);\n\n#define pfl(res) printf(\"%lld\\n\", res);\n\n#define pfd(res) printf(\"%lf\\n\", res);\n\n#define maxii 100005\n\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\ntypedef pair<lln, lln> pll;\n\nvector<int> vi[maxii];\n\nvector<int>::iterator child;\n\ntypedef vector<lln> vl;\n\ntypedef vector<pii> vii;\n\ntypedef vector<pll> vll;\n\nint arr[maxii];\n\nint arr2[maxii];\n\nbool check[maxii];\n\nint cnt = 0, n;\n\nvoid dfs(int node)\n\n{\n\n  check[node] = true;\n\n  if (vi[node].size() == n - 1)\n    cnt++;\n\n  for (int child = 0; child < vi[node].size(); child++)\n\n  {\n\n    if (check[vi[node][child]] == false)\n\n    {\n\n      dfs(vi[node][child]);\n    }\n  }\n}\n\nint main()\n\n{\n\n  int a, b;\n\n  cin >> a >> b;\n\n  if (a == 1)\n    a = 14;\n\n  if (b == 1)\n    b = 14;\n\n  if (a == b)\n    cout << \"Draw\";\n\n  else if (a > b)\n    cout << \"Alice\";\n\n  else\n    cout << \"Bob\";\n}\n","fast_code":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  int a, b;\n\n  cin >> a >> b;\n\n  if (a == b)\n\n    cout << \"Draw\" << endl;\n\n  else if (a == 1)\n\n    cout << \"Alice\" << endl;\n\n  else if (b == 1)\n\n    cout << \"Bob\" << endl;\n\n  else if (a > b)\n\n    cout << \"Alice\" << endl;\n\n  else if (b > a)\n\n    cout << \"Bob\" << endl;\n}"}
{"fast_code_id":"a5a062d5ec6ad15a618ee6d3405ac19e3f9e812a57dfe1ff280939ef01f371e7","fast_id":"ac0ce36014884ffa2dc1469fa29c2d782ad6103a571b34a5e99bc1eed1f510c4","fast_time":0.0108712195,"language":"cpp","measured_fast_code_id":"ac0ce36014884ffa2dc1469fa29c2d782ad6103a571b34a5e99bc1eed1f510c4","measured_slow_code_id":"aed7a38f2b8d86de6517df18a218027bc1af6d56295c957d54665b2a51a501ec","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_9820","problem_id":"p03212","slow_code_id":"7fa0b99639b873fa0b2a7b9cb57d673b8ed51349dda695cc585e47f7d37ea6b0","slow_id":"aed7a38f2b8d86de6517df18a218027bc1af6d56295c957d54665b2a51a501ec","slow_time":0.1605931819,"speedup":14.772324475648754,"stratum":"8+","sampling_key":"1f8e1066c0c89e2f1a3ceeae973914ce2920afccace91b3379d204d72e0e52d7","slow_code":"#include <stdio.h>\n\n#include <string.h>\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <set>\n\n#include <queue>\n\nusing namespace std;\n\nint n;\n\nint z;\n\nint sum[1100000];\n\nvoid dfs(int a, int b, int c, int num, int fl)\n\n{\n\n  if (num > 1e9)\n\n  {\n\n    return;\n  }\n\n  if (fl > 9)\n\n    return;\n\n  if (a && b && c)\n\n  {\n\n    sum[z++] = num;\n\n    dfs(1, b, c, num * 10 + 3, fl + 1);\n\n    dfs(a, 1, c, num * 10 + 5, fl + 1);\n\n    dfs(a, b, 1, num * 10 + 7, fl + 1);\n\n  }\n\n  else\n\n  {\n\n    dfs(1, b, c, num * 10 + 3, fl + 1);\n\n    dfs(a, 1, c, num * 10 + 5, fl + 1);\n\n    dfs(a, b, 1, num * 10 + 7, fl + 1);\n  }\n}\n\nint main()\n\n{\n\n  z = 0;\n\n  dfs(0, 0, 0, 0, 0);\n\n  sort(sum, sum + z);\n\n  int key;\n\n  while (cin >> key)\n\n  {\n\n    int left = 0;\n\n    int right = z - 1;\n\n    while (left <= right) {\n\n      int mid = (left + right) / 2;\n\n      if (sum[mid] > key) {\n\n        right = mid - 1;\n\n      }\n\n      else {\n\n        left = mid + 1;\n      }\n    }\n\n    cout << right + 1 << endl;\n  }\n}\n","fast_code":"#include <cstdio>\n\nint N, count = 0;\n\nvoid dfs(long long, unsigned char);\n\nint main(void)\n\n{\n\n  scanf(\"%d\", &N);\n\n  dfs(0, 0);\n\n  printf(\"%d\\n\", count);\n\n  return 0;\n}\n\nvoid dfs(long long nextNum, unsigned char flag357)\n\n{\n\n  if (nextNum <= N)\n\n  {\n\n    if (flag357 == 07)\n\n      count++;\n\n    dfs(nextNum * 10 + 3, flag357 | 01);\n\n    dfs(nextNum * 10 + 5, flag357 | 02);\n\n    dfs(nextNum * 10 + 7, flag357 | 04);\n  }\n}"}
{"fast_code_id":"20b215ed172a25d5f83dc002a717b762a773d0085ad534fff5497e304aca27cd","fast_id":"647f67667348898ab9c88569732412bdd05834c50076e79c4a6491d7a06122e7","fast_time":0.0171816851,"language":"cpp","measured_fast_code_id":"647f67667348898ab9c88569732412bdd05834c50076e79c4a6491d7a06122e7","measured_slow_code_id":"c26013e74bc7358d9c3c3b40351429b99cbc0125bf82026f3e891624a4b3a3e8","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_9864","problem_id":"p04041","slow_code_id":"8c6ac221a6938f48799b8547bc7d53c0c08101c344970aba8369c8e450605515","slow_id":"c26013e74bc7358d9c3c3b40351429b99cbc0125bf82026f3e891624a4b3a3e8","slow_time":0.0475305565,"speedup":2.766350111957296,"stratum":"2-4","sampling_key":"e56b981bf10cee8ddb91952bbb753864cae0e40be3016216b9f77ead204d319c","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint m = 1000000007, n, x, y, z;\n\nunsigned long long f[41][131075], ne[131075][11], i, j, k;\n\nint main()\n\n{\n\n  scanf(\"%d%d%d%d\", &n, &x, &y, &z);\n\n  y += x;\n  z += y;\n\n  for (i = 1; i <= 1 << z; i++)\n\n    for (j = 1; j <= 10; j++)\n\n    {\n\n      ne[i][j] = 1;\n\n      for (k = 0; k + j <= z; k++)\n        if (i & (1 << k))\n\n          if (!(k < x && k + j > x) && !(k < y && k + j > y))\n            ne[i][j] |= 1 << (j + k);\n\n      if ((i == (1 << z)) || ne[i][j] >= 1 << z)\n        ne[i][j] = 1 << z;\n    }\n\n  f[0][1] = 1;\n\n  for (i = 1; i <= n; i++)\n\n    for (j = 1; j <= 1 << z; j++)\n\n      for (k = 1; k <= 10; k++)\n\n        f[i][ne[j][k]] = (f[i][ne[j][k]] + f[i - 1][j]) % m;\n\n  cout << f[n][1 << z];\n\n  return 0;\n}","fast_code":"#include <cstdio>\n\n#include <cstring>\n\nusing namespace std;\n\nconst int mo = 1e9 + 7, MAXN = 42, MAXS = 1 << 17 | 1;\n\nint n, x, y, z;\n\nint f[MAXN][MAXS], g[MAXS][11];\n\ninline void add(int &x, const int &y)\n\n{\n\n  x += y;\n\n  x >= mo ? x -= mo : 0;\n}\n\nint main()\n\n{\n\n  scanf(\"%d%d%d%d\", &n, &x, &y, &z);\n\n  y += x, z += y;\n\n  int s = 1 << z;\n\n  for (int i = 1; i <= s; i++)\n\n    for (int j = 1; j <= 10; j++)\n\n    {\n\n      g[i][j] = 1;\n\n      if (i == s)\n\n        g[i][j] = s;\n\n      else\n\n      {\n\n        for (int k = 0; k < z; k++)\n\n          if ((i >> k & 1) && k + j <= z && !(k < x && k + j > x) && !(k < y && k + j > y))\n\n            g[i][j] |= 1 << k + j;\n\n        if (g[i][j] >= s)\n\n          g[i][j] = s;\n      }\n    }\n\n  f[0][1] = 1;\n\n  for (int i = 0; i < n; i++)\n\n    for (int j = 1; j <= s; j++)\n\n      if (f[i][j])\n\n        for (int k = 1; k <= 10; k++)\n\n          add(f[i + 1][g[j][k]], f[i][j]);\n\n  printf(\"%d\", f[n][s]);\n\n  return 0;\n}"}
{"fast_code_id":"ec9f5a52dda01c1fe422feb7246c831066c53767d7eaf6fb75c488e1d2ab57e7","fast_id":"67403526e7f5ef17342b1bd965f32b6d1c87e891d5fc98ba0bb72ad8999a3a0d","fast_time":0.1096289274,"language":"cpp","measured_fast_code_id":"67403526e7f5ef17342b1bd965f32b6d1c87e891d5fc98ba0bb72ad8999a3a0d","measured_slow_code_id":"4bbd6dcf6b26c57afafebac64c53ca4d8e797c07a05e4c315679b21f6bd58a5e","measurement_metric":"PIE_released_gem5_runtime","pair_id":"pie_9889","problem_id":"p03665","slow_code_id":"f73e24707440f28f0a204c967e030e6e6dfc2ca937d8f2c8116238d3859055fb","slow_id":"4bbd6dcf6b26c57afafebac64c53ca4d8e797c07a05e4c315679b21f6bd58a5e","slow_time":1.0133731331,"speedup":9.243665491704883,"stratum":"8+","sampling_key":"3b61f01d451b944b0b8c734c1071a5d615061d1093ad1a8de0244990bea37b48","slow_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define EACH(i, a) for (auto &i : a)\n\n#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)\n\n#define RFOR(i, a, b) for (int i = (int)b - 1; i >= (int)a; --i)\n\n#define REP(i, n) FOR(i, 0, n)\n\n#define RREP(i, n) RFOR(i, 0, n)\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define debug(x) cerr << #x << \":\" << x << endl;\n\n#define OK(ok) cout << (ok ? \"Yes\" : \"No\") << endl;\n\ntypedef long long ll;\n\nvoid CINT() {}\n\ntemplate <class Head, class... Tail>\n\nvoid CINT(Head &&head, Tail &&... tail) {\n\n  cin >> head;\n  CINT(move(tail)...);\n}\n\n#define CIN(...)                                                                                   \\\n  int __VA_ARGS__;                                                                                 \\\n  CINT(__VA_ARGS__)\n\n#define LCIN(...)                                                                                  \\\n  ll __VA_ARGS__;                                                                                  \\\n  CINT(__VA_ARGS__)\n\n#define SCIN(...)                                                                                  \\\n  string __VA_ARGS__;                                                                              \\\n  CINT(__VA_ARGS__)\n\nconst int INF = 1e9 + 1;\n\nconst int MOD = 1e9 + 7;\n\nconst int MAX_N = 1e3 + 1;\n\nint N, P;\n\nll memo[MAX_N][MAX_N];\n\nll nCr(ll n, ll r)\n\n{\n\n  if (r == 0 || n == r)\n    return 1;\n\n  if (memo[n][r] >= 0)\n    return memo[n][r];\n\n  return memo[n][r] = nCr(n - 1, r - 1) + nCr(n - 1, r);\n}\n\nint main()\n\n{\n\n  cin.tie(0);\n\n  ios::sync_with_stdio(false);\n\n  int odd, even;\n\n  odd = even = 0;\n\n  memset(memo, -1, sizeof(memo));\n\n  cin >> N >> P;\n\n  REP(i, N) {\n\n    CIN(a);\n\n    if (a & 1)\n      odd++;\n\n    else\n      even++;\n  }\n\n  ll ans = 0ll;\n\n  REP(i, odd + 1) {\n\n    if (i % 2 == P) {\n\n      ans += nCr(odd, i);\n    }\n  }\n\n  REP(i, even) { ans *= 2; }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","fast_code":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = int_fast64_t;\n\nusing PAIR = pair<int64, int64>;\n\nconstexpr int INF = 1 << 30;\n\nconstexpr int64 LINF = 1LL << 60;\n\nconstexpr int MOD = 1e9 + 7;\n\nconstexpr int MAX_N = 3e5 + 1;\n\n#define int int64\n\n#define INIT                                                                                       \\\n  ios::sync_with_stdio(false);                                                                     \\\n  cin.tie(0);\n\n#define VAR(type, ...)                                                                             \\\n  type __VA_ARGS__;                                                                                \\\n  MACRO_VAR_Scan(__VA_ARGS__);\n\ntemplate <typename T> void MACRO_VAR_Scan(T &t) { cin >> t; }\n\ntemplate <typename First, typename... Rest> void MACRO_VAR_Scan(First &first, Rest &... rest) {\n  cin >> first;\n  MACRO_VAR_Scan(rest...);\n}\n\n#define VEC(type, c, n)                                                                            \\\n  vector<type> c(n);                                                                               \\\n  for (auto &&i : c)                                                                               \\\n    cin >> i;\n\n#define OUT(dist) cout << (dist);\n\n#define FOUT(n, dist) cout << fixed << setprecision(n) << (dist);\n\n#define SP cout << \" \";\n\n#define BR cout << endl;\n\n#define zero(n) cout << setfill('0') << right << setw(n)\n\n#define debug(x)                                                                                   \\\n  cerr << #x << \":\" << (x);                                                                        \\\n  BR;\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define EACH(i, a) for (auto &&i : (a))\n\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n\n#define RFOR(i, a, b) for (int i = (b)-1; i >= 0; --i)\n\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n\n#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)\n\nint ncr[55][55];\n\nint power(int x, int n) {\n\n  int res = 1LL;\n\n  while (n > 0) {\n\n    if (n & 1)\n      (res *= x);\n\n    (x *= x);\n\n    n >>= 1;\n  }\n\n  return res;\n}\n\nint f(int n, int r) {\n\n  if (r == 0 || r == n)\n    return 1;\n\n  if (ncr[n][r] > 0)\n    return ncr[n][r];\n\n  return ncr[n][r] = f(n - 1, r - 1) + f(n - 1, r);\n}\n\nsigned main() {\n\n  INIT;\n\n  VAR(int, n, p);\n\n  VEC(int, a, n);\n\n  int zero, one = 0;\n\n  REP(i, n) {\n\n    if (a[i] % 2 == 1)\n      ++one;\n  }\n\n  zero = n - one;\n\n  int ans = 0;\n\n  REP(i, one + 1) {\n\n    if (p == i % 2) {\n\n      ans += f(one, i);\n    }\n  }\n\n  ans *= power(2, zero);\n\n  OUT(ans) BR;\n\n  return 0;\n}\n"}