Submission #171363

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
171363	2019-12-28 11:38:34	Xellos	Arranging Shoes (IOI19_shoes)	C++17	100 / 100	156 ms	15880 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"
class fin {
  std::vector<int> T;
  
  int lastone(int x) { return x & (x ^ (x-1)); }
public:
  fin(int N) : T(N+1, 0) {}
  void put(int pos, int val) {
    for(int i = pos+1; i < (int)T.size(); i += lastone(i))
      T[i] += val;
  }
  int get(int pos) {
    int ret = 0;
    for(int i = pos+1; i > 0; i -= lastone(i))
      ret += T[i];
    return ret;
  }
};
long long count_swaps(std::vector<int> S) {
  int N = S.size()/2;
  std::vector<int> pos_l[100010], pos_r[100010];
  for(int i = 0; i < 2*N; i++) {
    if(S[i] < 0) pos_l[-S[i]].push_back(i);
    else pos_r[S[i]].push_back(i);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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