제출 #30323

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
30323		Nikefor	곤돌라 (IOI14_gondola)	C++98	10 / 100	29 ms	3396 KiB

gondola

#include "gondola.h"
#include <vector>
#include <algorithm>
#define mod 1000000009

using namespace std;
long long us(int x, int y) {
	if(y==0) return 1;
	if(y==1) return x%mod;
	if(y&1) return (us(x,y>>1) + us(x, (y>>1)+1))%mod;
	return (us(x, y>>1)*2)%mod;

}
int valid(int n, int inputSeq[])
{
	vector<int> used;
  for (int i = 0; i < n-1; ++i)
  {
  	used.push_back(inputSeq[i]);
  	if(inputSeq[i]<=n and inputSeq[i+1]<=n and inputSeq[i+1]!=1 and inputSeq[i]>inputSeq[i+1]) return 0;
  }
  if(inputSeq[n-1]<=n and inputSeq[0]<=n and inputSeq[n-1]>inputSeq[0]) return 0;
  used.push_back(inputSeq[n-1]);
  sort(used.begin(), used.end());
  for(int i=0; i<used.size()-1; i++) if(used[i]==used[i+1]) return 0;
  return 1;
}

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

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

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

int countReplacement(int n, int inputSeq[])
{
	int res = 1, ctr=0;
	if(!valid(n, inputSeq)) return -1;
	bool flag = true;
	vector<int> v;
	for (int i = 0; i < n; ++i) {
		if(inputSeq[i]>n) flag = false;
	 if(i!=n-1 and inputSeq[i+1] != (inputSeq[i]+1) and inputSeq[i+1]!=1) flag = false;
	 if(inputSeq[i]>n) {
	 	ctr++;
	 	v.push_back(inputSeq[i]);
	 }
	}
	sort(v.begin(), v.end());
	if(flag) return 1;
	int last = n+1;
	for(int i= 0; i<v.size(); i++) {
		res*= us(v[i]-last, v.size()-i);
		last = v[i]+1;
	}
  return res;
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:25:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<used.size()-1; i++) if(used[i]==used[i+1]) return 0;
                 ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:55:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i= 0; i<v.size(); i++) {
                 ^

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