제출 #126947

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

gondola

#include <set>

#include "gondola.h"

int valid(int n, int inputSeq[])
{
	int cons = -n-1;
	std::set<int> seq;

	for(int i = 0; i < n; i++)
	{
		seq.insert(inputSeq[i]);

		cons++;
		if(cons == n+1)
			cons = 1;

		if(inputSeq[i] > n)
			continue;

		if(cons < 0)
			cons = inputSeq[i];
		else if(cons != inputSeq[i])
			return 0;
	}

	if(seq.size() == n)
		return 1;
	else
		return 0;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{

}

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

int countReplacement(int n, int inputSeq[])
{

}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(seq.size() == n)
     ~~~~~~~~~~~^~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:38:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:45:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

• 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