Submission #1304227

#TimeUsernameProblemLanguageResultExecution timeMemory
1304227activedeltorreGondola (IOI14_gondola)C++20
20 / 100
22 ms4488 KiB
#include "gondola.h"
#include<map>
using namespace std;
map<int,int>fre;
int valid(int n, int inputSeq[])
{
    int offset=-1,val,off2;
    fre.clear();
    for(int i=1;i<=n;i++)
    {
        val=inputSeq[i-1];
        fre[val]++;
        if(fre[val]>=2)
        {
            return 0;
        }
        if(val<=0)
        {
            return 0;
        }
        if(val<=n && offset==-1)
        {
            offset=(i-val+n)%n;
        }
        else if(val<=n)
        {
            off2=(i-val+n)%n;
            if(off2!=offset)
            {
                return 0;
            }
        }
    }
    return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    return 0;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...