제출 #522619

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
522619	2022-02-05 09:32:46	cig32	Arranging Shoes (IOI19_shoes)	C++17	100 / 100	218 ms	30208 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;
using llong = long long;
#define BUGO(x) cerr << #x << " = " << x << '\n';
const int maxN = 200'005;
 
int t[maxN * 4];
 
int Get(int v, int vl, int vr, int i) {
    if (vl == vr)
        return t[v];
    int vm = vl + (vr - vl) / 2;
    if (i <= vm)
        return t[v] + Get(v * 2, vl, vm, i);
    return t[v] + Get(v * 2 + 1, vm + 1, vr, i);
}
void Add(int v, int vl, int vr, int l, int r, int val) {
    if (l > vr || vl > r) return;
    if (l <= vl && vr <= r) {
        t[v] += val;
        return;
    }
    int vm = vl + (vr - vl) / 2;
    Add(v * 2, vl, vm, l, r, val);
    Add(v * 2 + 1, vm + 1, vr, l, r, val);
}
vector<int> pos_[maxN * 2];
vector<int>* pos = pos_ + maxN;
long long count_swaps(vector<int> a) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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