제출 #1019504

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1019504		pcc	곤돌라 (IOI14_gondola)	C++17	55 / 100	31 ms	4700 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define fs first
#define sc second

int valid(int n, int arr[]){
	int cen = -1;
	set<int> st;
	for(int i = 0;i<n;i++){
		if(arr[i]<=n)cen = i;
		if(st.find(arr[i]) != st.end())return false;
		st.insert(arr[i]);
	}
	if(cen == -1)return true;
	int c = arr[cen];
	while(cen<n){
		if(arr[cen] != c&&arr[cen]<=n)return false;
		c++;
		if(c>n)c -= n;
		cen++;
	}
	cen = 0;
	while(cen<n){
		if(arr[cen] != c&&arr[cen]<=n)return false;
		c++;
		if(c>n)c -= n;
		cen++;
	}
	return true;
}

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

int replacement(int n, int arr[], int ans[]){
	vector<pii> v;
	int ori = 0;
	for(int i = 0;i<n;i++){
		if(arr[i]>n)v.push_back(pii(arr[i],i));
		else ori = i;
	}
	if(ori != -1){
		int c = arr[ori];
		while(ori<n){
			arr[ori++] = c++;
			if(c>n)c -= n;
		}
		ori = 0;
		while(ori<n){
			arr[ori++] = c++;
			if(c>n)c -= n;
		}
	}
	sort(v.begin(),v.end());
	vector<int> re;
	int ptr = n;
	for(auto &i:v){
		while(ptr<i.fs){
			re.push_back(arr[i.sc]);
			arr[i.sc] = ++ptr;
		}
	}
	for(int i = 0;i<re.size();i++)ans[i] = re[i];
	return re.size();
}

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

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

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

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:65:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |  for(int i = 0;i<re.size();i++)ans[i] = re[i];
      |                ~^~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10