제출 #921798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921798		Nurislam	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	1 ms	348 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace std;
using namespace __gnu_pbds;

#define order_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
long long count_swaps(std::vector<int> a) {
	int n = a.size();
	int la[n*2]{};
	int b[n+1]{};
	for(int i = n*2-1; i >= 0; i--){
		if(b[abs(a[i])] == 0)b[abs(a[i])] = i;
		else{
			la[i] = b[abs(a[i])];
			b[abs(a[i])] = 0;
		}
	}
	order_set st;
	int ans = 0, us[n*2]{};
	for(int i = 0; i < n*2; i++){
		if(us[i]){
			st.erase(i);
			continue;
		}
		int r = st.order_of_key(la[i]);
		ans += la[i]-i-1-r;
		st.insert(la[i]);
		us[la[i]]++;
	}
	int us2[n*2]{};
	for(int i = 0; i < n*2; i++){
		if(us2[i])continue;
		us2[la[i]]++;
		ans += (a[i] > 0);
	}
	return ans;
}

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