제출 #294906

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
294906		theStaticMind	Arranging Shoes (IOI19_shoes)	C++14	45 / 100	183 ms	22520 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

long long count_swaps(std::vector<int> s) {
	int n = s.size();
	ordered_set S;
	set<int> W[n + 1];
	vector<int> p(n + 1, 0);

	for(int i = 0; i < n; i++){
		p[i+1] = p[i];
		if(s[i] > 0) S.insert(i), W[s[i]].insert(i);
		else p[i+1]++;
	}

	long long cnt = 0;
	for(int i = 0; i < n; i++){
		if(s[i] > 0) continue;
		cnt += S.order_of_key(i);
		cnt += S.order_of_key(*W[-s[i]].begin());
		cnt += max(0, p[*W[-s[i]].begin()+1] - p[i+1]);
		S.erase(*W[-s[i]].begin());
		W[-s[i]].erase(W[-s[i]].begin());
	}
	return cnt;
}

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