oj.uz

답안 #892144

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892144 2023-12-25T01:03:06 Z MilosMilutinovic 새 집 (APIO18_new_home) C++14
80 / 100
 5000 ms 350080 KB 
#include <bits/stdc++.h>
 
using namespace std;

const int N = (int) 4e6;

const int inf = (int) 1e9;

int mn[N], mx[N], 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);
}

vector<multiset<tuple<int, int, int>>> open;
vector<array<int, 4>> ev;
vector<multiset<int>> my;

void Insert(int t, int x, int y) {
  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);
}

void Remove(int t, int x, int y) {
  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));
}

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);
  }
  open.resize(k);
  my.resize(k);
  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;
  });
  set<tuple<int, int, int>> idx_mn;
  set<tuple<int, int, int>> idx_mx;
  sz = (int) ev.size();
  for (int i = 0; i < sz; i++) {
    idx_mn.emplace(min_with[i].first, min_with[i].second, i);
  }
  for (int i = 0; i < sz; i++) {
    idx_mx.emplace(max_with[i].first, max_with[i].second, 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;
    {
      auto it = idx_mn.lower_bound({L, mid, -1});
      int idx = get<2>(*it);
      idx_mn.erase(it);
      qs_mn[from].push_back(idx);
      qs_mn[to].push_back(~idx);
    }
    {
      auto it = idx_mx.lower_bound({R, mid + (L % 2 != R % 2), -1});
      int idx = get<2>(*it);
      idx_mx.erase(it);
      qs_mx[from].push_back(idx);
      qs_mx[to].push_back(~idx);
    }
  }
  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;
}

/*
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10


2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7


1 1 1
100000000 1 1 1
1 1
*/

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:313:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  313 |           int mid = low + high >> 1;
      |                     ~~~~^~~~~~
new_home.cpp:328:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  328 |           int mid = low + high >> 1;
      |                     ~~~~^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 3 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 3 ms 3160 KB Output is correct
11 Correct 2 ms 2904 KB Output is correct
12 Correct 3 ms 2904 KB Output is correct
13 Correct 2 ms 2908 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2828 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2944 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 1 ms 2784 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 3164 KB Output is correct
24 Correct 2 ms 2960 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 2 ms 2904 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 2 ms 2908 KB Output is correct
29 Correct 2 ms 2904 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 3 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 3 ms 3160 KB Output is correct
11 Correct 2 ms 2904 KB Output is correct
12 Correct 3 ms 2904 KB Output is correct
13 Correct 2 ms 2908 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2828 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2944 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 1 ms 2784 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 3164 KB Output is correct
24 Correct 2 ms 2960 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 2 ms 2904 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 2 ms 2908 KB Output is correct
29 Correct 2 ms 2904 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct
31 Correct 788 ms 73276 KB Output is correct
32 Correct 34 ms 5568 KB Output is correct
33 Correct 790 ms 73168 KB Output is correct
34 Correct 745 ms 72252 KB Output is correct
35 Correct 773 ms 73420 KB Output is correct
36 Correct 806 ms 72768 KB Output is correct
37 Correct 499 ms 68156 KB Output is correct
38 Correct 514 ms 68360 KB Output is correct
39 Correct 428 ms 68240 KB Output is correct
40 Correct 446 ms 68292 KB Output is correct
41 Correct 674 ms 73032 KB Output is correct
42 Correct 651 ms 73036 KB Output is correct
43 Correct 31 ms 6132 KB Output is correct
44 Correct 678 ms 72828 KB Output is correct
45 Correct 689 ms 74264 KB Output is correct
46 Correct 643 ms 73664 KB Output is correct
47 Correct 335 ms 68540 KB Output is correct
48 Correct 337 ms 68532 KB Output is correct
49 Correct 405 ms 71836 KB Output is correct
50 Correct 429 ms 71100 KB Output is correct
51 Correct 404 ms 71616 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2628 ms 278068 KB Output is correct
2 Correct 2065 ms 274860 KB Output is correct
3 Correct 1522 ms 243888 KB Output is correct
4 Correct 2582 ms 273812 KB Output is correct
5 Correct 2041 ms 275764 KB Output is correct
6 Correct 1929 ms 276468 KB Output is correct
7 Correct 1549 ms 244592 KB Output is correct
8 Correct 2551 ms 272228 KB Output is correct
9 Correct 2676 ms 278540 KB Output is correct
10 Correct 2254 ms 277732 KB Output is correct
11 Correct 1676 ms 273992 KB Output is correct
12 Correct 1847 ms 274184 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4793 ms 315824 KB Output is correct
2 Correct 153 ms 20856 KB Output is correct
3 Correct 4302 ms 307164 KB Output is correct
4 Correct 3554 ms 311520 KB Output is correct
5 Correct 4863 ms 323632 KB Output is correct
6 Correct 4739 ms 323332 KB Output is correct
7 Correct 4011 ms 296500 KB Output is correct
8 Correct 4198 ms 295484 KB Output is correct
9 Correct 3656 ms 316380 KB Output is correct
10 Correct 4731 ms 322476 KB Output is correct
11 Correct 4817 ms 327976 KB Output is correct
12 Correct 4711 ms 307668 KB Output is correct
13 Correct 1944 ms 286524 KB Output is correct
14 Correct 1855 ms 283380 KB Output is correct
15 Correct 2173 ms 291364 KB Output is correct
16 Correct 2509 ms 293692 KB Output is correct
17 Correct 2297 ms 287620 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 3 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 3 ms 3160 KB Output is correct
11 Correct 2 ms 2904 KB Output is correct
12 Correct 3 ms 2904 KB Output is correct
13 Correct 2 ms 2908 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2828 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2944 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 1 ms 2784 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 3164 KB Output is correct
24 Correct 2 ms 2960 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 2 ms 2904 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 2 ms 2908 KB Output is correct
29 Correct 2 ms 2904 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct
31 Correct 788 ms 73276 KB Output is correct
32 Correct 34 ms 5568 KB Output is correct
33 Correct 790 ms 73168 KB Output is correct
34 Correct 745 ms 72252 KB Output is correct
35 Correct 773 ms 73420 KB Output is correct
36 Correct 806 ms 72768 KB Output is correct
37 Correct 499 ms 68156 KB Output is correct
38 Correct 514 ms 68360 KB Output is correct
39 Correct 428 ms 68240 KB Output is correct
40 Correct 446 ms 68292 KB Output is correct
41 Correct 674 ms 73032 KB Output is correct
42 Correct 651 ms 73036 KB Output is correct
43 Correct 31 ms 6132 KB Output is correct
44 Correct 678 ms 72828 KB Output is correct
45 Correct 689 ms 74264 KB Output is correct
46 Correct 643 ms 73664 KB Output is correct
47 Correct 335 ms 68540 KB Output is correct
48 Correct 337 ms 68532 KB Output is correct
49 Correct 405 ms 71836 KB Output is correct
50 Correct 429 ms 71100 KB Output is correct
51 Correct 404 ms 71616 KB Output is correct
52 Correct 464 ms 68296 KB Output is correct
53 Correct 492 ms 68104 KB Output is correct
54 Correct 734 ms 71736 KB Output is correct
55 Correct 585 ms 71212 KB Output is correct
56 Correct 543 ms 71388 KB Output is correct
57 Correct 638 ms 72984 KB Output is correct
58 Correct 617 ms 72372 KB Output is correct
59 Correct 552 ms 71232 KB Output is correct
60 Correct 726 ms 72504 KB Output is correct
61 Correct 179 ms 42272 KB Output is correct
62 Correct 478 ms 68496 KB Output is correct
63 Correct 646 ms 70716 KB Output is correct
64 Correct 644 ms 71680 KB Output is correct
65 Correct 740 ms 73052 KB Output is correct
66 Correct 703 ms 73812 KB Output is correct
67 Correct 312 ms 45960 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 3 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 3 ms 3160 KB Output is correct
11 Correct 2 ms 2904 KB Output is correct
12 Correct 3 ms 2904 KB Output is correct
13 Correct 2 ms 2908 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2828 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2944 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 1 ms 2784 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 3164 KB Output is correct
24 Correct 2 ms 2960 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 2 ms 2904 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 2 ms 2908 KB Output is correct
29 Correct 2 ms 2904 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct
31 Correct 788 ms 73276 KB Output is correct
32 Correct 34 ms 5568 KB Output is correct
33 Correct 790 ms 73168 KB Output is correct
34 Correct 745 ms 72252 KB Output is correct
35 Correct 773 ms 73420 KB Output is correct
36 Correct 806 ms 72768 KB Output is correct
37 Correct 499 ms 68156 KB Output is correct
38 Correct 514 ms 68360 KB Output is correct
39 Correct 428 ms 68240 KB Output is correct
40 Correct 446 ms 68292 KB Output is correct
41 Correct 674 ms 73032 KB Output is correct
42 Correct 651 ms 73036 KB Output is correct
43 Correct 31 ms 6132 KB Output is correct
44 Correct 678 ms 72828 KB Output is correct
45 Correct 689 ms 74264 KB Output is correct
46 Correct 643 ms 73664 KB Output is correct
47 Correct 335 ms 68540 KB Output is correct
48 Correct 337 ms 68532 KB Output is correct
49 Correct 405 ms 71836 KB Output is correct
50 Correct 429 ms 71100 KB Output is correct
51 Correct 404 ms 71616 KB Output is correct
52 Correct 2628 ms 278068 KB Output is correct
53 Correct 2065 ms 274860 KB Output is correct
54 Correct 1522 ms 243888 KB Output is correct
55 Correct 2582 ms 273812 KB Output is correct
56 Correct 2041 ms 275764 KB Output is correct
57 Correct 1929 ms 276468 KB Output is correct
58 Correct 1549 ms 244592 KB Output is correct
59 Correct 2551 ms 272228 KB Output is correct
60 Correct 2676 ms 278540 KB Output is correct
61 Correct 2254 ms 277732 KB Output is correct
62 Correct 1676 ms 273992 KB Output is correct
63 Correct 1847 ms 274184 KB Output is correct
64 Correct 4793 ms 315824 KB Output is correct
65 Correct 153 ms 20856 KB Output is correct
66 Correct 4302 ms 307164 KB Output is correct
67 Correct 3554 ms 311520 KB Output is correct
68 Correct 4863 ms 323632 KB Output is correct
69 Correct 4739 ms 323332 KB Output is correct
70 Correct 4011 ms 296500 KB Output is correct
71 Correct 4198 ms 295484 KB Output is correct
72 Correct 3656 ms 316380 KB Output is correct
73 Correct 4731 ms 322476 KB Output is correct
74 Correct 4817 ms 327976 KB Output is correct
75 Correct 4711 ms 307668 KB Output is correct
76 Correct 1944 ms 286524 KB Output is correct
77 Correct 1855 ms 283380 KB Output is correct
78 Correct 2173 ms 291364 KB Output is correct
79 Correct 2509 ms 293692 KB Output is correct
80 Correct 2297 ms 287620 KB Output is correct
81 Correct 464 ms 68296 KB Output is correct
82 Correct 492 ms 68104 KB Output is correct
83 Correct 734 ms 71736 KB Output is correct
84 Correct 585 ms 71212 KB Output is correct
85 Correct 543 ms 71388 KB Output is correct
86 Correct 638 ms 72984 KB Output is correct
87 Correct 617 ms 72372 KB Output is correct
88 Correct 552 ms 71232 KB Output is correct
89 Correct 726 ms 72504 KB Output is correct
90 Correct 179 ms 42272 KB Output is correct
91 Correct 478 ms 68496 KB Output is correct
92 Correct 646 ms 70716 KB Output is correct
93 Correct 644 ms 71680 KB Output is correct
94 Correct 740 ms 73052 KB Output is correct
95 Correct 703 ms 73812 KB Output is correct
96 Correct 312 ms 45960 KB Output is correct
97 Correct 4494 ms 350080 KB Output is correct
98 Correct 167 ms 21956 KB Output is correct
99 Execution timed out 5011 ms 338140 KB Time limit exceeded
100 Halted 0 ms 0 KB -