Submission #936858

#	Time	Username	Problem	Language	Result	Execution time	Memory
936858		4QT0R	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	71 ms	134996 KiB

shoes

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

queue<pair<int,int>> pos[200004];

ll count_swaps(vector<int> S){
	ll n=S.size(),open=0,odp=0;
	for (int i = 0; i<n; i++){
		if (S[i]>0){
			if (pos[S[i]+100000].empty()){
				pos[S[i]].push({i,open});
				open++;
			}
			else{
				odp+=i-pos[S[i]+100000].front().first-1;
				open--;
				odp-=open-pos[S[i]+100000].front().second;
				pos[S[i]+100000].pop();
			}
		}
		else{
			if (pos[-S[i]].empty()){
				pos[100000-S[i]].push({i,open});
				open++;
			}
			else{
				odp+=i-pos[-S[i]].front().first;
				open--;
				odp-=open-pos[-S[i]].front().second;
				pos[-S[i]].pop();
			}
		}
	}
	return odp;
}

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