제출 #231121

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
231121		peijar	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	5 ms	256 KiB

shoes

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

#define SZ(v) ((int)(v).size())
using ll = long long;

ll count_swaps(vector<int> shoes)
{
	int nb_chaussures = SZ(shoes);

	ll nb_swaps(0);
	for (int i(1); i < nb_chaussures; ++i)
	{
		cout << i << endl;
		for (int j(0); j < i; ++j)
			if (shoes[i] + shoes[j] == 0)
			{
				int cur = i;
				while (cur > j+1)
				{
					swap(shoes[cur], shoes[cur-1]);
					cerr << "Swapping " << shoes[cur-1] << ' ' << shoes[cur] << endl;
					--cur;
					++nb_swaps;
				}
				if (shoes[j] > 0)
				{
					++nb_swaps;
					cerr << "Last Swapping " << shoes[j] << ' ' << shoes[j+1] << endl;
					swap(shoes[j], shoes[j+1]);
				}
				shoes[j] = shoes[j+1] = 0;
				break;
			}
	}
	return nb_swaps;
}

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