oj.uz

Submission #711945

# Submission time Handle Problem Language Result Execution time Memory
711945 2023-03-17T17:57:58 Z JANCARAPAN Arranging Shoes (IOI19_shoes) C++17
100 / 100
 120 ms 22604 KB 
#include <bits/stdc++.h>
using namespace std;
//#define int long long   
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define sz(a) (long long) a.size()
#define endl '\n'

#define dbg(a) cerr << #a << " = " << a << endl;
#define print(a) for (auto x : a) cerr << x << " "; cerr << endl;

const long long INF = 1e18, MOD = 1e9+7;

struct segTree {
  int size = 1;
  vector<int> t;
  void init(int n) {
    while (size < n) size *= 2;
    t.assign(2 * size, 0LL);
  }
  int merge(int a, int b) {
    return a + b;
  }
  void set(int i, int x, int lx, int rx, int k) {
    if (rx - lx == 1) {
      t[x] += k;
      return;
    }
    int m = (lx + rx) / 2;
    if (i < m) {
      set(i, 2 * x + 1, lx, m, k);
    }
    else {
      set(i, 2 * x + 2, m, rx, k);
    }
    t[x] = merge(t[2 * x + 1], t[2 * x + 2]);
  }
  void set(int i, int k) {
    set(i, 0, 0, size, k);
  }
  int calc(int l, int r, int x, int lx, int rx) {
    if (lx >= l && rx <= r) {
      return t[x];
    }
    if (lx >= r || rx <= l) {
      return 0;
    }
    int m = (lx + rx) / 2;
    auto m0 = calc(l, r, 2 * x + 1, lx, m);
    auto m1 = calc(l, r, 2 * x + 2, m, rx);
    return merge(m0, m1);
  }
  int calc(int l, int r) {
    return calc(l, r, 0, 0, size);
  }
};

ll count_swaps(vector<int> tmp) {
  int n = sz(tmp);
  vector pos(n + 1, vector<int>()), neg(n + 1, vector<int>());
  
  for (int i = 0; i < n; i++) {
    if (tmp[i] > 0) {
      pos[tmp[i]].pb(i);
    }
    else {
      neg[abs(tmp[i])].pb(i);
    }
  }
  // ara formo parelles
  vector<int> other;
  vector<int> a(n), add;
  
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < sz(pos[i]); j++) {
      a[pos[i][j]] = a[neg[i][j]] = sz(other);
      other.emplace_back(max(pos[i][j], neg[i][j]));
      add.emplace_back(pos[i][j] < neg[i][j]);
    }
  }
  
  segTree st;
  st.init(n);
  
  ll ans = 0;
  for (int i = 0; i < n; i++) {
    if (other[a[i]] == i) {
      continue;
    }
    ans += other[a[i]] - i - 1 + add[a[i]];
    ans -= st.calc(i, other[a[i]]);
    st.set(other[a[i]], 1);
  }
  
  return ans;
  
}

//signed main() {
  //cout << count_swaps({2, 1, -1, -2}) << endl;
//}

Subtask #1
10.0 / 10.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

Subtask #2
20.0 / 20.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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 224 KB Output is correct
8 Correct 0 ms 212 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 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 212 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 212 KB Output is correct
27 Correct 0 ms 296 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 0 ms 304 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct

Subtask #3
20.0 / 20.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 1 ms 212 KB Output is correct
5 Correct 0 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 256 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 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 6 ms 1876 KB Output is correct
21 Correct 7 ms 1876 KB Output is correct
22 Correct 58 ms 16100 KB Output is correct
23 Correct 50 ms 16044 KB Output is correct
24 Correct 55 ms 16048 KB Output is correct
25 Correct 62 ms 16124 KB Output is correct
26 Correct 60 ms 16064 KB Output is correct
27 Correct 48 ms 16124 KB Output is correct
28 Correct 57 ms 16128 KB Output is correct
29 Correct 57 ms 16076 KB Output is correct
30 Correct 61 ms 16052 KB Output is correct
31 Correct 58 ms 16128 KB Output is correct
32 Correct 61 ms 16112 KB Output is correct
33 Correct 58 ms 16052 KB Output is correct
34 Correct 58 ms 16088 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 58 ms 16052 KB Output is correct
38 Correct 59 ms 16080 KB Output is correct
39 Correct 60 ms 16128 KB Output is correct

Subtask #4
15.0 / 15.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 86 ms 21248 KB Output is correct
6 Correct 66 ms 16368 KB Output is correct
7 Correct 84 ms 21280 KB Output is correct
8 Correct 56 ms 16092 KB Output is correct
9 Correct 91 ms 21292 KB Output is correct
10 Correct 75 ms 18160 KB Output is correct

Subtask #5
20.0 / 20.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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 224 KB Output is correct
8 Correct 0 ms 212 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 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 212 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 212 KB Output is correct
27 Correct 0 ms 296 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 0 ms 304 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 296 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 432 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 436 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 436 KB Output is correct
52 Correct 1 ms 468 KB Output is correct

Subtask #6
15.0 / 15.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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 224 KB Output is correct
8 Correct 0 ms 212 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 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 212 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 212 KB Output is correct
27 Correct 0 ms 296 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 0 ms 304 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 6 ms 1876 KB Output is correct
55 Correct 7 ms 1876 KB Output is correct
56 Correct 58 ms 16100 KB Output is correct
57 Correct 50 ms 16044 KB Output is correct
58 Correct 55 ms 16048 KB Output is correct
59 Correct 62 ms 16124 KB Output is correct
60 Correct 60 ms 16064 KB Output is correct
61 Correct 48 ms 16124 KB Output is correct
62 Correct 57 ms 16128 KB Output is correct
63 Correct 57 ms 16076 KB Output is correct
64 Correct 61 ms 16052 KB Output is correct
65 Correct 58 ms 16128 KB Output is correct
66 Correct 61 ms 16112 KB Output is correct
67 Correct 58 ms 16052 KB Output is correct
68 Correct 58 ms 16088 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 58 ms 16052 KB Output is correct
72 Correct 59 ms 16080 KB Output is correct
73 Correct 60 ms 16128 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 86 ms 21248 KB Output is correct
79 Correct 66 ms 16368 KB Output is correct
80 Correct 84 ms 21280 KB Output is correct
81 Correct 56 ms 16092 KB Output is correct
82 Correct 91 ms 21292 KB Output is correct
83 Correct 75 ms 18160 KB Output is correct
84 Correct 1 ms 300 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 1 ms 304 KB Output is correct
87 Correct 1 ms 296 KB Output is correct
88 Correct 1 ms 468 KB Output is correct
89 Correct 2 ms 468 KB Output is correct
90 Correct 1 ms 468 KB Output is correct
91 Correct 1 ms 468 KB Output is correct
92 Correct 1 ms 468 KB Output is correct
93 Correct 1 ms 468 KB Output is correct
94 Correct 1 ms 432 KB Output is correct
95 Correct 1 ms 468 KB Output is correct
96 Correct 1 ms 436 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 436 KB Output is correct
99 Correct 1 ms 468 KB Output is correct
100 Correct 1 ms 432 KB Output is correct
101 Correct 9 ms 2644 KB Output is correct
102 Correct 8 ms 2132 KB Output is correct
103 Correct 120 ms 22556 KB Output is correct
104 Correct 83 ms 22500 KB Output is correct
105 Correct 89 ms 19872 KB Output is correct
106 Correct 90 ms 22560 KB Output is correct
107 Correct 72 ms 17776 KB Output is correct
108 Correct 67 ms 18240 KB Output is correct
109 Correct 59 ms 17480 KB Output is correct
110 Correct 60 ms 17476 KB Output is correct
111 Correct 101 ms 21700 KB Output is correct
112 Correct 96 ms 21228 KB Output is correct
113 Correct 80 ms 17924 KB Output is correct
114 Correct 88 ms 22548 KB Output is correct
115 Correct 88 ms 22604 KB Output is correct