Submission #1166394

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166394		monkey133	Swap Swap Sort (CCO21_day1problem1)	C++20	25 / 25	2848 ms	143464 KiB

Main

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll n, k, q,ans = 0;
ll p[100005], a[100005];
vector<ll> idx[100005];
map<pi, ll> dp;

vector<ll> fenwick(100005,0);

ll ps(ll i)
{
	ll sum=0;
	while (i>0)
	{
		sum+=fenwick[i];
		i-=i&(-i);
	}
	return sum;
}
void update(ll i, ll v)
{
	while (i<=100005)
	{
		fenwick[i]+=v;
		i+=i&(-i);
	}
}

ll swap01(ll a, ll b)
{
	if (idx[a].size() > idx[b].size()) return - swap01(b,a);
	if (dp.find(mp(a, b))!=dp.end()) return dp[mp(a, b)];
	ll res = 0;
	for (ll u: idx[a])
	{
		ll le = lb(all(idx[b]), u)-idx[b].begin();
		ll ri = idx[b].size()- le;
		res += ri-le;
	}
	dp[mp(b,a)] = -res;
	return dp[mp(a, b)] = res;
}

int main()
{
	cin.tie(nullptr);
	cout.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n >> k >> q;
	for (ll i=0; i<n; ++i) 
	{
		cin >> a[i];
		idx[a[i]].pb(i);
	}
	for (ll i=0; i<n; ++i) 
	{
		ans += i - ps(a[i]);
		update(a[i], 1);
	}
	for (ll i=1; i<=k; ++i) p[i] = i;
	//show(ans);
	while (q--)
	{
		ll v; cin >> v;
		ans += swap01(p[v], p[v+1]);
		swap(p[v], p[v + 1]);
		cout << ans << endl;
	}
	return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 5 / 5
• Subtask 4: 14 / 14