Submission #1341577

#	Time	Username	Problem	Language	Result	Execution time	Memory
1341577		vjudge1	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	7 ms	452 KiB

shoes

#include <iostream>
#include <vector>

using namespace std;
int seen[1<<20];
vector<int> vec[1<<20];

long long count_swaps(vector<int> v){
	long long n = v.size() / 2, ans = 0;
	
	for (int i=0;i<n+n;i++){
		int s = abs(v[i]);
		if (vec[s].size() == 0 or v[vec[s].back()] == v[i])
			vec[s].push_back(i);
		else{
			int j = vec[s].back();
			for (int k=j+1;k<i;k++){
				if (!(seen[k] and seen[k] <= j))
					ans++;
			}
			seen[i] = j + 1;
			if (v[i] < 0)
				ans++;
			vec[s].pop_back();
		}
	}
	return ans;
}

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