oj.uz

Submission #143079

# Submission time Handle Problem Language Result Execution time Memory
143079 2019-08-13T00:36:01 Z model_code Arranging Shoes (IOI19_shoes) C++17
30 / 100
 124 ms 14888 KB 
#include "shoes.h"

#include <bits/stdc++.h>
using namespace std;

namespace testcaseCheck {

const int SUBTASK = 2;

bool permutationsOfShoes(vector<int> S, int N) {
  vector<int> V;
  for (int i = 1; i <= N; ++i) {
    V.push_back(-i);
    V.push_back(i);
  }

  sort(S.begin(), S.end());
  sort(V.begin(), V.end());
  for (int i = 0; i < 2 * N; ++i) {
    if (S[i] != V[i]) {
      return false;
    }
  }

  return true;
}

void run(std::vector<int> S) {
  assert(1 <= SUBTASK && SUBTASK <= 6);

  assert(S.size() % 2 == 0);
  int N = S.size() / 2;
  assert(1 <= N && N <= 100000);
  
  map<int, int> sizeToOccurences;
  for (int s : S) {
    sizeToOccurences[abs(s)] += s / abs(s);
  }
  for (pair<int, int> occurences : sizeToOccurences) {
    assert(occurences.second == 0);
  }

  if (SUBTASK == 1) {
    assert(N == 1);
  }

  if (SUBTASK == 2) {
    assert(N <= 8);
  }

  if (SUBTASK == 3) {
    for (int s : S) {
      assert(abs(s) == abs(S[0]));
    }
  }

  if (SUBTASK == 4) {
    for (int i = 0; i < N; ++i) {
      assert(abs(S[i]) == S[i + N]);
    }
  }

  if (SUBTASK == 5) {
    assert(N <= 1000);
  }
}


}  // namespace testcaseCheck

long long count_swaps(std::vector<int> S) {
  testcaseCheck::run(S);  
  
  vector<int> sizes;
  for (int s : S) {
    if (s > 0) {
      sizes.push_back(s);
    }
  }

  int answer = INT_MAX;
  sort(sizes.begin(), sizes.end());
  do {
    int res = 0;
    vector<int> currentOrder = S;
    vector<int> expectedOrder;
    for (int i = 0; i < sizes.size(); ++i) {
      expectedOrder.push_back(-sizes[i]);
      expectedOrder.push_back(sizes[i]);
    }

    for (int i = 0; i < expectedOrder.size(); ++i) {
      for (int j = i; j < currentOrder.size(); ++j) {
        if (currentOrder[j] == expectedOrder[i]) {
          while (i != j) {
            swap(currentOrder[j], currentOrder[j - 1]);
            --j;
            ++res;
          }
          break;
        }
      }
    }

    answer = min(answer, res);
  } while (next_permutation(sizes.begin(), sizes.end()));

  return answer;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:87:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < sizes.size(); ++i) {
                     ~~^~~~~~~~~~~~~~
shoes.cpp:92:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < expectedOrder.size(); ++i) {
                     ~~^~~~~~~~~~~~~~~~~~~~~~
shoes.cpp:93:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for (int j = i; j < currentOrder.size(); ++j) {
                       ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 252 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Runtime error 124 ms 14888 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 14 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 3 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 256 KB Output is correct
26 Correct 22 ms 504 KB Output is correct
27 Correct 12 ms 380 KB Output is correct
28 Correct 7 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 3 ms 256 KB Output is correct
33 Correct 4 ms 380 KB Output is correct
34 Correct 7 ms 376 KB Output is correct
35 Correct 3 ms 380 KB Output is correct
36 Correct 7 ms 256 KB Output is correct
37 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
38 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 14 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 3 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 256 KB Output is correct
26 Correct 22 ms 504 KB Output is correct
27 Correct 12 ms 380 KB Output is correct
28 Correct 7 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 3 ms 256 KB Output is correct
33 Correct 4 ms 380 KB Output is correct
34 Correct 7 ms 376 KB Output is correct
35 Correct 3 ms 380 KB Output is correct
36 Correct 7 ms 256 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 256 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 252 KB Output is correct
46 Correct 2 ms 256 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Halted 0 ms 0 KB -