Submission #230313

#TimeUsernameProblemLanguageResultExecution timeMemory
230313chubyxdxdGondola (IOI14_gondola)C++11
20 / 100
16 ms640 KiB
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;
int valid(int n, int inputSeq[])
{
  for(int i=1;i<n;i++){
    if(inputSeq[i]==1 and inputSeq[i-1]!=n)return 0;
    if(inputSeq[i]!=1 and inputSeq[i-1]+1!=inputSeq[i])return 0;
  }
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  vector<int> v;
  int maxi=1;
  for(int i=0;i<n;i++){
    maxi=max(maxi,gondolaSeq[i]);
  }
  return maxi-n;
}

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

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...