oj.uz

Submission #892140

# Submission time Handle Problem Language Result Execution time Memory
892140 2023-12-25T00:50:57 Z MilosMilutinovic New Home (APIO18_new_home) C++14
57 / 100
 5000 ms 427444 KB 
#include <bits/stdc++.h>
 
using namespace std;

const int inf = (int) 1e9;

vector<int> mn;
vector<int> mx;
int sz;

void Build(int x, int l, int r) {
  mn[x] = inf;
  mx[x] = -inf;
  if (l == r) {
    return;
  }
  int mid = l + r >> 1;
  Build(x << 1, l, mid);
  Build(x << 1 | 1, mid + 1, r);
}

void ModifyMin(int x, int l, int r, int p, int v) {
  if (l == r) {
    mn[x] = v;
    return;
  }
  int mid = l + r >> 1;
  if (p <= mid) {
    ModifyMin(x << 1, l, mid, p, v);
  } else {
    ModifyMin(x << 1 | 1, mid + 1, r, p, v);
  }
  mn[x] = min(mn[x << 1], mn[x << 1 | 1]);
}

void ModifyMax(int x, int l, int r, int p, int v) {
  if (l == r) {
    mx[x] = v;
    return;
  }
  int mid = l + r >> 1;
  if (p <= mid) {
    ModifyMax(x << 1, l, mid, p, v);
  } else {
    ModifyMax(x << 1 | 1, mid + 1, r, p, v);
  }
  mx[x] = max(mx[x << 1], mx[x << 1 | 1]);
}

void ChangeMin(int p, int v) {
  ModifyMin(1, 0, sz - 1, p, v);
}

void ChangeMax(int p, int v) {
  ModifyMax(1, 0, sz - 1, p, v);
}

int query_max(int x, int l, int r, int ll, int rr) {
  if (l > r || l > rr || r < ll) {
    return -inf;
  }
  if (ll <= l && r <= rr) {
    return mx[x];
  }
  int mid = l + r >> 1;
  return max(query_max(x << 1, l, mid, ll, rr), query_max(x << 1 | 1, mid + 1, r, ll, rr));
}

int query_min(int x, int l, int r, int ll, int rr) {
  if (l > r || l > rr || r < ll) {
    return inf;
  }
  if (ll <= l && r <= rr) {
    return mn[x];
  }
  int mid = l + r >> 1;
  return min(query_min(x << 1, l, mid, ll, rr), query_min(x << 1 | 1, mid + 1, r, ll, rr));
}

int get_max(int l, int r) {
  return query_max(1, 0, sz - 1, l, r);
}

int get_min(int l, int r) {
  return query_min(1, 0, sz - 1, l, r);
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, q;
  cin >> n >> k >> q;
  vector<int> x(n);
  vector<int> t(n);
  vector<int> a(n);
  vector<int> b(n);
  map<pair<int, int>, vector<pair<int, int>>> mp;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> t[i] >> a[i] >> b[i];
    --t[i]; ++b[i];
    mp[{x[i], t[i]}].emplace_back(a[i], b[i]);
  }
  vector<int> new_x;
  vector<int> new_t;
  vector<int> new_a;
  vector<int> new_b;
  for (auto& p : mp) {
    vector<pair<int, int>> v = p.second;
    sort(v.begin(), v.end());
    int sz = (int) v.size();
    for (int i = 0; i < sz; i++) {
      int ptr = i;
      int mx = v[i].second;
      while (ptr + 1 < sz && v[ptr + 1].first < mx) {
        ptr += 1;
        mx = max(mx, v[ptr].second);
      }
      new_x.push_back(p.first.first);
      new_t.push_back(p.first.second);
      new_a.push_back(v[i].first);
      new_b.push_back(mx);
      i = ptr;
    }
  }
  x = new_x;
  t = new_t;
  a = new_a;
  b = new_b;
  n = (int) x.size();
  vector<int> l(q);
  vector<int> y(q);
  for (int i = 0; i < q; i++) {
    cin >> l[i] >> y[i];
  }
  vector<int> xs(1, 1e9);
  for (int i = 0; i < n; i++) {
    xs.push_back(a[i]);
    xs.push_back(b[i]);
  }
  for (int i = 0; i < q; i++) {
    xs.push_back(y[i]);
  }
  sort(xs.begin(), xs.end());
  xs.erase(unique(xs.begin(), xs.end()), xs.end());
  for (int i = 0; i < n; i++) {
    a[i] = (int) (lower_bound(xs.begin(), xs.end(), a[i]) - xs.begin());
    b[i] = (int) (lower_bound(xs.begin(), xs.end(), b[i]) - xs.begin());
  }
  for (int i = 0; i < q; i++) {
    y[i] = (int) (lower_bound(xs.begin(), xs.end(), y[i]) - xs.begin());
  }
  int T = (int) xs.size();
  vector<vector<int>> ids(T);
  for (int i = 0; i < n; i++) {
    ids[a[i]].push_back(i);
    ids[b[i]].push_back(~i);
  }
  vector<multiset<tuple<int, int, int>>> open(k);
  vector<array<int, 4>> ev;
  vector<multiset<int>> my(k);
  auto Insert = [&](int t, int x, int y) {
    if (my[t].find(x) != my[t].end()) {
      assert(false);
    }
    auto ptr = my[t].lower_bound(x);
    if (ptr != my[t].begin() && ptr != my[t].end()) {
      auto it = open[t].lower_bound({*prev(ptr), *ptr, -1});
      ev.push_back({get<0>(*it), get<1>(*it), get<2>(*it), y});
      open[t].erase(it);
    } else if (ptr != my[t].begin()) {
      auto it = open[t].lower_bound({*prev(ptr), inf, -1});
      ev.push_back({get<0>(*it), get<1>(*it), get<2>(*it), y});
      open[t].erase(it);
    } else if (ptr != my[t].end()) {
      auto it = open[t].lower_bound({-inf, *ptr, -1});
      ev.push_back({get<0>(*it), get<1>(*it), get<2>(*it), y});
      open[t].erase(it);
    }
    if (ptr != my[t].end()) {
      open[t].emplace(x, *ptr, y);
    } else {
      open[t].emplace(x, inf, y);
    }
    if (ptr != my[t].begin()) {
      ptr = prev(ptr);
      open[t].emplace(*ptr, x, y);
    } else {
      open[t].emplace(-inf, x, y);
    }
    my[t].insert(x);
  };
  auto Remove = [&](int t, int x, int y) {
    assert(my[t].find(x) != my[t].end());
    auto ptr = my[t].lower_bound(x);
    if (ptr != prev(my[t].end())) {
      auto it = open[t].lower_bound({x, *next(ptr), -1});
      ev.push_back({get<0>(*it), get<1>(*it), get<2>(*it), y});
      open[t].erase(it);
    } else {
      auto it = open[t].lower_bound({x, inf, -1});
      ev.push_back({get<0>(*it), get<1>(*it), get<2>(*it), y});
      open[t].erase(it);
    }
    if (ptr != my[t].begin()) {
      auto it = open[t].lower_bound({*prev(ptr), x, -1});
      ev.push_back({get<0>(*it), get<1>(*it), get<2>(*it), y});
      open[t].erase(it);
    } else {
      auto it = open[t].lower_bound({-inf, x, -1});
      ev.push_back({get<0>(*it), get<1>(*it), get<2>(*it), y});
      open[t].erase(it);
    }
    if (ptr != my[t].begin() && ptr != prev(my[t].end())) {
      open[t].emplace(*prev(ptr), *next(ptr), y);
    } else if (ptr != my[t].begin()) {
      open[t].emplace(*prev(ptr), inf, y);
    } else if (ptr != prev(my[t].end())) {
      open[t].emplace(-inf, *next(ptr), y);
    }
    my[t].erase(my[t].find(x));
  }; 
  for (int i = 0; i < T; i++) {
    sort(ids[i].begin(), ids[i].end());
    for (int j : ids[i]) {
      if (j >= 0) {
        Insert(t[j], x[j], i);
      } else {
        j = ~j;
        Remove(t[j], x[j], i);
      }
    }
  }
  for (int i = 0; i < k; i++) {
    for (auto& p : open[i]) {
      ev.push_back({get<0>(p), get<1>(p), get<2>(p), T - 1});
    }
  }
  vector<vector<int>> qs(T);
  for (int i = 0; i < q; i++) {
    qs[y[i]].push_back(i);
  }
  vector<pair<int, int>> min_with;
  vector<pair<int, int>> max_with;
  for (auto& p : ev) {
    int L = p[0];
    int R = p[1];
    int mid = (L + R) / 2;
    min_with.emplace_back(L, mid);
    max_with.emplace_back(R, mid + (L % 2 != R % 2));
  }
  sort(min_with.begin(), min_with.end(), [&](pair<int, int> p, pair<int, int> q) {
    return p.second > q.second;
  });
  sort(max_with.begin(), max_with.end(), [&](pair<int, int> p, pair<int, int> q) {
    return p.second < q.second;
  });
  map<pair<int, int>, vector<int>> idx_mn;
  map<pair<int, int>, vector<int>> idx_mx;
  sz = (int) ev.size();
  for (int i = 0; i < sz; i++) {
    idx_mn[min_with[i]].push_back(i);
  }
  for (int i = 0; i < sz; i++) {
    idx_mx[max_with[i]].push_back(i);
  }
  vector<vector<int>> qs_mn(T);
  vector<vector<int>> qs_mx(T);
  for (int i = 0; i < sz; i++) {
    int L = ev[i][0];
    int R = ev[i][1];
    int from = ev[i][2];
    int to = ev[i][3];
    int mid = (L + R) / 2;
    {
      int idx = idx_mn[{L, mid}].back();
      idx_mn[{L, mid}].pop_back();
      qs_mn[from].push_back(idx);
      qs_mn[to].push_back(~idx);
    }
    {
      int idx = idx_mx[{R, mid + (L % 2 != R % 2)}].back();
      idx_mx[{R, mid + (L % 2 != R % 2)}].pop_back();
      qs_mx[from].push_back(idx);
      qs_mx[to].push_back(~idx);
    }
  }
  mn = vector<int>(4 * sz);
  mx = vector<int>(4 * sz);
  Build(1, 0, sz - 1);
  vector<int> res(q);
  for (int i = 0; i < T; i++) {
    for (int j : qs_mn[i]) {
      if (j >= 0) {
        ChangeMin(j, min_with[j].first);
      } else {
        j = ~j;
        ChangeMin(j, inf);
      }
    }
    for (int j : qs_mx[i]) {
      if (j >= 0) {
        ChangeMax(j, max_with[j].first);
      } else {
        j = ~j;
        ChangeMax(j, -inf);
      }
    }
    for (int j : qs[i]) {
      {
        int low = 0, high = sz - 1, pos = -1;
        while (low <= high) {
          int mid = low + high >> 1;
          if (min_with[mid].second >= l[j]) {
            pos = mid;
            low = mid + 1;
          } else {
            high = mid - 1;
          }
        }
        if (pos != -1) {
          res[j] = max(res[j], l[j] - get_min(0, pos));
        }
      }
      {
        int low = 0, high = sz - 1, pos = -1;
        while (low <= high) {
          int mid = low + high >> 1;
          if (max_with[mid].second <= l[j]) {
            pos = mid;
            low = mid + 1;
          } else {
            high = mid - 1;
          }
        }
        if (pos != -1) {
          res[j] = max(res[j], get_max(0, pos) - l[j]);
        }
      }
    }
  }
  vector<vector<int>> qs_type(T);
  for (int i = 0; i < n; i++) {
    qs_type[a[i]].push_back(t[i]);
    qs_type[b[i]].push_back(~t[i]);
  }
  int bal = 0;
  vector<int> cnt(k);
  for (int i = 0; i < T; i++) {
    for (int j : qs_type[i]) {
      if (j >= 0) {
        cnt[j] += 1;
        if (cnt[j] == 1) {
          bal += 1;
        }
      } else {
        j = ~j;
        cnt[j] -= 1;
        if (cnt[j] == 0) {
          bal -= 1;
        }
      }
    }
    for (int j : qs[i]) {
      if (bal != k) {
        res[j] = -1;
      }
    }
  }
  for (int i = 0; i < q; i++) {
    cout << res[i] << '\n';
  }
  return 0;
}

Compilation message

new_home.cpp: In function 'void Build(int, int, int)':
new_home.cpp:17:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |   int mid = l + r >> 1;
      |             ~~^~~
new_home.cpp: In function 'void ModifyMin(int, int, int, int, int)':
new_home.cpp:27:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |   int mid = l + r >> 1;
      |             ~~^~~
new_home.cpp: In function 'void ModifyMax(int, int, int, int, int)':
new_home.cpp:41:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |   int mid = l + r >> 1;
      |             ~~^~~
new_home.cpp: In function 'int query_max(int, int, int, int, int)':
new_home.cpp:65:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |   int mid = l + r >> 1;
      |             ~~^~~
new_home.cpp: In function 'int query_min(int, int, int, int, int)':
new_home.cpp:76:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   76 |   int mid = l + r >> 1;
      |             ~~^~~
new_home.cpp: In function 'int main()':
new_home.cpp:312:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  312 |           int mid = low + high >> 1;
      |                     ~~~~^~~~~~
new_home.cpp:327:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  327 |           int mid = low + high >> 1;
      |                     ~~~~^~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 2 ms 976 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 3 ms 1112 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 976 KB Output is correct
15 Correct 2 ms 1112 KB Output is correct
16 Correct 2 ms 856 KB Output is correct
17 Correct 3 ms 1112 KB Output is correct
18 Correct 2 ms 1116 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 3 ms 1056 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 3 ms 1116 KB Output is correct
27 Correct 2 ms 712 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 2 ms 1116 KB Output is correct
30 Correct 2 ms 860 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 2 ms 976 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 3 ms 1112 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 976 KB Output is correct
15 Correct 2 ms 1112 KB Output is correct
16 Correct 2 ms 856 KB Output is correct
17 Correct 3 ms 1112 KB Output is correct
18 Correct 2 ms 1116 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 3 ms 1056 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 3 ms 1116 KB Output is correct
27 Correct 2 ms 712 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 2 ms 1116 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 896 ms 99232 KB Output is correct
32 Correct 34 ms 4124 KB Output is correct
33 Correct 863 ms 99884 KB Output is correct
34 Correct 864 ms 98488 KB Output is correct
35 Correct 945 ms 99644 KB Output is correct
36 Correct 907 ms 100248 KB Output is correct
37 Correct 624 ms 99204 KB Output is correct
38 Correct 632 ms 100188 KB Output is correct
39 Correct 506 ms 99448 KB Output is correct
40 Correct 531 ms 99028 KB Output is correct
41 Correct 746 ms 101780 KB Output is correct
42 Correct 727 ms 102256 KB Output is correct
43 Correct 38 ms 5972 KB Output is correct
44 Correct 717 ms 103288 KB Output is correct
45 Correct 764 ms 102076 KB Output is correct
46 Correct 668 ms 102080 KB Output is correct
47 Correct 386 ms 95020 KB Output is correct
48 Correct 394 ms 95316 KB Output is correct
49 Correct 466 ms 98172 KB Output is correct
50 Correct 491 ms 100560 KB Output is correct
51 Correct 482 ms 98236 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2888 ms 314896 KB Output is correct
2 Correct 2239 ms 309532 KB Output is correct
3 Correct 1667 ms 327320 KB Output is correct
4 Correct 2807 ms 315992 KB Output is correct
5 Correct 2308 ms 307428 KB Output is correct
6 Correct 2222 ms 309900 KB Output is correct
7 Correct 1710 ms 328472 KB Output is correct
8 Correct 2752 ms 313900 KB Output is correct
9 Correct 2866 ms 314064 KB Output is correct
10 Correct 2464 ms 308964 KB Output is correct
11 Correct 1946 ms 305308 KB Output is correct
12 Correct 2117 ms 309108 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5034 ms 427444 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 2 ms 976 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 3 ms 1112 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 976 KB Output is correct
15 Correct 2 ms 1112 KB Output is correct
16 Correct 2 ms 856 KB Output is correct
17 Correct 3 ms 1112 KB Output is correct
18 Correct 2 ms 1116 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 3 ms 1056 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 3 ms 1116 KB Output is correct
27 Correct 2 ms 712 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 2 ms 1116 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 896 ms 99232 KB Output is correct
32 Correct 34 ms 4124 KB Output is correct
33 Correct 863 ms 99884 KB Output is correct
34 Correct 864 ms 98488 KB Output is correct
35 Correct 945 ms 99644 KB Output is correct
36 Correct 907 ms 100248 KB Output is correct
37 Correct 624 ms 99204 KB Output is correct
38 Correct 632 ms 100188 KB Output is correct
39 Correct 506 ms 99448 KB Output is correct
40 Correct 531 ms 99028 KB Output is correct
41 Correct 746 ms 101780 KB Output is correct
42 Correct 727 ms 102256 KB Output is correct
43 Correct 38 ms 5972 KB Output is correct
44 Correct 717 ms 103288 KB Output is correct
45 Correct 764 ms 102076 KB Output is correct
46 Correct 668 ms 102080 KB Output is correct
47 Correct 386 ms 95020 KB Output is correct
48 Correct 394 ms 95316 KB Output is correct
49 Correct 466 ms 98172 KB Output is correct
50 Correct 491 ms 100560 KB Output is correct
51 Correct 482 ms 98236 KB Output is correct
52 Correct 524 ms 88196 KB Output is correct
53 Correct 484 ms 88024 KB Output is correct
54 Correct 809 ms 93092 KB Output is correct
55 Correct 607 ms 96452 KB Output is correct
56 Correct 632 ms 94720 KB Output is correct
57 Correct 675 ms 98820 KB Output is correct
58 Correct 690 ms 96144 KB Output is correct
59 Correct 603 ms 94648 KB Output is correct
60 Correct 726 ms 99772 KB Output is correct
61 Correct 113 ms 29200 KB Output is correct
62 Correct 499 ms 88748 KB Output is correct
63 Correct 745 ms 94720 KB Output is correct
64 Correct 741 ms 95924 KB Output is correct
65 Correct 816 ms 98880 KB Output is correct
66 Correct 767 ms 100956 KB Output is correct
67 Correct 228 ms 28908 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 2 ms 976 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 3 ms 1112 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 976 KB Output is correct
15 Correct 2 ms 1112 KB Output is correct
16 Correct 2 ms 856 KB Output is correct
17 Correct 3 ms 1112 KB Output is correct
18 Correct 2 ms 1116 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 3 ms 1056 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 3 ms 1116 KB Output is correct
27 Correct 2 ms 712 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 2 ms 1116 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 896 ms 99232 KB Output is correct
32 Correct 34 ms 4124 KB Output is correct
33 Correct 863 ms 99884 KB Output is correct
34 Correct 864 ms 98488 KB Output is correct
35 Correct 945 ms 99644 KB Output is correct
36 Correct 907 ms 100248 KB Output is correct
37 Correct 624 ms 99204 KB Output is correct
38 Correct 632 ms 100188 KB Output is correct
39 Correct 506 ms 99448 KB Output is correct
40 Correct 531 ms 99028 KB Output is correct
41 Correct 746 ms 101780 KB Output is correct
42 Correct 727 ms 102256 KB Output is correct
43 Correct 38 ms 5972 KB Output is correct
44 Correct 717 ms 103288 KB Output is correct
45 Correct 764 ms 102076 KB Output is correct
46 Correct 668 ms 102080 KB Output is correct
47 Correct 386 ms 95020 KB Output is correct
48 Correct 394 ms 95316 KB Output is correct
49 Correct 466 ms 98172 KB Output is correct
50 Correct 491 ms 100560 KB Output is correct
51 Correct 482 ms 98236 KB Output is correct
52 Correct 2888 ms 314896 KB Output is correct
53 Correct 2239 ms 309532 KB Output is correct
54 Correct 1667 ms 327320 KB Output is correct
55 Correct 2807 ms 315992 KB Output is correct
56 Correct 2308 ms 307428 KB Output is correct
57 Correct 2222 ms 309900 KB Output is correct
58 Correct 1710 ms 328472 KB Output is correct
59 Correct 2752 ms 313900 KB Output is correct
60 Correct 2866 ms 314064 KB Output is correct
61 Correct 2464 ms 308964 KB Output is correct
62 Correct 1946 ms 305308 KB Output is correct
63 Correct 2117 ms 309108 KB Output is correct
64 Execution timed out 5034 ms 427444 KB Time limit exceeded
65 Halted 0 ms 0 KB -