제출 #289841

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

shoes

#include "shoes.h"
#include  <bits/stdc++.h>
using namespace std;
long long op[100000],tree[300000];
unordered_map<int,int>p;
vector<int>lft;
void build(int id,int l,int r){
	if(l==r){
		tree[id]=1;
		return;
	}
	build(id*2,l,(l+r)/2);
	build(id*2+1,(l+r)/2+1,r);
	tree[id]=tree[id*2]+tree[id*2+1];
}
long long query(int id,int l,int r,int L,int R){
	if(r<L || R<l){
		return (long long)0;
	}
	if(L<=l && r<=R){
		return (long long)tree[id];
	}
	return query(id*2,l,(l+r)/2,L,R)+query(id*2+1,(l+r)/2+1,r,L,R);
}
void update(int id,int l,int r,int index){
	if(l==r){
		tree[id]=0;
		return;
	}
	if(index<=(l+r)/2){
		update(id*2,l,(l+r)/2,index);
	}
	else update(id*2+1,(l+r)/2+1,r,index);
	tree[id]=tree[id*2]+tree[id*2+1];
}
long long count_swaps(vector<int> s) {
	int n=s.size();
	for(int i=0;i<s.size();i++){
		if(p[-s[i]]!=0){
			op[p[-s[i]]-1]=i;
			p[-s[i]]=0;
		}
		else{
			p[s[i]]=i+1;
			lft.push_back(i);	
		} 
	}
	long long ans=0;
	build(1,0,n-1);
	for(int i=0;i<lft.size();i++){
		int l=lft[i],r=op[lft[i]];
		if(s[l]>0) ans++;
		ans+=(query(1,0,n-1,l,r));
		ans-=2;
		update(1,0,n-1,r);
	}
	return ans;
}

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

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