#include <bits/stdc++.h>
#include "gondola.h"
#define endl '\n'
using namespace std;
typedef long long ll;
int valid(int n, int a[])
{
set < int > cnt;
int min_idx = 0;
for(int i = 1; i < n; i++)
{
if(a[i] < a[min_idx])
min_idx = i;
if(cnt.count(a[i]))
return 0;
cnt.insert(a[i]);
}
vector < int > order;
for(int i = min_idx; i < n; i++)
{
order.push_back(a[i]);
}
for(int i = 0; i < min_idx; i++)
{
order.push_back(a[i]);
}
for(int i = 1; i < n; i++)
{
if(order[i] <= n && order[i] - order[0] != i)
return 0;
}
return 1;
}
int countReplacement(int n, int a[])
{
return -3;
}
int replacement(int n, int a[], int ans[])
{
int min_idx = 0;
int maxel = 0;
for(int i = 0; i < n; i++)
{
if(a[i] < a[min_idx])
min_idx = i;
maxel = max(maxel, a[i]);
}
vector < int > order;
for(int i = min_idx; i < n; i++)
{
order.push_back(a[i]);
}
for(int i = 0; i < min_idx; i++)
{
order.push_back(a[i]);
}
vector < pair < int, int > > broken;
for(int i = 0; i < n; i++)
{
if(order[i] > n)
broken.push_back({order[i], i});
}
sort(broken.begin(), broken.end());
if(order.front() > n)
order.front() = 1;
for(int i = 1; i < n; i++)
{
if(order[i - 1] == n)
{
order[i] = 1;
}
else
{
order[i] = order[i - 1] + 1;
}
}
int last = n;
int pos = 0;
for(pair < int, int > p : broken)
{
int val = p.first;
int idx = p.second;
while(last < val)
{
ans[pos++] = order[idx];
order[idx] = ++last;
}
}
return maxel - n;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
11 ms |
2936 KB |
Output is correct |
7 |
Correct |
6 ms |
1104 KB |
Output is correct |
8 |
Correct |
20 ms |
5044 KB |
Output is correct |
9 |
Correct |
7 ms |
1848 KB |
Output is correct |
10 |
Correct |
27 ms |
5816 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
10 ms |
2756 KB |
Output is correct |
7 |
Correct |
7 ms |
1116 KB |
Output is correct |
8 |
Correct |
19 ms |
5124 KB |
Output is correct |
9 |
Correct |
10 ms |
1880 KB |
Output is correct |
10 |
Correct |
26 ms |
5676 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
12 ms |
2720 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
32 ms |
5952 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
376 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
352 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
440 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
604 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
6 ms |
1752 KB |
Output is correct |
12 |
Correct |
6 ms |
1748 KB |
Output is correct |
13 |
Correct |
9 ms |
1512 KB |
Output is correct |
14 |
Correct |
5 ms |
1752 KB |
Output is correct |
15 |
Correct |
12 ms |
2420 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |