#include "gondola.h"
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <utility>
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
int valid(int n, int inputSeq[]) {
int offset = -1;
for (int i = 0; i < n; i++) {
if (inputSeq[i] <= n) {
offset = (i - inputSeq[i] + 1 + n) % n;
break;
}
}
if (offset == -1) return 1;
else {
for (int i = 0; i < n; i++) {
int ind = (offset+i) % n;
if (inputSeq[ind] < n && inputSeq[ind] != i+1) return 0;
}
}
return 1;
}
//----------------------
namespace T2 {
int original[100005], cnt;
vector<pii> elems;
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
int offset = -1;
for (int i = 0; i < n; i++) {
if (gondolaSeq[i] <= n) {
offset = (i - gondolaSeq[i] + 1 + n) % n;
break;
}
}
if (offset == -1) {
for (int i = 0; i < n; i++) original[i] = i+1;
} else {
for (int i = 0; i < n; i++) {
original[(offset+i)%n] = i+1;
}
}
for (int i = 0; i < n; i++) {
if (gondolaSeq[i] > n) {
elems.push_back({ gondolaSeq[i], i });
}
}
sort(elems.begin(), elems.end());
int cur = n+1;
for (int i = 0; i < elems.size(); i++) {
while (elems[i].fi >= cur) {
replacementSeq[cnt++] = original[elems[i].se];
original[elems[i].se] = cur++;
}
}
return cnt;
}
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
return T2::replacement(n, gondolaSeq, replacementSeq);
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
Compilation message
gondola.cpp: In function 'int T2::replacement(int, int*, int*)':
gondola.cpp:58:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < elems.size(); i++) {
~~^~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
128 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
256 KB |
Output is correct |
6 |
Correct |
9 ms |
640 KB |
Output is correct |
7 |
Correct |
17 ms |
1152 KB |
Output is correct |
8 |
Correct |
14 ms |
896 KB |
Output is correct |
9 |
Correct |
8 ms |
512 KB |
Output is correct |
10 |
Correct |
15 ms |
1152 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
256 KB |
Output is correct |
6 |
Correct |
9 ms |
640 KB |
Output is correct |
7 |
Correct |
16 ms |
1152 KB |
Output is correct |
8 |
Correct |
14 ms |
1056 KB |
Output is correct |
9 |
Correct |
8 ms |
512 KB |
Output is correct |
10 |
Correct |
15 ms |
1152 KB |
Output is correct |
11 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
4 ms |
256 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
6 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
4 ms |
364 KB |
Output is correct |
6 |
Correct |
4 ms |
256 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
17 ms |
1408 KB |
Output is correct |
12 |
Correct |
17 ms |
1536 KB |
Output is correct |
13 |
Correct |
22 ms |
1916 KB |
Output is correct |
14 |
Correct |
15 ms |
1408 KB |
Output is correct |
15 |
Correct |
31 ms |
2548 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
256 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |