Submission #958032

#	Time	Username	Problem	Language	Result	Execution time	Memory
958032		suren	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	394 ms	35672 KiB

shoes

#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];
ll lazy[800045];
map < ll, vector<ll> > vc;
void update( ll L, ll R, ll l, ll r, ll node ){
//	cout << "range:" << l << " " << r << "\n";
	if( L <= l && r <= R ){
//		cout << "	" << l << " " << r << " " << node << "\n"; 
//		if( l == r )
//			tree[node] ++;
//		else
			lazy[node] ++;
		return;
	}
	if( R < l || r < L )
		return;
	if( R < L )
		return;
	ll mid = (l+r)/2;
	update( L, R, l, mid, node*2 );
	update( L, R, mid+1, r, node*2+1 );
}
ll cnt = 0;
ll query( ll idx, ll l, ll r, ll node ){
	if( l == r ){
		tree[node] += lazy[node];
		lazy[node] = 0;
		return tree[node];
	}
	lazy[node*2] += lazy[node];
	lazy[node*2+1] += lazy[node];
	lazy[node] = 0;
	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 << "num " << a[i] << "\n";
//		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[i] ][ 0 ] ++;
//		cout << "tree\n";
//		for(int k = 1; k <= 33; k ++ ){
//			cout << k << ":" << tree[k] << " ";
//		}
//		for(int k = 40; k <= 41; k ++ ){
//			cout << k << ":" << tree[k] << " ";
//		}
//		for(int k = 48; k <= 49; k ++ ){
//			cout << k << ":" << tree[k] << " ";
//		}
//		for(int k = 56; k <= 57; k ++ ){
//			cout << k << ":" << tree[k] << " ";
//		}
//		cout << "\n";
//		cout << "lazy\n";
//		for(int k = 1; k <= 33; k ++ ){
//			cout << k << ":" << lazy[k] << " ";
//		}
//		for(int k = 40; k <= 41; k ++ ){
//			cout << k << ":" << lazy[k] << " ";
//		}
//		for(int k = 48; k <= 49; k ++ ){
//			cout << k << ":" << lazy[k] << " ";
//		}
//		for(int k = 56; k <= 57; k ++ ){
//			cout << k << ":" << lazy[k] << " ";
//		}
//		cout << "\n";
	}
	return ans;
}

Compilation message (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:52:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for(int i = 0; i < a.size(); i ++ ){
      |                 ~~^~~~~~~~~~
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 ++ ){
      |                 ~~^~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 15 / 15