제출 #157622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
157622		gurkot	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	464 ms	343948 KiB

shoes

#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;

long long noneg,k,b[1000005],curindex,cursum,n,a[1000005];

queue<long long>q[500005];
vector<long long>s;

void update(int ind,int value) { 
 for(int i=ind; i<=n; i+=i&(-i))
   b[i]+=value;
}
 
int curs(int ind1) {
 cursum=0;
 for(int i=ind1; i>=1; i-=i&(-i))
  cursum+=b[i];
  
 return  cursum;
}

long long count_swaps(std:: vector<int>s) { // *** !
 int k;
 long long ans=0; //***
 noneg=100005; n=s.size();
 
 for(k=0; k<s.size(); k++) a[k+1]=s[k]; 
 
 for(k=1;k<=n;k++)  update(k,1);
 
 for(k=1; k<=n; k++) 
  if(q[a[k]+noneg].size()>0) {
   curindex=q[a[k]+noneg].front();
   q[a[k]+noneg].pop();
   ans+=curs(k)-curs(curindex)-1;
   
   if(a[k]<0) ans++;
   
   update(k,-1);   
   update(curindex,1);
   
  } else q[a[k]*(-1)+noneg].push(k);
 
 
 return ans;
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:30:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(k=0; k<s.size(); k++) a[k+1]=s[k]; 
           ~^~~~~~~~~

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