Submission #138640

#	Time	Username	Problem	Language	Result	Execution time	Memory
138640		Mahmoud_Adel	Gondola (IOI14_gondola)	C++14	20 / 100	15 ms	4216 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
const int N = 1e6+5;
int mark[N], mep[N];
using namespace std;
int valid(int n, int inputSeq[])
{
	for(int i=0; i<n; i++)
	{
		if(mark[inputSeq[i]]) return 0;
		else mark[inputSeq[i]] = 1;
	}
	int j = -1;
	for(int i=0; i<n; i++) if(inputSeq[i] > 0 && inputSeq[i] <= n) j = i;
	if(j == -1) return 1;
	for(int i=0; i<n; i++)
	{
		int id = (i+j)%n, jd = (i+j+1)%n;
		if(inputSeq[jd] > n) inputSeq[jd] = inputSeq[id]%n + 1;
		if(inputSeq[jd] != inputSeq[id]%n + 1) return 0;
	}
	return 1;
}

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

int replacement(int n, int inputSeq[], int replacementSeq[])
{
	memset(mep, 0, sizeof mep);
	int j = -1, c = n;
	for(int i=0; i<n; i++) if(inputSeq[i] <= n) j  = i;
	for(int i=0; i<n; i++)
	{
		int id = (i+j) % n, jd = (i+j+1) % n;
		if(inputSeq[jd] > n) c = max(c, inputSeq[jd]), mep[inputSeq[jd]] =  inputSeq[jd] = inputSeq[id]%n + 1;
	}
	int last = -1;
	for(int i=c; i>n; i--)
	{
		if(mep[i] && last == -1) last = i;
		if(!mep[i]) 
		replacementSeq[i-n-1] = replacementSeq[last-n-1], replacementSeq[last-n-1] = i;
		else replacementSeq[i-n-1] = mep[i];
	}
	return c-n;
}

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

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

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:35:84: warning: operation on '*(inputSeq + ((sizetype)(((long unsigned int)jd) * 4)))' may be undefined [-Wsequence-point]
   if(inputSeq[jd] > n) c = max(c, inputSeq[jd]), mep[inputSeq[jd]] =  inputSeq[jd] = inputSeq[id]%n + 1;
                                                                       ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

• 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