Submission #230324

#TimeUsernameProblemLanguageResultExecution timeMemory
230324chubyxdxdGondola (IOI14_gondola)C++11
25 / 100
22 ms768 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 ans=0;
  for(int i=0;i<n;i++){
    if(gondolaSeq[i]>n){
      ans=1;
      if(i==0)
	replacementSeq[0]=gondolaSeq[i+1]-1;
      else{
	replacementSeq[0]=gondolaSeq[i-1]+1;
      }
    }
  }
  return ans;
}

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

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