#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int valid(int n, int inputSeq[]){
vi a;
vi vec;
map<int, int> cnt;
pii mn = {10000000, 0};
for(int i = 0; i < n; i++){
a.pb(inputSeq[i]);
cnt[a[i]]++;
if(a[i] < mn.fi){
mn.fi = a[i];
mn.se = i;
}
}
for(auto ele : cnt){
if(ele.se > 1){
return 0;
}
}
vi na;
for(int i = mn.se; i < n; i++){
na.pb(a[i]);
}
for(int i = 0; i < mn.se; i++){
na.pb(a[i]);
}
a = na;
for(int i = 0; i < n; i++){
if(a[i] <= n){
vec.pb(i);
}
}
if(sz(vec) <= 1){
return 1;
}
for(int i = 0; i + 1 < sz(vec); i++){
if(a[vec[i + 1]] <= a[vec[i]]){
return 0;
}
if(vec[i + 1] - vec[i] != a[vec[i + 1]] - a[vec[i]]){
return 0;
}
}
if(n - vec.back() - 1 != (n - a[vec.back()] + a[vec[0]] - 1)){
return 0;
}
return 1;
}
//----------------------
const int INF = 1e9;
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int l = 0;
vi a;
set<pii> x;
pii mn = {INF, 0};
for(int i = 0; i < n; i++){
a.pb(gondolaSeq[i]);
if(a[i] > n){
x.insert({a[i], i});
}
if(a[i] < mn.fi){
mn.fi = a[i];
mn.se = i;
}
}
vi p;
int ok = n + 1;
// cout << mn.fi << ' ' << mn.se << '\n';
while(sz(x)){
pii akt = *(x.begin());
x.erase(x.begin());
int our;
if(mn.fi > n){
our = akt.se + 1;
}else if(akt.se >= mn.se){
our = mn.fi + akt.se - mn.se;
if(our > n){
our -= n;
}
}else{
our = mn.fi + n - mn.se + akt.se;
while(our > n){
our -= n;
}
}
//cout << akt.se << ' ' << our << '\n';
p.pb(our);
our = ok;
while(our < akt.fi){
p.pb(our);
our++;
}
ok = our + 1;
}
l = sz(p);
for(int i = 0; i < l; i++){
replacementSeq[i] = p[i];
}
return l;
}
//----------------------
const int MOD = 1e9 + 7;
int countReplacement(int n, int inputSeq[]){
if(!valid(n, inputSeq)){
return 0;
}
vi a;
pii mn = {INF, 0};
for(int i = 0; i < n; i++){
a.pb(inputSeq[i]);
if(a[i] < mn.fi){
mn.fi = a[i];
mn.se = i;
}
}
ll ans = 1LL;
// if(mn.fi > n){
// ans = n;
//}
set<pii> s;
for(int i = 0; i < n; i++){
if(a[i] > n){
s.insert({a[i], i});
}
}
int u = n + 1;
while(sz(s)){
pii akt = *s.begin();
s.erase(s.begin());
while(u < akt.fi){
ans = (ll)ans * (sz(s) + 1);
ans %= MOD;
u++;
}
u = akt.fi + 1;
}
return ans;
}
/*int main(){
int S[7] = {9, 8, 2, 12, 13, 16, 10};
int R[30];
cout<<replacement(7, S,R) << '\n';
for(auto ele : R){
cout << ele << ' ';
}
cout << '\n';
}*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 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 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
11 ms |
2880 KB |
Output is correct |
7 |
Correct |
22 ms |
4048 KB |
Output is correct |
8 |
Correct |
15 ms |
5208 KB |
Output is correct |
9 |
Correct |
5 ms |
1880 KB |
Output is correct |
10 |
Correct |
18 ms |
6016 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
8 ms |
2904 KB |
Output is correct |
7 |
Correct |
21 ms |
4148 KB |
Output is correct |
8 |
Correct |
15 ms |
5204 KB |
Output is correct |
9 |
Correct |
5 ms |
1884 KB |
Output is correct |
10 |
Correct |
19 ms |
6056 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
12 ms |
2676 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
31 ms |
6004 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 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 |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
5 ms |
1240 KB |
Output is correct |
12 |
Correct |
6 ms |
1248 KB |
Output is correct |
13 |
Correct |
15 ms |
2868 KB |
Output is correct |
14 |
Correct |
6 ms |
1240 KB |
Output is correct |
15 |
Correct |
15 ms |
3204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 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 |
1 ms |
344 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 |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
348 KB |
Output is correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
348 KB |
Output is correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |