oj.uz

답안 #867890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867890 2023-10-29T16:41:04 Z evenvalue Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 13728 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef evenvalue
  #include "debug.h"
  #define debug(...) print(#__VA_ARGS__, __VA_ARGS__)
#else
  #define debug(...)
#endif

using int64 = long long;
using ld = long double;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

namespace Read {
int Int() {
  int x;
  cin >> x;
  return x;
}
int64 Int64() {
  int64 x;
  cin >> x;
  return x;
}
char Char() {
  char c;
  cin >> c;
  return c;
}
string String() {
  string s;
  cin >> s;
  return s;
}
double Double() {
  return stod(String());
}
ld LongDouble() {
  return stold(String());
}
template<typename T1, typename T2>
pair<T1, T2> Pair() {
  pair<T1, T2> p;
  cin >> p.first >> p.second;
  return p;
}
template<typename T>
vector<T> Vec(const int n) {
  vector<T> v(n);
  for (T &x : v) {
    cin >> x;
  }
  return v;
}
template<typename T>
vector<vector<T>> VecVec(const int n, const int m) {
  vector<vector<T>> v(n);
  for (vector<T> &vec : v) {
    vec = Vec<T>(m);
  }
  return v;
}
}// namespace Read

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;
constexpr int kMaxN = 2e5 + 10;

vector<int> precalc(const int n) {
  vector<int> index(n);

  deque<int> d;
  for (int i = n - 1; i >= 0; i--) {
    (i & 1) ? d.push_front(i) : d.push_back(i);
  }

  for (int i = 0; const int x : d) {
    index[x] = i++;
  }

  return index;
}

template<class node, class F = std::function<node(const node &, const node &)>>
class SegTree {
  int n = 0;
  std::vector<node> t;
  F unite;

  void build(const int x, const int l, const int r, const std::vector<node> &a) {
    if (l == r) {
      t[x] = a[l];
      return;
    }
    const int mid = (l + r) / 2;
    const int y = 2 * (mid - l + 1) + x;
    build(x + 1, l, mid, a);
    build(y, mid + 1, r, a);
    t[x] = unite(t[x + 1], t[y]);
  }

  void update(const int x, const int l, const int r, const int p, const node &v) {
    if (l == p and p == r) {
      t[x] = v;
      return;
    }
    const int mid = (l + r) / 2;
    const int y = 2 * (mid - l + 1) + x;
    if (p <= mid) {
      update(x + 1, l, mid, p, v);
    } else {
      update(y, mid + 1, r, p, v);
    }
    t[x] = unite(t[x + 1], t[y]);
  }

  node query(const int x, const int l, const int r, const int ql, const int qr) const {
    if (ql <= l and r <= qr) {
      return t[x];
    }
    const int mid = (l + r) / 2;
    const int y = 2 * (mid - l + 1) + x;
    if (qr <= mid) {
      return query(x + 1, l, mid, ql, qr);
    } else if (mid < ql) {
      return query(y, mid + 1, r, ql, qr);
    } else {
      return unite(query(x + 1, l, mid, ql, qr), query(y, mid + 1, r, ql, qr));
    }
  }

  void debug_node(const int x, const vector<int> &path) const {
    for (int i = 0; i < path.size(); i++) {
      cerr << path[i] << (i == path.size() - 1 ? ": " : " -> ");
    }
    cerr << t[x] << '\n';
  }

  void print_tree(const int x, const int l, const int r, vector<int> path) const {
    path.push_back(x);
    if (l == r) {
      debug_node(x, path);
      return;
    }
    const int mid = (l + r) / 2;
    const int y = 2 * (mid - l + 1) + x;
    print_tree(x + 1, l, mid, path);
    print_tree(y, mid + 1, r, path);
    debug_node(x, path);
  }

public:
  SegTree() = default;
  explicit SegTree(const int n, const node e, F f) : n(n), t(2 * n - 1, e), unite(std::move(f)) {}
  explicit SegTree(const std::vector<node> &a, F f) : n(a.size()), t(2 * (a.size()) - 1), unite(std::move(f)) {
    build(0, 0, n - 1, a);
  }

  void update(const int p, const node &v) {
    assert(0 <= p and p < n);
    update(0, 0, n - 1, p, v);
  }

  [[nodiscard]] node query(const int l, const int r) const {
    assert(0 <= l and l <= r and r < n);
    return query(0, 0, n - 1, l, r);
  }

  void print_tree() const {
    print_tree(0, 0, n - 1, {});
    cerr << "----------\n\n";
  }
};

struct node {
  int64 val = 0;
  int64 seq = 0;
};

template<typename T>
class CoordinateCompression {
  bool sorted = false;
  vector<T> v;

public:
  void add(const T &x) {
    v.push_back(x);
  }

  void compress() {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    sorted = true;
  }

  int get(const int x) {
    if (not sorted) assert(false);
    return distance(v.begin(), lower_bound(v.begin(), v.end(), x));
  }

  int size() {
    return v.size();
  }
};

class mo_s {
  struct query {
    int l, r, v, t;
    int64 ans;

    query(const int l, const int r, const int v, const int t) : l(l), r(r), v(v), t(t), ans(0) {}
  };

  const int kBlockSize = 350;

  const int n;
  int kDistinct;
  vector<int> a;
  vector<query> queries;

  [[nodiscard]] int block_of(const int i) const {
    return i / kBlockSize;
  }

public:
  explicit mo_s(vector<int> v) : n(v.size()), a(v) {
    CoordinateCompression<int> cc;
    for (const int x : a) {
      cc.add(x);
    }
    cc.compress();
    for (int &x : a) {
      x = cc.get(x);
    }
    kDistinct = cc.size();
  }

  void add_query(const int l, const int r, const int v, const int t) {
    queries.emplace_back(l, r, v, t);
  }

  vector<int64> solve() {
    sort(queries.begin(), queries.end(), [&](const query &q1, const query &q2) {
      if (block_of(q1.l) != block_of(q2.l)) {
        return (q1.l < q2.l);
      }
      return (block_of(q1.l) & 1 ? q1.r < q2.r : q1.r > q2.r);
    });

    //todo data structure
    const vector<int> index = precalc(kDistinct);

    vector<int> table(kDistinct);
    vector<int> freq(kDistinct);

    SegTree<node> st(kDistinct, node(), [&](const node l, const node r) {
      node ans;
      ans.val = l.val + r.val;
      ans.seq = l.seq + r.seq;
      return ans;
    });

    int64 diversity = 0;

    auto add = [&](const int i) {
      //todo: debug
//      cout << "Called add @" << i << '\n';

      const int val = a[i];
      const int f = freq[val] + 1;
      const int tpos = distance(table.begin(), prev(upper_bound(table.begin(), table.end(), f - 1)));
      freq[val]++;
      table[tpos]++;
      const int rank = index[tpos];
      st.update(rank, {f, rank * 1LL * f});

      const node left = st.query(0, rank);
      const node right = st.query(rank, kDistinct - 1);

      diversity += (rank * left.val) - left.seq;
      diversity += right.seq - (rank * right.val);

//      cout << "After adding, diversity = " << diversity << '\n';
    };

    auto rem = [&](const int i) {
      //todo: debug
//      cout << "Called rem @" << i << '\n';

      const int val = a[i];
      const int f = freq[val] - 1;
      const int tpos = distance(table.begin(),
                                lower_bound(table.begin(), table.end(), f + 1));
      freq[val]--;
      table[tpos]--;

      const int rank = index[tpos];
      st.update(rank, {f, rank * 1LL * f});

      const node left = st.query(0, rank);
      const node right = st.query(rank, kDistinct - 1);

      diversity -= (rank * left.val) - left.seq;
      diversity -= right.seq - (rank * right.val);

//      cout << "Diversity after removal : " << diversity << '\n';
    };

    for (int i = 0, l = 0, r = -1; i < queries.size(); i++) {
      while (r < queries[i].r) add(++r);
      while (r > queries[i].r) rem(r--);
      while (l < queries[i].l) rem(l++);
      while (l > queries[i].l) add(--l);
      const int x = queries[i].l;
      const int y = queries[i].r;
      const int64 m = (y - x + 1);
      queries[i].ans = diversity + (m * (m + 1) / 2);
    }

    sort(queries.begin(), queries.end(), [](const query &q1, const query &q2) {
      return q1.t < q2.t;
    });

    vector<int64> ans(queries.size());
    for (int i = 0; const query &q : queries) {
      ans[i++] = q.ans;
    }
    return ans;
  }
};

inline void solution() {
  const int n = Read::Int();
  const int q = Read::Int();
  vector<int> a = Read::Vec<int>(n);

  mo_s mo(a);
  for (int query = 0; query < q; query++) {
    const int l = Read::Int() - 1;
    const int r = Read::Int() - 1;
    mo.add_query(l, r, 0, query);
  }

  vector<int64> ans = mo.solve();
  for (const int64 x : ans) {
    cout << x << '\n';
  }
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  //freopen(".in", "r", stdin);
  //freopen(".out", "w", stdout);

  cout << fixed << setprecision(10);

  int testcases = 1;
  //cin >> testcases;
  while (testcases--) {
    solution();
  }
}

Compilation message

diversity.cpp: In function 'std::vector<int> precalc(int)':
diversity.cpp:83:19: warning: range-based 'for' loops with initializer only available with '-std=c++2a' or '-std=gnu++2a'
   83 |   for (int i = 0; const int x : d) {
      |                   ^~~~~
diversity.cpp: In member function 'std::vector<long long int> mo_s::solve()':
diversity.cpp:315:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<mo_s::query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  315 |     for (int i = 0, l = 0, r = -1; i < queries.size(); i++) {
      |                                    ~~^~~~~~~~~~~~~~~~
diversity.cpp:331:21: warning: range-based 'for' loops with initializer only available with '-std=c++2a' or '-std=gnu++2a'
  331 |     for (int i = 0; const query &q : queries) {
      |                     ^~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 504 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 13 ms 2268 KB Output is correct
5 Correct 25 ms 4056 KB Output is correct
6 Correct 42 ms 6112 KB Output is correct
7 Correct 37 ms 6104 KB Output is correct
8 Correct 42 ms 6104 KB Output is correct
9 Correct 44 ms 6100 KB Output is correct
10 Correct 40 ms 6104 KB Output is correct
11 Correct 41 ms 6104 KB Output is correct
12 Correct 43 ms 6100 KB Output is correct
13 Correct 48 ms 6344 KB Output is correct
14 Correct 41 ms 6100 KB Output is correct
15 Correct 44 ms 6100 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 13 ms 2268 KB Output is correct
5 Correct 25 ms 4056 KB Output is correct
6 Correct 42 ms 6112 KB Output is correct
7 Correct 37 ms 6104 KB Output is correct
8 Correct 42 ms 6104 KB Output is correct
9 Correct 44 ms 6100 KB Output is correct
10 Correct 40 ms 6104 KB Output is correct
11 Correct 41 ms 6104 KB Output is correct
12 Correct 43 ms 6100 KB Output is correct
13 Correct 48 ms 6344 KB Output is correct
14 Correct 41 ms 6100 KB Output is correct
15 Correct 44 ms 6100 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 17 ms 2268 KB Output is correct
20 Correct 33 ms 3948 KB Output is correct
21 Correct 53 ms 6104 KB Output is correct
22 Correct 51 ms 6116 KB Output is correct
23 Correct 50 ms 6104 KB Output is correct
24 Correct 51 ms 6104 KB Output is correct
25 Correct 51 ms 6104 KB Output is correct
26 Correct 59 ms 6104 KB Output is correct
27 Correct 51 ms 6100 KB Output is correct
28 Correct 51 ms 6100 KB Output is correct
29 Correct 51 ms 6104 KB Output is correct
30 Correct 51 ms 6104 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 13 ms 2268 KB Output is correct
5 Correct 25 ms 4056 KB Output is correct
6 Correct 42 ms 6112 KB Output is correct
7 Correct 37 ms 6104 KB Output is correct
8 Correct 42 ms 6104 KB Output is correct
9 Correct 44 ms 6100 KB Output is correct
10 Correct 40 ms 6104 KB Output is correct
11 Correct 41 ms 6104 KB Output is correct
12 Correct 43 ms 6100 KB Output is correct
13 Correct 48 ms 6344 KB Output is correct
14 Correct 41 ms 6100 KB Output is correct
15 Correct 44 ms 6100 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 17 ms 2268 KB Output is correct
20 Correct 33 ms 3948 KB Output is correct
21 Correct 53 ms 6104 KB Output is correct
22 Correct 51 ms 6116 KB Output is correct
23 Correct 50 ms 6104 KB Output is correct
24 Correct 51 ms 6104 KB Output is correct
25 Correct 51 ms 6104 KB Output is correct
26 Correct 59 ms 6104 KB Output is correct
27 Correct 51 ms 6100 KB Output is correct
28 Correct 51 ms 6100 KB Output is correct
29 Correct 51 ms 6104 KB Output is correct
30 Correct 51 ms 6104 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 3 ms 616 KB Output is correct
36 Correct 4 ms 692 KB Output is correct
37 Correct 17 ms 1384 KB Output is correct
38 Correct 20 ms 1516 KB Output is correct
39 Correct 41 ms 2284 KB Output is correct
40 Correct 82 ms 3804 KB Output is correct
41 Correct 119 ms 6100 KB Output is correct
42 Correct 118 ms 6100 KB Output is correct
43 Correct 131 ms 6104 KB Output is correct
44 Correct 123 ms 6104 KB Output is correct
45 Correct 118 ms 6104 KB Output is correct
46 Correct 123 ms 6104 KB Output is correct
47 Correct 128 ms 6100 KB Output is correct
48 Correct 119 ms 6104 KB Output is correct
49 Correct 119 ms 6100 KB Output is correct
50 Correct 117 ms 6100 KB Output is correct
51 Correct 118 ms 6100 KB Output is correct
52 Correct 124 ms 6104 KB Output is correct
53 Correct 117 ms 6100 KB Output is correct
54 Correct 121 ms 6104 KB Output is correct
55 Correct 128 ms 6116 KB Output is correct
56 Correct 120 ms 6104 KB Output is correct
57 Correct 122 ms 6100 KB Output is correct
58 Correct 123 ms 6104 KB Output is correct
59 Correct 118 ms 6104 KB Output is correct
60 Correct 118 ms 6304 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 504 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 13 ms 2268 KB Output is correct
15 Correct 25 ms 4056 KB Output is correct
16 Correct 42 ms 6112 KB Output is correct
17 Correct 37 ms 6104 KB Output is correct
18 Correct 42 ms 6104 KB Output is correct
19 Correct 44 ms 6100 KB Output is correct
20 Correct 40 ms 6104 KB Output is correct
21 Correct 41 ms 6104 KB Output is correct
22 Correct 43 ms 6100 KB Output is correct
23 Correct 48 ms 6344 KB Output is correct
24 Correct 41 ms 6100 KB Output is correct
25 Correct 44 ms 6100 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 17 ms 2268 KB Output is correct
30 Correct 33 ms 3948 KB Output is correct
31 Correct 53 ms 6104 KB Output is correct
32 Correct 51 ms 6116 KB Output is correct
33 Correct 50 ms 6104 KB Output is correct
34 Correct 51 ms 6104 KB Output is correct
35 Correct 51 ms 6104 KB Output is correct
36 Correct 59 ms 6104 KB Output is correct
37 Correct 51 ms 6100 KB Output is correct
38 Correct 51 ms 6100 KB Output is correct
39 Correct 51 ms 6104 KB Output is correct
40 Correct 51 ms 6104 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 3 ms 616 KB Output is correct
46 Correct 4 ms 692 KB Output is correct
47 Correct 17 ms 1384 KB Output is correct
48 Correct 20 ms 1516 KB Output is correct
49 Correct 41 ms 2284 KB Output is correct
50 Correct 82 ms 3804 KB Output is correct
51 Correct 119 ms 6100 KB Output is correct
52 Correct 118 ms 6100 KB Output is correct
53 Correct 131 ms 6104 KB Output is correct
54 Correct 123 ms 6104 KB Output is correct
55 Correct 118 ms 6104 KB Output is correct
56 Correct 123 ms 6104 KB Output is correct
57 Correct 128 ms 6100 KB Output is correct
58 Correct 119 ms 6104 KB Output is correct
59 Correct 119 ms 6100 KB Output is correct
60 Correct 117 ms 6100 KB Output is correct
61 Correct 118 ms 6100 KB Output is correct
62 Correct 124 ms 6104 KB Output is correct
63 Correct 117 ms 6100 KB Output is correct
64 Correct 121 ms 6104 KB Output is correct
65 Correct 128 ms 6116 KB Output is correct
66 Correct 120 ms 6104 KB Output is correct
67 Correct 122 ms 6100 KB Output is correct
68 Correct 123 ms 6104 KB Output is correct
69 Correct 118 ms 6104 KB Output is correct
70 Correct 118 ms 6304 KB Output is correct
71 Correct 26 ms 1372 KB Output is correct
72 Correct 23 ms 1372 KB Output is correct
73 Correct 24 ms 1372 KB Output is correct
74 Correct 23 ms 1372 KB Output is correct
75 Correct 23 ms 1372 KB Output is correct
76 Correct 54 ms 2272 KB Output is correct
77 Correct 50 ms 2268 KB Output is correct
78 Correct 50 ms 2272 KB Output is correct
79 Correct 50 ms 2268 KB Output is correct
80 Correct 50 ms 2272 KB Output is correct
81 Correct 108 ms 3800 KB Output is correct
82 Correct 107 ms 3804 KB Output is correct
83 Correct 108 ms 3804 KB Output is correct
84 Correct 107 ms 3804 KB Output is correct
85 Correct 109 ms 3800 KB Output is correct
86 Correct 113 ms 4056 KB Output is correct
87 Correct 118 ms 3804 KB Output is correct
88 Correct 114 ms 3804 KB Output is correct
89 Correct 113 ms 3944 KB Output is correct
90 Correct 114 ms 3804 KB Output is correct
91 Correct 196 ms 7580 KB Output is correct
92 Correct 183 ms 7304 KB Output is correct
93 Correct 181 ms 7344 KB Output is correct
94 Correct 181 ms 7328 KB Output is correct
95 Correct 193 ms 7336 KB Output is correct
96 Correct 207 ms 11380 KB Output is correct
97 Correct 187 ms 11460 KB Output is correct
98 Correct 187 ms 11460 KB Output is correct
99 Correct 185 ms 11424 KB Output is correct
100 Correct 188 ms 11452 KB Output is correct
101 Correct 197 ms 11464 KB Output is correct
102 Correct 185 ms 11396 KB Output is correct
103 Correct 190 ms 11376 KB Output is correct
104 Correct 194 ms 11448 KB Output is correct
105 Correct 186 ms 11424 KB Output is correct
106 Correct 184 ms 13476 KB Output is correct
107 Correct 196 ms 13608 KB Output is correct
108 Correct 186 ms 13612 KB Output is correct
109 Correct 189 ms 13608 KB Output is correct
110 Correct 210 ms 13728 KB Output is correct
111 Correct 190 ms 13456 KB Output is correct
112 Correct 185 ms 13476 KB Output is correct
113 Correct 186 ms 13476 KB Output is correct
114 Correct 186 ms 13476 KB Output is correct
115 Correct 206 ms 13612 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 504 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 13 ms 2268 KB Output is correct
15 Correct 25 ms 4056 KB Output is correct
16 Correct 42 ms 6112 KB Output is correct
17 Correct 37 ms 6104 KB Output is correct
18 Correct 42 ms 6104 KB Output is correct
19 Correct 44 ms 6100 KB Output is correct
20 Correct 40 ms 6104 KB Output is correct
21 Correct 41 ms 6104 KB Output is correct
22 Correct 43 ms 6100 KB Output is correct
23 Correct 48 ms 6344 KB Output is correct
24 Correct 41 ms 6100 KB Output is correct
25 Correct 44 ms 6100 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 17 ms 2268 KB Output is correct
30 Correct 33 ms 3948 KB Output is correct
31 Correct 53 ms 6104 KB Output is correct
32 Correct 51 ms 6116 KB Output is correct
33 Correct 50 ms 6104 KB Output is correct
34 Correct 51 ms 6104 KB Output is correct
35 Correct 51 ms 6104 KB Output is correct
36 Correct 59 ms 6104 KB Output is correct
37 Correct 51 ms 6100 KB Output is correct
38 Correct 51 ms 6100 KB Output is correct
39 Correct 51 ms 6104 KB Output is correct
40 Correct 51 ms 6104 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 3 ms 616 KB Output is correct
46 Correct 4 ms 692 KB Output is correct
47 Correct 17 ms 1384 KB Output is correct
48 Correct 20 ms 1516 KB Output is correct
49 Correct 41 ms 2284 KB Output is correct
50 Correct 82 ms 3804 KB Output is correct
51 Correct 119 ms 6100 KB Output is correct
52 Correct 118 ms 6100 KB Output is correct
53 Correct 131 ms 6104 KB Output is correct
54 Correct 123 ms 6104 KB Output is correct
55 Correct 118 ms 6104 KB Output is correct
56 Correct 123 ms 6104 KB Output is correct
57 Correct 128 ms 6100 KB Output is correct
58 Correct 119 ms 6104 KB Output is correct
59 Correct 119 ms 6100 KB Output is correct
60 Correct 117 ms 6100 KB Output is correct
61 Correct 118 ms 6100 KB Output is correct
62 Correct 124 ms 6104 KB Output is correct
63 Correct 117 ms 6100 KB Output is correct
64 Correct 121 ms 6104 KB Output is correct
65 Correct 128 ms 6116 KB Output is correct
66 Correct 120 ms 6104 KB Output is correct
67 Correct 122 ms 6100 KB Output is correct
68 Correct 123 ms 6104 KB Output is correct
69 Correct 118 ms 6104 KB Output is correct
70 Correct 118 ms 6304 KB Output is correct
71 Correct 26 ms 1372 KB Output is correct
72 Correct 23 ms 1372 KB Output is correct
73 Correct 24 ms 1372 KB Output is correct
74 Correct 23 ms 1372 KB Output is correct
75 Correct 23 ms 1372 KB Output is correct
76 Correct 54 ms 2272 KB Output is correct
77 Correct 50 ms 2268 KB Output is correct
78 Correct 50 ms 2272 KB Output is correct
79 Correct 50 ms 2268 KB Output is correct
80 Correct 50 ms 2272 KB Output is correct
81 Correct 108 ms 3800 KB Output is correct
82 Correct 107 ms 3804 KB Output is correct
83 Correct 108 ms 3804 KB Output is correct
84 Correct 107 ms 3804 KB Output is correct
85 Correct 109 ms 3800 KB Output is correct
86 Correct 113 ms 4056 KB Output is correct
87 Correct 118 ms 3804 KB Output is correct
88 Correct 114 ms 3804 KB Output is correct
89 Correct 113 ms 3944 KB Output is correct
90 Correct 114 ms 3804 KB Output is correct
91 Correct 196 ms 7580 KB Output is correct
92 Correct 183 ms 7304 KB Output is correct
93 Correct 181 ms 7344 KB Output is correct
94 Correct 181 ms 7328 KB Output is correct
95 Correct 193 ms 7336 KB Output is correct
96 Correct 207 ms 11380 KB Output is correct
97 Correct 187 ms 11460 KB Output is correct
98 Correct 187 ms 11460 KB Output is correct
99 Correct 185 ms 11424 KB Output is correct
100 Correct 188 ms 11452 KB Output is correct
101 Correct 197 ms 11464 KB Output is correct
102 Correct 185 ms 11396 KB Output is correct
103 Correct 190 ms 11376 KB Output is correct
104 Correct 194 ms 11448 KB Output is correct
105 Correct 186 ms 11424 KB Output is correct
106 Correct 184 ms 13476 KB Output is correct
107 Correct 196 ms 13608 KB Output is correct
108 Correct 186 ms 13612 KB Output is correct
109 Correct 189 ms 13608 KB Output is correct
110 Correct 210 ms 13728 KB Output is correct
111 Correct 190 ms 13456 KB Output is correct
112 Correct 185 ms 13476 KB Output is correct
113 Correct 186 ms 13476 KB Output is correct
114 Correct 186 ms 13476 KB Output is correct
115 Correct 206 ms 13612 KB Output is correct
116 Correct 553 ms 2520 KB Output is correct
117 Correct 681 ms 2520 KB Output is correct
118 Correct 1112 ms 2916 KB Output is correct
119 Correct 2039 ms 2912 KB Output is correct
120 Correct 2400 ms 2916 KB Output is correct
121 Correct 5030 ms 3688 KB Output is correct
122 Correct 5716 ms 3688 KB Output is correct
123 Execution timed out 7054 ms 4528 KB Time limit exceeded
124 Halted 0 ms 0 KB -