oj.uz

Submission #230205

# Submission time Handle Problem Language Result Execution time Memory
230205 2020-05-09T04:39:29 Z Masterdan Arranging Shoes (IOI19_shoes) C++14
100 / 100
 651 ms 50080 KB 
#include <bits/stdc++.h>
#define MAX 1e9+7
#define MIN -1
#define all(a)  a.begin (),a.end ()
#define pb  push_back
#define mp  make_pair
#define mem(a, c) memset(a, c, sizeof(a))
#define F first
#define S second
#define PI 3.141592653589
#define SMAX 1e18+7
using namespace std;
typedef vector <int> vi;
typedef pair<int, int> ii;
typedef vector <ii> vii;
typedef long long ll;
typedef double db;
int tree[800200];

void update(int node, int in, int fin, int pos) {
  if (pos < in || pos >= fin) {
    return;
  }
  tree[node] += 1;
  if (in + 1 != fin) {
    int mid = in + (fin - in) / 2;
    update(2 * node + 1, in, mid, pos);
    update(2 * node + 2, mid, fin, pos);
  }
}

ll query(int node, int in, int fin, int l, int r) {
  if (fin <= l || r <= in) {
    return 0;
  }
  if (l <= in && fin <= r) {
    return tree[node];
  }
  int mid = in + (fin - in) / 2;
  return query(2 * node + 1, in, mid, l, r) +query(2 * node + 2, mid, fin, l, r);
}

ll count_swaps(vi a) {
  int n = a.size() / 2;
  ll ans = 0;
  map<int, vi> last;
  vi pr(2 * n, -1);
  for (int i = 2 * n - 1; i >= 0; i--) {
    last[a[i]].pb(i);
  }
  for (int i = 0; i < 2 * n; i++) {
    if (pr[i] != -1)
      continue;
    pr[i] = last[-a[i]].back();
    last[-a[i]].pop_back();
    last[a[i]].pop_back();
    ans += abs(pr[i] - i) - 1;
    if ((pr[i] > i) != (a[pr[i]] > a[i])) {
      ans++;
    }
    pr[pr[i]] = i;
  }
  vector<vi> q;
  for (int i = 0; i < 2 * n; i++) {
    q.pb({i});
    if (pr[i] > i) {
      q.pb({i, pr[i] + 1, -1});
      q.pb({pr[i], pr[i] + 1, 1});
    }
  }
  mem(tree, 0);
  sort(all(q));
  for (int i=0;i<q.size ();i++) {
    vi v3=q[i];
    if (v3.size() == 1) {
      update(0, 0, 2 * n, pr[v3[0]]);
    } else {
      int x = query(0, 0, 2 * n, v3[1], 2 * n);
      ans -= x * v3[2];
    }
  }
  return ans;
}

/*
using namespace std;

int main() {
	int n;
	assert(1 == scanf("%d", &n));
	vector<int> S(2 * n);
	for (int i = 0; i < 2 * n; i++)
		assert(1 == scanf("%d", &S[i]));
	fclose(stdin);

	long long result = count_swaps(S);

	printf("%lld\n", result);
	fclose(stdout);
	return 0;
}
*/

Compilation message

shoes.cpp: In function 'll count_swaps(vi)':
shoes.cpp:73:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0;i<q.size ();i++) {
                ~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3584 KB Output is correct
2 Correct 6 ms 3456 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3584 KB Output is correct
2 Correct 6 ms 3456 KB Output is correct
3 Correct 7 ms 3456 KB Output is correct
4 Correct 6 ms 3456 KB Output is correct
5 Correct 6 ms 3456 KB Output is correct
6 Correct 6 ms 3456 KB Output is correct
7 Correct 7 ms 3456 KB Output is correct
8 Correct 6 ms 3456 KB Output is correct
9 Correct 7 ms 3456 KB Output is correct
10 Correct 7 ms 3456 KB Output is correct
11 Correct 7 ms 3456 KB Output is correct
12 Correct 6 ms 3456 KB Output is correct
13 Correct 7 ms 3456 KB Output is correct
14 Correct 6 ms 3456 KB Output is correct
15 Correct 6 ms 3456 KB Output is correct
16 Correct 6 ms 3456 KB Output is correct
17 Correct 6 ms 3456 KB Output is correct
18 Correct 6 ms 3456 KB Output is correct
19 Correct 6 ms 3456 KB Output is correct
20 Correct 6 ms 3456 KB Output is correct
21 Correct 6 ms 3456 KB Output is correct
22 Correct 6 ms 3456 KB Output is correct
23 Correct 6 ms 3456 KB Output is correct
24 Correct 7 ms 3584 KB Output is correct
25 Correct 7 ms 3456 KB Output is correct
26 Correct 6 ms 3456 KB Output is correct
27 Correct 6 ms 3456 KB Output is correct
28 Correct 6 ms 3456 KB Output is correct
29 Correct 6 ms 3456 KB Output is correct
30 Correct 6 ms 3456 KB Output is correct
31 Correct 6 ms 3456 KB Output is correct
32 Correct 6 ms 3456 KB Output is correct
33 Correct 6 ms 3456 KB Output is correct
34 Correct 6 ms 3456 KB Output is correct
35 Correct 6 ms 3456 KB Output is correct
36 Correct 6 ms 3456 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3584 KB Output is correct
2 Correct 6 ms 3456 KB Output is correct
3 Correct 6 ms 3456 KB Output is correct
4 Correct 6 ms 3456 KB Output is correct
5 Correct 6 ms 3456 KB Output is correct
6 Correct 6 ms 3456 KB Output is correct
7 Correct 6 ms 3456 KB Output is correct
8 Correct 6 ms 3456 KB Output is correct
9 Correct 6 ms 3456 KB Output is correct
10 Correct 6 ms 3456 KB Output is correct
11 Correct 6 ms 3456 KB Output is correct
12 Correct 6 ms 3456 KB Output is correct
13 Correct 6 ms 3456 KB Output is correct
14 Correct 6 ms 3456 KB Output is correct
15 Correct 6 ms 3456 KB Output is correct
16 Correct 7 ms 3456 KB Output is correct
17 Correct 7 ms 3584 KB Output is correct
18 Correct 8 ms 3712 KB Output is correct
19 Correct 8 ms 3712 KB Output is correct
20 Correct 23 ms 5940 KB Output is correct
21 Correct 21 ms 5940 KB Output is correct
22 Correct 189 ms 28520 KB Output is correct
23 Correct 163 ms 28760 KB Output is correct
24 Correct 171 ms 28788 KB Output is correct
25 Correct 180 ms 28764 KB Output is correct
26 Correct 185 ms 28752 KB Output is correct
27 Correct 155 ms 28760 KB Output is correct
28 Correct 197 ms 28764 KB Output is correct
29 Correct 180 ms 28904 KB Output is correct
30 Correct 186 ms 28892 KB Output is correct
31 Correct 172 ms 28784 KB Output is correct
32 Correct 179 ms 28756 KB Output is correct
33 Correct 186 ms 28764 KB Output is correct
34 Correct 182 ms 28764 KB Output is correct
35 Correct 6 ms 3456 KB Output is correct
36 Correct 6 ms 3456 KB Output is correct
37 Correct 176 ms 28756 KB Output is correct
38 Correct 186 ms 28764 KB Output is correct
39 Correct 184 ms 28764 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3456 KB Output is correct
2 Correct 7 ms 3584 KB Output is correct
3 Correct 6 ms 3456 KB Output is correct
4 Correct 6 ms 3456 KB Output is correct
5 Correct 587 ms 49672 KB Output is correct
6 Correct 286 ms 30712 KB Output is correct
7 Correct 543 ms 49952 KB Output is correct
8 Correct 180 ms 28892 KB Output is correct
9 Correct 536 ms 50080 KB Output is correct
10 Correct 374 ms 39044 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3584 KB Output is correct
2 Correct 6 ms 3456 KB Output is correct
3 Correct 7 ms 3456 KB Output is correct
4 Correct 6 ms 3456 KB Output is correct
5 Correct 6 ms 3456 KB Output is correct
6 Correct 6 ms 3456 KB Output is correct
7 Correct 7 ms 3456 KB Output is correct
8 Correct 6 ms 3456 KB Output is correct
9 Correct 7 ms 3456 KB Output is correct
10 Correct 7 ms 3456 KB Output is correct
11 Correct 7 ms 3456 KB Output is correct
12 Correct 6 ms 3456 KB Output is correct
13 Correct 7 ms 3456 KB Output is correct
14 Correct 6 ms 3456 KB Output is correct
15 Correct 6 ms 3456 KB Output is correct
16 Correct 6 ms 3456 KB Output is correct
17 Correct 6 ms 3456 KB Output is correct
18 Correct 6 ms 3456 KB Output is correct
19 Correct 6 ms 3456 KB Output is correct
20 Correct 6 ms 3456 KB Output is correct
21 Correct 6 ms 3456 KB Output is correct
22 Correct 6 ms 3456 KB Output is correct
23 Correct 6 ms 3456 KB Output is correct
24 Correct 7 ms 3584 KB Output is correct
25 Correct 7 ms 3456 KB Output is correct
26 Correct 6 ms 3456 KB Output is correct
27 Correct 6 ms 3456 KB Output is correct
28 Correct 6 ms 3456 KB Output is correct
29 Correct 6 ms 3456 KB Output is correct
30 Correct 6 ms 3456 KB Output is correct
31 Correct 6 ms 3456 KB Output is correct
32 Correct 6 ms 3456 KB Output is correct
33 Correct 6 ms 3456 KB Output is correct
34 Correct 6 ms 3456 KB Output is correct
35 Correct 6 ms 3456 KB Output is correct
36 Correct 6 ms 3456 KB Output is correct
37 Correct 6 ms 3456 KB Output is correct
38 Correct 7 ms 3456 KB Output is correct
39 Correct 6 ms 3456 KB Output is correct
40 Correct 8 ms 3584 KB Output is correct
41 Correct 8 ms 3840 KB Output is correct
42 Correct 8 ms 3876 KB Output is correct
43 Correct 9 ms 3840 KB Output is correct
44 Correct 8 ms 3840 KB Output is correct
45 Correct 10 ms 3840 KB Output is correct
46 Correct 9 ms 3840 KB Output is correct
47 Correct 8 ms 3840 KB Output is correct
48 Correct 8 ms 3712 KB Output is correct
49 Correct 8 ms 3712 KB Output is correct
50 Correct 9 ms 3712 KB Output is correct
51 Correct 8 ms 3712 KB Output is correct
52 Correct 10 ms 3840 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3584 KB Output is correct
2 Correct 6 ms 3456 KB Output is correct
3 Correct 7 ms 3456 KB Output is correct
4 Correct 6 ms 3456 KB Output is correct
5 Correct 6 ms 3456 KB Output is correct
6 Correct 6 ms 3456 KB Output is correct
7 Correct 7 ms 3456 KB Output is correct
8 Correct 6 ms 3456 KB Output is correct
9 Correct 7 ms 3456 KB Output is correct
10 Correct 7 ms 3456 KB Output is correct
11 Correct 7 ms 3456 KB Output is correct
12 Correct 6 ms 3456 KB Output is correct
13 Correct 7 ms 3456 KB Output is correct
14 Correct 6 ms 3456 KB Output is correct
15 Correct 6 ms 3456 KB Output is correct
16 Correct 6 ms 3456 KB Output is correct
17 Correct 6 ms 3456 KB Output is correct
18 Correct 6 ms 3456 KB Output is correct
19 Correct 6 ms 3456 KB Output is correct
20 Correct 6 ms 3456 KB Output is correct
21 Correct 6 ms 3456 KB Output is correct
22 Correct 6 ms 3456 KB Output is correct
23 Correct 6 ms 3456 KB Output is correct
24 Correct 7 ms 3584 KB Output is correct
25 Correct 7 ms 3456 KB Output is correct
26 Correct 6 ms 3456 KB Output is correct
27 Correct 6 ms 3456 KB Output is correct
28 Correct 6 ms 3456 KB Output is correct
29 Correct 6 ms 3456 KB Output is correct
30 Correct 6 ms 3456 KB Output is correct
31 Correct 6 ms 3456 KB Output is correct
32 Correct 6 ms 3456 KB Output is correct
33 Correct 6 ms 3456 KB Output is correct
34 Correct 6 ms 3456 KB Output is correct
35 Correct 6 ms 3456 KB Output is correct
36 Correct 6 ms 3456 KB Output is correct
37 Correct 6 ms 3456 KB Output is correct
38 Correct 6 ms 3456 KB Output is correct
39 Correct 6 ms 3456 KB Output is correct
40 Correct 6 ms 3456 KB Output is correct
41 Correct 6 ms 3456 KB Output is correct
42 Correct 6 ms 3456 KB Output is correct
43 Correct 6 ms 3456 KB Output is correct
44 Correct 6 ms 3456 KB Output is correct
45 Correct 6 ms 3456 KB Output is correct
46 Correct 6 ms 3456 KB Output is correct
47 Correct 6 ms 3456 KB Output is correct
48 Correct 6 ms 3456 KB Output is correct
49 Correct 6 ms 3456 KB Output is correct
50 Correct 7 ms 3456 KB Output is correct
51 Correct 7 ms 3584 KB Output is correct
52 Correct 8 ms 3712 KB Output is correct
53 Correct 8 ms 3712 KB Output is correct
54 Correct 23 ms 5940 KB Output is correct
55 Correct 21 ms 5940 KB Output is correct
56 Correct 189 ms 28520 KB Output is correct
57 Correct 163 ms 28760 KB Output is correct
58 Correct 171 ms 28788 KB Output is correct
59 Correct 180 ms 28764 KB Output is correct
60 Correct 185 ms 28752 KB Output is correct
61 Correct 155 ms 28760 KB Output is correct
62 Correct 197 ms 28764 KB Output is correct
63 Correct 180 ms 28904 KB Output is correct
64 Correct 186 ms 28892 KB Output is correct
65 Correct 172 ms 28784 KB Output is correct
66 Correct 179 ms 28756 KB Output is correct
67 Correct 186 ms 28764 KB Output is correct
68 Correct 182 ms 28764 KB Output is correct
69 Correct 6 ms 3456 KB Output is correct
70 Correct 6 ms 3456 KB Output is correct
71 Correct 176 ms 28756 KB Output is correct
72 Correct 186 ms 28764 KB Output is correct
73 Correct 184 ms 28764 KB Output is correct
74 Correct 7 ms 3456 KB Output is correct
75 Correct 7 ms 3584 KB Output is correct
76 Correct 6 ms 3456 KB Output is correct
77 Correct 6 ms 3456 KB Output is correct
78 Correct 587 ms 49672 KB Output is correct
79 Correct 286 ms 30712 KB Output is correct
80 Correct 543 ms 49952 KB Output is correct
81 Correct 180 ms 28892 KB Output is correct
82 Correct 536 ms 50080 KB Output is correct
83 Correct 374 ms 39044 KB Output is correct
84 Correct 6 ms 3456 KB Output is correct
85 Correct 7 ms 3456 KB Output is correct
86 Correct 6 ms 3456 KB Output is correct
87 Correct 8 ms 3584 KB Output is correct
88 Correct 8 ms 3840 KB Output is correct
89 Correct 8 ms 3876 KB Output is correct
90 Correct 9 ms 3840 KB Output is correct
91 Correct 8 ms 3840 KB Output is correct
92 Correct 10 ms 3840 KB Output is correct
93 Correct 9 ms 3840 KB Output is correct
94 Correct 8 ms 3840 KB Output is correct
95 Correct 8 ms 3712 KB Output is correct
96 Correct 8 ms 3712 KB Output is correct
97 Correct 9 ms 3712 KB Output is correct
98 Correct 8 ms 3712 KB Output is correct
99 Correct 10 ms 3840 KB Output is correct
100 Correct 9 ms 3968 KB Output is correct
101 Correct 40 ms 7988 KB Output is correct
102 Correct 31 ms 6452 KB Output is correct
103 Correct 651 ms 49952 KB Output is correct
104 Correct 458 ms 49948 KB Output is correct
105 Correct 474 ms 40632 KB Output is correct
106 Correct 514 ms 49924 KB Output is correct
107 Correct 284 ms 31196 KB Output is correct
108 Correct 311 ms 33368 KB Output is correct
109 Correct 193 ms 28824 KB Output is correct
110 Correct 182 ms 28768 KB Output is correct
111 Correct 526 ms 47512 KB Output is correct
112 Correct 579 ms 45064 KB Output is correct
113 Correct 341 ms 31480 KB Output is correct
114 Correct 498 ms 49952 KB Output is correct
115 Correct 483 ms 49944 KB Output is correct