oj.uz

Submission #825502

# Submission time Handle Problem Language Result Execution time Memory
825502 2023-08-15T00:00:34 Z null_awe Maze (JOI23_ho_t3) C++14
51 / 100
 2000 ms 133896 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 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
  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);
  // 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);
    }
  }
  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);
        }
        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);
        }
        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);
        }
      } 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);
        }
        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);
        }
        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);
        }
      } else {
        // query all:
        for (int i = -n; i <= n; ++i) {
          int cx = x + i, cyl = y - n, cyr = y + n;
          if (abs(i) == n) ++cyl, --cyr;
          int 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);
          }
        }
      }
    }
    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);
      }
    }
    q = nq;
  }
  cout << dists[gx][gy] << '\n';
  return 0;
}

Subtask #1
8.0 / 8.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 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 240 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 18 ms 764 KB Output is correct
20 Correct 22 ms 4480 KB Output is correct
21 Correct 12 ms 1368 KB Output is correct
22 Correct 17 ms 812 KB Output is correct
23 Correct 12 ms 724 KB Output is correct
24 Correct 20 ms 5504 KB Output is correct
25 Correct 35 ms 5504 KB Output is correct
26 Correct 16 ms 1064 KB Output is correct
27 Correct 16 ms 872 KB Output is correct
28 Correct 14 ms 724 KB Output is correct
29 Correct 50 ms 1316 KB Output is correct
30 Correct 25 ms 3192 KB Output is correct
31 Correct 30 ms 3384 KB Output is correct
32 Correct 44 ms 1428 KB Output is correct
33 Correct 43 ms 1336 KB Output is correct
34 Correct 52 ms 16892 KB Output is correct
35 Correct 78 ms 16892 KB Output is correct
36 Correct 42 ms 1808 KB Output is correct
37 Correct 43 ms 1500 KB Output is correct
38 Correct 38 ms 1348 KB Output is correct
39 Correct 469 ms 9632 KB Output is correct
40 Correct 52 ms 2156 KB Output is correct
41 Correct 74 ms 16972 KB Output is correct
42 Correct 94 ms 1720 KB Output is correct
43 Correct 109 ms 11508 KB Output is correct
44 Correct 264 ms 14508 KB Output is correct
45 Correct 340 ms 17932 KB Output is correct
46 Correct 381 ms 25956 KB Output is correct
47 Correct 521 ms 9816 KB Output is correct
48 Correct 473 ms 9528 KB Output is correct
49 Correct 599 ms 133896 KB Output is correct
50 Correct 841 ms 133752 KB Output is correct
51 Correct 535 ms 11480 KB Output is correct
52 Correct 523 ms 10396 KB Output is correct
53 Correct 491 ms 9660 KB Output is correct

Subtask #2
19.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 16.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 0 ms 212 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 380 KB Output is correct
25 Correct 12 ms 596 KB Output is correct
26 Correct 23 ms 1348 KB Output is correct
27 Correct 12 ms 1312 KB Output is correct
28 Correct 11 ms 1368 KB Output is correct
29 Correct 10 ms 2132 KB Output is correct
30 Correct 9 ms 2128 KB Output is correct
31 Correct 16 ms 940 KB Output is correct
32 Correct 17 ms 1040 KB Output is correct
33 Correct 19 ms 872 KB Output is correct
34 Correct 138 ms 2288 KB Output is correct
35 Correct 30 ms 3472 KB Output is correct
36 Correct 23 ms 3400 KB Output is correct
37 Correct 24 ms 4784 KB Output is correct
38 Correct 24 ms 4768 KB Output is correct
39 Correct 258 ms 7472 KB Output is correct
40 Execution timed out 2077 ms 22412 KB Time limit exceeded
41 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 18 ms 724 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 12 ms 648 KB Output is correct
37 Correct 28 ms 4480 KB Output is correct
38 Correct 23 ms 1368 KB Output is correct
39 Correct 13 ms 1368 KB Output is correct
40 Correct 17 ms 820 KB Output is correct
41 Correct 13 ms 760 KB Output is correct
42 Correct 10 ms 1368 KB Output is correct
43 Correct 11 ms 2108 KB Output is correct
44 Correct 9 ms 2092 KB Output is correct
45 Correct 24 ms 5544 KB Output is correct
46 Correct 29 ms 5504 KB Output is correct
47 Correct 24 ms 3072 KB Output is correct
48 Correct 17 ms 980 KB Output is correct
49 Correct 16 ms 852 KB Output is correct
50 Correct 17 ms 852 KB Output is correct
51 Correct 16 ms 940 KB Output is correct
52 Correct 16 ms 1040 KB Output is correct
53 Correct 19 ms 868 KB Output is correct
54 Correct 13 ms 772 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 18 ms 724 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 12 ms 648 KB Output is correct
37 Correct 28 ms 4480 KB Output is correct
38 Correct 23 ms 1368 KB Output is correct
39 Correct 13 ms 1368 KB Output is correct
40 Correct 17 ms 820 KB Output is correct
41 Correct 13 ms 760 KB Output is correct
42 Correct 10 ms 1368 KB Output is correct
43 Correct 11 ms 2108 KB Output is correct
44 Correct 9 ms 2092 KB Output is correct
45 Correct 24 ms 5544 KB Output is correct
46 Correct 29 ms 5504 KB Output is correct
47 Correct 24 ms 3072 KB Output is correct
48 Correct 17 ms 980 KB Output is correct
49 Correct 16 ms 852 KB Output is correct
50 Correct 17 ms 852 KB Output is correct
51 Correct 16 ms 940 KB Output is correct
52 Correct 16 ms 1040 KB Output is correct
53 Correct 19 ms 868 KB Output is correct
54 Correct 13 ms 772 KB Output is correct
55 Correct 49 ms 1236 KB Output is correct
56 Correct 27 ms 3192 KB Output is correct
57 Correct 139 ms 2292 KB Output is correct
58 Correct 42 ms 1924 KB Output is correct
59 Correct 30 ms 3476 KB Output is correct
60 Correct 43 ms 1440 KB Output is correct
61 Correct 43 ms 1236 KB Output is correct
62 Correct 23 ms 3432 KB Output is correct
63 Correct 24 ms 4804 KB Output is correct
64 Correct 24 ms 4900 KB Output is correct
65 Correct 54 ms 16912 KB Output is correct
66 Correct 79 ms 16880 KB Output is correct
67 Correct 63 ms 8692 KB Output is correct
68 Correct 45 ms 1672 KB Output is correct
69 Correct 44 ms 1548 KB Output is correct
70 Correct 39 ms 1620 KB Output is correct
71 Correct 51 ms 1756 KB Output is correct
72 Correct 50 ms 1720 KB Output is correct
73 Correct 43 ms 1492 KB Output is correct
74 Correct 38 ms 1332 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 240 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 18 ms 764 KB Output is correct
20 Correct 22 ms 4480 KB Output is correct
21 Correct 12 ms 1368 KB Output is correct
22 Correct 17 ms 812 KB Output is correct
23 Correct 12 ms 724 KB Output is correct
24 Correct 20 ms 5504 KB Output is correct
25 Correct 35 ms 5504 KB Output is correct
26 Correct 16 ms 1064 KB Output is correct
27 Correct 16 ms 872 KB Output is correct
28 Correct 14 ms 724 KB Output is correct
29 Correct 50 ms 1316 KB Output is correct
30 Correct 25 ms 3192 KB Output is correct
31 Correct 30 ms 3384 KB Output is correct
32 Correct 44 ms 1428 KB Output is correct
33 Correct 43 ms 1336 KB Output is correct
34 Correct 52 ms 16892 KB Output is correct
35 Correct 78 ms 16892 KB Output is correct
36 Correct 42 ms 1808 KB Output is correct
37 Correct 43 ms 1500 KB Output is correct
38 Correct 38 ms 1348 KB Output is correct
39 Correct 469 ms 9632 KB Output is correct
40 Correct 52 ms 2156 KB Output is correct
41 Correct 74 ms 16972 KB Output is correct
42 Correct 94 ms 1720 KB Output is correct
43 Correct 109 ms 11508 KB Output is correct
44 Correct 264 ms 14508 KB Output is correct
45 Correct 340 ms 17932 KB Output is correct
46 Correct 381 ms 25956 KB Output is correct
47 Correct 521 ms 9816 KB Output is correct
48 Correct 473 ms 9528 KB Output is correct
49 Correct 599 ms 133896 KB Output is correct
50 Correct 841 ms 133752 KB Output is correct
51 Correct 535 ms 11480 KB Output is correct
52 Correct 523 ms 10396 KB Output is correct
53 Correct 491 ms 9660 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 340 KB Output is correct
80 Correct 0 ms 212 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 0 ms 212 KB Output is correct
88 Correct 0 ms 212 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 0 ms 340 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 0 ms 212 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 0 ms 212 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 0 ms 340 KB Output is correct
106 Correct 0 ms 212 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 1 ms 380 KB Output is correct
110 Correct 12 ms 596 KB Output is correct
111 Correct 23 ms 1348 KB Output is correct
112 Correct 12 ms 1312 KB Output is correct
113 Correct 11 ms 1368 KB Output is correct
114 Correct 10 ms 2132 KB Output is correct
115 Correct 9 ms 2128 KB Output is correct
116 Correct 16 ms 940 KB Output is correct
117 Correct 17 ms 1040 KB Output is correct
118 Correct 19 ms 872 KB Output is correct
119 Correct 138 ms 2288 KB Output is correct
120 Correct 30 ms 3472 KB Output is correct
121 Correct 23 ms 3400 KB Output is correct
122 Correct 24 ms 4784 KB Output is correct
123 Correct 24 ms 4768 KB Output is correct
124 Correct 258 ms 7472 KB Output is correct
125 Execution timed out 2077 ms 22412 KB Time limit exceeded
126 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 240 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 18 ms 764 KB Output is correct
20 Correct 22 ms 4480 KB Output is correct
21 Correct 12 ms 1368 KB Output is correct
22 Correct 17 ms 812 KB Output is correct
23 Correct 12 ms 724 KB Output is correct
24 Correct 20 ms 5504 KB Output is correct
25 Correct 35 ms 5504 KB Output is correct
26 Correct 16 ms 1064 KB Output is correct
27 Correct 16 ms 872 KB Output is correct
28 Correct 14 ms 724 KB Output is correct
29 Correct 50 ms 1316 KB Output is correct
30 Correct 25 ms 3192 KB Output is correct
31 Correct 30 ms 3384 KB Output is correct
32 Correct 44 ms 1428 KB Output is correct
33 Correct 43 ms 1336 KB Output is correct
34 Correct 52 ms 16892 KB Output is correct
35 Correct 78 ms 16892 KB Output is correct
36 Correct 42 ms 1808 KB Output is correct
37 Correct 43 ms 1500 KB Output is correct
38 Correct 38 ms 1348 KB Output is correct
39 Correct 469 ms 9632 KB Output is correct
40 Correct 52 ms 2156 KB Output is correct
41 Correct 74 ms 16972 KB Output is correct
42 Correct 94 ms 1720 KB Output is correct
43 Correct 109 ms 11508 KB Output is correct
44 Correct 264 ms 14508 KB Output is correct
45 Correct 340 ms 17932 KB Output is correct
46 Correct 381 ms 25956 KB Output is correct
47 Correct 521 ms 9816 KB Output is correct
48 Correct 473 ms 9528 KB Output is correct
49 Correct 599 ms 133896 KB Output is correct
50 Correct 841 ms 133752 KB Output is correct
51 Correct 535 ms 11480 KB Output is correct
52 Correct 523 ms 10396 KB Output is correct
53 Correct 491 ms 9660 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 340 KB Output is correct
80 Correct 0 ms 212 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 0 ms 212 KB Output is correct
88 Correct 0 ms 212 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 0 ms 340 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 0 ms 212 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 0 ms 212 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 0 ms 340 KB Output is correct
106 Correct 0 ms 212 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 1 ms 380 KB Output is correct
110 Correct 12 ms 596 KB Output is correct
111 Correct 23 ms 1348 KB Output is correct
112 Correct 12 ms 1312 KB Output is correct
113 Correct 11 ms 1368 KB Output is correct
114 Correct 10 ms 2132 KB Output is correct
115 Correct 9 ms 2128 KB Output is correct
116 Correct 16 ms 940 KB Output is correct
117 Correct 17 ms 1040 KB Output is correct
118 Correct 19 ms 872 KB Output is correct
119 Correct 138 ms 2288 KB Output is correct
120 Correct 30 ms 3472 KB Output is correct
121 Correct 23 ms 3400 KB Output is correct
122 Correct 24 ms 4784 KB Output is correct
123 Correct 24 ms 4768 KB Output is correct
124 Correct 258 ms 7472 KB Output is correct
125 Execution timed out 2077 ms 22412 KB Time limit exceeded
126 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 240 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 18 ms 764 KB Output is correct
20 Correct 22 ms 4480 KB Output is correct
21 Correct 12 ms 1368 KB Output is correct
22 Correct 17 ms 812 KB Output is correct
23 Correct 12 ms 724 KB Output is correct
24 Correct 20 ms 5504 KB Output is correct
25 Correct 35 ms 5504 KB Output is correct
26 Correct 16 ms 1064 KB Output is correct
27 Correct 16 ms 872 KB Output is correct
28 Correct 14 ms 724 KB Output is correct
29 Correct 50 ms 1316 KB Output is correct
30 Correct 25 ms 3192 KB Output is correct
31 Correct 30 ms 3384 KB Output is correct
32 Correct 44 ms 1428 KB Output is correct
33 Correct 43 ms 1336 KB Output is correct
34 Correct 52 ms 16892 KB Output is correct
35 Correct 78 ms 16892 KB Output is correct
36 Correct 42 ms 1808 KB Output is correct
37 Correct 43 ms 1500 KB Output is correct
38 Correct 38 ms 1348 KB Output is correct
39 Correct 469 ms 9632 KB Output is correct
40 Correct 52 ms 2156 KB Output is correct
41 Correct 74 ms 16972 KB Output is correct
42 Correct 94 ms 1720 KB Output is correct
43 Correct 109 ms 11508 KB Output is correct
44 Correct 264 ms 14508 KB Output is correct
45 Correct 340 ms 17932 KB Output is correct
46 Correct 381 ms 25956 KB Output is correct
47 Correct 521 ms 9816 KB Output is correct
48 Correct 473 ms 9528 KB Output is correct
49 Correct 599 ms 133896 KB Output is correct
50 Correct 841 ms 133752 KB Output is correct
51 Correct 535 ms 11480 KB Output is correct
52 Correct 523 ms 10396 KB Output is correct
53 Correct 491 ms 9660 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 340 KB Output is correct
80 Correct 0 ms 212 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 0 ms 212 KB Output is correct
88 Correct 0 ms 212 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 0 ms 340 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 0 ms 212 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 0 ms 212 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 0 ms 340 KB Output is correct
106 Correct 0 ms 212 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 1 ms 380 KB Output is correct
110 Correct 12 ms 596 KB Output is correct
111 Correct 23 ms 1348 KB Output is correct
112 Correct 12 ms 1312 KB Output is correct
113 Correct 11 ms 1368 KB Output is correct
114 Correct 10 ms 2132 KB Output is correct
115 Correct 9 ms 2128 KB Output is correct
116 Correct 16 ms 940 KB Output is correct
117 Correct 17 ms 1040 KB Output is correct
118 Correct 19 ms 872 KB Output is correct
119 Correct 138 ms 2288 KB Output is correct
120 Correct 30 ms 3472 KB Output is correct
121 Correct 23 ms 3400 KB Output is correct
122 Correct 24 ms 4784 KB Output is correct
123 Correct 24 ms 4768 KB Output is correct
124 Correct 258 ms 7472 KB Output is correct
125 Execution timed out 2077 ms 22412 KB Time limit exceeded
126 Halted 0 ms 0 KB -