oj.uz

Submission #696418

# Submission time Handle Problem Language Result Execution time Memory
696418 2023-02-06T12:57:09 Z benedict0724 Swap Swap Sort (CCO21_day1problem1) C++17
25 / 25
 1049 ms 55680 KB 
#include <iostream>
#include <stack>
#include <string>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cassert>

using namespace std;
typedef long long ll;

int T[100002], n, k, q;
int A[100002], per[100002];
int num[100002];
vector<int> idx[100002];
ll cnt[100002];
vector<vector<ll>> pre;

void upd(int x, int v)
{
    for(int i=x;i<=n;i+=(i&-i)) T[i] += v;
}

int f(int x)
{
    int ret = 0;
    for(int i=x;i;i^=(i&-i)) ret += T[i];
    return ret;
}

int main()
{
    ios::sync_with_stdio(false); cin.tie(NULL);
    cin >> n >> k >> q;
    for(int i=1;i<=k;i++) per[i] = i;
    
    int B = 100;
    
    ll ans = 0;
    for(int i=0;i<n;i++)
    {
        cin >> A[i];
        
        upd(A[i], 1);
        ans += i + 1 - f(A[i]);
        
        idx[A[i]].push_back(i);
        cnt[A[i]]++;
    }
    
    int asdf = 0;
    for(int i=1;i<=k;i++)
    {
        if(cnt[i] > B)
        {
            vector<ll> v(k+1);
            ll now = 0;
            for(int j=0;j<n;j++)
            {
                if(A[j] == i) now++;
                else v[A[j]] += now;
            }
            pre.push_back(v);
            num[i] = asdf++;
        }
    }
    
    for(int i=1;i<=q;i++)
    {
        int x; cin >> x;
        int a = per[x], b = per[x+1];
        
        swap(per[x], per[x+1]);
        
        if(cnt[a] > B)
        {
            ans -= cnt[a] * cnt[b];
            ans += 2 * pre[num[a]][b];
            
            cout << ans << "\n";
            continue;
        }
        if(cnt[b] > B)
        {
            ans -= 2 * pre[num[b]][a];
            ans += cnt[a] * cnt[b];
            
            cout << ans << "\n";
            continue;
        }
        
        ll tmp = 0;
        for(int t1=0,t2=0;t2<cnt[b];)
        {
            if(t1 == cnt[a])
            {
                t2++;
                tmp += t1;
            }
            else if(idx[a][t1] < idx[b][t2]) t1++;
            else
            {
                t2++;
                tmp += t1;
            }
        }
        ans += 2 * tmp;
        ans -= cnt[a] * cnt[b];
        cout << ans << "\n";
    }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2820 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 3 ms 2784 KB Output is correct
5 Correct 8 ms 2772 KB Output is correct
6 Correct 5 ms 2824 KB Output is correct
7 Correct 4 ms 2800 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3756 KB Output is correct
2 Correct 14 ms 3992 KB Output is correct
3 Correct 43 ms 4008 KB Output is correct
4 Correct 120 ms 7732 KB Output is correct
5 Correct 16 ms 4308 KB Output is correct
6 Correct 18 ms 4484 KB Output is correct
7 Correct 28 ms 5748 KB Output is correct
8 Correct 40 ms 7176 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 15456 KB Output is correct
2 Correct 152 ms 15548 KB Output is correct
3 Correct 181 ms 15328 KB Output is correct
4 Correct 237 ms 15548 KB Output is correct
5 Correct 296 ms 17516 KB Output is correct
6 Correct 340 ms 20740 KB Output is correct
7 Correct 302 ms 20672 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2820 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 3 ms 2784 KB Output is correct
5 Correct 8 ms 2772 KB Output is correct
6 Correct 5 ms 2824 KB Output is correct
7 Correct 4 ms 2800 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 13 ms 3756 KB Output is correct
10 Correct 14 ms 3992 KB Output is correct
11 Correct 43 ms 4008 KB Output is correct
12 Correct 120 ms 7732 KB Output is correct
13 Correct 16 ms 4308 KB Output is correct
14 Correct 18 ms 4484 KB Output is correct
15 Correct 28 ms 5748 KB Output is correct
16 Correct 40 ms 7176 KB Output is correct
17 Correct 218 ms 15456 KB Output is correct
18 Correct 152 ms 15548 KB Output is correct
19 Correct 181 ms 15328 KB Output is correct
20 Correct 237 ms 15548 KB Output is correct
21 Correct 296 ms 17516 KB Output is correct
22 Correct 340 ms 20740 KB Output is correct
23 Correct 302 ms 20672 KB Output is correct
24 Correct 647 ms 22676 KB Output is correct
25 Correct 870 ms 19572 KB Output is correct
26 Correct 454 ms 20012 KB Output is correct
27 Correct 391 ms 20304 KB Output is correct
28 Correct 284 ms 21188 KB Output is correct
29 Correct 312 ms 22612 KB Output is correct
30 Correct 286 ms 23868 KB Output is correct
31 Correct 262 ms 23920 KB Output is correct
32 Correct 183 ms 33088 KB Output is correct
33 Correct 270 ms 20024 KB Output is correct
34 Correct 303 ms 20684 KB Output is correct
35 Correct 395 ms 21752 KB Output is correct
36 Correct 617 ms 22468 KB Output is correct
37 Correct 823 ms 19900 KB Output is correct
38 Correct 630 ms 19860 KB Output is correct
39 Correct 312 ms 23884 KB Output is correct
40 Correct 258 ms 30844 KB Output is correct
41 Correct 225 ms 38824 KB Output is correct
42 Correct 196 ms 40012 KB Output is correct
43 Correct 229 ms 47960 KB Output is correct
44 Correct 227 ms 54092 KB Output is correct
45 Correct 221 ms 55680 KB Output is correct
46 Correct 424 ms 23328 KB Output is correct
47 Correct 553 ms 22972 KB Output is correct
48 Correct 1049 ms 22808 KB Output is correct
49 Correct 885 ms 21664 KB Output is correct
50 Correct 181 ms 31968 KB Output is correct
51 Correct 204 ms 31224 KB Output is correct
52 Correct 175 ms 31052 KB Output is correct
53 Correct 215 ms 31216 KB Output is correct
54 Correct 205 ms 31232 KB Output is correct
55 Correct 2 ms 2644 KB Output is correct