#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define S second
#define F first
using namespace std;
ll tree[800045];
map < ll, vector<ll> > vc;
void update( ll L, ll R, ll l, ll r, ll node ){
if( L <= l && r <= R ){
tree[node] ++;
return;
}
if( R < l || r < L ){
return;
}
if( R < L ){
return;
}
ll mid = (l+r)/2;
if( tree[node] != -1 ){
tree[node*2] += tree[node];
tree[node*2+1] += tree[node];
tree[node] = -1;
}
update( L, R, l, mid, node*2 );
update( L, R, mid+1, r, node*2+1 );
if( tree[node*2] != tree[node*2+1] )
tree[node] = -1;
else
tree[node] = tree[node*2];
}
ll cnt = 0;
ll query( ll idx, ll l, ll r, ll node ){
if( tree[node] != -1 )
return tree[node];
if( l == r ){
if( l == idx )
return tree[node];
}
ll mid = (l+r)/2;
if( l <= idx && idx <= mid )
return query( idx, l, mid, node*2 );
return query( idx, mid+1, r, node*2+1 );
}
long long count_swaps(std::vector<int> a) {
ll n = a.size()/2;
ll ans = 0;
for(int i = -n; i <= n; i ++ ){
vc[i].pb( 1 );
}
for(int i = 0; i < a.size(); i ++ ){
vc[ a[i] ].pb( i );
}
n = a.size();
for(int i = 0; i < a.size(); i ++ ){
if( a[i] == 0 )
continue;
ll j = vc[ -a[i] ][ vc[a[i]][0] ];
// cout << "real " << i << " " << j << "\n";
a[j] = 0;
ll nj = j + query( j, 0, n-1, 1 );
ll ni = i + query( i, 0, n-1, 1 );
// cout << "new " << ni << " " << nj << "\n";
ans += nj-ni;
if( a[i] < 0 )
ans --;
// cout << "updated" << i+1 << " " << j-1 << "\n";
update( i+1, j-1, 0, n-1, 1 );
vc[ a[i] ][ 0 ] ++;
vc[ -a[j] ][ 0 ] ++;
}
return ans;
}
Compilation message
shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:56:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
56 | for(int i = 0; i < a.size(); i ++ ){
| ~~^~~~~~~~~~
shoes.cpp:60:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
60 | for(int i = 0; i < a.size(); i ++ ){
| ~~^~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 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 |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 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 |
1 ms |
348 KB |
Output is correct |
14 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
15 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
600 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
280 ms |
28756 KB |
Output is correct |
6 |
Correct |
273 ms |
32144 KB |
Output is correct |
7 |
Correct |
288 ms |
29284 KB |
Output is correct |
8 |
Correct |
128 ms |
31460 KB |
Output is correct |
9 |
Correct |
294 ms |
29584 KB |
Output is correct |
10 |
Correct |
272 ms |
32596 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 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 |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 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 |
1 ms |
348 KB |
Output is correct |
14 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
15 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 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 |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 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 |
1 ms |
348 KB |
Output is correct |
14 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
15 |
Halted |
0 ms |
0 KB |
- |