# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921621 | Nika533 | Gondola (IOI14_gondola) | C++17 | 28 ms | 5164 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#include "gondola.h"
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;
int valid(int n, int inputSeq[])
{
int ind=-1;
map<int,int> mymap;
for (int i=0; i<n; i++) {
mymap[inputSeq[i]]++;
if (inputSeq[i]<=n) ind=i;
}
for (auto x:mymap) {
if (x.s>1) return 0;
}
if (ind==-1) return 1;
for (int i=ind+1; i<n+ind; i++) {
int num=inputSeq[((i-1)%n)]+1;
if (num==n+1) num=1;
if (inputSeq[(i%n)]>n) {
inputSeq[(i%n)]=num;
}
else {
if (inputSeq[(i%n)]!=num) return 0;
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int mx=0;
vector<pii> v;
int j=0,diff=0;
for (int i=0; i<n; i++) {
if (gondolaSeq[i]<=n) {
diff=(i+n-gondolaSeq[i])%n;
}
}
for (int i=0; i<n; i++) {
int val;
if (diff>=i) val=diff-i;
else val=diff+n-i;
val=n-val;
if (gondolaSeq[i]>n) v.pb({gondolaSeq[i],val});
}
int ind=0,cur=n+1;
sort(all(v));
for (int j=0; j<v.size(); j++) {
replacementSeq[ind]=v[j].s; ind++;
for (int o=cur; o<v[j].f; o++) {
replacementSeq[ind]=o; ind++;
}
cur=v[j].f+1;
}
return ind;
}
int countReplacement(int n, int inputSeq[])
{
int arr[n];
for (int i=0; i<n; i++) arr[i]=inputSeq[i];
if (!valid(n,arr)) return 0;
int mx=0,mn=1e9;
vector<int> v;
for (int i=0; i<n; i++) {
mx=max(mx,inputSeq[i]);
mn=min(mn,inputSeq[i]);
if (inputSeq[i]>n) {
v.pb(inputSeq[i]);
}
}
long long ans=1;
if (mn>n) {
ans=n;
}
int cur=n,val=v.size();
sort(all(v));
for (int j=0; j<v.size(); j++) {
int p=v[j]-cur-1;
while (p--) {
ans*=val;
ans%=MOD;
}
cur=v[j]; val--;
}
int ans2=ans;
return ans2;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |