oj.uz

Submission #205043

# Submission time Handle Problem Language Result Execution time Memory
205043 2020-02-27T18:24:14 Z ADJA Arranging Shoes (IOI19_shoes) C++14
100 / 100
 661 ms 150520 KB 
#include "shoes.h"

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>

#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()

using namespace std;

const int MAXN = 2 * 105000;

class Fenwick {
private:
  vector <long long> f;
public:
  void init(int n) {
    f.assign(n, 0);
  }
  void update(int pos, int delta) {
    for (; pos < sz(f); pos = (pos | (pos + 1))) {
      f[pos] += delta;
    }
  }
  long long sum(int pos) {
    long long res = 0;
    for (; pos >= 0; pos = (pos & (pos + 1)) - 1) {
      res += f[pos];
    }
    return res;
  }
  long long sum(int l, int r) {
    return sum(r) - sum(l - 1);
  }
};

int n;
vector<int> s;
map <int, queue<int>> mp;
int a[MAXN];
Fenwick f;

long long solveSameSize() {
  set<int> stA, stB;
  for (int i = 0; i < n; i++) {
    if (s[i] < 0) {
      stA.insert(i);
    } else {
      stB.insert(i);
    }
  }

  long long result = 0;
  for (int i = 0; i < n; i++) {
    if (i % 2 == 0) {
      int mn = *stA.begin();
      stA.erase(stA.begin());
      result += max(0, mn - i);
    } else {
      int mn = *stB.begin();
      stB.erase(stB.begin());
      result += max(0, mn - i);
    }
  }

  return result;
}

long long solveFour() {
  long long result = 0;

  for (int i = n / 2 - 1; i >= 0; i--) {
    result += i;
  }

  return result;
}

long long solveSmall() {
  long long result = 0;
  vector<int> left, right;

  for (int i = 0; i < n; i += 2) {
    int best = -1, bestVal = 0;

    left.assign(n + 1, -1);
    right.assign(n + 1, -1);

    for (int j = i; j < n; j++) {
      int sz = abs(s[j]);
      if (s[j] < 0) {
        if (left[sz] == -1) {
          left[sz] = j;
        }
      } else {
        if (right[sz] == -1) {
          right[sz] = j;
        }
      }
    }

    for (int j = 1; j <= n; j++) {
      if (left[j] == -1 || right[j] == -1) {
        continue;
      }
      int cur = 0;
      if (left[j] < right[j]) {
        cur = left[j] - i + (right[j] - (i + 1));
      } else {
        cur = left[j] - i + (right[j] - i);
      }
      if (best == -1 || cur < bestVal) {
        best = j;
        bestVal = cur;
      }
    }

    result += bestVal;
    for (int j = min(left[best], right[best]); j > i; j--) {
      s[j] = s[j - 1];
    }
    for (int j = max(left[best], right[best]); j > i; j--) {
      s[j] = s[j - 1];
    }
    s[i] = -best;
    s[i + 1] = best;

    /* cerr << result << endl;
    for (int j = 0; j < n; j++) {
      cerr << s[j] << " ";
    }
    cerr << endl; */
  }

  return result;
}

long long count_swaps(std::vector<int> S) {
  s = S;
  n = sz(s);

  f.init(n);

  for (int i = 0; i < n; i++) {
    mp[s[i]].push(i);
    a[i] = 1;
    f.update(i, 1);
  }

  long long ans = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == 0) {
      continue;
    }
    int mnPos = mp[-s[i]].front();
    // cerr << i << " " << mnPos << endl;

    int curNum = f.sum(0, mnPos);  
    if (s[i] < 0) {
      ans += curNum - 2;
    } else {
      ans += curNum - 1;
    }

    mp[-s[i]].pop();
    mp[s[i]].pop();
    a[mnPos]--;
    f.update(mnPos, -1);
    a[i]--;
    f.update(i, -1);
  }

  return ans;

  // int sz = abs(s[0]);
  // bool sameSize = true;
  // for (int i = 0; i < n; i++) {
  //   if (abs(s[i]) != sz) {
  //     sameSize = false;
  //   }
  // }
  // if (sameSize) {
  //   return solveSameSize();
  // }

  // bool ok = true;
  // for (int i = 0; i < n / 2; i++) {
  //   if (s[i] > 0 || abs(s[i]) != abs(s[i + n / 2])) {
  //     ok = false;
  //   }
  // }
  // for (int i = n / 2; i < n; i++) {
  //   if (s[i] < 0) {
  //     ok = false;
  //   }
  // }
  // if (ok) {
  //   return solveFour();
  // }

  // return solveSmall();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 9 ms 888 KB Output is correct
21 Correct 9 ms 888 KB Output is correct
22 Correct 49 ms 5880 KB Output is correct
23 Correct 48 ms 7160 KB Output is correct
24 Correct 52 ms 7160 KB Output is correct
25 Correct 44 ms 6904 KB Output is correct
26 Correct 49 ms 7160 KB Output is correct
27 Correct 46 ms 6904 KB Output is correct
28 Correct 46 ms 7160 KB Output is correct
29 Correct 47 ms 7160 KB Output is correct
30 Correct 47 ms 7160 KB Output is correct
31 Correct 56 ms 7160 KB Output is correct
32 Correct 47 ms 7160 KB Output is correct
33 Correct 45 ms 6904 KB Output is correct
34 Correct 49 ms 7168 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 256 KB Output is correct
37 Correct 47 ms 7160 KB Output is correct
38 Correct 46 ms 7160 KB Output is correct
39 Correct 47 ms 7160 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 594 ms 149240 KB Output is correct
6 Correct 185 ms 18936 KB Output is correct
7 Correct 576 ms 150520 KB Output is correct
8 Correct 52 ms 7292 KB Output is correct
9 Correct 582 ms 150392 KB Output is correct
10 Correct 431 ms 78360 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 4 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 6 ms 256 KB Output is correct
24 Correct 5 ms 256 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 4 ms 256 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 5 ms 256 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 4 ms 256 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 504 KB Output is correct
40 Correct 5 ms 632 KB Output is correct
41 Correct 7 ms 1784 KB Output is correct
42 Correct 7 ms 1784 KB Output is correct
43 Correct 6 ms 1656 KB Output is correct
44 Correct 6 ms 1404 KB Output is correct
45 Correct 6 ms 1272 KB Output is correct
46 Correct 6 ms 1144 KB Output is correct
47 Correct 6 ms 1016 KB Output is correct
48 Correct 6 ms 888 KB Output is correct
49 Correct 6 ms 632 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 7 ms 1784 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 4 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 6 ms 256 KB Output is correct
24 Correct 5 ms 256 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 4 ms 256 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 5 ms 256 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 4 ms 256 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 5 ms 256 KB Output is correct
42 Correct 5 ms 256 KB Output is correct
43 Correct 5 ms 256 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 5 ms 256 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 256 KB Output is correct
49 Correct 5 ms 256 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 9 ms 888 KB Output is correct
55 Correct 9 ms 888 KB Output is correct
56 Correct 49 ms 5880 KB Output is correct
57 Correct 48 ms 7160 KB Output is correct
58 Correct 52 ms 7160 KB Output is correct
59 Correct 44 ms 6904 KB Output is correct
60 Correct 49 ms 7160 KB Output is correct
61 Correct 46 ms 6904 KB Output is correct
62 Correct 46 ms 7160 KB Output is correct
63 Correct 47 ms 7160 KB Output is correct
64 Correct 47 ms 7160 KB Output is correct
65 Correct 56 ms 7160 KB Output is correct
66 Correct 47 ms 7160 KB Output is correct
67 Correct 45 ms 6904 KB Output is correct
68 Correct 49 ms 7168 KB Output is correct
69 Correct 5 ms 376 KB Output is correct
70 Correct 5 ms 256 KB Output is correct
71 Correct 47 ms 7160 KB Output is correct
72 Correct 46 ms 7160 KB Output is correct
73 Correct 47 ms 7160 KB Output is correct
74 Correct 5 ms 256 KB Output is correct
75 Correct 5 ms 376 KB Output is correct
76 Correct 5 ms 256 KB Output is correct
77 Correct 5 ms 376 KB Output is correct
78 Correct 594 ms 149240 KB Output is correct
79 Correct 185 ms 18936 KB Output is correct
80 Correct 576 ms 150520 KB Output is correct
81 Correct 52 ms 7292 KB Output is correct
82 Correct 582 ms 150392 KB Output is correct
83 Correct 431 ms 78360 KB Output is correct
84 Correct 5 ms 376 KB Output is correct
85 Correct 5 ms 376 KB Output is correct
86 Correct 5 ms 504 KB Output is correct
87 Correct 5 ms 632 KB Output is correct
88 Correct 7 ms 1784 KB Output is correct
89 Correct 7 ms 1784 KB Output is correct
90 Correct 6 ms 1656 KB Output is correct
91 Correct 6 ms 1404 KB Output is correct
92 Correct 6 ms 1272 KB Output is correct
93 Correct 6 ms 1144 KB Output is correct
94 Correct 6 ms 1016 KB Output is correct
95 Correct 6 ms 888 KB Output is correct
96 Correct 6 ms 632 KB Output is correct
97 Correct 5 ms 376 KB Output is correct
98 Correct 5 ms 376 KB Output is correct
99 Correct 7 ms 1784 KB Output is correct
100 Correct 7 ms 1784 KB Output is correct
101 Correct 43 ms 13944 KB Output is correct
102 Correct 18 ms 3832 KB Output is correct
103 Correct 661 ms 150264 KB Output is correct
104 Correct 577 ms 150452 KB Output is correct
105 Correct 549 ms 88056 KB Output is correct
106 Correct 568 ms 150264 KB Output is correct
107 Correct 236 ms 22456 KB Output is correct
108 Correct 300 ms 38264 KB Output is correct
109 Correct 49 ms 7160 KB Output is correct
110 Correct 44 ms 7164 KB Output is correct
111 Correct 551 ms 134392 KB Output is correct
112 Correct 582 ms 118656 KB Output is correct
113 Correct 235 ms 24056 KB Output is correct
114 Correct 580 ms 150520 KB Output is correct
115 Correct 576 ms 150264 KB Output is correct