Submission #1034520

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034520		ender	Arranging Shoes (IOI19_shoes)	C++17	85 / 100	41 ms	4396 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
 
using namespace std;
 
long long count_swaps(std::vector<int> s) {
 
	if(s.size() > 2000){
 
		long long ans = 0;
	priority_queue<int, vector<int>, greater<int>> l, r;
 
	for(int i = 0; i < (int)s.size(); ++i){
 
		if(s[i] < 0) l.push(i);
		else r.push(i);
 
	}
 
	for(int i = 0; i < (int)s.size(); ++i){
 
		if(i%2 == 0){
 
			if(s[i] > 0){
				
				ans += l.top() - i;
				swap(s[i], s[l.top()]);
				r.pop();
				r.push(l.top());
			} 
 
			l.pop();
 
		}else {
 
			if(s[i] < 0){
 
				ans += r.top() - i;
				swap(s[i], s[r.top()]);	
				l.pop();
				l.push(r.top());
			} 
			
			r.pop();
 
		}
 
	}
 
	return ans;
 
 
	}
 
	long long ans = 0;
 
	for(int i = 0; i < (int)s.size(); i += 2){
 
		if(s[i] < 0){ 
 
			for(int j = i+1; j < (int)s.size(); ++j){
 
				if(s[j] == -s[i]){
 
					for(int k = j; k > i+1; --k){
 
						swap(s[k], s[k-1]);
						ans++;
 
					}
 
					break;
 
				}
 
			}
 
		}else { 
 
			int target = -s[i];
 
			for(int j = i+1; j < (int)s.size(); ++j){
 
				if(s[j] == target){
 
					for(int k = j; k > i; --k){
 
						swap(s[k], s[k-1]);
						ans++;
 
					}
 
					break;
 
				}
 
			}
 
 
		}
 
	}
	return ans;
}

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