제출 #422189

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422189		dreezy	곤돌라 (IOI14_gondola)	C++17	25 / 100	16 ms	1148 KiB

gondola

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

/**********************/


int valid(int n, int inputSeq[])
{
	
	int preval = -1;
	for(int i =0; i<n; i++){
		//cout << preval<<endl;
		if(preval == -1){
			if(inputSeq[i] <= n)
				preval = inputSeq[i];
			continue;
		}
		
		if(inputSeq[i] <=n){
			if(preval == n){
				if(inputSeq[i] != 1) return false;
			}
			else
				if(inputSeq[i]!= preval+1) return false;
			preval = inputSeq[i];
		}
		else{
			//replacement, num can be anything
			
			if(preval == n)
				preval = 1;
			else preval++;
		}
	}
	
	if(inputSeq[n-1] == n)
		return inputSeq[0] == 1;
	else return inputSeq[n-1] +1 == inputSeq[0];
	
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	
	int preval = -1;
	for(int i =n -1; i>=0; i--){
		if(gondolaSeq[i] <=n) preval = (n - i -1) + gondolaSeq[i];
	}
	
	if(preval == -1){
		//all of them were replaced
		for(int i =  0; i<n; i++){
			replacementSeq[i] = i+1;
		}
		return n;
	}
	
	int cnt = 0;
	for(int i =0; i<n; i++){

		if(gondolaSeq[i] <=n){
			preval = gondolaSeq[i];
		}
		else{
			//replacement, num can be anything
			
			if(preval == n){
				replacementSeq[cnt] = 1;
				preval = 1;
				
			}
			else {
				replacementSeq[cnt] = ++preval;
			}
			
			cnt++;
		}
	}
	
	return cnt;
}

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

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


/******************************/

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 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