Submission #282384

#TimeUsernameProblemLanguageResultExecution timeMemory
282384iliccmarkoGondola (IOI14_gondola)C++14
5 / 100
1 ms384 KiB
#include <bits/stdc++.h>
#include<gondola.h>
using namespace std;
#define ll long long
#define endl "\n"

using namespace std;


int valid(int n, int p[])
{
    for(int i = 1;i<n;i++)
    {
        if(p[i]==1&&p[i-1]<n)
            return 0;
        if(p[i]!=p[i-1]-1&&p[i-1]<=n&&p[i]<=n)
            return 0;
    }
    return 1;
}

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

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