제출 #623365

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

shoes

//
//  main.cpp
//
//  Created by Panagiotis Chadjicostas on
//  Copyright © Panagiotis Hadjicostas. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
#define fo(i,a,b) for(int i = a; i<=b; i++)
#define f(i,b) for(int i=0;i<b;i++)
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);
void checker(){
    ll n=rand()%20+2;
    vi a(n,ll());
    for(ll i=0;i<n;i++){
        a[i]=rand()%20+2;
    }
    for(ll b=0;b<(1<<n);b++){
        vi on,off;
        for(ll i=0;i<n;i++){
            if(i&(1<<i)){
                on.push_back(i);
            }
            else{
                off.push_back(i);
            }
        }
    }
}
///////////////////////////////////////////////////////////////////////

struct shoes{
    int s;
    bool r;
}A[100000];
vector<vi> d(100000,vi()),a(100000,vi());
vi P(100000,ll());

vi seg(4*100001,0);

void update (ll qs,ll qe,ll s,ll e, ll idx){
    if(s>qe||e<qs)return;
    if(s==e){
        seg[idx]^=1;
        return;
    }
    ll m=(s+e)>>1;
    update(qs,qe,ls);
    update(qs,qe,rs);
    seg[idx]=seg[idx<<1]+seg[idx<<1|1];
}
ll query(ll qs,ll qe,ll s,ll e,ll idx){
    if(s>qe||e<qs)return 0;
    if(qs<=s&&e<=qe){
        return seg[idx];
    }
    
    ll m=(s+e)>>1;
    return query(qs,qe,ls)+query(qs,qe,rs);
}
long long count_swaps(vector <int> S) {
    ll n=S.size();
    for(ll i=0;i<n;i++){
        A[i].s=abs(S[i]);
        A[i].r=(S[i]>0);
        if(A[i].r){
            d[A[i].s].push_back(i);
        }
        else
            a[A[i].s].push_back(i);
    }
    vi V(n,0);
    ll ans=0;
    for(ll i=1;i<=n;i++){
        for(ll j=0;j<a[i].size();j++){
            if(a[i][j]>d[i][j]){
                ans++;
                swap(a[i][j],d[i][j]);
                A[a[i][j]].r=1;
                A[d[i][j]].r=0;
            }
            P[a[i][j]]=d[i][j];
        }
    }
    
    for(ll i=0;i<n;i++){
        update(i,i,0,n-1,1);
    }for(ll i=0;i<n;i++){
        ans+=query(i+1,P[i]-1,0,n-1,1);
        update(P[i],P[i],0,n-1,1);
    }

    return ans;
}

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

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

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