제출 #418889

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
418889		FlippenFaz	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1 ms	332 KiB

shoes

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

using namespace std;
typedef long long ll;

map<ll, queue<int>> shoesList;

ll count_swaps(vector<int> s) {
	ll sum = 0;
	for (unsigned int i = 0; i < s.size(); i++) {
		int pos = i+1;
		if (s[i] > 0) {pos--;}

		cerr << "I: " << i << " SHOE: " << s[i] << endl;
		cerr << "POS OF INVERSE:" << shoesList[-s[i]].front() << endl;

		if (shoesList[-s[i]].size() == 0) {
			shoesList[s[i]].push(pos);
		} else {
			sum += (i - shoesList[-s[i]].front());
			shoesList[-s[i]].pop(); 
		}
	}
	return sum;
}

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