Submission #724230

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
724230	2023-04-14 22:54:28	badont	Arranging Shoes (IOI19_shoes)	C++17	45 / 100	47 ms	13992 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 <cmath>
#include <cstdlib> 
#include <cassert>
long long count_swaps(std::vector<int> s) {
  using ll = long long;
  using namespace std;
  ll n = (int)s.size(); n /= 2; 
  vector<vector<ll>> pos(n, vector<ll>()), neg(n, vector<ll>());  
  for (int i = 0; i < 2 * n; i++) {
    ll x = abs(s[i]);
    if (s[i] < 0) {
      neg[x - 1].push_back(i);
    } else {
      pos[x - 1].push_back(i);
    }
  }
  ll op_1 = 0, op_2 = 0;
  for (int i = 0; i < n; i++) {
    assert(neg[i].size() == pos[i].size());
    for (int j = 0; j < (int)neg[i].size(); j++) {
      int x = neg[i][j], y = pos[i][j];
      op_1 += abs(x - y) - 1;
      if (x > y) op_2++;
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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