oj.uz

Submission #914344

# Submission time Handle Problem Language Result Execution time Memory
914344 2024-01-21T17:10:06 Z agusss Arranging Shoes (IOI19_shoes) C++17
100 / 100
 219 ms 37236 KB 
#include "vector"
#include "stdio.h"
#include "iostream"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"

using namespace std;
// using namespace __gnu_pbds;

typedef
__gnu_pbds::tree<
  int,
  __gnu_pbds::null_type,
  less<int>,
  __gnu_pbds::rb_tree_tag,
  __gnu_pbds::tree_order_statistics_node_update>
ordered_set;

struct Type { int v; };

struct SegmentTree {

  struct NodeType { int l, r, sum; };

  NodeType merge_nodes(NodeType a, NodeType b) {
    return { a.l, b.r, a.sum + b.sum };
  };

  NodeType set_leaf(int i, Type a) {
    return { i, i, a.v };
  }

  vector<NodeType> tree;

  vector<Type> *array;

  int left(int index) { return (index << 1) + 1; }

  int right(int index) { return (index << 1) + 2; }

  int mid(int l, int r) { return (l + r) >> 1; }

  bool on_left(NodeType a, int i) { return i <= mid(a.l, a.r); }

  void _build(int index, int l, int r) {
    if (l == r) {
      tree[index] = set_leaf(l, (*array)[l]); 
    } else {
      _build(left(index), l, mid(l, r));
      _build(right(index), mid(l, r) + 1, r);
      tree[index] = merge_nodes(tree[left(index)], tree[right(index)]);
    }
  }

  void build(vector<Type> &A) {
    array = &A;
    tree.resize((*array).size() * 4);
    _build(0, 0, (*array).size() - 1);
  }

  int u_i;

  Type u_v;

  void _update(int index) {
    if (tree[index].l == tree[index].r) {
      tree[index] = set_leaf(u_i, u_v);
      (*array)[u_i] = u_v;
    } else {
      if (on_left(tree[index], u_i)) {
        _update(left(index));
      } else {
        _update(right(index));
      }
      tree[index] = merge_nodes(tree[left(index)], tree[right(index)]);
    }
  }

  void update(int i, Type v) {
    u_i = i;
    u_v = v;
    _update(0);
  }

  int q_l;
  
  int q_r;
  
  NodeType _query(int index) {
    if (q_l <= tree[index].l and tree[index].r <= q_r) {
      return tree[index];
    }
    if (on_left(tree[index], q_r)) {
      return _query(left(index));
    }
    if (!on_left(tree[index], q_l)) {
      return _query(right(index));
    }
    return merge_nodes(_query(left(index)), _query(right(index))); 
  }

  NodeType query(int l, int r) {
    q_l = l;
    q_r = r;
    return _query(0);
  }
};

long long count_swaps(std::vector<int> s) {
  int n = s.size();
  long long cnt = 0;
  vector<Type> array(n);
  ordered_set os[n + 1];
  for (int i = 0; i < n; i++) {
    array[i] = { 1 };
    // cout << i << " = " << array[i].v << "\n";
    os[s[i] + (n >> 1)].insert(i);
  }
  SegmentTree ST;
  ST.build(array);
  // cout << "size:" << s.size() << "\n";
  for (int i = 0; i < (int)s.size(); i++) {
    if (array[i].v == 0) {
      continue;
    }
    // cout << "to pair" << i << "\n";
    int pair_index = -s[i] + (n >> 1);
    int j = os[pair_index].order_of_key(i + 1);
    // cout << "to pair " << i << "=> " << j << "\n";
    if (j < (int)os[pair_index].size()) {
      // cout << i << ": " << s[i] << " , "<< j << ": " << s[j] << "\n";
      auto it_j = os[pair_index].find_by_order(j);
      os[pair_index].erase(it_j);
      int j = *it_j;
      auto [ _, __, sum ] = ST.query(i, j);
      // cout << j << " sum = " << sum << "\n";
      ST.update(j, { 0 });
      long long distance = sum - (s[i] < 0 ? 2 : 1);
      cnt += distance;
    }
  }
	return cnt;
}

int mani() {

  vector<Type> B;

  int n;
  if (scanf("%d\n", &n));
  vector<int> A(n << 1);
  for (int i = 0; i < n << 1; i++) {
    if (scanf("%d", &A[i]));
  }
  // SegmentTree ST;
  // ST.build(B);
  // ST.print(10);
  printf("%lld\n", count_swaps(A));

  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 360 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 412 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 372 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 532 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 408 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 10 ms 3928 KB Output is correct
21 Correct 10 ms 3932 KB Output is correct
22 Correct 118 ms 37212 KB Output is correct
23 Correct 211 ms 37236 KB Output is correct
24 Correct 115 ms 37212 KB Output is correct
25 Correct 178 ms 37200 KB Output is correct
26 Correct 118 ms 37064 KB Output is correct
27 Correct 219 ms 37188 KB Output is correct
28 Correct 186 ms 37232 KB Output is correct
29 Correct 182 ms 37056 KB Output is correct
30 Correct 188 ms 37204 KB Output is correct
31 Correct 124 ms 36988 KB Output is correct
32 Correct 187 ms 37008 KB Output is correct
33 Correct 178 ms 37044 KB Output is correct
34 Correct 179 ms 37112 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 163 ms 37204 KB Output is correct
38 Correct 169 ms 37200 KB Output is correct
39 Correct 180 ms 37096 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 348 KB Output is correct
5 Correct 108 ms 37176 KB Output is correct
6 Correct 123 ms 37188 KB Output is correct
7 Correct 108 ms 37084 KB Output is correct
8 Correct 109 ms 37200 KB Output is correct
9 Correct 110 ms 37204 KB Output is correct
10 Correct 118 ms 37200 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 360 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 412 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 372 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 360 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 412 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 372 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 532 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 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 408 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 600 KB Output is correct
54 Correct 10 ms 3928 KB Output is correct
55 Correct 10 ms 3932 KB Output is correct
56 Correct 118 ms 37212 KB Output is correct
57 Correct 211 ms 37236 KB Output is correct
58 Correct 115 ms 37212 KB Output is correct
59 Correct 178 ms 37200 KB Output is correct
60 Correct 118 ms 37064 KB Output is correct
61 Correct 219 ms 37188 KB Output is correct
62 Correct 186 ms 37232 KB Output is correct
63 Correct 182 ms 37056 KB Output is correct
64 Correct 188 ms 37204 KB Output is correct
65 Correct 124 ms 36988 KB Output is correct
66 Correct 187 ms 37008 KB Output is correct
67 Correct 178 ms 37044 KB Output is correct
68 Correct 179 ms 37112 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 163 ms 37204 KB Output is correct
72 Correct 169 ms 37200 KB Output is correct
73 Correct 180 ms 37096 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 108 ms 37176 KB Output is correct
79 Correct 123 ms 37188 KB Output is correct
80 Correct 108 ms 37084 KB Output is correct
81 Correct 109 ms 37200 KB Output is correct
82 Correct 110 ms 37204 KB Output is correct
83 Correct 118 ms 37200 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 1 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 1 ms 604 KB Output is correct
90 Correct 1 ms 604 KB Output is correct
91 Correct 1 ms 604 KB Output is correct
92 Correct 1 ms 604 KB Output is correct
93 Correct 1 ms 604 KB Output is correct
94 Correct 1 ms 604 KB Output is correct
95 Correct 1 ms 604 KB Output is correct
96 Correct 1 ms 604 KB Output is correct
97 Correct 1 ms 604 KB Output is correct
98 Correct 1 ms 604 KB Output is correct
99 Correct 1 ms 604 KB Output is correct
100 Correct 1 ms 604 KB Output is correct
101 Correct 9 ms 3932 KB Output is correct
102 Correct 13 ms 3932 KB Output is correct
103 Correct 185 ms 37056 KB Output is correct
104 Correct 121 ms 37100 KB Output is correct
105 Correct 172 ms 37200 KB Output is correct
106 Correct 104 ms 37204 KB Output is correct
107 Correct 133 ms 37056 KB Output is correct
108 Correct 137 ms 37204 KB Output is correct
109 Correct 111 ms 37200 KB Output is correct
110 Correct 182 ms 37032 KB Output is correct
111 Correct 106 ms 37224 KB Output is correct
112 Correct 179 ms 37200 KB Output is correct
113 Correct 141 ms 37212 KB Output is correct
114 Correct 106 ms 37208 KB Output is correct
115 Correct 104 ms 37212 KB Output is correct