oj.uz

Submission #443261

# Submission time Handle Problem Language Result Execution time Memory
443261 2021-07-10T09:07:54 Z mkisic Arranging Shoes (IOI19_shoes) C++14
100 / 100
 180 ms 17696 KB 
#include "shoes.h"
#include <cassert>
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

#define TRACE(x) cerr << #x << ' ' << x << endl
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define _ <<  " " << 

#define pb push_back

const int MAXN = 200100;

struct Fenwick {
  int p[MAXN];
  
  void clear() {
    memset(p, 0, sizeof p);
  }

  void add(int x) {
    for (int i = x; i > 0; i -= i &- i) 
      p[i]++;
  }

  int get(int x) {
    int ret = 0;
    for (int i = x; i < MAXN; i += i &- i)
      ret += p[i];
    return ret;
  }
}loga;

long long get_inv(vector <int> pos) {
  long long inv = 0;
  loga.clear();

  REP(i, pos.size()) {
    inv += loga.get(pos[i] + 1);
    loga.add(pos[i] + 1);
  }
  return inv;
}


long long solve(vector <int> p, int start, int T) {
  vector <int> pos;
  vector <int> v[MAXN];
  int n = p.size();
  pos.resize(n);
  int t = start;
  REP(i, n) {
    if (p[i]/abs(p[i]) == T) {
      v[max(p[i], -p[i])].pb(t);
      pos[i] = t;
      t += 2;
    }
  }
  
  REP(i, MAXN) reverse(v[i].begin(), v[i].end());

  REP(i, n) {
    if (p[i]/abs(p[i]) != T) {
      int x = v[max(p[i], -p[i])].back();
      v[max(p[i], -p[i])].pop_back();
      if (p[i] < 0) x--;
      else x++;
      pos[i] = x;
    }
  }

  return get_inv(pos);
}

long long f(vector <int> p) {
  int n = p.size() / 2;
  vector <int> r;
  vector <int> v[MAXN];
  REP(i, 2 * n) {
    int a = p[i] + n;
    int b = p[i];
    if (p[i] < 0) {
      a = abs(p[i]);
      b = a + n;
    }
    if (v[b].empty()) {
      v[a].pb(i);
      r.pb(abs(p[i]));
    } else v[b].pop_back(); 
  }

  REP(i, MAXN) assert(v[i].empty());

  REP(i, 2 * n) {
    int x = p[i] + n;
    if (p[i] < 0) x = abs(p[i]);
    v[x].pb(i);
  }

  REP(i, MAXN) reverse(v[i].begin(), v[i].end());
  
  vector <int> pos;
  pos.resize(p.size());

  int t = 0;
  REP(i, n) {
    pos[v[r[i]].back()] = t++;
    v[r[i]].pop_back();
    pos[v[r[i] + n].back()] = t++;
    v[r[i] + n].pop_back();
  }

  return get_inv(pos);
}


long long count_swaps(std::vector<int> s) {
  return min(min(solve(s, 0, -1), solve(s, 1, 1)), f(s));
}

Compilation message

shoes.cpp: In function 'long long int get_inv(std::vector<int>)':
shoes.cpp:10:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 | #define FOR(i, a, b) for (int i = (a); i < (b); i++)
      |                                          ^
shoes.cpp:11:19: note: in expansion of macro 'FOR'
   11 | #define REP(i, n) FOR(i, 0, n)
      |                   ^~~
shoes.cpp:42:3: note: in expansion of macro 'REP'
   42 |   REP(i, pos.size()) {
      |   ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5708 KB Output is correct
2 Correct 7 ms 5708 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5708 KB Output is correct
2 Correct 7 ms 5708 KB Output is correct
3 Correct 7 ms 5708 KB Output is correct
4 Correct 6 ms 5708 KB Output is correct
5 Correct 7 ms 5708 KB Output is correct
6 Correct 6 ms 5708 KB Output is correct
7 Correct 7 ms 5708 KB Output is correct
8 Correct 7 ms 5708 KB Output is correct
9 Correct 7 ms 5708 KB Output is correct
10 Correct 6 ms 5708 KB Output is correct
11 Correct 7 ms 5784 KB Output is correct
12 Correct 6 ms 5708 KB Output is correct
13 Correct 6 ms 5708 KB Output is correct
14 Correct 7 ms 5708 KB Output is correct
15 Correct 7 ms 5680 KB Output is correct
16 Correct 7 ms 5708 KB Output is correct
17 Correct 7 ms 5776 KB Output is correct
18 Correct 6 ms 5708 KB Output is correct
19 Correct 8 ms 5708 KB Output is correct
20 Correct 7 ms 5708 KB Output is correct
21 Correct 7 ms 5708 KB Output is correct
22 Correct 6 ms 5708 KB Output is correct
23 Correct 6 ms 5708 KB Output is correct
24 Correct 7 ms 5772 KB Output is correct
25 Correct 6 ms 5708 KB Output is correct
26 Correct 6 ms 5656 KB Output is correct
27 Correct 7 ms 5708 KB Output is correct
28 Correct 6 ms 5680 KB Output is correct
29 Correct 6 ms 5776 KB Output is correct
30 Correct 6 ms 5708 KB Output is correct
31 Correct 6 ms 5708 KB Output is correct
32 Correct 8 ms 5708 KB Output is correct
33 Correct 6 ms 5760 KB Output is correct
34 Correct 8 ms 5708 KB Output is correct
35 Correct 7 ms 5708 KB Output is correct
36 Correct 11 ms 5756 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5708 KB Output is correct
2 Correct 7 ms 5708 KB Output is correct
3 Correct 6 ms 5708 KB Output is correct
4 Correct 6 ms 5708 KB Output is correct
5 Correct 6 ms 5676 KB Output is correct
6 Correct 6 ms 5708 KB Output is correct
7 Correct 7 ms 5708 KB Output is correct
8 Correct 6 ms 5708 KB Output is correct
9 Correct 6 ms 5708 KB Output is correct
10 Correct 6 ms 5776 KB Output is correct
11 Correct 6 ms 5708 KB Output is correct
12 Correct 6 ms 5776 KB Output is correct
13 Correct 7 ms 5708 KB Output is correct
14 Correct 6 ms 5708 KB Output is correct
15 Correct 6 ms 5708 KB Output is correct
16 Correct 6 ms 5784 KB Output is correct
17 Correct 7 ms 5708 KB Output is correct
18 Correct 7 ms 5836 KB Output is correct
19 Correct 8 ms 5836 KB Output is correct
20 Correct 18 ms 6476 KB Output is correct
21 Correct 13 ms 6452 KB Output is correct
22 Correct 73 ms 13312 KB Output is correct
23 Correct 65 ms 13568 KB Output is correct
24 Correct 69 ms 13356 KB Output is correct
25 Correct 59 ms 13176 KB Output is correct
26 Correct 70 ms 13408 KB Output is correct
27 Correct 74 ms 13148 KB Output is correct
28 Correct 62 ms 13396 KB Output is correct
29 Correct 64 ms 13400 KB Output is correct
30 Correct 62 ms 13416 KB Output is correct
31 Correct 71 ms 13388 KB Output is correct
32 Correct 61 ms 13392 KB Output is correct
33 Correct 61 ms 13232 KB Output is correct
34 Correct 66 ms 13408 KB Output is correct
35 Correct 7 ms 5708 KB Output is correct
36 Correct 6 ms 5708 KB Output is correct
37 Correct 64 ms 13400 KB Output is correct
38 Correct 63 ms 13416 KB Output is correct
39 Correct 62 ms 13396 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5772 KB Output is correct
2 Correct 6 ms 5708 KB Output is correct
3 Correct 7 ms 5708 KB Output is correct
4 Correct 7 ms 5708 KB Output is correct
5 Correct 131 ms 17696 KB Output is correct
6 Correct 100 ms 13880 KB Output is correct
7 Correct 137 ms 17576 KB Output is correct
8 Correct 62 ms 13236 KB Output is correct
9 Correct 129 ms 17468 KB Output is correct
10 Correct 140 ms 14400 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5708 KB Output is correct
2 Correct 7 ms 5708 KB Output is correct
3 Correct 7 ms 5708 KB Output is correct
4 Correct 6 ms 5708 KB Output is correct
5 Correct 7 ms 5708 KB Output is correct
6 Correct 6 ms 5708 KB Output is correct
7 Correct 7 ms 5708 KB Output is correct
8 Correct 7 ms 5708 KB Output is correct
9 Correct 7 ms 5708 KB Output is correct
10 Correct 6 ms 5708 KB Output is correct
11 Correct 7 ms 5784 KB Output is correct
12 Correct 6 ms 5708 KB Output is correct
13 Correct 6 ms 5708 KB Output is correct
14 Correct 7 ms 5708 KB Output is correct
15 Correct 7 ms 5680 KB Output is correct
16 Correct 7 ms 5708 KB Output is correct
17 Correct 7 ms 5776 KB Output is correct
18 Correct 6 ms 5708 KB Output is correct
19 Correct 8 ms 5708 KB Output is correct
20 Correct 7 ms 5708 KB Output is correct
21 Correct 7 ms 5708 KB Output is correct
22 Correct 6 ms 5708 KB Output is correct
23 Correct 6 ms 5708 KB Output is correct
24 Correct 7 ms 5772 KB Output is correct
25 Correct 6 ms 5708 KB Output is correct
26 Correct 6 ms 5656 KB Output is correct
27 Correct 7 ms 5708 KB Output is correct
28 Correct 6 ms 5680 KB Output is correct
29 Correct 6 ms 5776 KB Output is correct
30 Correct 6 ms 5708 KB Output is correct
31 Correct 6 ms 5708 KB Output is correct
32 Correct 8 ms 5708 KB Output is correct
33 Correct 6 ms 5760 KB Output is correct
34 Correct 8 ms 5708 KB Output is correct
35 Correct 7 ms 5708 KB Output is correct
36 Correct 11 ms 5756 KB Output is correct
37 Correct 6 ms 5708 KB Output is correct
38 Correct 7 ms 5708 KB Output is correct
39 Correct 6 ms 5708 KB Output is correct
40 Correct 7 ms 5708 KB Output is correct
41 Correct 7 ms 5836 KB Output is correct
42 Correct 7 ms 5836 KB Output is correct
43 Correct 7 ms 5876 KB Output is correct
44 Correct 7 ms 5872 KB Output is correct
45 Correct 9 ms 5756 KB Output is correct
46 Correct 7 ms 5836 KB Output is correct
47 Correct 7 ms 5836 KB Output is correct
48 Correct 8 ms 5836 KB Output is correct
49 Correct 8 ms 5836 KB Output is correct
50 Correct 7 ms 5836 KB Output is correct
51 Correct 7 ms 5840 KB Output is correct
52 Correct 7 ms 5820 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5708 KB Output is correct
2 Correct 7 ms 5708 KB Output is correct
3 Correct 7 ms 5708 KB Output is correct
4 Correct 6 ms 5708 KB Output is correct
5 Correct 7 ms 5708 KB Output is correct
6 Correct 6 ms 5708 KB Output is correct
7 Correct 7 ms 5708 KB Output is correct
8 Correct 7 ms 5708 KB Output is correct
9 Correct 7 ms 5708 KB Output is correct
10 Correct 6 ms 5708 KB Output is correct
11 Correct 7 ms 5784 KB Output is correct
12 Correct 6 ms 5708 KB Output is correct
13 Correct 6 ms 5708 KB Output is correct
14 Correct 7 ms 5708 KB Output is correct
15 Correct 7 ms 5680 KB Output is correct
16 Correct 7 ms 5708 KB Output is correct
17 Correct 7 ms 5776 KB Output is correct
18 Correct 6 ms 5708 KB Output is correct
19 Correct 8 ms 5708 KB Output is correct
20 Correct 7 ms 5708 KB Output is correct
21 Correct 7 ms 5708 KB Output is correct
22 Correct 6 ms 5708 KB Output is correct
23 Correct 6 ms 5708 KB Output is correct
24 Correct 7 ms 5772 KB Output is correct
25 Correct 6 ms 5708 KB Output is correct
26 Correct 6 ms 5656 KB Output is correct
27 Correct 7 ms 5708 KB Output is correct
28 Correct 6 ms 5680 KB Output is correct
29 Correct 6 ms 5776 KB Output is correct
30 Correct 6 ms 5708 KB Output is correct
31 Correct 6 ms 5708 KB Output is correct
32 Correct 8 ms 5708 KB Output is correct
33 Correct 6 ms 5760 KB Output is correct
34 Correct 8 ms 5708 KB Output is correct
35 Correct 7 ms 5708 KB Output is correct
36 Correct 11 ms 5756 KB Output is correct
37 Correct 6 ms 5708 KB Output is correct
38 Correct 6 ms 5708 KB Output is correct
39 Correct 6 ms 5676 KB Output is correct
40 Correct 6 ms 5708 KB Output is correct
41 Correct 7 ms 5708 KB Output is correct
42 Correct 6 ms 5708 KB Output is correct
43 Correct 6 ms 5708 KB Output is correct
44 Correct 6 ms 5776 KB Output is correct
45 Correct 6 ms 5708 KB Output is correct
46 Correct 6 ms 5776 KB Output is correct
47 Correct 7 ms 5708 KB Output is correct
48 Correct 6 ms 5708 KB Output is correct
49 Correct 6 ms 5708 KB Output is correct
50 Correct 6 ms 5784 KB Output is correct
51 Correct 7 ms 5708 KB Output is correct
52 Correct 7 ms 5836 KB Output is correct
53 Correct 8 ms 5836 KB Output is correct
54 Correct 18 ms 6476 KB Output is correct
55 Correct 13 ms 6452 KB Output is correct
56 Correct 73 ms 13312 KB Output is correct
57 Correct 65 ms 13568 KB Output is correct
58 Correct 69 ms 13356 KB Output is correct
59 Correct 59 ms 13176 KB Output is correct
60 Correct 70 ms 13408 KB Output is correct
61 Correct 74 ms 13148 KB Output is correct
62 Correct 62 ms 13396 KB Output is correct
63 Correct 64 ms 13400 KB Output is correct
64 Correct 62 ms 13416 KB Output is correct
65 Correct 71 ms 13388 KB Output is correct
66 Correct 61 ms 13392 KB Output is correct
67 Correct 61 ms 13232 KB Output is correct
68 Correct 66 ms 13408 KB Output is correct
69 Correct 7 ms 5708 KB Output is correct
70 Correct 6 ms 5708 KB Output is correct
71 Correct 64 ms 13400 KB Output is correct
72 Correct 63 ms 13416 KB Output is correct
73 Correct 62 ms 13396 KB Output is correct
74 Correct 6 ms 5772 KB Output is correct
75 Correct 6 ms 5708 KB Output is correct
76 Correct 7 ms 5708 KB Output is correct
77 Correct 7 ms 5708 KB Output is correct
78 Correct 131 ms 17696 KB Output is correct
79 Correct 100 ms 13880 KB Output is correct
80 Correct 137 ms 17576 KB Output is correct
81 Correct 62 ms 13236 KB Output is correct
82 Correct 129 ms 17468 KB Output is correct
83 Correct 140 ms 14400 KB Output is correct
84 Correct 6 ms 5708 KB Output is correct
85 Correct 7 ms 5708 KB Output is correct
86 Correct 6 ms 5708 KB Output is correct
87 Correct 7 ms 5708 KB Output is correct
88 Correct 7 ms 5836 KB Output is correct
89 Correct 7 ms 5836 KB Output is correct
90 Correct 7 ms 5876 KB Output is correct
91 Correct 7 ms 5872 KB Output is correct
92 Correct 9 ms 5756 KB Output is correct
93 Correct 7 ms 5836 KB Output is correct
94 Correct 7 ms 5836 KB Output is correct
95 Correct 8 ms 5836 KB Output is correct
96 Correct 8 ms 5836 KB Output is correct
97 Correct 7 ms 5836 KB Output is correct
98 Correct 7 ms 5840 KB Output is correct
99 Correct 7 ms 5820 KB Output is correct
100 Correct 7 ms 5836 KB Output is correct
101 Correct 18 ms 6840 KB Output is correct
102 Correct 16 ms 6564 KB Output is correct
103 Correct 169 ms 17580 KB Output is correct
104 Correct 159 ms 17556 KB Output is correct
105 Correct 180 ms 14908 KB Output is correct
106 Correct 126 ms 17468 KB Output is correct
107 Correct 104 ms 14072 KB Output is correct
108 Correct 121 ms 14528 KB Output is correct
109 Correct 66 ms 13344 KB Output is correct
110 Correct 62 ms 13416 KB Output is correct
111 Correct 130 ms 16828 KB Output is correct
112 Correct 152 ms 16188 KB Output is correct
113 Correct 111 ms 14112 KB Output is correct
114 Correct 132 ms 17580 KB Output is correct
115 Correct 128 ms 17556 KB Output is correct