제출 #211158

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

shoes

#include<bits/stdc++.h>
#include "shoes.h"
using namespace std;


typedef long long ll;
const ll mod=1e9+7;
const ll maxn=200005;
const ll inf=1e9+7;
queue<ll> m[2][100005];
ll bit[maxn];
inline ll lsb(int x)
{
    return x&(-x);
}
void add(int x,int v)
{
    int cnt=0;
  	while(x<maxn)
    {
        bit[x]+=v;
        x+=lsb(x);
      	cnt++;
      	assert(cnt<=30);
    }

}
ll query(ll x)
{
    assert(x>=0);
    ll res=0;
  	int cnt=0;
    while(x)
    {
        res+=bit[x];
        x-=lsb(x);
      	cnt++;
      	//assert(cnt<=10);
    }
    return res;
}
ll count_swaps(std::vector<int> s)
{
    for(int i=0;i<s.size();i++)
    {
        bool x=0;
        if(s[i]<0)
        {
            x=1;
            m[x][-s[i]].push(i);
        }
        else m[x][s[i]].push(i);
        add(i+1,1);
    }
    ll sum=0;
    for(int i=0;i<s.size();i++)
    {
        bool x=(s[i]<0);
        s[i]=abs(s[i]);
        queue<ll> q=m[!x][s[i]];
        if(q.empty()) continue;
        if(m[x][s[i]].front()!=i) continue;
        //assert(m[s[i]].size()==m[-s[i]].size());
        ll p=q.front();
        m[x][s[i]].pop();
        m[!x][s[i]].pop();
        sum+=query(p)-query(i+1);
        if(!x) sum++;
        //cout<<i<<" "<<sum<<"\n";
        add(p+1,-1);
        add(i+1,-1);
        //if(i>50000) assert(0);
    }



    return sum;
}

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

shoes.cpp: In function 'll count_swaps(std::vector<int>)':
shoes.cpp:44:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<s.size();i++)
                 ~^~~~~~~~~
shoes.cpp:56:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     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