제출 #978594

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978594		Amaarsaa	곤돌라 (IOI14_gondola)	C++14	25 / 100	12 ms	1568 KiB

gondola

#include<bits/stdc++.h>
#include "gondola.h"
 
using namespace std;
int Can(int n, int b[]) {
	sort ( b , b + n);
	for (int i = 1; i < n; i ++) if ( b[i]== b[i - 1]) return 0;
	return 1;
}
int valid(int n, int a[]) {
	int cnt = 0, mn = n + 1, ind = 0;

	for (int i = 0; i < n; i ++) {
		if ( a[i] <=n) {
			cnt ++;
			mn = a[i];
			ind = i;
		}
	}
	if ( cnt == 0) {
		if (!Can(n, a)) return 0;
		return 1;
	}
	int last = a[ind];
	for (int j = 0; j < n; j ++) {
		if (a[ind] <= n &&  a[ind] != last) {
			return 0;
		}
		last ++;
		if ( last == n + 1) last = 1;
		ind = (ind + 1) % n;
	}
	if (!Can(n, a)) return 0;
	return 1;
}
 
//----------------------
 
int replacement(int n, int gondola[], int replacementSeq[])
{
	int used[250005] = {0};
	int cnt = 0, mn = n + 1, ind = 0, ind1= 0, l;
	l = 0;
	for (int i = 0; i < n; i ++) {
		if ( gondola[i] <=n) {
			cnt ++;
			mn = gondola[i];
			ind = i;
		}
		l = max(l, gondola[i]);
	}
	l -= n;
	if ( cnt == 0) {
		if (!Can(n, gondola)) return 0;
		return 1;
	}
	int last = gondola[ind];
	for (int j = 0; j < n; j ++) {
		used[j + 1] = 1;
		if (gondola[ind] != last) {
			replacementSeq[ind1] = last;
			ind1 ++;
			used[last] = 1;
		}
		last ++;
		if ( last == n + 1) last = 1;
		ind = (ind + 1) % n;
	}
	for (int i = 1; i <= (n + l); i ++) {
		if (!used[i]) {
			replacementSeq[ind1] = i;
			ind1 ++;
		}
	}
	return l;
}
 
//----------------------
 
int countReplacement(int n, int inputSeq[])
{
  return -3;
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:11:15: warning: variable 'mn' set but not used [-Wunused-but-set-variable]
   11 |  int cnt = 0, mn = n + 1, ind = 0;
      |               ^~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:42:15: warning: variable 'mn' set but not used [-Wunused-but-set-variable]
   42 |  int cnt = 0, mn = n + 1, ind = 0, ind1= 0, l;
      |               ^~

• 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