Submission #60064

#	Time	Username	Problem	Language	Result	Execution time	Memory
60064		Eae02	Sorting (IOI15_sorting)	C++14	36 / 100	30 ms	640 KiB

sorting

#include "sorting.h"

#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
	std::vector<int> sorted(S, S + N);
	std::sort(all(sorted));
	
	std::vector<int> finalAccess(N);
	for (int i = 0; i < M; i++)
	{
		finalAccess[X[i]] = i;
		finalAccess[Y[i]] = i;
	}
	
	int R = 0;
	for (; R < M; R++)
	{
		if (std::equal(S, S + N, sorted.begin()))
			break;
		
		std::swap(S[X[R]], S[Y[R]]);
		
		int index = -1;
		for (int i = 0; i < N; i++)
		{
			if (R >= finalAccess[i] && S[i] != sorted[i])
			{
				index = i;
				break;
			}
		}
		
		if (index == -1)
		{
			for (int i = 0; i < N; i++)
			{
				if (R + 1 == finalAccess[i] && S[i] != sorted[i])
				{
					index = i;
					break;
				}
			}
			
			if (index == -1 || R + 1 == M)
			{
				P[R] = Q[R] = 0;
			}
			else
			{
				int val = sorted[index];
				int target = X[R + 1] == index ? Y[R + 1] : X[R + 1];
				
				auto valIt = std::find(S, S + N, val);
				std::swap(S[target], *valIt);
				
				P[R] = target;
				Q[R] = valIt - S;
			}
		}
		else
		{
			int val = sorted[index];
			auto valIt = std::find(S, S + N, val);
			std::swap(S[index], *valIt);
			
			P[R] = index;
			Q[R] = valIt - S;
		}
	}
	
	return R;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:60:18: warning: conversion to 'int' from 'long int' may alter its value [-Wconversion]
     Q[R] = valIt - S;
            ~~~~~~^~~
sorting.cpp:70:17: warning: conversion to 'int' from 'long int' may alter its value [-Wconversion]
    Q[R] = valIt - S;
           ~~~~~~^~~

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26