제출 #792008

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
792008		APROHACK	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	21 ms	9532 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
int nxt[100005][2];
bool past[100005] ;
int find_next(int k, int positive){
	if(!past[k])return k;
	if(!past[nxt[k][positive]])return nxt[k][positive];
	return nxt[k][positive] = find_next(nxt[k][positive], positive); // siempre tiene que existir.
}

long long count_swaps(std::vector<int> s) {
	ll n = s.size();
	
	int siguiente[n][2]; // 0 negative 1 positive
	
	for(int i = 1 ; i <= n ; i ++){
		siguiente[i][0] = -1;
		siguiente[i][1] = -1;
		nxt[i][0] = -1;
		nxt[i][1] = -1;
	}
	
	for(int i = n-1 ; i >= 0 ; i--){
		nxt[i][0] = siguiente[abs(s[i])][0];
		nxt[i][1] = siguiente[abs(s[i])][1];
		if(s[i] > 0)siguiente[abs(s[i])][1] = i;
		else siguiente[abs(s[i])][0] = i;
	}
	
	memset(past, false, sizeof past);
	ll ans = 0;
	for(int i = 0 ; i < n ; i ++){
		if(past[i] )continue;
		int busca = 1;
		if(s[i] > 0)busca = 0;
		//cout << "buscando para " << i ;
		int k = find_next(nxt[i][busca], busca);
		//cout << " desde " << k << endl;
		for(int j = k-1 ; j > i ; j --){
			if(!past[j])ans ++;
		}
		if(busca == 0)ans ++;
		past[k] = true;
		past[i] = true;
	}
	
	return ans;
}

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