Submission #204168

#TimeUsernameProblemLanguageResultExecution timeMemory
204168a_player곤돌라 (IOI14_gondola)C++14
10 / 100
20 ms636 KiB
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;



int valid(int n, int inputSeq[])
{
    int mini=min_element(inputSeq,inputSeq+n)-inputSeq;
    int ans=1;
    if(inputSeq[mini]>n)return 1;
    int i=(mini-inputSeq[mini]+1+n)%n;
    for(int j=0;j<n-1;j++){
        if(inputSeq[(i+j)%n]>n||inputSeq[(i+j+1)%n]>n)continue;
        ans*=(inputSeq[(i+j)%n]+1==inputSeq[(i+j+1)%n]);
    }
    return ans;
}

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

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

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

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