제출 #434649

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434649		Supersonic	곤돌라 (IOI14_gondola)	C++14	20 / 100	14 ms	716 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int n;bool u[250001];
int o(int a,int b){return (a+b)<=n?(a+b):(a+b)-n;}
int valid(int an, int inputSeq[]){
  n=an;int g=-1;
  for(int i=0;i<n;i++){if(inputSeq[i]<=n)g=i;if(u[inputSeq[i]])return 0;u[inputSeq[i]]=1;}
  if(g==-1)return 1;
  for(int i=g;i<n;i++)if(inputSeq[i]<=n&&inputSeq[i]!=o(inputSeq[g],i-g))return 0;
  for(int i=0;i<g;i++)if(inputSeq[i]<=n&&inputSeq[i]!=o(inputSeq[g],n-g+i))return 0;
  return 1;
}

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

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

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10