Submission #240839

#	Time	Username	Problem	Language	Result	Execution time	Memory
240839		RayaBurong25_1	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1091 ms	26616 KiB

shoes

#include "shoes.h"
#include <map>
#include <vector>
#include <algorithm>
#include <set>

int abs(int a)
{
	return (a < 0)?-a:a;
}

long long count_swaps(std::vector<int> s) {
	int i, sz;
	long long cnt = 0;
	std::map<int, std::vector<int> > pos;
	for (i = 0; i < s.size(); i++)
	{
		sz = abs(s[i]);
		if (pos.find(sz) == pos.end())
			pos[sz] = std::vector<int>();
		pos[sz].push_back(i);
	}
	int nxt;
	std::vector<int> moved;
	int ismoved[100005] = {0};
	for (i = 0; i < s.size(); i++)
	{
		sz = abs(s[i]);
		if (ismoved[i])
			continue;
		// printf("%d ", sz);
		nxt = std::upper_bound(pos[sz].begin(), pos[sz].end(), i) - pos[sz].begin();
		if (nxt == pos[sz].size())
			continue;
		while ((long long) s[pos[sz][nxt]]*s[i] > 0 || ismoved[pos[sz][nxt]])
			nxt++;
		// printf("%d ", pos[sz][nxt]);
		cnt += (pos[sz][nxt] - i - 1) - (std::upper_bound(moved.begin(), moved.end(), pos[sz][nxt]) - std::upper_bound(moved.begin(), moved.end(), i));
		// printf("%d ", (s[i] > 0));
		cnt += (s[i] > 0);
		moved.push_back(pos[sz][nxt]);
		ismoved[pos[sz][nxt]] = 1;
		std::sort(moved.begin(), moved.end());
		// printf("%lld\n", cnt);
	}
	return cnt;
}

Compilation message (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:16:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (i = 0; i < s.size(); i++)
              ~~^~~~~~~~~~
shoes.cpp:26:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (i = 0; i < s.size(); i++)
              ~~^~~~~~~~~~
shoes.cpp:33:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (nxt == pos[sz].size())
       ~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 20 / 20
• Subtask 6: 0 / 15