oj.uz

Submission #827956

# Submission time Handle Problem Language Result Execution time Memory
827956 2023-08-16T23:52:34 Z null_awe Maze (JOI23_ho_t3) C++17
59 / 100
 2000 ms 382504 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
using namespace std;

#define pii pair<int, int>

static char buf[450 << 20];
void* operator new(size_t s) {
	static size_t i = sizeof buf;
	assert(s < i);
	return (void*)&buf[i -= s];
}
void operator delete(void*) {}

const int UNTIL = 4206900;

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

int csqrt[UNTIL], fsqrt[UNTIL];

void init() {
  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 Sustree {

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

  Sustree() {}

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

  void build(int t, int tl, int tr) {
    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);
  }

  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);
    int a = has[2 * t]->lower_bound(py);
    int b = has[2 * t + 1]->lower_bound(py);
    if (a != py && b != py) {
      has[t]->erase(py);
    }
  }

  void upd(int x, int y) {
    upd(1, 0, n - 1, x, y);
  }

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

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];
  if (r > c) {
    vector<string> arr2(c);
    for (int i = 0; i < r; ++i) {
      for (int j = 0; j < c; ++j) {
        arr2[j] += arr[i][j];
      }
    }
    swap(arr, arr2);
    swap(r, c);
    swap(sx, sy);
    swap(gx, gy);
  }
  // . = empty
  // # = wall
  Sustree sus(r, c); sus.build();
  vector<vector<int>> dists(r, vector<int>(c, INT_MAX));
  dists[sx][sy] = 0;
  sus.upd(sx, sy);
  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];
      sus.upd(nx, ny);
    }
  }
  while (q.size()) {
    vector<pii> nq;
    for (pii p : q) {
      int x = p.first, y = p.second;
      if (x > 0 && dists[x - 1][y] <= dists[x][y]) {
        // query down:
        int cur;
        while ((cur = sus.qry(x + n, y - n + 1, x + n, y + n - 1).second) != -1) {
          nq.push_back({x + n, cur});
          dists[x + n][cur] = dists[x][y] + 1;
          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;
          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;
          sus.upd(x + n - 1, y + n);
        }
      } else if (y < r - 1 && dists[x][y + 1] <= dists[x][y]) {
        // query left:
        int cur;
        while ((cur = sus.qry(x - n + 1, y - n, x + n - 1, y - n).first) != -1) {
          nq.push_back({cur, y - n});
          dists[cur][y - n] = dists[x][y] + 1;
          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;
          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;
          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 = sus.qry(cx, cyl, cx, cyr).second) != -1) {
            nq.push_back({cx, cur});
            dists[cx][cur] = dists[x][y] + 1;
            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;
          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];
        sus.upd(nx, ny);
      }
    }
    q = nq;
  }
  cout << dists[gx][gy] << '\n';
  return 0;
}

Compilation message

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

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 33228 KB Output is correct
2 Correct 22 ms 33152 KB Output is correct
3 Correct 24 ms 33356 KB Output is correct
4 Correct 23 ms 33356 KB Output is correct
5 Correct 23 ms 33416 KB Output is correct
6 Correct 23 ms 33428 KB Output is correct
7 Correct 22 ms 33364 KB Output is correct
8 Correct 23 ms 33648 KB Output is correct
9 Correct 22 ms 33124 KB Output is correct
10 Correct 24 ms 33236 KB Output is correct
11 Correct 21 ms 33140 KB Output is correct
12 Correct 21 ms 33136 KB Output is correct
13 Correct 23 ms 33188 KB Output is correct
14 Correct 21 ms 33180 KB Output is correct
15 Correct 22 ms 33236 KB Output is correct
16 Correct 23 ms 33348 KB Output is correct
17 Correct 23 ms 33376 KB Output is correct
18 Correct 23 ms 33364 KB Output is correct
19 Correct 73 ms 44312 KB Output is correct
20 Correct 41 ms 59464 KB Output is correct
21 Correct 61 ms 43812 KB Output is correct
22 Correct 67 ms 44352 KB Output is correct
23 Correct 65 ms 44444 KB Output is correct
24 Correct 33 ms 40248 KB Output is correct
25 Correct 50 ms 70920 KB Output is correct
26 Correct 71 ms 44260 KB Output is correct
27 Correct 70 ms 44108 KB Output is correct
28 Correct 58 ms 44108 KB Output is correct
29 Correct 151 ms 63144 KB Output is correct
30 Correct 44 ms 46484 KB Output is correct
31 Correct 167 ms 62708 KB Output is correct
32 Correct 173 ms 63012 KB Output is correct
33 Correct 154 ms 63420 KB Output is correct
34 Correct 50 ms 51872 KB Output is correct
35 Correct 77 ms 127916 KB Output is correct
36 Correct 171 ms 62532 KB Output is correct
37 Correct 177 ms 62556 KB Output is correct
38 Correct 138 ms 62808 KB Output is correct
39 Execution timed out 2093 ms 349436 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33236 KB Output is correct
2 Correct 22 ms 33172 KB Output is correct
3 Correct 22 ms 33212 KB Output is correct
4 Correct 22 ms 33236 KB Output is correct
5 Correct 23 ms 33432 KB Output is correct
6 Correct 22 ms 33240 KB Output is correct
7 Correct 22 ms 33240 KB Output is correct
8 Correct 22 ms 33208 KB Output is correct
9 Correct 22 ms 33364 KB Output is correct
10 Correct 23 ms 33460 KB Output is correct
11 Correct 22 ms 33364 KB Output is correct
12 Correct 27 ms 33364 KB Output is correct
13 Correct 23 ms 33364 KB Output is correct
14 Correct 22 ms 33364 KB Output is correct
15 Correct 22 ms 33252 KB Output is correct
16 Correct 21 ms 33628 KB Output is correct
17 Correct 23 ms 33492 KB Output is correct
18 Correct 23 ms 33144 KB Output is correct
19 Correct 23 ms 33392 KB Output is correct
20 Correct 24 ms 33236 KB Output is correct
21 Correct 22 ms 33188 KB Output is correct
22 Correct 23 ms 33340 KB Output is correct
23 Correct 22 ms 33228 KB Output is correct
24 Correct 23 ms 33188 KB Output is correct
25 Correct 22 ms 33188 KB Output is correct
26 Correct 22 ms 33240 KB Output is correct
27 Correct 22 ms 33264 KB Output is correct
28 Correct 22 ms 33456 KB Output is correct
29 Correct 24 ms 33172 KB Output is correct
30 Correct 22 ms 33440 KB Output is correct
31 Correct 22 ms 33320 KB Output is correct
32 Correct 21 ms 33400 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 33224 KB Output is correct
2 Correct 22 ms 33160 KB Output is correct
3 Correct 22 ms 33172 KB Output is correct
4 Correct 22 ms 33216 KB Output is correct
5 Correct 21 ms 33236 KB Output is correct
6 Correct 22 ms 33236 KB Output is correct
7 Correct 22 ms 33352 KB Output is correct
8 Correct 22 ms 33344 KB Output is correct
9 Correct 22 ms 33376 KB Output is correct
10 Correct 24 ms 33400 KB Output is correct
11 Correct 22 ms 33364 KB Output is correct
12 Correct 22 ms 33364 KB Output is correct
13 Correct 22 ms 33212 KB Output is correct
14 Correct 22 ms 33364 KB Output is correct
15 Correct 22 ms 33264 KB Output is correct
16 Correct 24 ms 33368 KB Output is correct
17 Correct 23 ms 33260 KB Output is correct
18 Correct 22 ms 33236 KB Output is correct
19 Correct 22 ms 33236 KB Output is correct
20 Correct 22 ms 33228 KB Output is correct
21 Correct 22 ms 33460 KB Output is correct
22 Correct 22 ms 33428 KB Output is correct
23 Correct 23 ms 33428 KB Output is correct
24 Correct 24 ms 33728 KB Output is correct
25 Correct 49 ms 42688 KB Output is correct
26 Correct 59 ms 44368 KB Output is correct
27 Correct 59 ms 43724 KB Output is correct
28 Correct 68 ms 43800 KB Output is correct
29 Correct 45 ms 44292 KB Output is correct
30 Correct 46 ms 44260 KB Output is correct
31 Correct 49 ms 45980 KB Output is correct
32 Correct 70 ms 44204 KB Output is correct
33 Correct 70 ms 44112 KB Output is correct
34 Correct 139 ms 61568 KB Output is correct
35 Correct 142 ms 62540 KB Output is correct
36 Correct 128 ms 62548 KB Output is correct
37 Correct 88 ms 63820 KB Output is correct
38 Correct 93 ms 63828 KB Output is correct
39 Correct 503 ms 135616 KB Output is correct
40 Correct 1296 ms 314844 KB Output is correct
41 Correct 1806 ms 345800 KB Output is correct
42 Correct 1437 ms 345784 KB Output is correct
43 Correct 855 ms 357968 KB Output is correct
44 Correct 850 ms 357928 KB Output is correct
45 Correct 1137 ms 382504 KB Output is correct
46 Correct 1111 ms 367764 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33236 KB Output is correct
2 Correct 22 ms 33172 KB Output is correct
3 Correct 22 ms 33212 KB Output is correct
4 Correct 22 ms 33236 KB Output is correct
5 Correct 23 ms 33432 KB Output is correct
6 Correct 22 ms 33240 KB Output is correct
7 Correct 22 ms 33240 KB Output is correct
8 Correct 22 ms 33208 KB Output is correct
9 Correct 22 ms 33364 KB Output is correct
10 Correct 23 ms 33460 KB Output is correct
11 Correct 22 ms 33364 KB Output is correct
12 Correct 27 ms 33364 KB Output is correct
13 Correct 23 ms 33364 KB Output is correct
14 Correct 22 ms 33364 KB Output is correct
15 Correct 22 ms 33252 KB Output is correct
16 Correct 21 ms 33628 KB Output is correct
17 Correct 23 ms 33492 KB Output is correct
18 Correct 23 ms 33144 KB Output is correct
19 Correct 23 ms 33392 KB Output is correct
20 Correct 24 ms 33236 KB Output is correct
21 Correct 22 ms 33188 KB Output is correct
22 Correct 23 ms 33340 KB Output is correct
23 Correct 22 ms 33228 KB Output is correct
24 Correct 23 ms 33188 KB Output is correct
25 Correct 22 ms 33188 KB Output is correct
26 Correct 22 ms 33240 KB Output is correct
27 Correct 22 ms 33264 KB Output is correct
28 Correct 22 ms 33456 KB Output is correct
29 Correct 24 ms 33172 KB Output is correct
30 Correct 22 ms 33440 KB Output is correct
31 Correct 22 ms 33320 KB Output is correct
32 Correct 21 ms 33400 KB Output is correct
33 Correct 69 ms 44328 KB Output is correct
34 Correct 23 ms 33760 KB Output is correct
35 Correct 25 ms 34596 KB Output is correct
36 Correct 49 ms 42684 KB Output is correct
37 Correct 41 ms 59432 KB Output is correct
38 Correct 62 ms 44432 KB Output is correct
39 Correct 60 ms 43800 KB Output is correct
40 Correct 73 ms 44308 KB Output is correct
41 Correct 66 ms 44396 KB Output is correct
42 Correct 57 ms 43820 KB Output is correct
43 Correct 45 ms 44236 KB Output is correct
44 Correct 45 ms 44272 KB Output is correct
45 Correct 33 ms 40244 KB Output is correct
46 Correct 48 ms 71188 KB Output is correct
47 Correct 42 ms 46912 KB Output is correct
48 Correct 56 ms 48076 KB Output is correct
49 Correct 62 ms 49748 KB Output is correct
50 Correct 45 ms 46188 KB Output is correct
51 Correct 45 ms 46028 KB Output is correct
52 Correct 72 ms 44184 KB Output is correct
53 Correct 70 ms 44096 KB Output is correct
54 Correct 59 ms 44140 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33236 KB Output is correct
2 Correct 22 ms 33172 KB Output is correct
3 Correct 22 ms 33212 KB Output is correct
4 Correct 22 ms 33236 KB Output is correct
5 Correct 23 ms 33432 KB Output is correct
6 Correct 22 ms 33240 KB Output is correct
7 Correct 22 ms 33240 KB Output is correct
8 Correct 22 ms 33208 KB Output is correct
9 Correct 22 ms 33364 KB Output is correct
10 Correct 23 ms 33460 KB Output is correct
11 Correct 22 ms 33364 KB Output is correct
12 Correct 27 ms 33364 KB Output is correct
13 Correct 23 ms 33364 KB Output is correct
14 Correct 22 ms 33364 KB Output is correct
15 Correct 22 ms 33252 KB Output is correct
16 Correct 21 ms 33628 KB Output is correct
17 Correct 23 ms 33492 KB Output is correct
18 Correct 23 ms 33144 KB Output is correct
19 Correct 23 ms 33392 KB Output is correct
20 Correct 24 ms 33236 KB Output is correct
21 Correct 22 ms 33188 KB Output is correct
22 Correct 23 ms 33340 KB Output is correct
23 Correct 22 ms 33228 KB Output is correct
24 Correct 23 ms 33188 KB Output is correct
25 Correct 22 ms 33188 KB Output is correct
26 Correct 22 ms 33240 KB Output is correct
27 Correct 22 ms 33264 KB Output is correct
28 Correct 22 ms 33456 KB Output is correct
29 Correct 24 ms 33172 KB Output is correct
30 Correct 22 ms 33440 KB Output is correct
31 Correct 22 ms 33320 KB Output is correct
32 Correct 21 ms 33400 KB Output is correct
33 Correct 69 ms 44328 KB Output is correct
34 Correct 23 ms 33760 KB Output is correct
35 Correct 25 ms 34596 KB Output is correct
36 Correct 49 ms 42684 KB Output is correct
37 Correct 41 ms 59432 KB Output is correct
38 Correct 62 ms 44432 KB Output is correct
39 Correct 60 ms 43800 KB Output is correct
40 Correct 73 ms 44308 KB Output is correct
41 Correct 66 ms 44396 KB Output is correct
42 Correct 57 ms 43820 KB Output is correct
43 Correct 45 ms 44236 KB Output is correct
44 Correct 45 ms 44272 KB Output is correct
45 Correct 33 ms 40244 KB Output is correct
46 Correct 48 ms 71188 KB Output is correct
47 Correct 42 ms 46912 KB Output is correct
48 Correct 56 ms 48076 KB Output is correct
49 Correct 62 ms 49748 KB Output is correct
50 Correct 45 ms 46188 KB Output is correct
51 Correct 45 ms 46028 KB Output is correct
52 Correct 72 ms 44184 KB Output is correct
53 Correct 70 ms 44096 KB Output is correct
54 Correct 59 ms 44140 KB Output is correct
55 Correct 151 ms 63168 KB Output is correct
56 Correct 45 ms 46448 KB Output is correct
57 Correct 137 ms 61580 KB Output is correct
58 Correct 110 ms 66212 KB Output is correct
59 Correct 140 ms 62540 KB Output is correct
60 Correct 171 ms 63052 KB Output is correct
61 Correct 158 ms 63436 KB Output is correct
62 Correct 140 ms 62532 KB Output is correct
63 Correct 90 ms 63820 KB Output is correct
64 Correct 89 ms 63728 KB Output is correct
65 Correct 49 ms 51852 KB Output is correct
66 Correct 78 ms 127908 KB Output is correct
67 Correct 78 ms 68044 KB Output is correct
68 Correct 104 ms 71364 KB Output is correct
69 Correct 105 ms 70200 KB Output is correct
70 Correct 137 ms 73392 KB Output is correct
71 Correct 106 ms 65532 KB Output is correct
72 Correct 168 ms 62636 KB Output is correct
73 Correct 172 ms 62592 KB Output is correct
74 Correct 137 ms 62764 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 33228 KB Output is correct
2 Correct 22 ms 33152 KB Output is correct
3 Correct 24 ms 33356 KB Output is correct
4 Correct 23 ms 33356 KB Output is correct
5 Correct 23 ms 33416 KB Output is correct
6 Correct 23 ms 33428 KB Output is correct
7 Correct 22 ms 33364 KB Output is correct
8 Correct 23 ms 33648 KB Output is correct
9 Correct 22 ms 33124 KB Output is correct
10 Correct 24 ms 33236 KB Output is correct
11 Correct 21 ms 33140 KB Output is correct
12 Correct 21 ms 33136 KB Output is correct
13 Correct 23 ms 33188 KB Output is correct
14 Correct 21 ms 33180 KB Output is correct
15 Correct 22 ms 33236 KB Output is correct
16 Correct 23 ms 33348 KB Output is correct
17 Correct 23 ms 33376 KB Output is correct
18 Correct 23 ms 33364 KB Output is correct
19 Correct 73 ms 44312 KB Output is correct
20 Correct 41 ms 59464 KB Output is correct
21 Correct 61 ms 43812 KB Output is correct
22 Correct 67 ms 44352 KB Output is correct
23 Correct 65 ms 44444 KB Output is correct
24 Correct 33 ms 40248 KB Output is correct
25 Correct 50 ms 70920 KB Output is correct
26 Correct 71 ms 44260 KB Output is correct
27 Correct 70 ms 44108 KB Output is correct
28 Correct 58 ms 44108 KB Output is correct
29 Correct 151 ms 63144 KB Output is correct
30 Correct 44 ms 46484 KB Output is correct
31 Correct 167 ms 62708 KB Output is correct
32 Correct 173 ms 63012 KB Output is correct
33 Correct 154 ms 63420 KB Output is correct
34 Correct 50 ms 51872 KB Output is correct
35 Correct 77 ms 127916 KB Output is correct
36 Correct 171 ms 62532 KB Output is correct
37 Correct 177 ms 62556 KB Output is correct
38 Correct 138 ms 62808 KB Output is correct
39 Execution timed out 2093 ms 349436 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 33228 KB Output is correct
2 Correct 22 ms 33152 KB Output is correct
3 Correct 24 ms 33356 KB Output is correct
4 Correct 23 ms 33356 KB Output is correct
5 Correct 23 ms 33416 KB Output is correct
6 Correct 23 ms 33428 KB Output is correct
7 Correct 22 ms 33364 KB Output is correct
8 Correct 23 ms 33648 KB Output is correct
9 Correct 22 ms 33124 KB Output is correct
10 Correct 24 ms 33236 KB Output is correct
11 Correct 21 ms 33140 KB Output is correct
12 Correct 21 ms 33136 KB Output is correct
13 Correct 23 ms 33188 KB Output is correct
14 Correct 21 ms 33180 KB Output is correct
15 Correct 22 ms 33236 KB Output is correct
16 Correct 23 ms 33348 KB Output is correct
17 Correct 23 ms 33376 KB Output is correct
18 Correct 23 ms 33364 KB Output is correct
19 Correct 73 ms 44312 KB Output is correct
20 Correct 41 ms 59464 KB Output is correct
21 Correct 61 ms 43812 KB Output is correct
22 Correct 67 ms 44352 KB Output is correct
23 Correct 65 ms 44444 KB Output is correct
24 Correct 33 ms 40248 KB Output is correct
25 Correct 50 ms 70920 KB Output is correct
26 Correct 71 ms 44260 KB Output is correct
27 Correct 70 ms 44108 KB Output is correct
28 Correct 58 ms 44108 KB Output is correct
29 Correct 151 ms 63144 KB Output is correct
30 Correct 44 ms 46484 KB Output is correct
31 Correct 167 ms 62708 KB Output is correct
32 Correct 173 ms 63012 KB Output is correct
33 Correct 154 ms 63420 KB Output is correct
34 Correct 50 ms 51872 KB Output is correct
35 Correct 77 ms 127916 KB Output is correct
36 Correct 171 ms 62532 KB Output is correct
37 Correct 177 ms 62556 KB Output is correct
38 Correct 138 ms 62808 KB Output is correct
39 Execution timed out 2093 ms 349436 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 33228 KB Output is correct
2 Correct 22 ms 33152 KB Output is correct
3 Correct 24 ms 33356 KB Output is correct
4 Correct 23 ms 33356 KB Output is correct
5 Correct 23 ms 33416 KB Output is correct
6 Correct 23 ms 33428 KB Output is correct
7 Correct 22 ms 33364 KB Output is correct
8 Correct 23 ms 33648 KB Output is correct
9 Correct 22 ms 33124 KB Output is correct
10 Correct 24 ms 33236 KB Output is correct
11 Correct 21 ms 33140 KB Output is correct
12 Correct 21 ms 33136 KB Output is correct
13 Correct 23 ms 33188 KB Output is correct
14 Correct 21 ms 33180 KB Output is correct
15 Correct 22 ms 33236 KB Output is correct
16 Correct 23 ms 33348 KB Output is correct
17 Correct 23 ms 33376 KB Output is correct
18 Correct 23 ms 33364 KB Output is correct
19 Correct 73 ms 44312 KB Output is correct
20 Correct 41 ms 59464 KB Output is correct
21 Correct 61 ms 43812 KB Output is correct
22 Correct 67 ms 44352 KB Output is correct
23 Correct 65 ms 44444 KB Output is correct
24 Correct 33 ms 40248 KB Output is correct
25 Correct 50 ms 70920 KB Output is correct
26 Correct 71 ms 44260 KB Output is correct
27 Correct 70 ms 44108 KB Output is correct
28 Correct 58 ms 44108 KB Output is correct
29 Correct 151 ms 63144 KB Output is correct
30 Correct 44 ms 46484 KB Output is correct
31 Correct 167 ms 62708 KB Output is correct
32 Correct 173 ms 63012 KB Output is correct
33 Correct 154 ms 63420 KB Output is correct
34 Correct 50 ms 51872 KB Output is correct
35 Correct 77 ms 127916 KB Output is correct
36 Correct 171 ms 62532 KB Output is correct
37 Correct 177 ms 62556 KB Output is correct
38 Correct 138 ms 62808 KB Output is correct
39 Execution timed out 2093 ms 349436 KB Time limit exceeded
40 Halted 0 ms 0 KB -