oj.uz

Submission #827842

# Submission time Handle Problem Language Result Execution time Memory
827842 2023-08-16T20:04:47 Z null_awe Maze (JOI23_ho_t3) C++14
43 / 100
 2000 ms 759128 KB 
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int, int>

const int UNTIL = 69420;

vector<int> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};

int LG2[UNTIL];

int csqrt[UNTIL], fsqrt[UNTIL];

void init() {
  LG2[1] = 0;
  for (int i = 2; i < UNTIL; ++i) LG2[i] = LG2[i >> 1] + 1;
  csqrt[1] = fsqrt[1] = 1;
  for (int i = 2; i < UNTIL; ++i) {
    fsqrt[i] = fsqrt[i - 1];
    while ((fsqrt[i] + 1) * (fsqrt[i] + 1) <= i) ++fsqrt[i];
    csqrt[i] = fsqrt[i];
    if (fsqrt[i] * fsqrt[i] < i) ++csqrt[i];
  }
}

struct VEB {

  int u, mn, mx, sz;
  VEB *summary;
  vector<VEB*> galaxy;

  inline int high(int k) { return k / sz; }
  inline int low(int k) { return k % sz; }
  inline int index(int k, int kk) { return k * sz + kk; }

  VEB(int u) : u(u) {
    mn = INT_MAX, mx = INT_MIN;
    if (u <= 2) summary = nullptr, galaxy.resize(0, nullptr);
    else {
      int ngalaxy = csqrt[u];
      sz = (u + ngalaxy - 1) / ngalaxy;
      summary = new VEB(ngalaxy);
      galaxy.resize(ngalaxy, nullptr);
      for (int i = 0; i < ngalaxy - 1; ++i) galaxy[i] = new VEB(sz);
      galaxy[ngalaxy - 1] = new VEB(u - (ngalaxy - 1) * sz);
    }
  }

  void insert(int x) {
    if (mn == INT_MAX) mn = mx = x;
    else {
      if (x < mn) swap(x, mn);
      if (x > mx) mx = x;
      if (u <= 2) return;
      int i = high(x), j = low(x);
      if (galaxy[i]->mn == INT_MAX) summary->insert(i);
      galaxy[i]->insert(j);
    }
  }

  void erase(int x) {
    // cout << "ERASING " << u << ' ' << x << endl;
    // if (u == 5 && x == 0) cout << mn << endl;
    if (u <= 2) {
      if (x != mx) mn = mx;
      else if (x == mn) mn = INT_MAX, mx = INT_MIN;
      else if (x == 0) mn = 1;
      else mx = 0;
      return;
    }
    if (x == mn) {
      // cout << "x == mn" << endl;
      int i = summary->mn;
      if (i == INT_MAX) {
        mn = INT_MAX, mx = INT_MIN;
        return;
      }
      // cout << i << endl;
      x = mn = index(i, galaxy[i]->mn);
      // cout << "x = " << mn << endl;
    }
    int i = high(x), j = low(x);
    // cout << i << ' ' << j << endl;
    galaxy[i]->erase(j);
    // if (galaxy[i]->u == 3) cout << galaxy[0]->mx << " asdfoaisdjflaksdjflaksdjf" << endl;
    if (galaxy[i]->mn == INT_MAX) summary->erase(i);
    if (x == mx) {
      if (summary->mx == INT_MIN) mx = mn;
      else {
        i = summary->mn;
        mx = index(i, galaxy[i]->mx);
        // if (u == 3) cout << "asfldahlsdkjfhalwieuhfoaiudhrgADFHGDFHGUDFHGADOFUHGADOFIUGHADUFGHADOUFGH " << mx << endl;
      }
    }
    // if (u == 5 && x == 0) exit(0);
  }

  int lower_bound(int x) {
    // cout << u << ' ' << x << ' ' << mn << endl;
    // if (u > 2) cout << "gmax " << galaxy[0]->mx << ' ' << galaxy[1]->mx << endl;
    if (x <= mn) return mn;
    if (u <= 2) {
      if (x <= mx) return mx;
      return INT_MAX;
    }
    int i = high(x), j = low(x);
    // cout << i << ' ' << j << endl;
    // cout << galaxy[i]->mx << endl;
    if (j <= galaxy[i]->mx) j = galaxy[i]->lower_bound(j);
    else {
      // cout << "qry other " << i + 1 << endl;
      i = summary->lower_bound(i + 1);
      j = galaxy[i]->mn;
    }
    // cout << "index(" << i << ", " << j << ")\n";
    return index(i, j);
  }
};

VEB* build_veb(int u) {
  VEB* root = new VEB(u);
  for (int i = 0; i < u; ++i) root->insert(i);
  return root;
}

struct Sustree2 {

  int n, m;
  vector<VEB*> has;

  Sustree2() {}

  Sustree2(int n, int m) : n(n), m(m), has(4 * n, nullptr) {}

  void build(int t, int tl, int tr) {
    // cout << "BUILD" << endl;
    has[t] = build_veb(m + 1);
    if (tl == tr) return;
    build(2 * t, tl, (tl + tr) / 2);
    build(2 * t + 1, (tl + tr) / 2 + 1, tr);
    // cout << "BUILT" << endl;
  }

  void build() {
    build(1, 0, n - 1);
  }

  void upd(int t, int tl, int tr, int p, int py) {
    if (tl == tr) {
      // cout << "UPD rng " << t << ' ' << tl << ' ' << tr << ' ' << p << ' ' << py << endl;
      // cout << tl << ' ' << tr << endl;
      has[t]->erase(py);
      // cout << "after max " << has[8]->summary->summary->mx << endl;
      return;
    }
    if (p <= (tl + tr) / 2) upd(2 * t, tl, (tl + tr) / 2, p, py);
    else upd(2 * t + 1, (tl + tr) / 2 + 1, tr, p, py);
    // cout << t << ' ' << tl << ' ' << tr << endl;
    // cout << "START a" << endl;
    int a = has[2 * t]->lower_bound(py);
    // cout << "START b " << endl;
    int b = has[2 * t + 1]->lower_bound(py);
    // cout << a << ' ' << b << ' ' << py << endl;
    if (a != py && b != py) {
      // cout << a << ' ' << b << ' ' << py << endl;
      // cout << "UPD rng " << t << ' ' << tl << ' ' << tr << ' ' << p << ' ' << py << endl;
      has[t]->erase(py);
      // cout << "after max " << has[8]->summary->summary->mx << endl;
    }
  }

  void upd(int x, int y) {
    // cout << "UPD " << x << ' ' << y << endl;
    // cout << "UPD " << x << ' ' << y << endl;
    upd(1, 0, n - 1, x, y);
    // cout << "DONE" << endl;
  }

  pii qry(int t, int tl, int tr, int l, int r, int lo, int hi) {
    l = max(l, tl), r = min(r, tr);
    if (l > r) return {-1, -1};
    if (tl == l && tr == r) {
      int gr = has[t]->lower_bound(lo);
      if (gr > hi) return {-1, -1};
      // cout << tl << ' ' << gr << endl;
      if (tl == tr) {
        return {tl, gr};
      }
    }
    int mm = (tl + tr) / 2;
    pii f = qry(2 * t, tl, mm, l, r, lo, hi);
    if (f.first >= 0) return f;
    return qry(2 * t + 1, mm + 1, tr, l, r, lo, hi);
  }

  pii qry(int x1, int y1, int x2, int y2) {
    // cout << "QRY" << endl;
    return qry(1, 0, n - 1, max(x1, 0), min(x2, n - 1), max(y1, 0), min(y2, m - 1));
  }
};

struct Sustree {

  int n, m;
  vector<multiset<int>> has;

  Sustree() {}

  Sustree(int n, int m) : n(n), m(m), has(4 * n) {}

  void build(int t, int tl, int tr) {
    multiset<int> cur;
    for (int i = tl; i <= tr; ++i) for (int j = 0; j < m; ++j) cur.insert(j);
    cur.insert(m);
    has[t] = cur;
    if (tl == tr) return;
    build(2 * t, tl, (tl + tr) / 2);
    build(2 * t + 1, (tl + tr) / 2 + 1, tr);
  }

  void build() {
    // cout << "BUILD ,;";
    build(1, 0, n - 1);
    // cout << "DONE" << endl;
  }

  void upd(int t, int tl, int tr, int p, int py) {
    // cout << t << ' ' <<  tl << ' ' << tr << endl;
    // for (int num : has[t]) cout << num << ' ';
    // cout << endl;
    has[t].erase(has[t].find(py));
    if (tl == tr) return;
    int m = (tl + tr) / 2;
    if (p <= m) upd(2 * t, tl, m, p, py);
    else upd(2 * t + 1, m + 1, tr, p, py);
  }

  void upd(int x, int y) {
    // cout << "UPD " << x << ' ' << y << endl;
    upd(1, 0, n - 1, x, y);
    // cout << "DONE" << endl;
  }

  pii qry(int t, int tl, int tr, int l, int r, int lo, int hi) {
    l = max(l, tl), r = min(r, tr);
    if (l > r) return {-1, -1};
    if (tl == l && tr == r) {
      int gr = *has[t].lower_bound(lo);
      if (gr > hi) return {-1, -1};
      if (tl == tr) {
        return {tl, gr};
      }
      int m = (tl + tr) / 2;
      if (*has[2 * t].lower_bound(lo) <= hi) return qry(2 * t, tl, m, l, r, lo, hi);
      return qry(2 * t + 1, m + 1, tr, l, r, lo, hi);
    }
    int m = (tl + tr) / 2;
    pii f = qry(2 * t, tl, m, l, r, lo, hi);
    if (f.first >= 0) return f;
    return qry(2 * t + 1, m + 1, tr, l, r, lo, hi);
  }

  pii qry(int x1, int y1, int x2, int y2) {
    return qry(1, 0, n - 1, max(x1, 0), min(x2, n - 1), max(y1, 0), min(y2, m - 1));
  }
};

struct Segtree {

  int n;
  vector<bool> on;

  Segtree() {}

  Segtree(int n) : n(n), on(4 * n, 1) {}

  void upd(int t, int tl, int tr, int p) {
    if (tl == tr) on[t] = false;
    else {
      int m = (tl + tr) / 2;
      if (p <= m) upd(2 * t, tl, m, p);
      else upd(2 * t + 1, m + 1, tr, p);
      on[t] = on[2 * t] | on[2 * t + 1];
    }
  }

  int qry(int t, int tl, int tr, int l, int r) {
    l = max(l, tl), r = min(r, tr);
    if (l > r) return -1;
    if (tl == l && tr == r && !on[t]) return -1;
    if (tl == tr) {
      assert(on[t]);
      return tl;
    }
    int m = (tl + tr) / 2;
    int f = qry(2 * t, tl, m, l, r);
    if (f >= 0) return f;
    return qry(2 * t + 1, m + 1, tr, l, r);
  }
};

struct Groups {

  int r, c;
  vector<Segtree> rs, cs;

  Groups() {}

  Groups(int r, int c) : r(r), c(c) {
    for (int i = 0; i < r; ++i) {
      Segtree tmp(c);
      rs.push_back(tmp);
    }
    for (int i = 0; i < c; ++i) {
      Segtree tmp(r);
      cs.push_back(tmp);
    }
  }

  void upd(int x, int y) {
    // cout << x << ' ' << y << endl;
    rs[x].upd(1, 0, c - 1, y);
    cs[y].upd(1, 0, r - 1, x);
    // cout << "done" << endl;
  }

  int qrow(int row, int l, int rr) {
    if (row < 0 || row >= r) return -1;
    return rs[row].qry(1, 0, c - 1, max(l, 0), min(rr, c - 1));
  }

  int qcol(int col, int l, int rr) {
    if (col < 0 || col >= c) return -1;
    return cs[col].qry(1, 0, r - 1, max(l, 0), min(rr, r - 1));
  }
};

int main() {
  init();
  ios_base::sync_with_stdio(false); cin.tie(NULL);
  int r, c, n; cin >> r >> c >> n;
  int sx, sy; cin >> sx >> sy; --sx, --sy;
  int gx, gy; cin >> gx >> gy; --gx, --gy;
  vector<string> arr(r);
  for (int i = 0; i < r; ++i) cin >> arr[i];
  // . = empty
  // # = wall
  Sustree sus(r, c); sus.build();
  Groups groups(r, c);
  vector<vector<int>> dists(r, vector<int>(c, INT_MAX));
  dists[sx][sy] = 0;
  // cout << dists[gx][gy] << '\n';
  groups.upd(sx, sy);
  sus.upd(sx, sy);
  // cout << groups.qrow(sx, sy, sy) << endl;
  vector<pii> q; q.push_back({sx, sy});
  queue<pii> rq; for (pii _p : q) rq.push(_p);
  while (rq.size()) {
    pii front = rq.front(); rq.pop();
    int xx = front.first, yy = front.second;
    for (int d = 0; d < 4; ++d) {
      int nx = xx + dx[d], ny = yy + dy[d];
      if (nx < 0 || ny < 0 || nx >= r || ny >= c) continue;
      if (dists[nx][ny] < INT_MAX || arr[nx][ny] == '#') continue;
      rq.push({nx, ny});
      q.push_back({nx, ny});
      dists[nx][ny] = dists[xx][yy];
      groups.upd(nx, ny);
      sus.upd(nx, ny);
    }
  }
  while (q.size()) {
    // for (int i = 0; i < r; ++i) {
      // for (int j = 0; j < c; ++j) cout << dists[i][j] << ' ';
      // cout << endl;
    // }
    // break;
    // cout << "here" << endl;
    // break;
    vector<pii> nq;
    for (pii p : q) {
      int x = p.first, y = p.second;
      // cout << x << ' ' << y << '\n';
      if (x > 0 && dists[x - 1][y] <= dists[x][y]) {
          // cout << "t1" << endl;
        // query down:
        int cur;
        while ((cur = groups.qrow(x + n, y - n + 1, y + n - 1)) != -1) {
          nq.push_back({x + n, cur});
          dists[x + n][cur] = dists[x][y] + 1;
          groups.upd(x + n, cur);
          sus.upd(x + n, cur);
        }
        if (x + n - 1 < r && y - n >= 0 && dists[x + n - 1][y - n] == INT_MAX) {
          nq.push_back({x + n - 1, y - n});
          dists[x + n - 1][y - n] = dists[x][y] + 1;
          groups.upd(x + n - 1, y - n);
          sus.upd(x + n - 1, y - n);
        }
        if (x + n - 1 < r && y + n < c && dists[x + n - 1][y + n] == INT_MAX) {
          nq.push_back({x + n - 1, y + n});
          dists[x + n - 1][y + n] = dists[x][y] + 1;
          groups.upd(x + n - 1, y + n);
          sus.upd(x + n - 1, y + n);
        }
      } else if (y < r - 1 && dists[x][y + 1] <= dists[x][y]) {
          // cout << "t4" << endl;
        // query left:
        int cur;
        while ((cur = groups.qcol(y - n, x - n + 1, x + n - 1)) != -1) {
          nq.push_back({cur, y - n});
          dists[cur][y - n] = dists[x][y] + 1;
          groups.upd(cur, y - n);
          sus.upd(cur, y - n);
        }
        if (y - n + 1 >= 0 && x - n >= 0 && dists[x - n][y - n + 1] == INT_MAX) {
          nq.push_back({x - n, y - n + 1});
          dists[x - n][y - n + 1] = dists[x][y] + 1;
          groups.upd(x - n, y - n + 1);
          sus.upd(x - n, y - n + 1);
        }
        if (y - n + 1 >= 0 && x + n < r && dists[x + n][y - n + 1] == INT_MAX) {
          nq.push_back({x + n, y - n + 1});
          dists[x + n][y - n + 1] = dists[x][y] + 1;
          groups.upd(x + n, y - n + 1);
          sus.upd(x + n, y - n + 1);
        }
      } else {
        // query all:
        for (int i = -n; i <= n; i += 2 * n) {
          int cx = x + i, cyl = y - n + 1, cyr = y + n - 1, cur;
          while ((cur = groups.qrow(cx, cyl, cyr)) != -1) {
            nq.push_back({cx, cur});
            dists[cx][cur] = dists[x][y] + 1;
            groups.upd(cx, cur);
            sus.upd(cx, cur);
          }
        }
        pii cur;
        while ((cur = sus.qry(x - n + 1, y - n, x + n - 1, y + n)).first != -1) {
          int nx = cur.first, ny = cur.second;
          nq.push_back({nx, ny});
          dists[nx][ny] = dists[x][y] + 1;
          groups.upd(nx, ny);
          sus.upd(nx, ny);
        }
      }
    }
    queue<pii> rq; for (pii _p : nq) rq.push(_p);
    while (rq.size()) {
      pii front = rq.front(); rq.pop();
      int xx = front.first, yy = front.second;
      for (int d = 0; d < 4; ++d) {
        int nx = xx + dx[d], ny = yy + dy[d];
        if (nx < 0 || ny < 0 || nx >= r || ny >= c) continue;
        if (dists[nx][ny] < INT_MAX || arr[nx][ny] == '#') continue;
        rq.push({nx, ny});
        nq.push_back({nx, ny});
        dists[nx][ny] = dists[xx][yy];
        groups.upd(nx, ny);
        sus.upd(nx, ny);
      }
    }
    q = nq;
  }
  cout << dists[gx][gy] << '\n';
  return 0;
}

Compilation message

Main.cpp:12:5: warning: built-in function 'csqrt' declared as non-function [-Wbuiltin-declaration-mismatch]
   12 | int csqrt[UNTIL], fsqrt[UNTIL];
      |     ^~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 2 ms 1492 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 2 ms 1524 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1140 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1140 KB Output is correct
12 Correct 1 ms 1144 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 2 ms 1520 KB Output is correct
18 Correct 2 ms 1492 KB Output is correct
19 Correct 211 ms 31916 KB Output is correct
20 Correct 26 ms 8660 KB Output is correct
21 Correct 173 ms 32020 KB Output is correct
22 Correct 211 ms 31944 KB Output is correct
23 Correct 181 ms 32248 KB Output is correct
24 Correct 29 ms 9940 KB Output is correct
25 Correct 34 ms 9940 KB Output is correct
26 Correct 200 ms 31940 KB Output is correct
27 Correct 217 ms 31980 KB Output is correct
28 Correct 176 ms 31912 KB Output is correct
29 Correct 639 ms 83632 KB Output is correct
30 Correct 48 ms 11328 KB Output is correct
31 Correct 534 ms 85680 KB Output is correct
32 Correct 672 ms 83640 KB Output is correct
33 Correct 622 ms 83628 KB Output is correct
34 Correct 78 ms 27820 KB Output is correct
35 Correct 89 ms 27808 KB Output is correct
36 Correct 758 ms 83664 KB Output is correct
37 Correct 784 ms 83628 KB Output is correct
38 Correct 664 ms 83660 KB Output is correct
39 Execution timed out 2077 ms 759128 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1140 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 2 ms 1396 KB Output is correct
10 Correct 2 ms 1420 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 2 ms 1484 KB Output is correct
13 Correct 2 ms 1492 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 1 ms 1272 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1272 KB Output is correct
18 Correct 1 ms 1140 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 2 ms 1364 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct
30 Correct 2 ms 1492 KB Output is correct
31 Correct 2 ms 1492 KB Output is correct
32 Correct 2 ms 1492 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 2 ms 1492 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 1492 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 2 ms 1364 KB Output is correct
22 Correct 2 ms 1492 KB Output is correct
23 Correct 2 ms 1492 KB Output is correct
24 Correct 4 ms 1876 KB Output is correct
25 Correct 74 ms 16972 KB Output is correct
26 Correct 111 ms 22684 KB Output is correct
27 Correct 169 ms 32028 KB Output is correct
28 Correct 177 ms 32020 KB Output is correct
29 Correct 156 ms 32024 KB Output is correct
30 Correct 159 ms 31900 KB Output is correct
31 Correct 96 ms 26308 KB Output is correct
32 Correct 221 ms 32016 KB Output is correct
33 Correct 227 ms 32044 KB Output is correct
34 Correct 421 ms 63024 KB Output is correct
35 Correct 549 ms 85600 KB Output is correct
36 Correct 546 ms 85664 KB Output is correct
37 Correct 495 ms 84784 KB Output is correct
38 Correct 485 ms 84784 KB Output is correct
39 Execution timed out 2068 ms 257024 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1140 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 2 ms 1396 KB Output is correct
10 Correct 2 ms 1420 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 2 ms 1484 KB Output is correct
13 Correct 2 ms 1492 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 1 ms 1272 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1272 KB Output is correct
18 Correct 1 ms 1140 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 2 ms 1364 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct
30 Correct 2 ms 1492 KB Output is correct
31 Correct 2 ms 1492 KB Output is correct
32 Correct 2 ms 1492 KB Output is correct
33 Correct 205 ms 31968 KB Output is correct
34 Correct 4 ms 1988 KB Output is correct
35 Correct 4 ms 2004 KB Output is correct
36 Correct 75 ms 17212 KB Output is correct
37 Correct 27 ms 8660 KB Output is correct
38 Correct 114 ms 22600 KB Output is correct
39 Correct 172 ms 31952 KB Output is correct
40 Correct 201 ms 32024 KB Output is correct
41 Correct 188 ms 32016 KB Output is correct
42 Correct 175 ms 31932 KB Output is correct
43 Correct 158 ms 32028 KB Output is correct
44 Correct 156 ms 31984 KB Output is correct
45 Correct 29 ms 9940 KB Output is correct
46 Correct 34 ms 9972 KB Output is correct
47 Correct 40 ms 11040 KB Output is correct
48 Correct 75 ms 20124 KB Output is correct
49 Correct 89 ms 22732 KB Output is correct
50 Correct 94 ms 24476 KB Output is correct
51 Correct 98 ms 26268 KB Output is correct
52 Correct 222 ms 32024 KB Output is correct
53 Correct 218 ms 32024 KB Output is correct
54 Correct 181 ms 32016 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1140 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 2 ms 1396 KB Output is correct
10 Correct 2 ms 1420 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 2 ms 1484 KB Output is correct
13 Correct 2 ms 1492 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 1 ms 1272 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1272 KB Output is correct
18 Correct 1 ms 1140 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 2 ms 1364 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct
30 Correct 2 ms 1492 KB Output is correct
31 Correct 2 ms 1492 KB Output is correct
32 Correct 2 ms 1492 KB Output is correct
33 Correct 205 ms 31968 KB Output is correct
34 Correct 4 ms 1988 KB Output is correct
35 Correct 4 ms 2004 KB Output is correct
36 Correct 75 ms 17212 KB Output is correct
37 Correct 27 ms 8660 KB Output is correct
38 Correct 114 ms 22600 KB Output is correct
39 Correct 172 ms 31952 KB Output is correct
40 Correct 201 ms 32024 KB Output is correct
41 Correct 188 ms 32016 KB Output is correct
42 Correct 175 ms 31932 KB Output is correct
43 Correct 158 ms 32028 KB Output is correct
44 Correct 156 ms 31984 KB Output is correct
45 Correct 29 ms 9940 KB Output is correct
46 Correct 34 ms 9972 KB Output is correct
47 Correct 40 ms 11040 KB Output is correct
48 Correct 75 ms 20124 KB Output is correct
49 Correct 89 ms 22732 KB Output is correct
50 Correct 94 ms 24476 KB Output is correct
51 Correct 98 ms 26268 KB Output is correct
52 Correct 222 ms 32024 KB Output is correct
53 Correct 218 ms 32024 KB Output is correct
54 Correct 181 ms 32016 KB Output is correct
55 Correct 679 ms 83556 KB Output is correct
56 Correct 49 ms 11336 KB Output is correct
57 Correct 422 ms 62988 KB Output is correct
58 Correct 190 ms 43864 KB Output is correct
59 Correct 540 ms 85748 KB Output is correct
60 Correct 701 ms 83700 KB Output is correct
61 Correct 654 ms 83636 KB Output is correct
62 Correct 536 ms 85680 KB Output is correct
63 Correct 548 ms 84752 KB Output is correct
64 Correct 516 ms 84788 KB Output is correct
65 Correct 84 ms 27820 KB Output is correct
66 Correct 93 ms 27724 KB Output is correct
67 Correct 112 ms 29532 KB Output is correct
68 Correct 212 ms 53100 KB Output is correct
69 Correct 259 ms 57744 KB Output is correct
70 Correct 269 ms 62972 KB Output is correct
71 Correct 293 ms 67948 KB Output is correct
72 Correct 809 ms 83628 KB Output is correct
73 Correct 778 ms 83600 KB Output is correct
74 Correct 660 ms 83704 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 2 ms 1492 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 2 ms 1524 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1140 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1140 KB Output is correct
12 Correct 1 ms 1144 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 2 ms 1520 KB Output is correct
18 Correct 2 ms 1492 KB Output is correct
19 Correct 211 ms 31916 KB Output is correct
20 Correct 26 ms 8660 KB Output is correct
21 Correct 173 ms 32020 KB Output is correct
22 Correct 211 ms 31944 KB Output is correct
23 Correct 181 ms 32248 KB Output is correct
24 Correct 29 ms 9940 KB Output is correct
25 Correct 34 ms 9940 KB Output is correct
26 Correct 200 ms 31940 KB Output is correct
27 Correct 217 ms 31980 KB Output is correct
28 Correct 176 ms 31912 KB Output is correct
29 Correct 639 ms 83632 KB Output is correct
30 Correct 48 ms 11328 KB Output is correct
31 Correct 534 ms 85680 KB Output is correct
32 Correct 672 ms 83640 KB Output is correct
33 Correct 622 ms 83628 KB Output is correct
34 Correct 78 ms 27820 KB Output is correct
35 Correct 89 ms 27808 KB Output is correct
36 Correct 758 ms 83664 KB Output is correct
37 Correct 784 ms 83628 KB Output is correct
38 Correct 664 ms 83660 KB Output is correct
39 Execution timed out 2077 ms 759128 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 2 ms 1492 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 2 ms 1524 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1140 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1140 KB Output is correct
12 Correct 1 ms 1144 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 2 ms 1520 KB Output is correct
18 Correct 2 ms 1492 KB Output is correct
19 Correct 211 ms 31916 KB Output is correct
20 Correct 26 ms 8660 KB Output is correct
21 Correct 173 ms 32020 KB Output is correct
22 Correct 211 ms 31944 KB Output is correct
23 Correct 181 ms 32248 KB Output is correct
24 Correct 29 ms 9940 KB Output is correct
25 Correct 34 ms 9940 KB Output is correct
26 Correct 200 ms 31940 KB Output is correct
27 Correct 217 ms 31980 KB Output is correct
28 Correct 176 ms 31912 KB Output is correct
29 Correct 639 ms 83632 KB Output is correct
30 Correct 48 ms 11328 KB Output is correct
31 Correct 534 ms 85680 KB Output is correct
32 Correct 672 ms 83640 KB Output is correct
33 Correct 622 ms 83628 KB Output is correct
34 Correct 78 ms 27820 KB Output is correct
35 Correct 89 ms 27808 KB Output is correct
36 Correct 758 ms 83664 KB Output is correct
37 Correct 784 ms 83628 KB Output is correct
38 Correct 664 ms 83660 KB Output is correct
39 Execution timed out 2077 ms 759128 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 2 ms 1492 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 2 ms 1524 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1140 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1140 KB Output is correct
12 Correct 1 ms 1144 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 2 ms 1520 KB Output is correct
18 Correct 2 ms 1492 KB Output is correct
19 Correct 211 ms 31916 KB Output is correct
20 Correct 26 ms 8660 KB Output is correct
21 Correct 173 ms 32020 KB Output is correct
22 Correct 211 ms 31944 KB Output is correct
23 Correct 181 ms 32248 KB Output is correct
24 Correct 29 ms 9940 KB Output is correct
25 Correct 34 ms 9940 KB Output is correct
26 Correct 200 ms 31940 KB Output is correct
27 Correct 217 ms 31980 KB Output is correct
28 Correct 176 ms 31912 KB Output is correct
29 Correct 639 ms 83632 KB Output is correct
30 Correct 48 ms 11328 KB Output is correct
31 Correct 534 ms 85680 KB Output is correct
32 Correct 672 ms 83640 KB Output is correct
33 Correct 622 ms 83628 KB Output is correct
34 Correct 78 ms 27820 KB Output is correct
35 Correct 89 ms 27808 KB Output is correct
36 Correct 758 ms 83664 KB Output is correct
37 Correct 784 ms 83628 KB Output is correct
38 Correct 664 ms 83660 KB Output is correct
39 Execution timed out 2077 ms 759128 KB Time limit exceeded
40 Halted 0 ms 0 KB -