oj.uz

Submission #827936

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

#define pii pair<int, int>

const int UNTIL = 4206900;

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) {
    if (mn == INT_MAX) return;
    if (mn == mx) {
      mn = INT_MAX, mx = INT_MIN;
      return;
    }
    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) {
      int i = summary->mn;
      if (i == INT_MAX) {
        mn = INT_MAX, mx = INT_MIN;
        return;
      }
      x = mn = index(i, galaxy[i]->mn);
    }
    int i = high(x), j = low(x);
    galaxy[i]->erase(j);
    if (galaxy[i]->mn == INT_MAX) summary->erase(i);
    if (x == mx) {
      if (summary->mx == INT_MIN) mx = mn;
      else {
        i = summary->mx;
        mx = index(i, galaxy[i]->mx);
      }
    }
  }

  int lower_bound(int x) {
    if (x <= mn) return mn;
    if (u <= 2) {
      if (x <= mx) return mx;
      return INT_MAX;
    }
    int i = high(x), j = low(x);
    if (j <= galaxy[i]->mx) j = galaxy[i]->lower_bound(j);
    else {
      i = summary->lower_bound(i + 1);
      j = galaxy[i]->mn;
    }
    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) {
      has[t]->erase(py);
      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 << "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;
    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;
      if (has[2 * t]->lower_bound(lo) <= hi) return qry(2 * t, tl, mm, l, r, lo, hi);
      return qry(2 * t + 1, mm + 1, tr, l, r, lo, hi);
    }
    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) {
    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<set<int>> has;

  Sustree() {}

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

  void build(int t, int tl, int tr) {
    set<int> cur;
    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;
    if (tl == tr) {
      has[t].erase(py);
      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);
    if (*has[2 * t].lower_bound(py) != py && *has[2 * t + 1].lower_bound(py) != py) has[t].erase(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
  Sustree2 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 29 ms 49636 KB Output is correct
2 Correct 28 ms 49640 KB Output is correct
3 Correct 29 ms 49944 KB Output is correct
4 Correct 29 ms 49940 KB Output is correct
5 Correct 32 ms 49956 KB Output is correct
6 Correct 29 ms 49936 KB Output is correct
7 Correct 28 ms 49868 KB Output is correct
8 Correct 29 ms 49808 KB Output is correct
9 Correct 27 ms 49636 KB Output is correct
10 Correct 29 ms 49628 KB Output is correct
11 Correct 28 ms 49684 KB Output is correct
12 Correct 27 ms 49608 KB Output is correct
13 Correct 27 ms 49760 KB Output is correct
14 Correct 27 ms 49656 KB Output is correct
15 Correct 26 ms 49620 KB Output is correct
16 Correct 28 ms 49876 KB Output is correct
17 Correct 32 ms 49900 KB Output is correct
18 Correct 28 ms 49880 KB Output is correct
19 Correct 87 ms 62284 KB Output is correct
20 Correct 50 ms 58880 KB Output is correct
21 Correct 78 ms 62956 KB Output is correct
22 Correct 99 ms 62368 KB Output is correct
23 Correct 79 ms 62356 KB Output is correct
24 Correct 51 ms 61052 KB Output is correct
25 Correct 57 ms 61132 KB Output is correct
26 Correct 87 ms 62608 KB Output is correct
27 Correct 89 ms 62372 KB Output is correct
28 Correct 76 ms 62296 KB Output is correct
29 Correct 192 ms 83876 KB Output is correct
30 Correct 66 ms 62508 KB Output is correct
31 Correct 178 ms 85920 KB Output is correct
32 Correct 209 ms 83872 KB Output is correct
33 Correct 188 ms 83864 KB Output is correct
34 Correct 97 ms 82928 KB Output is correct
35 Correct 99 ms 82960 KB Output is correct
36 Correct 196 ms 84332 KB Output is correct
37 Correct 232 ms 84068 KB Output is correct
38 Correct 171 ms 83892 KB Output is correct
39 Execution timed out 2089 ms 418604 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 49612 KB Output is correct
2 Correct 28 ms 49716 KB Output is correct
3 Correct 29 ms 49660 KB Output is correct
4 Correct 29 ms 49620 KB Output is correct
5 Correct 32 ms 49876 KB Output is correct
6 Correct 29 ms 49632 KB Output is correct
7 Correct 32 ms 49732 KB Output is correct
8 Correct 29 ms 49740 KB Output is correct
9 Correct 29 ms 49924 KB Output is correct
10 Correct 30 ms 49924 KB Output is correct
11 Correct 29 ms 49844 KB Output is correct
12 Correct 28 ms 49868 KB Output is correct
13 Correct 30 ms 49924 KB Output is correct
14 Correct 34 ms 49864 KB Output is correct
15 Correct 29 ms 49856 KB Output is correct
16 Correct 29 ms 49804 KB Output is correct
17 Correct 29 ms 49880 KB Output is correct
18 Correct 28 ms 49612 KB Output is correct
19 Correct 30 ms 49860 KB Output is correct
20 Correct 30 ms 49748 KB Output is correct
21 Correct 28 ms 49592 KB Output is correct
22 Correct 29 ms 49820 KB Output is correct
23 Correct 29 ms 49668 KB Output is correct
24 Correct 28 ms 49620 KB Output is correct
25 Correct 28 ms 49628 KB Output is correct
26 Correct 27 ms 49732 KB Output is correct
27 Correct 28 ms 49768 KB Output is correct
28 Correct 28 ms 49932 KB Output is correct
29 Correct 28 ms 49604 KB Output is correct
30 Correct 30 ms 49876 KB Output is correct
31 Correct 28 ms 49876 KB Output is correct
32 Correct 29 ms 49880 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 49692 KB Output is correct
2 Correct 31 ms 49604 KB Output is correct
3 Correct 28 ms 49720 KB Output is correct
4 Correct 33 ms 49704 KB Output is correct
5 Correct 31 ms 49628 KB Output is correct
6 Correct 28 ms 49676 KB Output is correct
7 Correct 29 ms 49980 KB Output is correct
8 Correct 29 ms 49928 KB Output is correct
9 Correct 29 ms 49904 KB Output is correct
10 Correct 28 ms 49892 KB Output is correct
11 Correct 31 ms 49848 KB Output is correct
12 Correct 28 ms 49852 KB Output is correct
13 Correct 28 ms 49620 KB Output is correct
14 Correct 29 ms 49868 KB Output is correct
15 Correct 28 ms 49612 KB Output is correct
16 Correct 28 ms 49860 KB Output is correct
17 Correct 28 ms 49748 KB Output is correct
18 Correct 29 ms 49632 KB Output is correct
19 Correct 28 ms 49620 KB Output is correct
20 Correct 28 ms 49624 KB Output is correct
21 Correct 29 ms 49928 KB Output is correct
22 Correct 29 ms 49876 KB Output is correct
23 Correct 28 ms 49876 KB Output is correct
24 Correct 30 ms 50316 KB Output is correct
25 Correct 62 ms 61004 KB Output is correct
26 Correct 72 ms 63500 KB Output is correct
27 Correct 80 ms 62872 KB Output is correct
28 Correct 93 ms 62944 KB Output is correct
29 Correct 61 ms 63684 KB Output is correct
30 Correct 61 ms 63648 KB Output is correct
31 Correct 65 ms 64484 KB Output is correct
32 Correct 91 ms 62576 KB Output is correct
33 Correct 89 ms 62472 KB Output is correct
34 Correct 181 ms 85044 KB Output is correct
35 Correct 181 ms 85960 KB Output is correct
36 Correct 199 ms 85956 KB Output is correct
37 Correct 118 ms 87412 KB Output is correct
38 Correct 118 ms 87380 KB Output is correct
39 Correct 697 ms 176540 KB Output is correct
40 Correct 1704 ms 405912 KB Output is correct
41 Execution timed out 2060 ms 435024 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 49612 KB Output is correct
2 Correct 28 ms 49716 KB Output is correct
3 Correct 29 ms 49660 KB Output is correct
4 Correct 29 ms 49620 KB Output is correct
5 Correct 32 ms 49876 KB Output is correct
6 Correct 29 ms 49632 KB Output is correct
7 Correct 32 ms 49732 KB Output is correct
8 Correct 29 ms 49740 KB Output is correct
9 Correct 29 ms 49924 KB Output is correct
10 Correct 30 ms 49924 KB Output is correct
11 Correct 29 ms 49844 KB Output is correct
12 Correct 28 ms 49868 KB Output is correct
13 Correct 30 ms 49924 KB Output is correct
14 Correct 34 ms 49864 KB Output is correct
15 Correct 29 ms 49856 KB Output is correct
16 Correct 29 ms 49804 KB Output is correct
17 Correct 29 ms 49880 KB Output is correct
18 Correct 28 ms 49612 KB Output is correct
19 Correct 30 ms 49860 KB Output is correct
20 Correct 30 ms 49748 KB Output is correct
21 Correct 28 ms 49592 KB Output is correct
22 Correct 29 ms 49820 KB Output is correct
23 Correct 29 ms 49668 KB Output is correct
24 Correct 28 ms 49620 KB Output is correct
25 Correct 28 ms 49628 KB Output is correct
26 Correct 27 ms 49732 KB Output is correct
27 Correct 28 ms 49768 KB Output is correct
28 Correct 28 ms 49932 KB Output is correct
29 Correct 28 ms 49604 KB Output is correct
30 Correct 30 ms 49876 KB Output is correct
31 Correct 28 ms 49876 KB Output is correct
32 Correct 29 ms 49880 KB Output is correct
33 Correct 84 ms 62316 KB Output is correct
34 Correct 29 ms 50392 KB Output is correct
35 Correct 32 ms 51072 KB Output is correct
36 Correct 61 ms 61004 KB Output is correct
37 Correct 50 ms 58972 KB Output is correct
38 Correct 76 ms 63476 KB Output is correct
39 Correct 78 ms 62916 KB Output is correct
40 Correct 87 ms 62396 KB Output is correct
41 Correct 80 ms 62284 KB Output is correct
42 Correct 75 ms 62920 KB Output is correct
43 Correct 76 ms 63748 KB Output is correct
44 Correct 68 ms 63796 KB Output is correct
45 Correct 52 ms 61036 KB Output is correct
46 Correct 58 ms 61072 KB Output is correct
47 Correct 58 ms 62180 KB Output is correct
48 Correct 77 ms 67508 KB Output is correct
49 Correct 82 ms 69964 KB Output is correct
50 Correct 72 ms 65124 KB Output is correct
51 Correct 77 ms 64520 KB Output is correct
52 Correct 89 ms 62648 KB Output is correct
53 Correct 87 ms 62348 KB Output is correct
54 Correct 75 ms 62364 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 49612 KB Output is correct
2 Correct 28 ms 49716 KB Output is correct
3 Correct 29 ms 49660 KB Output is correct
4 Correct 29 ms 49620 KB Output is correct
5 Correct 32 ms 49876 KB Output is correct
6 Correct 29 ms 49632 KB Output is correct
7 Correct 32 ms 49732 KB Output is correct
8 Correct 29 ms 49740 KB Output is correct
9 Correct 29 ms 49924 KB Output is correct
10 Correct 30 ms 49924 KB Output is correct
11 Correct 29 ms 49844 KB Output is correct
12 Correct 28 ms 49868 KB Output is correct
13 Correct 30 ms 49924 KB Output is correct
14 Correct 34 ms 49864 KB Output is correct
15 Correct 29 ms 49856 KB Output is correct
16 Correct 29 ms 49804 KB Output is correct
17 Correct 29 ms 49880 KB Output is correct
18 Correct 28 ms 49612 KB Output is correct
19 Correct 30 ms 49860 KB Output is correct
20 Correct 30 ms 49748 KB Output is correct
21 Correct 28 ms 49592 KB Output is correct
22 Correct 29 ms 49820 KB Output is correct
23 Correct 29 ms 49668 KB Output is correct
24 Correct 28 ms 49620 KB Output is correct
25 Correct 28 ms 49628 KB Output is correct
26 Correct 27 ms 49732 KB Output is correct
27 Correct 28 ms 49768 KB Output is correct
28 Correct 28 ms 49932 KB Output is correct
29 Correct 28 ms 49604 KB Output is correct
30 Correct 30 ms 49876 KB Output is correct
31 Correct 28 ms 49876 KB Output is correct
32 Correct 29 ms 49880 KB Output is correct
33 Correct 84 ms 62316 KB Output is correct
34 Correct 29 ms 50392 KB Output is correct
35 Correct 32 ms 51072 KB Output is correct
36 Correct 61 ms 61004 KB Output is correct
37 Correct 50 ms 58972 KB Output is correct
38 Correct 76 ms 63476 KB Output is correct
39 Correct 78 ms 62916 KB Output is correct
40 Correct 87 ms 62396 KB Output is correct
41 Correct 80 ms 62284 KB Output is correct
42 Correct 75 ms 62920 KB Output is correct
43 Correct 76 ms 63748 KB Output is correct
44 Correct 68 ms 63796 KB Output is correct
45 Correct 52 ms 61036 KB Output is correct
46 Correct 58 ms 61072 KB Output is correct
47 Correct 58 ms 62180 KB Output is correct
48 Correct 77 ms 67508 KB Output is correct
49 Correct 82 ms 69964 KB Output is correct
50 Correct 72 ms 65124 KB Output is correct
51 Correct 77 ms 64520 KB Output is correct
52 Correct 89 ms 62648 KB Output is correct
53 Correct 87 ms 62348 KB Output is correct
54 Correct 75 ms 62364 KB Output is correct
55 Correct 185 ms 83768 KB Output is correct
56 Correct 67 ms 62548 KB Output is correct
57 Correct 179 ms 85064 KB Output is correct
58 Correct 140 ms 89208 KB Output is correct
59 Correct 182 ms 85996 KB Output is correct
60 Correct 212 ms 83904 KB Output is correct
61 Correct 192 ms 83784 KB Output is correct
62 Correct 168 ms 86032 KB Output is correct
63 Correct 133 ms 87380 KB Output is correct
64 Correct 120 ms 87308 KB Output is correct
65 Correct 94 ms 83020 KB Output is correct
66 Correct 120 ms 82928 KB Output is correct
67 Correct 123 ms 84472 KB Output is correct
68 Correct 136 ms 95552 KB Output is correct
69 Correct 138 ms 94208 KB Output is correct
70 Correct 183 ms 99304 KB Output is correct
71 Correct 128 ms 88536 KB Output is correct
72 Correct 206 ms 84340 KB Output is correct
73 Correct 231 ms 84072 KB Output is correct
74 Correct 170 ms 83884 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 49636 KB Output is correct
2 Correct 28 ms 49640 KB Output is correct
3 Correct 29 ms 49944 KB Output is correct
4 Correct 29 ms 49940 KB Output is correct
5 Correct 32 ms 49956 KB Output is correct
6 Correct 29 ms 49936 KB Output is correct
7 Correct 28 ms 49868 KB Output is correct
8 Correct 29 ms 49808 KB Output is correct
9 Correct 27 ms 49636 KB Output is correct
10 Correct 29 ms 49628 KB Output is correct
11 Correct 28 ms 49684 KB Output is correct
12 Correct 27 ms 49608 KB Output is correct
13 Correct 27 ms 49760 KB Output is correct
14 Correct 27 ms 49656 KB Output is correct
15 Correct 26 ms 49620 KB Output is correct
16 Correct 28 ms 49876 KB Output is correct
17 Correct 32 ms 49900 KB Output is correct
18 Correct 28 ms 49880 KB Output is correct
19 Correct 87 ms 62284 KB Output is correct
20 Correct 50 ms 58880 KB Output is correct
21 Correct 78 ms 62956 KB Output is correct
22 Correct 99 ms 62368 KB Output is correct
23 Correct 79 ms 62356 KB Output is correct
24 Correct 51 ms 61052 KB Output is correct
25 Correct 57 ms 61132 KB Output is correct
26 Correct 87 ms 62608 KB Output is correct
27 Correct 89 ms 62372 KB Output is correct
28 Correct 76 ms 62296 KB Output is correct
29 Correct 192 ms 83876 KB Output is correct
30 Correct 66 ms 62508 KB Output is correct
31 Correct 178 ms 85920 KB Output is correct
32 Correct 209 ms 83872 KB Output is correct
33 Correct 188 ms 83864 KB Output is correct
34 Correct 97 ms 82928 KB Output is correct
35 Correct 99 ms 82960 KB Output is correct
36 Correct 196 ms 84332 KB Output is correct
37 Correct 232 ms 84068 KB Output is correct
38 Correct 171 ms 83892 KB Output is correct
39 Execution timed out 2089 ms 418604 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 49636 KB Output is correct
2 Correct 28 ms 49640 KB Output is correct
3 Correct 29 ms 49944 KB Output is correct
4 Correct 29 ms 49940 KB Output is correct
5 Correct 32 ms 49956 KB Output is correct
6 Correct 29 ms 49936 KB Output is correct
7 Correct 28 ms 49868 KB Output is correct
8 Correct 29 ms 49808 KB Output is correct
9 Correct 27 ms 49636 KB Output is correct
10 Correct 29 ms 49628 KB Output is correct
11 Correct 28 ms 49684 KB Output is correct
12 Correct 27 ms 49608 KB Output is correct
13 Correct 27 ms 49760 KB Output is correct
14 Correct 27 ms 49656 KB Output is correct
15 Correct 26 ms 49620 KB Output is correct
16 Correct 28 ms 49876 KB Output is correct
17 Correct 32 ms 49900 KB Output is correct
18 Correct 28 ms 49880 KB Output is correct
19 Correct 87 ms 62284 KB Output is correct
20 Correct 50 ms 58880 KB Output is correct
21 Correct 78 ms 62956 KB Output is correct
22 Correct 99 ms 62368 KB Output is correct
23 Correct 79 ms 62356 KB Output is correct
24 Correct 51 ms 61052 KB Output is correct
25 Correct 57 ms 61132 KB Output is correct
26 Correct 87 ms 62608 KB Output is correct
27 Correct 89 ms 62372 KB Output is correct
28 Correct 76 ms 62296 KB Output is correct
29 Correct 192 ms 83876 KB Output is correct
30 Correct 66 ms 62508 KB Output is correct
31 Correct 178 ms 85920 KB Output is correct
32 Correct 209 ms 83872 KB Output is correct
33 Correct 188 ms 83864 KB Output is correct
34 Correct 97 ms 82928 KB Output is correct
35 Correct 99 ms 82960 KB Output is correct
36 Correct 196 ms 84332 KB Output is correct
37 Correct 232 ms 84068 KB Output is correct
38 Correct 171 ms 83892 KB Output is correct
39 Execution timed out 2089 ms 418604 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 49636 KB Output is correct
2 Correct 28 ms 49640 KB Output is correct
3 Correct 29 ms 49944 KB Output is correct
4 Correct 29 ms 49940 KB Output is correct
5 Correct 32 ms 49956 KB Output is correct
6 Correct 29 ms 49936 KB Output is correct
7 Correct 28 ms 49868 KB Output is correct
8 Correct 29 ms 49808 KB Output is correct
9 Correct 27 ms 49636 KB Output is correct
10 Correct 29 ms 49628 KB Output is correct
11 Correct 28 ms 49684 KB Output is correct
12 Correct 27 ms 49608 KB Output is correct
13 Correct 27 ms 49760 KB Output is correct
14 Correct 27 ms 49656 KB Output is correct
15 Correct 26 ms 49620 KB Output is correct
16 Correct 28 ms 49876 KB Output is correct
17 Correct 32 ms 49900 KB Output is correct
18 Correct 28 ms 49880 KB Output is correct
19 Correct 87 ms 62284 KB Output is correct
20 Correct 50 ms 58880 KB Output is correct
21 Correct 78 ms 62956 KB Output is correct
22 Correct 99 ms 62368 KB Output is correct
23 Correct 79 ms 62356 KB Output is correct
24 Correct 51 ms 61052 KB Output is correct
25 Correct 57 ms 61132 KB Output is correct
26 Correct 87 ms 62608 KB Output is correct
27 Correct 89 ms 62372 KB Output is correct
28 Correct 76 ms 62296 KB Output is correct
29 Correct 192 ms 83876 KB Output is correct
30 Correct 66 ms 62508 KB Output is correct
31 Correct 178 ms 85920 KB Output is correct
32 Correct 209 ms 83872 KB Output is correct
33 Correct 188 ms 83864 KB Output is correct
34 Correct 97 ms 82928 KB Output is correct
35 Correct 99 ms 82960 KB Output is correct
36 Correct 196 ms 84332 KB Output is correct
37 Correct 232 ms 84068 KB Output is correct
38 Correct 171 ms 83892 KB Output is correct
39 Execution timed out 2089 ms 418604 KB Time limit exceeded
40 Halted 0 ms 0 KB -