Submission #926819

#	Time	Username	Problem	Language	Result	Execution time	Memory
926819		NintsiChkhaidze	Gondola (IOI14_gondola)	C++17	20 / 100	33 ms	6932 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
using namespace std;
int b[200005],c[200005],a[200005];

int valid(int n, int gondolaSeq[]){
	map <int,int> mp;
	
	int k = -1;
	for (int i=0;i<n;i++){
		a[i] = gondolaSeq[i];
		if (mp.find(a[i]) != mp.end()) return 0;
		mp[a[i]] = 1;
 		if (a[i] > n) continue;
		if (k == -1) k= i;
		else if (a[k] > a[i]) k = i;
	}
	if (k==-1) return 1;
		
	int m = 0;
	int st = a[k];
	for (int j = k; j < n; j++)
		if (a[j] <= n) b[++m] = a[j],c[m] = st + (j - k);
	
	for (int j = 0; j < k; j++)
		if (a[j] <= n) b[++m] = a[j],c[m] = st + (n - k) + j;
	
	for (int i = 1; i <= m; i++){
		if (b[i] != c[i]) return 0;
	}
  	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int k = -1;
	for (int i=0;i<n;i++){
		a[i] = gondolaSeq[i];
 		if (a[i] > n) continue;
		if (k == -1) k= i;
		else if (a[k] > a[i]) k = i;
	}
	if (k == -1) k=0;
		
	int st = a[k];
	for (int j = k; j < n; j++)
		b[j] = st + (j - k);
	
	for (int j = 0; j < k; j++)
		b[j] = st + (n - k) + j;
	
	int x = n+1,m = -1;
	vector <pair <int,int> > vec;
	for (int i=0;i<n;i++){
		if (gondolaSeq[i] > n) 
			vec.pb({gondolaSeq[i],i});
	}
	sort(vec.begin(),vec.end());
	
	for (int j=0;j<vec.size();j++){
		int final = vec[j].f,i = vec[j].s;
		
		int cur = b[i];
		while (cur != final){
			replacementSeq[++m] = cur;
			cur = x++;
		}
	}
	
	return m + 1;
}

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

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

Compilation message (stderr)

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

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