제출 #644402

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

shoes

#include "shoes.h"
#include<bits/stdc++.h>

using namespace std;

int N;

void change(int index, int delta, int BIT[]){
    for(; index <N; index += (index&(-index))){
        BIT[index]+=delta;
    }
}

int query(int index, int BIT[]){
    int ans = 0;
    for(; index > 0; index -= (index&(-index))) ans+= BIT[index];
    return ans;
}

long long count_swaps(vector<int> s) {
    map<int, vector<int>> M;
    N = s.size()+1;
    int BIT[N];
    memset(BIT, 0, sizeof(BIT));
    for(int i = 1; i < N; ++i) change(i, 1, BIT);
    long long ans = 0;
    for(int i = 0; i < s.size(); ++i){
        //cout << i << " " << ans << endl;
        if(M.find(-s[i]) == M.end()){
            if(M.find(s[i]) == M.end()){
                M[s[i]] = {i};
            }
            else if(M[s[i]].empty()){
                M[s[i]] = {i};
            }
            else{
                M[s[i]].push_back(i);
            }
        }
        else if(M[-s[i]].empty()){
            if(M.find(s[i]) == M.end()){
                M[s[i]] = {i};
            }
            else if(M[s[i]].empty()){
                M[s[i]] = {i};
            }
            else{
                M[s[i]].push_back(i);
            }
        }
        else{
            if(s[i] < 0) ans++;
            //cout << "a ";
            int prev = M[-s[i]].back();
            //cout <<"b ";
            M[-s[i]].pop_back();
            //cout <<"c ";
            ans += (long long)query(i, BIT)-(long long)query(prev+1, BIT);
            //cout <<"d ";
            change(i+1, -1, BIT);
            //cout << "e ";
            change(prev+1, 1, BIT);
        }

    }
	return ans;
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:27:22: 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){
      |                    ~~^~~~~~~~~~

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