oj.uz

Submission #284534

# Submission time Handle Problem Language Result Execution time Memory
284534 2020-08-27T15:04:19 Z ScarletS Arranging Shoes (IOI19_shoes) C++17
45 / 100
 140 ms 17072 KB 
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;

int segTree[1000000];

void update(int i, int cL, int cR, int r)
{
    if (cR<=r)
    {
        ++segTree[i];
        return;
    }
    if (r<cL)
        return;
    int m=cL+((cR-cL)>>1);
    update((i<<1)+1,cL,m,r);
    update((i<<1)+2,m+1,cR,r);
}

int query(int i, int cL, int cR, int x)
{
    if (x<cL||cR<x)
        return 0;
    if (cL==cR)
        return segTree[i];
    int m=cL+((cR-cL)>>1);
    return segTree[i]+query((i<<1)+1,cL,m,x)+query((i<<1)+2,m+1,cR,x);
}

vector<int> neg[100001];
vector<int> pos[100001];

ll count_swaps(vector<int> a)
{
    int n=sz(a),c=-1;
    ll ans=0;
    for (int i=0;i<n;++i)
    {
        if (a[i]<0)
            neg[-a[i]].push_back(i);
        else
            pos[a[i]].push_back(i);
    }
    n>>=1;
    pair<int,int> p[n];
    for (int i=1;i<100001;++i)
        for (int j=0;j<sz(pos[i]);++j)
            p[++c]={neg[i][j],pos[i][j]};
    sort(p,p+n);
    for (int i=0;i<n;++i)
    {
        //cout<<p[i].first<<" "<<p[i].second<<"\n";
        //cout<<query(0,0,200000,p[i].first)<<" + "<<p[i].first<<" - "<<((i<<1))<<"\n";
        ans+=query(0,0,200000,p[i].first)+p[i].first-(i<<1);
        update(0,0,200000,p[i].first);
        //cout<<query(0,0,200000,p[i].second)<<" + "<<p[i].second<<" - "<<((i<<1)+1)<<"\n";
        ans+=query(0,0,200000,p[i].second)+p[i].second-(i<<1)-1;
        update(0,0,200000,p[i].second);
    }
    return ans;
}

/**int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n;
    cin>>n;
    vector<int> a((n<<1));
    for (int i=0;i<(n<<1);++i)
        cin>>a[i];
    cout<<count_swaps(a);
    return 0;
}**/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Incorrect 4 ms 4992 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 5024 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 5 ms 5120 KB Output is correct
18 Correct 5 ms 5120 KB Output is correct
19 Correct 5 ms 5120 KB Output is correct
20 Correct 16 ms 5760 KB Output is correct
21 Correct 12 ms 5760 KB Output is correct
22 Correct 86 ms 11672 KB Output is correct
23 Correct 82 ms 11628 KB Output is correct
24 Correct 86 ms 11628 KB Output is correct
25 Correct 75 ms 11376 KB Output is correct
26 Correct 85 ms 11628 KB Output is correct
27 Correct 82 ms 11500 KB Output is correct
28 Correct 78 ms 11632 KB Output is correct
29 Correct 78 ms 11632 KB Output is correct
30 Correct 80 ms 11632 KB Output is correct
31 Correct 86 ms 11652 KB Output is correct
32 Correct 78 ms 11632 KB Output is correct
33 Correct 73 ms 11372 KB Output is correct
34 Correct 77 ms 11632 KB Output is correct
35 Correct 4 ms 4992 KB Output is correct
36 Correct 4 ms 4992 KB Output is correct
37 Correct 78 ms 11628 KB Output is correct
38 Correct 79 ms 11628 KB Output is correct
39 Correct 78 ms 11628 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 121 ms 16988 KB Output is correct
6 Correct 100 ms 12152 KB Output is correct
7 Correct 121 ms 16888 KB Output is correct
8 Correct 83 ms 11648 KB Output is correct
9 Correct 122 ms 17072 KB Output is correct
10 Correct 140 ms 13816 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Incorrect 4 ms 4992 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Incorrect 4 ms 4992 KB Output isn't correct
15 Halted 0 ms 0 KB -