제출 #396775

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

gondola

#include "gondola.h"
#include<bits/stdc++.h> 
using namespace std;

const int MAXN = 1e5 + 10;
int freq[3*MAXN];
int nseq[2*MAXN];

int valid(int n, int inputSeq[])
{
  //	int ult = 0;
  	for(int i = 0; i < n; i++){
  		nseq[i+1] = nseq[i+n+1] = inputSeq[i];
  		freq[inputSeq[i]]++;
  		if(freq[inputSeq[i]] == 2) return 0;
  	}
  	int ini = 0, auxi = n + 1;
  	for(int i = 1; i <= n; i++){
  		
  		if(nseq[i] <= n && nseq[i] < auxi) ini = i, auxi = nseq[i];
  	//	printf("%d %d\n", nseq[i], auxi);
  	}
 	//printf("\n");
  	//printf("%d\n",ini);
  	if(!ini) return 1;
  	int ult = auxi, ultaux = ini;
  	for(int i = ini+1; i < ini + n; i++){
  		if(nseq[i] <= n){
  	//		printf("%d %d\n", nseq[i], ult );
  			if(nseq[i] <= ult ||nseq[i] - ult != i - ultaux) return 0;
  			ult = nseq[i];
  			ultaux = i;
  		}
  	}
  	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