oj.uz

Submission #827990

# Submission time Handle Problem Language Result Execution time Memory
827990 2023-08-17T00:52:57 Z null_awe Maze (JOI23_ho_t3) C++14
59 / 100
 2000 ms 918744 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[1000 << 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); cout.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 16 ms 23764 KB Output is correct
2 Correct 18 ms 23764 KB Output is correct
3 Correct 18 ms 23900 KB Output is correct
4 Correct 15 ms 23948 KB Output is correct
5 Correct 16 ms 23892 KB Output is correct
6 Correct 16 ms 23940 KB Output is correct
7 Correct 16 ms 23888 KB Output is correct
8 Correct 17 ms 24184 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 16 ms 23768 KB Output is correct
12 Correct 16 ms 23700 KB Output is correct
13 Correct 16 ms 23736 KB Output is correct
14 Correct 16 ms 23852 KB Output is correct
15 Correct 16 ms 23764 KB Output is correct
16 Correct 18 ms 23948 KB Output is correct
17 Correct 16 ms 23996 KB Output is correct
18 Correct 17 ms 24020 KB Output is correct
19 Correct 48 ms 34884 KB Output is correct
20 Correct 33 ms 50092 KB Output is correct
21 Correct 42 ms 34360 KB Output is correct
22 Correct 48 ms 34888 KB Output is correct
23 Correct 43 ms 35012 KB Output is correct
24 Correct 33 ms 30796 KB Output is correct
25 Correct 40 ms 61556 KB Output is correct
26 Correct 50 ms 34732 KB Output is correct
27 Correct 52 ms 34648 KB Output is correct
28 Correct 41 ms 34756 KB Output is correct
29 Correct 102 ms 53692 KB Output is correct
30 Correct 37 ms 37012 KB Output is correct
31 Correct 98 ms 53088 KB Output is correct
32 Correct 133 ms 53484 KB Output is correct
33 Correct 108 ms 54000 KB Output is correct
34 Correct 43 ms 42332 KB Output is correct
35 Correct 69 ms 118452 KB Output is correct
36 Correct 122 ms 53076 KB Output is correct
37 Correct 163 ms 53156 KB Output is correct
38 Correct 97 ms 53296 KB Output is correct
39 Correct 1437 ms 340244 KB Output is correct
40 Correct 115 ms 64724 KB Output is correct
41 Correct 62 ms 60804 KB Output is correct
42 Correct 170 ms 68604 KB Output is correct
43 Correct 126 ms 91044 KB Output is correct
44 Correct 389 ms 169848 KB Output is correct
45 Correct 393 ms 213108 KB Output is correct
46 Correct 1407 ms 336408 KB Output is correct
47 Correct 1749 ms 339956 KB Output is correct
48 Correct 1518 ms 344720 KB Output is correct
49 Correct 342 ms 221856 KB Output is correct
50 Correct 688 ms 918744 KB Output is correct
51 Execution timed out 2079 ms 339200 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23708 KB Output is correct
2 Correct 18 ms 23768 KB Output is correct
3 Correct 17 ms 23680 KB Output is correct
4 Correct 16 ms 23712 KB Output is correct
5 Correct 17 ms 24008 KB Output is correct
6 Correct 16 ms 23764 KB Output is correct
7 Correct 16 ms 23764 KB Output is correct
8 Correct 17 ms 23764 KB Output is correct
9 Correct 16 ms 24004 KB Output is correct
10 Correct 16 ms 23956 KB Output is correct
11 Correct 18 ms 24024 KB Output is correct
12 Correct 17 ms 23892 KB Output is correct
13 Correct 16 ms 23892 KB Output is correct
14 Correct 16 ms 24000 KB Output is correct
15 Correct 19 ms 23892 KB Output is correct
16 Correct 16 ms 24148 KB Output is correct
17 Correct 16 ms 23936 KB Output is correct
18 Correct 16 ms 23696 KB Output is correct
19 Correct 18 ms 23872 KB Output is correct
20 Correct 15 ms 23788 KB Output is correct
21 Correct 16 ms 23764 KB Output is correct
22 Correct 16 ms 23932 KB Output is correct
23 Correct 17 ms 23836 KB Output is correct
24 Correct 17 ms 23708 KB Output is correct
25 Correct 19 ms 23764 KB Output is correct
26 Correct 16 ms 23792 KB Output is correct
27 Correct 17 ms 23740 KB Output is correct
28 Correct 16 ms 23972 KB Output is correct
29 Correct 16 ms 23736 KB Output is correct
30 Correct 17 ms 23896 KB Output is correct
31 Correct 16 ms 23892 KB Output is correct
32 Correct 16 ms 24004 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23728 KB Output is correct
2 Correct 16 ms 23784 KB Output is correct
3 Correct 18 ms 23816 KB Output is correct
4 Correct 15 ms 23728 KB Output is correct
5 Correct 15 ms 23728 KB Output is correct
6 Correct 15 ms 23744 KB Output is correct
7 Correct 16 ms 23892 KB Output is correct
8 Correct 15 ms 23968 KB Output is correct
9 Correct 15 ms 23920 KB Output is correct
10 Correct 15 ms 23892 KB Output is correct
11 Correct 19 ms 23892 KB Output is correct
12 Correct 17 ms 23880 KB Output is correct
13 Correct 16 ms 23788 KB Output is correct
14 Correct 16 ms 23892 KB Output is correct
15 Correct 17 ms 23764 KB Output is correct
16 Correct 16 ms 23892 KB Output is correct
17 Correct 16 ms 23748 KB Output is correct
18 Correct 16 ms 23704 KB Output is correct
19 Correct 18 ms 23708 KB Output is correct
20 Correct 16 ms 23764 KB Output is correct
21 Correct 16 ms 23912 KB Output is correct
22 Correct 16 ms 24020 KB Output is correct
23 Correct 18 ms 23964 KB Output is correct
24 Correct 16 ms 24296 KB Output is correct
25 Correct 36 ms 33280 KB Output is correct
26 Correct 43 ms 34940 KB Output is correct
27 Correct 43 ms 34312 KB Output is correct
28 Correct 42 ms 34380 KB Output is correct
29 Correct 41 ms 34784 KB Output is correct
30 Correct 41 ms 34776 KB Output is correct
31 Correct 39 ms 36564 KB Output is correct
32 Correct 59 ms 34812 KB Output is correct
33 Correct 49 ms 34728 KB Output is correct
34 Correct 112 ms 52360 KB Output is correct
35 Correct 101 ms 53100 KB Output is correct
36 Correct 114 ms 53128 KB Output is correct
37 Correct 71 ms 54320 KB Output is correct
38 Correct 73 ms 54356 KB Output is correct
39 Correct 373 ms 126172 KB Output is correct
40 Correct 1089 ms 305224 KB Output is correct
41 Correct 1267 ms 336372 KB Output is correct
42 Correct 1054 ms 336540 KB Output is correct
43 Correct 659 ms 348416 KB Output is correct
44 Correct 646 ms 348504 KB Output is correct
45 Correct 969 ms 372988 KB Output is correct
46 Correct 920 ms 358456 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23708 KB Output is correct
2 Correct 18 ms 23768 KB Output is correct
3 Correct 17 ms 23680 KB Output is correct
4 Correct 16 ms 23712 KB Output is correct
5 Correct 17 ms 24008 KB Output is correct
6 Correct 16 ms 23764 KB Output is correct
7 Correct 16 ms 23764 KB Output is correct
8 Correct 17 ms 23764 KB Output is correct
9 Correct 16 ms 24004 KB Output is correct
10 Correct 16 ms 23956 KB Output is correct
11 Correct 18 ms 24024 KB Output is correct
12 Correct 17 ms 23892 KB Output is correct
13 Correct 16 ms 23892 KB Output is correct
14 Correct 16 ms 24000 KB Output is correct
15 Correct 19 ms 23892 KB Output is correct
16 Correct 16 ms 24148 KB Output is correct
17 Correct 16 ms 23936 KB Output is correct
18 Correct 16 ms 23696 KB Output is correct
19 Correct 18 ms 23872 KB Output is correct
20 Correct 15 ms 23788 KB Output is correct
21 Correct 16 ms 23764 KB Output is correct
22 Correct 16 ms 23932 KB Output is correct
23 Correct 17 ms 23836 KB Output is correct
24 Correct 17 ms 23708 KB Output is correct
25 Correct 19 ms 23764 KB Output is correct
26 Correct 16 ms 23792 KB Output is correct
27 Correct 17 ms 23740 KB Output is correct
28 Correct 16 ms 23972 KB Output is correct
29 Correct 16 ms 23736 KB Output is correct
30 Correct 17 ms 23896 KB Output is correct
31 Correct 16 ms 23892 KB Output is correct
32 Correct 16 ms 24004 KB Output is correct
33 Correct 47 ms 34848 KB Output is correct
34 Correct 16 ms 24288 KB Output is correct
35 Correct 18 ms 25188 KB Output is correct
36 Correct 35 ms 33248 KB Output is correct
37 Correct 34 ms 50004 KB Output is correct
38 Correct 49 ms 34856 KB Output is correct
39 Correct 44 ms 34296 KB Output is correct
40 Correct 47 ms 34940 KB Output is correct
41 Correct 45 ms 35016 KB Output is correct
42 Correct 45 ms 34392 KB Output is correct
43 Correct 36 ms 34876 KB Output is correct
44 Correct 35 ms 34880 KB Output is correct
45 Correct 26 ms 30876 KB Output is correct
46 Correct 40 ms 61512 KB Output is correct
47 Correct 33 ms 37524 KB Output is correct
48 Correct 48 ms 38644 KB Output is correct
49 Correct 48 ms 40276 KB Output is correct
50 Correct 36 ms 36728 KB Output is correct
51 Correct 37 ms 36656 KB Output is correct
52 Correct 50 ms 34776 KB Output is correct
53 Correct 60 ms 34820 KB Output is correct
54 Correct 41 ms 34708 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23708 KB Output is correct
2 Correct 18 ms 23768 KB Output is correct
3 Correct 17 ms 23680 KB Output is correct
4 Correct 16 ms 23712 KB Output is correct
5 Correct 17 ms 24008 KB Output is correct
6 Correct 16 ms 23764 KB Output is correct
7 Correct 16 ms 23764 KB Output is correct
8 Correct 17 ms 23764 KB Output is correct
9 Correct 16 ms 24004 KB Output is correct
10 Correct 16 ms 23956 KB Output is correct
11 Correct 18 ms 24024 KB Output is correct
12 Correct 17 ms 23892 KB Output is correct
13 Correct 16 ms 23892 KB Output is correct
14 Correct 16 ms 24000 KB Output is correct
15 Correct 19 ms 23892 KB Output is correct
16 Correct 16 ms 24148 KB Output is correct
17 Correct 16 ms 23936 KB Output is correct
18 Correct 16 ms 23696 KB Output is correct
19 Correct 18 ms 23872 KB Output is correct
20 Correct 15 ms 23788 KB Output is correct
21 Correct 16 ms 23764 KB Output is correct
22 Correct 16 ms 23932 KB Output is correct
23 Correct 17 ms 23836 KB Output is correct
24 Correct 17 ms 23708 KB Output is correct
25 Correct 19 ms 23764 KB Output is correct
26 Correct 16 ms 23792 KB Output is correct
27 Correct 17 ms 23740 KB Output is correct
28 Correct 16 ms 23972 KB Output is correct
29 Correct 16 ms 23736 KB Output is correct
30 Correct 17 ms 23896 KB Output is correct
31 Correct 16 ms 23892 KB Output is correct
32 Correct 16 ms 24004 KB Output is correct
33 Correct 47 ms 34848 KB Output is correct
34 Correct 16 ms 24288 KB Output is correct
35 Correct 18 ms 25188 KB Output is correct
36 Correct 35 ms 33248 KB Output is correct
37 Correct 34 ms 50004 KB Output is correct
38 Correct 49 ms 34856 KB Output is correct
39 Correct 44 ms 34296 KB Output is correct
40 Correct 47 ms 34940 KB Output is correct
41 Correct 45 ms 35016 KB Output is correct
42 Correct 45 ms 34392 KB Output is correct
43 Correct 36 ms 34876 KB Output is correct
44 Correct 35 ms 34880 KB Output is correct
45 Correct 26 ms 30876 KB Output is correct
46 Correct 40 ms 61512 KB Output is correct
47 Correct 33 ms 37524 KB Output is correct
48 Correct 48 ms 38644 KB Output is correct
49 Correct 48 ms 40276 KB Output is correct
50 Correct 36 ms 36728 KB Output is correct
51 Correct 37 ms 36656 KB Output is correct
52 Correct 50 ms 34776 KB Output is correct
53 Correct 60 ms 34820 KB Output is correct
54 Correct 41 ms 34708 KB Output is correct
55 Correct 102 ms 53740 KB Output is correct
56 Correct 38 ms 37012 KB Output is correct
57 Correct 105 ms 52144 KB Output is correct
58 Correct 105 ms 56752 KB Output is correct
59 Correct 127 ms 53184 KB Output is correct
60 Correct 118 ms 53536 KB Output is correct
61 Correct 102 ms 53956 KB Output is correct
62 Correct 103 ms 53124 KB Output is correct
63 Correct 71 ms 54312 KB Output is correct
64 Correct 75 ms 54288 KB Output is correct
65 Correct 53 ms 42404 KB Output is correct
66 Correct 75 ms 118452 KB Output is correct
67 Correct 72 ms 58544 KB Output is correct
68 Correct 93 ms 61928 KB Output is correct
69 Correct 99 ms 60800 KB Output is correct
70 Correct 153 ms 63972 KB Output is correct
71 Correct 98 ms 56092 KB Output is correct
72 Correct 115 ms 53156 KB Output is correct
73 Correct 139 ms 53216 KB Output is correct
74 Correct 114 ms 53372 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 18 ms 23764 KB Output is correct
3 Correct 18 ms 23900 KB Output is correct
4 Correct 15 ms 23948 KB Output is correct
5 Correct 16 ms 23892 KB Output is correct
6 Correct 16 ms 23940 KB Output is correct
7 Correct 16 ms 23888 KB Output is correct
8 Correct 17 ms 24184 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 16 ms 23768 KB Output is correct
12 Correct 16 ms 23700 KB Output is correct
13 Correct 16 ms 23736 KB Output is correct
14 Correct 16 ms 23852 KB Output is correct
15 Correct 16 ms 23764 KB Output is correct
16 Correct 18 ms 23948 KB Output is correct
17 Correct 16 ms 23996 KB Output is correct
18 Correct 17 ms 24020 KB Output is correct
19 Correct 48 ms 34884 KB Output is correct
20 Correct 33 ms 50092 KB Output is correct
21 Correct 42 ms 34360 KB Output is correct
22 Correct 48 ms 34888 KB Output is correct
23 Correct 43 ms 35012 KB Output is correct
24 Correct 33 ms 30796 KB Output is correct
25 Correct 40 ms 61556 KB Output is correct
26 Correct 50 ms 34732 KB Output is correct
27 Correct 52 ms 34648 KB Output is correct
28 Correct 41 ms 34756 KB Output is correct
29 Correct 102 ms 53692 KB Output is correct
30 Correct 37 ms 37012 KB Output is correct
31 Correct 98 ms 53088 KB Output is correct
32 Correct 133 ms 53484 KB Output is correct
33 Correct 108 ms 54000 KB Output is correct
34 Correct 43 ms 42332 KB Output is correct
35 Correct 69 ms 118452 KB Output is correct
36 Correct 122 ms 53076 KB Output is correct
37 Correct 163 ms 53156 KB Output is correct
38 Correct 97 ms 53296 KB Output is correct
39 Correct 1437 ms 340244 KB Output is correct
40 Correct 115 ms 64724 KB Output is correct
41 Correct 62 ms 60804 KB Output is correct
42 Correct 170 ms 68604 KB Output is correct
43 Correct 126 ms 91044 KB Output is correct
44 Correct 389 ms 169848 KB Output is correct
45 Correct 393 ms 213108 KB Output is correct
46 Correct 1407 ms 336408 KB Output is correct
47 Correct 1749 ms 339956 KB Output is correct
48 Correct 1518 ms 344720 KB Output is correct
49 Correct 342 ms 221856 KB Output is correct
50 Correct 688 ms 918744 KB Output is correct
51 Execution timed out 2079 ms 339200 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 18 ms 23764 KB Output is correct
3 Correct 18 ms 23900 KB Output is correct
4 Correct 15 ms 23948 KB Output is correct
5 Correct 16 ms 23892 KB Output is correct
6 Correct 16 ms 23940 KB Output is correct
7 Correct 16 ms 23888 KB Output is correct
8 Correct 17 ms 24184 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 16 ms 23768 KB Output is correct
12 Correct 16 ms 23700 KB Output is correct
13 Correct 16 ms 23736 KB Output is correct
14 Correct 16 ms 23852 KB Output is correct
15 Correct 16 ms 23764 KB Output is correct
16 Correct 18 ms 23948 KB Output is correct
17 Correct 16 ms 23996 KB Output is correct
18 Correct 17 ms 24020 KB Output is correct
19 Correct 48 ms 34884 KB Output is correct
20 Correct 33 ms 50092 KB Output is correct
21 Correct 42 ms 34360 KB Output is correct
22 Correct 48 ms 34888 KB Output is correct
23 Correct 43 ms 35012 KB Output is correct
24 Correct 33 ms 30796 KB Output is correct
25 Correct 40 ms 61556 KB Output is correct
26 Correct 50 ms 34732 KB Output is correct
27 Correct 52 ms 34648 KB Output is correct
28 Correct 41 ms 34756 KB Output is correct
29 Correct 102 ms 53692 KB Output is correct
30 Correct 37 ms 37012 KB Output is correct
31 Correct 98 ms 53088 KB Output is correct
32 Correct 133 ms 53484 KB Output is correct
33 Correct 108 ms 54000 KB Output is correct
34 Correct 43 ms 42332 KB Output is correct
35 Correct 69 ms 118452 KB Output is correct
36 Correct 122 ms 53076 KB Output is correct
37 Correct 163 ms 53156 KB Output is correct
38 Correct 97 ms 53296 KB Output is correct
39 Correct 1437 ms 340244 KB Output is correct
40 Correct 115 ms 64724 KB Output is correct
41 Correct 62 ms 60804 KB Output is correct
42 Correct 170 ms 68604 KB Output is correct
43 Correct 126 ms 91044 KB Output is correct
44 Correct 389 ms 169848 KB Output is correct
45 Correct 393 ms 213108 KB Output is correct
46 Correct 1407 ms 336408 KB Output is correct
47 Correct 1749 ms 339956 KB Output is correct
48 Correct 1518 ms 344720 KB Output is correct
49 Correct 342 ms 221856 KB Output is correct
50 Correct 688 ms 918744 KB Output is correct
51 Execution timed out 2079 ms 339200 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 18 ms 23764 KB Output is correct
3 Correct 18 ms 23900 KB Output is correct
4 Correct 15 ms 23948 KB Output is correct
5 Correct 16 ms 23892 KB Output is correct
6 Correct 16 ms 23940 KB Output is correct
7 Correct 16 ms 23888 KB Output is correct
8 Correct 17 ms 24184 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 16 ms 23768 KB Output is correct
12 Correct 16 ms 23700 KB Output is correct
13 Correct 16 ms 23736 KB Output is correct
14 Correct 16 ms 23852 KB Output is correct
15 Correct 16 ms 23764 KB Output is correct
16 Correct 18 ms 23948 KB Output is correct
17 Correct 16 ms 23996 KB Output is correct
18 Correct 17 ms 24020 KB Output is correct
19 Correct 48 ms 34884 KB Output is correct
20 Correct 33 ms 50092 KB Output is correct
21 Correct 42 ms 34360 KB Output is correct
22 Correct 48 ms 34888 KB Output is correct
23 Correct 43 ms 35012 KB Output is correct
24 Correct 33 ms 30796 KB Output is correct
25 Correct 40 ms 61556 KB Output is correct
26 Correct 50 ms 34732 KB Output is correct
27 Correct 52 ms 34648 KB Output is correct
28 Correct 41 ms 34756 KB Output is correct
29 Correct 102 ms 53692 KB Output is correct
30 Correct 37 ms 37012 KB Output is correct
31 Correct 98 ms 53088 KB Output is correct
32 Correct 133 ms 53484 KB Output is correct
33 Correct 108 ms 54000 KB Output is correct
34 Correct 43 ms 42332 KB Output is correct
35 Correct 69 ms 118452 KB Output is correct
36 Correct 122 ms 53076 KB Output is correct
37 Correct 163 ms 53156 KB Output is correct
38 Correct 97 ms 53296 KB Output is correct
39 Correct 1437 ms 340244 KB Output is correct
40 Correct 115 ms 64724 KB Output is correct
41 Correct 62 ms 60804 KB Output is correct
42 Correct 170 ms 68604 KB Output is correct
43 Correct 126 ms 91044 KB Output is correct
44 Correct 389 ms 169848 KB Output is correct
45 Correct 393 ms 213108 KB Output is correct
46 Correct 1407 ms 336408 KB Output is correct
47 Correct 1749 ms 339956 KB Output is correct
48 Correct 1518 ms 344720 KB Output is correct
49 Correct 342 ms 221856 KB Output is correct
50 Correct 688 ms 918744 KB Output is correct
51 Execution timed out 2079 ms 339200 KB Time limit exceeded
52 Halted 0 ms 0 KB -