제출 #317990

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
317990		Drew_	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	124 ms	71696 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

int const N = 1e5 + 7;
int bit[2*N] = {};

void add(int x, int val)
{
	x++;
	while (x < 2*N)
		bit[x] += val, x += (x & -x);
}

int sum(int x)
{
	x++;
	int res = 0;
	while (x)
		res += bit[x], x -= (x & -x);
	return res;
}

queue<int> q[N];
bool type[N]; //false: left, true: right

long long count_swaps(std::vector<int> s)
{
	long long res = 0;
	for (int i = 0; i < s.size(); ++i)
	{
		if (q[abs(s[i])].empty() || !type[abs(s[i])] && s[i] < 0 || type[abs(s[i])] && s[i] > 0)
		{
			q[abs(s[i])].push(i);
			if (s[i] < 0) type[abs(s[i])] = false;
			else type[abs(s[i])] = true;
		}
		else
		{
			int target = q[abs(s[i])].front();
			q[abs(s[i])].pop();
		
			//cout << i << " -> " << target << ", shifted: " << sum(target) << ", cost: " << i - target - sum(target) << '\n';

			res += i - target - sum(target);
			if (s[i] > 0) res--;

			add(target, 1);
			add(i, -1);
		}
	}
	return res;
}

컴파일 시 표준 에러 (stderr) 메시지

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for (int i = 0; i < s.size(); ++i)
      |                  ~~^~~~~~~~~~
shoes.cpp:32:48: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   32 |   if (q[abs(s[i])].empty() || !type[abs(s[i])] && s[i] < 0 || type[abs(s[i])] && s[i] > 0)
      |                               ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
shoes.cpp:32:79: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   32 |   if (q[abs(s[i])].empty() || !type[abs(s[i])] && s[i] < 0 || type[abs(s[i])] && s[i] > 0)
      |                                                               ~~~~~~~~~~~~~~~~^~~~~~~~~~~

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