제출 #418890

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

shoes

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

using namespace std;
typedef long long ll;

map<int, queue<int>> shoesList;

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

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

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

컴파일 시 표준 에러 (stderr) 메시지

shoes.cpp: In function 'll count_swaps(std::vector<int>)':
shoes.cpp:12:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  for (ll i = 0; i < s.size(); i++) {
      |                 ~~^~~~~~~~~~

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