Submission #335346

#TimeUsernameProblemLanguageResultExecution timeMemory
335346blueGondola (IOI14_gondola)C++11
0 / 100
1 ms384 KiB
#include "gondola.h"
using namespace std;

int valid(int n, int inputSeq[])
{
    int temp = n;
    for(int i = 1; i <= n; i++) if(inputSeq[i] <= n)
    {
        temp = i;
        break;
    }
    for(int i = 1; i <= n; i++) if(inputSeq[i] <= n) inputSeq[i] = (inputSeq[i] - inputSeq[temp] + n) % n;

    temp = -1;
    for(int i = 1; i <= n; i++)
    {
        if(inputSeq[i] > n) continue;
        if(temp != -1 && inputSeq[i] < inputSeq[temp]) return 0;
        temp = i;
    }

    return 1;
}

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

int countReplacement(int n, int inputSeq[])
{
    return 0;
}
#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...