제출 #240848

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
240848		RayaBurong25_1	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1094 ms	25208 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, norp;
	long long cnt = 0;
	std::map<int, std::vector<int> > pos[2];
	for (i = 0; i < s.size(); i++)
	{
		sz = abs(s[i]);
		norp = (s[i] > 0);
		if (pos[norp].find(sz) == pos[norp].end())
			pos[norp][sz] = std::vector<int>();
		pos[norp][sz].push_back(i);
	}
	int nxt;
	std::vector<int> moved;
	int ismoved[200005] = {0};
	for (i = 0; i < s.size(); i++)
	{
		sz = abs(s[i]);
		norp = (s[i] > 0);
		if (ismoved[i])
			continue;
		// printf("%d ", sz);
		nxt = std::upper_bound(pos[!norp][sz].begin(), pos[!norp][sz].end(), i) - pos[!norp][sz].begin();
		if (nxt == pos[!norp][sz].size())
			continue;
		while ((long long) ismoved[pos[!norp][sz][nxt]])
			nxt++;
		// printf("%d ", pos[sz][nxt]);
		cnt += (pos[!norp][sz][nxt] - i - 1) - (std::upper_bound(moved.begin(), moved.end(), pos[!norp][sz][nxt]) - std::upper_bound(moved.begin(), moved.end(), i));
		// printf("%d ", (s[i] > 0));
		cnt += (s[i] > 0);
		moved.insert(std::upper_bound(moved.begin(), moved.end(), pos[!norp][sz][nxt]), pos[!norp][sz][nxt]);
		ismoved[pos[!norp][sz][nxt]] = 1;
		// printf("%lld\n", cnt);
	}
	return cnt;
}

컴파일 시 표준 에러 (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:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (i = 0; i < s.size(); i++)
              ~~^~~~~~~~~~
shoes.cpp:35:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (nxt == pos[!norp][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