제출 #341753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341753		ogibogi2004	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	103 ms	43500 KiB

shoes

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll MAXN=1e5+6;
ll fen[MAXN];
void update(ll idx,ll val)
{
	idx++;
	for(;idx<MAXN;idx+=idx&(-idx))
	{
		fen[idx]+=val;
	}
}
ll query(ll idx)
{
	idx++;
	ll ret=0;
	for(;idx>0;idx-=idx&(-idx))
	{
		ret+=fen[idx];
	}
	return ret;
}
multiset<int>shoes[MAXN][2];
bool vis[MAXN];
long long count_swaps(vector<int> s) {
	for(int i=0;i<s.size();i++)
	{
		if(s[i]>0)shoes[s[i]][0].insert(i);
		else shoes[-s[i]][1].insert(i);
	}
	for(int i=0;i<s.size();i++)
	{
		update(i,+1);
	}
	ll ans=0;
	for(int i=0;i<s.size();i++)
	{
		if(vis[i])continue;
		if(s[i]<0)
		{
			ll k=(*shoes[-s[i]][0].begin());
			ans+=query(k)-query(i)-1;
			update(i,+1);
			vis[k]=1;
			update(k+1,-1);
			shoes[-s[i]][0].erase(shoes[-s[i]][0].find(k));
			shoes[-s[i]][1].erase(shoes[-s[i]][1].find(i));
		}
		else
		{
			ll k=(*shoes[s[i]][1].begin());
			ans+=query(k)-query(i);
			update(i,+1);
			update(k+1,-1);
			vis[k]=1;
			shoes[s[i]][1].erase(shoes[s[i]][1].find(k));
			shoes[s[i]][0].erase(shoes[s[i]][0].find(i));
		}
	}
	return ans;
}

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

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

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