제출 #162038

#제출 시각아이디문제언어결과실행 시간메모리
162038oolimry곤돌라 (IOI14_gondola)C++14
20 / 100
53 ms5240 KiB
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int arr[]) {
	set<int> sset;
    for(int i = 0;i < n;i++){
		sset.insert(arr[i]);
	}
	if(sset.size() != n) return 0;
	
	int anchor = -1;
	
	for(int i = 0;i < n;i++){
		if(arr[i] <= n){
			anchor = (arr[i] - i + n) % n;
			break;
		}
	}
	
	if(anchor == -1) return 1;
	
	for(int i = 0;i < n;i++){
		if(arr[i] <= n){
			if(arr[i] % n != (anchor + i) % n){
				return 0;
			}
		}
	}
	return 1;
}

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

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

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:9:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(sset.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...