#include <bits/stdc++.h>
#include "gondola.h"
#define endl '\n'
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
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 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;
}
ll binpow(ll a, ll b)
{
ll result = 1;
while(b)
{
if(b & 1)
result = (result * a) % MOD;
a = (a * a) % MOD;
b /= 2;
}
return result;
}
int countReplacement(int n, int a[])
{
if(!valid(n, a))
return 0;
vector < ll > broken;
for(int i = 0; i < n; i++)
{
if(a[i] > n)
broken.push_back(a[i]);
}
sort(broken.begin(), broken.end());
int sz = broken.size();
int last = n;
ll ans;
if(sz == n) ans = n;
else ans = 1;
for(int i = 0; i < sz; i++)
{
ans = ans * binpow(sz - i, broken[i] - last - 1) % MOD;
last = broken[i];
}
return ans;
}
# |
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 |
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 |
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 |
6 |
Correct |
11 ms |
2652 KB |
Output is correct |
7 |
Correct |
6 ms |
808 KB |
Output is correct |
8 |
Correct |
18 ms |
4568 KB |
Output is correct |
9 |
Correct |
8 ms |
1628 KB |
Output is correct |
10 |
Correct |
28 ms |
5308 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 |
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 |
6 |
Correct |
10 ms |
2692 KB |
Output is correct |
7 |
Correct |
6 ms |
604 KB |
Output is correct |
8 |
Correct |
18 ms |
4568 KB |
Output is correct |
9 |
Correct |
6 ms |
1628 KB |
Output is correct |
10 |
Correct |
24 ms |
5084 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
13 ms |
2612 KB |
Output is correct |
14 |
Correct |
0 ms |
344 KB |
Output is correct |
15 |
Correct |
33 ms |
5232 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 |
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 |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
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 |
344 KB |
Output is correct |
4 |
Correct |
0 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 |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
6 ms |
1304 KB |
Output is correct |
12 |
Correct |
10 ms |
1364 KB |
Output is correct |
13 |
Correct |
10 ms |
1372 KB |
Output is correct |
14 |
Correct |
6 ms |
1240 KB |
Output is correct |
15 |
Correct |
13 ms |
2180 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 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 |
1 ms |
348 KB |
Output is correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
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 |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
424 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
392 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |