제출 #744465

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
744465		MODDI	곤돌라 (IOI14_gondola)	C++14	0 / 100	1 ms	304 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
using namespace std;
int valid(int n, int inputSeq[])
{
  return -1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	vi initial(n), replace;
	for(int i = 0; i < n; i++){
		initial[i] = gondolaSeq[i];
	}
	sort(initial.begin(), initial.end());
	int j = 1;
	for(int i = 0; i < n; i++){
		if(initial[i]==j){
			j++;
			continue;
		}
		else{
			replace.pb(j);
			j++;
		}
	}
	int l = replace.size();
	for(int i = 0; i < l; i++)
		replacementSeq[i] = replace[i];
		
	return l;
}

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

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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