oj.uz

Submission #827971

# Submission time Handle Problem Language Result Execution time Memory
827971 2023-08-17T00:30:24 Z null_awe Maze (JOI23_ho_t3) C++14
59 / 100
 1626 ms 984260 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 = 3000001;

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(2 * n, nullptr) {}

  inline void build() {
    for (int i = 1; i < 2 * n; ++i) has[i] = build_veb(m + 1);
  }

  inline void upd(int x, int y) {
    has[x += n]->erase(y);
    for (; x > 1; x >>= 1)
      if (has[x]->lower_bound(y) != y && has[x ^ 1]->lower_bound(y) != y)
        has[x >> 1]->erase(y);
  }

  inline pii qry(int x1, int y1, int x2, int y2) {
    x1 = max(x1, 0), y1 = max(y1, 0), x2 = min(x2, n - 1), y2 = min(y2, m - 1);
    int l = x1, r = x2 + 1, idx = -1;
    for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
      if (l & 1) {
        if (has[l]->lower_bound(y1) <= y2) {
          idx = l;
          break;
        }
        l++;
      }
      if (r & 1) {
        --r;
        if (has[r]->lower_bound(y1) <= y2) {
          idx = r;
          break;
        }
      }
    }
    if (idx < 0) return {-1, -1};
    while (idx < n) {
      idx <<= 1;
      if (has[idx]->lower_bound(y1) > y2) ++idx;
    }
    return {idx - n, has[idx]->lower_bound(y1)};
  }
};

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();
  // cout << sus.qry(1, 0, 1, 0).first << endl;
  // exit(0);
  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()) {
    // cout << "part 1 " << endl;
    vector<pii> nq;
    for (pii p : q) {
      // cout << p.first << ' ' << p.second << "s" << endl;
      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:

      // cout << p.first << ' ' << p.second << "m" << endl;
        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) {
          // cout << cur.first << ' ' << cur.second << endl;
          int nx = cur.first, ny = cur.second;
          nq.push_back({nx, ny});
          dists[nx][ny] = dists[x][y] + 1;
          sus.upd(nx, ny);
        }
      }
      // cout << p.first << ' ' << p.second << "e" << endl;
    }
    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 15 ms 23764 KB Output is correct
2 Correct 16 ms 23756 KB Output is correct
3 Correct 17 ms 24020 KB Output is correct
4 Correct 16 ms 23892 KB Output is correct
5 Correct 16 ms 23976 KB Output is correct
6 Correct 17 ms 24116 KB Output is correct
7 Correct 15 ms 23880 KB Output is correct
8 Correct 17 ms 24212 KB Output is correct
9 Correct 16 ms 23728 KB Output is correct
10 Correct 17 ms 23716 KB Output is correct
11 Correct 18 ms 23728 KB Output is correct
12 Correct 15 ms 23792 KB Output is correct
13 Correct 15 ms 23744 KB Output is correct
14 Correct 16 ms 23760 KB Output is correct
15 Correct 15 ms 23764 KB Output is correct
16 Correct 16 ms 23936 KB Output is correct
17 Correct 18 ms 23928 KB Output is correct
18 Correct 16 ms 24020 KB Output is correct
19 Correct 54 ms 34824 KB Output is correct
20 Correct 35 ms 50084 KB Output is correct
21 Correct 42 ms 34380 KB Output is correct
22 Correct 48 ms 34932 KB Output is correct
23 Correct 42 ms 34920 KB Output is correct
24 Correct 31 ms 30788 KB Output is correct
25 Correct 40 ms 61584 KB Output is correct
26 Correct 51 ms 34836 KB Output is correct
27 Correct 54 ms 34724 KB Output is correct
28 Correct 40 ms 34644 KB Output is correct
29 Correct 106 ms 53728 KB Output is correct
30 Correct 48 ms 37068 KB Output is correct
31 Correct 102 ms 53168 KB Output is correct
32 Correct 123 ms 53548 KB Output is correct
33 Correct 112 ms 53892 KB Output is correct
34 Correct 49 ms 42424 KB Output is correct
35 Correct 67 ms 118540 KB Output is correct
36 Correct 128 ms 53156 KB Output is correct
37 Correct 126 ms 53168 KB Output is correct
38 Correct 97 ms 53388 KB Output is correct
39 Correct 1372 ms 340340 KB Output is correct
40 Correct 113 ms 64820 KB Output is correct
41 Correct 62 ms 60752 KB Output is correct
42 Correct 177 ms 68616 KB Output is correct
43 Correct 133 ms 90956 KB Output is correct
44 Correct 380 ms 169772 KB Output is correct
45 Correct 378 ms 213116 KB Output is correct
46 Correct 1237 ms 336408 KB Output is correct
47 Correct 1626 ms 339932 KB Output is correct
48 Correct 1325 ms 346224 KB Output is correct
49 Correct 291 ms 223384 KB Output is correct
50 Runtime error 761 ms 984260 KB Execution killed with signal 6
51 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 16 ms 23764 KB Output is correct
3 Correct 16 ms 23708 KB Output is correct
4 Correct 15 ms 23764 KB Output is correct
5 Correct 15 ms 23952 KB Output is correct
6 Correct 15 ms 23764 KB Output is correct
7 Correct 16 ms 23764 KB Output is correct
8 Correct 15 ms 23844 KB Output is correct
9 Correct 17 ms 23972 KB Output is correct
10 Correct 17 ms 23892 KB Output is correct
11 Correct 16 ms 23984 KB Output is correct
12 Correct 16 ms 23968 KB Output is correct
13 Correct 16 ms 24012 KB Output is correct
14 Correct 16 ms 23892 KB Output is correct
15 Correct 17 ms 23820 KB Output is correct
16 Correct 16 ms 24172 KB Output is correct
17 Correct 16 ms 24008 KB Output is correct
18 Correct 15 ms 23772 KB Output is correct
19 Correct 16 ms 23880 KB Output is correct
20 Correct 15 ms 23764 KB Output is correct
21 Correct 16 ms 23804 KB Output is correct
22 Correct 15 ms 23912 KB Output is correct
23 Correct 16 ms 23724 KB Output is correct
24 Correct 15 ms 23764 KB Output is correct
25 Correct 16 ms 23784 KB Output is correct
26 Correct 16 ms 23832 KB Output is correct
27 Correct 16 ms 23820 KB Output is correct
28 Correct 15 ms 24020 KB Output is correct
29 Correct 16 ms 23740 KB Output is correct
30 Correct 17 ms 23908 KB Output is correct
31 Correct 16 ms 23888 KB Output is correct
32 Correct 17 ms 23968 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23724 KB Output is correct
2 Correct 16 ms 23780 KB Output is correct
3 Correct 16 ms 23764 KB Output is correct
4 Correct 15 ms 23700 KB Output is correct
5 Correct 16 ms 23800 KB Output is correct
6 Correct 15 ms 23776 KB Output is correct
7 Correct 16 ms 23988 KB Output is correct
8 Correct 16 ms 23900 KB Output is correct
9 Correct 16 ms 24004 KB Output is correct
10 Correct 16 ms 23904 KB Output is correct
11 Correct 15 ms 23944 KB Output is correct
12 Correct 17 ms 23892 KB Output is correct
13 Correct 16 ms 23764 KB Output is correct
14 Correct 17 ms 23916 KB Output is correct
15 Correct 15 ms 23812 KB Output is correct
16 Correct 16 ms 23844 KB Output is correct
17 Correct 15 ms 23764 KB Output is correct
18 Correct 15 ms 23764 KB Output is correct
19 Correct 16 ms 23764 KB Output is correct
20 Correct 17 ms 23764 KB Output is correct
21 Correct 16 ms 24016 KB Output is correct
22 Correct 16 ms 23964 KB Output is correct
23 Correct 16 ms 23892 KB Output is correct
24 Correct 17 ms 24240 KB Output is correct
25 Correct 34 ms 33200 KB Output is correct
26 Correct 45 ms 34968 KB Output is correct
27 Correct 42 ms 34388 KB Output is correct
28 Correct 42 ms 34316 KB Output is correct
29 Correct 35 ms 34832 KB Output is correct
30 Correct 36 ms 34816 KB Output is correct
31 Correct 37 ms 36584 KB Output is correct
32 Correct 48 ms 34824 KB Output is correct
33 Correct 49 ms 34648 KB Output is correct
34 Correct 106 ms 52112 KB Output is correct
35 Correct 105 ms 53148 KB Output is correct
36 Correct 99 ms 53068 KB Output is correct
37 Correct 70 ms 54308 KB Output is correct
38 Correct 71 ms 54376 KB Output is correct
39 Correct 365 ms 126196 KB Output is correct
40 Correct 1056 ms 305328 KB Output is correct
41 Correct 1163 ms 336416 KB Output is correct
42 Correct 1053 ms 336488 KB Output is correct
43 Correct 678 ms 348424 KB Output is correct
44 Correct 638 ms 348540 KB Output is correct
45 Correct 976 ms 373052 KB Output is correct
46 Correct 921 ms 358248 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 16 ms 23764 KB Output is correct
3 Correct 16 ms 23708 KB Output is correct
4 Correct 15 ms 23764 KB Output is correct
5 Correct 15 ms 23952 KB Output is correct
6 Correct 15 ms 23764 KB Output is correct
7 Correct 16 ms 23764 KB Output is correct
8 Correct 15 ms 23844 KB Output is correct
9 Correct 17 ms 23972 KB Output is correct
10 Correct 17 ms 23892 KB Output is correct
11 Correct 16 ms 23984 KB Output is correct
12 Correct 16 ms 23968 KB Output is correct
13 Correct 16 ms 24012 KB Output is correct
14 Correct 16 ms 23892 KB Output is correct
15 Correct 17 ms 23820 KB Output is correct
16 Correct 16 ms 24172 KB Output is correct
17 Correct 16 ms 24008 KB Output is correct
18 Correct 15 ms 23772 KB Output is correct
19 Correct 16 ms 23880 KB Output is correct
20 Correct 15 ms 23764 KB Output is correct
21 Correct 16 ms 23804 KB Output is correct
22 Correct 15 ms 23912 KB Output is correct
23 Correct 16 ms 23724 KB Output is correct
24 Correct 15 ms 23764 KB Output is correct
25 Correct 16 ms 23784 KB Output is correct
26 Correct 16 ms 23832 KB Output is correct
27 Correct 16 ms 23820 KB Output is correct
28 Correct 15 ms 24020 KB Output is correct
29 Correct 16 ms 23740 KB Output is correct
30 Correct 17 ms 23908 KB Output is correct
31 Correct 16 ms 23888 KB Output is correct
32 Correct 17 ms 23968 KB Output is correct
33 Correct 45 ms 34832 KB Output is correct
34 Correct 16 ms 24208 KB Output is correct
35 Correct 17 ms 25164 KB Output is correct
36 Correct 35 ms 33252 KB Output is correct
37 Correct 34 ms 50052 KB Output is correct
38 Correct 43 ms 34836 KB Output is correct
39 Correct 42 ms 34284 KB Output is correct
40 Correct 50 ms 34916 KB Output is correct
41 Correct 45 ms 34972 KB Output is correct
42 Correct 42 ms 34464 KB Output is correct
43 Correct 35 ms 34832 KB Output is correct
44 Correct 34 ms 34796 KB Output is correct
45 Correct 26 ms 30844 KB Output is correct
46 Correct 40 ms 61516 KB Output is correct
47 Correct 33 ms 37452 KB Output is correct
48 Correct 50 ms 38864 KB Output is correct
49 Correct 48 ms 40300 KB Output is correct
50 Correct 43 ms 36684 KB Output is correct
51 Correct 39 ms 36652 KB Output is correct
52 Correct 49 ms 34764 KB Output is correct
53 Correct 51 ms 34740 KB Output is correct
54 Correct 43 ms 34676 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 16 ms 23764 KB Output is correct
3 Correct 16 ms 23708 KB Output is correct
4 Correct 15 ms 23764 KB Output is correct
5 Correct 15 ms 23952 KB Output is correct
6 Correct 15 ms 23764 KB Output is correct
7 Correct 16 ms 23764 KB Output is correct
8 Correct 15 ms 23844 KB Output is correct
9 Correct 17 ms 23972 KB Output is correct
10 Correct 17 ms 23892 KB Output is correct
11 Correct 16 ms 23984 KB Output is correct
12 Correct 16 ms 23968 KB Output is correct
13 Correct 16 ms 24012 KB Output is correct
14 Correct 16 ms 23892 KB Output is correct
15 Correct 17 ms 23820 KB Output is correct
16 Correct 16 ms 24172 KB Output is correct
17 Correct 16 ms 24008 KB Output is correct
18 Correct 15 ms 23772 KB Output is correct
19 Correct 16 ms 23880 KB Output is correct
20 Correct 15 ms 23764 KB Output is correct
21 Correct 16 ms 23804 KB Output is correct
22 Correct 15 ms 23912 KB Output is correct
23 Correct 16 ms 23724 KB Output is correct
24 Correct 15 ms 23764 KB Output is correct
25 Correct 16 ms 23784 KB Output is correct
26 Correct 16 ms 23832 KB Output is correct
27 Correct 16 ms 23820 KB Output is correct
28 Correct 15 ms 24020 KB Output is correct
29 Correct 16 ms 23740 KB Output is correct
30 Correct 17 ms 23908 KB Output is correct
31 Correct 16 ms 23888 KB Output is correct
32 Correct 17 ms 23968 KB Output is correct
33 Correct 45 ms 34832 KB Output is correct
34 Correct 16 ms 24208 KB Output is correct
35 Correct 17 ms 25164 KB Output is correct
36 Correct 35 ms 33252 KB Output is correct
37 Correct 34 ms 50052 KB Output is correct
38 Correct 43 ms 34836 KB Output is correct
39 Correct 42 ms 34284 KB Output is correct
40 Correct 50 ms 34916 KB Output is correct
41 Correct 45 ms 34972 KB Output is correct
42 Correct 42 ms 34464 KB Output is correct
43 Correct 35 ms 34832 KB Output is correct
44 Correct 34 ms 34796 KB Output is correct
45 Correct 26 ms 30844 KB Output is correct
46 Correct 40 ms 61516 KB Output is correct
47 Correct 33 ms 37452 KB Output is correct
48 Correct 50 ms 38864 KB Output is correct
49 Correct 48 ms 40300 KB Output is correct
50 Correct 43 ms 36684 KB Output is correct
51 Correct 39 ms 36652 KB Output is correct
52 Correct 49 ms 34764 KB Output is correct
53 Correct 51 ms 34740 KB Output is correct
54 Correct 43 ms 34676 KB Output is correct
55 Correct 127 ms 53936 KB Output is correct
56 Correct 38 ms 37052 KB Output is correct
57 Correct 110 ms 52156 KB Output is correct
58 Correct 91 ms 56696 KB Output is correct
59 Correct 130 ms 53072 KB Output is correct
60 Correct 120 ms 53568 KB Output is correct
61 Correct 110 ms 53956 KB Output is correct
62 Correct 96 ms 53088 KB Output is correct
63 Correct 70 ms 54332 KB Output is correct
64 Correct 70 ms 54288 KB Output is correct
65 Correct 43 ms 42316 KB Output is correct
66 Correct 76 ms 118584 KB Output is correct
67 Correct 72 ms 58580 KB Output is correct
68 Correct 95 ms 61940 KB Output is correct
69 Correct 110 ms 60736 KB Output is correct
70 Correct 115 ms 63924 KB Output is correct
71 Correct 88 ms 56044 KB Output is correct
72 Correct 121 ms 53068 KB Output is correct
73 Correct 120 ms 53204 KB Output is correct
74 Correct 96 ms 53340 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 16 ms 23756 KB Output is correct
3 Correct 17 ms 24020 KB Output is correct
4 Correct 16 ms 23892 KB Output is correct
5 Correct 16 ms 23976 KB Output is correct
6 Correct 17 ms 24116 KB Output is correct
7 Correct 15 ms 23880 KB Output is correct
8 Correct 17 ms 24212 KB Output is correct
9 Correct 16 ms 23728 KB Output is correct
10 Correct 17 ms 23716 KB Output is correct
11 Correct 18 ms 23728 KB Output is correct
12 Correct 15 ms 23792 KB Output is correct
13 Correct 15 ms 23744 KB Output is correct
14 Correct 16 ms 23760 KB Output is correct
15 Correct 15 ms 23764 KB Output is correct
16 Correct 16 ms 23936 KB Output is correct
17 Correct 18 ms 23928 KB Output is correct
18 Correct 16 ms 24020 KB Output is correct
19 Correct 54 ms 34824 KB Output is correct
20 Correct 35 ms 50084 KB Output is correct
21 Correct 42 ms 34380 KB Output is correct
22 Correct 48 ms 34932 KB Output is correct
23 Correct 42 ms 34920 KB Output is correct
24 Correct 31 ms 30788 KB Output is correct
25 Correct 40 ms 61584 KB Output is correct
26 Correct 51 ms 34836 KB Output is correct
27 Correct 54 ms 34724 KB Output is correct
28 Correct 40 ms 34644 KB Output is correct
29 Correct 106 ms 53728 KB Output is correct
30 Correct 48 ms 37068 KB Output is correct
31 Correct 102 ms 53168 KB Output is correct
32 Correct 123 ms 53548 KB Output is correct
33 Correct 112 ms 53892 KB Output is correct
34 Correct 49 ms 42424 KB Output is correct
35 Correct 67 ms 118540 KB Output is correct
36 Correct 128 ms 53156 KB Output is correct
37 Correct 126 ms 53168 KB Output is correct
38 Correct 97 ms 53388 KB Output is correct
39 Correct 1372 ms 340340 KB Output is correct
40 Correct 113 ms 64820 KB Output is correct
41 Correct 62 ms 60752 KB Output is correct
42 Correct 177 ms 68616 KB Output is correct
43 Correct 133 ms 90956 KB Output is correct
44 Correct 380 ms 169772 KB Output is correct
45 Correct 378 ms 213116 KB Output is correct
46 Correct 1237 ms 336408 KB Output is correct
47 Correct 1626 ms 339932 KB Output is correct
48 Correct 1325 ms 346224 KB Output is correct
49 Correct 291 ms 223384 KB Output is correct
50 Runtime error 761 ms 984260 KB Execution killed with signal 6
51 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 16 ms 23756 KB Output is correct
3 Correct 17 ms 24020 KB Output is correct
4 Correct 16 ms 23892 KB Output is correct
5 Correct 16 ms 23976 KB Output is correct
6 Correct 17 ms 24116 KB Output is correct
7 Correct 15 ms 23880 KB Output is correct
8 Correct 17 ms 24212 KB Output is correct
9 Correct 16 ms 23728 KB Output is correct
10 Correct 17 ms 23716 KB Output is correct
11 Correct 18 ms 23728 KB Output is correct
12 Correct 15 ms 23792 KB Output is correct
13 Correct 15 ms 23744 KB Output is correct
14 Correct 16 ms 23760 KB Output is correct
15 Correct 15 ms 23764 KB Output is correct
16 Correct 16 ms 23936 KB Output is correct
17 Correct 18 ms 23928 KB Output is correct
18 Correct 16 ms 24020 KB Output is correct
19 Correct 54 ms 34824 KB Output is correct
20 Correct 35 ms 50084 KB Output is correct
21 Correct 42 ms 34380 KB Output is correct
22 Correct 48 ms 34932 KB Output is correct
23 Correct 42 ms 34920 KB Output is correct
24 Correct 31 ms 30788 KB Output is correct
25 Correct 40 ms 61584 KB Output is correct
26 Correct 51 ms 34836 KB Output is correct
27 Correct 54 ms 34724 KB Output is correct
28 Correct 40 ms 34644 KB Output is correct
29 Correct 106 ms 53728 KB Output is correct
30 Correct 48 ms 37068 KB Output is correct
31 Correct 102 ms 53168 KB Output is correct
32 Correct 123 ms 53548 KB Output is correct
33 Correct 112 ms 53892 KB Output is correct
34 Correct 49 ms 42424 KB Output is correct
35 Correct 67 ms 118540 KB Output is correct
36 Correct 128 ms 53156 KB Output is correct
37 Correct 126 ms 53168 KB Output is correct
38 Correct 97 ms 53388 KB Output is correct
39 Correct 1372 ms 340340 KB Output is correct
40 Correct 113 ms 64820 KB Output is correct
41 Correct 62 ms 60752 KB Output is correct
42 Correct 177 ms 68616 KB Output is correct
43 Correct 133 ms 90956 KB Output is correct
44 Correct 380 ms 169772 KB Output is correct
45 Correct 378 ms 213116 KB Output is correct
46 Correct 1237 ms 336408 KB Output is correct
47 Correct 1626 ms 339932 KB Output is correct
48 Correct 1325 ms 346224 KB Output is correct
49 Correct 291 ms 223384 KB Output is correct
50 Runtime error 761 ms 984260 KB Execution killed with signal 6
51 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 16 ms 23756 KB Output is correct
3 Correct 17 ms 24020 KB Output is correct
4 Correct 16 ms 23892 KB Output is correct
5 Correct 16 ms 23976 KB Output is correct
6 Correct 17 ms 24116 KB Output is correct
7 Correct 15 ms 23880 KB Output is correct
8 Correct 17 ms 24212 KB Output is correct
9 Correct 16 ms 23728 KB Output is correct
10 Correct 17 ms 23716 KB Output is correct
11 Correct 18 ms 23728 KB Output is correct
12 Correct 15 ms 23792 KB Output is correct
13 Correct 15 ms 23744 KB Output is correct
14 Correct 16 ms 23760 KB Output is correct
15 Correct 15 ms 23764 KB Output is correct
16 Correct 16 ms 23936 KB Output is correct
17 Correct 18 ms 23928 KB Output is correct
18 Correct 16 ms 24020 KB Output is correct
19 Correct 54 ms 34824 KB Output is correct
20 Correct 35 ms 50084 KB Output is correct
21 Correct 42 ms 34380 KB Output is correct
22 Correct 48 ms 34932 KB Output is correct
23 Correct 42 ms 34920 KB Output is correct
24 Correct 31 ms 30788 KB Output is correct
25 Correct 40 ms 61584 KB Output is correct
26 Correct 51 ms 34836 KB Output is correct
27 Correct 54 ms 34724 KB Output is correct
28 Correct 40 ms 34644 KB Output is correct
29 Correct 106 ms 53728 KB Output is correct
30 Correct 48 ms 37068 KB Output is correct
31 Correct 102 ms 53168 KB Output is correct
32 Correct 123 ms 53548 KB Output is correct
33 Correct 112 ms 53892 KB Output is correct
34 Correct 49 ms 42424 KB Output is correct
35 Correct 67 ms 118540 KB Output is correct
36 Correct 128 ms 53156 KB Output is correct
37 Correct 126 ms 53168 KB Output is correct
38 Correct 97 ms 53388 KB Output is correct
39 Correct 1372 ms 340340 KB Output is correct
40 Correct 113 ms 64820 KB Output is correct
41 Correct 62 ms 60752 KB Output is correct
42 Correct 177 ms 68616 KB Output is correct
43 Correct 133 ms 90956 KB Output is correct
44 Correct 380 ms 169772 KB Output is correct
45 Correct 378 ms 213116 KB Output is correct
46 Correct 1237 ms 336408 KB Output is correct
47 Correct 1626 ms 339932 KB Output is correct
48 Correct 1325 ms 346224 KB Output is correct
49 Correct 291 ms 223384 KB Output is correct
50 Runtime error 761 ms 984260 KB Execution killed with signal 6
51 Halted 0 ms 0 KB -