Submission #867499

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
867499	2023-10-28 14:04:54	cheat_when_I_was_young	Arranging Shoes (IOI19_shoes)	C++17	30 / 100	75 ms	75480 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 "shoes.h"
#include "bits/stdc++.h"
using namespace std;
void update(int pos, int val, vector<int> &bit) {
    ++pos;
    for (; pos < (int)bit.size(); pos += pos&-pos)
        bit[pos] += val;
}
void range_update(int l, int r, int val, vector<int> &bit) {
    update(l, val, bit);
    update(r+1, -val, bit);
}
int get(int pos, vector<int> &bit) {
    ++pos;
    int res = 0;
    for (; pos > 0; pos -= pos&-pos)
        res += bit[pos];
    return res;
}
long long count_swaps(vector<int> s) {
    int n = (int)s.size();
    long long ans = 0;
    vector<int> bit(n+1, 0);
    vector<vector<int>> l(n/2+1, vector<int>());
    vector<queue<int>> r(n/2+1, queue<int>());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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