제출 #143481

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
143481	2019-08-14 08:52:56	dolphingarlic	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	249 ms	139032 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 <queue>
int n;
long long bit[200001];
std::queue<int> left[100001], right[100001];
void update(int pos) { for (int i = pos; i <= n; i += (i & (-i))) bit[i]++; }
long long query(int l, int r) {
  long long ans = 0;
  for (int i = r; i > 0; i -= (i & (-i))) ans += bit[i];
  for (int i = l; i > 0; i -= (i & (-i))) ans -= bit[i];
  return ans;
}
long long count_swaps(std::vector<int> s) {
  n = s.size();
  for (int i = 0; i < n; i++) {
    if (s[i] < 0) left[-s[i]].push(i + 1);
    else right[s[i]].push(i + 1);
  }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] < 0) {
      if (left[-s[i]].front() == i + 1) {
        int r_indx = right[-s[i]].front();
        right[-s[i]].pop();
        left[-s[i]].pop();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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