# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135679 | Ak_16 | Gondola (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include "gondola.h"
using namespace std;
#define int long long
int p = 1e9+9;
int n;
int a[300005];
int b[300005];
int valid(n, a){
int cnt=0;
int sp;
for(int i=0; i<n; i++){
if(a[i]<=n){cnt++; sp = i;}
}
if(cnt==0){return 1;}
else {
for(int i=0; i<n; i++){
a[(n+a[sp]-sp+i-1)%n] = b[i];
}
int bru=0;
for(int i=0; i<n; i++){
if(b[i]<=n&&b[i]!=i+1){bru=1;}
}
return (1-bru);
}
}
int replacement(n, a, b){
}
countReplacement(n, a){
}