oj.uz

Submission #825512

# Submission time Handle Problem Language Result Execution time Memory
825512 2023-08-15T00:36:52 Z null_awe Maze (JOI23_ho_t3) C++14
43 / 100
 2000 ms 777760 KB 
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int, int>

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

struct Sustree {

  int n, m;
  vector<multiset<int>> has;

  Sustree() {}

  Sustree(int n, int m) : n(n), m(m), has(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;
    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() {
  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;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 704 KB Output is correct
4 Correct 1 ms 704 KB Output is correct
5 Correct 2 ms 576 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 320 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 572 KB Output is correct
19 Correct 201 ms 31160 KB Output is correct
20 Correct 31 ms 7824 KB Output is correct
21 Correct 176 ms 31140 KB Output is correct
22 Correct 205 ms 31328 KB Output is correct
23 Correct 182 ms 31180 KB Output is correct
24 Correct 27 ms 9160 KB Output is correct
25 Correct 34 ms 9164 KB Output is correct
26 Correct 204 ms 31204 KB Output is correct
27 Correct 215 ms 31308 KB Output is correct
28 Correct 183 ms 31100 KB Output is correct
29 Correct 657 ms 82812 KB Output is correct
30 Correct 48 ms 10452 KB Output is correct
31 Correct 529 ms 84880 KB Output is correct
32 Correct 671 ms 82808 KB Output is correct
33 Correct 663 ms 82808 KB Output is correct
34 Correct 78 ms 26976 KB Output is correct
35 Correct 91 ms 27032 KB Output is correct
36 Correct 757 ms 82816 KB Output is correct
37 Correct 781 ms 82808 KB Output is correct
38 Correct 642 ms 82808 KB Output is correct
39 Execution timed out 2086 ms 777760 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 572 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 580 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 1 ms 448 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 596 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 704 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 448 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 576 KB Output is correct
22 Correct 2 ms 576 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 3 ms 1080 KB Output is correct
25 Correct 73 ms 16200 KB Output is correct
26 Correct 120 ms 21860 KB Output is correct
27 Correct 173 ms 31204 KB Output is correct
28 Correct 167 ms 31208 KB Output is correct
29 Correct 158 ms 31196 KB Output is correct
30 Correct 154 ms 31176 KB Output is correct
31 Correct 95 ms 25524 KB Output is correct
32 Correct 205 ms 31208 KB Output is correct
33 Correct 224 ms 31268 KB Output is correct
34 Correct 448 ms 62172 KB Output is correct
35 Correct 546 ms 84864 KB Output is correct
36 Correct 551 ms 84804 KB Output is correct
37 Correct 491 ms 83988 KB Output is correct
38 Correct 498 ms 83964 KB Output is correct
39 Execution timed out 2076 ms 256280 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 572 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 580 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 1 ms 448 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 199 ms 31208 KB Output is correct
34 Correct 3 ms 1108 KB Output is correct
35 Correct 3 ms 1096 KB Output is correct
36 Correct 78 ms 16268 KB Output is correct
37 Correct 25 ms 7764 KB Output is correct
38 Correct 109 ms 21736 KB Output is correct
39 Correct 170 ms 31144 KB Output is correct
40 Correct 197 ms 31180 KB Output is correct
41 Correct 178 ms 31148 KB Output is correct
42 Correct 167 ms 31164 KB Output is correct
43 Correct 176 ms 31156 KB Output is correct
44 Correct 160 ms 31176 KB Output is correct
45 Correct 29 ms 9140 KB Output is correct
46 Correct 33 ms 9032 KB Output is correct
47 Correct 39 ms 10188 KB Output is correct
48 Correct 75 ms 19324 KB Output is correct
49 Correct 85 ms 21872 KB Output is correct
50 Correct 89 ms 23636 KB Output is correct
51 Correct 96 ms 25420 KB Output is correct
52 Correct 206 ms 31184 KB Output is correct
53 Correct 216 ms 31172 KB Output is correct
54 Correct 180 ms 31180 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 572 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 580 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 1 ms 448 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 199 ms 31208 KB Output is correct
34 Correct 3 ms 1108 KB Output is correct
35 Correct 3 ms 1096 KB Output is correct
36 Correct 78 ms 16268 KB Output is correct
37 Correct 25 ms 7764 KB Output is correct
38 Correct 109 ms 21736 KB Output is correct
39 Correct 170 ms 31144 KB Output is correct
40 Correct 197 ms 31180 KB Output is correct
41 Correct 178 ms 31148 KB Output is correct
42 Correct 167 ms 31164 KB Output is correct
43 Correct 176 ms 31156 KB Output is correct
44 Correct 160 ms 31176 KB Output is correct
45 Correct 29 ms 9140 KB Output is correct
46 Correct 33 ms 9032 KB Output is correct
47 Correct 39 ms 10188 KB Output is correct
48 Correct 75 ms 19324 KB Output is correct
49 Correct 85 ms 21872 KB Output is correct
50 Correct 89 ms 23636 KB Output is correct
51 Correct 96 ms 25420 KB Output is correct
52 Correct 206 ms 31184 KB Output is correct
53 Correct 216 ms 31172 KB Output is correct
54 Correct 180 ms 31180 KB Output is correct
55 Correct 641 ms 82812 KB Output is correct
56 Correct 56 ms 10580 KB Output is correct
57 Correct 442 ms 62152 KB Output is correct
58 Correct 190 ms 42952 KB Output is correct
59 Correct 564 ms 85052 KB Output is correct
60 Correct 694 ms 82812 KB Output is correct
61 Correct 666 ms 82732 KB Output is correct
62 Correct 549 ms 84876 KB Output is correct
63 Correct 499 ms 84068 KB Output is correct
64 Correct 513 ms 83980 KB Output is correct
65 Correct 78 ms 26968 KB Output is correct
66 Correct 89 ms 26900 KB Output is correct
67 Correct 112 ms 28736 KB Output is correct
68 Correct 217 ms 52280 KB Output is correct
69 Correct 234 ms 56976 KB Output is correct
70 Correct 273 ms 62172 KB Output is correct
71 Correct 305 ms 67036 KB Output is correct
72 Correct 757 ms 82820 KB Output is correct
73 Correct 779 ms 82816 KB Output is correct
74 Correct 615 ms 82760 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 704 KB Output is correct
4 Correct 1 ms 704 KB Output is correct
5 Correct 2 ms 576 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 320 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 572 KB Output is correct
19 Correct 201 ms 31160 KB Output is correct
20 Correct 31 ms 7824 KB Output is correct
21 Correct 176 ms 31140 KB Output is correct
22 Correct 205 ms 31328 KB Output is correct
23 Correct 182 ms 31180 KB Output is correct
24 Correct 27 ms 9160 KB Output is correct
25 Correct 34 ms 9164 KB Output is correct
26 Correct 204 ms 31204 KB Output is correct
27 Correct 215 ms 31308 KB Output is correct
28 Correct 183 ms 31100 KB Output is correct
29 Correct 657 ms 82812 KB Output is correct
30 Correct 48 ms 10452 KB Output is correct
31 Correct 529 ms 84880 KB Output is correct
32 Correct 671 ms 82808 KB Output is correct
33 Correct 663 ms 82808 KB Output is correct
34 Correct 78 ms 26976 KB Output is correct
35 Correct 91 ms 27032 KB Output is correct
36 Correct 757 ms 82816 KB Output is correct
37 Correct 781 ms 82808 KB Output is correct
38 Correct 642 ms 82808 KB Output is correct
39 Execution timed out 2086 ms 777760 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 704 KB Output is correct
4 Correct 1 ms 704 KB Output is correct
5 Correct 2 ms 576 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 320 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 572 KB Output is correct
19 Correct 201 ms 31160 KB Output is correct
20 Correct 31 ms 7824 KB Output is correct
21 Correct 176 ms 31140 KB Output is correct
22 Correct 205 ms 31328 KB Output is correct
23 Correct 182 ms 31180 KB Output is correct
24 Correct 27 ms 9160 KB Output is correct
25 Correct 34 ms 9164 KB Output is correct
26 Correct 204 ms 31204 KB Output is correct
27 Correct 215 ms 31308 KB Output is correct
28 Correct 183 ms 31100 KB Output is correct
29 Correct 657 ms 82812 KB Output is correct
30 Correct 48 ms 10452 KB Output is correct
31 Correct 529 ms 84880 KB Output is correct
32 Correct 671 ms 82808 KB Output is correct
33 Correct 663 ms 82808 KB Output is correct
34 Correct 78 ms 26976 KB Output is correct
35 Correct 91 ms 27032 KB Output is correct
36 Correct 757 ms 82816 KB Output is correct
37 Correct 781 ms 82808 KB Output is correct
38 Correct 642 ms 82808 KB Output is correct
39 Execution timed out 2086 ms 777760 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 704 KB Output is correct
4 Correct 1 ms 704 KB Output is correct
5 Correct 2 ms 576 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 320 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 572 KB Output is correct
19 Correct 201 ms 31160 KB Output is correct
20 Correct 31 ms 7824 KB Output is correct
21 Correct 176 ms 31140 KB Output is correct
22 Correct 205 ms 31328 KB Output is correct
23 Correct 182 ms 31180 KB Output is correct
24 Correct 27 ms 9160 KB Output is correct
25 Correct 34 ms 9164 KB Output is correct
26 Correct 204 ms 31204 KB Output is correct
27 Correct 215 ms 31308 KB Output is correct
28 Correct 183 ms 31100 KB Output is correct
29 Correct 657 ms 82812 KB Output is correct
30 Correct 48 ms 10452 KB Output is correct
31 Correct 529 ms 84880 KB Output is correct
32 Correct 671 ms 82808 KB Output is correct
33 Correct 663 ms 82808 KB Output is correct
34 Correct 78 ms 26976 KB Output is correct
35 Correct 91 ms 27032 KB Output is correct
36 Correct 757 ms 82816 KB Output is correct
37 Correct 781 ms 82808 KB Output is correct
38 Correct 642 ms 82808 KB Output is correct
39 Execution timed out 2086 ms 777760 KB Time limit exceeded
40 Halted 0 ms 0 KB -