제출 #1152538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1152538		the_coding_pooh	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	1099 ms	71236 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#define uwu return

using namespace std;

const int SIZE = 1e5 + 5;

long long count_inverse(vector <int> vec){
	long long cnt = 0;
	for(int i = 0; i < (int)vec.size(); i++){
		for(int j = 0; j < i; j++){
			cnt += vec[j] > vec[i];
		}
	}
	uwu cnt;
}

deque <int> r_pos[SIZE];

long long count_swaps(vector<int> s) {
	int N = s.size() / 2;
	vector <int> pos(2 * N);
	int ptr = 0;
	for (int i = 0; i < 2 * N; i++){
		if(s[i] > 0)
			r_pos[s[i]].push_back(i);
	}
	for (int i = 0; i < 2 * N; i++){
		if(s[i] < 0){
			pos[i] = 2 * ptr;
			pos[r_pos[-s[i]].front()] = 2 * ptr + 1;
			ptr++;
			r_pos[-s[i]].pop_front();
		}
	}
	uwu count_inverse(pos);
}

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