oj.uz

Submission #827662

# Submission time Handle Problem Language Result Execution time Memory
827662 2023-08-16T16:06:46 Z null_awe Maze (JOI23_ho_t3) C++14
43 / 100
 2000 ms 678612 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];

void init() {
  LG2[1] = 0;
  for (int i = 2; i < UNTIL; ++i) LG2[i] = LG2[i >> 1] + 1;
}

class vEB
{
    int u;
    int min;
    int max;
    vEB *summary;
    std::vector<vEB *> children;

    int high(int k){
        int x = std::ceil(std::sqrt(u));
        return std::floor(k / x);
    }

    int low(int k){
        int x = std::ceil(std::sqrt(u));
        return k % x;
    }

    int index(int k, int kk){
        return (k * (int)std::sqrt(u)) + kk;
    }

public:

    vEB(int U){
        // u = std::pow(std::sqrt(U), 2);
        u = U;
        min = U;
        max = -1;
        
        if (u <= 2){
            summary = nullptr;
            children = std::vector<vEB *> (0, nullptr);
        }
        else{
            int children_count = std::ceil(std::sqrt(u));
            int children_size = std::ceil(u / std::sqrt(u));

            summary = new vEB(children_count);
            children = std::vector<vEB *> (children_count, nullptr);
            for(int i = 0; i < children_count; ++i){
                children[i] = new vEB(children_count);
            }
        }
    }

    void insert(int k){
        if(min > max){
            min = max = k;
            return;
        }

        if(k < min){
            int temp;
            temp = min;
            min = k;
            k = temp;
        }

        if(k > max)
            max = k;
        
        if(u == 2){
            max = k;
            return;
        }

        int i = high(k);
        int j = low(k);

        children[i]->insert(j);

        if(children[i]->max == children[i]->min)
            summary->insert(i);
    }

    void remove(int k){
        if(min > max)
            return;

        if(min == max){
            min = u;
            max = -1;
            return;
        }

        if(u == 2){
            if(k == 1){
                if(min == 1){
                    min = u;
                    max = -1;
                }
                else if(min == 0)
                    max = 0;
            }
            else
                if(max == 0){
                    min = u;
                    max = -1;
                }
                else if(max == 1)
                    min = 1;
            return;
        }

        if(k == min){
            int i = summary->min;
            min = index(i, children[i]->min);
            return;
        }

        int i = high(k);
        int j = low(k);

        children[i]->remove(j);

        if(children[i]->min > children[i]->max){
            summary->remove(i);
        }

        if(k == max){
            if(summary->min > summary->max){
                max = min;
            }
            else{
                i = summary->min;
                max = index(i, children[i]->max);
            }
        }
    }

    int getMin(){
        return min;
    }
    int getMax(){
        return max;
    }

    int universe(){
        return u;
    }

    int successor(int k){
        if(k <= min)
            return min;
        else if(k > max)
            return u;
        
        int i = high(k);
        int j = low(k);

        if(j <= children[i]->max){
            int res = children[i]->successor(j);
            if(res >= (u / (int)std::sqrt(u)))
                return u;
            return k - j + res;
        }
        else{
            int res = children[summary->successor(i)]->min;
            if(res >= children[summary->min]->u)
                return u;
            return index(summary->successor(i), res);
        }
    }
};

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) {}

  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) {
    // cout << t << ' ' <<  tl << ' ' << tr << endl;
    // for (int num : has[t]) cout << num << ' ';
    // cout << endl;
    if (tl == tr) {
      has[t]->remove(py);
      return;
    }
    if (p <= m) upd(2 * t, tl, (tl + tr) / 2, p, py);
    else upd(2 * t + 1, (tl + tr) / 2 + 1, tr, p, py);
    if (has[2 * t]->successor(py) != py && has[2 * t + 1]->successor(py) != py) has[t]->remove(py);
  }

  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]->successor(lo);
      if (gr > hi) return {-1, -1};
      cout << tl << ' ' << gr << endl;
      if (tl == tr) {
        return {tl, gr};
      }
    }
    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) {
    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;
  vector<int> first;

  Sustree() {}

  Sustree(int n, int m) : n(n), m(m), has(4 * n), first(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: In constructor 'vEB::vEB(int)':
Main.cpp:53:17: warning: unused variable 'children_size' [-Wunused-variable]
   53 |             int children_size = std::ceil(u / std::sqrt(u));
      |                 ^~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 848 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 2 ms 984 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 210 ms 31480 KB Output is correct
20 Correct 27 ms 7992 KB Output is correct
21 Correct 207 ms 31480 KB Output is correct
22 Correct 198 ms 31484 KB Output is correct
23 Correct 208 ms 31456 KB Output is correct
24 Correct 33 ms 9428 KB Output is correct
25 Correct 40 ms 9312 KB Output is correct
26 Correct 258 ms 31480 KB Output is correct
27 Correct 257 ms 31476 KB Output is correct
28 Correct 194 ms 31480 KB Output is correct
29 Correct 795 ms 83092 KB Output is correct
30 Correct 64 ms 10772 KB Output is correct
31 Correct 561 ms 85140 KB Output is correct
32 Correct 769 ms 82980 KB Output is correct
33 Correct 740 ms 83092 KB Output is correct
34 Correct 88 ms 27224 KB Output is correct
35 Correct 113 ms 27268 KB Output is correct
36 Correct 814 ms 82980 KB Output is correct
37 Correct 863 ms 83092 KB Output is correct
38 Correct 692 ms 83096 KB Output is correct
39 Execution timed out 2051 ms 678612 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 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 3 ms 908 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Correct 2 ms 932 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 852 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 980 KB Output is correct
32 Correct 2 ms 852 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 3 ms 984 KB Output is correct
12 Correct 1 ms 732 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 736 KB Output is correct
15 Correct 1 ms 608 KB Output is correct
16 Correct 2 ms 732 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 540 KB Output is correct
20 Correct 1 ms 608 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 2 ms 864 KB Output is correct
23 Correct 2 ms 992 KB Output is correct
24 Correct 5 ms 1376 KB Output is correct
25 Correct 79 ms 16564 KB Output is correct
26 Correct 121 ms 22148 KB Output is correct
27 Correct 196 ms 31484 KB Output is correct
28 Correct 195 ms 31480 KB Output is correct
29 Correct 164 ms 31484 KB Output is correct
30 Correct 175 ms 31484 KB Output is correct
31 Correct 111 ms 25800 KB Output is correct
32 Correct 255 ms 31460 KB Output is correct
33 Correct 246 ms 31492 KB Output is correct
34 Correct 463 ms 62440 KB Output is correct
35 Correct 587 ms 85152 KB Output is correct
36 Correct 571 ms 85088 KB Output is correct
37 Correct 540 ms 84240 KB Output is correct
38 Correct 524 ms 84228 KB Output is correct
39 Execution timed out 2081 ms 254224 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 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 3 ms 908 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Correct 2 ms 932 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 852 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 980 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 205 ms 31480 KB Output is correct
34 Correct 3 ms 1364 KB Output is correct
35 Correct 3 ms 1364 KB Output is correct
36 Correct 79 ms 16480 KB Output is correct
37 Correct 26 ms 8020 KB Output is correct
38 Correct 117 ms 22124 KB Output is correct
39 Correct 176 ms 31380 KB Output is correct
40 Correct 207 ms 31440 KB Output is correct
41 Correct 189 ms 31480 KB Output is correct
42 Correct 178 ms 31444 KB Output is correct
43 Correct 158 ms 31440 KB Output is correct
44 Correct 169 ms 31488 KB Output is correct
45 Correct 28 ms 9428 KB Output is correct
46 Correct 39 ms 9428 KB Output is correct
47 Correct 56 ms 10468 KB Output is correct
48 Correct 77 ms 19676 KB Output is correct
49 Correct 86 ms 22196 KB Output is correct
50 Correct 131 ms 23916 KB Output is correct
51 Correct 101 ms 25796 KB Output is correct
52 Correct 218 ms 31484 KB Output is correct
53 Correct 234 ms 31484 KB Output is correct
54 Correct 186 ms 31488 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 3 ms 908 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Correct 2 ms 932 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 852 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 980 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 205 ms 31480 KB Output is correct
34 Correct 3 ms 1364 KB Output is correct
35 Correct 3 ms 1364 KB Output is correct
36 Correct 79 ms 16480 KB Output is correct
37 Correct 26 ms 8020 KB Output is correct
38 Correct 117 ms 22124 KB Output is correct
39 Correct 176 ms 31380 KB Output is correct
40 Correct 207 ms 31440 KB Output is correct
41 Correct 189 ms 31480 KB Output is correct
42 Correct 178 ms 31444 KB Output is correct
43 Correct 158 ms 31440 KB Output is correct
44 Correct 169 ms 31488 KB Output is correct
45 Correct 28 ms 9428 KB Output is correct
46 Correct 39 ms 9428 KB Output is correct
47 Correct 56 ms 10468 KB Output is correct
48 Correct 77 ms 19676 KB Output is correct
49 Correct 86 ms 22196 KB Output is correct
50 Correct 131 ms 23916 KB Output is correct
51 Correct 101 ms 25796 KB Output is correct
52 Correct 218 ms 31484 KB Output is correct
53 Correct 234 ms 31484 KB Output is correct
54 Correct 186 ms 31488 KB Output is correct
55 Correct 710 ms 83092 KB Output is correct
56 Correct 62 ms 10768 KB Output is correct
57 Correct 466 ms 62476 KB Output is correct
58 Correct 196 ms 43336 KB Output is correct
59 Correct 587 ms 85088 KB Output is correct
60 Correct 737 ms 83092 KB Output is correct
61 Correct 806 ms 83008 KB Output is correct
62 Correct 591 ms 85060 KB Output is correct
63 Correct 537 ms 84244 KB Output is correct
64 Correct 521 ms 84248 KB Output is correct
65 Correct 82 ms 27264 KB Output is correct
66 Correct 103 ms 27224 KB Output is correct
67 Correct 112 ms 29072 KB Output is correct
68 Correct 234 ms 52556 KB Output is correct
69 Correct 283 ms 57256 KB Output is correct
70 Correct 275 ms 62448 KB Output is correct
71 Correct 315 ms 67404 KB Output is correct
72 Correct 990 ms 83040 KB Output is correct
73 Correct 915 ms 83092 KB Output is correct
74 Correct 706 ms 83092 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 848 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 2 ms 984 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 210 ms 31480 KB Output is correct
20 Correct 27 ms 7992 KB Output is correct
21 Correct 207 ms 31480 KB Output is correct
22 Correct 198 ms 31484 KB Output is correct
23 Correct 208 ms 31456 KB Output is correct
24 Correct 33 ms 9428 KB Output is correct
25 Correct 40 ms 9312 KB Output is correct
26 Correct 258 ms 31480 KB Output is correct
27 Correct 257 ms 31476 KB Output is correct
28 Correct 194 ms 31480 KB Output is correct
29 Correct 795 ms 83092 KB Output is correct
30 Correct 64 ms 10772 KB Output is correct
31 Correct 561 ms 85140 KB Output is correct
32 Correct 769 ms 82980 KB Output is correct
33 Correct 740 ms 83092 KB Output is correct
34 Correct 88 ms 27224 KB Output is correct
35 Correct 113 ms 27268 KB Output is correct
36 Correct 814 ms 82980 KB Output is correct
37 Correct 863 ms 83092 KB Output is correct
38 Correct 692 ms 83096 KB Output is correct
39 Execution timed out 2051 ms 678612 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 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 848 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 2 ms 984 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 210 ms 31480 KB Output is correct
20 Correct 27 ms 7992 KB Output is correct
21 Correct 207 ms 31480 KB Output is correct
22 Correct 198 ms 31484 KB Output is correct
23 Correct 208 ms 31456 KB Output is correct
24 Correct 33 ms 9428 KB Output is correct
25 Correct 40 ms 9312 KB Output is correct
26 Correct 258 ms 31480 KB Output is correct
27 Correct 257 ms 31476 KB Output is correct
28 Correct 194 ms 31480 KB Output is correct
29 Correct 795 ms 83092 KB Output is correct
30 Correct 64 ms 10772 KB Output is correct
31 Correct 561 ms 85140 KB Output is correct
32 Correct 769 ms 82980 KB Output is correct
33 Correct 740 ms 83092 KB Output is correct
34 Correct 88 ms 27224 KB Output is correct
35 Correct 113 ms 27268 KB Output is correct
36 Correct 814 ms 82980 KB Output is correct
37 Correct 863 ms 83092 KB Output is correct
38 Correct 692 ms 83096 KB Output is correct
39 Execution timed out 2051 ms 678612 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 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 848 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 2 ms 984 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 210 ms 31480 KB Output is correct
20 Correct 27 ms 7992 KB Output is correct
21 Correct 207 ms 31480 KB Output is correct
22 Correct 198 ms 31484 KB Output is correct
23 Correct 208 ms 31456 KB Output is correct
24 Correct 33 ms 9428 KB Output is correct
25 Correct 40 ms 9312 KB Output is correct
26 Correct 258 ms 31480 KB Output is correct
27 Correct 257 ms 31476 KB Output is correct
28 Correct 194 ms 31480 KB Output is correct
29 Correct 795 ms 83092 KB Output is correct
30 Correct 64 ms 10772 KB Output is correct
31 Correct 561 ms 85140 KB Output is correct
32 Correct 769 ms 82980 KB Output is correct
33 Correct 740 ms 83092 KB Output is correct
34 Correct 88 ms 27224 KB Output is correct
35 Correct 113 ms 27268 KB Output is correct
36 Correct 814 ms 82980 KB Output is correct
37 Correct 863 ms 83092 KB Output is correct
38 Correct 692 ms 83096 KB Output is correct
39 Execution timed out 2051 ms 678612 KB Time limit exceeded
40 Halted 0 ms 0 KB -