제출 #847471

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

shoes

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

using namespace std;
using ll = long long;
int Sum[1600005], mid;

void Change(ll p, ll lo, ll hi, ll x) {
	if ( lo== hi) {
		Sum[p] = 1;
		return ;
	}
	mid = (lo + hi)/2;
	if ( x <= mid) Change(2 * p, lo, mid, x);
	else Change(2 * p + 1, mid + 1, hi, x);
	Sum[p] = Sum[2 * p] + Sum[2 * p + 1];
}
ll Find(ll p, ll lo, ll hi, ll st, ll fn) {
	if ( st > hi || lo > fn) return 0;
	if ( st <= lo && hi <= fn) {
		return Sum[p];
	}
	mid = (lo + hi)/2;
	return Find(2 * p, lo, mid, st, fn) + Find(2 * p + 1, mid + 1, hi, st, fn);
}


long long count_swaps(vector<int> s) {
	ll n, i, p, m, I, M;
	n = s.size();
	int Used[100005] = {0};
	queue < int > Left[100002], Right[100002];
	for (i = 0; i < s.size(); i ++) {
		if ( s[i] < 0) {
			Left[-s[i]].push(i);
		}
		else Right[s[i]].push(i);
	}	
	long long ans =0;
	for (i = 0; i < s.size(); i ++) {
		if ( Used[i] == 1) continue;
		I = i + Find(1, 0, n-1, i, n - 1);
		p = s[i];
		if ( p < 0) {
			Left[-p].pop();
			m= Right[-p].front();
			Used[m]= 1;
			M = m +  Find(1, 0, n - 1, m, n - 1);
			ans += (M - I - 1);
			Right[-p].pop();
		}
		else {
			Right[p].pop();
			m= Left[p].front();
			Used[m]= 1;
			M = m +  Find(1, 0, n - 1, m, n - 1);
			ans += (M - I );
			Left[-p].pop();	
		}
		Change(1, 0, n-1, i);
		Change(1, 0, n-1, m);
		
	}
	return ans;
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:33:16: 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]
   33 |  for (i = 0; i < s.size(); i ++) {
      |              ~~^~~~~~~~~~
shoes.cpp:40:16: 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]
   40 |  for (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