Submission #240826

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
240826	2020-06-21 09:07:41	zoomswk	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	228 ms	269560 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>
using namespace std;
int n;
int done[200005];
queue<int> occ[400005];
int t[400005];
int qr(int l, int r){
  int res = 0;
  for(l+=n, r+=n; l<r; l>>=1, r>>=1){
    if(l&1) res += t[l++];
    if(r&1) res += t[--r];
  }
  return res;
}
void add(int pos){
  for(t[pos+=n]++; pos>1; pos>>=1) t[pos>>1] = t[pos]+t[pos^1];
}
long long count_swaps(std::vector<int> s) {
  n = (int)s.size();
  for(int i=0; i<n; i++) occ[s[i]+n/2].push(i);
  long long res = 0;
  for(int i=0, pairs_done=0; i<n; i++){
    if(done[i]) continue;
    occ[s[i]+n/2].pop();
    int pos = occ[-s[i]+n/2].front();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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