제출 #254518

#제출 시각아이디문제언어결과실행 시간메모리
254518b00n0rpGondola (IOI14_gondola)C++17
20 / 100
40 ms4728 KiB
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

#define ll long long

int valid(int n, int inputSeq[]){
	set<int> s;
	for(int i = 0; i < n; i ++){
		s.insert(inputSeq[i]);
	}
	if(s.size() != n) return 0;
	for(int i = 0; i < n; i ++){
		if(inputSeq[i] <= n){
			for(int j = i+1; j != i; j = (j+1)%n){
				if(inputSeq[j] > n) continue;
				if(inputSeq[j] != ((inputSeq[i]+(j-i)+n-1)%n)+1) return 0;
			}
			return 1;
		}
	}
	return 1;
}

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

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

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

const ll MOD = 1000000009;

int countReplacement(int n, int inputSeq[]){
	if(!valid(n,inputSeq)) return 0;
	int mx = inputSeq[0],mn = inputSeq[0];
	for(int i = 1; i < n; i ++){
		mx = max(mx,inputSeq[i]);
		mn = min(mn,inputSeq[i]);
	}
	if(mn > n){
		ll ans = 1;
		for(int i = 1; i <= n; i ++){
			ans = (ans*i)%MOD;
		}
		return ans;
	}
	else assert(0 == 1);
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:12:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(s.size() != n) return 0;
     ~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...