Submission #1224786

#	Time	Username	Problem	Language	Result	Execution time	Memory
1224786		adiat	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	0 ms	328 KiB

shoes

#include<bits/stdc++.h>
using namespace std;
#include "shoes.h"
long long count_swaps(std::vector<int> s) {
	long long ans=0;
	map<int , queue<int>> q;
	int n=s.size();
	for(int i=0; i<n; i++)
	{
		q[s[i]].push(i);
	}
	int c=-1;
	for(int i=0; i<n; i++)
	{
		if(i%2==0)
		{
			if(s[i]<0)
			{
				c=s[i];
				q[s[i]].pop();
				continue;
			}
			else
			{
				ans+=(q[-s[i]].front()-i);
				i++;
				q[-s[i]].pop();
			}
		}
		else
		{
			ans+=(q[-c].front()-i);
			q[-c].pop();
		}
	}
	return ans;
	
}
//#include "shoes.h"
//#include <cstdio>
//#include <cassert>
//
//using namespace std;
//
//int main() {
//	int n;
//	assert(1 == scanf("%d", &n));
//	vector<int> S(2 * n);
//	for (int i = 0; i < 2 * n; i++)
//		assert(1 == scanf("%d", &S[i]));
//	fclose(stdin);
//
//	long long result = count_swaps(S);
//
//	printf("%lld\n", result);
//	fclose(stdout);
//	return 0;
//}

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