제출 #586204

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

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define f first
#define s second
#define pb push_back
using namespace std;

int valid(int n, int inputSeq[]) {
	int pos = -1;
	set<ll> b;
	for(int i = 0; i < n; i++)
		b.insert(inputSeq[i]);
	if(b.size() != n)return 0;
	for(int i = 0; i < n; i++) {
		if(inputSeq[i] <= n) {
			pos = i;
			break;									
		}
	}               
	if(pos == -1)return 1;
	ll a = inputSeq[pos];
	ll nxt = pos;
	for(int j = 0; j <= n; j++) {
		if(inputSeq[nxt] <= n && inputSeq[nxt] != a)return 0;
		a++;
		if(a == n + 1)a = 1;
		nxt = (nxt + 1) % n;
	}
	return 1; 
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	vector<pair<int, int>> z;
	int pos = -1;
	int a[n] = {0};
	for(int i = 0; i < n; i++) {
		if(gondolaSeq[i] <= n) {
			pos = i;									
		}
		z.pb(mp(gondolaSeq[i], i));
	}

	int b = (pos == -1 ?  1 : gondolaSeq[pos]); 
	pos = (pos == -1 ? 0 : pos);
	for(int j = 0 ; j < n; j++) {
		a[pos] = b;
		pos = (pos + 1) % n;
		b++;
		if(b == n + 1)b = 1;
	}
	int cur = 0;
	ll mx = n + 1;
	sort(z.begin(), z.end());
	for(auto u : z) {
		if(u.f <= n)continue;
		replacementSeq[cur++] = a[u.s];		
		while(mx != u.f) {
			replacementSeq[cur++] = mx;
			mx++;
		}
	}
	return cur;
}

int countReplacement(int n, int inputSeq[]){
	
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:15:14: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |  if(b.size() != n)return 0;
      |     ~~~~~~~~~^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:69:1: warning: no return statement in function returning non-void [-Wreturn-type]
   69 | }
      | ^

• 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