Submission #857564

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
857564	2023-10-06 12:08:29	sleepntsheep	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1 ms	2484 KiB

shoes

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <vector>
#include <cstdint>
#include <iostream>
#include <algorithm>
#define N 200005
int fw[N], posraw[N<<1];
int *pos = posraw+N;
void upd(int p, int k) { for (++p; p < N; p+=p&-p) fw[p] += k; }
int qry(int p) { if(p<0)return 0;int z = 0; for (++p; p; p-=p&-p) z += fw[p]; return z; }
int64_t count_swaps(std::vector<int> v)
{
    int64_t z = 0;
    int n = v.size() >> 1, f = 0;
    for (int i = 0; i < (int)v.size(); ++i) pos[v[i]] = i;
    for (int i = 0; i < 2 * n; ++i, ++f)
    {
        if (qry(i) - qry(i-1) == 1) continue;
        int corresponding = pos[-v[i]] + (qry(2*n) - qry(pos[-v[i]]));
        z += corresponding - i*2 - 1 + (v[i] > 0);
        upd(pos[-v[i]], 1);
    }
    return z;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15