oj.uz

Submission #416673

# Submission time Handle Problem Language Result Execution time Memory
416673 2021-06-02T18:05:28 Z inksamurai Swap Swap Sort (CCO21_day1problem1) C++17
25 / 25
 3662 ms 82376 KB 
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip> 
#include <stdio.h>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define PI 3.14159265359
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define ll long long
#define all(c) (c).begin(),(c).end()
#define sz(c) (ll)(c).size()
#define mkp(a,b) make_pair(a,b)
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define rsz(a,n) a.resize(n)
#define pii pair <ll,ll>
#define rep(i,n) for(int i = 0 ; i < n ; i++) 
#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(int i = x ; i < n ; i++)
#define vi vector <ll> 
#define vec(s) vector<s>
#define rsz(a,n) a.resize(n)
#define rszv(a,n,v) a.resize(n,v)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
 
const int max_n = 103002;
 
using namespace std;

struct fnw {
private:
    ll n;
    vector <ll> bit;
 
public:
    fnw(ll m) {
        n=m;
        bit.resize(n+2,0);
    }
    ll get(ll i) {
        ll s = 0;
        // while (i > 0) { s += bit[i]; i -= i & -i; }
        while(i <= n) { s += bit[i]; i += i & -i;  }
        return s;
    }
    void add(ll i,ll x) {
        while(i > 0) { bit[i] += x; i -= i & -i; }
        // while (i <= n) { bit[i] += x; i += i & -i; }
    }
};
 
int n,k,q;
vi a,inarg;
vi inds[max_n];
ll frq[max_n];
 
map <pii,ll> memo;

ll cntinv=0;
bool swpd=0;

ll f(ll x,ll y) {
	
	if(frq[x]>frq[y]) {swap(x,y);swpd=1;}

    if(memo.find({x,y})!=memo.end()) return memo[{x,y}];

    ll cnw=0;

    for(auto i : inds[x]) {
        auto it=lower_bound(all(inds[y]),i);
        if(it==inds[y].begin()) continue;
        it=prev(it);
        ll j=it-inds[y].begin();
        cnw += (j+1);
    }

    return memo[{x,y}] = cnw;
}
 
int main(){
fcin;
    cin>>n>>k>>q;
    a.resize(n,0);
    fnw bit(k);
    
    ll cinv=0;
 
    rep(i,n) {
        cin>>a[i];
        cinv += bit.get(a[i]);
        bit.add(a[i]-1,1);
        inds[a[i]].pb(i);
        frq[a[i]]++;
    }
 
    rep(i,k) inarg.pb(i+1);
   
  	cntinv=cinv;

    rep(_,q) {
        int j;
        cin>>j;
        j--;
        int x=inarg[j],y=inarg[j+1],cnt=0;
        swpd=0;
        ll cnw=f(y,x);

        if(swpd) {cntinv+=frq[x]*frq[y]; cntinv -= 2*cnw; }
	    else { cntinv-=frq[x]*frq[y]; cntinv += 2*cnw; }
        
        swap(inarg[j],inarg[j+1]);
 
        cout<<cntinv<<"\n";
    }
 
/*
*/
 
    return 0;   
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:126:37: warning: unused variable 'cnt' [-Wunused-variable]
  126 |         int x=inarg[j],y=inarg[j+1],cnt=0;
      |                                     ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2744 KB Output is correct
2 Correct 3 ms 2892 KB Output is correct
3 Correct 4 ms 2892 KB Output is correct
4 Correct 6 ms 2892 KB Output is correct
5 Correct 5 ms 2892 KB Output is correct
6 Correct 6 ms 3020 KB Output is correct
7 Correct 6 ms 3124 KB Output is correct
8 Correct 6 ms 3276 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 4756 KB Output is correct
2 Correct 16 ms 4916 KB Output is correct
3 Correct 16 ms 4852 KB Output is correct
4 Correct 15 ms 5092 KB Output is correct
5 Correct 20 ms 5416 KB Output is correct
6 Correct 22 ms 5828 KB Output is correct
7 Correct 26 ms 7264 KB Output is correct
8 Correct 35 ms 8928 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 16032 KB Output is correct
2 Correct 226 ms 15924 KB Output is correct
3 Correct 363 ms 16008 KB Output is correct
4 Correct 624 ms 16388 KB Output is correct
5 Correct 793 ms 18116 KB Output is correct
6 Correct 808 ms 18344 KB Output is correct
7 Correct 780 ms 18172 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2744 KB Output is correct
2 Correct 3 ms 2892 KB Output is correct
3 Correct 4 ms 2892 KB Output is correct
4 Correct 6 ms 2892 KB Output is correct
5 Correct 5 ms 2892 KB Output is correct
6 Correct 6 ms 3020 KB Output is correct
7 Correct 6 ms 3124 KB Output is correct
8 Correct 6 ms 3276 KB Output is correct
9 Correct 16 ms 4756 KB Output is correct
10 Correct 16 ms 4916 KB Output is correct
11 Correct 16 ms 4852 KB Output is correct
12 Correct 15 ms 5092 KB Output is correct
13 Correct 20 ms 5416 KB Output is correct
14 Correct 22 ms 5828 KB Output is correct
15 Correct 26 ms 7264 KB Output is correct
16 Correct 35 ms 8928 KB Output is correct
17 Correct 221 ms 16032 KB Output is correct
18 Correct 226 ms 15924 KB Output is correct
19 Correct 363 ms 16008 KB Output is correct
20 Correct 624 ms 16388 KB Output is correct
21 Correct 793 ms 18116 KB Output is correct
22 Correct 808 ms 18344 KB Output is correct
23 Correct 780 ms 18172 KB Output is correct
24 Correct 758 ms 19424 KB Output is correct
25 Correct 772 ms 20704 KB Output is correct
26 Correct 831 ms 23564 KB Output is correct
27 Correct 928 ms 26728 KB Output is correct
28 Correct 1066 ms 30700 KB Output is correct
29 Correct 1258 ms 39376 KB Output is correct
30 Correct 1402 ms 48304 KB Output is correct
31 Correct 1357 ms 48396 KB Output is correct
32 Correct 703 ms 82360 KB Output is correct
33 Correct 1022 ms 19568 KB Output is correct
34 Correct 1145 ms 21188 KB Output is correct
35 Correct 1303 ms 23032 KB Output is correct
36 Correct 1717 ms 32920 KB Output is correct
37 Correct 2896 ms 78200 KB Output is correct
38 Correct 2488 ms 79084 KB Output is correct
39 Correct 2007 ms 82376 KB Output is correct
40 Correct 1792 ms 60836 KB Output is correct
41 Correct 1632 ms 66424 KB Output is correct
42 Correct 1389 ms 81860 KB Output is correct
43 Correct 1520 ms 81500 KB Output is correct
44 Correct 1657 ms 81904 KB Output is correct
45 Correct 1574 ms 82008 KB Output is correct
46 Correct 1774 ms 62248 KB Output is correct
47 Correct 2007 ms 69224 KB Output is correct
48 Correct 3662 ms 81404 KB Output is correct
49 Correct 3250 ms 80512 KB Output is correct
50 Correct 929 ms 81760 KB Output is correct
51 Correct 833 ms 81300 KB Output is correct
52 Correct 842 ms 81144 KB Output is correct
53 Correct 1073 ms 80920 KB Output is correct
54 Correct 1098 ms 80824 KB Output is correct
55 Correct 2 ms 2636 KB Output is correct