Submission #744473

#TimeUsernameProblemLanguageResultExecution timeMemory
744473MODDI곤돌라 (IOI14_gondola)C++14
5 / 100
1 ms308 KiB
#include "gondola.h"
//#include "grader.cpp"
#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;
	for(int i = 0; i < n; i++)
		initial.pb(gondolaSeq[i]);
	vi replace;
	sort(initial.begin(), initial.end());
	int j = 1;
	for(int i = 0; i < n; i++){
		while(j < initial[i]){
			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;
}
#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...