Submission #826837

#	Time	Username	Problem	Language	Result	Execution time	Memory
826837		vjudge1	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1085 ms	2644 KiB

shoes

#include <bits/stdc++.h>
#define ll long long
#define forn(j, i, n) for(int i = j; i <= n; ++i)
#define FOR(j, i, n) for(int i = j; i < n; ++i)
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(), v.end()

using namespace std;


long long count_swaps(std::vector<int> s)
{
	int n = s.size()/2;
	vector <int> del(2*n, 0);
	ll ans = 0;
	FOR(0, i, 2*n)
	{
		if(del[i]) continue;
		int deleted = 0;
		FOR(i + 1, j, 2*n)
		{
			if(del[j])
			{
				deleted++;
				continue;
			}
			if(s[i] == -s[j])
			{
				ans += j - i - deleted - (s[i] < 0);
				del[j] = 1;
				break;
			}
		}
	}
	return ans;
}

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