#include "monster.h"
#include <iostream>
std::vector<int> quick(std::vector<int> a, bool help) {
std::vector<int> left = std::vector<int>(), right = std::vector<int>();
if (help) {
goto A;
}
if (a.size() < 2) {
return a;
}
else if (a.size() == 2) {
std::vector<int> b = std::vector<int>();
if (Query(a[0], a[1])) {
b.push_back(a[0]);
b.push_back(a[1]);
}
else {
b.push_back(a[1]);
b.push_back(a[0]);
}
return b;
}
else if (a.size() <= 8) {
A: std::vector<int> counter = std::vector<int>(a.size());
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
if (Query(a[i], a[j])) {
counter[i]++;
}
else {
counter[j]++;
}
}
}
std::vector<int> end = std::vector<int>(a.size());
bool did1 = false, didN = false;
for (int i = 0; i < a.size(); i++) {
if (counter[i] == 1 && !did1) {
end[0] = a[i];
did1 = true;
}
else if (counter[i] == a.size() - 2 && !didN) {
end[a.size() - 1] = a[i];
didN = true;
}
end[counter[i]] = a[i];
}
if (Query(end[1], end[0])) {
int z = end[0];
end[0] = end[1];
end[1] = z;
}
if (Query(end[a.size() - 1], end[a.size() - 2])) {
int z = end[a.size() - 2];
end[a.size() - 2] = end[a.size() - 1];
end[a.size() - 1] = z;
}
return end;
}
int pivot = a[a.size() / 2];
for (int i = 0; i < a.size(); i++) {
if (!(i == (a.size() / 2))) {
if (Query(pivot, a[i])) {
left.push_back(a[i]);
}
else {
right.push_back(a[i]);
}
}
}
int min = 0;
for (int i = 1; i < right.size(); i++) {
if (Query(right[min], right[i])) {
min = i;
}
}
int max = 0;
for (int i = 1; i < left.size(); i++) {
if (Query(left[i], left[max])) {
max = i;
}
}
right.push_back(left[max]);
left.push_back(right[min]);
left.erase(left.begin() + max);
right.erase(right.begin() + min);
if (left.size() <= 3 || right.size() <= 3) {
return quick(a, true);
}
std::vector<int> end = quick(left, false);
end.push_back(pivot);
right = quick(right, false);
for (int i = 0; i < right.size(); i++) {
end.push_back(right[i]);
}
return end;
}
std::vector<int> Solve(int N) {
std::vector<int> T(N);
for (int i = 0; i < N; i++) {
T[i] = i;
}
T = quick(T, false);
std::vector<int> T2 = std::vector<int>(N);
for (int i = 0; i < N; i++) {
T2[T[i]] = i;
}
/*for (int i = 0; i < N; i++) {
std::cout << T2[i] << " ";
}*/
return T2;
}
Compilation message
monster.cpp: In function 'std::vector<int> quick(std::vector<int>, bool)':
monster.cpp:26:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | for (int i = 0; i < a.size() - 1; i++) {
| ~~^~~~~~~~~~~~~~
monster.cpp:27:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
27 | for (int j = i + 1; j < a.size(); j++) {
| ~~^~~~~~~~~~
monster.cpp:38:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
38 | for (int i = 0; i < a.size(); i++) {
| ~~^~~~~~~~~~
monster.cpp:43:24: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
43 | else if (counter[i] == a.size() - 2 && !didN) {
monster.cpp:64:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
64 | for (int i = 0; i < a.size(); i++) {
| ~~^~~~~~~~~~
monster.cpp:65:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
65 | if (!(i == (a.size() / 2))) {
| ~~^~~~~~~~~~~~~~~~~
monster.cpp:76:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | for (int i = 1; i < right.size(); i++) {
| ~~^~~~~~~~~~~~~~
monster.cpp:82:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
82 | for (int i = 1; i < left.size(); i++) {
| ~~^~~~~~~~~~~~~
monster.cpp:98:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
98 | for (int i = 0; i < right.size(); i++) {
| ~~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
200 KB |
Output is correct |
| 2 |
Correct |
0 ms |
200 KB |
Output is correct |
| 3 |
Correct |
0 ms |
200 KB |
Output is correct |
| 4 |
Correct |
0 ms |
200 KB |
Output is correct |
| 5 |
Correct |
0 ms |
200 KB |
Output is correct |
| 6 |
Correct |
1 ms |
200 KB |
Output is correct |
| 7 |
Correct |
1 ms |
200 KB |
Output is correct |
| 8 |
Correct |
0 ms |
200 KB |
Output is correct |
| 9 |
Correct |
0 ms |
200 KB |
Output is correct |
| 10 |
Correct |
1 ms |
200 KB |
Output is correct |
| 11 |
Correct |
1 ms |
200 KB |
Output is correct |
| 12 |
Correct |
1 ms |
200 KB |
Output is correct |
| 13 |
Correct |
1 ms |
200 KB |
Output is correct |
| 14 |
Correct |
1 ms |
200 KB |
Output is correct |
| 15 |
Correct |
1 ms |
200 KB |
Output is correct |
| 16 |
Correct |
30 ms |
296 KB |
Output is correct |
| 17 |
Correct |
43 ms |
200 KB |
Output is correct |
| 18 |
Correct |
35 ms |
200 KB |
Output is correct |
| 19 |
Correct |
41 ms |
200 KB |
Output is correct |
| 20 |
Correct |
27 ms |
320 KB |
Output is correct |
| 21 |
Correct |
0 ms |
200 KB |
Output is correct |
| 22 |
Correct |
0 ms |
200 KB |
Output is correct |
| 23 |
Correct |
1 ms |
200 KB |
Output is correct |
| 24 |
Correct |
1 ms |
200 KB |
Output is correct |
| 25 |
Correct |
1 ms |
200 KB |
Output is correct |
| 26 |
Correct |
23 ms |
280 KB |
Output is correct |
| 27 |
Correct |
0 ms |
200 KB |
Output is correct |
| 28 |
Correct |
1 ms |
200 KB |
Output is correct |
| 29 |
Correct |
1 ms |
200 KB |
Output is correct |
| 30 |
Correct |
1 ms |
200 KB |
Output is correct |
| 31 |
Correct |
1 ms |
200 KB |
Output is correct |
| 32 |
Correct |
9 ms |
200 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
200 KB |
Output is correct |
| 2 |
Correct |
0 ms |
200 KB |
Output is correct |
| 3 |
Correct |
0 ms |
200 KB |
Output is correct |
| 4 |
Correct |
0 ms |
200 KB |
Output is correct |
| 5 |
Correct |
0 ms |
200 KB |
Output is correct |
| 6 |
Correct |
1 ms |
200 KB |
Output is correct |
| 7 |
Correct |
1 ms |
200 KB |
Output is correct |
| 8 |
Correct |
0 ms |
200 KB |
Output is correct |
| 9 |
Correct |
0 ms |
200 KB |
Output is correct |
| 10 |
Correct |
1 ms |
200 KB |
Output is correct |
| 11 |
Correct |
1 ms |
200 KB |
Output is correct |
| 12 |
Correct |
1 ms |
200 KB |
Output is correct |
| 13 |
Correct |
1 ms |
200 KB |
Output is correct |
| 14 |
Correct |
1 ms |
200 KB |
Output is correct |
| 15 |
Correct |
1 ms |
200 KB |
Output is correct |
| 16 |
Correct |
30 ms |
296 KB |
Output is correct |
| 17 |
Correct |
43 ms |
200 KB |
Output is correct |
| 18 |
Correct |
35 ms |
200 KB |
Output is correct |
| 19 |
Correct |
41 ms |
200 KB |
Output is correct |
| 20 |
Correct |
27 ms |
320 KB |
Output is correct |
| 21 |
Correct |
0 ms |
200 KB |
Output is correct |
| 22 |
Correct |
0 ms |
200 KB |
Output is correct |
| 23 |
Correct |
1 ms |
200 KB |
Output is correct |
| 24 |
Correct |
1 ms |
200 KB |
Output is correct |
| 25 |
Correct |
1 ms |
200 KB |
Output is correct |
| 26 |
Correct |
23 ms |
280 KB |
Output is correct |
| 27 |
Correct |
0 ms |
200 KB |
Output is correct |
| 28 |
Correct |
1 ms |
200 KB |
Output is correct |
| 29 |
Correct |
1 ms |
200 KB |
Output is correct |
| 30 |
Correct |
1 ms |
200 KB |
Output is correct |
| 31 |
Correct |
1 ms |
200 KB |
Output is correct |
| 32 |
Correct |
9 ms |
200 KB |
Output is correct |
| 33 |
Incorrect |
189 ms |
300 KB |
Wrong Answer [6] |
| 34 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
240 ms |
328 KB |
Wrong Answer [6] |
| 2 |
Halted |
0 ms |
0 KB |
- |
