| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1360584 | nini_gvenetadze | 곤돌라 (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
#include "gondola.h"
int valid(int n, int inputseq[])
{
for(int i=0; i<n; i++)
{
for(int j=i+1; j<n; j++)
{
if(inputseq[i]==inputseq[j])
{
return 0;
}
}
}
int k=-1;
int c=-1;
for(int i=0; i<n; i++)
{
if(inputseq[i]<=n)
{
if(c==-1)
{
c=inputseq[i];
k=i;
continue;
}
if(inputseq[i]==1)
{
c=inputseq[i];
k=i;
continue;
}
if(inputseq[i]-c!=i-k)
{
return 0;
}
c=inputseq[i];
k=i;
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return 0;
}
int countreplacement(int n, int inputseg[])
{
for(int i=0; i<n; i++)
{
for(int j=i+1; j<n; j++)
{
if(inputseg[i]==inputseg[j])
{
return 0;
}
}
}
int k=-1;
for(int i=0; i<n; i++)
{
if(inputseg[i]<=n)
{
k=i;
break;
}
}
if(k==-1) return n;
int ans=0;
int c=inputseg[k];
for(int i=0; i<n; i++)
{
int j=k+i;
if(j>=n) j-=n;
if(inputseg[j]<=n)
{
if(inputseg[j]!=c)
{
ans++;
}
}
c++;
if(c>n)
{
c=1;
}
}
return ans;
}
