oj.uz

Submission #851875

# Submission time Handle Problem Language Result Execution time Memory
851875 2023-09-20T17:51:56 Z NaimSS Swap Swap Sort (CCO21_day1problem1) C++14
25 / 25
 3375 ms 149268 KB 
#include <bits/stdc++.h>
// #define int long long
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v)),v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
// std::mt19937_64 rng64((int) std::chrono::steady_clock::now().time_since_epoch().count());
std::mt19937 rng(
  
//  (int) std::chrono::steady_clock::now().time_since_epoch().count()
   1239010
);


ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
//inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
    b%=m;
    ll ans = 1;
    for (; e; b = b * b % m, e /= 2)
        if (e & 1) ans = ans * b % m;
    return ans;
}
 
// debug:
template<class T>void print_vector(vector<T> &v){
    rep(i,0,sz(v))cout<<v[i]<<" \n"[i==sz(v)-1];
}
void dbg_out() {cerr << endl; }
template<typename Head, typename ... Tail> void dbg_out(Head H,Tail... T){
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__), cerr << endl
#else
#define dbg(...) 42
#endif
//

int n,k,q;
const int N = 100100;
int a[N];
int cnt[N];
vi posi[N];

map<pii,ll> Cnt;

const int MAGIC = 500;

ll solve(int i,int j){
    if(Cnt.count({i,j}))return Cnt[{i,j}];
    ll res=0;
    int sw=0;
    if(sz(posi[i]) > sz(posi[j]))swap(i,j),sw = 1;
    
    if(max(sz(posi[i]), sz(posi[j])) > MAGIC){

        int tam = sz(posi[j]);
        for(int p : posi[i]){
            int k = lower_bound(all(posi[j]), p) - posi[j].begin();
            res += tam - k;
        }
    }else{
        int k = 0;
        int tam = sz(posi[j]);
        for(int p : posi[i]){
            while(k < sz(posi[j]) && posi[j][k] < p)
                k++;
            res += tam - k;
        }
    }
    if(sw){
        swap(i,j);
        res = cnt[i] * (ll)cnt[j] - res;
    }
    Cnt[{j,i}] = cnt[i] * (ll)cnt[j] - res;
    return Cnt[{i,j}] = res;
}

struct BIT{
    vi bit;int n;
    BIT(int _n){
        n = _n;
        bit.resize(n+10);
    }
    int sum(int x){
        int res=0;
        for(; x > 0; x-= (x&-x))res += bit[x];
        return res;
    }
    void upd(int x,int v){
        for(; x <= n; x += (x&-x))
            bit[x] += v;
    }

};

int32_t main(){
    fastio;
    cin >> n >> k >> q;
    ll inv = 0;
    BIT bit(n+1);
    rep(i,1,n+1){
        cin >> a[i];
        bit.upd(a[i], 1);
        inv += i - bit.sum(a[i]);
        cnt[a[i]]++;
        posi[a[i]].pb(i);
    }
    vi target(k+1);
    rep(i,1,k+1)target[i] = i;

    while(q--){
        int j;
        cin >> j;
        inv += solve(target[j], target[j+1]) - solve(target[j+1], target[j]);
        swap(target[j], target[j+1]);
        cout << inv << endl;
    }
    
    // math -> gcd it all
    // Did you swap N,M? N=1?
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 3 ms 2904 KB Output is correct
5 Correct 4 ms 2904 KB Output is correct
6 Correct 5 ms 3164 KB Output is correct
7 Correct 6 ms 3084 KB Output is correct
8 Correct 5 ms 3420 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4244 KB Output is correct
2 Correct 12 ms 4444 KB Output is correct
3 Correct 12 ms 4440 KB Output is correct
4 Correct 10 ms 4508 KB Output is correct
5 Correct 12 ms 4696 KB Output is correct
6 Correct 13 ms 4952 KB Output is correct
7 Correct 16 ms 5724 KB Output is correct
8 Correct 15 ms 6748 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 17212 KB Output is correct
2 Correct 162 ms 17396 KB Output is correct
3 Correct 322 ms 17884 KB Output is correct
4 Correct 664 ms 18864 KB Output is correct
5 Correct 754 ms 22988 KB Output is correct
6 Correct 772 ms 23376 KB Output is correct
7 Correct 754 ms 23120 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 3 ms 2904 KB Output is correct
5 Correct 4 ms 2904 KB Output is correct
6 Correct 5 ms 3164 KB Output is correct
7 Correct 6 ms 3084 KB Output is correct
8 Correct 5 ms 3420 KB Output is correct
9 Correct 10 ms 4244 KB Output is correct
10 Correct 12 ms 4444 KB Output is correct
11 Correct 12 ms 4440 KB Output is correct
12 Correct 10 ms 4508 KB Output is correct
13 Correct 12 ms 4696 KB Output is correct
14 Correct 13 ms 4952 KB Output is correct
15 Correct 16 ms 5724 KB Output is correct
16 Correct 15 ms 6748 KB Output is correct
17 Correct 144 ms 17212 KB Output is correct
18 Correct 162 ms 17396 KB Output is correct
19 Correct 322 ms 17884 KB Output is correct
20 Correct 664 ms 18864 KB Output is correct
21 Correct 754 ms 22988 KB Output is correct
22 Correct 772 ms 23376 KB Output is correct
23 Correct 754 ms 23120 KB Output is correct
24 Correct 803 ms 25464 KB Output is correct
25 Correct 879 ms 28460 KB Output is correct
26 Correct 1014 ms 33520 KB Output is correct
27 Correct 1040 ms 38860 KB Output is correct
28 Correct 1225 ms 46148 KB Output is correct
29 Correct 1521 ms 59260 KB Output is correct
30 Correct 1594 ms 71320 KB Output is correct
31 Correct 1685 ms 71312 KB Output is correct
32 Correct 1151 ms 148560 KB Output is correct
33 Correct 926 ms 25644 KB Output is correct
34 Correct 1004 ms 28896 KB Output is correct
35 Correct 1166 ms 32644 KB Output is correct
36 Correct 1836 ms 52492 KB Output is correct
37 Correct 3067 ms 143992 KB Output is correct
38 Correct 3197 ms 145468 KB Output is correct
39 Correct 2735 ms 149268 KB Output is correct
40 Correct 1745 ms 98316 KB Output is correct
41 Correct 1844 ms 110688 KB Output is correct
42 Correct 1726 ms 148176 KB Output is correct
43 Correct 1779 ms 146912 KB Output is correct
44 Correct 2125 ms 148536 KB Output is correct
45 Correct 1882 ms 148428 KB Output is correct
46 Correct 1726 ms 100092 KB Output is correct
47 Correct 1883 ms 115328 KB Output is correct
48 Correct 3317 ms 147580 KB Output is correct
49 Correct 3375 ms 147208 KB Output is correct
50 Correct 1348 ms 148180 KB Output is correct
51 Correct 1281 ms 147328 KB Output is correct
52 Correct 1300 ms 147428 KB Output is correct
53 Correct 1536 ms 148228 KB Output is correct
54 Correct 1581 ms 148344 KB Output is correct
55 Correct 1 ms 2648 KB Output is correct